| /external/chromium_org/v8/test/cctest/compiler/ |
| test-node.cc | 39 Node* n0 = graph.NewNode(&dummy_operator); local
40 Node* n2 = graph.NewNode(&dummy_operator, n0);
42 CHECK(n0 == n2->InputAt(0));
48 Node* n0 = graph.NewNode(&dummy_operator); local
50 Node* n2 = graph.NewNode(&dummy_operator, n0, n1);
52 CHECK(n0 == n2->InputAt(0));
59 Node* n0 = graph.NewNode(&dummy_operator); local
61 Node* n2 = graph.NewNode(&dummy_operator, n0, n1, n1);
63 CHECK(n0 == n2->InputAt(0));
83 Node* n0 = graph.NewNode(&dummy_operator) local
109 Node* n0 = graph.NewNode(&dummy_operator); local
120 Node* n0 = graph.NewNode(&dummy_operator); local
134 Node* n0 = graph.NewNode(&dummy_operator); local
160 Node* n0 = graph.NewNode(&dummy_operator); local
182 Node* n0 = graph.NewNode(&dummy_operator); local
235 Node* n0 = graph.NewNode(&dummy_operator); local
253 Node* n0 = graph.NewNode(&dummy_operator); local
283 Node* n0 = graph.NewNode(&dummy_operator); local
301 Node* n0 = graph.NewNode(&dummy_operator); local
344 Node* n0 = graph.NewNode(&dummy_operator); local
365 Node* n0 = graph.NewNode(&dummy_operator); local
402 Node* n0 = graph.NewNode(&dummy_operator); local
420 Node* n0 = graph.NewNode(&dummy_operator); local
443 Node* n0 = graph.NewNode(&dummy_operator); local
479 Node* n0 = graph.NewNode(&dummy_operator); local
521 Node* n0 = graph.NewNode(&dummy_operator); local
543 Node* n0 = graph.NewNode(&dummy_operator); local
561 Node* n0 = graph.NewNode(&dummy_operator); local
570 Node* n0 = graph.NewNode(&dummy_operator); local
578 Node* n0 = graph.NewNode(&dummy_operator); local
589 Node* n0 = graph.NewNode(&dummy_operator); local
600 Node* n0 = graph.NewNode(&dummy_operator); local
611 Node* n0 = graph.NewNode(&dummy_operator); local
620 Node* n0 = graph.NewNode(&dummy_operator); local
634 Node* n0 = graph.NewNode(&dummy_operator); local
644 Node* n0 = graph.NewNode(&dummy_operator); local
654 Node* n0 = graph.NewNode(&dummy_operator); local
670 Node* n0 = graph.NewNode(&dummy_operator); local
685 Node* n0 = graph.NewNode(&dummy_operator); local
699 Node* n0 = graph.NewNode(&dummy_operator); local
712 Node* n0 = graph.NewNode(&dummy_operator); local
730 Node* n0 = graph.NewNode(&dummy_operator); local
745 Node* n0 = graph.NewNode(&dummy_operator); local
759 Node* n0 = graph.NewNode(&dummy_operator); local
772 Node* n0 = graph.NewNode(&dummy_operator); local
784 Node* n0 = graph.NewNode(&dummy_operator); local
801 Node* n0 = graph.NewNode(&dummy_operator); local
830 Node* n0 = graph.NewNode(&dummy_operator); local
[all...] |
| test-node-algorithm.cc | 159 Node* n0 = graph.start_node(); local
160 Node* n1 = graph.NewNode(&dummy_operator, n0);
162 n0->AppendInput(graph.main_zone(), n2);
163 graph.SetStart(n0);
170 CHECK(n0->id() == node_visitor.nodes_[0]->id());
218 Node* n0 = graph.start_node(); local
219 Node* n1 = graph.NewNode(&dummy_operator, n0);
220 Node* n2 = graph.NewNode(&dummy_operator, n0);
222 Node* n4 = graph.NewNode(&dummy_operator, n0);
224 n0->AppendInput(graph.main_zone(), n3)
[all...] |
| test-schedule.cc | 34 Node* n0 = graph.NewNode(&dummy_operator); local
40 schedule.AddNode(entry, n0);
43 CHECK_EQ(entry, schedule.block(n0));
45 CHECK(schedule.SameBasicBlock(n0, n1));
81 Node* n0 = graph.NewNode(&dummy_operator); local
82 Node* b = graph.NewNode(common.Branch(), n0);
105 Node* n0 = graph.NewNode(&dummy_operator); local
107 schedule.AddReturn(entry, n0);
119 Node* n0 = graph.NewNode(&dummy_operator); local
121 schedule.AddThrow(entry, n0);
[all...] |
| /external/openssl/crypto/bn/asm/ |
| sparcv9a-mont.pl | 79 $n0="%i4"; # const BN_ULONG *n0,
91 $n0="%g4"; # reassigned(!) to "64-bit" register
140 ld [%i4+0],$n0 ! $n0 reassigned, remember?
144 or %o0,$n0,$n0 ! $n0=n0[1].n0[0
[all...] |
| armv4-mont.pl | 52 $n0="r8";
117 ldr $n0,[$_n0] @ &n0
121 ldr $n0,[$n0] @ *n0
125 str $n0,[$_n0] @ save n0 value
126 mul $n0,$alo,$n0 @ "tp[0]"*n
[all...] |
| ppc64-mont.pl | 106 $n0="r7";
152 $N0="f20"; $N1="f21"; $N2="f22"; $N3="f23";
245 ld $n0,0($n0) ; pull n0[0] value
249 mr $t1,$n0
252 lwz $n0,0($t1) ; pull n0[0,1] value
257 insrdi $n0,$t1,32,0
271 mulld $t7,$t7,$n0 ; tp[0]*n
[all...] |
| armv4-mont.S | 48 ldr r8,[r0,#14*4] @ &n0
52 ldr r8,[r8] @ *n0
56 str r8,[r0,#14*4] @ save n0 value
57 mul r8,r10,r8 @ "tp[0]"*n0
59 umlal r10,r12,r6,r8 @ np[0]*n0+"t[0]"
69 umlal r12,r14,r6,r8 @ np[j]*n0
79 ldr r8,[r0,#14*4] @ restore n0
100 umlal r10,r12,r6,r8 @ np[0]*n0+"tp[0]"
110 umlal r12,r14,r6,r8 @ np[j]*n0
123 ldr r8,[r0,#14*4] @ restore n0
[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/chromium_org/third_party/boringssl/src/crypto/bn/asm/ |
| armv4-mont.pl | 52 $n0="r8";
118 ldr $n0,[$_n0] @ &n0
122 ldr $n0,[$n0] @ *n0
126 str $n0,[$_n0] @ save n0 value
127 mul $n0,$alo,$n0 @ "tp[0]"*n
[all...] |
| /external/chromium_org/third_party/libvpx/source/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/libvpx/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);
|
| /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);
|
| /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;
86 || (ret = unw_get_reg (&c, UNW_IA64_NAT + reg, &n0)) < 0
98 n0 ? '*' : ' ', v0, n1 ? '*' : ' ', v1,
134 || (ret = unw_get_reg (&c, UNW_IA64_NAT + 33 + l, &n0)) < 0)
139 if (!n0)
144 if (n0)
|
| /external/chromium_org/third_party/boringssl/src/crypto/ec/ |
| simple.c | 617 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
638 n0 = BN_CTX_get(ctx);
662 if (!field_sqr(group, n0, &b->Z, ctx))
664 if (!field_mul(group, n1, &a->X, n0, ctx))
668 if (!field_mul(group, n0, n0, &b->Z, ctx))
670 if (!field_mul(group, n2, &a->Y, n0, ctx))
684 if (!field_sqr(group, n0, &a->Z, ctx))
686 if (!field_mul(group, n3, &b->X, n0, ctx))
690 if (!field_mul(group, n0, n0, &a->Z, ctx)
802 BIGNUM *n0, *n1, *n2, *n3; local
[all...] |
| /external/openssl/crypto/ec/ |
| ecp_smpl.c | 650 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
672 n0 = BN_CTX_get(ctx);
696 if (!field_sqr(group, n0, &b->Z, ctx)) goto end;
697 if (!field_mul(group, n1, &a->X, n0, ctx)) goto end;
700 if (!field_mul(group, n0, n0, &b->Z, ctx)) goto end;
701 if (!field_mul(group, n2, &a->Y, n0, ctx)) goto end;
715 if (!field_sqr(group, n0, &a->Z, ctx)) goto end;
716 if (!field_mul(group, n3, &b->X, n0, ctx)) goto end;
719 if (!field_mul(group, n0, n0, &a->Z, ctx)) goto end
814 BIGNUM *n0, *n1, *n2, *n3; local
[all...] |
| /external/chromium_org/third_party/boringssl/src/crypto/bn/ |
| montgomery.c | 165 to->n0[0] = from->n0[0];
166 to->n0[1] = from->n0[1];
196 * n0[1], and we could use the #else case (with a shorter R
240 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
241 mont->n0[1] = (Ri->top > 1) ? Ri->d[1] : 0;
273 mont->n0[0] = (Ri->top > 0) ? Ri->d[0] : 0;
274 mont->n0[1] = 0;
342 BN_ULONG *ap, *np, *rp, n0, v, carry
430 BN_ULONG *ap,*np,*rp,n0,v,carry; local
[all...] |
| 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
257 n0 = wnump[0];
259 if (n0 == d0) {
262 /* n0 < d0 */
267 q = (BN_ULONG)(((((BN_ULLONG)n0) << BN_BITS2) | n1) / d0)
[all...] |
| /external/openssl/crypto/bn/ |
| bn_mont.c | 140 if (bn_mul_mont(r->d,a->d,b->d,mont->N.d,mont->n0,num))
180 BN_ULONG *ap,*np,*rp,n0,v,carry; local
203 n0=mont->n0[0];
215 t1 = rp[0] * (n0 & 0177777);
217 t2 = n0 & t2;
224 v=bn_mul_add_words(rp,np,nl,(rp[0]*n0)&BN_MASK2);
339 ctx->n0[0] = ctx->n0[1] = 0;
380 * n0[1], and we could use the #else case (with a shorter
[all...] |
| 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
327 n0=wnump[0];
329 if (n0 == d0)
331 else /* n0 < d0 */
337 q=(BN_ULONG)(((((BN_ULLONG)n0)<<BN_BITS2)|n1)/d0)
[all...] |
| /external/tremolo/Tremolo/ |
| mdct.h | 59 extern void mdct_unroll_lap(int n0,int n1,
|
| /external/eigen/test/ |
| sparse_basic.cpp | 216 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); local
218 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(j0,0,n0,cols));
220 VERIFY_IS_APPROX(m2.innerVectors(j0,n0), refMat2.block(0,j0,rows,n0));
222 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0),
223 refMat2.middleRows(j0,n0)+refMat2.middleRows(j1,n0));
225 VERIFY_IS_APPROX(m2.innerVectors(j0,n0)+m2.innerVectors(j1,n0)
306 Index n0 = internal::random<Index>(1,rows-(std::max)(j0,j1)); local
[all...] |
| /external/chromium_org/third_party/boringssl/linux-arm/crypto/bn/ |
| armv4-mont.S | 49 ldr r8,[r0,#14*4] @ &n0
53 ldr r8,[r8] @ *n0
57 str r8,[r0,#14*4] @ save n0 value
58 mul r8,r10,r8 @ "tp[0]"*n0
60 umlal r10,r12,r6,r8 @ np[0]*n0+"t[0]"
70 umlal r12,r14,r6,r8 @ np[j]*n0
80 ldr r8,[r0,#14*4] @ restore n0
101 umlal r10,r12,r6,r8 @ np[0]*n0+"tp[0]"
111 umlal r12,r14,r6,r8 @ np[j]*n0
124 ldr r8,[r0,#14*4] @ restore n0
[all...] |
| /external/iputils/ninfod/ |
| ninfod_name.c | 212 const char *s0 = s, *n0 = n; local
219 if (*(s0 + slen - 1) || *(n0 + nlen - 1))
221 while (s < s0 + slen && n < n0 + nlen) {
224 if (s + *s + 1 > s0 + slen || n + *n + 1 > n0 + nlen)
236 if (n == n0 + nlen - 1) {
238 } else if (n + 1 == n0 + nlen - 1) {
|
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| prog_noise.c | 220 float n0, n1; local
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
291 n0 = 0.0f;
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
433 n0 = 0.0f;
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0)
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
[all...] |
| /external/mesa3d/src/mesa/program/ |
| prog_noise.c | 220 float n0, n1; local
225 n0 = t0 * t0 * grad1(perm[i0 & 0xff], x0);
233 return 0.25f * (n0 + n1);
244 float n0, n1, n2; /* Noise contributions from the three corners */ local
291 n0 = 0.0f;
294 n0 = t0 * t0 * grad2(perm[ii + perm[jj]], x0, y0);
315 return 40.0f * (n0 + n1 + n2); /* TODO: The scale factor is preliminary! */
327 float n0, n1, n2, n3; /* Noise contributions from the four corners */ local
433 n0 = 0.0f;
436 n0 = t0 * t0 * grad3(perm[ii + perm[jj + perm[kk]]], x0, y0, z0)
484 float n0, n1, n2, n3, n4; \/* Noise contributions from the five corners *\/ local
[all...] |
