2 * Copyright (c) 2006 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 * Authors: Nathan Binkert
31 #ifndef __BASE_VARARGS_HH__
32 #define __BASE_VARARGS_HH__
34 #include "base/refcnt.hh"
36 #define VARARGS_DECLARATION(receiver) \
37 VarArgs::Argument<receiver> a01 = VarArgs::Null(), \
38 VarArgs::Argument<receiver> a02 = VarArgs::Null(), \
39 VarArgs::Argument<receiver> a03 = VarArgs::Null(), \
40 VarArgs::Argument<receiver> a04 = VarArgs::Null(), \
41 VarArgs::Argument<receiver> a05 = VarArgs::Null(), \
42 VarArgs::Argument<receiver> a06 = VarArgs::Null(), \
43 VarArgs::Argument<receiver> a07 = VarArgs::Null(), \
44 VarArgs::Argument<receiver> a08 = VarArgs::Null(), \
45 VarArgs::Argument<receiver> a09 = VarArgs::Null(), \
46 VarArgs::Argument<receiver> a10 = VarArgs::Null(), \
47 VarArgs::Argument<receiver> a11 = VarArgs::Null(), \
48 VarArgs::Argument<receiver> a12 = VarArgs::Null(), \
49 VarArgs::Argument<receiver> a13 = VarArgs::Null(), \
50 VarArgs::Argument<receiver> a14 = VarArgs::Null(), \
51 VarArgs::Argument<receiver> a15 = VarArgs::Null(), \
52 VarArgs::Argument<receiver> a16 = VarArgs::Null()
54 #define VARARGS_DEFINITION(receiver) \
55 VarArgs::Argument<receiver> a01, \
56 VarArgs::Argument<receiver> a02, \
57 VarArgs::Argument<receiver> a03, \
58 VarArgs::Argument<receiver> a04, \
59 VarArgs::Argument<receiver> a05, \
60 VarArgs::Argument<receiver> a06, \
61 VarArgs::Argument<receiver> a07, \
62 VarArgs::Argument<receiver> a08, \
63 VarArgs::Argument<receiver> a09, \
64 VarArgs::Argument<receiver> a10, \
65 VarArgs::Argument<receiver> a11, \
66 VarArgs::Argument<receiver> a12, \
67 VarArgs::Argument<receiver> a13, \
68 VarArgs::Argument<receiver> a14, \
69 VarArgs::Argument<receiver> a15, \
70 VarArgs::Argument<receiver> a16
72 #define VARARGS_ALLARGS \
73 a01, a02, a03, a04, a05, a06, a07, a08, \
74 a09, a10, a11, a12, a13, a14, a15, a16
76 #define VARARGS_ADDARGS(receiver) do { \
79 a01.add_arg(receiver); \
81 a02.add_arg(receiver); \
83 a03.add_arg(receiver); \
85 a04.add_arg(receiver); \
87 a05.add_arg(receiver); \
89 a06.add_arg(receiver); \
91 a07.add_arg(receiver); \
93 a08.add_arg(receiver); \
95 a09.add_arg(receiver); \
97 a10.add_arg(receiver); \
99 a11.add_arg(receiver); \
101 a12.add_arg(receiver); \
103 a13.add_arg(receiver); \
105 a14.add_arg(receiver); \
107 a15.add_arg(receiver); \
109 a16.add_arg(receiver); \
111 receiver.end_args(); \
118 template <typename T>
121 enum { enabled = true };
127 enum { enabled = false };
130 template <class RECV>
131 struct Base : public RefCounted
133 virtual void add_arg(RECV &receiver) const = 0;
136 template <typename T, class RECV>
137 struct Any : public Base<RECV>
141 Any(const T &arg) : argument(arg) {}
144 add_arg(RECV &receiver) const
146 receiver.add_arg(argument);
150 template <typename T, class RECV>
151 struct Any<T *, RECV> : public Base<RECV>
155 Any(const T *arg) : argument(arg) {}
158 add_arg(RECV &receiver) const
160 receiver.add_arg(argument);
164 template <class RECV>
165 struct Argument : public RefCountingPtr<Base<RECV> >
167 typedef RefCountingPtr<VarArgs::Base<RECV> > Base;
170 Argument(const Null &null) { }
171 template <typename T>
172 Argument(const T& arg) : Base(new Any<T, RECV>(arg)) { }
173 template <typename T>
174 Argument(const T* arg) : Base(new Any<T *, RECV>(arg)) { }
177 add_arg(RECV &receiver) const
180 this->data->add_arg(receiver);
188 typedef VarArgs::Argument<RECV> Argument;
189 typedef std::list<Argument> list;
190 typedef typename list::iterator iterator;
191 typedef typename list::const_iterator const_iterator;
192 typedef typename list::size_type size_type;
199 List(Argument a01, Argument a02, Argument a03, Argument a04,
200 Argument a05, Argument a06, Argument a07, Argument a08,
201 Argument a09, Argument a10, Argument a11, Argument a12,
202 Argument a13, Argument a14, Argument a15, Argument a16)
238 size_type size() const { return l.size(); }
239 bool empty() const { return l.empty(); }
241 iterator begin() { return l.begin(); }
242 const_iterator begin() const { return l.begin(); }
244 iterator end() { return l.end(); }
245 const_iterator end() const { return l.end(); }
248 push_back(const Argument &arg)
255 push_front(const Argument &arg)
261 template <typename T>
263 push_back(const T &arg)
265 if (Traits<T>::enabled)
269 template <typename T>
271 push_front(const T &arg)
273 if (Traits<T>::enabled)
277 Argument& front() { return l.front(); }
278 const Argument& front() const { return l.front(); }
279 Argument& back() { return l.back(); }
280 const Argument& back() const { return l.back(); }
282 void erase(iterator position) { return l.erase(position); }
283 void erase(iterator first, iterator last) { return l.erase(first, last); }
284 void clear() { return l.clear(); }
285 void pop_front() { return l.pop_front(); }
286 void pop_back() { return l.pop_back(); }
287 void reverse() { l.reverse(); }
290 * Functions specific to variable arguments
293 add_args(RECV &recv) const
295 const_iterator i = l.begin();
296 const_iterator end = l.end();
306 /* end namespace VarArgs */ }
308 #endif /* __BASE_VARARGS_HH__ */