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

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

clang: lib/Analysis/ThreadSafetyTIL.cpp Source File

;

threadSafety;

:

;

* Future::force() {

Idx = Predecessors.

();

(

*

: Args) {

(

*Ph = dyn_cast<Phi>(

)) {

Ph->values().reserveCheck(1, Arena);

Ph->values().push_back(

);

Predecessors.

(NumPreds, Arena);

(

*

: Args) {

(

*Ph = dyn_cast<Phi>(

)) {

Ph->values().reserve(NumPreds, Arena);

(

*

= dyn_cast<Variable>(

)) {

(

*Ph = dyn_cast<Phi>(

)) {

(

*

= dyn_cast<Variable>(

)) {

=

->definition();

(

*Ph = dyn_cast<Phi>(

)) {

(

i = 1, n = Ph->

().

(); i < n; ++i) {

BasicBlock::renumberInstrs(

ID) {

(

*Arg : Args)

Arg->setID(

, ID++);

(

*Instr : Instrs)

Instr->setID(

, ID++);

TermInstr->

(

, ID++);

(Visited)

ID;

ID =

->topologicalSort(Blocks, ID);

Blocks[BlockID] =

;

(!Visited)

ID;

(DominatorNode.

)

ID = DominatorNode.

->topologicalFinalSort(Blocks, ID);

(

*Pred : Predecessors)

ID = Pred->topologicalFinalSort(Blocks, ID);

assert(

(ID) < Blocks.

());

Blocks[BlockID] =

;

BasicBlock::computeDominator() {

(

*Pred : Predecessors) {

(Pred->BlockID >= BlockID)

;

(Candidate ==

) {

*Alternate = Pred;

(Alternate != Candidate) {

(Candidate->BlockID > Alternate->BlockID)

Candidate = Candidate->DominatorNode.

;

Alternate = Alternate->DominatorNode.

;

DominatorNode.

= Candidate;

BasicBlock::computePostDominator() {

(Succ->BlockID <= BlockID)

;

(Candidate ==

) {

*Alternate = Succ;

(Alternate != Candidate) {

(Candidate->BlockID < Alternate->BlockID)

Candidate = Candidate->PostDominatorNode.

;

Alternate = Alternate->PostDominatorNode.

;

PostDominatorNode.

= Candidate;

SCFG::renumberInstrs() {

InstrID = 0;

(

*

: Blocks)

InstrID =

->renumberInstrs(InstrID);

N->

=

->SizeOfSubTree;

NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size());

(NumUnreachableBlocks > 0) {

(

I = NumUnreachableBlocks,

= Blocks.size(); I <

; ++I) {

NI = I - NumUnreachableBlocks;

Blocks[NI] = Blocks[I];

Blocks[NI]->BlockID = NI;

Blocks.drop(NumUnreachableBlocks);

(

*

: Blocks)

->computeDominator();

NumBlocks = Exit->topologicalFinalSort(Blocks, 0);

assert(

(NumBlocks) == Blocks.size());

(

*

: Blocks.reverse()) {

->computePostDominator();

(

*

: Blocks) {

(

*

: Blocks.reverse()) {

Forward-declares and imports various common LLVM datatypes that clang wants to use unqualified.

static void computeNodeSize(BasicBlock *B, BasicBlock::TopologyNode BasicBlock::*TN)

static void computeNodeID(BasicBlock *B, BasicBlock::TopologyNode BasicBlock::*TN)

A basic block is part of an SCFG.

unsigned addPredecessor(BasicBlock *Pred)

ArrayRef< BasicBlock * > successors()

void reservePredecessors(unsigned NumPreds)

virtual SExpr * compute()

Phi Node, for code in SSA form.

const ValArray & values() const

Base class for AST nodes in the typed intermediate language.

void setID(BasicBlock *B, unsigned id)

Set the basic block and instruction ID for this expression.

void reserve(size_t Ncp, MemRegionRef A)

void push_back(const T &Elem)

void reserveCheck(size_t N, MemRegionRef A)

bool isTrivial(const SExpr *E)

TIL_UnaryOpcode

Opcode for unary arithmetic operations.

void simplifyIncompleteArg(til::Phi *Ph)

StringRef getBinaryOpcodeString(TIL_BinaryOpcode Op)

Return the name of a binary opcode.

StringRef getUnaryOpcodeString(TIL_UnaryOpcode Op)

Return the name of a unary opcode.

TIL_BinaryOpcode

Opcode for binary arithmetic operations.

SExpr * simplifyToCanonicalVal(SExpr *E)

const SExpr * getCanonicalVal(const SExpr *E)

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

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