summaryrefslogtreecommitdiffstats
path: root/amend/symtab.c
diff options
context:
space:
mode:
authorThe Android Open Source Project <initial-contribution@android.com>2008-10-21 16:00:00 +0200
committerThe Android Open Source Project <initial-contribution@android.com>2008-10-21 16:00:00 +0200
commit23580ca27a0a8109312fdd36cc363ad1f4719889 (patch)
tree0bb90eaa72f8df110162499f756b5cbfb7d49235 /amend/symtab.c
downloadandroid_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.tar
android_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.tar.gz
android_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.tar.bz2
android_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.tar.lz
android_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.tar.xz
android_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.tar.zst
android_bootable_recovery-23580ca27a0a8109312fdd36cc363ad1f4719889.zip
Diffstat (limited to 'amend/symtab.c')
-rw-r--r--amend/symtab.c132
1 files changed, 132 insertions, 0 deletions
diff --git a/amend/symtab.c b/amend/symtab.c
new file mode 100644
index 000000000..835d2fc40
--- /dev/null
+++ b/amend/symtab.c
@@ -0,0 +1,132 @@
+/*
+ * Copyright (C) 2007 The Android Open Source Project
+ *
+ * Licensed under the Apache License, Version 2.0 (the "License");
+ * you may not use this file except in compliance with the License.
+ * You may obtain a copy of the License at
+ *
+ * http://www.apache.org/licenses/LICENSE-2.0
+ *
+ * Unless required by applicable law or agreed to in writing, software
+ * distributed under the License is distributed on an "AS IS" BASIS,
+ * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+ * See the License for the specific language governing permissions and
+ * limitations under the License.
+ */
+
+#include <stdlib.h>
+#include <string.h>
+#include "symtab.h"
+
+#define DEFAULT_TABLE_SIZE 16
+
+typedef struct {
+ char *symbol;
+ const void *cookie;
+ unsigned int flags;
+} SymbolTableEntry;
+
+struct SymbolTable {
+ SymbolTableEntry *table;
+ int numEntries;
+ int maxSize;
+};
+
+SymbolTable *
+createSymbolTable()
+{
+ SymbolTable *tab;
+
+ tab = (SymbolTable *)malloc(sizeof(SymbolTable));
+ if (tab != NULL) {
+ tab->numEntries = 0;
+ tab->maxSize = DEFAULT_TABLE_SIZE;
+ tab->table = (SymbolTableEntry *)malloc(
+ tab->maxSize * sizeof(SymbolTableEntry));
+ if (tab->table == NULL) {
+ free(tab);
+ tab = NULL;
+ }
+ }
+ return tab;
+}
+
+void
+deleteSymbolTable(SymbolTable *tab)
+{
+ if (tab != NULL) {
+ while (tab->numEntries > 0) {
+ free(tab->table[--tab->numEntries].symbol);
+ }
+ free(tab->table);
+ }
+}
+
+void *
+findInSymbolTable(SymbolTable *tab, const char *symbol, unsigned int flags)
+{
+ int i;
+
+ if (tab == NULL || symbol == NULL) {
+ return NULL;
+ }
+
+ // TODO: Sort the table and binary search
+ for (i = 0; i < tab->numEntries; i++) {
+ if (strcmp(tab->table[i].symbol, symbol) == 0 &&
+ tab->table[i].flags == flags)
+ {
+ return (void *)tab->table[i].cookie;
+ }
+ }
+
+ return NULL;
+}
+
+int
+addToSymbolTable(SymbolTable *tab, const char *symbol, unsigned int flags,
+ const void *cookie)
+{
+ if (tab == NULL || symbol == NULL || cookie == NULL) {
+ return -1;
+ }
+
+ /* Make sure that this symbol isn't already in the table.
+ */
+ if (findInSymbolTable(tab, symbol, flags) != NULL) {
+ return -2;
+ }
+
+ /* Make sure there's enough space for the new entry.
+ */
+ if (tab->numEntries == tab->maxSize) {
+ SymbolTableEntry *newTable;
+ int newSize;
+
+ newSize = tab->numEntries * 2;
+ if (newSize < DEFAULT_TABLE_SIZE) {
+ newSize = DEFAULT_TABLE_SIZE;
+ }
+ newTable = (SymbolTableEntry *)realloc(tab->table,
+ newSize * sizeof(SymbolTableEntry));
+ if (newTable == NULL) {
+ return -1;
+ }
+ tab->maxSize = newSize;
+ tab->table = newTable;
+ }
+
+ /* Insert the new entry.
+ */
+ symbol = strdup(symbol);
+ if (symbol == NULL) {
+ return -1;
+ }
+ // TODO: Sort the table
+ tab->table[tab->numEntries].symbol = (char *)symbol;
+ tab->table[tab->numEntries].cookie = cookie;
+ tab->table[tab->numEntries].flags = flags;
+ tab->numEntries++;
+
+ return 0;
+}