Lines Matching defs:branches
182 int branches[2];
2433 while (!(code->tree[node].branches[0] ==
2434 code->tree[node].branches[1]))
2445 if (code->tree[node].branches[bit] < 0)
2451 node = code->tree[node].branches[bit];
2454 return code->tree[node].branches[0];
2527 if (code->tree[lastnode].branches[0] ==
2528 code->tree[lastnode].branches[1])
2541 if (!(code->tree[lastnode].branches[bit] < 0))
2559 * Set branches *
2560 code->tree[lastnode].branches[bit] = repeatnode;
2561 code->tree[repeatnode].branches[bit] = repeatnode;
2562 code->tree[repeatnode].branches[bit^1] = nextnode;
2571 if (code->tree[lastnode].branches[bit] < 0)
2578 code->tree[lastnode].branches[bit] = code->numentries++;
2582 lastnode = code->tree[lastnode].branches[bit];
2586 if (!(code->tree[lastnode].branches[0] == -1
2587 && code->tree[lastnode].branches[1] == -2))
2595 code->tree[lastnode].branches[0] = value;
2596 code->tree[lastnode].branches[1] = value;
2616 code->tree[code->numentries].branches[0] = -1;
2617 code->tree[code->numentries].branches[1] = -2;
2658 if (code->tree[node].branches[0] ==
2659 code->tree[node].branches[1])
2664 table[i].value = code->tree[node].branches[0];
2685 ret |= make_table_recurse(a, code, code->tree[node].branches[0], table,
2687 ret |= make_table_recurse(a, code, code->tree[node].branches[1],