X64: Convert smis to holding 32 bits of payload.

src/x64/virtual-frame-x64.cc

 // Copyright 2009 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 47 matching lines @@
   //   rsp: stack pointer, points to return address from this function.
   //   rbp: base pointer, points to previous JS, ArgumentsAdaptor, or
   //        Trampoline frame.
   //   rsi: context of this function call.
   //   rdi: pointer to this function object.
   Comment cmnt(masm(), "[ Enter JS frame");
 
 #ifdef DEBUG
   // Verify that rdi contains a JS function.  The following code
   // relies on rax being available for use.
-  Condition not_smi = masm()->CheckNotSmi(rdi);
+  Condition not_smi = NegateCondition(masm()->CheckSmi(rdi));
   __ Check(not_smi,
            "VirtualFrame::Enter - rdi is not a function (smi check).");
   __ CmpObjectType(rdi, JS_FUNCTION_TYPE, rax);
   __ Check(equal,
            "VirtualFrame::Enter - rdi is not a function (map check).");
 #endif
 
   EmitPush(rbp);
 
   __ movq(rbp, rsp);
@@ skipping 111 matching lines @@
 
 
 void VirtualFrame::EmitPush(Immediate immediate) {
   ASSERT(stack_pointer_ == element_count() - 1);
   elements_.Add(FrameElement::MemoryElement());
   stack_pointer_++;
   __ push(immediate);
 }
 
 
+void VirtualFrame::EmitPush(Smi* smi_value) {
+  ASSERT(stack_pointer_ == element_count() - 1);
+  elements_.Add(FrameElement::MemoryElement());
+  stack_pointer_++;
+  __ Push(smi_value);
+}
+
+
 void VirtualFrame::EmitPush(Handle<Object> value) {
   ASSERT(stack_pointer_ == element_count() - 1);
   elements_.Add(FrameElement::MemoryElement());
   stack_pointer_++;
   __ Push(value);
 }
 
 
 void VirtualFrame::EmitPush(Heap::RootListIndex index) {
   ASSERT(stack_pointer_ == element_count() - 1);
@@ skipping 624 matching lines @@
 
 void VirtualFrame::SyncElementByPushing(int index) {
   // Sync an element of the frame that is just above the stack pointer
   // by pushing it.
   ASSERT(index == stack_pointer_ + 1);
   stack_pointer_++;
   FrameElement element = elements_[index];
 
   switch (element.type()) {
     case FrameElement::INVALID:
-      __ push(Immediate(Smi::FromInt(0)));
+      __ Push(Smi::FromInt(0));
       break;
 
     case FrameElement::MEMORY:
       // No memory elements exist above the stack pointer.
       UNREACHABLE();
       break;
 
     case FrameElement::REGISTER:
       __ push(element.reg());
       break;
@@ skipping 143 matching lines @@
   // IC expects arg count in rax, function in rdi, and the arguments
   // and receiver on the stack.
   Handle<Code> ic(Builtins::builtin(Builtins::JSConstructCall));
   // Duplicate the function before preparing the frame.
   PushElementAt(arg_count + 1);
   Result function = Pop();
   PrepareForCall(arg_count + 1, arg_count + 1);  // Spill args and receiver.
   function.ToRegister(rdi);
 
   // Constructors are called with the number of arguments in register
-  // eax for now. Another option would be to have separate construct
+  // rax for now. Another option would be to have separate construct
   // call trampolines per different arguments counts encountered.
   Result num_args = cgen()->allocator()->Allocate(rax);
   ASSERT(num_args.is_valid());
   __ movq(num_args.reg(), Immediate(arg_count));
 
   function.Unuse();
   num_args.Unuse();
   return RawCallCodeObject(ic, RelocInfo::CONSTRUCT_CALL);
 }
 
@@ skipping 34 matching lines @@
   // Grow the expression stack by handler size less one (the return
   // address is already pushed by a call instruction).
   Adjust(kHandlerSize - 1);
   __ PushTryHandler(IN_JAVASCRIPT, type);
 }
 
 
 #undef __
 
 } }  // namespace v8::internal