aboutsummaryrefslogtreecommitdiff
path: root/scripts
diff options
context:
space:
mode:
authorKarel Kočí <cynerd@email.cz>2015-04-12 13:13:06 +0200
committerKarel Kočí <cynerd@email.cz>2015-04-12 13:13:06 +0200
commit50a7aa6fb34dca587f487289b35feba392ff5b6b (patch)
treebc202af5beb124f59d56221827745cf4ae411e49 /scripts
parent637cd1f56a0d6d6fcd73781941dce92dd67951cb (diff)
downloadlinux-conf-perf-50a7aa6fb34dca587f487289b35feba392ff5b6b.tar.gz
linux-conf-perf-50a7aa6fb34dca587f487289b35feba392ff5b6b.tar.bz2
linux-conf-perf-50a7aa6fb34dca587f487289b35feba392ff5b6b.zip
Add TODO information to code that there should be faster implementation
Diffstat (limited to 'scripts')
-rw-r--r--scripts/parse_kconfig/symlist.c1
1 files changed, 1 insertions, 0 deletions
diff --git a/scripts/parse_kconfig/symlist.c b/scripts/parse_kconfig/symlist.c
index 5423163..6435541 100644
--- a/scripts/parse_kconfig/symlist.c
+++ b/scripts/parse_kconfig/symlist.c
@@ -21,6 +21,7 @@ void symlist_add(struct symlist *sl, char *name) {
sl->pos++;
}
+// TODO faster implementation? Maybe binary search tree?
struct symlist_el *symlist_find(struct symlist *sl, char *name) {
int i = 0;
while (i < sl->pos) {