HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 101 - 125 of 621) sorted by null

1 2 3 45 6 7 8 91011>>

  /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/mpl/aux_/
arithmetic_op.hpp 46 template< typename T, T n1, T n2 >
49 BOOST_STATIC_CONSTANT(T, value = (n1 AUX778076_OP_TOKEN n2));
58 template< typename N1, typename N2 > struct apply
62 typename N1::value_type
65 , ( BOOST_MPL_AUX_VALUE_WKND(N1)::value
72 typename N1::value_type
75 , N1::value
  /system/core/include/utils/
Unicode.h 41 int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2);
44 int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2);
  /external/libvorbis/lib/
block.c 746 int n1=ci->blocksizes[1]>>(hs+1); local
757 thisCenter=n1;
761 prevCenter=n1;
776 for(i=0;i<n1;i++)
777 pcm[i]=pcm[i]*w[n1-i-1] + p[i]*w[i];
781 float *pcm=v->pcm[j]+prevCenter+n1/2-n0/2;
791 float *p=vb->pcm[j]+n1/2-n0/2;
794 for(;i<n1/2+n0/2;i++)
818 v->centerW=n1;
940 int n1=ci->blocksizes[1]>>(hs+1) local
    [all...]
  /external/libvpx/libvpx/vpx_dsp/mips/
convolve8_vert_dspr2.c 35 uint32_t n1, n2; local
76 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
85 "dpa.w.ph $ac1, %[n1], %[vector1b] \n\t"
90 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
99 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
113 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
123 "dpa.w.ph $ac1, %[n1], %[vector3b] \n\t"
129 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
142 "dpa.w.ph $ac3, %[n1], %[vector3b] \n\t"
158 [n1] "=&r" (n1), [n2] "=&r" (n2)
189 uint32_t n1, n2; local
    [all...]
idct32x32_msa.c 15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
18 LD_SH8(input, 32, m0, n0, m1, n1, m2, n2, m3, n3);
20 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3,
21 m0, n0, m1, n1, m2, n2, m3, n3);
24 ST_SH8(m0, n0, m1, n1, m2, n2, m3, n3, (tmp_buf), 8);
29 LD_SH8((input + 16), 32, m0, n0, m1, n1, m2, n2, m3, n3);
31 TRANSPOSE8x8_SH_SH(m0, n0, m1, n1, m2, n2, m3, n3,
32 m0, n0, m1, n1, m2, n2, m3, n3);
35 ST_SH4(m0, n0, m1, n1, (tmp_buf + 16 * 8), 8);
248 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7 local
548 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/mips/dspr2/
vp9_convolve8_vert_dspr2.c 37 uint32_t n1, n2; local
78 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
87 "dpa.w.ph $ac1, %[n1], %[vector1b] \n\t"
92 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
101 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
115 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
125 "dpa.w.ph $ac1, %[n1], %[vector3b] \n\t"
131 "precrq.ph.w %[n1], %[p1], %[scratch1] \n\t" /* pixel 2 */
144 "dpa.w.ph $ac3, %[n1], %[vector3b] \n\t"
160 [n1] "=&r" (n1), [n2] "=&r" (n2)
191 uint32_t n1, n2; local
    [all...]
  /external/mesa3d/src/mesa/program/
prog_noise.c 220 float n0, n1; local
229 n1 = t1 * t1 * grad1(perm[i1 & 0xff], x1);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
299 n1 = 0.0f;
302 n1 = t1 * t1 * grad2(perm[ii + i1 + perm[jj + j1]], x1, y1);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
441 n1 = 0.0f;
444 n1
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
    [all...]
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;
300 g->nodes[n1].adjacency_count++;
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);
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-srec/
srec.exp 153 set n1 [srec_len $l1]
176 if { $a1 + $n1 < $a2 + $n2 } {
177 set ol [expr $n1 - $os1]
194 if { $a1 + $n1 < $a2 + $n2 } {
195 set l2 [srec_trim $l2 [expr ($a2 + $n2) - ($a1 + $n1)]]
197 } else { if { $a1 + $n1 > $a2 + $n2 } {
198 set l1 [srec_trim $l1 [expr ($a1 + $n1) - ($a2 + $n2)]]
  /external/clang/test/SemaCXX/
cxx1y-variable-templates_top_level.cpp 389 namespace n1 { namespace in namespace:nested
404 using namespace n1;
409 // expected-error@-2 {{explicit instantiation of 'pi1a<float>' not in a namespace enclosing 'n1'}}
413 template<> double pi1a<double> = 5.2; // expected-error {{variable template specialization of 'pi1a' must originally be declared in namespace 'n1'}}
418 int i1 = n1::pi1b<int>;
420 template float n1::pi1b<float>;
422 // expected-error@-2 {{explicit instantiation of 'pi1b<float>' not in a namespace enclosing 'n1'}}
424 float f1 = n1::pi1b<float>;
426 template<> double n1::pi1b<double> = 5.2; // expected-error {{cannot define or redeclare 'pi1b' here because namespace 'use_n1b' does not enclose namespace 'n1'}} \
    [all...]
  /cts/tools/dasm/src/dasm/
parser.cup 697 Insn:i Word:n1 Num:n2
698 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.number_val); :}
701 Insn:i Word:n1 Int:n2
702 {: dAsm.addOpcode(i.str_val, n1.str_val, new Integer(n2.int_val)); :}
705 Insn:i Word:n1 Word:n2
706 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val); :}
709 Insn:i Word:n1 Relative:n2
710 {: dAsm.addRelativeGoto(i.str_val, n1.str_val, n2.int_val); :}
713 Insn:i Word:n1 Word:n2 Word:n3
714 {: dAsm.addOpcode(i.str_val, n1.str_val, n2.str_val, n3.str_val); :
    [all...]
  /external/eigen/test/eigen2/
eigen2_hyperplane.cpp 33 VectorType n1 = VectorType::Random(dim).normalized(); local
36 HyperplaneType pl1(n1, p1);
42 VERIFY_IS_APPROX( n1.eigen2_dot(n1), Scalar(1) );
45 VERIFY_IS_APPROX( pl1.signedDistance(p1 + n1 * s0), s0 );
  /system/extras/tests/wifi/stress/
wifiLoadScanAssoc.c 390 unsigned int n1; local
403 for (n1 = 0; n1 < CPU_SETSIZE; n1++) {
404 if (CPU_ISSET(n1, &availCPU)) { numAvailCPU++; }
  /toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/
ar.exp 40 set n1 "abcdefghijklmnopqrstuvwxyz1"
42 set file1 tmpdir/$n1
46 remote_file host delete $n1
50 set status [catch "set f [open tmpdir/$n1 w]" errs]
52 verbose -log "open tmpdir/$n1 returned $errs"
83 remote_upload host $file1 tmpdir/$n1
86 set f [open tmpdir/$n1 r]
90 verbose -log "reading tmpdir/$n1 returned $string"
103 remote_file build delete tmpdir/$n1
108 if ![string match "$n1*$n2" $got]
    [all...]
  /toolchain/binutils/binutils-2.25/ld/
ldctor.c 158 const char *n1; local
163 n1 = (*pe1)->name;
164 if (n1 == NULL)
165 n1 = "";
174 prio1 = ctor_prio (n1);
  /external/libvpx/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
195 "preceu.ph.qbr %[n1], %[tp2] \n\t"
199 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
205 "preceu.ph.qbl %[n1], %[tn2] \n\t"
209 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
271 "preceu.ph.qbr %[n1], %[tp2] \n\t"
275 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3)
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
195 "preceu.ph.qbr %[n1], %[tp2] \n\t"
199 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
205 "preceu.ph.qbl %[n1], %[tn2] \n\t"
209 "dpa.w.ph $ac2, %[n1], %[vector3b] \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
271 "preceu.ph.qbr %[n1], %[tp2] \n\t"
275 "dpa.w.ph $ac3, %[n1], %[vector1b] \n\t"
297 [n1] "=&r" (n1), [n2] "=&r" (n2), [n3] "=&r" (n3)
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [all...]
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 73 // Cycle: n1->n2->n1
77 uptr n1 = d.newNode(1); local
79 EXPECT_FALSE(d.onLock(&dtls, n1));
82 d.onUnlock(&dtls, n1);
85 EXPECT_EQ(0U, d.findPathToLock(&dtls, n1, path, 1));
86 EXPECT_EQ(2U, d.findPathToLock(&dtls, n1, path, 10));
87 EXPECT_EQ(2U, d.findPathToLock(&dtls, n1, path, 2));
88 EXPECT_TRUE(d.onLock(&dtls, n1));
89 EXPECT_EQ(path[0], n1);
101 uptr n1 = d.newNode(1); local
    [all...]
  /external/icu/android_icu4j/src/main/java/android/icu/impl/
Grego.java 128 long n1 = floorDivide(rem[0], 365, rem); local
130 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
132 if (n100 == 4 || n1 == 4) {
  /external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
Grego.java 126 long n1 = floorDivide(rem[0], 365, rem); local
128 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
130 if (n100 == 4 || n1 == 4) {
  /external/libvpx/libvpx/vp9/common/
vp9_entropy.c 786 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
    [all...]
  /external/v8/src/compiler/
ast-graph-builder.h 175 Node* NewNode(const Operator* op, Node* n1) {
176 return MakeNode(op, 1, &n1, false);
179 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
180 Node* buffer[] = {n1, n2};
184 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
185 Node* buffer[] = {n1, n2, n3};
189 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
190 Node* buffer[] = {n1, n2, n3, n4};
194 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
196 Node* buffer[] = {n1, n2, n3, n4, n5}
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_entropy.c 752 const int n1 = counts[i][j][k][l][ONE_TOKEN]; local
757 { n0, n1 + n2 },
758 { n1, n2 }
    [all...]
  /system/extras/simpleperf/
callchain.cpp 110 static bool CompareNodeByPeriod(const std::unique_ptr<CallChainNode>& n1,
112 uint64_t period1 = n1->period + n1->children_period;
  /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/
TreeWizard.java 350 int n1 = adaptor.getChildCount(t1); local
352 if ( n1 != n2 ) {
355 for (int i=0; i<n1; i++) {
418 int n1 = adaptor.getChildCount(t1); local
420 if ( n1 != n2 ) {
423 for (int i=0; i<n1; i++) {

Completed in 1518 milliseconds

1 2 3 45 6 7 8 91011>>