| /OK3568_Linux_fs/u-boot/scripts/dtc/ |
| H A D | checks.c | 192 if (prop->val.len != sizeof(cell_t)) in check_is_cell()
400 static cell_t check_phandle_prop(struct check *c, struct dt_info *dti, in check_phandle_prop()
406 cell_t phandle; in check_phandle_prop()
412 if (prop->val.len != sizeof(cell_t)) { in check_phandle_prop()
452 cell_t phandle, linux_phandle; in check_explicit_phandles()
526 cell_t phandle; in fixup_phandle_references()
529 assert(m->offset + sizeof(cell_t) <= prop->val.len); in fixup_phandle_references()
634 entrylen = (addr_cells + size_cells) * sizeof(cell_t); in check_reg_format()
662 entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t); in check_ranges_format()
691 cell_t *cells; in check_pci_bridge()
[all …]
|
| H A D | dtc.h | 66 typedef uint32_t cell_t; typedef
115 struct data data_append_cell(struct data d, cell_t word);
165 cell_t phandle;
219 cell_t propval_cell(struct property *prop);
220 cell_t propval_cell_n(struct property *prop, int n);
228 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
230 cell_t get_node_phandle(struct node *root, struct node *node);
|
| H A D | livetree.c | 415 cell_t propval_cell(struct property *prop) in propval_cell()
417 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
421 cell_t propval_cell_n(struct property *prop, int n) in propval_cell_n()
423 assert(prop->val.len / sizeof(cell_t) >= n); in propval_cell_n()
539 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
570 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle()
572 static cell_t phandle = 0x10000000; /* FIXME: ick, static local */ in get_node_phandle()
|
| H A D | flattree.c | 51 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 D | treesource.c | 219 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 D | data.c | 210 struct data data_append_cell(struct data d, cell_t word) in data_append_cell()
|
| /OK3568_Linux_fs/kernel/scripts/dtc/ |
| H A D | checks.c | 255 if (prop->val.len != sizeof(cell_t)) in check_is_cell()
462 static cell_t check_phandle_prop(struct check *c, struct dt_info *dti, in check_phandle_prop()
468 cell_t phandle; in check_phandle_prop()
474 if (prop->val.len != sizeof(cell_t)) { in check_phandle_prop()
514 cell_t phandle, linux_phandle; in check_explicit_phandles()
588 cell_t phandle; in fixup_phandle_references()
591 assert(m->offset + sizeof(cell_t) <= prop->val.len); in fixup_phandle_references()
794 entrylen = (addr_cells + size_cells) * sizeof(cell_t); in check_reg_format()
824 entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t); in check_ranges_format()
854 cell_t *cells; in check_pci_bridge()
[all …]
|
| H A D | dtc.h | 52 typedef uint32_t cell_t; typedef
142 struct data data_append_cell(struct data d, cell_t word);
193 cell_t phandle;
255 cell_t propval_cell(struct property *prop);
256 cell_t propval_cell_n(struct property *prop, int n);
264 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
266 cell_t get_node_phandle(struct node *root, struct node *node);
|
| H A D | livetree.c | 435 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, 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()
592 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle()
594 static cell_t phandle = 1; /* FIXME: ick, static local */ in get_node_phandle()
|
| H A D | flattree.c | 36 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()
253 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
271 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
283 emit->align(etarget, sizeof(cell_t)); in flatten_tree()
|
| H A D | treesource.c | 182 if ((m->offset % sizeof(cell_t)) != 0) in guess_value_type()
189 } else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) { in guess_value_type()
|
| H A D | data.c | 197 struct data data_append_cell(struct data d, cell_t word) in data_append_cell()
|
| /OK3568_Linux_fs/kernel/arch/powerpc/kernel/ |
| H A D | prom_init.c | 131 typedef __be32 cell_t; typedef
212 static cell_t __prombss regbuf[1024];
1560 static unsigned long __init prom_next_cell(int s, cell_t **cellp) in prom_next_cell()
1562 cell_t *p = *cellp; in prom_next_cell()
1621 cell_t *p, *endp; in prom_init_mem()
1661 endp = p + (plen / sizeof(cell_t)); in prom_init_mem()
|