| /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;
|
| 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
|
| 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) {
|
| 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...] |
| 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_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_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...] |
| /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...] |
| 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
|
| 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
|
| /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;
|
| 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);
|
| 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)
|
| 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
|
| radix_ipf.h | 60 ipf_rdx_node_t nodes[3]; member in struct:ipf_rdx_head
|
| /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
|
