Home
last modified time | relevance | path

Searched refs:nexts (Results 1 – 12 of 12) sorted by relevance

/dflybsd-src/contrib/binutils-2.34/ld/
H A Dldelf.c1919 asection *nexts; in ldelf_place_orphan() local
2063 nexts = s; in ldelf_place_orphan()
2064 while ((nexts = bfd_get_next_section_by_name (nexts->owner, nexts)) in ldelf_place_orphan()
2066 if (nexts->output_section == NULL in ldelf_place_orphan()
2067 && (nexts->flags & SEC_EXCLUDE) == 0 in ldelf_place_orphan()
2068 && ((nexts->flags ^ flags) & (SEC_LOAD | SEC_ALLOC)) == 0 in ldelf_place_orphan()
2069 && (nexts->owner->flags & DYNAMIC) == 0 in ldelf_place_orphan()
2070 && !bfd_input_just_syms (nexts->owner) in ldelf_place_orphan()
2071 && _bfd_elf_match_sections_by_type (nexts->owner, nexts, in ldelf_place_orphan()
2074 | (nexts->flags ^ SEC_READONLY)) in ldelf_place_orphan()
/dflybsd-src/contrib/grep/lib/
H A Dregexec.c1304 Idx dest_node = dfa->nexts[node]; in proceed_next_node()
1645 dfa->nexts[prev_node])) in build_sifted_states()
1655 dfa->nexts[prev_node], to_idx, in build_sifted_states()
2119 dst_node = (subexp_len ? dfa->nexts[node] in sift_states_bkref()
2186 dfa->nexts[node_idx])) in sift_states_iter_mb()
2423 dfa->eclosures + dfa->nexts[cur_node]);
2485 DEBUG_ASSERT (dfa->nexts[cur_node_idx] != -1); in transit_state_mb()
2486 new_nodes = dfa->eclosures + dfa->nexts[cur_node_idx]; in transit_state_mb()
2549 DEBUG_ASSERT (dfa->nexts[node_idx] != -1); in transit_state_bkref()
2561 : dfa->eclosures + dfa->nexts[node_idx]); in transit_state_bkref()
[all …]
H A Dregcomp.c590 re_free (dfa->nexts); in free_dfa_content()
1169 dfa->nexts = re_malloc (Idx, dfa->nodes_alloc); in analyze()
1173 if (__glibc_unlikely (dfa->nexts == NULL || dfa->org_indices == NULL in analyze()
1468 dfa->nexts[idx] = node->next->node_idx; in link_nfa_nodes()
1470 err = re_node_set_init_1 (dfa->edests + idx, dfa->nexts[idx]); in link_nfa_nodes()
1475 dfa->nexts[idx] = node->next->node_idx; in link_nfa_nodes()
1502 org_dest = dfa->nexts[org_node]; in duplicate_node_closure()
1507 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
1517 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
H A Dregex_internal.c1424 new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc); in re_dfa_add_node()
1437 dfa->nexts = new_nexts; in re_dfa_add_node()
1450 dfa->nexts[dfa->nodes_len] = -1; in re_dfa_add_node()
H A Dregex_internal.h661 Idx *nexts; member
/dflybsd-src/contrib/cvs-1.12/lib/
H A Dregexec.c1323 Idx dest_node = dfa->nexts[node]; in proceed_next_node()
1678 dfa->nexts[prev_node])) in build_sifted_states()
1688 dfa->nexts[prev_node], to_idx, in build_sifted_states()
2152 dst_node = (subexp_len ? dfa->nexts[node] in sift_states_bkref()
2220 dfa->nexts[node_idx])) in sift_states_iter_mb()
2460 dfa->eclosures + dfa->nexts[cur_node]);
2524 assert (dfa->nexts[cur_node_idx] != REG_MISSING); in transit_state_mb()
2526 new_nodes = dfa->eclosures + dfa->nexts[cur_node_idx]; in transit_state_mb()
2589 assert (dfa->nexts[node_idx] != REG_MISSING); in transit_state_bkref()
2602 : dfa->eclosures + dfa->nexts[node_idx]); in transit_state_bkref()
[all …]
H A Dregcomp.c575 re_free (dfa->nexts); in free_dfa_content()
1099 dfa->nexts = re_malloc (Idx, dfa->nodes_alloc); in analyze()
1103 if (BE (dfa->nexts == NULL || dfa->org_indices == NULL || dfa->edests == NULL in analyze()
1394 dfa->nexts[idx] = node->next->node_idx; in link_nfa_nodes()
1396 re_node_set_init_1 (dfa->edests + idx, dfa->nexts[idx]); in link_nfa_nodes()
1401 dfa->nexts[idx] = node->next->node_idx; in link_nfa_nodes()
1429 org_dest = dfa->nexts[org_node]; in duplicate_node_closure()
1434 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
1444 dfa->nexts[clone_node] = dfa->nexts[org_node]; in duplicate_node_closure()
H A Dregex_internal.c1336 new_nexts = re_realloc (dfa->nexts, Idx, new_nodes_alloc); in re_dfa_add_node()
1343 dfa->nexts = new_nexts; in re_dfa_add_node()
1355 dfa->nexts[dfa->nodes_len] = REG_MISSING; in re_dfa_add_node()
H A Dregex_internal.h714 Idx *nexts; member
/dflybsd-src/contrib/binutils-2.27/ld/emultempl/
H A Delf32.em1855 asection *nexts;
1951 nexts = s;
1952 while ((nexts = bfd_get_next_section_by_name (nexts->owner, nexts))
1954 if (nexts->output_section == NULL
1955 && (nexts->flags & SEC_EXCLUDE) == 0
1956 && ((nexts->flags ^ flags) & (SEC_LOAD | SEC_ALLOC)) == 0
1957 && (nexts->owner->flags & DYNAMIC) == 0
1958 && nexts->owner->usrdata != NULL
1959 && !(((lang_input_statement_type *) nexts->owner->usrdata)
1961 && _bfd_elf_match_sections_by_type (nexts->owner, nexts,
[all …]
/dflybsd-src/sys/net/pf/
H A Dpf_ioctl.c1570 struct pf_state *s, *nexts; in pfioctl() local
1579 s; s = nexts) { in pfioctl()
1580 nexts = RB_NEXT(pf_state_tree_id, in pfioctl()
1603 struct pf_state *s, *nexts; in pfioctl() local
1632 s; s = nexts) { in pfioctl()
1633 nexts = RB_NEXT(pf_state_tree_id, &tree_id[nn], s); in pfioctl()
3060 struct pf_state *s, *nexts; in pf_clear_states() local
3066 for (s = RB_MIN(pf_state_tree_id, &tree_id[nn]); s; s = nexts) { in pf_clear_states()
3067 nexts = RB_NEXT(pf_state_tree_id, &tree_id[nn], s); in pf_clear_states()
H A Dif_pfsync.c543 struct pf_state *nexts; in pfsync_input() local
565 st; st = nexts) { in pfsync_input()
566 nexts = RB_NEXT(pf_state_tree_id, in pfsync_input()