dep_graph.go 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782
  1. package dep
  2. import (
  3. "context"
  4. "fmt"
  5. "strconv"
  6. aurc "github.com/Jguer/aur"
  7. alpm "github.com/Jguer/go-alpm/v2"
  8. gosrc "github.com/Morganamilo/go-srcinfo"
  9. mapset "github.com/deckarep/golang-set/v2"
  10. "github.com/leonelquinteros/gotext"
  11. "github.com/Jguer/yay/v12/pkg/db"
  12. "github.com/Jguer/yay/v12/pkg/intrange"
  13. aur "github.com/Jguer/yay/v12/pkg/query"
  14. "github.com/Jguer/yay/v12/pkg/text"
  15. "github.com/Jguer/yay/v12/pkg/topo"
  16. )
  17. type InstallInfo struct {
  18. Source Source
  19. Reason Reason
  20. Version string
  21. LocalVersion string
  22. SrcinfoPath *string
  23. AURBase *string
  24. SyncDBName *string
  25. IsGroup bool
  26. Upgrade bool
  27. Devel bool
  28. }
  29. func (i *InstallInfo) String() string {
  30. return fmt.Sprintf("InstallInfo{Source: %v, Reason: %v}", i.Source, i.Reason)
  31. }
  32. type (
  33. Reason int
  34. Source int
  35. )
  36. func (r Reason) String() string {
  37. return ReasonNames[r]
  38. }
  39. func (s Source) String() string {
  40. return SourceNames[s]
  41. }
  42. const (
  43. Explicit Reason = iota // 0
  44. Dep // 1
  45. MakeDep // 2
  46. CheckDep // 3
  47. )
  48. var ReasonNames = map[Reason]string{
  49. Explicit: gotext.Get("Explicit"),
  50. Dep: gotext.Get("Dependency"),
  51. MakeDep: gotext.Get("Make Dependency"),
  52. CheckDep: gotext.Get("Check Dependency"),
  53. }
  54. const (
  55. AUR Source = iota
  56. Sync
  57. Local
  58. SrcInfo
  59. Missing
  60. )
  61. var SourceNames = map[Source]string{
  62. AUR: gotext.Get("AUR"),
  63. Sync: gotext.Get("Sync"),
  64. Local: gotext.Get("Local"),
  65. SrcInfo: gotext.Get("SRCINFO"),
  66. Missing: gotext.Get("Missing"),
  67. }
  68. var bgColorMap = map[Source]string{
  69. AUR: "lightblue",
  70. Sync: "lemonchiffon",
  71. Local: "darkolivegreen1",
  72. Missing: "tomato",
  73. }
  74. var colorMap = map[Reason]string{
  75. Explicit: "black",
  76. Dep: "deeppink",
  77. MakeDep: "navyblue",
  78. CheckDep: "forestgreen",
  79. }
  80. type Grapher struct {
  81. logger *text.Logger
  82. providerCache map[string][]aur.Pkg
  83. dbExecutor db.Executor
  84. aurClient aurc.QueryClient
  85. fullGraph bool // If true, the graph will include all dependencies including already installed ones or repo
  86. noConfirm bool // If true, the graph will not prompt for confirmation
  87. noDeps bool // If true, the graph will not include dependencies
  88. noCheckDeps bool // If true, the graph will not include check dependencies
  89. needed bool // If true, the graph will only include packages that are not installed
  90. }
  91. func NewGrapher(dbExecutor db.Executor, aurCache aurc.QueryClient,
  92. fullGraph, noConfirm, noDeps, noCheckDeps, needed bool,
  93. logger *text.Logger,
  94. ) *Grapher {
  95. return &Grapher{
  96. dbExecutor: dbExecutor,
  97. aurClient: aurCache,
  98. fullGraph: fullGraph,
  99. noConfirm: noConfirm,
  100. noDeps: noDeps,
  101. noCheckDeps: noCheckDeps,
  102. needed: needed,
  103. providerCache: make(map[string][]aurc.Pkg, 5),
  104. logger: logger,
  105. }
  106. }
  107. func (g *Grapher) GraphFromTargets(ctx context.Context,
  108. graph *topo.Graph[string, *InstallInfo], targets []string,
  109. ) (*topo.Graph[string, *InstallInfo], error) {
  110. if graph == nil {
  111. graph = topo.New[string, *InstallInfo]()
  112. }
  113. aurTargets := make([]string, 0, len(targets))
  114. for _, targetString := range targets {
  115. target := ToTarget(targetString)
  116. switch target.DB {
  117. case "": // unspecified db
  118. if pkg := g.dbExecutor.SyncSatisfier(target.Name); pkg != nil {
  119. dbName := pkg.DB().Name()
  120. g.GraphSyncPkg(ctx, graph, pkg, &InstallInfo{
  121. Source: Sync,
  122. Reason: Explicit,
  123. Version: pkg.Version(),
  124. SyncDBName: &dbName,
  125. })
  126. continue
  127. }
  128. groupPackages := g.dbExecutor.PackagesFromGroup(target.Name)
  129. if len(groupPackages) > 0 {
  130. dbName := groupPackages[0].DB().Name()
  131. graph.AddNode(target.Name)
  132. g.ValidateAndSetNodeInfo(graph, target.Name, &topo.NodeInfo[*InstallInfo]{
  133. Color: colorMap[Explicit],
  134. Background: bgColorMap[Sync],
  135. Value: &InstallInfo{
  136. Source: Sync,
  137. Reason: Explicit,
  138. Version: "",
  139. SyncDBName: &dbName,
  140. IsGroup: true,
  141. },
  142. })
  143. continue
  144. }
  145. fallthrough
  146. case "aur":
  147. aurTargets = append(aurTargets, target.Name)
  148. default:
  149. graph.AddNode(target.Name)
  150. g.ValidateAndSetNodeInfo(graph, target.Name, &topo.NodeInfo[*InstallInfo]{
  151. Color: colorMap[Explicit],
  152. Background: bgColorMap[Sync],
  153. Value: &InstallInfo{
  154. Source: Sync,
  155. Reason: Explicit,
  156. Version: target.Version,
  157. SyncDBName: &target.DB,
  158. },
  159. })
  160. }
  161. }
  162. var errA error
  163. graph, errA = g.GraphFromAUR(ctx, graph, aurTargets)
  164. if errA != nil {
  165. return nil, errA
  166. }
  167. return graph, nil
  168. }
  169. func (g *Grapher) pickSrcInfoPkgs(pkgs []aurc.Pkg) ([]aurc.Pkg, error) {
  170. final := make([]aurc.Pkg, 0, len(pkgs))
  171. for i := range pkgs {
  172. g.logger.Println(text.Magenta(strconv.Itoa(i+1)+" ") + text.Bold(pkgs[i].Name) +
  173. " " + text.Cyan(pkgs[i].Version))
  174. g.logger.Println(" " + pkgs[i].Description)
  175. }
  176. g.logger.Infoln(gotext.Get("Packages to exclude") + " (eg: \"1 2 3\", \"1-3\", \"^4\"):")
  177. numberBuf, err := g.logger.GetInput("", g.noConfirm)
  178. if err != nil {
  179. return nil, err
  180. }
  181. include, exclude, _, otherExclude := intrange.ParseNumberMenu(numberBuf)
  182. isInclude := len(exclude) == 0 && len(otherExclude) == 0
  183. for i := 1; i <= len(pkgs); i++ {
  184. target := i - 1
  185. if isInclude && !include.Get(i) {
  186. final = append(final, pkgs[target])
  187. }
  188. if !isInclude && (exclude.Get(i)) {
  189. final = append(final, pkgs[target])
  190. }
  191. }
  192. return final, nil
  193. }
  194. func (g *Grapher) GraphFromSrcInfo(ctx context.Context, graph *topo.Graph[string, *InstallInfo], pkgBuildDir string,
  195. pkgbuild *gosrc.Srcinfo,
  196. ) (*topo.Graph[string, *InstallInfo], error) {
  197. if graph == nil {
  198. graph = topo.New[string, *InstallInfo]()
  199. }
  200. aurPkgs, err := makeAURPKGFromSrcinfo(g.dbExecutor, pkgbuild)
  201. if err != nil {
  202. return nil, err
  203. }
  204. if len(aurPkgs) > 1 {
  205. var errPick error
  206. aurPkgs, errPick = g.pickSrcInfoPkgs(aurPkgs)
  207. if errPick != nil {
  208. return nil, errPick
  209. }
  210. }
  211. for i := range aurPkgs {
  212. pkg := &aurPkgs[i]
  213. graph.AddNode(pkg.Name)
  214. g.ValidateAndSetNodeInfo(graph, pkg.Name, &topo.NodeInfo[*InstallInfo]{
  215. Color: colorMap[Explicit],
  216. Background: bgColorMap[AUR],
  217. Value: &InstallInfo{
  218. Source: SrcInfo,
  219. Reason: Explicit,
  220. SrcinfoPath: &pkgBuildDir,
  221. AURBase: &pkg.PackageBase,
  222. Version: pkg.Version,
  223. },
  224. })
  225. g.addDepNodes(ctx, pkg, graph)
  226. }
  227. return graph, nil
  228. }
  229. func (g *Grapher) addDepNodes(ctx context.Context, pkg *aur.Pkg, graph *topo.Graph[string, *InstallInfo]) {
  230. if len(pkg.MakeDepends) > 0 {
  231. g.addNodes(ctx, graph, pkg.Name, pkg.MakeDepends, MakeDep)
  232. }
  233. if !g.noDeps && len(pkg.Depends) > 0 {
  234. g.addNodes(ctx, graph, pkg.Name, pkg.Depends, Dep)
  235. }
  236. if !g.noCheckDeps && !g.noDeps && len(pkg.CheckDepends) > 0 {
  237. g.addNodes(ctx, graph, pkg.Name, pkg.CheckDepends, CheckDep)
  238. }
  239. }
  240. func (g *Grapher) GraphSyncPkg(ctx context.Context,
  241. graph *topo.Graph[string, *InstallInfo],
  242. pkg alpm.IPackage, instalInfo *InstallInfo,
  243. ) *topo.Graph[string, *InstallInfo] {
  244. if graph == nil {
  245. graph = topo.New[string, *InstallInfo]()
  246. }
  247. graph.AddNode(pkg.Name())
  248. _ = pkg.Provides().ForEach(func(p *alpm.Depend) error {
  249. g.logger.Debugln(pkg.Name() + " provides: " + p.String())
  250. graph.Provides(p.Name, p, pkg.Name())
  251. return nil
  252. })
  253. g.ValidateAndSetNodeInfo(graph, pkg.Name(), &topo.NodeInfo[*InstallInfo]{
  254. Color: colorMap[Explicit],
  255. Background: bgColorMap[Sync],
  256. Value: instalInfo,
  257. })
  258. return graph
  259. }
  260. func (g *Grapher) GraphAURTarget(ctx context.Context,
  261. graph *topo.Graph[string, *InstallInfo],
  262. pkg *aurc.Pkg, instalInfo *InstallInfo,
  263. ) *topo.Graph[string, *InstallInfo] {
  264. if graph == nil {
  265. graph = topo.New[string, *InstallInfo]()
  266. }
  267. exists := graph.Exists(pkg.Name)
  268. graph.AddNode(pkg.Name)
  269. for i := range pkg.Provides {
  270. depName, mod, version := splitDep(pkg.Provides[i])
  271. graph.Provides(depName, &alpm.Depend{
  272. Name: depName,
  273. Version: version,
  274. Mod: aurDepModToAlpmDep(mod),
  275. }, pkg.Name)
  276. }
  277. g.ValidateAndSetNodeInfo(graph, pkg.Name, &topo.NodeInfo[*InstallInfo]{
  278. Color: colorMap[instalInfo.Reason],
  279. Background: bgColorMap[AUR],
  280. Value: instalInfo,
  281. })
  282. if !exists {
  283. g.addDepNodes(ctx, pkg, graph)
  284. }
  285. return graph
  286. }
  287. func (g *Grapher) GraphFromAUR(ctx context.Context,
  288. graph *topo.Graph[string, *InstallInfo],
  289. targets []string,
  290. ) (*topo.Graph[string, *InstallInfo], error) {
  291. if graph == nil {
  292. graph = topo.New[string, *InstallInfo]()
  293. }
  294. if len(targets) == 0 {
  295. return graph, nil
  296. }
  297. aurPkgs, errCache := g.aurClient.Get(ctx, &aurc.Query{By: aurc.Name, Needles: targets})
  298. if errCache != nil {
  299. g.logger.Errorln(errCache)
  300. }
  301. for i := range aurPkgs {
  302. pkg := &aurPkgs[i]
  303. if _, ok := g.providerCache[pkg.Name]; !ok {
  304. g.providerCache[pkg.Name] = []aurc.Pkg{*pkg}
  305. }
  306. }
  307. for _, target := range targets {
  308. if cachedProvidePkg, ok := g.providerCache[target]; ok {
  309. aurPkgs = cachedProvidePkg
  310. } else {
  311. var errA error
  312. aurPkgs, errA = g.aurClient.Get(ctx, &aurc.Query{By: aurc.Provides, Needles: []string{target}, Contains: true})
  313. if errA != nil {
  314. g.logger.Errorln(gotext.Get("Failed to find AUR package for"), " ", target, ":", errA)
  315. }
  316. }
  317. if len(aurPkgs) == 0 {
  318. g.logger.Errorln(gotext.Get("No AUR package found for"), " ", target)
  319. continue
  320. }
  321. aurPkg := &aurPkgs[0]
  322. if len(aurPkgs) > 1 {
  323. chosen := g.provideMenu(target, aurPkgs)
  324. aurPkg = chosen
  325. g.providerCache[target] = []aurc.Pkg{*aurPkg}
  326. }
  327. if g.needed {
  328. if pkg := g.dbExecutor.LocalPackage(aurPkg.Name); pkg != nil {
  329. if db.VerCmp(pkg.Version(), aurPkg.Version) >= 0 {
  330. g.logger.Warnln(gotext.Get("%s is up to date -- skipping", text.Cyan(pkg.Name()+"-"+pkg.Version())))
  331. continue
  332. }
  333. }
  334. }
  335. graph = g.GraphAURTarget(ctx, graph, aurPkg, &InstallInfo{
  336. AURBase: &aurPkg.PackageBase,
  337. Reason: Explicit,
  338. Source: AUR,
  339. Version: aurPkg.Version,
  340. })
  341. }
  342. return graph, nil
  343. }
  344. // Removes found deps from the deps mapset and returns the found deps.
  345. func (g *Grapher) findDepsFromAUR(ctx context.Context,
  346. deps mapset.Set[string],
  347. ) []aurc.Pkg {
  348. pkgsToAdd := make([]aurc.Pkg, 0, deps.Cardinality())
  349. if deps.Cardinality() == 0 {
  350. return []aurc.Pkg{}
  351. }
  352. missingNeedles := make([]string, 0, deps.Cardinality())
  353. for _, depString := range deps.ToSlice() {
  354. if _, ok := g.providerCache[depString]; !ok {
  355. depName, _, _ := splitDep(depString)
  356. missingNeedles = append(missingNeedles, depName)
  357. }
  358. }
  359. if len(missingNeedles) != 0 {
  360. g.logger.Debugln("deps to find", missingNeedles)
  361. // provider search is more demanding than a simple search
  362. // try to find name match if possible and then try to find provides.
  363. aurPkgs, errCache := g.aurClient.Get(ctx, &aurc.Query{
  364. By: aurc.Name, Needles: missingNeedles, Contains: false,
  365. })
  366. if errCache != nil {
  367. g.logger.Errorln(errCache)
  368. }
  369. for i := range aurPkgs {
  370. pkg := &aurPkgs[i]
  371. for _, val := range pkg.Provides {
  372. if deps.Contains(val) {
  373. g.providerCache[val] = append(g.providerCache[val], *pkg)
  374. }
  375. }
  376. if deps.Contains(pkg.Name) {
  377. g.providerCache[pkg.Name] = append(g.providerCache[pkg.Name], *pkg)
  378. }
  379. }
  380. }
  381. for _, depString := range deps.ToSlice() {
  382. var aurPkgs []aurc.Pkg
  383. depName, _, _ := splitDep(depString)
  384. if cachedProvidePkg, ok := g.providerCache[depString]; ok {
  385. aurPkgs = cachedProvidePkg
  386. } else {
  387. var errA error
  388. aurPkgs, errA = g.aurClient.Get(ctx, &aurc.Query{By: aurc.Provides, Needles: []string{depName}, Contains: true})
  389. if errA != nil {
  390. g.logger.Errorln(gotext.Get("Failed to find AUR package for"), depString, ":", errA)
  391. }
  392. }
  393. // remove packages that don't satisfy the dependency
  394. for i := 0; i < len(aurPkgs); i++ {
  395. if !satisfiesAur(depString, &aurPkgs[i]) {
  396. aurPkgs = append(aurPkgs[:i], aurPkgs[i+1:]...)
  397. i--
  398. }
  399. }
  400. if len(aurPkgs) == 0 {
  401. g.logger.Errorln(gotext.Get("No AUR package found for"), " ", depString)
  402. continue
  403. }
  404. pkg := aurPkgs[0]
  405. if len(aurPkgs) > 1 {
  406. chosen := g.provideMenu(depString, aurPkgs)
  407. pkg = *chosen
  408. }
  409. g.providerCache[depString] = []aurc.Pkg{pkg}
  410. deps.Remove(depString)
  411. pkgsToAdd = append(pkgsToAdd, pkg)
  412. }
  413. return pkgsToAdd
  414. }
  415. func (g *Grapher) ValidateAndSetNodeInfo(graph *topo.Graph[string, *InstallInfo],
  416. node string, nodeInfo *topo.NodeInfo[*InstallInfo],
  417. ) {
  418. info := graph.GetNodeInfo(node)
  419. if info != nil && info.Value != nil {
  420. if info.Value.Reason < nodeInfo.Value.Reason {
  421. return // refuse to downgrade reason
  422. }
  423. if info.Value.Upgrade {
  424. return // refuse to overwrite an upgrade
  425. }
  426. }
  427. graph.SetNodeInfo(node, nodeInfo)
  428. }
  429. func (g *Grapher) addNodes(
  430. ctx context.Context,
  431. graph *topo.Graph[string, *InstallInfo],
  432. parentPkgName string,
  433. deps []string,
  434. depType Reason,
  435. ) {
  436. targetsToFind := mapset.NewThreadUnsafeSet(deps...)
  437. // Check if in graph already
  438. for _, depString := range targetsToFind.ToSlice() {
  439. depName, _, _ := splitDep(depString)
  440. if !graph.Exists(depName) && !graph.ProvidesExists(depName) {
  441. continue
  442. }
  443. if graph.Exists(depName) {
  444. if err := graph.DependOn(depName, parentPkgName); err != nil {
  445. g.logger.Warnln(depString, parentPkgName, err)
  446. }
  447. targetsToFind.Remove(depString)
  448. }
  449. if p := graph.GetProviderNode(depName); p != nil {
  450. if provideSatisfies(p.String(), depString, p.Version) {
  451. if err := graph.DependOn(p.Provider, parentPkgName); err != nil {
  452. g.logger.Warnln(p.Provider, parentPkgName, err)
  453. }
  454. targetsToFind.Remove(depString)
  455. }
  456. }
  457. }
  458. // Check installed
  459. for _, depString := range targetsToFind.ToSlice() {
  460. depName, _, _ := splitDep(depString)
  461. if !g.dbExecutor.LocalSatisfierExists(depString) {
  462. continue
  463. }
  464. if g.fullGraph {
  465. g.ValidateAndSetNodeInfo(
  466. graph,
  467. depName,
  468. &topo.NodeInfo[*InstallInfo]{Color: colorMap[depType], Background: bgColorMap[Local]})
  469. if err := graph.DependOn(depName, parentPkgName); err != nil {
  470. g.logger.Warnln(depName, parentPkgName, err)
  471. }
  472. }
  473. targetsToFind.Remove(depString)
  474. }
  475. // Check Sync
  476. for _, depString := range targetsToFind.ToSlice() {
  477. alpmPkg := g.dbExecutor.SyncSatisfier(depString)
  478. if alpmPkg == nil {
  479. continue
  480. }
  481. if err := graph.DependOn(alpmPkg.Name(), parentPkgName); err != nil {
  482. g.logger.Warnln("repo dep warn:", depString, parentPkgName, err)
  483. }
  484. dbName := alpmPkg.DB().Name()
  485. g.ValidateAndSetNodeInfo(
  486. graph,
  487. alpmPkg.Name(),
  488. &topo.NodeInfo[*InstallInfo]{
  489. Color: colorMap[depType],
  490. Background: bgColorMap[Sync],
  491. Value: &InstallInfo{
  492. Source: Sync,
  493. Reason: depType,
  494. Version: alpmPkg.Version(),
  495. SyncDBName: &dbName,
  496. },
  497. })
  498. if newDeps := alpmPkg.Depends().Slice(); len(newDeps) != 0 && g.fullGraph {
  499. newDepsSlice := make([]string, 0, len(newDeps))
  500. for _, newDep := range newDeps {
  501. newDepsSlice = append(newDepsSlice, newDep.Name)
  502. }
  503. g.addNodes(ctx, graph, alpmPkg.Name(), newDepsSlice, Dep)
  504. }
  505. targetsToFind.Remove(depString)
  506. }
  507. // Check AUR
  508. pkgsToAdd := g.findDepsFromAUR(ctx, targetsToFind)
  509. for i := range pkgsToAdd {
  510. aurPkg := &pkgsToAdd[i]
  511. if err := graph.DependOn(aurPkg.Name, parentPkgName); err != nil {
  512. g.logger.Warnln("aur dep warn:", aurPkg.Name, parentPkgName, err)
  513. }
  514. graph.SetNodeInfo(
  515. aurPkg.Name,
  516. &topo.NodeInfo[*InstallInfo]{
  517. Color: colorMap[depType],
  518. Background: bgColorMap[AUR],
  519. Value: &InstallInfo{
  520. Source: AUR,
  521. Reason: depType,
  522. AURBase: &aurPkg.PackageBase,
  523. Version: aurPkg.Version,
  524. },
  525. })
  526. g.addDepNodes(ctx, aurPkg, graph)
  527. }
  528. // Add missing to graph
  529. for _, depString := range targetsToFind.ToSlice() {
  530. depName, mod, ver := splitDep(depString)
  531. // no dep found. add as missing
  532. graph.AddNode(depName)
  533. graph.SetNodeInfo(depName, &topo.NodeInfo[*InstallInfo]{
  534. Color: colorMap[depType],
  535. Background: bgColorMap[Missing],
  536. Value: &InstallInfo{
  537. Source: Missing,
  538. Reason: depType,
  539. Version: fmt.Sprintf("%s%s", mod, ver),
  540. },
  541. })
  542. }
  543. }
  544. func (g *Grapher) provideMenu(dep string, options []aur.Pkg) *aur.Pkg {
  545. size := len(options)
  546. if size == 1 {
  547. return &options[0]
  548. }
  549. str := text.Bold(gotext.Get("There are %d providers available for %s:", size, dep))
  550. str += "\n"
  551. size = 1
  552. str += g.logger.SprintOperationInfo(gotext.Get("Repository AUR"), "\n ")
  553. for i := range options {
  554. str += fmt.Sprintf("%d) %s ", size, options[i].Name)
  555. size++
  556. }
  557. g.logger.OperationInfoln(str)
  558. for {
  559. g.logger.Println(gotext.Get("\nEnter a number (default=1): "))
  560. if g.noConfirm {
  561. g.logger.Println("1")
  562. return &options[0]
  563. }
  564. numberBuf, err := g.logger.GetInput("", false)
  565. if err != nil {
  566. g.logger.Errorln(err)
  567. break
  568. }
  569. if numberBuf == "" {
  570. return &options[0]
  571. }
  572. num, err := strconv.Atoi(numberBuf)
  573. if err != nil {
  574. g.logger.Errorln(gotext.Get("invalid number: %s", numberBuf))
  575. continue
  576. }
  577. if num < 1 || num >= size {
  578. g.logger.Errorln(gotext.Get("invalid value: %d is not between %d and %d",
  579. num, 1, size-1))
  580. continue
  581. }
  582. return &options[num-1]
  583. }
  584. return nil
  585. }
  586. func makeAURPKGFromSrcinfo(dbExecutor db.Executor, srcInfo *gosrc.Srcinfo) ([]aur.Pkg, error) {
  587. pkgs := make([]aur.Pkg, 0, 1)
  588. alpmArch, err := dbExecutor.AlpmArchitectures()
  589. if err != nil {
  590. return nil, err
  591. }
  592. alpmArch = append(alpmArch, "") // srcinfo assumes no value as ""
  593. getDesc := func(pkg *gosrc.Package) string {
  594. if pkg.Pkgdesc != "" {
  595. return pkg.Pkgdesc
  596. }
  597. return srcInfo.Pkgdesc
  598. }
  599. for i := range srcInfo.Packages {
  600. pkg := &srcInfo.Packages[i]
  601. pkgs = append(pkgs, aur.Pkg{
  602. ID: 0,
  603. Name: pkg.Pkgname,
  604. PackageBaseID: 0,
  605. PackageBase: srcInfo.Pkgbase,
  606. Version: srcInfo.Version(),
  607. Description: getDesc(pkg),
  608. URL: pkg.URL,
  609. Depends: append(archStringToString(alpmArch, pkg.Depends),
  610. archStringToString(alpmArch, srcInfo.Package.Depends)...),
  611. MakeDepends: archStringToString(alpmArch, srcInfo.PackageBase.MakeDepends),
  612. CheckDepends: archStringToString(alpmArch, srcInfo.PackageBase.CheckDepends),
  613. Conflicts: append(archStringToString(alpmArch, pkg.Conflicts),
  614. archStringToString(alpmArch, srcInfo.Package.Conflicts)...),
  615. Provides: append(archStringToString(alpmArch, pkg.Provides),
  616. archStringToString(alpmArch, srcInfo.Package.Provides)...),
  617. Replaces: append(archStringToString(alpmArch, pkg.Replaces),
  618. archStringToString(alpmArch, srcInfo.Package.Replaces)...),
  619. OptDepends: []string{},
  620. Groups: pkg.Groups,
  621. License: pkg.License,
  622. Keywords: []string{},
  623. })
  624. }
  625. return pkgs, nil
  626. }
  627. func archStringToString(alpmArches []string, archString []gosrc.ArchString) []string {
  628. pkgs := make([]string, 0, len(archString))
  629. for _, arch := range archString {
  630. if db.ArchIsSupported(alpmArches, arch.Arch) {
  631. pkgs = append(pkgs, arch.Value)
  632. }
  633. }
  634. return pkgs
  635. }
  636. func aurDepModToAlpmDep(mod string) alpm.DepMod {
  637. switch mod {
  638. case "=":
  639. return alpm.DepModEq
  640. case ">=":
  641. return alpm.DepModGE
  642. case "<=":
  643. return alpm.DepModLE
  644. case ">":
  645. return alpm.DepModGT
  646. case "<":
  647. return alpm.DepModLT
  648. }
  649. return alpm.DepModAny
  650. }