| /src/tests/usr.bin/xlint/lint1/ |
| gcc_init_compound_literal.c | 32 struct node { struct
34 struct node *left;
35 struct node *right;
43 static const struct node guess = {
45 &(struct node){
47 &(struct node){
52 &(struct node){
|
| /src/bin/sh/ |
| show.h | 37 union node;
38 void showtree(union node *);
42 void trargstr(union node *);
|
| redir.h | 48 union node;
49 void redirect(union node *, int);
58 int outredir(struct output *, union node *, int);
|
| /src/usr.sbin/autofs/ |
| common.h | 52 struct node { struct
53 TAILQ_ENTRY(node) n_next;
54 TAILQ_HEAD(nodehead, node) n_children;
55 struct node *n_parent;
83 struct node *node_new_root(void);
84 struct node *node_new(struct node *, char *, char *, char *, const char *,
86 struct node *node_new_map(struct node *, char *, char *, char *,
88 struct node *node_find(struct node *, const char *mountpoint)
[all...] |
| /src/usr.sbin/makefs/cd9660/ |
| cd9660_archimedes.c | 74 * Add "ARCHIMEDES" metadata to a node if that seems appropriate.
80 archimedes_convert_node(cd9660node *node)
87 if (node->su_tail_data != NULL)
91 len = strlen(node->node->name);
94 if (len >= 4 && node->node->name[len-4] == ',')
96 type = strtoul(node->node->name + len - 3, NULL, 16);
97 if (type == -1 && node->node->name[0] != '!'
[all...] |
| /src/sys/dev/raidframe/ |
| rf_pq.h | 40 void rf_RegularONPFunc(RF_DagNode_t * node);
41 void rf_SimpleONPFunc(RF_DagNode_t * node);
42 void rf_RecoveryPFunc(RF_DagNode_t * node);
43 void rf_RegularPFunc(RF_DagNode_t * node);
55 void rf_RegularONQFunc(RF_DagNode_t * node);
56 void rf_SimpleONQFunc(RF_DagNode_t * node);
58 void rf_RegularPQFunc(RF_DagNode_t * node);
59 void rf_RegularQFunc(RF_DagNode_t * node);
60 void rf_Degraded_100_PQFunc(RF_DagNode_t * node);
61 void rf_RecoveryQFunc(RF_DagNode_t * node);
[all...] |
| rf_dagfuncs.h | 31 * dagfuncs.h -- header file for DAG node execution routines
39 void rf_TerminateFunc(RF_DagNode_t * node);
40 void rf_TerminateUndoFunc(RF_DagNode_t * node);
41 void rf_DiskReadMirrorIdleFunc(RF_DagNode_t * node);
42 void rf_DiskReadMirrorPartitionFunc(RF_DagNode_t * node);
43 void rf_DiskReadMirrorUndoFunc(RF_DagNode_t * node);
44 void rf_ParityLogUpdateFunc(RF_DagNode_t * node);
45 void rf_ParityLogOverwriteFunc(RF_DagNode_t * node);
46 void rf_ParityLogUpdateUndoFunc(RF_DagNode_t * node);
47 void rf_ParityLogOverwriteUndoFunc(RF_DagNode_t * node);
[all...] |
| rf_pqdegdags.h | 42 void rf_PQDoubleRecoveryFunc(RF_DagNode_t * node);
43 void rf_PQWriteDoubleRecoveryFunc(RF_DagNode_t * node);
|
| rf_dagfuncs.c | 30 * dagfuncs.c -- DAG node execution routines
33 * 1. Every DAG execution function must eventually cause node->status to
36 * the node execution function can do these two things directly. In
46 * even when they NOP, so that a downstream release node will not have
103 * the execution function associated with a terminate node
106 rf_TerminateFunc(RF_DagNode_t *node)
108 RF_ASSERT(node->dagHdr->numCommits == node->dagHdr->numCommitNodes);
109 node->status = rf_good;
110 rf_FinishNode(node, RF_THREAD_CONTEXT)
353 RF_DagNode_t *node = v; local in function:rf_GenericWakeupFunc
[all...] |
| rf_evenodd_dagfuncs.h | 41 void rf_RegularPEFunc(RF_DagNode_t * node);
42 void rf_RegularONEFunc(RF_DagNode_t * node);
43 void rf_SimpleONEFunc(RF_DagNode_t * node);
44 void rf_RegularESubroutine(RF_DagNode_t * node, char *ebuf);
45 void rf_RegularEFunc(RF_DagNode_t * node);
46 void rf_DegrESubroutine(RF_DagNode_t * node, char *ebuf);
47 void rf_Degraded_100_EOFunc(RF_DagNode_t * node);
54 void rf_RecoveryEFunc(RF_DagNode_t * node);
55 void rf_EO_DegradedWriteEFunc(RF_DagNode_t * node);
59 void rf_EvenOddDoubleRecoveryFunc(RF_DagNode_t * node);
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/gt/ |
| intel_engine_pool.h | 20 intel_engine_pool_mark_active(struct intel_engine_pool_node *node,
23 return i915_active_add_request(&node->active, rq);
27 intel_engine_pool_put(struct intel_engine_pool_node *node)
29 i915_active_release(&node->active);
|
| intel_engine_pool.c | 40 static void node_free(struct intel_engine_pool_node *node)
42 i915_gem_object_put(node->obj);
43 i915_active_fini(&node->active);
44 kfree(node);
49 struct intel_engine_pool_node *node = local in function:pool_active
50 container_of(ref, typeof(*node), active);
51 struct dma_resv *resv = node->obj->base.resv;
59 err = i915_gem_object_pin_pages(node->obj);
64 i915_gem_object_make_unshrinkable(node->obj);
72 struct intel_engine_pool_node *node local in function:pool_retire
94 struct intel_engine_pool_node *node; local in function:node_create
131 struct intel_engine_pool_node *node; local in function:intel_engine_get_pool
180 struct intel_engine_pool_node *node, *nn; local in function:intel_engine_pool_park
[all...] |
| /src/sys/external/bsd/drm2/dist/include/drm/ |
| drm_vma_manager.h | 74 struct drm_vma_offset_node *node, unsigned long pages);
76 struct drm_vma_offset_node *node);
78 int drm_vma_node_allow(struct drm_vma_offset_node *node, struct drm_file *tag);
79 void drm_vma_node_revoke(struct drm_vma_offset_node *node,
81 bool drm_vma_node_is_allowed(struct drm_vma_offset_node *node,
85 * drm_vma_offset_exact_lookup_locked() - Look up node by exact address
90 * Same as drm_vma_offset_lookup_locked() but does not allow any offset into the node.
94 * Node at exact start address @start.
101 struct drm_vma_offset_node *node; local in function:drm_vma_offset_exact_lookup_locked
103 node = drm_vma_offset_lookup_locked(mgr, start, pages)
[all...] |
| spsc_queue.h | 67 static inline bool spsc_queue_push(struct spsc_queue *queue, struct spsc_node *node)
71 node->next = NULL;
75 tail = (struct spsc_node **)atomic_long_xchg(&queue->tail, (long)&node->next);
76 WRITE_ONCE(*tail, node);
80 * In case of first element verify new node will be visible to the consumer
93 struct spsc_node *next, *node; local in function:spsc_queue_pop
98 node = READ_ONCE(queue->head);
100 if (!node)
103 next = READ_ONCE(node->next);
110 (long)&node->next, (long) &queue->head) != (long)&node->next)
[all...] |
| /src/usr.bin/ctags/ |
| print.c | 105 put_entries(NODE *node)
108 if (node->left)
109 put_entries(node->left);
112 node->entry, node->file, (node->lno + 63) / 64);
115 node->entry, node->lno, node->file, node->pat)
[all...] |
| tree.c | 53 static void add_node(NODE *, NODE *);
54 static void free_tree(NODE *);
58 * enter a new node in the tree
63 NODE *np;
68 if (!(np = (NODE *)malloc(sizeof(NODE)))) {
73 if (!(head = np = (NODE *)malloc(sizeof(NODE))))
101 add_node(NODE *node, NODE *cur_node
[all...] |
| /src/sys/external/bsd/drm2/drm/ |
| drm_vma_manager.c | 133 drm_vma_node_init(struct drm_vma_offset_node *node)
137 *node = zero_node;
139 rw_init(&node->von_lock);
140 node->von_startpage = 0;
141 node->von_npages = 0;
142 rb_tree_init(&node->von_files, &drm_vma_file_rb_ops);
146 drm_vma_node_destroy(struct drm_vma_offset_node *node)
149 KASSERTMSG((RB_TREE_MIN(&node->von_files) == NULL),
150 "drm vma node %p not empty", node);
228 struct drm_vma_offset_node *node; local in function:drm_vma_offset_lookup_locked
249 struct drm_vma_offset_node *node; local in function:drm_vma_offset_exact_lookup_locked
267 struct drm_vma_offset_node *node; local in function:drm_vma_offset_exact_lookup
[all...] |
| /src/sys/fs/tmpfs/ |
| tmpfs_subr.c | 106 * Initialize vnode with tmpfs node.
109 tmpfs_init_vnode(struct vnode *vp, tmpfs_node_t *node)
113 KASSERT(node->tn_vnode == NULL);
115 /* Share the interlock with the node. */
116 if (node->tn_type == VREG) {
117 slock = node->tn_spec.tn_reg.tn_aobj->vmobjlock;
123 vp->v_type = node->tn_type;
130 spec_node_init(vp, node->tn_spec.tn_dev.tn_rdev);
136 if (node->tn_spec.tn_dir.tn_parent == node)
163 tmpfs_node_t *node; local in function:tmpfs_loadvnode
188 tmpfs_node_t *node, *dnode; local in function:tmpfs_newvnode
372 tmpfs_node_t *dnode = VP_TO_TMPFS_DIR(dvp), *node; local in function:tmpfs_construct_node
556 tmpfs_node_t *node = de->td_node; local in function:tmpfs_dir_detach
904 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_reg_resize
960 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_chflags
1019 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_chmod
1052 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_chown
1093 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_chsize
1147 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_chtimes
1187 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_update_locked
1214 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_update
1231 tmpfs_node_t *node = VP_TO_TMPFS_NODE(vp); local in function:tmpfs_update_lazily
[all...] |
| /src/sys/arch/arm/acpi/ |
| acpi_iort.c | 45 acpi_iort_id_map(ACPI_IORT_NODE *node, uint32_t *id)
50 offset = le32toh(node->MappingOffset);
51 for (n = 0; n < le32toh(node->MappingCount); n++) {
52 map = ACPI_ADD_PTR(ACPI_IORT_ID_MAPPING, node, offset);
68 acpi_iort_find_ref(ACPI_TABLE_IORT *iort, ACPI_IORT_NODE *node, uint32_t *id)
72 map = acpi_iort_id_map(node, id);
83 ACPI_IORT_NODE *node; local in function:acpi_iort_pci_root_map
94 node = ACPI_ADD_PTR(ACPI_IORT_NODE, iort, offset);
95 if (node->Type == ACPI_IORT_NODE_PCI_ROOT_COMPLEX) {
96 root = (ACPI_IORT_ROOT_COMPLEX *)node->NodeData
116 ACPI_IORT_NODE *node; local in function:acpi_iort_its_id_map
158 ACPI_IORT_NODE *node; local in function:acpi_iort_named_component
[all...] |
| /src/sys/external/bsd/drm2/include/linux/ |
| interval_tree.h | 95 interval_tree_insert(struct interval_tree_node *node,
100 collision = rb_tree_insert_node(&root->rb_root.rbr_tree, node);
101 KASSERT(collision == node);
105 interval_tree_remove(struct interval_tree_node *node,
109 rb_tree_remove_node(&root->rb_root.rbr_tree, node);
116 struct interval_tree_node *node; local in function:interval_tree_iter_first
118 node = rb_tree_find_node_geq(&root->rb_root.rbr_tree, &start);
119 if (node == NULL)
121 if (last < node->start)
123 KASSERT(node->start <= last)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/i915/selftests/ |
| igt_mmap.c | 18 struct drm_vma_offset_node *node,
31 err = drm_vma_node_allow(node, file->private_data);
37 addr = vm_mmap(file, addr, drm_vma_node_size(node) << PAGE_SHIFT,
38 prot, flags, drm_vma_node_offset_addr(node));
40 drm_vma_node_revoke(node, file->private_data);
|
| /src/sys/dev/ofw/ |
| ofw_i2c_subr.c | 47 * Iterate over the subtree of a i2c controller node.
55 int node, len; local in function:of_copy_i2c_devs
64 for (node = OF_child(ofnode); node; node = OF_peer(node)) {
65 if (OF_getprop(node, "name", name, sizeof(name)) <= 0)
67 len = OF_getproplen(node, "reg");
70 if (OF_getprop(node, "reg", ®64, sizeof(reg64))
82 if (OF_getprop(node, "reg", ®32, sizeof(reg32)
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/subdev/instmem/ |
| nouveau_nvkm_subdev_instmem_gk20a.c | 207 struct gk20a_instobj *node = gk20a_instobj(memory); local in function:gk20a_instobj_acquire_dma
208 struct gk20a_instmem *imem = node->imem;
213 return node->vaddr;
220 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); local in function:gk20a_instobj_acquire_iommu
221 struct gk20a_instmem *imem = node->base.imem;
229 if (node->base.vaddr) {
230 if (!node->use_cpt) {
232 list_del(&node->vaddr_node);
243 if (bus_dmamem_map(imem->dmat, node->segs, node->nsegs, size
273 struct gk20a_instobj *node = gk20a_instobj(memory); local in function:gk20a_instobj_release_dma
286 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); local in function:gk20a_instobj_release_iommu
310 struct gk20a_instobj *node = gk20a_instobj(memory); local in function:gk20a_instobj_rd32
318 struct gk20a_instobj *node = gk20a_instobj(memory); local in function:gk20a_instobj_wr32
327 struct gk20a_instobj *node = gk20a_instobj(memory); local in function:gk20a_instobj_map
341 struct gk20a_instobj_dma *node = gk20a_instobj_dma(memory); local in function:gk20a_instobj_dtor_dma
359 struct gk20a_instobj_iommu *node = gk20a_instobj_iommu(memory); local in function:gk20a_instobj_dtor_iommu
442 struct gk20a_instobj_dma *node; local in function:gk20a_instobj_ctor_dma
481 struct gk20a_instobj_iommu *node; local in function:gk20a_instobj_ctor_iommu
616 struct gk20a_instobj *node = NULL; local in function:gk20a_instobj_new
[all...] |
| /src/sys/dev/ |
| keylock.c | 54 const struct sysctlnode *node = NULL; variable in typeref:typename:const struct sysctlnode *
56 sysctl_createv(clog, 0, NULL, &node,
63 if (node == NULL)
66 sysctl_createv(clog, 0, &node, NULL,
72 sysctl_createv(clog, 0, &node, NULL,
78 sysctl_createv(clog, 0, &node, NULL,
84 sysctl_createv(clog, 0, &node, NULL,
164 struct sysctlnode node; local in function:keylock_pos_sysctl
167 node = *rnode;
168 node.sysctl_data = &val
177 struct sysctlnode node; local in function:keylock_state_sysctl
190 struct sysctlnode node; local in function:keylock_order_sysctl
[all...] |
| /src/sys/arch/macppc/macppc/ |
| mainbus.c | 70 int node, cpus, i; local in function:mainbus_attach
86 node = OF_child(cpus);
87 while (node != 0) {
90 ca.ca_nreg = OF_getprop(node, "reg", reg, sizeof(reg));
93 node)));
94 node = OF_peer(node);
107 node = OF_peer(0);
108 if (node) {
110 oba.oba_phandle = node;
[all...] |
