Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:L1 (Results 276 - 300 of 584) sorted by null

<<11121314151617181920>>

/toolchain/binutils/binutils-2.27/gas/testsuite/gas/mips/
lineno.s	32 b $L1 33 $L1:
r6-64-n32.d	40 [ ]*70: R_MIPS_PC19_S2 \.L1.1 48 [ ]*84: R_MIPS_PC18_S3 \.L1.1 50 [ ]*88: R_MIPS_PC18_S3 \.L1.1
/toolchain/binutils/binutils-2.27/gas/testsuite/gas/mn10300/
relax.s	8 .L1: 15 ble .L1
/toolchain/binutils/binutils-2.27/ld/testsuite/ld-m68hc11/
adj-brset.s	12 L1: 14 brclr 20,x,#3,L1
/external/llvm/include/llvm/ADT/
EquivalenceClasses.h	220 member_iterator unionSets(member_iterator L1, member_iterator L2) { 221 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 222 if (L1 == L2) return L1; // Unifying the same two sets, noop. 224 // Otherwise, this is a real union operation. Set the end of the L1 list to 226 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 235 // L2's leader is now L1. 237 return L1;
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
EquivalenceClasses.h	217 member_iterator unionSets(member_iterator L1, member_iterator L2) { 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;
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
EquivalenceClasses.h	222 member_iterator unionSets(member_iterator L1, member_iterator L2) { 223 assert(L1 != member_end() && L2 != member_end() && "Illegal inputs!"); 224 if (L1 == L2) return L1; // Unifying the same two sets, noop. 226 // Otherwise, this is a real union operation. Set the end of the L1 list to 228 const ECValue &L1LV = *L1.Node, &L2LV = *L2.Node; 237 // L2's leader is now L1. 239 return L1;
/prebuilts/go/darwin-x86/src/math/
log.go	42 // R(z) ~ L1*s +L2*s +L3*s +L4*s +L5*s +L6*s +L7*s 43 // (the values of L1 to L7 are listed in the program) and 45 // | L1*s +...+L7*s - R(z) | <= 2 86 L1 = 6.666666666666735130e-01 /* 3FE55555 55555593 */ 118 t1 := s2 * (L1 + s4*(L3+s4*(L5+s4*L7)))
asin_s390x.s	67 L1: 86 BVS L1 88 BR L1 134 BLE L1 155 BR L1
log_s390x.s	116 BGT L1 160 L1: 166 BGE L1 167 BVS L1 171 BR L1
/prebuilts/go/linux-x86/src/math/
log.go	42 // R(z) ~ L1*s +L2*s +L3*s +L4*s +L5*s +L6*s +L7*s 43 // (the values of L1 to L7 are listed in the program) and 45 // | L1*s +...+L7*s - R(z) | <= 2 86 L1 = 6.666666666666735130e-01 /* 3FE55555 55555593 */ 118 t1 := s2 * (L1 + s4*(L3+s4*(L5+s4*L7)))
/toolchain/binutils/binutils-2.27/gas/testsuite/gas/m68hc11/
indexed12.s	10 ldab L1-_main,x ; Offset/const of these 2 insns must be 11 ldaa #L1-_main ; identical (likewise for 2nd global check) 13 ldaa L2-L1,x ; -> ldaa 2,x (5-bit offset), text seg 14 adda L1-L2,y ; -> adda -2,y (5-bit offset), text seg 67 ldab L1-_main,x 68 ldaa #L1-_main 73 L1:

Completed in 1434 milliseconds

<<11121314151617181920>>