upgrade.go 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387
  1. package main
  2. import (
  3. "bufio"
  4. "fmt"
  5. "os"
  6. "sort"
  7. "strconv"
  8. "strings"
  9. "unicode"
  10. alpm "github.com/jguer/go-alpm"
  11. pkgb "github.com/mikkeloscar/gopkgbuild"
  12. )
  13. // upgrade type describes a system upgrade.
  14. type upgrade struct {
  15. Name string
  16. Repository string
  17. LocalVersion string
  18. RemoteVersion string
  19. }
  20. // upSlice is a slice of Upgrades
  21. type upSlice []upgrade
  22. func (u upSlice) Len() int { return len(u) }
  23. func (u upSlice) Swap(i, j int) { u[i], u[j] = u[j], u[i] }
  24. func (u upSlice) Less(i, j int) bool {
  25. iRunes := []rune(u[i].Repository)
  26. jRunes := []rune(u[j].Repository)
  27. max := len(iRunes)
  28. if max > len(jRunes) {
  29. max = len(jRunes)
  30. }
  31. for idx := 0; idx < max; idx++ {
  32. ir := iRunes[idx]
  33. jr := jRunes[idx]
  34. lir := unicode.ToLower(ir)
  35. ljr := unicode.ToLower(jr)
  36. if lir != ljr {
  37. return lir > ljr
  38. }
  39. // the lowercase runes are the same, so compare the original
  40. if ir != jr {
  41. return ir > jr
  42. }
  43. }
  44. return false
  45. }
  46. func getVersionDiff(oldVersion, newversion string) (left, right string) {
  47. old, errOld := pkgb.NewCompleteVersion(oldVersion)
  48. new, errNew := pkgb.NewCompleteVersion(newversion)
  49. if errOld != nil {
  50. left = redFg("Invalid Version")
  51. }
  52. if errNew != nil {
  53. right = redFg("Invalid Version")
  54. }
  55. if errOld == nil && errNew == nil {
  56. if old.Version == new.Version {
  57. left = string(old.Version) + "-" + redFg(string(old.Pkgrel))
  58. right = string(new.Version) + "-" + greenFg(string(new.Pkgrel))
  59. } else {
  60. left = redFg(string(old.Version)) + "-" + string(old.Pkgrel)
  61. right = boldGreenFg(string(new.Version)) + "-" + string(new.Pkgrel)
  62. }
  63. }
  64. return
  65. }
  66. // Print prints the details of the packages to upgrade.
  67. func (u upSlice) Print(start int) {
  68. for k, i := range u {
  69. left, right := getVersionDiff(i.LocalVersion, i.RemoteVersion)
  70. fmt.Print(yellowFg(fmt.Sprintf("%2d ", len(u)+start-k-1)))
  71. fmt.Print(colourHash(i.Repository), "/", boldWhiteFg(i.Name))
  72. w := 70 - len(i.Repository) - len(i.Name) + len(left)
  73. fmt.Printf(fmt.Sprintf("%%%ds", w),
  74. fmt.Sprintf("%s -> %s\n", left, right))
  75. }
  76. }
  77. // upList returns lists of packages to upgrade from each source.
  78. func upList(dt *depTree) (aurUp upSlice, repoUp upSlice, err error) {
  79. local, remote, _, remoteNames, err := filterPackages()
  80. if err != nil {
  81. return
  82. }
  83. repoC := make(chan upSlice)
  84. aurC := make(chan upSlice)
  85. errC := make(chan error)
  86. fmt.Println(boldCyanFg("::"), boldFg("Searching databases for updates..."))
  87. go func() {
  88. repoUpList, err := upRepo(local)
  89. errC <- err
  90. repoC <- repoUpList
  91. }()
  92. fmt.Println(boldCyanFg("::"), boldFg("Searching AUR for updates..."))
  93. go func() {
  94. aurUpList, err := upAUR(remote, remoteNames, dt)
  95. errC <- err
  96. aurC <- aurUpList
  97. }()
  98. var i = 0
  99. loop:
  100. for {
  101. select {
  102. case repoUp = <-repoC:
  103. i++
  104. case aurUp = <-aurC:
  105. i++
  106. case err := <-errC:
  107. if err != nil {
  108. fmt.Println(err)
  109. }
  110. default:
  111. if i == 2 {
  112. close(repoC)
  113. close(aurC)
  114. close(errC)
  115. break loop
  116. }
  117. }
  118. }
  119. return
  120. }
  121. func upDevel(remote []alpm.Package, packageC chan upgrade, done chan bool) {
  122. for _, e := range savedInfo {
  123. if e.needsUpdate() {
  124. found := false
  125. var pkg alpm.Package
  126. for _, r := range remote {
  127. if r.Name() == e.Package {
  128. found = true
  129. pkg = r
  130. }
  131. }
  132. if found {
  133. if pkg.ShouldIgnore() {
  134. fmt.Print(yellowFg("Warning: "))
  135. fmt.Printf("%s ignoring package upgrade (%s => %s)\n", pkg.Name(), pkg.Version(), "git")
  136. } else {
  137. packageC <- upgrade{e.Package, "devel", pkg.Version(), "commit-" + e.SHA[0:6]}
  138. }
  139. } else {
  140. removeVCSPackage([]string{e.Package})
  141. }
  142. }
  143. }
  144. done <- true
  145. }
  146. // upAUR gathers foreign packages and checks if they have new versions.
  147. // Output: Upgrade type package list.
  148. func upAUR(remote []alpm.Package, remoteNames []string, dt *depTree) (toUpgrade upSlice, err error) {
  149. var routines int
  150. var routineDone int
  151. packageC := make(chan upgrade)
  152. done := make(chan bool)
  153. if config.Devel {
  154. routines++
  155. go upDevel(remote, packageC, done)
  156. fmt.Println(boldCyanFg("::"), boldFg("Checking development packages..."))
  157. }
  158. routines++
  159. go func(remote []alpm.Package, remoteNames []string, dt *depTree) {
  160. for _, pkg := range remote {
  161. aurPkg, ok := dt.Aur[pkg.Name()]
  162. if !ok {
  163. continue
  164. }
  165. if (config.TimeUpdate && (int64(aurPkg.LastModified) > pkg.BuildDate().Unix())) ||
  166. (alpm.VerCmp(pkg.Version(), aurPkg.Version) < 0) {
  167. if pkg.ShouldIgnore() {
  168. left, right := getVersionDiff(pkg.Version(), aurPkg.Version)
  169. fmt.Print(yellowFg("Warning: "))
  170. fmt.Printf("%s ignoring package upgrade (%s => %s)\n", pkg.Name(), left, right)
  171. } else {
  172. packageC <- upgrade{aurPkg.Name, "aur", pkg.Version(), aurPkg.Version}
  173. }
  174. }
  175. }
  176. done <- true
  177. }(remote, remoteNames, dt)
  178. if routineDone == routines {
  179. err = nil
  180. return
  181. }
  182. for {
  183. select {
  184. case pkg := <-packageC:
  185. for _, w := range toUpgrade {
  186. if w.Name == pkg.Name {
  187. continue
  188. }
  189. }
  190. toUpgrade = append(toUpgrade, pkg)
  191. case <-done:
  192. routineDone++
  193. if routineDone == routines {
  194. err = nil
  195. return
  196. }
  197. }
  198. }
  199. }
  200. // upRepo gathers local packages and checks if they have new versions.
  201. // Output: Upgrade type package list.
  202. func upRepo(local []alpm.Package) (upSlice, error) {
  203. dbList, err := alpmHandle.SyncDbs()
  204. if err != nil {
  205. return nil, err
  206. }
  207. slice := upSlice{}
  208. for _, pkg := range local {
  209. newPkg := pkg.NewVersion(dbList)
  210. if newPkg != nil {
  211. if pkg.ShouldIgnore() {
  212. fmt.Print(yellowFg("Warning: "))
  213. fmt.Printf("%s ignoring package upgrade (%s => %s)\n", pkg.Name(), pkg.Version(), newPkg.Version())
  214. } else {
  215. slice = append(slice, upgrade{pkg.Name(), newPkg.DB().Name(), pkg.Version(), newPkg.Version()})
  216. }
  217. }
  218. }
  219. return slice, nil
  220. }
  221. //Contains returns whether e is present in s
  222. func containsInt(s []int, e int) bool {
  223. for _, a := range s {
  224. if a == e {
  225. return true
  226. }
  227. }
  228. return false
  229. }
  230. // RemoveIntListFromList removes all src's elements that are present in target
  231. func removeIntListFromList(src, target []int) []int {
  232. max := len(target)
  233. for i := 0; i < max; i++ {
  234. if containsInt(src, target[i]) {
  235. target = append(target[:i], target[i+1:]...)
  236. max--
  237. i--
  238. }
  239. }
  240. return target
  241. }
  242. // upgradePkgs handles updating the cache and installing updates.
  243. func upgradePkgs(dt *depTree) (stringSet, stringSet, error) {
  244. var repoNums []int
  245. var aurNums []int
  246. repoNames := make(stringSet)
  247. aurNames := make(stringSet)
  248. aurUp, repoUp, err := upList(dt)
  249. if err != nil {
  250. return repoNames, aurNames, err
  251. } else if len(aurUp)+len(repoUp) == 0 {
  252. return repoNames, aurNames, err
  253. }
  254. sort.Sort(repoUp)
  255. fmt.Println(boldBlueFg("::"), len(aurUp)+len(repoUp), boldWhiteFg("Packages to upgrade."))
  256. repoUp.Print(len(aurUp) + 1)
  257. aurUp.Print(1)
  258. if !config.NoConfirm {
  259. fmt.Println(boldGreenFg(arrow) + greenFg(" Packages to not upgrade (eg: 1 2 3, 1-3 or ^4)"))
  260. fmt.Print(boldGreenFg(arrow + " "))
  261. reader := bufio.NewReader(os.Stdin)
  262. numberBuf, overflow, err := reader.ReadLine()
  263. if err != nil || overflow {
  264. fmt.Println(err)
  265. return repoNames, aurNames, err
  266. }
  267. result := strings.Fields(string(numberBuf))
  268. excludeAur := make([]int, 0)
  269. excludeRepo := make([]int, 0)
  270. for _, numS := range result {
  271. negate := numS[0] == '^'
  272. if negate {
  273. numS = numS[1:]
  274. }
  275. var numbers []int
  276. num, err := strconv.Atoi(numS)
  277. if err != nil {
  278. numbers, err = BuildRange(numS)
  279. if err != nil {
  280. continue
  281. }
  282. } else {
  283. numbers = []int{num}
  284. }
  285. for _, target := range numbers {
  286. if target > len(aurUp)+len(repoUp) || target <= 0 {
  287. continue
  288. } else if target <= len(aurUp) {
  289. target = len(aurUp) - target
  290. if negate {
  291. excludeAur = append(excludeAur, target)
  292. } else {
  293. aurNums = append(aurNums, target)
  294. }
  295. } else {
  296. target = len(aurUp) + len(repoUp) - target
  297. if negate {
  298. excludeRepo = append(excludeRepo, target)
  299. } else {
  300. repoNums = append(repoNums, target)
  301. }
  302. }
  303. }
  304. }
  305. if len(repoNums) == 0 && len(aurNums) == 0 &&
  306. (len(excludeRepo) > 0 || len(excludeAur) > 0) {
  307. if len(repoUp) > 0 {
  308. repoNums = BuildIntRange(0, len(repoUp)-1)
  309. }
  310. if len(aurUp) > 0 {
  311. aurNums = BuildIntRange(0, len(aurUp)-1)
  312. }
  313. }
  314. aurNums = removeIntListFromList(excludeAur, aurNums)
  315. repoNums = removeIntListFromList(excludeRepo, repoNums)
  316. }
  317. if len(repoUp) != 0 {
  318. repoloop:
  319. for i, k := range repoUp {
  320. for _, j := range repoNums {
  321. if j == i {
  322. continue repoloop
  323. }
  324. }
  325. repoNames.set(k.Name)
  326. }
  327. }
  328. if len(aurUp) != 0 {
  329. aurloop:
  330. for i, k := range aurUp {
  331. for _, j := range aurNums {
  332. if j == i {
  333. continue aurloop
  334. }
  335. }
  336. aurNames.set(k.Name)
  337. }
  338. }
  339. return repoNames, aurNames, err
  340. }