regmap.c 2.9 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14
/*
 * Copyright (c) 2015 Google, Inc
 * Written by Simon Glass <sjg@chromium.org>
 *
 * SPDX-License-Identifier:	GPL-2.0+
 */

#include <common.h>
#include <dm.h>
#include <errno.h>
#include <libfdt.h>
#include <malloc.h>
#include <mapmem.h>
#include <regmap.h>
15
#include <asm/io.h>
16 17
#include <dm/of_addr.h>
#include <linux/ioport.h>
18

19 20
DECLARE_GLOBAL_DATA_PTR;

21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41
static struct regmap *regmap_alloc_count(int count)
{
	struct regmap *map;

	map = malloc(sizeof(struct regmap));
	if (!map)
		return NULL;
	if (count <= 1) {
		map->range = &map->base_range;
	} else {
		map->range = malloc(count * sizeof(struct regmap_range));
		if (!map->range) {
			free(map);
			return NULL;
		}
	}
	map->range_count = count;

	return map;
}

42
#if CONFIG_IS_ENABLED(OF_PLATDATA)
43
int regmap_init_mem_platdata(struct udevice *dev, u32 *reg, int count,
44 45
			     struct regmap **mapp)
{
46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
	struct regmap_range *range;
	struct regmap *map;

	map = regmap_alloc_count(count);
	if (!map)
		return -ENOMEM;

	map->base = *reg;
	for (range = map->range; count > 0; reg += 2, range++, count--) {
		range->start = *reg;
		range->size = reg[1];
	}

	*mapp = map;

61 62 63
	return 0;
}
#else
64 65 66 67 68 69 70
int regmap_init_mem(struct udevice *dev, struct regmap **mapp)
{
	struct regmap_range *range;
	struct regmap *map;
	int count;
	int addr_len, size_len, both_len;
	int len;
71
	int index;
72 73
	ofnode node = dev_ofnode(dev);
	struct resource r;
74

75 76
	addr_len = dev_read_simple_addr_cells(dev->parent);
	size_len = dev_read_simple_size_cells(dev->parent);
77 78
	both_len = addr_len + size_len;

79 80 81 82
	len = dev_read_size(dev, "reg");
	if (len < 0)
		return len;
	len /= sizeof(fdt32_t);
83
	count = len / both_len;
84
	if (!count)
85 86
		return -EINVAL;

87
	map = regmap_alloc_count(count);
88 89 90
	if (!map)
		return -ENOMEM;

91
	for (range = map->range, index = 0; count > 0;
92
	     count--, range++, index++) {
93
		fdt_size_t sz;
94 95 96 97 98 99 100 101 102 103
		if (of_live_active()) {
			of_address_to_resource(ofnode_to_np(node), index, &r);
			range->start = r.start;
			range->size = r.end - r.start + 1;
		} else {
			range->start = fdtdec_get_addr_size_fixed(gd->fdt_blob,
					dev_of_offset(dev), "reg", index,
					addr_len, size_len, &sz, true);
			range->size = sz;
		}
104
	}
105
	map->base = map->range[0].start;
106 107 108 109 110

	*mapp = map;

	return 0;
}
111
#endif
112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131

void *regmap_get_range(struct regmap *map, unsigned int range_num)
{
	struct regmap_range *range;

	if (range_num >= map->range_count)
		return NULL;
	range = &map->range[range_num];

	return map_sysmem(range->start, range->size);
}

int regmap_uninit(struct regmap *map)
{
	if (map->range_count > 1)
		free(map->range);
	free(map);

	return 0;
}
132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149

int regmap_read(struct regmap *map, uint offset, uint *valp)
{
	uint32_t *ptr = map_physmem(map->base + offset, 4, MAP_NOCACHE);

	*valp = le32_to_cpu(readl(ptr));

	return 0;
}

int regmap_write(struct regmap *map, uint offset, uint val)
{
	uint32_t *ptr = map_physmem(map->base + offset, 4, MAP_NOCACHE);

	writel(cpu_to_le32(val), ptr);

	return 0;
}