1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
/*
* Copyright (C) 2011 Apple Inc. All rights reserved.
* Copyright (C) 2012 Google Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. AND ITS CONTRIBUTORS ``AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR ITS CONTRIBUTORS
* BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
* THE POSSIBILITY OF SUCH DAMAGE.
*/
var trac = trac || {};
(function() {
function findUsingRegExp(string, regexp)
{
var match = regexp.exec(string);
if (match)
return match[1];
return null;
}
function findReviewer(message)
{
var regexp = /R=([^.]+)/;
return findUsingRegExp(message, regexp);
}
function findBugID(message)
{
var regexp = /BUG=(\d+)/;
var bugID = parseInt(findUsingRegExp(message, regexp), 10);
return isNaN(bugID) ? 0 : bugID;
}
function findRevision(message)
{
var regexp = /git-svn-id: svn:\/\/svn.chromium.org\/blink\/trunk@(\d+)/;
var svnRevision = parseInt(findUsingRegExp(message, regexp), 10);
return isNaN(svnRevision) ? null : svnRevision;
}
function parseCommitMessage(message) {
var lines = message.split('\n');
var title = lines[1];
var summary = lines.join('\n').trim();
return {
title: title,
summary: summary,
bugID: findBugID(summary),
reviewer: findReviewer(summary),
revision: findRevision(summary),
}
}
// FIXME: Consider exposing this method for unit testing.
function parseCommitData(responseXML)
{
var commits = Array.prototype.map.call(responseXML.getElementsByTagName('entry'), function(logentry) {
var author = $.trim(logentry.getElementsByTagName('author')[0].textContent);
var time = logentry.getElementsByTagName('published')[0].textContent;
// FIXME: This isn't a very high-fidelity reproduction of the commit message,
// but it's good enough for our purposes.
var message = parseCommitMessage(logentry.getElementsByTagName('content')[0].textContent);
return {
'revision': message.revision,
'title': message.title,
'time': time,
'summary': message.title,
'author': author,
'reviewer': message.reviewer,
'bugID': message.bugID,
'message': message.summary,
'revertedRevision': undefined,
};
});
return commits;
}
trac.changesetURL = function(revision)
{
var queryParameters = {
view: 'rev',
revision: revision,
};
return config.kBlinkRevisionURL + '?' + $.param(queryParameters);
};
trac.recentCommitData = function(path, limit, callback)
{
net.get('http://blink.lc/blink/atom', function(commitData) {
callback(parseCommitData(commitData));
});
};
trac.commitDataForRevisionRange = function(path, startRevision, endRevision, callback)
{
var key = [path, startRevision, endRevision].join('\n');
g_cache.get(key, callback);
};
})();
|
