jro_apps/redmine Commit - r7593:d10102e940b7

1

# Redmine - project management software

1

# Redmine - project management software

2

3

#

3

#

4

# This program is free software; you can redistribute it and/or

4

# This program is free software; you can redistribute it and/or

5

# modify it under the terms of the GNU General Public License

5

# modify it under the terms of the GNU General Public License

6

# as published by the Free Software Foundation; either version 2

6

# as published by the Free Software Foundation; either version 2

7

# of the License, or (at your option) any later version.

7

# of the License, or (at your option) any later version.

8

#

8

#

9

# This program is distributed in the hope that it will be useful,

9

# This program is distributed in the hope that it will be useful,

10

# but WITHOUT ANY WARRANTY; without even the implied warranty of

10

# but WITHOUT ANY WARRANTY; without even the implied warranty of

11

# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

11

# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the

12

# GNU General Public License for more details.

12

# GNU General Public License for more details.

13

#

13

#

14

# You should have received a copy of the GNU General Public License

14

# You should have received a copy of the GNU General Public License

15

# along with this program; if not, write to the Free Software

15

# along with this program; if not, write to the Free Software

16

# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

16

# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.

17

18

require 'redmine/scm/adapters/mercurial_adapter'

18

require 'redmine/scm/adapters/mercurial_adapter'

19

20

class Repository::Mercurial < Repository

20

class Repository::Mercurial < Repository

21

# sort changesets by revision number

21

# sort changesets by revision number

22

has_many :changesets,

22

has_many :changesets,

23

:order => "#{Changeset.table_name}.id DESC",

23

:order => "#{Changeset.table_name}.id DESC",

24

:foreign_key => 'repository_id'

24

:foreign_key => 'repository_id'

25

26

attr_protected :root_url

26

attr_protected :root_url

27

validates_presence_of :url

27

validates_presence_of :url

28

29

# number of changesets to fetch at once

29

# number of changesets to fetch at once

30

FETCH_AT_ONCE = 100

30

FETCH_AT_ONCE = 100

31

32

def self.human_attribute_name(attribute_key_name)

32

def self.human_attribute_name(attribute_key_name)

33

attr_name = attribute_key_name

33

attr_name = attribute_key_name

34

if attr_name == "url"

34

if attr_name == "url"

35

attr_name = "path_to_repository"

35

attr_name = "path_to_repository"

36

end

36

end

37

super(attr_name)

37

super(attr_name)

38

end

38

end

39

40

def self.scm_adapter_class

40

def self.scm_adapter_class

41

Redmine::Scm::Adapters::MercurialAdapter

41

Redmine::Scm::Adapters::MercurialAdapter

42

end

42

end

43

44

def self.scm_name

44

def self.scm_name

45

'Mercurial'

45

'Mercurial'

46

end

46

end

47

48

def supports_directory_revisions?

48

def supports_directory_revisions?

49

true

49

true

50

end

50

end

51

52

def repo_log_encoding

52

def repo_log_encoding

53

'UTF-8'

53

'UTF-8'

54

end

54

end

55

56

# Returns the readable identifier for the given mercurial changeset

56

# Returns the readable identifier for the given mercurial changeset

57

def self.format_changeset_identifier(changeset)

57

def self.format_changeset_identifier(changeset)

58

"#{changeset.revision}:#{changeset.scmid}"

58

"#{changeset.revision}:#{changeset.scmid}"

59

end

59

end

60

61

# Returns the identifier for the given Mercurial changeset

61

# Returns the identifier for the given Mercurial changeset

62

def self.changeset_identifier(changeset)

62

def self.changeset_identifier(changeset)

63

changeset.scmid

63

changeset.scmid

64

end

64

end

65

66

def diff_format_revisions(cs, cs_to, sep=':')

66

def diff_format_revisions(cs, cs_to, sep=':')

67

super(cs, cs_to, ' ')

67

super(cs, cs_to, ' ')

68

end

68

end

69

70

# Finds and returns a revision with a number or the beginning of a hash

70

# Finds and returns a revision with a number or the beginning of a hash

71

def find_changeset_by_name(name)

71

def find_changeset_by_name(name)

72

return nil if name.nil? || name.empty?

72

return nil if name.nil? || name.empty?

73

if /[^\d]/ =~ name or name.to_s.size > 8

73

if /[^\d]/ =~ name or name.to_s.size > 8

74

e = changesets.find(:first, :conditions => ['scmid = ?', name.to_s])

74

e = changesets.find(:first, :conditions => ['scmid = ?', name.to_s])

75

else

75

else

76

e = changesets.find(:first, :conditions => ['revision = ?', name.to_s])

76

e = changesets.find(:first, :conditions => ['revision = ?', name.to_s])

77

end

77

end

78

return e if e

78

return e if e

79

changesets.find(:first, :conditions => ['scmid LIKE ?', "#{name}%"]) # last ditch

79

changesets.find(:first, :conditions => ['scmid LIKE ?', "#{name}%"]) # last ditch

80

end

80

end

81

82

# Returns the latest changesets for +path+; sorted by revision number

82

# Returns the latest changesets for +path+; sorted by revision number

83

#

83

#

84

# Because :order => 'id DESC' is defined at 'has_many',

84

# Because :order => 'id DESC' is defined at 'has_many',

85

# there is no need to set 'order'.

85

# there is no need to set 'order'.

86

# But, MySQL test fails.

86

# But, MySQL test fails.

87

# Sqlite3 and PostgreSQL pass.

87

# Sqlite3 and PostgreSQL pass.

88

# Is this MySQL bug?

88

# Is this MySQL bug?

89

def latest_changesets(path, rev, limit=10)

89

def latest_changesets(path, rev, limit=10)

90

changesets.find(:all,

90

changesets.find(:all,

91

:include => :user,

91

:include => :user,

92

:conditions => latest_changesets_cond(path, rev, limit),

92

:conditions => latest_changesets_cond(path, rev, limit),

93

:limit => limit,

93

:limit => limit,

94

:order => "#{Changeset.table_name}.id DESC")

94

:order => "#{Changeset.table_name}.id DESC")

95

end

95

end

96

97

def latest_changesets_cond(path, rev, limit)

97

def latest_changesets_cond(path, rev, limit)

98

cond, args = [], []

98

cond, args = [], []

99

if scm.branchmap.member? rev

99

if scm.branchmap.member? rev

100

# Mercurial named branch is *stable* in each revision.

100

# Mercurial named branch is *stable* in each revision.

101

# So, named branch can be stored in database.

101

# So, named branch can be stored in database.

102

# Mercurial provides *bookmark* which is equivalent with git branch.

102

# Mercurial provides *bookmark* which is equivalent with git branch.

103

# But, bookmark is not implemented.

103

# But, bookmark is not implemented.

104

cond << "#{Changeset.table_name}.scmid IN (?)"

104

cond << "#{Changeset.table_name}.scmid IN (?)"

105

# Revisions in root directory and sub directory are not equal.

105

# Revisions in root directory and sub directory are not equal.

106

# So, in order to get correct limit, we need to get all revisions.

106

# So, in order to get correct limit, we need to get all revisions.

107

# But, it is very heavy.

107

# But, it is very heavy.

108

# Mercurial does not treat direcotry.

108

# Mercurial does not treat direcotry.

109

# So, "hg log DIR" is very heavy.

109

# So, "hg log DIR" is very heavy.

110

branch_limit = path.blank? ? limit : ( limit * 5 )

110

branch_limit = path.blank? ? limit : ( limit * 5 )

111

args << scm.nodes_in_branch(rev, :limit => branch_limit)

111

args << scm.nodes_in_branch(rev, :limit => branch_limit)

112

elsif last = rev ? find_changeset_by_name(scm.tagmap[rev] || rev) : nil

112

elsif last = rev ? find_changeset_by_name(scm.tagmap[rev] || rev) : nil

113

cond << "#{Changeset.table_name}.id <= ?"

113

cond << "#{Changeset.table_name}.id <= ?"

114

args << last.id

114

args << last.id

115

end

115

end

116

unless path.blank?

116

unless path.blank?

117

cond << "EXISTS (SELECT * FROM #{Change.table_name}

117

cond << "EXISTS (SELECT * FROM #{Change.table_name}

118

WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id

118

WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id

119

AND (#{Change.table_name}.path = ?

119

AND (#{Change.table_name}.path = ?

120

OR #{Change.table_name}.path LIKE ? ESCAPE ?))"

120

OR #{Change.table_name}.path LIKE ? ESCAPE ?))"

121

args << path.with_leading_slash

121

args << path.with_leading_slash

122

args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\'

122

args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\'

123

end

123

end

124

[cond.join(' AND '), *args] unless cond.empty?

124

[cond.join(' AND '), *args] unless cond.empty?

125

end

125

end

126

private :latest_changesets_cond

126

private :latest_changesets_cond

127

128

def fetch_changesets

128

def fetch_changesets

129

return if scm.info.nil?

129

return if scm.info.nil?

130

scm_rev = scm.info.lastrev.revision.to_i

130

scm_rev = scm.info.lastrev.revision.to_i

131

db_rev = latest_changeset ? latest_changeset.revision.to_i : -1

131

db_rev = latest_changeset ? latest_changeset.revision.to_i : -1

132

return unless db_rev < scm_rev # already up-to-date

132

return unless db_rev < scm_rev # already up-to-date

133

134

logger.debug "Fetching changesets for repository #{url}" if logger

134

logger.debug "Fetching changesets for repository #{url}" if logger

135

(db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i|

135

(db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i|

136

transaction do

136

transaction do

137

scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re|

137

scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re|

138

cs = Changeset.create(:repository => self,

138

cs = Changeset.create(:repository => self,

139

:revision => re.revision,

139

:revision => re.revision,

140

:scmid => re.scmid,

140

:scmid => re.scmid,

141

:committer => re.author,

141

:committer => re.author,

142

:committed_on => re.time,

142

:committed_on => re.time,

143

:comments => re.message)

143

:comments => re.message)

144

re.paths.each { |e| cs.create_change(e) }

144

re.paths.each { |e| cs.create_change(e) }

145

parents = {}

146

parents[cs] = re.parents unless re.parents.nil?

147

parents.each do |ch, chparents|

148

ch.parents = chparents.collect{|rp| find_changeset_by_name(rp)}.compact

149

end

145

end

150

end

146

end

151

end

147

end

152

end

148

end

153

end

149

end

154

end

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

             # Redmine - project management software
             # Copyright (C) 2006-2011  Jean-Philippe Lang
             #
             # This program is free software; you can redistribute it and/or
             # modify it under the terms of the GNU General Public License
             # as published by the Free Software Foundation; either version 2
             # of the License, or (at your option) any later version.
             #
             # This program is distributed in the hope that it will be useful,
             # but WITHOUT ANY WARRANTY; without even the implied warranty of
             # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
             # GNU General Public License for more details.
             #
             # You should have received a copy of the GNU General Public License
             # along with this program; if not, write to the Free Software
             # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301, USA.
             require 'redmine/scm/adapters/mercurial_adapter'
             class Repository::Mercurial < Repository
               # sort changesets by revision number
               has_many :changesets,
                        :order       => "#{Changeset.table_name}.id DESC",
                        :foreign_key => 'repository_id'
               attr_protected        :root_url
               validates_presence_of :url
               # number of changesets to fetch at once
               FETCH_AT_ONCE = 100
               def self.human_attribute_name(attribute_key_name)
                 attr_name = attribute_key_name
                 if attr_name == "url"
                   attr_name = "path_to_repository"
                 end
                 super(attr_name)
               end
               def self.scm_adapter_class
                 Redmine::Scm::Adapters::MercurialAdapter
               end
               def self.scm_name
                 'Mercurial'
               end
               def supports_directory_revisions?
                 true
               end
               def repo_log_encoding
                 'UTF-8'
               end
               # Returns the readable identifier for the given mercurial changeset
               def self.format_changeset_identifier(changeset)
                 "#{changeset.revision}:#{changeset.scmid}"
               end
               # Returns the identifier for the given Mercurial changeset
               def self.changeset_identifier(changeset)
                 changeset.scmid
               end
               def diff_format_revisions(cs, cs_to, sep=':')
                 super(cs, cs_to, ' ')
               end
               # Finds and returns a revision with a number or the beginning of a hash
               def find_changeset_by_name(name)
                 return nil if name.nil? || name.empty?
                 if /[^\d]/ =~ name or name.to_s.size > 8
                   e = changesets.find(:first, :conditions => ['scmid = ?', name.to_s])
                 else
                   e = changesets.find(:first, :conditions => ['revision = ?', name.to_s])
                 end
                 return e if e
                 changesets.find(:first, :conditions => ['scmid LIKE ?', "#{name}%"])  # last ditch
               end
               # Returns the latest changesets for +path+; sorted by revision number
               #
               # Because :order => 'id DESC' is defined at 'has_many',
               # there is no need to set 'order'.
               # But, MySQL test fails.
               # Sqlite3 and PostgreSQL pass.
               # Is this MySQL bug?
               def latest_changesets(path, rev, limit=10)
                 changesets.find(:all,
                                 :include    => :user,
                                 :conditions => latest_changesets_cond(path, rev, limit),
                                 :limit      => limit,
                                 :order      => "#{Changeset.table_name}.id DESC")
               end
               def latest_changesets_cond(path, rev, limit)
                 cond, args = [], []
                 if scm.branchmap.member? rev
                   # Mercurial named branch is *stable* in each revision.
                   # So, named branch can be stored in database.
                   # Mercurial provides *bookmark* which is equivalent with git branch.
                   # But, bookmark is not implemented.
                   cond << "#{Changeset.table_name}.scmid IN (?)"
                   # Revisions in root directory and sub directory are not equal.
                   # So, in order to get correct limit, we need to get all revisions.
                   # But, it is very heavy.
                   # Mercurial does not treat direcotry.
                   # So, "hg log DIR" is very heavy.
                   branch_limit = path.blank? ? limit : ( limit * 5 )
                   args << scm.nodes_in_branch(rev, :limit => branch_limit)
                 elsif last = rev ? find_changeset_by_name(scm.tagmap[rev] || rev) : nil
                   cond << "#{Changeset.table_name}.id <= ?"
                   args << last.id
                 end
                 unless path.blank?
                   cond << "EXISTS (SELECT * FROM #{Change.table_name}
                              WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id
                              AND (#{Change.table_name}.path = ?
                                    OR #{Change.table_name}.path LIKE ? ESCAPE ?))"
                   args << path.with_leading_slash
                   args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\'
                 end
                 [cond.join(' AND '), *args] unless cond.empty?
               end
               private :latest_changesets_cond
               def fetch_changesets
                 return if scm.info.nil?
                 scm_rev = scm.info.lastrev.revision.to_i
                 db_rev  = latest_changeset ? latest_changeset.revision.to_i : -1
                 return unless db_rev < scm_rev  # already up-to-date
                 logger.debug "Fetching changesets for repository #{url}" if logger
                 (db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i|
                   transaction do
                     scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re|
                       cs = Changeset.create(:repository   => self,
                                             :revision     => re.revision,
                                             :scmid        => re.scmid,
                                             :committer    => re.author,
                                             :committed_on => re.time,
                                             :comments     => re.message)
                       re.paths.each { |e| cs.create_change(e) }
+                      parents = {}
+                      parents[cs] = re.parents unless re.parents.nil?
+                      parents.each do |ch, chparents|
+                        ch.parents = chparents.collect{|rp| find_changeset_by_name(rp)}.compact
+                      end
                     end
                   end
                 end
               end
             end