uses
ENTRY_USES uses[MAX_USES];
if (ep->uses[i].name == 0) {
ep->uses[i].name = _nc_save_str(ep->uses[i].name);
if (ep->uses[i].name == 0)
useoffsets[i] = (int) (ep->uses[i].name - stringbuf);
ep->uses[i].name = 0;
ep->uses[i].name = strdup(tp->str_table + useoffsets[i]);
char *lookfor = qp->uses[i].name;
long lookline = qp->uses[i].line;
qp->uses[i].link = rp;
if (qp->uses[j].link != NULL
&& !strcmp(qp->uses[j].link->tterm.term_names,
qp->uses[i].link = rp;
if (qp->uses[j].link != NULL
&& !strcmp(qp->uses[j].link->tterm.term_names,
qp->uses[i].link = 0;
if (qp->uses[i].link
&& qp->uses[i].link->nuses) {
validate_merge(&merged, qp->uses[n].link);
_nc_merge_entry(&merged, qp->uses[n].link);
free(qp->uses[n].name);
entryp->uses[entryp->nuses].name = saved;
entryp->uses[entryp->nuses].line = _nc_curr_line;
if (entryp->uses[i].name != 0
&& !strchr(entryp->uses[i].name, '+'))
__uc_state_checker(x, func, uses, used)
if (!strcmp(e1->uses[i].name, e2->uses[j].name)) {
fputs(ep->uses[i].name, fp);
dump_uses(qp->uses[j].name, !capdump);
uses(DIP(super, dp, di_uid),