Searched refs:n4 (Results 1 - 25 of 61) sorted by relevance

123

/external/dtc/tests/
H A Dphandle_format.c38 int n4; local
56 n4 = fdt_path_offset(fdt, "/node4");
57 if (n4 < 0)
58 FAIL("fdt_path_offset(/node4): %s", fdt_strerror(n4));
60 h4 = fdt_get_phandle(fdt, n4);
65 check_getprop_cell(fdt, n4, "linux,phandle", h4);
67 if (fdt_getprop(fdt, n4, "linux,phandle", NULL))
71 check_getprop_cell(fdt, n4, "phandle", h4);
73 if (fdt_getprop(fdt, n4, "phandle", NULL))
H A Dpath-references.c69 int n1, n2, n3, n4; local
99 n4 = fdt_path_offset(fdt, "/foobar/baz");
100 if (n4 < 0)
101 FAIL("fdt_path_offset(/foobar/baz): %s", fdt_strerror(n4));
103 check_ref(fdt, n4, "/foo/baz");
H A Dreferences.c79 int n1, n2, n3, n4, n5; local
94 n4 = fdt_path_offset(fdt, "/node4");
95 if (n4 < 0)
96 FAIL("fdt_path_offset(/node4): %s", fdt_strerror(n4));
103 h4 = fdt_get_phandle(fdt, n4);
/external/v8/src/compiler/
H A Dgraph.h78 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
79 Node* nodes[] = {n1, n2, n3, n4};
82 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
84 Node* nodes[] = {n1, n2, n3, n4, n5};
87 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
89 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
92 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
94 Node* nodes[] = {n1, n2, n3, n4, n5, n6, n7};
97 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
99 Node* nodes[] = {n1, n2, n3, n4, n
102 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9) argument
107 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10) argument
112 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11) argument
118 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12) argument
124 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13) argument
130 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14) argument
137 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14, Node* n15) argument
144 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14, Node* n15, Node* n16) argument
152 NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, Node* n5, Node* n6, Node* n7, Node* n8, Node* n9, Node* n10, Node* n11, Node* n12, Node* n13, Node* n14, Node* n15, Node* n16, Node* n17) argument
[all...]
H A Dast-graph-builder.h185 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) { argument
186 Node* buffer[] = {n1, n2, n3, n4};
190 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
192 Node* buffer[] = {n1, n2, n3, n4, n5};
196 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4, argument
198 Node* nodes[] = {n1, n2, n3, n4, n5, n6};
/external/syslinux/gpxe/src/drivers/net/
H A Dwlan_compat.h273 #define WLAN_LOG_ERROR4(x,n1,n2,n3,n4) printk(KERN_ERR "%s: " x , __FUNCTION__, (n1), (n2), (n3), (n4));
279 #define WLAN_LOG_WARNING4(x,n1,n2,n3,n4) printk(KERN_WARNING "%s: " x , __FUNCTION__ , (n1), (n2), (n3), (n4));
285 #define WLAN_LOG_NOTICE4(x,n1,n2,n3,n4) printk(KERN_NOTICE "%s: " x , __FUNCTION__, (n1), (n2), (n3), (n4));
291 #define WLAN_LOG_INFO4(x,n1,n2,n3,n4) printk(KERN_INFO x, (n1), (n2), (n3), (n4));
292 #define WLAN_LOG_INFO5(x,n1,n2,n3,n4,n5) printk(KERN_INFO x, (n1), (n2), (n3), (n4), (n
[all...]
/external/tensorflow/tensorflow/compiler/xla/
H A Darray4d_test.cc33 return (idx[3] + idx[2] * arr.n4() + idx[1] * arr.n3() * arr.n4() +
34 idx[0] * arr.n2() * arr.n3() * arr.n4());
42 EXPECT_EQ(empty.n4(), 5);
52 EXPECT_EQ(fullof7.n4(), 5);
70 EXPECT_EQ(arr.n4(), 5);
85 EXPECT_EQ(arr.n4(), 1);
115 EXPECT_EQ(arr.n4(), 1);
H A Dreference_util.h288 std::vector<int64> lhs_dims = {lhs.n1(), lhs.n2(), lhs.n3(), lhs.n4()};
289 std::vector<int64> rhs_dims = {rhs.n1(), rhs.n2(), rhs.n3(), rhs.n4()};
290 std::vector<int64> out_dims = {rhs.n1(), rhs.n2(), rhs.n3(), rhs.n4()};
304 for (int64 i3 = 0; i3 < result->n4(); ++i3) {
306 i0 < lhs.n1() && i1 < lhs.n2() && i2 < lhs.n3() && i3 < lhs.n4()
311 i3 >= lhs.n4() ? i3 - lhs.n4() : i3);
394 CHECK_LE(starts[3], input.n4());
398 CHECK_LE(limits[3], input.n4());
411 for (int64 i3 = 0; i3 < result->n4();
[all...]
H A Dreference_util.cc336 operand.n4()};
350 operand.n4()};
382 i3_base + i3_win < operand.n4()) {
429 operand.n3(), operand.n4());
431 operand.n4()};
446 CHECK_EQ(window_counts[3], source.n4());
472 i3_base + i3_win < operand.n4()) {
643 for (int64 a3 = 0; a3 == 0 || (!dim_set.count(3) && a3 < array.n4());
653 i3 == 0 || (dim_set.count(3) && i3 < array.n4()); ++i3) {
656 array.n4() >
[all...]
/external/clang/test/CXX/dcl.dcl/dcl.attr/dcl.align/
H A Dp6.cpp12 extern int n4;
13 alignas(8) extern int n4;
H A Dp5.cpp6 alignas(1) alignas(2) alignas(0) int n4; // expected-error {{less than minimum alignment}} variable
/external/tensorflow/tensorflow/compiler/xla/tests/
H A Dcopy_test.cc55 void TestCopyConstantLayoutR4(size_t n1, size_t n2, size_t n3, size_t n4,
189 size_t n1, size_t n2, size_t n3, size_t n4,
191 Array4D<int32> a(n1, n2, n3, n4);
195 for (size_t l = 0; l < n4; ++l) {
196 a(i, j, k, l) = i * n4 * n3 * n2 + j * n4 * n3 + k * n4 + l;
188 TestCopyConstantLayoutR4( size_t n1, size_t n2, size_t n3, size_t n4, tensorflow::gtl::ArraySlice<int64> permutation) argument
/external/libvpx/libvpx/vpx_dsp/mips/
H A Didct32x32_msa.c15 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
19 LD_SH8((input + 8), 32, m4, n4, m5, n5, m6, n6, m7, n7);
22 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7, m4, n4, m5, n5, m6, n6, m7,
25 ST_SH4(m4, n4, m5, n5, (tmp_buf + 8 * 8), 8);
30 LD_SH8((input + 24), 32, m4, n4, m5, n5, m6, n6, m7, n7);
33 TRANSPOSE8x8_SH_SH(m4, n4, m5, n5, m6, n6, m7, n7, m4, n4, m5, n5, m6, n6, m7,
37 ST_SH4(m4, n4, m5, n5, (tmp_buf + 24 * 8), 8);
243 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n local
542 v8i16 m0, m1, m2, m3, m4, m5, m6, m7, n0, n1, n2, n3, n4, n5, n6, n7; local
[all...]
H A Dconvolve8_avg_horiz_dspr2.c31 uint32_t n1, n2, n3, n4; local
86 "preceu.ph.qbl %[n4], %[tn2] \n\t"
90 "dpa.w.ph $ac3, %[n4], %[vector4b] \n\t"
104 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t"
125 [n4] "=&r"(n4), [Temp1] "=&r"(Temp1), [Temp2] "=&r"(Temp2),
H A Dconvolve8_horiz_dspr2.c31 uint32_t n1, n2, n3, n4; local
83 "preceu.ph.qbl %[n4], %[tn2] \n\t"
87 "dpa.w.ph $ac3, %[n4], %[vector4b] \n\t"
97 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t"
114 [n4] "=&r"(n4), [Temp1] "=&r"(Temp1), [Temp2] "=&r"(Temp2),
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/
H A DTestDotTreeGenerator.cs72 + @" n4 [label=""""];" + newline
77 + @" n0 -> n4 // """" -> """"" + newline
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DGrego.java129 long n4 = floorDivide(rem[0], 1461, rem);
132 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
/external/icu/icu4c/source/i18n/
H A Dgregoimp.cpp111 int32_t n4 = ClockMath::floorDivide(doy, 1461, doy); // 4-year cycle length local
113 year = 400*n400 + 100*n100 + 4*n4 + n1;
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DGrego.java127 long n4 = floorDivide(rem[0], 1461, rem);
130 int year = (int)(400 * n400 + 100 * n100 + 4 * n4 + n1);
/external/speex/libspeex/
H A Dlsp.c532 float *pw,*n1,*n2,*n3,*n4=NULL; local
565 n4 = n3 + 1;
567 xout2 = xin2 - 2.f*x_freq[i2+1] * *n3 + *n4;
569 *n4 = *n3;
575 xout1 = xin1 + *(n4+1);
576 xout2 = xin2 - *(n4+2);
579 *(n4+1) = xin1;
580 *(n4+2) = xin2;
/external/libvpx/libvpx/vp8/common/mips/dspr2/
H A Dfilter_dspr2.c287 unsigned int n1, n2, n3, n4; local
411 "preceu.ph.qbl %[n4], %[tn1] \n\t"
414 "dpa.w.ph $ac2, %[n4], %[vector3b] \n\t"
418 : [tn1] "=&r"(tn1), [n2] "=&r"(n2), [p4] "=&r"(p4), [n4] "=&r"(n4),
481 "preceu.ph.qbl %[n4], %[tn2] \n\t"
491 [n1] "=&r"(n1), [n2] "=&r"(n2), [n3] "=&r"(n3), [n4] "=&r"(n4),
519 "dpa.w.ph $ac3, %[n4], %[vector2b] \n\t"
526 "dpa.w.ph $ac2, %[n4],
565 unsigned int n1, n2, n3, n4; local
[all...]
/external/llvm/test/MC/Mips/
H A Dsection-size.s53 n4: .byte 1 label
/external/boringssl/src/crypto/fipsmodule/ec/
H A Dsimple.c310 BIGNUM *n0, *n1, *n2, *n3, *n4, *n5, *n6; local
339 n4 = BN_CTX_get(ctx);
373 // n3, n4
376 if (!BN_copy(n3, &b->X) || !BN_copy(n4, &b->Y)) {
380 // n4 = Y_b
389 !field_mul(group, n4, &b->Y, n0, ctx)) {
392 // n4 = Y_b * Z_a^3
397 !BN_mod_sub_quick(n6, n2, n4, p)) {
401 // n6 = n2 - n4
420 !BN_mod_add_quick(n2, n2, n4,
[all...]
/external/javassist/src/test/test/javassist/convert/
H A DArrayAccessReplaceTest.java409 Number n1, n2, n3, n4;
423 n4 = ns[4];
427 n4.intValue();
/external/mesa3d/src/mesa/program/
H A Dprog_noise.c484 float n0, n1, n2, n3, n4; /* Noise contributions from the five corners */ local
627 n4 = 0.0f;
630 n4 =
637 return 27.0f * (n0 + n1 + n2 + n3 + n4); /* TODO: The scale factor is preliminary! */

Completed in 651 milliseconds

123