smaller
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;
int i, smaller;
smaller = 1;
smaller = tg_sizes[i - 1];
smaller = 0;
node->tgn_smaller = smaller;
smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
if (smaller(tree, v, s->heap[j], s->depth)) break;