OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
defs:Blocks
(Results
1 - 17
of
17
) sorted by null
/external/llvm/include/llvm/CodeGen/
EdgeBundles.h
33
///
Blocks
- Map each bundle to a list of basic block numbers.
34
SmallVector<SmallVector<unsigned, 8>, 4>
Blocks
;
47
/// getBlocks - Return an array of
blocks
that are connected to Bundle.
48
ArrayRef<unsigned> getBlocks(unsigned Bundle) { return
Blocks
[Bundle]; }
/external/llvm/lib/Transforms/Scalar/
BasicBlockPlacement.cpp
11
// algorithm. The idea is to put frequently executed
blocks
together at the
14
// function, this pass basically orders
blocks
in depth-first order
22
// placing the most frequently executed successor until we run out of
blocks
. I
39
STATISTIC(NumMoved, "Number of basic
blocks
moved");
72
/// PlaceBlocks - Recursively place the specified
blocks
and any unplaced
93
// Recursively place all
blocks
.
102
/// PlaceBlocks - Recursively place the specified
blocks
and any unplaced
113
Function::BasicBlockListType &
Blocks
= BB->getParent()->getBasicBlockList();
114
Blocks
.splice(InsertPos,
Blocks
, BB)
[
all
...]
/external/llvm/tools/llvm-objdump/
MCFunction.h
75
MapTy
Blocks
;
87
iterator begin() const { return
Blocks
.begin(); }
88
iterator end() const { return
Blocks
.end(); }
93
Blocks
.push_back(std::make_pair(Address, BB));
94
return
Blocks
.back().second;
/external/llvm/include/llvm/ADT/
PostOrderIterator.h
200
// This is used to visit basic
blocks
in a method in reverse post order. This
222
std::vector<NodeType*>
Blocks
; // Block list in normal PO order
224
copy(po_begin(BB), po_end(BB), back_inserter(
Blocks
));
234
inline rpo_iterator begin() { return
Blocks
.rbegin(); }
235
inline rpo_iterator end() { return
Blocks
.rend(); }
/external/llvm/include/llvm/Support/
GCOV.h
181
SmallVector<GCOVBlock *, 16>
Blocks
;
/external/llvm/lib/CodeGen/
InterferenceCache.h
37
/// of PhysReg in all basic
blocks
.
67
///
Blocks
- Interference for each block in the function.
68
SmallVector<BlockInterference, 8>
Blocks
;
70
/// update - Recompute
Blocks
[MBBNum]
102
if (
Blocks
[MBBNum].Tag != Tag)
104
return &
Blocks
[MBBNum];
MachineLICM.cpp
106
// If a MBB does not dominate loop exiting
blocks
then it may not safe
219
///
blocks
dominated by the specified block, and that are in the current
473
const std::vector<MachineBasicBlock*>
Blocks
= CurLoop->getBlocks();
474
for (unsigned i = 0, e =
Blocks
.size(); i != e; ++i) {
475
MachineBasicBlock *BB =
Blocks
[i];
536
const std::vector<MachineBasicBlock*>
Blocks
= CurLoop->getBlocks();
537
for (unsigned i = 0, e =
Blocks
.size(); i != e; ++i) {
538
MachineBasicBlock *BB =
Blocks
[i];
594
// Check loop exiting
blocks
.
608
/// HoistRegion - Walk the specified region of the CFG (defined by all
blocks
[
all
...]
/external/llvm/tools/bugpoint/
CrashDebugger.cpp
246
/// all terminators except the specified basic
blocks
to a 'ret' instruction,
278
SmallPtrSet<BasicBlock*, 8>
Blocks
;
280
Blocks
.insert(cast<BasicBlock>(VMap[BBs[i]]));
282
outs() << "Checking for crash with only these
blocks
:";
283
unsigned NumPrint =
Blocks
.size();
287
if (NumPrint <
Blocks
.size())
288
outs() << "... <" <<
Blocks
.size() << " total>";
291
// Loop over and delete any hack up any
blocks
that are not listed...
294
if (!
Blocks
.count(BB) && BB->getTerminator()->getNumSuccessors()) {
310
// The CFG Simplifier pass may delete one of the basic
blocks
we ar
[
all
...]
/external/llvm/tools/llvm-diff/
DifferenceEngine.cpp
123
/// The current mapping from old
blocks
to new
blocks
.
124
DenseMap<BasicBlock*, BasicBlock*>
Blocks
;
131
if (!
Blocks
.count(*I)) Count++;
138
/// predecessor
blocks
it has remaining.
151
/// A queue of unified
blocks
to process.
154
/// Try to unify the given two
blocks
. Enqueues them for processing
159
BasicBlock *&Ref =
Blocks
[L];
390
return
Blocks
[cast<BlockAddress>(L)->getBasicBlock()]
446
return
Blocks
[cast<BasicBlock>(L)] != R
[
all
...]
/external/clang/lib/Analysis/
LiveVariables.cpp
50
/// This method is for tracking visited
blocks
in the main threadsafety loop.
62
std::vector<const CFGBlock*>
Blocks
;
72
Blocks
.reserve(CFGraph->getNumBlockIDs());
77
BlockOrder[*I] =
Blocks
.size() + 1;
78
Blocks
.push_back(*I);
83
return
Blocks
.rbegin();
87
return
Blocks
.rend();
595
// Merge the values of all successor
blocks
.
ThreadSafety.cpp
79
/// This method is for tracking visited
blocks
in the main threadsafety loop.
91
std::vector<const CFGBlock*>
Blocks
;
97
Blocks
.reserve(CFGraph->getNumBlockIDs());
102
Blocks
.push_back(*I);
107
return
Blocks
.rbegin();
111
return
Blocks
.rend();
710
/// We traverse the
blocks
in the CFG, compute the set of mutexes that are held
776
// Iterate through the predecessor
blocks
and warn if the lockset for all
838
// FIXME: Should we call this function for all
blocks
which exit the function?
[
all
...]
/external/llvm/include/llvm/Analysis/
LoopInfo.h
17
// contained entirely within the loop and the basic
blocks
the make up the loop.
24
// * the successor
blocks
of the loop
73
//
Blocks
- The list of
blocks
in this loop. First entry is the header node.
74
std::vector<BlockT*>
Blocks
;
90
///
blocks
, where depth 0 is used for
blocks
not inside any loops.
98
BlockT *getHeader() const { return
Blocks
.front(); }
131
/// getBlocks - Get a list of the basic
blocks
which make up this loop.
133
const std::vector<BlockT*> &getBlocks() const { return
Blocks
; }
[
all
...]
/external/llvm/lib/Transforms/Instrumentation/
GCOVProfiling.cpp
12
// to records the edges between
blocks
that run and emit a complementary "gcda"
130
// Returns the length measured in 4-byte
blocks
that will be used to
193
// other
blocks
.
243
// set of
blocks
and a map of edges between
blocks
. This is the only GCOV
244
// object users can construct, the
blocks
and lines will be rooted here.
253
Blocks
[BB] = new GCOVBlock(i++, os);
274
DeleteContainerSeconds(
Blocks
);
279
return *
Blocks
[BB];
287
// Emit count of
blocks
[
all
...]
/external/chromium/net/tools/flip_server/
balsa_headers.h
97
typedef std::vector<BufferBlock>
Blocks
;
101
// Returns the total amount of memory used by the buffer
blocks
.
104
const char* GetPtr(
Blocks
::size_type block_idx) const {
110
char* GetPtr(
Blocks
::size_type block_idx) {
150
Blocks
::size_type* block_buffer_idx);
157
char* Reserve(size_t size,
Blocks
::size_type* block_buffer_idx);
177
Blocks
::size_type num_blocks() const { return blocks_.size(); }
193
// The block at start_idx, and all subsequent
blocks
195
void CleanupBlocksStartingFrom(
Blocks
::size_type start_idx);
198
Blocks
blocks_
[
all
...]
/external/clang/include/clang/Analysis/
CFG.h
321
/// LoopTarget - Some
blocks
are used to represent the "loop edge" to
323
/// refer to the loop statement for such
blocks
(and be null otherwise).
331
/// CFG
blocks
.
338
/// control cannot technically ever proceed past this block. All such
blocks
614
CFGBlock & front() { return *
Blocks
.front(); }
615
CFGBlock & back() { return *
Blocks
.back(); }
617
iterator begin() { return
Blocks
.begin(); }
618
iterator end() { return
Blocks
.end(); }
619
const_iterator begin() const { return
Blocks
.begin(); }
620
const_iterator end() const { return
Blocks
.end();
[
all
...]
/external/v8/src/
lithium.h
227
bool
Blocks
(LOperand* operand) const {
/external/clang/lib/Rewrite/
RewriteObjC.cpp
124
SmallVector<BlockExpr *, 32>
Blocks
;
658
//
Blocks
preamble.
[
all
...]
Completed in 482 milliseconds