| /external/llvm/unittests/IR/ |
| MetadataTest.cpp | 90 MDNode *n1 = MDNode::get(Context, V); local
91 Value *const c1 = n1;
98 EXPECT_NE(n1, n2);
100 EXPECT_EQ(n1, n3);
104 EXPECT_EQ(n4, n1);
108 EXPECT_EQ(3u, n1->getNumOperands());
109 EXPECT_EQ(s1, n1->getOperand(0));
110 EXPECT_EQ(CI, n1->getOperand(1));
111 EXPECT_EQ(s2, n1->getOperand(2));
114 EXPECT_EQ(n1, n2->getOperand(0))
[all...] |
| /external/eigen/unsupported/Eigen/src/FFT/ |
| ei_fftw_impl.h | 82 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
83 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
87 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
88 if (m_plan==NULL) m_plan = fftwf_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
124 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
125 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
129 void inv2( complex_type * dst,complex_type * src,int n0,int n1) {
130 if (m_plan==NULL) m_plan = fftw_plan_dft_2d(n0,n1,src,dst,FFTW_BACKWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT);
165 void fwd2( complex_type * dst,complex_type * src,int n0,int n1) {
166 if (m_plan==NULL) m_plan = fftwl_plan_dft_2d(n0,n1,src,dst,FFTW_FORWARD,FFTW_ESTIMATE|FFTW_PRESERVE_INPUT)
206 get_plan(n0,n1,false,dst,src).fwd2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
227 get_plan(n0,n1,true,dst,src).inv2(fftw_cast(dst), fftw_cast(src) ,n0,n1); local
[all...] |
| /external/openssl/crypto/rand/ |
| randtest.c | 72 unsigned long n1; local
86 n1=0;
118 if (s) n1++;
126 if (!((9654 < n1) && (n1 < 10346)))
128 printf("test 1 failed, X=%lu\n",n1);
|
| /external/clang/test/CodeGenCXX/ |
| nested-base-member-access.cpp | 50 N n1; local
51 n1.PR();
|
| /external/elfutils/libelf/ |
| elf32_fsize.c | 93 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
|
| /external/icu4c/samples/uciter8/ |
| uciter8.c | 45 compareIterators(UCharIterator *iter1, const char *n1,
54 log_err("%s->getIndex(length)=%d != %d=%s->getIndex(length)\n", n1, length, pos2, n2);
63 log_err("%s->move(from 0 to middle %d)=%d does not move to the middle\n", n1, middle, pos1);
77 log_err("%s->current()=U+%04x != U+%04x=%s->current() at middle=%d\n", n1, c1, c2, n2, middle);
86 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
96 log_err("%s->previous()=U+%04x != U+%04x=%s->previous() at %d (started in middle)\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
104 log_err("%s->move(start) failed\n", n1);
108 log_err("%s->hasNext() at the start returns FALSE\n", n1);
126 log_err("%s->next()=U+%04x != U+%04x=%s->next() at %d\n", n1, c1, c2, n2, iter1->getIndex(iter1, UITER_CURRENT));
132 log_err("%s->hasNext() at the end returns TRUE\n", n1);
[all...] |
| /system/extras/tests/binder/benchmarks/ |
| binderAddInts.cpp | 363 for (unsigned int n1 = 0; n1 < str.size(); n1++) {
364 if ((str[n1] > 0x20) && (str[n1] < 0x80)) {
365 stream << (char) str[n1];
376 for (unsigned int n1 = 0; n1 < CPU_SETSIZE; n1++) {
377 if (CPU_ISSET(n1, &set))
379 stream << n1; local
[all...] |
| /external/openssl/crypto/objects/ |
| obj_xref.c | 210 int n1, n2, n3; local
223 n1 = sigoid_srt[i][0];
224 rv = OBJ_find_sigid_algs(n1, &n2, &n3);
226 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
227 n1=0;
228 rv = OBJ_find_sigid_by_algs(&n1, n2, n3);
230 OBJ_nid2ln(n1), OBJ_nid2ln(n2), OBJ_nid2ln(n3));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.ops/ |
| splice_after_one.pass.cpp | 29 int n1 = 0; local
30 for (; n1 < p; ++n1, ++i)
31 assert(*i == t1[n1]);
34 for (; n1 < size_t1; ++n1, ++i)
35 assert(*i == t1[n1]);
|
| splice_after_range.pass.cpp | 30 int n1 = 0; local
31 for (; n1 < p; ++n1, ++i)
32 assert(*i == t1[n1]);
35 for (; n1 < size_t1; ++n1, ++i)
36 assert(*i == t1[n1]);
|
| /frameworks/native/opengl/tests/hwc/ |
| hwcStress.cpp | 428 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++) {
429 unsigned int idx = testRandMod(selectedFrames[n1].size());
430 sp<GraphicBuffer> gBuf = selectedFrames[n1][idx];
431 hwc_layer_1_t *layer = &list->hwLayers[n1];
492 for (unsigned int n1 = 0; n1 < numSet; n1++) {
499 for (unsigned int n1 = 0; n1 < list->numHwLayers; n1++)
[all...] |
| /system/core/sh/ |
| parser.c | 152 union node *n1, *n2, *n3; local
158 n1 = NULL;
175 if (n1 == NULL) {
176 n1 = n2;
181 n3->nbinary.ch1 = n1;
183 n1 = n3;
194 return n1;
200 return n1;
207 return n1;
212 return n1;
222 union node *n1, *n2, *n3; local
249 union node *n1, *n2, *pipenode; local
290 union node *n1, *n2; local
[all...] |
| /external/openssl/crypto/bn/ |
| bn_div.c | 137 * in reply to ((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0 (I fail to
145 # define bn_div_words(n0,n1,d0) \
149 : "a"(n1), "d"(n0), "g"(d0) \
160 # define bn_div_words(n0,n1,d0) \
164 : "a"(n1), "d"(n0), "g"(d0) \
325 BN_ULONG n0,n1,rem=0; local
328 n1=wnump[-1];
337 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0);
339 q=bn_div_words(n0,n1,d0);
343 n0, n1, d0, q)
[all...] |
| /external/aac/libSYS/include/ |
| genericStds.h | 172 #define C_ALLOC_MEM2(name,type,n1,n2) \
173 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKcalloc(n1, sizeof(type))); } \
175 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
184 #define C_AALLOC_MEM2(name,type,n1,n2) \
185 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return ((type*)FDKaalloc((n1)*sizeof(type), ALIGNMENT_DEFAULT)); } \
187 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type) + ALIGNMENT_DEFAULT + sizeof(void *)) * (n2); }
196 #define C_ALLOC_MEM2_L(name,type,n1,n2,s) \
197 type * Get ## name (int n) { FDK_ASSERT((n) < (n2)); return (type*)FDKcalloc_L(n1, sizeof(type), s); } \
199 UINT GetRequiredMem ## name(void) { return ALGN_SIZE_EXTRES((n1) * sizeof(type)) * (n2); }
208 #define C_AALLOC_MEM2_L(name,type,n1,n2,s)
[all...] |
| /external/guava/guava-tests/test/com/google/common/base/ |
| ObjectsTest.java | 67 Long n1 = new Long(42); local
68 Long n2 = Objects.firstNonNull(null, n1);
69 assertSame(n1, n2);
|
| /external/tremolo/Tremolo/ |
| mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| NodeSorter.java | 117 * @param n1 First node to use in compare
127 NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)
140 n1Num = ((Double) n1.m_key1Value).doubleValue();
145 n1Num = ((Double) n1.m_key2Value).doubleValue();
152 double n1Num = (double)n1.m_keyValue[kIndex];
159 XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node,
174 result = compare(n1, n2, kIndex + 1, support);
203 n1String = (CollationKey) n1.m_key1Value;
208 n1String = (CollationKey) n1.m_key2Value;
215 String n1String = (String)n1.m_keyValue[kIndex]
[all...] |
| /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"
|
| /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/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) {
|
