003 File Manager
Current Path:
/usr/src/sys/dev/drm2
usr
/
src
/
sys
/
dev
/
drm2
/
📁
..
📄
drm.h
(25.25 KB)
📄
drmP.h
(60.47 KB)
📄
drm_agpsupport.c
(12.05 KB)
📄
drm_atomic.h
(3.48 KB)
📄
drm_auth.c
(6.12 KB)
📄
drm_buffer.c
(5.02 KB)
📄
drm_buffer.h
(4.55 KB)
📄
drm_bufs.c
(43.77 KB)
📄
drm_context.c
(12.07 KB)
📄
drm_core.h
(1.48 KB)
📄
drm_crtc.c
(97.29 KB)
📄
drm_crtc.h
(38.9 KB)
📄
drm_crtc_helper.c
(31.32 KB)
📄
drm_crtc_helper.h
(6.37 KB)
📄
drm_dma.c
(4.04 KB)
📄
drm_dp_helper.c
(4.5 KB)
📄
drm_dp_helper.h
(12.35 KB)
📄
drm_dp_iic_helper.c
(6.54 KB)
📄
drm_drv.c
(17.48 KB)
📄
drm_edid.c
(51.99 KB)
📄
drm_edid.h
(7.55 KB)
📄
drm_edid_modes.h
(33.57 KB)
📄
drm_fb_helper.c
(38.84 KB)
📄
drm_fb_helper.h
(4.21 KB)
📄
drm_fixed.h
(2.23 KB)
📄
drm_fops.c
(15.14 KB)
📄
drm_fourcc.h
(7.93 KB)
📄
drm_gem.c
(11.57 KB)
📄
drm_gem_names.c
(5.59 KB)
📄
drm_gem_names.h
(2.46 KB)
📄
drm_global.c
(3.16 KB)
📄
drm_global.h
(2.01 KB)
📄
drm_hashtab.c
(4.94 KB)
📄
drm_hashtab.h
(2.57 KB)
📄
drm_ioc32.c
(21.88 KB)
📄
drm_ioctl.c
(8.81 KB)
📄
drm_irq.c
(41.03 KB)
📄
drm_linux_list.h
(7.88 KB)
📄
drm_linux_list_sort.c
(2.53 KB)
📄
drm_lock.c
(10.27 KB)
📄
drm_mem_util.h
(1.77 KB)
📄
drm_memory.c
(3.78 KB)
📄
drm_mm.c
(19.2 KB)
📄
drm_mm.h
(8.52 KB)
📄
drm_mode.h
(12.16 KB)
📄
drm_modes.c
(33.66 KB)
📄
drm_os_freebsd.c
(11.36 KB)
📄
drm_os_freebsd.h
(17.72 KB)
📄
drm_pci.c
(12.35 KB)
📄
drm_pciids.h
(70.22 KB)
📄
drm_platform.c
(4.58 KB)
📄
drm_sarea.h
(2.64 KB)
📄
drm_scatter.c
(3.58 KB)
📄
drm_stub.c
(12.1 KB)
📄
drm_sysctl.c
(9.99 KB)
📄
drm_vm.c
(4.18 KB)
📁
ttm
Editing: drm_mm.h
/************************************************************************** * * Copyright 2006-2008 Tungsten Graphics, Inc., Cedar Park, TX. USA. * All Rights Reserved. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sub license, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice (including the * next paragraph) shall be included in all copies or substantial portions * of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT. IN NO EVENT SHALL * THE COPYRIGHT HOLDERS, AUTHORS AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE * USE OR OTHER DEALINGS IN THE SOFTWARE. * * **************************************************************************/ /* * Authors: * Thomas Hellstrom <thomas-at-tungstengraphics-dot-com> */ #include <sys/cdefs.h> __FBSDID("$FreeBSD$"); #ifndef _DRM_MM_H_ #define _DRM_MM_H_ /* * Generic range manager structs */ #include <dev/drm2/drm_linux_list.h> struct drm_mm_node { struct list_head node_list; struct list_head hole_stack; unsigned hole_follows : 1; unsigned scanned_block : 1; unsigned scanned_prev_free : 1; unsigned scanned_next_free : 1; unsigned scanned_preceeds_hole : 1; unsigned allocated : 1; unsigned long color; unsigned long start; unsigned long size; struct drm_mm *mm; }; struct drm_mm { /* List of all memory nodes that immediately precede a free hole. */ struct list_head hole_stack; /* head_node.node_list is the list of all memory nodes, ordered * according to the (increasing) start address of the memory node. */ struct drm_mm_node head_node; struct list_head unused_nodes; int num_unused; struct mtx unused_lock; unsigned int scan_check_range : 1; unsigned scan_alignment; unsigned long scan_color; unsigned long scan_size; unsigned long scan_hit_start; unsigned long scan_hit_end; unsigned scanned_blocks; unsigned long scan_start; unsigned long scan_end; struct drm_mm_node *prev_scanned_node; void (*color_adjust)(struct drm_mm_node *node, unsigned long color, unsigned long *start, unsigned long *end); }; static inline bool drm_mm_node_allocated(struct drm_mm_node *node) { return node->allocated; } static inline bool drm_mm_initialized(struct drm_mm *mm) { return mm->hole_stack.next; } #define drm_mm_for_each_node(entry, mm) list_for_each_entry(entry, \ &(mm)->head_node.node_list, \ node_list) #define drm_mm_for_each_scanned_node_reverse(entry, n, mm) \ for (entry = (mm)->prev_scanned_node, \ next = entry ? list_entry(entry->node_list.next, \ struct drm_mm_node, node_list) : NULL; \ entry != NULL; entry = next, \ next = entry ? list_entry(entry->node_list.next, \ struct drm_mm_node, node_list) : NULL) \ /* * Basic range manager support (drm_mm.c) */ extern struct drm_mm_node *drm_mm_get_block_generic(struct drm_mm_node *node, unsigned long size, unsigned alignment, unsigned long color, int atomic); extern struct drm_mm_node *drm_mm_get_block_range_generic( struct drm_mm_node *node, unsigned long size, unsigned alignment, unsigned long color, unsigned long start, unsigned long end, int atomic); static inline struct drm_mm_node *drm_mm_get_block(struct drm_mm_node *parent, unsigned long size, unsigned alignment) { return drm_mm_get_block_generic(parent, size, alignment, 0, 0); } static inline struct drm_mm_node *drm_mm_get_block_atomic(struct drm_mm_node *parent, unsigned long size, unsigned alignment) { return drm_mm_get_block_generic(parent, size, alignment, 0, 1); } static inline struct drm_mm_node *drm_mm_get_block_range( struct drm_mm_node *parent, unsigned long size, unsigned alignment, unsigned long start, unsigned long end) { return drm_mm_get_block_range_generic(parent, size, alignment, 0, start, end, 0); } static inline struct drm_mm_node *drm_mm_get_color_block_range( struct drm_mm_node *parent, unsigned long size, unsigned alignment, unsigned long color, unsigned long start, unsigned long end) { return drm_mm_get_block_range_generic(parent, size, alignment, color, start, end, 0); } static inline struct drm_mm_node *drm_mm_get_block_atomic_range( struct drm_mm_node *parent, unsigned long size, unsigned alignment, unsigned long start, unsigned long end) { return drm_mm_get_block_range_generic(parent, size, alignment, 0, start, end, 1); } extern int drm_mm_insert_node(struct drm_mm *mm, struct drm_mm_node *node, unsigned long size, unsigned alignment); extern int drm_mm_insert_node_in_range(struct drm_mm *mm, struct drm_mm_node *node, unsigned long size, unsigned alignment, unsigned long start, unsigned long end); extern int drm_mm_insert_node_generic(struct drm_mm *mm, struct drm_mm_node *node, unsigned long size, unsigned alignment, unsigned long color); extern int drm_mm_insert_node_in_range_generic(struct drm_mm *mm, struct drm_mm_node *node, unsigned long size, unsigned alignment, unsigned long color, unsigned long start, unsigned long end); extern void drm_mm_put_block(struct drm_mm_node *cur); extern void drm_mm_remove_node(struct drm_mm_node *node); extern void drm_mm_replace_node(struct drm_mm_node *old, struct drm_mm_node *new); extern struct drm_mm_node *drm_mm_search_free_generic(const struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long color, bool best_match); extern struct drm_mm_node *drm_mm_search_free_in_range_generic( const struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long color, unsigned long start, unsigned long end, bool best_match); static inline struct drm_mm_node *drm_mm_search_free(const struct drm_mm *mm, unsigned long size, unsigned alignment, bool best_match) { return drm_mm_search_free_generic(mm,size, alignment, 0, best_match); } static inline struct drm_mm_node *drm_mm_search_free_in_range( const struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long start, unsigned long end, bool best_match) { return drm_mm_search_free_in_range_generic(mm, size, alignment, 0, start, end, best_match); } static inline struct drm_mm_node *drm_mm_search_free_color(const struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long color, bool best_match) { return drm_mm_search_free_generic(mm,size, alignment, color, best_match); } static inline struct drm_mm_node *drm_mm_search_free_in_range_color( const struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long color, unsigned long start, unsigned long end, bool best_match) { return drm_mm_search_free_in_range_generic(mm, size, alignment, color, start, end, best_match); } extern int drm_mm_init(struct drm_mm *mm, unsigned long start, unsigned long size); extern void drm_mm_takedown(struct drm_mm *mm); extern int drm_mm_clean(struct drm_mm *mm); extern int drm_mm_pre_get(struct drm_mm *mm); static inline struct drm_mm *drm_get_mm(struct drm_mm_node *block) { return block->mm; } void drm_mm_init_scan(struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long color); void drm_mm_init_scan_with_range(struct drm_mm *mm, unsigned long size, unsigned alignment, unsigned long color, unsigned long start, unsigned long end); int drm_mm_scan_add_block(struct drm_mm_node *node); int drm_mm_scan_remove_block(struct drm_mm_node *node); extern void drm_mm_debug_table(struct drm_mm *mm, const char *prefix); #endif
Upload File
Create Folder