HomeSort by relevance Sort by last modified time
    Searched refs:n2 (Results 126 - 150 of 876) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/v8/test/cctest/compiler/
graph-builder-tester.h 198 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
199 Node* buffer[] = {n1, n2};
203 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
204 Node* buffer[] = {n1, n2, n3};
208 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
209 Node* buffer[] = {n1, n2, n3, n4};
213 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
215 Node* buffer[] = {n1, n2, n3, n4, n5};
219 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
221 Node* nodes[] = {n1, n2, n3, n4, n5, n6}
    [all...]
  /external/v8/test/unittests/compiler/
graph-reducer-unittest.cc 508 Node* n2 = graph()->NewNode(&kOpA1, n1); local
510 Node* end = graph()->NewNode(&kOpA2, n2, n3);
514 EXPECT_CALL(r1, Reduce(n2)).InSequence(s1);
541 Node* n2 = graph()->NewNode(&kOpA1, n1); local
543 Node* end = graph()->NewNode(&kOpA2, n2, n3);
553 EXPECT_EQ(&kOpB1, n2->op());
554 EXPECT_EQ(n1, n2->InputAt(0));
558 EXPECT_EQ(n2, end->InputAt(0));
566 Node* n2 = graph()->NewNode(&kOpA1, n1); local
568 Node* end = graph()->NewNode(&kOpA2, n2, n3)
659 Node* n2 = graph()->NewNode(&kOpA1, n1); local
706 Node* n2 = graph()->NewNode(&kOpA1, n1); local
735 Node* n2 = graph()->NewNode(&kOpA1, n1); local
815 Node* n2 = end->InputAt(1); local
    [all...]
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/
intconv_test.go 105 n2, ok2 := tmp.SetString(test.in, test.base)
118 if n2 != nil {
119 t.Errorf("#%d (input '%s') n2 != nil", i, test.in)
127 if ok2 && !isNormalized(n2) {
128 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2)
134 if n2.Cmp(expected) != 0 {
135 t.Errorf("#%d (input '%s') got: %s want: %d", i, test.in, n2, test.val)
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/big/
intconv_test.go 102 n2, ok2 := tmp.SetString(test.in, test.base)
115 if n2 != nil {
116 t.Errorf("#%d (input '%s') n2 != nil", i, test.in)
124 if ok2 && !isNormalized(n2) {
125 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2)
131 if n2.Cmp(expected) != 0 {
132 t.Errorf("#%d (input '%s') got: %s want: %d", i, test.in, n2, test.val)
  /prebuilts/go/darwin-x86/src/math/big/
intconv_test.go 102 n2, ok2 := tmp.SetString(test.in, test.base)
115 if n2 != nil {
116 t.Errorf("#%d (input '%s') n2 != nil", i, test.in)
124 if ok2 && !isNormalized(n2) {
125 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2)
131 if n2.Cmp(expected) != 0 {
132 t.Errorf("#%d (input '%s') got: %s want: %d", i, test.in, n2, test.val)
  /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/big/
intconv_test.go 105 n2, ok2 := tmp.SetString(test.in, test.base)
118 if n2 != nil {
119 t.Errorf("#%d (input '%s') n2 != nil", i, test.in)
127 if ok2 && !isNormalized(n2) {
128 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2)
134 if n2.Cmp(expected) != 0 {
135 t.Errorf("#%d (input '%s') got: %s want: %d", i, test.in, n2, test.val)
  /prebuilts/go/linux-x86/src/cmd/compile/internal/big/
intconv_test.go 102 n2, ok2 := tmp.SetString(test.in, test.base)
115 if n2 != nil {
116 t.Errorf("#%d (input '%s') n2 != nil", i, test.in)
124 if ok2 && !isNormalized(n2) {
125 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2)
131 if n2.Cmp(expected) != 0 {
132 t.Errorf("#%d (input '%s') got: %s want: %d", i, test.in, n2, test.val)
  /prebuilts/go/linux-x86/src/math/big/
intconv_test.go 102 n2, ok2 := tmp.SetString(test.in, test.base)
115 if n2 != nil {
116 t.Errorf("#%d (input '%s') n2 != nil", i, test.in)
124 if ok2 && !isNormalized(n2) {
125 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2)
131 if n2.Cmp(expected) != 0 {
132 t.Errorf("#%d (input '%s') got: %s want: %d", i, test.in, n2, test.val)
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-srec/
srec.exp 155 set n2 [srec_len $l2]
176 if { $a1 + $n1 < $a2 + $n2 } {
179 set ol [expr $n2 - $os2]
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/libvpx/libvpx/vp8/common/mips/dspr2/
filter_dspr2.c 133 unsigned int n1, n2, n3; local
196 "preceu.ph.qbl %[n2], %[tp2] \n\t"
200 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t"
207 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t"
216 "lbux %[n2], %[Temp4](%[cm]) \n\t"
222 "sb %[n2], 3(%[dst_ptr]) \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
272 "preceu.ph.qbl %[n2], %[tp2] \n\t"
276 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t
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
196 "preceu.ph.qbl %[n2], %[tp2] \n\t"
200 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t"
207 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t"
216 "lbux %[n2], %[Temp4](%[cm]) \n\t"
222 "sb %[n2], 3(%[dst_ptr]) \n\t"
226 [p3] "=&r" (p3), [n1] "=&r" (n1), [n2] "=&r" (n2),
272 "preceu.ph.qbl %[n2], %[tp2] \n\t"
276 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t
329 unsigned int n1, n2, n3, n4; local
629 unsigned int n1, n2, n3, n4; local
961 unsigned int n1, n2, n3; local
    [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...]
  /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/
Builder.java 78 Node n2 = it.nextNode(); local
79 if (n2 instanceof ASTgroup_body) {
80 return new Group(name, buildGroupBody((ASTgroup_body)n2));
82 else if (n2 instanceof ASTangle_addr) {
84 return new NamedMailbox(name, buildAngleAddr((ASTangle_addr)n2));
  /packages/services/Telephony/src/org/apache/james/mime4j/field/address/
Builder.java 78 Node n2 = it.nextNode(); local
79 if (n2 instanceof ASTgroup_body) {
80 return new Group(name, buildGroupBody((ASTgroup_body)n2));
82 else if (n2 instanceof ASTangle_addr) {
84 return new NamedMailbox(name, buildAngleAddr((ASTangle_addr)n2));
  /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);
  /external/libvpx/libvpx/vpx_dsp/mips/
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);
36 ST_SH4(m2, n2, m3, n3, (tmp_buf + 20 * 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...]
convolve8_avg_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"
134 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */
146 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t"
165 [p1] "=&r" (p1), [p2] "=&r" (p2), [n1] "=&r" (n1), [n2] "=&r" (n2)
196 uint32_t n1, n2; local
    [all...]
  /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/libvpx/libvpx/vp9/common/
vp9_entropy.c 787 const int n2 = counts[i][j][k][l][TWO_TOKEN]; local
    [all...]
  /external/mesa3d/src/mesa/program/
prog_noise.c 244 float n0, n1, n2; /* Noise contributions from the three corners */ local
307 n2 = 0.0f;
310 n2 = t2 * t2 * grad2(perm[ii + 1 + perm[jj + 1]], x2, y2);
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
451 n2 = 0.0f;
454 n2 =
472 return 32.0f * (n0 + n1 + n2 + n3); /* TODO: The scale factor is preliminary! */
484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local
605 n2 = 0.0f
    [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/
vp9_entropy.c 753 const int n2 = counts[i][j][k][l][TWO_TOKEN]; local
757 { n0, n1 + n2 },
758 { n1, n2 }
    [all...]
  /system/extras/simpleperf/
callchain.cpp 111 const std::unique_ptr<CallChainNode>& n2) {
113 uint64_t period2 = n2->period + n2->children_period;
  /external/v8/src/compiler/
bytecode-graph-builder.h 76 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
77 Node* buffer[] = {n1, n2};
81 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
82 Node* buffer[] = {n1, n2, n3};
86 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
87 Node* buffer[] = {n1, n2, n3, n4};
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/mips/dspr2/
vp9_convolve8_avg_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"
136 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */
148 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t"
167 [p1] "=&r" (p1), [p2] "=&r" (p2), [n1] "=&r" (n1), [n2] "=&r" (n2)
198 uint32_t n1, n2; local
    [all...]
  /external/clang/test/Sema/
struct-packed-align.c 136 extern int n2[__alignof(struct nS) == 8 ? 1 : -1];
139 extern int n2[__alignof(struct nS) == 1 ? 1 : -1];

Completed in 1556 milliseconds

1 2 3 4 56 7 8 91011>>