HelenOS sources

node              134 boot/arch/sparc64/src/ofw.c 	phandle node = ofw_get_child_node(cpus_parent);
node              135 boot/arch/sparc64/src/ofw.c 	size_t cpus = wake_cpus_in_node(node, current_mid, physmem_start);
node              137 boot/arch/sparc64/src/ofw.c 	while ((node != 0) && (node != (phandle) -1)) {
node              140 boot/arch/sparc64/src/ofw.c 		if (ofw_get_property(node, "name", name,
node              145 boot/arch/sparc64/src/ofw.c 				phandle subnode = ofw_get_child_node(node);
node              151 boot/arch/sparc64/src/ofw.c 		node = ofw_get_peer_node(node);
node              186 boot/genarch/src/ofw.c phandle ofw_get_child_node(const phandle node)
node              188 boot/genarch/src/ofw.c 	return (phandle) ofw_call("child", 1, 1, NULL, node);
node              191 boot/genarch/src/ofw.c phandle ofw_get_peer_node(const phandle node)
node              193 boot/genarch/src/ofw.c 	return (phandle) ofw_call("peer", 1, 1, NULL, node);
node              137 kernel/arch/ppc32/src/ppc32.c static bool display_register(ofw_tree_node_t *node, void *arg)
node              145 kernel/arch/ppc32/src/ppc32.c 	ofw_tree_property_t *prop = ofw_tree_getprop(node, "address");
node              149 kernel/arch/ppc32/src/ppc32.c 	prop = ofw_tree_getprop(node, "width");
node              153 kernel/arch/ppc32/src/ppc32.c 	prop = ofw_tree_getprop(node, "height");
node              157 kernel/arch/ppc32/src/ppc32.c 	prop = ofw_tree_getprop(node, "depth");
node              181 kernel/arch/ppc32/src/ppc32.c 	prop = ofw_tree_getprop(node, "linebytes");
node              222 kernel/arch/ppc32/src/ppc32.c static bool macio_register(ofw_tree_node_t *node, void *arg)
node              226 kernel/arch/ppc32/src/ppc32.c 	ofw_tree_property_t *prop = ofw_tree_getprop(node, "assigned-addresses");
node               40 kernel/arch/sparc64/include/arch/drivers/kbd.h extern void kbd_init(ofw_tree_node_t *node);
node               51 kernel/arch/sparc64/include/arch/drivers/scr.h extern void scr_init(ofw_tree_node_t *node);
node               40 kernel/arch/sparc64/include/arch/drivers/tty.h extern void tty_init(ofw_tree_node_t *node);
node               50 kernel/arch/sparc64/include/arch/sun4v/md.h md_node_t md_get_child(md_node_t node, char *name);
node               51 kernel/arch/sparc64/include/arch/sun4v/md.h md_child_iter_t md_get_child_iterator(md_node_t node);
node               54 kernel/arch/sparc64/include/arch/sun4v/md.h const char *md_get_node_name(md_node_t node);
node               55 kernel/arch/sparc64/include/arch/sun4v/md.h bool md_get_integer_property(md_node_t node, const char *key,
node               57 kernel/arch/sparc64/include/arch/sun4v/md.h bool md_get_string_property(md_node_t node, const char *key,
node               59 kernel/arch/sparc64/include/arch/sun4v/md.h bool md_next_node(md_node_t *node, const char *name);
node               50 kernel/arch/sparc64/src/cpu/sun4u/cpu.c static int find_cpu_frequency(ofw_tree_node_t *node)
node               56 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 	prop = ofw_tree_getprop(node, "upa-portid");
node               58 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 		prop = ofw_tree_getprop(node, "portid");
node               60 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 		prop = ofw_tree_getprop(node, "cpuid");
node               65 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 			prop = ofw_tree_getprop(node, "clock-frequency");
node               80 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 	ofw_tree_node_t *node;
node               89 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 		node = ofw_tree_find_child_by_device_type(cpus_parent(), "cpu");
node               90 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 		while (node) {
node               91 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 			int f = find_cpu_frequency(node);
node               94 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 			node = ofw_tree_find_peer_by_device_type(node, "cpu");
node               97 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 		node = ofw_tree_find_child(cpus_parent(), "cmp");
node               98 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 		while (node) {
node              101 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 			    ofw_tree_find_child(node, "cpu@0"));
node              105 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 			    ofw_tree_find_child(node, "cpu@1"));
node              108 kernel/arch/sparc64/src/cpu/sun4u/cpu.c 			node = ofw_tree_find_peer_by_name(node, "cmp");
node               55 kernel/arch/sparc64/src/cpu/sun4v/cpu.c 	md_node_t node = md_get_root();
node               59 kernel/arch/sparc64/src/cpu/sun4v/cpu.c 		if (!md_next_node(&node, "cpu")) {
node               63 kernel/arch/sparc64/src/cpu/sun4v/cpu.c 		md_get_integer_property(node, "id", &id);
node               67 kernel/arch/sparc64/src/cpu/sun4v/cpu.c 			md_get_integer_property(node, "clock-frequency",
node               58 kernel/arch/sparc64/src/drivers/kbd.c static bool kbd_ns16550_init(ofw_tree_node_t *node)
node               60 kernel/arch/sparc64/src/drivers/kbd.c 	const char *name = ofw_tree_node_name(node);
node               68 kernel/arch/sparc64/src/drivers/kbd.c 	ofw_tree_property_t *prop = ofw_tree_getprop(node, "interrupts");
node               80 kernel/arch/sparc64/src/drivers/kbd.c 	prop = ofw_tree_getprop(node, "reg");
node               88 kernel/arch/sparc64/src/drivers/kbd.c 	if (!ofw_ebus_apply_ranges(node->parent,
node               98 kernel/arch/sparc64/src/drivers/kbd.c 	if (!ofw_ebus_map_interrupt(node->parent,
node              139 kernel/arch/sparc64/src/drivers/kbd.c void kbd_init(ofw_tree_node_t *node)
node              142 kernel/arch/sparc64/src/drivers/kbd.c 	kbd_ns16550_init(node);
node               82 kernel/arch/sparc64/src/drivers/pci.c pci_t *pci_sabre_init(ofw_tree_node_t *node)
node               90 kernel/arch/sparc64/src/drivers/pci.c 	prop = ofw_tree_getprop(node, "reg");
node              101 kernel/arch/sparc64/src/drivers/pci.c 	if (!ofw_upa_apply_ranges(node->parent, &reg[SABRE_INTERNAL_REG],
node              123 kernel/arch/sparc64/src/drivers/pci.c pci_t *pci_psycho_init(ofw_tree_node_t *node)
node              131 kernel/arch/sparc64/src/drivers/pci.c 	prop = ofw_tree_getprop(node, "reg");
node              142 kernel/arch/sparc64/src/drivers/pci.c 	if (!ofw_upa_apply_ranges(node->parent, &reg[PSYCHO_INTERNAL_REG],
node              169 kernel/arch/sparc64/src/drivers/pci.c pci_t *pci_init(ofw_tree_node_t *node)
node              176 kernel/arch/sparc64/src/drivers/pci.c 	assert(str_cmp(ofw_tree_node_name(node), "pci") == 0);
node              181 kernel/arch/sparc64/src/drivers/pci.c 	prop = ofw_tree_getprop(node, "model");
node              190 kernel/arch/sparc64/src/drivers/pci.c 		return pci_sabre_init(node);
node              197 kernel/arch/sparc64/src/drivers/pci.c 		return pci_psycho_init(node);
node               60 kernel/arch/sparc64/src/drivers/scr.c void scr_init(ofw_tree_node_t *node)
node               69 kernel/arch/sparc64/src/drivers/scr.c 	name = ofw_tree_node_name(node);
node               96 kernel/arch/sparc64/src/drivers/scr.c 	prop = ofw_tree_getprop(node, "width");
node              100 kernel/arch/sparc64/src/drivers/scr.c 	prop = ofw_tree_getprop(node, "height");
node              104 kernel/arch/sparc64/src/drivers/scr.c 	prop = ofw_tree_getprop(node, "depth");
node              108 kernel/arch/sparc64/src/drivers/scr.c 	prop = ofw_tree_getprop(node, "linebytes");
node              112 kernel/arch/sparc64/src/drivers/scr.c 	prop = ofw_tree_getprop(node, "reg");
node              125 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_pci_reg_absolutize(node, pci_reg, &pci_abs_reg)) {
node              131 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_pci_apply_ranges(node->parent, &pci_abs_reg,
node              171 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_pci_reg_absolutize(node, pci_reg, &pci_abs_reg)) {
node              177 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_pci_apply_ranges(node->parent, &pci_abs_reg,
node              215 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_upa_apply_ranges(node->parent, upa_reg, &fb_addr)) {
node              234 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_sbus_apply_ranges(node->parent, sbus_reg, &fb_addr)) {
node              250 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_pci_reg_absolutize(node, pci_reg, &pci_abs_reg)) {
node              256 kernel/arch/sparc64/src/drivers/scr.c 		if (!ofw_pci_apply_ranges(node->parent, &pci_abs_reg,
node               57 kernel/arch/sparc64/src/drivers/tty.c static bool tty_ns16550_init(ofw_tree_node_t *node)
node               59 kernel/arch/sparc64/src/drivers/tty.c 	const char *name = ofw_tree_node_name(node);
node               67 kernel/arch/sparc64/src/drivers/tty.c 	ofw_tree_property_t *prop = ofw_tree_getprop(node, "interrupts");
node               79 kernel/arch/sparc64/src/drivers/tty.c 	prop = ofw_tree_getprop(node, "reg");
node               87 kernel/arch/sparc64/src/drivers/tty.c 	if (!ofw_ebus_apply_ranges(node->parent,
node               97 kernel/arch/sparc64/src/drivers/tty.c 	if (!ofw_ebus_map_interrupt(node->parent,
node              131 kernel/arch/sparc64/src/drivers/tty.c void tty_init(ofw_tree_node_t *node)
node              134 kernel/arch/sparc64/src/drivers/tty.c 	tty_ns16550_init(node);
node               62 kernel/arch/sparc64/src/smp/sun4u/smp.c 	ofw_tree_node_t *node;
node               66 kernel/arch/sparc64/src/smp/sun4u/smp.c 		node = ofw_tree_find_child_by_device_type(cpus_parent(), "cpu");
node               67 kernel/arch/sparc64/src/smp/sun4u/smp.c 		while (node) {
node               69 kernel/arch/sparc64/src/smp/sun4u/smp.c 			node = ofw_tree_find_peer_by_device_type(node, "cpu");
node               72 kernel/arch/sparc64/src/smp/sun4u/smp.c 		node = ofw_tree_find_child(cpus_parent(), "cmp");
node               73 kernel/arch/sparc64/src/smp/sun4u/smp.c 		while (node) {
node               75 kernel/arch/sparc64/src/smp/sun4u/smp.c 			node = ofw_tree_find_peer_by_name(node, "cmp");
node               87 kernel/arch/sparc64/src/smp/sun4u/smp.c static void wakeup_cpu(ofw_tree_node_t *node)
node               93 kernel/arch/sparc64/src/smp/sun4u/smp.c 	prop = ofw_tree_getprop(node, "upa-portid");
node               95 kernel/arch/sparc64/src/smp/sun4u/smp.c 		prop = ofw_tree_getprop(node, "portid");
node               97 kernel/arch/sparc64/src/smp/sun4u/smp.c 		prop = ofw_tree_getprop(node, "cpuid");
node              116 kernel/arch/sparc64/src/smp/sun4u/smp.c 	ofw_tree_node_t *node;
node              120 kernel/arch/sparc64/src/smp/sun4u/smp.c 		node = ofw_tree_find_child_by_device_type(cpus_parent(), "cpu");
node              121 kernel/arch/sparc64/src/smp/sun4u/smp.c 		for (i = 0; node;
node              122 kernel/arch/sparc64/src/smp/sun4u/smp.c 		    node = ofw_tree_find_peer_by_device_type(node, "cpu"), i++)
node              123 kernel/arch/sparc64/src/smp/sun4u/smp.c 			wakeup_cpu(node);
node              125 kernel/arch/sparc64/src/smp/sun4u/smp.c 		node = ofw_tree_find_child(cpus_parent(), "cmp");
node              126 kernel/arch/sparc64/src/smp/sun4u/smp.c 		while (node) {
node              127 kernel/arch/sparc64/src/smp/sun4u/smp.c 			wakeup_cpu(ofw_tree_find_child(node, "cpu@0"));
node              128 kernel/arch/sparc64/src/smp/sun4u/smp.c 			wakeup_cpu(ofw_tree_find_child(node, "cpu@1"));
node              129 kernel/arch/sparc64/src/smp/sun4u/smp.c 			node = ofw_tree_find_peer_by_name(node, "cmp");
node              183 kernel/arch/sparc64/src/smp/sun4v/smp.c 	md_node_t node = md_get_root();
node              186 kernel/arch/sparc64/src/smp/sun4v/smp.c 	while (md_next_node(&node, "cpu")) {
node              189 kernel/arch/sparc64/src/smp/sun4v/smp.c 		md_get_integer_property(node, "id", &cpuid);
node              201 kernel/arch/sparc64/src/smp/sun4v/smp.c 		md_child_iter_t it = md_get_child_iterator(node);
node              276 kernel/arch/sparc64/src/smp/sun4v/smp.c 		node = md_get_root();
node              279 kernel/arch/sparc64/src/smp/sun4v/smp.c 		while (md_next_node(&node, "cpu")) {
node              281 kernel/arch/sparc64/src/smp/sun4v/smp.c 			md_get_integer_property(node, "id", &cpuid);
node              123 kernel/arch/sparc64/src/sun4v/md.c const char *md_get_node_name(md_node_t node)
node              125 kernel/arch/sparc64/src/sun4v/md.c 	return get_element_name(node);
node              133 kernel/arch/sparc64/src/sun4v/md.c bool md_get_integer_property(md_node_t node, const char *key,
node              136 kernel/arch/sparc64/src/sun4v/md.c 	element_idx_t idx = node;
node              156 kernel/arch/sparc64/src/sun4v/md.c bool md_get_string_property(md_node_t node, const char *key,
node              160 kernel/arch/sparc64/src/sun4v/md.c 	element_idx_t idx = node;
node              242 kernel/arch/sparc64/src/sun4v/md.c md_node_t md_get_child(md_node_t node, char *name)
node              250 kernel/arch/sparc64/src/sun4v/md.c 		while (md_next_child(&node)) {
node              251 kernel/arch/sparc64/src/sun4v/md.c 			element_idx_t child = md_get_child_node(node);
node              253 kernel/arch/sparc64/src/sun4v/md.c 				node = child;
node              260 kernel/arch/sparc64/src/sun4v/md.c 	return node;
node              276 kernel/arch/sparc64/src/sun4v/md.c md_child_iter_t md_get_child_iterator(md_node_t node)
node              278 kernel/arch/sparc64/src/sun4v/md.c 	return node;
node              285 kernel/arch/sparc64/src/sun4v/md.c bool md_next_node(md_node_t *node, const char *name)
node              288 kernel/arch/sparc64/src/sun4v/md.c 	(*node)++;
node              291 kernel/arch/sparc64/src/sun4v/md.c 		element = get_element(*node);
node              294 kernel/arch/sparc64/src/sun4v/md.c 		    str_cmp(name, get_element_name(*node)) == 0) {
node              298 kernel/arch/sparc64/src/sun4v/md.c 		(*node)++;
node               48 kernel/genarch/src/ofw/ebus.c ofw_ebus_apply_ranges(ofw_tree_node_t *node, ofw_ebus_reg_t *reg, uintptr_t *pa)
node               54 kernel/genarch/src/ofw/ebus.c 	prop = ofw_tree_getprop(node, "ranges");
node               75 kernel/genarch/src/ofw/ebus.c 			return ofw_pci_apply_ranges(node->parent, &pci_reg, pa);
node               83 kernel/genarch/src/ofw/ebus.c ofw_ebus_map_interrupt(ofw_tree_node_t *node, ofw_ebus_reg_t *reg,
node               89 kernel/genarch/src/ofw/ebus.c 	prop = ofw_tree_getprop(node, "interrupt-map");
node               98 kernel/genarch/src/ofw/ebus.c 	prop = ofw_tree_getprop(node, "interrupt-map-mask");
node               65 kernel/genarch/src/ofw/ofw_tree.c ofw_tree_property_t *ofw_tree_getprop(const ofw_tree_node_t *node,
node               68 kernel/genarch/src/ofw/ofw_tree.c 	for (size_t i = 0; i < node->properties; i++) {
node               69 kernel/genarch/src/ofw/ofw_tree.c 		if (str_cmp(node->property[i].name, name) == 0)
node               70 kernel/genarch/src/ofw/ofw_tree.c 			return &node->property[i];
node               84 kernel/genarch/src/ofw/ofw_tree.c const char *ofw_tree_node_name(const ofw_tree_node_t *node)
node               86 kernel/genarch/src/ofw/ofw_tree.c 	ofw_tree_property_t *prop = ofw_tree_getprop(node, "name");
node              102 kernel/genarch/src/ofw/ofw_tree.c ofw_tree_node_t *ofw_tree_find_child(ofw_tree_node_t *node,
node              108 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node->child; cur; cur = cur->peer) {
node              120 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node->child; cur; cur = cur->peer) {
node              137 kernel/genarch/src/ofw/ofw_tree.c ofw_tree_node_t *ofw_tree_find_child_by_device_type(ofw_tree_node_t *node,
node              140 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node->child; cur; cur = cur->peer) {
node              174 kernel/genarch/src/ofw/ofw_tree.c 			ofw_tree_node_t *node =
node              176 kernel/genarch/src/ofw/ofw_tree.c 			if (node)
node              177 kernel/genarch/src/ofw/ofw_tree.c 				return node;
node              193 kernel/genarch/src/ofw/ofw_tree.c ofw_tree_node_t *ofw_tree_find_peer_by_device_type(ofw_tree_node_t *node,
node              196 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node->peer; cur; cur = cur->peer) {
node              219 kernel/genarch/src/ofw/ofw_tree.c ofw_tree_node_t *ofw_tree_find_peer_by_name(ofw_tree_node_t *node,
node              222 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node->peer; cur; cur = cur->peer) {
node              249 kernel/genarch/src/ofw/ofw_tree.c 	ofw_tree_node_t *node = ofw_root;
node              252 kernel/genarch/src/ofw/ofw_tree.c 	for (size_t i = 1; (i < str_size(path)) && (node); i = j + 1) {
node              264 kernel/genarch/src/ofw/ofw_tree.c 		node = ofw_tree_find_child(node, buf);
node              267 kernel/genarch/src/ofw/ofw_tree.c 	return node;
node              283 kernel/genarch/src/ofw/ofw_tree.c static bool ofw_tree_walk_by_device_type_internal(ofw_tree_node_t *node,
node              286 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node; cur; cur = cur->peer) {
node              339 kernel/genarch/src/ofw/ofw_tree.c 	ofw_tree_node_t *node = (ofw_tree_node_t *) data;
node              343 kernel/genarch/src/ofw/ofw_tree.c 	for (size_t i = 0; i < node->properties; i++)
node              344 kernel/genarch/src/ofw/ofw_tree.c 		*size += str_size(node->property[i].name) + 1 +
node              345 kernel/genarch/src/ofw/ofw_tree.c 		    sizeof(node->property[i].size) + node->property[i].size;
node              358 kernel/genarch/src/ofw/ofw_tree.c 	for (size_t i = 0; i < node->properties; i++) {
node              360 kernel/genarch/src/ofw/ofw_tree.c 		str_cpy(dump + pos, *size - pos, node->property[i].name);
node              361 kernel/genarch/src/ofw/ofw_tree.c 		pos += str_size(node->property[i].name) + 1;
node              364 kernel/genarch/src/ofw/ofw_tree.c 		memcpy(dump + pos, &node->property[i].size,
node              365 kernel/genarch/src/ofw/ofw_tree.c 		    sizeof(node->property[i].size));
node              366 kernel/genarch/src/ofw/ofw_tree.c 		pos += sizeof(node->property[i].size);
node              369 kernel/genarch/src/ofw/ofw_tree.c 		memcpy(dump + pos, node->property[i].value,
node              370 kernel/genarch/src/ofw/ofw_tree.c 		    node->property[i].size);
node              371 kernel/genarch/src/ofw/ofw_tree.c 		pos += node->property[i].size;
node              386 kernel/genarch/src/ofw/ofw_tree.c static void ofw_tree_node_sysinfo(ofw_tree_node_t *node, const char *path)
node              392 kernel/genarch/src/ofw/ofw_tree.c 	for (ofw_tree_node_t *cur = node; cur; cur = cur->peer) {
node               53 kernel/genarch/src/ofw/pci.c ofw_pci_apply_ranges(ofw_tree_node_t *node, ofw_pci_reg_t *reg, uintptr_t *pa)
node               59 kernel/genarch/src/ofw/pci.c 	prop = ofw_tree_getprop(node, "ranges");
node               61 kernel/genarch/src/ofw/pci.c 		if (str_cmp(ofw_tree_node_name(node->parent), "pci") == 0)
node               62 kernel/genarch/src/ofw/pci.c 			return ofw_pci_apply_ranges(node->parent, reg, pa);
node               87 kernel/genarch/src/ofw/pci.c ofw_pci_reg_absolutize(ofw_tree_node_t *node, ofw_pci_reg_t *reg,
node              102 kernel/genarch/src/ofw/pci.c 	prop = ofw_tree_getprop(node, "assigned-addresses");
node              130 kernel/genarch/src/ofw/pci.c ofw_pci_map_interrupt(ofw_tree_node_t *node, ofw_pci_reg_t *reg, int ino,
node              133 kernel/genarch/src/ofw/pci.c 	pci_t *pci = node->device;
node              135 kernel/genarch/src/ofw/pci.c 		pci = pci_init(node);
node              138 kernel/genarch/src/ofw/pci.c 		node->device = pci;
node               42 kernel/genarch/src/ofw/sbus.c bool ofw_sbus_apply_ranges(ofw_tree_node_t *node, ofw_sbus_reg_t *reg,
node               55 kernel/genarch/src/ofw/sbus.c 	if (!node->parent || node->parent->parent)
node               58 kernel/genarch/src/ofw/sbus.c 	prop = ofw_tree_getprop(node, "ranges");
node               45 kernel/genarch/src/ofw/upa.c bool ofw_upa_apply_ranges(ofw_tree_node_t *node, ofw_upa_reg_t *reg, uintptr_t *pa)
node               66 uspace/app/bithenge/test.c 		bithenge_node_t *node = NULL, *node2 = NULL;
node               82 uspace/app/bithenge/test.c 		rc = bithenge_node_from_source(&node, argv[2]);
node               85 uspace/app/bithenge/test.c 			node = NULL;
node               89 uspace/app/bithenge/test.c 		rc = bithenge_transform_apply(transform, scope, node, &node2);
node               98 uspace/app/bithenge/test.c 		bithenge_node_dec_ref(node);
node               99 uspace/app/bithenge/test.c 		node = NULL;
node              119 uspace/app/bithenge/test.c 		bithenge_node_dec_ref(node);
node               63 uspace/app/sbi/src/ancr.c static void ancr_csi_process(stree_program_t *prog, stree_csi_t *node);
node               66 uspace/app/sbi/src/ancr.c static void ancr_csi_print_cycle(stree_program_t *prog, stree_csi_t *node);
node               78 uspace/app/sbi/src/ancr.c 	list_node_t *node;
node               82 uspace/app/sbi/src/ancr.c 	node = list_first(&prog->module->members);
node               84 uspace/app/sbi/src/ancr.c 	while (node != NULL) {
node               85 uspace/app/sbi/src/ancr.c 		modm = list_node_data(node, stree_modm_t *);
node               95 uspace/app/sbi/src/ancr.c 		node = list_next(&prog->module->members, node);
node              110 uspace/app/sbi/src/ancr.c 	list_node_t *node;
node              117 uspace/app/sbi/src/ancr.c 	node = list_first(&csi->members);
node              118 uspace/app/sbi/src/ancr.c 	while (node != NULL) {
node              119 uspace/app/sbi/src/ancr.c 		csimbr = list_node_data(node, stree_csimbr_t *);
node              123 uspace/app/sbi/src/ancr.c 		node = list_next(&csi->members, node);
node              279 uspace/app/sbi/src/ancr.c static void ancr_csi_print_cycle(stree_program_t *prog, stree_csi_t *node)
node              287 uspace/app/sbi/src/ancr.c 	n = node;
node              289 uspace/app/sbi/src/ancr.c 		node_sym = csi_to_symbol(node);
node              296 uspace/app/sbi/src/ancr.c 			node = outer_csi;
node              298 uspace/app/sbi/src/ancr.c 			node = NULL;
node              300 uspace/app/sbi/src/ancr.c 			pred_n = list_first(&node->inherit);
node              309 uspace/app/sbi/src/ancr.c 					node = pred_csi;
node              314 uspace/app/sbi/src/ancr.c 			assert(node != NULL);
node              316 uspace/app/sbi/src/ancr.c 	} while (n != node);
node              318 uspace/app/sbi/src/ancr.c 	node_sym = csi_to_symbol(node);
node               75 uspace/app/sbi/src/intmap.c 	list_node_t *node;
node               78 uspace/app/sbi/src/intmap.c 	node = list_first(&intmap->elem);
node               79 uspace/app/sbi/src/intmap.c 	while (node != NULL) {
node               80 uspace/app/sbi/src/intmap.c 		elem = list_node_data(node, map_elem_t *);
node               87 uspace/app/sbi/src/intmap.c 				list_remove(&intmap->elem, node);
node               92 uspace/app/sbi/src/intmap.c 		node = list_next(&intmap->elem, node);
node              118 uspace/app/sbi/src/intmap.c 	list_node_t *node;
node              121 uspace/app/sbi/src/intmap.c 	node = list_first(&intmap->elem);
node              122 uspace/app/sbi/src/intmap.c 	while (node != NULL) {
node              123 uspace/app/sbi/src/intmap.c 		elem = list_node_data(node, map_elem_t *);
node              127 uspace/app/sbi/src/intmap.c 		node = list_next(&intmap->elem, node);
node              144 uspace/app/sbi/src/intmap.c 	list_node_t *node;
node              146 uspace/app/sbi/src/intmap.c 	node = list_first(&intmap->elem);
node              147 uspace/app/sbi/src/intmap.c 	if (node == NULL)
node              150 uspace/app/sbi/src/intmap.c 	return list_node_data(node, map_elem_t *);
node               44 uspace/app/sbi/src/list.c static void list_node_delete(list_node_t *node);
node               47 uspace/app/sbi/src/list.c static bool_t list_node_present(list_t *list, list_node_t *node);
node               80 uspace/app/sbi/src/list.c 	list_node_t *node;
node               82 uspace/app/sbi/src/list.c 	node = list_node_new(data);
node               83 uspace/app/sbi/src/list.c 	list_node_insert_between(node, list->head.prev, &list->head);
node               95 uspace/app/sbi/src/list.c 	list_node_t *node;
node               97 uspace/app/sbi/src/list.c 	node = list_node_new(data);
node               98 uspace/app/sbi/src/list.c 	list_node_insert_between(node, list->head.prev, &list->head);
node              110 uspace/app/sbi/src/list.c void list_remove(list_t *list, list_node_t *node)
node              113 uspace/app/sbi/src/list.c 	assert(list_node_present(list, node));
node              114 uspace/app/sbi/src/list.c 	list_node_unlink(node);
node              115 uspace/app/sbi/src/list.c 	node->data = NULL;
node              116 uspace/app/sbi/src/list.c 	list_node_delete(node);
node              126 uspace/app/sbi/src/list.c 	list_node_t *node;
node              129 uspace/app/sbi/src/list.c 	node = list->head.next;
node              131 uspace/app/sbi/src/list.c 	return (node != &list->head) ? node : NULL;
node              141 uspace/app/sbi/src/list.c 	list_node_t *node;
node              144 uspace/app/sbi/src/list.c 	node = list->head.prev;
node              146 uspace/app/sbi/src/list.c 	return (node != &list->head) ? node : NULL;
node              155 uspace/app/sbi/src/list.c list_node_t *list_next(list_t *list, list_node_t *node)
node              159 uspace/app/sbi/src/list.c 	assert(node != NULL);
node              161 uspace/app/sbi/src/list.c 	return (node->next != &list->head) ? node->next : NULL;
node              170 uspace/app/sbi/src/list.c list_node_t *list_prev(list_t *list, list_node_t *node)
node              174 uspace/app/sbi/src/list.c 	assert(node != NULL);
node              176 uspace/app/sbi/src/list.c 	return (node->prev != &list->head) ? node->prev : NULL;
node              196 uspace/app/sbi/src/list.c void list_node_setdata(list_node_t *node, void *data)
node              198 uspace/app/sbi/src/list.c 	node->data = data;
node              208 uspace/app/sbi/src/list.c 	list_node_t *node;
node              210 uspace/app/sbi/src/list.c 	node = malloc(sizeof(list_node_t));
node              211 uspace/app/sbi/src/list.c 	if (node == NULL) {
node              216 uspace/app/sbi/src/list.c 	node->prev = NULL;
node              217 uspace/app/sbi/src/list.c 	node->next = NULL;
node              218 uspace/app/sbi/src/list.c 	node->data = data;
node              220 uspace/app/sbi/src/list.c 	return node;
node              227 uspace/app/sbi/src/list.c static void list_node_delete(list_node_t *node)
node              229 uspace/app/sbi/src/list.c 	assert(node->prev == NULL);
node              230 uspace/app/sbi/src/list.c 	assert(node->next == NULL);
node              231 uspace/app/sbi/src/list.c 	assert(node->data == NULL);
node              232 uspace/app/sbi/src/list.c 	free(node);
node              288 uspace/app/sbi/src/list.c static bool_t list_node_present(list_t *list, list_node_t *node)
node              294 uspace/app/sbi/src/list.c 		if (m == node)
node               39 uspace/app/sbi/src/list.h void list_remove(list_t *list, list_node_t *node);
node               43 uspace/app/sbi/src/list.h list_node_t *list_next(list_t *list, list_node_t *node);
node               44 uspace/app/sbi/src/list.h list_node_t *list_prev(list_t *list, list_node_t *node);
node               47 uspace/app/sbi/src/list.h void list_node_setdata(list_node_t *node, void *data);
node               49 uspace/app/sbi/src/list.h #define list_node_data(node, dtype) ((dtype)(node->data))
node              186 uspace/app/sbi/src/run.c 	list_node_t *node;
node              226 uspace/app/sbi/src/run.c 	node = list_last(&run->thread_ar->proc_ar);
node              227 uspace/app/sbi/src/run.c 	assert(list_node_data(node, run_proc_ar_t *) == proc_ar);
node              228 uspace/app/sbi/src/run.c 	list_remove(&run->thread_ar->proc_ar, node);
node              244 uspace/app/sbi/src/run.c 	list_node_t *node;
node              259 uspace/app/sbi/src/run.c 	node = list_first(&block->stats);
node              260 uspace/app/sbi/src/run.c 	while (node != NULL) {
node              261 uspace/app/sbi/src/run.c 		stat = list_node_data(node, stree_stat_t *);
node              267 uspace/app/sbi/src/run.c 		node = list_next(&block->stats, node);
node              275 uspace/app/sbi/src/run.c 	node = list_last(&proc_ar->block_ar);
node              276 uspace/app/sbi/src/run.c 	assert(list_node_data(node, run_block_ar_t *) == block_ar);
node              277 uspace/app/sbi/src/run.c 	list_remove(&proc_ar->block_ar, node);
node              873 uspace/app/sbi/src/run.c 	list_node_t *node;
node              876 uspace/app/sbi/src/run.c 	node = list_last(&proc_ar->block_ar);
node              879 uspace/app/sbi/src/run.c 	while (node != NULL) {
node              880 uspace/app/sbi/src/run.c 		block_ar = list_node_data(node, run_block_ar_t *);
node              885 uspace/app/sbi/src/run.c 		node = list_prev(&proc_ar->block_ar, node);
node              899 uspace/app/sbi/src/run.c 	list_node_t *node;
node              901 uspace/app/sbi/src/run.c 	node = list_last(&run->thread_ar->proc_ar);
node              902 uspace/app/sbi/src/run.c 	return list_node_data(node, run_proc_ar_t *);
node              913 uspace/app/sbi/src/run.c 	list_node_t *node;
node              917 uspace/app/sbi/src/run.c 	node = list_last(&proc_ar->block_ar);
node              918 uspace/app/sbi/src/run.c 	return list_node_data(node, run_block_ar_t *);
node             1376 uspace/app/sbi/src/run.c 	list_node_t *node;
node             1380 uspace/app/sbi/src/run.c 	node = list_last(&run->thread_ar->proc_ar);
node             1381 uspace/app/sbi/src/run.c 	while (node != NULL) {
node             1383 uspace/app/sbi/src/run.c 		proc_ar = list_node_data(node, run_proc_ar_t *);
node             1387 uspace/app/sbi/src/run.c 		node = list_prev(&run->thread_ar->proc_ar, node);
node             1412 uspace/app/sbi/src/run_expr.c 	list_node_t *node;
node             1432 uspace/app/sbi/src/run_expr.c 	node = list_first(&tarray->extents);
node             1433 uspace/app/sbi/src/run_expr.c 	if (node == NULL) {
node             1441 uspace/app/sbi/src/run_expr.c 	while (node != NULL) {
node             1442 uspace/app/sbi/src/run_expr.c 		expr = list_node_data(node, stree_expr_t *);
node             1480 uspace/app/sbi/src/run_expr.c 		node = list_next(&tarray->extents, node);
node             2180 uspace/app/sbi/src/run_expr.c 	list_node_t *node;
node             2214 uspace/app/sbi/src/run_expr.c 	node = list_first(&index->args);
node             2217 uspace/app/sbi/src/run_expr.c 	while (node != NULL) {
node             2218 uspace/app/sbi/src/run_expr.c 		arg = list_node_data(node, stree_expr_t *);
node             2234 uspace/app/sbi/src/run_expr.c 		node = list_next(&index->args, node);
node             2282 uspace/app/sbi/src/run_expr.c 	list_node_t *node;
node             2311 uspace/app/sbi/src/run_expr.c 	node = list_first(args);
node             2314 uspace/app/sbi/src/run_expr.c 	while (node != NULL) {
node             2321 uspace/app/sbi/src/run_expr.c 		arg = list_node_data(node, rdata_item_t *);
node             2349 uspace/app/sbi/src/run_expr.c 		node = list_next(args, node);
node             2392 uspace/app/sbi/src/run_expr.c 	list_node_t *node;
node             2440 uspace/app/sbi/src/run_expr.c 	node = list_first(args);
node             2441 uspace/app/sbi/src/run_expr.c 	while (node != NULL) {
node             2442 uspace/app/sbi/src/run_expr.c 		arg = list_node_data(node, rdata_item_t *);
node             2453 uspace/app/sbi/src/run_expr.c 		node = list_next(args, node);
node             2470 uspace/app/sbi/src/run_expr.c 	list_node_t *node;
node             2503 uspace/app/sbi/src/run_expr.c 	node = list_first(args);
node             2506 uspace/app/sbi/src/run_expr.c 	assert(node != NULL);
node             2515 uspace/app/sbi/src/run_expr.c 		arg = list_node_data(node, rdata_item_t *);
node             2529 uspace/app/sbi/src/run_expr.c 		node = list_next(args, node);
node             2531 uspace/app/sbi/src/run_expr.c 	} while (node != NULL);
node             2864 uspace/app/sbi/src/run_expr.c 	list_node_t *node;
node             2888 uspace/app/sbi/src/run_expr.c 		node = list_first(&csi->members);
node             2889 uspace/app/sbi/src/run_expr.c 		while (node != NULL) {
node             2890 uspace/app/sbi/src/run_expr.c 			csimbr = list_node_data(node, stree_csimbr_t *);
node             2913 uspace/app/sbi/src/run_expr.c 			node = list_next(&csi->members, node);
node              999 uspace/app/sbi/src/stree.c 	list_node_t *node;
node             1002 uspace/app/sbi/src/stree.c 	node = list_first(&symbol->attr);
node             1003 uspace/app/sbi/src/stree.c 	while (node != NULL) {
node             1004 uspace/app/sbi/src/stree.c 		attr = list_node_data(node, stree_symbol_attr_t *);
node             1008 uspace/app/sbi/src/stree.c 		node = list_next(&symbol->attr, node);
node             1022 uspace/app/sbi/src/stree.c 	list_node_t *node;
node             1025 uspace/app/sbi/src/stree.c 	node = list_first(&arg->attr);
node             1026 uspace/app/sbi/src/stree.c 	while (node != NULL) {
node             1027 uspace/app/sbi/src/stree.c 		attr = list_node_data(node, stree_arg_attr_t *);
node             1031 uspace/app/sbi/src/stree.c 		node = list_next(&arg->attr, node);
node               66 uspace/app/sbi/src/strtab.c 	list_node_t *node;
node               70 uspace/app/sbi/src/strtab.c 	node = list_first(&str_list);
node               72 uspace/app/sbi/src/strtab.c 	while (node != NULL) {
node               74 uspace/app/sbi/src/strtab.c 		if (os_str_cmp(str, list_node_data(node, char *)) == 0)
node               77 uspace/app/sbi/src/strtab.c 		node = list_next(&str_list, node);
node               96 uspace/app/sbi/src/strtab.c 	list_node_t *node;
node               99 uspace/app/sbi/src/strtab.c 	node = list_first(&str_list);
node              101 uspace/app/sbi/src/strtab.c 	while (node != NULL && cnt < sid) {
node              102 uspace/app/sbi/src/strtab.c 		node = list_next(&str_list, node);
node              106 uspace/app/sbi/src/strtab.c 	if (node == NULL) {
node              111 uspace/app/sbi/src/strtab.c 	return list_node_data(node, char *);
node             2151 uspace/app/sbi/src/stype.c 	list_node_t *node;
node             2154 uspace/app/sbi/src/stype.c 	node = list_last(&proc_vr->block_vr);
node             2157 uspace/app/sbi/src/stype.c 	while (node != NULL) {
node             2158 uspace/app/sbi/src/stype.c 		block_vr = list_node_data(node, stype_block_vr_t *);
node             2163 uspace/app/sbi/src/stype.c 		node = list_prev(&proc_vr->block_vr, node);
node             2305 uspace/app/sbi/src/stype.c 	list_node_t *node;
node             2307 uspace/app/sbi/src/stype.c 	node = list_last(&stype->proc_vr->block_vr);
node             2308 uspace/app/sbi/src/stype.c 	return list_node_data(node, stype_block_vr_t *);
node              164 uspace/app/sbi/src/symbol.c 	list_node_t *node;
node              172 uspace/app/sbi/src/symbol.c 	node = list_first(&scope->members);
node              173 uspace/app/sbi/src/symbol.c 	while (node != NULL) {
node              174 uspace/app/sbi/src/symbol.c 		csimbr = list_node_data(node, stree_csimbr_t *);
node              182 uspace/app/sbi/src/symbol.c 		node = list_next(&scope->members, node);
node              198 uspace/app/sbi/src/symbol.c 	list_node_t *node;
node              203 uspace/app/sbi/src/symbol.c 	node = list_first(&prog->module->members);
node              204 uspace/app/sbi/src/symbol.c 	while (node != NULL) {
node              205 uspace/app/sbi/src/symbol.c 		modm = list_node_data(node, stree_modm_t *);
node              237 uspace/app/sbi/src/symbol.c 		node = list_next(&prog->module->members, node);
node              325 uspace/app/sbi/src/symbol.c 	list_node_t *node;
node              331 uspace/app/sbi/src/symbol.c 	node = list_first(&prog->module->members);
node              332 uspace/app/sbi/src/symbol.c 	while (node != NULL) {
node              333 uspace/app/sbi/src/symbol.c 		modm = list_node_data(node, stree_modm_t *);
node              344 uspace/app/sbi/src/symbol.c 		node = list_next(&prog->module->members, node);
node              362 uspace/app/sbi/src/symbol.c 	list_node_t *node;
node              369 uspace/app/sbi/src/symbol.c 	node = list_first(&csi->members);
node              370 uspace/app/sbi/src/symbol.c 	while (node != NULL) {
node              371 uspace/app/sbi/src/symbol.c 		csimbr = list_node_data(node, stree_csimbr_t *);
node              399 uspace/app/sbi/src/symbol.c 		node = list_next(&csi->members, node);
node              118 uspace/app/sysinst/volume.c 	sif_node_t *node;
node              161 uspace/app/sysinst/volume.c 		node = sif_node_first_child(sif_get_root(doc));
node              164 uspace/app/sysinst/volume.c 		ntype = sif_node_get_type(node);
node              170 uspace/app/sysinst/volume.c 		rc = vol_volumes_load(node, volumes);
node              199 uspace/app/sysinst/volume.c 	sif_node_t *node;
node              225 uspace/app/sysinst/volume.c 		node = sif_node_first_child(sif_get_root(doc));
node              228 uspace/app/sysinst/volume.c 		ntype = sif_node_get_type(node);
node              234 uspace/app/sysinst/volume.c 		rc = vol_volumes_load(node, volumes);
node              621 uspace/app/sysinst/volume.c 	sif_node_t *node;
node              637 uspace/app/sysinst/volume.c 			rc = sif_node_append_child(nvolumes, "volume", &node);
node              641 uspace/app/sysinst/volume.c 			rc = sif_node_set_attr(node, "label", volume->label);
node              645 uspace/app/sysinst/volume.c 			rc = sif_node_set_attr(node, "mountp", volume->mountp);
node               48 uspace/drv/audio/hdaudio/codec.c static errno_t hda_ccmd(hda_codec_t *codec, int node, uint32_t vid, uint32_t payload,
node               59 uspace/drv/audio/hdaudio/codec.c 		    ((node & 0x1ff) << 20) |
node               64 uspace/drv/audio/hdaudio/codec.c 		    ((node & 0x1ff) << 20) |
node               81 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_parameter(hda_codec_t *codec, int node, hda_param_id_t param,
node               84 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_param_get, param, resp);
node               87 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_subnc(hda_codec_t *codec, int node, int *startnode,
node               93 uspace/drv/audio/hdaudio/codec.c 	rc = hda_get_parameter(codec, node, hda_sub_nc, &resp);
node              106 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_fgrp_type(hda_codec_t *codec, int node, bool *unsol,
node              112 uspace/drv/audio/hdaudio/codec.c 	rc = hda_get_parameter(codec, node, hda_fgrp_type, &resp);
node              122 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_clist_len(hda_codec_t *codec, int node, bool *longform,
node              128 uspace/drv/audio/hdaudio/codec.c 	rc = hda_get_parameter(codec, node, hda_clist_len, &resp);
node              138 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_clist_entry(hda_codec_t *codec, int node, int n, uint32_t *resp)
node              140 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_clist_entry_get, n, resp);
node              143 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_eapd_btl_enable(hda_codec_t *codec, int node, uint32_t *resp)
node              145 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_eapd_btl_enable_get, 0, resp);
node              148 uspace/drv/audio/hdaudio/codec.c static errno_t hda_set_eapd_btl_enable(hda_codec_t *codec, int node, uint8_t payload)
node              150 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_eapd_btl_enable_set, payload, NULL);
node              154 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_supp_rates(hda_codec_t *codec, int node, uint32_t *rates)
node              156 uspace/drv/audio/hdaudio/codec.c 	return hda_get_parameter(codec, node, hda_supp_rates, rates);
node              160 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_supp_formats(hda_codec_t *codec, int node, uint32_t *fmts)
node              162 uspace/drv/audio/hdaudio/codec.c 	return hda_get_parameter(codec, node, hda_supp_formats, fmts);
node              165 uspace/drv/audio/hdaudio/codec.c static errno_t hda_set_converter_fmt(hda_codec_t *codec, int node, uint16_t fmt)
node              167 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_converter_fmt_set, fmt, NULL);
node              170 uspace/drv/audio/hdaudio/codec.c static errno_t hda_set_converter_ctl(hda_codec_t *codec, int node, uint8_t stream,
node              176 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_converter_ctl_set, ctl, NULL);
node              179 uspace/drv/audio/hdaudio/codec.c static errno_t hda_set_pin_ctl(hda_codec_t *codec, int node, uint8_t pctl)
node              181 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_pin_ctl_set, pctl, NULL);
node              184 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_pin_ctl(hda_codec_t *codec, int node, uint8_t *pctl)
node              189 uspace/drv/audio/hdaudio/codec.c 	rc = hda_ccmd(codec, node, hda_pin_ctl_get, 0, &resp);
node              198 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_aw_caps(hda_codec_t *codec, int node,
node              204 uspace/drv/audio/hdaudio/codec.c 	rc = hda_get_parameter(codec, node, hda_aw_caps, &resp);
node              215 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_pin_caps(hda_codec_t *codec, int node, uint32_t *caps)
node              217 uspace/drv/audio/hdaudio/codec.c 	return hda_get_parameter(codec, node, hda_pin_caps, caps);
node              221 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_power_state(hda_codec_t *codec, int node, uint32_t *pstate)
node              223 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_power_state_get, 0, pstate);
node              227 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_cfg_def(hda_codec_t *codec, int node, uint32_t *cfgdef)
node              229 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_cfg_def_get, 0, cfgdef);
node              232 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_conn_sel(hda_codec_t *codec, int node, uint32_t *conn)
node              234 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_conn_sel_get, 0, conn);
node              238 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_amp_gain_mute(hda_codec_t *codec, int node, uint16_t payload,
node              242 uspace/drv/audio/hdaudio/codec.c 	    node, payload);
node              243 uspace/drv/audio/hdaudio/codec.c 	errno_t rc = hda_ccmd(codec, node, hda_amp_gain_mute_get, payload, resp);
node              245 uspace/drv/audio/hdaudio/codec.c 	    node, payload, *resp);
node              250 uspace/drv/audio/hdaudio/codec.c static errno_t hda_get_gpio_cnt(hda_codec_t *codec, int node, uint32_t *resp)
node              252 uspace/drv/audio/hdaudio/codec.c 	return hda_get_parameter(codec, node, hda_gpio_cnt, resp);
node              255 uspace/drv/audio/hdaudio/codec.c static errno_t hda_set_amp_gain_mute(hda_codec_t *codec, int node, uint16_t payload)
node              258 uspace/drv/audio/hdaudio/codec.c 	    node, payload);
node              259 uspace/drv/audio/hdaudio/codec.c 	return hda_ccmd(codec, node, hda_amp_gain_mute_set, payload, NULL);
node              224 uspace/lib/bithenge/include/bithenge/blob.h static inline bithenge_blob_t *bithenge_node_as_blob(bithenge_node_t *node)
node              226 uspace/lib/bithenge/include/bithenge/blob.h 	assert(node->type == BITHENGE_NODE_BLOB);
node              227 uspace/lib/bithenge/include/bithenge/blob.h 	return (bithenge_blob_t *)node;
node              105 uspace/lib/bithenge/include/bithenge/tree.h static inline bithenge_node_type_t bithenge_node_type(const bithenge_node_t *node)
node              107 uspace/lib/bithenge/include/bithenge/tree.h 	return node->type;
node              114 uspace/lib/bithenge/include/bithenge/tree.h static inline void bithenge_node_inc_ref(bithenge_node_t *node)
node              116 uspace/lib/bithenge/include/bithenge/tree.h 	assert(node);
node              117 uspace/lib/bithenge/include/bithenge/tree.h 	node->refs++;
node              121 uspace/lib/bithenge/include/bithenge/tree.h void bithenge_node_dec_ref(bithenge_node_t *node);
node              424 uspace/lib/bithenge/src/expression.c 	bithenge_node_t *node;
node              443 uspace/lib/bithenge/src/expression.c 	bithenge_node_inc_ref(self->node);
node              444 uspace/lib/bithenge/src/expression.c 	*out = self->node;
node              451 uspace/lib/bithenge/src/expression.c 	bithenge_node_dec_ref(self->node);
node              466 uspace/lib/bithenge/src/expression.c     bithenge_node_t *node)
node              480 uspace/lib/bithenge/src/expression.c 	self->node = node;
node              486 uspace/lib/bithenge/src/expression.c 	bithenge_node_dec_ref(node);
node              732 uspace/lib/bithenge/src/expression.c 		bithenge_node_t *node;
node              734 uspace/lib/bithenge/src/expression.c 		    &node);
node              737 uspace/lib/bithenge/src/expression.c 		rc = bithenge_scope_set_param(inner, i, node);
node              122 uspace/lib/bithenge/src/print.c static errno_t print_internal(state_t *state, bithenge_node_t *node)
node              128 uspace/lib/bithenge/src/print.c 	rc = bithenge_node_for_each(node, print_internal_func, state);
node              139 uspace/lib/bithenge/src/print.c static errno_t print_boolean(state_t *state, bithenge_node_t *node)
node              141 uspace/lib/bithenge/src/print.c 	bool value = bithenge_boolean_node_value(node);
node              153 uspace/lib/bithenge/src/print.c static errno_t print_integer(state_t *state, bithenge_node_t *node)
node              155 uspace/lib/bithenge/src/print.c 	bithenge_int_t value = bithenge_integer_node_value(node);
node              160 uspace/lib/bithenge/src/print.c static errno_t print_string(state_t *state, bithenge_node_t *node)
node              162 uspace/lib/bithenge/src/print.c 	const char *value = bithenge_string_node_value(node);
node              182 uspace/lib/bithenge/src/print.c static errno_t print_blob(state_t *state, bithenge_node_t *node)
node              184 uspace/lib/bithenge/src/print.c 	bithenge_blob_t *blob = bithenge_node_as_blob(node);
node              537 uspace/lib/bithenge/src/script.c 		bithenge_node_t *node;
node              538 uspace/lib/bithenge/src/script.c 		rc = bithenge_new_boolean_node(&node, val);
node              545 uspace/lib/bithenge/src/script.c 		rc = bithenge_const_expression(&expr, node);
node              565 uspace/lib/bithenge/src/script.c 		bithenge_node_t *node;
node              566 uspace/lib/bithenge/src/script.c 		rc = bithenge_new_integer_node(&node, val);
node              573 uspace/lib/bithenge/src/script.c 		rc = bithenge_const_expression(&expr, node);
node              824 uspace/lib/bithenge/src/script.c 	bithenge_node_t *node;
node              825 uspace/lib/bithenge/src/script.c 	errno_t rc = bithenge_new_empty_internal_node(&node);
node              832 uspace/lib/bithenge/src/script.c 	rc = bithenge_const_expression(&expr, node);
node              904 uspace/lib/bithenge/src/script.c 			bithenge_node_t *node;
node              905 uspace/lib/bithenge/src/script.c 			errno_t rc = bithenge_new_boolean_node(&node, true);
node              910 uspace/lib/bithenge/src/script.c 			rc = bithenge_const_expression(&expr, node);
node               64 uspace/lib/bithenge/src/sequence.c static bithenge_node_t *seq_as_node(seq_node_t *node)
node               66 uspace/lib/bithenge/src/sequence.c 	return &node->base;
node               69 uspace/lib/bithenge/src/sequence.c static seq_node_t *node_as_seq(bithenge_node_t *node)
node               71 uspace/lib/bithenge/src/sequence.c 	return (seq_node_t *)node;
node              303 uspace/lib/bithenge/src/sequence.c static seq_node_t *struct_as_seq(struct_node_t *node)
node              305 uspace/lib/bithenge/src/sequence.c 	return &node->base;
node              313 uspace/lib/bithenge/src/sequence.c static bithenge_node_t *struct_as_node(struct_node_t *node)
node              315 uspace/lib/bithenge/src/sequence.c 	return seq_as_node(struct_as_seq(node));
node              318 uspace/lib/bithenge/src/sequence.c static struct_node_t *node_as_struct(bithenge_node_t *node)
node              320 uspace/lib/bithenge/src/sequence.c 	return seq_as_struct(node_as_seq(node));
node              420 uspace/lib/bithenge/src/sequence.c 	struct_node_t *node = node_as_struct(base);
node              428 uspace/lib/bithenge/src/sequence.c 	bithenge_scope_t *scope = seq_node_scope(struct_as_seq(node));
node              436 uspace/lib/bithenge/src/sequence.c 		seq_node_destroy(struct_as_seq(node));
node              453 uspace/lib/bithenge/src/sequence.c 		struct_as_seq(node)->scope = NULL;
node              454 uspace/lib/bithenge/src/sequence.c 		seq_node_destroy(struct_as_seq(node));
node              457 uspace/lib/bithenge/src/sequence.c 	bithenge_transform_dec_ref(struct_as_transform(node->transform));
node              458 uspace/lib/bithenge/src/sequence.c 	free(node);
node              484 uspace/lib/bithenge/src/sequence.c 	struct_node_t *node = malloc(sizeof(*node));
node              485 uspace/lib/bithenge/src/sequence.c 	if (!node)
node              488 uspace/lib/bithenge/src/sequence.c 	errno_t rc = bithenge_init_internal_node(struct_as_node(node),
node              491 uspace/lib/bithenge/src/sequence.c 		free(node);
node              497 uspace/lib/bithenge/src/sequence.c 		free(node);
node              501 uspace/lib/bithenge/src/sequence.c 	rc = seq_node_init(struct_as_seq(node), &struct_node_seq_ops, inner,
node              505 uspace/lib/bithenge/src/sequence.c 		free(node);
node              510 uspace/lib/bithenge/src/sequence.c 	node->transform = self;
node              511 uspace/lib/bithenge/src/sequence.c 	node->prefix = prefix;
node              519 uspace/lib/bithenge/src/sequence.c 	bithenge_scope_set_current_node(inner, struct_as_node(node));
node              522 uspace/lib/bithenge/src/sequence.c 	*out = struct_as_node(node);
node              791 uspace/lib/bithenge/src/sequence.c 	repeat_node_t *node = malloc(sizeof(*node));
node              792 uspace/lib/bithenge/src/sequence.c 	if (!node)
node              795 uspace/lib/bithenge/src/sequence.c 	errno_t rc = bithenge_init_internal_node(repeat_as_node(node),
node              798 uspace/lib/bithenge/src/sequence.c 		free(node);
node              802 uspace/lib/bithenge/src/sequence.c 	rc = seq_node_init(repeat_as_seq(node), &repeat_node_seq_ops, scope,
node              805 uspace/lib/bithenge/src/sequence.c 		free(node);
node              810 uspace/lib/bithenge/src/sequence.c 	node->xform = self->xform;
node              811 uspace/lib/bithenge/src/sequence.c 	node->count = count;
node              812 uspace/lib/bithenge/src/sequence.c 	node->prefix = prefix;
node              813 uspace/lib/bithenge/src/sequence.c 	*out = repeat_as_node(node);
node             1049 uspace/lib/bithenge/src/sequence.c 	do_while_node_t *node = malloc(sizeof(*node));
node             1050 uspace/lib/bithenge/src/sequence.c 	if (!node)
node             1053 uspace/lib/bithenge/src/sequence.c 	errno_t rc = bithenge_init_internal_node(do_while_as_node(node),
node             1056 uspace/lib/bithenge/src/sequence.c 		free(node);
node             1060 uspace/lib/bithenge/src/sequence.c 	rc = seq_node_init(do_while_as_seq(node), &do_while_node_seq_ops,
node             1063 uspace/lib/bithenge/src/sequence.c 		free(node);
node             1068 uspace/lib/bithenge/src/sequence.c 	node->xform = self->xform;
node             1070 uspace/lib/bithenge/src/sequence.c 	node->expr = self->expr;
node             1071 uspace/lib/bithenge/src/sequence.c 	node->count = -1;
node             1072 uspace/lib/bithenge/src/sequence.c 	*out = do_while_as_node(node);
node              134 uspace/lib/bithenge/src/transform.c 	bithenge_node_t *node;
node              135 uspace/lib/bithenge/src/transform.c 	errno_t rc = bithenge_transform_prefix_apply(self, scope, blob, &node,
node              139 uspace/lib/bithenge/src/transform.c 	bithenge_node_dec_ref(node);
node              325 uspace/lib/bithenge/src/transform.c     bithenge_node_t *node)
node              328 uspace/lib/bithenge/src/transform.c 	scope->current_node = node;
node              348 uspace/lib/bithenge/src/transform.c void bithenge_scope_set_in_node(bithenge_scope_t *scope, bithenge_node_t *node)
node              351 uspace/lib/bithenge/src/transform.c 	scope->in_node = node;
node              402 uspace/lib/bithenge/src/transform.c     bithenge_node_t *node)
node              407 uspace/lib/bithenge/src/transform.c 		bithenge_node_dec_ref(node);
node              410 uspace/lib/bithenge/src/transform.c 	scope->params[i] = node;
node               75 uspace/lib/bithenge/src/tree.c void bithenge_node_dec_ref(bithenge_node_t *node)
node               77 uspace/lib/bithenge/src/tree.c 	if (!node)
node               79 uspace/lib/bithenge/src/tree.c 	assert (node->refs > 0);
node               80 uspace/lib/bithenge/src/tree.c 	if (--node->refs == 0)
node               81 uspace/lib/bithenge/src/tree.c 		node_destroy(node);
node              218 uspace/lib/bithenge/src/tree.c static simple_internal_node_t *node_as_simple(bithenge_node_t *node)
node              220 uspace/lib/bithenge/src/tree.c 	return (simple_internal_node_t *)node;
node              223 uspace/lib/bithenge/src/tree.c static bithenge_node_t *simple_as_node(simple_internal_node_t *node)
node              225 uspace/lib/bithenge/src/tree.c 	return &node->base;
node               98 uspace/lib/c/generic/uuid.c 		rc = rndgen_uint8(rndgen, &uuid->node[i]);
node              130 uspace/lib/c/generic/uuid.c 		buf[10 + i] = uuid->node[i];
node              149 uspace/lib/c/generic/uuid.c 		uuid->node[i] = buf[10 + i];
node              168 uspace/lib/c/generic/uuid.c 		buf[10 + i] = uuid->node[i];
node              187 uspace/lib/c/generic/uuid.c 		uuid->node[i] = buf[10 + i];
node              210 uspace/lib/c/generic/uuid.c 	uint64_t node;
node              229 uspace/lib/c/generic/uuid.c 	rc = str_uint64_t(str + 24, &eptr, 16, false, &node);
node              244 uspace/lib/c/generic/uuid.c 		uuid->node[i] = (node >> 8 * (5 - i)) & 0xff;
node              276 uspace/lib/c/generic/uuid.c 	    uuid->clock_seq_low, uuid->node[0], uuid->node[1], uuid->node[2],
node              277 uspace/lib/c/generic/uuid.c 	    uuid->node[3], uuid->node[4], uuid->node[5]);
node               50 uspace/lib/c/include/types/uuid.h 	uint8_t node[_UUID_NODE_LEN];
node              217 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 auto node = it.node();
node              224 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 iterator res{table_, idx, size_, node};
node              227 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 if (table_[idx].head == node)
node              229 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     if (node->next != node)
node              230 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                         table_[idx].head = node->next;
node              236 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 node->unlink();
node              237 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 delete node;
node               66 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp         void append(list_node<Value>* node)
node               69 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head = node;
node               71 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head->append(node);
node               74 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp         void prepend(list_node<Value>* node)
node               77 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head = node;
node               79 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head->prepend(node);
node              129 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              246 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              260 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              274 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              352 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              446 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              460 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              474 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp         return lhs.node() == rhs.node();
node              172 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 auto node = new node_type{move(val)};
node              173 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 bucket->prepend(node);
node              178 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                     node
node              213 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 auto node = new node_type{val};
node              214 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 bucket->prepend(node);
node              219 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                     node
node              255 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 auto node = new node_type{forward<value_type>(val)};
node              256 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 bucket->prepend(node);
node              261 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                     node
node              411 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto node = new node_type{forward<Args>(args)...};
node              413 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             return insert(table, node);
node              421 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto node = new node_type{val};
node              423 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             return insert(table, node);
node              432 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto node = new node_type{forward<value_type>(val)};
node              434 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             return insert(table, node);
node              438 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp         static typename Table::iterator insert(Table& table, typename Table::node_type* node)
node              444 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             const auto& key = table.get_key(node->value);
node              451 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 target->append(node);
node              453 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 bucket->prepend(node);
node              458 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 node
node               62 uspace/lib/cpp/include/__bits/adt/list.hpp                 list_const_iterator(list_node<value_type>* node = nullptr,
node               65 uspace/lib/cpp/include/__bits/adt/list.hpp                     : current_{node}, head_{head}, end_{end}
node               74 uspace/lib/cpp/include/__bits/adt/list.hpp                     : current_{other.node()}, head_{other.head()}, end_{other.end()}
node              175 uspace/lib/cpp/include/__bits/adt/list.hpp             return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              196 uspace/lib/cpp/include/__bits/adt/list.hpp                 list_iterator(list_node<value_type>* node = nullptr,
node              199 uspace/lib/cpp/include/__bits/adt/list.hpp                     : current_{node}, head_{head}, end_{end}
node              305 uspace/lib/cpp/include/__bits/adt/list.hpp             return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              317 uspace/lib/cpp/include/__bits/adt/list.hpp             return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              329 uspace/lib/cpp/include/__bits/adt/list.hpp             return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              707 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = position.node();
node              708 uspace/lib/cpp/include/__bits/adt/list.hpp                 node->prepend(new aux::list_node<value_type>{forward<Args>(args)...});
node              711 uspace/lib/cpp/include/__bits/adt/list.hpp                 if (node == head_)
node              714 uspace/lib/cpp/include/__bits/adt/list.hpp                 return iterator{node->prev, head_, false};
node              739 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = position.node()->prev;
node              743 uspace/lib/cpp/include/__bits/adt/list.hpp                     node->append(new aux::list_node<value_type>{*first++});
node              744 uspace/lib/cpp/include/__bits/adt/list.hpp                     node = node->next;
node              748 uspace/lib/cpp/include/__bits/adt/list.hpp                 return iterator{position.node()->next, head_, false};
node              758 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = position.node();
node              760 uspace/lib/cpp/include/__bits/adt/list.hpp                 if (node == head_)
node              771 uspace/lib/cpp/include/__bits/adt/list.hpp                         head_ = node->next;
node              774 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto next = node->next;
node              778 uspace/lib/cpp/include/__bits/adt/list.hpp                 node->unlink();
node              779 uspace/lib/cpp/include/__bits/adt/list.hpp                 delete node;
node              789 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto first_node = first.node();
node              790 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto last_node = last.node()->prev;
node              844 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = position.node();
node              845 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto prev = node->prev;
node              850 uspace/lib/cpp/include/__bits/adt/list.hpp                 node->prev = other_last;
node              851 uspace/lib/cpp/include/__bits/adt/list.hpp                 other_last->next = node;
node              855 uspace/lib/cpp/include/__bits/adt/list.hpp                 if (node == head_)
node              871 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = position.node();
node              872 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto target = it.node();
node              879 uspace/lib/cpp/include/__bits/adt/list.hpp                 node->prev->next = target;
node              880 uspace/lib/cpp/include/__bits/adt/list.hpp                 target->prev = node->prev;
node              882 uspace/lib/cpp/include/__bits/adt/list.hpp                 node->prev = target;
node              883 uspace/lib/cpp/include/__bits/adt/list.hpp                 target->next = node;
node              888 uspace/lib/cpp/include/__bits/adt/list.hpp                 if (it.node() == other.head_)
node              915 uspace/lib/cpp/include/__bits/adt/list.hpp                     other.head_ = last.node();
node              916 uspace/lib/cpp/include/__bits/adt/list.hpp                     other.head_->prev = first.node()->prev;
node              917 uspace/lib/cpp/include/__bits/adt/list.hpp                     first.node()->prev->next = last.node();
node              919 uspace/lib/cpp/include/__bits/adt/list.hpp                     first_node = first.node();
node              920 uspace/lib/cpp/include/__bits/adt/list.hpp                     last_node = last.node()->prev;
node              924 uspace/lib/cpp/include/__bits/adt/list.hpp                     auto new_last = first.node()->prev;
node              929 uspace/lib/cpp/include/__bits/adt/list.hpp                     first_node = first.node();
node              934 uspace/lib/cpp/include/__bits/adt/list.hpp                     first_node = first.node();
node              935 uspace/lib/cpp/include/__bits/adt/list.hpp                     last_node = last.node()->prev;
node              937 uspace/lib/cpp/include/__bits/adt/list.hpp                     first_node->prev->next = last.node();
node              938 uspace/lib/cpp/include/__bits/adt/list.hpp                     last.node()->prev = first_node->prev;
node              949 uspace/lib/cpp/include/__bits/adt/list.hpp                     auto target = position.node();
node             1097 uspace/lib/cpp/include/__bits/adt/list.hpp                     auto node = append_new_();
node             1098 uspace/lib/cpp/include/__bits/adt/list.hpp                     allocator_.construct(&node->value, *first++);
node             1123 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = new aux::list_node<value_type>{forward<Args>(args)...};
node             1127 uspace/lib/cpp/include/__bits/adt/list.hpp                     head_ = node;
node             1129 uspace/lib/cpp/include/__bits/adt/list.hpp                     last->append(node);
node             1133 uspace/lib/cpp/include/__bits/adt/list.hpp                 return node;
node             1139 uspace/lib/cpp/include/__bits/adt/list.hpp                 auto node = new aux::list_node<value_type>{forward<Args>(args)...};
node             1142 uspace/lib/cpp/include/__bits/adt/list.hpp                     head_ = node;
node             1145 uspace/lib/cpp/include/__bits/adt/list.hpp                     head_->prepend(node);
node             1151 uspace/lib/cpp/include/__bits/adt/list.hpp                 return node;
node               64 uspace/lib/cpp/include/__bits/adt/list_node.hpp         void append(list_node* node)
node               66 uspace/lib/cpp/include/__bits/adt/list_node.hpp             if (!node)
node               69 uspace/lib/cpp/include/__bits/adt/list_node.hpp             node->next = next;
node               70 uspace/lib/cpp/include/__bits/adt/list_node.hpp             node->prev = this;
node               71 uspace/lib/cpp/include/__bits/adt/list_node.hpp             next->prev = node;
node               72 uspace/lib/cpp/include/__bits/adt/list_node.hpp             next = node;
node               75 uspace/lib/cpp/include/__bits/adt/list_node.hpp         void prepend(list_node* node)
node               77 uspace/lib/cpp/include/__bits/adt/list_node.hpp             if (!node)
node               80 uspace/lib/cpp/include/__bits/adt/list_node.hpp             node->next = this;
node               81 uspace/lib/cpp/include/__bits/adt/list_node.hpp             node->prev = prev;
node               82 uspace/lib/cpp/include/__bits/adt/list_node.hpp             prev->next = node;
node               83 uspace/lib/cpp/include/__bits/adt/list_node.hpp             prev = node;
node              280 uspace/lib/cpp/include/__bits/adt/map.hpp                 auto node = new node_type{value_type{key, mapped_type{}}};
node              281 uspace/lib/cpp/include/__bits/adt/map.hpp                 tree_.insert_node(node, parent);
node              283 uspace/lib/cpp/include/__bits/adt/map.hpp                 return node->value.second;
node              292 uspace/lib/cpp/include/__bits/adt/map.hpp                 auto node = new node_type{value_type{move(key), mapped_type{}}};
node              293 uspace/lib/cpp/include/__bits/adt/map.hpp                 tree_.insert_node(node, parent);
node              295 uspace/lib/cpp/include/__bits/adt/map.hpp                 return node->value.second;
node              389 uspace/lib/cpp/include/__bits/adt/map.hpp                     auto node = new node_type{value_type{key, forward<Args>(args)...}};
node              390 uspace/lib/cpp/include/__bits/adt/map.hpp                     tree_.insert_node(node, parent);
node              392 uspace/lib/cpp/include/__bits/adt/map.hpp                     return make_pair(iterator{node, false}, true);
node              404 uspace/lib/cpp/include/__bits/adt/map.hpp                     auto node = new node_type{value_type{move(key), forward<Args>(args)...}};
node              405 uspace/lib/cpp/include/__bits/adt/map.hpp                     tree_.insert_node(node, parent);
node              407 uspace/lib/cpp/include/__bits/adt/map.hpp                     return make_pair(iterator{node, false}, true);
node              435 uspace/lib/cpp/include/__bits/adt/map.hpp                     auto node = new node_type{value_type{key, forward<T>(val)}};
node              436 uspace/lib/cpp/include/__bits/adt/map.hpp                     tree_.insert_node(node, parent);
node              438 uspace/lib/cpp/include/__bits/adt/map.hpp                     return make_pair(iterator{node, false}, true);
node              454 uspace/lib/cpp/include/__bits/adt/map.hpp                     auto node = new node_type{value_type{move(key), forward<T>(val)}};
node              455 uspace/lib/cpp/include/__bits/adt/map.hpp                     tree_.insert_node(node, parent);
node              457 uspace/lib/cpp/include/__bits/adt/map.hpp                     return make_pair(iterator{node, false}, true);
node              489 uspace/lib/cpp/include/__bits/adt/map.hpp                     first.node(), first.end()
node             1008 uspace/lib/cpp/include/__bits/adt/map.hpp                     first.node(), first.end()
node              214 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto node = const_cast<node_type*>(it.node());
node              216 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 node = delete_node(node);
node              217 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (!node)
node              220 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     return iterator{const_cast<node_type*>(node), false};
node              250 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto node = find_(key);
node              251 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (node)
node              252 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     return iterator{node, false};
node              259 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto node = find_(key);
node              260 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (node)
node              261 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     return const_iterator{node, false};
node              352 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto node = const_cast<node_type*>(n);
node              353 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (!node)
node              358 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto succ = node->successor();
node              359 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (auto tmp = node->get_node_for_deletion(); tmp != nullptr)
node              373 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 else if (node == root_)
node              376 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     delete node;
node              381 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (node->left() && node->right())
node              383 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     node->swap(succ);
node              391 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     return delete_node(node);
node              394 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 auto child = node->right() ? node->right() : node->left();
node              399 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     node->unlink();
node              400 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     delete node;
node              405 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     child->parent(node->parent());
node              406 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     if (node->is_left_child())
node              408 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     else if (node->is_right_child())
node              410 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     node->parent(nullptr);
node              411 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     node->left(nullptr);
node              412 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     node->right(nullptr);
node              415 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     repair_after_erase_(node, child);
node              418 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                     delete node;
node              424 uspace/lib/cpp/include/__bits/adt/rbtree.hpp             void insert_node(node_type* node, node_type* parent)
node              426 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 Policy::insert(*this, node, parent);
node              467 uspace/lib/cpp/include/__bits/adt/rbtree.hpp             void update_root_(const node_type* node)
node              469 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 if (!node)
node              472 uspace/lib/cpp/include/__bits/adt/rbtree.hpp                 root_ = const_cast<node_type*>(node);
node              477 uspace/lib/cpp/include/__bits/adt/rbtree.hpp             void repair_after_insert_(const node_type* node)
node              482 uspace/lib/cpp/include/__bits/adt/rbtree.hpp             void repair_after_erase_(const node_type* node, const node_type* child)
node              156 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp         return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              197 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp                 : current_{other.node()}, end_{other.end()}
node              202 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp                 current_ = other.node();
node              291 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp         return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              305 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp         return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node              319 uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp         return (lhs.node() == rhs.node()) && (lhs.end() == rhs.end());
node               45 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* grandparent(Node* node)
node               47 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node && node->parent())
node               48 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return node->parent()->parent();
node               53 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* brother(Node* node)
node               55 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node && node->parent())
node               57 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 if (node == node->parent()->left())
node               58 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node->parent()->right();
node               60 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node->parent()->left();
node               66 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* uncle(Node* node)
node               68 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             auto gp = grandparent(node);
node               71 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 if (node->parent() == gp->left())
node               80 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static bool is_left_child(const Node* node)
node               82 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node               85 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->parent())
node               86 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return node->parent()->left() == node;
node               91 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static bool is_right_child(const Node* node)
node               93 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node               96 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->parent())
node               97 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return node->parent()->right() == node;
node              102 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static void rotate_left(Node* node)
node              107 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static void rotate_right(Node* node)
node              112 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* find_smallest(Node* node)
node              114 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             return const_cast<Node*>(find_smallest(const_cast<const Node*>(node)));
node              117 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static const Node* find_smallest(const Node* node)
node              119 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node              122 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             while (node->left())
node              123 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 node = node->left();
node              125 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             return node;
node              128 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* find_largest(Node* node)
node              130 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             return const_cast<Node*>(find_largest(const_cast<const Node*>(node)));
node              133 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static const Node* find_largest(const Node* node)
node              135 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node              138 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             while (node->right())
node              139 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 node = node->right();
node              141 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             return node;
node              144 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* successor(Node* node)
node              146 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             return const_cast<Node*>(successor(const_cast<const Node*>(node)));
node              149 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static const Node* successor(const Node* node)
node              151 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node              154 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->right())
node              155 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return find_smallest(node->right());
node              158 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 while (node && !is_left_child(node))
node              159 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     node = node->parent();
node              161 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 if (node)
node              162 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node->parent();
node              164 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node;
node              168 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static Node* predecessor(Node* node)
node              170 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             return const_cast<Node*>(predecessor(const_cast<const Node*>(node)));
node              173 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static const Node* predecessor(const Node* node)
node              175 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node              178 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->left())
node              179 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 return find_largest(node->left());
node              182 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 while (node && is_left_child(node))
node              183 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     node = node->parent();
node              185 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 if (node)
node              186 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node->parent();
node              188 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     return node;
node              192 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static void add_left_child(Node* node, Node* child)
node              194 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node || !child)
node              197 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->left(child);
node              198 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             child->parent(node);
node              201 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp         static void add_right_child(Node* node, Node* child)
node              203 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node || !child)
node              206 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->right(child);
node              207 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             child->parent(node);
node              230 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             Node* node, Node* p, Node* l, Node* r, bool is_r
node              233 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (!node)
node              236 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->parent(p);
node              237 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->parent())
node              240 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     node->parent()->right(node);
node              242 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     node->parent()->left(node);
node              245 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->left(l);
node              246 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->left())
node              247 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 node->left()->parent(node);
node              249 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             node->right(r);
node              250 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             if (node->right())
node              251 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 node->right()->parent(node);
node              275 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void parent(rbtree_single_node* node)
node              277 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 parent_ = node;
node              285 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void left(rbtree_single_node* node)
node              287 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 left_ = node;
node              295 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void right(rbtree_single_node* node)
node              297 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 right_ = node;
node              375 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void add_left_child(rbtree_single_node* node)
node              377 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 utils::add_left_child(this, node);
node              380 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void add_right_child(rbtree_single_node* node)
node              382 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 utils::add_right_child(this, node);
node              450 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void parent(rbtree_multi_node* node)
node              452 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 parent_ = node;
node              457 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     tmp->parent_ = node;
node              467 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void left(rbtree_multi_node* node)
node              469 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 left_ = node;
node              474 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     tmp->left_ = node;
node              484 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void right(rbtree_multi_node* node)
node              486 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 right_ = node;
node              491 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     tmp->right_ = node;
node              599 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void add_left_child(rbtree_multi_node* node)
node              601 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 utils::add_left_child(this, node);
node              604 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void add_right_child(rbtree_multi_node* node)
node              606 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                 utils::add_right_child(this, node);
node              672 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp             void add(rbtree_multi_node* node)
node              675 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     next_->add(node);
node              678 uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp                     next_ = node;
node               54 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.delete_node(it.node());
node               66 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return iterator{const_cast<node_type*>(it.node()), it.end()};
node               74 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = tree.find_parent_for_insertion(key);
node               75 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             const_iterator it{node, false};
node              109 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return iterator{const_cast<node_type*>(it.node()), it.end()};
node              175 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = new node_type{move(val)};
node              177 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return insert(tree, node, parent);
node              192 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = new node_type{val};
node              194 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return insert(tree, node, parent);
node              209 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = new node_type{forward<Value>(val)};
node              211 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return insert(tree, node, parent);
node              218 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             Tree& tree, typename Tree::node_type* node,
node              224 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             if (!node)
node              230 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 node->color = rbcolor::black;
node              231 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.root_ = node;
node              235 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 if (tree.keys_comp(tree.get_key(node->value), parent->value))
node              236 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                     parent->add_left_child(node);
node              238 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                     parent->add_right_child(node);
node              240 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.repair_after_insert_(node);
node              241 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.update_root_(node);
node              244 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return make_pair(iterator{node, false}, true);
node              294 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 const_cast<typename Tree::node_type*>(it.node()), it.end()
node              303 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = tree.find_parent_for_insertion(key);
node              304 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             const_iterator it{node, false};
node              333 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 const_cast<typename Tree::node_type*>(it.node()), it.end()
node              390 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = new node_type{forward<Args>(args)...};
node              392 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return insert(tree, node);
node              400 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = new node_type{val};
node              402 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return insert(tree, node);
node              410 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto node = new node_type{forward<Value>(val)};
node              412 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return insert(tree, node);
node              417 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             Tree& tree, typename Tree::node_type* node,
node              423 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             if (!node)
node              426 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             auto parent = tree.find_parent_for_insertion(tree.get_key(node->value));
node              431 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 node->color = rbcolor::black;
node              432 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.root_ = node;
node              436 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 if (tree.keys_comp(tree.get_key(node->value), parent->value))
node              437 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                     parent->add_left_child(node);
node              438 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 else if (tree.keys_comp(tree.get_key(parent->value), node->value))
node              439 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                     parent->add_right_child(node);
node              442 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                     parent->add(node); // List of nodes with equivalent keys.
node              445 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                     return iterator{node, false};
node              448 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.repair_after_insert_(node);
node              449 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp                 tree.update_root_(node);
node              452 uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp             return iterator{node, false};
node              306 uspace/lib/cpp/include/__bits/adt/set.hpp                     first.node(), first.end()
node              787 uspace/lib/cpp/include/__bits/adt/set.hpp                     first.node(), first.end()
node              338 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto node = new node_type{key, forward<Args>(args)...};
node              339 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     bucket->append(node);
node              344 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                         node
node              373 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto node = new node_type{move(key), forward<Args>(args)...};
node              374 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     bucket->append(node);
node              379 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                         node
node              421 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto node = new node_type{key, forward<T>(val)};
node              422 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     bucket->append(node);
node              427 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                         node
node              457 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto node = new node_type{move(key), forward<T>(val)};
node              458 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     bucket->append(node);
node              463 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                         node
node              570 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 auto node = new node_type{key, mapped_type{}};
node              571 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 bucket->append(node);
node              575 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 return node->value.second;
node              598 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 auto node = new node_type{move(key), mapped_type{}};
node              599 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 bucket->append(node);
node              603 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 return node->value.second;
node              310 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp                     table_.bucket_count(), first.node()
node               63 uspace/lib/ext4/include/ext4/fstypes.h #define EXT4_NODE(node) \
node               64 uspace/lib/ext4/include/ext4/fstypes.h 	((node) ? (ext4_node_t *) (node)->data : NULL)
node               83 uspace/lib/ext4/src/ops.c static bool ext4_is_file(fs_node_t *node);
node               84 uspace/lib/ext4/src/ops.c static service_id_t ext4_service_get(fs_node_t *node);
node              218 uspace/lib/fs/libfs.c 	fs_node_t *node = NULL;
node              219 uspace/lib/fs/libfs.c 	rc = libfs_ops->node_get(&node, service_id, index);
node              220 uspace/lib/fs/libfs.c 	if (rc == EOK && node != NULL) {
node              221 uspace/lib/fs/libfs.c 		bool destroy = (libfs_ops->lnkcnt_get(node) == 0);
node              222 uspace/lib/fs/libfs.c 		libfs_ops->node_put(node);
node              261 uspace/lib/fs/libfs.c 	fs_node_t *node = NULL;
node              262 uspace/lib/fs/libfs.c 	rc = libfs_ops->node_get(&node, service_id, index);
node              265 uspace/lib/fs/libfs.c 	if (node == NULL)
node              269 uspace/lib/fs/libfs.c 	rc = libfs_ops->has_children(&children, node);
node              270 uspace/lib/fs/libfs.c 	libfs_ops->node_put(node);
node               50 uspace/lib/posix/include/libc/types/uuid.h 	uint8_t node[_UUID_NODE_LEN];
node               62 uspace/lib/sif/private/sif.h 	struct sif_node *node;
node               91 uspace/lib/sif/src/sif.c 	sif_node_t *node;
node               93 uspace/lib/sif/src/sif.c 	node = calloc(1, sizeof(sif_node_t));
node               94 uspace/lib/sif/src/sif.c 	if (node == NULL)
node               97 uspace/lib/sif/src/sif.c 	node->parent = parent;
node               98 uspace/lib/sif/src/sif.c 	odict_initialize(&node->attrs, sif_attr_getkey, sif_attr_cmp);
node               99 uspace/lib/sif/src/sif.c 	list_initialize(&node->children);
node              101 uspace/lib/sif/src/sif.c 	return node;
node              111 uspace/lib/sif/src/sif.c static void sif_node_delete(sif_node_t *node)
node              116 uspace/lib/sif/src/sif.c 	if (node == NULL)
node              119 uspace/lib/sif/src/sif.c 	assert(!link_used(&node->lparent));
node              121 uspace/lib/sif/src/sif.c 	if (node->ntype != NULL)
node              122 uspace/lib/sif/src/sif.c 		free(node->ntype);
node              124 uspace/lib/sif/src/sif.c 	attr = sif_node_first_attr(node);
node              128 uspace/lib/sif/src/sif.c 		attr = sif_node_first_attr(node);
node              131 uspace/lib/sif/src/sif.c 	child = sif_node_first_child(node);
node              135 uspace/lib/sif/src/sif.c 		child = sif_node_first_child(node);
node              138 uspace/lib/sif/src/sif.c 	free(node);
node              146 uspace/lib/sif/src/sif.c static sif_attr_t *sif_attr_new(sif_node_t *node)
node              154 uspace/lib/sif/src/sif.c 	attr->node = node;
node              326 uspace/lib/sif/src/sif.c const char *sif_node_get_type(sif_node_t *node)
node              328 uspace/lib/sif/src/sif.c 	return node->ntype;
node              338 uspace/lib/sif/src/sif.c const char *sif_node_get_attr(sif_node_t *node, const char *aname)
node              343 uspace/lib/sif/src/sif.c 	link = odict_find_eq(&node->attrs, (void *)aname, NULL);
node              514 uspace/lib/sif/src/sif.c void sif_node_destroy(sif_node_t *node)
node              516 uspace/lib/sif/src/sif.c 	list_remove(&node->lparent);
node              517 uspace/lib/sif/src/sif.c 	sif_node_delete(node);
node              528 uspace/lib/sif/src/sif.c errno_t sif_node_set_attr(sif_node_t *node, const char *aname,
node              535 uspace/lib/sif/src/sif.c 	link = odict_find_eq(&node->attrs, (void *)aname, NULL);
node              546 uspace/lib/sif/src/sif.c 		attr = sif_attr_new(node);
node              562 uspace/lib/sif/src/sif.c 		odict_insert(&attr->lattrs, &node->attrs, NULL);
node              573 uspace/lib/sif/src/sif.c void sif_node_unset_attr(sif_node_t *node, const char *aname)
node              578 uspace/lib/sif/src/sif.c 	link = odict_find_eq(&node->attrs, (void *)aname, NULL);
node              809 uspace/lib/sif/src/sif.c static errno_t sif_import_attr(sif_node_t *node, FILE *f, sif_attr_t **rattr)
node              831 uspace/lib/sif/src/sif.c 	attr = sif_attr_new(node);
node              880 uspace/lib/sif/src/sif.c static errno_t sif_export_node(sif_node_t *node, FILE *f)
node              889 uspace/lib/sif/src/sif.c 	rc = sif_export_name(node->ntype, f);
node              895 uspace/lib/sif/src/sif.c 	attr = sif_node_first_attr(node);
node              912 uspace/lib/sif/src/sif.c 	child = sif_node_first_child(node);
node              924 uspace/lib/sif/src/sif.c 	rc = sif_export_name(node->ntype, f);
node              946 uspace/lib/sif/src/sif.c 	sif_node_t *node = NULL;
node              954 uspace/lib/sif/src/sif.c 	node = sif_node_new(parent);
node              955 uspace/lib/sif/src/sif.c 	if (node == NULL)
node              979 uspace/lib/sif/src/sif.c 	node->ntype = ntype;
node             1000 uspace/lib/sif/src/sif.c 		rc = sif_import_attr(node, f, &attr);
node             1004 uspace/lib/sif/src/sif.c 		odict_insert(&attr->lattrs, &node->attrs, NULL);
node             1017 uspace/lib/sif/src/sif.c 			rc = sif_import_node(node, f, &child, &cendtag);
node             1026 uspace/lib/sif/src/sif.c 			list_append(&child->lparent, &node->children);
node             1030 uspace/lib/sif/src/sif.c 	*rnode = node;
node             1034 uspace/lib/sif/src/sif.c 	sif_node_delete(node);
node             1043 uspace/lib/sif/src/sif.c static sif_attr_t *sif_node_first_attr(sif_node_t *node)
node             1047 uspace/lib/sif/src/sif.c 	link = odict_first(&node->attrs);
node             1063 uspace/lib/sif/src/sif.c 	link = odict_next(&cur->lattrs, &cur->node->attrs);
node              420 uspace/lib/sif/test/sif.c 	sif_node_t *node;
node              442 uspace/lib/sif/test/sif.c 	rc = sif_node_append_child(trans, root, "node", &node);
node              445 uspace/lib/sif/test/sif.c 	rc = sif_node_set_attr(trans, node, "a", "?");
node              448 uspace/lib/sif/test/sif.c 	rc = sif_node_set_attr(trans, node, "a", "X");
node              451 uspace/lib/sif/test/sif.c 	rc = sif_node_set_attr(trans, node, "b", "Y");
node              457 uspace/lib/sif/test/sif.c 	aval = sif_node_get_attr(node, "a");
node              460 uspace/lib/sif/test/sif.c 	aval = sif_node_get_attr(node, "b");
node              463 uspace/lib/sif/test/sif.c 	aval = sif_node_get_attr(node, "c");
node              478 uspace/lib/sif/test/sif.c 	sif_node_t *node;
node              500 uspace/lib/sif/test/sif.c 	rc = sif_node_append_child(trans, root, "node", &node);
node              503 uspace/lib/sif/test/sif.c 	rc = sif_node_set_attr(trans, node, "a", "X");
node              509 uspace/lib/sif/test/sif.c 	aval = sif_node_get_attr(node, "a");
node              515 uspace/lib/sif/test/sif.c 	sif_node_unset_attr(trans, node, "a");
node              516 uspace/lib/sif/test/sif.c 	sif_node_unset_attr(trans, node, "b");
node              521 uspace/lib/sif/test/sif.c 	aval = sif_node_get_attr(node, "a");
node              536 uspace/lib/sif/test/sif.c 	sif_node_t *node;
node              558 uspace/lib/sif/test/sif.c 	rc = sif_node_append_child(trans, root, "node", &node);
node              561 uspace/lib/sif/test/sif.c 	rc = sif_node_set_attr(trans, node, "a", "X");
node              577 uspace/lib/sif/test/sif.c 	node = sif_node_first_child(root);
node              578 uspace/lib/sif/test/sif.c 	PCUT_ASSERT_NOT_NULL(node);
node              579 uspace/lib/sif/test/sif.c 	PCUT_ASSERT_INT_EQUALS(0, str_cmp(sif_node_get_type(node), "node"));
node              581 uspace/lib/sif/test/sif.c 	aval = sif_node_get_attr(node, "a");
node               40 uspace/srv/devman/dev.h extern void delete_dev_node(dev_node_t *node);
node              220 uspace/srv/devman/driver.c driver_t *find_best_match_driver(driver_list_t *drivers_list, dev_node_t *node)
node              229 uspace/srv/devman/driver.c 	if (node->drv != NULL) {
node              230 uspace/srv/devman/driver.c 		cur_score = get_match_score(node->drv, node);
node              232 uspace/srv/devman/driver.c 		link = list_next(&node->drv->drivers, &drivers_list->drivers);
node              240 uspace/srv/devman/driver.c 			score = get_match_score(drv, node);
node              259 uspace/srv/devman/driver.c 		score = get_match_score(drv, node);
node               68 uspace/srv/fs/cdfs/cdfs_ops.c #define CDFS_NODE(node)  ((node) ? (cdfs_node_t *)(node)->data : NULL)
node               69 uspace/srv/fs/cdfs/cdfs_ops.c #define FS_NODE(node)    ((node) ? (node)->fs_node : NULL)
node              296 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = hash_table_get_inst(item, cdfs_node_t, nh_link);
node              297 uspace/srv/fs/cdfs/cdfs_ops.c 	return hash_combine(node->fs->service_id, node->index);
node              302 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = hash_table_get_inst(item, cdfs_node_t, nh_link);
node              305 uspace/srv/fs/cdfs/cdfs_ops.c 	return key->service_id == node->fs->service_id && key->index == node->index;
node              310 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = hash_table_get_inst(item, cdfs_node_t, nh_link);
node              312 uspace/srv/fs/cdfs/cdfs_ops.c 	if (node->type == CDFS_DIRECTORY) {
node              314 uspace/srv/fs/cdfs/cdfs_ops.c 		while ((link = list_first(&node->cs_list)) != NULL) {
node              321 uspace/srv/fs/cdfs/cdfs_ops.c 	free(node->fs_node);
node              322 uspace/srv/fs/cdfs/cdfs_ops.c 	free(node);
node              344 uspace/srv/fs/cdfs/cdfs_ops.c 		cdfs_node_t *node =
node              347 uspace/srv/fs/cdfs/cdfs_ops.c 		*rfn = FS_NODE(node);
node              359 uspace/srv/fs/cdfs/cdfs_ops.c static void cdfs_node_initialize(cdfs_node_t *node)
node              361 uspace/srv/fs/cdfs/cdfs_ops.c 	node->fs_node = NULL;
node              362 uspace/srv/fs/cdfs/cdfs_ops.c 	node->index = 0;
node              363 uspace/srv/fs/cdfs/cdfs_ops.c 	node->fs = NULL;
node              364 uspace/srv/fs/cdfs/cdfs_ops.c 	node->type = CDFS_NONE;
node              365 uspace/srv/fs/cdfs/cdfs_ops.c 	node->lnkcnt = 0;
node              366 uspace/srv/fs/cdfs/cdfs_ops.c 	node->size = 0;
node              367 uspace/srv/fs/cdfs/cdfs_ops.c 	node->lba = 0;
node              368 uspace/srv/fs/cdfs/cdfs_ops.c 	node->processed = false;
node              369 uspace/srv/fs/cdfs/cdfs_ops.c 	node->opened = 0;
node              371 uspace/srv/fs/cdfs/cdfs_ops.c 	list_initialize(&node->cs_list);
node              379 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = malloc(sizeof(cdfs_node_t));
node              380 uspace/srv/fs/cdfs/cdfs_ops.c 	if (!node)
node              383 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_initialize(node);
node              385 uspace/srv/fs/cdfs/cdfs_ops.c 	node->fs_node = malloc(sizeof(fs_node_t));
node              386 uspace/srv/fs/cdfs/cdfs_ops.c 	if (!node->fs_node) {
node              387 uspace/srv/fs/cdfs/cdfs_ops.c 		free(node);
node              391 uspace/srv/fs/cdfs/cdfs_ops.c 	fs_node_initialize(node->fs_node);
node              392 uspace/srv/fs/cdfs/cdfs_ops.c 	node->fs_node->data = node;
node              400 uspace/srv/fs/cdfs/cdfs_ops.c 		node->index = CDFS_SOME_ROOT;
node              402 uspace/srv/fs/cdfs/cdfs_ops.c 		node->index = index;
node              404 uspace/srv/fs/cdfs/cdfs_ops.c 	node->fs = fs;
node              407 uspace/srv/fs/cdfs/cdfs_ops.c 		node->type = CDFS_DIRECTORY;
node              409 uspace/srv/fs/cdfs/cdfs_ops.c 		node->type = CDFS_FILE;
node              412 uspace/srv/fs/cdfs/cdfs_ops.c 	hash_table_insert(&nodes, &node->nh_link);
node              414 uspace/srv/fs/cdfs/cdfs_ops.c 	*rfn = FS_NODE(node);
node              423 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              446 uspace/srv/fs/cdfs/cdfs_ops.c 	dentry->index = node->index;
node              448 uspace/srv/fs/cdfs/cdfs_ops.c 	node->lnkcnt++;
node              571 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fs_node);
node              572 uspace/srv/fs/cdfs/cdfs_ops.c 	assert(node);
node              574 uspace/srv/fs/cdfs/cdfs_ops.c 	if (node->processed)
node              577 uspace/srv/fs/cdfs/cdfs_ops.c 	uint32_t blocks = node->size / BLOCK_SIZE;
node              578 uspace/srv/fs/cdfs/cdfs_ops.c 	if ((node->size % BLOCK_SIZE) != 0)
node              583 uspace/srv/fs/cdfs/cdfs_ops.c 		errno_t rc = block_get(&block, fs->service_id, node->lba + i, BLOCK_FLAGS_NONE);
node              618 uspace/srv/fs/cdfs/cdfs_ops.c 			    (node->lba + i) * BLOCK_SIZE + offset);
node              629 uspace/srv/fs/cdfs/cdfs_ops.c 			    dir->name_length, node->fs->enc, dentry_type);
node              645 uspace/srv/fs/cdfs/cdfs_ops.c 	node->processed = true;
node              672 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              673 uspace/srv/fs/cdfs/cdfs_ops.c 	node->lba = uint32_lb(dir->lba);
node              674 uspace/srv/fs/cdfs/cdfs_ops.c 	node->size = uint32_lb(dir->size);
node              675 uspace/srv/fs/cdfs/cdfs_ops.c 	node->lnkcnt = 1;
node              678 uspace/srv/fs/cdfs/cdfs_ops.c 		node->processed = true;
node              693 uspace/srv/fs/cdfs/cdfs_ops.c 		cdfs_node_t *node =
node              695 uspace/srv/fs/cdfs/cdfs_ops.c 		return FS_NODE(node);
node              724 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              726 uspace/srv/fs/cdfs/cdfs_ops.c 	if (!node->processed)
node              727 uspace/srv/fs/cdfs/cdfs_ops.c 		cdfs_readdir(node->fs, fn);
node              729 uspace/srv/fs/cdfs/cdfs_ops.c 	node->opened++;
node              765 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              767 uspace/srv/fs/cdfs/cdfs_ops.c 	if ((node->type == CDFS_DIRECTORY) && (!node->processed))
node              768 uspace/srv/fs/cdfs/cdfs_ops.c 		cdfs_readdir(node->fs, fn);
node              770 uspace/srv/fs/cdfs/cdfs_ops.c 	*has_children = !list_empty(&node->cs_list);
node              776 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              777 uspace/srv/fs/cdfs/cdfs_ops.c 	return node->index;
node              782 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              783 uspace/srv/fs/cdfs/cdfs_ops.c 	return node->size;
node              788 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              789 uspace/srv/fs/cdfs/cdfs_ops.c 	return node->lnkcnt;
node              794 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              795 uspace/srv/fs/cdfs/cdfs_ops.c 	return (node->type == CDFS_DIRECTORY);
node              800 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(fn);
node              801 uspace/srv/fs/cdfs/cdfs_ops.c 	return (node->type == CDFS_FILE);
node             1043 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = CDFS_NODE(rfn);
node             1045 uspace/srv/fs/cdfs/cdfs_ops.c 	errno_t rc = iso_read_vol_desc(fs->service_id, altroot, &node->lba,
node             1046 uspace/srv/fs/cdfs/cdfs_ops.c 	    &node->size, &fs->enc, &fs->vol_ident);
node             1214 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node = hash_table_get_inst(item, cdfs_node_t, nh_link);
node             1216 uspace/srv/fs/cdfs/cdfs_ops.c 	if (node->fs->service_id == service_id) {
node             1217 uspace/srv/fs/cdfs/cdfs_ops.c 		hash_table_remove_item(&nodes, &node->nh_link);
node             1267 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node =
node             1270 uspace/srv/fs/cdfs/cdfs_ops.c 	if (!node->processed) {
node             1271 uspace/srv/fs/cdfs/cdfs_ops.c 		errno_t rc = cdfs_readdir(node->fs, FS_NODE(node));
node             1283 uspace/srv/fs/cdfs/cdfs_ops.c 	if (node->type == CDFS_FILE) {
node             1284 uspace/srv/fs/cdfs/cdfs_ops.c 		if (pos >= node->size) {
node             1292 uspace/srv/fs/cdfs/cdfs_ops.c 			*rbytes = min(*rbytes, node->size - pos);
node             1295 uspace/srv/fs/cdfs/cdfs_ops.c 			errno_t rc = block_get(&block, service_id, node->lba + lba,
node             1309 uspace/srv/fs/cdfs/cdfs_ops.c 		link_t *link = list_nth(&node->cs_list, pos);
node             1354 uspace/srv/fs/cdfs/cdfs_ops.c 		cdfs_node_t *node = hash_table_get_inst(item, cdfs_node_t, nh_link);
node             1356 uspace/srv/fs/cdfs/cdfs_ops.c 		if (!node->opened) {
node             1393 uspace/srv/fs/cdfs/cdfs_ops.c 	cdfs_node_t *node =
node             1396 uspace/srv/fs/cdfs/cdfs_ops.c 	assert(node->opened > 0);
node             1398 uspace/srv/fs/cdfs/cdfs_ops.c 	node->opened--;
node               63 uspace/srv/fs/exfat/exfat.h #define EXFAT_NODE(node)	((node) ? (exfat_node_t *) (node)->data : NULL)
node               64 uspace/srv/fs/exfat/exfat.h #define FS_NODE(node)	((node) ? (node)->bp : NULL)
node               90 uspace/srv/fs/exfat/exfat_ops.c static bool exfat_is_file(fs_node_t *node);
node               91 uspace/srv/fs/exfat/exfat_ops.c static service_id_t exfat_service_get(fs_node_t *node);
node               99 uspace/srv/fs/exfat/exfat_ops.c static void exfat_node_initialize(exfat_node_t *node)
node              101 uspace/srv/fs/exfat/exfat_ops.c 	fibril_mutex_initialize(&node->lock);
node              102 uspace/srv/fs/exfat/exfat_ops.c 	node->bp = NULL;
node              103 uspace/srv/fs/exfat/exfat_ops.c 	node->idx = NULL;
node              104 uspace/srv/fs/exfat/exfat_ops.c 	node->type = EXFAT_UNKNOW;
node              105 uspace/srv/fs/exfat/exfat_ops.c 	link_initialize(&node->ffn_link);
node              106 uspace/srv/fs/exfat/exfat_ops.c 	node->size = 0;
node              107 uspace/srv/fs/exfat/exfat_ops.c 	node->lnkcnt = 0;
node              108 uspace/srv/fs/exfat/exfat_ops.c 	node->refcnt = 0;
node              109 uspace/srv/fs/exfat/exfat_ops.c 	node->dirty = false;
node              110 uspace/srv/fs/exfat/exfat_ops.c 	node->fragmented = false;
node              111 uspace/srv/fs/exfat/exfat_ops.c 	node->lastc_cached_valid = false;
node              112 uspace/srv/fs/exfat/exfat_ops.c 	node->lastc_cached_value = 0;
node              113 uspace/srv/fs/exfat/exfat_ops.c 	node->currc_cached_valid = false;
node              114 uspace/srv/fs/exfat/exfat_ops.c 	node->currc_cached_bn = 0;
node              115 uspace/srv/fs/exfat/exfat_ops.c 	node->currc_cached_value = 0;
node              118 uspace/srv/fs/exfat/exfat_ops.c static errno_t exfat_node_sync(exfat_node_t *node)
node              125 uspace/srv/fs/exfat/exfat_ops.c 	if (!(node->type == EXFAT_DIRECTORY || node->type == EXFAT_FILE))
node              128 uspace/srv/fs/exfat/exfat_ops.c 	if (node->type == EXFAT_DIRECTORY)
node              133 uspace/srv/fs/exfat/exfat_ops.c 	ds.firstc = node->firstc;
node              134 uspace/srv/fs/exfat/exfat_ops.c 	if (node->size == 0 && node->firstc == 0) {
node              138 uspace/srv/fs/exfat/exfat_ops.c 		ds.flags |= (!node->fragmented << 1);
node              140 uspace/srv/fs/exfat/exfat_ops.c 	ds.valid_data_size = node->size;
node              141 uspace/srv/fs/exfat/exfat_ops.c 	ds.data_size = node->size;
node              143 uspace/srv/fs/exfat/exfat_ops.c 	exfat_directory_open_parent(&di, node->idx->service_id, node->idx->pfc,
node              144 uspace/srv/fs/exfat/exfat_ops.c 	    node->idx->parent_fragmented);
node              145 uspace/srv/fs/exfat/exfat_ops.c 	rc = exfat_directory_seek(&di, node->idx->pdi);
node              910 uspace/srv/fs/exfat/exfat_ops.c service_id_t exfat_service_get(fs_node_t *node)
node              935 uspace/srv/fs/exfat/exfat_ops.c 	fs_node_t *node = NULL;
node              948 uspace/srv/fs/exfat/exfat_ops.c 	rc = exfat_bitmap_get(&node, service_id);
node              952 uspace/srv/fs/exfat/exfat_ops.c 	bmap_node = (exfat_node_t *) node->data;
node              987 uspace/srv/fs/exfat/exfat_ops.c 	exfat_node_put(node);
node               61 uspace/srv/fs/fat/fat_ops.c #define FAT_NODE(node)	((node) ? (fat_node_t *) (node)->data : NULL)
node               62 uspace/srv/fs/fat/fat_ops.c #define FS_NODE(node)	((node) ? (node)->bp : NULL)
node               90 uspace/srv/fs/fat/fat_ops.c static bool fat_is_file(fs_node_t *node);
node               91 uspace/srv/fs/fat/fat_ops.c static service_id_t fat_service_get(fs_node_t *node);
node               99 uspace/srv/fs/fat/fat_ops.c static void fat_node_initialize(fat_node_t *node)
node              101 uspace/srv/fs/fat/fat_ops.c 	fibril_mutex_initialize(&node->lock);
node              102 uspace/srv/fs/fat/fat_ops.c 	node->bp = NULL;
node              103 uspace/srv/fs/fat/fat_ops.c 	node->idx = NULL;
node              104 uspace/srv/fs/fat/fat_ops.c 	node->type = 0;
node              105 uspace/srv/fs/fat/fat_ops.c 	link_initialize(&node->ffn_link);
node              106 uspace/srv/fs/fat/fat_ops.c 	node->size = 0;
node              107 uspace/srv/fs/fat/fat_ops.c 	node->lnkcnt = 0;
node              108 uspace/srv/fs/fat/fat_ops.c 	node->refcnt = 0;
node              109 uspace/srv/fs/fat/fat_ops.c 	node->dirty = false;
node              110 uspace/srv/fs/fat/fat_ops.c 	node->lastc_cached_valid = false;
node              111 uspace/srv/fs/fat/fat_ops.c 	node->lastc_cached_value = 0;
node              112 uspace/srv/fs/fat/fat_ops.c 	node->currc_cached_valid = false;
node              113 uspace/srv/fs/fat/fat_ops.c 	node->currc_cached_bn = 0;
node              114 uspace/srv/fs/fat/fat_ops.c 	node->currc_cached_value = 0;
node              117 uspace/srv/fs/fat/fat_ops.c static errno_t fat_node_sync(fat_node_t *node)
node              124 uspace/srv/fs/fat/fat_ops.c 	assert(node->dirty);
node              126 uspace/srv/fs/fat/fat_ops.c 	bs = block_bb_get(node->idx->service_id);
node              129 uspace/srv/fs/fat/fat_ops.c 	rc = _fat_block_get(&b, bs, node->idx->service_id, node->idx->pfc,
node              130 uspace/srv/fs/fat/fat_ops.c 	    NULL, (node->idx->pdi * sizeof(fat_dentry_t)) / BPS(bs),
node              135 uspace/srv/fs/fat/fat_ops.c 	d = ((fat_dentry_t *)b->data) + (node->idx->pdi % DPS(bs));
node              137 uspace/srv/fs/fat/fat_ops.c 	d->firstc = host2uint16_t_le(node->firstc);
node              138 uspace/srv/fs/fat/fat_ops.c 	if (node->type == FAT_FILE) {
node              139 uspace/srv/fs/fat/fat_ops.c 		d->size = host2uint32_t_le(node->size);
node              140 uspace/srv/fs/fat/fat_ops.c 	} else if (node->type == FAT_DIRECTORY) {
node              108 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) malloc(sizeof(locfs_node_t));
node              109 uspace/srv/fs/locfs/locfs_ops.c 	if (node == NULL) {
node              116 uspace/srv/fs/locfs/locfs_ops.c 		free(node);
node              122 uspace/srv/fs/locfs/locfs_ops.c 	node->type = type;
node              123 uspace/srv/fs/locfs/locfs_ops.c 	node->service_id = service_id;
node              125 uspace/srv/fs/locfs/locfs_ops.c 	(*rfn)->data = node;
node              136 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) pfn->data;
node              139 uspace/srv/fs/locfs/locfs_ops.c 	if (node->service_id == 0) {
node              186 uspace/srv/fs/locfs/locfs_ops.c 	if (node->type == LOC_OBJECT_NAMESPACE) {
node              190 uspace/srv/fs/locfs/locfs_ops.c 		size_t count = loc_get_services(node->service_id, &svcs);
node              219 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              221 uspace/srv/fs/locfs/locfs_ops.c 	if (node->service_id == 0) {
node              226 uspace/srv/fs/locfs/locfs_ops.c 	loc_object_type_t type = loc_id_probe(node->service_id);
node              239 uspace/srv/fs/locfs/locfs_ops.c 		lnk = hash_table_find(&services, &node->service_id);
node              247 uspace/srv/fs/locfs/locfs_ops.c 			dev->service_id = node->service_id;
node              266 uspace/srv/fs/locfs/locfs_ops.c 			async_sess_t *sess = loc_service_connect(node->service_id,
node              282 uspace/srv/fs/locfs/locfs_ops.c 				hash_table_remove(&services, &node->service_id);
node              348 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              350 uspace/srv/fs/locfs/locfs_ops.c 	if (node->service_id == 0) {
node              371 uspace/srv/fs/locfs/locfs_ops.c 	if (node->type == LOC_OBJECT_NAMESPACE) {
node              372 uspace/srv/fs/locfs/locfs_ops.c 		size_t count = loc_count_services(node->service_id);
node              388 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              389 uspace/srv/fs/locfs/locfs_ops.c 	return node->service_id;
node              399 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              401 uspace/srv/fs/locfs/locfs_ops.c 	if (node->service_id == 0)
node              409 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              411 uspace/srv/fs/locfs/locfs_ops.c 	return ((node->type == LOC_OBJECT_NONE) || (node->type == LOC_OBJECT_NAMESPACE));
node              416 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              418 uspace/srv/fs/locfs/locfs_ops.c 	return (node->type == LOC_OBJECT_SERVICE);
node              423 uspace/srv/fs/locfs/locfs_ops.c 	locfs_node_t *node = (locfs_node_t *) fn->data;
node              425 uspace/srv/fs/locfs/locfs_ops.c 	if (node->type == LOC_OBJECT_SERVICE)
node              426 uspace/srv/fs/locfs/locfs_ops.c 		return node->service_id;
node              151 uspace/srv/fs/mfs/mfs.h 	struct mfs_node *node;
node               96 uspace/srv/fs/mfs/mfs_dentry.c 	d_info->node = mnode;
node              111 uspace/srv/fs/mfs/mfs_dentry.c 	struct mfs_node *mnode = d_info->node;
node              253 uspace/srv/fs/mfs/mfs_dentry.c 		d_info.node = mnode;
node               55 uspace/srv/fs/mfs/mfs_ops.c static aoff64_t mfs_size_get(fs_node_t *node);
node              526 uspace/srv/fs/mfs/mfs_ops.c mfs_size_get(fs_node_t *node)
node              528 uspace/srv/fs/mfs/mfs_ops.c 	const struct mfs_node *mnode = node->data;
node              607 uspace/srv/fs/mfs/mfs_ops.c 	fs_node_t *node = NULL;
node              631 uspace/srv/fs/mfs/mfs_ops.c 	node = malloc(sizeof(fs_node_t));
node              632 uspace/srv/fs/mfs/mfs_ops.c 	if (!node) {
node              637 uspace/srv/fs/mfs/mfs_ops.c 	fs_node_initialize(node);
node              656 uspace/srv/fs/mfs/mfs_ops.c 	node->data = mnode;
node              657 uspace/srv/fs/mfs/mfs_ops.c 	mnode->fsnode = node;
node              658 uspace/srv/fs/mfs/mfs_ops.c 	*rfn = node;
node              668 uspace/srv/fs/mfs/mfs_ops.c 	if (node)
node              669 uspace/srv/fs/mfs/mfs_ops.c 		free(node);
node              679 uspace/srv/fs/mfs/mfs_ops.c 	const struct mfs_node *node = fsnode->data;
node              680 uspace/srv/fs/mfs/mfs_ops.c 	return S_ISDIR(node->ino_i->i_mode);
node              686 uspace/srv/fs/mfs/mfs_ops.c 	struct mfs_node *node = fsnode->data;
node              687 uspace/srv/fs/mfs/mfs_ops.c 	return S_ISREG(node->ino_i->i_mode);
node               41 uspace/srv/fs/tmpfs/tmpfs.h #define TMPFS_NODE(node)	((node) ? (tmpfs_node_t *)(node)->data : NULL)
node               42 uspace/srv/fs/tmpfs/tmpfs.h #define FS_NODE(node)		((node) ? (node)->bp : NULL)
node               55 uspace/srv/fs/tmpfs/tmpfs.h 	struct tmpfs_node *node;/**< Back pointer to TMPFS node. */
node              163 uspace/srv/fs/tmpfs/tmpfs_ops.c 	tmpfs_node_t *node = hash_table_get_inst(item, tmpfs_node_t, nh_link);
node              166 uspace/srv/fs/tmpfs/tmpfs_ops.c 	return key->service_id == node->service_id && key->index == node->index;
node              215 uspace/srv/fs/tmpfs/tmpfs_ops.c 	dentryp->node = NULL;
node              241 uspace/srv/fs/tmpfs/tmpfs_ops.c 	tmpfs_node_t *node = hash_table_get_inst(item, tmpfs_node_t, nh_link);
node              243 uspace/srv/fs/tmpfs/tmpfs_ops.c 	if (node->service_id == sid) {
node              244 uspace/srv/fs/tmpfs/tmpfs_ops.c 		hash_table_remove_item(&nodes, &node->nh_link);
node              260 uspace/srv/fs/tmpfs/tmpfs_ops.c 			*rfn = FS_NODE(dentryp->node);
node              384 uspace/srv/fs/tmpfs/tmpfs_ops.c 	dentryp->node = childp;
node              403 uspace/srv/fs/tmpfs/tmpfs_ops.c 			childp = dentryp->node;
node               47 uspace/srv/fs/udf/udf.h #define UDF_NODE(node) \
node               48 uspace/srv/fs/udf/udf.h 	((node) ? (udf_node_t *) (node)->data : NULL)
node               50 uspace/srv/fs/udf/udf.h #define FS_NODE(node) \
node               51 uspace/srv/fs/udf/udf.h 	((node) ? (fs_node_t *) ((node)->fs_node) : NULL)
node               59 uspace/srv/fs/udf/udf_file.c static errno_t udf_read_extended_allocator(udf_node_t *node, uint16_t icb_flag,
node               63 uspace/srv/fs/udf/udf_file.c 	errno_t rc = block_get(&block, node->instance->service_id, pos,
node               69 uspace/srv/fs/udf/udf_file.c 	uint32_t start = node->instance->partitions[
node               80 uspace/srv/fs/udf/udf_file.c 	return udf_read_allocation_sequence(node, NULL, icb_flag, start, len);
node               95 uspace/srv/fs/udf/udf_file.c errno_t udf_read_allocation_sequence(udf_node_t *node, uint8_t *af,
node               98 uspace/srv/fs/udf/udf_file.c 	node->alloc_size = 0;
node              113 uspace/srv/fs/udf/udf_file.c 		for (size_t i = 0; i < node->instance->partition_cnt; i++) {
node              114 uspace/srv/fs/udf/udf_file.c 			if ((node->index >= node->instance->partitions[i].start) &&
node              115 uspace/srv/fs/udf/udf_file.c 			    (node->index < node->instance->partitions[i].start +
node              116 uspace/srv/fs/udf/udf_file.c 			    node->instance->partitions[i].length)) {
node              117 uspace/srv/fs/udf/udf_file.c 				if (node->instance->partitions[i].start >= min_start) {
node              118 uspace/srv/fs/udf/udf_file.c 					min_start = node->instance->partitions[i].start;
node              139 uspace/srv/fs/udf/udf_file.c 			    node->alloc_size * sizeof(udf_short_ad_t));
node              149 uspace/srv/fs/udf/udf_file.c 				udf_read_extended_allocator(node, icb_flag,
node              150 uspace/srv/fs/udf/udf_file.c 				    node->instance->partitions[pd_num].start +
node              155 uspace/srv/fs/udf/udf_file.c 			node->allocators = realloc(node->allocators,
node              156 uspace/srv/fs/udf/udf_file.c 			    (node->alloc_size + 1) * sizeof(udf_allocator_t));
node              157 uspace/srv/fs/udf/udf_file.c 			node->allocators[node->alloc_size].length =
node              159 uspace/srv/fs/udf/udf_file.c 			node->allocators[node->alloc_size].position =
node              160 uspace/srv/fs/udf/udf_file.c 			    node->instance->partitions[pd_num].start + FLE32(short_d->position);
node              161 uspace/srv/fs/udf/udf_file.c 			node->alloc_size++;
node              164 uspace/srv/fs/udf/udf_file.c 		node->allocators = realloc(node->allocators,
node              165 uspace/srv/fs/udf/udf_file.c 		    node->alloc_size * sizeof(udf_allocator_t));
node              175 uspace/srv/fs/udf/udf_file.c 			    node->alloc_size * sizeof(udf_long_ad_t));
node              180 uspace/srv/fs/udf/udf_file.c 			uint32_t pos_long_ad = udf_long_ad_to_pos(node->instance, long_d);
node              187 uspace/srv/fs/udf/udf_file.c 				udf_read_extended_allocator(node, icb_flag, pos_long_ad);
node              191 uspace/srv/fs/udf/udf_file.c 			node->allocators = realloc(node->allocators,
node              192 uspace/srv/fs/udf/udf_file.c 			    (node->alloc_size + 1) * sizeof(udf_allocator_t));
node              193 uspace/srv/fs/udf/udf_file.c 			node->allocators[node->alloc_size].length =
node              195 uspace/srv/fs/udf/udf_file.c 			node->allocators[node->alloc_size].position = pos_long_ad;
node              197 uspace/srv/fs/udf/udf_file.c 			node->alloc_size++;
node              200 uspace/srv/fs/udf/udf_file.c 		node->allocators = realloc(node->allocators,
node              201 uspace/srv/fs/udf/udf_file.c 		    node->alloc_size * sizeof(udf_allocator_t));
node              213 uspace/srv/fs/udf/udf_file.c 		node->data = malloc(node->data_size);
node              214 uspace/srv/fs/udf/udf_file.c 		if (!node->data)
node              217 uspace/srv/fs/udf/udf_file.c 		memcpy(node->data, (af + start_alloc), node->data_size);
node              218 uspace/srv/fs/udf/udf_file.c 		node->alloc_size = 0;
node              235 uspace/srv/fs/udf/udf_file.c errno_t udf_read_icb(udf_node_t *node)
node              238 uspace/srv/fs/udf/udf_file.c 		fs_index_t pos = node->index;
node              241 uspace/srv/fs/udf/udf_file.c 		errno_t rc = block_get(&block, node->instance->service_id, pos,
node              260 uspace/srv/fs/udf/udf_file.c 			node->data_size = FLE64(file->info_length);
node              261 uspace/srv/fs/udf/udf_file.c 			node->type = (file->icbtag.file_type == UDF_ICBTYPE_DIR) ? NODE_DIR : NODE_FILE;
node              263 uspace/srv/fs/udf/udf_file.c 			rc = udf_read_allocation_sequence(node, (uint8_t *) file, icb_flag,
node              274 uspace/srv/fs/udf/udf_file.c 			node->data_size = FLE64(efile->info_length);
node              275 uspace/srv/fs/udf/udf_file.c 			node->type = (efile->icbtag.file_type == UDF_ICBTYPE_DIR) ? NODE_DIR : NODE_FILE;
node              277 uspace/srv/fs/udf/udf_file.c 			rc = udf_read_allocation_sequence(node, (uint8_t *) efile, icb_flag,
node              305 uspace/srv/fs/udf/udf_file.c errno_t udf_node_get_core(udf_node_t *node)
node              307 uspace/srv/fs/udf/udf_file.c 	node->link_cnt = 1;
node              308 uspace/srv/fs/udf/udf_file.c 	return udf_read_icb(node);
node              321 uspace/srv/fs/udf/udf_file.c     udf_node_t *node, aoff64_t pos)
node              326 uspace/srv/fs/udf/udf_file.c 	while (node->data_size - fid_sum >= MIN_FID_LEN) {
node              328 uspace/srv/fs/udf/udf_file.c 		    (udf_descriptor_tag_t *) (node->data + fid_sum);
node              337 uspace/srv/fs/udf/udf_file.c 		    (node->data + fid_sum);
node              372 uspace/srv/fs/udf/udf_file.c     udf_node_t *node, aoff64_t pos)
node              374 uspace/srv/fs/udf/udf_file.c 	if (node->data == NULL)
node              375 uspace/srv/fs/udf/udf_file.c 		return udf_get_fid_in_allocator(fid, block, node, pos);
node              377 uspace/srv/fs/udf/udf_file.c 	return udf_get_fid_in_data(fid, node, pos);
node              391 uspace/srv/fs/udf/udf_file.c     block_t **block, udf_node_t *node, aoff64_t pos)
node              393 uspace/srv/fs/udf/udf_file.c 	void *buf = malloc(node->instance->sector_size);
node              401 uspace/srv/fs/udf/udf_file.c 	while (j < node->alloc_size) {
node              403 uspace/srv/fs/udf/udf_file.c 		while (i * node->instance->sector_size < node->allocators[j].length) {
node              404 uspace/srv/fs/udf/udf_file.c 			errno_t rc = block_get(block, node->instance->service_id,
node              405 uspace/srv/fs/udf/udf_file.c 			    node->allocators[j].position + i, BLOCK_FLAGS_NONE);
node              415 uspace/srv/fs/udf/udf_file.c 			if ((node->allocators[j].length / node->instance->sector_size == i) &&
node              416 uspace/srv/fs/udf/udf_file.c 			    (node->allocators[j].length - i * node->instance->sector_size <
node              418 uspace/srv/fs/udf/udf_file.c 				size_t len = node->allocators[j].length - i * node->instance->sector_size;
node              425 uspace/srv/fs/udf/udf_file.c 			rc = udf_get_fid_in_sector(fid, block, node, pos, &n, &buf, &len);
node              472 uspace/srv/fs/udf/udf_file.c     block_t **block, udf_node_t *node, aoff64_t pos, size_t *n, void **buf,
node              475 uspace/srv/fs/udf/udf_file.c 	void *fidbuf = malloc(node->instance->sector_size);
node              488 uspace/srv/fs/udf/udf_file.c 	while (node->instance->sector_size - fid_sum > 0) {
node              489 uspace/srv/fs/udf/udf_file.c 		if (node->instance->sector_size - fid_sum >= MIN_FID_LEN) {
node              494 uspace/srv/fs/udf/udf_file.c 				    node->instance->sector_size - *len);
node              555 uspace/srv/fs/udf/udf_file.c 			*len = node->instance->sector_size - fid_sum;
node              578 uspace/srv/fs/udf/udf_file.c errno_t udf_read_file(size_t *read_len, ipc_call_t *call, udf_node_t *node,
node              584 uspace/srv/fs/udf/udf_file.c 	while (i < node->alloc_size) {
node              585 uspace/srv/fs/udf/udf_file.c 		if (pos >= l + node->allocators[i].length) {
node              586 uspace/srv/fs/udf/udf_file.c 			l += node->allocators[i].length;
node              592 uspace/srv/fs/udf/udf_file.c 	size_t sector_cnt = ALL_UP(l, node->instance->sector_size);
node              593 uspace/srv/fs/udf/udf_file.c 	size_t sector_num = pos / node->instance->sector_size;
node              596 uspace/srv/fs/udf/udf_file.c 	errno_t rc = block_get(&block, node->instance->service_id,
node              597 uspace/srv/fs/udf/udf_file.c 	    node->allocators[i].position + (sector_num - sector_cnt),
node              604 uspace/srv/fs/udf/udf_file.c 	size_t sector_pos = pos % node->instance->sector_size;
node              606 uspace/srv/fs/udf/udf_file.c 	if (sector_pos + len < node->instance->sector_size)
node              609 uspace/srv/fs/udf/udf_file.c 		*read_len = node->instance->sector_size - sector_pos;
node              611 uspace/srv/fs/udf/udf_file.c 	if (ALL_UP(node->allocators[i].length, node->instance->sector_size) ==
node              613 uspace/srv/fs/udf/udf_file.c 		if (pos + len > node->allocators[i].length + l)
node              614 uspace/srv/fs/udf/udf_file.c 			*read_len = node->allocators[i].length -
node              615 uspace/srv/fs/udf/udf_file.c 			    (sector_num - sector_cnt) * node->instance->sector_size -
node               61 uspace/srv/fs/udf/udf_idx.c 	udf_node_t *node = hash_table_get_inst(item, udf_node_t, link);
node               62 uspace/srv/fs/udf/udf_idx.c 	return hash_combine(node->instance->service_id, node->index);
node               74 uspace/srv/fs/udf/udf_idx.c 	udf_node_t *node = hash_table_get_inst(item, udf_node_t, link);
node               76 uspace/srv/fs/udf/udf_idx.c 	return (key->service_id == node->instance->service_id) &&
node               77 uspace/srv/fs/udf/udf_idx.c 	    (key->index == node->index);
node              132 uspace/srv/fs/udf/udf_idx.c 		udf_node_t *node = hash_table_get_inst(already_open,
node              134 uspace/srv/fs/udf/udf_idx.c 		node->ref_cnt++;
node              136 uspace/srv/fs/udf/udf_idx.c 		*udfn = node;
node              201 uspace/srv/fs/udf/udf_idx.c errno_t udf_idx_del(udf_node_t *node)
node              203 uspace/srv/fs/udf/udf_idx.c 	assert(node->ref_cnt == 0);
node              207 uspace/srv/fs/udf/udf_idx.c 	hash_table_remove_item(&udf_idx, &node->link);
node              209 uspace/srv/fs/udf/udf_idx.c 	assert(node->instance->open_nodes_count > 0);
node              210 uspace/srv/fs/udf/udf_idx.c 	node->instance->open_nodes_count--;
node              212 uspace/srv/fs/udf/udf_idx.c 	free(node->fs_node);
node              213 uspace/srv/fs/udf/udf_idx.c 	free(node);
node               76 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node;
node               77 uspace/srv/fs/udf/udf_ops.c 	rc = udf_idx_get(&node, instance, index);
node               79 uspace/srv/fs/udf/udf_ops.c 		rc = udf_idx_add(&node, instance, index);
node               83 uspace/srv/fs/udf/udf_ops.c 		rc = udf_node_get_core(node);
node               85 uspace/srv/fs/udf/udf_ops.c 			udf_idx_del(node);
node               90 uspace/srv/fs/udf/udf_ops.c 	*rfn = FS_NODE(node);
node              105 uspace/srv/fs/udf/udf_ops.c static service_id_t udf_service_get(fs_node_t *node)
node              158 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(fn);
node              159 uspace/srv/fs/udf/udf_ops.c 	if (!node)
node              162 uspace/srv/fs/udf/udf_ops.c 	fibril_mutex_lock(&node->lock);
node              163 uspace/srv/fs/udf/udf_ops.c 	node->ref_cnt--;
node              164 uspace/srv/fs/udf/udf_ops.c 	fibril_mutex_unlock(&node->lock);
node              167 uspace/srv/fs/udf/udf_ops.c 	if (!node->ref_cnt)
node              168 uspace/srv/fs/udf/udf_ops.c 		udf_idx_del(node);
node              201 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(fn);
node              202 uspace/srv/fs/udf/udf_ops.c 	if (node)
node              203 uspace/srv/fs/udf/udf_ops.c 		return node->index;
node              210 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(fn);
node              211 uspace/srv/fs/udf/udf_ops.c 	if (node)
node              212 uspace/srv/fs/udf/udf_ops.c 		return node->data_size;
node              219 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(fn);
node              220 uspace/srv/fs/udf/udf_ops.c 	if (node)
node              221 uspace/srv/fs/udf/udf_ops.c 		return node->link_cnt;
node              228 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(fn);
node              229 uspace/srv/fs/udf/udf_ops.c 	if (node)
node              230 uspace/srv/fs/udf/udf_ops.c 		return node->type == NODE_DIR;
node              237 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(fn);
node              238 uspace/srv/fs/udf/udf_ops.c 	if (node)
node              239 uspace/srv/fs/udf/udf_ops.c 		return node->type == NODE_FILE;
node              406 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(rfn);
node              408 uspace/srv/fs/udf/udf_ops.c 	*size = node->data_size;
node              460 uspace/srv/fs/udf/udf_ops.c 	udf_node_t *node = UDF_NODE(rfn);
node              470 uspace/srv/fs/udf/udf_ops.c 	if (node->type == NODE_FILE) {
node              471 uspace/srv/fs/udf/udf_ops.c 		if (pos >= node->data_size) {
node              479 uspace/srv/fs/udf/udf_ops.c 		if (node->data == NULL)
node              480 uspace/srv/fs/udf/udf_ops.c 			rc = udf_read_file(&read_len, &call, node, pos, len);
node              483 uspace/srv/fs/udf/udf_ops.c 			read_len = (len < node->data_size) ? len : node->data_size;
node              484 uspace/srv/fs/udf/udf_ops.c 			async_data_read_finalize(&call, node->data + pos, read_len);
node              494 uspace/srv/fs/udf/udf_ops.c 		if (udf_get_fid(&fid, &block, node, pos) == EOK) {
node              501 uspace/srv/fs/udf/udf_ops.c 			    fid->length_file_id, &node->instance->charset);
node              137 uspace/srv/vfs/vfs.h 	vfs_node_t *node;
node              192 uspace/srv/vfs/vfs.h extern bool vfs_node_has_children(vfs_node_t *node);
node               62 uspace/srv/vfs/vfs_file.c 	vfs_node_t *node;
node              139 uspace/srv/vfs/vfs_file.c 	async_exch_t *exch = vfs_exchange_grab(file->node->fs_handle);
node              142 uspace/srv/vfs/vfs_file.c 	aid_t msg = async_send_2(exch, VFS_OUT_CLOSE, file->node->service_id,
node              143 uspace/srv/vfs/vfs_file.c 	    file->node->index, &answer);
node              182 uspace/srv/vfs/vfs_file.c 		if (file->node != NULL) {
node              186 uspace/srv/vfs/vfs_file.c 			vfs_node_delref(file->node);
node              350 uspace/srv/vfs/vfs_file.c 			if (file->node == NULL) {
node              355 uspace/srv/vfs/vfs_file.c 			assert(file->node != NULL);
node              399 uspace/srv/vfs/vfs_file.c 	bh->node = NULL;
node              412 uspace/srv/vfs/vfs_file.c 	vfs_node_addref(donor_file->node);
node              413 uspace/srv/vfs/vfs_file.c 	bh->node = donor_file->node;
node              446 uspace/srv/vfs/vfs_file.c 		vfs_node_delref(bh->node);
node              451 uspace/srv/vfs/vfs_file.c 	file->node = bh->node;
node               65 uspace/srv/vfs/vfs_node.c static vfs_triplet_t node_triplet(vfs_node_t *node);
node               85 uspace/srv/vfs/vfs_node.c static inline void _vfs_node_addref(vfs_node_t *node)
node               87 uspace/srv/vfs/vfs_node.c 	node->refcnt++;
node               94 uspace/srv/vfs/vfs_node.c void vfs_node_addref(vfs_node_t *node)
node               97 uspace/srv/vfs/vfs_node.c 	_vfs_node_addref(node);
node              107 uspace/srv/vfs/vfs_node.c void vfs_node_delref(vfs_node_t *node)
node              113 uspace/srv/vfs/vfs_node.c 	node->refcnt--;
node              114 uspace/srv/vfs/vfs_node.c 	if (node->refcnt == 0) {
node              120 uspace/srv/vfs/vfs_node.c 		hash_table_remove_item(&nodes, &node->nh_link);
node              132 uspace/srv/vfs/vfs_node.c 		async_exch_t *exch = vfs_exchange_grab(node->fs_handle);
node              133 uspace/srv/vfs/vfs_node.c 		async_msg_2(exch, VFS_OUT_DESTROY, (sysarg_t) node->service_id,
node              134 uspace/srv/vfs/vfs_node.c 		    (sysarg_t)node->index);
node              137 uspace/srv/vfs/vfs_node.c 		free(node);
node              148 uspace/srv/vfs/vfs_node.c void vfs_node_forget(vfs_node_t *node)
node              151 uspace/srv/vfs/vfs_node.c 	hash_table_remove_item(&nodes, &node->nh_link);
node              153 uspace/srv/vfs/vfs_node.c 	free(node);
node              170 uspace/srv/vfs/vfs_node.c 	vfs_node_t *node;
node              175 uspace/srv/vfs/vfs_node.c 		node = (vfs_node_t *) malloc(sizeof(vfs_node_t));
node              176 uspace/srv/vfs/vfs_node.c 		if (!node) {
node              180 uspace/srv/vfs/vfs_node.c 		memset(node, 0, sizeof(vfs_node_t));
node              181 uspace/srv/vfs/vfs_node.c 		node->fs_handle = result->triplet.fs_handle;
node              182 uspace/srv/vfs/vfs_node.c 		node->service_id = result->triplet.service_id;
node              183 uspace/srv/vfs/vfs_node.c 		node->index = result->triplet.index;
node              184 uspace/srv/vfs/vfs_node.c 		node->size = result->size;
node              185 uspace/srv/vfs/vfs_node.c 		node->type = result->type;
node              186 uspace/srv/vfs/vfs_node.c 		fibril_rwlock_initialize(&node->contents_rwlock);
node              187 uspace/srv/vfs/vfs_node.c 		hash_table_insert(&nodes, &node->nh_link);
node              189 uspace/srv/vfs/vfs_node.c 		node = hash_table_get_inst(tmp, vfs_node_t, nh_link);
node              192 uspace/srv/vfs/vfs_node.c 	_vfs_node_addref(node);
node              195 uspace/srv/vfs/vfs_node.c 	return node;
node              200 uspace/srv/vfs/vfs_node.c 	vfs_node_t *node = NULL;
node              205 uspace/srv/vfs/vfs_node.c 		node = hash_table_get_inst(tmp, vfs_node_t, nh_link);
node              206 uspace/srv/vfs/vfs_node.c 		_vfs_node_addref(node);
node              210 uspace/srv/vfs/vfs_node.c 	return node;
node              221 uspace/srv/vfs/vfs_node.c void vfs_node_put(vfs_node_t *node)
node              223 uspace/srv/vfs/vfs_node.c 	vfs_node_delref(node);
node              235 uspace/srv/vfs/vfs_node.c 	vfs_node_t *node = hash_table_get_inst(item, vfs_node_t, nh_link);
node              238 uspace/srv/vfs/vfs_node.c 	if ((node->fs_handle == rd->fs_handle) &&
node              239 uspace/srv/vfs/vfs_node.c 	    (node->service_id == rd->service_id))
node              240 uspace/srv/vfs/vfs_node.c 		rd->refcnt += node->refcnt;
node              266 uspace/srv/vfs/vfs_node.c errno_t vfs_open_node_remote(vfs_node_t *node)
node              268 uspace/srv/vfs/vfs_node.c 	async_exch_t *exch = vfs_exchange_grab(node->fs_handle);
node              272 uspace/srv/vfs/vfs_node.c 	    (sysarg_t) node->service_id, (sysarg_t) node->index, &answer);
node              291 uspace/srv/vfs/vfs_node.c 	vfs_node_t *node = hash_table_get_inst(item, vfs_node_t, nh_link);
node              292 uspace/srv/vfs/vfs_node.c 	vfs_triplet_t tri = node_triplet(node);
node              299 uspace/srv/vfs/vfs_node.c 	vfs_node_t *node = hash_table_get_inst(item, vfs_node_t, nh_link);
node              300 uspace/srv/vfs/vfs_node.c 	return node->fs_handle == tri->fs_handle &&
node              301 uspace/srv/vfs/vfs_node.c 	    node->service_id == tri->service_id && node->index == tri->index;
node              304 uspace/srv/vfs/vfs_node.c static inline vfs_triplet_t node_triplet(vfs_node_t *node)
node              307 uspace/srv/vfs/vfs_node.c 		.fs_handle = node->fs_handle,
node              308 uspace/srv/vfs/vfs_node.c 		.service_id = node->service_id,
node              309 uspace/srv/vfs/vfs_node.c 		.index = node->index
node              315 uspace/srv/vfs/vfs_node.c bool vfs_node_has_children(vfs_node_t *node)
node              317 uspace/srv/vfs/vfs_node.c 	async_exch_t *exch = vfs_exchange_grab(node->fs_handle);
node              318 uspace/srv/vfs/vfs_node.c 	errno_t rc = async_req_2_0(exch, VFS_OUT_IS_EMPTY, node->service_id,
node              319 uspace/srv/vfs/vfs_node.c 	    node->index);
node               97 uspace/srv/vfs/vfs_ops.c 	assert(oldfile->node != NULL);
node              113 uspace/srv/vfs/vfs_ops.c 			newfile->node = oldfile->node;
node              115 uspace/srv/vfs/vfs_ops.c 			vfs_node_addref(newfile->node);
node              241 uspace/srv/vfs/vfs_ops.c 		if (mp->node->mount != NULL) {
node              246 uspace/srv/vfs/vfs_ops.c 		if (mp->node->type != VFS_NODE_DIRECTORY) {
node              251 uspace/srv/vfs/vfs_ops.c 		if (vfs_node_has_children(mp->node)) {
node              271 uspace/srv/vfs/vfs_ops.c 		vfs_node_addref(mp->node);
node              273 uspace/srv/vfs/vfs_ops.c 		mp->node->mount = root;
node              286 uspace/srv/vfs/vfs_ops.c 		file->node = root;
node              334 uspace/srv/vfs/vfs_ops.c 	if (file->node->type == VFS_NODE_DIRECTORY && file->open_write) {
node              340 uspace/srv/vfs/vfs_ops.c 	errno_t rc = vfs_open_node_remote(file->node);
node              370 uspace/srv/vfs/vfs_ops.c 		    file->node->service_id, file->node->index,
node              374 uspace/srv/vfs/vfs_ops.c 		    file->node->service_id, file->node->index,
node              391 uspace/srv/vfs/vfs_ops.c 	    file->node->service_id, file->node->index, LOWER32(pos),
node              433 uspace/srv/vfs/vfs_ops.c 	vfs_info_t *fs_info = fs_handle_to_info(file->node->fs_handle);
node              445 uspace/srv/vfs/vfs_ops.c 		fibril_rwlock_read_lock(&file->node->contents_rwlock);
node              447 uspace/srv/vfs/vfs_ops.c 		fibril_rwlock_write_lock(&file->node->contents_rwlock);
node              449 uspace/srv/vfs/vfs_ops.c 	if (file->node->type == VFS_NODE_DIRECTORY) {
node              458 uspace/srv/vfs/vfs_ops.c 				    &file->node->contents_rwlock);
node              461 uspace/srv/vfs/vfs_ops.c 				    &file->node->contents_rwlock);
node              470 uspace/srv/vfs/vfs_ops.c 	async_exch_t *fs_exch = vfs_exchange_grab(file->node->fs_handle);
node              473 uspace/srv/vfs/vfs_ops.c 		pos = file->node->size;
node              483 uspace/srv/vfs/vfs_ops.c 	if (file->node->type == VFS_NODE_DIRECTORY)
node              488 uspace/srv/vfs/vfs_ops.c 		fibril_rwlock_read_unlock(&file->node->contents_rwlock);
node              492 uspace/srv/vfs/vfs_ops.c 			file->node->size = MERGE_LOUP32(ipc_get_arg2(&answer),
node              495 uspace/srv/vfs/vfs_ops.c 		fibril_rwlock_write_unlock(&file->node->contents_rwlock);
node              519 uspace/srv/vfs/vfs_ops.c 	vfs_node_t *base = base_file->node;
node              602 uspace/srv/vfs/vfs_ops.c 		vfs_node_t *node = vfs_node_peek(&new_lr_orig);
node              603 uspace/srv/vfs/vfs_ops.c 		if (!node)
node              606 uspace/srv/vfs/vfs_ops.c 			vfs_node_put(node);
node              620 uspace/srv/vfs/vfs_ops.c 	if (!file->open_write || file->node->type != VFS_NODE_FILE) {
node              625 uspace/srv/vfs/vfs_ops.c 	fibril_rwlock_write_lock(&file->node->contents_rwlock);
node              627 uspace/srv/vfs/vfs_ops.c 	errno_t rc = vfs_truncate_internal(file->node->fs_handle,
node              628 uspace/srv/vfs/vfs_ops.c 	    file->node->service_id, file->node->index, size);
node              630 uspace/srv/vfs/vfs_ops.c 		file->node->size = size;
node              632 uspace/srv/vfs/vfs_ops.c 	fibril_rwlock_write_unlock(&file->node->contents_rwlock);
node              643 uspace/srv/vfs/vfs_ops.c 	vfs_node_t *node = file->node;
node              645 uspace/srv/vfs/vfs_ops.c 	async_exch_t *exch = vfs_exchange_grab(node->fs_handle);
node              647 uspace/srv/vfs/vfs_ops.c 	    node->service_id, node->index, true);
node              660 uspace/srv/vfs/vfs_ops.c 	vfs_node_t *node = file->node;
node              662 uspace/srv/vfs/vfs_ops.c 	async_exch_t *exch = vfs_exchange_grab(node->fs_handle);
node              664 uspace/srv/vfs/vfs_ops.c 	    node->service_id, node->index, false);
node              677 uspace/srv/vfs/vfs_ops.c 	async_exch_t *fs_exch = vfs_exchange_grab(file->node->fs_handle);
node              681 uspace/srv/vfs/vfs_ops.c 	msg = async_send_2(fs_exch, VFS_OUT_SYNC, file->node->service_id,
node              682 uspace/srv/vfs/vfs_ops.c 	    file->node->index, &answer);
node              749 uspace/srv/vfs/vfs_ops.c 		rc = vfs_lookup_internal(parent->node, path, 0, &lr);
node              755 uspace/srv/vfs/vfs_ops.c 		if (expect->node != found_node) {
node              765 uspace/srv/vfs/vfs_ops.c 	rc = vfs_lookup_internal(parent->node, path, L_UNLINK, &lr);
node              770 uspace/srv/vfs/vfs_ops.c 	vfs_node_t *node = vfs_node_peek(&lr);
node              771 uspace/srv/vfs/vfs_ops.c 	if (!node)
node              774 uspace/srv/vfs/vfs_ops.c 		vfs_node_put(node);
node              793 uspace/srv/vfs/vfs_ops.c 	if (mp->node->mount == NULL) {
node              807 uspace/srv/vfs/vfs_ops.c 	if (vfs_nodes_refcount_sum_get(mp->node->mount->fs_handle,
node              808 uspace/srv/vfs/vfs_ops.c 	    mp->node->mount->service_id) != 1) {
node              814 uspace/srv/vfs/vfs_ops.c 	async_exch_t *exch = vfs_exchange_grab(mp->node->mount->fs_handle);
node              816 uspace/srv/vfs/vfs_ops.c 	    mp->node->mount->service_id);
node              825 uspace/srv/vfs/vfs_ops.c 	vfs_node_forget(mp->node->mount);
node              826 uspace/srv/vfs/vfs_ops.c 	vfs_node_put(mp->node);
node              827 uspace/srv/vfs/vfs_ops.c 	mp->node->mount = NULL;
node              883 uspace/srv/vfs/vfs_ops.c 	errno_t rc = vfs_lookup_internal(parent->node, path,
node              891 uspace/srv/vfs/vfs_ops.c 	vfs_node_t *node = vfs_node_get(&lr);
node              892 uspace/srv/vfs/vfs_ops.c 	if (!node) {
node              902 uspace/srv/vfs/vfs_ops.c 		vfs_node_put(node);
node              908 uspace/srv/vfs/vfs_ops.c 	file->node = node;
node              118 uspace/srv/volsrv/volume.c 	sif_node_t *node;
node              161 uspace/srv/volsrv/volume.c 		node = sif_node_first_child(sif_get_root(doc));
node              164 uspace/srv/volsrv/volume.c 		ntype = sif_node_get_type(node);
node              170 uspace/srv/volsrv/volume.c 		rc = vol_volumes_load(node, volumes);
node              199 uspace/srv/volsrv/volume.c 	sif_node_t *node;
node              225 uspace/srv/volsrv/volume.c 		node = sif_node_first_child(sif_get_root(doc));
node              228 uspace/srv/volsrv/volume.c 		ntype = sif_node_get_type(node);
node              234 uspace/srv/volsrv/volume.c 		rc = vol_volumes_load(node, volumes);
node              621 uspace/srv/volsrv/volume.c 	sif_node_t *node;
node              637 uspace/srv/volsrv/volume.c 			rc = sif_node_append_child(nvolumes, "volume", &node);
node              641 uspace/srv/volsrv/volume.c 			rc = sif_node_set_attr(node, "label", volume->label);
node              645 uspace/srv/volsrv/volume.c 			rc = sif_node_set_attr(node, "mountp", volume->mountp);
HelenOS homepage, sources at GitHub