2005-09-25 12:28:13 +08:00
|
|
|
/**
|
|
|
|
* \file drm_memory.c
|
2005-04-17 06:20:36 +08:00
|
|
|
* Memory management wrappers for DRM
|
|
|
|
*
|
|
|
|
* \author Rickard E. (Rik) Faith <faith@valinux.com>
|
|
|
|
* \author Gareth Hughes <gareth@valinux.com>
|
|
|
|
*/
|
|
|
|
|
2005-09-25 12:28:13 +08:00
|
|
|
/*
|
2005-04-17 06:20:36 +08:00
|
|
|
* Created: Thu Feb 4 14:00:34 1999 by faith@valinux.com
|
|
|
|
*
|
|
|
|
* Copyright 1999 Precision Insight, Inc., Cedar Park, Texas.
|
|
|
|
* Copyright 2000 VA Linux Systems, Inc., Sunnyvale, California.
|
|
|
|
* 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, sublicense,
|
|
|
|
* 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 NONINFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* VA LINUX SYSTEMS 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/highmem.h>
|
2011-08-31 06:16:33 +08:00
|
|
|
#include <linux/export.h>
|
2012-10-03 01:01:07 +08:00
|
|
|
#include <drm/drmP.h>
|
2014-08-29 18:12:32 +08:00
|
|
|
#include "drm_legacy.h"
|
2005-04-17 06:20:36 +08:00
|
|
|
|
2015-09-09 22:45:52 +08:00
|
|
|
#if IS_ENABLED(CONFIG_AGP)
|
2014-08-29 18:12:35 +08:00
|
|
|
|
|
|
|
#ifdef HAVE_PAGE_AGP
|
|
|
|
# include <asm/agp.h>
|
|
|
|
#else
|
|
|
|
# ifdef __powerpc__
|
2016-06-27 17:00:23 +08:00
|
|
|
# define PAGE_AGP pgprot_noncached_wc(PAGE_KERNEL)
|
2014-08-29 18:12:35 +08:00
|
|
|
# else
|
|
|
|
# define PAGE_AGP PAGE_KERNEL
|
|
|
|
# endif
|
|
|
|
#endif
|
|
|
|
|
2006-04-11 14:18:27 +08:00
|
|
|
static void *agp_remap(unsigned long offset, unsigned long size,
|
2018-10-16 05:26:44 +08:00
|
|
|
struct drm_device *dev)
|
2006-04-07 14:55:43 +08:00
|
|
|
{
|
2009-06-12 12:11:41 +08:00
|
|
|
unsigned long i, num_pages =
|
2006-04-07 14:55:43 +08:00
|
|
|
PAGE_ALIGN(size) / PAGE_SIZE;
|
|
|
|
struct drm_agp_mem *agpmem;
|
|
|
|
struct page **page_map;
|
2009-06-12 12:11:41 +08:00
|
|
|
struct page **phys_page_map;
|
2006-04-07 14:55:43 +08:00
|
|
|
void *addr;
|
|
|
|
|
|
|
|
size = PAGE_ALIGN(size);
|
|
|
|
|
|
|
|
#ifdef __alpha__
|
|
|
|
offset -= dev->hose->mem_space->start;
|
|
|
|
#endif
|
|
|
|
|
2007-05-26 03:01:51 +08:00
|
|
|
list_for_each_entry(agpmem, &dev->agp->memory, head)
|
2006-04-07 14:55:43 +08:00
|
|
|
if (agpmem->bound <= offset
|
|
|
|
&& (agpmem->bound + (agpmem->pages << PAGE_SHIFT)) >=
|
|
|
|
(offset + size))
|
|
|
|
break;
|
2010-04-28 05:11:05 +08:00
|
|
|
if (&agpmem->head == &dev->agp->memory)
|
2006-04-07 14:55:43 +08:00
|
|
|
return NULL;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* OK, we're mapping AGP space on a chipset/platform on which memory accesses by
|
|
|
|
* the CPU do not get remapped by the GART. We fix this by using the kernel's
|
|
|
|
* page-table instead (that's probably faster anyhow...).
|
|
|
|
*/
|
|
|
|
/* note: use vmalloc() because num_pages could be large... */
|
treewide: Use array_size() in vmalloc()
The vmalloc() function has no 2-factor argument form, so multiplication
factors need to be wrapped in array_size(). This patch replaces cases of:
vmalloc(a * b)
with:
vmalloc(array_size(a, b))
as well as handling cases of:
vmalloc(a * b * c)
with:
vmalloc(array3_size(a, b, c))
This does, however, attempt to ignore constant size factors like:
vmalloc(4 * 1024)
though any constants defined via macros get caught up in the conversion.
Any factors with a sizeof() of "unsigned char", "char", and "u8" were
dropped, since they're redundant.
The Coccinelle script used for this was:
// Fix redundant parens around sizeof().
@@
type TYPE;
expression THING, E;
@@
(
vmalloc(
- (sizeof(TYPE)) * E
+ sizeof(TYPE) * E
, ...)
|
vmalloc(
- (sizeof(THING)) * E
+ sizeof(THING) * E
, ...)
)
// Drop single-byte sizes and redundant parens.
@@
expression COUNT;
typedef u8;
typedef __u8;
@@
(
vmalloc(
- sizeof(u8) * (COUNT)
+ COUNT
, ...)
|
vmalloc(
- sizeof(__u8) * (COUNT)
+ COUNT
, ...)
|
vmalloc(
- sizeof(char) * (COUNT)
+ COUNT
, ...)
|
vmalloc(
- sizeof(unsigned char) * (COUNT)
+ COUNT
, ...)
|
vmalloc(
- sizeof(u8) * COUNT
+ COUNT
, ...)
|
vmalloc(
- sizeof(__u8) * COUNT
+ COUNT
, ...)
|
vmalloc(
- sizeof(char) * COUNT
+ COUNT
, ...)
|
vmalloc(
- sizeof(unsigned char) * COUNT
+ COUNT
, ...)
)
// 2-factor product with sizeof(type/expression) and identifier or constant.
@@
type TYPE;
expression THING;
identifier COUNT_ID;
constant COUNT_CONST;
@@
(
vmalloc(
- sizeof(TYPE) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(TYPE) * COUNT_ID
+ array_size(COUNT_ID, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(TYPE) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(TYPE) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(THING) * (COUNT_ID)
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vmalloc(
- sizeof(THING) * COUNT_ID
+ array_size(COUNT_ID, sizeof(THING))
, ...)
|
vmalloc(
- sizeof(THING) * (COUNT_CONST)
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
|
vmalloc(
- sizeof(THING) * COUNT_CONST
+ array_size(COUNT_CONST, sizeof(THING))
, ...)
)
// 2-factor product, only identifiers.
@@
identifier SIZE, COUNT;
@@
vmalloc(
- SIZE * COUNT
+ array_size(COUNT, SIZE)
, ...)
// 3-factor product with 1 sizeof(type) or sizeof(expression), with
// redundant parens removed.
@@
expression THING;
identifier STRIDE, COUNT;
type TYPE;
@@
(
vmalloc(
- sizeof(TYPE) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(TYPE) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(TYPE) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(TYPE) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(TYPE))
, ...)
|
vmalloc(
- sizeof(THING) * (COUNT) * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vmalloc(
- sizeof(THING) * (COUNT) * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vmalloc(
- sizeof(THING) * COUNT * (STRIDE)
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
|
vmalloc(
- sizeof(THING) * COUNT * STRIDE
+ array3_size(COUNT, STRIDE, sizeof(THING))
, ...)
)
// 3-factor product with 2 sizeof(variable), with redundant parens removed.
@@
expression THING1, THING2;
identifier COUNT;
type TYPE1, TYPE2;
@@
(
vmalloc(
- sizeof(TYPE1) * sizeof(TYPE2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(TYPE2))
, ...)
|
vmalloc(
- sizeof(THING1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vmalloc(
- sizeof(THING1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(THING1), sizeof(THING2))
, ...)
|
vmalloc(
- sizeof(TYPE1) * sizeof(THING2) * COUNT
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
|
vmalloc(
- sizeof(TYPE1) * sizeof(THING2) * (COUNT)
+ array3_size(COUNT, sizeof(TYPE1), sizeof(THING2))
, ...)
)
// 3-factor product, only identifiers, with redundant parens removed.
@@
identifier STRIDE, SIZE, COUNT;
@@
(
vmalloc(
- (COUNT) * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- COUNT * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- COUNT * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- (COUNT) * (STRIDE) * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- COUNT * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- (COUNT) * STRIDE * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- (COUNT) * (STRIDE) * (SIZE)
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
|
vmalloc(
- COUNT * STRIDE * SIZE
+ array3_size(COUNT, STRIDE, SIZE)
, ...)
)
// Any remaining multi-factor products, first at least 3-factor products
// when they're not all constants...
@@
expression E1, E2, E3;
constant C1, C2, C3;
@@
(
vmalloc(C1 * C2 * C3, ...)
|
vmalloc(
- E1 * E2 * E3
+ array3_size(E1, E2, E3)
, ...)
)
// And then all remaining 2 factors products when they're not all constants.
@@
expression E1, E2;
constant C1, C2;
@@
(
vmalloc(C1 * C2, ...)
|
vmalloc(
- E1 * E2
+ array_size(E1, E2)
, ...)
)
Signed-off-by: Kees Cook <keescook@chromium.org>
2018-06-13 05:27:11 +08:00
|
|
|
page_map = vmalloc(array_size(num_pages, sizeof(struct page *)));
|
2006-04-07 14:55:43 +08:00
|
|
|
if (!page_map)
|
|
|
|
return NULL;
|
|
|
|
|
2009-06-12 12:11:41 +08:00
|
|
|
phys_page_map = (agpmem->memory->pages + (offset - agpmem->bound) / PAGE_SIZE);
|
2006-04-07 14:55:43 +08:00
|
|
|
for (i = 0; i < num_pages; ++i)
|
2009-06-12 12:11:41 +08:00
|
|
|
page_map[i] = phys_page_map[i];
|
2006-04-07 14:55:43 +08:00
|
|
|
addr = vmap(page_map, num_pages, VM_IOREMAP, PAGE_AGP);
|
|
|
|
vfree(page_map);
|
|
|
|
|
|
|
|
return addr;
|
|
|
|
}
|
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/** Wrapper around agp_free_memory() */
|
2018-10-16 05:26:44 +08:00
|
|
|
void drm_free_agp(struct agp_memory *handle, int pages)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2010-08-24 04:53:36 +08:00
|
|
|
agp_free_memory(handle);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2005-09-25 12:28:13 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/** Wrapper around agp_bind_memory() */
|
2018-10-16 05:26:44 +08:00
|
|
|
int drm_bind_agp(struct agp_memory *handle, unsigned int start)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2010-08-24 04:53:36 +08:00
|
|
|
return agp_bind_memory(handle, start);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2005-09-25 12:28:13 +08:00
|
|
|
|
2005-04-17 06:20:36 +08:00
|
|
|
/** Wrapper around agp_unbind_memory() */
|
2018-10-16 05:26:44 +08:00
|
|
|
int drm_unbind_agp(struct agp_memory *handle)
|
2005-04-17 06:20:36 +08:00
|
|
|
{
|
2010-08-24 04:53:36 +08:00
|
|
|
return agp_unbind_memory(handle);
|
2005-04-17 06:20:36 +08:00
|
|
|
}
|
2006-04-11 14:18:27 +08:00
|
|
|
|
2015-09-09 22:45:52 +08:00
|
|
|
#else /* CONFIG_AGP */
|
2006-04-11 14:18:27 +08:00
|
|
|
static inline void *agp_remap(unsigned long offset, unsigned long size,
|
2018-10-16 05:26:44 +08:00
|
|
|
struct drm_device *dev)
|
2006-04-11 14:18:27 +08:00
|
|
|
{
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2015-09-09 22:45:52 +08:00
|
|
|
#endif /* CONFIG_AGP */
|
2006-04-07 14:55:43 +08:00
|
|
|
|
2014-09-10 18:43:56 +08:00
|
|
|
void drm_legacy_ioremap(struct drm_local_map *map, struct drm_device *dev)
|
2006-04-07 14:55:43 +08:00
|
|
|
{
|
2013-12-11 18:34:35 +08:00
|
|
|
if (dev->agp && dev->agp->cant_use_aperture && map->type == _DRM_AGP)
|
2007-01-08 18:56:59 +08:00
|
|
|
map->handle = agp_remap(map->offset, map->size, dev);
|
|
|
|
else
|
|
|
|
map->handle = ioremap(map->offset, map->size);
|
2006-04-07 14:55:43 +08:00
|
|
|
}
|
2014-09-10 18:43:56 +08:00
|
|
|
EXPORT_SYMBOL(drm_legacy_ioremap);
|
2006-04-07 14:55:43 +08:00
|
|
|
|
2014-09-10 18:43:56 +08:00
|
|
|
void drm_legacy_ioremap_wc(struct drm_local_map *map, struct drm_device *dev)
|
2008-07-15 13:48:05 +08:00
|
|
|
{
|
2013-12-11 18:34:35 +08:00
|
|
|
if (dev->agp && dev->agp->cant_use_aperture && map->type == _DRM_AGP)
|
2009-02-07 09:15:41 +08:00
|
|
|
map->handle = agp_remap(map->offset, map->size, dev);
|
|
|
|
else
|
|
|
|
map->handle = ioremap_wc(map->offset, map->size);
|
2008-07-15 13:48:05 +08:00
|
|
|
}
|
2014-09-10 18:43:56 +08:00
|
|
|
EXPORT_SYMBOL(drm_legacy_ioremap_wc);
|
2009-02-07 09:15:41 +08:00
|
|
|
|
2014-09-10 18:43:56 +08:00
|
|
|
void drm_legacy_ioremapfree(struct drm_local_map *map, struct drm_device *dev)
|
2006-04-07 14:55:43 +08:00
|
|
|
{
|
2007-01-08 18:56:59 +08:00
|
|
|
if (!map->handle || !map->size)
|
|
|
|
return;
|
|
|
|
|
2013-12-11 18:34:35 +08:00
|
|
|
if (dev->agp && dev->agp->cant_use_aperture && map->type == _DRM_AGP)
|
2007-01-08 18:56:59 +08:00
|
|
|
vunmap(map->handle);
|
|
|
|
else
|
|
|
|
iounmap(map->handle);
|
2006-04-07 14:55:43 +08:00
|
|
|
}
|
2014-09-10 18:43:56 +08:00
|
|
|
EXPORT_SYMBOL(drm_legacy_ioremapfree);
|
2018-02-09 10:44:08 +08:00
|
|
|
|
|
|
|
u64 drm_get_max_iomem(void)
|
|
|
|
{
|
|
|
|
struct resource *tmp;
|
2018-02-22 19:47:51 +08:00
|
|
|
resource_size_t max_iomem = 0;
|
2018-02-09 10:44:08 +08:00
|
|
|
|
|
|
|
for (tmp = iomem_resource.child; tmp; tmp = tmp->sibling) {
|
|
|
|
max_iomem = max(max_iomem, tmp->end);
|
|
|
|
}
|
|
|
|
|
|
|
|
return max_iomem;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(drm_get_max_iomem);
|