OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
full:predecessors_
(Results
1 - 6
of
6
) sorted by null
/art/compiler/sea_ir/ir/
sea.h
145
SeaNode(), successors_(),
predecessors_
(), reaching_defs_size_(0),
228
predecessors_
.push_back(predecessor);
235
return &
predecessors_
;
240
std::vector<sea_ir::Region*>
predecessors_
; // CFG predecessor nodes (instructions/regions)
member in class:sea_ir::Region
sea.cc
507
for (std::vector<Region*>::const_iterator pred_it =
predecessors_
.begin();
508
pred_it !=
predecessors_
.end(); pred_it++) {
588
for (unsigned int crt_pred_id = 0; crt_pred_id <
predecessors_
.size(); crt_pred_id++) {
589
if (
predecessors_
.at(crt_pred_id) == predecessor) {
/external/v8/src/
hydrogen.h
70
const ZoneList<HBasicBlock*>* predecessors() const { return &
predecessors_
; }
71
bool HasPredecessor() const { return
predecessors_
.length() > 0; }
180
ZoneList<HBasicBlock*>
predecessors_
;
member in class:v8::internal::HBasicBlock
[
all
...]
hydrogen.cc
63
predecessors_
(2),
201
int length =
predecessors_
.length();
204
HBasicBlock* predecessor =
predecessors_
[i];
275
predecessors_
.Add(pred);
376
for (int i = 0; i <
predecessors_
.length(); ++i) {
377
if (
predecessors_
[i] == predecessor) return i;
391
if (
predecessors_
.length() > 1) {
392
for (int i = 0; i <
predecessors_
.length(); ++i) {
393
ASSERT(
predecessors_
[i]->end()->SecondSuccessor() == NULL);
[
all
...]
/external/chromium_org/v8/src/
hydrogen.h
77
const ZoneList<HBasicBlock*>* predecessors() const { return &
predecessors_
; }
78
bool HasPredecessor() const { return
predecessors_
.length() > 0; }
203
ZoneList<HBasicBlock*>
predecessors_
;
member in class:v8::internal::HBasicBlock
[
all
...]
hydrogen.cc
86
predecessors_
(2, graph->zone()),
252
int length =
predecessors_
.length();
255
HBasicBlock* predecessor =
predecessors_
[i];
327
predecessors_
.Add(pred, zone());
428
for (int i = 0; i <
predecessors_
.length(); ++i) {
429
if (
predecessors_
[i] == predecessor) return i;
443
if (
predecessors_
.length() > 1) {
444
for (int i = 0; i <
predecessors_
.length(); ++i) {
445
ASSERT(
predecessors_
[i]->end()->SecondSuccessor() == NULL);
[
all
...]
Completed in 176 milliseconds