Lines Matching defs:START
137 node->start, node->size);
144 node->start, node->size, buf);
157 #define START(node) ((node)->start)
158 #define LAST(node) ((node)->start + (node)->size - 1)
163 START, LAST, static inline, drm_mm_interval_tree)
167 __drm_mm_interval_first(const struct drm_mm *mm_const, u64 start, u64 last)
173 if (start <= LAST(node) && START(node) <= last)
179 start, last) ?: (struct drm_mm_node *)&mm->head_node;
220 if (node->start < parent->start) {
465 u64 start, u64 end, u64 size,
474 return find_hole(mm, start);
526 * meaning that start, size and color must be set by the caller. All other
536 u64 end = node->start + node->size;
541 end = node->start + node->size;
542 if (unlikely(end <= node->start))
546 hole = find_hole(mm, node->start);
556 if (adj_start > node->start || adj_end < end)
569 if (node->start > hole_start)
591 * @range_start: start of the allowed range for this node
678 node->start = adj_start;
750 * and insert with the guarantee that the allocation start will match.
785 * efficient when we simply start to select all objects from the tail of an LRU
819 * @start: start of the allowed range for the allocation
835 u64 start,
839 DRM_MM_BUG_ON(start >= end);
840 DRM_MM_BUG_ON(!size || size > end - start);
854 DRM_MM_BUG_ON(end <= start);
855 scan->range_start = start;
890 * (distance between the end of our previous node and the start of
990 return (node->start + node->size > scan->hit_start &&
991 node->start < scan->hit_end);
1052 * @start: start of the range managed by @mm
1057 void drm_mm_init(struct drm_mm *mm, u64 start, u64 size)
1059 DRM_MM_BUG_ON(start + size <= start);
1078 mm->head_node.start = start + size;
1103 u64 start, size;
1107 start = drm_mm_hole_node_start(entry);
1109 start, start + size, size);
1127 drm_printf(p, "%#018"PRIx64"-%#018"PRIx64": %"PRIu64": used\n", entry->start,
1128 entry->start + entry->size, entry->size);
Indexes created Wed Oct 01 13:09:50 GMT 2025