##// END OF EJS Templates
scm: mercurial: code clean up model....
Toshi MARUYAMA -
r5811:a267babfe806
parent child
Show More
@@ -1,146 +1,149
1 # Redmine - project management software
1 # Redmine - project management software
2 # Copyright (C) 2006-2011 Jean-Philippe Lang
2 # Copyright (C) 2006-2011 Jean-Philippe Lang
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
17
18 require 'redmine/scm/adapters/mercurial_adapter'
18 require 'redmine/scm/adapters/mercurial_adapter'
19
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, :order => "#{Changeset.table_name}.id DESC", :foreign_key => 'repository_id'
22 has_many :changesets,
23 :order => "#{Changeset.table_name}.id DESC",
24 :foreign_key => 'repository_id'
23
25
24 attr_protected :root_url
26 attr_protected :root_url
25 validates_presence_of :url
27 validates_presence_of :url
26
28
27 FETCH_AT_ONCE = 100 # number of changesets to fetch at once
29 # number of changesets to fetch at once
30 FETCH_AT_ONCE = 100
28
31
29 def self.human_attribute_name(attribute_key_name)
32 def self.human_attribute_name(attribute_key_name)
30 attr_name = attribute_key_name
33 attr_name = attribute_key_name
31 if attr_name == "url"
34 if attr_name == "url"
32 attr_name = "path_to_repository"
35 attr_name = "path_to_repository"
33 end
36 end
34 super(attr_name)
37 super(attr_name)
35 end
38 end
36
39
37 def self.scm_adapter_class
40 def self.scm_adapter_class
38 Redmine::Scm::Adapters::MercurialAdapter
41 Redmine::Scm::Adapters::MercurialAdapter
39 end
42 end
40
43
41 def self.scm_name
44 def self.scm_name
42 'Mercurial'
45 'Mercurial'
43 end
46 end
44
47
45 def supports_directory_revisions?
48 def supports_directory_revisions?
46 true
49 true
47 end
50 end
48
51
49 def repo_log_encoding
52 def repo_log_encoding
50 'UTF-8'
53 'UTF-8'
51 end
54 end
52
55
53 # Returns the readable identifier for the given mercurial changeset
56 # Returns the readable identifier for the given mercurial changeset
54 def self.format_changeset_identifier(changeset)
57 def self.format_changeset_identifier(changeset)
55 "#{changeset.revision}:#{changeset.scmid}"
58 "#{changeset.revision}:#{changeset.scmid}"
56 end
59 end
57
60
58 # Returns the identifier for the given Mercurial changeset
61 # Returns the identifier for the given Mercurial changeset
59 def self.changeset_identifier(changeset)
62 def self.changeset_identifier(changeset)
60 changeset.scmid
63 changeset.scmid
61 end
64 end
62
65
63 def diff_format_revisions(cs, cs_to, sep=':')
66 def diff_format_revisions(cs, cs_to, sep=':')
64 super(cs, cs_to, ' ')
67 super(cs, cs_to, ' ')
65 end
68 end
66
69
67 # 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
68 def find_changeset_by_name(name)
71 def find_changeset_by_name(name)
69 return nil if name.nil? || name.empty?
72 return nil if name.nil? || name.empty?
70 if /[^\d]/ =~ name or name.to_s.size > 8
73 if /[^\d]/ =~ name or name.to_s.size > 8
71 e = changesets.find(:first, :conditions => ['scmid = ?', name.to_s])
74 e = changesets.find(:first, :conditions => ['scmid = ?', name.to_s])
72 else
75 else
73 e = changesets.find(:first, :conditions => ['revision = ?', name.to_s])
76 e = changesets.find(:first, :conditions => ['revision = ?', name.to_s])
74 end
77 end
75 return e if e
78 return e if e
76 changesets.find(:first, :conditions => ['scmid LIKE ?', "#{name}%"]) # last ditch
79 changesets.find(:first, :conditions => ['scmid LIKE ?', "#{name}%"]) # last ditch
77 end
80 end
78
81
79 # Returns the latest changesets for +path+; sorted by revision number
82 # Returns the latest changesets for +path+; sorted by revision number
80 #
83 #
81 # Because :order => 'id DESC' is defined at 'has_many',
84 # Because :order => 'id DESC' is defined at 'has_many',
82 # there is no need to set 'order'.
85 # there is no need to set 'order'.
83 # But, MySQL test fails.
86 # But, MySQL test fails.
84 # Sqlite3 and PostgreSQL pass.
87 # Sqlite3 and PostgreSQL pass.
85 # Is this MySQL bug?
88 # Is this MySQL bug?
86 def latest_changesets(path, rev, limit=10)
89 def latest_changesets(path, rev, limit=10)
87 changesets.find(:all, :include => :user,
90 changesets.find(:all,
91 :include => :user,
88 :conditions => latest_changesets_cond(path, rev, limit),
92 :conditions => latest_changesets_cond(path, rev, limit),
89 :limit => limit, :order => "#{Changeset.table_name}.id DESC")
93 :limit => limit,
94 :order => "#{Changeset.table_name}.id DESC")
90 end
95 end
91
96
92 def latest_changesets_cond(path, rev, limit)
97 def latest_changesets_cond(path, rev, limit)
93 cond, args = [], []
98 cond, args = [], []
94 if scm.branchmap.member? rev
99 if scm.branchmap.member? rev
95 # Mercurial named branch is *stable* in each revision.
100 # Mercurial named branch is *stable* in each revision.
96 # So, named branch can be stored in database.
101 # So, named branch can be stored in database.
97 # Mercurial provides *bookmark* which is equivalent with git branch.
102 # Mercurial provides *bookmark* which is equivalent with git branch.
98 # But, bookmark is not implemented.
103 # But, bookmark is not implemented.
99 cond << "#{Changeset.table_name}.scmid IN (?)"
104 cond << "#{Changeset.table_name}.scmid IN (?)"
100 # Revisions in root directory and sub directory are not equal.
105 # Revisions in root directory and sub directory are not equal.
101 # 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.
102 # But, it is very heavy.
107 # But, it is very heavy.
103 # Mercurial does not treat direcotry.
108 # Mercurial does not treat direcotry.
104 # So, "hg log DIR" is very heavy.
109 # So, "hg log DIR" is very heavy.
105 branch_limit = path.blank? ? limit : ( limit * 5 )
110 branch_limit = path.blank? ? limit : ( limit * 5 )
106 args << scm.nodes_in_branch(rev, :limit => branch_limit)
111 args << scm.nodes_in_branch(rev, :limit => branch_limit)
107 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
108 cond << "#{Changeset.table_name}.id <= ?"
113 cond << "#{Changeset.table_name}.id <= ?"
109 args << last.id
114 args << last.id
110 end
115 end
111
112 unless path.blank?
116 unless path.blank?
113 cond << "EXISTS (SELECT * FROM #{Change.table_name}
117 cond << "EXISTS (SELECT * FROM #{Change.table_name}
114 WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id
118 WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id
115 AND (#{Change.table_name}.path = ?
119 AND (#{Change.table_name}.path = ?
116 OR #{Change.table_name}.path LIKE ? ESCAPE ?))"
120 OR #{Change.table_name}.path LIKE ? ESCAPE ?))"
117 args << path.with_leading_slash
121 args << path.with_leading_slash
118 args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\'
122 args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\'
119 end
123 end
120
121 [cond.join(' AND '), *args] unless cond.empty?
124 [cond.join(' AND '), *args] unless cond.empty?
122 end
125 end
123 private :latest_changesets_cond
126 private :latest_changesets_cond
124
127
125 def fetch_changesets
128 def fetch_changesets
126 scm_rev = scm.info.lastrev.revision.to_i
129 scm_rev = scm.info.lastrev.revision.to_i
127 db_rev = latest_changeset ? latest_changeset.revision.to_i : -1
130 db_rev = latest_changeset ? latest_changeset.revision.to_i : -1
128 return unless db_rev < scm_rev # already up-to-date
131 return unless db_rev < scm_rev # already up-to-date
129
132
130 logger.debug "Fetching changesets for repository #{url}" if logger
133 logger.debug "Fetching changesets for repository #{url}" if logger
131 (db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i|
134 (db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i|
132 transaction do
135 transaction do
133 scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re|
136 scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re|
134 cs = Changeset.create(:repository => self,
137 cs = Changeset.create(:repository => self,
135 :revision => re.revision,
138 :revision => re.revision,
136 :scmid => re.scmid,
139 :scmid => re.scmid,
137 :committer => re.author,
140 :committer => re.author,
138 :committed_on => re.time,
141 :committed_on => re.time,
139 :comments => re.message)
142 :comments => re.message)
140 re.paths.each { |e| cs.create_change(e) }
143 re.paths.each { |e| cs.create_change(e) }
141 end
144 end
142 end
145 end
143 end
146 end
144 self
147 self
145 end
148 end
146 end
149 end
General Comments 0
You need to be logged in to leave comments. Login now