Home
last modified time | relevance | path

Searched refs:BlockNode (Results 1 – 2 of 2) sorted by relevance

/external/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h168 struct BlockNode {
172 bool operator==(const BlockNode &X) const { return Index == X.Index; }
173 bool operator!=(const BlockNode &X) const { return Index != X.Index; }
174 bool operator<=(const BlockNode &X) const { return Index <= X.Index; }
175 bool operator>=(const BlockNode &X) const { return Index >= X.Index; }
176 bool operator<(const BlockNode &X) const { return Index < X.Index; }
177 bool operator>(const BlockNode &X) const { return Index > X.Index; }
179 BlockNode() : Index(UINT32_MAX) {}
180 BlockNode(IndexType Index) : Index(Index) {}
197 typedef SmallVector<std::pair<BlockNode, BlockMass>, 4> ExitMap;
[all …]
/external/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp46 typedef BlockFrequencyInfoImplBase::BlockNode BlockNode; typedef
101 void Distribution::add(const BlockNode &Node, uint64_t Amount, in add()
156 typedef DenseMap<BlockNode::IndexType, Weight> HashTable; in combineWeightsByHashing()
262 const BlockNode &Pred, in addToDist()
263 const BlockNode &Succ, in addToDist()
268 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist()
272 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); in addToDist()
370 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
378 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source, in distributeMass()
388 auto debugAssign = [&](const BlockNode &T, const BlockMass &M, in distributeMass()
[all …]