HomeSort by relevance Sort by last modified time
    Searched refs:fdtp (Results 1 - 5 of 5) sorted by null

  /system/libufdt/
ufdt_prop_dict.h 25 void *fdtp; member in struct:ufdt_prop_dict
35 int ufdt_prop_dict_construct(struct ufdt_prop_dict *dict, void *fdtp);
ufdt_convert.c 21 struct ufdt *ufdt_construct(void *fdtp) {
31 fdtps[0] = fdtp;
38 res_ufdt->num_used_fdtps = (fdtp != NULL ? 1 : 0);
60 int ufdt_add_fdt(struct ufdt *tree, void *fdtp) {
61 if (fdtp == NULL) {
78 tree->fdtps[i] = fdtp;
108 static struct ufdt_node *ufdt_new_node(void *fdtp, int node_offset) {
109 if (fdtp == NULL) {
115 (fdt32_t *)fdt_offset_ptr(fdtp, node_offset, sizeof(fdt32_t));
116 struct ufdt_node *res = ufdt_node_construct(fdtp, fdt_tag_ptr)
    [all...]
ufdt_prop_dict.c 54 const char *prop_name = fdt_string(dict->fdtp, fdt32_to_cpu(prop->nameoff));
64 const char *name = fdt_string(dict->fdtp, fdt32_to_cpu(prop->nameoff));
69 int _ufdt_prop_dict_construct_int(struct ufdt_prop_dict *dict, void *fdtp,
79 dict->fdtp = fdtp;
85 int ufdt_prop_dict_construct(struct ufdt_prop_dict *dict, void *fdtp) {
86 return _ufdt_prop_dict_construct_int(dict, fdtp, UFDT_PROP_DICT_INIT_SZ);
105 _ufdt_prop_dict_construct_int(&temp_dict, dict->fdtp, new_size);
ufdt_node.c 37 struct ufdt_node *ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr) {
45 res->name = fdt_string(fdtp, fdt32_to_cpu(prop->nameoff));
  /system/libufdt/include/
libufdt.h 36 struct ufdt_node *ufdt_node_construct(void *fdtp, fdt32_t *fdt_tag_ptr);
149 * Constructs a ufdt whose base fdt is fdtp.
151 * To get the whole tree please call `fdt_to_ufdt(fdtp, fdt_size)`
153 * @return: an empty ufdt with base fdtp = fdtp
155 struct ufdt *ufdt_construct(void *fdtp);
165 * Note that this function just add the given fdtp into this ufdt,
170 int ufdt_add_fdt(struct ufdt *tree, void *fdtp);
288 * Builds the ufdt for FDT pointed by fdtp.
290 * @return: the ufdt T representing fdtp o
    [all...]

Completed in 1053 milliseconds