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
|
require 'puppet/parser/ast/branch'
class Puppet::Parser::AST
# The basic container class. This object behaves almost identically
# to a normal array except at initialization time. Note that its name
# is 'AST::ASTArray', rather than plain 'AST::Array'; I had too many
# bugs when it was just 'AST::Array', because things like
# 'object.is_a?(Array)' never behaved as I expected.
class ASTArray < Branch
include Enumerable
# Return a child by index. Probably never used.
def [](index)
@children[index]
end
# Evaluate our children.
def evaluate(hash)
scope = hash[:scope]
rets = nil
# We basically always operate declaratively, and when we
# do we need to evaluate the settor-like statements first. This
# is basically variable and type-default declarations.
if scope.declarative?
# This is such a stupid hack. I've no real idea how to make a
# "real" declarative language, so I hack it so it looks like
# one, yay.
definelist = [
AST::CompDef, AST::NodeDef, AST::ClassDef
]
setlist = [
AST::VarDef, AST::TypeDefaults, AST::Function
]
definers = []
settors = []
others = []
# Make a new array, so we don't have to deal with the details of
# flattening and such
items = []
# First clean out any AST::ASTArrays
@children.each { |child|
if child.instance_of?(AST::ASTArray)
child.each do |ac|
items << ac
end
else
items << child
end
}
# Now sort them all according to the type of action
items.each { |child|
if definelist.include?(child.class)
definers << child
elsif setlist.include?(child.class)
settors << child
else
others << child
end
}
rets = [definers, settors, others].flatten.collect { |child|
child.safeevaluate(:scope => scope)
}
else
# If we're not declarative, just do everything in order.
rets = @children.collect { |item|
item.safeevaluate(:scope => scope)
}
end
rets = rets.reject { |obj| obj.nil? }
return rets
end
def push(*ary)
ary.each { |child|
#Puppet.debug "adding %s(%s) of type %s to %s" %
# [child, child.object_id, child.class.to_s.sub(/.+::/,''),
# self.object_id]
@children.push(child)
}
return self
end
# Convert to a string. Only used for printing the parse tree.
def to_s
return "[" + @children.collect { |child|
child.to_s
}.join(", ") + "]"
end
# Print the parse tree.
def tree(indent = 0)
#puts((AST.indent * indent) + self.pin)
self.collect { |child|
child.tree(indent)
}.join("\n" + (AST.midline * (indent+1)) + "\n")
end
end
# A simple container class, containing the parameters for an object.
# Used for abstracting the grammar declarations. Basically unnecessary
# except that I kept finding bugs because I had too many arrays that
# meant completely different things.
class ObjectInst < ASTArray; end
# Another simple container class to make sure we can correctly arrayfy
# things.
class CompArgument < ASTArray
@@warnings = {}
def initialize(hash)
super
name = @children[0].value
# If it's not a metaparamer, we're fine.
return unless Puppet::Type.metaparamclass(name)
if @children[1]
if @children[1].value == false
raise Puppet::ParseError,
"%s is a metaparameter; please choose another name" %
name
else
unless @@warnings[name]
@@warnings[name] = true
Puppet.warning "%s is a metaparam; this value will inherit to all contained elements" % name
end
end
else
raise Puppet::ParseError,
"%s is a metaparameter; please choose another name" %
name
end
end
end
end
# $Id$
|
