summaryrefslogtreecommitdiff
path: root/lib/order.c
AgeCommit message (Expand)AuthorFilesLines
2012-09-24Switch back to early added packages rpmal populatingPanu Matilainen1-4/+0
2012-09-12Delay transaction added packages rpmal creation until requiredPanu Matilainen1-0/+4
2012-09-12Add an nternal rpmal create+populate helper function, use for erased packagesPanu Matilainen1-7/+2
2011-09-01Pass tsflags to rpmal and remember themPanu Matilainen1-1/+2
2011-09-01Source formatting cosmetics: function blocks start on the next linePanu Matilainen1-1/+2
2011-06-01Lift Dijkstra algorithm out of collectSCC() to separate functionPanu Matilainen1-21/+24
2011-06-01Eliminate struct copy in collectSCC(), use a pointer insteadPanu Matilainen1-8/+8
2011-05-31Remove reamining dead assignments from rpmtsiFree() in transaction codePanu Matilainen1-2/+2
2011-05-29Eliminate dead NULL-assignments at scope-end in librpm, part VPanu Matilainen1-2/+2
2011-03-08Improve the dependency loop debug message a bitPanu Matilainen1-2/+3
2011-03-08Preferred color pkgs should be erased lastPanu Matilainen1-3/+10
2011-01-25Teach rpm about post-transaction dependenciesPanu Matilainen1-1/+1
2010-12-15Eliminate ancient dependency loop whiteout mechanismPanu Matilainen1-87/+1
2010-12-13Implement transaction ordering hintingPanu Matilainen1-0/+6
2010-10-25Create less draconian loops for grouped collectionsPanu Matilainen1-5/+28
2010-10-25Only specific cases of collections need extra orderingPanu Matilainen1-7/+11
2010-09-17Expel Tarjan from his nestPanu Matilainen1-81/+88
2010-06-22Add common Collection requirementsSteve Lawrence1-30/+57
2010-03-29Teach rpm about pre-transaction dependenciesPanu Matilainen1-2/+2
2010-03-18Lazy rpmal hash creation on first lookup, make rpmalMakeIndex() staticPanu Matilainen1-7/+0
2010-03-12Split transaction member information out of rpmts to separate structPanu Matilainen1-10/+11
2009-12-21Work on tsortinfo instead of ts elements when ordering everywherePanu Matilainen1-59/+51
2009-12-21Work on tsortInfo nodes directly when detecting SCC'sPanu Matilainen1-52/+38
2009-12-21Record relations to tsortInfos instead of transaction elementsPanu Matilainen1-17/+16
2009-12-21Save pointer to ts element in the tsort info structPanu Matilainen1-0/+2
2009-12-21Avoid a bunch of redundant rpmteTSI() callsPanu Matilainen1-8/+10
2009-12-21Eliminate unnecessary depth member from tsortinfoPanu Matilainen1-22/+9
2009-12-21Eliminate unnecessary npreds member from tsort infoPanu Matilainen1-5/+1
2009-12-21Eliminate unused tree index and degree from ordering calculationsPanu Matilainen1-22/+3
2009-12-21Avoid a few unnecessary rpmteTSI() calls in addRelation()Panu Matilainen1-6/+6
2009-12-21Remove unused ordering related members from rpmts structPanu Matilainen1-3/+0
2009-12-21Bury ordering structures and their alloc+free inside order.cPanu Matilainen1-8/+51
2009-12-21Convert rpmtsOrder() to manipulate the tsort data from tsortInfo directlyPanu Matilainen1-6/+7
2009-12-21Convert addRelation() to manipulate the tsort data from tsortInfo directlyPanu Matilainen1-4/+4
2009-12-21Convert collectTE() to manipulate the tsort data from tsortInfo directlyPanu Matilainen1-10/+10
2009-12-21Avoid some unnecessary rpmteTSI() calls in collectTE()Panu Matilainen1-8/+8
2009-09-07Eliminate unused variable and pointless null-checkPanu Matilainen1-4/+0
2009-08-31Replace equal/not equal uses of str[n]cmp() with rstreq[n] in main ts codePanu Matilainen1-1/+1
2009-08-17Eliminate unused code (leftover from ordering rewrite)Panu Matilainen1-18/+0
2009-06-11Add preferred color to rpmalPanu Matilainen1-1/+1
2009-06-10Split ordering code to separate source filePanu Matilainen1-0/+708