Searched refs:nexts (Results 1 - 7 of 7) sorted by relevance

/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/clients/tools/
H A Dldapurl.c174 int nexts = 0; local
289 sizeof( char * ) * ( nexts + 2 ) );
290 lud.lud_exts[ nexts++ ] = optarg;
291 lud.lud_exts[ nexts ] = NULL;
/netbsd-6-1-5-RELEASE/external/gpl2/xcvs/dist/lib/
H A Dregexec.c1326 Idx dest_node = dfa->nexts[node];
1683 dfa->nexts[prev_node]))
1693 dfa->nexts[prev_node], to_idx,
2157 dst_node = (subexp_len ? dfa->nexts[node]
2225 dfa->nexts[node_idx]))
2466 dfa->eclosures + dfa->nexts[cur_node]);
2530 assert (dfa->nexts[cur_node_idx] != REG_MISSING);
2532 new_nodes = dfa->eclosures + dfa->nexts[cur_node_idx];
2595 assert (dfa->nexts[node_idx] != REG_MISSING);
2608 : dfa->eclosures + dfa->nexts[node_id
[all...]
H A Dregcomp.c578 re_free (dfa->nexts);
1106 dfa->nexts = re_malloc (Idx, dfa->nodes_alloc);
1110 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL
1401 dfa->nexts[idx] = node->next->node_idx;
1403 re_node_set_init_1 (dfa->edests + idx, dfa->nexts[idx]);
1408 dfa->nexts[idx] = node->next->node_idx;
1436 org_dest = dfa->nexts[org_node];
1441 dfa->nexts[clone_node] = dfa->nexts[org_node];
1451 dfa->nexts[clone_nod
[all...]
H A Dregex_internal.c1339 new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc);
1346 dfa->nexts = new_nexts;
1358 dfa->nexts[dfa->nodes_len] = REG_MISSING;
H A Dregex_internal.h716 Idx *nexts; member in struct:re_dfa_t
/netbsd-6-1-5-RELEASE/sys/dist/pf/net/
H A Dif_pfsync.c429 struct pf_state *nexts; local
444 st; st = nexts) {
445 nexts = RB_NEXT(pf_state_tree_id, &tree_id, st);
H A Dpf_ioctl.c1833 struct pf_state *ps, *nexts; local
1837 for (ps = RB_MIN(pf_state_tree_id, &tree_id); ps; ps = nexts) {
1838 nexts = RB_NEXT(pf_state_tree_id, &tree_id, ps);
1858 struct pf_state *ps, *nexts; local
1865 ps = nexts) {
1866 nexts = RB_NEXT(pf_state_tree_id, &tree_id, ps);

Completed in 132 milliseconds