| /src/sys/external/bsd/drm2/include/linux/ |
| llist.h | 53 #define llist_entry(NODE, TYPE, FIELD) container_of(NODE, TYPE, FIELD)
66 llist_add(struct llist_node *node, struct llist_head *head)
72 node->next = first;
74 } while (atomic_cas_ptr(&head->first, first, node) != first);
127 #define llist_for_each_safe(NODE, TMP, HEAD) \
128 for ((NODE) = (HEAD); \
129 (NODE) && ((TMP) = (NODE)->next, 1); \
130 (NODE) = (TMP)
[all...] |
| /src/usr.bin/ctags/ |
| 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...] |
| ctags.h | 64 } NODE;
67 extern NODE *head; /* head of the sorted binary tree */
86 extern void put_entries(NODE *);
|
| 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...] |
| ctags.c | 62 NODE *head; /* head of the sorted binary tree */
|
| /src/usr.bin/tsort/ |
| tsort.c | 76 * sometimes says a node is in a cycle when it isn't).
82 #define NF_ACYCLIC 0x2 /* this node is cycle free */
85 typedef struct node_str NODE;
88 NODE **n_prevp; /* pointer to previous node's n_next */
89 NODE *n_next; /* next node in graph */
90 NODE **n_arcs; /* array of arcs to other nodes */
93 size_t n_refcnt; /* # of arcs pointing to this node */
95 char n_name[1]; /* name of this node */
[all...] |
| /src/usr.sbin/mtree/ |
| extern.h | 70 int compare(NODE *, FTSENT *);
74 void dump_nodes(FILE *, const char *, NODE *, int);
76 int matchtags(NODE *);
|
| spec.c | 100 static void replacenode(NODE *, NODE *);
101 static void set(char *, NODE *);
102 static void unset(char *, NODE *);
103 static void addchild(NODE *, NODE *);
104 static int nodecmp(const NODE *, const NODE *);
109 NODE *
112 NODE *centry, *last, *pathparent, *cur
[all...] |
| specspec.c | 56 shownode(NODE *n, int f, char const *path)
106 mismatch(NODE *n1, NODE *n2, int differ, char const *path)
128 compare_nodes(NODE *n1, NODE *n2, char const *path)
193 walk_in_the_forest(NODE *t1, NODE *t2, char const *path)
196 NODE *c1, *c2, *n1, *n2;
264 NODE *root1, *root2;
|
| mtree.h | 108 } NODE;
124 NODE *spec(FILE *);
126 void free_nodes(NODE *);
|
| verify.c | 60 static NODE *root;
63 static void miss(NODE *, char *);
82 NODE *ep, *level;
179 miss(NODE *p, char *tail)
|
| misc.c | 220 * returns 0 if there's a match from the exclude list in the node's tags,
225 matchtags(NODE *node)
229 if (node->tags) {
231 if (strstr(node->tags, excludetags.list[i]))
237 if (strstr(node->tags, includetags.list[i]))
|
| /src/sys/external/isc/libsodium/dist/dist-build/ |
| emscripten.sh | 115 if test "x$NODE" = x; then
116 for candidate in node nodejs; do
119 NODE=$candidate
129 if test "x$NODE" = x; then
130 echo 'node.js not found - test suite skipped' >&2
133 echo "Using [${NODE}] as a Javascript runtime"
145 fgrep -v "#! /usr/bin/env ${NODE}" "$file" > "browser/${file}"
158 echo "#! /usr/bin/env ${NODE}" > "${file}.tmp"
159 fgrep -v "#! /usr/bin/env ${NODE}" "$file" >> "${file}.tmp"
|
| /src/sbin/restore/ |
| utilities.c | 77 ep = addentry(name, pathsearch(name)->d_ino, NODE);
138 * Create a new node (directory).
145 if (np->e_type != NODE)
146 badentry(np, "newnode: not a node");
153 vprintf(stdout, "Make node %s\n", cp);
157 * Remove an old node (directory).
164 if (ep->e_type != NODE)
165 badentry(ep, "removenode: not a node");
175 vprintf(stdout, "Remove node %s\n", cp);
275 if (ep == NULL || ep->e_type == NODE)
[all...] |
| restore.c | 91 if (type == NODE) {
105 if (type == NODE)
128 if (ep->e_type != NODE)
335 if (type == NODE)
366 if (ip->e_type == NODE) {
389 if (type == NODE)
422 /* changing from leaf to node */
426 "NODE and LEAF links to same inode");
433 /* changing from node to leaf */
802 if (ep->e_type == NODE) {
[all...] |
| restore.h | 103 #define NODE 2 /* directory entry */
|
| symtab.c | 184 if (ep->e_type != NODE)
190 * Determine the current pathname of a node or leaf
280 if (ep->e_type == NODE) {
554 ep = addentry(".", UFS_ROOTINO, NODE);
|
| dirs.c | 248 if ((*todo)(pname, ino, NODE) == FAIL)
597 struct modeinfo node; local in function:setdirmodes
624 (void) fread((char *)&node, 1, sizeof(struct modeinfo), mf);
632 if (node.extsize > 0) {
633 if (bufsize < node.extsize) {
636 if ((buf = malloc(node.extsize)) != NULL) {
637 bufsize = node.extsize;
642 if (bufsize >= node.extsize) {
643 (void) fread(buf, 1, node.extsize, mf);
652 (void) fseek(mf, node.extsize, SEEK_CUR)
775 struct modeinfo node; local in function:allocinotab
[all...] |
| /src/sys/fs/udf/ |
| udf_rename.c | 137 /* make sure our `leaf' node's hash is populated */
352 DPRINTF(NODE, ("udf_gro_rename called : %s -> %s\n",
376 /* create new directory entry for the node */
381 /* unlink old directory entry for the node, if failing, unattach new */
569 DPRINTF(NODE, ("udf_gro_genealogy : "
582 DPRINTF(NODE, ("\tlookup of parent '..' resulted in error %d, "
591 /* did we encounter the root node? i.e. loop back */
593 DPRINTF(NODE, ("ROOT found!\n"));
601 DPRINTF(NODE, ("fdvp is ancestor of tdvp\n"));
612 DPRINTF(NODE, ("\tgetting the parent node\n"))
[all...] |
| udf_vnops.c | 88 DPRINTF(NODE, ("udf_inactive called for udf_node %p\n", VTOI(vp)));
91 DPRINTF(NODE, ("udf_inactive: inactive NULL UDF node\n"));
117 /* write out its node */
138 DPRINTF(NODE, ("udf_reclaim called for node %p\n", udf_node));
141 DPRINTF(NODE, ("udf_reclaim(): null udfnode\n"));
158 DPRINTF(NODE, ("udf_inactive deleting unlinked file\n"));
165 /* async check to see if all node descriptors are written out */
173 /* dispose all node knowledge *
[all...] |
| /src/usr.sbin/makefs/ |
| walk.c | 63 static void apply_specdir(const char *, NODE *, fsnode *, int);
64 static void apply_specentry(const char *, NODE *, fsnode *);
386 * Removes node from tree and frees it and all of
390 free_fsnodes(fsnode *node)
394 assert(node != NULL);
396 /* for ".", start with actual parent node */
397 if (node->first == node) {
398 assert(node->name[0] == '.' && node->name[1] == '\0')
[all...] |
| /src/sys/fs/nilfs/ |
| nilfs_vnops.c | 77 DPRINTF(NODE, ("nilfs_inactive called for nilfs_node %p\n", VTOI(vp)));
80 DPRINTF(NODE, ("nilfs_inactive: inactive NULL NILFS node\n"));
107 DPRINTF(NODE, ("nilfs_reclaim called for node %p\n", nilfs_node));
110 DPRINTF(NODE, ("nilfs_reclaim(): null nilfsnode\n"));
117 /* dispose all node knowledge */
278 /* mark node changed and request update */
297 /* if we write and we're synchronous, update node */
328 struct vnode *vp = ap->a_vp; /* our node */
333 struct nilfs_node *node = VTOI(vp); local in function:nilfs_trivial_bmap
487 struct nilfs_node *node = VTOI(vp); local in function:nilfs_vfsstrategy
521 struct nilfs_node *node = VTOI(vp); local in function:nilfs_readdir
784 struct nilfs_node *node = VTOI(vp); local in function:nilfs_getattr
[all...] |
| nilfs_vfsops.c | 207 /* init node pools */
239 const struct sysctlnode *node; variable in typeref:typename:const struct sysctlnode *
246 sysctl_createv(clog, 0, NULL, &node,
253 sysctl_createv(clog, 0, NULL, &node,
558 /* clear our mount reference and release device node */
792 printf("mount_nilfs: can't read ifile node\n");
796 /* get root node? */
1034 DPRINTF(NODE, ("nilfs_root called\n"));
1047 DPRINTF(NODE, ("nilfs_root finished\n"));
1116 struct nilfs_node *node; local in function:nilfs_loadvnode
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/ |
| drm_mm.c | 84 * steep cliff not a real concern. Removing a node again is O(1).
112 static noinline void save_stack(struct drm_mm_node *node)
120 node->stack = stack_depot_save(entries, n, GFP_NOWAIT);
125 struct drm_mm_node *node; local in function:show_leaks
134 list_for_each_entry(node, drm_mm_nodes(mm), node_list) {
135 if (!node->stack) {
136 DRM_ERROR("node [%08"PRIx64" + %08"PRIx64"]: unknown owner\n",
137 node->start, node->size);
141 nr_entries = stack_depot_fetch(node->stack, &entries)
171 struct drm_mm_node *node; local in function:INTERVAL_TREE_DEFINE
444 struct drm_mm_node *node = NULL; local in function:find_hole
[all...] |
| /src/bin/pax/ |
| ftree.c | 103 * directory, otherwise the node itself is just passed to pax). The selection
120 static NODE *ftnode = NULL; /* mtree(8) specfile; used by -M */
144 * an mtree(8) specfile, so parse the specfile into a NODE *
157 "First node of specfile is not `.' directory");
226 * allocate FTREE node and add to the end of the linked list (args are
443 ftnode->flags |= F_VISIT; /* mark node visited */
522 * find next node
530 /* next node at current level */
640 * ok got a file tree node to process. copy info into arcn
|
