7 * save a new match in mp
10 _renewmatch(Resub *mp, int ms, Resublist *sp)
16 if(mp[0].s.sp==0 || sp->m[0].s.sp<mp[0].s.sp ||
17 (sp->m[0].s.sp==mp[0].s.sp && sp->m[0].e.ep>mp[0].e.ep)){
18 for(i=0; i<ms && i<NSUBEXP; i++)
21 mp[i].s.sp = mp[i].e.ep = 0;
26 * Note optimization in _renewthread:
27 * *lp must be pending when _renewthread called; if *l has been looked
28 * at already, the optimization is a bug.
31 _renewthread(Relist *lp, /* _relist to add to */
32 Reinst *ip, /* instruction to add */
34 Resublist *sep) /* pointers to subexpressions */
38 for(p=lp; p->inst; p++){
40 if(sep->m[0].s.sp < p->se.m[0].s.sp){
44 p->se.m[0] = sep->m[0];
53 p->se.m[0] = sep->m[0];
59 * same as renewthread, but called with
60 * initial empty start pointer.
63 _renewemptythread(Relist *lp, /* _relist to add to */
64 Reinst *ip, /* instruction to add */
66 char *sp) /* pointers to subexpressions */
70 for(p=lp; p->inst; p++){
72 if(sp < p->se.m[0].s.sp) {
74 memset(&p->se, 0, sizeof(p->se));
82 memset(&p->se, 0, sizeof(p->se));
89 _rrenewemptythread(Relist *lp, /* _relist to add to */
90 Reinst *ip, /* instruction to add */
92 Rune *rsp) /* pointers to subexpressions */
96 for(p=lp; p->inst; p++){
98 if(rsp < p->se.m[0].s.rsp) {
100 memset(&p->se, 0, sizeof(p->se));
101 p->se.m[0].s.rsp = rsp;
108 memset(&p->se, 0, sizeof(p->se));
109 p->se.m[0].s.rsp = rsp;