2 /*=====================================================================*\
3 || ###################################################################
4 || # ViewSVN [#]version[#]
5 || # Copyright ©2002-[#]year[#] Iris Studios, Inc.
7 || # This program is free software; you can redistribute it and/or modify
8 || # it under the terms of the GNU General Public License as published by
9 || # the Free Software Foundation; version [#]gpl[#] of the License.
11 || # This program is distributed in the hope that it will be useful, but
12 || # WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
13 || # or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
16 || # You should have received a copy of the GNU General Public License along
17 || # with this program; if not, write to the Free Software Foundation, Inc.,
18 || # 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
19 || ###################################################################
20 \*=====================================================================*/
23 * File container for cacheV class
31 * This class is responsible for interacting with a given cacheV table.
32 * It controls rebuilding from scratch, updates, and querying the cache.
34 * @author Iris Studios, Inc.
35 * @copyright Copyright ©2002 - [#]year[#], Iris Studios, Inc.
55 * Record count - the number of records in cacheV
60 // ###################################################################
62 * Constructor: initialies the registry
67 $this->registry
=& $viewsvn;
70 // ###################################################################
72 * Sets the hash so we know what table we're dealing with
78 $this->hash
= md5($this->registry
->repos
->fetch_path($this->registry
->paths
->repos
));
81 // ###################################################################
83 * Checks to see if it's necessary to rebuild the cacheV table for the
84 * current repository. This is done by making sure $count > 0. If not,
85 * then rebuild() is run. This also checks against the cacheV table
86 * to make sure that it's up-to-date against the root repository.
92 $result = $this->registry
->db
->query_first("SELECT MAX(revision) AS max FROM {$this->hash}");
94 // time to go from the start
95 if ($result['max'] == 0)
101 // send an Xquery to SVN
102 $query = $this->registry
->svn
->svn('info --xml ' . $this->registry
->repos
->fetch_path($this->registry
->paths
->repos
));
103 $query = implode("\n", $query);
105 $tree = $this->registry
->xml
->parse($query);
107 if ($tree['info']['entry']['revision'] != $result['max'])
109 $this->build($result['max']);
114 // ###################################################################
116 * Builds the cacheV table. This can be used to build only part of the
117 * cache or the entire thing, if the revision is set to NULL.
121 * @param integer Lower (current) revision
123 function build($revision)
125 $start = microtime();
127 $output = $this->registry
->svn
->svn('log --xml -v ' . ($revision !== null ?
'-r' . $revision . ':HEAD ' : '') . $this->registry
->repos
->fetch_path($this->registry
->paths
->repos
));
128 $output = implode("\n", $output);
130 $tree = $this->registry
->xml
->parse($output);
132 foreach ($tree['log']['logentry'] AS $log)
134 if (isset($log['paths'][0]))
136 $files = $log['paths']['path'];
140 $files = array($log['paths']['path']);
143 $inserts[] = "($log[revision], '{$log['author']['value']}', '{$log['date']['value']}', '" . $this->registry
->escape($log['msg']['value']) . "', '" . $this->registry
->escape(serialize($files)) . "')";
146 $this->registry
->db
->query("
147 INSERT INTO {$this->hash}
148 (revision, author, dateline, message, files)
150 " . implode(",\n", $inserts)
153 $this->registry
->debug("TIME TO (RE)BUILD: " . $this->registry
->funct
->fetch_microtime_diff($start));
157 /*=====================================================================*\
158 || ###################################################################
161 || ###################################################################
162 \*=====================================================================*/