Searched refs:kInstByteRange (Results 1 – 8 of 8) sorted by relevance
32 kInstByteRange, // next (possible case-folded) byte must be in [lo_, hi_] enumerator87 int lo() { DCHECK_EQ(opcode(), kInstByteRange); return lo_; } in lo()88 int hi() { DCHECK_EQ(opcode(), kInstByteRange); return hi_; } in hi()89 int foldcase() { DCHECK_EQ(opcode(), kInstByteRange); return hint_foldcase_&1; } in foldcase()90 int hint() { DCHECK_EQ(opcode(), kInstByteRange); return hint_foldcase_>>1; } in hint()96 return p->inst(out())->opcode() == kInstByteRange || in greedy()98 p->inst(p->inst(out())->out())->opcode() == kInstByteRange); in greedy()103 DCHECK_EQ(opcode(), kInstByteRange); in Matches()
40 set_out_opcode(out, kInstByteRange); in InitByteRange()85 case kInstByteRange: in Dump()205 case kInstByteRange: in IsMatch()270 if (j->opcode() == kInstByteRange && j->out() == id && in Optimize()277 k->opcode() == kInstByteRange && k->out() == id && in Optimize()457 if (ip->opcode() == kInstByteRange) { in ComputeByteMap()477 inst(id+1)->opcode() == kInstByteRange && in ComputeByteMap()688 case kInstByteRange: in MarkSuccessors()740 case kInstByteRange: in MarkDominator()813 case kInstByteRange: in EmitList()[all …]
283 case kInstByteRange: in AddToThreadq()357 case kInstByteRange: in Step()677 case kInstByteRange: in Fanout()
396 int maxnodes = 2 + inst_count(kInstByteRange); in IsOnePass()460 case kInstByteRange: { in IsOnePass()
193 case kInstByteRange: { in TrySearch()
539 inst_[root].opcode() == kInstByteRange); in AddSuffixRecursive()602 if (inst_[root].opcode() == kInstByteRange) { in FindByteRange()
860 case kInstByteRange: // just save these on the queue in AddToQueue()956 case kInstByteRange: // can follow if c is in range in RunWorkqOnByte()
199 case kInstByteRange: in Try()