Home
last modified time | relevance | path

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

1234

/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.cpp20 namespace N0 { namespace
35 template<> void N0::f0(int) { } // okay in f0()
38 template<> void N0::f0(long) { } // expected-error{{does not enclose namespace}} in f0()
41 template<> void N0::f0(double) { } in f0()
50 namespace N0 { namespace
74 void N0::X0<T>::ft1(T t, U u) { in ft1()
78 template<typename T> T N0::X0<T>::member;
80 template<> struct N0::X0<void> { };
81 N0::X0<void> test_X0;
84 …template<> struct N0::X0<const void> { }; // expected-error{{class template specialization of 'X0'…
[all …]
/external/llvm/lib/CodeGen/SelectionDAG/
DDAGCombiner.cpp251 SDValue visitANDLike(SDValue N0, SDValue N1, SDNode *LocReference);
253 SDValue visitORLike(SDValue N0, SDValue N1, SDNode *LocReference);
335 SDValue SimplifySelect(SDLoc DL, SDValue N0, SDValue N1, SDValue N2);
336 SDValue SimplifySelectCC(SDLoc DL, SDValue N0, SDValue N1, SDValue N2,
339 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
361 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
363 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
744 SDValue N0, N1, N2; in isOneUseSetCC() local
745 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse()) in isOneUseSetCC()
825 SDValue N0, SDValue N1) { in ReassociateOps() argument
[all …]
DTargetLowering.cpp1258 TargetLowering::SimplifySetCC(EVT VT, SDValue N0, SDValue N1, in SimplifySetCC() argument
1271 getBooleanContents(N0->getValueType(0)); in SimplifySetCC()
1281 if (isa<ConstantSDNode>(N0.getNode()) && in SimplifySetCC()
1283 isCondCodeLegal(SwappedCC, N0.getSimpleValueType()))) in SimplifySetCC()
1284 return DAG.getSetCC(dl, VT, N1, N0, SwappedCC); in SimplifySetCC()
1292 if (N0.getOpcode() == ISD::SRL && (C1 == 0 || C1 == 1) && in SimplifySetCC()
1293 N0.getOperand(0).getOpcode() == ISD::CTLZ && in SimplifySetCC()
1294 N0.getOperand(1).getOpcode() == ISD::Constant) { in SimplifySetCC()
1296 = cast<ConstantSDNode>(N0.getOperand(1))->getAPIntValue(); in SimplifySetCC()
1298 ShAmt == Log2_32(N0.getValueType().getSizeInBits())) { 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,
143 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in EvaluateJacobianForParameterBlock()
159 if (!EvaluateImpl<CostFunctor, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in EvaluateJacobianForParameterBlock()
183 int N0, int N1, int N2, int N3, int N4,
187 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9,
/external/llvm/include/llvm/ADT/
DStringSwitch.h89 template<unsigned N0, unsigned N1>
91 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
94 (N0-1 == Str.size() && std::memcmp(S0, Str.data(), N0-1) == 0) || in Cases()
102 template<unsigned N0, unsigned N1, unsigned N2>
104 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
107 (N0-1 == Str.size() && std::memcmp(S0, Str.data(), N0-1) == 0) || in Cases()
116 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3>
118 StringSwitch& Cases(const char (&S0)[N0], const char (&S1)[N1], in Cases() argument
122 (N0-1 == Str.size() && std::memcmp(S0, Str.data(), N0-1) == 0) || in Cases()
132 template<unsigned N0, unsigned N1, unsigned N2, unsigned N3, unsigned N4>
[all …]
/external/ceres-solver/include/ceres/
Dnumeric_diff_cost_function.h177 int N0 = 0, // Number of parameters in block 0.
189 N0, N1, N2, N3, N4,
201 N0, N1, N2, N3, N4, in functor_()
219 const int kNumParameters = N0 + N1 + N2 + N3 + N4 + N5 + N6 + N7 + N8 + N9; in Evaluate()
221 (N0 > 0) + (N1 > 0) + (N2 > 0) + (N3 > 0) + (N4 > 0) + in Evaluate()
226 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>( in Evaluate()
243 if (N1) parameters_reference_copy[1] = parameters_reference_copy[0] + N0; in Evaluate()
276 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9, \ in Evaluate()
283 N0, N1, N2, N3, N4, \ in Evaluate()
Dautodiff_cost_function.h156 int N0, // Number of parameters in block 0.
167 N0, N1, N2, N3, N4,
190 N0, N1, N2, N3, N4, in AutoDiffCostFunction()
207 CostFunctor, double, N0, N1, N2, N3, N4, N5, N6, N7, N8, N9> in Evaluate()
211 N0, N1, N2, N3, N4, N5, N6, N7, N8, N9>::Differentiate( in Evaluate()
215 N0, N1, N2, N3, N4, 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 …]
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
136 N0, N1, N2, N3, N4, in functor_() argument
345 N0, N1, N2, N3, N4,
/external/llvm/unittests/IR/
DMDBuilderTest.cpp85 MDNode *N0 = MDHelper.createTBAANode("Node", R); in TEST_F() local
89 EXPECT_EQ(N0, N3); in TEST_F()
90 EXPECT_NE(N0, N1); in TEST_F()
91 EXPECT_NE(N0, N2); in TEST_F()
92 EXPECT_GE(N0->getNumOperands(), 2U); in TEST_F()
95 EXPECT_TRUE(isa<MDString>(N0->getOperand(0))); in TEST_F()
98 EXPECT_EQ(cast<MDString>(N0->getOperand(0))->getString(), "Node"); in TEST_F()
101 EXPECT_EQ(N0->getOperand(1), R); in TEST_F()
/external/boringssl/src/crypto/bn/asm/
Darmv4-mont.pl265 my ($N0,$N1,$N2,$N3)=map("d$_",(4..7));
310 vld1.32 {$N0-$N3}, [$nptr]!
320 vmlal.u32 $A0xB,$Ni,${N0}[0]
322 vmlal.u32 $A1xB,$Ni,${N0}[1]
369 vmlal.u32 $A0xB,$Ni,${N0}[0]
370 vmlal.u32 $A1xB,$Ni,${N0}[1]
406 vmlal.u32 $A0xB,$Ni,${N0}[0]
408 vmlal.u32 $A1xB,$Ni,${N0}[1]
414 vld1.32 {$N0-$N1}, [$nptr]!
436 vmlal.u32 $A0xB,$Ni,${N0}[0]
[all …]
/external/libopus/celt/
Dbands.c265 int N0; in anti_collapse() local
273 N0 = m->eBands[i+1]-m->eBands[i]; in anti_collapse()
282 t = N0<<LM; in anti_collapse()
289 sqrt_1 = celt_rsqrt(N0<<LM); in anti_collapse()
338 for (j=0;j<N0;j++) in anti_collapse()
348 renormalise_vector(X, N0<<LM, Q15ONE); in anti_collapse()
449 int i, c, N0; in spreading_decision() local
457 N0 = M*m->shortMdctSize; in spreading_decision()
466 celt_norm * OPUS_RESTRICT x = X+M*eBands[i]+c*N0; in spreading_decision()
548 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.cpp745 SDValue N0 = N.getOperand(0); in matchWrapper() local
758 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) { in matchWrapper()
766 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) { in matchWrapper()
775 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) { in matchWrapper()
778 } else if (auto *S = dyn_cast<MCSymbolSDNode>(N0)) { in matchWrapper()
780 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) { in matchWrapper()
783 } else if (BlockAddressSDNode *BA = dyn_cast<BlockAddressSDNode>(N0)) { in matchWrapper()
806 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) { in matchWrapper()
810 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) { in matchWrapper()
815 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) { in matchWrapper()
[all …]
/external/llvm/test/CodeGen/AArch64/
Darm64-2013-01-13-ffast-fcmp.ll15 define <4 x i32> @_Z9example25v( <4 x float> %N0, <4 x float> %N1) {
16 %A = fcmp olt <4 x float> %N0, %N1
/external/llvm/lib/Target/MSP430/
DMSP430ISelDAGToDAG.cpp141 SDValue N0 = N.getOperand(0); in MatchWrapper() local
143 if (GlobalAddressSDNode *G = dyn_cast<GlobalAddressSDNode>(N0)) { in MatchWrapper()
147 } else if (ConstantPoolSDNode *CP = dyn_cast<ConstantPoolSDNode>(N0)) { in MatchWrapper()
152 } else if (ExternalSymbolSDNode *S = dyn_cast<ExternalSymbolSDNode>(N0)) { in MatchWrapper()
155 } else if (JumpTableSDNode *J = dyn_cast<JumpTableSDNode>(N0)) { in MatchWrapper()
159 AM.BlockAddr = cast<BlockAddressSDNode>(N0)->getBlockAddress(); in MatchWrapper()
/external/llvm/lib/Target/AMDGPU/
DAMDGPUISelDAGToDAG.cpp790 SDValue N0 = Addr.getOperand(0); in SelectDS1Addr1Offset() local
793 if (isDSOffsetLegal(N0, C1->getSExtValue(), 16)) { in SelectDS1Addr1Offset()
795 Base = N0; in SelectDS1Addr1Offset()
855 SDValue N0 = Addr.getOperand(0); in SelectDS64Bit4ByteAligned() local
861 if (isDSOffsetLegal(N0, DWordOffset1, 8)) { in SelectDS64Bit4ByteAligned()
862 Base = N0; in SelectDS64Bit4ByteAligned()
941 SDValue N0 = Addr.getOperand(0); in SelectMUBUF() local
945 if (N0.getOpcode() == ISD::ADD) { in SelectMUBUF()
947 SDValue N2 = N0.getOperand(0); in SelectMUBUF()
948 SDValue N3 = N0.getOperand(1); in SelectMUBUF()
[all …]
/external/llvm/lib/Target/ARM/
DARMISelLowering.cpp4444 SDValue N0 = DAG.getNode(ISD::BITCAST, DL, VT8Bit, N->getOperand(0)); in getCTPOP16BitCounts() local
4445 SDValue N1 = DAG.getNode(ISD::CTPOP, DL, VT8Bit, N0); in getCTPOP16BitCounts()
4504 SDValue N0 = DAG.getNode(ARMISD::VREV32, DL, VT16Bit, Counts16); in lowerCTPOP32BitElements() local
4505 SDValue N1 = DAG.getNode(ISD::ADD, DL, VT16Bit, Counts16, N0); in lowerCTPOP32BitElements()
6333 SDNode *N0 = N->getOperand(0).getNode(); in isAddSubSExt() local
6335 return N0->hasOneUse() && N1->hasOneUse() && in isAddSubSExt()
6336 isSignExtended(N0, DAG) && isSignExtended(N1, DAG); in isAddSubSExt()
6344 SDNode *N0 = N->getOperand(0).getNode(); in isAddSubZExt() local
6346 return N0->hasOneUse() && N1->hasOneUse() && in isAddSubZExt()
6347 isZeroExtended(N0, DAG) && isZeroExtended(N1, DAG); in isAddSubZExt()
[all …]
/external/ceres-solver/internal/ceres/
Dreorder_program_test.cc45 template <int kNumResiduals, int N0, int N1, int N2>
47 SizedCostFunction<kNumResiduals, N0, N1, N2> {

1234