| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| LexicallyOrderedRecursiveASTVisitor.h | 117 bool Swap;
124 Swap = true;
129 Swap = Children.size() != 2;
132 Swap = CE->isInfixBinaryOp();
135 if (Swap && Children.size() > 1)
136 std::swap(Children[0], Children[1]);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/GSYM/ |
| GsymReader.h | 40 /// any parsing needed. If the endianness doesn't match, we swap these objects
69 std::unique_ptr<SwappedData> Swap;
|
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| function.bench.cpp | 154 struct Swap {
159 values[0].swap(values[1]);
226 makeCartesianProductBenchmark<Swap, AllFunctionTypes, AllFunctionTypes>();
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| AMDGPUInstCombineIntrinsic.cpp | 516 bool Swap = false;
521 std::swap(Src0, Src1);
522 Swap = true;
526 std::swap(Src1, Src2);
527 Swap = true;
531 std::swap(Src0, Src1);
532 Swap = true;
535 if (Swap) {
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_common.h | 406 // Don't use std::min, std::max or std::swap, to minimize dependency
410 template<class T> void Swap(T& a, T& b) {
504 void swap(InternalMmapVectorNoCtor &other) { function in class:__sanitizer::InternalMmapVectorNoCtor
505 Swap(data_, other.data_);
506 Swap(capacity_bytes_, other.capacity_bytes_);
507 Swap(size_, other.size_);
590 Swap(v[j], v[p]);
595 // Stage 2: swap largest element with the last one,
598 Swap(v[0], v[i]);
609 Swap(v[j], v[max_ind])
[all...] |
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_common.h | 475 // Don't use std::min, std::max or std::swap, to minimize dependency
489 template<class T> void Swap(T& a, T& b) {
584 void swap(InternalMmapVectorNoCtor &other) { function in class:__sanitizer::InternalMmapVectorNoCtor
585 Swap(data_, other.data_);
586 Swap(capacity_bytes_, other.capacity_bytes_);
587 Swap(size_, other.size_);
671 Swap(v[j], v[p]);
676 // Stage 2: swap largest element with the last one,
679 Swap(v[0], v[i]);
690 Swap(v[j], v[max_ind])
[all...] |
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_common.h | 453 // Don't use std::min, std::max or std::swap, to minimize dependency
463 template<class T> void Swap(T& a, T& b) {
558 void swap(InternalMmapVectorNoCtor &other) { function in class:__sanitizer::InternalMmapVectorNoCtor
559 Swap(data_, other.data_);
560 Swap(capacity_bytes_, other.capacity_bytes_);
561 Swap(size_, other.size_);
644 Swap(v[j], v[p]);
649 // Stage 2: swap largest element with the last one,
652 Swap(v[0], v[i]);
663 Swap(v[j], v[max_ind])
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonConstPropagation.cpp | 3013 bool Swap = false;
3017 Swap = true;
3019 const LatticeCell &LI = Swap ? LS2 : LS3;
3020 const MachineOperand &OpR2 = Swap ? MI.getOperand(3)
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeIntegerTypes.cpp | 384 std::swap(Lo, Hi);
2405 std::swap(InL, InH);
2417 std::swap(Hi, Lo);
3163 SDValue Swap = DAG.getAtomicCmpSwap(
3167 ReplaceValueWith(SDValue(N, 0), Swap.getValue(0));
3168 ReplaceValueWith(SDValue(N, 1), Swap.getValue(2));
4135 SDValue Swap = DAG.getAtomicCmpSwap(
4140 ReplaceValueWith(SDValue(N, 0), Swap.getValue(0));
4141 ReplaceValueWith(SDValue(N, 1), Swap.getValue(2));
4356 std::swap(LHSLo, RHSLo)
[all...] |
| DAGCombiner.cpp | 1326 std::swap(N0, N1);
1327 std::swap(NN0, NN1);
3066 std::swap(Carry0, Carry1);
3404 std::swap(A, B);
5074 std::swap(RL, RR);
5445 std::swap(Op0, Op1);
5962 std::swap(N0, N1);
5964 std::swap(N0, N1);
5989 std::swap(N0, N1);
6967 std::swap(LHS, RHS)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/AsmParser/ |
| ARMAsmParser.cpp | 4460 std::swap(*I, *J);
6662 // For communtative operations, we might be able to transform if we swap
6666 bool Swap = false;
6671 Swap = true;
6692 if (Swap)
6693 std::swap(Op4, Op5);
10323 bool Swap = false;
10328 Swap = true;
10338 TmpInst.addOperand(Inst.getOperand(Swap ? 1 : 2));
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/ |
| PPCISelLowering.cpp | 2160 unsigned &InsertAtByte, bool &Swap, bool IsLE) {
2179 Swap = M0 < 4;
2187 Swap = M1 < 4;
2195 Swap = M2 < 4;
2203 Swap = M3 < 4;
2211 Swap = true;
2235 bool &Swap, bool IsLE) {
2255 Swap = false;
2268 Swap = false;
2274 Swap = true
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/AArch64/ |
| AArch64ISelLowering.cpp | 2684 // Swap sub-tree that must come first to the right side.
2687 std::swap(LHS, RHS);
2688 std::swap(CanNegateL, CanNegateR);
2689 std::swap(MustBeFirstL, MustBeFirstR);
2697 // Swap the sub-tree that we can negate naturally to the left.
2702 std::swap(LHS, RHS);
2845 // can fold some shift+extend operations on the RHS operand, so swap the
2858 std::swap(LHS, RHS);
3062 std::swap(Sel, Other);
3093 std::swap(TVal, FVal)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/ |
| ARMISelLowering.cpp | 2131 std::swap (Lo, Hi);
2148 std::swap (Lo, Hi);
4126 std::swap (ArgValue, ArgValue2);
4539 std::swap(LHS, RHS);
4941 // to swap the compare operands.
4947 // If we have an unordered opcode, we need to swap the operands to the VSEL
4951 // returns true, so we also swap the compare operands. It also switches
4962 // swap the VSEL operands.
4969 // code and swap the VSEL operands. Also do this if we don't care about the
5204 std::swap(TrueVal, FalseVal)
[all...] |
