| /system/core/fs_mgr/ |
| fs_mgr.cpp | 523 char *n2; local
527 n2 = strdup(in2);
530 remove_trailing_slashes(n2);
532 ret = !strcmp(n1, n2);
535 free(n2);
[all...] |
| /external/google-breakpad/src/testing/gtest/test/ |
| gtest_unittest.cc | 2407 const int n2 = 2; local
2425 const int n2 = 2; local
2442 int n2 = 0; local
2453 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/googletest/googletest/test/ |
| gtest_unittest.cc | 2269 const int n2 = 2; local
2287 const int n2 = 2; local
2304 int n2 = 0; local
2315 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/v8/testing/gtest/test/ |
| gtest_unittest.cc | 2269 const int n2 = 2; local
2287 const int n2 = 2; local
2304 int n2 = 0; local
2315 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/vulkan-validation-layers/tests/gtest-1.7.0/test/ |
| gtest_unittest.cc | 2262 const int n2 = 2; local
2280 const int n2 = 2; local
2297 int n2 = 0; local
2308 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /prebuilts/ndk/r11/sources/third_party/googletest/googletest/test/ |
| gtest_unittest.cc | 2271 const int n2 = 2; local
2289 const int n2 = 2; local
2306 int n2 = 0; local
2317 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /prebuilts/ndk/r13/sources/third_party/googletest/googletest/test/ |
| gtest_unittest.cc | 2271 const int n2 = 2; local
2289 const int n2 = 2; local
2306 int n2 = 0; local
2317 n1++, n2++, n3++, n4++, n5++) local
[all...] |
| /external/ImageMagick/www/api/ |
| quantize.php | 84 <p>n2: Number of pixels whose color is not represented in a node at lower depth in the tree; initially, n2 = 0 for all nodes except leaves of the tree.</p>
86 <p>Sr, Sg, Sb: Sums of the red, green, and blue component values for all pixels not classified at a lower depth. The combination of these sums and n2 will ultimately characterize the mean color of a set of pixels represented by this node.</p>
90 <p>Reduction repeatedly prunes the tree until the number of nodes with n2 > 0 is less than or equal to the maximum number of colors allowed in the output image. On any given iteration over the tree, it selects those nodes whose E count is minimal for pruning and merges their color statistics upward. It uses a pruning threshold, Ep, to govern node selection as follows:</p>
95 <dd> Ep = 0 while number of nodes with (n2 > 0) > required maximum number of colors prune all nodes such that E <= Ep Set Ep to minimum E in remaining nodes </dd>
99 <dd> When a node to be pruned has offspring, the pruning procedure invokes itself recursively in order to prune the tree from the leaves upward. n2, Sr, Sg, and Sb in a node being pruned are always added to the corresponding data in that node's parent. This retains the pruned node's color characteristics for later averaging. </dd>
101 <dd> For each node, n2 pixels exist for which that node represents the smallest volume in RGB space containing those pixel's colors. When n2 > 0 the node will uniquely define a color in the output image. At the beginning of reduction, n2 = 0 for all nodes except a the leaves of the tree which represent colors present in the input image. </dd>
103 <dd> The other pixel count, n1, indicates the total number of colors within the cubic volume which the node represents. This includes n1 - n2 pixels whose colors should be defined by nodes at a lower level in the tree. </dd
[all...] |
| /external/clang/test/CXX/expr/expr.const/ |
| p2-0x.cpp | 15 int n2[this1]; // expected-warning {{variable length array}} local
16 (void)n1, (void)n2;
231 constexpr int n2 = 65536 * 32768; // expected-error {{constant expression}} expected-note {{value 2147483648 is outside the range of }} member in namespace:UndefinedBehavior::Overflow
|
| /external/icu/icu4c/source/test/intltest/ |
| svccoll.cpp | 349 int32_t n1, n2, n3; local
403 n2 = checkAvailable("after registerFactory");
404 assertTrue("count after > count before", n2 > n1);
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.modifiers/string_replace/ |
| size_size_size_char.pass.cpp | 13 // replace(size_type pos, size_type n1, size_type n2, charT c);
25 typename S::size_type n2, typename S::value_type c,
32 s.replace(pos, n1, n2, c);
37 typename S::size_type rlen = n2;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/strings/basic.string/string.modifiers/string_replace/ |
| size_size_size_char.pass.cpp | 14 // replace(size_type pos, size_type n1, size_type n2, charT c);
27 typename S::size_type n2, typename S::value_type c,
34 s.replace(pos, n1, n2, c);
39 typename S::size_type rlen = n2;
|
| /external/bzip2/ |
| bzlib.c | 970 Int32 n, n2, ret; local
996 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
998 if (n != n2 || ferror(bzf->handle))
1030 Int32 n, n2, ret; local
1055 n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar),
[all...] |
| /external/v8/src/compiler/ |
| raw-machine-assembler.h | 781 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2) {
782 return AddNode(common()->Phi(rep, 2), n1, n2, graph()->start());
784 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3) {
785 return AddNode(common()->Phi(rep, 3), n1, n2, n3, graph()->start());
787 Node* Phi(MachineRepresentation rep, Node* n1, Node* n2, Node* n3, Node* n4) {
788 return AddNode(common()->Phi(rep, 4), n1, n2, n3, n4, graph()->start());
|
| /external/valgrind/coregrind/m_debuginfo/ |
| image.c | 353 ULong n1, ULong n2, ULong n3 )
361 write_ULong_le(&f->data[4 + 1*8], n2);
392 /*OUT*/ULong* n1, /*OUT*/ULong* n2 )
400 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
432 /*OUT*/ULong* n1, /*OUT*/ULong* n2, /*OUT*/ULong* n3,
442 *n2 = read_ULong_le(&fr->data[4 + 1*8]);
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
| ldblib.c | 248 int n2 = checkupval(L, 3, 4);
local
251 lua_upvaluejoin(L, 1, n1, 3, n2);
|
| /external/desugar/java/com/google/devtools/common/options/ |
| IsolatedOptionsData.java | 281 String n2 = f2.getAnnotation(Option.class).name();
282 return n1.compareTo(n2);
|
| /external/icu/android_icu4j/src/main/tests/android/icu/dev/test/collator/ |
| CollationServiceTest.java | 265 int n2 = checkAvailable("after registerFactory"); local
304 assertTrue("register increases count", n2>n1);
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| CollationServiceTest.java | 264 int n2 = checkAvailable("after registerFactory"); local
303 assertTrue("register increases count", n2>n1);
|
| /external/skia/third_party/lua/src/ |
| ldblib.c | 248 int n2 = checkupval(L, 3, 4); local
251 lua_upvaluejoin(L, 1, n1, 3, n2);
|
| /external/syslinux/com32/lua/src/ |
| ldblib.c | 248 int n2 = checkupval(L, 3, 4); local
251 lua_upvaluejoin(L, 1, n1, 3, n2);
|
| /frameworks/base/core/java/android/text/format/ |
| TimeFormatter.java | 238 int n2 = (wallTime.getHour() % 12 != 0) ? (wallTime.getHour() % 12) : 12; local
239 numberFormatter.format(getFormat(modifier, "%2d", "%2d", "%d", "%02d"), n2); local
|
| /frameworks/base/services/tests/notification/src/com/android/server/notification/ |
| NotificationComparatorTest.java | 111 Notification n2 = new Notification.Builder(mContext, TEST_CHANNEL_ID) local
117 callPkg, 1, "highcall", callUid, callUid, n2,
|
| /hardware/broadcom/wlan/bcmdhd/dhdutil/ |
| dhdu.c | 176 "logstamp [<n1>] [<n2>] -- add a message to the log"},
1060 int n1, n2; local
1063 n2 = (int)((unsigned char)*inptr++);
1064 if (!isxdigit(n1) || !isxdigit(n2)) {
1066 (isxdigit(n1) ? n2 : n1));
1072 n2 = isdigit(n2) ? (n2 - '0')
1073 : ((islower(n2) ? (toupper(n2)) : n2) - 'A' + 10)
[all...] |
| /toolchain/binutils/binutils-2.25/binutils/ |
| stabs.c | 1657 bfd_signed_vma n2, n3; local
[all...] |
