| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| p2.cpp | 18 namespace N0 {
33 template<> void N0::f0(int) { } // okay
36 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}}
39 template<> void N0::f0(double); // expected-warning{{C++11 extension}}
40 template<> void N0::f0(double) { }
49 namespace N0 {
73 void N0::X0<T>::ft1(T t, U u) {
77 template<typename T> T N0::X0<T>::member;
79 template<> struct N0::X0<void> { }; // expected-warning{{C++11 extension}}
80 N0::X0<void> test_X0
[all...] |
| p2-0x.cpp | 18 namespace N0 {
33 template<> void N0::f0(int) { } // okay
36 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}}
39 template<> void N0::f0(double) { }
48 namespace N0 {
72 void N0::X0<T>::ft1(T t, U u) {
76 template<typename T> T N0::X0<T>::member;
78 template<> struct N0::X0<void> { };
79 N0::X0<void> test_X0;
82 template<> struct N0::X0<const void> { }; // expected-error{{class template specialization of 'X0' must originally be d (…)
[all...] |
| /external/ceres-solver/include/ceres/internal/ |
| variadic_evaluate.h | 49 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
67 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
69 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, N8, 0> {
84 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
86 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, N7, 0, 0> {
100 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
102 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, N6, 0, 0, 0> {
115 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4,
117 struct VariadicEvaluate<Functor, T, N0, N1, N2, N3, N4, N5, 0, 0, 0, 0> {
129 template<typename Functor, typename T, int N0, int N1, int N2, int N3, int N4
[all...] |
| autodiff.h | 189 // Takes N 1st order parts, starting at index N0, and puts them in the M x N
191 template <typename JetT, typename T, int N0, int N>
197 src[i].v.template segment<N>(N0);
203 // C++0x). N0 through N5 are the dimension of the input arguments to
206 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
227 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", "
231 typedef Jet<T, N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9> JetT;
233 N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9 + num_outputs);
237 const int jet1 = N0;
238 const int jet2 = N0 + N1
[all...] |
| numeric_diff.h | 53 int N0, int N1, int N2, int N3, int N4,
61 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Call(
68 int N0, int N1, int N2, int N3, int N4,
83 int N0, int N1, int N2, int N3, int N4,
136 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>(
153 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>(
178 int N0, int N1, int N2, int N3, int N4,
182 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9,
|
| /external/clang/test/CXX/basic/basic.lookup/basic.lookup.unqual/ |
| p3.cpp | 6 namespace N0 {
|
| /external/ceres-solver/include/ceres/ |
| autodiff_cost_function.h | 155 int N0, // Number of parameters in block 0.
166 N0, N1, N2, N3, N4,
186 SizedCostFunction<M, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>
202 CostFunctor, double, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>
206 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Differentiate(
209 SizedCostFunction<M, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>
|
| numeric_diff_cost_function.h | 164 int N0 = 0, // Number of parameters in block 0.
176 N0, N1, N2, N3, N4,
204 const int kNumParameters = N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9;
206 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) +
211 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>(
228 if (N1) parameters_reference_copy[1] = parameters_reference_copy[0] + N0;
261 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, \
|
| sized_cost_function.h | 48 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
68 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", "
76 ADD_PARAMETER_BLOCK(N0);
|
| cost_function_to_functor.h | 103 int N0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
126 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", "
133 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) +
137 CHECK_EQ(N0, parameter_block_sizes[0]);
150 N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9);
154 CHECK_NE(N0, 0);
171 CHECK_NE(N0, 0);
191 CHECK_NE(N0, 0);
213 CHECK_NE(N0, 0);
237 CHECK_NE(N0, 0)
[all...] |
| gradient_checker.h | 65 int M = 0, int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0>
127 if (N0) {
128 CHECK_EQ(N0, block_sizes[0]);
178 NumericDiffCostFunction<CostFunctionToProbe, CENTRAL, M, N0, N1, N2, N3, N4>
|
| numeric_diff_functor.h | 114 int N0 = 0, int N1 = 0 , int N2 = 0, int N3 = 0, int N4 = 0,
125 N0, N1, N2, N3, N4,
134 N0, N1, N2, N3, N4,
340 N0, N1, N2, N3, N4,
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | 255 SDValue SimplifySelect(SDLoc DL, SDValue N0, SDValue N1, SDValue N2);
256 SDValue SimplifySelectCC(SDLoc DL, SDValue N0, SDValue N1, SDValue N2,
259 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
267 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
269 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
579 SDValue N0, N1, N2;
580 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse())
586 SDValue N0, SDValue N1) {
587 EVT VT = N0.getValueType();
588 if (N0.getOpcode() == Opc && isa<ConstantSDNode>(N0.getOperand(1)))
[all...] |
| TargetLowering.cpp | [all...] |
| /external/llvm/include/llvm/ADT/ |
| StringSwitch.h | 84 template<unsigned N0, unsigned N1>
85 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
90 template<unsigned N0, unsigned N1, unsigned N2>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
96 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
97 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
103 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1],
|
| /external/llvm/unittests/IR/ |
| MDBuilderTest.cpp | 84 MDNode *N0 = MDHelper.createTBAANode("Node", R);
88 EXPECT_EQ(N0, N3);
89 EXPECT_NE(N0, N1);
90 EXPECT_NE(N0, N2);
91 EXPECT_GE(N0->getNumOperands(), 2U);
94 EXPECT_TRUE(isa<MDString>(N0->getOperand(0)));
97 EXPECT_EQ(cast<MDString>(N0->getOperand(0))->getString(), "Node");
100 EXPECT_EQ(N0->getOperand(1), R);
|
| /external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.fct.default/ |
| p4.cpp | 11 namespace N0 {
|
| /external/clang/test/CXX/temp/temp.arg/temp.arg.type/ |
| p2.cpp | 22 namespace N0 {
|
| /external/chromium_org/third_party/opus/src/celt/ |
| rate.c | 150 int N0;
152 N0 = m->eBands[j+1]-m->eBands[j];
154 if (N0<<i == 1)
170 if (N0 > 2)
172 N0>>=1;
175 /* N0=1 bands can't be split down to N<2. */
176 else if (N0 <= 1)
179 N0<<=LM0;
186 N = N0;
432 int N0, N, den
[all...] |
| bands.h | 76 void haar1(celt_norm *X, int N0, int stride);
|
| bands.c | 210 int N0;
218 N0 = m->eBands[i+1]-m->eBands[i];
227 t = N0<<LM;
234 sqrt_1 = celt_rsqrt(N0<<LM);
283 for (j=0;j<N0;j++)
293 renormalise_vector(X, N0<<LM, Q15ONE);
398 int i, c, N0;
406 N0 = M*m->shortMdctSize;
415 celt_norm * OPUS_RESTRICT x = X+M*eBands[i]+c*N0;
541 static void deinterleave_hadamard(celt_norm *X, int N0, int stride, int hadamard
[all...] |
| /external/clang/test/SemaCXX/ |
| linkage-spec.cpp | 30 namespace N0 {
|
| /external/llvm/lib/Target/MSP430/ |
| MSP430ISelDAGToDAG.cpp | 145 SDValue N0 = N.getOperand(0);
147 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) {
151 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) {
156 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) {
159 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) {
163 AM.BlockAddr = cast<BlockAddressSDNode>(N0)->getBlockAddress();
164 //AM.SymbolFlags = cast<BlockAddressSDNode>(N0)->getTargetFlags();
|
| /external/clang/test/CodeGenCXX/ |
| bitfield.cpp | 9 namespace N0 {
|
| /external/llvm/lib/Target/X86/ |
| X86ISelDAGToDAG.cpp | 638 SDValue N0 = N.getOperand(0);
651 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) {
659 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) {
668 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) {
671 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) {
674 } else if (BlockAddressSDNode *BA = dyn_cast<BlockAddressSDNode>(N0)) {
697 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) {
701 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) {
706 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) {
709 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) {
[all...] |
