regmap.c 3.0 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;

M
Mario Six 已提交
20 21 22 23 24 25
/**
 * regmap_alloc() - Allocate a regmap with a given number of ranges.
 *
 * @count: Number of ranges to be allocated for the regmap.
 * Return: A pointer to the newly allocated regmap, or NULL on error.
 */
26
static struct regmap *regmap_alloc(int count)
27 28 29
{
	struct regmap *map;

30
	map = malloc(sizeof(*map) + sizeof(map->ranges[0]) * count);
31 32 33 34 35 36 37
	if (!map)
		return NULL;
	map->range_count = count;

	return map;
}

38
#if CONFIG_IS_ENABLED(OF_PLATDATA)
39
int regmap_init_mem_platdata(struct udevice *dev, fdt_val_t *reg, int count,
40 41
			     struct regmap **mapp)
{
42 43 44
	struct regmap_range *range;
	struct regmap *map;

45
	map = regmap_alloc(count);
46 47 48
	if (!map)
		return -ENOMEM;

49
	for (range = map->ranges; count > 0; reg += 2, range++, count--) {
50 51 52 53 54 55
		range->start = *reg;
		range->size = reg[1];
	}

	*mapp = map;

56 57 58
	return 0;
}
#else
59
int regmap_init_mem(ofnode node, struct regmap **mapp)
60 61 62 63 64 65
{
	struct regmap_range *range;
	struct regmap *map;
	int count;
	int addr_len, size_len, both_len;
	int len;
66
	int index;
67
	struct resource r;
68

69 70
	addr_len = ofnode_read_simple_addr_cells(ofnode_get_parent(node));
	size_len = ofnode_read_simple_size_cells(ofnode_get_parent(node));
71 72
	both_len = addr_len + size_len;

73
	len = ofnode_read_size(node, "reg");
74 75 76
	if (len < 0)
		return len;
	len /= sizeof(fdt32_t);
77
	count = len / both_len;
78
	if (!count)
79 80
		return -EINVAL;

81
	map = regmap_alloc(count);
82 83 84
	if (!map)
		return -ENOMEM;

85
	for (range = map->ranges, index = 0; count > 0;
86
	     count--, range++, index++) {
87
		fdt_size_t sz;
88 89 90 91 92 93
		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,
94
					ofnode_to_offset(node), "reg", index,
95 96 97
					addr_len, size_len, &sz, true);
			range->size = sz;
		}
98 99 100 101 102 103
	}

	*mapp = map;

	return 0;
}
104
#endif
105 106 107 108 109 110 111

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

	if (range_num >= map->range_count)
		return NULL;
112
	range = &map->ranges[range_num];
113 114 115 116 117 118 119 120 121 122

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

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

	return 0;
}
123 124 125

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

	*valp = le32_to_cpu(readl(ptr));

	return 0;
}

int regmap_write(struct regmap *map, uint offset, uint val)
{
135
	u32 *ptr = map_physmem(map->ranges[0].start + offset, 4, MAP_NOCACHE);
136 137 138 139 140

	writel(cpu_to_le32(val), ptr);

	return 0;
}
141 142 143 144 145 146 147 148 149 150 151 152 153 154

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);
}