Home
last modified time | relevance | path

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

/external/ltp/testcases/open_posix_testsuite/stress/threads/pthread_mutex_lock/
Dstress.c126 } cell_t; typedef
136 cell_t *c = (cell_t *) arg; in sigthr()
184 cell_t *c = (cell_t *) pthread_getspecific(_c); in sighdl()
193 void waitsigend(cell_t * c) in waitsigend()
202 void control(cell_t * c, char *loc) in control()
229 cell_t *c = (cell_t *) arg; in lockthr()
277 cell_t *c = (cell_t *) arg; in timedlockthr()
333 cell_t *c = (cell_t *) arg; in trylockthr()
381 void cell_init(int id, cell_t * c, pthread_mutexattr_t * pma) in cell_init()
483 cell_t * c, in cell_fini()
[all …]
/external/u-boot/scripts/dtc/
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 …]
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);
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()
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()
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()
Ddata.c210 struct data data_append_cell(struct data d, cell_t word) in data_append_cell()
/external/dtc/
Dchecks.c192 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 …]
Ddtc.h66 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);
227 struct node *get_node_by_phandle(struct node *tree, cell_t phandle);
229 cell_t get_node_phandle(struct node *root, struct node *node);
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()
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()
Dlivetree.c415 cell_t propval_cell(struct property *prop) in propval_cell()
417 assert(prop->val.len == sizeof(cell_t)); in propval_cell()
533 struct node *get_node_by_phandle(struct node *tree, cell_t phandle) in get_node_by_phandle()
564 cell_t get_node_phandle(struct node *root, struct node *node) in get_node_phandle()
566 static cell_t phandle = 1; /* FIXME: ick, static local */ in get_node_phandle()
Ddata.c210 struct data data_append_cell(struct data d, cell_t word) in data_append_cell()