/* ui-tree.c: functions for tree output * * Copyright (C) 2006 Lars Hjemli * * Licensed under GNU General Public License v2 * (see COPYING for full license text) */ #include #include "cgit.h" #include "html.h" #include "ui-shared.h" char *curr_rev; char *match_path; int header = 0; static void print_text_buffer(const char *name, char *buf, unsigned long size) { unsigned long lineno, idx; const char *numberfmt = "%1$d\n"; html("\n"); if (ctx.cfg.enable_tree_linenumbers) { html("\n"); } else { html("\n"); } if (ctx.repo->source_filter) { html("
");
		idx = 0;
		lineno = 0;
	
		if (size) {
			htmlf(numberfmt, ++lineno);
			while(idx < size - 1) { // skip absolute last newline
				if (buf[idx] == '\n')
					htmlf(numberfmt, ++lineno);
				idx++;
			}
		}
		html("
");
		ctx.repo->source_filter->argv[1] = xstrdup(name);
		cgit_open_filter(ctx.repo->source_filter);
		html_raw(buf, size);
		cgit_close_filter(ctx.repo->source_filter);
		free(ctx.repo->source_filter->argv[1]);
		ctx.repo->source_filter->argv[1] = NULL;
		html("
\n"); return; } html("
");
	html_txt(buf);
	html("
\n"); } #define ROWLEN 32 static void print_binary_buffer(char *buf, unsigned long size) { unsigned long ofs, idx; static char ascii[ROWLEN + 1]; html("\n"); html(""); for (ofs = 0; ofs < size; ofs += ROWLEN, buf += ROWLEN) { htmlf("\n"); } html("
ofshex dumpascii
%04lx", ofs); for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++) htmlf("%*s%02x", idx == 16 ? 4 : 1, "", buf[idx] & 0xff); html(" "); for (idx = 0; idx < ROWLEN && ofs + idx < size; idx++) ascii[idx] = isgraph(buf[idx]) ? buf[idx] : '.'; ascii[idx] = '\0'; html_txt(ascii); html("
\n"); } static void print_object(const unsigned char *sha1, char *path, const char *basename) { enum object_type type; char *buf; unsigned long size; type = sha1_object_info(sha1, &size); if (type == OBJ_BAD) { cgit_print_error(fmt("Bad object name: %s", sha1_to_hex(sha1))); return; } buf = read_sha1_file(sha1, &type, &size); if (!buf) { cgit_print_error(fmt("Error reading object %s", sha1_to_hex(sha1))); return; } htmlf("blob: %s (", sha1_to_hex(sha1)); cgit_plain_link("plain", NULL, NULL, ctx.qry.head, curr_rev, path); html(")\n"); if (ctx.cfg.max_blob_size && size / 1024 > ctx.cfg.max_blob_size) { htmlf("
blob size (%ldKB) exceeds display size limit (%dKB).
", size / 1024, ctx.cfg.max_blob_size); return; } if (buffer_is_binary(buf, size)) print_binary_buffer(buf, size); else print_text_buffer(basename, buf, size); } static int ls_item(const unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned int mode, int stage, void *cbdata) { char *name; char *fullpath; char *class; enum object_type type; unsigned long size = 0; name = xstrdup(pathname); fullpath = fmt("%s%s%s", ctx.qry.path ? ctx.qry.path : "", ctx.qry.path ? "/" : "", name); if (!S_ISGITLINK(mode)) { type = sha1_object_info(sha1, &size); if (type == OBJ_BAD) { htmlf("Bad object: %s %s", name, sha1_to_hex(sha1)); return 0; } } html(""); cgit_print_filemode(mode); html(""); if (S_ISGITLINK(mode)) { cgit_submodule_link("ls-mod", fullpath, sha1_to_hex(sha1)); } else if (S_ISDIR(mode)) { cgit_tree_link(name, NULL, "ls-dir", ctx.qry.head, curr_rev, fullpath); } else { class = strrchr(name, '.'); if (class != NULL) { class = fmt("ls-blob %s", class + 1); } else class = "ls-blob"; cgit_tree_link(name, NULL, class, ctx.qry.head, curr_rev, fullpath); } htmlf("%li", size); html(""); cgit_log_link("log", NULL, "button", ctx.qry.head, curr_rev, fullpath, 0, NULL, NULL, ctx.qry.showmsg); if (ctx.repo->max_stats) cgit_stats_link("stats", NULL, "button", ctx.qry.head, fullpath); if (!S_ISGITLINK(mode)) cgit_plain_link("plain", NULL, "button", ctx.qry.head, curr_rev, fullpath); html("\n"); free(name); return 0; } static void ls_head() { html("\n"); html(""); html(""); html(""); html(""); html("\n"); header = 1; } static void ls_tail() { if (!header) return; html("
ModeNameSize"); html("
\n"); header = 0; } static void ls_tree(const unsigned char *sha1, char *path) { struct tree *tree; tree = parse_tree_indirect(sha1); if (!tree) { cgit_print_error(fmt("Not a tree object: %s", sha1_to_hex(sha1))); return; } ls_head(); read_tree_recursive(tree, "", 0, 1, NULL, ls_item, NULL); ls_tail(); } static int walk_tree(const unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage, void *cbdata) { static int state; static char buffer[PATH_MAX]; if (state == 0) { memcpy(buffer, base, baselen); strcpy(buffer+baselen, pathname); if (strcmp(match_path, buffer)) return READ_TREE_RECURSIVE; if (S_ISDIR(mode)) { state = 1; ls_head(); return READ_TREE_RECURSIVE; } else { print_object(sha1, buffer, pathname); return 0; } } ls_item(sha1, base, baselen, pathname, mode, stage, NULL); return 0; } /* * Show a tree or a blob * rev: the commit pointing at the root tree object * path: path to tree or blob */ void cgit_print_tree(const char *rev, char *path) { unsigned char sha1[20]; struct commit *commit; const char *paths[] = {path, NULL}; if (!rev) rev = ctx.qry.head; curr_rev = xstrdup(rev); if (get_sha1(rev, sha1)) { cgit_print_error(fmt("Invalid revision name: %s", rev)); return; } commit = lookup_commit_reference(sha1); if (!commit || parse_commit(commit)) { cgit_print_error(fmt("Invalid commit reference: %s", rev)); return; } if (path == NULL) { ls_tree(commit->tree->object.sha1, NULL); return; } match_path = path; read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); ls_tail(); } struct grep_data { regex_t re; char *path; int max_hits; }; static int grep_blob(const unsigned char *sha1, const char *base, int baselen, const char *pathname, struct grep_data *grep) { enum object_type type; char *buf, *line, *lf, *fullpath; unsigned long size; int hits, lno, rc; type = sha1_object_info(sha1, &size); if (type == OBJ_BAD) { cgit_print_error(fmt("Bad object name: %s", sha1_to_hex(sha1))); return -1; } buf = read_sha1_file(sha1, &type, &size); if (!buf) { cgit_print_error(fmt("Error reading object %s", sha1_to_hex(sha1))); return -1; } hits = 0; line = buf; lno = 1; while (size) { lf = strchr(line, '\n'); if (lf) *lf = 0; rc = regexec(&grep->re, line, 0, NULL, 0); if (!rc) { if (!hits) { fullpath = fmt("%.*s%s", baselen, base, pathname); htmlf("%s
", fullpath);
			}
			htmlf("%6d: ", lno);
			while (isspace(*line))
				line++;
			cgit_tree_link2(line, NULL, NULL, ctx.qry.head,
					ctx.qry.sha1, fullpath, lno);
			html("\n");
			++hits;
			if (!(--grep->max_hits))
				break;
		}
		if (!lf)
			break;
		size -= (lf - line);
		*lf = '\n';
		line = lf + 1;
		lno++;
	}
	if (hits)
		html("
"); if (!grep->max_hits) { cgit_print_error("Too many matches found."); return -1; } return 0; } static int grep_tree(const unsigned char *sha1, const char *base, int baselen, const char *pathname, unsigned mode, int stage, void *cbdata) { int rc; char *fullpath; struct grep_data *grep; grep = cbdata; fullpath = fmt("%.*s%s", baselen, base, pathname); if (S_ISDIR(mode)) { rc = grep->path ? prefixcmp(grep->path, fullpath) : 0; if (!rc) return READ_TREE_RECURSIVE; return (rc > 0 ? -1 : 0); } else if (S_ISREG(mode)) { rc = grep->path ? prefixcmp(fullpath, grep->path) : 0; if (!rc) return grep_blob(sha1, base, baselen, pathname, grep); return (rc < 0 ? -1 : 0); } return 0; } void cgit_grep(const char *rev, char *path, char *grep) { unsigned char sha1[20]; struct commit *commit; struct grep_data data; if (!rev) rev = ctx.qry.head; curr_rev = xstrdup(rev); if (get_sha1(rev, sha1)) { cgit_print_error(fmt("Invalid revision name: %s", rev)); return; } commit = lookup_commit_reference(sha1); if (!commit || parse_commit(commit)) { cgit_print_error(fmt("Invalid commit reference: %s", rev)); return; } data.path = path; data.max_hits = 100; if (regcomp(&data.re, ctx.qry.search, REG_EXTENDED | REG_ICASE | REG_NOSUB)) { cgit_print_error("Invalid regex"); return; } read_tree_recursive(commit->tree, "", 0, 0, NULL, grep_tree, &data); }