More tests and fixes.

Makefile

@@ -9,6 +9,10 @@ all: $(OBJ) test_table tests
 clean:
 	rm -f $(OBJ) tests
 
+libupb.a: $(OBJ)
+	ar rcs libupb.a $(OBJ)
+test_table: libupb.a
+
 -include deps
 deps: *.c *.h
 	gcc -MM *.c > deps

test_table.cc

@@ -3,14 +3,26 @@
 #include "test_util.h"
 #include <assert.h>
 #include <map>
+#include <string>
+#include <vector>
+#include <set>
 #include <ext/hash_map>
 #include <sys/resource.h>
+#include <iostream>
 
-struct table_entry {
+using std::string;
+using std::vector;
+
+struct inttable_entry {
   struct upb_inttable_entry e;
   uint32_t value;  /* key*2 */
 };
 
+struct strtable_entry {
+  struct upb_strtable_entry e;
+  int32_t value;  /* ASCII Value of first letter */
+};
+
 double get_usertime()
 {
   struct rusage usage;
@@ -18,21 +30,73 @@ double get_usertime()
   return usage.ru_utime.tv_sec + (usage.ru_utime.tv_usec/1000000.0);
 }
 
-static uint32_t max(uint32_t a, uint32_t b) { return a > b ? a : b; }
+struct upb_string *get_upbstring(const string& key) {
+  static struct upb_string str;
+  str.ptr = (char*)key.c_str();
+  str.byte_len = key.size();
+  return &str;
+}
+
+/* num_entries must be a power of 2. */
+void test_strtable(const vector<string>& keys, uint32_t num_to_insert)
+{
+  /* Initialize structures. */
+  struct upb_strtable table;
+  std::map<string, int32_t> m;
+  upb_strtable_init(&table, num_to_insert, sizeof(struct strtable_entry));
+  std::set<string> all;
+  for(size_t i = 0; i < num_to_insert; i++) {
+    const string& key = keys[i];
+    all.insert(key);
+    struct strtable_entry e;
+    e.value = key[0];
+    e.e.key = *get_upbstring(key);
+    upb_strtable_insert(&table, &e.e);
+    m[key] = key[0];
+  }
+
+  /* Test correctness. */
+  for(uint32_t i = 0; i < keys.size(); i++) {
+    const string& key = keys[i];
+    struct upb_string *str = get_upbstring(key);
+    struct strtable_entry *e =
+        (struct strtable_entry*)upb_strtable_lookup( &table, str);
+    if(m.find(key) != m.end()) { /* Assume map implementation is correct. */
+      assert(e);
+      assert(upb_streql(&e->e.key, get_upbstring(key)));
+      assert(e->value == key[0]);
+      assert(m[key] == key[0]);
+    } else {
+      assert(e == NULL);
+    }
+  }
+
+  struct strtable_entry *e;
+  for(e = (struct strtable_entry*)upb_strtable_begin(&table); e;
+      e = (struct strtable_entry*)upb_strtable_next(&table, &e->e)) {
+    string tmp(e->e.key.ptr, e->e.key.byte_len);
+    std::set<string>::iterator i = all.find(tmp);
+    assert(i != all.end());
+    all.erase(i);
+  }
+  assert(all.empty());
+
+  upb_strtable_free(&table);
+}
 
 /* num_entries must be a power of 2. */
-void test(int32_t *keys, size_t num_entries)
+void test_inttable(int32_t *keys, size_t num_entries)
 {
   /* Initialize structures. */
   struct upb_inttable table;
   uint32_t largest_key = 0;
   std::map<uint32_t, uint32_t> m;
   __gnu_cxx::hash_map<uint32_t, uint32_t> hm;
-  upb_inttable_init(&table, num_entries, sizeof(struct table_entry));
+  upb_inttable_init(&table, num_entries, sizeof(struct inttable_entry));
   for(size_t i = 0; i < num_entries; i++) {
     int32_t key = keys[i];
     largest_key = max(largest_key, key);
-    struct table_entry e;
+    struct inttable_entry e;
     e.e.key = key;
     e.value = key*2;
     upb_inttable_insert(&table, &e.e);
@@ -42,8 +106,8 @@ void test(int32_t *keys, size_t num_entries)
 
   /* Test correctness. */
   for(uint32_t i = 1; i <= largest_key; i++) {
-    struct table_entry *e = (struct table_entry*)upb_inttable_lookup(
-        &table, i, sizeof(struct table_entry));
+    struct inttable_entry *e = (struct inttable_entry*)upb_inttable_lookup(
+        &table, i, sizeof(struct inttable_entry));
     if(m.find(i) != m.end()) { /* Assume map implementation is correct. */
       assert(e);
       assert(e->e.key == i);
@@ -85,8 +149,8 @@ void test(int32_t *keys, size_t num_entries)
   before = get_usertime();
   for(unsigned int i = 0; i < iterations; i++) {
     int32_t key = keys[i & mask];
-    struct table_entry *e = (struct table_entry*)upb_inttable_lookup(
-        &table, key, sizeof(struct table_entry));
+    struct inttable_entry *e = (struct inttable_entry*)upb_inttable_lookup(
+        &table, key, sizeof(struct inttable_entry));
     x += (uintptr_t)e;
   }
   double total = get_usertime() - before;
@@ -98,8 +162,8 @@ void test(int32_t *keys, size_t num_entries)
   before = get_usertime();
   for(unsigned int i = 0; i < iterations; i++) {
     int32_t key = keys[rand() & mask];
-    struct table_entry *e = (struct table_entry*)upb_inttable_lookup(
-        &table, key, sizeof(struct table_entry));
+    struct inttable_entry *e = (struct inttable_entry*)upb_inttable_lookup(
+        &table, key, sizeof(struct inttable_entry));
     x += (uintptr_t)e;
   }
   total = get_usertime() - before;
@@ -162,19 +226,28 @@ int32_t *get_contiguous_keys(int32_t num)
 
 int main()
 {
+  vector<string> keys;
+  keys.push_back("A");
+  keys.push_back("B");
+  keys.push_back("C");
+  keys.push_back("D");
+  keys.push_back("E");
+  keys.push_back("F");
+  test_strtable(keys, 5);
+  return 0;
   int32_t *keys1 = get_contiguous_keys(8);
   printf("Contiguous 1-8 ====\n");
-  test(keys1, 8);
+  test_inttable(keys1, 8);
   delete[] keys1;
 
   int32_t *keys2 = get_contiguous_keys(64);
   printf("Contiguous 1-64 ====\n");
-  test(keys2, 64);
+  test_inttable(keys2, 64);
   delete[] keys2;
 
   int32_t *keys3 = get_contiguous_keys(512);
   printf("Contiguous 1-512 ====\n");
-  test(keys3, 512);
+  test_inttable(keys3, 512);
   delete[] keys3;
 
   int32_t *keys4 = new int32_t[64];
@@ -185,6 +258,6 @@ int main()
       keys4[i] = 10101+i;
   }
   printf("1-32 and 10133-10164 ====\n");
-  test(keys4, 64);
+  test_inttable(keys4, 64);
   delete[] keys4;
 }

upb_context.c

@@ -160,7 +160,10 @@ static bool insert_message(struct upb_strtable *t,
   e.e.key = fqname;
   e.type = UPB_SYM_MESSAGE;
   e.ref.msg = malloc(sizeof(*e.ref.msg));
-  upb_msg_init(e.ref.msg, d);
+  if(!upb_msg_init(e.ref.msg, d)) {
+    free(fqname.ptr);
+    return false;
+  }
   upb_strtable_insert(t, &e.e);
 
   /* Add nested messages and enums. */

upb_msg.c

@@ -31,8 +31,9 @@ static int compare_fields(const void *e1, const void *e2) {
 
 bool upb_msg_init(struct upb_msg *m, struct google_protobuf_DescriptorProto *d)
 {
-  /* TODO: more complete validation. */
-  if(!d->set_flags.has.field) return false;
+  /* TODO: more complete validation.
+   * TODO: re-enable this check when we properly set this flag. */
+  //if(!d->set_flags.has.field) return false;
 
   upb_inttable_init(&m->fields_by_num, d->field->len,
                     sizeof(struct upb_fieldsbynum_entry));

upb_table.c

@@ -192,7 +192,7 @@ void upb_strtable_insert(struct upb_strtable *t, struct upb_strtable_entry *e)
 }
 
 void *upb_inttable_begin(struct upb_inttable *t) {
-  return upb_inttable_next(t, intent(t, -1));
+  return upb_inttable_next(t, intent(t, 0));
 }
 
 void *upb_inttable_next(struct upb_inttable *t, struct upb_inttable_entry *cur) {
@@ -205,7 +205,7 @@ void *upb_inttable_next(struct upb_inttable *t, struct upb_inttable_entry *cur)
 }
 
 void *upb_strtable_begin(struct upb_strtable *t) {
-  return upb_strtable_next(t, strent(t, -1));
+  return upb_strtable_next(t, strent(t, 0));
 }
 
 void *upb_strtable_next(struct upb_strtable *t, struct upb_strtable_entry *cur) {