Home
last modified time | relevance | path

Searched refs:nodes (Results 1 – 25 of 141) sorted by relevance

123456

/dragonfly/sys/dev/drm/amd/amdgpu/
H A Damdgpu_vram_mgr.c121 for (usage = 0; nodes && pages; pages -= nodes->size, nodes++) in amdgpu_vram_mgr_bo_visible_size()
145 struct drm_mm_node *nodes; in amdgpu_vram_mgr_new() local
166 nodes = kvmalloc_array(num_nodes, sizeof(*nodes), in amdgpu_vram_mgr_new()
168 if (!nodes) in amdgpu_vram_mgr_new()
200 start = nodes[i].start + nodes[i].size; in amdgpu_vram_mgr_new()
213 mem->mm_node = nodes; in amdgpu_vram_mgr_new()
219 drm_mm_remove_node(&nodes[i]); in amdgpu_vram_mgr_new()
222 kvfree(nodes); in amdgpu_vram_mgr_new()
250 pages -= nodes->size; in amdgpu_vram_mgr_del()
251 drm_mm_remove_node(nodes); in amdgpu_vram_mgr_del()
[all …]
/dragonfly/contrib/lvm2/dist/daemons/clvmd/
H A Dclvmd-cman.c63 static struct cman_node *nodes = NULL; variable
145 if (nodes[i].cn_member && nodes[i].cn_nodeid) in _get_num_nodes()
185 if (nodes[i].cn_member && nodes[i].cn_nodeid) { in _cluster_do_node_callback()
296 int nodeid = nodes[i].cn_nodeid; in count_clvmds_running()
321 free(nodes); in get_members()
322 nodes = NULL; in get_members()
325 if (nodes == NULL) { in get_members()
328 if (!nodes) { in get_members()
343 high_nodeid = nodes[i].cn_nodeid; in get_members()
369 strcpy(name, nodes[i].cn_name); in _name_from_csid()
[all …]
/dragonfly/contrib/gcc-4.7/gcc/
H A Dddg.c645 g->closing_branch = &g->nodes[i]; in create_ddg()
654 g->nodes[i].cuid = i; in create_ddg()
660 g->nodes[i++].insn = insn; in create_ddg()
699 free (g->nodes); in free_ddg()
886 sbitmap_copy (scc->nodes, nodes); in create_scc()
914 sbitmap_free (scc->nodes); in free_scc()
959 if (insn == g->nodes[i].insn) in get_node_of_insn()
960 return &g->nodes[i]; in get_node_of_insn()
1210 if (TEST_BIT (nodes, v) in update_dist_to_successors()
1240 g->nodes[i].aux.count = -1; in longest_simple_path()
[all …]
H A Dipa-utils.c356 new_node_set->nodes = NULL; in cgraph_node_set_new()
381 VEC_safe_push (cgraph_node_ptr, heap, set->nodes, node); in cgraph_node_set_add()
399 gcc_checking_assert (VEC_index (cgraph_node_ptr, set->nodes, index) in cgraph_node_set_remove()
404 last_node = VEC_pop (cgraph_node_ptr, set->nodes); in cgraph_node_set_remove()
412 VEC_replace (cgraph_node_ptr, set->nodes, index, last_node); in cgraph_node_set_remove()
470 VEC_free (cgraph_node_ptr, heap, set->nodes); in free_cgraph_node_set()
485 new_node_set->nodes = NULL; in varpool_node_set_new()
510 VEC_safe_push (varpool_node_ptr, heap, set->nodes, node); in varpool_node_set_add()
533 last_node = VEC_pop (varpool_node_ptr, set->nodes); in varpool_node_set_remove()
541 VEC_replace (varpool_node_ptr, set->nodes, index, last_node); in varpool_node_set_remove()
[all …]
H A Dtree-streamer.c99 gcc_assert (ix <= VEC_length (tree, cache->nodes)); in streamer_tree_cache_add_to_node_array()
101 if (ix == VEC_length (tree, cache->nodes)) in streamer_tree_cache_add_to_node_array()
102 VEC_safe_push (tree, heap, cache->nodes, t); in streamer_tree_cache_add_to_node_array()
104 VEC_replace (tree, cache->nodes, ix, t); in streamer_tree_cache_add_to_node_array()
134 ix = VEC_length (tree, cache->nodes); in streamer_tree_cache_insert_1()
198 unsigned ix = VEC_length (tree, cache->nodes); in streamer_tree_cache_append()
243 gcc_assert (ix < VEC_length (tree, cache->nodes)); in streamer_tree_cache_get()
245 return VEC_index (tree, cache->nodes, ix); in streamer_tree_cache_get()
347 VEC_free (tree, heap, c->nodes); in streamer_tree_cache_delete()
H A Dlto-cgraph.c83 encoder->nodes = NULL; in lto_cgraph_encoder_new()
178 encoder->nodes = NULL; in lto_varpool_encoder_new()
969 VEC(cgraph_node_ptr, heap) *nodes) in input_node()
1106 VEC(cgraph_node_ptr, heap) *nodes, in input_ref()
1210 input_edge (ib, nodes, false); in VEC()
1212 input_edge (ib, nodes, true); in VEC()
1257 return nodes; in VEC()
1305 VEC(cgraph_node_ptr, heap) *nodes, in input_refs()
1484 input_refs (ib, nodes, varpool); in input_cgraph()
1488 input_cgraph_opt_summary (nodes); in input_cgraph()
[all …]
/dragonfly/contrib/gcc-8.0/gcc/
H A Dddg.c629 g->nodes[i].cuid = i; in create_ddg()
635 g->nodes[i++].insn = insn; in create_ddg()
674 free (g->nodes); in free_ddg()
861 bitmap_copy (scc->nodes, nodes); in create_scc()
889 sbitmap_free (scc->nodes); in free_scc()
934 if (insn == g->nodes[i].insn) in get_node_of_insn()
935 return &g->nodes[i]; in get_node_of_insn()
1174 if (bitmap_bit_p (nodes, v) in update_dist_to_successors()
1203 g->nodes[i].aux.count = -1; in longest_simple_path()
1204 g->nodes[src].aux.count = 0; in longest_simple_path()
[all …]
H A Dfibonacci_heap.c44 ASSERT_EQ (0, h1->nodes ()); in test_empty_heap()
51 ASSERT_EQ (0, r->nodes ()); in test_empty_heap()
71 ASSERT_EQ (i, h1->nodes ()); in test_basic_heap_operations()
79 ASSERT_EQ (TEST_HEAP_N - i, h1->nodes ()); in test_basic_heap_operations()
103 nodes[i] = h->insert (i, &buffer[i]); in build_simple_heap()
115 int_heap_node_t *nodes[TEST_HEAP_N]; in test_replace_key() local
121 heap->replace_key (nodes[i], 100 * 1000 + i); in test_replace_key()
123 ASSERT_EQ (TEST_HEAP_N, heap->nodes ()); in test_replace_key()
130 ASSERT_EQ (1, heap->nodes ()); in test_replace_key()
150 ASSERT_EQ (3 * TEST_HEAP_N, heap->nodes ()); in test_duplicate_keys()
[all …]
H A Dtree-streamer.c110 if (cache->nodes.exists ()) in streamer_tree_cache_add_to_node_array()
112 if (cache->nodes.length () == ix) in streamer_tree_cache_add_to_node_array()
113 cache->nodes.safe_push (t); in streamer_tree_cache_add_to_node_array()
115 cache->nodes[ix] = t; in streamer_tree_cache_add_to_node_array()
268 gcc_assert (cache->nodes.exists ()); in verify_common_node_recorded()
270 for (unsigned i = 0; !found && i < cache->nodes.length (); ++i) in verify_common_node_recorded()
271 if (cache->nodes[i] == node) in verify_common_node_recorded()
305 streamer_tree_cache_append (cache, node, cache->nodes.length ()); in record_common_node()
405 cache->nodes.create (165); in streamer_tree_cache_create()
428 c->nodes.release (); in streamer_tree_cache_delete()
H A Dlto-cgraph.c84 encoder->nodes.create (0); in lto_symtab_encoder_new()
94 encoder->nodes.release (); in lto_symtab_encoder_delete()
1232 vec<symtab_node *> nodes) in input_node() argument
1441 vec<symtab_node *> nodes) in input_ref() argument
1559 nodes.safe_push (node); in input_cgraph_1()
1633 return nodes; in input_cgraph_1()
1640 vec<symtab_node *> nodes) in input_refs() argument
1651 node = nodes[idx]; in input_refs()
1873 input_refs (ib, nodes); in input_symtab()
1878 nodes.release (); in input_symtab()
[all …]
/dragonfly/crypto/libressl/crypto/x509/
H A Dpcy_tree.c116 node = sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print()
430 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune()
434 nodes = curr->nodes; in tree_prune()
437 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
442 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune()
449 nodes = curr->nodes; in tree_prune()
451 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
455 (void)sk_X509_POLICY_NODE_delete(nodes, i); in tree_prune()
646 if (curr->nodes) in X509_policy_tree_free()
647 sk_X509_POLICY_NODE_pop_free(curr->nodes, in X509_policy_tree_free()
[all …]
H A Dpcy_node.c78 tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, const ASN1_OBJECT *id) in tree_find_sk() argument
87 idx = sk_X509_POLICY_NODE_find(nodes, &l); in tree_find_sk()
91 return sk_X509_POLICY_NODE_value(nodes, idx); in tree_find_sk()
101 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in level_find_node()
102 node = sk_X509_POLICY_NODE_value(level->nodes, i); in level_find_node()
133 if (!level->nodes) in level_add_node()
134 level->nodes = policy_node_cmp_new(); in level_add_node()
135 if (!level->nodes) in level_add_node()
137 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) in level_add_node()
H A Dpcy_lib.c115 if (level->nodes) in X509_policy_level_node_count()
116 n += sk_X509_POLICY_NODE_num(level->nodes); in X509_policy_level_node_count()
130 return sk_X509_POLICY_NODE_value(level->nodes, i); in X509_policy_level_get0_node()
/dragonfly/bin/sh/
H A DMakefile11 GENSRCS= builtins.c nodes.c syntax.c
12 GENHDRS= builtins.h nodes.h syntax.h token.h
65 .ORDER: nodes.c nodes.h
66 nodes.c nodes.h: nodetypes nodes.c.pat
/dragonfly/contrib/cvs-1.12/lib/
H A Dregex_internal.c25 const re_node_set *nodes,
28 const re_node_set *nodes,
1335 dfa->nodes = new_nodes; in re_dfa_add_node()
1368 hash += nodes->elems[i]; in calc_state_hash()
1393 if (BE (nodes->nelem == 0, 0)) in re_acquire_state()
1406 if (re_node_set_compare (&state->nodes, nodes)) in re_acquire_state()
1444 if (nodes->nelem == 0) in re_acquire_state_context()
1528 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_ci_newstate()
1538 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate()
1578 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_cd_newstate()
[all …]
H A Dregexec.c656 if (dfa->init_state->nodes.nelem == 0 in re_search_internal()
1225 return state->nodes.elems[i]; in check_halt_state_context()
1286 if (dfa->nodes[node].accept_mb) in proceed_next_node()
1742 &src[st_idx]->nodes); in merge_state_array()
1763 : &mctx->state_log[str_idx]->nodes); in update_cur_sifted_state()
1925 switch (dfa->nodes[node].type) in check_dst_limits_calc_pos_1()
2133 type = dfa->nodes[node].type; in sift_states_bkref()
2559 for (i = 0; i < nodes->nelem; ++i) in transit_state_bkref()
2562 Idx node_idx = nodes->elems[i]; in transit_state_bkref()
2748 const re_node_set *nodes; in get_subexp() local
[all …]
/dragonfly/contrib/lvm2/dist/libdm/regex/
H A Dmatcher.c38 struct rx_node **nodes; member
67 m->nodes[m->nodes_entered++] = rx; in _fill_table()
75 struct rx_node *n = m->nodes[i]; in _create_bitsets()
88 rx = m->nodes[i]; in _calc_functions()
150 struct rx_node *n = m->nodes[j]; in _calc_functions()
161 struct rx_node *n = m->nodes[j]; in _calc_functions()
228 if (dm_bit(m->nodes[i]->charset, a)) { in _calc_states()
230 dfa->final = m->nodes[i]->final; in _calc_states()
233 m->nodes[i]->followpos); in _calc_states()
312 m->nodes = dm_pool_alloc(scratch, sizeof(*m->nodes) * m->num_nodes); in dm_regex_create()
[all …]
/dragonfly/contrib/diffutils/lib/
H A Dregex_internal.c25 const re_node_set *nodes,
28 const re_node_set *nodes,
1429 dfa->nodes = new_nodes; in re_dfa_add_node()
1468 hash += nodes->elems[i]; in calc_state_hash()
1484 const re_node_set *nodes) in re_acquire_state() argument
1507 if (re_node_set_compare (&state->nodes, nodes)) in re_acquire_state()
1542 if (nodes->nelem == 0) in re_acquire_state_context()
1637 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_ci_newstate()
1647 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate()
1687 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_cd_newstate()
[all …]
H A Dregexec.c131 const re_node_set *nodes);
633 if (dfa->init_state->nodes.nelem == 0 in re_search_internal()
1221 return state->nodes.elems[i]; in check_halt_state_context()
1281 if (dfa->nodes[node].accept_mb) in proceed_next_node()
1729 &src[st_idx]->nodes); in merge_state_array()
1913 switch (dfa->nodes[node].type) in check_dst_limits_calc_pos_1()
2119 type = dfa->nodes[node].type; in sift_states_bkref()
2543 for (i = 0; i < nodes->nelem; ++i) in transit_state_bkref()
2546 Idx node_idx = nodes->elems[i]; in transit_state_bkref()
2735 const re_node_set *nodes; in get_subexp() local
[all …]
/dragonfly/contrib/grep/lib/
H A Dregex_internal.c25 const re_node_set *nodes,
28 const re_node_set *nodes,
1423 dfa->nodes = new_nodes; in re_dfa_add_node()
1462 hash += nodes->elems[i]; in calc_state_hash()
1478 const re_node_set *nodes) in re_acquire_state() argument
1501 if (re_node_set_compare (&state->nodes, nodes)) in re_acquire_state()
1536 if (nodes->nelem == 0) in re_acquire_state_context()
1631 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_ci_newstate()
1641 re_token_t *node = dfa->nodes + nodes->elems[i]; in create_ci_newstate()
1681 err = re_node_set_init_copy (&newstate->nodes, nodes); in create_cd_newstate()
[all …]
H A Dregexec.c131 const re_node_set *nodes);
622 if (dfa->init_state->nodes.nelem == 0 in re_search_internal()
1202 return state->nodes.elems[i]; in check_halt_state_context()
1262 if (dfa->nodes[node].accept_mb) in proceed_next_node()
1708 &src[st_idx]->nodes); in merge_state_array()
1892 switch (dfa->nodes[node].type) in check_dst_limits_calc_pos_1()
2098 type = dfa->nodes[node].type; in sift_states_bkref()
2520 for (i = 0; i < nodes->nelem; ++i) in transit_state_bkref()
2523 Idx node_idx = nodes->elems[i]; in transit_state_bkref()
2710 const re_node_set *nodes; in get_subexp() local
[all …]
/dragonfly/contrib/mdocml/
H A Dtag.c39 struct roff_node **nodes; member
73 free(entry->nodes); in tag_free()
142 entry->nodes = NULL; in tag_put()
163 nold = entry->nodes[--entry->nnodes]; in tag_put()
178 entry->nodes = mandoc_reallocarray(entry->nodes, in tag_put()
179 entry->maxnodes, sizeof(*entry->nodes)); in tag_put()
181 entry->nodes[entry->nnodes++] = n; in tag_put()
/dragonfly/sys/netgraph7/
H A DNOTES42 - Have a user level program to print out and manipulate nodes, etc.
49 command to list all existing nodes (in case you don't know the
53 - Need a way to get a list of ALL nodes.
57 - Enhance "netstat" to display all netgraph nodes -- or at least
58 all netgraph socket nodes.
68 - Need to implement passing meta information through socket nodes
77 - All nodes assume that all data mbufs have the M_PKTHDR flag set!
97 Every node has a queue, plus there is a list of nodes that have queued work.
/dragonfly/sys/netgraph/
H A DNOTES38 - Have a user level program to print out and manipulate nodes, etc.
45 command to list all existing nodes (in case you don't know the
49 - Need a way to get a list of ALL nodes.
53 - Enhance "netstat" to display all netgraph nodes -- or at least
54 all netgraph socket nodes.
62 - Need to implement passing meta information through socket nodes
71 - All nodes assume that all data mbufs have the M_PKTHDR flag set!
/dragonfly/contrib/bmake/
H A Dcompat.c487 GNode **nodes; in MakeWaitGroupsInRandomOrder() local
493 nodes = vec.items; in MakeWaitGroupsInRandomOrder()
498 if (nodes[i]->type & OP_WAIT) { in MakeWaitGroupsInRandomOrder()
499 MakeInRandomOrder(nodes + start, nodes + i, pgn); in MakeWaitGroupsInRandomOrder()
500 Compat_Make(nodes[i], pgn); in MakeWaitGroupsInRandomOrder()
504 MakeInRandomOrder(nodes + start, nodes + i, pgn); in MakeWaitGroupsInRandomOrder()

123456