v8::internal::compiler::SimplifiedLowering Class Reference

#include <simplified-lowering.h>

Collaboration diagram for v8::internal::compiler::SimplifiedLowering:

Public Member Functions
	SimplifiedLowering (JSGraph *jsgraph)
virtual	~SimplifiedLowering ()
void	LowerAllNodes ()
void	DoLoadField (Node *node)
void	DoStoreField (Node *node)
void	DoLoadElement (Node *node)
void	DoStoreElement (Node *node)
void	DoStringAdd (Node *node)
void	DoStringEqual (Node *node)
void	DoStringLessThan (Node *node)
void	DoStringLessThanOrEqual (Node *node)

Private Member Functions
Node *	SmiTag (Node *node)
Node *	IsTagged (Node *node)
Node *	Untag (Node *node)
Node *	OffsetMinusTagConstant (int32_t offset)
Node *	ComputeIndex (const ElementAccess &access, Node *index)
Node *	StringComparison (Node *node, bool requires_ordering)
Zone *	zone ()
JSGraph *	jsgraph ()
Graph *	graph ()
CommonOperatorBuilder *	common ()
MachineOperatorBuilder *	machine ()

Private Attributes
JSGraph *	jsgraph_

Friends
class	RepresentationSelector

Detailed Description

Definition at line 17 of file simplified-lowering.h.

Constructor & Destructor Documentation

SimplifiedLowering()

v8::internal::compiler::SimplifiedLowering::SimplifiedLowering ( JSGraph *  jsgraph )

inlineexplicit

Definition at line 19 of file simplified-lowering.h.

: jsgraph_(jsgraph) {}

~SimplifiedLowering()

virtual v8::internal::compiler::SimplifiedLowering::~SimplifiedLowering ( )

inlinevirtual

Definition at line 20 of file simplified-lowering.h.

{}

Member Function Documentation

common()

CommonOperatorBuilder* v8::internal::compiler::SimplifiedLowering::common ( )

inlineprivate

Definition at line 49 of file simplified-lowering.h.

{ return jsgraph()->common(); }

References v8::internal::compiler::JSGraph::common(), and jsgraph().

Referenced by DoStringAdd(), StringComparison(), and v8::internal::compiler::RepresentationSelector::VisitPhi().

Here is the call graph for this function:

Here is the caller graph for this function:

ComputeIndex()

Node * v8::internal::compiler::SimplifiedLowering::ComputeIndex ( const ElementAccess &  access, Node *  index  )

private

Definition at line 855 of file simplified-lowering.cc.

                                                    {
  int element_size = ElementSizeOf(access.machine_type);
  if (element_size != 1) {
    index = graph()->NewNode(machine()->Int32Mul(),
                             jsgraph()->Int32Constant(element_size), index);
  }
  int fixed_offset = access.header_size - access.tag();
  if (fixed_offset == 0) return index;
  return graph()->NewNode(machine()->Int32Add(), index,
                          jsgraph()->Int32Constant(fixed_offset));
}

References v8::internal::compiler::ElementSizeOf(), graph(), v8::internal::compiler::ElementAccess::header_size, jsgraph(), machine(), v8::internal::compiler::ElementAccess::machine_type, v8::internal::compiler::Graph::NewNode(), and v8::internal::compiler::ElementAccess::tag().

Referenced by DoLoadElement(), and DoStoreElement().

Here is the call graph for this function:

Here is the caller graph for this function:

DoLoadElement()

void v8::internal::compiler::SimplifiedLowering::DoLoadElement

(

Node *

node

)

Definition at line 869 of file simplified-lowering.cc.

                                                 {
  const ElementAccess& access = ElementAccessOf(node->op());
  node->set_op(machine()->Load(access.machine_type));
  node->ReplaceInput(1, ComputeIndex(access, node->InputAt(1)));
  node->RemoveInput(2);
}

References ComputeIndex(), v8::internal::compiler::ElementAccessOf(), machine(), and v8::internal::compiler::ElementAccess::machine_type.

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoLoadField()

void v8::internal::compiler::SimplifiedLowering::DoLoadField

(

Node *

node

)

Definition at line 836 of file simplified-lowering.cc.

                                               {
  const FieldAccess& access = FieldAccessOf(node->op());
  node->set_op(machine()->Load(access.machine_type));
  Node* offset = jsgraph()->Int32Constant(access.offset - access.tag());
  node->InsertInput(zone(), 1, offset);
}

References v8::internal::compiler::FieldAccessOf(), v8::internal::compiler::JSGraph::Int32Constant(), jsgraph(), machine(), v8::internal::compiler::FieldAccess::machine_type, v8::internal::compiler::FieldAccess::offset, v8::internal::compiler::FieldAccess::tag(), and zone().

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoStoreElement()

void v8::internal::compiler::SimplifiedLowering::DoStoreElement

(

Node *

node

)

Definition at line 877 of file simplified-lowering.cc.

                                                  {
  const ElementAccess& access = ElementAccessOf(node->op());
  WriteBarrierKind kind = ComputeWriteBarrierKind(
      access.base_is_tagged, access.machine_type, access.type);
  node->set_op(
      machine()->Store(StoreRepresentation(access.machine_type, kind)));
  node->ReplaceInput(1, ComputeIndex(access, node->InputAt(1)));
  node->RemoveInput(2);
}

References v8::internal::compiler::ElementAccess::base_is_tagged, ComputeIndex(), v8::internal::compiler::ComputeWriteBarrierKind(), v8::internal::compiler::ElementAccessOf(), machine(), v8::internal::compiler::ElementAccess::machine_type, and v8::internal::compiler::ElementAccess::type.

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoStoreField()

void v8::internal::compiler::SimplifiedLowering::DoStoreField

(

Node *

node

)

Definition at line 844 of file simplified-lowering.cc.

                                                {
  const FieldAccess& access = FieldAccessOf(node->op());
  WriteBarrierKind kind = ComputeWriteBarrierKind(
      access.base_is_tagged, access.machine_type, access.type);
  node->set_op(
      machine()->Store(StoreRepresentation(access.machine_type, kind)));
  Node* offset = jsgraph()->Int32Constant(access.offset - access.tag());
  node->InsertInput(zone(), 1, offset);
}

References v8::internal::compiler::FieldAccess::base_is_tagged, v8::internal::compiler::ComputeWriteBarrierKind(), v8::internal::compiler::FieldAccessOf(), v8::internal::compiler::JSGraph::Int32Constant(), jsgraph(), machine(), v8::internal::compiler::FieldAccess::machine_type, v8::internal::compiler::FieldAccess::offset, v8::internal::compiler::FieldAccess::tag(), v8::internal::compiler::FieldAccess::type, and zone().

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoStringAdd()

void v8::internal::compiler::SimplifiedLowering::DoStringAdd

(

Node *

node

)

Definition at line 888 of file simplified-lowering.cc.

                                               {
  Callable callable = CodeFactory::StringAdd(
      zone()->isolate(), STRING_ADD_CHECK_NONE, NOT_TENURED);
  CallDescriptor::Flags flags = CallDescriptor::kNoFlags;
  CallDescriptor* desc =
      Linkage::GetStubCallDescriptor(callable.descriptor(), 0, flags, zone());
  node->set_op(common()->Call(desc));
  node->InsertInput(zone(), 0, jsgraph()->HeapConstant(callable.code()));
  node->AppendInput(zone(), jsgraph()->UndefinedConstant());
  node->AppendInput(zone(), graph()->start());
  node->AppendInput(zone(), graph()->start());
}

References common(), v8::internal::anonymous_namespace{flags.cc}::flags, v8::internal::compiler::Linkage::GetStubCallDescriptor(), graph(), jsgraph(), v8::internal::NOT_TENURED, v8::internal::STRING_ADD_CHECK_NONE, and zone().

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoStringEqual()

void v8::internal::compiler::SimplifiedLowering::DoStringEqual

(

Node *

node

)

Definition at line 921 of file simplified-lowering.cc.

                                                 {
  node->set_op(machine()->WordEqual());
  node->ReplaceInput(0, StringComparison(node, false));
  node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL));
}

References v8::internal::EQUAL, jsgraph(), machine(), and StringComparison().

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoStringLessThan()

void v8::internal::compiler::SimplifiedLowering::DoStringLessThan

(

Node *

node

)

Definition at line 928 of file simplified-lowering.cc.

                                                    {
  node->set_op(machine()->IntLessThan());
  node->ReplaceInput(0, StringComparison(node, true));
  node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL));
}

References v8::internal::EQUAL, jsgraph(), machine(), and StringComparison().

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

DoStringLessThanOrEqual()

void v8::internal::compiler::SimplifiedLowering::DoStringLessThanOrEqual

(

Node *

node

)

Definition at line 935 of file simplified-lowering.cc.

                                                           {
  node->set_op(machine()->IntLessThanOrEqual());
  node->ReplaceInput(0, StringComparison(node, true));
  node->ReplaceInput(1, jsgraph()->SmiConstant(EQUAL));
}

References v8::internal::EQUAL, jsgraph(), machine(), and StringComparison().

Referenced by v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

graph()

Graph* v8::internal::compiler::SimplifiedLowering::graph ( )

inlineprivate

Definition at line 48 of file simplified-lowering.h.

{ return jsgraph()->graph(); }

References v8::internal::compiler::JSGraph::graph(), and jsgraph().

Referenced by ComputeIndex(), DoStringAdd(), IsTagged(), LowerAllNodes(), SmiTag(), StringComparison(), and Untag().

Here is the call graph for this function:

Here is the caller graph for this function:

IsTagged()

Node * v8::internal::compiler::SimplifiedLowering::IsTagged ( Node *  node )

private

Definition at line 787 of file simplified-lowering.cc.

                                             {
  // TODO(titzer): factor this out to a TaggingScheme abstraction.
  STATIC_ASSERT(kSmiTagMask == 1);  // Only works if tag is the low bit.
  return graph()->NewNode(machine()->WordAnd(), node,
                          jsgraph()->Int32Constant(kSmiTagMask));
}

References graph(), jsgraph(), v8::internal::kSmiTagMask, machine(), v8::internal::compiler::Graph::NewNode(), and v8::internal::compiler::STATIC_ASSERT().

Here is the call graph for this function:

jsgraph()

JSGraph* v8::internal::compiler::SimplifiedLowering::jsgraph ( )

inlineprivate

Definition at line 47 of file simplified-lowering.h.

{ return jsgraph_; }

References jsgraph_.

Referenced by common(), ComputeIndex(), DoLoadField(), DoStoreField(), DoStringAdd(), DoStringEqual(), DoStringLessThan(), DoStringLessThanOrEqual(), graph(), IsTagged(), LowerAllNodes(), machine(), OffsetMinusTagConstant(), SmiTag(), StringComparison(), and Untag().

Here is the caller graph for this function:

LowerAllNodes()

void v8::internal::compiler::SimplifiedLowering::LowerAllNodes

(

)

Definition at line 795 of file simplified-lowering.cc.

                                       {
  SimplifiedOperatorBuilder simplified(graph()->zone());
  RepresentationChanger changer(jsgraph(), &simplified,
                                graph()->zone()->isolate());
  RepresentationSelector selector(jsgraph(), zone(), &changer);
  selector.Run(this);
}

References graph(), jsgraph(), v8::internal::compiler::RepresentationSelector::Run(), and zone().

Referenced by v8::internal::compiler::Pipeline::GenerateCode().

Here is the call graph for this function:

Here is the caller graph for this function:

machine()

MachineOperatorBuilder* v8::internal::compiler::SimplifiedLowering::machine ( )

inlineprivate

Definition at line 50 of file simplified-lowering.h.

{ return jsgraph()->machine(); }

References jsgraph(), and v8::internal::compiler::JSGraph::machine().

Referenced by ComputeIndex(), DoLoadElement(), DoLoadField(), DoStoreElement(), DoStoreField(), DoStringEqual(), DoStringLessThan(), DoStringLessThanOrEqual(), IsTagged(), SmiTag(), Untag(), and v8::internal::compiler::RepresentationSelector::VisitNode().

Here is the call graph for this function:

Here is the caller graph for this function:

OffsetMinusTagConstant()

Node * v8::internal::compiler::SimplifiedLowering::OffsetMinusTagConstant ( int32_t  offset )

private

Definition at line 818 of file simplified-lowering.cc.

                                                               {
  return jsgraph()->Int32Constant(offset - kHeapObjectTag);
}

References v8::internal::compiler::JSGraph::Int32Constant(), jsgraph(), and v8::internal::kHeapObjectTag.

Here is the call graph for this function:

SmiTag()

Node * v8::internal::compiler::SimplifiedLowering::SmiTag ( Node *  node )

private

Definition at line 811 of file simplified-lowering.cc.

                                           {
  // TODO(titzer): factor this out to a TaggingScheme abstraction.
  Node* shift_amount = jsgraph()->Int32Constant(kSmiTagSize + kSmiShiftSize);
  return graph()->NewNode(machine()->WordShl(), node, shift_amount);
}

References graph(), v8::internal::compiler::JSGraph::Int32Constant(), jsgraph(), v8::internal::kSmiShiftSize, v8::internal::kSmiTagSize, machine(), and v8::internal::compiler::Graph::NewNode().

Here is the call graph for this function:

StringComparison()

Node * v8::internal::compiler::SimplifiedLowering::StringComparison ( Node *  node, bool  requires_ordering  )

private

Definition at line 902 of file simplified-lowering.cc.

                                                                             {
  CEntryStub stub(zone()->isolate(), 1);
  Runtime::FunctionId f =
      requires_ordering ? Runtime::kStringCompare : Runtime::kStringEquals;
  ExternalReference ref(f, zone()->isolate());
  Operator::Properties props = node->op()->properties();
  // TODO(mstarzinger): We should call StringCompareStub here instead, once an
  // interface descriptor is available for it.
  CallDescriptor* desc = Linkage::GetRuntimeCallDescriptor(f, 2, props, zone());
  return graph()->NewNode(common()->Call(desc),
                          jsgraph()->HeapConstant(stub.GetCode()),
                          NodeProperties::GetValueInput(node, 0),
                          NodeProperties::GetValueInput(node, 1),
                          jsgraph()->ExternalConstant(ref),
                          jsgraph()->Int32Constant(2),
                          jsgraph()->UndefinedConstant());
}

References common(), v8::internal::compiler::Linkage::GetRuntimeCallDescriptor(), v8::internal::compiler::NodeProperties::GetValueInput(), graph(), jsgraph(), v8::internal::compiler::Graph::NewNode(), and zone().

Referenced by DoStringEqual(), DoStringLessThan(), and DoStringLessThanOrEqual().

Here is the call graph for this function:

Here is the caller graph for this function:

Untag()

Node * v8::internal::compiler::SimplifiedLowering::Untag ( Node *  node )

private

Definition at line 804 of file simplified-lowering.cc.

                                          {
  // TODO(titzer): factor this out to a TaggingScheme abstraction.
  Node* shift_amount = jsgraph()->Int32Constant(kSmiTagSize + kSmiShiftSize);
  return graph()->NewNode(machine()->WordSar(), node, shift_amount);
}

References graph(), v8::internal::compiler::JSGraph::Int32Constant(), jsgraph(), v8::internal::kSmiShiftSize, v8::internal::kSmiTagSize, machine(), and v8::internal::compiler::Graph::NewNode().

Here is the call graph for this function:

zone()

Zone* v8::internal::compiler::SimplifiedLowering::zone ( )

inlineprivate

Definition at line 46 of file simplified-lowering.h.

{ return jsgraph_->zone(); }

References jsgraph_, and v8::internal::compiler::JSGraph::zone().

Referenced by DoLoadField(), DoStoreField(), DoStringAdd(), LowerAllNodes(), and StringComparison().

Here is the call graph for this function:

Here is the caller graph for this function:

Friends And Related Function Documentation

RepresentationSelector

friend class RepresentationSelector

friend

Definition at line 44 of file simplified-lowering.h.

Member Data Documentation

jsgraph_

JSGraph* v8::internal::compiler::SimplifiedLowering::jsgraph_

private

Definition at line 35 of file simplified-lowering.h.

Referenced by jsgraph(), and zone().

---

The documentation for this class was generated from the following files:

• /mnt/V8SourceCode/src/compiler/simplified-lowering.h
• /mnt/V8SourceCode/src/compiler/simplified-lowering.cc