Lines Matching full:uint32
32 Next []uint32
40 func onePassPrefix(p *syntax.Prog) (prefix string, complete bool, pc uint32) {
43 return "", i.Op == syntax.InstMatch, uint32(p.Start)
53 return "", i.Op == syntax.InstMatch, uint32(p.Start)
69 func onePassNext(i *onePassInst, r rune) uint32 {
91 sparse []uint32
92 dense []uint32
93 size, nextIndex uint32
100 func (q *queueOnePass) next() (n uint32) {
115 func (q *queueOnePass) contains(u uint32) bool {
116 if u >= uint32(len(q.sparse)) {
122 func (q *queueOnePass) insert(u uint32) {
128 func (q *queueOnePass) insertNew(u uint32) {
129 if u >= uint32(len(q.sparse)) {
139 sparse: make([]uint32, size),
140 dense: make([]uint32, size),
149 const mergeFailed = uint32(0xffffffff)
153 noNext = []uint32{mergeFailed}
156 func mergeRuneSets(leftRunes, rightRunes *[]rune, leftPC, rightPC uint32) ([]rune, []uint32) {
166 next := make([]uint32, 0)
176 extend := func(newLow *int, newArray *[]rune, pc uint32) bool {
262 if instAlt.Out == uint32(pc) {
264 } else if instAlt.Arg == uint32(pc) {
311 build func(uint32, *queueOnePass)
312 check func(uint32, map[uint32]bool) bool
315 build = func(pc uint32, q *queueOnePass) {
333 check = func(pc uint32, m map[uint32]bool) (ok bool) {
372 inst.Next = []uint32{}
380 inst.Next = []uint32{}
395 inst.Next = []uint32{inst.Out}
410 inst.Next = []uint32{}
434 inst.Next = []uint32{}
446 inst.Next = []uint32{inst.Out}
454 inst.Next = []uint32{}
463 instQueue.insert(uint32(p.Start))
464 m := make(map[uint32]bool, len(p.Inst))
469 if !check(uint32(pc), m) {
495 func walk(prog *syntax.Prog, funcs ...func(ip, next uint32)) {
496 var walk1 func(uint32)
498 walk1 = func(ip uint32) {
519 walk1(uint32(prog.Start))
523 func find(prog *syntax.Prog, f func(*syntax.Prog, int) bool) (matches []uint32) {
524 matches = []uint32{}
528 matches = append(matches, uint32(ip))
