/external/compiler-rt/lib/sanitizer_common/tests/ |
H A D | sanitizer_format_interceptor_test.cc | 41 static const unsigned LL = sizeof(long long); variable 115 testScanf("%llu", 1, LL); 116 testScanf("%qd", 1, LL);
|
/external/llvm/lib/Support/ |
H A D | ScaledNumber.cpp | 28 uint64_t UL = getU(LHS), LL = getL(LHS), UR = getU(RHS), LR = getL(RHS); local 31 uint64_t P1 = UL * UR, P2 = UL * LR, P3 = LL * UR, P4 = LL * LR;
|
/external/eigen/unsupported/Eigen/CXX11/src/Tensor/ |
H A D | TensorUInt128.h | 76 template <typename HL, typename LL, typename HR, typename LR> 78 bool operator == (const TensorUInt128<HL, LL>& lhs, const TensorUInt128<HR, LR>& rhs) 83 template <typename HL, typename LL, typename HR, typename LR> 85 bool operator != (const TensorUInt128<HL, LL>& lhs, const TensorUInt128<HR, LR>& rhs) 90 template <typename HL, typename LL, typename HR, typename LR> 92 bool operator >= (const TensorUInt128<HL, LL>& lhs, const TensorUInt128<HR, LR>& rhs) 100 template <typename HL, typename LL, typename HR, typename LR> 102 bool operator < (const TensorUInt128<HL, LL>& lhs, const TensorUInt128<HR, LR>& rhs) 110 template <typename HL, typename LL, typename HR, typename LR> 112 TensorUInt128<uint64_t, uint64_t> operator + (const TensorUInt128<HL, LL> 165 acc >>= 32LL; local [all...] |
/external/skia/third_party/lua/src/ |
H A D | lobject.c | 244 #define LL(x) (sizeof(x)/sizeof(char) - 1) macro 266 addstr(out, RETS, LL(RETS)); 267 bufflen -= LL(RETS); 273 addstr(out, PRE, LL(PRE)); /* add prefix */ 274 bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ 282 addstr(out, RETS, LL(RETS)); 284 memcpy(out, POS, (LL(POS) + 1) * sizeof(char));
|
/external/syslinux/com32/lua/src/ |
H A D | lobject.c | 244 #define LL(x) (sizeof(x)/sizeof(char) - 1) macro 266 addstr(out, RETS, LL(RETS)); 267 bufflen -= LL(RETS); 273 addstr(out, PRE, LL(PRE)); /* add prefix */ 274 bufflen -= LL(PRE RETS POS) + 1; /* save space for prefix+suffix+'\0' */ 282 addstr(out, RETS, LL(RETS)); 284 memcpy(out, POS, (LL(POS) + 1) * sizeof(char));
|
/external/valgrind/cachegrind/ |
H A D | cg_sim.c | 166 static cache_t2 LL; variable 174 cachesim_initcache(LLc, &LL); 183 if (cachesim_ref_is_miss(&LL, a, size)) 198 UInt LL_set = block & LL.sets_min_1; 200 // can use block as tag as L1I and LL cache line sizes are equal 201 if (cachesim_setref_is_miss(&LL, LL_set, block)) 212 if (cachesim_ref_is_miss(&LL, a, size)) 219 * Does this Ir only touch one cache line, and are L1I/LL cache 228 if (I1.line_size_bits != LL.line_size_bits) return False;
|
/external/clang/test/CodeGen/ |
H A D | xcore-stringtype.c | 33 long long LL, unsigned long long ULL, signed long long SLL, 30 builtinType(_Bool B, char C, unsigned char UC, signed char SC, short S, unsigned short US, signed short SS, int I, unsigned int UI, signed int SI, long L, unsigned long UL, signed long SL, long long LL, unsigned long long ULL, signed long long SLL, float F, double D, long double LD) argument
|
/external/protobuf/src/google/protobuf/ |
H A D | wire_format_unittest.cc | 667 #define LL(x) GOOGLE_LONGLONG(x) macro 696 EXPECT_EQ(ULL(0x000000007FFFFFFE), ZigZagEncode64(LL(0x000000003FFFFFFF))); 697 EXPECT_EQ(ULL(0x000000007FFFFFFF), ZigZagEncode64(LL(0xFFFFFFFFC0000000))); 698 EXPECT_EQ(ULL(0x00000000FFFFFFFE), ZigZagEncode64(LL(0x000000007FFFFFFF))); 699 EXPECT_EQ(ULL(0x00000000FFFFFFFF), ZigZagEncode64(LL(0xFFFFFFFF80000000))); 700 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFE), ZigZagEncode64(LL(0x7FFFFFFFFFFFFFFF))); 701 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFF), ZigZagEncode64(LL(0x8000000000000000))); 707 EXPECT_EQ(LL(0x000000003FFFFFFF), ZigZagDecode64(ULL(0x000000007FFFFFFE))); 708 EXPECT_EQ(LL(0xFFFFFFFFC0000000), ZigZagDecode64(ULL(0x000000007FFFFFFF))); 709 EXPECT_EQ(LL( [all...] |
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypesGeneric.cpp | 442 SDValue LL, LH, RL, RH, CL, CH; local 444 GetSplitOp(N->getOperand(1), LL, LH); 460 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), CL, LL, RL); 466 SDValue LL, LH, RL, RH; local 468 GetSplitOp(N->getOperand(2), LL, LH); 471 Lo = DAG.getNode(ISD::SELECT_CC, dl, LL.getValueType(), N->getOperand(0), 472 N->getOperand(1), LL, RL, N->getOperand(4));
|
/external/clang/lib/Edit/ |
H A D | RewriteObjCFoundationAPI.cpp | 678 StringRef U, F, L, LL; member in struct:__anon1302::LiteralInfo 716 } else if (Suff::has("LL", text)) { 739 Info.LL = *UpperL ? "LL" : "ll"; 882 commit.insert(LitE, LitInfo.LL);
|
/external/clang/test/SemaCXX/ |
H A D | cxx1y-generic-lambdas.cpp | 788 auto LL = L(1, 'a', 3.14, "abc"); local 789 LL("dim");
|
H A D | attr-noreturn.cpp | 87 struct LL : KK {}; struct in namespace:destructor_tests 104 LL l; 120 const LL& ll = LL();
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypesGeneric.cpp | 525 SDValue LL, LH, RL, RH, CL, CH; local 527 GetSplitOp(N->getOperand(1), LL, LH); 541 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), CL, LL, RL); 547 SDValue LL, LH, RL, RH; local 549 GetSplitOp(N->getOperand(2), LL, LH); 552 Lo = DAG.getNode(ISD::SELECT_CC, dl, LL.getValueType(), N->getOperand(0), 553 N->getOperand(1), LL, RL, N->getOperand(4));
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | ValueTracking.cpp | 610 Value *LL = LU->getOperand(0); local 613 if (LL == I) 616 L = LL;
|
/external/llvm/include/llvm/ADT/ |
H A D | ImmutableSet.h | 499 TreeTy *LL = getLeft(L); local 502 if (getHeight(LL) >= getHeight(LR)) 503 return createNode(LL, L, createNode(LR,V,R)); 510 return createNode(createNode(LL,L,LRL), LR, createNode(LRR,V,R));
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreISelLowering.cpp | 672 SDValue LL, RL, AddendL, AddendH; local 673 LL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, 689 AddendL, LL, RL); 697 AddendL, LL, RL); 708 AddendL, LL, RL); 710 RH = DAG.getNode(ISD::MUL, dl, MVT::i32, LL, RH);
|
/external/opencv/ml/src/ |
H A D | mlboost.cpp | 578 // LL - number of samples that both the primary and the surrogate splits send to the left 584 double LL = 0, RL = 0, LR, RR; local 603 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value. 612 LL += w; LR -= w; 613 if( LL + RR > best_val && sorted[i].val + epsilon < sorted[i+1].val ) 615 best_val = LL + RR; 643 // LL - number of samples that both the primary and the surrogate splits send to the left
|
H A D | mltree.cpp | 2054 // LL - number of samples that both the primary and the surrogate splits send to the left 2063 int LL = 0, RL = 0, LR, RR; local 2079 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value. 2086 LL++; LR--; 2087 if( LL + RR > _best_val && sorted[i].val + epsilon < sorted[i+1].val ) 2089 best_val = LL + RR; 2107 double LL = 0, RL = 0, LR, RR; local 2128 // now iteratively compute LL, LR, RL and RR for every possible surrogate split value. 2137 LL += w; LR -= w; 2138 if( LL [all...] |
/external/skia/src/effects/ |
H A D | SkBlurMaskFilter.cpp | 528 const SkVector& LL = rrect.radii(SkRRect::kLowerLeft_Corner); local 530 const SkScalar leftUnstretched = SkTMax(UL.fX, LL.fX) + SkIntToScalar(2 * margin.fX); 544 const SkScalar bottomUnstretched = SkTMax(LL.fY, LR.fY) + SkIntToScalar(2 * margin.fY); 559 radii[SkRRect::kLowerLeft_Corner] = LL;
|
/external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
H A D | ImmutableSet.h | 497 TreeTy *LL = getLeft(L); local 500 if (getHeight(LL) >= getHeight(LR)) 501 return createNode(LL, L, createNode(LR,V,R)); 508 return createNode(createNode(LL,L,LRL), LR, createNode(LRR,V,R));
|
/external/swiftshader/third_party/LLVM/lib/Target/XCore/ |
H A D | XCoreISelLowering.cpp | 659 SDValue LL, RL, AddendL, AddendH; local 660 LL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, 676 AddendL, LL, RL); 684 AddendL, LL, RL); 695 AddendL, LL, RL); 697 RH = DAG.getNode(ISD::MUL, dl, MVT::i32, LL, RH);
|
/external/valgrind/callgrind/ |
H A D | sim.c | 94 static cache_t2 I1, D1, LL; variable 234 * Model: single inclusive, 2-level cache hierarchy (L1/LL) 319 if ( cachesim_ref( &LL, a, size) == Hit ) return LL_Hit; 327 if ( cachesim_ref( &LL, a, size) == Hit ) return LL_Hit; 337 * More complex model: L1 Write-through, LL Write-back 427 switch( cachesim_ref_wb( &LL, Read, a, size) ) { 439 switch( cachesim_ref_wb( &LL, Read, a, size) ) { 452 * the write to the LL to make the LL line dirty. 455 cachesim_ref_wb( &LL, Writ [all...] |
/external/llvm/lib/Analysis/ |
H A D | ValueTracking.cpp | 1223 Value *LL = LU->getOperand(0); local 1226 if (LL == I) 1229 L = LL;
|
/external/llvm/lib/Target/Hexagon/ |
H A D | HexagonFrameLowering.cpp | 2010 IndexType LL = I.second; local 2011 if (LL == IndexType::None) 2016 RL.add(LS, LL, false, false); 2018 RL.add(IndexType::Entry, LL, false, false);
|
/external/llvm/lib/Transforms/Vectorize/ |
H A D | BBVectorize.cpp | 2281 std::vector<Value *> &LL = CandidatePairs2[S->second]; local 2282 for (std::vector<Value *>::iterator L = LL.begin(), LE = LL.end();
|