64 	f->node.is_file = 1;  in process_file()
65 	strlcpy(f->node.node.name, dent->d_name, NAME_MAX);  in process_file()
66 	snprintf(f->node.node.full_name, PATH_MAX, "%s/%s",  in process_file()
67 		 parent->node.node.full_name, dent->d_name);  in process_file()
69 	fd = of_open_file(f->node.node.full_name);  in process_file()
82 	list_add_tail(&f->node.list, &parent->files);  in process_file()
89 					  struct dt_node, node);  in node2dir()
90 	const struct dt_dir *d = container_of(dn, struct dt_dir, node);  in node2dir()
122 			strlcpy(subdir->node.node.name, d[loop]->d_name,  in iterate_dir()
124 			snprintf(subdir->node.node.full_name, PATH_MAX,  in iterate_dir()
125 				 "%s/%s", dt->node.node.full_name,  in iterate_dir()
128 			ret = process_dir(subdir->node.node.full_name, subdir);  in iterate_dir()
131 			list_add_tail(&subdir->node.list, &dt->subdirs);  in iterate_dir()
135 				     dt->node.node.full_name, d[loop]->d_name);  in iterate_dir()
147 	dt->node.is_file = 0;  in process_dir()
171 	list_for_each_entry(f, &d->files, node.list) {  in linear_dir()
172 		if (!strcmp(f->node.node.name, "compatible")) {  in linear_dir()
175 					     " %s", d->node.node.full_name);  in linear_dir()
177 		} else if (!strcmp(f->node.node.name, "status")) {  in linear_dir()
180 					     d->node.node.full_name);  in linear_dir()
182 		} else if (!strcmp(f->node.node.name, "linux,phandle")) {  in linear_dir()
185 					     d->node.node.full_name);  in linear_dir()
187 		} else if (!strcmp(f->node.node.name, "phandle")) {  in linear_dir()
190 					     d->node.node.full_name);  in linear_dir()
192 		} else if (!strcmp(f->node.node.name, "#address-cells")) {  in linear_dir()
195 					     d->node.node.full_name);  in linear_dir()
197 		} else if (!strcmp(f->node.node.name, "#size-cells")) {  in linear_dir()
200 					     d->node.node.full_name);  in linear_dir()
202 		} else if (!strcmp(f->node.node.name, "reg")) {  in linear_dir()
205 					     d->node.node.full_name);  in linear_dir()
210 	list_for_each_entry(dd, &d->subdirs, node.list) {  in linear_dir()
227 	root_dir.node.node.name[0] = '\0';  in of_init_path()
228 	root_dir.node.node.full_name[0] = '\0';  in of_init_path()
229 	INIT_LIST_HEAD(&root_dir.node.list);  in of_init_path()
251 	list_for_each_entry_safe(f, tmpf, &d->files, node.list) {  in destroy_dir()
252 		list_del(&f->node.list);  in destroy_dir()
255 	list_for_each_entry_safe(dd, tmpd, &d->subdirs, node.list) {  in destroy_dir()
257 		list_del(&dd->node.list);  in destroy_dir()
321 		return &d->node.node;  in of_find_compatible_node()
335 	list_for_each_entry(f, &d->files, node.list)  in of_get_property()
336 		if (!strcmp(f->node.node.name, name)) {  in of_get_property()
369 			return &d->node.node;  in of_find_node_by_phandle()
385 	return &d->parent->node.node;  in of_get_parent()
404 		if (c->node.list.next == &p->subdirs)  in of_get_next_child()
407 		c = list_entry(c->node.list.next, struct dt_dir, node.list);  in of_get_next_child()
408 		return &c->node.node;  in of_get_next_child()
413 	c = list_entry(p->subdirs.next, struct dt_dir, node.list);  in of_get_next_child()
414 	return &c->node.node;  in of_get_next_child()