build-graph 0.1.0 → 0.3.0

data/lib/build/version.rb

@@ -1,3 +0,0 @@
-module Build
-	VERSION = "0.1.0"
-end

data/lib/build/walker.rb

@@ -1,175 +0,0 @@
-
-require 'set'
-
-require 'build/error'
-
-module Build
-	# A walker walks over a graph and applies a task to each node.
-	class Walker
-		def initialize(graph, &task)
-			@graph = graph
-			@task = task
-			
-			@count = 0
-			
-			@outputs = {}
-			@dirty = Set.new
-			
-			# Generate a list of dirty outputs, possibly a subset, if the build graph might generate additional nodes:
-			@graph.nodes.each do |key, node|
-				# For a given child, a list of any parents waiting on it.
-				if node.dirty?
-					@dirty << node
-					
-					@outputs[node] = []
-					
-					node.outputs.each do |output|
-						@outputs[output] = []
-					end
-				end
-			end
-			
-			@parents = {}
-			
-			# Failed output paths:
-			@failed = Set.new
-		end
-		
-		attr :graph
-		attr :output
-		
-		attr_accessor :count
-		
-		attr :dirty
-		attr :parents
-		
-		def task(*arguments)
-			@task.call(self, *arguments)
-		end
-		
-		def wait_on_paths(paths)
-			edge = Edge.new
-			failed = false
-			
-			paths.each do |path|
-				if @outputs.include? path
-					@outputs[path] << edge
-					
-					edge.increment!
-				end
-				
-				if !failed and @failed.include?(path)
-					failed = true
-				end
-			end
-			
-			edge.wait || failed
-		end
-		
-		def wait_for_nodes(children)
-			edge = Edge.new
-			
-			children.each do |child|
-				if @dirty.include?(child)
-					edge.increment!
-					
-					@parents[child] ||= []
-					@parents[child] << edge
-				end
-			end
-			
-			edge.wait
-		end
-		
-		def exit(node)
-			@dirty.delete(node)
-			
-			# Fail outputs if the node failed:
-			@failed += node.outputs if node.failed?
-			
-			# Clean the node's outputs:
-			node.outputs.each do |path|
-				if edges = @outputs.delete(path)
-					edges.each{|edge| edge.traverse(node)}
-				end
-			end
-		
-			# Trigger the parent nodes:
-			if parents = @parents.delete(node)
-				parents.each{|edge| edge.traverse(node)}
-			end
-		end
-	end
-	
-	# A task is a specific process and scope applied to a graph node.
-	class Task
-		def initialize(graph, walker, node)
-			@graph = graph
-			@node = node
-			@walker = walker
-			
-			# If the execution of the node fails, this is where we save the error:
-			@error = nil
-			
-			@children = []
-		end
-		
-		attr :children
-		
-		def inputs
-			@node.inputs
-		end
-		
-		def outputs
-			@node.outputs
-		end
-		
-		# Derived task should override this function to provide appropriate behaviour.
-		def visit
-			wait_for_inputs
-			
-			# If all inputs were good, we can update the node.
-			unless any_inputs_failed?
-				begin
-					#self.instance_eval(&update)
-					yield
-				rescue TransientError => error
-					$stderr.puts Rainbow("Error: #{error.inspect}").red
-					@error = error
-				end
-			end
-			
-			wait_for_children
-		end
-		
-		def exit
-			if @error || any_child_failed? || any_inputs_failed?
-				@node.fail!
-			elsif @pool
-				@node.clean!
-			end
-			
-			@walker.exit(@node)
-			
-			@walker.count += 1
-		end
-		
-	protected
-		def wait_for_inputs
-			# Wait on any inputs, returns whether any inputs failed:
-			@inputs_failed = @walker.wait_on_paths(@node.inputs)
-		end
-		
-		def wait_for_children
-			@walker.wait_for_nodes(@children)
-		end
-		
-		def any_child_failed?
-			@children.any?{|child| child.failed?}
-		end
-		
-		def any_inputs_failed?
-			@inputs_failed
-		end
-	end
-end

data/test/program/main.cpp

@@ -1,18 +0,0 @@
-
-#include <iostream>
-#include <vector>
-
-std::vector<int> get_numbers() {
-	return {10, 20, 30, 40, 50, 60, 80};
-}
-
-int main (int argc, char ** argv)
-{
-	auto numbers = get_numbers();
-	std::sort(numbers.begin(), numbers.end());
-	
-	for (auto & number : numbers)
-		std::cerr << number << "?" << std::endl;
-	
-	return 0;
-}

data/test/test_files.rb

@@ -1,74 +0,0 @@
-# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-
-require 'test/unit'
-
-require 'build/files'
-
-class TestFiles < Test::Unit::TestCase
-	def test_inclusion
-		# Glob all test files:
-		glob = Build::Files::Glob.new(__dir__, "*.rb")
-		
-		assert glob.count > 0
-		
-		# Should include this file:
-		assert glob.include?(__FILE__)
-		
-		# Glob should intersect self:
-		assert glob.intersects?(glob)
-	end
-	
-	def test_composites
-		lib = File.join(__dir__, "../lib")
-		
-		test_glob = Build::Files::Glob.new(__dir__, "*.rb")
-		lib_glob = Build::Files::Glob.new(lib, "*.rb")
-		
-		both = test_glob + lib_glob
-		
-		# List#roots is the generic accessor for Lists
-		assert both.roots.include? test_glob.root
-		
-		# The composite should include both:
-		assert both.include?(__FILE__)
-	end
-	
-	def test_roots
-		test_glob = Build::Files::Glob.new(__dir__, "*.rb")
-		
-		# Despite returning a String:
-		assert test_glob.first.kind_of? String
-		
-		# We actually return a subclass which includes the root portion:
-		assert_equal __dir__, test_glob.first.root
-	end
-	
-	def test_renaming
-		program_root = File.join(__dir__, "program")
-		program_glob = Build::Files::Glob.new(program_root, "*.cpp")
-		
-		paths = program_glob.process do |path|
-			path + ".o"
-		end
-		
-		puts "object paths: #{paths} from program paths: #{program_glob.to_a}"
-	end
-end

data/test/test_graph.rb

@@ -1,148 +0,0 @@
-# Copyright, 2012, by Samuel G. D. Williams. <http://www.codeotaku.com>
-# 
-# Permission is hereby granted, free of charge, to any person obtaining a copy
-# of this software and associated documentation files (the "Software"), to deal
-# in the Software without restriction, including without limitation the rights
-# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-# copies of the Software, and to permit persons to whom the Software is
-# furnished to do so, subject to the following conditions:
-# 
-# The above copyright notice and this permission notice shall be included in
-# all copies or substantial portions of the Software.
-# 
-# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-# THE SOFTWARE.
-
-require 'test/unit'
-
-require 'build/graph'
-require 'build/files'
-
-require 'process/group'
-require 'fileutils'
-
-class TestGraph < Test::Unit::TestCase
-	# The graph node is created once, so a graph has a fixed number of nodes, which store per-vertex state and connectivity.
-	class Node < Build::Node
-		def initialize(graph, inputs, outputs, &update)
-			@update = update
-			
-			super(graph, inputs, outputs)
-		end
-		
-		def apply!(scope)
-			scope.instance_eval(&@update)
-		end
-		
-		# This ensures that enclosed nodes are run if they are dirty. The top level node has no inputs or outputs by default, so children who become dirty wouldn't mark it as dirty and thus wouldn't be run.
-		def requires_update?
-			if outputs.count == 0
-				return true
-			else
-				super
-			end
-		end
-	end
-	
-	# The task is the context in which a vertex is updated. Because nodes may initially create other nodes, it is also responsible for looking up and creating new nodes.
-	class Task < Build::Task
-		def initialize(graph, walker, node, group = nil)
-			super(graph, walker, node)
-			
-			@group = group
-		end
-		
-		def wet?
-			@group# and @node.dirty?
-		end
-		
-		def process(inputs, outputs, &block)
-			child_node = @graph.nodes.fetch([inputs, outputs]) do |key|
-				@graph.nodes[key] = Node.new(@graph, inputs, outputs, &block)
-			end
-		
-			@children << child_node
-		
-			# State saved in update!
-			child_node.update!(@walker)
-		end
-		
-		def run(*arguments)
-			if wet?
-				status = @group.spawn(*arguments)
-				
-				if status != 0
-					raise RuntimeError.new(status)
-				end
-			end
-		end
-		
-		def visit
-			super do
-				@node.apply!(self)
-			end
-		end
-	end
-	
-	class Graph < Build::Graph
-		def initialize(&block)
-			@top = Node.new(self, Build::Files::NONE, Build::Files::NONE, &block)
-			
-			super()
-		end
-		
-		attr_accessor :top
-		
-		def traverse!(walker)
-			@top.update!(walker)
-		end
-		
-		def build_graph!
-			super do |walker, node|
-				Task.new(self, walker, node)
-			end
-		end
-		
-		def update!
-			group = Process::Group.new
-			
-			super do |walker, node|
-				Task.new(self, walker, node, group)
-			end
-			
-			group.wait
-		end
-	end
-	
-	def test_minimal_graph
-		test_glob = Build::Files::Glob.new(__dir__, "*.rb")
-		output_paths = Build::Files::Paths.new(__dir__, ["listing.txt"])
-		
-		FileUtils.rm_f output_paths.to_a
-		
-		graph = Graph.new do
-			process test_glob, output_paths do
-				run("ls", "-la", *test_glob, :out => output_paths.first)
-			end
-		end
-		
-		graph.update!
-		
-		mtime = File.mtime(output_paths.first)
-		
-		graph.update!
-		
-		assert_equal mtime, File.mtime(output_paths.first)
-		
-		FileUtils.rm_f output_paths.to_a
-		
-		#graph.nodes.each do |key, node|
-		#	puts "#{node.status} #{node.inspect}"
-		#end
-	end
-end