^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 1) // SPDX-License-Identifier: GPL-2.0-or-later
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 2) /*
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 3) * (C) Copyright David Gibson <dwg@au1.ibm.com>, IBM Corporation. 2005.
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 4) */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 5)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 6) #include "dtc.h"
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 7)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 8) void data_free(struct data d)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 9) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 10) struct marker *m, *nm;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 11)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 12) m = d.markers;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 13) while (m) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 14) nm = m->next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 15) free(m->ref);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 16) free(m);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 17) m = nm;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 18) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 19)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 20) if (d.val)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 21) free(d.val);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 22) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 23)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 24) struct data data_grow_for(struct data d, unsigned int xlen)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 25) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 26) struct data nd;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 27) unsigned int newsize;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 28)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 29) if (xlen == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 30) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 31)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 32) nd = d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 33)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 34) newsize = xlen;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 35)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 36) while ((d.len + xlen) > newsize)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 37) newsize *= 2;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 38)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 39) nd.val = xrealloc(d.val, newsize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 40)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 41) return nd;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 42) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 43)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 44) struct data data_copy_mem(const char *mem, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 45) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 46) struct data d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 47)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 48) d = data_grow_for(empty_data, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 49)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 50) d.len = len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 51) memcpy(d.val, mem, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 52)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 53) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 54) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 55)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 56) struct data data_copy_escape_string(const char *s, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 57) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 58) int i = 0;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 59) struct data d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 60) char *q;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 61)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 62) d = data_add_marker(empty_data, TYPE_STRING, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 63) d = data_grow_for(d, len + 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 64)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 65) q = d.val;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 66) while (i < len) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 67) char c = s[i++];
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 68)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 69) if (c == '\\')
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 70) c = get_escape_char(s, &i);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 71)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 72) q[d.len++] = c;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 73) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 74)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 75) q[d.len++] = '\0';
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 76) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 77) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 78)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 79) struct data data_copy_file(FILE *f, size_t maxlen)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 80) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 81) struct data d = empty_data;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 82)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 83) d = data_add_marker(d, TYPE_NONE, NULL);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 84) while (!feof(f) && (d.len < maxlen)) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 85) size_t chunksize, ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 86)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 87) if (maxlen == (size_t)-1)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 88) chunksize = 4096;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 89) else
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 90) chunksize = maxlen - d.len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 91)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 92) d = data_grow_for(d, chunksize);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 93) ret = fread(d.val + d.len, 1, chunksize, f);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 94)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 95) if (ferror(f))
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 96) die("Error reading file into data: %s", strerror(errno));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 97)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 98) if (d.len + ret < d.len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 99) die("Overflow reading file into data\n");
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 100)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 101) d.len += ret;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 102) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 103)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 104) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 105) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 106)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 107) struct data data_append_data(struct data d, const void *p, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 108) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 109) d = data_grow_for(d, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 110) memcpy(d.val + d.len, p, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 111) d.len += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 112) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 113) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 114)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 115) struct data data_insert_at_marker(struct data d, struct marker *m,
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 116) const void *p, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 117) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 118) d = data_grow_for(d, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 119) memmove(d.val + m->offset + len, d.val + m->offset, d.len - m->offset);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 120) memcpy(d.val + m->offset, p, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 121) d.len += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 122)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 123) /* Adjust all markers after the one we're inserting at */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 124) m = m->next;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 125) for_each_marker(m)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 126) m->offset += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 127) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 128) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 129)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 130) static struct data data_append_markers(struct data d, struct marker *m)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 131) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 132) struct marker **mp = &d.markers;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 133)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 134) /* Find the end of the markerlist */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 135) while (*mp)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 136) mp = &((*mp)->next);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 137) *mp = m;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 138) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 139) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 140)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 141) struct data data_merge(struct data d1, struct data d2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 142) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 143) struct data d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 144) struct marker *m2 = d2.markers;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 145)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 146) d = data_append_markers(data_append_data(d1, d2.val, d2.len), m2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 147)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 148) /* Adjust for the length of d1 */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 149) for_each_marker(m2)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 150) m2->offset += d1.len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 151)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 152) d2.markers = NULL; /* So data_free() doesn't clobber them */
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 153) data_free(d2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 154)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 155) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 156) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 157)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 158) struct data data_append_integer(struct data d, uint64_t value, int bits)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 159) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 160) uint8_t value_8;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 161) fdt16_t value_16;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 162) fdt32_t value_32;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 163) fdt64_t value_64;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 164)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 165) switch (bits) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 166) case 8:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 167) value_8 = value;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 168) return data_append_data(d, &value_8, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 169)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 170) case 16:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 171) value_16 = cpu_to_fdt16(value);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 172) return data_append_data(d, &value_16, 2);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 173)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 174) case 32:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 175) value_32 = cpu_to_fdt32(value);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 176) return data_append_data(d, &value_32, 4);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 177)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 178) case 64:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 179) value_64 = cpu_to_fdt64(value);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 180) return data_append_data(d, &value_64, 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 181)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 182) default:
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 183) die("Invalid literal size (%d)\n", bits);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 184) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 185) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 186)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 187) struct data data_append_re(struct data d, uint64_t address, uint64_t size)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 188) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 189) struct fdt_reserve_entry re;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 190)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 191) re.address = cpu_to_fdt64(address);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 192) re.size = cpu_to_fdt64(size);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 193)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 194) return data_append_data(d, &re, sizeof(re));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 195) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 196)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 197) struct data data_append_cell(struct data d, cell_t word)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 198) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 199) return data_append_integer(d, word, sizeof(word) * 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 200) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 201)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 202) struct data data_append_addr(struct data d, uint64_t addr)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 203) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 204) return data_append_integer(d, addr, sizeof(addr) * 8);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 205) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 206)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 207) struct data data_append_byte(struct data d, uint8_t byte)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 208) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 209) return data_append_data(d, &byte, 1);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 210) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 211)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 212) struct data data_append_zeroes(struct data d, int len)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 213) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 214) d = data_grow_for(d, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 215)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 216) memset(d.val + d.len, 0, len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 217) d.len += len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 218) return d;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 219) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 220)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 221) struct data data_append_align(struct data d, int align)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 222) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 223) int newlen = ALIGN(d.len, align);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 224) return data_append_zeroes(d, newlen - d.len);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 225) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 226)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 227) struct data data_add_marker(struct data d, enum markertype type, char *ref)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 228) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 229) struct marker *m;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 230)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 231) m = xmalloc(sizeof(*m));
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 232) m->offset = d.len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 233) m->type = type;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 234) m->ref = ref;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 235) m->next = NULL;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 236)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 237) return data_append_markers(d, m);
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 238) }
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 239)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 240) bool data_is_one_string(struct data d)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 241) {
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 242) int i;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 243) int len = d.len;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 244)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 245) if (len == 0)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 246) return false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 247)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 248) for (i = 0; i < len-1; i++)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 249) if (d.val[i] == '\0')
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 250) return false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 251)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 252) if (d.val[len-1] != '\0')
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 253) return false;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 254)
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 255) return true;
^8f3ce5b39 (kx 2023-10-28 12:00:06 +0300 256) }
Orange Pi5 kernel
Deprecated Linux kernel 5.10.110 for OrangePi 5/5B/5+ boards
3 Commits
0 Branches
0 Tags