Home
last modified time | relevance | path

Searched refs:kOnly32BitsObserved (Results 1 - 2 of 2) sorted by relevance

/third_party/node/deps/v8/src/compiler/
H A Ddecompression-optimizer.cc56 MaybeMarkAndQueueForRevisit(graph()->end(), State::kOnly32BitsObserved); in MarkNodes() member in v8::internal::compiler::State
78 State::kOnly32BitsObserved); // value in MarkNodeInputs()
90 State::kOnly32BitsObserved); // value_0 in MarkNodeInputs()
92 State::kOnly32BitsObserved); // value_1 in MarkNodeInputs()
113 ? State::kOnly32BitsObserved in MarkNodeInputs()
126 State::kOnly32BitsObserved); in MarkNodeInputs()
147 // We always mark the non-value input nodes as kOnly32BitsObserved so that in MarkNodeInputs()
151 MaybeMarkAndQueueForRevisit(node->InputAt(i), State::kOnly32BitsObserved); in MarkNodeInputs()
161 (previous_state == State::kOnly32BitsObserved && in MaybeMarkAndQueueForRevisit()
166 if (state == State::kOnly32BitsObserved in MaybeMarkAndQueueForRevisit()
[all...]
H A Ddecompression-optimizer.h52 // * kOnly32BitsObserved === This node either has been visited, or is on
58 kOnly32BitsObserved, member in v8::internal::compiler::final::State
78 // kOnly32BitsObserved and visited, and finally marked as kEverythingObserved
92 // kOnly32BitsObserved. If the node's state changes, we queue it for revisit.
100 return states_.Get(node) == State::kOnly32BitsObserved; in IsOnly32BitsObserved()

Completed in 1 milliseconds