HomeSort by: relevance | last modified time | path
    Searched refs:cur_node (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.bin/ctags/
tree.c 101 add_node(NODE *node, NODE *cur_node)
105 dif = strcmp(node->entry, cur_node->entry);
107 if (node->file == cur_node->file) {
112 if (!cur_node->been_warned)
114 fprintf(stderr, "Duplicate entry in files %s and %s: %s (Warning only)\n", node->file, cur_node->file, node->entry);
115 cur_node->been_warned = YES;
118 if (cur_node->left)
119 add_node(node, cur_node->left);
121 cur_node->left = node;
123 if (cur_node->right
    [all...]
  /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/
sanitizer_deadlock_detector.h 206 bool onLockBefore(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) {
208 uptr cur_idx = nodeToIndex(cur_node);
216 // Add cur_node to the set of locks held currently by dtls.
217 void onLockAfter(DeadlockDetectorTLS<BV> *dtls, uptr cur_node, u32 stk = 0) {
219 uptr cur_idx = nodeToIndex(cur_node);
224 // Returns true if all edges from the currently held locks to cur_node exist.
225 bool hasAllEdges(DeadlockDetectorTLS<BV> *dtls, uptr cur_node) {
228 if (cur_node && local_epoch == current_epoch_ &&
229 local_epoch == nodeToEpoch(cur_node)) {
230 uptr cur_idx = nodeToIndexUnchecked(cur_node);
    [all...]
  /src/sbin/fsck_udf/
main.c 3855 struct udf_fsck_node *cur_node, *next_node; local in function:udf_check_directory_tree
3898 TAILQ_FOREACH(cur_node, &fs_nodes, next) {
3900 error = udf_read_node_dscr(cur_node, &dscr);
3902 error = udf_extract_node_info(cur_node, dscr, 0);
3905 udf_node_path(cur_node));
3906 udf_recursive_keep(cur_node);
3907 cur_node->fsck_flags |= FSCK_NODE_FLAG_NOTFOUND;
3908 if (cur_node->parent) {
3909 if (cur_node->fsck_flags & FSCK_NODE_FLAG_STREAM_DIR)
3910 cur_node->parent->fsck_flags |
4158 struct udf_fsck_node *cur_node, *next_node; local in function:udf_cleanup_after_check
    [all...]
  /src/sys/dev/microcode/aic7xxx/
aicasm.c 358 symbol_node_t *cur_node; local in function:output_code
401 for (cur_node = SLIST_FIRST(&patch_functions);
402 cur_node != NULL;
403 cur_node = SLIST_NEXT(cur_node,links)) {
414 cur_node->symbol->info.condinfo->func_num,
416 cur_node->symbol->info.condinfo->func_num,
418 cur_node->symbol->name);

Completed in 16 milliseconds