Lines Matching refs:Value
17 return a.Value() < b.Value() ? a : b;
22 return a.Value() > b.Value() ? a : b;
61 DCHECK(Contains(pos) && pos.Value() != start().Value());
75 DCHECK(Start().Value() <= cur->pos().Value() &&
76 cur->pos().Value() <= End().Value());
149 while (use_pos != NULL && use_pos->pos().Value() < start.Value()) {
171 while (pos != NULL && pos->pos().Value() < start.Value()) {
194 use_pos->pos().Value() > pos.NextInstruction().InstructionEnd().Value();
228 if (current_interval_->start().Value() > position.Value()) {
239 if (to_start_of->start().Value() > but_not_past.Value()) return;
243 if (to_start_of->start().Value() > start.Value()) {
252 DCHECK(Start().Value() < position.Value());
263 if (current->start().Value() == position.Value()) {
274 if (next->start().Value() >= position.Value()) {
275 split_at_start = (next->start().Value() == position.Value());
298 while (use_after != NULL && use_after->pos().Value() < position.Value()) {
303 while (use_after != NULL && use_after->pos().Value() <= position.Value()) {
339 // is a tie breaker based on where the value is first used. This part of the
344 if (start.Value() == other_start.Value()) {
349 return pos->pos().Value() < other_pos->pos().Value();
351 return start.Value() < other_start.Value();
356 LAllocator::TraceAlloc("Shorten live range %d to [%d\n", id_, start.Value());
358 DCHECK(first_interval_->start().Value() <= start.Value());
359 DCHECK(start.Value() < first_interval_->end().Value());
369 start.Value(),
370 end.Value());
373 first_interval_->start().Value() <= end.Value()) {
374 if (first_interval_->end().Value() > end.Value()) {
394 start.Value(),
395 end.Value());
401 if (end.Value() == first_interval_->start().Value()) {
403 } else if (end.Value() < first_interval_->start().Value()) {
411 DCHECK(start.Value() < first_interval_->end().Value());
425 pos.Value());
430 while (current != NULL && current->pos().Value() < pos.Value()) {
454 DCHECK(Start().Value() <= use_pos->pos().Value() &&
455 use_pos->pos().Value() <= End().Value());
469 return Start().Value() <= position.Value() &&
470 position.Value() < End().Value();
481 interval->next()->start().Value() >= interval->start().Value());
484 if (interval->start().Value() > position.Value()) return false;
496 if (a->start().Value() > other->End().Value()) break;
497 if (b->start().Value() > End().Value()) break;
502 if (a->start().Value() < b->start().Value()) {
504 if (a == NULL || a->start().Value() > other->End().Value()) break;
573 // each live_out value.
699 if (range->IsEmpty() || range->Start().Value() > position.Value()) {
793 // This value is produced on the stack, we never need to spill it.
872 // instruction will include the output operand (whose value at the
1047 // value which is invisible to PopulatePointerMaps(), because we store
1155 // value which is invisible to PopulatePointerMaps(), because we store
1209 if (first_range->End().Value() == pos.Value()) {
1313 // loop instruction to the last for each value live on entry to the
1344 PrintF("Value %d used before first definition!\n", operand_index);
1346 PrintF("First use is at %d\n", range->first_pos()->pos().Value());
1452 cur->id(), cur->Start().Value(), safe_point);
1532 position.Value());
1546 } else if (pos->pos().Value() >
1547 current->Start().NextInstruction().Value()) {
1559 if (cur_active->End().Value() <= position.Value()) {
1570 if (cur_inactive->End().Value() <= position.Value()) {
1618 HValue* value = graph_->LookupValue(virtual_register);
1619 if (value == NULL) return false;
1620 return value->representation().IsTagged() && !value->type().IsSmi();
1626 HValue* value = graph_->LookupValue(virtual_register);
1627 if (value != NULL && value->representation().IsDouble()) {
1654 DCHECK(allocation_finger_.Value() <= range->Start().Value());
1701 if (a->Start().Value() < b->Start().Value()) return false;
1722 if (reusable_slots_.first()->End().Value() >
1723 range->TopLevel()->Start().Value()) {
1781 DCHECK(cur_inactive->End().Value() > current->Start().Value());
1795 free_until_pos[register_index].Value(),
1797 current->End().Value());
1800 if (free_until_pos[register_index].Value() >= current->End().Value()) {
1813 if (free_until_pos[code].Value() > free_until_pos[reg].Value()) {
1820 if (pos.Value() <= current->Start().Value()) {
1825 if (pos.Value() < current->End().Value()) {
1836 DCHECK(pos.Value() >= current->End().Value());
1882 DCHECK(range->End().Value() > current->Start().Value());
1897 if (use_pos[code].Value() > use_pos[reg].Value()) {
1904 if (pos.Value() < register_use->pos().Value()) {
1911 if (block_pos[reg].Value() < current->End().Value()) {
1922 DCHECK(block_pos[reg].Value() >= current->End().Value());
1954 if (prev_use == NULL || prev_use->pos().Value() < loop_start.Value()) {
1998 DCHECK(range->End().Value() > current->Start().Value());
2026 TraceAlloc("Splitting live range %d at %d\n", range->id(), pos.Value());
2028 if (pos.Value() <= range->Start().Value()) return range;
2049 start.Value(),
2050 end.Value());
2053 DCHECK(split_pos.Value() >= start.Value());
2110 CHECK(start.Value() < end.Value());
2114 if (second_part->Start().Value() < end.Value()) {
