ui-tree.c (view raw)
1/* ui-tree.c: functions for tree output
2 *
3 * Copyright (C) 2006 Lars Hjemli
4 *
5 * Licensed under GNU General Public License v2
6 * (see COPYING for full license text)
7 */
8
9#include <ctype.h>
10#include "cgit.h"
11#include "html.h"
12#include "ui-shared.h"
13
14char *curr_rev;
15char *match_path;
16int header = 0;
17
18static void print_text_buffer(const char *name, char *buf, unsigned long size)
19{
20 unsigned long lineno, idx;
21 const char *numberfmt =
22 "<a class='no' id='n%1$d' name='n%1$d' href='#n%1$d'>%1$d</a>\n";
23
24 html("<table summary='blob content' class='blob'>\n");
25
26 if (ctx.cfg.enable_tree_linenumbers) {
27 html("<tr><td class='linenumbers'><pre>");
28 idx = 0;
29 lineno = 0;
30
31 if (size) {
32 htmlf(numberfmt, ++lineno);
33 while(idx < size - 1) { // skip absolute last newline
34 if (buf[idx] == '\n')
35 htmlf(numberfmt, ++lineno);
36 idx++;
37 }
38 }
39 html("</pre></td>\n");
40 }
41 else {
42 html("<tr>\n");
43 }
44
45 if (ctx.repo->source_filter) {
46 html("<td class='lines'><pre><code>");
47 ctx.repo->source_filter->argv[1] = xstrdup(name);
48 cgit_open_filter(ctx.repo->source_filter);
49 write(STDOUT_FILENO, buf, size);
50 cgit_close_filter(ctx.repo->source_filter);
51 html("</code></pre></td></tr></table>\n");
52 return;
53 }
54
55 html("<td class='lines'><pre><code>");
56 html_txt(buf);
57 html("</code></pre></td></tr></table>\n");
58}
59
60#define ROWLEN 32
61
62static void print_binary_buffer(char *buf, unsigned long size)
63{
64 unsigned long ofs, idx;
65 static char ascii[ROWLEN + 1];
66
67 html("<table summary='blob content' class='bin-blob'>\n");
68 html("<tr><th>ofs</th><th>hex dump</th><th>ascii</th></tr>");
69 for (ofs = 0; ofs < size; ofs += ROWLEN, buf += ROWLEN) {
70 htmlf("<tr><td class='right'>%04x</td><td class='hex'>", ofs);
71 for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++)
72 htmlf("%*s%02x",
73 idx == 16 ? 4 : 1, "",
74 buf[idx] & 0xff);
75 html(" </td><td class='hex'>");
76 for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++)
77 ascii[idx] = isgraph(buf[idx]) ? buf[idx] : '.';
78 ascii[idx] = '\0';
79 html_txt(ascii);
80 html("</td></tr>\n");
81 }
82 html("</table>\n");
83}
84
85static void print_object(const unsigned char *sha1, char *path, const char *basename)
86{
87 enum object_type type;
88 char *buf;
89 unsigned long size;
90
91 type = sha1_object_info(sha1, &size);
92 if (type == OBJ_BAD) {
93 cgit_print_error(fmt("Bad object name: %s",
94 sha1_to_hex(sha1)));
95 return;
96 }
97
98 buf = read_sha1_file(sha1, &type, &size);
99 if (!buf) {
100 cgit_print_error(fmt("Error reading object %s",
101 sha1_to_hex(sha1)));
102 return;
103 }
104
105 htmlf("blob: %s (", sha1_to_hex(sha1));
106 cgit_plain_link("plain", NULL, NULL, ctx.qry.head,
107 curr_rev, path);
108 html(")\n");
109
110 if (ctx.cfg.max_blob_size && size / 1024 > ctx.cfg.max_blob_size) {
111 htmlf("<div class='error'>blob size (%dKB) exceeds display size limit (%dKB).</div>",
112 size / 1024, ctx.cfg.max_blob_size);
113 return;
114 }
115
116 if (buffer_is_binary(buf, size))
117 print_binary_buffer(buf, size);
118 else
119 print_text_buffer(basename, buf, size);
120}
121
122
123static int ls_item(const unsigned char *sha1, const char *base, int baselen,
124 const char *pathname, unsigned int mode, int stage,
125 void *cbdata)
126{
127 char *name;
128 char *fullpath;
129 char *class;
130 enum object_type type;
131 unsigned long size = 0;
132
133 name = xstrdup(pathname);
134 fullpath = fmt("%s%s%s", ctx.qry.path ? ctx.qry.path : "",
135 ctx.qry.path ? "/" : "", name);
136
137 if (!S_ISGITLINK(mode)) {
138 type = sha1_object_info(sha1, &size);
139 if (type == OBJ_BAD) {
140 htmlf("<tr><td colspan='3'>Bad object: %s %s</td></tr>",
141 name,
142 sha1_to_hex(sha1));
143 return 0;
144 }
145 }
146
147 html("<tr><td class='ls-mode'>");
148 cgit_print_filemode(mode);
149 html("</td><td>");
150 if (S_ISGITLINK(mode)) {
151 htmlf("<a class='ls-mod' href='");
152 html_attr(fmt(ctx.repo->module_link,
153 name,
154 sha1_to_hex(sha1)));
155 html("'>");
156 html_txt(name);
157 html("</a>");
158 } else if (S_ISDIR(mode)) {
159 cgit_tree_link(name, NULL, "ls-dir", ctx.qry.head,
160 curr_rev, fullpath);
161 } else {
162 class = strrchr(name, '.');
163 if (class != NULL) {
164 class = fmt("ls-blob %s", class + 1);
165 } else
166 class = "ls-blob";
167 cgit_tree_link(name, NULL, class, ctx.qry.head,
168 curr_rev, fullpath);
169 }
170 htmlf("</td><td class='ls-size'>%li</td>", size);
171
172 html("<td>");
173 cgit_log_link("log", NULL, "button", ctx.qry.head, curr_rev,
174 fullpath, 0, NULL, NULL, ctx.qry.showmsg);
175 if (ctx.repo->max_stats)
176 cgit_stats_link("stats", NULL, "button", ctx.qry.head,
177 fullpath);
178 cgit_plain_link("plain", NULL, "button", ctx.qry.head, curr_rev,
179 fullpath);
180 html("</td></tr>\n");
181 free(name);
182 return 0;
183}
184
185static void ls_head()
186{
187 html("<table summary='tree listing' class='list'>\n");
188 html("<tr class='nohover'>");
189 html("<th class='left'>Mode</th>");
190 html("<th class='left'>Name</th>");
191 html("<th class='right'>Size</th>");
192 html("<th/>");
193 html("</tr>\n");
194 header = 1;
195}
196
197static void ls_tail()
198{
199 if (!header)
200 return;
201 html("</table>\n");
202 header = 0;
203}
204
205static void ls_tree(const unsigned char *sha1, char *path)
206{
207 struct tree *tree;
208
209 tree = parse_tree_indirect(sha1);
210 if (!tree) {
211 cgit_print_error(fmt("Not a tree object: %s",
212 sha1_to_hex(sha1)));
213 return;
214 }
215
216 ls_head();
217 read_tree_recursive(tree, "", 0, 1, NULL, ls_item, NULL);
218 ls_tail();
219}
220
221
222static int walk_tree(const unsigned char *sha1, const char *base, int baselen,
223 const char *pathname, unsigned mode, int stage,
224 void *cbdata)
225{
226 static int state;
227 static char buffer[PATH_MAX];
228
229 if (state == 0) {
230 memcpy(buffer, base, baselen);
231 strcpy(buffer+baselen, pathname);
232 if (strcmp(match_path, buffer))
233 return READ_TREE_RECURSIVE;
234
235 if (S_ISDIR(mode)) {
236 state = 1;
237 ls_head();
238 return READ_TREE_RECURSIVE;
239 } else {
240 print_object(sha1, buffer, pathname);
241 return 0;
242 }
243 }
244 ls_item(sha1, base, baselen, pathname, mode, stage, NULL);
245 return 0;
246}
247
248
249/*
250 * Show a tree or a blob
251 * rev: the commit pointing at the root tree object
252 * path: path to tree or blob
253 */
254void cgit_print_tree(const char *rev, char *path)
255{
256 unsigned char sha1[20];
257 struct commit *commit;
258 const char *paths[] = {path, NULL};
259
260 if (!rev)
261 rev = ctx.qry.head;
262
263 curr_rev = xstrdup(rev);
264 if (get_sha1(rev, sha1)) {
265 cgit_print_error(fmt("Invalid revision name: %s", rev));
266 return;
267 }
268 commit = lookup_commit_reference(sha1);
269 if (!commit || parse_commit(commit)) {
270 cgit_print_error(fmt("Invalid commit reference: %s", rev));
271 return;
272 }
273
274 if (path == NULL) {
275 ls_tree(commit->tree->object.sha1, NULL);
276 return;
277 }
278
279 match_path = path;
280 read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL);
281 ls_tail();
282}