[deliverable/linux.git] / net / ceph / crush / crush.c


#ifdef __KERNEL__
# include <linux/slab.h>
#else
# include <stdlib.h>
# include <assert.h>
# define kfree(x) do { if (x) free(x); } while (0)
# define BUG_ON(x) assert(!(x))
#endif

#include <linux/crush/crush.h>

const char *crush_bucket_alg_name(int alg)
{
	switch (alg) {
	case CRUSH_BUCKET_UNIFORM: return "uniform";
	case CRUSH_BUCKET_LIST: return "list";
	case CRUSH_BUCKET_TREE: return "tree";
	case CRUSH_BUCKET_STRAW: return "straw";
	default: return "unknown";
	}
}

/**
 * crush_get_bucket_item_weight - Get weight of an item in given bucket
 * @b: bucket pointer
 * @p: item index in bucket
 */
int crush_get_bucket_item_weight(const struct crush_bucket *b, int p)
{
	if ((__u32)p >= b->size)
		return 0;

	switch (b->alg) {
	case CRUSH_BUCKET_UNIFORM:
		return ((struct crush_bucket_uniform *)b)->item_weight;
	case CRUSH_BUCKET_LIST:
		return ((struct crush_bucket_list *)b)->item_weights[p];
	case CRUSH_BUCKET_TREE:
		return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)];
	case CRUSH_BUCKET_STRAW:
		return ((struct crush_bucket_straw *)b)->item_weights[p];
	}
	return 0;
}

void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
{
	kfree(b->h.perm);
	kfree(b->h.items);
	kfree(b);
}

void crush_destroy_bucket_list(struct crush_bucket_list *b)
{
	kfree(b->item_weights);
	kfree(b->sum_weights);
	kfree(b->h.perm);
	kfree(b->h.items);
	kfree(b);
}

void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
{
	kfree(b->h.perm);
	kfree(b->h.items);
	kfree(b->node_weights);
	kfree(b);
}

void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
{
	kfree(b->straws);
	kfree(b->item_weights);
	kfree(b->h.perm);
	kfree(b->h.items);
	kfree(b);
}

void crush_destroy_bucket(struct crush_bucket *b)
{
	switch (b->alg) {
	case CRUSH_BUCKET_UNIFORM:
		crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
		break;
	case CRUSH_BUCKET_LIST:
		crush_destroy_bucket_list((struct crush_bucket_list *)b);
		break;
	case CRUSH_BUCKET_TREE:
		crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
		break;
	case CRUSH_BUCKET_STRAW:
		crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
		break;
	}
}

/**
 * crush_destroy - Destroy a crush_map
 * @map: crush_map pointer
 */
void crush_destroy(struct crush_map *map)
{
	/* buckets */
	if (map->buckets) {
		__s32 b;
		for (b = 0; b < map->max_buckets; b++) {
			if (map->buckets[b] == NULL)
				continue;
			crush_destroy_bucket(map->buckets[b]);
		}
		kfree(map->buckets);
	}

	/* rules */
	if (map->rules) {
		__u32 b;
		for (b = 0; b < map->max_rules; b++)
			kfree(map->rules[b]);
		kfree(map->rules);
	}

	kfree(map);
}
Commit	Line	Data
5ecc0a0f SW	1
	2	#ifdef __KERNEL__
	3	# include <linux/slab.h>
	4	#else
	5	# include <stdlib.h>
	6	# include <assert.h>
	7	# define kfree(x) do { if (x) free(x); } while (0)
	8	# define BUG_ON(x) assert(!(x))
	9	#endif
	10
3d14c5d2	11	#include <linux/crush/crush.h>
5ecc0a0f	12
c6cf7263 SW	13	const char *crush_bucket_alg_name(int alg)
	14	{
	15	switch (alg) {
	16	case CRUSH_BUCKET_UNIFORM: return "uniform";
	17	case CRUSH_BUCKET_LIST: return "list";
	18	case CRUSH_BUCKET_TREE: return "tree";
	19	case CRUSH_BUCKET_STRAW: return "straw";
	20	default: return "unknown";
	21	}
	22	}
	23
5ecc0a0f SW	24	/**
	25	* crush_get_bucket_item_weight - Get weight of an item in given bucket
	26	* @b: bucket pointer
	27	* @p: item index in bucket
	28	*/
8b12d47b	29	int crush_get_bucket_item_weight(const struct crush_bucket *b, int p)
5ecc0a0f	30	{
8b12d47b	31	if ((__u32)p >= b->size)
5ecc0a0f SW	32	return 0;
	33
	34	switch (b->alg) {
	35	case CRUSH_BUCKET_UNIFORM:
	36	return ((struct crush_bucket_uniform *)b)->item_weight;
	37	case CRUSH_BUCKET_LIST:
	38	return ((struct crush_bucket_list *)b)->item_weights[p];
	39	case CRUSH_BUCKET_TREE:
f671d4cd	40	return ((struct crush_bucket_tree *)b)->node_weights[crush_calc_tree_node(p)];
5ecc0a0f SW	41	case CRUSH_BUCKET_STRAW:
	42	return ((struct crush_bucket_straw *)b)->item_weights[p];
	43	}
	44	return 0;
	45	}
	46
5ecc0a0f SW	47	void crush_destroy_bucket_uniform(struct crush_bucket_uniform *b)
	48	{
	49	kfree(b->h.perm);
	50	kfree(b->h.items);
	51	kfree(b);
	52	}
	53
	54	void crush_destroy_bucket_list(struct crush_bucket_list *b)
	55	{
	56	kfree(b->item_weights);
	57	kfree(b->sum_weights);
	58	kfree(b->h.perm);
	59	kfree(b->h.items);
	60	kfree(b);
	61	}
	62
	63	void crush_destroy_bucket_tree(struct crush_bucket_tree *b)
	64	{
6eb43f4b SW	65	kfree(b->h.perm);
6eb43f4b SW	66	kfree(b->h.items);
5ecc0a0f SW	67	kfree(b->node_weights);
	68	kfree(b);
	69	}
	70
	71	void crush_destroy_bucket_straw(struct crush_bucket_straw *b)
	72	{
	73	kfree(b->straws);
	74	kfree(b->item_weights);
	75	kfree(b->h.perm);
	76	kfree(b->h.items);
	77	kfree(b);
	78	}
	79
	80	void crush_destroy_bucket(struct crush_bucket *b)
	81	{
	82	switch (b->alg) {
	83	case CRUSH_BUCKET_UNIFORM:
	84	crush_destroy_bucket_uniform((struct crush_bucket_uniform *)b);
	85	break;
	86	case CRUSH_BUCKET_LIST:
	87	crush_destroy_bucket_list((struct crush_bucket_list *)b);
	88	break;
	89	case CRUSH_BUCKET_TREE:
	90	crush_destroy_bucket_tree((struct crush_bucket_tree *)b);
	91	break;
	92	case CRUSH_BUCKET_STRAW:
	93	crush_destroy_bucket_straw((struct crush_bucket_straw *)b);
	94	break;
	95	}
	96	}
	97
	98	/**
	99	* crush_destroy - Destroy a crush_map
	100	* @map: crush_map pointer
	101	*/
	102	void crush_destroy(struct crush_map *map)
	103	{
5ecc0a0f SW	104	/* buckets */
5ecc0a0f SW	105	if (map->buckets) {
8b12d47b	106	__s32 b;
5ecc0a0f SW	107	for (b = 0; b < map->max_buckets; b++) {
	108	if (map->buckets[b] == NULL)
	109	continue;
	110	crush_destroy_bucket(map->buckets[b]);
	111	}
	112	kfree(map->buckets);
	113	}
	114
	115	/* rules */
	116	if (map->rules) {
8b12d47b	117	__u32 b;
5ecc0a0f SW	118	for (b = 0; b < map->max_rules; b++)
	119	kfree(map->rules[b]);
	120	kfree(map->rules);
	121	}
	122
5ecc0a0f SW	123	kfree(map);
	124	}
	125
	126