void mmc_queue_bounce_pre(struct mmc_queue *mq) { if (!mq->bounce_buf) return; if (mq->bounce_sg_len == 1) return; if (rq_data_dir(mq->req) != WRITE) return; copy_sg(mq->sg, 1, mq->bounce_sg, mq->bounce_sg_len); }
void mmc_queue_bounce_post(struct mmc_queue *mq) { if (!mq->bounce_buf) return; if (mq->bounce_sg_len == 1) return; if (rq_data_dir(mq->req) != READ) return; copy_sg(mq->bounce_sg, mq->bounce_sg_len, mq->sg, 1); }
static void subdivisiongraph(sparsegraph *g, int k, sparsegraph *h) /* h := subdivision graph of g, k new vertices per edge */ { DYNALLSTAT(size_t,eno,eno_sz); /* edge number */ int *ge,*gd,*he,*hd; size_t *gv,*hv; int gnv,hnv; size_t i,j,l,gnde,hnde,num; size_t hi,lo,mid,w; if (k == 0) { copy_sg(g,h); return; } sortlists_sg(g); SG_VDE(g,gv,gd,ge); gnv = g->nv; gnde = g->nde; DYNALLOC1(size_t,eno,eno_sz,gnde,"subdivideg"); hnv = gnv + k*(gnde/2); if (hnv <= 0 || (gnde > 0 && ((size_t)(hnv-gnv))/(gnde/2) != k)) gt_abort(">E subdivideg: output graph too large\n"); hnde = gnde * (k+1); if (hnde/(k+1) != gnde) gt_abort(">E subdivideg: output graph too large\n"); num = 0; for (i = 0; i < gnv; ++i) { for (j = gv[i]; j < gv[i]+gd[i]; ++j) { if (ge[j] == i) gt_abort(">E subdivideg can't handle undirected loops\n"); else if (ge[j] > i) eno[j] = num++; else { lo = gv[ge[j]]; hi = lo + gd[ge[j]] - 1; while (lo <= hi) { mid = lo + (hi-lo)/2; if (ge[mid] == i) break; else if (ge[mid] < i) lo = mid+1; else hi = mid-1; } if (lo > hi) gt_abort(">E subdivideg : binary search failed\n"); eno[j] = eno[mid]; } } } SG_ALLOC(*h,hnv,hnde,"subdivideg"); h->nv = hnv; h->nde = hnde; SG_VDE(h,hv,hd,he); for (i = 0; i < gnv; ++i) { hd[i] = gd[i]; hv[i] = gv[i]; } for (i = gnv; i < hnv; ++i) { hd[i] = 2; hv[i] = gnde + 2*(i-gnv); } for (i = 0; i < gnv; ++i) { for (j = gv[i]; j < gv[i]+gd[i]; ++j) if (ge[j] > i) { w = gnv + k*eno[j]; he[j] = w; he[hv[w]] = i; for (l = 1; l < k; ++l) { he[hv[w]+1] = w+1; he[hv[w+1]] = w; ++w; } } else { w = gnv + k*eno[j] + k - 1; he[j] = w; he[hv[w]+1] = i; } } }