| /src/sys/arch/powerpc/booke/dev/ |
| cpunode.c | 54 static u_int nodes; variable in typeref:typename:u_int
63 if (ma->ma_node > 8 || (nodes & (1 << ma->ma_node)))
105 nodes |= 1 << ma->ma_node;
|
| /src/bin/sh/ |
| Makefile | 11 GENSRCS=builtins.c init.c nodes.c
12 GENHDRS=builtins.h nodes.h token.h nodenames.h optinit.h
74 .ORDER: nodes.h nodes.c
75 nodes.c nodes.h: mknodes.sh nodetypes nodes.c.pat
78 [ -f nodes.h ]
80 nodenames.h: mknodenames.sh nodes.h
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/include/nvkm/core/ |
| mm.h | 23 struct list_head nodes; member in struct:nvkm_mm
50 list_for_each_entry(node, &mm->nodes, nl_entry) {
|
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/core/ |
| nouveau_nvkm_core_mm.c | 31 #define node(root, dir) ((root)->nl_entry.dir == &mm->nodes) ? NULL : \
41 list_for_each_entry(node, &mm->nodes, nl_entry) {
251 prev = list_last_entry(&mm->nodes, typeof(*node), nl_entry);
260 list_add_tail(&node->nl_entry, &mm->nodes);
264 INIT_LIST_HEAD(&mm->nodes);
280 list_add_tail(&node->nl_entry, &mm->nodes);
291 int nodes = 0; local in function:nvkm_mm_fini
296 list_for_each_entry(node, &mm->nodes, nl_entry) {
298 if (++nodes > mm->heap_nodes) {
305 list_for_each_entry_safe(node, temp, &mm->nodes, nl_entry)
[all...] |
| /src/sys/dev/raidframe/ |
| rf_parityloggingdags.c | 87 RF_DagNode_t *nodes, *wndNodes, *rodNodes = NULL, *syncNode, *xorNode, local in function:rf_CommonCreateParityLoggingLargeWriteDAG
103 /* alloc the Wnd nodes, the xor node, and the Lpo node */
105 nodes = RF_MallocAndAdd((nWndNodes + 6) * sizeof(*nodes), allocList);
107 wndNodes = &nodes[i];
109 xorNode = &nodes[i];
111 lpoNode = &nodes[i];
113 blockNode = &nodes[i];
115 syncNode = &nodes[i];
117 unblockNode = &nodes[i]
331 RF_DagNode_t *xorNodes, *blockNode, *unblockNode, *nodes; local in function:rf_CommonCreateParityLoggingSmallWriteDAG
[all...] |
| rf_parityscan.c | 408 * nNodes nodes at level 2, an unblock-recon node at level 3, and a
410 * and unblock nodes are not touched, nor are the pda fields in the
411 * second-level nodes, so they must be filled in later.
426 RF_DagNode_t *nodes, *termNode, *blockNode, *unblockNode, *tmpNode; local in function:rf_MakeSimpleDAG
443 /* create the nodes, the block & unblock nodes, and the terminator
448 tmpNode->list_next = dag_h->nodes;
449 dag_h->nodes = tmpNode;
451 nodes = dag_h->nodes;
[all...] |
| rf_dagdegrd.c | 62 * through the graph, blindly executing nodes until it reaches the end.
136 /* alloc the Wnd nodes and the Wmir node */
142 /* total number of nodes = 1 + (block + commit + terminator) */
145 rdNode->list_next = dag_h->nodes;
146 dag_h->nodes = rdNode;
149 blockNode->list_next = dag_h->nodes;
150 dag_h->nodes = blockNode;
153 commitNode->list_next = dag_h->nodes;
154 dag_h->nodes = commitNode;
157 termNode->list_next = dag_h->nodes;
580 RF_DagNode_t *nodes, *rdNode, *blockNode, *commitNode, *termNode; local in function:rf_CreateRaidCDegradedReadDAG
1046 RF_DagNode_t *nodes, *rudNodes, *rrdNodes, *recoveryNode, *blockNode, local in function:rf_DoubleDegRead
[all...] |
| rf_dagdegwr.c | 62 * through the graph, blindly executing nodes until it reaches the end.
134 * commit nodes: Xor, Wnd
147 * The block & unblock nodes are leftovers from a previous version. They
210 /* create all the nodes at once */
223 * DAG generator, so here's what I'm gonna do- if there's no read nodes,
236 blockNode->list_next = dag_h->nodes;
237 dag_h->nodes = blockNode;
240 commitNode->list_next = dag_h->nodes;
241 dag_h->nodes = commitNode;
244 unblockNode->list_next = dag_h->nodes;
721 RF_DagNode_t *nodes, *wudNodes, *rrdNodes, *recoveryNode, *blockNode, local in function:rf_DoubleDegSmallWrite
[all...] |
| rf_dag.h | 122 RF_DagNode_t *list_next; /* next in the list of DAG nodes for this DAG */
124 int visited; /* used to avoid re-visiting nodes on DAG
156 int numCommitNodes; /* number of commit nodes in graph */
157 int numCommits; /* number of commit nodes which have been
175 RF_DagNode_t *nodes; /* linked list of nodes used in this DAG */ member in struct:RF_DagHeader_s
|
| rf_dagutils.c | 69 /* The maximum number of nodes in a DAG is bounded by
204 while (dag_h->nodes) {
205 tmpnode = dag_h->nodes;
206 dag_h->nodes = dag_h->nodes->list_next;
703 RF_DagNode_t **nodes, int unvisited)
709 nodes[node->nodeNum] = node;
751 acount, nodes, unvisited)) {
796 * -- all nodes have status wait
797 * -- numAntDone is zero in all nodes
812 RF_DagNode_t **nodes; \/* array of ptrs to nodes in dag *\/ local in function:rf_ValidateDAG
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/ |
| amdgpu_vram_mgr.c | 282 struct drm_mm_node *nodes = mem->mm_node; local in function:amdgpu_vram_mgr_bo_visible_size
292 for (usage = 0; nodes && pages; pages -= nodes->size, nodes++)
293 usage += amdgpu_vram_mgr_vis_size(adev, nodes);
338 struct drm_mm_node *nodes; local in function:amdgpu_vram_mgr_new
375 nodes = kvmalloc_array((uint32_t)num_nodes, sizeof(*nodes),
377 if (!nodes) {
393 r = drm_mm_insert_node_in_range(mm, &nodes[i], pages
456 struct drm_mm_node *nodes = mem->mm_node; local in function:amdgpu_vram_mgr_del
[all...] |
| ta_xgmi_if.h | 94 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member in struct:ta_xgmi_cmd_get_topology_info_input
99 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member in struct:ta_xgmi_cmd_get_topology_info_output
104 struct ta_xgmi_node_info nodes[TA_XGMI__MAX_CONNECTED_NODES]; member in struct:ta_xgmi_cmd_set_topology_info_input
|
| amdgpu_psp.h | 131 struct psp_xgmi_node_info nodes[AMDGPU_XGMI_MAX_CONNECTED_NODES]; member in struct:psp_xgmi_topology_info
|
| amdgpu_ttm.c | 605 struct drm_mm_node *nodes = mem->mm_node; local in function:amdgpu_mem_visible
614 if (nodes->size != mem->num_pages)
617 return ((nodes->start + nodes->size) << PAGE_SHIFT)
1685 struct drm_mm_node *nodes; local in function:amdgpu_ttm_access_memory
1694 nodes = amdgpu_find_mm_node(&abo->tbo.mem, &offset);
1695 pos = (nodes->start << PAGE_SHIFT) + offset;
1728 if (pos >= (nodes->start + nodes->size) << PAGE_SHIFT) {
1729 ++nodes;
[all...] |
| /src/sys/fs/tmpfs/ |
| tmpfs_vfsops.c | 94 ino_t nodes; local in function:tmpfs_mount
146 nodes = 3 + (memlimit / 1024);
149 nodes = args->ta_nodes_max;
152 nodes = MIN(nodes, INT_MAX);
153 KASSERT(nodes >= 3);
157 if (set_nodes && nodes < tmp->tm_nodes_cnt)
173 tmp->tm_nodes_max = nodes;
191 tmp->tm_nodes_max = nodes;
|
| /src/sys/kern/ |
| kern_crashme.c | 35 * supports crashme sysctl nodes, to test various ways the system can
36 * panic or crash. you can add and remove nodes.
81 static crashme_node nodes[] = { variable in typeref:typename:crashme_node[]
215 * register the various nodes with sysctl.
251 for (n = 0; n < __arraycount(nodes); n++) {
252 if (crashme_add(&nodes[n]))
254 " debug.crashme.%s\n", __func__, nodes[n].cn_name);
|
| /src/dist/pf/sbin/pfctl/ |
| pfctl_qstats.c | 88 int nodes, dotitle = (opts & PF_OPT_SHOWALL); local in function:pfctl_show_altq
91 if ((nodes = pfctl_update_qstats(dev, &root)) < 0)
94 if (nodes == 0)
106 while (verbose2 && nodes > 0) {
110 if ((nodes = pfctl_update_qstats(dev, &root)) == -1)
|
| /src/sys/external/bsd/ipf/netinet/ |
| radix_ipf.h | 60 ipf_rdx_node_t nodes[3]; member in struct:ipf_rdx_head
|
| ip_dstlist.c | 343 /* iterates through the list of destination lists or nodes. */
473 ipf_dstnode_t *node, **nodes; local in function:ipf_dstlist_node_add
540 KMALLOCS(nodes, ipf_dstnode_t **,
541 sizeof(*nodes) * (d->ipld_maxnodes + 1));
542 if (nodes == NULL) {
549 bcopy(d->ipld_dests, nodes,
550 sizeof(*nodes) * d->ipld_maxnodes);
551 KFREES(d->ipld_dests, sizeof(*nodes) * d->ipld_nodes);
552 nodes[0]->ipfd_pnext = nodes;
[all...] |
| radix_ipf.c | 33 ipf_rdx_node_t nodes[2], int *);
90 /* nodes(O) - pair of ipf_rdx_node_t's to initialise with data */
93 /* Initialise the fields in a pair of radix tree nodes according to the */
99 buildnodes(addrfamily_t *addr, addrfamily_t *mask, ipf_rdx_node_t nodes[2])
116 bzero(&nodes[0], sizeof(ipf_rdx_node_t) * 2);
117 nodes[0].maskbitcount = maskbits;
118 nodes[0].index = -1 - (ADF_OFF_BITS + maskbits);
119 nodes[0].addrkey = (u_32_t *)addr;
120 nodes[0].maskkey = (u_32_t *)mask;
121 nodes[0].addroff = nodes[0].addrkey + masklen
919 struct ipf_rdx_node nodes[2]; member in struct:myst
[all...] |
| /src/usr.bin/make/ |
| compat.c | 475 GNode **nodes; local in function:MakeWaitGroupsInRandomOrder
481 nodes = vec.items;
486 if (nodes[i]->type & OP_WAIT) {
487 MakeInRandomOrder(nodes + start, nodes + i, pgn);
488 Compat_Make(nodes[i], pgn);
492 MakeInRandomOrder(nodes + start, nodes + i, pgn);
747 * Expand .USE nodes right now, because they can modify the structure
|
| /src/sys/external/bsd/drm2/dist/drm/amd/amdkfd/ |
| kfd_chardev.c | 934 uint32_t nodes = 0; local in function:kfd_ioctl_get_process_apertures_new
940 /* Return number of nodes, so that user space can alloacate
959 * nodes, but not more than args->num_of_nodes as that is
978 pa[nodes].gpu_id = pdd->dev->id;
979 pa[nodes].lds_base = pdd->lds_base;
980 pa[nodes].lds_limit = pdd->lds_limit;
981 pa[nodes].gpuvm_base = pdd->gpuvm_base;
982 pa[nodes].gpuvm_limit = pdd->gpuvm_limit;
983 pa[nodes].scratch_base = pdd->scratch_base;
984 pa[nodes].scratch_limit = pdd->scratch_limit
[all...] |
| /src/common/lib/libc/gen/ |
| radixtree.c | 37 * Leaf nodes are just void * and this implementation doesn't care about
42 * Intermediate nodes and memory allocation:
44 * Intermediate nodes are automatically allocated and freed internally and
48 * memory for intermediate nodes and thus can fail for ENOMEM.
53 * The memory consumption (number of necessary intermediate nodes) heavily
55 * consumes less nodes per item. Approximately,
68 * - the worst case: RADIX_TREE_MAX_HEIGHT intermediate nodes per item.
88 * (struct radix_tree) without allocating any intermediate nodes. In that
93 * This implementation provides a way to scan many nodes quickly via
99 * scanning of a subset of leaf nodes. Leaf nodes are untagged when inserte
330 struct radix_tree_node *nodes[RADIX_TREE_MAX_HEIGHT]; local in function:radix_tree_await_memory
1475 struct testnode *nodes; local in function:test2
[all...] |
| /src/sys/dev/ieee1394/ |
| firewire.c | 1032 aprint_normal_dev(fc->bdev, "%d nodes, maxhop <= %d %s irm(%d)%s\n",
1618 printf("iterate and invalidate all nodes\n");
1887 char nodes[63]; local in function:fw_explore
1899 /* We don't probe myself and linkdown nodes */
1915 nodes[todo++] = node;
1921 dfwdev->dst = nodes[i];
1924 nodes[todo2++] = nodes[i];
1926 printf("node %d, err = %d\n", nodes[i], err);
|
| /src/sys/external/bsd/drm2/dist/drm/selftests/ |
| test-drm_mm.c | 272 struct drm_mm_node nodes[2]; local in function:igt_debug
275 /* Create a small drm_mm with a couple of nodes and a few holes, and
281 memset(nodes, 0, sizeof(nodes));
282 nodes[0].start = 512;
283 nodes[0].size = 1024;
284 ret = drm_mm_reserve_node(&mm, &nodes[0]);
287 nodes[0].start, nodes[0].size);
291 nodes[1].size = 1024
380 struct drm_mm_node tmp, *nodes, *node, *next; local in function:__igt_reserve
578 struct drm_mm_node *nodes, *node, *next; local in function:__igt_insert
885 struct drm_mm_node *nodes, *node, *next; local in function:__igt_insert_range
1046 struct drm_mm_node *nodes, *node, *next; local in function:igt_align
1412 struct evict_node *nodes; local in function:igt_evict
1525 struct evict_node *nodes; local in function:igt_evict_range
1626 struct drm_mm_node *nodes, *node, *next; local in function:igt_topdown
1740 struct drm_mm_node *nodes, *node, *next; local in function:igt_bottomup
2164 struct evict_node *nodes; local in function:igt_color_evict
2267 struct evict_node *nodes; local in function:igt_color_evict_range
[all...] |
