HomeSort by relevance Sort by last modified time
    Searched refs:n2 (Results 151 - 175 of 1010) sorted by null

1 2 3 4 5 67 8 91011>>

  /prebuilts/go/linux-x86/src/fmt/
scan_test.go 916 r := struct{ io.Reader }{strings.NewReader("1\n2\n")}
    [all...]
  /device/linaro/bootloader/edk2/StdLib/LibC/Stdio/
vfwprintf.c 617 int n, n2; /* handy integer (short term usage) */ local
702 * BEWARE, these `goto error' on error, PRINT uses `n2' and
741 n2 = (ep) - (p); \
742 if (n2 > (len)) \
743 n2 = (len); \
744 if (n2 > 0) \
745 PRINT((p), n2); \
746 PAD((len) - (n2 > 0 ? n2 : 0), (with)); \
793 n2 = 0; \
1596 int n, n2; \/* handy integer (short term usage) *\/ local
    [all...]
  /external/boringssl/src/crypto/fipsmodule/ec/
simple.c 379 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
406 n2 = BN_CTX_get(ctx);
420 /* n1, n2 */
424 if (!BN_copy(n1, &a->X) || !BN_copy(n2, &a->Y)) {
428 /* n2 = Y_a */
437 !field_mul(group, n2, &a->Y, n0, ctx)) {
440 /* n2 = Y_a * Z_b^3 */
467 !BN_mod_sub_quick(n6, n2, n4, p)) {
471 /* n6 = n2 - n4 */
490 !BN_mod_add_quick(n2, n2, n4, p))
572 BIGNUM *n0, *n1, *n2, *n3; local
    [all...]
  /external/icu/icu4c/source/test/cintltst/
cnormtst.c 1482 const UNormalizer2 *n2=unorm2_getInstance(NULL, "nfc", UNORM2_COMPOSE_CONTIGUOUS, &errorCode); local
1525 const UNormalizer2 *n2=unorm2_getNFKCInstance(&errorCode); local
1592 const UNormalizer2 *n2=unorm2_getNFCInstance(&errorCode); local
1631 const UNormalizer2 *n2=unorm2_getNFCInstance(&errorCode); local
    [all...]
  /bionic/tests/
search_test.cpp 82 node n2("a");
87 ASSERT_EQ(nullptr, tfind(&n2, &root, node_cmp));
96 ASSERT_EQ(nullptr, tfind(&n2, &root, node_cmp));
100 ASSERT_NE(nullptr, tsearch(&n2, &root, node_cmp));
  /cts/apps/CameraITS/tests/scene1/
test_capture_result.py 89 def is_close_float(n1, n2):
90 return abs(n1 - n2) < 0.05
92 def is_close_rational(n1, n2):
94 its.objects.rational_to_float(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/temp/temp.fct.spec/temp.deduct/temp.deduct.call/
p3-0x.cpp 44 int n2 = f(0); member in namespace:std_example
  /external/clang/test/Modules/
macros2.c 78 int n2 = TOP_OTHER_REDEF2; // ok variable
  /external/guice/extensions/mini/test/com/google/inject/mini/
MiniGuiceTest.java 180 assertSame(m.f1, m.n2.f1);
181 assertSame(m.f1, m.n2.f2);
183 assertSame(m.f1, m.n2.fProvider.get());
188 @Inject N n2; field in class:MiniGuiceTest.M
  /external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/
splice_after_one.pass.cpp 36 for (int n2 = f; n2 < f+1; ++n2, ++i)
37 assert(*i == t2[n2]);
splice_after_range.pass.cpp 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
  /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;
  /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/
splice_after_one.pass.cpp 34 for (int n2 = f; n2 < f+1; ++n2, ++i)
35 assert(*i == t2[n2]);
splice_after_range.pass.cpp 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
  /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/forwardlist/forwardlist.ops/
splice_after_one.pass.cpp 35 for (int n2 = f; n2 < f+1; ++n2, ++i)
36 assert(*i == t2[n2]);
splice_after_range.pass.cpp 35 for (int n2 = f; n2 < l-1; ++n2, ++i)
36 assert(*i == t2[n2]);
  /toolchain/binutils/binutils-2.25/binutils/testsuite/binutils-all/
ar.exp 41 set n2 "abcdefghijklmnopqrstuvwxyz2"
43 set file2 tmpdir/$n2
60 remote_file host delete $n2
62 set status [catch "set f [open tmpdir/$n2 w]" errs]
64 verbose -log "open tmpdir/$n2 returned $errs"
104 remote_file build delete tmpdir/$n2
108 if ![string match "$n1*$n2" $got] {
137 remote_upload host $n2 tmpdir/$n2
139 set file2 tmpdir/$n2
    [all...]
  /external/icu/icu4c/source/common/
normalizer2.cpp 298 const Normalizer2 *n2=(const Normalizer2 *)norm2; local
299 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2);
308 n2->normalize(srcString, destString, *pErrorCode);
335 const Normalizer2 *n2=(const Normalizer2 *)norm2; local
336 const Normalizer2WithImpl *n2wi=dynamic_cast<const Normalizer2WithImpl *>(n2);
361 n2->normalizeSecondAndAppend(firstString, secondString, *pErrorCode);
363 n2->append(firstString, secondString, *pErrorCode);
  /external/opencv/cvaux/src/
cvhmmobs.cpp 137 int n2 = dctSize.width, m2 = n2 / 2; local
249 if( n2 & 1 )
259 work_t t1 = buf[n2 - 1 - j];
289 if( n2 & 1 )
332 int n2 = dctSize.width, m2 = n2 / 2; local
446 if( n2 & 1 )
456 work_t t1 = buf[n2 - 1 - j];
486 if( n2 & 1
    [all...]
  /external/v8/src/compiler/
ast-graph-builder.h 175 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
176 Node* buffer[] = {n1, n2};
180 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
181 Node* buffer[] = {n1, n2, n3};
185 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
186 Node* buffer[] = {n1, n2, n3, n4};
190 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
192 Node* buffer[] = {n1, n2, n3, n4, n5};
196 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
198 Node* nodes[] = {n1, n2, n3, n4, n5, n6}
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/stlport/src/c_locale_dummy/
c_locale_dummy.c 272 const char* s1, size_t n1, const char* s2, size_t n2) {
275 while (n1 > 0 || n2 > 0) {
277 size_t bufsize2 = n2 < 63 ? n2 : 63;
284 s2 += bufsize2; n2 -= bufsize2;
292 const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) {
295 while (n1 > 0 || n2 > 0) {
297 size_t bufsize2 = n2 < 63 ? n2 : 63;
304 s2 += bufsize2; n2 -= bufsize2
    [all...]
  /prebuilts/ndk/r11/sources/cxx-stl/stlport/src/c_locale_glibc/
c_locale_glibc2.c 364 const char *s2, size_t n2) {
367 while (n1 > 0 || n2 > 0) {
369 size_t bufsize2 = n2 < 63 ? n2 : 63;
376 s2 += bufsize2; n2 -= bufsize2;
384 const wchar_t *s2, size_t n2) {
387 while (n1 > 0 || n2 > 0) {
389 size_t bufsize2 = n2 < 63 ? n2 : 63;
396 s2 += bufsize2; n2 -= bufsize2
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/stlport/src/c_locale_dummy/
c_locale_dummy.c 272 const char* s1, size_t n1, const char* s2, size_t n2) {
275 while (n1 > 0 || n2 > 0) {
277 size_t bufsize2 = n2 < 63 ? n2 : 63;
284 s2 += bufsize2; n2 -= bufsize2;
292 const wchar_t* s1, size_t n1, const wchar_t* s2, size_t n2) {
295 while (n1 > 0 || n2 > 0) {
297 size_t bufsize2 = n2 < 63 ? n2 : 63;
304 s2 += bufsize2; n2 -= bufsize2
    [all...]
  /prebuilts/ndk/r13/sources/cxx-stl/stlport/src/c_locale_glibc/
c_locale_glibc2.c 364 const char *s2, size_t n2) {
367 while (n1 > 0 || n2 > 0) {
369 size_t bufsize2 = n2 < 63 ? n2 : 63;
376 s2 += bufsize2; n2 -= bufsize2;
384 const wchar_t *s2, size_t n2) {
387 while (n1 > 0 || n2 > 0) {
389 size_t bufsize2 = n2 < 63 ? n2 : 63;
396 s2 += bufsize2; n2 -= bufsize2
    [all...]

Completed in 4050 milliseconds

1 2 3 4 5 67 8 91011>>