| /freebsd-10-stable/lib/libc/i386/string/ |
| H A D | ffs.S | 47 jz L1 /* ZF is set if all bits are 0 */
52 L1: xorl %eax,%eax /* clear result */ label
|
| H A D | bcmp.S | 52 jne L1
58 L1: label
|
| H A D | memchr.S | 51 jnz L1 /* scan failed, return null */
56 L1: xorl %eax,%eax label
|
| H A D | strchr.S | 53 L1: label
59 jne L1
|
| H A D | strrchr.S | 54 L1: label
62 jne L1
|
| H A D | bzero.S | 57 jle L1
76 L1: rep label
|
| H A D | memset.S | 59 jle L1
83 L1: rep label
|
| H A D | strcpy.S | 54 L1: movb (%edx),%al /* unroll loop, but not too much */ label
87 jne L1
|
| H A D | swab.S | 60 L1: lodsw label
65 jnz L1
|
| H A D | wcschr.S | 41 L1: movl (%ecx),%ebx label
62 jmp L1
|
| H A D | wcslen.S | 41 L1: cmpl %ebx,(%ecx) label
59 jmp L1
|
| H A D | strcat.S | 64 L1: movb (%edx),%al /* unroll loop, but not too much */ label
97 jne L1
|
| H A D | strcmp.S | 59 L1: incl %eax label
114 je L1
|
| H A D | strncmp.S | 65 L1: incl %eax label
82 * L1: addl $8,%eax; addl $8,%ecx; subl $8,%edx; cmpl $8,%edx; jae Lx
155 je L1
|
| /freebsd-10-stable/contrib/llvm/tools/clang/include/clang/Basic/ |
| H A D | Linkage.h | 93 inline Linkage minLinkage(Linkage L1, Linkage L2) { argument
95 std::swap(L1, L2);
96 if (L1 == VisibleNoLinkage) {
102 return L1 < L2 ? L1 : L2;
|
| /freebsd-10-stable/lib/libc/amd64/string/ |
| H A D | bcmp.S | 15 jne L1
21 L1: label
|
| H A D | bzero.S | 24 jb L1
39 L1: movq %rsi,%rcx /* zero remainder by bytes */ label
|
| H A D | memset.S | 28 jle L1
56 L1: rep label
|
| /freebsd-10-stable/sys/boot/arm/ixp425/boot2/ |
| H A D | arm_init.S | 36 .L1:
39 bgt .L1
|
| /freebsd-10-stable/lib/libc/arm/sys/ |
| H A D | sbrk.S | 59 .L1:
85 .word _GLOBAL_OFFSET_TABLE_ - (.L1+4)
|
| H A D | brk.S | 60 .L1:
95 .word _GLOBAL_OFFSET_TABLE_ - (.L1+4)
|
| /freebsd-10-stable/libexec/rtld-elf/arm/ |
| H A D | rtld_start.S | 47 .L1:
67 .word _GLOBAL_OFFSET_TABLE_ - (.L1+8)
|
| /freebsd-10-stable/contrib/llvm/include/llvm/ADT/ |
| H A D | EquivalenceClasses.h | 219 member_iterator unionSets(member_iterator L1, member_iterator L2) { argument
220 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!");
221 if (L1 == L2) return L1; // Unifying the same two sets, noop.
223 // Otherwise, this is a real union operation. Set the end of the L1 list to
225 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node;
234 // L2's leader is now L1.
236 return L1;
|
| /freebsd-10-stable/sys/dev/ath/ath_hal/ar5212/ |
| H A D | ar5212_rfgain.c | 126 uint32_t L1, L2, L3, L4; local
130 L1 = 0;
142 L1 = 0;
144 L3 = (gStep != 0x3f) ? 0x40 : L1;
147 gv->loTrig = L1 + (gStep == 0x3f ? DYN_ADJ_LO_MARGIN : 0);
153 return !((g >= L1 && g<= L2) || (g >= L3 && g <= L4));
|
| /freebsd-10-stable/lib/csu/ia64/ |
| H A D | crt1.S | 82 (p6) br.dpnt .L1
96 (p7) br.dptk .L1
104 .L1:
|