prom_childnode
child = prom_childnode(curnode);
(node_id == prom_childnode(current_id)))) {
if (id[depth] = prom_childnode(id[depth - 1])) {
pnode_t child = prom_childnode(nodeid);
st->current_id = prom_childnode(node_id);
cnid = (int)prom_childnode((pnode_t)nid);
cnid = (int)prom_childnode((pnode_t)nid);
nodeid = prom_childnode(nodeid);
nodeid = prom_childnode(nodeid);
extern pnode_t prom_childnode(pnode_t nodeid);
if ((cur_node = prom_childnode(cur_node)) == 0) {
extern pnode_t prom_childnode(pnode_t nodeid);
for (curnode = prom_childnode(curnode); curnode;
for (curnode = prom_childnode(curnode); curnode;
for (curnode = prom_childnode(curnode); curnode;
for (pnode = prom_childnode(pnode); pnode;
#define CHILD prom_childnode
for (curnode = prom_childnode(curnode); curnode;
for (curnode = prom_childnode(curnode); curnode;
for (cur_node = prom_childnode(parent); cur_node != OBP_NONODE;
child = prom_childnode(node);
sbdp_walk_prom_tree_worker(prom_childnode(node), f, arg);
cpu_node = prom_childnode(cpu_node);
pnode_t nid = prom_childnode(prom_rootnode());
nodeid = prom_childnode(prom_rootnode());
if ((np = prom_childnode(np)) == OBP_NONODE)
child = prom_childnode(parent);