Lines Matching defs:const
23 bool CanAllocate(const Node* node) {
106 Node* const current = queue.front();
124 Node* const control = NodeProperties::GetControlInput(loop_effect_phi);
145 void WriteBarrierAssertFailed(Node* node, Node* object, const char* name,
185 const char* function_debug_name, TickCounter* tick_counter)
199 Token const token = tokens_.front();
207 void MemoryOptimizer::VisitNode(Node* node, AllocationState const* state) {
245 bool MemoryOptimizer::AllocationTypeNeedsUpdateToOld(Node* const node,
246 const Edge edge) {
269 AllocationState const* state) {
271 const AllocateParameters& allocation = AllocateParametersOf(node->op());
279 for (Edge const edge : node->use_edges()) {
280 Node* const user = edge.from();
292 for (Edge const edge : node->use_edges()) {
293 Node* const user = edge.from();
311 AllocationState const* state) {
322 AllocationState const* state) {
330 AllocationState const* state) {
336 void MemoryOptimizer::VisitLoadField(Node* node, AllocationState const* state) {
357 AllocationState const* state) {
364 AllocationState const* state) {
369 void MemoryOptimizer::VisitStore(Node* node, AllocationState const* state) {
375 void MemoryOptimizer::VisitCall(Node* node, AllocationState const* state) {
385 AllocationState const* state) {
389 MemoryOptimizer::AllocationState const* MemoryOptimizer::MergeStates(
390 AllocationStates const& states) {
393 AllocationState const* state = states.front();
416 AllocationState const* state) {
418 int const input_count = node->InputCount() - 1;
420 Node* const control = node->InputAt(input_count);
438 NodeId const id = node->id();
458 void MemoryOptimizer::EnqueueUses(Node* node, AllocationState const* state) {
459 for (Edge const edge : node->use_edges()) {
467 AllocationState const* state) {
479 Graph* MemoryOptimizer::graph() const { return jsgraph()->graph(); }