yay/query.go

387 lines
8.6 KiB
Go
Raw Normal View History

2017-04-29 17:12:12 +00:00
package main
import (
"errors"
2017-04-29 17:12:12 +00:00
"fmt"
"os"
"sort"
"strings"
2017-04-29 17:12:12 +00:00
2020-10-01 11:38:03 +00:00
alpm "github.com/Jguer/go-alpm/v2"
"github.com/leonelquinteros/gotext"
rpc "github.com/mikkeloscar/aur"
"github.com/Jguer/yay/v10/pkg/db"
2020-07-10 00:36:45 +00:00
"github.com/Jguer/yay/v10/pkg/query"
"github.com/Jguer/yay/v10/pkg/settings"
"github.com/Jguer/yay/v10/pkg/stringset"
"github.com/Jguer/yay/v10/pkg/text"
2017-04-29 17:12:12 +00:00
)
// Query is a collection of Results
type aurQuery []rpc.Pkg
// Query holds the results of a repository search.
2020-10-01 11:38:03 +00:00
type repoQuery []alpm.IPackage
func (s repoQuery) Reverse() {
for i, j := 0, len(s)-1; i < j; i, j = i+1, j-1 {
s[i], s[j] = s[j], s[i]
}
}
func (q aurQuery) Len() int {
return len(q)
}
func (q aurQuery) Less(i, j int) bool {
var result bool
switch config.SortBy {
case "votes":
result = q[i].NumVotes > q[j].NumVotes
case "popularity":
result = q[i].Popularity > q[j].Popularity
case "name":
2020-07-10 00:36:45 +00:00
result = text.LessRunes([]rune(q[i].Name), []rune(q[j].Name))
case "base":
2020-07-10 00:36:45 +00:00
result = text.LessRunes([]rune(q[i].PackageBase), []rune(q[j].PackageBase))
case "submitted":
result = q[i].FirstSubmitted < q[j].FirstSubmitted
case "modified":
result = q[i].LastModified < q[j].LastModified
case "id":
result = q[i].ID < q[j].ID
case "baseid":
result = q[i].PackageBaseID < q[j].PackageBaseID
}
if config.SortMode == settings.BottomUp {
return !result
}
return result
}
func (q aurQuery) Swap(i, j int) {
q[i], q[j] = q[j], q[i]
}
func getSearchBy(value string) rpc.By {
switch value {
case "name":
return rpc.Name
case "maintainer":
return rpc.Maintainer
case "depends":
return rpc.Depends
case "makedepends":
return rpc.MakeDepends
case "optdepends":
return rpc.OptDepends
case "checkdepends":
return rpc.CheckDepends
default:
return rpc.NameDesc
}
}
// NarrowSearch searches AUR and narrows based on subarguments
func narrowSearch(pkgS []string, sortS bool) (aurQuery, error) {
var r []rpc.Pkg
var err error
var usedIndex int
by := getSearchBy(config.SearchBy)
if len(pkgS) == 0 {
return nil, nil
}
for i, word := range pkgS {
r, err = rpc.SearchBy(word, by)
if err == nil {
usedIndex = i
break
}
}
if err != nil {
return nil, err
}
if len(pkgS) == 1 {
if sortS {
2017-08-04 09:26:53 +00:00
sort.Sort(aurQuery(r))
}
return r, err
}
var aq aurQuery
var n int
for i := range r {
match := true
2020-06-15 03:58:22 +00:00
for j, pkgN := range pkgS {
if usedIndex == j {
continue
}
if !(strings.Contains(r[i].Name, pkgN) || strings.Contains(strings.ToLower(r[i].Description), pkgN)) {
match = false
break
}
}
if match {
n++
aq = append(aq, r[i])
}
}
if sortS {
sort.Sort(aq)
}
return aq, err
}
2017-04-29 17:12:12 +00:00
// SyncSearch presents a query to the local repos and to the AUR.
2020-08-16 21:41:38 +00:00
func syncSearch(pkgS []string, dbExecutor db.Executor) (err error) {
2020-07-10 00:36:45 +00:00
pkgS = query.RemoveInvalidTargets(pkgS, config.Runtime.Mode)
2018-06-04 19:36:10 +00:00
var aurErr error
var aq aurQuery
var pq repoQuery
2020-07-05 00:45:23 +00:00
if config.Runtime.Mode == settings.ModeAUR || config.Runtime.Mode == settings.ModeAny {
2018-06-04 19:36:10 +00:00
aq, aurErr = narrowSearch(pkgS, true)
}
2020-07-05 00:45:23 +00:00
if config.Runtime.Mode == settings.ModeRepo || config.Runtime.Mode == settings.ModeAny {
pq = queryRepo(pkgS, dbExecutor)
2017-04-29 17:12:12 +00:00
}
switch config.SortMode {
case settings.TopDown:
2020-07-05 00:45:23 +00:00
if config.Runtime.Mode == settings.ModeRepo || config.Runtime.Mode == settings.ModeAny {
pq.printSearch(dbExecutor)
2018-06-04 19:36:10 +00:00
}
2020-07-05 00:45:23 +00:00
if config.Runtime.Mode == settings.ModeAUR || config.Runtime.Mode == settings.ModeAny {
aq.printSearch(1, dbExecutor)
2018-06-04 19:36:10 +00:00
}
case settings.BottomUp:
2020-07-05 00:45:23 +00:00
if config.Runtime.Mode == settings.ModeAUR || config.Runtime.Mode == settings.ModeAny {
aq.printSearch(1, dbExecutor)
2018-06-04 19:36:10 +00:00
}
2020-07-05 00:45:23 +00:00
if config.Runtime.Mode == settings.ModeRepo || config.Runtime.Mode == settings.ModeAny {
pq.printSearch(dbExecutor)
}
default:
return errors.New(gotext.Get("invalid sort mode. Fix with yay -Y --bottomup --save"))
2017-04-29 17:12:12 +00:00
}
2018-04-03 05:49:41 +00:00
if aurErr != nil {
text.Errorln(gotext.Get("error during AUR search: %s", aurErr))
text.Warnln(gotext.Get("Showing repo packages only"))
2018-04-03 05:49:41 +00:00
}
2017-04-29 17:12:12 +00:00
return nil
}
// SyncInfo serves as a pacman -Si for repo packages and AUR packages.
2020-08-16 21:41:38 +00:00
func syncInfo(cmdArgs *settings.Arguments, pkgS []string, dbExecutor db.Executor) error {
2018-03-22 18:11:00 +00:00
var info []*rpc.Pkg
var err error
missing := false
2020-07-10 00:36:45 +00:00
pkgS = query.RemoveInvalidTargets(pkgS, config.Runtime.Mode)
aurS, repoS := packageSlices(pkgS, dbExecutor)
2017-04-29 17:12:12 +00:00
if len(aurS) != 0 {
2019-02-04 16:56:02 +00:00
noDB := make([]string, 0, len(aurS))
for _, pkg := range aurS {
2020-07-10 00:36:45 +00:00
_, name := text.SplitDBFromName(pkg)
2019-02-04 16:56:02 +00:00
noDB = append(noDB, name)
}
2020-07-10 00:36:45 +00:00
info, err = query.AURInfoPrint(noDB, config.RequestSplitN)
if err != nil {
missing = true
fmt.Fprintln(os.Stderr, err)
}
}
// Repo always goes first
2018-01-06 13:50:54 +00:00
if len(repoS) != 0 {
2020-07-05 00:45:23 +00:00
arguments := cmdArgs.Copy()
arguments.ClearTargets()
arguments.AddTarget(repoS...)
err = config.Runtime.CmdRunner.Show(passToPacman(arguments))
2018-01-06 13:50:54 +00:00
if err != nil {
return err
2018-01-06 13:50:54 +00:00
}
}
if len(aurS) != len(info) {
missing = true
}
if len(info) != 0 {
for _, pkg := range info {
2020-07-08 01:22:01 +00:00
PrintInfo(pkg, cmdArgs.ExistsDouble("i"))
}
2017-04-29 17:12:12 +00:00
}
if missing {
err = fmt.Errorf("")
}
return err
2017-04-29 17:12:12 +00:00
}
// Search handles repo searches. Creates a RepoSearch struct.
2020-08-16 21:41:38 +00:00
func queryRepo(pkgInputN []string, dbExecutor db.Executor) repoQuery {
s := repoQuery(dbExecutor.SyncPackages(pkgInputN...))
if config.SortMode == settings.BottomUp {
s.Reverse()
}
return s
}
// PackageSlices separates an input slice into aur and repo slices
2020-08-16 21:41:38 +00:00
func packageSlices(toCheck []string, dbExecutor db.Executor) (aur, repo []string) {
New install algorithm I have replaced the old install and dependancy algorithms with a new design that attemps to be more pacaur like. Mostly in minimizing user input. Ask every thing first then do everything with no need for more user input. It is not yet fully complete but is finished enough so that it works, should not fail in most cases and provides a base for more contributors to help address the existing problems. The new install chain is as follows: Source info about the provided targets Fetch a list of all dependancies needed to install targets I put alot of effort into fetching the dependancy tree while making the least amount of aur requests as possible. I'm actually very happy with how it turned out and yay wil now resolve dependancies noticably faster than pacaur when there are many aur dependancies. Install repo targets by passing to pacman Print dependancy tree and ask to confirm Ask to clean build if directory already exists Download all pkgbuilds Ask to edit all pkgbuilds Ask to continue with the install Download the sources for each packagebuild Build and install every package using -s to get repo deps and -i to install Ask to remove make dependancies There are still a lot of things that need to be done for a fully working system. Here are the problems I found with this system, either new or existing: Formating I am not so good at formatting myself, I thought best to leave it until last so I could get feedback on how it should look and help implementing it. Dependancy tree The dependancy tree is usually correct although I have noticed times where it doesnt detect all the dependancies that it should. I have only noticed this when there are circular dependancies so i think this might be the cause. It's not a big deal currently because makepkg -i installed repo deps for us which handles the repo deps for us and will get the correct ones. So yay might not list all the dependancies. but they will get installed so I consider this a visual bug. I have yet to see any circular dependancies in the AUR so I can not say what will happend but I#m guessing that it will break. Versioned packages/dependencies Targets and dependancies with version constriants such as 'linux>=4.1' will not be checked on the aur side of things but will be checked on the repo side. Ignorepkg/Ignoregroup Currently I do not handle this in any way but it shouldn't be too hard to implement. Conflict checking This is not currently implemented either Split Paclages Split packages are not Handles properly. If we only specify one package so install from a split package makepkg -i ends up installing them all anyway. If we specify more than one (n) package it will actually build the package base n times and reinstall every split package n times. Makepkg To get things working I decided to keep using the makepkg -i method. I plan to eventually replace this with a pacman -U based method. This should allow passing args such as --dbpath and --config to aur packages aswell as help solve some problems such as the split packages. Clean build I plan to improve the clean build choice to be a little more smart and instead of check if the directory exists, check if the package is already build and if so skip the build all together.
2018-01-17 21:48:23 +00:00
for _, _pkg := range toCheck {
dbName, name := text.SplitDBFromName(_pkg)
found := false
if dbName == "aur" || config.Runtime.Mode == settings.ModeAUR {
aur = append(aur, _pkg)
continue
} else if dbName != "" || config.Runtime.Mode == settings.ModeRepo {
repo = append(repo, _pkg)
continue
}
found = dbExecutor.SyncSatisfierExists(name)
if !found {
found = len(dbExecutor.PackagesFromGroup(name)) != 0
New install algorithm I have replaced the old install and dependancy algorithms with a new design that attemps to be more pacaur like. Mostly in minimizing user input. Ask every thing first then do everything with no need for more user input. It is not yet fully complete but is finished enough so that it works, should not fail in most cases and provides a base for more contributors to help address the existing problems. The new install chain is as follows: Source info about the provided targets Fetch a list of all dependancies needed to install targets I put alot of effort into fetching the dependancy tree while making the least amount of aur requests as possible. I'm actually very happy with how it turned out and yay wil now resolve dependancies noticably faster than pacaur when there are many aur dependancies. Install repo targets by passing to pacman Print dependancy tree and ask to confirm Ask to clean build if directory already exists Download all pkgbuilds Ask to edit all pkgbuilds Ask to continue with the install Download the sources for each packagebuild Build and install every package using -s to get repo deps and -i to install Ask to remove make dependancies There are still a lot of things that need to be done for a fully working system. Here are the problems I found with this system, either new or existing: Formating I am not so good at formatting myself, I thought best to leave it until last so I could get feedback on how it should look and help implementing it. Dependancy tree The dependancy tree is usually correct although I have noticed times where it doesnt detect all the dependancies that it should. I have only noticed this when there are circular dependancies so i think this might be the cause. It's not a big deal currently because makepkg -i installed repo deps for us which handles the repo deps for us and will get the correct ones. So yay might not list all the dependancies. but they will get installed so I consider this a visual bug. I have yet to see any circular dependancies in the AUR so I can not say what will happend but I#m guessing that it will break. Versioned packages/dependencies Targets and dependancies with version constriants such as 'linux>=4.1' will not be checked on the aur side of things but will be checked on the repo side. Ignorepkg/Ignoregroup Currently I do not handle this in any way but it shouldn't be too hard to implement. Conflict checking This is not currently implemented either Split Paclages Split packages are not Handles properly. If we only specify one package so install from a split package makepkg -i ends up installing them all anyway. If we specify more than one (n) package it will actually build the package base n times and reinstall every split package n times. Makepkg To get things working I decided to keep using the makepkg -i method. I plan to eventually replace this with a pacman -U based method. This should allow passing args such as --dbpath and --config to aur packages aswell as help solve some problems such as the split packages. Clean build I plan to improve the clean build choice to be a little more smart and instead of check if the directory exists, check if the package is already build and if so skip the build all together.
2018-01-17 21:48:23 +00:00
}
if found {
repo = append(repo, _pkg)
New install algorithm I have replaced the old install and dependancy algorithms with a new design that attemps to be more pacaur like. Mostly in minimizing user input. Ask every thing first then do everything with no need for more user input. It is not yet fully complete but is finished enough so that it works, should not fail in most cases and provides a base for more contributors to help address the existing problems. The new install chain is as follows: Source info about the provided targets Fetch a list of all dependancies needed to install targets I put alot of effort into fetching the dependancy tree while making the least amount of aur requests as possible. I'm actually very happy with how it turned out and yay wil now resolve dependancies noticably faster than pacaur when there are many aur dependancies. Install repo targets by passing to pacman Print dependancy tree and ask to confirm Ask to clean build if directory already exists Download all pkgbuilds Ask to edit all pkgbuilds Ask to continue with the install Download the sources for each packagebuild Build and install every package using -s to get repo deps and -i to install Ask to remove make dependancies There are still a lot of things that need to be done for a fully working system. Here are the problems I found with this system, either new or existing: Formating I am not so good at formatting myself, I thought best to leave it until last so I could get feedback on how it should look and help implementing it. Dependancy tree The dependancy tree is usually correct although I have noticed times where it doesnt detect all the dependancies that it should. I have only noticed this when there are circular dependancies so i think this might be the cause. It's not a big deal currently because makepkg -i installed repo deps for us which handles the repo deps for us and will get the correct ones. So yay might not list all the dependancies. but they will get installed so I consider this a visual bug. I have yet to see any circular dependancies in the AUR so I can not say what will happend but I#m guessing that it will break. Versioned packages/dependencies Targets and dependancies with version constriants such as 'linux>=4.1' will not be checked on the aur side of things but will be checked on the repo side. Ignorepkg/Ignoregroup Currently I do not handle this in any way but it shouldn't be too hard to implement. Conflict checking This is not currently implemented either Split Paclages Split packages are not Handles properly. If we only specify one package so install from a split package makepkg -i ends up installing them all anyway. If we specify more than one (n) package it will actually build the package base n times and reinstall every split package n times. Makepkg To get things working I decided to keep using the makepkg -i method. I plan to eventually replace this with a pacman -U based method. This should allow passing args such as --dbpath and --config to aur packages aswell as help solve some problems such as the split packages. Clean build I plan to improve the clean build choice to be a little more smart and instead of check if the directory exists, check if the package is already build and if so skip the build all together.
2018-01-17 21:48:23 +00:00
} else {
aur = append(aur, _pkg)
}
}
return aur, repo
}
// HangingPackages returns a list of packages installed as deps
// and unneeded by the system
2018-03-23 23:45:46 +00:00
// removeOptional decides whether optional dependencies are counted or not
2020-08-16 21:41:38 +00:00
func hangingPackages(removeOptional bool, dbExecutor db.Executor) (hanging []string) {
2018-03-23 23:45:46 +00:00
// safePackages represents every package in the system in one of 3 states
// State = 0 - Remove package from the system
// State = 1 - Keep package in the system; need to iterate over dependencies
// State = 2 - Keep package and have iterated over dependencies
safePackages := make(map[string]uint8)
// provides stores a mapping from the provides name back to the original package name
provides := make(stringset.MapStringSet)
2018-03-23 23:45:46 +00:00
2020-08-07 16:55:19 +00:00
packages := dbExecutor.LocalPackages()
2018-03-23 23:45:46 +00:00
// Mark explicit dependencies and enumerate the provides list
2020-08-07 16:55:19 +00:00
for _, pkg := range packages {
2018-03-23 23:45:46 +00:00
if pkg.Reason() == alpm.PkgReasonExplicit {
safePackages[pkg.Name()] = 1
} else {
safePackages[pkg.Name()] = 0
}
2020-08-07 16:55:19 +00:00
for _, dep := range dbExecutor.PackageProvides(pkg) {
provides.Add(dep.Name, pkg.Name())
2020-08-07 16:55:19 +00:00
}
2018-03-23 23:45:46 +00:00
}
iterateAgain := true
2020-08-07 16:55:19 +00:00
for iterateAgain {
iterateAgain = false
for _, pkg := range packages {
if state := safePackages[pkg.Name()]; state == 0 || state == 2 {
continue
}
safePackages[pkg.Name()] = 2
deps := dbExecutor.PackageDepends(pkg)
if !removeOptional {
deps = append(deps, dbExecutor.PackageOptionalDepends(pkg)...)
}
// Update state for dependencies
for _, dep := range deps {
// Don't assume a dependency is installed
state, ok := safePackages[dep.Name]
if !ok {
// Check if dep is a provides rather than actual package name
if pset, ok2 := provides[dep.Name]; ok2 {
for p := range pset {
if safePackages[p] == 0 {
iterateAgain = true
safePackages[p] = 1
}
2018-03-24 12:37:31 +00:00
}
}
2020-08-07 16:55:19 +00:00
continue
2018-03-23 23:45:46 +00:00
}
2020-08-07 16:55:19 +00:00
if state == 0 {
iterateAgain = true
safePackages[dep.Name] = 1
}
2018-03-23 23:45:46 +00:00
}
}
}
// Build list of packages to be removed
2020-08-07 16:55:19 +00:00
for _, pkg := range packages {
2018-03-23 23:45:46 +00:00
if safePackages[pkg.Name()] == 0 {
hanging = append(hanging, pkg.Name())
}
2020-08-07 16:55:19 +00:00
}
2018-03-23 23:45:46 +00:00
2020-08-07 16:55:19 +00:00
return hanging
}
// Statistics returns statistics about packages installed in system
2020-08-16 21:41:38 +00:00
func statistics(dbExecutor db.Executor) *struct {
Totaln int
Expln int
TotalSize int64
2020-08-04 20:00:07 +00:00
} {
var totalSize int64
localPackages := dbExecutor.LocalPackages()
totalInstalls := 0
explicitInstalls := 0
for _, pkg := range localPackages {
totalSize += pkg.ISize()
totalInstalls++
if pkg.Reason() == alpm.PkgReasonExplicit {
explicitInstalls++
}
}
info := &struct {
Totaln int
Expln int
TotalSize int64
}{
2020-08-04 20:00:07 +00:00
totalInstalls, explicitInstalls, totalSize,
}
2020-08-04 20:00:07 +00:00
return info
}