summaryrefslogtreecommitdiffabout
authorMark Lodato <lodatom@gmail.com>2010-01-31 06:07:41 (UTC)
committer Mark Lodato <lodatom@gmail.com>2010-01-31 22:08:49 (UTC)
commit74ebf82229829bbdbe74a4d9a7b6f29d2889dfc8 (patch) (unidiff)
tree0283b46ed39d886ff9665d76f0743de708751986
parent89082346d50ec283a16d3127677f30b427781b6a (diff)
downloadcgit-74ebf82229829bbdbe74a4d9a7b6f29d2889dfc8.zip
cgit-74ebf82229829bbdbe74a4d9a7b6f29d2889dfc8.tar.gz
cgit-74ebf82229829bbdbe74a4d9a7b6f29d2889dfc8.tar.bz2
ui-plain: more efficient walk_tree()
Git's read_tree_recursive() already filters out the objects by pathname, so we only have to compare baselen to the expected. That is, no string matching is required. Additionally, if the requested path is a directory, the old code would walk through all of its immediate children. This is not necessary, this so we no longer do that. Signed-off-by: Mark Lodato <lodatom@gmail.com>
Diffstat (more/less context) (ignore whitespace changes)
-rw-r--r--ui-plain.c20
1 files changed, 14 insertions, 6 deletions
diff --git a/ui-plain.c b/ui-plain.c
index 98e6908..8b0badd 100644
--- a/ui-plain.c
+++ b/ui-plain.c
@@ -1,92 +1,100 @@
1/* ui-plain.c: functions for output of plain blobs by path 1/* ui-plain.c: functions for output of plain blobs by path
2 * 2 *
3 * Copyright (C) 2008 Lars Hjemli 3 * Copyright (C) 2008 Lars Hjemli
4 * 4 *
5 * Licensed under GNU General Public License v2 5 * Licensed under GNU General Public License v2
6 * (see COPYING for full license text) 6 * (see COPYING for full license text)
7 */ 7 */
8 8
9#include "cgit.h" 9#include "cgit.h"
10#include "html.h" 10#include "html.h"
11#include "ui-shared.h" 11#include "ui-shared.h"
12 12
13char *match_path; 13int match_baselen;
14int match; 14int match;
15 15
16static void print_object(const unsigned char *sha1, const char *path) 16static void print_object(const unsigned char *sha1, const char *path)
17{ 17{
18 enum object_type type; 18 enum object_type type;
19 char *buf, *ext; 19 char *buf, *ext;
20 unsigned long size; 20 unsigned long size;
21 struct string_list_item *mime; 21 struct string_list_item *mime;
22 22
23 type = sha1_object_info(sha1, &size); 23 type = sha1_object_info(sha1, &size);
24 if (type == OBJ_BAD) { 24 if (type == OBJ_BAD) {
25 html_status(404, "Not found", 0); 25 html_status(404, "Not found", 0);
26 return; 26 return;
27 } 27 }
28 28
29 buf = read_sha1_file(sha1, &type, &size); 29 buf = read_sha1_file(sha1, &type, &size);
30 if (!buf) { 30 if (!buf) {
31 html_status(404, "Not found", 0); 31 html_status(404, "Not found", 0);
32 return; 32 return;
33 } 33 }
34 ctx.page.mimetype = NULL; 34 ctx.page.mimetype = NULL;
35 ext = strrchr(path, '.'); 35 ext = strrchr(path, '.');
36 if (ext && *(++ext)) { 36 if (ext && *(++ext)) {
37 mime = string_list_lookup(ext, &ctx.cfg.mimetypes); 37 mime = string_list_lookup(ext, &ctx.cfg.mimetypes);
38 if (mime) 38 if (mime)
39 ctx.page.mimetype = (char *)mime->util; 39 ctx.page.mimetype = (char *)mime->util;
40 } 40 }
41 if (!ctx.page.mimetype) { 41 if (!ctx.page.mimetype) {
42 if (buffer_is_binary(buf, size)) 42 if (buffer_is_binary(buf, size))
43 ctx.page.mimetype = "application/octet-stream"; 43 ctx.page.mimetype = "application/octet-stream";
44 else 44 else
45 ctx.page.mimetype = "text/plain"; 45 ctx.page.mimetype = "text/plain";
46 } 46 }
47 ctx.page.filename = fmt("%s", path); 47 ctx.page.filename = fmt("%s", path);
48 ctx.page.size = size; 48 ctx.page.size = size;
49 ctx.page.etag = sha1_to_hex(sha1); 49 ctx.page.etag = sha1_to_hex(sha1);
50 cgit_print_http_headers(&ctx); 50 cgit_print_http_headers(&ctx);
51 html_raw(buf, size); 51 html_raw(buf, size);
52 match = 1; 52 match = 1;
53} 53}
54 54
55static int walk_tree(const unsigned char *sha1, const char *base, int baselen, 55static int walk_tree(const unsigned char *sha1, const char *base, int baselen,
56 const char *pathname, unsigned mode, int stage, 56 const char *pathname, unsigned mode, int stage,
57 void *cbdata) 57 void *cbdata)
58{ 58{
59 if (S_ISDIR(mode)) 59 if (baselen == match_baselen) {
60 if (S_ISREG(mode))
61 print_object(sha1, pathname);
62 }
63 else if (S_ISDIR(mode))
60 return READ_TREE_RECURSIVE; 64 return READ_TREE_RECURSIVE;
61 65
62 if (S_ISREG(mode) && !strncmp(base, match_path, baselen) && 66 return 0;
63 !strcmp(pathname, match_path + baselen)) 67}
64 print_object(sha1, pathname);
65 68
69static int basedir_len(const char *path)
70{
71 char *p = strrchr(path, '/');
72 if (p)
73 return p - path + 1;
66 return 0; 74 return 0;
67} 75}
68 76
69void cgit_print_plain(struct cgit_context *ctx) 77void cgit_print_plain(struct cgit_context *ctx)
70{ 78{
71 const char *rev = ctx->qry.sha1; 79 const char *rev = ctx->qry.sha1;
72 unsigned char sha1[20]; 80 unsigned char sha1[20];
73 struct commit *commit; 81 struct commit *commit;
74 const char *paths[] = {ctx->qry.path, NULL}; 82 const char *paths[] = {ctx->qry.path, NULL};
75 83
76 if (!rev) 84 if (!rev)
77 rev = ctx->qry.head; 85 rev = ctx->qry.head;
78 86
79 if (get_sha1(rev, sha1)) { 87 if (get_sha1(rev, sha1)) {
80 html_status(404, "Not found", 0); 88 html_status(404, "Not found", 0);
81 return; 89 return;
82 } 90 }
83 commit = lookup_commit_reference(sha1); 91 commit = lookup_commit_reference(sha1);
84 if (!commit || parse_commit(commit)) { 92 if (!commit || parse_commit(commit)) {
85 html_status(404, "Not found", 0); 93 html_status(404, "Not found", 0);
86 return; 94 return;
87 } 95 }
88 match_path = ctx->qry.path; 96 match_baselen = basedir_len(paths[0]);
89 read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL); 97 read_tree_recursive(commit->tree, "", 0, 0, paths, walk_tree, NULL);
90 if (!match) 98 if (!match)
91 html_status(404, "Not found", 0); 99 html_status(404, "Not found", 0);
92} 100}