cell_t
static unsigned long __init prom_next_cell(int s, cell_t **cellp)
cell_t *p = *cellp;
cell_t *p, *endp;
endp = p + (plen / sizeof(cell_t));
static cell_t __prombss regbuf[1024];
cells = (cell_t *)prop->val.val;
cells = ((cell_t *)prop->val.val) + node_addr_cells(node);
cell_t *cells = NULL;
cells = (cell_t *)prop->val.val;
cell_t *cells = NULL;
cells = (cell_t *)prop->val.val;
if (!is_multiple_of(prop->val.len, sizeof(cell_t))) {
prop->val.len, sizeof(cell_t));
for (cell = 0; cell < prop->val.len / sizeof(cell_t); cell += cellsize + 1) {
cell_t phandle;
if (m->offset == (cell * sizeof(cell_t)))
expected = (cell + cellsize + 1) * sizeof(cell_t);
if (prop && (prop->val.len != (cellsize * sizeof(cell_t))))
prop->val.len, cellsize * sizeof(cell_t));
if (!is_multiple_of(irq_map_prop->val.len, sizeof(cell_t))) {
irq_map_prop->val.len, sizeof(cell_t));
map_cells = irq_map_prop->val.len / sizeof(cell_t);
irq_map_prop->val.len, (cell + cellsize) * sizeof(cell_t));
irq_map_prop->val.len, cell * sizeof(cell_t));
cell_t irq_cells, phandle;
if (!is_multiple_of(irq_prop->val.len, sizeof(cell_t)))
irq_prop->val.len, sizeof(cell_t));
if (!is_multiple_of(irq_prop->val.len, irq_cells * sizeof(cell_t))) {
irq_prop->val.len, (int)(irq_cells * sizeof(cell_t)));
if (!(prop->val.val && prop->val.len == sizeof(cell_t))) {
cell_t phandle;
if (prop->val.len != sizeof(cell_t))
static cell_t check_phandle_prop(struct check *c, struct dt_info *dti,
cell_t phandle;
if (prop->val.len != sizeof(cell_t)) {
cell_t phandle, linux_phandle;
cell_t phandle;
assert(m->offset + sizeof(cell_t) <= prop->val.len);
entrylen = (addr_cells + size_cells) * sizeof(cell_t);
entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t);
cell_t *cells;
if (prop->val.len != (sizeof(cell_t) * 2)) {
cells = (cell_t *)prop->val.val;
cell_t *cells;
cells = (cell_t *)prop->val.val;
cells = (cell_t *)prop->val.val;
cell_t *cells;
cells = (cell_t *)prop->val.val;
cell_t *cells = NULL;
struct data data_append_cell(struct data d, cell_t word)
struct data data_append_cell(struct data d, cell_t word);
cell_t phandle;
cell_t propval_cell(struct property *prop);
cell_t propval_cell_n(struct property *prop, unsigned int n);
struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
cell_t get_node_phandle(struct node *root, struct node *node);
static inline bool phandle_is_valid(cell_t phandle)
static void asm_emit_cell(void *e, cell_t val)
emit->align(etarget, sizeof(cell_t));
emit->align(etarget, sizeof(cell_t));
emit->align(etarget, sizeof(cell_t));
void (*cell)(void *, cell_t);
static void bin_emit_cell(void *e, cell_t val)
cell_t propval_cell(struct property *prop)
assert(prop->val.len == sizeof(cell_t));
cell_t propval_cell_n(struct property *prop, unsigned int n)
assert(prop->val.len / sizeof(cell_t) > n);
struct node *get_node_by_phandle(struct node *tree, cell_t phandle)
cell_t get_node_phandle(struct node *root, struct node *node)
static cell_t phandle = 1; /* FIXME: ick, static local */
cell_t phandle;
} else if ((len % sizeof(cell_t)) == 0) {