| /external/llvm/lib/CodeGen/SelectionDAG/ |
| DAGCombiner.cpp | 291 SDValue SimplifySelect(SDLoc DL, SDValue N0, SDValue N1, SDValue N2);
292 SDValue SimplifySelectCC(SDLoc DL, SDValue N0, SDValue N1, SDValue N2,
295 SDValue SimplifySetCC(EVT VT, SDValue N0, SDValue N1, ISD::CondCode Cond,
308 SDValue MatchBSwapHWordLow(SDNode *N, SDValue N0, SDValue N1,
310 SDValue MatchBSwapHWord(SDNode *N, SDValue N0, SDValue N1);
619 SDValue N0, N1, N2;
620 if (isSetCCEquivalent(N, N0, N1, N2) && N.getNode()->hasOneUse())
673 SDValue N0, SDValue N1) {
677 if (SDNode *R = isConstantBuildVectorOrConstantInt(N1)) {
687 SDValue OpNode = DAG.getNode(Opc, SDLoc(N0), VT, N0.getOperand(0), N1);
[all...] |
| /external/clang/test/Modules/ |
| namespaces.cpp | 24 int &ir1 = N1::f(1);
29 float &fr1 = N1::f(1.0f);
|
| /external/clang/test/SemaCXX/ |
| pseudo-destructors.cpp | 66 namespace N1 {
70 void test_X0(N1::X0 &x0) {
|
| /external/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.assign/ |
| valarray.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| /external/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.comp.assign/ |
| addition.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| and.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| divide.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| modulo.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| multiply.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| or.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| shift_left.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| shift_right.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| subtraction.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| xor.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| /external/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.fill/ |
| assign_value.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
29 std::valarray<int> v1(a1, N1);
|
| /external/libcxx/test/numerics/numarray/template.valarray/valarray.assign/ |
| indirect_array_assign.pass.cpp | 25 const std::size_t N1 = sizeof(a)/sizeof(a[0]);
29 std::valarray<int> v1(a, N1);
|
| /external/libcxx/test/numerics/numarray/template.valarray/valarray.cons/ |
| indirect_array.pass.cpp | 25 const std::size_t N1 = sizeof(a)/sizeof(a[0]);
29 std::valarray<int> v1(a, N1);
|
| /external/libcxx/test/numerics/numarray/template.valarray/valarray.sub/ |
| indirect_array_const.pass.cpp | 25 const std::size_t N1 = sizeof(a)/sizeof(a[0]);
29 const std::valarray<int> v1(a, N1);
|
| indirect_array_non_const.pass.cpp | 25 const std::size_t N1 = sizeof(a)/sizeof(a[0]);
29 std::valarray<int> v1(a, N1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.assign/ |
| valarray.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/numerics/numarray/template.indirect.array/indirect.array.comp.assign/ |
| addition.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| and.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| divide.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| modulo.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
| multiply.pass.cpp | 25 const std::size_t N1 = sizeof(a1)/sizeof(a1[0]);
31 std::valarray<int> v1(a1, N1);
|
