| /external/bison/lib/ |
| quotearg.c | 774 /* FIXME: technically, the type of n1 should be 'unsigned int',
779 size_t n1 = n0 + 1; local
782 if (xalloc_oversized (n1, sizeof *sv))
785 slotvec = sv = xrealloc (preallocated ? NULL : sv, n1 * sizeof *sv);
788 memset (sv + nslots, 0, (n1 - nslots) * sizeof *sv);
789 nslots = n1;
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/ec/ |
| WNafUtil.java | 135 int n0 = ((k0.intValue() >>> offset) + d0) & 7, n1 = ((k1.intValue() >>> offset) + d1) & 7; local
141 if ((n0 + u0) == 4 && (n1 & 3) == 2)
147 int u1 = n1 & 1;
150 u1 -= (n1 & 2);
151 if ((n1 + u1) == 4 && (n0 & 3) == 2)
|
| /external/libvorbis/lib/ |
| vorbisfile.c | 2147 int n1,n2,i,ret,hs1,hs2; local
2201 int n1,n2,ch1,ch2,hs; local
2262 int n1,n2,ch1,ch2,hs; local
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/generators/ |
| classic.py | 195 def complete_bipartite_graph(n1,n2,create_using=None):
198 Composed of two partitions with n1 nodes in the first
202 Node labels are the integers 0 to n1+n2-1
207 G=empty_graph(n1+n2,create_using)
208 G.name="complete_bipartite_graph(%d,%d)"%(n1,n2)
209 for v1 in range(n1):
211 G.add_edge(v1,n1+v2)
|
| /cts/tests/tests/media/src/android/media/cts/ |
| DecoderTest.java | 284 int n1 = ex1.readSampleData(buf1, 0); local
285 if (n1 < 0) {
290 vid.add(n1);
292 aud.add(n1);
309 int n1 = ex1.readSampleData(buf1, 0); local
310 if (n1 < 0) {
314 assertEquals(vid.get(idx++).intValue(), n1);
329 int n1 = ex1.readSampleData(buf1, 0); local
330 if (n1 < 0) {
334 assertEquals(aud.get(idx++).intValue(), n1);
349 int n1 = ex1.readSampleData(buf1, 0); local
381 int n1 = ex1.readSampleData(buf1, 0); local
414 int n1 = ex1.readSampleData(buf1, 0); local
473 int n1 = ex1.readSampleData(buf1, 0); local
[all...] |
| /external/tremolo/Tremolo/ |
| mdct.c | 468 void mdct_unroll_lap(int n0,int n1,
479 DATA_TYPE *l=in+(W&&lW ? n1>>1 : n0>>1);
480 DATA_TYPE *r=right+(lW ? n1>>2 : n0>>2);
482 LOOKUP_T *wR=(W && lW ? w1+(n1>>1) : w0+(n0>>1));
485 int preLap=(lW && !W ? (n1>>2)-(n0>>2) : 0 );
486 int halfLap=(lW && W ? (n1>>2) : (n0>>2) );
487 int postLap=(!lW && W ? (n1>>2)-(n0>>2) : 0 );
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| treewizard.py | 567 n1 = self.adaptor.getChildCount(t1)
569 if n1 != n2:
572 for i in range(n1):
608 n1 = adaptor.getChildCount(t1)
610 if n1 != n2:
613 for i in range(n1):
|
| /external/speex/libspeex/ |
| lsp.c | 532 float *pw,*n1,*n2,*n3,*n4=NULL; local
562 n1 = pw+(i*4);
563 n2 = n1 + 1;
566 xout1 = xin1 - 2.f*x_freq[i2] * *n1 + *n2;
568 *n2 = *n1;
570 *n1 = xin1;
|
| /external/v8/src/compiler/ |
| raw-machine-assembler.h | 393 Node* Phi(MachineType type, Node* n1, Node* n2) {
394 return NewNode(common()->Phi(type, 2), n1, n2);
396 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3) {
397 return NewNode(common()->Phi(type, 3), n1, n2, n3);
399 Node* Phi(MachineType type, Node* n1, Node* n2, Node* n3, Node* n4) {
400 return NewNode(common()->Phi(type, 4), n1, n2, n3, n4);
|
| /system/bt/stack/smp/ |
| smp_int.h | 383 UINT8 *key_id, UINT8 *n1,
386 extern void smp_f5_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
388 extern void smp_f6_calc_chk (UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r,
522 extern BOOLEAN smp_calculate_f5(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *a1, UINT8 *a2,
525 UINT8 *key_id, UINT8 *n1, UINT8 *n2, UINT8 *a1,
528 extern BOOLEAN smp_calculate_f6(UINT8 *w, UINT8 *n1, UINT8 *n2, UINT8 *r, UINT8 *iocap,
|
| /external/icu/icu4c/source/i18n/ |
| gregoimp.cpp | 109 int32_t n1 = ClockMath::floorDivide(doy, 365, doy); local
110 year = 400*n400 + 100*n100 + 4*n4 + n1;
111 if (n100 == 4 || n1 == 4) {
|
| /external/libvpx/libvpx/vp9/common/mips/dspr2/ |
| vp9_convolve2_avg_horiz_dspr2.c | 129 uint32_t p1, p2, p3, p4, n1; local
255 [n1] "=&r" (n1),
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/mips/dspr2/ |
| vp9_convolve2_avg_horiz_dspr2.c | 129 uint32_t p1, p2, p3, p4, n1; local
255 [n1] "=&r" (n1),
[all...] |
| /external/clang/test/Modules/ |
| macros.c | 161 int n1 = TOP_OTHER_REDEF1; // expected-warning{{ambiguous expansion of macro 'TOP_OTHER_REDEF1'}} variable
|
| /external/icu/icu4c/source/test/cintltst/ |
| custrtst.c | [all...] |
| /external/libvncserver/libvncserver/ |
| hextile.c | 303 int n1 = 0, n2 = 0; \
309 if (n1 == 0) \
313 n1++; \
331 if (n1 > n2) { \
|
| /external/skia/platform_tools/android/bin/utils/ |
| setup_toolchain.sh | 82 GCC=$(command ls $ANDROID_TOOLCHAIN/*-gcc | head -n1)
|
| /external/sqlite/android/ |
| sqlite3_android.cpp | 37 static int collate16(void *p, int n1, const void *v1, int n2, const void *v2)
40 UCollationResult result = ucol_strcoll(coll, (const UChar *) v1, n1,
52 static int collate8(void *p, int n1, const void *v1, int n2, const void *v2)
58 uiter_setUTF8(&i1, (const char *) v1, n1);
|
| /external/v8/test/mjsunit/ |
| object-toprimitive.js | 34 var n1 = Number(o1); variable
36 assertTrue(typeof n1 == "number");
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/algorithms/isomorphism/ |
| vf2userfunc.py | 6 candidate nodes n1 in G1 and n2 in G2. The graphs G1 and G2 are then
7 compared with respect to properties involving n1 and n2, and if the outcome
13 n1 and n2, the algorithm passes their node attribute dictionaries to
14 node_match, and if it returns False, then n1 and n2 cannot be
18 n1 and n2, the algorithm must verify that outgoing edges from n1 are
22 Focusing only on outgoing edges, we consider pairs of nodes (n1, v1) from
24 between (n1, v1) and only one edge between (n2, v2). Those edge attribute
26 n1 and n2 cannot be considered isomorphic. For multigraphs and
27 multidigraphs, there can be multiple edges between (n1, v1) and als
[all...] |
| /system/core/include/mincrypt/ |
| p256.h | 138 const p256_int *n1, const p256_int *n2,
|
| /external/fio/t/ |
| genzipf.c | 165 const struct node *n1 = p1; local
168 return n2->hits - n1->hits;
|
| /external/valgrind/auxprogs/ |
| valgrind-di-server.c | 462 static Frame* mk_Frame_le64 ( const HChar* tag, ULong n1 )
469 write_ULong_le(&f->data[4 + 0*8], n1);
473 static Frame* mk_Frame_le64_le64 ( const HChar* tag, ULong n1, ULong n2 )
480 write_ULong_le(&f->data[4 + 0*8], n1);
486 /*OUT*/ULong* n1, /*OUT*/ULong* n2,
494 *n1 = read_ULong_le(&fr->data[4 + 0*8]);
502 ULong n1, ULong n2, ULong n3, ULong n_data,
510 write_ULong_le(&f->data[4 + 0*8], n1);
[all...] |
| /frameworks/rs/java/tests/VrDemo/src/com/example/android/rs/vr/engine/ |
| Quaternion.java | 126 double n1 = 2 * (x[0] * (v1 * x[0] - (x[3] * v0 - x[1] * v2)) + s * x[2]) - v1;
local
129 return new double[]{n0, n1, n2};
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/jar/ |
| AttributesTest.java | 209 Attributes.Name n1 = new Attributes.Name("name"), n2 = new Attributes.Name("Name"); local
210 assertEquals(n1, n2);
|
