Lines Matching refs:qp
38 SEQ *lastqp, *qp; in seq_set() local
48 if ((qp = in seq_set()
59 free(qp->output); in seq_set()
60 qp->olen = olen; in seq_set()
61 qp->output = p; in seq_set()
66 CALLOC(sp, qp, 1, sizeof(SEQ)); in seq_set()
67 if (qp == NULL) { in seq_set()
74 qp->name = NULL; in seq_set()
75 else if ((qp->name = v_wstrdup(sp, name, nlen)) == NULL) { in seq_set()
79 qp->nlen = nlen; in seq_set()
82 if ((qp->input = v_wstrdup(sp, input, ilen)) == NULL) { in seq_set()
86 qp->ilen = ilen; in seq_set()
90 qp->output = NULL; in seq_set()
92 } else if ((qp->output = v_wstrdup(sp, output, olen)) == NULL) { in seq_set()
94 free(qp->input); in seq_set()
95 mem3: free(qp->name); in seq_set()
96 mem2: free(qp); in seq_set()
101 qp->olen = olen; in seq_set()
104 qp->stype = stype; in seq_set()
105 qp->flags = flags; in seq_set()
109 SLIST_INSERT_HEAD(sp->gp->seqq, qp, q); in seq_set()
111 SLIST_INSERT_AFTER(lastqp, qp, q); in seq_set()
115 if ((qp->input[0] & ~MAX_BIT_SEQ) == 0) in seq_set()
116 bit_set(sp->gp->seqb, qp->input[0]); in seq_set()
130 SEQ *qp, *pre_qp = NULL; in seq_delete() local
133 SLIST_FOREACH(qp, sp->gp->seqq, q) { in seq_delete()
134 if (qp->stype == stype && qp->ilen == ilen) { in seq_delete()
135 diff = MEMCMP(qp->input, input, ilen); in seq_delete()
137 if (F_ISSET(qp, SEQ_FUNCMAP)) in seq_delete()
139 if (qp == SLIST_FIRST(sp->gp->seqq)) in seq_delete()
143 return (seq_free(qp)); in seq_delete()
148 pre_qp = qp; in seq_delete()
160 seq_free(SEQ *qp) in seq_free() argument
162 free(qp->name); in seq_free()
163 free(qp->input); in seq_free()
164 free(qp->output); in seq_free()
165 free(qp); in seq_free()
181 SEQ *lqp = NULL, *qp; in seq_find() local
196 for (qp = SLIST_FIRST(sp->gp->seqq); qp != NULL; in seq_find()
197 lqp = qp, qp = SLIST_NEXT(qp, q)) { in seq_find()
203 if (qp->input[0] > c_input[0]) in seq_find()
205 if (qp->input[0] < c_input[0] || in seq_find()
206 qp->stype != stype || F_ISSET(qp, SEQ_FUNCMAP)) in seq_find()
208 diff = MEMCMP(qp->input, c_input, MIN(qp->ilen, ilen)); in seq_find()
210 if (qp->input[0] > e_input->e_c) in seq_find()
212 if (qp->input[0] < e_input->e_c || in seq_find()
213 qp->stype != stype || F_ISSET(qp, SEQ_FUNCMAP)) in seq_find()
216 e_memcmp(qp->input, e_input, MIN(qp->ilen, ilen)); in seq_find()
228 if (qp->ilen <= ilen) { in seq_find()
229 if (qp->ilen == ilen || ispartialp != NULL) { in seq_find()
232 return (qp); in seq_find()
259 SEQ *qp; in seq_close() local
261 while ((qp = SLIST_FIRST(gp->seqq)) != NULL) { in seq_close()
263 (void)seq_free(qp); in seq_close()
278 SEQ *qp; in seq_dump() local
283 SLIST_FOREACH(qp, sp->gp->seqq, q) { in seq_dump()
284 if (stype != qp->stype || F_ISSET(qp, SEQ_FUNCMAP)) in seq_dump()
287 for (p = qp->input, in seq_dump()
288 olen = qp->ilen, len = 0; olen > 0; --olen, ++p) in seq_dump()
293 if (qp->output != NULL) in seq_dump()
294 for (p = qp->output, in seq_dump()
295 olen = qp->olen, len = 0; olen > 0; --olen, ++p) in seq_dump()
300 if (isname && qp->name != NULL) { in seq_dump()
303 for (p = qp->name, in seq_dump()
304 olen = qp->nlen; olen > 0; --olen, ++p) in seq_dump()
322 SEQ *qp; in seq_save() local
327 SLIST_FOREACH(qp, sp->gp->seqq, q) { in seq_save()
328 if (stype != qp->stype || !F_ISSET(qp, SEQ_USERDEF)) in seq_save()
332 for (p = qp->input, olen = qp->ilen; olen > 0; --olen) { in seq_save()
340 if (qp->output != NULL) in seq_save()
341 for (p = qp->output, in seq_save()
342 olen = qp->olen; olen > 0; --olen) { in seq_save()