access.go 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238
  1. package models
  2. import (
  3. "fmt"
  4. "gitote/gitote/models/errors"
  5. log "gopkg.in/clog.v1"
  6. )
  7. type AccessMode int
  8. const (
  9. ACCESS_MODE_NONE AccessMode = iota // 0
  10. ACCESS_MODE_READ // 1
  11. ACCESS_MODE_WRITE // 2
  12. ACCESS_MODE_ADMIN // 3
  13. ACCESS_MODE_OWNER // 4
  14. )
  15. func (mode AccessMode) String() string {
  16. switch mode {
  17. case ACCESS_MODE_READ:
  18. return "read"
  19. case ACCESS_MODE_WRITE:
  20. return "write"
  21. case ACCESS_MODE_ADMIN:
  22. return "admin"
  23. case ACCESS_MODE_OWNER:
  24. return "owner"
  25. default:
  26. return "none"
  27. }
  28. }
  29. // ParseAccessMode returns corresponding access mode to given permission string.
  30. func ParseAccessMode(permission string) AccessMode {
  31. switch permission {
  32. case "write":
  33. return ACCESS_MODE_WRITE
  34. case "admin":
  35. return ACCESS_MODE_ADMIN
  36. default:
  37. return ACCESS_MODE_READ
  38. }
  39. }
  40. // Access represents the highest access level of a user to the repository. The only access type
  41. // that is not in this table is the real owner of a repository. In case of an organization
  42. // repository, the members of the owners team are in this table.
  43. type Access struct {
  44. ID int64
  45. UserID int64 `xorm:"UNIQUE(s)"`
  46. RepoID int64 `xorm:"UNIQUE(s)"`
  47. Mode AccessMode
  48. }
  49. func accessLevel(e Engine, userID int64, repo *Repository) (AccessMode, error) {
  50. mode := ACCESS_MODE_NONE
  51. // Everyone has read access to public repository
  52. if !repo.IsPrivate {
  53. mode = ACCESS_MODE_READ
  54. }
  55. if userID <= 0 {
  56. return mode, nil
  57. }
  58. if userID == repo.OwnerID {
  59. return ACCESS_MODE_OWNER, nil
  60. }
  61. access := &Access{
  62. UserID: userID,
  63. RepoID: repo.ID,
  64. }
  65. if has, err := e.Get(access); !has || err != nil {
  66. return mode, err
  67. }
  68. return access.Mode, nil
  69. }
  70. // AccessLevel returns the Access a user has to a repository. Will return NoneAccess if the
  71. // user does not have access.
  72. func AccessLevel(userID int64, repo *Repository) (AccessMode, error) {
  73. return accessLevel(x, userID, repo)
  74. }
  75. func hasAccess(e Engine, userID int64, repo *Repository, testMode AccessMode) (bool, error) {
  76. mode, err := accessLevel(e, userID, repo)
  77. return mode >= testMode, err
  78. }
  79. // HasAccess returns true if someone has the request access level. User can be nil!
  80. func HasAccess(userID int64, repo *Repository, testMode AccessMode) (bool, error) {
  81. return hasAccess(x, userID, repo, testMode)
  82. }
  83. // GetRepositoryAccesses finds all repositories with their access mode where a user has access but does not own.
  84. func (u *User) GetRepositoryAccesses() (map[*Repository]AccessMode, error) {
  85. accesses := make([]*Access, 0, 10)
  86. if err := x.Find(&accesses, &Access{UserID: u.ID}); err != nil {
  87. return nil, err
  88. }
  89. repos := make(map[*Repository]AccessMode, len(accesses))
  90. for _, access := range accesses {
  91. repo, err := GetRepositoryByID(access.RepoID)
  92. if err != nil {
  93. if errors.IsRepoNotExist(err) {
  94. log.Error(2, "GetRepositoryByID: %v", err)
  95. continue
  96. }
  97. return nil, err
  98. }
  99. if repo.OwnerID == u.ID {
  100. continue
  101. }
  102. repos[repo] = access.Mode
  103. }
  104. return repos, nil
  105. }
  106. // GetAccessibleRepositories finds repositories which the user has access but does not own.
  107. // If limit is smaller than 1 means returns all found results.
  108. func (user *User) GetAccessibleRepositories(limit int) (repos []*Repository, _ error) {
  109. sess := x.Where("owner_id !=? ", user.ID).Desc("updated_unix")
  110. if limit > 0 {
  111. sess.Limit(limit)
  112. repos = make([]*Repository, 0, limit)
  113. } else {
  114. repos = make([]*Repository, 0, 10)
  115. }
  116. return repos, sess.Join("INNER", "access", "access.user_id = ? AND access.repo_id = repository.id", user.ID).Find(&repos)
  117. }
  118. func maxAccessMode(modes ...AccessMode) AccessMode {
  119. max := ACCESS_MODE_NONE
  120. for _, mode := range modes {
  121. if mode > max {
  122. max = mode
  123. }
  124. }
  125. return max
  126. }
  127. // FIXME: do corss-comparison so reduce deletions and additions to the minimum?
  128. func (repo *Repository) refreshAccesses(e Engine, accessMap map[int64]AccessMode) (err error) {
  129. newAccesses := make([]Access, 0, len(accessMap))
  130. for userID, mode := range accessMap {
  131. newAccesses = append(newAccesses, Access{
  132. UserID: userID,
  133. RepoID: repo.ID,
  134. Mode: mode,
  135. })
  136. }
  137. // Delete old accesses and insert new ones for repository.
  138. if _, err = e.Delete(&Access{RepoID: repo.ID}); err != nil {
  139. return fmt.Errorf("delete old accesses: %v", err)
  140. } else if _, err = e.Insert(newAccesses); err != nil {
  141. return fmt.Errorf("insert new accesses: %v", err)
  142. }
  143. return nil
  144. }
  145. // refreshCollaboratorAccesses retrieves repository collaborations with their access modes.
  146. func (repo *Repository) refreshCollaboratorAccesses(e Engine, accessMap map[int64]AccessMode) error {
  147. collaborations, err := repo.getCollaborations(e)
  148. if err != nil {
  149. return fmt.Errorf("getCollaborations: %v", err)
  150. }
  151. for _, c := range collaborations {
  152. accessMap[c.UserID] = c.Mode
  153. }
  154. return nil
  155. }
  156. // recalculateTeamAccesses recalculates new accesses for teams of an organization
  157. // except the team whose ID is given. It is used to assign a team ID when
  158. // remove repository from that team.
  159. func (repo *Repository) recalculateTeamAccesses(e Engine, ignTeamID int64) (err error) {
  160. accessMap := make(map[int64]AccessMode, 20)
  161. if err = repo.getOwner(e); err != nil {
  162. return err
  163. } else if !repo.Owner.IsOrganization() {
  164. return fmt.Errorf("owner is not an organization: %d", repo.OwnerID)
  165. }
  166. if err = repo.refreshCollaboratorAccesses(e, accessMap); err != nil {
  167. return fmt.Errorf("refreshCollaboratorAccesses: %v", err)
  168. }
  169. if err = repo.Owner.getTeams(e); err != nil {
  170. return err
  171. }
  172. for _, t := range repo.Owner.Teams {
  173. if t.ID == ignTeamID {
  174. continue
  175. }
  176. // Owner team gets owner access, and skip for teams that do not
  177. // have relations with repository.
  178. if t.IsOwnerTeam() {
  179. t.Authorize = ACCESS_MODE_OWNER
  180. } else if !t.hasRepository(e, repo.ID) {
  181. continue
  182. }
  183. if err = t.getMembers(e); err != nil {
  184. return fmt.Errorf("getMembers '%d': %v", t.ID, err)
  185. }
  186. for _, m := range t.Members {
  187. accessMap[m.ID] = maxAccessMode(accessMap[m.ID], t.Authorize)
  188. }
  189. }
  190. return repo.refreshAccesses(e, accessMap)
  191. }
  192. func (repo *Repository) recalculateAccesses(e Engine) error {
  193. if repo.Owner.IsOrganization() {
  194. return repo.recalculateTeamAccesses(e, 0)
  195. }
  196. accessMap := make(map[int64]AccessMode, 10)
  197. if err := repo.refreshCollaboratorAccesses(e, accessMap); err != nil {
  198. return fmt.Errorf("refreshCollaboratorAccesses: %v", err)
  199. }
  200. return repo.refreshAccesses(e, accessMap)
  201. }
  202. // RecalculateAccesses recalculates all accesses for repository.
  203. func (repo *Repository) RecalculateAccesses() error {
  204. return repo.recalculateAccesses(x)
  205. }