devtree.c revision a73ac50c4787b1b28d5c94bb18c60352f5dd7d6f
1/* 2 * devtree.c - convenience functions for device tree manipulation 3 * Copyright 2007 David Gibson, IBM Corporation. 4 * Copyright (c) 2007 Freescale Semiconductor, Inc. 5 * 6 * Authors: David Gibson <david@gibson.dropbear.id.au> 7 * Scott Wood <scottwood@freescale.com> 8 * 9 * This program is free software; you can redistribute it and/or 10 * modify it under the terms of the GNU General Public License 11 * as published by the Free Software Foundation; either version 12 * 2 of the License, or (at your option) any later version. 13 */ 14#include <stdarg.h> 15#include <stddef.h> 16#include "types.h" 17#include "string.h" 18#include "stdio.h" 19#include "ops.h" 20 21void dt_fixup_memory(u64 start, u64 size) 22{ 23 void *root, *memory; 24 int naddr, nsize, i; 25 u32 memreg[4]; 26 27 root = finddevice("/"); 28 if (getprop(root, "#address-cells", &naddr, sizeof(naddr)) < 0) 29 naddr = 2; 30 if (naddr < 1 || naddr > 2) 31 fatal("Can't cope with #address-cells == %d in /\n\r", naddr); 32 33 if (getprop(root, "#size-cells", &nsize, sizeof(nsize)) < 0) 34 nsize = 1; 35 if (nsize < 1 || nsize > 2) 36 fatal("Can't cope with #size-cells == %d in /\n\r", nsize); 37 38 i = 0; 39 if (naddr == 2) 40 memreg[i++] = start >> 32; 41 memreg[i++] = start & 0xffffffff; 42 if (nsize == 2) 43 memreg[i++] = size >> 32; 44 memreg[i++] = size & 0xffffffff; 45 46 memory = finddevice("/memory"); 47 if (! memory) { 48 memory = create_node(NULL, "memory"); 49 setprop_str(memory, "device_type", "memory"); 50 } 51 52 printf("Memory <- <0x%x", memreg[0]); 53 for (i = 1; i < (naddr + nsize); i++) 54 printf(" 0x%x", memreg[i]); 55 printf("> (%ldMB)\n\r", (unsigned long)(size >> 20)); 56 57 setprop(memory, "reg", memreg, (naddr + nsize)*sizeof(u32)); 58} 59 60#define MHZ(x) ((x + 500000) / 1000000) 61 62void dt_fixup_cpu_clocks(u32 cpu, u32 tb, u32 bus) 63{ 64 void *devp = NULL; 65 66 printf("CPU clock-frequency <- 0x%x (%dMHz)\n\r", cpu, MHZ(cpu)); 67 printf("CPU timebase-frequency <- 0x%x (%dMHz)\n\r", tb, MHZ(tb)); 68 if (bus > 0) 69 printf("CPU bus-frequency <- 0x%x (%dMHz)\n\r", bus, MHZ(bus)); 70 71 while ((devp = find_node_by_devtype(devp, "cpu"))) { 72 setprop_val(devp, "clock-frequency", cpu); 73 setprop_val(devp, "timebase-frequency", tb); 74 if (bus > 0) 75 setprop_val(devp, "bus-frequency", bus); 76 } 77 78 timebase_period_ns = 1000000000 / tb; 79} 80 81void dt_fixup_clock(const char *path, u32 freq) 82{ 83 void *devp = finddevice(path); 84 85 if (devp) { 86 printf("%s: clock-frequency <- %x (%dMHz)\n\r", path, freq, MHZ(freq)); 87 setprop_val(devp, "clock-frequency", freq); 88 } 89} 90 91void __dt_fixup_mac_addresses(u32 startindex, ...) 92{ 93 va_list ap; 94 u32 index = startindex; 95 void *devp; 96 const u8 *addr; 97 98 va_start(ap, startindex); 99 while ((addr = va_arg(ap, const u8 *))) { 100 devp = find_node_by_prop_value(NULL, "linux,network-index", 101 (void*)&index, sizeof(index)); 102 103 printf("ENET%d: local-mac-address <-" 104 " %02x:%02x:%02x:%02x:%02x:%02x\n\r", index, 105 addr[0], addr[1], addr[2], addr[3], addr[4], addr[5]); 106 107 if (devp) 108 setprop(devp, "local-mac-address", addr, 6); 109 110 index++; 111 } 112 va_end(ap); 113} 114 115#define MAX_ADDR_CELLS 4 116 117static void get_reg_format(void *node, u32 *naddr, u32 *nsize) 118{ 119 if (getprop(node, "#address-cells", naddr, 4) != 4) 120 *naddr = 2; 121 if (getprop(node, "#size-cells", nsize, 4) != 4) 122 *nsize = 1; 123} 124 125static void copy_val(u32 *dest, u32 *src, int naddr) 126{ 127 int pad = MAX_ADDR_CELLS - naddr; 128 129 memset(dest, 0, pad * 4); 130 memcpy(dest + pad, src, naddr * 4); 131} 132 133static int sub_reg(u32 *reg, u32 *sub) 134{ 135 int i, borrow = 0; 136 137 for (i = MAX_ADDR_CELLS - 1; i >= 0; i--) { 138 int prev_borrow = borrow; 139 borrow = reg[i] < sub[i] + prev_borrow; 140 reg[i] -= sub[i] + prev_borrow; 141 } 142 143 return !borrow; 144} 145 146static int add_reg(u32 *reg, u32 *add, int naddr) 147{ 148 int i, carry = 0; 149 150 for (i = MAX_ADDR_CELLS - 1; i >= MAX_ADDR_CELLS - naddr; i--) { 151 u64 tmp = (u64)reg[i] + add[i] + carry; 152 carry = tmp >> 32; 153 reg[i] = (u32)tmp; 154 } 155 156 return !carry; 157} 158 159/* It is assumed that if the first byte of reg fits in a 160 * range, then the whole reg block fits. 161 */ 162static int compare_reg(u32 *reg, u32 *range, u32 *rangesize) 163{ 164 int i; 165 u32 end; 166 167 for (i = 0; i < MAX_ADDR_CELLS; i++) { 168 if (reg[i] < range[i]) 169 return 0; 170 if (reg[i] > range[i]) 171 break; 172 } 173 174 for (i = 0; i < MAX_ADDR_CELLS; i++) { 175 end = range[i] + rangesize[i]; 176 177 if (reg[i] < end) 178 break; 179 if (reg[i] > end) 180 return 0; 181 } 182 183 return reg[i] != end; 184} 185 186/* reg must be MAX_ADDR_CELLS */ 187static int find_range(u32 *reg, u32 *ranges, int nregaddr, 188 int naddr, int nsize, int buflen) 189{ 190 int nrange = nregaddr + naddr + nsize; 191 int i; 192 193 for (i = 0; i + nrange <= buflen; i += nrange) { 194 u32 range_addr[MAX_ADDR_CELLS]; 195 u32 range_size[MAX_ADDR_CELLS]; 196 197 copy_val(range_addr, ranges + i, naddr); 198 copy_val(range_size, ranges + i + nregaddr + naddr, nsize); 199 200 if (compare_reg(reg, range_addr, range_size)) 201 return i; 202 } 203 204 return -1; 205} 206 207/* Currently only generic buses without special encodings are supported. 208 * In particular, PCI is not supported. Also, only the beginning of the 209 * reg block is tracked; size is ignored except in ranges. 210 */ 211static u32 prop_buf[MAX_PROP_LEN / 4]; 212 213static int dt_xlate(void *node, int res, int reglen, unsigned long *addr, 214 unsigned long *size) 215{ 216 u32 last_addr[MAX_ADDR_CELLS]; 217 u32 this_addr[MAX_ADDR_CELLS]; 218 void *parent; 219 u64 ret_addr, ret_size; 220 u32 naddr, nsize, prev_naddr, prev_nsize; 221 int buflen, offset; 222 223 parent = get_parent(node); 224 if (!parent) 225 return 0; 226 227 get_reg_format(parent, &naddr, &nsize); 228 229 if (nsize > 2) 230 return 0; 231 232 offset = (naddr + nsize) * res; 233 234 if (reglen < offset + naddr + nsize || 235 MAX_PROP_LEN < (offset + naddr + nsize) * 4) 236 return 0; 237 238 copy_val(last_addr, prop_buf + offset, naddr); 239 240 ret_size = prop_buf[offset + naddr]; 241 if (nsize == 2) { 242 ret_size <<= 32; 243 ret_size |= prop_buf[offset + naddr + 1]; 244 } 245 246 for (;;) { 247 prev_naddr = naddr; 248 prev_nsize = nsize; 249 node = parent; 250 251 parent = get_parent(node); 252 if (!parent) 253 break; 254 255 get_reg_format(parent, &naddr, &nsize); 256 257 buflen = getprop(node, "ranges", prop_buf, 258 sizeof(prop_buf)); 259 if (buflen == 0) 260 continue; 261 if (buflen < 0 || buflen > sizeof(prop_buf)) 262 return 0; 263 264 offset = find_range(last_addr, prop_buf, prev_naddr, 265 naddr, prev_nsize, buflen / 4); 266 267 if (offset < 0) 268 return 0; 269 270 copy_val(this_addr, prop_buf + offset, prev_naddr); 271 272 if (!sub_reg(last_addr, this_addr)) 273 return 0; 274 275 copy_val(this_addr, prop_buf + offset + prev_naddr, naddr); 276 277 if (!add_reg(last_addr, this_addr, naddr)) 278 return 0; 279 } 280 281 if (naddr > 2) 282 return 0; 283 284 ret_addr = ((u64)last_addr[2] << 32) | last_addr[3]; 285 286 if (sizeof(void *) == 4 && 287 (ret_addr >= 0x100000000ULL || ret_size > 0x100000000ULL || 288 ret_addr + ret_size > 0x100000000ULL)) 289 return 0; 290 291 *addr = ret_addr; 292 if (size) 293 *size = ret_size; 294 295 return 1; 296} 297 298int dt_xlate_reg(void *node, int res, unsigned long *addr, unsigned long *size) 299{ 300 int reglen; 301 302 reglen = getprop(node, "reg", prop_buf, sizeof(prop_buf)) / 4; 303 return dt_xlate(node, res, reglen, addr, size); 304} 305 306int dt_xlate_addr(void *node, u32 *buf, int buflen, unsigned long *xlated_addr) 307{ 308 309 if (buflen > sizeof(prop_buf)) 310 return 0; 311 312 memcpy(prop_buf, buf, buflen); 313 return dt_xlate(node, 0, buflen / 4, xlated_addr, NULL); 314} 315 316int dt_is_compatible(void *node, const char *compat) 317{ 318 char *buf = (char *)prop_buf; 319 int len, pos; 320 321 len = getprop(node, "compatible", buf, MAX_PROP_LEN); 322 if (len < 0) 323 return 0; 324 325 for (pos = 0; pos < len; pos++) { 326 if (!strcmp(buf + pos, compat)) 327 return 1; 328 329 pos += strnlen(&buf[pos], len - pos); 330 } 331 332 return 0; 333} 334