Searched refs:left_nodes (Results 1 – 2 of 2) sorted by relevance
105 short *left_nodes; /*right_node_index is always left_nodex+1, so just store left. member
567 tree->left_nodes = (short *) lts_alloc(tree->num_nodes, sizeof(short)); in load_trees()568 if (tree->left_nodes == NULL) { in load_trees()578 PORT_FREAD_INT16(&(tree->left_nodes[i]), sizeof(short), 1, fp); in load_trees()582 …pfprintf(PSTDOUT,"LOAD_TREE: node[%d] %d %d", i, tree->left_nodes[i], tree->values_or_question1[i… in load_trees()586 if (tree->left_nodes[i] != NO_NODE) { in load_trees()640 if (tree->left_nodes) { in free_trees()641 FREE(tree->left_nodes); in free_trees()642 tree->left_nodes = NULL; in free_trees()1325 left_index = tree->left_nodes[index]; in find_output_for_dp()