mirror of
				https://github.com/torvalds/linux.git
				synced 2025-11-04 10:40:15 +02:00 
			
		
		
		
	- add a test to check the range allocation - export get_buddy() function in drm_buddy.c - export drm_prandom_u32_max_state() in lib/drm_random.c - include helper functions - include prime number header file v2: - add drm_get_buddy() function description (Matthew Auld) - removed unnecessary test succeeded print Signed-off-by: Arunpravin <Arunpravin.PaneerSelvam@amd.com> Reviewed-by: Matthew Auld <matthew.auld@intel.com> Acked-by: Christian König <christian.koenig@amd.com> Link: https://patchwork.freedesktop.org/patch/msgid/20220222174845.2175-3-Arunpravin.PaneerSelvam@amd.com Signed-off-by: Christian König <christian.koenig@amd.com>
		
			
				
	
	
		
			43 lines
		
	
	
	
		
			1,010 B
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			43 lines
		
	
	
	
		
			1,010 B
		
	
	
	
		
			C
		
	
	
	
	
	
// SPDX-License-Identifier: GPL-2.0
 | 
						|
#include <linux/bitops.h>
 | 
						|
#include <linux/kernel.h>
 | 
						|
#include <linux/random.h>
 | 
						|
#include <linux/slab.h>
 | 
						|
#include <linux/types.h>
 | 
						|
 | 
						|
#include "drm_random.h"
 | 
						|
 | 
						|
u32 drm_prandom_u32_max_state(u32 ep_ro, struct rnd_state *state)
 | 
						|
{
 | 
						|
	return upper_32_bits((u64)prandom_u32_state(state) * ep_ro);
 | 
						|
}
 | 
						|
EXPORT_SYMBOL(drm_prandom_u32_max_state);
 | 
						|
 | 
						|
void drm_random_reorder(unsigned int *order, unsigned int count,
 | 
						|
			struct rnd_state *state)
 | 
						|
{
 | 
						|
	unsigned int i, j;
 | 
						|
 | 
						|
	for (i = 0; i < count; ++i) {
 | 
						|
		BUILD_BUG_ON(sizeof(unsigned int) > sizeof(u32));
 | 
						|
		j = drm_prandom_u32_max_state(count, state);
 | 
						|
		swap(order[i], order[j]);
 | 
						|
	}
 | 
						|
}
 | 
						|
EXPORT_SYMBOL(drm_random_reorder);
 | 
						|
 | 
						|
unsigned int *drm_random_order(unsigned int count, struct rnd_state *state)
 | 
						|
{
 | 
						|
	unsigned int *order, i;
 | 
						|
 | 
						|
	order = kmalloc_array(count, sizeof(*order), GFP_KERNEL);
 | 
						|
	if (!order)
 | 
						|
		return order;
 | 
						|
 | 
						|
	for (i = 0; i < count; i++)
 | 
						|
		order[i] = i;
 | 
						|
 | 
						|
	drm_random_reorder(order, count, state);
 | 
						|
	return order;
 | 
						|
}
 | 
						|
EXPORT_SYMBOL(drm_random_order);
 |