HomeSort by: relevance | last modified time | path
    Searched defs:next_node (Results 1 - 3 of 3) sorted by relevancy

  /src/sys/external/bsd/drm/dist/bsd-core/
drm_mm.c 235 struct drm_mm_node *next_node; local in function:drm_mm_put_block
248 next_node =
250 if (next_node->free) {
252 prev_node->size += next_node->size;
253 list_del(&next_node->ml_entry);
254 list_del(&next_node->fl_entry);
256 list_add(&next_node->fl_entry,
260 free(next_node, DRM_MEM_MM);
262 next_node->size += cur->size;
263 next_node->start = cur->start
    [all...]
  /src/common/lib/libc/gen/
ptree.c 721 uintptr_t node, next_node; local in function:ptree_iterate
735 next_node = node;
740 next_node = PT_NULL;
750 next_node = PT_NULL;
758 next_node = PTN_BRANCH_SLOT(ptn, slot + 1);
764 next_node = PTN_BRANCH_SLOT(ptn, slot - 1);
775 next_node = PTN_BRANCH_ROOT_SLOT(ptn);
776 ptn = PT_NODE(next_node);
784 KASSERT(PT_NULL_P(next_node));
790 node = next_node;
    [all...]
  /src/sbin/fsck_udf/
main.c 3855 struct udf_fsck_node *cur_node, *next_node; local in function:udf_check_directory_tree
4010 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
4095 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
4122 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {
4158 struct udf_fsck_node *cur_node, *next_node; local in function:udf_cleanup_after_check
4163 TAILQ_FOREACH_SAFE(cur_node, &fs_nodes, next, next_node) {

Completed in 179 milliseconds