/external/llvm/test/MC/MachO/ |
H A D | relax-jumps.s | 17 L1: label 20 je L1 22 ja L1 24 js L1 26 jns L1
|
H A D | darwin-complex-difference.s | 8 L1: label 11 .long (_c - L0) - (_d - L1) // == (_c - _d) + (L1 - L0)
|
H A D | darwin-x86_64-reloc-offsets.s | 14 L1: label 89 movb $0x12, L1(%rip) 92 movb $0x12, L1 + 1(%rip) 95 movl $0x12345678, L1(%rip) 98 movl $0x12345678, L1 + 1(%rip) 101 movl $0x12345678, L1 + 2(%rip) 104 movl $0x12345678, L1 + 3(%rip) 107 movl $0x12345678, L1 + 4(%rip) 109 movb %al, L1(%rip) 110 movb %al, L1 [all...] |
H A D | relax-recompute-align.s | 32 L1: label 34 jl L1
|
H A D | reloc.s | 35 .long L1 39 L1: label 42 jmp L1
|
H A D | darwin-x86_64-diff-relocs.s | 32 // jmp L1 39 // jmp _g1 - L1 42 // jmp L1 - _g0 63 movl %eax,L1(%rip) 70 // movl %eax,_g1 - L1(%rip) 71 // movl %eax,L1 - _g0(%rip) 88 L1: label 109 .quad L1 112 .quad L1 - _g0 113 .quad L1 [all...] |
H A D | darwin-x86_64-reloc.s | 27 leaq L1(%rip), %rax 35 .quad L1 40 .quad _foo - L1 41 L1: label 42 .quad L1 - _prev 49 .quad L1
|
H A D | reloc-pcrel.s | 47 L1: label
|
H A D | x86_32-symbols.s | 7 L1: label
|
H A D | x86_64-symbols.s | 7 L1: label
|
/external/clang/include/clang/Basic/ |
H A D | Linkage.h | 62 static inline Linkage minLinkage(Linkage L1, Linkage L2) { argument 63 return L1 < L2? L1 : L2;
|
/external/clang/test/CodeGen/ |
H A D | indirect-goto.c | 4 void *addrs[] = { &&L1, &&L2, &&L3, &&L4, &&L5 }; 12 L1: res *= 2; 17 static const void *addrs[] = { &&L1, &&L2, &&L3, &&L4, &&L5 }; 25 L1: res *= 2;
|
/external/llvm/test/MC/ARM/ |
H A D | hilo-16bit-relocations.s | 5 movw r0, :lower16:(L_foo$non_lazy_ptr - (L1 + 8)) 6 movt r0, :upper16:(L_foo$non_lazy_ptr - (L1 + 8)) 7 L1: label 9 @ CHECK: movw r0, :lower16:(L_foo$non_lazy_ptr-(L1+8)) 10 @ CHECK: movt r0, :upper16:(L_foo$non_lazy_ptr-(L1+8))
|
/external/clang/test/SemaCXX/ |
H A D | return-noreturn.cpp | 34 switch (x) default: L1: L2: case 4: pr6884_abort_struct(); 37 switch (x) default: L1: { L2: case 4: pr6884_abort_struct(); } 40 switch (x) default: L1: L2: case 4: { pr6884_abort_struct(); } 63 switch (x) default: L1: L2: case 4: pr6884_abort_struct(); 67 switch (x) default: L1: { L2: case 4: pr6884_abort_struct(); } 71 switch (x) default: L1: L2: case 4: { pr6884_abort_struct(); } 90 switch (x) default: L1: L2: case 4: pr6884_abort_struct a; 94 switch (x) default: L1: { L2: case 4: pr6884_abort_struct a; } 98 switch (x) default: L1: L2: case 4: { pr6884_abort_struct a; }
|
/external/llvm/test/MC/AsmParser/ |
H A D | exprs.s | 74 jmp L1 76 L1: label 78 .long . - L1
|
/external/dropbear/libtomcrypt/testprof/ |
H A D | store_test.c | 8 ulong32 L, L1; local 16 L1 = 0; 18 LOAD32L(L1, buf + y); 19 if (L1 != L) { 24 LOAD32H(L1, buf + y); 25 if (L1 != L) {
|
/external/clang/test/Sema/ |
H A D | scope-check.c | 126 goto L1; // expected-error {{goto into protected scope}} 129 L1: 158 goto L1; // expected-error {{goto into protected scope}} 160 L1: 184 goto L1; 185 L1: 221 static const void *addrs[] = { &&L1, &&L2 }; 225 L1:
|
H A D | statements.c | 19 int test5() { return ({L1: L2: L3: 5;}); }
|
/external/v8/test/mjsunit/ |
H A D | arguments-opt.js | 34 function L1(a) { function 48 assertEquals(0, L1()); 49 assertEquals(1, L1(1)); 50 assertEquals(2, L1(1,2)); 51 assertEquals(5, L1(1,2,3,4,5));
|
/external/stlport/src/ |
H A D | lock_free_slist.h | 217 L1: mov [ebx], eax // __item._M_next = _M._M_data._M_top 220 jne L1 // Failed, retry! (edx:eax now contain most recent _M_sequence:_M_top) 240 L1: test eax, eax // _M_top == NULL? 245 jne L1 // Failed, retry! (edx:eax now contain most recent _M_sequence:_M_top) 267 L1: test eax, eax // _M_top == NULL? 272 jne L1 // Failed, retry! (edx:eax now contain most recent _M_sequence:_M_top)
|
/external/clang/test/CodeGenCXX/ |
H A D | mangle-local-classes-nested.cpp | 14 void L1() { function
|
/external/clang/test/FixIt/ |
H A D | fixit.c | 66 L1:
|
/external/llvm/include/llvm/ADT/ |
H A D | EquivalenceClasses.h | 217 member_iterator unionSets(member_iterator L1, member_iterator L2) { argument 218 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 219 if (L1 == L2) return L1; // Unifying the same two sets, noop. 221 // Otherwise, this is a real union operation. Set the end of the L1 list to 223 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 232 // L2's leader is now L1. 234 return L1;
|
/external/qemu/distrib/sdl-1.2.12/src/hermes/ |
H A D | mmxp2_32.asm | 72 jnz .L1 75 .L1: 104 jnz .L1 136 jnz .L1 139 .L1: 168 jnz .L1 203 jnz .L1 206 .L1: 239 jnz .L1 308 .L1 [all...] |
H A D | x86p_32.asm | 44 .L1 ; short loop 52 jnz .L1 125 .L1 ; short loop 132 jnz .L1 196 .L1 ; short loop 203 jnz .L1 271 .L1 ; short loop 281 jnz .L1 369 .L1 ; short loop 379 jnz .L1 [all...] |