Lines Matching defs:value
45 void set_accumulator(ValueNode* value) {
46 frame_[interpreter::Register::virtual_accumulator()] = value;
52 void set(interpreter::Register reg, ValueNode* value) {
58 frame_[reg] = value;
231 ValueNode* value) {
243 DCHECK(value->Is<Phi>());
298 compilation_unit, [&](ValueNode*& value, interpreter::Register reg) {
299 CheckIsLoopPhiIfNeeded(compilation_unit, merge_offset, reg, value);
301 value = MergeValue(compilation_unit, reg, value, unmerged.get(reg),
318 compilation_unit, [&](ValueNode* value, interpreter::Register reg) {
319 CheckIsLoopPhiIfNeeded(compilation_unit, merge_offset, reg, value);
321 MergeLoopValue(compilation_unit.zone(), reg, value,
372 ValueNode* value) {
373 DCHECK(value->is_untagged_value());
374 if (value->Is<CheckedSmiUntag>()) {
375 return value->input(0).node();
377 DCHECK(value->Is<Int32AddWithOverflow>() || value->Is<Int32Constant>());
378 // Check if the next Node in the block after value is its CheckedSmiTag
380 if (value->NextNode()) {
381 CheckedSmiTag* tagged = value->NextNode()->TryCast<CheckedSmiTag>();
382 if (tagged != nullptr && value == tagged->input().node()) {
390 value->eager_deopt_info()->state, {value});
391 value->AddNodeAfter(tagged);
397 ValueNode* value) {
398 if (value->is_untagged_value()) return TagValue(compilation_unit, value);
399 return value;
430 // Tagged versions could point to the same value, avoid Phi nodes in this
434 // Up to this point all predecessors had the same value for this interpreter
435 // frame slot. Now that we find a distinct value, insert a copy of the first
436 // value for each predecessor seen so far, in addition to the new value.
493 info, [&](ValueNode* value, interpreter::Register reg) {
494 frame_[reg] = value;