/external/libcxx/test/std/input.output/iostream.format/output.streams/ostream.formatted/ostream.inserters.arithmetic/ |
pointer.pass.cpp | 71 int n2; local 72 os2 << &n2; local
|
/external/mesa3d/src/util/ |
register_allocate.h | 76 unsigned int n1, unsigned int n2);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/input.output/iostream.format/output.streams/ostream.formatted/ostream.inserters.arithmetic/ |
pointer.pass.cpp | 71 int n2; local 72 os2 << &n2; local
|
/system/core/libutils/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/libvpx/libvpx/vpx_dsp/mips/ |
convolve8_vert_dspr2.c | 32 uint32_t n1, n2; local 77 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 83 "dpa.w.ph $ac1, %[n2], %[vector2b] \n\t" 91 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 97 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 114 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 121 "dpa.w.ph $ac1, %[n2], %[vector4b] \n\t" 130 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 140 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t" 154 [n1] "=&r"(n1), [n2] "=&r"(n2), [scratch1] "=&r"(scratch1) 180 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, m0, n0, m1, n1, m2, n2, m3, 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, m0, n0, m1, n1, m2, n2, m3, 36 ST_SH4(m2, n2, m3, n3, (tmp_buf + 20 * 8), 8); 243 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7 local 542 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local [all...] |
convolve8_avg_dspr2.c | 32 uint32_t n1, n2; local 77 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 83 "dpa.w.ph $ac1, %[n2], %[vector2b] \n\t" 91 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 97 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 114 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 121 "dpa.w.ph $ac1, %[n2], %[vector4b] \n\t" 131 "precrq.ph.w %[n2], %[p2], %[scratch2] \n\t" /* pixel 2 */ 143 "dpa.w.ph $ac3, %[n2], %[vector4b] \n\t" 162 [n1] "=&r"(n1), [n2] "=&r"(n2), [scratch1] "=&r"(scratch1) 188 uint32_t n1, n2; local [all...] |
/external/ltp/testcases/misc/math/atof/ |
atof01.c | 312 static int checkbuf(char *str, int n1, int n2) 343 fprintf(temp, "\tn1 = %d, n2 = %d, buf= '%s'\n", n1, n2, buf); 347 if (ad != n2) { 349 fprintf(temp, "\tn1 = %d, n2 = %d, buf= '%s'\n", n1, n2, buf); 353 if (n2 && !dp) { 355 fprintf(temp, "\tn1 = %d, n2 = %d, buf= '%s'\n", n1, n2, buf);
|
/prebuilts/go/darwin-x86/test/ |
const4.go | 21 n2 = len(m[""]) 62 if n1 != 10 || n2 != 20 || n3 != 30 || n4 != 40 || n5 != 50 || n6 != 60 || n7 != 70 { 63 println("BUG:", n1, n2, n3, n4, n5, n6, n7) 20 n2 = len(m[""]) const
|
/prebuilts/go/darwin-x86/test/fixedbugs/ |
issue7690.go | 43 n2, _ := strconv.Atoi(m2[1]) 44 if n1+1 != n2 { 45 println("BUG: expect runtime.Stack on back to back lines, have", n1, n2)
|
/prebuilts/go/linux-x86/test/ |
const4.go | 21 n2 = len(m[""]) 62 if n1 != 10 || n2 != 20 || n3 != 30 || n4 != 40 || n5 != 50 || n6 != 60 || n7 != 70 { 63 println("BUG:", n1, n2, n3, n4, n5, n6, n7) 20 n2 = len(m[""]) const
|
/prebuilts/go/linux-x86/test/fixedbugs/ |
issue7690.go | 43 n2, _ := strconv.Atoi(m2[1]) 44 if n1+1 != n2 { 45 println("BUG: expect runtime.Stack on back to back lines, have", n1, n2)
|
/prebuilts/go/darwin-x86/src/math/big/ |
intconv_test.go | 151 n2, ok2 := tmp.SetString(test.in, test.base) 164 if n2 != nil { 165 t.Errorf("#%d (input '%s') n2 != nil", i, test.in) 173 if ok2 && !isNormalized(n2) { 174 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2) 180 if n2.Cmp(expected) != 0 { 181 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 | 151 n2, ok2 := tmp.SetString(test.in, test.base) 164 if n2 != nil { 165 t.Errorf("#%d (input '%s') n2 != nil", i, test.in) 173 if ok2 && !isNormalized(n2) { 174 t.Errorf("#%d (input '%s'): %v is not normalized", i, test.in, *n2) 180 if n2.Cmp(expected) != 0 { 181 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 | 108 unsigned int n1, n2, n3; local 165 "preceu.ph.qbl %[n2], %[tp2] \n\t" 169 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t" 176 "dpa.w.ph $ac2, %[n2], %[vector1b] \n\t" 185 "lbux %[n2], %[Temp4](%[cm]) \n\t" 191 "sb %[n2], 3(%[dst_ptr]) \n\t" 195 [n1] "=&r"(n1), [n2] "=&r"(n2), [n3] "=&r"(n3), 237 "preceu.ph.qbl %[n2], %[tp2] \n\t" 241 "dpa.w.ph $ac3, %[n2], %[vector2b] \n\t 287 unsigned int n1, n2, n3, n4; local 565 unsigned int n1, n2, n3, n4; local 870 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...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
Briggs.h | 189 &n2 = getHeuristicNodeData(n2Itr); local 193 if (n2.isHeuristic) 219 &n2 = getHeuristicNodeData(n2Itr); local 223 if (!n1.isHeuristic && !n2.isHeuristic) 242 if (n2.isHeuristic) { 243 bool n2WasAllocable = n2.isAllocable; 246 if (n2WasAllocable && !n2.isAllocable) { 247 rnAllocableList.erase(n2.rnaItr); 248 n2.rnuItr =
|
/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));
|
/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/vp9/common/ |
vp9_entropy.c | 1070 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...] |
/external/v8/src/compiler/ |
bytecode-graph-builder.h | 72 Node* NewNode(const Operator* op, Node* n1, Node* n2) { 73 Node* buffer[] = {n1, n2}; 77 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) { 78 Node* buffer[] = {n1, n2, n3}; 82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { 83 Node* buffer[] = {n1, n2, n3, n4};
|
/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];
|
/prebuilts/go/darwin-x86/src/fmt/ |
scan_test.go | 916 r := struct{ io.Reader }{strings.NewReader("1\n2\n")} [all...] |