Lines Matching defs:path
1793 * @path: where to put the nnode
1801 struct lpt_scan_node *path,
1812 path->in_tree = 1;
1813 path->ptr.nnode = nnode;
1816 nnode = &path->nnode;
1817 path->in_tree = 0;
1818 path->ptr.nnode = nnode;
1852 * @path: where to put the pnode
1860 struct lpt_scan_node *path,
1871 path->in_tree = 1;
1872 path->ptr.pnode = pnode;
1875 pnode = &path->pnode;
1876 path->in_tree = 0;
1877 path->ptr.pnode = pnode;
1934 struct lpt_scan_node *path;
1951 path = kmalloc(sizeof(struct lpt_scan_node) * (c->lpt_hght + 1),
1953 if (!path)
1956 path[0].ptr.nnode = c->nroot;
1957 path[0].in_tree = 1;
1966 nnode = scan_get_nnode(c, path + h, nnode, iip);
1973 pnode = scan_get_pnode(c, path + h, nnode, iip);
1985 ret = scan_cb(c, lprops, path[h].in_tree, data);
1991 /* Add all the nodes in path to the tree in memory */
1996 if (path[h].in_tree)
1998 nnode = kmemdup(&path[h].nnode, sz, GFP_NOFS);
2005 path[h].ptr.nnode = nnode;
2006 path[h].in_tree = 1;
2007 path[h + 1].cnode.parent = nnode;
2009 if (path[h].in_tree)
2015 pnode = kmemdup(&path[h].pnode, sz, GFP_NOFS);
2022 path[h].ptr.pnode = pnode;
2023 path[h].in_tree = 1;
2063 nnode = path[h].ptr.nnode;
2073 nnode = scan_get_nnode(c, path + h, nnode, iip);
2080 pnode = scan_get_pnode(c, path + h, nnode, iip);
2088 kfree(path);