sq
TAILQ_HEAD(axq_q_f_s, ath_buf) sq;
TAILQ_INIT(&sq);
TAILQ_INSERT_TAIL(&sq, bf, bf_list);
bf = TAILQ_FIRST(&sq);
bf_last = TAILQ_LAST(&sq, axq_q_s);
TAILQ_FOREACH(bfi, &sq, bf_list) {
TAILQ_FOREACH(bfi, &sq, bf_list) {
TAILQ_CONCAT(&txq->fifo.axq_q, &sq, bf_list);
float sq = fMemoryUsage * fMemoryUsage;
sq *= sq;
sq *= sq;
mix_colors(used_memory_color, memory_color, swap_color, sq);
double sq = (prx*pry - prx*py1 - pry*px1) / (prx*py1 + pry*px1);
double coef = sign * sqrt((sq < 0) ? 0 : sq);
ieee80211_ff_age(struct ieee80211com *ic, struct ieee80211_stageq *sq,
if (sq->depth == 0) {
KASSERT(sq->head != NULL, ("stageq empty"));
head = sq->head;
while ((m = sq->head) != NULL && M_AGE_GET(m) < quanta) {
sq->head = m->m_nextpkt;
sq->depth--;
sq->tail = NULL;
stageq_add(struct ieee80211com *ic, struct ieee80211_stageq *sq, struct mbuf *m)
if (sq->tail != NULL) {
sq->tail->m_nextpkt = m;
age -= M_AGE_GET(sq->head);
sq->head = m;
sq->tail = m;
sq->depth++;
stageq_remove(struct ieee80211com *ic, struct ieee80211_stageq *sq, struct mbuf *mstaged)
for (m = sq->head; m != NULL; m = m->m_nextpkt) {
sq->head = m->m_nextpkt;
if (sq->tail == m)
sq->tail = mprev;
sq->depth--;
struct ieee80211_stageq *sq;
sq = &sg->ff_stageq[pri];
stageq_remove(ic, sq, mstaged);
stageq_remove(ic, sq, mstaged);
stageq_add(ic, sq, m);
"%s: stage frame, %u queued", __func__, sq->depth);
Strqueue sq;
strqueue_init(&sq);
strqueue_push(&sq, s);
strqueue_sort_u(&sq);
for (i = 0; i < sq.nstr; i++)
solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
strqueue_free(&sq);
Strqueue sq;
strqueue_init(&sq);
strqueue_push(&sq, testcase_ruleid(solv, q.elements[i]));
strqueue_sort_u(&sq);
for (i = 0; i < sq.nstr; i++)
solv_chksum_add(chk, sq.str[i], strlen(sq.str[i]) + 1);
strqueue_free(&sq);
Strqueue sq;
strqueue_init(&sq);
strqueue_push(&sq, s);
strqueue_push(&sq, s);
strqueue_push(&sq, s);
strqueue_push(&sq, s);
strqueue_push(&sq, s);
strqueue_push(&sq, s);
strqueue_push(&sq, s);
strqueue_sort(&sq);
result = strqueue_join(&sq);
strqueue_free(&sq);
Strqueue sq;
strqueue_init(&sq);
strqueue_push(&sq, cmd);
strqueue_free(&sq);
strqueue_free(&sq);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_push(&sq, cmd);
strqueue_free(&sq);
strqueue_free(&sq);
strqueue_free(&sq);
cmd = strqueue_join(&sq);
strqueue_free(&sq);
strqueue_free(&sq);
strqueue_free(&sq);
strqueue_free(&sq);
Solvable *sq = pool->solvables + q;
if (sq->name != s->name)
Solvable *sq = pool->solvables + q;
if (sq->name != s->name)
Solvable *s, *sq;
sq = pool->solvables + q;
vq = sq->arch;
vq = sq->vendor ? sq->vendor : 1;
Solvable *s, *sq;
sq = pool->solvables + q;
if ((!from && !to) || (s->arch == from && sq->arch == to))
Id vq = sq->vendor ? sq->vendor : 1;
sq(&hx, &lx, x);
sq(&hy, &ly, y);
sq(&hx, &lx, x);
sq(&hy, &ly, y);