summaryrefslogtreecommitdiff
path: root/linux-core
AgeCommit message (Expand)Author
2005-07-03Simplify the sysfs codeJon Smirl
2005-07-03Add sysfs attribute dri_library_name on Linux. code in share-core/via_drv.cJon Smirl
2005-06-30release can happen before dev->ctxlist is allocatedJon Smirl
2005-06-29Remove the AGP requirement from Makefile and Kconfig for MGA. Remove theIan Romanick
2005-06-29add remaining callsAlan Hourihane
2005-06-29add i915_ioc32.cAlan Hourihane
2005-06-29silence warningAlan Hourihane
2005-06-29fix some warnings from cross compilerDave Airlie
2005-06-29make r128/mga compile properly on sparc cross-compilerDave Airlie
2005-06-29Move to linux specific directoryAlan Hourihane
2005-06-29add mga and r128 32/64 bitsDave Airlie
2005-06-29these don't need reclaim buffers their release functions handle itDave Airlie
2005-06-29Bug in conversion from old DRM to core DRM....Dave Airlie
2005-06-28- Remove drm_initmap and replace its usage with drm_addmap. This reducesEric Anholt
2005-06-28add compat code from Paul MackerrasDave Airlie
2005-06-28Add compat to MakefileDave Airlie
2005-06-28Add drm and radeon 32/64-bit compat code from Paul MackerrasDave Airlie
2005-06-28Given that BenH says using the sysdev approach for DRM is bogus, I'll yankAlan Hourihane
2005-06-28Comment out the .resume function as without programming their dependentAlan Hourihane
2005-06-27Reverse the pm_message_t patch for now, it appears that the 2.6.12 releaseAlan Hourihane
2005-06-27Check for 2.6.12 suspend/resume changes (pm_message_t)Alan Hourihane
2005-06-26removed dev->sysdev_registeredJon Smirl
2005-06-24Ref count the sysdev class to support multiple DRM cardsJon Smirl
2005-06-24Make sysdev class only register when fbdev detectedJon Smirl
2005-06-24More err path clean up for drm_pm Add mandatory sysdev shutdown functionJon Smirl
2005-06-24Fix the sysdev approach for power management.Alan Hourihane
2005-06-23Fix drm_memory_debug.c to compile, doesn't seem to be working Clean upJon Smirl
2005-06-22Get the power management hooks into the right place so that everything getsJon Smirl
2005-06-19Remove I2C support from radeon driver. Same support is available fromJon Smirl
2005-06-17fix up drm_alloc_agp to take a dev arg and not pass crappy agpgart aroundDave Airlie
2005-06-17Fix 810/830 buildJon Smirl
2005-06-16Force AGP always for Intel chipsets.Alan Hourihane
2005-06-14Adds support for PCI cards to MGA DRMIan Romanick
2005-06-09Completely re-initialize DMA settingsIan Romanick
2005-06-09drm_mem_init should be done at core load, not driver initJon Smirl
2005-06-06Fix copyrightsAlan Hourihane
2005-06-04misc cleanup patch from Adrian BunkDave Airlie
2005-05-28Bugzilla #3217: Create a new __drm_pci_free which is used internally inEric Anholt
2005-05-28Bugzilla #3217: The size field in the new dma handle structure wasEric Anholt
2005-05-28Actually check for drm_fb_loaded before trying to initialize the sysdevAlan Hourihane
2005-05-28Re-implement the power management.Alan Hourihane
2005-05-27Modify drm_driver::device_is_agp to return a tri-state value to indicateIan Romanick
2005-05-21Change the MGA initialization and cleanup a bit. The dev_private structureIan Romanick
2005-05-20Refactor common, boilerplate ioctl code from drm_addbufs_* functions intoIan Romanick
2005-05-17Savage doesn't require AGP any more. Enable build even without CONFIG_AGP.Felix Kuehling
2005-05-16Added device_is_agp callback to drm_driver. This function is called by theIan Romanick
2005-04-26Convert BSD code to mostly use bus_dma, the dma abstraction for dealingEric Anholt
2005-04-20A fix for a locking bug which is triggered when a client tries to lock withThomas Hellstrom
2005-04-19Revert last commit, it affect via thingsDave Airlie
2005-03-29Add skeletal imagine driver (but don't build it yet).Adam Jackson
"hl opt">*entry; tail_node = mm->root_node.ml_entry.prev; entry = list_entry(tail_node, drm_mm_node_t, ml_entry); if (!entry->free) return 0; return entry->size; } int drm_mm_remove_space_from_tail(drm_mm_t *mm, unsigned long size) { struct list_head *tail_node; drm_mm_node_t *entry; tail_node = mm->root_node.ml_entry.prev; entry = list_entry(tail_node, drm_mm_node_t, ml_entry); if (!entry->free) return -ENOMEM; if (entry->size <= size) return -ENOMEM; entry->size -= size; return 0; } static int drm_mm_create_tail_node(drm_mm_t *mm, unsigned long start, unsigned long size) { drm_mm_node_t *child; child = (drm_mm_node_t *) drm_ctl_cache_alloc(drm_cache.mm, sizeof(*child), GFP_KERNEL); if (!child) return -ENOMEM; child->free = 1; child->size = size; child->start = start; child->mm = mm; list_add_tail(&child->ml_entry, &mm->root_node.ml_entry); list_add_tail(&child->fl_entry, &mm->root_node.fl_entry); return 0; } int drm_mm_add_space_to_tail(drm_mm_t *mm, unsigned long size) { struct list_head *tail_node; drm_mm_node_t *entry; tail_node = mm->root_node.ml_entry.prev; entry = list_entry(tail_node, drm_mm_node_t, ml_entry); if (!entry->free) { return drm_mm_create_tail_node(mm, entry->start + entry->size, size); } entry->size += size; return 0; } static drm_mm_node_t *drm_mm_split_at_start(drm_mm_node_t *parent, unsigned long size) { drm_mm_node_t *child; child = (drm_mm_node_t *) drm_ctl_cache_alloc(drm_cache.mm, sizeof(*child), GFP_KERNEL); if (!child) return NULL; INIT_LIST_HEAD(&child->fl_entry); child->free = 0; child->size = size; child->start = parent->start; child->mm = parent->mm; list_add_tail(&child->ml_entry, &parent->ml_entry); INIT_LIST_HEAD(&child->fl_entry); parent->size -= size; parent->start += size; return child; } drm_mm_node_t *drm_mm_get_block(drm_mm_node_t * parent, unsigned long size, unsigned alignment) { drm_mm_node_t *align_splitoff = NULL; drm_mm_node_t *child; unsigned tmp = 0; if (alignment) tmp = size % alignment; if (tmp) { align_splitoff = drm_mm_split_at_start(parent, alignment - tmp); if (!align_splitoff) return NULL; } if (parent->size == size) { list_del_init(&parent->fl_entry); parent->free = 0; return parent; } else { child = drm_mm_split_at_start(parent, size); if (!child) { if (align_splitoff) drm_mm_put_block(align_splitoff); return NULL; } } if (align_splitoff) drm_mm_put_block(align_splitoff); return child; } /* * Put a block. Merge with the previous and / or next block if they are free. * Otherwise add to the free stack. */ void drm_mm_put_block(drm_mm_node_t * cur) { drm_mm_t *mm = cur->mm; drm_mm_node_t *list_root = &mm->root_node; struct list_head *cur_head = &cur->ml_entry; struct list_head *root_head = &list_root->ml_entry; drm_mm_node_t *prev_node = NULL; drm_mm_node_t *next_node; int merged = 0; if (cur_head->prev != root_head) { prev_node = list_entry(cur_head->prev, drm_mm_node_t, ml_entry); if (prev_node->free) { prev_node->size += cur->size; merged = 1; } } if (cur_head->next != root_head) { next_node = list_entry(cur_head->next, drm_mm_node_t, ml_entry); if (next_node->free) { if (merged) { prev_node->size += next_node->size; list_del(&next_node->ml_entry); list_del(&next_node->fl_entry); drm_ctl_cache_free(drm_cache.mm, sizeof(*next_node), next_node); } else { next_node->size += cur->size; next_node->start = cur->start; merged = 1; } } } if (!merged) { cur->free = 1; list_add(&cur->fl_entry, &list_root->fl_entry); } else { list_del(&cur->ml_entry); drm_ctl_cache_free(drm_cache.mm, sizeof(*cur), cur); } } drm_mm_node_t *drm_mm_search_free(const drm_mm_t * mm, unsigned long size, unsigned alignment, int best_match) { struct list_head *list; const struct list_head *free_stack = &mm->root_node.fl_entry; drm_mm_node_t *entry; drm_mm_node_t *best; unsigned long best_size; unsigned wasted; best = NULL; best_size = ~0UL; list_for_each(list, free_stack) { entry = list_entry(list, drm_mm_node_t, fl_entry); wasted = 0; if (alignment) { register unsigned tmp = size % alignment; if (tmp) wasted += alignment - tmp; } if (entry->size >= size + wasted) { if (!best_match) return entry; if (size < best_size) { best = entry; best_size = entry->size; } } } return best; } int drm_mm_clean(drm_mm_t * mm) { struct list_head *head = &mm->root_node.ml_entry; return (head->next->next == head); } int drm_mm_init(drm_mm_t * mm, unsigned long start, unsigned long size) { INIT_LIST_HEAD(&mm->root_node.ml_entry); INIT_LIST_HEAD(&mm->root_node.fl_entry); return drm_mm_create_tail_node(mm, start, size); } EXPORT_SYMBOL(drm_mm_init); void drm_mm_takedown(drm_mm_t * mm) { struct list_head *bnode = mm->root_node.fl_entry.next; drm_mm_node_t *entry; entry = list_entry(bnode, drm_mm_node_t, fl_entry); if (entry->ml_entry.next != &mm->root_node.ml_entry || entry->fl_entry.next != &mm->root_node.fl_entry) { DRM_ERROR("Memory manager not clean. Delaying takedown\n"); return; } list_del(&entry->fl_entry); list_del(&entry->ml_entry); drm_ctl_cache_free(drm_cache.mm, sizeof(*entry), entry); } EXPORT_SYMBOL(drm_mm_takedown);