8 * save a new match in mp
11 _renewmatch(Resub *mp, int ms, Resublist *sp)
17 if(mp[0].sp==0 || sp->m[0].sp<mp[0].sp ||
18 (sp->m[0].sp==mp[0].sp && sp->m[0].ep>mp[0].ep)){
19 for(i=0; i<ms && i<NSUBEXP; i++)
22 mp[i].sp = mp[i].ep = 0;
27 * Note optimization in _renewthread:
28 * *lp must be pending when _renewthread called; if *l has been looked
29 * at already, the optimization is a bug.
32 _renewthread(Relist *lp, /* _relist to add to */
33 Reinst *ip, /* instruction to add */
35 Resublist *sep) /* pointers to subexpressions */
39 for(p=lp; p->inst; p++){
41 if(sep->m[0].sp < p->se.m[0].sp){
45 p->se.m[0] = sep->m[0];
54 p->se.m[0] = sep->m[0];
60 * same as renewthread, but called with
61 * initial empty start pointer.
64 _renewemptythread(Relist *lp, /* _relist to add to */
65 Reinst *ip, /* instruction to add */
67 char *sp) /* pointers to subexpressions */
71 for(p=lp; p->inst; p++){
73 if(sp < p->se.m[0].sp) {
75 memset(&p->se, 0, sizeof(p->se));
83 memset(&p->se, 0, sizeof(p->se));
90 _rrenewemptythread(Relist *lp, /* _relist to add to */
91 Reinst *ip, /* instruction to add */
93 Rune *rsp) /* pointers to subexpressions */
97 for(p=lp; p->inst; p++){
99 if(rsp < p->se.m[0].rsp) {
101 memset(&p->se, 0, sizeof(p->se));
102 p->se.m[0].rsp = rsp;
109 memset(&p->se, 0, sizeof(p->se));
110 p->se.m[0].rsp = rsp;