pitem
pitem *item;
pitem *item;
pitem *item = NULL;
pitem *item = NULL;
pitem *item;
pitem *item;
pitem *item;
pitem *item;
pitem *item;
pitem *item = NULL;
pitem *item = NULL;
pitem *item;
pitem *item;
pitem *
pqueue_insert(pqueue_s *pq, pitem *item)
pitem *curr, *next;
pitem *
pitem *
pitem *item = pq->items;
pitem *
pitem *next;
pitem *
pitem *
pqueue_next(pitem **item)
pitem *ret;
pitem *item = pq->items;
pitem *items;
pitem *
pitem *item = malloc(sizeof(pitem));
pitem_free(pitem *item)
pitem *pitem_new(const unsigned char *prio64be, void *data);
void pitem_free(pitem *item);
pitem *pqueue_insert(pqueue pq, pitem *item);
pitem *pqueue_peek(pqueue pq);
pitem *pqueue_pop(pqueue pq);
pitem *pqueue_find(pqueue pq, const unsigned char *prio64be);
pitem *pqueue_iterator(pqueue pq);
pitem *pqueue_next(piterator *iter);
pitem *item = NULL;
pitem *iter = NULL;
pitem = calloc(maxitems, sizeof(bucket *));
if (pitem == NULL)
pitem = reallocarray(pitem, maxitems, sizeof(bucket *));
if (pitem == NULL)
memset(pitem + olditems, 0, (maxitems - olditems) * sizeof(bucket *));
for (i = nitems - 1; pitem[i]; --i)
if (i == maxitems - 1 || pitem[i + 1] == 0 ||
pitem[i + 1]->tag != plhs[nrules]->tag)
pitem[nitems] = 0;
bpp = pitem + nitems - 1;
pitem[nitems - 1] = bp;
for (i = nitems - 1; pitem[i]; --i)
tag = pitem[nitems + i - n - 1]->tag;
untyped_rhs(i, pitem[nitems + i - n - 1]->name);
while (pitem[j]) {
ritem[j] = pitem[j]->index;
if (pitem[j]->class == TERM) {
pprec = pitem[j]->prec;
assoc = pitem[j]->assoc;
free(pitem);
bucket **pitem;