blob: 582f14c5b6f23ae299b25b79fb786d0f7cb5b636 [file] [log] [blame]
Patrick Georgi55189c92020-05-10 20:09:31 +02001/* SPDX-License-Identifier: GPL-2.0-only */
Stefan Reinauer6540ae52007-07-12 16:35:42 +00002
3#include "common.h"
4#include "layout.h"
5#include "cmos_lowlevel.h"
6
7typedef struct cmos_entry_item_t cmos_entry_item_t;
8
Stefan Reinauer90b96b62010-01-13 21:00:23 +00009struct cmos_entry_item_t {
10 cmos_entry_t item;
11 cmos_entry_item_t *next;
12};
Stefan Reinauer6540ae52007-07-12 16:35:42 +000013
14typedef struct cmos_enum_item_t cmos_enum_item_t;
15
Stefan Reinauer90b96b62010-01-13 21:00:23 +000016struct cmos_enum_item_t {
17 cmos_enum_t item;
18 cmos_enum_item_t *next;
19};
Stefan Reinauer6540ae52007-07-12 16:35:42 +000020
Stefan Reinauer90b96b62010-01-13 21:00:23 +000021static void default_cmos_layout_get_fn(void);
22static int areas_overlap(unsigned area_0_start, unsigned area_0_length,
23 unsigned area_1_start, unsigned area_1_length);
24static int entries_overlap(const cmos_entry_t * p, const cmos_entry_t * q);
25static const cmos_enum_item_t *find_first_cmos_enum_id(unsigned config_id);
Stefan Reinauer6540ae52007-07-12 16:35:42 +000026
27const char checksum_param_name[] = "check_sum";
28
Stefan Reinauerf527e702008-01-18 15:33:49 +000029/* Newer versions of coreboot store the 3 pieces of information below in the
30 * coreboot table so we don't have to rely on hardcoded values.
Stefan Reinauer6540ae52007-07-12 16:35:42 +000031 */
32
33/* This is the offset from the start of CMOS of the first byte that the
34 * checksum is calculated over.
35 */
36#define CMOS_CHECKSUM_START 49
37
38/* This is the offset from the start of CMOS of the last byte that the
39 * checksum is calculated over.
40 */
41#define CMOS_CHECKSUM_END 125
42
Stefan Reinauerf527e702008-01-18 15:33:49 +000043/* This is the offset from the start of CMOS where the coreboot checksum is
Stefan Reinauer6540ae52007-07-12 16:35:42 +000044 * stored.
45 */
46#define CMOS_CHECKSUM_INDEX 126
47
48/* index of first byte of checksummed area */
49unsigned cmos_checksum_start = CMOS_CHECKSUM_START;
50
51/* index of last byte of checksummed area */
52unsigned cmos_checksum_end = CMOS_CHECKSUM_END;
53
54/* index of first byte of CMOS checksum (a big-endian 16-bit value) */
55unsigned cmos_checksum_index = CMOS_CHECKSUM_INDEX;
56
57/* List is sorted in ascending order according to 'bit' field in
58 * cmos_entry_t.
59 */
60static cmos_entry_item_t *cmos_entry_list = NULL;
61
62/* List is sorted in ascending order: first by 'config_id' and then by
63 * 'value'.
64 */
65static cmos_enum_item_t *cmos_enum_list = NULL;
66
67static cmos_layout_get_fn_t cmos_layout_get_fn = default_cmos_layout_get_fn;
68
69/****************************************************************************
70 * entries_overlap
71 *
Elyes HAOUAS2119d0b2020-02-16 10:01:33 +010072 * Return 1 if CMOS entries 'p' and 'q' overlap. Else return 0.
Stefan Reinauer6540ae52007-07-12 16:35:42 +000073 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +000074static inline int entries_overlap(const cmos_entry_t * p,
75 const cmos_entry_t * q)
76{
77 return areas_overlap(p->bit, p->length, q->bit, q->length);
78}
Stefan Reinauer6540ae52007-07-12 16:35:42 +000079
80/****************************************************************************
81 * cmos_entry_to_const_item
82 *
83 * Return a pointer to the cmos_entry_item_t that 'p' is embedded within.
84 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +000085static inline const cmos_entry_item_t *cmos_entry_to_const_item
86 (const cmos_entry_t * p) {
87 static const cmos_entry_t *pos = &((cmos_entry_item_t *) 0)->item;
88 unsigned long offset, address;
Stefan Reinauer6540ae52007-07-12 16:35:42 +000089
Stefan Reinauer90b96b62010-01-13 21:00:23 +000090 offset = (unsigned long)pos;
91 address = ((unsigned long)p) - offset;
92 return (const cmos_entry_item_t *)address;
93}
Stefan Reinauer6540ae52007-07-12 16:35:42 +000094
95/****************************************************************************
96 * cmos_enum_to_const_item
97 *
98 * Return a pointer to the cmos_enum_item_t that 'p' is embedded within.
99 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000100static inline const cmos_enum_item_t *cmos_enum_to_const_item
101 (const cmos_enum_t * p) {
102 static const cmos_enum_t *pos = &((cmos_enum_item_t *) 0)->item;
103 unsigned long offset, address;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000104
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000105 offset = (unsigned long)pos;
106 address = ((unsigned long)p) - offset;
107 return (const cmos_enum_item_t *)address;
108}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000109
110/****************************************************************************
111 * register_cmos_layout_get_fn
112 *
113 * Set 'fn' as the function that will be called to retrieve CMOS layout
114 * information.
115 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000116void register_cmos_layout_get_fn(cmos_layout_get_fn_t fn)
117{
118 cmos_layout_get_fn = fn;
119}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000120
121/****************************************************************************
122 * get_cmos_layout
123 *
124 * Retrieve CMOS layout information and store it in our internal repository.
125 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000126void get_cmos_layout(void)
127{
128 cmos_layout_get_fn();
129}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000130
131/****************************************************************************
132 * add_cmos_entry
133 *
134 * Attempt to add CMOS entry 'e' to our internal repository of layout
135 * information. Return OK on success or an error code on failure. If
136 * operation fails because 'e' overlaps an existing CMOS entry, '*conflict'
137 * will be set to point to the overlapping entry.
138 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000139int add_cmos_entry(const cmos_entry_t * e, const cmos_entry_t ** conflict)
140{
141 cmos_entry_item_t *item, *prev, *new_entry;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000142
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000143 *conflict = NULL;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000144
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000145 if (e->length < 1)
146 return LAYOUT_ENTRY_BAD_LENGTH;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000147
Nico Huber3af69852017-01-26 23:22:46 +0100148 if (e->bit % 8 && e->bit / 8 != (e->bit + e->length - 1) / 8)
149 return LAYOUT_MULTIBYTE_ENTRY_NOT_ALIGNED;
150
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000151 if ((new_entry =
152 (cmos_entry_item_t *) malloc(sizeof(*new_entry))) == NULL)
153 out_of_memory();
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000154
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000155 new_entry->item = *e;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000156
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000157 if (cmos_entry_list == NULL) {
158 new_entry->next = NULL;
159 cmos_entry_list = new_entry;
160 return OK;
161 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000162
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000163 /* Find place in list to insert new entry. List is sorted in ascending
164 * order.
165 */
166 for (item = cmos_entry_list, prev = NULL;
167 (item != NULL) && (item->item.bit < e->bit);
168 prev = item, item = item->next) ;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000169
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000170 if (prev == NULL) {
171 if (entries_overlap(e, &cmos_entry_list->item)) {
172 *conflict = &cmos_entry_list->item;
173 goto fail;
174 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000175
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000176 new_entry->next = cmos_entry_list;
177 cmos_entry_list = new_entry;
178 return OK;
179 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000180
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000181 if (entries_overlap(&prev->item, e)) {
182 *conflict = &prev->item;
183 goto fail;
184 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000185
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000186 if ((item != NULL) && entries_overlap(e, &item->item)) {
187 *conflict = &item->item;
188 goto fail;
189 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000190
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000191 new_entry->next = item;
192 prev->next = new_entry;
193 return OK;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000194
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000195 fail:
196 free(new_entry);
197 return LAYOUT_ENTRY_OVERLAP;
198}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000199
200/****************************************************************************
201 * find_cmos_entry
202 *
203 * Search for a CMOS entry whose name is 'name'. Return pointer to matching
204 * entry or NULL if entry not found.
205 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000206const cmos_entry_t *find_cmos_entry(const char name[])
207{
208 cmos_entry_item_t *item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000209
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000210 for (item = cmos_entry_list; item != NULL; item = item->next) {
211 if (!strcmp(item->item.name, name))
212 return &item->item;
213 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000214
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000215 return NULL;
216}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000217
218/****************************************************************************
219 * first_cmos_entry
220 *
221 * Return a pointer to the first CMOS entry in our list or NULL if list is
222 * empty.
223 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000224const cmos_entry_t *first_cmos_entry(void)
225{
226 return (cmos_entry_list == NULL) ? NULL : &cmos_entry_list->item;
227}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000228
229/****************************************************************************
230 * next_cmos_entry
231 *
232 * Return a pointer to next entry in list after 'last' or NULL if no more
233 * entries.
234 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000235const cmos_entry_t *next_cmos_entry(const cmos_entry_t * last)
236{
237 const cmos_entry_item_t *last_item, *next_item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000238
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000239 last_item = cmos_entry_to_const_item(last);
240 next_item = last_item->next;
241 return (next_item == NULL) ? NULL : &next_item->item;
242}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000243
244/****************************************************************************
245 * add_cmos_enum
246 *
247 * Attempt to add CMOS enum 'e' to our internal repository of layout
248 * information. Return OK on success or an error code on failure.
249 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000250int add_cmos_enum(const cmos_enum_t * e)
251{
252 cmos_enum_item_t *item, *prev, *new_enum;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000253
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000254 if ((new_enum = (cmos_enum_item_t *) malloc(sizeof(*new_enum))) == NULL)
255 out_of_memory();
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000256
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000257 new_enum->item = *e;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000258
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000259 if (cmos_enum_list == NULL) {
260 new_enum->next = NULL;
261 cmos_enum_list = new_enum;
262 return OK;
263 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000264
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000265 /* The list of enums is sorted in ascending order, first by
266 * 'config_id' and then by 'value'. Look for the first enum
267 * whose 'config_id' field matches 'e'.
268 */
269 for (item = cmos_enum_list, prev = NULL;
270 (item != NULL) && (item->item.config_id < e->config_id);
271 prev = item, item = item->next) ;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000272
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000273 if (item == NULL) {
274 new_enum->next = NULL;
275 prev->next = new_enum;
276 return OK;
277 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000278
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000279 if (item->item.config_id > e->config_id) {
280 new_enum->next = item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000281
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000282 if (prev == NULL)
283 cmos_enum_list = new_enum;
284 else
285 prev->next = new_enum;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000286
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000287 return OK;
288 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000289
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000290 /* List already contains at least one enum whose 'config_id'
291 * matches 'e'. Now find proper place to insert 'e' based on
292 * 'value'.
293 */
294 while (item->item.value < e->value) {
295 prev = item;
296 item = item->next;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000297
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000298 if ((item == NULL) || (item->item.config_id != e->config_id)) {
299 new_enum->next = item;
300 prev->next = new_enum;
301 return OK;
302 }
303 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000304
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000305 if (item->item.value == e->value) {
306 free(new_enum);
307 return LAYOUT_DUPLICATE_ENUM;
308 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000309
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000310 new_enum->next = item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000311
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000312 if (prev == NULL)
313 cmos_enum_list = new_enum;
314 else
315 prev->next = new_enum;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000316
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000317 return OK;
318}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000319
320/****************************************************************************
321 * find_cmos_enum
322 *
323 * Search for an enum that matches 'config_id' and 'value'. If found, return
324 * a pointer to the mathcing enum. Else return NULL.
325 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000326const cmos_enum_t *find_cmos_enum(unsigned config_id, unsigned long long value)
327{
328 const cmos_enum_item_t *item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000329
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000330 if ((item = find_first_cmos_enum_id(config_id)) == NULL)
331 return NULL;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000332
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000333 while (item->item.value < value) {
334 item = item->next;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000335
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000336 if ((item == NULL) || (item->item.config_id != config_id))
337 return NULL;
338 }
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000339
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000340 return (item->item.value == value) ? &item->item : NULL;
341}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000342
343/****************************************************************************
344 * first_cmos_enum
345 *
346 * Return a pointer to the first CMOS enum in our list or NULL if list is
347 * empty.
348 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000349const cmos_enum_t *first_cmos_enum(void)
350{
351 return (cmos_enum_list == NULL) ? NULL : &cmos_enum_list->item;
352}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000353
354/****************************************************************************
355 * next_cmos_enum
356 *
357 * Return a pointer to next enum in list after 'last' or NULL if no more
358 * enums.
359 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000360const cmos_enum_t *next_cmos_enum(const cmos_enum_t * last)
361{
362 const cmos_enum_item_t *last_item, *next_item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000363
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000364 last_item = cmos_enum_to_const_item(last);
365 next_item = last_item->next;
366 return (next_item == NULL) ? NULL : &next_item->item;
367}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000368
369/****************************************************************************
370 * first_cmos_enum_id
371 *
372 * Return a pointer to the first CMOS enum in our list that matches
373 * 'config_id' or NULL if there are no matching enums.
374 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000375const cmos_enum_t *first_cmos_enum_id(unsigned config_id)
376{
377 const cmos_enum_item_t *item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000378
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000379 item = find_first_cmos_enum_id(config_id);
380 return (item == NULL) ? NULL : &item->item;
381}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000382
383/****************************************************************************
384 * next_cmos_enum_id
385 *
386 * Return a pointer to next enum in list after 'last' that matches the
387 * 'config_id' field of 'last' or NULL if there are no more matching enums.
388 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000389const cmos_enum_t *next_cmos_enum_id(const cmos_enum_t * last)
390{
391 const cmos_enum_item_t *item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000392
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000393 item = cmos_enum_to_const_item(last)->next;
394 return ((item == NULL) || (item->item.config_id != last->config_id)) ?
395 NULL : &item->item;
396}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000397
398/****************************************************************************
399 * is_checksum_name
400 *
401 * Return 1 if 'name' matches the name of the parameter representing the CMOS
402 * checksum. Else return 0.
403 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000404int is_checksum_name(const char name[])
405{
406 return !strcmp(name, checksum_param_name);
407}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000408
409/****************************************************************************
410 * checksum_layout_to_bytes
411 *
412 * On entry, '*layout' contains checksum-related layout information expressed
413 * in bits. Perform sanity checking on the information and convert it from
414 * bit positions to byte positions. Return OK on success or an error code if
415 * a sanity check fails.
416 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000417int checksum_layout_to_bytes(cmos_checksum_layout_t * layout)
418{
419 unsigned start, end, index;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000420
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000421 start = layout->summed_area_start;
422 end = layout->summed_area_end;
423 index = layout->checksum_at;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000424
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000425 if (start % 8)
426 return LAYOUT_SUMMED_AREA_START_NOT_ALIGNED;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000427
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000428 if ((end % 8) != 7)
429 return LAYOUT_SUMMED_AREA_END_NOT_ALIGNED;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000430
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000431 if (index % 8)
432 return LAYOUT_CHECKSUM_LOCATION_NOT_ALIGNED;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000433
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000434 if (end <= start)
435 return LAYOUT_INVALID_SUMMED_AREA;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000436
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000437 /* Convert bit positions to byte positions. */
438 start /= 8;
439 end /= 8; /* equivalent to "end = ((end - 7) / 8)" */
440 index /= 8;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000441
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000442 if (verify_cmos_byte_index(start) || verify_cmos_byte_index(end))
443 return LAYOUT_SUMMED_AREA_OUT_OF_RANGE;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000444
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000445 if (verify_cmos_byte_index(index))
446 return LAYOUT_CHECKSUM_LOCATION_OUT_OF_RANGE;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000447
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000448 /* checksum occupies 16 bits */
449 if (areas_overlap(start, end - start + 1, index, index + 1))
450 return LAYOUT_CHECKSUM_OVERLAPS_SUMMED_AREA;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000451
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000452 layout->summed_area_start = start;
453 layout->summed_area_end = end;
454 layout->checksum_at = index;
455 return OK;
456}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000457
458/****************************************************************************
459 * checksum_layout_to_bits
460 *
461 * On entry, '*layout' contains checksum-related layout information expressed
462 * in bytes. Convert this information to bit positions.
463 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000464void checksum_layout_to_bits(cmos_checksum_layout_t * layout)
465{
466 layout->summed_area_start *= 8;
467 layout->summed_area_end = (layout->summed_area_end * 8) + 7;
468 layout->checksum_at *= 8;
469}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000470
471/****************************************************************************
472 * default_cmos_layout_get_fn
473 *
474 * If this function is ever called, it means that an appropriate callback for
475 * obtaining CMOS layout information was not set before attempting to
476 * retrieve layout information.
477 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000478static void default_cmos_layout_get_fn(void)
479{
480 BUG();
481}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000482
483/****************************************************************************
484 * areas_overlap
485 *
486 * Return 1 if the two given areas overlap. Else return 0.
487 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000488static int areas_overlap(unsigned area_0_start, unsigned area_0_length,
489 unsigned area_1_start, unsigned area_1_length)
490{
491 unsigned area_0_end, area_1_end;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000492
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000493 area_0_end = area_0_start + area_0_length - 1;
494 area_1_end = area_1_start + area_1_length - 1;
495 return ((area_1_start <= area_0_end) && (area_0_start <= area_1_end));
496}
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000497
498/****************************************************************************
499 * find_first_cmos_enum_id
500 *
501 * Return a pointer to the first item in our list of enums that matches
502 * 'config_id'. Return NULL if there is no matching enum.
503 ****************************************************************************/
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000504static const cmos_enum_item_t *find_first_cmos_enum_id(unsigned config_id)
505{
506 cmos_enum_item_t *item;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000507
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000508 for (item = cmos_enum_list;
509 (item != NULL) && (item->item.config_id < config_id);
510 item = item->next) ;
Stefan Reinauer6540ae52007-07-12 16:35:42 +0000511
Stefan Reinauer90b96b62010-01-13 21:00:23 +0000512 return ((item == NULL) || (item->item.config_id > config_id)) ?
513 NULL : item;
514}