Home
last modified time | relevance | path

Searched refs:I1 (Results 1 - 25 of 129) sorted by relevance

123456

/third_party/skia/third_party/externals/libwebp/src/dsp/
H A Dmips_macro.h22 // O0[31..16 | 15..0] = I0[31..16 | 15..0] + I1[31..16 | 15..0]
23 // O1[31..16 | 15..0] = I0[31..16 | 15..0] - I1[31..16 | 15..0]
27 I0, I1) \
28 "addq.ph %[" #O0 "], %[" #I0 "], %[" #I1 "] \n\t" \
29 "subq.ph %[" #O1 "], %[" #I0 "], %[" #I1 "] \n\t"
35 I0, I1) \
37 "lh %[" #O1 "], " #I1 "(%[in]) \n\t"
40 // I1..I9 - offsets in bytes
42 I0, I1, I2, I3, I4, I5, I6, I7, I8, I9) \
43 "ulw %[" #O0 "], " #I1 "
[all...]
/third_party/mesa3d/src/panfrost/bifrost/
H A Dbi_opt_dual_tex.c70 bi_fuse_dual(bi_context *ctx, bi_instr *I1, bi_instr *I2) in bi_fuse_dual() argument
76 .primary_texture_index = I1->texture_index, in bi_fuse_dual()
77 .primary_sampler_index = I1->sampler_index, in bi_fuse_dual()
78 .primary_format = bi_format_for_texs_2d(I1->op), in bi_fuse_dual()
88 assert(I1->lod_mode == I2->lod_mode); in bi_fuse_dual()
93 bi_builder b = bi_init_builder(ctx, bi_before_instr(I1)); in bi_fuse_dual()
96 I1->dest[0], I2->dest[0], bi_null(), /* staging */ in bi_fuse_dual()
97 I1->src[0], I1->src[1], /* coordinates */ in bi_fuse_dual()
98 bi_imm_u32(bi_dual_tex_as_u32(desc)), I1 in bi_fuse_dual()
[all...]
/third_party/typescript/tests/baselines/reference/
H A DinterfaceDeclaration4.js5 export interface I1 { item: string; }
9 class C1 implements Foo.I1 {
14 interface I2 extends Foo.I1 {
19 interface I3 extends Foo.I1 {
23 interface I4 extends Foo.I1 {
37 class C3 implements Foo.I1 { }
40 interface Foo.I1 { }
71 I1;
H A DdeclInput4.js5 export interface I1 {}
11 public m24: I1;
13 public m242(): I1 { return null; }
14 public m26(i:I1) {}
48 interface I1 {
54 m24: I1;
56 m242(): I1;
57 m26(i: I1): void;
H A DdeclInput-2.js5 export interface I1 {}
13 public m24: I1;
16 public m242(): I1 { return null; }
18 public m26(i:I1) {}
59 export interface I1 {
69 m24: I1;
72 m242(): I1;
74 m26(i: I1): void;
H A DexportNonVisibleType.js4 interface I1 {
9 var x: I1 = {a: "test", b: 42};
10 export = x; // Should fail, I1 not exported.
14 interface I1 {
20 m1: I1;
23 export = C1; // Should fail, type I1 of visible member C1.m1 not exported.
26 interface I1 {
32 private m1: I1;
35 export = C1; // Should work, private type I1 of visible class C1 only used in private member m1.
H A DoptionalParamAssignmentCompat.js2 interface I1 {
6 p1: I1;
7 m1(p1?: string): I1;
10 var c: I1 = i2.p1; // should be ok
11 var d: I1 = i2.m1; // should error
H A DoverEagerReturnTypeSpecialization.js4 interface I1<T> {
5 func<U>(callback: (value: T) => U): I1<U>;
8 declare var v1: I1<number>;
9 var r1: I1<string> = v1.func(num => num.toString()) // Correctly returns an I1<string>
12 var r2: I1<number> = v1.func(num => num.toString()) // Correctly returns an I1<string>
19 var r1 = v1.func(function (num) { return num.toString(); }) // Correctly returns an I1<string>
21 var r2 = v1.func(function (num) { return num.toString(); }) // Correctly returns an I1<string>
H A DinterfaceImplementation6.js2 interface I1 {
6 class C1 implements I1 {
10 class C2 implements I1 {
14 class C3 implements I1 {
21 private pt: I1 = { item: 1 };
H A DtypeAssertionsWithIntersectionTypes01.js2 interface I1 {
6 interface I2 extends I1 {
15 var y: I1 & I3 = x;
18 var a = <I1 & I3>z;
21 var d = <I1>y;
H A DincompatibleGenericTypes.js2 interface I1<T> {
4 m1<U>(callback: (p: T) => U): I1<U>;
8 var v1: I1<boolean>;
10 var v2: I1<number> = v1;
H A DtypeAssertionsWithUnionTypes01.js2 interface I1 {
6 interface I2 extends I1 {
12 var z: I1 = x;
17 var d = <I1>y;
H A DcontextualTypeWithUnionTypeMembers.js4 interface I1<T> {
23 var i1: I1<number>;
25 var i1Ori2: I1<number> | I2<number> = i1;
26 var i1Ori2: I1<number> | I2<number> = i2;
27 var i1Ori2: I1<number> | I2<number> = { // Like i1
35 var i1Ori2: I1<number> | I2<number> = { // Like i2
43 var i1Ori2: I1<number> | I2<number> = { // Like i1 and i2 both
53 var arrayI1OrI2: Array<I1<number> | I2<number>> = [i1, i2, { // Like i1
H A DtypeSatisfaction.js2 interface I1 {
12 const t1 = { a: 1 } satisfies I1; // Ok
13 const t2 = { a: 1, b: 1 } satisfies I1; // Error
14 const t3 = { } satisfies I1; // Error
H A DarrayAssignmentTest1.js2 interface I1 {
6 class C1 implements I1 {
32 var i1 : I1 = c1;
39 var arr_i1: I1[] = [];
42 var arr_i1_2: I1[] = [];
47 var i1_error: I1 = []; // should be an error - is
H A DcallSignaturesShouldBeResolvedBeforeSpecialization.js2 interface I1<T> {
4 field1: I1<boolean>;
8 var test: I1<string>;
H A DarrayAssignmentTest2.js2 interface I1 {
6 class C1 implements I1 {
32 var i1 : I1 = c1;
39 var arr_i1: I1[] = [];
42 var arr_i1_2: I1[] = [];
H A DtransitiveTypeArgumentInference1.js2 interface I1<T, U> {
6 var i: I1<boolean, string> = null;
9 constructor(p: I1<boolean, T>) {
H A DequalityWithIntersectionTypes01.js2 interface I1 {
6 interface I2 extends I1 {
15 var y: I1 & I3 = x;
H A DequalityWithUnionTypes01.js2 interface I1 {
6 interface I2 extends I1 {
12 var z: I1 = x;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
H A DHexagonCopyToCombine.cpp91 MachineInstr *findPairable(MachineInstr &I1, bool &DoInsertAtI1,
96 void combine(MachineInstr &I1, MachineInstr &I2,
100 bool isSafeToMoveTogether(MachineInstr &I1, MachineInstr &I2,
261 /// isSafeToMoveTogether - Returns true if it is safe to move I1 next to I2 such
263 bool HexagonCopyToCombine::isSafeToMoveTogether(MachineInstr &I1, in isSafeToMoveTogether() argument
270 // It is not safe to move I1 and I2 into one combine if I2 has a true in isSafeToMoveTogether()
271 // dependence on I1. in isSafeToMoveTogether()
272 if (I2UseReg && I1.modifiesRegister(I2UseReg, TRI)) in isSafeToMoveTogether()
277 // First try to move I2 towards I1. in isSafeToMoveTogether()
279 // A reverse_iterator instantiated like below starts before I2, and I1 in isSafeToMoveTogether()
489 MachineInstr &I1 = *MI++; runOnMachineFunction() local
524 findPairable(MachineInstr &I1, bool &DoInsertAtI1, bool AllowC64) findPairable() argument
573 combine(MachineInstr &I1, MachineInstr &I2, MachineBasicBlock::iterator &MI, bool DoInsertAtI1, bool OptForSize) combine() argument
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
H A DAliasAnalysisEvaluator.cpp141 for (SetVector<Value *>::iterator I1 = Pointers.begin(), E = Pointers.end(); in runInternal()
142 I1 != E; ++I1) { in runInternal()
144 Type *I1ElTy = cast<PointerType>((*I1)->getType())->getElementType(); in runInternal()
148 for (SetVector<Value *>::iterator I2 = Pointers.begin(); I2 != I1; ++I2) { in runInternal()
154 AliasResult AR = AA.alias(*I1, I1Size, *I2, I2Size); in runInternal()
157 PrintResults(AR, PrintNoAlias, *I1, *I2, F.getParent()); in runInternal()
161 PrintResults(AR, PrintMayAlias, *I1, *I2, F.getParent()); in runInternal()
165 PrintResults(AR, PrintPartialAlias, *I1, *I2, F.getParent()); in runInternal()
169 PrintResults(AR, PrintMustAlias, *I1, *I in runInternal()
[all...]
H A DPostDominators.cpp54 bool PostDominatorTree::dominates(const Instruction *I1, in dominates() argument
56 assert(I1 && I2 && "Expecting valid I1 and I2"); in dominates()
58 const BasicBlock *BB1 = I1->getParent(); in dominates()
65 if (isa<PHINode>(I1) && isa<PHINode>(I2)) in dominates()
68 // Loop through the basic block until we find I1 or I2. in dominates()
70 for (; &*I != I1 && &*I != I2; ++I) in dominates()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DAPSInt.h301 static bool isSameValue(const APSInt &I1, const APSInt &I2) { in isSameValue() argument
302 return !compareValues(I1, I2); in isSameValue()
306 static int compareValues(const APSInt &I1, const APSInt &I2) { in compareValues() argument
307 if (I1.getBitWidth() == I2.getBitWidth() && I1.isSigned() == I2.isSigned()) in compareValues()
308 return I1.IsUnsigned ? I1.compare(I2) : I1.compareSigned(I2); in compareValues()
311 if (I1.getBitWidth() > I2.getBitWidth()) in compareValues()
312 return compareValues(I1, I in compareValues()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/MCA/Stages/
H A DInstructionTables.cpp50 for (unsigned I1 = 0; I1 < NumUnits; ++I1) { in execute()
51 unsigned SubUnitIdx = ProcResource.SubUnitsIdxBegin[I1]; in execute()

Completed in 9 milliseconds

123456