OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Roots
(Results
1 - 10
of
10
) sorted by null
/external/llvm/include/llvm/Analysis/
DominanceFrontier.h
37
std::vector<BasicBlock*>
Roots
;
48
inline const std::vector<BasicBlock*> &getRoots() const { return
Roots
; }
166
assert(
Roots
.size() == 1 && "Should always have entry node!");
167
return
Roots
[0];
173
Roots
= DT.getRoots();
174
assert(
Roots
.size() == 1 && "Only one entry block for forward domfronts!");
175
calculate(DT, DT[
Roots
[0]]);
Dominators.h
39
std::vector<NodeT*>
Roots
;
42
Roots
(), IsPostDominators(isPostDom) {}
49
inline const std::vector<NodeT*> &getRoots() const { return
Roots
; }
231
this->
Roots
.clear();
417
assert(this->
Roots
.size() == 1 && "Should always have entry node!");
418
return this->
Roots
[0];
643
this->
Roots
.push_back(BB);
657
this->
Roots
.push_back(entry);
663
// Initialize the
roots
list
/external/llvm/lib/Support/
DAGDeltaAlgorithm.cpp
67
std::vector<change_ty>
Roots
;
201
// Compute the
roots
.
205
Roots
.push_back(*it);
208
std::vector<change_ty> Worklist(
Roots
.begin(),
Roots
.end());
253
llvm::errs() << "
Roots
: [";
254
for (std::vector<change_ty>::const_iterator it =
Roots
.begin(),
255
ie =
Roots
.end(); it != ie; ++it) {
256
if (it !=
Roots
.begin()) llvm::errs() << ", ";
309
// The current set of changes we are minimizing, starting at the
roots
[
all
...]
/external/llvm/include/llvm/CodeGen/
GCMetadata.h
19
// - Stack offsets for GC
roots
, as specified by calls to llvm.gcroot
21
// As a refinement, liveness analysis calculates the set of live
roots
at each
23
// generator, so all
roots
are assumed live.
93
std::vector<GCRoot>
Roots
;
103
// The bit vector is the more compact representation where >3.2% of
roots
122
Roots
.push_back(GCRoot(Num, Metadata));
127
return
Roots
.erase(position);
148
/// roots_begin/roots_end - Iterators for all
roots
in the function.
150
roots_iterator roots_begin() { return
Roots
.begin(); }
151
roots_iterator roots_end () { return
Roots
.end();
[
all
...]
/external/llvm/lib/CodeGen/
GCStrategy.cpp
14
//
Roots
are identified in SelectionDAGISel.
50
AllocaInst **
Roots
, unsigned Count);
181
bool LowerIntrinsics::InsertRootInitializers(Function &F, AllocaInst **
Roots
,
198
for (AllocaInst **I =
Roots
, **E =
Roots
+ Count; I != E; ++I)
212
// action. The default for
roots
is no action.
286
SmallVector<AllocaInst*, 32>
Roots
;
316
Roots
.push_back(cast<AllocaInst>(
329
if (
Roots
.size())
330
MadeChange |= InsertRootInitializers(F,
Roots
.begin(), Roots.size())
[
all
...]
ShadowStackGC.cpp
13
// to identify
roots
.
22
// In order to support this particular transformation, all stack
roots
are
43
///
roots
.
51
///
Roots
- GC
roots
in the current function. Each is a pair of the
53
std::vector<std::pair<CallInst*,AllocaInst*> >
Roots
;
209
for (unsigned I = 0; I !=
Roots
.size(); ++I) {
210
Constant *C = cast<Constant>(
Roots
[I].first->getArgOperand(1));
220
ConstantInt::get(Int32Ty,
Roots
.size(), false),
262
for (size_t I = 0; I !=
Roots
.size(); I++
[
all
...]
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
ExplodedGraph.h
252
/// The
roots
of the simulation graph. Usually there will be only
255
/// different
roots
reach the same state at the same program location.
256
NodeVector
Roots
;
300
/// addRoot - Add an untyped node to the set of
roots
.
302
Roots
.push_back(V);
316
unsigned num_roots() const { return
Roots
.size(); }
340
roots_iterator roots_begin() { return
Roots
.begin(); }
342
roots_iterator roots_end() { return
Roots
.end(); }
344
const_roots_iterator roots_begin() const { return
Roots
.begin(); }
346
const_roots_iterator roots_end() const { return
Roots
.end();
[
all
...]
/external/llvm/utils/TableGen/
RegisterInfoEmitter.cpp
825
// Emit the table of register unit
roots
. Each regunit has one or two root
829
ArrayRef<const CodeGenRegister*>
Roots
= RegBank.getRegUnit(i).getRoots();
830
assert(!
Roots
.empty() && "All regunits must have a root register.");
831
assert(
Roots
.size() <= 2 && "More than two
roots
not supported yet.");
832
OS << " { " << getQualifiedName(
Roots
.front()->TheDef);
833
for (unsigned r = 1; r !=
Roots
.size(); ++r)
834
OS << ", " << getQualifiedName(
Roots
[r]->TheDef);
[
all
...]
CodeGenRegisters.h
404
const CodeGenRegister *
Roots
[2];
410
RegUnit() : Weight(0), RegClassUnitSetsIdx(0) {
Roots
[0] =
Roots
[1] = 0; }
413
assert(!(
Roots
[1] && !
Roots
[0]) && "Invalid
roots
array");
414
return makeArrayRef(
Roots
, !!
Roots
[0] + !!
Roots
[1]);
563
RegUnits.back().
Roots
[0] = R0
[
all
...]
CodeGenRegisters.cpp
562
ArrayRef<const CodeGenRegister*>
Roots
= RU.getRoots();
563
for (unsigned ri = 0, re =
Roots
.size(); ri != re; ++ri) {
564
const CodeGenRegister *Root =
Roots
[ri];
[
all
...]
Completed in 237 milliseconds