/external/llvm/lib/Support/ |
ScaledNumber.cpp | 27 uint64_t UL = getU(LHS), LL = getL(LHS), UR = getU(RHS), LR = getL(RHS); 30 uint64_t P1 = UL * UR, P2 = UL * LR, P3 = LL * UR, P4 = LL * LR;
|
/external/compiler-rt/lib/sanitizer_common/tests/ |
sanitizer_format_interceptor_test.cc | 41 static const unsigned LL = sizeof(long long); 115 testScanf("%llu", 1, LL); 116 testScanf("%qd", 1, LL);
|
/external/valgrind/cachegrind/ |
cg_sim.c | 166 static cache_t2 LL; 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/protobuf/src/google/protobuf/ |
wire_format_unittest.cc | 663 #define LL(x) GOOGLE_LONGLONG(x) 692 EXPECT_EQ(ULL(0x000000007FFFFFFE), ZigZagEncode64(LL(0x000000003FFFFFFF))); 693 EXPECT_EQ(ULL(0x000000007FFFFFFF), ZigZagEncode64(LL(0xFFFFFFFFC0000000))); 694 EXPECT_EQ(ULL(0x00000000FFFFFFFE), ZigZagEncode64(LL(0x000000007FFFFFFF))); 695 EXPECT_EQ(ULL(0x00000000FFFFFFFF), ZigZagEncode64(LL(0xFFFFFFFF80000000))); 696 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFE), ZigZagEncode64(LL(0x7FFFFFFFFFFFFFFF))); 697 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFF), ZigZagEncode64(LL(0x8000000000000000))); 703 EXPECT_EQ(LL(0x000000003FFFFFFF), ZigZagDecode64(ULL(0x000000007FFFFFFE))); 704 EXPECT_EQ(LL(0xFFFFFFFFC0000000), ZigZagDecode64(ULL(0x000000007FFFFFFF))); 705 EXPECT_EQ(LL(0x000000007FFFFFFF), ZigZagDecode64(ULL(0x00000000FFFFFFFE))) [all...] |
/external/clang/lib/Edit/ |
RewriteObjCFoundationAPI.cpp | 678 StringRef U, F, L, LL; 714 } else if (Suff::has("ll", text)) { 716 } else if (Suff::has("LL", text)) { 739 Info.LL = *UpperL ? "LL" : "ll"; 882 commit.insert(LitE, LitInfo.LL); [all...] |
/external/clang/test/SemaCXX/ |
cxx1y-generic-lambdas.cpp | 788 auto LL = L(1, 'a', 3.14, "abc"); 789 LL("dim");
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeTypesGeneric.cpp | 518 SDValue LL, LH, RL, RH, CL, CH; 520 GetSplitOp(N->getOperand(1), LL, LH); 534 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), CL, LL, RL); 540 SDValue LL, LH, RL, RH; 542 GetSplitOp(N->getOperand(2), LL, LH); 545 Lo = DAG.getNode(ISD::SELECT_CC, dl, LL.getValueType(), N->getOperand(0), 546 N->getOperand(1), LL, RL, N->getOperand(4));
|
LegalizeIntegerTypes.cpp | [all...] |
LegalizeVectorTypes.cpp | [all...] |
DAGCombiner.cpp | [all...] |
/external/llvm/include/llvm/ADT/ |
ImmutableSet.h | 499 TreeTy *LL = getLeft(L); 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)); [all...] |
/external/opencv/ml/src/ |
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; 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 [all...] |
mltree.cpp | [all...] |
/external/skia/src/effects/ |
SkBlurMaskFilter.cpp | 380 const SkVector& LL = rrect.radii(SkRRect::kLowerLeft_Corner); 382 const SkScalar leftUnstretched = SkTMax(UL.fX, LL.fX) + SkIntToScalar(2 * margin.fX); 396 const SkScalar bottomUnstretched = SkTMax(LL.fY, LR.fY) + SkIntToScalar(2 * margin.fY); 411 radii[SkRRect::kLowerLeft_Corner] = LL; [all...] |
/external/valgrind/callgrind/ |
sim.c | 94 static cache_t2 I1, D1, LL; 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, Write, a, size) [all...] |
/frameworks/rs/driver/ |
rsdRuntimeStubs.cpp | 1060 long2 ll = *c; local 1065 long3 ll = *c; local 1070 long4 ll = *c; local 1075 unsigned long long ll = l; local 1084 ulong2 ll = *c; local 1089 ulong3 ll = *c; local 1094 ulong4 ll = *c; local 1112 long2 ll = *(const long2 *)c; local 1117 long3 ll = *(const long3 *)c; local 1122 long4 ll = *(const long4 *)c; local 1127 ulong2 ll = *(const ulong2 *)c; local 1132 ulong3 ll = *(const ulong3 *)c; local 1137 ulong4 ll = *(const ulong4 *)c; local [all...] |
/external/llvm/lib/Analysis/ |
ValueTracking.cpp | [all...] |
/external/llvm/lib/Target/XCore/ |
XCoreISelLowering.cpp | 676 SDValue LL, RL, AddendL, AddendH; 677 LL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32, 693 AddendL, LL, RL); 701 AddendL, LL, RL); 712 AddendL, LL, RL); 714 RH = DAG.getNode(ISD::MUL, dl, MVT::i32, LL, RH); [all...] |
/external/llvm/lib/Target/SystemZ/ |
SystemZISelLowering.cpp | [all...] |
/external/llvm/lib/Transforms/Vectorize/ |
BBVectorize.cpp | 633 // If this is a trivial offset, then we'll get something like [all...] |
/external/llvm/lib/Target/Mips/ |
MipsISelLowering.cpp | 611 // We'll also ignore MVT::i64 operands as this optimizations proves [all...] |
/external/valgrind/VEX/priv/ |
ir_opt.c | [all...] |
/cts/suite/cts/deviceTests/browserbench/assets/octane/ |
pdfjs.js | [all...] |
/external/zxing/core/ |
core.jar | |
/prebuilts/tools/common/m2/repository/itext/itext/2.0.8/ |
itext-2.0.8.jar | |