mirror of
https://codeberg.org/forgejo/forgejo.git
synced 2024-12-24 00:03:11 -05:00
171 lines
4.1 KiB
Go
171 lines
4.1 KiB
Go
// Copyright 2014 The Gogs Authors. All rights reserved.
|
|
// Use of this source code is governed by a MIT-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package models
|
|
|
|
type AccessMode int
|
|
|
|
const (
|
|
ACCESS_MODE_NONE AccessMode = iota
|
|
ACCESS_MODE_READ
|
|
ACCESS_MODE_WRITE
|
|
ACCESS_MODE_ADMIN
|
|
ACCESS_MODE_OWNER
|
|
)
|
|
|
|
// 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
|
|
}
|
|
|
|
func accessLevel(e Engine, u *User, repo *Repository) (AccessMode, error) {
|
|
mode := ACCESS_MODE_NONE
|
|
if !repo.IsPrivate {
|
|
mode = ACCESS_MODE_READ
|
|
}
|
|
|
|
if u != nil {
|
|
if u.Id == repo.OwnerId {
|
|
return ACCESS_MODE_OWNER, nil
|
|
}
|
|
|
|
a := &Access{UserID: u.Id, RepoID: repo.Id}
|
|
if has, err := e.Get(a); !has || err != nil {
|
|
return mode, err
|
|
}
|
|
return a.Mode, nil
|
|
}
|
|
|
|
return mode, nil
|
|
}
|
|
|
|
// AccessLevel returns the Access a user has to a repository. Will return NoneAccess if the
|
|
// user does not have access. User can be nil!
|
|
func AccessLevel(u *User, repo *Repository) (AccessMode, error) {
|
|
return accessLevel(x, u, repo)
|
|
}
|
|
|
|
func hasAccess(e Engine, u *User, repo *Repository, testMode AccessMode) (bool, error) {
|
|
mode, err := accessLevel(e, u, repo)
|
|
return testMode <= mode, err
|
|
}
|
|
|
|
// HasAccess returns true if someone has the request access level. User can be nil!
|
|
func HasAccess(u *User, repo *Repository, testMode AccessMode) (bool, error) {
|
|
return hasAccess(x, u, repo, testMode)
|
|
}
|
|
|
|
// GetAccessibleRepositories finds all repositories where a user has access to,
|
|
// besides his own.
|
|
func (u *User) GetAccessibleRepositories() (map[*Repository]AccessMode, error) {
|
|
accesses := make([]*Access, 0, 10)
|
|
if err := x.Find(&accesses, &Access{UserID: u.Id}); err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
repos := make(map[*Repository]AccessMode, len(accesses))
|
|
for _, access := range accesses {
|
|
repo, err := GetRepositoryById(access.RepoID)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
if err = repo.GetOwner(); err != nil {
|
|
return nil, err
|
|
} else if repo.OwnerId == u.Id {
|
|
continue
|
|
}
|
|
repos[repo] = access.Mode
|
|
}
|
|
|
|
return repos, nil
|
|
}
|
|
|
|
func maxAccessMode(modes ...AccessMode) AccessMode {
|
|
max := ACCESS_MODE_NONE
|
|
for _, mode := range modes {
|
|
if mode > max {
|
|
max = mode
|
|
}
|
|
}
|
|
return max
|
|
}
|
|
|
|
func (repo *Repository) recalculateTeamAccesses(e Engine, mode AccessMode) error {
|
|
|
|
return nil
|
|
}
|
|
|
|
func (repo *Repository) recalculateAccesses(e Engine) error {
|
|
accessMap := make(map[int64]AccessMode, 20)
|
|
|
|
// FIXME: should be able to have read-only access.
|
|
// Give all collaborators write access.
|
|
collaborators, err := repo.getCollaborators(e)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
for _, c := range collaborators {
|
|
accessMap[c.Id] = ACCESS_MODE_WRITE
|
|
}
|
|
|
|
if err := repo.getOwner(e); err != nil {
|
|
return err
|
|
}
|
|
if repo.Owner.IsOrganization() {
|
|
if err = repo.Owner.getTeams(e); err != nil {
|
|
return err
|
|
}
|
|
|
|
for _, team := range repo.Owner.Teams {
|
|
if team.IsOwnerTeam() {
|
|
team.Authorize = ACCESS_MODE_OWNER
|
|
}
|
|
|
|
if err = team.getMembers(e); err != nil {
|
|
return err
|
|
}
|
|
for _, u := range team.Members {
|
|
accessMap[u.Id] = maxAccessMode(accessMap[u.Id], team.Authorize)
|
|
}
|
|
}
|
|
}
|
|
|
|
// FIXME: do corss-comparison so reduce deletions and additions to the minimum?
|
|
|
|
minMode := ACCESS_MODE_READ
|
|
if !repo.IsPrivate {
|
|
minMode = ACCESS_MODE_WRITE
|
|
}
|
|
|
|
newAccesses := make([]Access, 0, len(accessMap))
|
|
for userID, mode := range accessMap {
|
|
if mode < minMode {
|
|
continue
|
|
}
|
|
newAccesses = append(newAccesses, Access{
|
|
UserID: userID,
|
|
RepoID: repo.Id,
|
|
Mode: mode,
|
|
})
|
|
}
|
|
|
|
// Delete old accesses and insert new ones for repository.
|
|
if _, err = e.Delete(&Access{RepoID: repo.Id}); err != nil {
|
|
return err
|
|
} else if _, err = e.Insert(newAccesses); err != nil {
|
|
return err
|
|
}
|
|
|
|
return nil
|
|
}
|
|
|
|
// RecalculateAccesses recalculates all accesses for repository.
|
|
func (r *Repository) RecalculateAccesses() error {
|
|
return r.recalculateAccesses(x)
|
|
}
|