furnace 0.3.1 → 0.4.0.beta.1

data/test/test_helper.rb

@@ -1,36 +1,25 @@
-$LOAD_PATH << File.expand_path('../../lib', __FILE__)
+require 'bacon'
+require 'bacon/colored_output'
 
-require 'furnace'
-include Furnace
+class Should
+  def enumerate(iterator, array)
+    enum = @object.send(iterator)
 
-module Bacon
-  module ColoredOutput
-    def handle_specification(name)
-      puts spaces + name
-      yield
-      puts if Counter[:context_depth] == 1
+    satisfy("##{iterator} should return an Enumerator, returns #{enum.class}") do
+      enum.instance_of? Enumerator
     end
 
-    def handle_requirement(description)
-      print spaces
-
-      error = yield
-
-      print error.empty? ? "\e[32m" : "\e[1;31m"
-      print "  - #{description}"
-      puts error.empty? ? "\e[0m" : " [#{error}]\e[0m"
+    values = enum.to_a
+    satisfy("##{iterator} should yield #{array.inspect}, yields #{values.inspect}") do
+      (values - array).empty? && (array - values).empty?
     end
+  end
+end
 
-    def handle_summary
-      print ErrorLog  if Backtraces
-      puts "%d specifications (%d requirements), %d failures, %d errors" %
-        Counter.values_at(:specifications, :requirements, :failed, :errors)
-    end
+require 'simplecov'
+SimpleCov.start
 
-    def spaces
-      "  " * (Counter[:context_depth] - 1)
-    end
-  end
+$LOAD_PATH << File.expand_path('../../lib', __FILE__)
 
-  extend ColoredOutput
-end
+require 'furnace'
+include Furnace

data/test/transform_test.rb

@@ -0,0 +1,74 @@
+require_relative 'test_helper'
+
+describe Transform do
+  class Context
+    attr_accessor :value
+
+    def initialize(value)
+      @value = value
+    end
+  end
+
+  class Pass
+    attr_accessor :run_count
+
+    def initialize
+      @run_count = 0
+    end
+
+    def run(context)
+      @run_count += 1
+
+      if context.value > 0
+        context.value -= 1
+        true
+      else
+        false
+      end
+    end
+  end
+
+  before do
+    @context = Context.new(3)
+    @pass    = Pass.new
+  end
+
+  describe Transform::Pipeline do
+    should 'run all stages' do
+      pipeline = Transform::Pipeline.new([ @pass ] * 4)
+      pipeline.run(@context)
+
+      @context.value.should == 0
+      @pass.run_count.should == 4
+    end
+  end
+
+  describe Transform::Iterative do
+    should 'run until nothing changes' do
+      pipeline = Transform::Iterative.new([ @pass ] * 2)
+      pipeline.run(@context)
+
+      # [
+      #   3 pass 2 -> true
+      #   2 pass 1 -> true
+      # ]
+      # [
+      #   1 pass 0 -> true
+      #   0 pass 0 -> false
+      # ]
+      # [
+      #   0 pass 0 -> false
+      #   0 pass 0 -> false
+      # ]
+
+      @context.value.should == 0
+      @pass.run_count.should == 6
+    end
+
+    should 'signal if any changes were made' do
+      pipeline = Transform::Iterative.new([ @pass ] * 3)
+      pipeline.run(@context).should == true
+      pipeline.run(@context).should == false
+    end
+  end
+end

metadata

@@ -1,92 +1,150 @@
 --- !ruby/object:Gem::Specification
 name: furnace
 version: !ruby/object:Gem::Version
-  version: 0.3.1
-  prerelease: 
+  prerelease: 6
+  version: 0.4.0.beta.1
 platform: ruby
 authors:
 - Peter Zotov
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2012-12-02 00:00:00.000000000 Z
+date: 2013-01-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
-  name: rake
-  requirement: !ruby/object:Gem::Requirement
+  name: ansi
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: !binary |-
+          MA==
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
+        version: !binary |-
+          MA==
+    none: false
   prerelease: false
+  type: :runtime
+- !ruby/object:Gem::Dependency
+  name: rake
   version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '0'
+        version: '10.0'
+    none: false
+  prerelease: false
+  type: :development
 - !ruby/object:Gem::Dependency
   name: bacon
-  requirement: !ruby/object:Gem::Requirement
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.2'
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ~>
+    - - "~>"
       - !ruby/object:Gem::Version
-        version: '1.1'
-  type: :development
+        version: '1.2'
+    none: false
   prerelease: false
+  type: :development
+- !ruby/object:Gem::Dependency
+  name: bacon-colored_output
   version_requirements: !ruby/object:Gem::Requirement
-    none: false
     requirements:
-    - - ~>
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '1.1'
-- !ruby/object:Gem::Dependency
-  name: yard
-  requirement: !ruby/object:Gem::Requirement
+        version: !binary |-
+          MA==
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
+        version: !binary |-
+          MA==
+    none: false
   prerelease: false
+  type: :development
+- !ruby/object:Gem::Dependency
+  name: simplecov
   version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: !binary |-
+          MA==
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
+        version: !binary |-
+          MA==
+    none: false
+  prerelease: false
+  type: :development
 - !ruby/object:Gem::Dependency
-  name: redcarpet
-  requirement: !ruby/object:Gem::Requirement
+  name: yard
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: !binary |-
+          MA==
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
-  type: :development
+        version: !binary |-
+          MA==
+    none: false
   prerelease: false
+  type: :development
+- !ruby/object:Gem::Dependency
+  name: kramdown
   version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: !binary |-
+          MA==
     none: false
+  requirement: !ruby/object:Gem::Requirement
     requirements:
-    - - ! '>='
+    - - ">="
       - !ruby/object:Gem::Version
-        version: '0'
-description: Furnace is a static code analysis framework for dynamic languages, aimed
-  at efficient type and behavior inference.
+        version: !binary |-
+          MA==
+    none: false
+  prerelease: false
+  type: :development
+description: Furnace is a static code analysis framework for dynamic languages, aimed at efficient type and behavior inference.
 email:
 - whitequark@whitequark.org
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
-- .gitignore
-- .yardopts
+- ".gitignore"
+- ".travis.yml"
+- ".yardopts"
 - Gemfile
-- LICENSE
+- LICENSE.MIT
 - Rakefile
 - furnace.gemspec
 - lib/furnace.rb
@@ -94,45 +152,65 @@ files:
 - lib/furnace/ast/node.rb
 - lib/furnace/ast/processor.rb
 - lib/furnace/ast/sexp.rb
-- lib/furnace/cfg.rb
-- lib/furnace/cfg/algorithms.rb
-- lib/furnace/cfg/graph.rb
-- lib/furnace/cfg/node.rb
 - lib/furnace/graphviz.rb
-- lib/furnace/transform/iterative_process.rb
+- lib/furnace/ssa.rb
+- lib/furnace/ssa/argument.rb
+- lib/furnace/ssa/basic_block.rb
+- lib/furnace/ssa/builder.rb
+- lib/furnace/ssa/constant.rb
+- lib/furnace/ssa/function.rb
+- lib/furnace/ssa/generic_instruction.rb
+- lib/furnace/ssa/generic_type.rb
+- lib/furnace/ssa/instruction.rb
+- lib/furnace/ssa/instruction_syntax.rb
+- lib/furnace/ssa/instructions/branch.rb
+- lib/furnace/ssa/instructions/phi.rb
+- lib/furnace/ssa/instructions/return.rb
+- lib/furnace/ssa/module.rb
+- lib/furnace/ssa/named_value.rb
+- lib/furnace/ssa/pretty_printer.rb
+- lib/furnace/ssa/terminator_instruction.rb
+- lib/furnace/ssa/type.rb
+- lib/furnace/ssa/types/basic_block.rb
+- lib/furnace/ssa/types/function.rb
+- lib/furnace/ssa/types/void.rb
+- lib/furnace/ssa/user.rb
+- lib/furnace/ssa/value.rb
+- lib/furnace/transform/iterative.rb
 - lib/furnace/transform/pipeline.rb
 - lib/furnace/version.rb
 - test/ast_test.rb
+- test/ssa_test.rb
 - test/test_helper.rb
+- test/transform_test.rb
 homepage: http://github.com/whitequark/furnace
 licenses: []
-post_install_message: 
+post_install_message:
 rdoc_options: []
 require_paths:
 - lib
 required_ruby_version: !ruby/object:Gem::Requirement
-  none: false
   requirements:
-  - - ! '>='
+  - - ">="
     - !ruby/object:Gem::Version
-      version: '0'
       segments:
       - 0
-      hash: -2809790994543949274
-required_rubygems_version: !ruby/object:Gem::Requirement
+      hash: 2
+      version: !binary |-
+        MA==
   none: false
+required_rubygems_version: !ruby/object:Gem::Requirement
   requirements:
-  - - ! '>='
+  - - !binary |-
+      Pg==
     - !ruby/object:Gem::Version
-      version: '0'
-      segments:
-      - 0
-      hash: -2809790994543949274
+      version: 1.3.1
+  none: false
 requirements: []
-rubyforge_project: 
-rubygems_version: 1.8.23
-signing_key: 
+rubyforge_project:
+rubygems_version: 1.8.24
+signing_key:
 specification_version: 3
 summary: A static code analysis framework
 test_files: []
-has_rdoc: 
+has_rdoc:

data/lib/furnace/cfg/algorithms.rb

@@ -1,193 +0,0 @@
-module Furnace::CFG
-  module Algorithms
-    def eliminate_unreachable!
-      worklist  = Set[ entry, exit ]
-      reachable = Set[]
-
-      while worklist.any?
-        node = worklist.first
-        worklist.delete node
-        reachable.add node
-
-        node.targets.each do |target|
-          unless reachable.include? target
-            worklist.add target
-          end
-        end
-
-        if node.exception
-          unless reachable.include? node.exception
-            worklist.add node.exception
-          end
-        end
-      end
-
-      @nodes.each do |node|
-        unless reachable.include? node
-          @nodes.delete node
-          yield node if block_given?
-        end
-      end
-
-      flush
-    end
-
-    def merge_redundant!
-      worklist = @nodes.dup
-      while worklist.any?
-        node = worklist.first
-        worklist.delete node
-
-        target = node.targets[0]
-        next if target == @exit
-
-        # Skip explicitly non-redundant nodes
-        if node.metadata[:keep]
-          next
-        end
-
-        if node.targets.uniq == [target] &&
-            target.sources.uniq == [node] &&
-            node.exception == target.exception
-
-          yield node, target if block_given?
-
-          node.insns.delete node.cti
-          @nodes.delete target
-          worklist.delete target
-
-          node.insns.concat target.insns
-          node.cti           = target.cti
-          node.target_labels = target.target_labels
-
-          worklist.add node
-
-          flush
-        elsif node.targets.count == 1 &&
-            node.insns.empty?
-
-          target = node.targets.first
-
-          yield target, node if block_given?
-
-          node.sources.each do |source|
-            index = source.targets.index(node)
-            source.target_labels[index] = target.label
-          end
-
-          @nodes.delete node
-          worklist.delete node
-
-          if @entry == node
-            @entry = target
-          end
-
-          flush
-        end
-      end
-    end
-
-    # Shamelessly stolen from
-    # http://www.cs.colostate.edu/~mstrout/CS553/slides/lecture04.pdf
-    def compute_generic_domination(start, forward)
-      # values of β will give rise to dom!
-      dom = { start => Set[start] }
-
-      @nodes.each do |node|
-        next if node == start
-        dom[node] = @nodes.dup
-      end
-
-      change = true
-      while change
-        change = false
-        @nodes.each do |node|
-          next if node == start
-
-          # Are we computing dominators or postdominators?
-          if forward
-            edges = node.sources + node.exception_sources
-          elsif node.exception.nil?
-            edges = node.targets
-          else
-            edges = node.targets + [ node.exception ]
-          end
-
-          #   Key Idea [for dominators]
-          # If a node dominates all
-          # predecessors of node n, then it
-          # also dominates node n.
-          pred = edges.map do |source|
-            dom[source]
-          end.reduce(:&)
-
-          # An exception handler header node has no regular sources.
-          pred = [] if pred.nil?
-
-          current = Set[node].merge(pred)
-          if current != dom[node]
-            dom[node] = current
-            change = true
-          end
-        end
-      end
-
-      dom
-    end
-
-    def dominators
-      @dominators ||= compute_generic_domination(@entry, true)
-    end
-
-    def postdominators
-      @postdominators ||= compute_generic_domination(@exit, false)
-    end
-
-    # See also {#dominators} for references.
-    def identify_loops
-      loops = Hash.new { |h,k| h[k] = Set.new }
-
-      dom = dominators
-
-      @nodes.each do |node|
-        node.targets.each do |target|
-          #   Back edges
-          # A back edge of a natural loop is one whose
-          # target dominates its source.
-          if dom[node].include? target
-            loops[target].add node
-          end
-        end
-      end
-
-      # At this point, +loops+ contains a list of all nodes
-      # which have a back edge to the loop header. Expand
-      # it to the list of all nodes in the loop.
-      loops.each do |header, nodes|
-        #   Natural loop
-        # The natural loop of a back edge (m→n), where
-        # n dominates m, is the set of nodes x such that n
-        # dominates x and there is a path from x to m not
-        # containing n.
-        pre_header = dom[header]
-        all_nodes  = Set[header]
-
-        nodes.each do |node|
-          all_nodes.merge(dom[node] - pre_header)
-        end
-
-        nodes.replace all_nodes
-      end
-
-      loops.default = nil
-      loops
-    end
-
-    def flush
-      @dominators = nil
-      @postdominators = nil
-
-      super if defined?(super)
-    end
-  end
-end

data/lib/furnace/cfg/graph.rb

@@ -1,99 +0,0 @@
-module Furnace::CFG
-  class Graph
-    include Algorithms
-
-    attr_reader   :nodes
-    attr_accessor :entry, :exit
-
-    def initialize
-      @nodes = Set.new
-
-      @source_map = nil
-      @label_map  = {}
-    end
-
-    def find_node(label)
-      if node = @label_map[label]
-        node
-      elsif node = @nodes.find { |n| n.label == label }
-        @label_map[label] = node
-        node
-      else
-        raise "Cannot find CFG node #{label}"
-      end
-    end
-
-    def sources_for(node, find_exceptions=false)
-      unless @source_map
-        @source_map = Hash.new { |h, k| h[k] = [] }
-        @exception_source_map = Hash.new { |h, k| h[k] = [] }
-
-        @nodes.each do |node|
-          node.targets.each do |target|
-            @source_map[target] << node
-          end
-
-          @exception_source_map[node.exception] << node
-        end
-
-        @source_map.each do |node, sources|
-          sources.freeze
-        end
-
-        @exception_source_map.each do |node, sources|
-          sources.freeze
-        end
-      end
-
-      if find_exceptions
-        @exception_source_map[node]
-      else
-        @source_map[node]
-      end
-    end
-
-    def flush
-      @source_map = nil
-      @label_map.clear
-
-      super if defined?(super)
-    end
-
-    def to_graphviz
-      Furnace::Graphviz.new do |graph|
-        @nodes.each do |node|
-          if node.label == nil
-            contents = "<exit>"
-          else
-            contents = "<#{node.label.inspect}>"
-          end
-
-          if node.metadata.any?
-            contents << "\n#{node.metadata.inspect}"
-          end
-
-          if node.insns.any?
-            contents << "\n#{node.insns.map(&:inspect).join("\n")}"
-          end
-
-          options = {}
-          if @entry == node
-            options.merge! color: 'green'
-          elsif @exit == node
-            options.merge! color: 'red'
-          end
-
-          graph.node node.label, contents, options
-
-          node.target_labels.each_with_index do |label, idx|
-            graph.edge node.label, label, "#{idx}"
-          end
-
-          if node.exception_label
-            graph.edge node.label, node.exception_label, "", color: 'orange'
-          end
-        end
-      end
-    end
-  end
-end