| @@ -1,159 +1,161 | |||
|
|
1 | 1 | # Redmine - project management software |
|
|
2 | 2 | # Copyright (C) 2006-2011 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}" |
|
|
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 | 74 | # Finds and returns a revision with a number or the beginning of a hash |
|
|
75 | 75 | def find_changeset_by_name(name) |
|
|
76 | 76 | return nil if name.blank? |
|
|
77 | 77 | s = name.to_s |
|
|
78 | 78 | if /[^\d]/ =~ s or s.size > 8 |
|
|
79 | 79 | e = changesets.find(:first, :conditions => ['scmid = ?', s]) |
|
|
80 | 80 | else |
|
|
81 | 81 | e = changesets.find(:first, :conditions => ['revision = ?', s]) |
|
|
82 | 82 | end |
|
|
83 | 83 | return e if e |
|
|
84 | 84 | changesets.find(:first, :conditions => ['scmid LIKE ?', "#{s}%"]) # last ditch |
|
|
85 | 85 | end |
|
|
86 | 86 | |
|
|
87 | 87 | # Returns the latest changesets for +path+; sorted by revision number |
|
|
88 | 88 | # |
|
|
89 | 89 | # Because :order => 'id DESC' is defined at 'has_many', |
|
|
90 | 90 | # there is no need to set 'order'. |
|
|
91 | 91 | # But, MySQL test fails. |
|
|
92 | 92 | # Sqlite3 and PostgreSQL pass. |
|
|
93 | 93 | # Is this MySQL bug? |
|
|
94 | 94 | def latest_changesets(path, rev, limit=10) |
|
|
95 | 95 | changesets.find(:all, |
|
|
96 | 96 | :include => :user, |
|
|
97 | 97 | :conditions => latest_changesets_cond(path, rev, limit), |
|
|
98 | 98 | :limit => limit, |
|
|
99 | 99 | :order => "#{Changeset.table_name}.id DESC") |
|
|
100 | 100 | end |
|
|
101 | 101 | |
|
|
102 | 102 | def latest_changesets_cond(path, rev, limit) |
|
|
103 | 103 | cond, args = [], [] |
|
|
104 | 104 | if scm.branchmap.member? rev |
|
|
105 | 105 | # Mercurial named branch is *stable* in each revision. |
|
|
106 | 106 | # So, named branch can be stored in database. |
|
|
107 | 107 | # Mercurial provides *bookmark* which is equivalent with git branch. |
|
|
108 | 108 | # But, bookmark is not implemented. |
|
|
109 | 109 | cond << "#{Changeset.table_name}.scmid IN (?)" |
|
|
110 | 110 | # Revisions in root directory and sub directory are not equal. |
|
|
111 | 111 | # So, in order to get correct limit, we need to get all revisions. |
|
|
112 | 112 | # But, it is very heavy. |
|
|
113 | 113 | # Mercurial does not treat direcotry. |
|
|
114 | 114 | # So, "hg log DIR" is very heavy. |
|
|
115 | 115 | branch_limit = path.blank? ? limit : ( limit * 5 ) |
|
|
116 | 116 | args << scm.nodes_in_branch(rev, :limit => branch_limit) |
|
|
117 | 117 | elsif last = rev ? find_changeset_by_name(scm.tagmap[rev] || rev) : nil |
|
|
118 | 118 | cond << "#{Changeset.table_name}.id <= ?" |
|
|
119 | 119 | args << last.id |
|
|
120 | 120 | end |
|
|
121 | 121 | unless path.blank? |
|
|
122 | 122 | cond << "EXISTS (SELECT * FROM #{Change.table_name} |
|
|
123 | 123 | WHERE #{Change.table_name}.changeset_id = #{Changeset.table_name}.id |
|
|
124 | 124 | AND (#{Change.table_name}.path = ? |
|
|
125 | 125 | OR #{Change.table_name}.path LIKE ? ESCAPE ?))" |
|
|
126 | 126 | args << path.with_leading_slash |
|
|
127 | 127 | args << "#{path.with_leading_slash.gsub(%r{[%_\\]}) { |s| "\\#{s}" }}/%" << '\\' |
|
|
128 | 128 | end |
|
|
129 | 129 | [cond.join(' AND '), *args] unless cond.empty? |
|
|
130 | 130 | end |
|
|
131 | 131 | private :latest_changesets_cond |
|
|
132 | 132 | |
|
|
133 | 133 | def fetch_changesets |
|
|
134 | 134 | return if scm.info.nil? |
|
|
135 | 135 | scm_rev = scm.info.lastrev.revision.to_i |
|
|
136 | 136 | db_rev = latest_changeset ? latest_changeset.revision.to_i : -1 |
|
|
137 | 137 | return unless db_rev < scm_rev # already up-to-date |
|
|
138 | 138 | |
|
|
139 | 139 | logger.debug "Fetching changesets for repository #{url}" if logger |
|
|
140 | 140 | (db_rev + 1).step(scm_rev, FETCH_AT_ONCE) do |i| |
|
|
141 | transaction do | |
|
|
142 | scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re| | |
|
|
141 | scm.each_revision('', i, [i + FETCH_AT_ONCE - 1, scm_rev].min) do |re| | |
|
|
142 | transaction do | |
|
|
143 | 143 | cs = Changeset.create(:repository => self, |
|
|
144 | 144 | :revision => re.revision, |
|
|
145 | 145 | :scmid => re.scmid, |
|
|
146 | 146 | :committer => re.author, |
|
|
147 | 147 | :committed_on => re.time, |
|
|
148 | 148 | :comments => re.message) |
|
|
149 | re.paths.each { |e| cs.create_change(e) } | |
|
|
150 | parents = {} | |
|
|
151 | parents[cs] = re.parents unless re.parents.nil? | |
|
|
152 | parents.each do |ch, chparents| | |
|
|
153 | ch.parents = chparents.collect{|rp| find_changeset_by_name(rp)}.compact | |
|
|
149 | unless cs.new_record? | |
|
|
150 | re.paths.each { |e| cs.create_change(e) } | |
|
|
151 | parents = {} | |
|
|
152 | parents[cs] = re.parents unless re.parents.nil? | |
|
|
153 | parents.each do |ch, chparents| | |
|
|
154 | ch.parents = chparents.collect{|rp| find_changeset_by_name(rp)}.compact | |
|
|
155 | end | |
|
|
154 | 156 | end |
|
|
155 | 157 | end |
|
|
156 | 158 | end |
|
|
157 | 159 | end |
|
|
158 | 160 | end |
|
|
159 | 161 | end |
General Comments 0
You need to be logged in to leave comments.
Login now