Lines Matching defs:value
332 V8_EXPORT_PRIVATE bool Get(unsigned value) const {
333 if (value < kFirstLimit) {
334 return (first_ & (1 << value)) != 0;
338 return remaining_->Contains(value);
342 // Destructively set a value in this set.
343 void Set(unsigned value, Zone* zone) {
344 if (value < kFirstLimit) {
345 first_ |= (1 << value);
349 if (remaining_->is_empty() || !remaining_->Contains(value))
350 remaining_->Add(value, zone);
417 int value = 0;
432 value += psr->value();
436 // counters. They can have a significant previous value if they
438 // we can set undo_action to IGNORE if we know there is no value to
447 value++;
473 DCHECK_EQ(value, 0);
485 DCHECK_EQ(value, 0);
515 assembler->SetRegister(reg, value);
516 } else if (value != 0) {
517 assembler->AdvanceRegister(reg, value);
644 result->data_.u_store_register.value = val;
728 macro_assembler->IfRegisterGE(guard->reg(), guard->value(),
733 macro_assembler->IfRegisterLT(guard->reg(), guard->value(),
1431 value_ |= (pos->value & char_mask) << char_shift;
1463 // The eats_at_least value is not used if reading backward. The
1519 uint32_t value = details->value();
1542 // load so the value is already masked down.
1562 assembler->CheckCharacterAfterAnd(value, mask, on_possible_success);
1564 assembler->CheckCharacter(value, on_possible_success);
1568 assembler->CheckNotCharacterAfterAnd(value, mask, trace->backtrack());
1570 assembler->CheckNotCharacter(value, trace->backtrack());
1580 // mask and value that can be used to test for a quick failure to match.
1619 pos->value = chars[0];
1638 pos->value = bits;
1650 pos->value = c;
1667 // so we just conservatively create a mask and value that will always
1673 pos->value = 0;
1704 // value. With each new range the mask becomes more sparse and
1718 pos->value = bits;
1735 positions_[i].value = 0;
1754 positions_[i].value = 0;
1775 if (pos->mask != other_pos->mask || pos->value != other_pos->value ||
1782 pos->value &= pos->mask;
1783 other_pos->value &= pos->mask;
1784 uint32_t differing_bits = (pos->value ^ other_pos->value);
1786 pos->value &= pos->mask;
2043 // could try to reset the minimum iteration count to its starting value at
2512 // down or for using a shifted value for anything so lets just forget that
2570 // value indicating that a greedy loop cannot be constructed.
3147 // and check it against the pushed value. This avoids pushing backtrack
3375 data_.u_store_register.value);
3570 // The eats_at_least value is not used if reading backward.
3573 // successor's eats_at_least_from_not_start value.
3592 // is <= eats_at_least_from_possibly_start, and use that value in
3744 // Check the loop last since it may need the value of this node