HomeSort by relevance Sort by last modified time
    Searched refs:n1 (Results 26 - 50 of 802) sorted by null

12 3 4 5 6 7 8 91011>>

  /prebuilts/go/linux-x86/src/cmd/compile/internal/arm/
ggen.go 130 var n1 gc.Node
131 gc.Regalloc(&n1, t, res)
132 gc.Cgen(nl, &n1)
139 gins(optoas(gc.OMUL, t), &n2, &n1)
140 gshift(arm.AMOVW, &n1, arm.SHIFT_AR, int32(w), &n1)
144 gins(optoas(gc.OMUL, t), &n2, &n1)
145 gshift(arm.AMOVW, &n1, arm.SHIFT_LR, int32(w), &n1)
157 // n2 * n1 -> (n1 n2
    [all...]
  /external/google-breakpad/src/testing/gtest/samples/
sample3_unittest.cc 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
  /external/opencv3/modules/cudev/include/opencv2/cudev/functional/
tuple_adapter.hpp 78 template <class Op, int n0, int n1> struct BinaryTupleAdapter
87 return op(get<n0>(t), get<n1>(t));
91 template <int n0, int n1, class Op>
92 __host__ __device__ BinaryTupleAdapter<Op, n0, n1> binaryTupleAdapter(const Op& op)
94 BinaryTupleAdapter<Op, n0, n1> a;
  /external/protobuf/gtest/samples/
sample3_unittest.cc 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
  /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
sample3_unittest.cc 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
  /external/webrtc/webrtc/system_wrappers/include/
ntp_time.h 55 inline bool operator==(const NtpTime& n1, const NtpTime& n2) {
56 return n1.seconds() == n2.seconds() && n1.fractions() == n2.fractions();
58 inline bool operator!=(const NtpTime& n1, const NtpTime& n2) {
59 return !(n1 == n2);
  /ndk/sources/host-tools/toolbox/
cmp_win.c 70 int n1, n2, ret = 0; local
72 n1 = fread(buf1, 1, BUFSIZE, f1);
74 ret = (n1 != n2) || memcmp(buf1, buf2, n1) != 0;
75 } while (!ret && n1 == BUFSIZE);
  /ndk/sources/third_party/googletest/googletest/samples/
sample3_unittest.cc 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
107 EXPECT_EQ(2 * n1->element(), n2->element());
  /external/bzip2/
bzmore 16 n1=''; n2='\c'
18 n1='-n'; n2=''
44 echo $n1 "--More--(Next file: $FILE)$n2"
  /external/elfutils/libelf/
elf32_fsize.c 67 #define local_strong_alias(n1, n2) strong_alias (n1, n2)
  /external/v8/src/compiler/
graph.h 48 Node* NewNode(const Operator* op, Node* n1) { return NewNode(op, 1, &n1); }
49 Node* NewNode(const Operator* op, Node* n1, Node* n2) {
50 Node* nodes[] = {n1, n2};
53 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3) {
54 Node* nodes[] = {n1, n2, n3};
57 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4) {
58 Node* nodes[] = {n1, n2, n3, n4};
61 Node* NewNode(const Operator* op, Node* n1, Node* n2, Node* n3, Node* n4,
63 Node* nodes[] = {n1, n2, n3, n4, n5}
    [all...]
  /prebuilts/go/darwin-x86/src/cmd/compile/internal/gc/
cgen.go 51 var n1 Node
52 Tempname(&n1, n.Type)
53 Cgen_eface(n, &n1)
54 cgen_wb(&n1, res, wb)
74 var n1 Node
75 Tempname(&n1, n.Type)
76 Cgen(n, &n1)
77 cgen_wb(&n1, res, wb)
93 var n1 Node
94 Tempname(&n1, n.Type
    [all...]
  /prebuilts/go/linux-x86/src/cmd/compile/internal/gc/
cgen.go 51 var n1 Node
52 Tempname(&n1, n.Type)
53 Cgen_eface(n, &n1)
54 cgen_wb(&n1, res, wb)
74 var n1 Node
75 Tempname(&n1, n.Type)
76 Cgen(n, &n1)
77 cgen_wb(&n1, res, wb)
93 var n1 Node
94 Tempname(&n1, n.Type
    [all...]
  /art/test/963-default-range-smali/src/
Iface.java 17 public default String SayHi(String n1,
  /external/clang/test/Sema/
attr-section.c 13 __attribute__((section("NEAR,x"))) int n1; // expected-error {{'section' attribute only applies to functions and global variables}} local
  /external/llvm/utils/
GetRepositoryPath 22 git remote -v | grep 'fetch' | awk '{ print $2 }' | head -n1
  /libcore/ojluni/src/main/java/sun/misc/
ASCIICaseInsensitiveComparator.java 41 int n1=s1.length(), n2=s2.length(); local
42 int minLen = n1 < n2 ? n1 : n2;
55 return n1 - n2;
  /external/iproute2/ip/
rtmon.c 34 struct nlmsghdr *n1 = (void*)buf; local
37 n1->nlmsg_type = NLMSG_TSTAMP;
38 n1->nlmsg_flags = 0;
39 n1->nlmsg_seq = 0;
40 n1->nlmsg_pid = 0;
41 n1->nlmsg_len = NLMSG_LENGTH(4*2);
43 ((__u32*)NLMSG_DATA(n1))[0] = tv.tv_sec;
44 ((__u32*)NLMSG_DATA(n1))[1] = tv.tv_usec;
45 fwrite((void*)n1, 1, NLMSG_ALIGN(n1->nlmsg_len), fp)
    [all...]
  /external/v8/test/unittests/compiler/
value-numbering-reducer-unittest.cc 47 Node* n1 = graph()->NewNode(&kOp1, na); local
49 EXPECT_FALSE(Reduce(n1).Changed());
56 Node* n1 = graph()->NewNode(&kOp1, n0); local
57 EXPECT_FALSE(Reduce(n1).Changed());
58 n1->Kill();
66 Node* n1 = graph()->NewNode(&op); local
68 EXPECT_FALSE(Reduce(n1).Changed());
83 Node* n1 = graph()->NewNode(&op1, static_cast<int>(input_count), inputs); local
84 Reduction r1 = Reduce(n1);
92 EXPECT_EQ(n1, r2.replacement())
    [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-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/
test_object_graph.py 50 n1 = Node("n1")
55 n1b = Node("n1")
60 graph.addNode(n1)
64 self.assertTrue(n1 in graph)
66 self.assertTrue("n1" in graph)
69 self.assertTrue(graph.findNode(n1) is n1)
70 self.assertTrue(graph.findNode(n1b) is n1)
73 self.assertTrue(graph.findNode("n1") is n1
    [all...]
  /prebuilts/go/darwin-x86/pkg/bootstrap/src/bootstrap/compile/internal/arm/
ggen.go 133 var n1 gc.Node
134 gc.Regalloc(&n1, t, res)
135 gc.Cgen(nl, &n1)
142 gins(optoas(gc.OMUL, t), &n2, &n1)
143 gshift(arm.AMOVW, &n1, arm.SHIFT_AR, int32(w), &n1)
147 gins(optoas(gc.OMUL, t), &n2, &n1)
148 gshift(arm.AMOVW, &n1, arm.SHIFT_LR, int32(w), &n1)
160 // n2 * n1 -> (n1 n2
    [all...]
  /prebuilts/go/linux-x86/pkg/bootstrap/src/bootstrap/compile/internal/arm/
ggen.go 133 var n1 gc.Node
134 gc.Regalloc(&n1, t, res)
135 gc.Cgen(nl, &n1)
142 gins(optoas(gc.OMUL, t), &n2, &n1)
143 gshift(arm.AMOVW, &n1, arm.SHIFT_AR, int32(w), &n1)
147 gins(optoas(gc.OMUL, t), &n2, &n1)
148 gshift(arm.AMOVW, &n1, arm.SHIFT_LR, int32(w), &n1)
160 // n2 * n1 -> (n1 n2
    [all...]
  /prebuilts/go/darwin-x86/test/bench/go1/
gob_test.go 52 n1 := new(JSONNode)
53 *n1 = *n
54 if len(n1.Kids) == 0 {
55 n1.Kids = nil
57 for i, k := range n1.Kids {
58 n1.Kids[i] = gobNode(k)
61 return n1
  /prebuilts/go/linux-x86/test/bench/go1/
gob_test.go 52 n1 := new(JSONNode)
53 *n1 = *n
54 if len(n1.Kids) == 0 {
55 n1.Kids = nil
57 for i, k := range n1.Kids {
58 n1.Kids[i] = gobNode(k)
61 return n1

Completed in 666 milliseconds

12 3 4 5 6 7 8 91011>>