rbf 0.0.4 → 0.0.5

data/lib/rbf/interpreter/extensions.rb

@@ -0,0 +1,31 @@
+#--
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#                   Version 2, December 2004
+#
+#  Copyleft meh. [http://meh.paranoid.pk | meh@paranoici.org]
+#
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+#
+#  0. You just DO WHAT THE FUCK YOU WANT TO.
+#++
+
+require 'stringio'
+
+class IO
+  begin
+    require 'Win32API'
+
+    def read_char
+      Win32API.new('crtdll', '_getch', [], 'L').Call
+    end
+  rescue LoadError
+    def read_char
+      system 'stty raw -echo'
+
+      STDIN.getc
+    ensure
+      system 'stty -raw echo'
+    end
+  end
+end

data/lib/rbf/interpreter/storage.rb

@@ -0,0 +1,73 @@
+#--
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#                   Version 2, December 2004
+#
+#  Copyleft meh. [http://meh.paranoid.pk | meh@paranoici.org]
+#
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+#
+#  0. You just DO WHAT THE FUCK YOU WANT TO.
+#++
+
+module RBF; class Interpreter
+
+class Storage < Hash
+  attr_accessor :position
+
+  def initialize (data)
+    if data.is_a?(Array)
+      parent = {}
+
+      data.each_with_index {|value, index|
+        parent[index] = value
+      }
+
+      super(parent)
+    else
+      super
+    end
+
+    @position = 0
+  end
+
+  def check!
+    unless self[@position].is_a?(Integer)
+      self[@position] = 0
+    end
+  end
+
+  def forward!
+    @position += 1
+  end
+
+  def backward!
+    @position -= 1
+  end 
+
+  def increase!
+    check!
+
+    self[@position] += 1
+  end
+
+  def decrease!
+    check!
+
+    self[@position] -= 1
+  end
+
+  def set (value, position=nil)
+    self[position ? position.to_i : @position.to_i] = value.ord
+  end
+
+  def get (position=nil)
+    self[position ? position.to_i : @position.to_i].to_i rescue 0
+  end
+
+  def inspect
+    "#<Storage(#{position}): #{super}>"
+  end
+end
+
+end; end

data/lib/rbf/interpreter.rb

@@ -10,87 +10,12 @@
 #  0. You just DO WHAT THE FUCK YOU WANT TO.
 #++
 
-require 'stringio'
-
-class IO
-  begin
-    require 'Win32API'
-
-    def read_char
-      Win32API.new('crtdll', '_getch', [], 'L').Call
-    end
-  rescue LoadError
-    def read_char
-      system 'stty raw -echo'
-
-      STDIN.getc
-    ensure
-      system 'stty -raw echo'
-    end
-  end
-end
+require 'rbf/interpreter/extensions'
+require 'rbf/interpreter/storage'
 
 module RBF
 
 class Interpreter
-  class Storage < Hash
-    attr_reader :position
-
-    def initialize (data)
-      if data.is_a?(Array)
-        parent = {}
-
-        data.each_with_index {|value, index|
-          parent[index] = value
-        }
-
-        super(parent)
-      else
-        super
-      end
-
-      @position = 0
-    end
-
-    def check!
-      unless self[@position].is_a?(Integer)
-        self[@position] = 0
-      end
-    end
-
-    def forward!
-      @position += 1
-    end
-
-    def backward!
-      @position -= 1
-    end 
-
-    def increase!
-      check!
-
-      self[@position] += 1
-    end
-
-    def decrease!
-      check!
-
-      self[@position] -= 1
-    end
-
-    def set (value, position=nil)
-      self[position || @position] = value.ord
-    end
-
-    def get (position=nil)
-      self[position || @position].to_i rescue 0
-    end
-
-    def inspect
-      "#<Storage(#{position}): #{super}>"
-    end
-  end
-
   attr_reader :options, :storage
 
   def initialize (options={})
@@ -103,6 +28,7 @@ class Interpreter
     @parser    = RBF::Parser.syntax(RBF.syntax(options[:syntax])).new
     @transform = RBF::Transform.new
     @optimizer = RBF::Optimizer.new(options)
+    @jit       = RBF::JIT.new(options)
   end
   
   def parse (text)
@@ -116,7 +42,7 @@ class Interpreter
   end
 
   def evaluate (tree, options=nil)
-    options ||= {}
+    options = @options.merge(options || {})
 
     if options[:catch]
       @output = StringIO.new
@@ -124,6 +50,12 @@ class Interpreter
       @output = STDOUT
     end
 
+    tree = parse(tree)
+
+    if JIT.supported? && !options[:catch]
+      return @jit.compile(tree).execute
+    end
+
     cycle(parse(tree))
 
     if options[:catch]

data/lib/rbf/jit/code.rb

@@ -0,0 +1,34 @@
+#--
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#                   Version 2, December 2004
+#
+#  Copyleft meh. [http://meh.paranoid.pk | meh@paranoici.org]
+#
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+#
+#  0. You just DO WHAT THE FUCK YOU WANT TO.
+#++
+
+module RBF; class JIT
+
+class Code
+  attr_reader :options
+
+  def initialize (tree, options=nil)
+    @options = options
+
+    @module = LLVM::Module.create('brainfuck')
+    @module.functions.add('self', [], LLVM::Void) do |func|
+      builder = LLVM::Builder.create
+    end
+
+    @module.verify
+  end
+
+  def execute
+    LLVM::ExecutionEngine.create_jit_compiler(@module).run_function(@module.functions['self'])
+  end
+end
+
+end; end

data/lib/rbf/jit.rb

@@ -0,0 +1,47 @@
+#--
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#                   Version 2, December 2004
+#
+#  Copyleft meh. [http://meh.paranoid.pk | meh@paranoici.org]
+#
+#           DO WHAT THE FUCK YOU WANT TO PUBLIC LICENSE
+#  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+#
+#  0. You just DO WHAT THE FUCK YOU WANT TO.
+#++
+
+require 'memoized'
+
+module RBF
+
+class JIT
+  class << self
+    memoize
+    def supported?
+      raise
+
+      require 'llvm'
+      require 'llvm/core'
+      require 'llvm/execution_engine'
+      require 'llvm/transforms/scalar'
+      
+      LLVM.init_x86
+
+      true
+    rescue
+      false
+    end
+  end
+
+  attr_reader :options
+
+  def initialize (options)
+    @options = options
+  end
+
+  def compile (tree)
+    Code.new(tree, options)
+  end
+end
+
+end

data/lib/rbf/optimizer.rb

@@ -16,15 +16,20 @@ class Optimizer
   class Algorithm
     attr_reader :optimizer
 
-    def initialize (optimizer)
+    def initialize (optimizer, &block)
       @optimizer = optimizer
+      @block     = block
     end
 
     def optimize (tree)
-      nil
+      self.instance_exec(tree, &@block)
     end
   end
 
+  def self.optimization (name, &block)
+    (@@optimizations ||= []) << [name, block]
+  end
+
   attr_reader :options
 
   def initialize (options={})
@@ -35,38 +40,66 @@ class Optimizer
     result = tree.clone
 
     algorithms.each {|alg|
-      alg.new(self).optimize(result)
+      alg.optimize(result)
     }
 
     result
   end
 
   def algorithms
-    Optimizer.constants.map {|const|
-      Optimizer.const_get(const) unless options[const.to_s.downcase.to_sym] == false
+    @@optimizations.map {|(name, block)|
+      Algorithm.new(self, &block) unless options[name] == false
     }.compact
   end
 
-  class UselessOperations < Algorithm
-    def optimize (tree)
-      i = 0
+  optimization :useless_operations do |tree|
+    i       = 0
+    changed = false
 
-      until i >= tree.length
-        if tree[i].is_a?(Array) && tree[i + 1].is_a?(Array)
-          optimize(tree[i])
-          optimize(tree[i + 1])
+    until i >= tree.length
+      if tree[i].is_a?(Array) && tree[i + 1].is_a?(Array)
+        optimize(tree[i])
+        optimize(tree[i + 1])
 
-          i += 2
-        elsif tree[i].is_a?(Array)
-          optimize(tree[i])
+        i += 2
+      elsif tree[i].is_a?(Array)
+        optimize(tree[i])
 
-          i += 1
-        elsif [[?+, ?-], [?-, ?+], [?>, ?<], [?<, ?>]].member?(tree[i ... i + 2])
-          tree.slice!(i ... i + 2)
+        i += 1
+      elsif [[?+, ?-], [?-, ?+], [?>, ?<], [?<, ?>]].member?(tree[i ... i + 2])
+        tree.slice!(i ... i + 2)
+
+        changed = true
+      else
+        i += 1
+      end
+    end
+
+    optimize(tree) if changed
+  end
+
+  optimization :clear_empty_loops do |tree|
+    i = 0
+
+    until i >= tree.length
+      if !tree[i].is_a?(Array)
+        i += 1
+
+        next
+      else
+        optimize(tree[i])
+
+        if tree[i].empty?
+          unless @warned
+            @warned = true
+            warn 'Optimizing out one or more potentially dangerous empty loops'
+          end
+
+          tree.delete_at(i)
         else
           i += 1
         end
-      end 
+      end
     end
   end
 end

data/lib/rbf/parser.rb

@@ -11,6 +11,7 @@
 #++
 
 require 'parslet'
+require 'parslet/convenience'
 
 module RBF
 

data/lib/rbf.rb

@@ -13,10 +13,9 @@
 require 'rbf/syntax'
 require 'rbf/parser'
 require 'rbf/optimizer'
+require 'rbf/jit'
 require 'rbf/interpreter'
 
-require 'parslet/convenience'
-
 module RBF
   def self.syntax (name)
     name.is_a?(Hash) ? name :
@@ -74,17 +73,21 @@ module RBF
             when 'storage'
               STDOUT.puts interpreter.storage.inspect
 
-            when 'position'
-              STDOUT.puts interpreter.storage.position.to_s.bold
+            when /^position(?:\s+(\d+))?$/
+              if $1
+                interpreter.storage.position = $1
+              else
+                STDOUT.puts interpreter.storage.position.to_s.bold
+              end
 
-            when /^get(?:\s*(\d+))?$/
-              STDOUT.puts "#{($1 || interpreter.storage.position).to_s.bold}: #{interpreter.storage.get($1.to_i)}"
+            when /^get(?:\s+(\d+))?$/
+              STDOUT.puts "#{($1 || interpreter.storage.position).to_s.bold}: #{interpreter.storage.get($1)}"
 
             when /^set(?:\s+(\d+)\s+(\d+))/
               interpreter.storage.set($2.to_i, $1.to_i)
 
             else
-              STDOUT.puts 'Command not found'.red
+              STDOUT.puts 'Command not found or used improperly'.red
           end
         else
           output = interpreter.evaluate(line, interpreter.options.merge(:catch => true))

metadata

@@ -2,7 +2,7 @@
 name: rbf
 version: !ruby/object:Gem::Version 
   prerelease: 
-  version: 0.0.4
+  version: 0.0.5
 platform: ruby
 authors: 
 - meh.
@@ -34,6 +34,17 @@ dependencies:
         version: "0"
   type: :runtime
   version_requirements: *id002
+- !ruby/object:Gem::Dependency 
+  name: memoized
+  prerelease: false
+  requirement: &id003 !ruby/object:Gem::Requirement 
+    none: false
+    requirements: 
+    - - ">="
+      - !ruby/object:Gem::Version 
+        version: "0"
+  type: :runtime
+  version_requirements: *id003
 description: 
 email: meh@paranoici.org
 executables: 
@@ -43,10 +54,14 @@ extensions: []
 extra_rdoc_files: []
 
 files: 
+- lib/rbf/jit.rb
 - lib/rbf/interpreter.rb
+- lib/rbf/interpreter/extensions.rb
+- lib/rbf/interpreter/storage.rb
 - lib/rbf/syntax.rb
 - lib/rbf/parser.rb
 - lib/rbf/optimizer.rb
+- lib/rbf/jit/code.rb
 - lib/rbf.rb
 - bin/rbf
 homepage: http://github.com/meh/rbf