| /external/chromium_org/third_party/mesa/src/bin/ |
| get-pick-list.sh | 26 git log -n1 --pretty=oneline $sha | cat
|
| /external/chromium_org/v8/tools/ |
| plot-timer-events | 43 | tail -n1 | awk -F, '{print $3}'`
45 | tail -n1 | awk -F, '{print $3}'`
51 | tail -n1 | awk -F, '{print $3}'`
53 | tail -n1 | awk -F, '{print $3}'`
|
| /external/clang/test/CXX/dcl.dcl/basic.namespace/namespace.def/ |
| p8.cpp | 77 namespace redecl { inline namespace n1 { namespace in namespace:redecl
103 inline namespace n1 { namespace in namespace:redecl2
|
| /external/harfbuzz_ng/src/ |
| check-symbols.sh | 33 tail -n1 "$def"
|
| /external/libvpx/libvpx/vp9/common/ |
| vp9_treecoder.h | 73 static INLINE vp9_prob get_binary_prob(int n0, int n1) {
74 return get_prob(n0, n0 + n1);
|
| /external/mesa3d/bin/ |
| get-pick-list.sh | 26 git log -n1 --pretty=oneline $sha | cat
|
| /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/chromium/chrome/browser/bookmarks/ |
| bookmark_utils_unittest.cc | 23 const BookmarkNode* n1 = local
36 EXPECT_TRUE(nodes[0] == n1);
38 n1, ASCIIToUTF16("foo"), std::string()));
52 EXPECT_TRUE(nodes[0] == n1);
54 n1, ASCIIToUTF16("foo bar"), std::string()));
|
| /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...] |
| /external/chromium_org/third_party/sqlite/src/src/ |
| test3.c | 400 u64 n1; local
415 n1 = 0;
417 sqlite3BtreeKeySize(pCur, (i64*)&n1);
420 sqlite3_snprintf(sizeof(zBuf),zBuf, "%d", (int)(n1+n2));
447 int n1, n2, i, j; local
462 n1 = putVarint(zBuf, in);
463 if( n1>9 || n1<1 ){
464 sprintf(zErr, "putVarint returned %d - should be between 1 and 9", n1);
469 if( n1!=n2 )
[all...] |
| /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/chromium_org/third_party/sqlite/src/ext/fts1/ |
| ft_hash.c | 89 static int intCompare(const void *pKey1, int n1, const void *pKey2, int n2){
90 return n2 - n1;
102 static int ptrCompare(const void *pKey1, int n1, const void *pKey2, int n2){
122 static int strCompare(const void *pKey1, int n1, const void *pKey2, int n2){
123 if( n1!=n2 ) return 1;
124 return strncmp((const char*)pKey1,(const char*)pKey2,n1);
138 static int binCompare(const void *pKey1, int n1, const void *pKey2, int n2){
139 if( n1!=n2 ) return 1;
140 return memcmp(pKey1,pKey2,n1);
|
| /external/chromium_org/ui/message_center/ |
| notification_list.cc | 18 bool ComparePriorityTimestampSerial::operator()(Notification* n1,
20 if (n1->priority() > n2->priority()) // Higher pri go first.
22 if (n1->priority() < n2->priority())
24 return CompareTimestampSerial()(n1, n2);
27 bool CompareTimestampSerial::operator()(Notification* n1, Notification* n2) {
28 if (n1->timestamp() > n2->timestamp()) // Newer come first.
30 if (n1->timestamp() < n2->timestamp())
32 if (n1->serial_number() > n2->serial_number()) // Newer come first.
34 if (n1->serial_number() < n2->serial_number())
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 133 NodeEntry &n1 = getNode(ne.getNode1()); local
136 assert((n1.getCosts().getLength() == ne.getCosts().getRows()) &&
139 ne.setNode1AEItr(n1.addEdge(edgeItr));
343 NodeEntry &n1 = getNode(e.getNode1()); local
345 n1.removeEdge(e.getNode1AEItr());
377 unsigned n1 = std::distance(nodesBegin(), getEdgeNode1(edgeItr)); local
379 assert(n1 != n2 && "PBQP graphs shound not have self-edges.");
381 os << "\n" << n1 << " " << n2 << "\n"
432 bool operator()(Graph::NodeItr n1, Graph::NodeItr n2) const {
433 return &*n1 < &*n2
[all...] |
| /frameworks/base/services/common_time/ |
| common_clock.cpp | 131 uint32_t n1 = local_to_common_freq_numer_; local
137 // n1/d1 has already been reduced, no need to do so here.
138 LinearTransform::reduce(&n1, &d2);
144 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/chromium_org/third_party/openssl/openssl/crypto/ec/ |
| ecp_smpl.c | 649 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
672 n1 = BN_CTX_get(ctx);
685 /* n1, n2 */
688 if (!BN_copy(n1, &a->X)) goto end;
690 /* n1 = X_a */
696 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end;
697 /* n1 = X_a * Z_b^2 */
724 if (!BN_mod_sub_quick(n5, n1, n3, p)) goto end;
726 /* n5 = n1 - n3 */
750 if (!BN_mod_add_quick(n1, n1, n3, p)) goto end
813 BIGNUM *n0, *n1, *n2, *n3; local
[all...] |
| /external/openssl/crypto/ec/ |
| ecp_smpl.c | 649 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
672 n1 = BN_CTX_get(ctx);
685 /* n1, n2 */
688 if (!BN_copy(n1, &a->X)) goto end;
690 /* n1 = X_a */
696 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end;
697 /* n1 = X_a * Z_b^2 */
724 if (!BN_mod_sub_quick(n5, n1, n3, p)) goto end;
726 /* n5 = n1 - n3 */
750 if (!BN_mod_add_quick(n1, n1, n3, p)) goto end
813 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}}
|
| /system/core/rootdir/etc/ |
| init.testmenu | 6 n1=`cat /data/phoneentry1 2>/dev/null`
9 n1=${n1:-"*#06#"}
117 echo " 1: Dial: ATD $n1;"
131 "1" ) echo "Dialing $n1"; echo -e "ATD $n1;\r" >$atdev;;
134 "4" ) echo -n "Number: "; read n1; echo $n1 >/data/phoneentry1;;
|
| /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/chromium_org/third_party/mesa/src/src/mesa/program/ |
| register_allocate.h | 60 unsigned int n1, unsigned int n2);
|
| /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
|
