Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://clang.llvm.org/doxygen/IntervalPartition_8cpp_source.html below:

clang: lib/Analysis/IntervalPartition.cpp Source File

std::vector<const Node *>

;

<

Node>

assert(Header !=

);

Interval.

.push_back(Header);

Partitioned.set(

(*Header));

std::queue<const Node *> Worklist;

llvm::BitVector Workset(Partitioned.size(),

);

(

*S : Header->succs())

(

SID =

(*S); !Partitioned.test(SID)) {

std::vector<const Node *> MaybeSuccessors;

(!Worklist.empty()) {

*B = Worklist.front();

AllInInterval = llvm::all_of(B->preds(), [&](

*

) {

return llvm::is_contained(Interval.Nodes, P);

Interval.

.push_back(B);

Partitioned.set(

);

(

*S : B->succs())

(

SID =

(*S);

!Partitioned.test(SID) && !Workset.test(SID)) {

MaybeSuccessors.push_back(B);

(

*B : MaybeSuccessors)

(!llvm::is_contained(Interval.

, B))

<

Node>

std::vector<CFGIntervalNode *> &Index,

std::queue<const Node *> &Successors,

llvm::BitVector &Partitioned,

*Header) {

(

*S :

.Successors)

(

*N :

.Nodes) {

assert(N !=

);

assert(

(*N) < Index.size());

Index[

(*N)] = &Interval;

(std::is_same_v<std::decay_t<Node>,

>)

std::vector<const CFGBlock *>

;

(

&N :

.Nodes)

Count += N->Nodes.size();

.reserve(Count);

(

&N :

.Nodes)

.insert(

.end(), N->Nodes.begin(), N->Nodes.end());

<

Node>

*EntryBlock) {

assert(EntryBlock !=

);

std::vector<CFGIntervalNode *> Index(NumBlockIDs,

);

std::vector<std::pair<const Node *, CFGIntervalNode *>> Intervals;

llvm::BitVector Partitioned(NumBlockIDs,

);

std::queue<const Node *> Successors;

Intervals.emplace_back(EntryBlock, &Graph.back());

(!Successors.empty()) {

*B = Successors.front();

assert(B !=

);

(Partitioned.test(

(*B)))

Intervals.emplace_back(B, &Graph.back());

(

[H, N] : Intervals) {

(

*

: H->preds()) {

assert(

(*

) < NumBlockIDs);

(Pred ==

)

PrevSize = Cfg.

();

Size = Graph.size();

(Size > 1 && Size < PrevSize) {

PrevSize = Graph.size();

std::move(Graph[0].

);

N = WTO[0]->getParent()->getNumBlockIDs();

(

I = 0, S = WTO.size(); I < S; ++I)

BoundNodesTreeBuilder Nodes

Represents a single basic block in a source-level CFG.

unsigned getBlockID() const

Represents a source-level, intra-procedural CFG that represents the control-flow of a Stmt.

unsigned size() const

Return the total number of CFGBlocks within the CFG This is simply a renaming of the getNumBlockIDs()...

unsigned getNumBlockIDs() const

Returns the total number of BlockIDs allocated (which start at 0).

static void fillIntervalNode(CFGIntervalGraph &Graph, std::vector< CFGIntervalNode * > &Index, std::queue< const Node * > &Successors, llvm::BitVector &Partitioned, const Node *Header)

static unsigned getID(const CFGBlock &B)

std::vector< const CFGBlock * > buildInterval(const CFGBlock *Header)

std::deque< CFGIntervalNode > CFGIntervalGraph

static CFGIntervalGraph partitionIntoIntervalsImpl(unsigned NumBlockIDs, const Node *EntryBlock)

CFGIntervalGraph partitionIntoIntervals(const CFG &Cfg)

The JSON file list parser is used to communicate input to InstallAPI.

@ Result

The result type of a method or function.

std::vector< const CFGBlock * > WeakTopologicalOrdering

A weak topological ordering (WTO) of CFG nodes provides a total order over the CFG (defined in WTOCom...

std::optional< WeakTopologicalOrdering > getIntervalWTO(const CFG &Cfg)

llvm::SmallDenseSet< const Node * > Successors

std::vector< const Node * > Nodes

std::vector< unsigned > BlockOrder

WTOCompare(const WeakTopologicalOrdering &WTO)

std::vector< const CFGBlock * > Nodes

llvm::SmallDenseSet< const CFGIntervalNode * > Predecessors

llvm::SmallDenseSet< const CFGIntervalNode * > Successors

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4