/external/harfbuzz_ng/src/ |
check-defs.sh | 33 tail -n1 "$def"
|
/external/libvpx/libvpx/vp9/common/ |
vp9_prob.h | 54 static INLINE vp9_prob get_binary_prob(int n0, int n1) { 55 return get_prob(n0, n0 + n1);
|
/external/libxml2/python/tests/ |
relaxng.py | 12 xmlns:ex1="http://www.example.com/n1" 24 <foo><pre1:bar1 xmlns:pre1="http://www.example.com/n1"/><pre2:bar2 xmlns:pre2="http://www.example.com/n2"/></foo>"""
|
/external/mesa3d/bin/ |
get-pick-list.sh | 26 git log -n1 --pretty=oneline $sha | cat
|
/external/selinux/secilc/docs/ |
Makefile | 12 XMLTO = $(shell which xmlto 2> /dev/null | grep / | head -n1) 13 DBLATEX = $(shell which dblatex 2> /dev/null | grep / | head -n1)
|
/external/v8/tools/ |
plot-timer-events | 57 | tail -n1 | awk -F, '{print $3}'` 59 | tail -n1 | awk -F, '{print $3}'` 65 | tail -n1 | awk -F, '{print $3}'` 67 | tail -n1 | awk -F, '{print $3}'`
|
/hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/vp9/common/ |
vp9_prob.h | 63 static INLINE vp9_prob get_binary_prob(int n0, int n1) { 64 return get_prob(n0, n0 + n1);
|
/libcore/luni/src/test/java/libcore/java/io/ |
OldAndroidPipedStreamTest.java | 272 int n1 = -1; field in class:OldAndroidPipedStreamTest.Fibonacci 276 if (n1 < 0) { 277 n1 = 0; 279 } else if (n1 == 0) { 281 n1 = 1; 284 int ret = n1 + n2; 285 n2 = n1; 286 n1 = ret;
|
/external/apache-xml/src/main/java/org/apache/xpath/objects/ |
XNodeSet.java | 749 * @param n1 First number to compare 754 abstract boolean compareNumbers(double n1, double n2); 782 * @param n1 First number to compare 785 * @return true if n1 is less than n2 787 boolean compareNumbers(double n1, double n2) 789 return n1 < n2; 818 * @param n1 First number to compare 821 * @return true if n1 is less than or equal to n2 823 boolean compareNumbers(double n1, double n2) 825 return n1 <= n2 [all...] |
/bionic/tests/ |
search_test.cpp | 81 node n1("z"); 86 ASSERT_EQ(nullptr, tfind(&n1, &root, node_cmp)); 91 void* i1 = tsearch(&n1, &root, node_cmp); 95 ASSERT_EQ(i1, tfind(&n1, &root, node_cmp)); 129 pod_node n1(123); 130 ASSERT_NE(nullptr, tsearch(&n1, &root, pod_node_cmp)); 132 // tdelete(3) leaks n1. 135 ASSERT_NE(nullptr, tdelete(&n1, &root, pod_node_cmp));
|
/external/libcxx/test/std/containers/sequences/forwardlist/forwardlist.ops/ |
splice_after_one.pass.cpp | 31 int n1 = 0; local 32 for (; n1 < p; ++n1, ++i) 33 assert(*i == t1[n1]); 36 for (; n1 < size_t1; ++n1, ++i) 37 assert(*i == t1[n1]);
|
splice_after_range.pass.cpp | 32 int n1 = 0; local 33 for (; n1 < p; ++n1, ++i) 34 assert(*i == t1[n1]); 37 for (; n1 < size_t1; ++n1, ++i) 38 assert(*i == t1[n1]);
|
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/forwardlist/forwardlist.ops/ |
splice_after_one.pass.cpp | 31 int n1 = 0; local 32 for (; n1 < p; ++n1, ++i) 33 assert(*i == t1[n1]); 36 for (; n1 < size_t1; ++n1, ++i) 37 assert(*i == t1[n1]);
|
splice_after_range.pass.cpp | 32 int n1 = 0; local 33 for (; n1 < p; ++n1, ++i) 34 assert(*i == t1[n1]); 37 for (; n1 < size_t1; ++n1, ++i) 38 assert(*i == t1[n1]);
|
/external/boringssl/src/crypto/bn/ |
div.c | 73 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to 81 # define div_asm(n0,n1,d0) \ 85 : "a"(n1), "d"(n0), "g"(d0) \ 96 # define div_asm(n0,n1,d0) \ 100 : "a"(n1), "d"(n0), "g"(d0) \ 255 BN_ULONG n0, n1, rem = 0; local 258 n1 = wnump[-1]; 267 q = (BN_ULONG)(((((BN_ULLONG)n0) << BN_BITS2) | n1) / d0); 269 q = div_asm(n0, n1, d0); 275 rem = (n1 - q * d0) & BN_MASK2 [all...] |
/frameworks/base/libs/common_time/ |
common_clock.cpp | 132 uint32_t n1 = local_to_common_freq_numer_; local 138 // n1/d1 has already been reduced, no need to do so here. 139 LinearTransform::reduce(&n1, &d2); 145 cur_trans_.a_to_b_numer = n1 * n2;
|
/libcore/luni/src/main/java/java/util/ |
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/boringssl/src/crypto/ec/ |
simple.c | 616 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local 642 n1 = BN_CTX_get(ctx); 657 /* n1, n2 */ 659 if (!BN_copy(n1, &a->X) || !BN_copy(n2, &a->Y)) { 662 /* n1 = X_a */ 666 !field_mul(group, n1, &a->X, n0, ctx)) { 669 /* n1 = X_a * Z_b^2 */ 700 if (!BN_mod_sub_quick(n5, n1, n3, p) || 704 /* n5 = n1 - n3 */ 724 if (!BN_mod_add_quick(n1, n1, n3, p) | 807 BIGNUM *n0, *n1, *n2, *n3; local [all...] |
/external/clang/test/CodeGenCXX/ |
destructor-calls.cpp | 38 N n1; local
|
/external/clang/test/FixIt/ |
fixit-vexing-parse.cpp | 80 int n1(); // expected-warning {{function declaration}} expected-note {{replace parentheses with an initializer}}
|
/external/libunwind/tests/ |
Gia64-test-stack.c | 58 unw_word_t ip, sp, bsp, v0, v1, v2, v3, n0, n1, n2, n3, cfm, sof, sol, r32; local 83 n0 = n1 = n2 = n3 = 0; 88 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg + 1, &n1)) < 0 98 n0 ? '*' : ' ', v0, n1 ? '*' : ' ', v1,
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setoolsgui/networkx/readwrite/tests/ |
test_graphml.py | 24 <node id="n1"/> 35 <edge source="n1" target="n2"/> 50 self.simple_directed_graph.add_edges_from([('n1','n2'), 79 <node id="n1"/> 93 <edge id="e1" source="n0" target="n1"> 96 <edge id="e2" source="n1" target="n3"> 116 self.attribute_graph.add_edge('n0','n1',id='e1',weight=1.0) 117 self.attribute_graph.add_edge('n1','n3',id='e2',weight=2.0) 129 <node id="n1"/> 133 <edge source="n1" target="n2"/ [all...] |
/external/opencv/cxcore/src/ |
cxsvd.cpp | 247 int nm, m1, n1; local 263 n1 = n; 301 memset( temp, 0, n1 * sizeof( temp[0] )); 304 icvMatrAXPY_64f( m1, n1 - 1, a + 1, lda, hv, temp + 1, 0 ); 305 for( k = 1; k < n1; k++ ) temp[k] *= h; 308 icvMatrAXPY_64f( m1, n1 - 1, temp + 1, 0, hv, a + 1, lda ); 323 n1--; 327 if( n1 == 0 ) 331 update_v = vT && n1 > n - nv; 335 for( j = 0; j < n1; j++ 642 int nm, m1, n1; local [all...] |
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/ |
p6.cpp | 3 alignas(4) extern int n1; // expected-note {{previous declaration}} 4 alignas(8) int n1; // expected-error {{redeclaration has different alignment requirement (8 vs 4)}} variable
|
/external/eigen/test/ |
product_large.cpp | 48 std::ptrdiff_t n1 = internal::random<int>(10,100)*16; local 50 internal::computeProductBlockingSizes<float,float>(k1,m1,n1);
|