OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:BasicBlockId
(Results
1 - 16
of
16
) sorted by null
/art/compiler/dex/
dataflow_iterator-inl.h
31
BasicBlockId
bb_id = block_id_list_->Get(idx_);
53
// Get the
BasicBlockId
.
54
BasicBlockId
bb_id = block_id_list_->Get(idx_);
68
// Get the
BasicBlockId
.
69
BasicBlockId
bb_id = block_id_list_->Get(idx_);
91
// Get the
BasicBlockId
.
92
BasicBlockId
bb_id = block_id_list_->Get(idx_);
161
BasicBlockId
idx = idx_;
mir_graph_test.cc
30
BasicBlockId
successors[kMaxPredecessors];
32
BasicBlockId
predecessors[kMaxPredecessors];
89
bb->predecessors = new (&cu_.arena) GrowableArray<
BasicBlockId
>(
125
BasicBlockId
id = cu_.mir_graph->topological_order_->Get(i);
130
void DoCheckOrder(const
BasicBlockId
* ids, size_t count) {
138
void CheckOrder(const
BasicBlockId
(&ids)[count]) {
173
const
BasicBlockId
expected_order[] = {
195
const
BasicBlockId
expected_order[] = {
218
const
BasicBlockId
expected_order[] = {
242
const
BasicBlockId
expected_order[] =
[
all
...]
mir_graph.h
200
typedef uint16_t
BasicBlockId
;
201
static const
BasicBlockId
NullBasicBlockId = 0;
351
BasicBlockId
bb;
356
BasicBlockId
* phi_incoming;
392
BasicBlockId
id;
393
BasicBlockId
dfs_id;
395
BasicBlockId
fall_through;
396
BasicBlockId
taken;
397
BasicBlockId
i_dom; // Immediate dominator.
415
GrowableArray<
BasicBlockId
>* predecessors
[
all
...]
local_value_numbering.h
39
LocalValueNumbering(GlobalValueNumbering* gvn,
BasicBlockId
id, ScopedArenaAllocator* allocator);
41
BasicBlockId
Id() const {
358
COMPILE_ASSERT(sizeof(
BasicBlockId
) == sizeof(uint16_t), BasicBlockId_must_be_16_bit);
359
BasicBlockId
id_;
387
ScopedArenaVector<
BasicBlockId
> merge_names_;
389
ScopedArenaSafeMap<ScopedArenaVector<
BasicBlockId
>, uint16_t> merge_map_;
dataflow_iterator.h
107
GrowableArray<
BasicBlockId
>* block_id_list_; /**< @brief the list of BasicBlocks we want to iterate on */
434
const GrowableArray<
BasicBlockId
>* const loop_ends_;
ssa_transformation.cc
97
dfs_order_ = new (arena_) GrowableArray<
BasicBlockId
>(arena_, GetNumBlocks(),
106
dfs_post_order_ = new (arena_) GrowableArray<
BasicBlockId
>(arena_, GetNumBlocks(),
185
new (arena_) GrowableArray<
BasicBlockId
>(arena_, num_reachable_blocks_,
320
GrowableArray<
BasicBlockId
>::Iterator iter(bb->predecessors);
557
GrowableArray<
BasicBlockId
>::Iterator iter(bb->predecessors);
561
BasicBlockId
* incoming =
562
static_cast<
BasicBlockId
*>(arena_->Alloc(sizeof(
BasicBlockId
) * num_uses,
mir_graph.cc
[
all
...]
global_value_numbering.cc
97
GrowableArray<
BasicBlockId
>::Iterator iter(bb->predecessors);
183
BasicBlockId
succ_id) {
mir_optimization_test.cc
41
BasicBlockId
successors[kMaxPredecessors];
43
BasicBlockId
predecessors[kMaxPredecessors];
48
BasicBlockId
bbid;
132
bb->predecessors = new (&cu_.arena) GrowableArray<
BasicBlockId
>(
global_value_numbering.h
191
static bool HasNullCheckLastInsn(const BasicBlock* pred_bb,
BasicBlockId
succ_id);
mir_optimization.cc
541
BasicBlockId
* incoming = phi->meta.phi_incoming;
650
BasicBlockId
t_bb = prev->taken;
[
all
...]
mir_dataflow.cc
[
all
...]
global_value_numbering_test.cc
48
BasicBlockId
successors[kMaxPredecessors];
50
BasicBlockId
predecessors[kMaxPredecessors];
57
BasicBlockId
bbid;
206
bb->predecessors = new (&cu_.arena) GrowableArray<
BasicBlockId
>(
251
mir->meta.phi_incoming = static_cast<
BasicBlockId
*>(
252
allocator_->Alloc(def->num_uses * sizeof(
BasicBlockId
), kArenaAllocDFInfo));
[
all
...]
local_value_numbering.cc
337
merge_map_(std::less<ScopedArenaVector<
BasicBlockId
>>(), allocator->Adapter()),
[
all
...]
/art/compiler/dex/quick/
mir_to_lir.cc
634
BasicBlockId
target_id = is_taken ? bb->taken : bb->fall_through;
662
BasicBlockId
target_id = is_taken ? bb->taken : bb->fall_through;
[
all
...]
/art/compiler/dex/portable/
mir_to_gbc.cc
[
all
...]
Completed in 317 milliseconds