Lines Matching defs:Size
351 // Number of vreg size slots that the temporaries use (used in baseline compiler).
393 blocks_(graph->GetArena(), graph->GetBlocks().Size(), true) {}
416 for (size_t i = 0, e = back_edges_.Size(); i < e; ++i) {
423 return back_edges_.Size();
437 for (size_t i = 0, e = back_edges_.Size(); i < e; ++i) {
544 for (size_t i = 0, e = dominated_blocks_.Size(); i < e; ++i) {
619 DCHECK_EQ(predecessors_.Size(), 2u);
626 DCHECK_EQ(successors_.Size(), 2u);
633 for (size_t i = 0, e = predecessors_.Size(); i < e; ++i) {
642 for (size_t i = 0, e = successors_.Size(); i < e; ++i) {
1140 parent->Size(),
1168 size_t Size() const { return vregs_.Size(); }
1422 environment->Size(),
1437 environment->Size(),
1641 // specialization for N=0) because embedded arrays cannot have size 0.
2378 size_t InputCount() const OVERRIDE { return inputs_.Size(); }
3049 size_t InputCount() const OVERRIDE { return inputs_.Size(); }
3908 for (size_t i = 0, e = moves_.Size(); i < e; ++i) {
3924 for (size_t i = 0, e = moves_.Size(); i < e; ++i) {
3936 size_t NumMoves() const { return moves_.Size(); }
3997 bool Done() const { return index_ == graph_.GetBlocks().Size(); }
4015 bool Done() const { return index_ == graph_.GetReversePostOrder().Size(); }
4029 : graph_(graph), index_(graph_.GetReversePostOrder().Size()) {
4048 : order_(graph.GetLinearOrder()), index_(graph.GetLinearOrder().Size()) {}
4071 bool Done() const { return index_ == order_.Size(); }
4096 bool Done() const { return index_ == blocks_.Size(); }
4100 for (size_t e = blocks_.Size(); index_ < e; ++index_) {
4129 bool Done() const { return index_ == blocks_.Size(); }
4133 for (size_t e = blocks_.Size(); index_ < e; ++index_) {
