Searched defs:LL (Results 1 - 21 of 21) sorted by path

/external/chromium_org/third_party/protobuf/src/google/protobuf/
H A Dwire_format_unittest.cc584 #define LL(x) GOOGLE_LONGLONG(x) macro
613 EXPECT_EQ(ULL(0x000000007FFFFFFE), ZigZagEncode64(LL(0x000000003FFFFFFF)));
614 EXPECT_EQ(ULL(0x000000007FFFFFFF), ZigZagEncode64(LL(0xFFFFFFFFC0000000)));
615 EXPECT_EQ(ULL(0x00000000FFFFFFFE), ZigZagEncode64(LL(0x000000007FFFFFFF)));
616 EXPECT_EQ(ULL(0x00000000FFFFFFFF), ZigZagEncode64(LL(0xFFFFFFFF80000000)));
617 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFE), ZigZagEncode64(LL(0x7FFFFFFFFFFFFFFF)));
618 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFF), ZigZagEncode64(LL(0x8000000000000000)));
624 EXPECT_EQ(LL(0x000000003FFFFFFF), ZigZagDecode64(ULL(0x000000007FFFFFFE)));
625 EXPECT_EQ(LL(0xFFFFFFFFC0000000), ZigZagDecode64(ULL(0x000000007FFFFFFF)));
626 EXPECT_EQ(LL(
[all...]
/external/chromium_org/third_party/skia/src/effects/
H A DSkBlurMaskFilter.cpp298 const SkVector& LL = rrect.radii(SkRRect::kLowerLeft_Corner); local
300 const SkScalar leftUnstretched = SkTMax(UL.fX, LL.fX) + SkIntToScalar(2 * margin.fX);
314 const SkScalar bottomUnstretched = SkTMax(LL.fY, LR.fY) + SkIntToScalar(2 * margin.fY);
329 radii[SkRRect::kLowerLeft_Corner] = LL;
/external/clang/include/clang/AST/
H A DStmt.h1186 GotoStmt(LabelDecl *label, SourceLocation GL, SourceLocation LL) argument
1187 : Stmt(GotoStmtClass), Label(label), GotoLoc(GL), LabelLoc(LL) {}
/external/clang/lib/Edit/
H A DRewriteObjCFoundationAPI.cpp678 StringRef U, F, L, LL; member in struct:__anon16160::LiteralInfo
716 } else if (Suff::has("LL", text)) {
739 Info.LL = *UpperL ? "LL" : "ll";
882 commit.insert(LitE, LitInfo.LL);
/external/compiler-rt/lib/sanitizer_common/tests/
H A Dsanitizer_scanf_interceptor_test.cc81 const unsigned LL = sizeof(long long); // NOLINT local
93 testScanf("%llu", 1, LL);
/external/dropbear/libtomcrypt/testprof/
H A Dstore_test.c9 ulong64 LL, LL1; local
32 LL = CONST64 (0x01020304050607);
34 STORE64L(LL, buf + y);
36 if (LL1 != LL) {
40 STORE64H(LL, buf + y);
42 if (LL1 != LL) {
/external/llvm/include/llvm/ADT/
H A DImmutableSet.h501 TreeTy *LL = getLeft(L); local
504 if (getHeight(LL) >= getHeight(LR))
505 return createNode(LL, L, createNode(LR,V,R));
512 return createNode(createNode(LL,L,LRL), LR, createNode(LRR,V,R));
/external/llvm/lib/Analysis/
H A DValueTracking.cpp676 Value *LL = LU->getOperand(0); local
679 if (LL == I)
682 L = LL;
/external/llvm/lib/CodeGen/SelectionDAG/
H A DDAGCombiner.cpp1921 if (N1C && N1C->getAPIntValue() == 1LL)
2482 SDValue LL, LR, RL, RR, CC0, CC1; local
2650 if (isSetCCEquivalent(N0, LL, LR, CC0) && isSetCCEquivalent(N1, RL, RR, CC1)){
2655 LL.getValueType().isInteger()) {
2659 LR.getValueType(), LL, RL);
2666 LR.getValueType(), LL, RL);
2673 LR.getValueType(), LL, RL);
2679 if (LL == RR && LR == RL) {
2683 if (LL == RL && LR == RR) {
2684 bool isInteger = LL
3096 SDValue LL, LR, RL, RR, CC0, CC1; local
[all...]
H A DLegalizeIntegerTypes.cpp1906 SDValue LL, LH, RL, RH; local
1907 GetExpandedInteger(N->getOperand(0), LL, LH);
1909 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LL, RL);
1910 Hi = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), LH, RH);
1924 SDValue LL, LH, RL, RH; local
1925 GetExpandedInteger(N->getOperand(0), LL, LH);
1938 Lo = DAG.getNode(ISD::UMUL_LOHI, dl, DAG.getVTList(NVT, NVT), LL, RL);
1944 Lo = DAG.getNode(ISD::MUL, dl, NVT, LL, RL);
1945 Hi = DAG.getNode(ISD::MULHU, dl, NVT, LL, R
[all...]
H A DLegalizeTypesGeneric.cpp484 SDValue LL, LH, RL, RH, CL, CH; local
486 GetSplitOp(N->getOperand(1), LL, LH);
502 Lo = DAG.getNode(N->getOpcode(), dl, LL.getValueType(), CL, LL, RL);
508 SDValue LL, LH, RL, RH; local
510 GetSplitOp(N->getOperand(2), LL, LH);
513 Lo = DAG.getNode(ISD::SELECT_CC, dl, LL.getValueType(), N->getOperand(0),
514 N->getOperand(1), LL, RL, N->getOperand(4));
H A DLegalizeVectorTypes.cpp854 SDValue LL, LH, RL, RH; local
857 LL = DAG.getNode(ISD::EXTRACT_SUBVECTOR, DL, InNVT, N->getOperand(0),
869 Lo = DAG.getNode(N->getOpcode(), DL, LoVT, LL, RL, N->getOperand(2));
/external/llvm/lib/Target/Mips/
H A DMipsISelLowering.cpp923 unsigned LL, SC, AND, NOR, ZERO, BEQ; local
926 LL = IsN64 ? Mips::LL_P8 : Mips::LL;
934 LL = IsN64 ? Mips::LLD_P8 : Mips::LLD;
978 BuildMI(BB, DL, TII->get(LL), OldVal).addReg(Ptr).addImm(0);
1011 unsigned LL = IsN64 ? Mips::LL_P8 : Mips::LL; local
1109 BuildMI(BB, DL, TII->get(LL), OldVal).addReg(AlignedAddr).addImm(0);
1170 unsigned LL, SC, ZERO, BNE, BEQ; local
1173 LL
1253 unsigned LL = IsN64 ? Mips::LL_P8 : Mips::LL; local
[all...]
/external/llvm/lib/Target/XCore/
H A DXCoreISelLowering.cpp622 SDValue LL, RL, AddendL, AddendH; local
623 LL = DAG.getNode(ISD::EXTRACT_ELEMENT, dl, MVT::i32,
639 AddendL, LL, RL);
647 AddendL, LL, RL);
658 AddendL, LL, RL);
660 RH = DAG.getNode(ISD::MUL, dl, MVT::i32, LL, RH);
/external/llvm/lib/Transforms/Vectorize/
H A DBBVectorize.cpp2176 std::vector<Value *> &LL = CandidatePairs2[S->second]; local
2177 for (std::vector<Value *>::iterator L = LL.begin(), LE = LL.end();
/external/opencv/ml/src/
H A Dmlboost.cpp578 // 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 Dmltree.cpp2054 // 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/protobuf/src/google/protobuf/
H A Dwire_format_unittest.cc536 #define LL(x) GOOGLE_LONGLONG(x) macro
565 EXPECT_EQ(ULL(0x000000007FFFFFFE), ZigZagEncode64(LL(0x000000003FFFFFFF)));
566 EXPECT_EQ(ULL(0x000000007FFFFFFF), ZigZagEncode64(LL(0xFFFFFFFFC0000000)));
567 EXPECT_EQ(ULL(0x00000000FFFFFFFE), ZigZagEncode64(LL(0x000000007FFFFFFF)));
568 EXPECT_EQ(ULL(0x00000000FFFFFFFF), ZigZagEncode64(LL(0xFFFFFFFF80000000)));
569 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFE), ZigZagEncode64(LL(0x7FFFFFFFFFFFFFFF)));
570 EXPECT_EQ(ULL(0xFFFFFFFFFFFFFFFF), ZigZagEncode64(LL(0x8000000000000000)));
576 EXPECT_EQ(LL(0x000000003FFFFFFF), ZigZagDecode64(ULL(0x000000007FFFFFFE)));
577 EXPECT_EQ(LL(0xFFFFFFFFC0000000), ZigZagDecode64(ULL(0x000000007FFFFFFF)));
578 EXPECT_EQ(LL(
[all...]
/external/skia/src/effects/
H A DSkBlurMaskFilter.cpp298 const SkVector& LL = rrect.radii(SkRRect::kLowerLeft_Corner); local
300 const SkScalar leftUnstretched = SkTMax(UL.fX, LL.fX) + SkIntToScalar(2 * margin.fX);
314 const SkScalar bottomUnstretched = SkTMax(LL.fY, LR.fY) + SkIntToScalar(2 * margin.fY);
329 radii[SkRRect::kLowerLeft_Corner] = LL;
/external/valgrind/main/callgrind/
H A Dsim.c94 static cache_t2 I1, D1, LL; variable
234 * Simple model: L1 & LL Write Through
308 if ( cachesim_ref( &LL, a, size) == Hit ) return LL_Hit;
316 if ( cachesim_ref( &LL, a, size) == Hit ) return LL_Hit;
326 * More complex model: L1 Write-through, LL Write-back
415 switch( cachesim_ref_wb( &LL, Read, a, size) ) {
427 switch( cachesim_ref_wb( &LL, Read, a, size) ) {
440 * the write to the LL to make the LL line dirty.
443 cachesim_ref_wb( &LL, Writ
[all...]
/external/zxing/core/
H A Dcore.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/zxing/ com/google/zxing/aztec/ ...

Completed in 1146 milliseconds