##// END OF EJS Templates
jro_apps » redmine
RSS
scm: mercurial: switch short or long id of entry by existing value in DB (#14361)...
Toshi MARUYAMA -
r12485:d301b8c0c180
parent child
Show More
Side by Side Unified
Context file:
r12485:d301b8c0c180 Loading diff...:
Show file before | Show file after | Hide comments
@@ -1,191 +1,204
1 1 # Redmine - project management software
2 2 # Copyright (C) 2006-2014 Jean-Philippe Lang
3 3 #
4 4 # This program is free software; you can redistribute it and/or
5 5 # modify it under the terms of the GNU General Public License
6 6 # as published by the Free Software Foundation; either version 2
7 7 # of the License, or (at your option) any later version.
8 8 #
9 9 # This program is distributed in the hope that it will be useful,
10 10 # but WITHOUT ANY WARRANTY; without even the implied warranty of
11 11 # MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 12 # GNU General Public License for more details.
13 13 #
14 14 # You should have received a copy of the GNU General Public License
15 15 # along with this program; if not, write to the Free Software
16 16 # Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
17 17
18 18 require 'redmine/scm/adapters/mercurial_adapter'
19 19
20 20 class Repository::Mercurial < Repository
21 21 # sort changesets by revision number
22 22 has_many :changesets,
23 23 :order => "#{Changeset.table_name}.id DESC",
24 24 :foreign_key => 'repository_id'
25 25
26 26 attr_protected :root_url
27 27 validates_presence_of :url
28 28
29 29 # number of changesets to fetch at once
30 30 FETCH_AT_ONCE = 100
31 31
32 32 def self.human_attribute_name(attribute_key_name, *args)
33 33 attr_name = attribute_key_name.to_s
34 34 if attr_name == "url"
35 35 attr_name = "path_to_repository"
36 36 end
37 37 super(attr_name, *args)
38 38 end
39 39
40 40 def self.scm_adapter_class
41 41 Redmine::Scm::Adapters::MercurialAdapter
42 42 end
43 43
44 44 def self.scm_name
45 45 'Mercurial'
46 46 end
47 47
48 48 def supports_directory_revisions?
49 49 true
50 50 end
51 51
52 52 def supports_revision_graph?
53 53 true
54 54 end
55 55
56 56 def repo_log_encoding
57 57 'UTF-8'
58 58 end
59 59
60 60 # Returns the readable identifier for the given mercurial changeset
61 61 def self.format_changeset_identifier(changeset)
62 62 "#{changeset.revision}:#{changeset.scmid[0, 12]}"
63 63 end
64 64
65 65 # Returns the identifier for the given Mercurial changeset
66 66 def self.changeset_identifier(changeset)
67 67 changeset.scmid
68 68 end
69 69
70 70 def diff_format_revisions(cs, cs_to, sep=':')
71 71 super(cs, cs_to, ' ')
72 72 end
73 73
74 def modify_entry_lastrev_identifier(entry)
75 if entry.lastrev && entry.lastrev.identifier
76 entry.lastrev.identifier = scmid_for_inserting_db(entry.lastrev.identifier)
77 end
78 end
79 private :modify_entry_lastrev_identifier
80
74 81 def entry(path=nil, identifier=nil)
75 scm.entry(path, identifier)
82 entry = scm.entry(path, identifier)
83 return nil if entry.nil?
84 modify_entry_lastrev_identifier(entry)
85 entry
76 86 end
77 87
78 88 def scm_entries(path=nil, identifier=nil)
79 scm.entries(path, identifier)
89 entries = scm.entries(path, identifier)
90 return nil if entries.nil?
91 entries.each {|entry| modify_entry_lastrev_identifier(entry)}
92 entries
80 93 end
81 94 protected :scm_entries
82 95
83 96 # Finds and returns a revision with a number or the beginning of a hash
84 97 def find_changeset_by_name(name)
85 98 return nil if name.blank?
86 99 s = name.to_s
87 100 if /[^\d]/ =~ s or s.size > 8
88 101 cs = changesets.where(:scmid => s).first
89 102 else
90 103 cs = changesets.where(:revision => s).first
91 104 end
92 105 return cs if cs
93 106 changesets.where('scmid LIKE ?', "#{s}%").first
94 107 end
95 108
96 109 # Returns the latest changesets for +path+; sorted by revision number
97 110 #
98 111 # Because :order => 'id DESC' is defined at 'has_many',
99 112 # there is no need to set 'order'.
100 113 # But, MySQL test fails.
101 114 # Sqlite3 and PostgreSQL pass.
102 115 # Is this MySQL bug?
103 116 def latest_changesets(path, rev, limit=10)
104 117 changesets.
105 118 includes(:user).
106 119 where(latest_changesets_cond(path, rev, limit)).
107 120 limit(limit).
108 121 order("#{Changeset.table_name}.id DESC").
109 122 all
110 123 end
111 124
112 125 def scmid_for_inserting_db(scmid)
113 126 # TODO: switch short or long by existing value in DB
114 127 scmid[0, 12]
115 128 end
116 129
117 130 def nodes_in_branch(rev, branch_limit)
118 131 scm.nodes_in_branch(rev, :limit => branch_limit).collect do |b|
119 132 scmid_for_inserting_db(b)
120 133 end
121 134 end
122 135
123 136 def tag_scmid(rev)
124 137 scmid = scm.tagmap[rev]
125 138 scmid.nil? ? nil : scmid_for_inserting_db(scmid)
126 139 end
127 140
128 141 def latest_changesets_cond(path, rev, limit)
129 142 cond, args = [], []
130 143 if scm.branchmap.member? rev
131 144 # Mercurial named branch is *stable* in each revision.
132 145 # So, named branch can be stored in database.
133 146 # Mercurial provides *bookmark* which is equivalent with git branch.
134 147 # But, bookmark is not implemented.
135 148 cond << "#{Changeset.table_name}.scmid IN (?)"
136 149 # Revisions in root directory and sub directory are not equal.
137 150 # So, in order to get correct limit, we need to get all revisions.
138 151 # But, it is very heavy.
139 152 # Mercurial does not treat direcotry.
140 153 # So, "hg log DIR" is very heavy.
141 154 branch_limit = path.blank? ? limit : ( limit * 5 )
142 155 args << nodes_in_branch(rev, branch_limit)
143 156 elsif last = rev ? find_changeset_by_name(tag_scmid(rev) || rev) : nil
144 157 cond << "#{Changeset.table_name}.id <= ?"
145 158 args << last.id
146 159 end
147 160 unless path.blank?
148 161 cond << "EXISTS (SELECT * FROM #{Change.table_name}
149 162 WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id
150 163 AND (#{Change.table_name}.path = ?
151 164 OR #{Change.table_name}.path LIKE ? ESCAPE ?))"
152 165 args << path.with_leading_slash
153 166 args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\'
154 167 end
155 168 [cond.join(' AND '), *args] unless cond.empty?
156 169 end
157 170 private :latest_changesets_cond
158 171
159 172 def fetch_changesets
160 173 return if scm.info.nil?
161 174 scm_rev = scm.info.lastrev.revision.to_i
162 175 db_rev = latest_changeset ? latest_changeset.revision.to_i : -1
163 176 return unless db_rev < scm_rev # already up-to-date
164 177
165 178 logger.debug "Fetching changesets for repository #{url}" if logger
166 179 (db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i|
167 180 scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re|
168 181 transaction do
169 182 parents = (re.parents || []).collect do |rp|
170 183 find_changeset_by_name(scmid_for_inserting_db(rp))
171 184 end.compact
172 185 cs = Changeset.create(:repository => self,
173 186 :revision => re.revision,
174 187 :scmid => scmid_for_inserting_db(re.scmid),
175 188 :committer => re.author,
176 189 :committed_on => re.time,
177 190 :comments => re.message,
178 191 :parents => parents)
179 192 unless cs.new_record?
180 193 re.paths.each do |e|
181 194 if from_revision = e[:from_revision]
182 195 e[:from_revision] = scmid_for_inserting_db(from_revision)
183 196 end
184 197 cs.create_change(e)
185 198 end
186 199 end
187 200 end
188 201 end
189 202 end
190 203 end
191 204 end
General Comments 0
You need to be logged in to leave comments. Login now