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

#include <common.h>
#include <dm.h>
#include <errno.h>
10
#include <linux/libfdt.h>
11 12 13
#include <malloc.h>
#include <mapmem.h>
#include <regmap.h>
14
#include <asm/io.h>
15 16
#include <dm/of_addr.h>
#include <linux/ioport.h>
17

18 19
DECLARE_GLOBAL_DATA_PTR;

20
static struct regmap *regmap_alloc(int count)
21 22 23
{
	struct regmap *map;

24
	map = malloc(sizeof(*map) + sizeof(map->ranges[0]) * count);
25 26 27 28 29 30 31
	if (!map)
		return NULL;
	map->range_count = count;

	return map;
}

32
#if CONFIG_IS_ENABLED(OF_PLATDATA)
33
int regmap_init_mem_platdata(struct udevice *dev, fdt_val_t *reg, int count,
34 35
			     struct regmap **mapp)
{
36 37 38
	struct regmap_range *range;
	struct regmap *map;

39
	map = regmap_alloc(count);
40 41 42
	if (!map)
		return -ENOMEM;

43
	for (range = map->ranges; count > 0; reg += 2, range++, count--) {
44 45 46 47 48 49
		range->start = *reg;
		range->size = reg[1];
	}

	*mapp = map;

50 51 52
	return 0;
}
#else
53
int regmap_init_mem(ofnode node, struct regmap **mapp)
54 55 56 57 58 59
{
	struct regmap_range *range;
	struct regmap *map;
	int count;
	int addr_len, size_len, both_len;
	int len;
60
	int index;
61
	struct resource r;
62

63 64
	addr_len = ofnode_read_simple_addr_cells(ofnode_get_parent(node));
	size_len = ofnode_read_simple_size_cells(ofnode_get_parent(node));
65 66
	both_len = addr_len + size_len;

67
	len = ofnode_read_size(node, "reg");
68 69 70
	if (len < 0)
		return len;
	len /= sizeof(fdt32_t);
71
	count = len / both_len;
72
	if (!count)
73 74
		return -EINVAL;

75
	map = regmap_alloc(count);
76 77 78
	if (!map)
		return -ENOMEM;

79
	for (range = map->ranges, index = 0; count > 0;
80
	     count--, range++, index++) {
81
		fdt_size_t sz;
82 83 84 85 86 87
		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,
88
					ofnode_to_offset(node), "reg", index,
89 90 91
					addr_len, size_len, &sz, true);
			range->size = sz;
		}
92 93 94 95 96 97
	}

	*mapp = map;

	return 0;
}
98
#endif
99 100 101 102 103 104 105

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

	if (range_num >= map->range_count)
		return NULL;
106
	range = &map->ranges[range_num];
107 108 109 110 111 112 113 114 115 116

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

int regmap_uninit(struct regmap *map)
{
	free(map);

	return 0;
}
117 118 119

int regmap_read(struct regmap *map, uint offset, uint *valp)
{
120
	u32 *ptr = map_physmem(map->ranges[0].start + offset, 4, MAP_NOCACHE);
121 122 123 124 125 126 127 128

	*valp = le32_to_cpu(readl(ptr));

	return 0;
}

int regmap_write(struct regmap *map, uint offset, uint val)
{
129
	u32 *ptr = map_physmem(map->ranges[0].start + offset, 4, MAP_NOCACHE);
130 131 132 133 134

	writel(cpu_to_le32(val), ptr);

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

int regmap_update_bits(struct regmap *map, uint offset, uint mask, uint val)
{
	uint reg;
	int ret;

	ret = regmap_read(map, offset, &reg);
	if (ret)
		return ret;

	reg &= ~mask;

	return regmap_write(map, offset, reg | val);
}