blob: f22da0737e076d02fb871b505850ad5ec09f7c9e [file] [log] [blame]
David Reissea2cba82009-03-30 21:35:00 +00001/*
2 * Licensed to the Apache Software Foundation (ASF) under one
3 * or more contributor license agreements. See the NOTICE file
4 * distributed with this work for additional information
5 * regarding copyright ownership. The ASF licenses this file
6 * to you under the Apache License, Version 2.0 (the
7 * "License"); you may not use this file except in compliance
8 * with the License. You may obtain a copy of the License at
9 *
10 * http://www.apache.org/licenses/LICENSE-2.0
11 *
12 * Unless required by applicable law or agreed to in writing,
13 * software distributed under the License is distributed on an
14 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
15 * KIND, either express or implied. See the License for the
16 * specific language governing permissions and limitations
17 * under the License.
18 */
Mark Sleee9ce01c2007-05-16 02:29:53 +000019
Mark Slee31985722006-05-24 21:45:31 +000020#ifndef T_PROGRAM_H
21#define T_PROGRAM_H
22
Mark Sleee8540632006-05-30 09:24:40 +000023#include <map>
Mark Slee31985722006-05-24 21:45:31 +000024#include <string>
25#include <vector>
26
Mark Sleef0712dc2006-10-25 19:03:57 +000027// For program_name()
28#include "main.h"
29
David Reissc2532a92007-07-30 23:46:11 +000030#include "t_doc.h"
Mark Sleef0712dc2006-10-25 19:03:57 +000031#include "t_scope.h"
Mark Slee31985722006-05-24 21:45:31 +000032#include "t_base_type.h"
33#include "t_typedef.h"
34#include "t_enum.h"
Mark Slee30152872006-11-28 01:24:07 +000035#include "t_const.h"
Mark Slee31985722006-05-24 21:45:31 +000036#include "t_struct.h"
37#include "t_service.h"
Mark Sleee8540632006-05-30 09:24:40 +000038#include "t_list.h"
39#include "t_map.h"
40#include "t_set.h"
Bryan Duxburye0ac3ab2010-07-29 16:24:41 +000041#include "generate/t_generator_registry.h"
ccheeverf53b5cf2007-02-05 20:33:11 +000042//#include "t_doc.h"
Mark Slee31985722006-05-24 21:45:31 +000043
44/**
45 * Top level class representing an entire thrift program. A program consists
46 * fundamentally of the following:
47 *
48 * Typedefs
49 * Enumerations
Mark Slee30152872006-11-28 01:24:07 +000050 * Constants
Mark Slee31985722006-05-24 21:45:31 +000051 * Structs
Mark Slee9cb7c612006-09-01 22:17:45 +000052 * Exceptions
Mark Slee31985722006-05-24 21:45:31 +000053 * Services
54 *
Mark Sleef5377b32006-10-10 01:42:59 +000055 * The program module also contains the definitions of the base types.
56 *
Mark Slee31985722006-05-24 21:45:31 +000057 */
David Reissc2532a92007-07-30 23:46:11 +000058class t_program : public t_doc {
Mark Slee31985722006-05-24 21:45:31 +000059 public:
Mark Sleef0712dc2006-10-25 19:03:57 +000060 t_program(std::string path, std::string name) :
Mark Slee2c44d202007-05-16 02:18:07 +000061 path_(path),
dweatherford65b70752007-10-31 02:18:14 +000062 name_(name),
Bryan Duxburybdca9f62011-03-01 19:53:07 +000063 out_path_("./"),
64 out_path_is_absolute_(false) {
Mark Sleef0712dc2006-10-25 19:03:57 +000065 scope_ = new t_scope();
Mark Slee31985722006-05-24 21:45:31 +000066 }
67
Mark Sleef0712dc2006-10-25 19:03:57 +000068 t_program(std::string path) :
dweatherford65b70752007-10-31 02:18:14 +000069 path_(path),
Bryan Duxburybdca9f62011-03-01 19:53:07 +000070 out_path_("./"),
71 out_path_is_absolute_(false) {
Mark Sleef0712dc2006-10-25 19:03:57 +000072 name_ = program_name(path);
73 scope_ = new t_scope();
Mark Slee31985722006-05-24 21:45:31 +000074 }
75
Mark Slee2c44d202007-05-16 02:18:07 +000076 // Path accessor
Mark Sleef0712dc2006-10-25 19:03:57 +000077 const std::string& get_path() const { return path_; }
78
dweatherford65b70752007-10-31 02:18:14 +000079 // Output path accessor
80 const std::string& get_out_path() const { return out_path_; }
81
Bryan Duxburybdca9f62011-03-01 19:53:07 +000082 // Create gen-* dir accessor
Jake Farrelld1fb1802013-03-23 21:35:03 -040083 const bool is_out_path_absolute() const { return out_path_is_absolute_; }
Bryan Duxburybdca9f62011-03-01 19:53:07 +000084
Mark Slee31985722006-05-24 21:45:31 +000085 // Name accessor
Mark Sleef0712dc2006-10-25 19:03:57 +000086 const std::string& get_name() const { return name_; }
Mark Slee31985722006-05-24 21:45:31 +000087
Mark Slee9cb7c612006-09-01 22:17:45 +000088 // Namespace
Mark Sleef0712dc2006-10-25 19:03:57 +000089 const std::string& get_namespace() const { return namespace_; }
Mark Slee9cb7c612006-09-01 22:17:45 +000090
kholst76f2c882008-01-16 02:47:41 +000091 // Include prefix accessor
92 const std::string& get_include_prefix() const { return include_prefix_; }
93
Mark Slee31985722006-05-24 21:45:31 +000094 // Accessors for program elements
Mark Slee9cb7c612006-09-01 22:17:45 +000095 const std::vector<t_typedef*>& get_typedefs() const { return typedefs_; }
96 const std::vector<t_enum*>& get_enums() const { return enums_; }
Mark Slee30152872006-11-28 01:24:07 +000097 const std::vector<t_const*>& get_consts() const { return consts_; }
Mark Slee9cb7c612006-09-01 22:17:45 +000098 const std::vector<t_struct*>& get_structs() const { return structs_; }
99 const std::vector<t_struct*>& get_xceptions() const { return xceptions_; }
Mark Slee1c4ced72008-01-14 23:04:43 +0000100 const std::vector<t_struct*>& get_objects() const { return objects_; }
Mark Slee9cb7c612006-09-01 22:17:45 +0000101 const std::vector<t_service*>& get_services() const { return services_; }
Mark Slee31985722006-05-24 21:45:31 +0000102
Mark Sleef0712dc2006-10-25 19:03:57 +0000103 // Program elements
104 void add_typedef (t_typedef* td) { typedefs_.push_back(td); }
105 void add_enum (t_enum* te) { enums_.push_back(te); }
Mark Slee30152872006-11-28 01:24:07 +0000106 void add_const (t_const* tc) { consts_.push_back(tc); }
Mark Slee1c4ced72008-01-14 23:04:43 +0000107 void add_struct (t_struct* ts) { objects_.push_back(ts);
108 structs_.push_back(ts); }
109 void add_xception (t_struct* tx) { objects_.push_back(tx);
110 xceptions_.push_back(tx); }
Mark Sleef0712dc2006-10-25 19:03:57 +0000111 void add_service (t_service* ts) { services_.push_back(ts); }
Mark Slee31985722006-05-24 21:45:31 +0000112
Mark Sleef0712dc2006-10-25 19:03:57 +0000113 // Programs to include
114 const std::vector<t_program*>& get_includes() const { return includes_; }
Mark Sleee8540632006-05-30 09:24:40 +0000115
Bryan Duxburybdca9f62011-03-01 19:53:07 +0000116 void set_out_path(std::string out_path, bool out_path_is_absolute) {
dweatherford65b70752007-10-31 02:18:14 +0000117 out_path_ = out_path;
Bryan Duxburybdca9f62011-03-01 19:53:07 +0000118 out_path_is_absolute_ = out_path_is_absolute;
dweatherford65b70752007-10-31 02:18:14 +0000119 // Ensure that it ends with a trailing '/' (or '\' for windows machines)
120 char c = out_path_.at(out_path_.size() - 1);
121 if (!(c == '/' || c == '\\')) {
122 out_path_.push_back('/');
123 }
124 }
125
Roger Meierba406d32013-07-15 22:41:34 +0200126 // Typename collision detection
127 /**
128 * Search for typename collisions
129 * @param t the type to test for collisions
130 * @return true if a certain collision was found, otherwise false
131 */
132 bool is_unique_typename(t_type * t) {
133 int occurances = program_typename_count(this, t);
134 for (std::vector<t_program*>::iterator it = includes_.begin();
135 it != includes_.end(); ++it) {
136 occurances += program_typename_count(*it, t);
137 }
138 return 0 == occurances;
139 }
140
141 /**
142 * Search all type collections for duplicate typenames
143 * @param prog the program to search
144 * @param t the type to test for collisions
145 * @return the number of certain typename collisions
146 */
147 int program_typename_count(t_program * prog, t_type * t) {
148 int occurances = 0;
149 occurances += collection_typename_count(prog, prog->typedefs_, t);
150 occurances += collection_typename_count(prog, prog->enums_, t);
151 occurances += collection_typename_count(prog, prog->objects_, t);
152 occurances += collection_typename_count(prog, prog->services_, t);
153 return occurances;
154 }
155
156 /**
157 * Search a type collection for duplicate typenames
158 * @param prog the program to search
159 * @param type_collection the type collection to search
160 * @param t the type to test for collisions
161 * @return the number of certain typename collisions
162 */
163 template <class T>
164 int collection_typename_count(t_program * prog, T type_collection, t_type * t) {
165 int occurances = 0;
166 for (typename T::iterator it = type_collection.begin(); it != type_collection.end(); ++it)
167 if (t != *it && 0 == t->get_name().compare((*it)->get_name()) && is_common_namespace(prog, t))
168 ++occurances;
169 return occurances;
170 }
171
172 /**
173 * Determine whether identical typenames will collide based on namespaces.
174 *
175 * Because we do not know which languages the user will generate code for,
176 * collisions within programs (IDL files) having namespace declarations can be
177 * difficult to determine. Only guaranteed collisions return true (cause an error).
178 * Possible collisions involving explicit namespace declarations produce a warning.
179 * Other possible collisions go unreported.
180 * @param prog the program containing the preexisting typename
181 * @param t the type containing the typename match
182 * @return true if a collision within namespaces is found, otherwise false
183 */
184 bool is_common_namespace(t_program * prog, t_type * t) {
185 //Case 1: Typenames are in the same program [collision]
186 if (prog == t->get_program()) {
187 pwarning(1, "Duplicate typename %s found in %s",
188 t->get_name().c_str(), t->get_program()->get_name().c_str());
189 return true;
190 }
191
192 //Case 2: Both programs have identical namespace scope/name declarations [collision]
193 bool match = true;
194 for (std::map<std::string, std::string>::iterator it = prog->namespaces_.begin();
195 it != prog->namespaces_.end(); ++it) {
196 if (0 == it->second.compare(t->get_program()->get_namespace(it->first))) {
197 pwarning(1, "Duplicate typename %s found in %s,%s,%s and %s,%s,%s [file,scope,ns]",
198 t->get_name().c_str(),
199 t->get_program()->get_name().c_str(), it->first.c_str(), it->second.c_str(),
200 prog->get_name().c_str(), it->first.c_str(), it->second.c_str());
201 } else {
202 match = false;
203 }
204 }
205 for (std::map<std::string, std::string>::iterator it = t->get_program()->namespaces_.begin();
206 it != t->get_program()->namespaces_.end(); ++it) {
207 if (0 == it->second.compare(prog->get_namespace(it->first))) {
208 pwarning(1, "Duplicate typename %s found in %s,%s,%s and %s,%s,%s [file,scope,ns]",
209 t->get_name().c_str(),
210 t->get_program()->get_name().c_str(), it->first.c_str(), it->second.c_str(),
211 prog->get_name().c_str(), it->first.c_str(), it->second.c_str());
212 } else {
213 match = false;
214 }
215 }
216 if (0 == prog->namespaces_.size() && 0 == t->get_program()->namespaces_.size()) {
217 pwarning(1, "Duplicate typename %s found in %s and %s",
218 t->get_name().c_str(), t->get_program()->get_name().c_str(), prog->get_name().c_str());
219 }
220 return match;
221 }
222
Mark Sleef0712dc2006-10-25 19:03:57 +0000223 // Scoping and namespacing
Mark Slee9cb7c612006-09-01 22:17:45 +0000224 void set_namespace(std::string name) {
225 namespace_ = name;
226 }
227
Mark Sleef0712dc2006-10-25 19:03:57 +0000228 // Scope accessor
229 t_scope* scope() {
230 return scope_;
Mark Sleee8540632006-05-30 09:24:40 +0000231 }
Mark Sleef5377b32006-10-10 01:42:59 +0000232
Mark Sleef0712dc2006-10-25 19:03:57 +0000233 // Includes
234
kholst76f2c882008-01-16 02:47:41 +0000235 void add_include(std::string path, std::string include_site) {
236 t_program* program = new t_program(path);
237
238 // include prefix for this program is the site at which it was included
239 // (minus the filename)
240 std::string include_prefix;
241 std::string::size_type last_slash = std::string::npos;
242 if ((last_slash = include_site.rfind("/")) != std::string::npos) {
243 include_prefix = include_site.substr(0, last_slash);
244 }
245
246 program->set_include_prefix(include_prefix);
247 includes_.push_back(program);
Mark Sleee8540632006-05-30 09:24:40 +0000248 }
Mark Sleef5377b32006-10-10 01:42:59 +0000249
Mark Sleef0712dc2006-10-25 19:03:57 +0000250 std::vector<t_program*>& get_includes() {
251 return includes_;
Mark Sleee8540632006-05-30 09:24:40 +0000252 }
Mark Sleef5377b32006-10-10 01:42:59 +0000253
kholst76f2c882008-01-16 02:47:41 +0000254 void set_include_prefix(std::string include_prefix) {
255 include_prefix_ = include_prefix;
256
257 // this is intended to be a directory; add a trailing slash if necessary
258 int len = include_prefix_.size();
259 if (len > 0 && include_prefix_[len - 1] != '/') {
260 include_prefix_ += '/';
261 }
262 }
263
David Reiss79eca142008-02-27 01:55:13 +0000264 // Language neutral namespace / packaging
265 void set_namespace(std::string language, std::string name_space) {
Bryan Duxburybbff4a82010-09-03 20:36:02 +0000266 if (language != "*") {
267 size_t sub_index = language.find('.');
268 std::string base_language = language.substr(0, sub_index);
269 std::string sub_namespace;
Bryan Duxbury681f5ea2010-08-20 16:42:04 +0000270
Bryan Duxburybbff4a82010-09-03 20:36:02 +0000271 if(base_language == "smalltalk") {
272 pwarning(1, "Namespace 'smalltalk' is deprecated. Use 'st' instead");
273 base_language = "st";
274 }
Bryan Duxbury4d8a9cd2010-08-30 17:09:58 +0000275
Bryan Duxburybbff4a82010-09-03 20:36:02 +0000276 t_generator_registry::gen_map_t my_copy = t_generator_registry::get_generator_map();
Bryan Duxburye0ac3ab2010-07-29 16:24:41 +0000277
Bryan Duxburybbff4a82010-09-03 20:36:02 +0000278 t_generator_registry::gen_map_t::iterator it;
279 it=my_copy.find(base_language);
Bryan Duxburye0ac3ab2010-07-29 16:24:41 +0000280
Bryan Duxburybbff4a82010-09-03 20:36:02 +0000281 if (it == my_copy.end()) {
Henrique Mendoncaffb031d2012-09-24 18:36:16 +0000282 std::string warning = "No generator named '" + base_language + "' could be found!";
283 pwarning(1, warning.c_str());
284 } else {
285 if (sub_index != std::string::npos) {
286 std::string sub_namespace = language.substr(sub_index+1);
287 if ( ! it->second->is_valid_namespace(sub_namespace)) {
Henrique Mendonça8ad13a32013-05-16 21:26:20 +0200288 std::string warning = base_language + " generator does not accept '" + sub_namespace + "' as sub-namespace!";
289 pwarning(1, warning.c_str());
Henrique Mendoncaffb031d2012-09-24 18:36:16 +0000290 }
Bryan Duxburybbff4a82010-09-03 20:36:02 +0000291 }
Bryan Duxbury681f5ea2010-08-20 16:42:04 +0000292 }
David Reisse3ba3492010-08-26 21:49:45 +0000293 }
Bryan Duxbury681f5ea2010-08-20 16:42:04 +0000294
David Reiss79eca142008-02-27 01:55:13 +0000295 namespaces_[language] = name_space;
296 }
297
298 std::string get_namespace(std::string language) const {
David Reissfb790d72010-09-02 16:41:45 +0000299 std::map<std::string, std::string>::const_iterator iter;
300 if ((iter = namespaces_.find(language)) != namespaces_.end() ||
301 (iter = namespaces_.find("*" )) != namespaces_.end()) {
302 return iter->second;
David Reiss79eca142008-02-27 01:55:13 +0000303 }
David Reissfb790d72010-09-02 16:41:45 +0000304 return std::string();
David Reiss79eca142008-02-27 01:55:13 +0000305 }
306
Mark Sleef0712dc2006-10-25 19:03:57 +0000307 // Language specific namespace / packaging
308
Mark Sleef0712dc2006-10-25 19:03:57 +0000309 void add_cpp_include(std::string path) {
310 cpp_includes_.push_back(path);
311 }
312
313 const std::vector<std::string>& get_cpp_includes() {
314 return cpp_includes_;
315 }
316
Roger Meier213a6642010-10-27 12:30:11 +0000317 void add_c_include(std::string path) {
318 c_includes_.push_back(path);
319 }
320
321 const std::vector<std::string>& get_c_includes() {
322 return c_includes_;
323 }
324
Mark Slee31985722006-05-24 21:45:31 +0000325 private:
Mark Sleef5377b32006-10-10 01:42:59 +0000326
Mark Sleef0712dc2006-10-25 19:03:57 +0000327 // File path
328 std::string path_;
Mark Slee9cb7c612006-09-01 22:17:45 +0000329
Mark Slee31985722006-05-24 21:45:31 +0000330 // Name
331 std::string name_;
332
dweatherford65b70752007-10-31 02:18:14 +0000333 // Output directory
334 std::string out_path_;
335
Bryan Duxburybdca9f62011-03-01 19:53:07 +0000336 // Output directory is absolute location for generated source (no gen-*)
337 bool out_path_is_absolute_;
338
Mark Slee9cb7c612006-09-01 22:17:45 +0000339 // Namespace
340 std::string namespace_;
341
Mark Sleef0712dc2006-10-25 19:03:57 +0000342 // Included programs
343 std::vector<t_program*> includes_;
Mark Sleee8540632006-05-30 09:24:40 +0000344
kholst76f2c882008-01-16 02:47:41 +0000345 // Include prefix for this program, if any
346 std::string include_prefix_;
347
Mark Sleef0712dc2006-10-25 19:03:57 +0000348 // Identifier lookup scope
349 t_scope* scope_;
Mark Sleee8540632006-05-30 09:24:40 +0000350
Mark Sleef0712dc2006-10-25 19:03:57 +0000351 // Components to generate code for
352 std::vector<t_typedef*> typedefs_;
353 std::vector<t_enum*> enums_;
Mark Slee30152872006-11-28 01:24:07 +0000354 std::vector<t_const*> consts_;
Mark Slee1c4ced72008-01-14 23:04:43 +0000355 std::vector<t_struct*> objects_;
Mark Sleef0712dc2006-10-25 19:03:57 +0000356 std::vector<t_struct*> structs_;
357 std::vector<t_struct*> xceptions_;
358 std::vector<t_service*> services_;
359
David Reiss79eca142008-02-27 01:55:13 +0000360 // Dynamic namespaces
361 std::map<std::string, std::string> namespaces_;
362
Mark Sleef0712dc2006-10-25 19:03:57 +0000363 // C++ extra includes
364 std::vector<std::string> cpp_includes_;
365
Roger Meier213a6642010-10-27 12:30:11 +0000366 // C extra includes
367 std::vector<std::string> c_includes_;
368
Mark Slee31985722006-05-24 21:45:31 +0000369};
370
371#endif