orderdata
addsolvableedges(struct orderdata *od, Solvable *s)
breakcycle(struct orderdata *od, Id *cycle)
dump_tes(struct orderdata *od)
reachable(struct orderdata *od, Id i)
addcycleedges(struct orderdata *od, Id *cycle, Queue *todo)
struct orderdata od;
if (trans->orderdata)
struct _TransactionOrderdata *od = trans->orderdata;
trans->orderdata = solv_free(trans->orderdata);
trans->orderdata = solv_calloc(1, sizeof(*trans->orderdata));
trans->orderdata->tes = od.tes;
trans->orderdata->ntes = numte;
trans->orderdata->invedgedata = od.invedgedata;
trans->orderdata->ninvedgedata = od.nedgedata;
struct _TransactionOrderdata *od = trans->orderdata;
if (srctrans->orderdata)
struct _TransactionOrderdata *od = srctrans->orderdata;
trans->orderdata = solv_calloc(1, sizeof(*trans->orderdata));
trans->orderdata->tes = solv_malloc2(od->ntes, sizeof(*od->tes));
memcpy(trans->orderdata->tes, od->tes, od->ntes * sizeof(*od->tes));
trans->orderdata->ntes = od->ntes;
trans->orderdata->invedgedata = solv_malloc2(od->ninvedgedata, sizeof(Id));
memcpy(trans->orderdata->invedgedata, od->invedgedata, od->ninvedgedata * sizeof(Id));
trans->orderdata->ninvedgedata = od->ninvedgedata;
if (trans->orderdata)
struct _TransactionOrderdata *od = trans->orderdata;
trans->orderdata = solv_free(trans->orderdata);
addteedge(struct orderdata *od, int from, int to, int type)
addedge(struct orderdata *od, Id from, Id to, int type)
havechoice(struct orderdata *od, Id p, Id q1, Id q2)
struct _TransactionOrderdata *orderdata;