xsk: Add overflow check for u64 division, stored into u32
[linux/fpc-iii.git] / drivers / fmc / fru-parse.c
blobeb21480d399f4fe7cf98ecdba89d9cfcf2e8bb16
1 /*
2 * Copyright (C) 2012 CERN (www.cern.ch)
3 * Author: Alessandro Rubini <rubini@gnudd.com>
5 * Released according to the GNU GPL, version 2 or any later version.
7 * This work is part of the White Rabbit project, a research effort led
8 * by CERN, the European Institute for Nuclear Research.
9 */
10 #include <linux/ipmi-fru.h>
12 /* Some internal helpers */
13 static struct fru_type_length *
14 __fru_get_board_tl(struct fru_common_header *header, int nr)
16 struct fru_board_info_area *bia;
17 struct fru_type_length *tl;
19 bia = fru_get_board_area(header);
20 tl = bia->tl;
21 while (nr > 0 && !fru_is_eof(tl)) {
22 tl = fru_next_tl(tl);
23 nr--;
25 if (fru_is_eof(tl))
26 return NULL;
27 return tl;
30 static char *__fru_alloc_get_tl(struct fru_common_header *header, int nr)
32 struct fru_type_length *tl;
33 char *res;
35 tl = __fru_get_board_tl(header, nr);
36 if (!tl)
37 return NULL;
39 res = fru_alloc(fru_strlen(tl) + 1);
40 if (!res)
41 return NULL;
42 return fru_strcpy(res, tl);
45 /* Public checksum verifiers */
46 int fru_header_cksum_ok(struct fru_common_header *header)
48 uint8_t *ptr = (void *)header;
49 int i, sum;
51 for (i = sum = 0; i < sizeof(*header); i++)
52 sum += ptr[i];
53 return (sum & 0xff) == 0;
55 int fru_bia_cksum_ok(struct fru_board_info_area *bia)
57 uint8_t *ptr = (void *)bia;
58 int i, sum;
60 for (i = sum = 0; i < 8 * bia->area_len; i++)
61 sum += ptr[i];
62 return (sum & 0xff) == 0;
65 /* Get various stuff, trivial */
66 char *fru_get_board_manufacturer(struct fru_common_header *header)
68 return __fru_alloc_get_tl(header, 0);
70 char *fru_get_product_name(struct fru_common_header *header)
72 return __fru_alloc_get_tl(header, 1);
74 char *fru_get_serial_number(struct fru_common_header *header)
76 return __fru_alloc_get_tl(header, 2);
78 char *fru_get_part_number(struct fru_common_header *header)
80 return __fru_alloc_get_tl(header, 3);