prom_nextnode
stack[stackidx] = prom_nextnode(stack[stackidx]);
prom_nextnode(stack[stackidx]);
return (rootnode ? rootnode : (rootnode = prom_nextnode(OBP_NONODE)));
for (node = prom_rootnode(); ; node = prom_nextnode(node)) {
chosen = prom_nextnode((pnode_t)0); /* root node */
(node_id == prom_nextnode(current_id)) ||
id[0] = prom_nextnode((pnode_t)0);
((id[depth - 1] = prom_nextnode(id[depth - 1])) == 0))
prom_nextnode(0), flag, &st->snapshot, &st->size));
child = prom_nextnode(child);
st->current_id = prom_nextnode(node_id);
snid = (int)prom_nextnode((pnode_t)nid);
snid = (int)prom_nextnode((pnode_t)nid);
snid = (int)prom_nextnode((pnode_t)snid)) {
for (cnid = (int)prom_nextnode((pnode_t)cnid);
cnid = (int)prom_nextnode((pnode_t)cnid)) {
nodeid = prom_nextnode(0);
nodeid = prom_nextnode(nodeid);
nodeid = prom_nextnode(nodeid);
return (rootnode ? rootnode : (rootnode = prom_nextnode(OBP_NONODE)));
extern pnode_t prom_nextnode(pnode_t nodeid);
cur_node = prom_nextnode(0);
} while ((cur_node = prom_nextnode(cur_node)) != 0);
extern pnode_t prom_nextnode(pnode_t nodeid);
(void) prom_nextnode((pnode_t)0);
curnode = prom_nextnode(curnode)) {
curnode = prom_nextnode(curnode)) {
curnode = prom_nextnode(curnode)) {
pnode = prom_nextnode(pnode)) {
root = prom_nextnode((pnode_t)0);
root = prom_nextnode((pnode_t)0);
pnode_t root = prom_nextnode((pnode_t)0);
#define NEXT prom_nextnode
curnode = prom_nextnode(curnode)) {
curnode = prom_nextnode(curnode)) {
cur_node = prom_nextnode(cur_node)) {
child = prom_nextnode(child)) {
sbdp_walk_prom_tree_worker(prom_nextnode(node), f, arg);
nid = prom_nextnode(nid)) {
nodeid = prom_nextnode(nodeid);
pnode_t root = prom_nextnode((pnode_t)0);
np = prom_nextnode(np);
peer = prom_nextnode(node);