Home
last modified time | relevance | path

Searched refs:nodes_len (Results 1 – 5 of 5) sorted by relevance

/netbsd-src/usr.sbin/wlanctl/
H A Dwlanctl.c195 size_t namelen, nodes_len, totallen; in dump_nodes() local
232 if (sysctl(name, totallen, NULL, &nodes_len, NULL, 0) != 0) { in dump_nodes()
237 ns = malloc(nodes_len); in dump_nodes()
244 vname[IEEE80211_SYSCTL_NODENAME_ELTCOUNT] = nodes_len / sizeof(ns[0]); in dump_nodes()
247 if (sysctl(name, totallen, ns, &nodes_len, NULL, 0) != 0) { in dump_nodes()
252 for (i = 0; i < nodes_len / sizeof(ns[0]); i++) { in dump_nodes()
/netbsd-src/external/gpl2/xcvs/dist/lib/
H A Dregex_internal.c1328 if (BE (dfa->nodes_len >= dfa->nodes_alloc, 0)) in re_dfa_add_node()
1352 dfa->nodes[dfa->nodes_len] = token; in re_dfa_add_node()
1353 dfa->nodes[dfa->nodes_len].constraint = 0; in re_dfa_add_node()
1355 dfa->nodes[dfa->nodes_len].accept_mb = in re_dfa_add_node()
1358 dfa->nexts[dfa->nodes_len] = REG_MISSING; in re_dfa_add_node()
1359 re_node_set_init_empty (dfa->edests + dfa->nodes_len); in re_dfa_add_node()
1360 re_node_set_init_empty (dfa->eclosures + dfa->nodes_len); in re_dfa_add_node()
1361 return dfa->nodes_len++; in re_dfa_add_node()
H A Dregcomp.c324 while (++node < dfa->nodes_len in re_compile_fastmap_iter()
576 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()
579 for (i = 0; i < dfa->nodes_len; ++i) in free_dfa_content()
1024 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()
1076 for (node = 0; node < dfa->nodes_len; ++node) in optimize_utf8()
1146 dfa->inveclosures = re_xmalloc (re_node_set, dfa->nodes_len); in analyze()
1533 for (idx = dfa->nodes_len - 1; dfa->nodes[idx].duplicated && idx > 0; --idx) in search_duplicated_node()
1568 for (idx = 0; idx < dfa->nodes_len; ++idx) in calc_inveclosure()
1571 for (src = 0; src < dfa->nodes_len; ++src) in calc_inveclosure()
1593 assert (dfa->nodes_len > 0); in calc_eclosure()
[all …]
H A Dregex_internal.h715 Idx nodes_len; member
H A Dregexec.c672 err = re_string_allocate (&mctx.input, string, length, dfa->nodes_len + 1, in re_search_internal()