| /external/libvpx/libvpx/vp8/common/ |
| common.h | 23 #define vp8_copy( Dest, Src) { \
24 assert( sizeof( Dest) == sizeof( Src)); \
25 vpx_memcpy( Dest, Src, sizeof( Src)); \
30 #define vp8_copy_array( Dest, Src, N) { \
31 assert( sizeof( *Dest) == sizeof( *Src)); \
32 vpx_memcpy( Dest, Src, N * sizeof( *Src)); \
|
| /external/llvm/lib/CodeGen/ |
| MachineBranchProbabilityInfo.cpp | 64 getEdgeWeight(const MachineBasicBlock *Src,
66 uint32_t Weight = Src->getSuccWeight(Dst);
73 getEdgeWeight(const MachineBasicBlock *Src,
77 return getEdgeWeight(Src, std::find(Src->succ_begin(), Src->succ_end(), Dst));
80 bool MachineBranchProbabilityInfo::isEdgeHot(MachineBasicBlock *Src,
84 return getEdgeProbability(Src, Dst) > BranchProbability(4, 5);
107 MachineBranchProbabilityInfo::getEdgeProbability(MachineBasicBlock *Src,
110 uint32_t D = getSumForBlock(Src, Scale)
[all...] |
| MachineCopyPropagation.cpp | 113 static bool isNopCopy(MachineInstr *CopyMI, unsigned Def, unsigned Src,
123 return SubIdx == TRI->getSubRegIndex(SrcDef, Src);
143 SourceMap SrcMap; // Src -> Def map
152 unsigned Src = MI->getOperand(1).getReg();
155 TargetRegisterInfo::isVirtualRegister(Src))
159 DenseMap<unsigned, MachineInstr*>::iterator CI = AvailCopyMap.find(Src);
163 (!MRI->isReserved(Src) || NoInterveningSideEffect(CopyMI, MI)) &&
164 isNopCopy(CopyMI, Def, Src, TRI)) {
191 // If Src is defined by a previous copy, it cannot be eliminated.
192 for (MCRegAliasIterator AI(Src, TRI, true); AI.isValid(); ++AI)
[all...] |
| MachineRegisterInfo.cpp | 178 /// Move NumOps operands from Src to Dst, updating use-def lists as needed.
184 /// The Src and Dst ranges may overlap.
186 MachineOperand *Src,
188 assert(Src != Dst && NumOps && "Noop moveOperands");
190 // Copy backwards if Dst is within the Src range.
192 if (Dst >= Src && Dst < Src + NumOps) {
195 Src += NumOps - 1;
200 new (Dst) MachineOperand(*Src);
202 // Dst takes Src's place in the use-def chain
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineBranchProbabilityInfo.h | 50 uint32_t getEdgeWeight(const MachineBasicBlock *Src,
53 // Same thing, but using a const_succ_iterator from Src. This is faster when
55 uint32_t getEdgeWeight(const MachineBasicBlock *Src,
64 bool isEdgeHot(MachineBasicBlock *Src, MachineBasicBlock *Dst) const;
72 // only iff SRC block has only one successor.
74 // Src. Querying sequentially for each successor's probability is a quadratic
76 BranchProbability getEdgeProbability(MachineBasicBlock *Src,
80 // however the value is never equal to 0, and can be 1 only iff SRC block
82 raw_ostream &printEdgeProbability(raw_ostream &OS, MachineBasicBlock *Src,
|
| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 36 /// identify an edge, since we can have multiple edges from Src to Dst.
51 /// \brief Get an edge's probability, relative to other out-edges of the Src.
55 /// leaving the 'Src' block. The returned probability is never zero, and can
57 BranchProbability getEdgeProbability(const BasicBlock *Src,
60 /// \brief Get the probability of going from Src to Dst.
62 /// It returns the sum of all probabilities for edges from Src to Dst.
63 BranchProbability getEdgeProbability(const BasicBlock *Src,
66 /// \brief Test if an edge is hot relative to other out-edges of the Src.
70 bool isEdgeHot(const BasicBlock *Src, const BasicBlock *Dst) const;
83 raw_ostream &printEdgeProbability(raw_ostream &OS, const BasicBlock *Src,
[all...] |
| DependenceAnalysis.h | 68 Src(Source), Dst(Destination) {}
95 Instruction *getSrc() const { return Src; }
171 Instruction *Src, *Dst;
186 FullDependence(Instruction *Src,
250 /// depends - Tests for a dependence between the Src and Dst instructions.
254 /// if it appears that control flow can reach from Src to Dst
256 Dependence *depends(Instruction *Src,
312 const SCEV *Src;
425 /// establishNestingLevels - Examines the loop nesting of the Src and Dst
442 /// ... - loops containing Src but not Ds
[all...] |
| /external/llvm/include/llvm/Target/ |
| CostTable.h | 45 TypeTy Src;
52 unsigned len, int ISD, TypeTy Dst, TypeTy Src) {
54 if (Tbl[i].ISD == ISD && Tbl[i].Src == Src && Tbl[i].Dst == Dst)
|
| /external/llvm/include/llvm-c/ |
| Linker.h | 35 LLVMBool LLVMLinkModules(LLVMModuleRef Dest, LLVMModuleRef Src,
|
| /external/llvm/lib/Target/Hexagon/ |
| HexagonPeephole.cpp | 97 void ChangeOpInto(MachineOperand &Dst, MachineOperand &Src);
132 MachineOperand &Src = MI->getOperand(1);
134 unsigned SrcReg = Src.getReg();
168 MachineOperand &Src = MI->getOperand(1);
170 unsigned SrcReg = Src.getReg();
186 MachineOperand &Src = MI->getOperand(1);
189 if (Src.getSubReg() != Hexagon::subreg_loreg)
193 unsigned SrcReg = Src.getReg();
290 void HexagonPeephole::ChangeOpInto(MachineOperand &Dst, MachineOperand &Src) {
291 assert (&Dst != &Src && "Cannot duplicate into itself")
[all...] |
| HexagonSelectionDAGInfo.h | 31 SDValue Dst, SDValue Src,
|
| HexagonSelectionDAGInfo.cpp | 31 SDValue Dst, SDValue Src, SDValue Size, unsigned Align,
|
| /external/skia/src/gpu/ |
| GrTemplates.h | 18 template <typename Dst, typename Src> Dst GrTCast(Src src) {
20 Src src; member in union:__anon15048
23 data.src = src;
|
| /external/llvm/lib/Target/X86/ |
| X86SelectionDAGInfo.h | 39 SDValue Dst, SDValue Src,
47 SDValue Dst, SDValue Src,
|
| /external/clang/include/clang/Analysis/Analyses/ |
| CFGReachabilityAnalysis.h | 40 /// Returns true if the block 'Dst' can be reached from block 'Src'.
41 bool isReachable(const CFGBlock *Src, const CFGBlock *Dst);
|
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| AsmPrinterDwarf.cpp | 177 const MachineLocation &Src = Move.getSource();
181 if (Src.getReg() == MachineLocation::VirtualFP) {
182 OutStreamer.EmitCFIDefCfaOffset(-Src.getOffset());
185 OutStreamer.EmitCFIDefCfa(RI->getDwarfRegNum(Src.getReg(), true),
186 Src.getOffset());
188 } else if (Src.isReg() && Src.getReg() == MachineLocation::VirtualFP) {
193 OutStreamer.EmitCFIOffset(RI->getDwarfRegNum(Src.getReg(), true),
|
| /external/llvm/include/llvm/ |
| Linker.h | 148 /// This method links the \p Src module into the Linker's Composite module
154 Module* Src, ///< Module linked into \p Dest
157 return LinkModules(Composite, Src, Linker::DestroySource, ErrorMsg);
161 /// control of the \p Src module and link it into the \p Dest module. The
162 /// \p Src module will be destructed or subsumed by this method. In either
164 /// the \p Dest module will remain. The \p Src module is linked into the
171 static bool LinkModules(Module* Dest, Module* Src, unsigned Mode,
|
| /external/llvm/lib/Analysis/ |
| BranchProbabilityInfo.cpp | 455 isEdgeHot(const BasicBlock *Src, const BasicBlock *Dst) const {
458 return getEdgeProbability(Src, Dst) > BranchProbability(4, 5);
491 getEdgeWeight(const BasicBlock *Src, unsigned IndexInSuccessors) const {
493 Weights.find(std::make_pair(Src, IndexInSuccessors));
502 /// of all raw edge weights from Src to Dst.
504 getEdgeWeight(const BasicBlock *Src, const BasicBlock *Dst) const {
507 for (succ_const_iterator I = succ_begin(Src), E = succ_end(Src); I != E; ++I)
509 MapI = Weights.find(std::make_pair(Src, I.getSuccessorIndex()));
519 setEdgeWeight(const BasicBlock *Src, unsigned IndexInSuccessors
[all...] |
| DependenceAnalysis.cpp | 190 return Src->mayReadFromMemory() && Dst->mayReadFromMemory();
196 return Src->mayWriteToMemory() && Dst->mayWriteToMemory();
202 return Src->mayWriteToMemory() && Dst->mayReadFromMemory();
208 return Src->mayReadFromMemory() && Dst->mayWriteToMemory();
660 // Examines the loop nesting of the Src and Dst
677 // ... - loops containing Src but not Dst
678 // SrcLevels - innermost loop containing Src but not Dst
679 // ... - loops containing Dst but not Src
680 // MaxLevels - innermost loops containing Dst but not Src
699 // to A (the Src) and the load from A (the Dst), we'll note that the
[all...] |
| /external/llvm/lib/IR/ |
| IRBuilder.cpp | 82 CreateMemCpy(Value *Dst, Value *Src, Value *Size, unsigned Align,
85 Src = getCastedInt8PtrValue(Src);
87 Value *Ops[] = { Dst, Src, Size, getInt32(Align), getInt1(isVolatile) };
88 Type *Tys[] = { Dst->getType(), Src->getType(), Size->getType() };
106 CreateMemMove(Value *Dst, Value *Src, Value *Size, unsigned Align,
109 Src = getCastedInt8PtrValue(Src);
111 Value *Ops[] = { Dst, Src, Size, getInt32(Align), getInt1(isVolatile) };
112 Type *Tys[] = { Dst->getType(), Src->getType(), Size->getType() }
[all...] |
| Globals.cpp | 50 /// create a GlobalValue) from the GlobalValue Src to this one.
51 void GlobalValue::copyAttributesFrom(const GlobalValue *Src) {
52 setAlignment(Src->getAlignment());
53 setSection(Src->getSection());
54 setVisibility(Src->getVisibility());
55 setUnnamedAddr(Src->hasUnnamedAddr());
182 /// create a GlobalVariable) from the GlobalVariable Src to this one.
183 void GlobalVariable::copyAttributesFrom(const GlobalValue *Src) {
184 assert(isa<GlobalVariable>(Src) && "Expected a GlobalVariable!");
185 GlobalValue::copyAttributesFrom(Src);
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMSelectionDAGInfo.cpp | 31 SDValue Dst, SDValue Src,
67 DAG.getNode(ISD::ADD, dl, MVT::i32, Src,
106 DAG.getNode(ISD::ADD, dl, MVT::i32, Src,
145 SDValue Src, SDValue Size,
170 if (Src.getValueType().bitsGT(MVT::i32))
171 Src = DAG.getNode(ISD::TRUNCATE, dl, MVT::i32, Src);
173 Src = DAG.getNode(ISD::ZERO_EXTEND, dl, MVT::i32, Src);
176 Entry.Node = Src;
[all...] |
| /external/eigen/test/ |
| vectorization_logic.cpp | 31 template<typename Dst, typename Src>
32 bool test_assign(const Dst&, const Src&, int traversal, int unrolling)
34 internal::assign_traits<Dst,Src>::debug();
35 bool res = internal::assign_traits<Dst,Src>::Traversal==traversal
36 && internal::assign_traits<Dst,Src>::Unrolling==unrolling;
40 << " got " << demangle_traversal(internal::assign_traits<Dst,Src>::Traversal) << "\n";
42 << " got " << demangle_unrolling(internal::assign_traits<Dst,Src>::Unrolling) << "\n";
47 template<typename Dst, typename Src>
50 internal::assign_traits<Dst,Src>::debug();
51 bool res = internal::assign_traits<Dst,Src>::Traversal==traversa
[all...] |
| /external/llvm/lib/Target/PowerPC/ |
| PPCTargetTransformInfo.cpp | 93 Type *Src) const;
98 virtual unsigned getMemoryOpCost(unsigned Opcode, Type *Src,
182 unsigned PPCTTI::getCastInstrCost(unsigned Opcode, Type *Dst, Type *Src) const {
185 return TargetTransformInfo::getCastInstrCost(Opcode, Dst, Src);
218 unsigned PPCTTI::getMemoryOpCost(unsigned Opcode, Type *Src, unsigned Alignment,
221 std::pair<unsigned, MVT> LT = TLI->getTypeLegalizationCost(Src);
|
| /external/clang/include/clang/Analysis/Support/ |
| BlkExprDeclBitVector.h | 162 struct Union { void operator()(ValTy& Dst, ValTy& Src) { Dst |= Src; } };
163 struct Intersect { void operator()(ValTy& Dst, ValTy& Src) { Dst &= Src; } };
301 struct Union { void operator()(ValTy& Dst, ValTy& Src) { Dst |= Src; } };
302 struct Intersect { void operator()(ValTy& Dst, ValTy& Src) { Dst &= Src; } };
|
