| /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/ |
| 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...] |
| 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...] |
| 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...] |
| 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...] |
| 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);
|
| /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/javassist/src/main/javassist/bytecode/stackmap/ |
| BasicBlock.java | 28 public class BasicBlock {
31 public BasicBlock[] exit; // null if the block is a leaf.
35 protected BasicBlock(int pos) {
41 public static BasicBlock find(BasicBlock[] blocks, int pos)
55 BasicBlock body;
57 Catch(BasicBlock b, int i, Catch c) {
97 BasicBlock block;
98 BasicBlock[] jump;
121 void setJump(BasicBlock[] bb, int s, boolean always)
[all...] |
| /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/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...] |
| /external/llvm/lib/Transforms/Scalar/ |
| StructurizeCFG.cpp | 28 typedef std::pair<BasicBlock *, Value *> BBValuePair;
31 typedef SmallVector<BasicBlock*, 8> BBVector;
35 typedef SmallPtrSet<BasicBlock *, 8> BBSet;
38 typedef MapVector<BasicBlock *, BBVector> BB2BBVecMap;
41 typedef DenseMap<BasicBlock *, PhiMap> BBPhiMap;
42 typedef DenseMap<BasicBlock *, Value *> BBPredicates;
43 typedef DenseMap<BasicBlock *, BBPredicates> PredMap;
44 typedef DenseMap<BasicBlock *, BasicBlock*> BB2BBMap;
59 BasicBlock *Result
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 67 delete reinterpret_cast<BasicBlock *>(BBs.get());
70 BasicBlock::BasicBlock(Function *fn) : cfg(this), dom(this), func(fn)
85 BasicBlock::~BasicBlock()
90 BasicBlock *
91 BasicBlock::clone(ClonePolicy<Function>& pol) const
93 BasicBlock *bb = new BasicBlock(pol.context());
103 BasicBlock *obb = BasicBlock::get(it.getNode())
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_bb.cpp | 67 delete reinterpret_cast<BasicBlock *>(BBs.get());
70 BasicBlock::BasicBlock(Function *fn) : cfg(this), dom(this), func(fn)
85 BasicBlock::~BasicBlock()
90 BasicBlock *
91 BasicBlock::clone(ClonePolicy<Function>& pol) const
93 BasicBlock *bb = new BasicBlock(pol.context());
103 BasicBlock *obb = BasicBlock::get(it.getNode())
[all...] |
| /external/llvm/lib/Transforms/Utils/ |
| LowerSwitch.cpp | 52 BasicBlock* BB;
54 CaseRange(Constant *low = 0, Constant *high = 0, BasicBlock *bb = 0) :
63 BasicBlock* switchConvert(CaseItr Begin, CaseItr End, Value* Val,
64 BasicBlock* OrigBlock, BasicBlock* Default);
65 BasicBlock* newLeafBlock(CaseRange& Leaf, Value* Val,
66 BasicBlock* OrigBlock, BasicBlock* Default);
86 BasicBlock *Cur = I++; // Advance over block so we don't traverse new blocks
118 BasicBlock* LowerSwitch::switchConvert(CaseItr Begin, CaseItr End
[all...] |
| 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...] |
| /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...] |
| /external/llvm/lib/Analysis/ |
| RegionInfo.cpp | 55 Region::Region(BasicBlock *Entry, BasicBlock *Exit, RegionInfo* RInfo,
73 void Region::replaceEntry(BasicBlock *BB) {
77 void Region::replaceExit(BasicBlock *BB) {
82 void Region::replaceEntryRecursive(BasicBlock *NewEntry) {
84 BasicBlock *OldEntry = getEntry();
98 void Region::replaceExitRecursive(BasicBlock *NewExit) {
100 BasicBlock *OldExit = getExit();
114 bool Region::contains(const BasicBlock *B) const {
115 BasicBlock *BB = const_cast<BasicBlock*>(B)
[all...] |
| ProfileInfo.cpp | 28 template<> char ProfileInfoT<Function,BasicBlock>::ID = 0;
42 ProfileInfoT<Function, BasicBlock>::ProfileInfoT() {
46 ProfileInfoT<Function, BasicBlock>::~ProfileInfoT() {
54 const double ProfileInfoT<Function,BasicBlock>::MissingValue = -1;
60 ProfileInfoT<Function,BasicBlock>::getExecutionCount(const BasicBlock *BB) {
80 std::set<const BasicBlock*> ProcessedPreds;
83 const BasicBlock *P = *PI;
105 std::set<const BasicBlock*> ProcessedSuccs;
138 double ProfileInfoT<Function,BasicBlock>::getExecutionCount(const Function *F)
[all...] |
| CFG.cpp | 1 //===-- CFG.cpp - BasicBlock analysis --------------------------------------==//
29 SmallVectorImpl<std::pair<const BasicBlock*,const BasicBlock*> > &Result) {
30 const BasicBlock *BB = &F.getEntryBlock();
34 SmallPtrSet<const BasicBlock*, 8> Visited;
35 SmallVector<std::pair<const BasicBlock*, succ_const_iterator>, 8> VisitStack;
36 SmallPtrSet<const BasicBlock*, 8> InStack;
42 std::pair<const BasicBlock*, succ_const_iterator> &Top = VisitStack.back();
43 const BasicBlock *ParentBB = Top.first;
73 unsigned llvm::GetSuccessorNumber(BasicBlock *BB, BasicBlock *Succ)
[all...] |
| /art/compiler/dex/portable/ |
| mir_to_gbc.h | 30 struct BasicBlock;
79 ::llvm::BasicBlock* GetLLVMBlock(int id);
86 ::llvm::BasicBlock* FindCaseTarget(uint32_t vaddr);
87 void ConvertPackedSwitch(BasicBlock* bb, int32_t table_offset,
89 void ConvertSparseSwitch(BasicBlock* bb, int32_t table_offset,
110 void ConvertCompareAndBranch(BasicBlock* bb, MIR* mir, ConditionCode cc,
112 void ConvertCompareZeroAndBranch(BasicBlock* bb, MIR* mir, ConditionCode cc,
128 void ConvertInvoke(BasicBlock* bb, MIR* mir, InvokeType invoke_type,
161 bool ConvertMIRNode(MIR* mir, BasicBlock* bb, ::llvm::BasicBlock* llvm_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...] |
| /dalvik/vm/compiler/ |
| SSATransformation.cpp | 23 static void recordDFSPreOrder(CompilationUnit *cUnit, BasicBlock *block)
42 BasicBlock *succBB = successorBlockInfo->block;
70 * register idx is defined in BasicBlock bb.
72 static bool fillDefBlockMatrix(CompilationUnit *cUnit, BasicBlock *bb)
122 static void computeDomPostOrderTraversal(CompilationUnit *cUnit, BasicBlock *bb)
132 BasicBlock *dominatedBB =
133 (BasicBlock *) dvmGrowableListGetElement(blockList, bbIdx);
146 static void checkForDominanceFrontier(BasicBlock *domBB,
147 const BasicBlock *succBB)
161 static bool computeDominanceFrontier(CompilationUnit *cUnit, BasicBlock *bb
[all...] |
| /art/compiler/llvm/ |
| runtime_support_builder.cc | 31 using ::llvm::BasicBlock;
180 BasicBlock* bb_fast = BasicBlock::Create(context_, "lock_fast", parent_func);
181 BasicBlock* bb_slow = BasicBlock::Create(context_, "lock_slow", parent_func);
182 BasicBlock* bb_cont = BasicBlock::Create(context_, "lock_cont", parent_func);
231 BasicBlock* bb_fast = BasicBlock::Create(context_, "unlock_fast", parent_func);
232 BasicBlock* bb_slow = BasicBlock::Create(context_, "unlock_slow", parent_func)
[all...] |
