HomeSort by relevance Sort by last modified time
    Searched defs:N4 (Results 1 - 25 of 31) sorted by null

1 2

  /external/clang/test/CodeCompletion/
namespace-alias.cpp 1 namespace N4 {
19 // CHECK-CC1-NEXT: N4
using-namespace.cpp 1 namespace N4 {
20 // CHECK-CC1-NEXT: N4
using.cpp 1 namespace N4 {
23 // CHECK-CC1-NEXT: N4
  /external/clang/test/PCH/Inputs/
namespaces.h 42 inline namespace N4 {
  /external/clang/test/SemaTemplate/
instantiate-call.cpp 37 namespace N4 {
46 template struct N4::call_f0<int, short&>;
47 template struct N4::call_f0<N1::X0, int&>;
instantiate-expr-2.cpp 25 namespace N4 {
43 typedef N4::BinOpOverload<N1::X, N2::Y>::type XY;
45 typedef N4::BinOpOverload<N1::X, N1::X>::type XX;
47 typedef N4::BinOpOverload<N2::Y, N2::Y>::type YY;
49 typedef N4::BinOpOverload<N3::Z, N3::Z>::type ZZ;
57 namespace N4 {
65 typedef N4::UnaryOpOverload<N3::Z>::type UZ;
  /external/clang/test/PCH/
namespaces.cpp 44 inline namespace N4 { }
  /prebuilts/go/darwin-x86/test/fixedbugs/
issue4909a.go 33 const N4 = unsafe.Offsetof(p.B.X) // valid
  /prebuilts/go/linux-x86/test/fixedbugs/
issue4909a.go 33 const N4 = unsafe.Offsetof(p.B.X) // valid
  /external/libopus/celt/arm/
celt_ne10_mdct.c 51 int N, N2, N4;
67 N4 = N>>2;
70 ALLOC(f2, N4, kiss_fft_cpx);
93 for(;i<N4-((overlap+3)>>2);i++)
101 for(;i<N4;i++)
116 for(i=0;i<N4;i++)
122 t1 = t[N4+i];
143 for(i=0;i<N4;i++)
146 yr = S_MUL(fp->i,t[N4+i]) - S_MUL(fp->r,t[i]);
147 yi = S_MUL(fp->r,t[N4+i]) + S_MUL(fp->i,t[i])
    [all...]
  /external/libopus/celt/
mdct.c 123 int N, N2, N4;
146 N4 = N>>2;
149 ALLOC(f2, N4, kiss_fft_cpx);
172 for(;i<N4-((overlap+3)>>2);i++)
180 for(;i<N4;i++)
195 for(i=0;i<N4;i++)
201 t1 = t[N4+i];
225 for(i=0;i<N4;i++)
228 yr = S_MUL(fp->i,t[N4+i]) - S_MUL(fp->r,t[i]);
229 yi = S_MUL(fp->r,t[N4+i]) + S_MUL(fp->i,t[i])
    [all...]
  /external/libopus/celt/mips/
mdct_mipsr1.h 64 int N, N2, N4;
89 N4 = N>>2;
92 ALLOC(f2, N4, kiss_fft_cpx);
115 for(;i<N4-((overlap+3)>>2);i++)
123 for(;i<N4;i++)
138 for(i=0;i<N4;i++)
144 t1 = t[N4+i];
170 for(i=0;i<N4;i++)
173 yr = S_MUL_SUB(fp->i,t[N4+i] , fp->r,t[i]);
174 yi = S_MUL_ADD(fp->r,t[N4+i] ,fp->i,t[i])
    [all...]
  /external/clang/test/CodeGen/
xcore-stringtype.c 121 // CHECK: !"f{si}(s(SB){m(){b(4:si)},m(){b(2:si)},m(N4){b(4:si)},
135 struct SB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4;
151 // CHECK: !"f{si}(u(UB){m(N2){b(2:si)},m(N4){b(4:si)},m(){b(2:si)},
164 union UB{int:4; int:2; int N4:4; int N2:2; unsigned int:4; signed int:4;
  /external/clang/test/CodeGenCXX/
bitfield.cpp 284 namespace N4 {
431 // Similar to N4 except that this adds a virtual base to the picture. (PR18430)
references.cpp 250 namespace N4 {
259 // CHECK: call void @_ZN2N41AC1Ev(%"struct.N4::A"* @_ZGRZN2N41fEvE2ar_)
  /external/llvm/unittests/Analysis/
LazyCallGraphTest.cpp 437 LazyCallGraph::Node &N4 = *CG.lookup(lookupFunction(*M, "f4"));
442 EXPECT_EQ(&RC, CG.lookupRefSCC(N4));
451 EXPECT_EQ(&C, CG.lookupSCC(N4));
    [all...]
  /external/speex/libspeex/
preprocess.c 398 int N, N3, N4, M;
427 N4 = st->frame_size - N3;
477 if (N4>0)
481 st->window[i+N3+N4]=st->window[i+N3];
623 int N4 = st->frame_size - N3;
634 st->inbuf[i]=x[N4+i];
732 int N4 = st->frame_size - N3;
    [all...]
  /external/libopus/src/
opus_encoder.c     [all...]
  /external/llvm/unittests/IR/
MetadataTest.cpp 192 MDNode *n4 = MDNode::getIfExists(Context, V); local
197 EXPECT_EQ(n4, n1);
536 MDNode *N4 = MDNode::get(Context, Ops4);
543 EXPECT_FALSE(N4->isResolved());
573 EXPECT_EQ(N4, N1->getOperand(0));
574 EXPECT_EQ(N1, N4->getOperand(0));
576 EXPECT_EQ(N4, N6->getOperand(0));
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp     [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
DAGCombiner.cpp     [all...]
  /external/zxing/core/
core.jar 
  /prebuilts/tools/common/m2/repository/itext/itext/2.0.8/
itext-2.0.8.jar 
  /external/google-tv-pairing-protocol/java/jar/
bcprov-jdk15-143.jar 
  /prebuilts/misc/common/robolectric/lib/
bcprov-jdk16-1.46.jar 

Completed in 624 milliseconds

1 2