js-native-context-specialization.h 10.4 KB
Newer Older
1 2 3 4
// Copyright 2015 the V8 project authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

5 6
#ifndef V8_COMPILER_JS_NATIVE_CONTEXT_SPECIALIZATION_H_
#define V8_COMPILER_JS_NATIVE_CONTEXT_SPECIALIZATION_H_
7 8 9

#include "src/base/flags.h"
#include "src/compiler/graph-reducer.h"
10
#include "src/deoptimize-reason.h"
11
#include "src/objects/map.h"
12 13 14 15 16 17

namespace v8 {
namespace internal {

// Forward declarations.
class CompilationDependencies;
18
class Factory;
19
class FeedbackNexus;
20 21 22 23

namespace compiler {

// Forward declarations.
24
enum class AccessMode;
25
class CommonOperatorBuilder;
26
class ElementAccessInfo;
27 28
class JSGraph;
class JSOperatorBuilder;
29
class MachineOperatorBuilder;
30
class PropertyAccessInfo;
31
class SimplifiedOperatorBuilder;
32
class TypeCache;
33

34
// Specializes a given JSGraph to a given native context, potentially constant
35
// folding some {LoadGlobal} nodes or strength reducing some {StoreGlobal}
36 37 38
// nodes.  And also specializes {LoadNamed} and {StoreNamed} nodes according
// to type feedback (if available).
class JSNativeContextSpecialization final : public AdvancedReducer {
39 40 41 42
 public:
  // Flags that control the mode of operation.
  enum Flag {
    kNoFlags = 0u,
43
    kAccessorInliningEnabled = 1u << 0,
44
    kBailoutOnUninitialized = 1u << 1
45 46 47
  };
  typedef base::Flags<Flag> Flags;

48
  JSNativeContextSpecialization(Editor* editor, JSGraph* jsgraph, Flags flags,
49
                                Handle<Context> native_context,
50 51
                                CompilationDependencies* dependencies,
                                Zone* zone);
52

53 54 55 56
  const char* reducer_name() const override {
    return "JSNativeContextSpecialization";
  }

57 58 59
  Reduction Reduce(Node* node) final;

 private:
60
  Reduction ReduceJSAdd(Node* node);
61
  Reduction ReduceJSGetSuperConstructor(Node* node);
62
  Reduction ReduceJSInstanceOf(Node* node);
63
  Reduction ReduceJSHasInPrototypeChain(Node* node);
64
  Reduction ReduceJSOrdinaryHasInstance(Node* node);
65
  Reduction ReduceJSLoadContext(Node* node);
66 67
  Reduction ReduceJSLoadGlobal(Node* node);
  Reduction ReduceJSStoreGlobal(Node* node);
68
  Reduction ReduceJSLoadNamed(Node* node);
69
  Reduction ReduceJSStoreNamed(Node* node);
70 71
  Reduction ReduceJSLoadProperty(Node* node);
  Reduction ReduceJSStoreProperty(Node* node);
72
  Reduction ReduceJSStoreNamedOwn(Node* node);
73
  Reduction ReduceJSStoreDataPropertyInLiteral(Node* node);
74

75
  Reduction ReduceElementAccess(Node* node, Node* index, Node* value,
76
                                MapHandles const& receiver_maps,
77
                                AccessMode access_mode,
78
                                KeyedAccessLoadMode load_mode,
79
                                KeyedAccessStoreMode store_mode);
80
  template <typename KeyedICNexus>
81
  Reduction ReduceKeyedAccess(Node* node, Node* index, Node* value,
82
                              KeyedICNexus const& nexus, AccessMode access_mode,
83
                              KeyedAccessLoadMode load_mode,
84
                              KeyedAccessStoreMode store_mode);
85 86 87
  Reduction ReduceNamedAccessFromNexus(Node* node, Node* value,
                                       FeedbackNexus const& nexus,
                                       Handle<Name> name,
88
                                       AccessMode access_mode);
89
  Reduction ReduceNamedAccess(Node* node, Node* value,
90
                              MapHandles const& receiver_maps,
91
                              Handle<Name> name, AccessMode access_mode,
92
                              Node* index = nullptr);
93
  Reduction ReduceGlobalAccess(Node* node, Node* receiver, Node* value,
94 95
                               Handle<Name> name, AccessMode access_mode,
                               Node* index = nullptr);
96

97
  Reduction ReduceSoftDeoptimize(Node* node, DeoptimizeReason reason);
98

99 100 101
  // A triple of nodes that represents a continuation.
  class ValueEffectControl final {
   public:
102 103
    ValueEffectControl()
        : value_(nullptr), effect_(nullptr), control_(nullptr) {}
104 105 106 107 108 109 110 111
    ValueEffectControl(Node* value, Node* effect, Node* control)
        : value_(value), effect_(effect), control_(control) {}

    Node* value() const { return value_; }
    Node* effect() const { return effect_; }
    Node* control() const { return control_; }

   private:
112 113 114
    Node* value_;
    Node* effect_;
    Node* control_;
115 116 117
  };

  // Construct the appropriate subgraph for property access.
118 119 120 121 122 123 124
  ValueEffectControl BuildPropertyAccess(Node* receiver, Node* value,
                                         Node* context, Node* frame_state,
                                         Node* effect, Node* control,
                                         Handle<Name> name,
                                         ZoneVector<Node*>* if_exceptions,
                                         PropertyAccessInfo const& access_info,
                                         AccessMode access_mode);
125 126 127 128
  ValueEffectControl BuildPropertyLoad(Node* receiver, Node* context,
                                       Node* frame_state, Node* effect,
                                       Node* control, Handle<Name> name,
                                       ZoneVector<Node*>* if_exceptions,
129 130 131 132 133 134 135 136 137
                                       PropertyAccessInfo const& access_info);

  ValueEffectControl BuildPropertyStore(Node* receiver, Node* value,
                                        Node* context, Node* frame_state,
                                        Node* effect, Node* control,
                                        Handle<Name> name,
                                        ZoneVector<Node*>* if_exceptions,
                                        PropertyAccessInfo const& access_info,
                                        AccessMode access_mode);
138 139 140 141 142 143 144

  // Helpers for accessor inlining.
  Node* InlinePropertyGetterCall(Node* receiver, Node* context,
                                 Node* frame_state, Node** effect,
                                 Node** control,
                                 ZoneVector<Node*>* if_exceptions,
                                 PropertyAccessInfo const& access_info);
145 146 147 148 149
  void InlinePropertySetterCall(Node* receiver, Node* value, Node* context,
                                Node* frame_state, Node** effect,
                                Node** control,
                                ZoneVector<Node*>* if_exceptions,
                                PropertyAccessInfo const& access_info);
150 151 152
  Node* InlineApiCall(Node* receiver, Node* holder, Node* frame_state,
                      Node* value, Node** effect, Node** control,
                      Handle<SharedFunctionInfo> shared_info,
153
                      Handle<FunctionTemplateInfo> function_template_info);
154 155

  // Construct the appropriate subgraph for element access.
156 157 158 159
  ValueEffectControl BuildElementAccess(
      Node* receiver, Node* index, Node* value, Node* effect, Node* control,
      ElementAccessInfo const& access_info, AccessMode access_mode,
      KeyedAccessLoadMode load_mode, KeyedAccessStoreMode store_mode);
160

161 162 163 164 165
  // Construct appropriate subgraph to load from a String.
  Node* BuildIndexedStringLoad(Node* receiver, Node* index, Node* length,
                               Node** effect, Node** control,
                               KeyedAccessLoadMode load_mode);

166 167 168 169
  // Construct appropriate subgraph to extend properties backing store.
  Node* BuildExtendPropertiesBackingStore(Handle<Map> map, Node* properties,
                                          Node* effect, Node* control);

170 171 172 173 174
  // Construct appropriate subgraph to check that the {value} matches
  // the previously recorded {name} feedback.
  Node* BuildCheckEqualsName(Handle<Name> name, Node* value, Node* effect,
                             Node* control);

175 176 177
  // Checks if we can turn the hole into undefined when loading an element
  // from an object with one of the {receiver_maps}; sets up appropriate
  // code dependencies and might use the array protector cell.
178
  bool CanTreatHoleAsUndefined(MapHandles const& receiver_maps);
179

180 181 182 183
  // Extract receiver maps from {nexus} and filter based on {receiver} if
  // possible.
  bool ExtractReceiverMaps(Node* receiver, Node* effect,
                           FeedbackNexus const& nexus,
184
                           MapHandles* receiver_maps);
185

186 187 188 189 190
  // Try to infer maps for the given {receiver} at the current {effect}.
  // If maps are returned then you can be sure that the {receiver} definitely
  // has one of the returned maps at this point in the program (identified
  // by {effect}).
  bool InferReceiverMaps(Node* receiver, Node* effect,
191
                         MapHandles* receiver_maps);
192 193 194 195
  // Try to infer a root map for the {receiver} independent of the current
  // program location.
  MaybeHandle<Map> InferReceiverRootMap(Node* receiver);

196 197 198 199 200 201 202 203 204 205 206
  // Checks if we know at compile time that the {receiver} either definitely
  // has the {prototype} in it's prototype chain, or the {receiver} definitely
  // doesn't have the {prototype} in it's prototype chain.
  enum InferHasInPrototypeChainResult {
    kIsInPrototypeChain,
    kIsNotInPrototypeChain,
    kMayBeInPrototypeChain
  };
  InferHasInPrototypeChainResult InferHasInPrototypeChain(
      Node* receiver, Node* effect, Handle<HeapObject> prototype);

207 208 209 210 211
  // Script context lookup logic.
  struct ScriptContextTableLookupResult;
  bool LookupInScriptContextTable(Handle<Name> name,
                                  ScriptContextTableLookupResult* result);

212 213 214
  Graph* graph() const;
  JSGraph* jsgraph() const { return jsgraph_; }
  Isolate* isolate() const;
215
  Factory* factory() const;
216
  CommonOperatorBuilder* common() const;
217
  JSOperatorBuilder* javascript() const;
218
  SimplifiedOperatorBuilder* simplified() const;
219
  Flags flags() const { return flags_; }
220 221
  Handle<JSGlobalObject> global_object() const { return global_object_; }
  Handle<JSGlobalProxy> global_proxy() const { return global_proxy_; }
222
  Handle<Context> native_context() const { return native_context_; }
223
  CompilationDependencies* dependencies() const { return dependencies_; }
224
  Zone* zone() const { return zone_; }
225 226 227

  JSGraph* const jsgraph_;
  Flags const flags_;
228 229
  Handle<JSGlobalObject> global_object_;
  Handle<JSGlobalProxy> global_proxy_;
230
  Handle<Context> native_context_;
231
  CompilationDependencies* const dependencies_;
232
  Zone* const zone_;
233
  TypeCache const& type_cache_;
234

235
  DISALLOW_COPY_AND_ASSIGN(JSNativeContextSpecialization);
236 237
};

238
DEFINE_OPERATORS_FOR_FLAGS(JSNativeContextSpecialization::Flags)
239

240 241 242 243
}  // namespace compiler
}  // namespace internal
}  // namespace v8

244
#endif  // V8_COMPILER_JS_NATIVE_CONTEXT_SPECIALIZATION_H_