Index: src/x64/full-codegen-x64.cc |
=================================================================== |
--- src/x64/full-codegen-x64.cc (revision 5449) |
+++ src/x64/full-codegen-x64.cc (working copy) |
@@ -165,7 +165,7 @@ |
} |
{ Comment cmnt(masm_, "[ Stack check"); |
- Label ok; |
+ NearLabel ok; |
__ CompareRoot(rsp, Heap::kStackLimitRootIndex); |
__ j(above_equal, &ok); |
StackCheckStub stub; |
@@ -396,7 +396,7 @@ |
break; |
case Expression::kValue: { |
- Label done; |
+ NearLabel done; |
switch (location_) { |
case kAccumulator: |
__ bind(materialize_true); |
@@ -678,7 +678,7 @@ |
// Perform the comparison as if via '==='. |
if (ShouldInlineSmiCase(Token::EQ_STRICT)) { |
- Label slow_case; |
+ Label slow_case; |
fschneider
2010/09/15 11:21:08
Indentation off. I think this can be a NearLabel t
Rico
2010/09/15 11:33:30
Actually no, JumpIfNotBothSmi takes a Label
|
__ movq(rdx, Operand(rsp, 0)); // Switch value. |
__ JumpIfNotBothSmi(rdx, rax, &slow_case); |
__ SmiCompare(rdx, rax); |
@@ -758,7 +758,7 @@ |
// If we got a map from the runtime call, we can do a fast |
// modification check. Otherwise, we got a fixed array, and we have |
// to do a slow check. |
- Label fixed_array; |
+ NearLabel fixed_array; |
__ CompareRoot(FieldOperand(rax, HeapObject::kMapOffset), |
Heap::kMetaMapRootIndex); |
__ j(not_equal, &fixed_array); |
@@ -804,7 +804,7 @@ |
// Check if the expected map still matches that of the enumerable. |
// If not, we have to filter the key. |
- Label update_each; |
+ NearLabel update_each; |
__ movq(rcx, Operand(rsp, 4 * kPointerSize)); |
__ cmpq(rdx, FieldOperand(rcx, HeapObject::kMapOffset)); |
__ j(equal, &update_each); |
@@ -909,7 +909,7 @@ |
if (s != NULL && s->is_eval_scope()) { |
// Loop up the context chain. There is no frame effect so it is |
// safe to use raw labels here. |
- Label next, fast; |
+ NearLabel next, fast; |
if (!context.is(temp)) { |
__ movq(temp, context); |
} |
@@ -1068,7 +1068,7 @@ |
if (var->mode() == Variable::CONST) { |
// Constants may be the hole value if they have not been initialized. |
// Unhole them. |
- Label done; |
+ NearLabel done; |
MemOperand slot_operand = EmitSlotSearch(slot, rax); |
__ movq(rax, slot_operand); |
__ CompareRoot(rax, Heap::kTheHoleValueRootIndex); |
@@ -1887,7 +1887,7 @@ |
// function and receiver and have the slow path jump around this |
// code. |
if (done.is_linked()) { |
- Label call; |
+ NearLabel call; |
__ jmp(&call); |
__ bind(&done); |
// Push function. |
@@ -2249,7 +2249,7 @@ |
void FullCodeGenerator::EmitArgumentsLength(ZoneList<Expression*>* args) { |
ASSERT(args->length() == 0); |
- Label exit; |
+ NearLabel exit; |
// Get the number of formal parameters. |
__ Move(rax, Smi::FromInt(scope()->num_parameters())); |
@@ -2708,7 +2708,7 @@ |
__ movq(cache, |
FieldOperand(cache, FixedArray::OffsetOfElementAt(cache_id))); |
- Label done, not_found; |
+ NearLabel done, not_found; |
// tmp now holds finger offset as a smi. |
ASSERT(kSmiTag == 0 && kSmiTagSize == 1); |
__ movq(tmp, FieldOperand(cache, JSFunctionResultCache::kFingerOffset)); |
@@ -2747,7 +2747,7 @@ |
VisitForValue(args->at(1), kAccumulator); |
__ pop(left); |
- Label done, fail, ok; |
+ NearLabel done, fail, ok; |
__ cmpq(left, right); |
__ j(equal, &ok); |
// Fail if either is a non-HeapObject. |
@@ -2939,7 +2939,7 @@ |
case Token::ADD: { |
Comment cmt(masm_, "[ UnaryOperation (ADD)"); |
VisitForValue(expr->expression(), kAccumulator); |
- Label no_conversion; |
+ NearLabel no_conversion; |
Condition is_smi = masm_->CheckSmi(result_register()); |
__ j(is_smi, &no_conversion); |
__ push(result_register()); |
@@ -3042,7 +3042,7 @@ |
} |
// Call ToNumber only if operand is not a smi. |
- Label no_conversion; |
+ NearLabel no_conversion; |
Condition is_smi; |
is_smi = masm_->CheckSmi(rax); |
__ j(is_smi, &no_conversion); |