diff options
| author | David Robillard <d@drobilla.net> | 2011-09-19 18:11:33 +0000 |
|---|---|---|
| committer | David Robillard <d@drobilla.net> | 2011-09-19 18:11:33 +0000 |
| commit | aa6f685daa386f6d4eff353b8ade61e84c09f847 (patch) | |
| tree | 119bb855421f46e23d20e142506f8f2a9349f3d3 | |
| parent | ef7c15a148caba3a3dc673dc358e17b5bb7061fc (diff) | |
| download | zix-aa6f685daa386f6d4eff353b8ade61e84c09f847.tar.gz zix-aa6f685daa386f6d4eff353b8ade61e84c09f847.tar.bz2 zix-aa6f685daa386f6d4eff353b8ade61e84c09f847.zip | |
Micro-optimization of dubious worth.
git-svn-id: http://svn.drobilla.net/zix/trunk@29 df6676b4-ccc9-40e5-b5d6-7c4628a128e3
| -rw-r--r-- | src/patree.c | 13 |
1 files changed, 6 insertions, 7 deletions
diff --git a/src/patree.c b/src/patree.c index 8d50e64..463a5d6 100644 --- a/src/patree.c +++ b/src/patree.c @@ -235,20 +235,19 @@ zix_patree_find(ZixPatree* t, const char* const str, char** match) ZixPatreeNode* n = t->root; n_edges_t child_i; - const char* p = str; + register const char* p = str; *match = NULL; while (*p != '\0') { if (patree_find_edge(n, p[0], &child_i)) { assert(child_i <= n->num_children); - ZixPatreeNode* const child = &n->children[child_i]; - const char* const label_first = child->label_first; - const char* const label_last = child->label_last; + ZixPatreeNode* const child = &n->children[child_i]; /* Prefix compare search string and label */ - const char* l = label_first; - while (*p != '\0' && l <= label_last) { + register const char* l = child->label_first; + register const char* const l_end = child->label_last; + while (l <= l_end) { if (*l++ != *p++) { return ZIX_STATUS_NOT_FOUND; } @@ -256,7 +255,7 @@ zix_patree_find(ZixPatree* t, const char* const str, char** match) if (!*p) { /* Reached end of search string */ - if (l == label_last + 1) { + if (l == l_end + 1) { /* Reached end of label string as well, match */ *match = child->str; return *match ? ZIX_STATUS_SUCCESS : ZIX_STATUS_NOT_FOUND; |