| /ast/src/lib/libvdelta/ |
| H A D | vdsqueeze.c | 57 reg int copy; /* best match if any */
62 reg int n, c_addr, best, d; local
72 best = copy;
74 if((d = c_addr - copy) < best)
75 { best = d;
79 { if((d = copy - tab->recent[n]) < 0 || d >= best)
81 best = d;
84 if(best >= I_MORE && tab->quick[n = copy%K_QSIZE] == copy)
88 best = n - (d<<VD_BITS); /**/ASSERT(best < (
[all...] |
| H A D | vddelta.c | 59 reg int copy; /* best match if >= 0 */
64 reg int n, c_addr, best, d; local
73 best = copy;
75 if((d = c_addr - copy) < best)
76 { best = d;
80 { if((d = copy - tab->recent[n]) < 0 || d >= best)
82 best = d;
85 if(best >= I_MORE && tab->quick[n = copy%K_QSIZE] == copy)
89 best = n - (d<<VD_BITS); /**/ASSERT(best < (
[all...] |
| /ast/src/lib/libast/astsa/ |
| H A D | strmatch.c | 83 Group_t best; member in struct:__anon247
286 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && mp->current.next_s > mp->best.next_s || !(flags & STR_MAXIMAL) && mp->current.next_s < mp->best.next_s))
287 mp->best = mp->current;
334 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && olds > mp->best.next_s || !(flags & STR_MAXIMAL) && olds < mp->best.next_s))
336 mp->best = mp->current;
337 mp->best
[all...] |
| /ast/src/cmd/3d/ |
| H A D | strmatch.c | 159 Group_t best; member in struct:Match_s
390 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && mp->current.next_s > mp->best.next_s || !(flags & STR_MAXIMAL) && mp->current.next_s < mp->best.next_s))
392 mp->best = mp->current;
394 error(-3, "best#%d groups=%d next=\"%s\"", __LINE__, mp->best.groups, mp->best.next_s);
446 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && olds > mp->best
[all...] |
| /ast/src/lib/libvdelta/vd01/ |
| H A D | vddelta01.c | 63 Match_t* match; /* best match if any */
68 reg int n, c_addr, copy, best, d; local
77 best = copy = match - tab->base;
79 if((d = c_addr - copy) < best)
80 { best = d;
84 { if((d = copy - tab->recent[n]) < 0 || d >= best)
86 best = d;
89 if(best >= I_MORE && tab->quick[n = copy%K_QSIZE] == copy)
93 best = n - (d<<VD_BITS); /**/ASSERT(best < (
[all...] |
| /ast/src/lib/libast/regex/ |
| H A D | regnexec.c | 387 DEBUG_CODE(0x0040,{sfprintf(sfstdout, "AHA better old ");for (i = 0; i <= env->nsub; i++)showmatch(&env->best[i]);sfprintf(sfstdout, "\n new ");for (i = 0; i <= env->nsub; i++)showmatch(&env->match[i]);sfprintf(sfstdout, "\n");},{0;});
444 DEBUG_TEST(0x0004,(sfprintf(sfstdout,"AHA#%04d 0x%04x PUSH %d (%z,%z)(%z,%z)(%z,%z) (%z,%z)(%z,%z)(%z,%z)\n", __LINE__, debug_flag, rex->re.group.number, env->best[0].rm_so, env->best[0].rm_eo, env->best[1].rm_so, env->best[1].rm_eo, env->best[2].rm_so, env->best[2].rm_eo, env->match[0].rm_so, env->match[0].rm_eo, env->match[1].rm_so, env->match[1].rm_eo, env->match[2].rm_so, env->match[2].rm_eo)),(0));
452 DEBUG_TEST(0x0004,(sfprintf(sfstdout,"AHA#%04d 0x%04x POP %d %d (%z,%z)(%z,%z)(%z,%z) (%z,%z)(%z,%z)(%z,%z)\n", __LINE__, debug_flag, rex->re.group.number, r, env->best[0].rm_so, env->best[0].rm_eo, env->best[
[all...] |
| H A D | reglib.h | 536 Vector_t* bestpos; /* ditto for best match */
538 regmatch_t* best; /* ditto in best match yet */ member in struct:reglib_s
|
| /ast/src/cmd/dsslib/bgp/ |
| H A D | bgp-mrt.c | 86 Bgpnum_t best; member in struct:Mrtstate_s
532 if (state->best != state->message && (state->best = state->message) || rp->addr.v4 != v4 || rp->bits != bits)
557 if (state->best != state->message && (state->best = state->message) || memcmp(rp->prefixv6, v6, sizeof(rp->prefixv6)))
1635 if (state->best != state->message)
1637 state->best = state->message;
1653 if (state->best != state->message)
1655 state->best = state->message;
|
| /ast/src/lib/libpp/ |
| H A D | ppcontrol.c | 275 struct map* best; member in union:__anon362
524 var.best = 0;
532 var.best = map;
538 if (map = var.best)
|