| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| basicblock.cc | 5 #include "sandbox/linux/seccomp-bpf/basicblock.h"
10 BasicBlock::BasicBlock() {
13 BasicBlock::~BasicBlock() {
|
| basicblock.h | 15 struct BasicBlock {
16 BasicBlock();
17 ~BasicBlock();
25 Less(const T& data, int (*cmp)(const BasicBlock *, const BasicBlock *,
31 bool operator() (const BasicBlock *a, const BasicBlock *b) const {
37 int (*cmp_)(const BasicBlock *, const BasicBlock *, const T&);
|
| /external/llvm/include/llvm/Analysis/ |
| BranchProbabilityInfo.h | 57 BranchProbability getEdgeProbability(const BasicBlock *Src,
63 BranchProbability getEdgeProbability(const BasicBlock *Src,
64 const BasicBlock *Dst) const;
70 bool isEdgeHot(const BasicBlock *Src, const BasicBlock *Dst) const;
76 BasicBlock *getHotSucc(BasicBlock *BB) const;
83 raw_ostream &printEdgeProbability(raw_ostream &OS, const BasicBlock *Src,
84 const BasicBlock *Dst) const;
92 uint32_t getEdgeWeight(const BasicBlock *Src
[all...] |
| CFG.h | 1 //===-- Analysis/CFG.h - BasicBlock Analyses --------------------*- C++ -*-===//
18 #include "llvm/IR/BasicBlock.h"
23 class BasicBlock;
37 SmallVectorImpl<std::pair<const BasicBlock *, const BasicBlock *> > &
43 unsigned GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ);
|
| LazyValueInfo.h | 53 BasicBlock *FromBB, BasicBlock *ToBB);
58 Constant *getConstant(Value *V, BasicBlock *BB);
62 Constant *getConstantOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB);
66 void threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, BasicBlock *NewSucc);
69 void eraseBlock(BasicBlock *BB);
|
| PostDominators.h | 26 DominatorTreeBase<BasicBlock>* DT;
30 DT = new DominatorTreeBase<BasicBlock>(true);
41 inline const std::vector<BasicBlock*> &getRoots() const {
49 inline DomTreeNode *operator[](BasicBlock *BB) const {
53 inline DomTreeNode *getNode(BasicBlock *BB) const {
61 inline bool dominates(const BasicBlock* A, const BasicBlock* B) const {
69 inline bool properlyDominates(BasicBlock* A, BasicBlock* B) const {
73 inline BasicBlock *findNearestCommonDominator(BasicBlock *A, BasicBlock *B)
[all...] |
| RegionInfo.h | 48 /// and the iteration returns every BasicBlock. If the Flat mode is not
54 /// @brief A RegionNode represents a subregion or a BasicBlock that is part of a
62 /// BasicBlock RegionNode, then entry is just the basic block, that this
68 /// The node can hold either a Region or a BasicBlock.
69 /// Use one bit to save, if this RegionNode is a subregion or BasicBlock
71 PointerIntPair<BasicBlock*, 1, bool> entry;
81 /// @param Entry The entry BasicBlock of the RegionNode. If this
82 /// RegionNode represents a BasicBlock, this is the
83 /// BasicBlock itself. If it represents a subregion, this
84 /// is the entry BasicBlock of the subregion
[all...] |
| PathProfileInfo.h | 18 #include "llvm/IR/BasicBlock.h"
29 typedef std::vector<BasicBlock*> ProfilePathBlockVector;
30 typedef std::vector<BasicBlock*>::iterator ProfilePathBlockIterator;
41 ProfilePathEdge(BasicBlock* source, BasicBlock* target,
45 inline BasicBlock* getSource() { return _source; }
46 inline BasicBlock* getTarget() { return _target; }
49 BasicBlock* _source;
50 BasicBlock* _target;
68 BasicBlock* getFirstBlockInPath() const
[all...] |
| PHITransAddr.h | 57 /// BasicBlock to its predecessors requires PHI translation.
58 bool NeedsPHITranslationFromBlock(BasicBlock *BB) const {
76 bool PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB,
86 Value *PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB,
97 Value *PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB,
105 Value *InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB,
106 BasicBlock *PredBB, const DominatorTree &DT
[all...] |
| Loads.h | 17 #include "llvm/IR/BasicBlock.h"
49 Value *FindAvailableLoadedValue(Value *Ptr, BasicBlock *ScanBB,
50 BasicBlock::iterator &ScanFrom,
|
| Trace.h | 25 class BasicBlock;
31 typedef std::vector<BasicBlock *> BasicBlockListType;
39 Trace(const std::vector<BasicBlock *> &vBB) : BasicBlocks (vBB) {}
44 BasicBlock *getEntryBasicBlock () const { return BasicBlocks[0]; }
48 BasicBlock *operator[](unsigned i) const { return BasicBlocks[i]; }
49 BasicBlock *getBlock(unsigned i) const { return BasicBlocks[i]; }
62 int getBlockIndex(const BasicBlock *X) const {
72 bool contains(const BasicBlock *X) const {
79 bool dominates(const BasicBlock *B1, const BasicBlock *B2) const
[all...] |
| LoopIterator.h | 41 typedef std::vector<BasicBlock*>::const_iterator POIterator;
42 typedef std::vector<BasicBlock*>::const_reverse_iterator RPOIterator;
52 DenseMap<BasicBlock*, unsigned> PostNumbers;
53 std::vector<BasicBlock*> PostBlocks;
84 bool hasPreorder(BasicBlock *BB) const { return PostNumbers.count(BB); }
87 bool hasPostorder(BasicBlock *BB) const {
88 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
93 unsigned getPostorder(BasicBlock *BB) const {
94 DenseMap<BasicBlock*, unsigned>::const_iterator I = PostNumbers.find(BB);
101 unsigned getRPO(BasicBlock *BB) const
[all...] |
| CodeMetrics.h | 22 class BasicBlock;
63 DenseMap<const BasicBlock *, unsigned> NumBBInsts;
88 void analyzeBasicBlock(const BasicBlock *BB, const TargetTransformInfo &TTI);
|
| Interval.h | 28 class BasicBlock;
38 /// HeaderNode - The header BasicBlock, which dominates all BasicBlocks in this
41 BasicBlock *HeaderNode;
43 typedef std::vector<BasicBlock*>::iterator succ_iterator;
44 typedef std::vector<BasicBlock*>::iterator pred_iterator;
45 typedef std::vector<BasicBlock*>::iterator node_iterator;
47 inline Interval(BasicBlock *Header) : HeaderNode(Header) {
54 inline BasicBlock *getHeaderNode() const { return HeaderNode; }
58 std::vector<BasicBlock*> Nodes;
64 std::vector<BasicBlock*> Successors
[all...] |
| /external/llvm/include/llvm/Transforms/Utils/ |
| BasicBlockUtils.h | 1 //===-- Transform/Utils/BasicBlockUtils.h - BasicBlock Utils ----*- C++ -*-===//
18 // FIXME: Move to this file: BasicBlock::removePredecessor, BB::splitBasicBlock
20 #include "llvm/IR/BasicBlock.h"
35 void DeleteDeadBlock(BasicBlock *BB);
42 void FoldSingleEntryPHINodes(BasicBlock *BB, Pass *P = 0);
49 bool DeleteDeadPHIs(BasicBlock *BB, const TargetLibraryInfo *TLI = 0);
53 bool MergeBlockIntoPredecessor(BasicBlock *BB, Pass *P = 0);
58 void ReplaceInstWithValue(BasicBlock::InstListType &BIL,
59 BasicBlock::iterator &BI, Value *V);
65 void ReplaceInstWithInst(BasicBlock::InstListType &BIL
[all...] |
| UnifyFunctionExitNodes.h | 26 BasicBlock *ReturnBlock, *UnwindBlock, *UnreachableBlock;
40 BasicBlock *getReturnBlock() const { return ReturnBlock; }
41 BasicBlock *getUnwindBlock() const { return UnwindBlock; }
42 BasicBlock *getUnreachableBlock() const { return UnreachableBlock; }
|
| CodeExtractor.h | 22 class BasicBlock;
52 SetVector<BasicBlock *> Blocks;
61 CodeExtractor(BasicBlock *BB, bool AggregateArgs = false);
69 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = 0,
108 void severSplitPHINodes(BasicBlock *&Header);
113 BasicBlock *header,
114 BasicBlock *newRootNode, BasicBlock *newHeader,
120 BasicBlock *newHeader,
|
| LoopUtils.h | 22 BasicBlock *InsertPreheaderForLoop(Loop *L, Pass *P);
|
| /external/llvm/include/llvm/Support/ |
| PredIteratorCache.h | 29 DenseMap<BasicBlock*, BasicBlock**> BlockToPredsMap;
30 DenseMap<BasicBlock*, unsigned> BlockToPredCountMap;
38 /// for (BasicBlock **PI = PredCache->GetPreds(BB); *PI; ++PI)
42 BasicBlock **GetPreds(BasicBlock *BB) {
43 BasicBlock **&Entry = BlockToPredsMap[BB];
46 SmallVector<BasicBlock*, 32> PredCache(pred_begin(BB), pred_end(BB));
51 Entry = Memory.Allocate<BasicBlock*>(PredCache.size());
56 unsigned GetNumPreds(BasicBlock *BB)
[all...] |
| /external/llvm/include/llvm/IR/ |
| BasicBlock.h | 1 //===-- llvm/BasicBlock.h - Represent a basic block in the VM ---*- C++ -*-===//
10 // This file contains the declaration of the BasicBlock class.
32 : public SymbolTableListTraits<Instruction, BasicBlock> {
62 /// tables. The type of a BasicBlock is "Type::LabelTy" because the basic block
68 /// terminate the blocks. The BasicBlock class allows malformed basic blocks to
72 class BasicBlock : public Value, // Basic blocks are data objects also
73 public ilist_node<BasicBlock> {
82 friend class SymbolTableListTraits<BasicBlock, Function>;
84 BasicBlock(const BasicBlock &) LLVM_DELETED_FUNCTION
[all...] |
| /external/llvm/include/llvm/Assembly/ |
| AssemblyAnnotationWriter.h | 23 class BasicBlock;
41 virtual void emitBasicBlockStartAnnot(const BasicBlock *,
47 virtual void emitBasicBlockEndAnnot(const BasicBlock *,
|
| /external/llvm/lib/IR/ |
| BasicBlock.cpp | 1 //===-- BasicBlock.cpp - Implement BasicBlock related methods -------------===//
10 // This file implements the BasicBlock class for the IR library.
14 #include "llvm/IR/BasicBlock.h"
27 ValueSymbolTable *BasicBlock::getValueSymbolTable() {
33 LLVMContext &BasicBlock::getContext() const {
39 template class llvm::SymbolTableListTraits<Instruction, BasicBlock>;
42 BasicBlock::BasicBlock(LLVMContext &C, const Twine &Name, Function *NewParent,
43 BasicBlock *InsertBefore
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| FlattenCFG.cpp | 30 bool FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder, Pass *P = 0);
34 bool MergeIfRegion(BasicBlock *BB, IRBuilder<> &Builder, Pass *P = 0);
40 bool CompareIfRegionBlock(BasicBlock *Head1, BasicBlock *Head2,
41 BasicBlock *Block1, BasicBlock *Block2);
45 bool run(BasicBlock *BB);
123 bool FlattenCFGOpt::FlattenParallelAndOr(BasicBlock *BB, IRBuilder<> &Builder,
129 BasicBlock *LastCondBlock = NULL;
130 BasicBlock *FirstCondBlock = NULL
[all...] |
| /external/llvm/lib/Transforms/Instrumentation/ |
| ProfilingUtils.h | 21 class BasicBlock;
30 void IncrementCounterInBlock(BasicBlock *BB, unsigned CounterNum,
|
| /art/compiler/dex/ |
| mir_graph.h | 254 struct BasicBlock {
269 BasicBlock* fall_through;
270 BasicBlock* taken;
271 BasicBlock* i_dom; // Immediate dominator.
273 GrowableArray<BasicBlock*>* predecessors;
290 BasicBlock* block;
364 BasicBlock* FindBlock(unsigned int code_offset) {
388 BasicBlock* GetEntryBlock() const {
392 BasicBlock* GetExitBlock() const {
396 BasicBlock* GetBasicBlock(int block_id) const
[all...] |
