| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 134 n2 = pytree.Node(1000, [n1, l3])
138 self.assertEqual(n2.get_suffix(), "")
142 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
143 self.assertEqual(n1, n2)
151 n2 = pytree.Node(1000, [l2])
152 self.assertEqual(n1, n2)
185 n2 = pytree.Node(1000, [l1, l2])
187 n1 = pytree.Node(1000, [n2, n3])
194 n2 = pytree.Node(1000, [l1, l2])
196 n1 = pytree.Node(1000, [n2, n3]
[all...] |
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/lib2to3/tests/ |
| test_pytree.py | 134 n2 = pytree.Node(1000, [n1, l3])
138 self.assertEqual(n2.get_suffix(), "")
142 n2 = pytree.Node(1000, [], context=(" ", (1, 0)))
143 self.assertEqual(n1, n2)
151 n2 = pytree.Node(1000, [l2])
152 self.assertEqual(n1, n2)
185 n2 = pytree.Node(1000, [l1, l2])
187 n1 = pytree.Node(1000, [n2, n3])
194 n2 = pytree.Node(1000, [l1, l2])
196 n1 = pytree.Node(1000, [n2, n3]
[all...] |
| /external/libvorbis/lib/ |
| mdct.c | 57 int n2=n>>1; local
68 T[n2+i*2]=FLOAT_CONV(cos((M_PI/(2*n))*(2*i+1)));
69 T[n2+i*2+1]=FLOAT_CONV(sin((M_PI/(2*n))*(2*i+1)));
399 int n2=n>>1; local
404 DATA_TYPE *iX = in+n2-7;
405 DATA_TYPE *oX = out+n2+n4;
418 iX = in+n2-8;
419 oX = out+n2+n4;
432 mdct_butterflies(init,out+n2,n2);
495 int n2=n>>1; local
[all...] |
| /prebuilts/go/darwin-x86/test/ken/ |
| divmod.go | 14 n2 = -5
35 if n2/d1 != q2 || n2%d1 != r2 {
36 println("ideal-2", n2, d1, n2/d1, n2%d1)
43 if n2/d2 != q4 || n2%d2 != r4 {
44 println("ideal-4", n2, d2, n2/d2, n2%d2
13 n2 = -5 const
[all...] |
| /prebuilts/go/linux-x86/test/ken/ |
| divmod.go | 14 n2 = -5
35 if n2/d1 != q2 || n2%d1 != r2 {
36 println("ideal-2", n2, d1, n2/d1, n2%d1)
43 if n2/d2 != q4 || n2%d2 != r4 {
44 println("ideal-4", n2, d2, n2/d2, n2%d2
13 n2 = -5 const
[all...] |
| /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/ |
| cgen.go | 138 var n2 Node
139 Regalloc(&n2, res.Type, nil)
140 Cgen(n, &n2)
141 p1 = Thearch.Gins(a, &n2, nil)
142 Regfree(&n2)
158 var n1, n2 Node
161 Igen(res, &n2, nil)
162 cgen_wb(&n1, &n2, wb)
163 Regfree(&n2)
278 var n2 Nod
[all...] |
| cplx.go | 119 var n2 Node
123 subnode(&n1, &n2, nl)
127 minus(&n2, &n6)
135 var n2 Node
141 subnode(&n1, &n2, nl)
154 ra.Left = &n2
156 ra.Type = n2.Type
166 var n2 Node
173 subnode(&n1, &n2, nl)
188 rm2.Left = &n2
[all...] |
| /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/ |
| cgen.go | 138 var n2 Node
139 Regalloc(&n2, res.Type, nil)
140 Cgen(n, &n2)
141 p1 = Thearch.Gins(a, &n2, nil)
142 Regfree(&n2)
158 var n1, n2 Node
161 Igen(res, &n2, nil)
162 cgen_wb(&n1, &n2, wb)
163 Regfree(&n2)
278 var n2 Nod
[all...] |
| cplx.go | 119 var n2 Node
123 subnode(&n1, &n2, nl)
127 minus(&n2, &n6)
135 var n2 Node
141 subnode(&n1, &n2, nl)
154 ra.Left = &n2
156 ra.Type = n2.Type
166 var n2 Node
173 subnode(&n1, &n2, nl)
188 rm2.Left = &n2
[all...] |
| /external/icu/icu4j/main/tests/localespi/src/com/ibm/icu/dev/test/localespi/ |
| NumberFormatTest.java | 183 Number n1, n2; local
195 n1 = n2 = null;
203 n2 = icunf.parse(s2);
211 } else if (!pe1 && !pe2 && !n1.equals(n2)) {
213 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2);
230 n1 = n2 = null;
238 n2 = icunf.parse(s2);
246 } else if (!pe1 && !pe2 && !n1.equals(n2)) {
248 + methodName[0] + ") in locale " + loc + " - JDK:" + n1 + " ICU:" + n2);
265 n1 = n2 = null
[all...] |
| /external/mesa3d/src/mesa/program/ |
| register_allocate.c | 296 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2)
298 g->nodes[n1].adjacency[n2] = GL_TRUE;
299 g->nodes[n1].adjacency_list[g->nodes[n1].adjacency_count] = n2;
336 unsigned int n1, unsigned int n2)
338 if (!g->nodes[n1].adjacency[n2]) {
339 ra_add_node_adjacency(g, n1, n2);
340 ra_add_node_adjacency(g, n2, n1);
351 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
352 unsigned int n2_class = g->nodes[n2].class;
354 if (n != n2 && !g->nodes[n2].in_stack)
427 unsigned int n2 = g->nodes[n].adjacency_list[i]; local
516 unsigned int n2 = g->nodes[n].adjacency_list[j]; local
[all...] |
| /external/aac/libSYS/include/ |
| genericStds.h | 172 #define C_ALLOC_MEM2(name,type,n1,n2) \
173 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); } \
175 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
184 #define C_AALLOC_MEM2(name,type,n1,n2) \
185 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), ALIGNMENT_DEFAULT)); } \
187 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
196 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \
197 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s); } \
199 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
208 #define C_AALLOC_MEM2_L(name,type,n1,n2,s)
[all...] |
| /external/libxml2/python/tests/ |
| validRNG.py | 25 xmlns:ex2="http://www.example.com/n2">
37 <foo><pre1:bar1 xmlns:pre1="http://www.example.com/n1"/><pre2:bar2 xmlns:pre2="http://www.example.com/n2"/></foo>"""
40 <foo><pre1:bar1 xmlns:pre1="http://www.example.com/n1">bad</pre1:bar1><pre2:bar2 xmlns:pre2="http://www.example.com/n2"/></foo>"""
|
| relaxng.py | 13 xmlns:ex2="http://www.example.com/n2">
24 <foo><pre1:bar1 xmlns:pre1="http://www.example.com/n1"/><pre2:bar2 xmlns:pre2="http://www.example.com/n2"/></foo>"""
|
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/anqp/ |
| CellularNetwork.java | 33 int n2 = (plmn[1] >> 4) & 0x0f; local
34 String mccMnc = n2 != 0xf ?
35 String.format("%03x%03x", mcc, (mnc << 4) | n2) :
|
| /bionic/libc/kernel/uapi/linux/ |
| gsmmux.h | 34 unsigned int n2; member in struct:gsm_config
|
| ax25.h | 101 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
112 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /external/kernel-headers/original/uapi/linux/ |
| gsmmux.h | 16 unsigned int n2; member in struct:gsm_config
|
| ax25.h | 89 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
99 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /external/testng/src/test/java/test/dataprovider/ |
| ParallelDataProviderTest.java | 33 public void verifyData1(ITestContext testContext, String n1, Integer n2) {
|
| /frameworks/base/libs/common_time/ |
| common_clock.cpp | 133 uint32_t n2 = 1000000 + cur_slew_; local
140 LinearTransform::reduce(&n2, &d1);
141 LinearTransform::reduce(&n2, &d2);
145 cur_trans_.a_to_b_numer = n1 * n2;
|
| /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| cplx.go | 122 var n2 Node
126 subnode(&n1, &n2, nl)
130 minus(&n2, &n6)
138 var n2 Node
144 subnode(&n1, &n2, nl)
157 ra.Left = &n2
159 ra.Type = n2.Type
169 var n2 Node
176 subnode(&n1, &n2, nl)
191 rm2.Left = &n2
[all...] |
| /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/gc/ |
| cplx.go | 122 var n2 Node
126 subnode(&n1, &n2, nl)
130 minus(&n2, &n6)
138 var n2 Node
144 subnode(&n1, &n2, nl)
157 ra.Left = &n2
159 ra.Type = n2.Type
169 var n2 Node
176 subnode(&n1, &n2, nl)
191 rm2.Left = &n2
[all...] |
| /development/ndk/platforms/android-21/include/linux/ |
| ax25.h | 101 unsigned int n2, n2count; member in struct:ax25_info_struct_deprecated
112 unsigned int n2, n2count; member in struct:ax25_info_struct
|
| /external/jacoco/org.jacoco.core/src/org/jacoco/core/analysis/ |
| NodeComparator.java | 81 public int compare(final ICoverageNode n1, final ICoverageNode n2) {
83 final ICounter c2 = n2.getCounter(entity);
|
