/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
|
/cts/apps/CtsVerifier/src/com/android/cts/verifier/audio/wavelib/ |
DspFftServer.java | 53 int ii, jj, kk, n1, n2, aa; local 58 n2 = mN / 2; 60 n1 = n2; 79 n2 = 1; 81 n1 = n2; 82 n2 = n2 + n2; 89 for (kk = jj; kk < mN; kk = kk + n2) {
|
/development/ndk/sources/android/ndk_helper/ |
vecmath.cpp | 318 float n2 = 2.0f * nearPlane; local 322 result.f_[0] = n2 / width; 327 result.f_[5] = n2 / height; 333 result.f_[14] = farPlane * rcpnmf * n2;
|
/external/bzip2/ |
huffman.c | 72 Int32 nNodes, nHeap, n1, n2, i, j, k; local 102 n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1); 104 parent[n1] = parent[n2] = nNodes; 105 weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
|
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
p6.cpp | 6 alignas(8) int n2; // expected-note {{previous declaration}} variable 7 alignas(4) extern int n2; // expected-error {{different alignment requirement (4 vs 8)}}
|
/external/clang/test/CodeGenCXX/ |
destructor-calls.cpp | 39 N n2; local
|
/external/clang/test/Modules/ |
macros.c | 195 int n2 = TOP_OTHER_REDEF2; // ok variable
|
/external/eigen/Eigen/src/Eigen2Support/Geometry/ |
AngleAxis.h | 160 Scalar n2 = q.vec().squaredNorm(); local 161 if (n2 < precision<Scalar>()*precision<Scalar>()) 169 m_axis = q.vec() / ei_sqrt(n2);
|
/external/guava/guava-gwt/test-super/com/google/common/base/super/com/google/common/base/ |
ObjectsTest.java | 67 Long n2 = Objects.firstNonNull(null, n1); local 68 assertSame(n1, n2);
|
/external/guava/guava-tests/test/com/google/common/base/ |
ObjectsTest.java | 69 Long n2 = Objects.firstNonNull(null, n1); local 70 assertSame(n1, n2);
|
/external/kernel-headers/original/uapi/linux/ |
gsmmux.h | 16 unsigned int n2; member in struct:gsm_config
|
/external/libunwind/tests/ |
Gia64-test-stack.c | 58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; local 83 n0 = n1 = n2 = n3 = 0; 90 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg + 2, &n2)) < 0 99 n2 ? '*' : ' ', v2, n3 ? '*' : ' ', v3);
|
/external/libvpx/libvpx/vpx_dsp/mips/ |
convolve8_vert_dspr2.c | 35 uint32_t n1, n2; local 80 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 86 "dpa.w.ph $ac1, %[n2], %[vector2b] \n\t" 94 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 100 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 117 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 124 "dpa.w.ph $ac1, %[n2], %[vector4b] \n\t" 133 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 143 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t" 158 [n1] "=&r" (n1), [n2] "=&r" (n2) 189 uint32_t n1, n2; local [all...] |
/external/opencv3/modules/photo/src/ |
arrays.hpp | 54 int n1,n2; member in struct:cv::Array2d 58 a(array2d.a), n1(array2d.n1), n2(array2d.n2), needToDeallocArray(false) 67 a(_a), n1(_n1), n2(_n2), needToDeallocArray(false) 72 n1(_n1), n2(_n2), needToDeallocArray(true) 74 a = new T[n1*n2]; 85 return a + i*n2; 98 int n1,n2,n3; member in struct:cv::Array3d 102 a(_a), n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(false) 107 n1(_n1), n2(_n2), n3(_n3), needToDeallocArray(true 134 int n1,n2,n3,n4; member in struct:cv::Array4d [all...] |
/external/testng/src/test/java/test/factory/ |
FactoryDataProviderTest.java | 37 private void runTest(Class<?> cls, int n1, int n2) { 47 // Assert.assertTrue(t1.getN() == n1 || t1.getN() == n2); 48 // Assert.assertTrue(t2.getN() == n1 || t2.getN() == n2); 51 Assert.assertEquals(t2.getN(), n2); local
|
/external/v8/test/cctest/compiler/ |
test-graph-visualizer.cc | 109 Node* n2 = graph.NewNode(&dummy_operator1, graph.start()); local 111 Node* n4 = graph.NewNode(&dummy_operator1, n2); 112 Node* n5 = graph.NewNode(&dummy_operator1, n2);
|
test-node.cc | 149 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 152 CHECK_USES(n0, n1, n2); 155 CHECK_INPUTS(n2, n0); 161 CHECK_USES(n2, NONE); 162 CHECK_USES(n3, n1, n2); 165 CHECK_INPUTS(n2, n3); 184 Node* n2 = graph.NewNode(&dummy_operator0); local 186 n1->ReplaceUses(n2); 190 CHECK_USES(n2, n1); 200 Node* n2 = graph.NewNode(&dummy_operator0) local 233 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 249 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 283 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 302 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 331 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local 362 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local 385 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local 413 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 437 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 466 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 502 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local 512 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local 522 Node* n2 = graph.NewNode(&dummy_operator2, n0, n1); local 531 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); local 539 Node* n2 = graph.NewNode(&dummy_operator2, n0, n0); local 577 Node* n2 = graph.NewNode(&dummy_operator0); local 591 Node* n2 = graph.NewNode(&dummy_operator0); local 605 Node* n2 = graph.NewNode(&dummy_operator0); local 618 Node* n2 = graph.NewNode(&dummy_operator0); local 630 Node* n2 = graph.NewNode(&dummy_operator0); local 650 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 663 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 676 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 688 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 700 Node* n2 = graph.NewNode(&dummy_operator1, n0); local 720 Node* n2; local [all...] |
/external/v8/test/unittests/compiler/ |
node-unittest.cc | 56 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local 58 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2)); 59 EXPECT_THAT(n1->uses(), UnorderedElementsAre(n2)); 60 EXPECT_EQ(2, n2->InputCount()); 61 EXPECT_EQ(n0, n2->InputAt(0)); 62 EXPECT_EQ(n1, n2->InputAt(1)); 83 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local 84 EXPECT_THAT(n2->inputs(), ElementsAre(n0, n1)); 105 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local 106 EXPECT_THAT(n0->uses(), UnorderedElementsAre(n1, n2)); 118 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local 139 Node* n2 = Node::New(zone(), 2, &kOp2, 2, n0_n1, false); local 173 Node* n2 = Node::New(zone(), 2, &kOp0, 0, nullptr, false); local 196 node->AppendInput(zone(), n2); local [all...] |
value-numbering-reducer-unittest.cc | 48 Node* n2 = graph()->NewNode(&kOp1, nb); local 50 EXPECT_FALSE(Reduce(n2).Changed()); 89 Node* n2 = graph()->NewNode(&op2, static_cast<int>(input_count), inputs); local 90 Reduction r2 = Reduce(n2);
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/mips/dspr2/ |
vp9_convolve8_vert_dspr2.c | 37 uint32_t n1, n2; local 82 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 88 "dpa.w.ph $ac1, %[n2], %[vector2b] \n\t" 96 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 102 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 119 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 126 "dpa.w.ph $ac1, %[n2], %[vector4b] \n\t" 135 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 145 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t" 160 [n1] "=&r" (n1), [n2] "=&r" (n2) 191 uint32_t n1, n2; local [all...] |
/libcore/luni/src/test/java/libcore/java/io/ |
OldAndroidPipedStreamTest.java | 273 int n2; field in class:OldAndroidPipedStreamTest.Fibonacci 280 n2 = 0; 284 int ret = n1 + n2; 285 n2 = n1;
|
/toolchain/binutils/binutils-2.25/ld/ |
ldctor.c | 159 const char *n2; local 166 n2 = (*pe2)->name; 167 if (n2 == NULL) 168 n2 = ""; 175 prio2 = ctor_prio (n2);
|
/bionic/libm/upstream-freebsd/lib/msun/ld128/ |
k_expl.h | 242 int n, n2; local 244 /* Reduce x to (k*ln2 + endpoint[n2] + r1 + r2). */ 255 n2 = (unsigned)n % INTERVALS; 262 /* Evaluate expl(endpoint[n2] + r1 + r2) = tbl[n2] * expl(r1 + r2). */ 266 t = tbl[n2].lo + tbl[n2].hi; 267 *hip = tbl[n2].hi; 268 *lop = tbl[n2].lo + t * (q + r1);
|
/external/boringssl/src/crypto/bn/ |
mul.c | 305 /* r is 2*n2 words in size, 306 * a and b are both n2 words in size. 307 * n2 must be a power of 2. 309 * t must be 2*n2 words in size 315 /* dnX may not be positive, but n2/2+dnX has to be */ 316 static void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2, 318 int n = n2 / 2, c1, c2; 323 /* Only call bn_mul_comba 8 if n2 == 8 and the 326 if (n2 == 8 && dna == 0 && dnb == 0) { 332 if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) 450 int i, j, n2 = n * 2; local [all...] |