1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
#!/usr/bin/env ruby
#
# Created by Luke A. Kanies on 2006-11-24.
# Copyright (c) 2006. All rights reserved.
require 'puppet/gratr/digraph'
require 'puppet/gratr/import'
require 'puppet/gratr/dot'
require 'puppet/relationship'
# This class subclasses a graph class in order to handle relationships
# among resources.
class Puppet::PGraph < GRATR::Digraph
# This is the type used for splicing.
attr_accessor :container_type
include Puppet::Util
def add_edge!(*args)
@reversal = nil
super
end
def add_vertex!(*args)
@reversal = nil
super
end
def clear
@vertex_dict.clear
if defined? @edge_number
@edge_number.clear
end
end
# Which resources a given resource depends upon.
def dependents(resource)
tree_from_vertex2(resource).keys
end
# Which resources depend upon the given resource.
def dependencies(resource)
# Cache the reversal graph, because it's somewhat expensive
# to create.
unless defined? @reversal and @reversal
@reversal = reversal
end
# Strangely, it's significantly faster to search a reversed
# tree in the :out direction than to search a normal tree
# in the :in direction.
@reversal.tree_from_vertex2(resource, :out).keys
#tree_from_vertex2(resource, :in).keys
end
# Override this method to use our class instead.
def edge_class()
Puppet::Relationship
end
# Determine all of the leaf nodes below a given vertex.
def leaves(vertex, type = :dfs)
tree = tree_from_vertex(vertex, type)
l = tree.keys.find_all { |c| adjacent(c, :direction => :out).empty? }
return l
end
# Collect all of the edges that the passed events match. Returns
# an array of edges.
def matching_edges(source, events)
unless vertex?(source)
Puppet.warning "Got an event from invalid vertex %s" % source.ref
return []
end
events.collect do |event|
# Get all of the edges that this vertex should forward events
# to, which is the same thing as saying all edges directly below
# This vertex in the graph.
adjacent(source, :direction => :out, :type => :edges).find_all do |edge|
edge.match?(event.event)
end.each { |edge|
target = edge.target
if target.respond_to?(:ref)
source.info "Scheduling %s of %s" %
[edge.callback, target.ref]
end
}
end.flatten
end
# Take container information from another graph and use it
# to replace any container vertices with their respective leaves.
# This creates direct relationships where there were previously
# indirect relationships through the containers.
def splice!(other, type)
vertices.each do |vertex|
# Go through each vertex and replace the edges with edges
# to the leaves instead
next unless vertex.is_a?(type)
#oleaves = other.leaves(vertex)
oleaves = other.adjacent(vertex, :direction => :out)
if oleaves.empty?
remove_vertex!(vertex)
next
end
# First create new edges for each of the :in edges
adjacent(vertex, :direction => :in, :type => :edges).each do |edge|
oleaves.each do |leaf|
add_edge!(edge.source, leaf, edge.label)
if cyclic?
raise ArgumentError,
"%s => %s results in a loop" %
[edge.source, leaf]
end
end
end
# Then for each of the out edges
adjacent(vertex, :direction => :out, :type => :edges).each do |edge|
oleaves.each do |leaf|
add_edge!(leaf, edge.target, edge.label)
if cyclic?
raise ArgumentError,
"%s => %s results in a loop" %
[leaf, edge.target]
end
end
end
# And finally, remove the vertex entirely.
remove_vertex!(vertex)
end
end
# For some reason, unconnected vertices do not show up in
# this graph.
def to_jpg(path, name)
gv = vertices()
Dir.chdir(path) do
induced_subgraph(gv).write_to_graphic_file('jpg', name)
end
end
# A different way of walking a tree, and a much faster way than the
# one that comes with GRATR.
def tree_from_vertex2(start, direction = :out)
predecessor={}
walk(start, direction) do |parent, child|
predecessor[child] = parent
end
predecessor
end
# A support method for tree_from_vertex2. Just walk the tree and pass
# the parents and children.
def walk(source, direction, &block)
adjacent(source, :direction => direction).each do |target|
yield source, target
walk(target, direction, &block)
end
end
end
# $Id$
|
