1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
// SPDX-License-Identifier: GPL-2.0+
/*
* Copyright (c) 2021 Linaro Limited
* Author: AKASHI Takahiro
*/
#include <malloc.h>
#include <asm/global_data.h>
#include <dm/root.h>
#include <dm/tag.h>
#include <linux/err.h>
#include <linux/list.h>
#include <linux/types.h>
struct udevice;
DECLARE_GLOBAL_DATA_PTR;
int dev_tag_set_ptr(struct udevice *dev, enum dm_tag_t tag, void *ptr)
{
struct dmtag_node *node;
if (!dev || tag >= DM_TAG_COUNT)
return -EINVAL;
list_for_each_entry(node, &gd->dmtag_list, sibling) {
if (node->dev == dev && node->tag == tag)
return -EEXIST;
}
node = calloc(sizeof(*node), 1);
if (!node)
return -ENOMEM;
node->dev = dev;
node->tag = tag;
node->ptr = ptr;
list_add_tail(&node->sibling, (struct list_head *)&gd->dmtag_list);
return 0;
}
int dev_tag_set_val(struct udevice *dev, enum dm_tag_t tag, ulong val)
{
struct dmtag_node *node;
if (!dev || tag >= DM_TAG_COUNT)
return -EINVAL;
list_for_each_entry(node, &gd->dmtag_list, sibling) {
if (node->dev == dev && node->tag == tag)
return -EEXIST;
}
node = calloc(sizeof(*node), 1);
if (!node)
return -ENOMEM;
node->dev = dev;
node->tag = tag;
node->val = val;
list_add_tail(&node->sibling, (struct list_head *)&gd->dmtag_list);
return 0;
}
int dev_tag_get_ptr(struct udevice *dev, enum dm_tag_t tag, void **ptrp)
{
struct dmtag_node *node;
if (!dev || tag >= DM_TAG_COUNT)
return -EINVAL;
list_for_each_entry(node, &gd->dmtag_list, sibling) {
if (node->dev == dev && node->tag == tag) {
*ptrp = node->ptr;
return 0;
}
}
return -ENOENT;
}
int dev_tag_get_val(struct udevice *dev, enum dm_tag_t tag, ulong *valp)
{
struct dmtag_node *node;
if (!dev || tag >= DM_TAG_COUNT)
return -EINVAL;
list_for_each_entry(node, &gd->dmtag_list, sibling) {
if (node->dev == dev && node->tag == tag) {
*valp = node->val;
return 0;
}
}
return -ENOENT;
}
int dev_tag_del(struct udevice *dev, enum dm_tag_t tag)
{
struct dmtag_node *node, *tmp;
if (!dev || tag >= DM_TAG_COUNT)
return -EINVAL;
list_for_each_entry_safe(node, tmp, &gd->dmtag_list, sibling) {
if (node->dev == dev && node->tag == tag) {
list_del(&node->sibling);
free(node);
return 0;
}
}
return -ENOENT;
}
int dev_tag_del_all(struct udevice *dev)
{
struct dmtag_node *node, *tmp;
bool found = false;
if (!dev)
return -EINVAL;
list_for_each_entry_safe(node, tmp, &gd->dmtag_list, sibling) {
if (node->dev == dev) {
list_del(&node->sibling);
free(node);
found = true;
}
}
if (found)
return 0;
return -ENOENT;
}
void dev_tag_collect_stats(struct dm_stats *stats)
{
struct dmtag_node *node;
list_for_each_entry(node, &gd->dmtag_list, sibling) {
stats->tag_count++;
stats->tag_size += sizeof(struct dmtag_node);
}
}
|
