/external/chromium_org/v8/test/mjsunit/es7/ |
H A D | object-observe.js | 1791 for (var n1 = 0; n1 < 3; ++n1) 1794 TestFastElementsLength(mutation[i], b1 != 0, b2 != 0, 20*n1, 20*n2);
|
/external/ipsec-tools/src/racoon/ |
H A D | crypto_openssl.c | 414 eay_cmp_asn1dn(n1, n2) 415 vchar_t *n1, *n2; 421 p = n1->v; 422 if (!d2i_X509_NAME(&a, (void *)&p, n1->l))
|
/external/chromium_org/third_party/icu/source/test/intltest/ |
H A D | wbnf.cpp | 1514 Literal * n1 = new Literal("string1"); local 1517 t.put("abc", n1); 1519 // t.put("alias", n1); // TOFIX: point alias/recursion problem
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/encoder/ |
H A D | bitstream.c | 627 int_mv n1, n2; local 630 vp8_find_near_mvs(xd, m, &n1, &n2, &best_mv, ct, rf, cpi->common.ref_frame_sign_bias);
|
/external/elfutils/0.153/src/ |
H A D | nm.c | 1147 const char *n1 = sort_by_name_strtab->d_buf + s1->sym.st_name; local 1150 int result = strcmp (n1, n2);
|
/external/libcxx/test/strings/basic.string/string.ops/string_compare/ |
H A D | size_size_pointer_size.pass.cpp | 12 // int compare(size_type pos, size_type n1, const charT *s, size_type n2) const; 31 test(const S& s, typename S::size_type pos, typename S::size_type n1, argument 36 assert(sign(s.compare(pos, n1, str, n2)) == sign(x));
|
/external/libvpx/libvpx/vp8/encoder/ |
H A D | bitstream.c | 628 int_mv n1, n2; local 631 vp8_find_near_mvs(xd, m, &n1, &n2, &best_mv, ct, rf, cpi->common.ref_frame_sign_bias);
|
/external/valgrind/main/memcheck/ |
H A D | mc_leakcheck.c | 249 static Int compare_MC_Chunks(const void* n1, const void* n2) argument 251 const MC_Chunk* mc1 = *(const MC_Chunk *const *)n1;
|
/external/chromium_org/base/third_party/dmg_fp/ |
H A D | dtoa.cc | 980 int i, k1, n, n1; variable 990 n1 = n + b->wds + 1; 991 for(i = b->maxwds; n1 > i; i <<= 1) 1010 ++n1; 1022 ++n1; 1028 b1->wds = n1 - 1;
|
/external/deqp/modules/gles3/performance/ |
H A D | es3pBufferDataUploadTests.cpp | 6043 const int n1 = (int)orderedObservationsA.size(); 6045 std::vector<deUint64> allSamples (n1 + n2); 6048 std::copy(orderedObservationsB.begin(), orderedObservationsB.end(), allSamples.begin() + n1); 6054 const float U1 = n1*n2 + n1*(n1 + 1)/2 - R1; 6055 const float U2 = (n1 * n2) - U1; 6060 const float mU = n1*n2 / 2.0f; 6061 const float sigmaU = deFloatSqrt((n1*n2*(n1 [all...] |
/external/valgrind/main/coregrind/m_debuginfo/ |
H A D | readdwarf3.c | 747 Word n1, n2, i; local 749 n1 = VG_(sizeXA)( rngs1 ); 751 if (n1 < n2) return -1; 752 if (n1 > n2) return 1; 753 for (i = 0; i < n1; i++) { 2070 static Int lc_compar(void* n1, void* n2) { 2071 MC_Chunk* mc1 = *(MC_Chunk**)n1; 2083 whereas n1 and n2 do have locations specified.
|
/external/chromium_org/third_party/libxml/src/ |
H A D | xpath.c | 3661 xmlNodePtr n1, n2; local 3707 n1 = val1->nodeTab[j]; 3708 if (n1 == n2) { 3711 } else if ((n1->type == XML_NAMESPACE_DECL) && 3713 if ((((xmlNsPtr) n1)->next == ((xmlNsPtr) n2)->next) && 3714 (xmlStrEqual(((xmlNsPtr) n1)->prefix, 3856 xmlNodePtr n1, n2; local 3875 n1 = set1->nodeTab[j]; 3876 if (n1 == n2) { 3878 } else if ((n1 [all...] |
/external/chromium_org/third_party/sqlite/src/ext/fts3/ |
H A D | fts3.c | 1775 ** Merge the two doclists passed in buffer a1 (size n1 bytes) and a2 1791 int n1, /* Size of buffer a1 */ 1803 char *pEnd1 = &a1[n1]; 1905 aTmp = sqlite3_malloc(2*(n1+n2+1)); 1784 fts3DoclistMerge( int mergetype, int nParam1, int nParam2, char *aBuffer, int *pnBuffer, char *a1, int n1, char *a2, int n2, int *pnDoc ) argument
|
/external/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
H A D | size_size_pointer_size.pass.cpp | 13 // replace(size_type pos, size_type n1, const charT* s, size_type n2); 26 test(S s, typename S::size_type pos, typename S::size_type n1, argument 34 s.replace(pos, n1, str, n2); 38 typename S::size_type xlen = std::min(n1, old_size - pos);
|
H A D | iter_iter_pointer_size.pass.cpp | 25 test(S s, typename S::size_type pos1, typename S::size_type n1, const typename S::value_type* str, argument 30 typename S::const_iterator last = s.begin() + pos1 + n1;
|
/external/libxml2/ |
H A D | xpath.c | 3815 xmlNodePtr n1, n2; local 3861 n1 = val1->nodeTab[j]; 3862 if (n1 == n2) { 3865 } else if ((n1->type == XML_NAMESPACE_DECL) && 3867 if ((((xmlNsPtr) n1)->next == ((xmlNsPtr) n2)->next) && 3868 (xmlStrEqual(((xmlNsPtr) n1)->prefix, 3952 xmlNodePtr n1, n2; local 3971 n1 = set1->nodeTab[j]; 3972 if (n1 == n2) { 3974 } else if ((n1 [all...] |
/external/chromium_org/sync/engine/ |
H A D | syncer_unittest.cc | 4380 Entry n1(&trans, GET_BY_ID, node1); 4381 ASSERT_TRUE(n1.good()); 4382 EXPECT_FALSE(n1.GetIsUnappliedUpdate()); 4415 Entry n1(&trans, GET_BY_ID, node1); 4416 ASSERT_TRUE(n1.good()); 4417 EXPECT_TRUE(n1.GetIsUnappliedUpdate());
|
/external/llvm/test/Bindings/Ocaml/ |
H A D | vmcore.ml | 1061 let n1 = const_int i32_type 1 in var 1063 let md = mdnode context [| n1; n2; n1 |] in
|
/external/chromium_org/third_party/skia/third_party/lua/src/ |
H A D | lapi.c | 1276 LUA_API void lua_upvaluejoin (lua_State *L, int fidx1, int n1, argument 1279 UpVal **up1 = getupvalref(L, fidx1, n1, &f1);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractMultimapTest.java | 958 Integer n1 = iterator.next(); 965 ASSERT.that(asList(n1, n3)).hasContentsAnyOrder(v1, v3);
|
/external/owasp/sanitizer/tools/findbugs/lib/ |
H A D | dom4j-1.6.1.jar | META-INF/ META-INF/MANIFEST.MF org/ org/dom4j/ org/dom4j/bean/ org/dom4j/datatype/ org/ ... |
/external/chromium_org/third_party/tcmalloc/chromium/src/tests/ |
H A D | heap-checker_unittest.cc | 1227 char n1[5]; member in struct:Nesting
|
/external/chromium_org/third_party/tcmalloc/vendor/src/tests/ |
H A D | heap-checker_unittest.cc | 1227 char n1[5]; member in struct:Nesting
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/lib/ |
H A D | FlexAntTasks.jar | META-INF/ META-INF/MANIFEST.MF com/ com/adobe/ com/adobe/ac/ com/adobe/ac/ant/ ... |
/external/valgrind/main/perf/ |
H A D | test_input_for_tinycc.c | 2752 Int32 nNodes, nHeap, n1, n2, i, j, k; local 2781 n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; { Int32 zz, yy, tmp; zz = 1; tmp = heap[zz]; while (((Bool)1)) { yy = zz << 1; if (yy > nHeap) break; if (yy < nHeap && weight[heap[yy+1]] < weight[heap[yy]]) yy++; if (weight[tmp] < weight[heap[yy]]) break; heap[zz] = heap[yy]; zz = yy; } heap[zz] = tmp; }; 2784 parent[n1] = parent[n2] = nNodes; 2785 weight[nNodes] = (((weight[n1]) & 0xffffff00)+((weight[n2]) & 0xffffff00)) | (1 + ((((weight[n1]) & 0x000000ff)) > (((weight[n2]) & 0x000000ff)) ? (((weight[n1]) & 0x000000ff)) : (((weight[n2]) & 0x000000ff))));
|