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
|
class Puppet::Parser::AST
# Define a node. The node definition stores a parse tree for each
# specified node, and this parse tree is only ever looked up when
# a client connects.
class NodeDef < AST::Branch
attr_accessor :names, :code, :parentclass, :keyword
def each
[@names,@code].each { |child| yield child }
end
# Do implicit iteration over each of the names passed.
def evaluate(hash)
scope = hash[:scope]
names = @names.safeevaluate(:scope => scope)
unless names.is_a?(Array)
names = [names]
end
names.each { |name|
#Puppet.debug("defining host '%s' in scope %s" %
# [name, scope.object_id])
# We use 'type' here instead of name, because every component
# type supports both 'type' and 'name', and 'type' is a more
# appropriate description of the syntactic role that this term
# plays.
arghash = {
:type => name,
:code => @code
}
if @parentclass
arghash[:parentclass] = @parentclass.safeevaluate(:scope => scope)
end
begin
node = Node.new(arghash)
node.keyword = true
scope.setnode(name, node)
rescue Puppet::ParseError => except
except.line = self.line
except.file = self.file
raise except
rescue => detail
error = Puppet::ParseError.new(detail)
error.line = self.line
error.file = self.file
raise error
end
}
end
def initialize(hash)
@parentclass = nil
@keyword = "node"
super
end
def tree(indent = 0)
return [
@names.tree(indent + 1),
((@@indline * 4 * indent) + self.typewrap("node")),
@code.tree(indent + 1),
].join("\n")
end
def to_s
return "node %s {\n%s }" % [@name, @code]
end
end
end
|
