HomeSort by: relevance | last modified time | path
    Searched defs:v_next (Results 1 - 5 of 5) sorted by relevancy

  /src/external/bsd/ipf/dist/lib/
var.c 16 struct variable *v_next; member in struct:variable
32 for (v = vtop; v != NULL; v = v->v_next)
177 v->v_next = vtop;
  /src/usr.sbin/npf/npfctl/
npf_var.c 57 void * v_next; member in struct:npfvar
74 for (npfvar_t *it = var_list; it != NULL; it = it->v_next)
93 vp->v_next = var_list;
  /src/external/gpl3/gcc/dist/gcc/
spellcheck.cc 66 and a new row, v_next, which avoids an (len_t + 1) * (len_s + 1)
73 edit_distance_t *v_next = new edit_distance_t[len_s + 1]; local
94 v_next[0] = (i + 1) * BASE_COST;
108 edit_distance_t deletion = v_next[j] + BASE_COST;
118 v_next[j + 1] = cheapest;
125 v_one_ago[j] = v_next[j];
131 printf ("final v_next = ");
133 printf ("%i ", v_next[j]);
137 edit_distance_t result = v_next[len_s];
140 delete[] v_next;
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
spellcheck.cc 66 and a new row, v_next, which avoids an (len_t + 1) * (len_s + 1)
73 edit_distance_t *v_next = new edit_distance_t[len_s + 1]; local
94 v_next[0] = (i + 1) * BASE_COST;
108 edit_distance_t deletion = v_next[j] + BASE_COST;
118 v_next[j + 1] = cheapest;
125 v_one_ago[j] = v_next[j];
131 printf ("final v_next = ");
133 printf ("%i ", v_next[j]);
137 edit_distance_t result = v_next[len_s];
140 delete[] v_next;
    [all...]
  /src/external/bsd/bc/dist/
bcdefs.h 129 struct bc_var *v_next; member in struct:bc_var

Completed in 214 milliseconds