Home
last modified time | relevance | path

Searched refs:N0 (Results 1 – 25 of 63) sorted by relevance

123

/external/clang/test/CXX/temp/temp.spec/temp.expl.spec/
Dp2.cpp18 namespace N0 { namespace
33 template<> void N0::f0(int) { } // okay in f0()
36 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}} in f0()
39 template<> void N0::f0(double); // expected-warning{{C++11 extension}}
40 template<> void N0::f0(double) { } in f0()
49 namespace N0 { namespace
73 void N0::X0<T>::ft1(T t, U u) { in ft1()
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 …]
Dp2-0x.cpp18 namespace N0 { namespace
33 template<> void N0::f0(int) { } // okay in f0()
36 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}} in f0()
39 template<> void N0::f0(double) { } in f0()
48 namespace N0 { namespace
72 void N0::X0<T>::ft1(T t, U u) { in ft1()
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'…
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp255 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; in isOneUseSetCC() local
580 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
586 SDValue N0, SDValue N1) { in ReassociateOps() argument
587 EVT VT = N0.getValueType(); in ReassociateOps()
588 if (N0.getOpcode() == Opc && isa<ConstantSDNode>(N0.getOperand(1))) { in ReassociateOps()
[all …]
DTargetLowering.cpp1069 TargetLowering::SimplifySetCC(EVT VT, SDValue N0, SDValue N1, in SimplifySetCC() argument
1085 if (isa<ConstantSDNode>(N0.getNode())) in SimplifySetCC()
1086 return DAG.getSetCC(dl, VT, N1, N0, ISD::getSetCCSwappedOperands(Cond)); in SimplifySetCC()
1094 if (N0.getOpcode() == ISD::SRL && (C1 == 0 || C1 == 1) && in SimplifySetCC()
1095 N0.getOperand(0).getOpcode() == ISD::CTLZ && in SimplifySetCC()
1096 N0.getOperand(1).getOpcode() == ISD::Constant) { in SimplifySetCC()
1098 = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue(); in SimplifySetCC()
1100 ShAmt == Log2_32(N0.getValueType().getSizeInBits())) { in SimplifySetCC()
1110 SDValue Zero = DAG.getConstant(0, N0.getValueType()); in SimplifySetCC()
1111 return DAG.getSetCC(dl, VT, N0.getOperand(0).getOperand(0), in SimplifySetCC()
[all …]
/external/ceres-solver/include/ceres/internal/
Dvariadic_evaluate.h49 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 …]
Dautodiff.h191 template <typename JetT, typename T, int N0, int N>
197 src[i].v.template segment<N>(N0); in Take1stOrderPart()
206 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
227 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", " in Differentiate()
231 typedef Jet<T, N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9> JetT; in Differentiate()
233 N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9 + num_outputs); in Differentiate()
237 const int jet1 = N0; in Differentiate()
238 const int jet2 = N0 + N1; in Differentiate()
239 const int jet3 = N0 + N1 + N2; in Differentiate()
240 const int jet4 = N0 + N1 + N2 + N3; in Differentiate()
[all …]
Dnumeric_diff.h53 int N0, int N1, int N2, int N3, int N4,
61 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Call( in EvaluateImpl()
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>( in EvaluateJacobianForParameterBlock()
153 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in EvaluateJacobianForParameterBlock()
178 int N0, int N1, int N2, int N3, int N4,
182 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9,
/external/llvm/include/llvm/ADT/
DStringSwitch.h84 template<unsigned N0, unsigned N1>
85 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
90 template<unsigned N0, unsigned N1, unsigned N2>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
96 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
97 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
103 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
/external/ceres-solver/include/ceres/
Dautodiff_cost_function.h155 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> in AutoDiffCostFunction()
202 CostFunctor, double, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9> in Evaluate()
206 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Differentiate( in Evaluate()
209 SizedCostFunction<M, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9> in Evaluate()
Dcost_function_to_functor.h103 int N0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
126 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", " in CostFunctionToFunctor()
133 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) + in CostFunctionToFunctor()
137 CHECK_EQ(N0, parameter_block_sizes[0]); in CostFunctionToFunctor()
150 N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9); in CostFunctionToFunctor()
154 CHECK_NE(N0, 0); in operator()
171 CHECK_NE(N0, 0); in operator()
191 CHECK_NE(N0, 0); in operator()
213 CHECK_NE(N0, 0); in operator()
237 CHECK_NE(N0, 0); in operator()
[all …]
Dnumeric_diff_cost_function.h164 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; in Evaluate()
206 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) + in Evaluate()
211 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in Evaluate()
228 if (N1) parameters_reference_copy[1] = parameters_reference_copy[0] + N0; in Evaluate()
261 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, \ in Evaluate()
Dgradient_checker.h65 int M = 0, int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0>
127 if (N0) { in Probe()
128 CHECK_EQ(N0, block_sizes[0]); in Probe()
178 NumericDiffCostFunction<CostFunctionToProbe, CENTRAL, M, N0, N1, N2, N3, N4> in Probe()
Dsized_cost_function.h48 int N0 = 0, int N1 = 0, int N2 = 0, int N3 = 0, int N4 = 0,
68 << "(ignore trailing 0s): " << N0 << ", " << N1 << ", " << N2 << ", " in SizedCostFunction()
76 ADD_PARAMETER_BLOCK(N0); in SizedCostFunction()
Dnumeric_diff_functor.h114 int N0 = 0, int N1 = 0 , int N2 = 0, int N3 = 0, int N4 = 0,
125 N0, N1, N2, N3, N4, in functor_() argument
134 N0, N1, N2, N3, N4, in functor_() argument
340 N0, N1, N2, N3, N4,
/external/llvm/unittests/IR/
DMDBuilderTest.cpp84 MDNode *N0 = MDHelper.createTBAANode("Node", R); in TEST_F() local
88 EXPECT_EQ(N0, N3); in TEST_F()
89 EXPECT_NE(N0, N1); in TEST_F()
90 EXPECT_NE(N0, N2); in TEST_F()
91 EXPECT_GE(N0->getNumOperands(), 2U); in TEST_F()
94 EXPECT_TRUE(isa<MDString>(N0->getOperand(0))); in TEST_F()
97 EXPECT_EQ(cast<MDString>(N0->getOperand(0))->getString(), "Node"); in TEST_F()
100 EXPECT_EQ(N0->getOperand(1), R); in TEST_F()
/external/chromium_org/third_party/openssl/openssl/crypto/bn/asm/
Dppc64-mont.pl152 $N0="f20"; $N1="f21"; $N2="f22"; $N3="f23";
343 lfd $N0,`$FRAME+96`($sp)
351 fcfid $N0,$N0
368 stfd $N0,40($nap_d) ; save n[j] in double format
390 fmadd $T0a,$N0,$na,$T0a
391 fmadd $T0b,$N0,$nb,$T0b
393 fmadd $T1a,$N0,$nc,$T1a
394 fmadd $T1b,$N0,$nd,$T1b
464 lfd $N0,`$FRAME+96`($sp)
472 fcfid $N0,$N0
[all …]
/external/openssl/crypto/bn/asm/
Dppc64-mont.pl152 $N0="f20"; $N1="f21"; $N2="f22"; $N3="f23";
343 lfd $N0,`$FRAME+96`($sp)
351 fcfid $N0,$N0
368 stfd $N0,40($nap_d) ; save n[j] in double format
390 fmadd $T0a,$N0,$na,$T0a
391 fmadd $T0b,$N0,$nb,$T0b
393 fmadd $T1a,$N0,$nc,$T1a
394 fmadd $T1b,$N0,$nd,$T1b
464 lfd $N0,`$FRAME+96`($sp)
472 fcfid $N0,$N0
[all …]
/external/chromium_org/third_party/opus/src/celt/
Dbands.c249 int N0; in anti_collapse() local
257 N0 = m->eBands[i+1]-m->eBands[i]; in anti_collapse()
266 t = N0<<LM; in anti_collapse()
273 sqrt_1 = celt_rsqrt(N0<<LM); in anti_collapse()
322 for (j=0;j<N0;j++) in anti_collapse()
332 renormalise_vector(X, N0<<LM, Q15ONE); in anti_collapse()
433 int i, c, N0; in spreading_decision() local
441 N0 = M*m->shortMdctSize; in spreading_decision()
450 celt_norm * OPUS_RESTRICT x = X+M*eBands[i]+c*N0; in spreading_decision()
532 static void deinterleave_hadamard(celt_norm *X, int N0, int stride, int hadamard) in deinterleave_hadamard() argument
[all …]
Drate.c150 int N0; in compute_pulse_cache() local
152 N0 = m->eBands[j+1]-m->eBands[j]; in compute_pulse_cache()
154 if (N0<<i == 1) in compute_pulse_cache()
170 if (N0 > 2) in compute_pulse_cache()
172 N0>>=1; in compute_pulse_cache()
176 else if (N0 <= 1) in compute_pulse_cache()
179 N0<<=LM0; in compute_pulse_cache()
186 N = N0; in compute_pulse_cache()
432 int N0, N, den; in interp_bits2pulses() local
438 N0 = m->eBands[j+1]-m->eBands[j]; in interp_bits2pulses()
[all …]
Dvq.c137 int N0; in extract_collapse_mask() local
143 N0 = N/B; in extract_collapse_mask()
148 collapse_mask |= (iy[i*N0+j]!=0)<<i; in extract_collapse_mask()
149 } while (++j<N0); in extract_collapse_mask()
/external/llvm/lib/Target/X86/
DX86ISelDAGToDAG.cpp638 SDValue N0 = N.getOperand(0); in MatchWrapper() local
651 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) { in MatchWrapper()
659 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) { in MatchWrapper()
668 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) { in MatchWrapper()
671 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) { in MatchWrapper()
674 } else if (BlockAddressSDNode *BA = dyn_cast<BlockAddressSDNode>(N0)) { in MatchWrapper()
697 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) { in MatchWrapper()
701 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) { in MatchWrapper()
706 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) { in MatchWrapper()
709 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) { in MatchWrapper()
[all …]
/external/llvm/lib/Target/MSP430/
DMSP430ISelDAGToDAG.cpp145 SDValue N0 = N.getOperand(0); in MatchWrapper() local
147 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) { in MatchWrapper()
151 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) { in MatchWrapper()
156 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) { in MatchWrapper()
159 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) { in MatchWrapper()
163 AM.BlockAddr = cast<BlockAddressSDNode>(N0)->getBlockAddress(); in MatchWrapper()
/external/llvm/lib/Target/ARM/
DARMISelLowering.cpp3842 SDValue N0 = DAG.getNode(ISD::BITCAST, DL, VT8Bit, N->getOperand(0)); in getCTPOP16BitCounts() local
3843 SDValue N1 = DAG.getNode(ISD::CTPOP, DL, VT8Bit, N0); in getCTPOP16BitCounts()
3902 SDValue N0 = DAG.getNode(ARMISD::VREV32, DL, VT16Bit, Counts16); in lowerCTPOP32BitElements() local
3903 SDValue N1 = DAG.getNode(ISD::ADD, DL, VT16Bit, Counts16, N0); in lowerCTPOP32BitElements()
5482 SDNode *N0 = N->getOperand(0).getNode(); in isAddSubSExt() local
5484 return N0->hasOneUse() && N1->hasOneUse() && in isAddSubSExt()
5485 isSignExtended(N0, DAG) && isSignExtended(N1, DAG); in isAddSubSExt()
5493 SDNode *N0 = N->getOperand(0).getNode(); in isAddSubZExt() local
5495 return N0->hasOneUse() && N1->hasOneUse() && in isAddSubZExt()
5496 isZeroExtended(N0, DAG) && isZeroExtended(N1, DAG); in isAddSubZExt()
[all …]
/external/clang/test/CXX/basic/basic.lookup/basic.lookup.unqual/
Dp3.cpp6 namespace N0 { namespace
/external/clang/test/CXX/dcl.decl/dcl.meaning/dcl.fct.default/
Dp4.cpp11 namespace N0 { namespace

123