Home
last modified time | relevance | path

Searched refs:cell_t (Results 1 – 13 of 13) sorted by relevance

/openbmc/linux/scripts/dtc/
H A Dchecks.c263 if (prop->val.len != sizeof(cell_t)) in check_is_cell()
485 static cell_t check_phandle_prop(struct check *c, struct dt_info *dti, in check_phandle_prop()
491 cell_t phandle; in check_phandle_prop()
497 if (prop->val.len != sizeof(cell_t)) { in check_phandle_prop()
537 cell_t phandle, linux_phandle; in check_explicit_phandles()
611 cell_t phandle; in fixup_phandle_references()
614 assert(m->offset + sizeof(cell_t) <= prop->val.len); in fixup_phandle_references()
775 entrylen = (addr_cells + size_cells) * sizeof(cell_t); in check_reg_format()
805 entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t); in check_ranges_format()
835 cell_t *cells; in check_pci_bridge()
[all …]
H A Ddtc.h52 typedef uint32_t cell_t; typedef
54 static inline bool phandle_is_valid(cell_t phandle) in phandle_is_valid()
178 struct data data_append_cell(struct data d, cell_t word);
229 cell_t phandle;
291 cell_t propval_cell(struct property *prop);
292 cell_t propval_cell_n(struct property *prop, unsigned int n);
300 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
302 cell_t get_node_phandle(struct node *root, struct node *node);
H A Dlivetree.c435 cell_t propval_cell(struct property *prop) in propval_cell()
437 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
441 cell_t propval_cell_n(struct property *prop, unsigned int n) in propval_cell_n()
443 assert(prop->val.len / sizeof(cell_t) >= n); in propval_cell_n()
558 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
619 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle()
621 static cell_t phandle = 1; /* FIXME: ick, static local */ in get_node_phandle()
H A Dflattree.c36 void (*cell)(void *, cell_t);
45 static void bin_emit_cell(void *e, cell_t val) in bin_emit_cell()
123 static void asm_emit_cell(void *e, cell_t val) in asm_emit_cell()
254 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
272 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
284 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
H A Dtreesource.c161 if ((m->offset % sizeof(cell_t)) != 0) in guess_value_type()
168 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) { in guess_value_type()
H A Ddata.c197 struct data data_append_cell(struct data d, cell_t word) in data_append_cell()
/openbmc/u-boot/scripts/dtc/
H A Dchecks.c236 if (prop->val.len != sizeof(cell_t)) in check_is_cell()
438 static cell_t check_phandle_prop(struct check *c, struct dt_info *dti, in check_phandle_prop()
444 cell_t phandle; in check_phandle_prop()
450 if (prop->val.len != sizeof(cell_t)) { in check_phandle_prop()
490 cell_t phandle, linux_phandle; in check_explicit_phandles()
564 cell_t phandle; in fixup_phandle_references()
567 assert(m->offset + sizeof(cell_t) <= prop->val.len); in fixup_phandle_references()
711 entrylen = (addr_cells + size_cells) * sizeof(cell_t); in check_reg_format()
739 entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t); in check_ranges_format()
768 cell_t *cells; in check_pci_bridge()
[all …]
H A Ddtc.h66 typedef uint32_t cell_t; typedef
116 struct data data_append_cell(struct data d, cell_t word);
166 cell_t phandle;
220 cell_t propval_cell(struct property *prop);
221 cell_t propval_cell_n(struct property *prop, int n);
229 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
231 cell_t get_node_phandle(struct node *root, struct node *node);
H A Dlivetree.c416 cell_t propval_cell(struct property *prop) in propval_cell()
418 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
422 cell_t propval_cell_n(struct property *prop, int n) in propval_cell_n()
424 assert(prop->val.len / sizeof(cell_t) >= n); in propval_cell_n()
540 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
574 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle()
576 static cell_t phandle = 1; /* FIXME: ick, static local */ in get_node_phandle()
H A Dflattree.c51 void (*cell)(void *, cell_t);
60 static void bin_emit_cell(void *e, cell_t val) in bin_emit_cell()
138 static void asm_emit_cell(void *e, cell_t val) in asm_emit_cell()
268 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
286 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
298 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
H A Dtreesource.c219 if ((m->offset % sizeof(cell_t)) != 0) in write_propval()
227 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) { in write_propval()
H A Ddata.c210 struct data data_append_cell(struct data d, cell_t word) in data_append_cell()
/openbmc/linux/arch/powerpc/kernel/
H A Dprom_init.c129 typedef __be32 cell_t; typedef
210 static cell_t __prombss regbuf[1024];
1589 static unsigned long __init prom_next_cell(int s, cell_t **cellp) in prom_next_cell()
1591 cell_t *p = *cellp; in prom_next_cell()
1650 cell_t *p, *endp; in prom_init_mem()
1690 endp = p + (plen / sizeof(cell_t)); in prom_init_mem()