| /external/libchrome/sandbox/linux/bpf_dsl/ |
| H A D | codegen_unittest.cc | 264 CodeGen::Node i7 = MakeInstruction(BPF_RET + BPF_K, 1); local
266 CodeGen::Node i5 = MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 1, i6, i7);
314 CodeGen::Node i7 = MakeInstruction(BPF_RET + BPF_K, 1); local
316 CodeGen::Node i5 = MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 1, i6, i7);
|
| /external/v8/test/cctest/compiler/ |
| H A D | test-instruction.cc | 161 int i7 = R.NewInstr(); local
176 CHECK_EQ(b2, R.GetBasicBlock(i7));
|
| H A D | test-run-machops.cc | 4738 Node* i7 = m.Int32Add(i5, i6); local
4740 m.Return(i7);
|
| /external/clang/test/SemaCXX/ |
| H A D | constant-expression.cpp | 54 i7 = itval, member in struct:C
|
| /external/clang/test/CodeGen/ |
| H A D | arm64-arguments.c | 297 int f38_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8, argument
299 // CHECK: define i32 @f38_stack(i32 %i, i32 %i2, i32 %i3, i32 %i4, i32 %i5, i32 %i6, i32 %i7, i32 %i8, i32 %i9, i64 %s1.coerce, i64 %s2.coerce)
308 return s1.i + s2.i + i + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + s1.s + s2.s;
350 int f39_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8, argument
352 // CHECK: define i32 @f39_stack(i32 %i, i32 %i2, i32 %i3, i32 %i4, i32 %i5, i32 %i6, i32 %i7, i32 %i8, i32 %i9, i128 %s1.coerce, i128 %s2.coerce)
361 return s1.i + s2.i + i + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + s1.s + s2.s;
405 int f40_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8, argument
407 // CHECK: define i32 @f40_stack(i32 %i, i32 %i2, i32 %i3, i32 %i4, i32 %i5, i32 %i6, i32 %i7, i32 %i8, i32 %i9, [2 x i64] %s1.coerce, [2 x i64] %s2.coerce)
416 return s1.i + s2.i + i + i2 + i3 + i4 + i5 + i6 + i7 + i8 + i9 + s1.s + s2.s;
460 int f41_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, in argument
517 f42_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9, s42_no_align s1, s42_no_align s2) argument
574 f43_stack(int i, int i2, int i3, int i4, int i5, int i6, int i7, int i8, int i9, s43_with_align s1, s43_with_align s2) argument
598 f40_split(int i, int i2, int i3, int i4, int i5, int i6, int i7, s40_no_align s1, s40_no_align s2) argument
610 f41_split(int i, int i2, int i3, int i4, int i5, int i6, int i7, s41_with_align s1, s41_with_align s2) argument
[all...] |
| /external/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| H A D | is_heap.pass.cpp | 33 int i7[] = {0, 1, 1}; local
40 assert(std::is_heap(i7, i7+3) == (std::is_heap_until(i7, i7+3) == i7+3));
|
| H A D | is_heap_comp.pass.cpp | 34 int i7[] = {0, 1, 1}; local
41 assert(std::is_heap(i7, i7+3, std::greater<int>()) == (std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3));
|
| H A D | is_heap_until.pass.cpp | 33 int i7[] = {0, 1, 1}; local
40 assert(std::is_heap_until(i7, i7+3) == i7+1);
|
| H A D | is_heap_until_comp.pass.cpp | 34 int i7[] = {0, 1, 1}; local
41 assert(std::is_heap_until(i7, i7+3, std::greater<int>()) == i7+3);
|
| /external/elfutils/tests/ |
| H A D | funcretval_test.c | 16 int i6; int i7; int i8; int i9; int i10; } large_struct2_t; member in struct:__anon5811
|