rely on sorted compiled binary array.

`builtin_binary` is sorted by miniruby loading order and this
loading order should be same on ruby. So we can believe sorted
order of `builtin_binary` on boot time.

1 files changed, 15 insertions, 4 deletions

diff --git a/builtin.c b/builtin.c
index 304d7c2087..67b43c7f5c 100644
--- a/builtin.c
+++ b/builtin.c
@@ -15,10 +15,21 @@
 static const unsigned char*
 builtin_lookup(const char *feature, size_t *psize)
 {
-    for (int i=0; i<BUILTIN_BINARY_SIZE; i++) {
-        if (strcmp(builtin_binary[i].feature, feature) == 0) {
-            *psize = builtin_binary[i].bin_size;
-            return builtin_binary[i].bin;
+    static int index = 0;
+    int i = index++;
+
+    // usually, `builtin_binary` order is loading order at miniruby.
+    if (LIKELY(strcmp(builtin_binary[i].feature, feature) == 0)) {
+      found:
+        *psize = builtin_binary[i].bin_size;
+        return builtin_binary[i].bin;
+    }
+    else {
+        if (0) fprintf(stderr, "builtin_lookup: cached index miss (index:%d)\n", i);
+        for (i=0; i<BUILTIN_BINARY_SIZE; i++) {
+            if (strcmp(builtin_binary[i].feature, feature) == 0) {
+                goto found;
+            }
         }
     }
     rb_bug("builtin_lookup: can not find %s\n", feature);