cell_t            211 arch/powerpc/kernel/prom_init.c static cell_t __prombss regbuf[1024];
cell_t           1536 arch/powerpc/kernel/prom_init.c static unsigned long __init prom_next_cell(int s, cell_t **cellp)
cell_t           1538 arch/powerpc/kernel/prom_init.c 	cell_t *p = *cellp;
cell_t           1597 arch/powerpc/kernel/prom_init.c 	cell_t *p, *endp;
cell_t           1637 arch/powerpc/kernel/prom_init.c 		endp = p + (plen / sizeof(cell_t));
cell_t            255 scripts/dtc/checks.c 	if (prop->val.len != sizeof(cell_t))
cell_t            462 scripts/dtc/checks.c static cell_t check_phandle_prop(struct check *c, struct dt_info *dti,
cell_t            468 scripts/dtc/checks.c 	cell_t phandle;
cell_t            474 scripts/dtc/checks.c 	if (prop->val.len != sizeof(cell_t)) {
cell_t            514 scripts/dtc/checks.c 	cell_t phandle, linux_phandle;
cell_t            588 scripts/dtc/checks.c 		cell_t phandle;
cell_t            591 scripts/dtc/checks.c 			assert(m->offset + sizeof(cell_t) <= prop->val.len);
cell_t            749 scripts/dtc/checks.c 	entrylen = (addr_cells + size_cells) * sizeof(cell_t);
cell_t            777 scripts/dtc/checks.c 	entrylen = (p_addr_cells + c_addr_cells + c_size_cells) * sizeof(cell_t);
cell_t            806 scripts/dtc/checks.c 	cell_t *cells;
cell_t            831 scripts/dtc/checks.c 	if (prop->val.len != (sizeof(cell_t) * 2)) {
cell_t            835 scripts/dtc/checks.c 	cells = (cell_t *)prop->val.val;
cell_t            848 scripts/dtc/checks.c 	cell_t *cells;
cell_t            857 scripts/dtc/checks.c 	cells = (cell_t *)prop->val.val;
cell_t            864 scripts/dtc/checks.c 		cells = (cell_t *)prop->val.val;
cell_t            880 scripts/dtc/checks.c 	cell_t *cells;
cell_t            891 scripts/dtc/checks.c 	cells = (cell_t *)prop->val.val;
cell_t            955 scripts/dtc/checks.c 	cell_t *cells = NULL;
cell_t            962 scripts/dtc/checks.c 		cells = (cell_t *)prop->val.val;
cell_t            967 scripts/dtc/checks.c 			cells = ((cell_t *)prop->val.val) + node_addr_cells(node);
cell_t           1024 scripts/dtc/checks.c 	cell_t *cells = NULL;
cell_t           1031 scripts/dtc/checks.c 		cells = (cell_t *)prop->val.val;
cell_t           1105 scripts/dtc/checks.c 	cell_t *cells = NULL;
cell_t           1115 scripts/dtc/checks.c 		cells = (cell_t *)prop->val.val;
cell_t           1356 scripts/dtc/checks.c 	if (prop->val.len % sizeof(cell_t)) {
cell_t           1359 scripts/dtc/checks.c 			  prop->val.len, sizeof(cell_t));
cell_t           1363 scripts/dtc/checks.c 	for (cell = 0; cell < prop->val.len / sizeof(cell_t); cell += cellsize + 1) {
cell_t           1386 scripts/dtc/checks.c 				if (m->offset == (cell * sizeof(cell_t)))
cell_t           1416 scripts/dtc/checks.c 		if (prop->val.len < ((cell + cellsize + 1) * sizeof(cell_t))) {
cell_t           1555 scripts/dtc/checks.c 	if (irq_prop->val.len % sizeof(cell_t))
cell_t           1557 scripts/dtc/checks.c 		     irq_prop->val.len, sizeof(cell_t));
cell_t           1604 scripts/dtc/checks.c 	if (irq_prop->val.len % (irq_cells * sizeof(cell_t))) {
cell_t           1607 scripts/dtc/checks.c 			  irq_prop->val.len, (int)(irq_cells * sizeof(cell_t)));
cell_t           1679 scripts/dtc/checks.c 	if (!(prop->val.val && prop->val.len == sizeof(cell_t))) {
cell_t            197 scripts/dtc/data.c struct data data_append_cell(struct data d, cell_t word)
cell_t            111 scripts/dtc/dtc.h struct data data_append_cell(struct data d, cell_t word);
cell_t            162 scripts/dtc/dtc.h 	cell_t phandle;
cell_t            224 scripts/dtc/dtc.h cell_t propval_cell(struct property *prop);
cell_t            225 scripts/dtc/dtc.h cell_t propval_cell_n(struct property *prop, int n);
cell_t            233 scripts/dtc/dtc.h struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
cell_t            235 scripts/dtc/dtc.h cell_t get_node_phandle(struct node *root, struct node *node);
cell_t             36 scripts/dtc/flattree.c 	void (*cell)(void *, cell_t);
cell_t             45 scripts/dtc/flattree.c static void bin_emit_cell(void *e, cell_t val)
cell_t            123 scripts/dtc/flattree.c static void asm_emit_cell(void *e, cell_t val)
cell_t            253 scripts/dtc/flattree.c 	emit->align(etarget, sizeof(cell_t));
cell_t            271 scripts/dtc/flattree.c 		emit->align(etarget, sizeof(cell_t));
cell_t            283 scripts/dtc/flattree.c 		emit->align(etarget, sizeof(cell_t));
cell_t            435 scripts/dtc/livetree.c cell_t propval_cell(struct property *prop)
cell_t            437 scripts/dtc/livetree.c 	assert(prop->val.len == sizeof(cell_t));
cell_t            441 scripts/dtc/livetree.c cell_t propval_cell_n(struct property *prop, int n)
cell_t            443 scripts/dtc/livetree.c 	assert(prop->val.len / sizeof(cell_t) >= n);
cell_t            559 scripts/dtc/livetree.c struct node *get_node_by_phandle(struct node *tree, cell_t phandle)
cell_t            593 scripts/dtc/livetree.c cell_t get_node_phandle(struct node *root, struct node *node)
cell_t            595 scripts/dtc/livetree.c 	static cell_t phandle = 1; /* FIXME: ick, static local */
cell_t            182 scripts/dtc/treesource.c 		if ((m->offset % sizeof(cell_t)) != 0)
cell_t            189 scripts/dtc/treesource.c 	} else if (((len % sizeof(cell_t)) == 0) && (nnotcelllbl == 0)) {