/external/flac/include/share/ |
alloc.h | 29 // malloc(n1 * n2) then memset to zero 30 static inline void *safe_calloc_(size_t n1, size_t n2) 33 return calloc(n1, n2); 36 // malloc(n1 + n2) 37 static inline void *safe_malloc_add_2op_(size_t n1, size_t n2) 39 unsigned long long n = n1 + n2; 45 // malloc(n1 * n2) 46 static inline void *safe_malloc_mul_2op_(size_t n1, size_t n2) 48 unsigned long long n = n1 * n2; 54 // malloc(n1 * (n2 + n3) [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
test-node.cc | 23 Node* n2 = graph.NewNode(&dummy_operator); local 24 CHECK(n2->id() != n1->id()); 31 Node* n2 = graph.NewNode(&dummy_operator); local 33 CHECK(n2->op() == &dummy_operator); 40 Node* n2 = graph.NewNode(&dummy_operator, n0); local 41 CHECK_EQ(1, n2->InputCount()); 42 CHECK(n0 == n2->InputAt(0)); 50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 51 CHECK_EQ(2, n2->InputCount()); 52 CHECK(n0 == n2->InputAt(0)) 61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1); local 122 Node* n2 = graph.NewNode(&dummy_operator); local 136 Node* n2 = graph.NewNode(&dummy_operator, n0); local 184 Node* n2 = graph.NewNode(&dummy_operator); local 241 Node* n2 = graph.NewNode(&dummy_operator, n0); local 257 Node* n2 = graph.NewNode(&dummy_operator, n0); local 288 Node* n2 = graph.NewNode(&dummy_operator, n0); local 303 Node* n2 = graph.NewNode(&dummy_operator, n0); local 346 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 367 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 404 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 422 Node* n2 = graph.NewNode(&dummy_operator, n0); local 445 Node* n2 = graph.NewNode(&dummy_operator, n0); local 481 Node* n2 = graph.NewNode(&dummy_operator, n0); local 523 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 545 Node* n2 = graph.NewNode(&dummy_operator, n0); local 580 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 591 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 602 Node* n2 = graph.NewNode(&dummy_operator, n0, n1); local 612 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local 621 Node* n2 = graph.NewNode(&dummy_operator, n0, n0); local 656 Node* n2 = graph.NewNode(&dummy_operator); local 672 Node* n2 = graph.NewNode(&dummy_operator); local 687 Node* n2 = graph.NewNode(&dummy_operator); local 700 Node* n2 = graph.NewNode(&dummy_operator); local 713 Node* n2 = graph.NewNode(&dummy_operator); local 732 Node* n2 = graph.NewNode(&dummy_operator, n0); local 747 Node* n2 = graph.NewNode(&dummy_operator, n0); local 761 Node* n2 = graph.NewNode(&dummy_operator, n0); local 773 Node* n2 = graph.NewNode(&dummy_operator, n0); local 785 Node* n2 = graph.NewNode(&dummy_operator, n0); local 803 Node* n2; local [all...] |
test-node-algorithm.cc | 58 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local 59 Node* n3 = graph.NewNode(&dummy_operator, n2); 60 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); 61 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); 69 CHECK(n2->id() == node_visitor.nodes_[1]->id()); 78 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local 79 Node* n3 = graph.NewNode(&dummy_operator, n2); 80 Node* n4 = graph.NewNode(&dummy_operator, n2, n3); 81 Node* n5 = graph.NewNode(&dummy_operator, n4, n2); 89 CHECK(n2->id() == node_visitor.nodes_[2]->id()) 97 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local 124 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local 161 Node* n2 = graph.NewNode(&dummy_operator, n1); local 220 Node* n2 = graph.NewNode(&dummy_operator, n0); local 314 Node* n2 = graph.NewNode(&dummy_operator, graph.start()); local [all...] |
/external/libutf/ |
utfutf.c | 29 long f, n1, n2; local 37 n2 = strlen(s2); 39 if(strncmp(p, s2, n2) == 0)
|
/external/libcxx/test/localization/locales/locale/locale.operators/ |
eq.pass.cpp | 24 std::locale n2(LOCALE_en_US_UTF_8); 32 assert(cloc != n2); 40 assert(copy != n2); 48 assert(n1 == n2); 53 assert(n2 != cloc); 54 assert(n2 != copy); 55 assert(n2 == n1); 56 assert(n2 == n2); 57 assert(n2 != noname1) [all...] |
/external/chromium_org/tools/auto_bisect/ |
ttest.py | 50 n2 = len(sample2) 51 t = _TValue(mean1, mean2, v1, v2, n1, n2) 52 df = _DegreesOfFreedom(v1, v2, n1, n2) 57 def _TValue(mean1, mean2, v1, v2, n1, n2): 69 n2: Sample size of sample 2. 77 return (mean1 - mean2) / (math.sqrt(v1 / n1 + v2 / n2)) 80 def _DegreesOfFreedom(v1, v2, n1, n2): 90 n2: Size of sample 2. 99 if n1 <= 1 or n2 <= 2: 101 df = (((v1 / n1 + v2 / n2) ** 2) [all...] |
/external/chromium_org/third_party/smhasher/src/ |
Stats.cpp | 77 double n2 = n * 1; local 79 if(n2 < 0) n2 = 0; 81 n2 *= 100; 83 if(n2 > 64) n2 = 64; 85 int n3 = (int)n2;
|
/external/clang/test/SemaCXX/ |
pr18284-crash-on-invalid.cpp | 15 namespace n2 { namespace 24 } // namespace n2
|
/external/openssl/crypto/bn/ |
bn_mul.c | 382 /* r is 2*n2 words in size, 383 * a and b are both n2 words in size. 384 * n2 must be a power of 2. 386 * t must be 2*n2 words in size 392 /* dnX may not be positive, but n2/2+dnX has to be */ 393 void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, 396 int n=n2/2,c1,c2; 402 fprintf(stderr," bn_mul_recursive %d%+d * %d%+d\n",n2,dna,n2,dnb); 406 if (n2 == 4 553 int i,j,n2=n*2; local [all...] |
bn_sqr.c | 207 void bn_sqr_recursive(BN_ULONG *r, const BN_ULONG *a, int n2, BN_ULONG *t) 209 int n=n2/2; 214 fprintf(stderr," bn_sqr_recursive %d * %d\n",n2,n2); 216 if (n2 == 4) 225 else if (n2 == 8) 234 if (n2 < BN_SQR_RECURSIVE_SIZE_NORMAL) 236 bn_sqr_normal(r,a,n2,t); 250 p= &(t[n2*2]); 253 bn_sqr_recursive(&(t[n2]),t,n,p) [all...] |
/external/chromium_org/v8/src/compiler/ |
graph.h | 35 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 36 Node* nodes[] = {n1, n2}; 39 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 40 Node* nodes[] = {n1, n2, n3}; 43 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { 44 Node* nodes[] = {n1, n2, n3, n4}; 47 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 49 Node* nodes[] = {n1, n2, n3, n4, n5}; 52 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, 54 Node* nodes[] = {n1, n2, n3, n4, n5, n6} [all...] |
/external/chromium_org/third_party/boringssl/src/crypto/bn/ |
mul.c | 303 /* r is 2*n2 words in size, 304 * a and b are both n2 words in size. 305 * n2 must be a power of 2. 307 * t must be 2*n2 words in size 313 /* dnX may not be positive, but n2/2+dnX has to be */ 314 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, 316 int n = n2 / 2, c1, c2; 321 /* Only call bn_mul_comba 8 if n2 == 8 and the 324 if (n2 == 8 && dna == 0 && dnb == 0) { 330 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) 447 int i, j, n2 = n * 2; local [all...] |
/external/chromium_org/third_party/icu/source/common/ |
unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode) 101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local [all...] |
/external/icu/icu4c/source/common/ |
unorm.cpp | 51 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 52 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 59 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 61 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 66 return unorm2_quickCheck((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 74 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 75 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode); 82 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 84 FilteredNormalizer2 fn2(*n2, *uniset_getUnicode32Instance(*pErrorCode)); 89 return unorm2_isNormalized((const UNormalizer2 *)n2, src, srcLength, pErrorCode) 101 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 182 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local 266 const Normalizer2 *n2=Normalizer2Factory::getInstance(mode, *pErrorCode); local [all...] |
/external/bzip2/ |
bzmore | 16 n1=''; n2='\c' 18 n1='-n'; n2='' 44 echo $n1 "--More--(Next file: $FILE)$n2"
|
/external/libsepol/src/ |
ebitmap.c | 20 ebitmap_node_t *n1, *n2, *new, *prev; local 25 n2 = e2->node; 27 while (n1 || n2) { 34 if (n1 && n2 && n1->startbit == n2->startbit) { 36 new->map = n1->map | n2->map; 38 n2 = n2->next; 39 } else if (!n2 || (n1 && n1->startbit < n2->startbit)) 152 ebitmap_node_t *n1, *n2; local 202 ebitmap_node_t *n1, *n2; local [all...] |
/external/openssl/crypto/rand/ |
randtest.c | 73 unsigned long n2[16]; local 87 for (i=0; i<16; i++) n2[i]=0; 97 n2[j&0x0f]++; 98 n2[(j>>4)&0x0f]++; 137 d+=n2[i]*n2[i]; 147 d+=n2[i]*n2[i];
|
/external/chromium_org/testing/gtest/samples/ |
sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); 106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { 107 EXPECT_EQ(2 * n1->element(), n2->element());
|
/external/clang/test/Sema/ |
attr-section.c | 14 __attribute__((section("NEAR,x"))) static int n2; // ok. local
|
/external/chromium_org/base/containers/ |
linked_list_unittest.cc | 85 Node n2(2); 86 list.Append(&n2); 89 EXPECT_EQ(&n2, list.tail()); 110 Node n2(2); 116 list.Append(&n2); 151 EXPECT_EQ(&n2, list.head()); 159 n2.RemoveFromList(); 168 list.Append(&n2); 185 Node n2(2); 190 list.Append(&n2); [all...] |
/external/elfutils/0.153/libelf/ |
elf32_fsize.c | 92 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
/external/llvm/unittests/IR/ |
MetadataTest.cpp | 92 MDNode *n2 = MDNode::get(Context, c1); local 93 Value *const c2 = n2; 98 EXPECT_NE(n1, n2); 105 EXPECT_EQ(n5, n2); 113 EXPECT_EQ(1u, n2->getNumOperands()); 114 EXPECT_EQ(n1, n2->getOperand(0)); 138 MDNode *n2 = MDNode::get(Context, V2); local 144 NMD->addOperand(n2);
|
/external/chromium_org/third_party/icu/source/samples/uciter8/ |
uciter8.c | 46 UCharIterator *iter2, const char *n2) { 54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); 69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); 77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); 86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 114 log_err("%s->move(start) failed\n", n2); 118 log_err("%s->hasNext() at the start returns FALSE\n", n2); 126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 136 log_err("%s->hasNext() at the end returns TRUE\n", n2); [all...] |
/external/icu/icu4c/source/samples/uciter8/ |
uciter8.c | 46 UCharIterator *iter2, const char *n2) { 54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2); 69 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n2, middle, pos2); 77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle); 86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 114 log_err("%s->move(start) failed\n", n2); 118 log_err("%s->hasNext() at the start returns FALSE\n", n2); 126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT)); 136 log_err("%s->hasNext() at the end returns TRUE\n", n2); [all...] |
/external/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
splice_after_flist.pass.cpp | 34 for (int n2 = 0; n2 < l; ++n2, ++i) 35 assert(*i == t2[n2]);
|