elf-mithril 0.0.1

data/tools/elf_enums.sh

@@ -0,0 +1,26 @@
+#!/bin/bash
+define_enum() {
+echo "class $2 < Enum # $1"
+grep "[[:space:]]$1" elf.h | awk '{print $2, " = ", $3}' 
+echo "end"
+}
+
+define_enum EV_ Version
+define_enum ELFCLASS IdentClass
+define_enum ELFDATA IdentData
+define_enum ELFOSABI OsAbi
+define_enum ET_ Type
+define_enum EM_ Machine
+define_enum SHN_ SpecialSection
+define_enum SHT_ SectionType
+define_enum SHF_ SectionFlags
+define_enum PT_ PhdrType
+define_enum PF_ PhdrFlags
+define_enum DT_ DynamicType
+define_enum DF_ DynamicFlags
+define_enum NT_ CoreNType
+define_enum STB_ SymbolBinding
+define_enum STT_ SymbolType
+define_enum STV_ SymbolVisibility
+define_enum STN_ SymbolName
+define_enum R_ Relocation

data/tools/elf_h_processor.sh

@@ -0,0 +1,5 @@
+#!/bin/bash
+# One time use more less  - quick editor script to parse elf.h  (from
+# FreeBSD or go) into ruby-esque DSL
+sed -e 's/\_/ /' -e 's/\;//g'  | awk '{printf "%s :%s #", tolower($2) ,$3; for(i=5;i<NF;i++) printf "%s ", $i; printf "\n"}'   
+

data/tools/elf_structs.sh

@@ -0,0 +1 @@
+#!/bin/bash

data/tools/gnu_elf_hash_test.cxx

@@ -0,0 +1,22 @@
+#include <stdio.h>
+#include  <stdint.h>
+uint32_t
+dl_new_hash (const char *s)
+{
+        uint32_t h = 5381;
+
+        for (unsigned char c = *s; c != '\0'; c = *++s)
+                h = h * 33 + c;
+
+        return h;
+}
+
+int main(){
+  while(!feof(stdin)){
+    char buf[1024];
+    scanf("%1024s",buf);
+    unsigned long ehash1 = dl_new_hash(buf);
+    printf("%lu \n",ehash1);
+  }
+}
+

data/tools/hash_test.c

@@ -0,0 +1,70 @@
+#include <stdio.h>
+unsigned long
+elf_hash(const unsigned char *name)
+{
+  unsigned long h = 0, g;
+  while (*name)
+    {
+      h = (h << 4) + *name++;
+      if (g = h & 0xf0000000)
+        h ^= g >> 24;
+      h &= ~g;
+    }
+  return h;
+}
+static unsigned int
+_dl_elf_hash (const char *name_arg)
+{
+  const unsigned char *name = (const unsigned char *) name_arg;
+  unsigned long int hash = *name;
+  if (hash != 0 && name[1] != '\0')
+    {
+      hash = (hash << 4) + name[1];
+      if (name[2] != '\0')
+        {
+          hash = (hash << 4) + name[2];
+          if (name[3] != '\0')
+            {
+              hash = (hash << 4) + name[3];
+              if (name[4] != '\0')
+                {
+                  hash = (hash << 4) + name[4];
+                  name += 5;
+                  while (*name != '\0')
+                    {
+                      unsigned long int hi;
+                      hash = (hash << 4) + *name++;
+                      hi = hash & 0xf0000000;
+    
+                      /* The algorithm specified in the ELF ABI is as
+                         follows:
+    
+                         if (hi != 0)
+                           hash ^= hi >> 24;
+    
+                         hash &= ~hi;
+    
+                         But the following is equivalent and a lot
+                         faster, especially on modern processors.  */
+    
+                      hash ^= hi >> 24;
+                    }
+    
+                  /* Second part of the modified formula.  This
+                     operation can be lifted outside the loop.  */
+                  hash &= 0x0fffffff;
+                }
+            }
+        }
+    }
+  return hash;
+}
+int main(){
+  while(!feof(stdin)){
+    char buf[1024];
+    scanf("%1024s",buf);
+    unsigned long ehash1 = elf_hash(buf);
+    unsigned long ehash2 = _dl_elf_hash(buf);
+    printf("%lu\t %lu \n",ehash1,ehash2);
+  }
+}

metadata

@@ -0,0 +1,192 @@
+--- !ruby/object:Gem::Specification
+name: elf-mithril
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+  prerelease: 
+platform: ruby
+authors:
+- Julian Bangert
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2013-09-12 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.3'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: bindata
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 1.5.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: 1.5.0
+- !ruby/object:Gem::Dependency
+  name: renum
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 1.4.0
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - '='
+      - !ruby/object:Gem::Version
+        version: 1.4.0
+- !ruby/object:Gem::Dependency
+  name: andand
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: segment_tree
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: rbtree-pure
+  requirement: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+description: In Soviet Russia, Mithril forges Elf
+email:
+- jbangert@acm.org
+executables:
+- mithril-ld
+- mithril-rewrite
+- mithril-section-symbols
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/mithril-ld
+- bin/mithril-rewrite
+- bin/mithril-section-symbols
+- lib/mithril.rb
+- lib/mithril/elf.rb
+- lib/mithril/elf_enums.rb
+- lib/mithril/elf_generative.rb
+- lib/mithril/elf_structs.rb
+- lib/mithril/inject_symbols.rb
+- lib/mithril/parser.rb
+- lib/mithril/policy.rb
+- lib/mithril/version.rb
+- lib/mithril/writer.rb
+- lib/mithril/writer2.rb
+- mithril.gemspec
+- test/hash_test.rb
+- tools/#elf_enums.sh#
+- tools/elf.h
+- tools/elf_enums.sh
+- tools/elf_h_processor.sh
+- tools/elf_structs.sh
+- tools/gnu_elf_hash_test
+- tools/gnu_elf_hash_test.cxx
+- tools/hash_test
+- tools/hash_test.c
+homepage: ''
+licenses:
+- MIT
+post_install_message: 
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  none: false
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 1.8.23
+signing_key: 
+specification_version: 3
+summary: The Mithril toolkit for canonical elf manipulation
+test_files:
+- test/hash_test.rb