Searched refs:inNodeNum (Results 1 – 2 of 2) sorted by relevance
186 int idx = node[outIdx].inNodeNum; in add_node()192 node[outIdx].inNodeNum = idx; in add_node()219 node[outIdx].inNodeNum = idx; in connect_node()226 for (int k = 0; k < node[outIdx].inNodeNum; k++) { in propagate()270 for (int k = 0; k < node[outIdx].inNodeNum; k++) { in estimate_value()301 node[outIdx].inNodeNum = 0; in init_graph()927 invNode[idx].inNodeNum = 0; in gen_inv_graph()935 for (int k = 0; k < node[idx].inNodeNum; k++) { in gen_inv_graph()
17 int inNodeNum; member