Home
last modified time | relevance | path

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

12345678910>>...36

/netbsd-src/external/bsd/ipf/dist/
H A Dradix_ipf.c33 ipf_rdx_node_t nodes[2], int *));
101 buildnodes(addr, mask, nodes) in buildnodes() argument
103 ipf_rdx_node_t nodes[2];
122 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2);
123 nodes[0].maskbitcount = maskbits;
124 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits);
125 nodes[0].addrkey = (u_32_t *)addr;
126 nodes[0].maskkey = (u_32_t *)mask;
127 nodes[0].addroff = nodes[0].addrkey + masklen;
128 nodes[0].maskoff = nodes[0].maskkey + masklen;
[all …]
/netbsd-src/sys/external/bsd/ipf/netinet/
H A Dradix_ipf.c33 ipf_rdx_node_t nodes[2], int *);
99 buildnodes(addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t nodes[2]) in buildnodes()
116 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2); in buildnodes()
117 nodes[0].maskbitcount = maskbits; in buildnodes()
118 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits); in buildnodes()
119 nodes[0].addrkey = (u_32_t *)addr; in buildnodes()
120 nodes[0].maskkey = (u_32_t *)mask; in buildnodes()
121 nodes[0].addroff = nodes[0].addrkey + masklen; in buildnodes()
122 nodes[0].maskoff = nodes[0].maskkey + masklen; in buildnodes()
123 nodes[0].parent = &nodes[1]; in buildnodes()
[all …]
/netbsd-src/sys/external/bsd/drm2/dist/drm/selftests/
H A Dtest-drm_mm.c272 struct drm_mm_node nodes[2]; in igt_debug() local
281 memset(nodes, 0, sizeof(nodes)); in igt_debug()
282 nodes[0].start = 512; in igt_debug()
283 nodes[0].size = 1024; in igt_debug()
284 ret = drm_mm_reserve_node(&mm, &nodes[0]); in igt_debug()
287 nodes[0].start, nodes[0].size); in igt_debug()
291 nodes[1].size = 1024; in igt_debug()
292 nodes[1].start = 4096 - 512 - nodes[1].size; in igt_debug()
293 ret = drm_mm_reserve_node(&mm, &nodes[1]); in igt_debug()
296 nodes[1].start, nodes[1].size); in igt_debug()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/
H A DSpillPlacement.cpp152 bool update(const Node nodes[], const BlockFrequency &Threshold) { in update()
157 if (nodes[L.second].Value == -1) in update()
159 else if (nodes[L.second].Value == 1) in update()
182 const Node nodes[]) const { in getDissentingNeighbors()
187 if (Value != nodes[n].Value) in getDissentingNeighbors()
198 assert(!nodes && "Leaking node array"); in runOnMachineFunction()
199 nodes = new Node[bundles->getNumBundles()]; in runOnMachineFunction()
217 delete[] nodes; in releaseMemory()
218 nodes = nullptr; in releaseMemory()
228 nodes[n].clear(Threshold); in activate()
[all …]
/netbsd-src/external/gpl2/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()
186 …int up = (int)(long)dm_hash_lookup_binary(node_updown_hash, (char *)&nodes[i].cn_nodeid, sizeof(in… in _cluster_do_node_callback()
188 callback(client, (char *)&nodes[i].cn_nodeid, up); in _cluster_do_node_callback()
296 int nodeid = nodes[i].cn_nodeid; in count_clvmds_running()
320 if (num_nodes > count_nodes && nodes) { in get_members()
321 free(nodes); in get_members()
322 nodes = NULL; in get_members()
325 if (nodes == NULL) { in get_members()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dddg.c459 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps()
482 ddg_node_ptr j_node = &g->nodes[j]; in build_intra_loop_deps()
556 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); in create_ddg()
575 g->closing_branch = &g->nodes[i]; in create_ddg()
580 g->nodes[i].cuid = i; in create_ddg()
581 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
582 bitmap_clear (g->nodes[i].successors); in create_ddg()
583 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
584 bitmap_clear (g->nodes[i].predecessors); in create_ddg()
587 g->nodes[i].first_note = first_note; in create_ddg()
[all …]
H A Dfibonacci_heap.c46 ASSERT_EQ (0, h1->nodes ()); in test_empty_heap()
53 ASSERT_EQ (0, r->nodes ()); in test_empty_heap()
73 ASSERT_EQ (i, h1->nodes ()); in test_basic_heap_operations()
81 ASSERT_EQ (TEST_HEAP_N - i, h1->nodes ()); in test_basic_heap_operations()
98 build_simple_heap (int *buffer, int_heap_node_t **nodes) in build_simple_heap() argument
105 nodes[i] = h->insert (i, &buffer[i]); in build_simple_heap()
117 int_heap_node_t *nodes[TEST_HEAP_N]; in test_replace_key() local
119 int_heap_t *heap = build_simple_heap (values, nodes); in test_replace_key()
123 heap->replace_key (nodes[i], 100 * 1000 + i); in test_replace_key()
125 ASSERT_EQ (TEST_HEAP_N, heap->nodes ()); in test_replace_key()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dddg.cc459 ddg_node_ptr dest_node = &g->nodes[i]; in build_intra_loop_deps()
482 ddg_node_ptr j_node = &g->nodes[j]; in build_intra_loop_deps()
556 g->nodes = (ddg_node_ptr) xcalloc (num_nodes, sizeof (struct ddg_node)); in create_ddg()
575 g->closing_branch = &g->nodes[i]; in create_ddg()
580 g->nodes[i].cuid = i; in create_ddg()
581 g->nodes[i].successors = sbitmap_alloc (num_nodes); in create_ddg()
582 bitmap_clear (g->nodes[i].successors); in create_ddg()
583 g->nodes[i].predecessors = sbitmap_alloc (num_nodes); in create_ddg()
584 bitmap_clear (g->nodes[i].predecessors); in create_ddg()
587 g->nodes[i].first_note = first_note; in create_ddg()
[all …]
H A Dfibonacci_heap.cc46 ASSERT_EQ (0, h1->nodes ()); in test_empty_heap()
53 ASSERT_EQ (0, r->nodes ()); in test_empty_heap()
73 ASSERT_EQ (i, h1->nodes ()); in test_basic_heap_operations()
81 ASSERT_EQ (TEST_HEAP_N - i, h1->nodes ()); in test_basic_heap_operations()
98 build_simple_heap (int *buffer, int_heap_node_t **nodes) in build_simple_heap() argument
105 nodes[i] = h->insert (i, &buffer[i]); in build_simple_heap()
117 int_heap_node_t *nodes[TEST_HEAP_N]; in test_replace_key() local
119 int_heap_t *heap = build_simple_heap (values, nodes); in test_replace_key()
123 heap->replace_key (nodes[i], 100 * 1000 + i); in test_replace_key()
125 ASSERT_EQ (TEST_HEAP_N, heap->nodes ()); in test_replace_key()
[all …]
/netbsd-src/external/mpl/bind/dist/doc/arm/_ext/
H A Discconf.py27 from docutils import nodes
34 from sphinx.util.nodes import make_refnode
170 blocks = nodes.paragraph()
171 blocks += nodes.strong(text="Blocks: ")
172 blocks += nodes.Text(", ".join(self.format_paths(grammar_blocks)))
181 grammarnode = nodes.paragraph()
197 nodetype = nodes.literal_block
199 nodetype = nodes.literal
200 grammarnode += nodes.strong(text=f"Grammar{separator}{paths}: ")
207 warn = nodes
[all...]
/netbsd-src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/
H A Damdgpu_vram_mgr.c282 struct drm_mm_node *nodes = mem->mm_node; in amdgpu_vram_mgr_bo_visible_size() local
292 for (usage = 0; nodes && pages; pages -= nodes->size, nodes++) in amdgpu_vram_mgr_bo_visible_size()
293 usage += amdgpu_vram_mgr_vis_size(adev, nodes); in amdgpu_vram_mgr_bo_visible_size()
338 struct drm_mm_node *nodes; in amdgpu_vram_mgr_new() local
375 nodes = kvmalloc_array((uint32_t)num_nodes, sizeof(*nodes), in amdgpu_vram_mgr_new()
377 if (!nodes) { in amdgpu_vram_mgr_new()
393 r = drm_mm_insert_node_in_range(mm, &nodes[i], pages, in amdgpu_vram_mgr_new()
400 vis_usage += amdgpu_vram_mgr_vis_size(adev, &nodes[i]); in amdgpu_vram_mgr_new()
401 amdgpu_vram_mgr_virt_start(mem, &nodes[i]); in amdgpu_vram_mgr_new()
412 r = drm_mm_insert_node_in_range(mm, &nodes[i], in amdgpu_vram_mgr_new()
[all …]
/netbsd-src/sys/dev/raidframe/
H A Drf_dagffwr.c205 tmpNode->list_next = dag_h->nodes; in rf_CommonCreateLargeWriteDAG()
206 dag_h->nodes = tmpNode; in rf_CommonCreateLargeWriteDAG()
208 wndNodes = dag_h->nodes; in rf_CommonCreateLargeWriteDAG()
211 xorNode->list_next = dag_h->nodes; in rf_CommonCreateLargeWriteDAG()
212 dag_h->nodes = xorNode; in rf_CommonCreateLargeWriteDAG()
215 wnpNode->list_next = dag_h->nodes; in rf_CommonCreateLargeWriteDAG()
216 dag_h->nodes = wnpNode; in rf_CommonCreateLargeWriteDAG()
219 blockNode->list_next = dag_h->nodes; in rf_CommonCreateLargeWriteDAG()
220 dag_h->nodes = blockNode; in rf_CommonCreateLargeWriteDAG()
223 commitNode->list_next = dag_h->nodes; in rf_CommonCreateLargeWriteDAG()
[all …]
H A Drf_dagffrd.c189 tmpNode->list_next = dag_h->nodes; in rf_CreateNonredundantDAG()
190 dag_h->nodes = tmpNode; in rf_CreateNonredundantDAG()
192 diskNodes = dag_h->nodes; in rf_CreateNonredundantDAG()
195 blockNode->list_next = dag_h->nodes; in rf_CreateNonredundantDAG()
196 dag_h->nodes = blockNode; in rf_CreateNonredundantDAG()
199 commitNode->list_next = dag_h->nodes; in rf_CreateNonredundantDAG()
200 dag_h->nodes = commitNode; in rf_CreateNonredundantDAG()
203 termNode->list_next = dag_h->nodes; in rf_CreateNonredundantDAG()
204 dag_h->nodes = termNode; in rf_CreateNonredundantDAG()
360 tmpNode->list_next = dag_h->nodes; in CreateMirrorReadDAG()
[all …]
H A Drf_dagdegrd.c145 rdNode->list_next = dag_h->nodes; in rf_CreateRaidOneDegradedReadDAG()
146 dag_h->nodes = rdNode; in rf_CreateRaidOneDegradedReadDAG()
149 blockNode->list_next = dag_h->nodes; in rf_CreateRaidOneDegradedReadDAG()
150 dag_h->nodes = blockNode; in rf_CreateRaidOneDegradedReadDAG()
153 commitNode->list_next = dag_h->nodes; in rf_CreateRaidOneDegradedReadDAG()
154 dag_h->nodes = commitNode; in rf_CreateRaidOneDegradedReadDAG()
157 termNode->list_next = dag_h->nodes; in rf_CreateRaidOneDegradedReadDAG()
158 dag_h->nodes = termNode; in rf_CreateRaidOneDegradedReadDAG()
319 blockNode->list_next = dag_h->nodes; in rf_CreateDegradedReadDAG()
320 dag_h->nodes = blockNode; in rf_CreateDegradedReadDAG()
[all …]
/netbsd-src/crypto/external/bsd/openssl/dist/crypto/x509/
H A Dpcy_node.c28 X509_POLICY_NODE *ossl_policy_tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, in ossl_policy_tree_find_sk() argument
38 idx = sk_X509_POLICY_NODE_find(nodes, &l); in ossl_policy_tree_find_sk()
39 return sk_X509_POLICY_NODE_value(nodes, idx); in ossl_policy_tree_find_sk()
49 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in ossl_policy_level_find_node()
50 node = sk_X509_POLICY_NODE_value(level->nodes, i); in ossl_policy_level_find_node()
85 if (level->nodes == NULL) in ossl_policy_level_add_node()
86 level->nodes = ossl_policy_node_cmp_new(); in ossl_policy_level_add_node()
87 if (level->nodes == NULL) { in ossl_policy_level_add_node()
91 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { in ossl_policy_level_add_node()
122 (void) sk_X509_POLICY_NODE_pop(level->nodes); in ossl_policy_level_add_node()
H A Dpcy_tree.c72 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print()
74 sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print()
265 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes()
266 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes()
382 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_any()
383 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any()
408 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune()
411 nodes = curr->nodes; in tree_prune()
413 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) { in tree_prune()
414 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/utils/
H A DDSAextract.py37 <output_file> [list of nodes to extract]')
100 nodes = arrowexp.split(buffer) variable
101 nodes[0] = string.strip(nodes[0])
102 nodes[1] = string.strip(nodes[1])
103 if nodes[0][:13] in node_set and \
104 nodes[1][:13] in node_set:
/netbsd-src/crypto/external/bsd/openssl.old/dist/crypto/x509v3/
H A Dpcy_tree.c68 for (i = 0; i < sk_X509_POLICY_NODE_num(plev->nodes); i++) { in tree_print()
69 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(plev->nodes, i); in tree_print()
252 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_matching_nodes()
253 X509_POLICY_NODE *node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_matching_nodes()
368 for (i = 0; i < sk_X509_POLICY_NODE_num(last->nodes); i++) { in tree_link_any()
369 node = sk_X509_POLICY_NODE_value(last->nodes, i); in tree_link_any()
393 STACK_OF(X509_POLICY_NODE) *nodes; in tree_prune()
396 nodes = curr->nodes; in tree_prune()
398 for (i = sk_X509_POLICY_NODE_num(nodes) - 1; i >= 0; i--) { in tree_prune()
399 node = sk_X509_POLICY_NODE_value(nodes, i); in tree_prune()
[all …]
H A Dpcy_node.c28 X509_POLICY_NODE *tree_find_sk(STACK_OF(X509_POLICY_NODE) *nodes, in tree_find_sk() argument
38 idx = sk_X509_POLICY_NODE_find(nodes, &l); in tree_find_sk()
39 return sk_X509_POLICY_NODE_value(nodes, idx); in tree_find_sk()
49 for (i = 0; i < sk_X509_POLICY_NODE_num(level->nodes); i++) { in level_find_node()
50 node = sk_X509_POLICY_NODE_value(level->nodes, i); in level_find_node()
80 if (level->nodes == NULL) in level_add_node()
81 level->nodes = policy_node_cmp_new(); in level_add_node()
82 if (level->nodes == NULL) { in level_add_node()
86 if (!sk_X509_POLICY_NODE_push(level->nodes, node)) { in level_add_node()
/netbsd-src/external/mpl/bind/dist/doc/arm/
H A Dconf.py20 from docutils import nodes
21 from docutils.nodes import Node, system_message
39 super().__init__("", nodes.strong)
62 target = nodes.target("", "", ids=[target_id])
67 reference = nodes.reference(
71 reference += nodes.strong(self.title, self.title)
73 reference += nodes.strong(cve_identifier, cve_identifier)
96 target = nodes.target("", "", ids=[target_id])
101 reference = nodes.reference(
105 reference += nodes
[all...]
/netbsd-src/crypto/external/bsd/openssl/dist/crypto/
H A Dsparse_array.c55 void **nodes; member
69 void *nodes[SA_BLOCK_MAX_LEVELS]; in sa_doall() local
74 nodes[0] = sa->nodes; in sa_doall()
77 void ** const p = nodes[l]; in sa_doall()
90 nodes[l] = p[n]; in sa_doall()
165 p = sa->nodes; in ossl_sa_get()
196 p[0] = sa->nodes; in ossl_sa_set()
197 sa->nodes = p; in ossl_sa_set()
202 p = sa->nodes; in ossl_sa_set()
/netbsd-src/crypto/external/bsd/openssl/dist/demos/certs/apps/
H A Dmkxcerts.sh7 -config apps.cnf -extensions usr_cert -x509 -nodes \
10 -config apps.cnf -extensions usr_cert -x509 -nodes \
13 -config apps.cnf -extensions usr_cert -x509 -nodes \
22 -config apps.cnf -extensions ec_cert -x509 -nodes \
23 -nodes -keyout tecp256.pem -out tecp256.pem -newkey ec:ecp256.pem \
27 -config apps.cnf -extensions ec_cert -x509 -nodes \
28 -nodes -keyout tecp384.pem -out tecp384.pem -newkey ec:ecp384.pem \
/netbsd-src/crypto/external/bsd/openssl.old/dist/demos/certs/apps/
H A Dmkxcerts.sh7 -config apps.cnf -extensions usr_cert -x509 -nodes \
10 -config apps.cnf -extensions usr_cert -x509 -nodes \
13 -config apps.cnf -extensions usr_cert -x509 -nodes \
22 -config apps.cnf -extensions ec_cert -x509 -nodes \
23 -nodes -keyout tecp256.pem -out tecp256.pem -newkey ec:ecp256.pem \
27 -config apps.cnf -extensions ec_cert -x509 -nodes \
28 -nodes -keyout tecp384.pem -out tecp384.pem -newkey ec:ecp384.pem \
/netbsd-src/crypto/external/bsd/openssl.old/dist/test/smime-certs/
H A Dmksmime-certs.sh17 CN="Test S/MIME RSA Root" $OPENSSL req -config ca.cnf -x509 -nodes \
21 CN="Test S/MIME EE RSA #1" $OPENSSL req -config ca.cnf -nodes \
27 CN="Test S/MIME EE RSA #2" $OPENSSL req -config ca.cnf -nodes \
32 CN="Test S/MIME EE RSA #3" $OPENSSL req -config ca.cnf -nodes \
41 CN="Test S/MIME EE DSA #1" $OPENSSL req -config ca.cnf -nodes \
45 CN="Test S/MIME EE DSA #2" $OPENSSL req -config ca.cnf -nodes \
49 CN="Test S/MIME EE DSA #3" $OPENSSL req -config ca.cnf -nodes \
59 CN="Test S/MIME EE EC #1" $OPENSSL req -config ca.cnf -nodes \
63 CN="Test S/MIME EE EC #2" $OPENSSL req -config ca.cnf -nodes \
67 CN="Test S/MIME EE EC #3" $OPENSSL req -config ca.cnf -nodes \
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/docs/DependenceGraphs/
H A Dindex.rst25 It is also possible to combine some atomic nodes that have a simple
26 def-use dependency between them into larger nodes that contain multiple-
29 As described in [1]_ the DDG uses graph abstraction to group nodes
31 into special nodes called pi-blocks. pi-blocks represent cycles of data
33 connected component of the graph is a maximal subgraph of all the nodes
55 all the nodes participating in the cycle, as shown bellow:
114 …- DDG nodes and edges are completely disjoint from PDG nodes and edges allowing them to change eas…
119 …- There are some similarities between DDG nodes and edges compared to PDG nodes and edges, but the…
132 …nodes in the paper represent three main program components, namely *assignment statements*, *for l…
133 …2. The paper describes five types of dependency edges between nodes namely *loop dependency*, *flo…
[all …]

12345678910>>...36