HomeSort by relevance Sort by last modified time
    Searched refs:pA (Results 26 - 50 of 78) sorted by null

12 3 4

  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.const/
shared_ptr_pointer.pass.cpp 44 std::shared_ptr<A> pA(new A);
45 assert(pA.use_count() == 1);
48 std::shared_ptr<B> pB(pA, &b);
51 assert(pA.use_count() == 2);
55 assert(pA.use_count() == 1);
shared_ptr_Y.pass.cpp 60 const std::shared_ptr<A> pA(new A);
61 assert(pA.use_count() == 1);
65 std::shared_ptr<B> pB(pA);
69 assert(pA.use_count() == 2);
70 assert(pA.get() == pB.get());
72 assert(pA.use_count() == 1);
79 std::shared_ptr<A> pA;
80 assert(pA.use_count() == 0);
84 std::shared_ptr<B> pB(pA);
88 assert(pA.use_count() == 0)
    [all...]
  /external/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.const/
shared_ptr_Y.pass.cpp 60 const std::shared_ptr<A> pA(new A);
61 assert(pA.use_count() == 1);
65 std::weak_ptr<B> pB(pA);
69 assert(pA.use_count() == 1);
71 assert(pA.use_count() == 1);
78 std::shared_ptr<A> pA;
79 assert(pA.use_count() == 0);
83 std::weak_ptr<B> pB(pA);
87 assert(pA.use_count() == 0);
89 assert(pA.use_count() == 0)
    [all...]
weak_ptr.pass.cpp 65 const std::weak_ptr<A> pA(ps);
66 assert(pA.use_count() == 1);
70 std::weak_ptr<A> pB(pA);
74 assert(pA.use_count() == 1);
76 assert(pA.use_count() == 1);
83 std::weak_ptr<A> pA;
84 assert(pA.use_count() == 0);
88 std::weak_ptr<A> pB(pA);
92 assert(pA.use_count() == 0);
94 assert(pA.use_count() == 0)
    [all...]
weak_ptr_Y.pass.cpp 67 const std::weak_ptr<A> pA(std::shared_ptr<A>(new A));
68 assert(pA.use_count() == 0);
72 std::weak_ptr<B> pB(pA);
76 assert(pA.use_count() == 0);
78 assert(pA.use_count() == 0);
85 std::weak_ptr<A> pA;
86 assert(pA.use_count() == 0);
90 std::weak_ptr<B> pB(pA);
94 assert(pA.use_count() == 0);
96 assert(pA.use_count() == 0)
    [all...]
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.const/
shared_ptr_Y.pass.cpp 60 const std::shared_ptr<A> pA(new A);
61 assert(pA.use_count() == 1);
65 std::weak_ptr<B> pB(pA);
69 assert(pA.use_count() == 1);
71 assert(pA.use_count() == 1);
78 std::shared_ptr<A> pA;
79 assert(pA.use_count() == 0);
83 std::weak_ptr<B> pB(pA);
87 assert(pA.use_count() == 0);
89 assert(pA.use_count() == 0)
    [all...]
weak_ptr.pass.cpp 65 const std::weak_ptr<A> pA(ps);
66 assert(pA.use_count() == 1);
70 std::weak_ptr<A> pB(pA);
74 assert(pA.use_count() == 1);
76 assert(pA.use_count() == 1);
83 std::weak_ptr<A> pA;
84 assert(pA.use_count() == 0);
88 std::weak_ptr<A> pB(pA);
92 assert(pA.use_count() == 0);
94 assert(pA.use_count() == 0)
    [all...]
weak_ptr_Y.pass.cpp 67 const std::weak_ptr<A> pA(std::shared_ptr<A>(new A));
68 assert(pA.use_count() == 0);
72 std::weak_ptr<B> pB(pA);
76 assert(pA.use_count() == 0);
78 assert(pA.use_count() == 0);
85 std::weak_ptr<A> pA;
86 assert(pA.use_count() == 0);
90 std::weak_ptr<B> pB(pA);
94 assert(pA.use_count() == 0);
96 assert(pA.use_count() == 0)
    [all...]
  /external/libcxx/test/utilities/memory/util.smartptr/util.smartptr.shared/util.smartptr.shared.const/
shared_ptr_Y.pass.cpp 60 const std::shared_ptr<A> pA(new A);
61 assert(pA.use_count() == 1);
65 std::shared_ptr<B> pB(pA);
69 assert(pA.use_count() == 2);
70 assert(pA.get() == pB.get());
72 assert(pA.use_count() == 1);
79 std::shared_ptr<A> pA;
80 assert(pA.use_count() == 0);
84 std::shared_ptr<B> pB(pA);
88 assert(pA.use_count() == 0)
    [all...]
  /external/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.assign/
shared_ptr_Y.pass.cpp 46 const std::shared_ptr<A> pA(new A);
49 pB = pA;
53 assert(pA.use_count() == 1);
55 assert(pA.use_count() == 1);
weak_ptr.pass.cpp 47 const std::weak_ptr<A> pA(ps);
50 pB = pA;
54 assert(pA.use_count() == 1);
56 assert(pA.use_count() == 1);
65 std::weak_ptr<A> pA(ps);
68 pB = std::move(pA);
weak_ptr_Y.pass.cpp 47 const std::weak_ptr<A> pA(ps);
50 pB = pA;
54 assert(pA.use_count() == 1);
56 assert(pA.use_count() == 1);
65 std::weak_ptr<A> pA(ps);
68 pB = std::move(pA);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/utilities/memory/util.smartptr/util.smartptr.weak/util.smartptr.weak.assign/
shared_ptr_Y.pass.cpp 46 const std::shared_ptr<A> pA(new A);
49 pB = pA;
53 assert(pA.use_count() == 1);
55 assert(pA.use_count() == 1);
weak_ptr.pass.cpp 47 const std::weak_ptr<A> pA(ps);
50 pB = pA;
54 assert(pA.use_count() == 1);
56 assert(pA.use_count() == 1);
65 std::weak_ptr<A> pA(ps);
68 pB = std::move(pA);
weak_ptr_Y.pass.cpp 47 const std::weak_ptr<A> pA(ps);
50 pB = pA;
54 assert(pA.use_count() == 1);
56 assert(pA.use_count() == 1);
65 std::weak_ptr<A> pA(ps);
68 pB = std::move(pA);
  /external/chromium_org/third_party/sqlite/src/src/
rowset.c 206 struct RowSetEntry *pA, /* First sorted list to be merged */
213 while( pA && pB ){
214 assert( pA->pRight==0 || pA->v<=pA->pRight->v );
216 if( pA->v<pB->v ){
217 pTail->pRight = pA;
218 pA = pA->pRight;
220 }else if( pB->v<pA->v )
    [all...]
test_fuzzer.c 235 static fuzzer_rule *fuzzerMergeRules(fuzzer_rule *pA, fuzzer_rule *pB){
240 while( pA && pB ){
241 if( pA->rCost<=pB->rCost ){
242 pTail->pNext = pA;
243 pTail = pA;
244 pA = pA->pNext;
251 if( pA==0 ){
254 pTail->pNext = pA;
467 static fuzzer_stem *fuzzerMergeStems(fuzzer_stem *pA, fuzzer_stem *pB)
    [all...]
pcache.c 454 static PgHdr *pcacheMergeDirtyList(PgHdr *pA, PgHdr *pB){
457 while( pA && pB ){
458 if( pA->pgno<pB->pgno ){
459 pTail->pDirty = pA;
460 pTail = pA;
461 pA = pA->pDirty;
468 if( pA ){
469 pTail->pDirty = pA;
expr.c     [all...]
  /external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/
modexp512-x86_64.pl 365 #MULADD_256x512 MACRO pDst, pA, pB, OP, TMP, X7, X6, X5, X4, X3, X2, X1, X0
368 # pA: Multiplicand (1024 bits, 16 qwords)
376 my ($pDst, $pA, $pB, $OP, $TMP, $X)=@_;
378 mov (+8*12)($pA), $OP
380 &MULSTEP_512_ADD($X, "(+8*0)($pDst)", $pB, $pA, $OP, $TMP);
384 mov (+8*13)($pA), $OP
390 mov (+8*14)($pA), $OP
396 mov (+8*15)($pA), $OP
618 #MUL_512x512 MACRO pDst, pA, pB, x7, x6, x5, x4, x3, x2, x1, x0, tmp*2
621 # pA: Multiplicand (512 bits, 8 qwords
    [all...]
  /external/openssl/crypto/bn/asm/
modexp512-x86_64.pl 365 #MULADD_256x512 MACRO pDst, pA, pB, OP, TMP, X7, X6, X5, X4, X3, X2, X1, X0
368 # pA: Multiplicand (1024 bits, 16 qwords)
376 my ($pDst, $pA, $pB, $OP, $TMP, $X)=@_;
378 mov (+8*12)($pA), $OP
380 &MULSTEP_512_ADD($X, "(+8*0)($pDst)", $pB, $pA, $OP, $TMP);
384 mov (+8*13)($pA), $OP
390 mov (+8*14)($pA), $OP
396 mov (+8*15)($pA), $OP
618 #MUL_512x512 MACRO pDst, pA, pB, x7, x6, x5, x4, x3, x2, x1, x0, tmp*2
621 # pA: Multiplicand (512 bits, 8 qwords
    [all...]
  /frameworks/compile/libbcc/include/bcc/ExecutionEngine/
SymbolResolvers.h 69 static int CompareSymbolName(const void *pA, const void *pB) {
70 return ::strcmp(reinterpret_cast<const SymbolMap *>(pA)->mName,
  /external/chromium_org/third_party/sqlite/src/tool/
mkkeywordhash.c 298 const Keyword *pA = (Keyword*)a;
300 int n = pA->len - pB->len;
302 n = strcmp(pA->zName, pB->zName);
308 const Keyword *pA = (Keyword*)a;
310 int n = pB->longestSuffix - pA->longestSuffix;
312 n = strcmp(pA->zName, pB->zName);
318 const Keyword *pA = (Keyword*)a;
320 int n = pA->offset - pB->offset;
321 if( n==0 ) n = pB->id - pA->id;
  /external/pdfium/fpdfsdk/src/pdfwindow/
PWL_Icon.cpp 163 CPDF_Array* pA = m_pIconFit->m_pDict->GetArray("A");
164 if (pA != NULL)
166 FX_DWORD dwCount = pA->GetCount();
167 if (dwCount > 0) fLeft = pA->GetNumber(0);
168 if (dwCount > 1) fBottom = pA->GetNumber(1);
  /external/opencv/cv/src/
cvlkpyramid.cpp     [all...]

Completed in 558 milliseconds

12 3 4