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

  /src/sys/external/bsd/drm/dist/bsd-core/
drm_mm.c 234 struct drm_mm_node *prev_node = NULL; local
240 prev_node =
242 if (prev_node->free) {
243 prev_node->size += cur->size;
252 prev_node->size += next_node->size;
  /src/sys/external/bsd/drm2/dist/drm/
drm_mm.c 718 struct drm_mm_node *prev_node; local
723 prev_node = list_prev_entry(node, node_list);
735 if (drm_mm_hole_follows(prev_node))
736 rm_hole(prev_node);
737 add_hole(prev_node);
968 struct drm_mm_node *prev_node; local
981 * backwards correctly we check that prev_node->next == node->next,
985 prev_node = list_prev_entry(node, node_list);
986 DRM_MM_BUG_ON(list_next_entry(prev_node, node_list) !=
988 list_add(&node->node_list, &prev_node->node_list)
    [all...]
  /src/sys/ufs/chfs/
chfs_readinode.c 325 struct rb_node *node, *prev_node; local
332 prev_node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
333 if (!prev_node) {
337 node = prev_node;
446 prev_node = rb_tree_iterate(&rii->tdi_root, node, RB_DIR_LEFT);
447 if (!prev_node) {
451 node = prev_node;
  /src/sys/external/bsd/ena-com/
ena_com.c 425 int prev_node = 0; local
444 prev_node);

Completed in 30 milliseconds