0
0
Fork 0
mirror of https://github.com/go-gitea/gitea synced 2024-12-22 16:34:16 +01:00
gitea/models/access.go

265 lines
6.7 KiB
Go
Raw Normal View History

2014-02-18 00:38:50 +01:00
// Copyright 2014 The Gogs Authors. All rights reserved.
// Copyright 2019 The Gitea Authors. All rights reserved.
2014-02-18 00:38:50 +01:00
// Use of this source code is governed by a MIT-style
// license that can be found in the LICENSE file.
2014-02-17 16:57:23 +01:00
package models
import (
"fmt"
"code.gitea.io/gitea/modules/log"
)
2016-11-26 01:07:57 +01:00
// AccessMode specifies the users access mode
type AccessMode int
2014-06-25 06:44:48 +02:00
2014-02-17 16:57:23 +01:00
const (
2016-11-26 01:07:57 +01:00
// AccessModeNone no access
AccessModeNone AccessMode = iota // 0
// AccessModeRead read access
AccessModeRead // 1
// AccessModeWrite write access
AccessModeWrite // 2
// AccessModeAdmin admin access
AccessModeAdmin // 3
// AccessModeOwner owner access
AccessModeOwner // 4
2014-02-17 16:57:23 +01:00
)
func (mode AccessMode) String() string {
switch mode {
2016-11-07 17:20:37 +01:00
case AccessModeRead:
return "read"
2016-11-07 17:20:37 +01:00
case AccessModeWrite:
return "write"
2016-11-07 17:20:37 +01:00
case AccessModeAdmin:
return "admin"
2016-11-07 17:20:37 +01:00
case AccessModeOwner:
return "owner"
default:
return "none"
}
}
// ColorFormat provides a ColorFormatted version of this AccessMode
func (mode AccessMode) ColorFormat(s fmt.State) {
log.ColorFprintf(s, "%d:%s",
log.NewColoredIDValue(mode),
mode)
}
// ParseAccessMode returns corresponding access mode to given permission string.
func ParseAccessMode(permission string) AccessMode {
switch permission {
case "write":
2016-11-07 17:20:37 +01:00
return AccessModeWrite
case "admin":
2016-11-07 17:20:37 +01:00
return AccessModeAdmin
default:
2016-11-07 17:20:37 +01:00
return AccessModeRead
}
}
// Access represents the highest access level of a user to the repository. The only access type
// that is not in this table is the real owner of a repository. In case of an organization
// repository, the members of the owners team are in this table.
type Access struct {
ID int64 `xorm:"pk autoincr"`
UserID int64 `xorm:"UNIQUE(s)"`
RepoID int64 `xorm:"UNIQUE(s)"`
Mode AccessMode
2014-02-17 16:57:23 +01:00
}
func accessLevel(e Engine, userID int64, repo *Repository) (AccessMode, error) {
2016-11-07 17:20:37 +01:00
mode := AccessModeNone
if !repo.IsPrivate {
2016-11-07 17:20:37 +01:00
mode = AccessModeRead
2015-02-12 03:58:37 +01:00
}
2014-05-01 17:32:12 +02:00
if userID == 0 {
2015-11-19 17:40:00 +01:00
return mode, nil
}
2014-04-05 00:55:17 +02:00
if userID == repo.OwnerID {
2016-11-07 17:20:37 +01:00
return AccessModeOwner, nil
2014-04-12 03:47:39 +02:00
}
a := &Access{UserID: userID, RepoID: repo.ID}
2015-11-19 17:40:00 +01:00
if has, err := e.Get(a); !has || err != nil {
return mode, err
}
return a.Mode, nil
2014-02-17 16:57:23 +01:00
}
2015-01-23 08:54:16 +01:00
type repoAccess struct {
Access `xorm:"extends"`
Repository `xorm:"extends"`
}
func (repoAccess) TableName() string {
return "access"
}
2015-11-13 23:37:02 +01:00
// GetRepositoryAccesses finds all repositories with their access mode where a user has access but does not own.
2016-11-26 01:07:57 +01:00
func (user *User) GetRepositoryAccesses() (map[*Repository]AccessMode, error) {
rows, err := x.
Join("INNER", "repository", "repository.id = access.repo_id").
Where("access.user_id = ?", user.ID).
And("repository.owner_id <> ?", user.ID).
Rows(new(repoAccess))
if err != nil {
2015-01-23 08:54:16 +01:00
return nil, err
}
defer rows.Close()
2015-01-23 08:54:16 +01:00
var repos = make(map[*Repository]AccessMode, 10)
var ownerCache = make(map[int64]*User, 10)
for rows.Next() {
var repo repoAccess
err = rows.Scan(&repo)
2015-01-23 08:54:16 +01:00
if err != nil {
return nil, err
}
var ok bool
if repo.Owner, ok = ownerCache[repo.OwnerID]; !ok {
if err = repo.GetOwner(); err != nil {
return nil, err
}
ownerCache[repo.OwnerID] = repo.Owner
}
repos[&repo.Repository] = repo.Access.Mode
2015-01-23 08:54:16 +01:00
}
return repos, nil
}
2016-07-24 08:32:46 +02:00
// GetAccessibleRepositories finds repositories which the user has access but does not own.
// If limit is smaller than 1 means returns all found results.
func (user *User) GetAccessibleRepositories(limit int) (repos []*Repository, _ error) {
2016-11-10 16:16:32 +01:00
sess := x.
Where("owner_id !=? ", user.ID).
Desc("updated_unix")
2016-07-24 08:32:46 +02:00
if limit > 0 {
sess.Limit(limit)
repos = make([]*Repository, 0, limit)
} else {
repos = make([]*Repository, 0, 10)
2015-11-13 23:37:02 +01:00
}
2016-11-10 16:16:32 +01:00
return repos, sess.
Join("INNER", "access", "access.user_id = ? AND access.repo_id = repository.id", user.ID).
Find(&repos)
2015-11-13 23:37:02 +01:00
}
2015-02-13 06:58:46 +01:00
func maxAccessMode(modes ...AccessMode) AccessMode {
2016-11-07 17:20:37 +01:00
max := AccessModeNone
2015-02-13 06:58:46 +01:00
for _, mode := range modes {
if mode > max {
max = mode
}
}
return max
}
2017-01-05 01:50:34 +01:00
// FIXME: do cross-comparison so reduce deletions and additions to the minimum?
func (repo *Repository) refreshAccesses(e Engine, accessMap map[int64]AccessMode) (err error) {
2016-11-07 17:20:37 +01:00
minMode := AccessModeRead
if !repo.IsPrivate {
2016-11-07 17:20:37 +01:00
minMode = AccessModeWrite
}
newAccesses := make([]Access, 0, len(accessMap))
for userID, mode := range accessMap {
if mode < minMode {
continue
}
newAccesses = append(newAccesses, Access{
UserID: userID,
2015-08-08 16:43:14 +02:00
RepoID: repo.ID,
Mode: mode,
})
}
2015-02-13 08:56:42 +01:00
// Delete old accesses and insert new ones for repository.
2015-08-08 16:43:14 +02:00
if _, err = e.Delete(&Access{RepoID: repo.ID}); err != nil {
return fmt.Errorf("delete old accesses: %v", err)
} else if _, err = e.Insert(newAccesses); err != nil {
return fmt.Errorf("insert new accesses: %v", err)
}
2015-02-13 08:56:42 +01:00
return nil
}
// refreshCollaboratorAccesses retrieves repository collaborations with their access modes.
func (repo *Repository) refreshCollaboratorAccesses(e Engine, accessMap map[int64]AccessMode) error {
collaborations, err := repo.getCollaborations(e)
if err != nil {
return fmt.Errorf("getCollaborations: %v", err)
}
for _, c := range collaborations {
accessMap[c.UserID] = c.Mode
}
return nil
}
// recalculateTeamAccesses recalculates new accesses for teams of an organization
// except the team whose ID is given. It is used to assign a team ID when
// remove repository from that team.
func (repo *Repository) recalculateTeamAccesses(e Engine, ignTeamID int64) (err error) {
accessMap := make(map[int64]AccessMode, 20)
if err = repo.getOwner(e); err != nil {
return err
} else if !repo.Owner.IsOrganization() {
return fmt.Errorf("owner is not an organization: %d", repo.OwnerID)
}
if err = repo.refreshCollaboratorAccesses(e, accessMap); err != nil {
return fmt.Errorf("refreshCollaboratorAccesses: %v", err)
}
if err = repo.Owner.getTeams(e); err != nil {
return err
}
for _, t := range repo.Owner.Teams {
if t.ID == ignTeamID {
continue
}
// Owner team gets owner access, and skip for teams that do not
// have relations with repository.
if t.IsOwnerTeam() {
2016-11-07 17:20:37 +01:00
t.Authorize = AccessModeOwner
} else if !t.hasRepository(e, repo.ID) {
continue
}
if err = t.getMembers(e); err != nil {
return fmt.Errorf("getMembers '%d': %v", t.ID, err)
}
for _, m := range t.Members {
2016-07-23 19:08:22 +02:00
accessMap[m.ID] = maxAccessMode(accessMap[m.ID], t.Authorize)
}
}
return repo.refreshAccesses(e, accessMap)
}
func (repo *Repository) recalculateAccesses(e Engine) error {
if repo.Owner.IsOrganization() {
return repo.recalculateTeamAccesses(e, 0)
}
accessMap := make(map[int64]AccessMode, 20)
if err := repo.refreshCollaboratorAccesses(e, accessMap); err != nil {
return fmt.Errorf("refreshCollaboratorAccesses: %v", err)
}
return repo.refreshAccesses(e, accessMap)
2015-02-13 06:58:46 +01:00
}
2015-02-13 06:58:46 +01:00
// RecalculateAccesses recalculates all accesses for repository.
2016-11-26 01:07:57 +01:00
func (repo *Repository) RecalculateAccesses() error {
return repo.recalculateAccesses(x)
}