Lines Matching defs:pidx
236 /* fixup pidx */
239 n->array[idx+need].node->pidx = idx+need;
379 add->pidx = r->node->pidx;
384 r->node->pidx = 0;
411 add->pidx = addstr[r->len] - r->node->offset;
412 r->node->array[add->pidx].node = add;
413 r->node->array[add->pidx].str = split_str;
414 r->node->array[add->pidx].len = split_len;
475 com->pidx = r->node->pidx;
477 r->node->pidx = r->str[common_len]-com->offset;
479 add->pidx = addstr[common_len]-com->offset;
480 com->array[r->node->pidx].node = r->node;
481 com->array[r->node->pidx].str = s1_str;
482 com->array[r->node->pidx].len = s1_len;
483 com->array[add->pidx].node = add;
484 com->array[add->pidx].str = s2_str;
485 com->array[add->pidx].len = s2_len;
527 add->pidx = 0;
576 add->pidx = byte;
592 add->pidx = byte;
632 uint8_t pidx = n->pidx;
638 assert(pidx < par->len);
639 joinlen = par->array[pidx].len + n->array[0].len + 1;
647 if(par->array[pidx].str)
648 memcpy(join, par->array[pidx].str, par->array[pidx].len);
650 join[par->array[pidx].len] = child->pidx + n->offset;
653 memmove(join+par->array[pidx].len+1, n->array[0].str, n->array[0].len);
654 region_recycle(region, par->array[pidx].str, par->array[pidx].len);
655 par->array[pidx].str = join;
656 par->array[pidx].len = joinlen;
658 par->array[pidx].node = child;
660 child->pidx = pidx;
717 n->array[idx].node->pidx = idx;
750 uint8_t pidx;
753 pidx = n->pidx;
757 assert(pidx < par->len);
758 region_recycle(region, par->array[pidx].str, par->array[pidx].len);
759 par->array[pidx].str = NULL;
760 par->array[pidx].len = 0;
761 par->array[pidx].node = NULL;
767 } else if(pidx == 0) {
770 } else if(pidx == par->len-1) {
975 unsigned idx = n->pidx;
1000 uint8_t idx = n->pidx;
Indexes created Sun Mar 01 05:31:48 UTC 2026