blob: a2350e6ab65a277fd3978a37175c31effa1bc6fb [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/**
21 * thrift - a lightweight cross-language rpc/serialization tool
22 *
23 * This file contains the main compiler engine for Thrift, which invokes the
24 * scanner/parser to build the thrift object tree. The interface generation
Mark Sleef5377b32006-10-10 01:42:59 +000025 * code for each language lives in a file by the language name under the
26 * generate/ folder, and all parse structures live in parse/
Mark Slee31985722006-05-24 21:45:31 +000027 *
Mark Slee31985722006-05-24 21:45:31 +000028 */
29
David Reissf10984b2008-03-27 21:39:52 +000030#include <cassert>
Mark Slee31985722006-05-24 21:45:31 +000031#include <stdlib.h>
32#include <stdio.h>
33#include <stdarg.h>
David Reiss5ad12602010-08-31 16:51:30 +000034#include <time.h>
Mark Slee31985722006-05-24 21:45:31 +000035#include <string>
David Reiss739cbe22008-04-15 05:44:00 +000036#include <algorithm>
Mark Sleef0712dc2006-10-25 19:03:57 +000037#include <sys/types.h>
38#include <sys/stat.h>
dweatherford65b70752007-10-31 02:18:14 +000039#include <errno.h>
David Reissab55ed52008-06-11 01:17:00 +000040#include <limits.h>
Mark Slee31985722006-05-24 21:45:31 +000041
David Reiss204420f2008-01-11 20:59:03 +000042#ifdef MINGW
43# include <windows.h> /* for GetFullPathName */
David Reiss204420f2008-01-11 20:59:03 +000044#endif
45
Mark Sleef0712dc2006-10-25 19:03:57 +000046// Careful: must include globals first for extern definitions
Mark Slee31985722006-05-24 21:45:31 +000047#include "globals.h"
48
49#include "main.h"
50#include "parse/t_program.h"
Mark Sleef0712dc2006-10-25 19:03:57 +000051#include "parse/t_scope.h"
David Reissbbbbe882009-02-17 20:27:48 +000052#include "generate/t_generator.h"
Mark Slee31985722006-05-24 21:45:31 +000053
David Reissdd08f6d2008-06-30 20:24:24 +000054#include "version.h"
55
Mark Slee31985722006-05-24 21:45:31 +000056using namespace std;
57
Mark Sleef5377b32006-10-10 01:42:59 +000058/**
59 * Global program tree
60 */
Mark Slee31985722006-05-24 21:45:31 +000061t_program* g_program;
62
Mark Sleef5377b32006-10-10 01:42:59 +000063/**
Mark Sleef0712dc2006-10-25 19:03:57 +000064 * Global types
65 */
66
67t_type* g_type_void;
68t_type* g_type_string;
Mark Slee8d725a22007-04-13 01:57:12 +000069t_type* g_type_binary;
Mark Sleeb6200d82007-01-19 19:14:36 +000070t_type* g_type_slist;
Mark Sleef0712dc2006-10-25 19:03:57 +000071t_type* g_type_bool;
72t_type* g_type_byte;
73t_type* g_type_i16;
74t_type* g_type_i32;
75t_type* g_type_i64;
76t_type* g_type_double;
77
78/**
79 * Global scope
80 */
81t_scope* g_scope;
82
83/**
84 * Parent scope to also parse types
85 */
86t_scope* g_parent_scope;
87
88/**
89 * Prefix for putting types in parent scope
90 */
91string g_parent_prefix;
92
93/**
94 * Parsing pass
95 */
96PARSE_MODE g_parse_mode;
97
98/**
99 * Current directory of file being parsed
100 */
101string g_curdir;
102
103/**
104 * Current file being parsed
105 */
106string g_curpath;
107
108/**
Martin Kraemer32c66e12006-11-09 00:06:36 +0000109 * Search path for inclusions
110 */
Mark Slee2329a832006-11-09 00:23:30 +0000111vector<string> g_incl_searchpath;
Martin Kraemer32c66e12006-11-09 00:06:36 +0000112
113/**
Mark Sleef5377b32006-10-10 01:42:59 +0000114 * Global debug state
115 */
Mark Slee31985722006-05-24 21:45:31 +0000116int g_debug = 0;
117
Mark Sleef5377b32006-10-10 01:42:59 +0000118/**
Bryan Duxburya145b4d2009-04-03 17:29:25 +0000119 * Strictness level
120 */
121int g_strict = 127;
122
123/**
Mark Sleef0712dc2006-10-25 19:03:57 +0000124 * Warning level
125 */
126int g_warn = 1;
127
128/**
129 * Verbose output
130 */
131int g_verbose = 0;
132
133/**
Mark Sleef5377b32006-10-10 01:42:59 +0000134 * Global time string
135 */
Mark Slee31985722006-05-24 21:45:31 +0000136char* g_time_str;
137
Mark Slee31985722006-05-24 21:45:31 +0000138/**
David Reisscbd4bac2007-08-14 17:12:33 +0000139 * The last parsed doctext comment.
140 */
141char* g_doctext;
142
143/**
144 * The location of the last parsed doctext comment.
145 */
146int g_doctext_lineno;
147
148/**
Bryan Duxburyc7206a42011-08-17 23:17:04 +0000149 * Whether or not negative field keys are accepted.
150 */
151int g_allow_neg_field_keys;
152
153/**
Roger Meier887ff752011-08-19 11:25:39 +0000154 * Whether or not 64-bit constants will generate a warning.
155 */
156int g_allow_64bit_consts = 0;
157
158/**
Mark Sleef0712dc2006-10-25 19:03:57 +0000159 * Flags to control code generation
160 */
Mark Sleef0712dc2006-10-25 19:03:57 +0000161bool gen_recurse = false;
162
163/**
David Reiss204420f2008-01-11 20:59:03 +0000164 * MinGW doesn't have realpath, so use fallback implementation in that case,
165 * otherwise this just calls through to realpath
166 */
167char *saferealpath(const char *path, char *resolved_path) {
168#ifdef MINGW
169 char buf[MAX_PATH];
170 char* basename;
171 DWORD len = GetFullPathName(path, MAX_PATH, buf, &basename);
172 if (len == 0 || len > MAX_PATH - 1){
173 strcpy(resolved_path, path);
174 } else {
David Reiss204420f2008-01-11 20:59:03 +0000175 strcpy(resolved_path, buf);
176 }
Bryan Duxbury0137af62010-04-22 21:21:46 +0000177
178 // Replace backslashes with forward slashes so the
179 // rest of the code behaves correctly.
180 size_t resolved_len = strlen(resolved_path);
181 for (size_t i = 0; i < resolved_len; i++) {
182 if (resolved_path[i] == '\\') {
183 resolved_path[i] = '/';
184 }
185 }
David Reiss204420f2008-01-11 20:59:03 +0000186 return resolved_path;
187#else
188 return realpath(path, resolved_path);
189#endif
190}
191
Roger Meier061d4a22012-10-07 11:51:00 +0000192bool check_is_directory(const char *dir_name) {
193#ifdef MINGW
194 DWORD attributes = ::GetFileAttributesA(dir_name);
195 if(attributes == INVALID_FILE_ATTRIBUTES) {
196 fprintf(stderr, "Output directory %s is unusable: GetLastError() = %ld\n", dir_name, GetLastError());
197 return false;
198 }
199 if((attributes & FILE_ATTRIBUTE_DIRECTORY) != FILE_ATTRIBUTE_DIRECTORY) {
200 fprintf(stderr, "Output directory %s exists but is not a directory\n", dir_name);
201 return false;
202 }
203 return true;
204#else
205 struct stat sb;
206 if (stat(dir_name, &sb) < 0) {
207 fprintf(stderr, "Output directory %s is unusable: %s\n", dir_name, strerror(errno));
208 return false;
209 }
210 if (! S_ISDIR(sb.st_mode)) {
211 fprintf(stderr, "Output directory %s exists but is not a directory\n", dir_name);
212 return false;
213 }
214 return true;
215#endif
216}
David Reiss204420f2008-01-11 20:59:03 +0000217
218/**
Mark Slee31985722006-05-24 21:45:31 +0000219 * Report an error to the user. This is called yyerror for historical
220 * reasons (lex and yacc expect the error reporting routine to be called
221 * this). Call this function to report any errors to the user.
222 * yyerror takes printf style arguments.
223 *
224 * @param fmt C format string followed by additional arguments
225 */
David Reiss0babe402008-06-10 22:56:12 +0000226void yyerror(const char* fmt, ...) {
Mark Slee31985722006-05-24 21:45:31 +0000227 va_list args;
228 fprintf(stderr,
Mark Sleef0712dc2006-10-25 19:03:57 +0000229 "[ERROR:%s:%d] (last token was '%s')\n",
230 g_curpath.c_str(),
Mark Slee31985722006-05-24 21:45:31 +0000231 yylineno,
232 yytext);
Mark Slee31985722006-05-24 21:45:31 +0000233
234 va_start(args, fmt);
235 vfprintf(stderr, fmt, args);
236 va_end(args);
237
238 fprintf(stderr, "\n");
239}
240
241/**
242 * Prints a debug message from the parser.
243 *
244 * @param fmt C format string followed by additional arguments
245 */
David Reiss0babe402008-06-10 22:56:12 +0000246void pdebug(const char* fmt, ...) {
Mark Slee31985722006-05-24 21:45:31 +0000247 if (g_debug == 0) {
248 return;
249 }
250 va_list args;
Mark Slee30152872006-11-28 01:24:07 +0000251 printf("[PARSE:%d] ", yylineno);
Mark Sleef0712dc2006-10-25 19:03:57 +0000252 va_start(args, fmt);
253 vprintf(fmt, args);
254 va_end(args);
255 printf("\n");
256}
257
258/**
259 * Prints a verbose output mode message
260 *
261 * @param fmt C format string followed by additional arguments
262 */
David Reiss0babe402008-06-10 22:56:12 +0000263void pverbose(const char* fmt, ...) {
Mark Sleef0712dc2006-10-25 19:03:57 +0000264 if (g_verbose == 0) {
265 return;
266 }
267 va_list args;
268 va_start(args, fmt);
269 vprintf(fmt, args);
270 va_end(args);
271}
272
273/**
274 * Prints a warning message
275 *
276 * @param fmt C format string followed by additional arguments
277 */
David Reiss0babe402008-06-10 22:56:12 +0000278void pwarning(int level, const char* fmt, ...) {
Mark Sleef0712dc2006-10-25 19:03:57 +0000279 if (g_warn < level) {
280 return;
281 }
282 va_list args;
283 printf("[WARNING:%s:%d] ", g_curpath.c_str(), yylineno);
Mark Slee31985722006-05-24 21:45:31 +0000284 va_start(args, fmt);
285 vprintf(fmt, args);
286 va_end(args);
287 printf("\n");
288}
289
290/**
291 * Prints a failure message and exits
292 *
293 * @param fmt C format string followed by additional arguments
294 */
Mark Slee30152872006-11-28 01:24:07 +0000295void failure(const char* fmt, ...) {
Mark Slee2c44d202007-05-16 02:18:07 +0000296 va_list args;
Mark Sleef0712dc2006-10-25 19:03:57 +0000297 fprintf(stderr, "[FAILURE:%s:%d] ", g_curpath.c_str(), yylineno);
Mark Slee31985722006-05-24 21:45:31 +0000298 va_start(args, fmt);
299 vfprintf(stderr, fmt, args);
300 va_end(args);
301 printf("\n");
302 exit(1);
303}
304
305/**
Mark Sleef0712dc2006-10-25 19:03:57 +0000306 * Converts a string filename into a thrift program name
307 */
308string program_name(string filename) {
309 string::size_type slash = filename.rfind("/");
310 if (slash != string::npos) {
311 filename = filename.substr(slash+1);
312 }
313 string::size_type dot = filename.rfind(".");
314 if (dot != string::npos) {
315 filename = filename.substr(0, dot);
316 }
317 return filename;
318}
319
320/**
321 * Gets the directory path of a filename
322 */
323string directory_name(string filename) {
324 string::size_type slash = filename.rfind("/");
325 // No slash, just use the current directory
326 if (slash == string::npos) {
327 return ".";
328 }
329 return filename.substr(0, slash);
330}
331
332/**
333 * Finds the appropriate file path for the given filename
334 */
335string include_file(string filename) {
336 // Absolute path? Just try that
Martin Kraemer32c66e12006-11-09 00:06:36 +0000337 if (filename[0] == '/') {
338 // Realpath!
339 char rp[PATH_MAX];
David Reiss204420f2008-01-11 20:59:03 +0000340 if (saferealpath(filename.c_str(), rp) == NULL) {
Martin Kraemer32c66e12006-11-09 00:06:36 +0000341 pwarning(0, "Cannot open include file %s\n", filename.c_str());
342 return std::string();
343 }
Mark Slee2c44d202007-05-16 02:18:07 +0000344
345 // Stat this file
Martin Kraemer32c66e12006-11-09 00:06:36 +0000346 struct stat finfo;
347 if (stat(rp, &finfo) == 0) {
348 return rp;
349 }
350 } else { // relative path, start searching
351 // new search path with current dir global
352 vector<string> sp = g_incl_searchpath;
353 sp.insert(sp.begin(), g_curdir);
Mark Slee2c44d202007-05-16 02:18:07 +0000354
Martin Kraemer32c66e12006-11-09 00:06:36 +0000355 // iterate through paths
356 vector<string>::iterator it;
357 for (it = sp.begin(); it != sp.end(); it++) {
358 string sfilename = *(it) + "/" + filename;
Mark Slee2c44d202007-05-16 02:18:07 +0000359
Martin Kraemer32c66e12006-11-09 00:06:36 +0000360 // Realpath!
361 char rp[PATH_MAX];
David Reiss204420f2008-01-11 20:59:03 +0000362 if (saferealpath(sfilename.c_str(), rp) == NULL) {
Martin Kraemer32c66e12006-11-09 00:06:36 +0000363 continue;
364 }
Mark Slee2c44d202007-05-16 02:18:07 +0000365
Martin Kraemer32c66e12006-11-09 00:06:36 +0000366 // Stat this files
367 struct stat finfo;
368 if (stat(rp, &finfo) == 0) {
369 return rp;
370 }
371 }
Mark Sleef0712dc2006-10-25 19:03:57 +0000372 }
Mark Slee2c44d202007-05-16 02:18:07 +0000373
Mark Sleef0712dc2006-10-25 19:03:57 +0000374 // Uh oh
375 pwarning(0, "Could not find include file %s\n", filename.c_str());
376 return std::string();
377}
378
379/**
David Reisscbd4bac2007-08-14 17:12:33 +0000380 * Clears any previously stored doctext string.
381 * Also prints a warning if we are discarding information.
382 */
383void clear_doctext() {
384 if (g_doctext != NULL) {
385 pwarning(2, "Uncaptured doctext at on line %d.", g_doctext_lineno);
386 }
387 free(g_doctext);
388 g_doctext = NULL;
389}
390
391/**
David Reiss1ac05802007-07-30 22:00:27 +0000392 * Cleans up text commonly found in doxygen-like comments
393 *
394 * Warning: if you mix tabs and spaces in a non-uniform way,
395 * you will get what you deserve.
396 */
397char* clean_up_doctext(char* doctext) {
398 // Convert to C++ string, and remove Windows's carriage returns.
399 string docstring = doctext;
400 docstring.erase(
401 remove(docstring.begin(), docstring.end(), '\r'),
402 docstring.end());
403
404 // Separate into lines.
405 vector<string> lines;
406 string::size_type pos = string::npos;
407 string::size_type last;
408 while (true) {
409 last = (pos == string::npos) ? 0 : pos+1;
410 pos = docstring.find('\n', last);
411 if (pos == string::npos) {
412 // First bit of cleaning. If the last line is only whitespace, drop it.
413 string::size_type nonwhite = docstring.find_first_not_of(" \t", last);
414 if (nonwhite != string::npos) {
415 lines.push_back(docstring.substr(last));
416 }
417 break;
418 }
419 lines.push_back(docstring.substr(last, pos-last));
420 }
421
422 // A very profound docstring.
423 if (lines.empty()) {
424 return NULL;
425 }
426
427 // Clear leading whitespace from the first line.
428 pos = lines.front().find_first_not_of(" \t");
429 lines.front().erase(0, pos);
430
431 // If every nonblank line after the first has the same number of spaces/tabs,
432 // then a star, remove them.
433 bool have_prefix = true;
434 bool found_prefix = false;
435 string::size_type prefix_len = 0;
436 vector<string>::iterator l_iter;
437 for (l_iter = lines.begin()+1; l_iter != lines.end(); ++l_iter) {
438 if (l_iter->empty()) {
439 continue;
440 }
441
442 pos = l_iter->find_first_not_of(" \t");
443 if (!found_prefix) {
444 if (pos != string::npos) {
445 if (l_iter->at(pos) == '*') {
446 found_prefix = true;
447 prefix_len = pos;
448 } else {
449 have_prefix = false;
450 break;
451 }
452 } else {
453 // Whitespace-only line. Truncate it.
454 l_iter->clear();
455 }
456 } else if (l_iter->size() > pos
457 && l_iter->at(pos) == '*'
458 && pos == prefix_len) {
459 // Business as usual.
460 } else if (pos == string::npos) {
461 // Whitespace-only line. Let's truncate it for them.
462 l_iter->clear();
463 } else {
464 // The pattern has been broken.
465 have_prefix = false;
466 break;
467 }
468 }
469
470 // If our prefix survived, delete it from every line.
471 if (have_prefix) {
472 // Get the star too.
473 prefix_len++;
474 for (l_iter = lines.begin()+1; l_iter != lines.end(); ++l_iter) {
475 l_iter->erase(0, prefix_len);
476 }
477 }
478
479 // Now delete the minimum amount of leading whitespace from each line.
480 prefix_len = string::npos;
481 for (l_iter = lines.begin()+1; l_iter != lines.end(); ++l_iter) {
482 if (l_iter->empty()) {
483 continue;
484 }
485 pos = l_iter->find_first_not_of(" \t");
486 if (pos != string::npos
487 && (prefix_len == string::npos || pos < prefix_len)) {
488 prefix_len = pos;
489 }
490 }
491
492 // If our prefix survived, delete it from every line.
493 if (prefix_len != string::npos) {
494 for (l_iter = lines.begin()+1; l_iter != lines.end(); ++l_iter) {
495 l_iter->erase(0, prefix_len);
496 }
497 }
498
499 // Remove trailing whitespace from every line.
500 for (l_iter = lines.begin(); l_iter != lines.end(); ++l_iter) {
501 pos = l_iter->find_last_not_of(" \t");
502 if (pos != string::npos && pos != l_iter->length()-1) {
503 l_iter->erase(pos+1);
504 }
505 }
506
507 // If the first line is empty, remove it.
508 // Don't do this earlier because a lot of steps skip the first line.
509 if (lines.front().empty()) {
510 lines.erase(lines.begin());
511 }
512
513 // Now rejoin the lines and copy them back into doctext.
514 docstring.clear();
515 for (l_iter = lines.begin(); l_iter != lines.end(); ++l_iter) {
516 docstring += *l_iter;
517 docstring += '\n';
518 }
519
520 assert(docstring.length() <= strlen(doctext));
521 strcpy(doctext, docstring.c_str());
522 return doctext;
523}
524
525/** Set to true to debug docstring parsing */
526static bool dump_docs = false;
527
528/**
529 * Dumps docstrings to stdout
David Reisscdffe262007-08-14 17:12:31 +0000530 * Only works for top-level definitions and the whole program doc
531 * (i.e., not enum constants, struct fields, or functions.
David Reiss1ac05802007-07-30 22:00:27 +0000532 */
533void dump_docstrings(t_program* program) {
David Reisscdffe262007-08-14 17:12:31 +0000534 string progdoc = program->get_doc();
David Reissc2532a92007-07-30 23:46:11 +0000535 if (!progdoc.empty()) {
536 printf("Whole program doc:\n%s\n", progdoc.c_str());
537 }
David Reiss1ac05802007-07-30 22:00:27 +0000538 const vector<t_typedef*>& typedefs = program->get_typedefs();
539 vector<t_typedef*>::const_iterator t_iter;
540 for (t_iter = typedefs.begin(); t_iter != typedefs.end(); ++t_iter) {
541 t_typedef* td = *t_iter;
542 if (td->has_doc()) {
David Reisscdffe262007-08-14 17:12:31 +0000543 printf("typedef %s:\n%s\n", td->get_name().c_str(), td->get_doc().c_str());
544 }
545 }
546 const vector<t_enum*>& enums = program->get_enums();
547 vector<t_enum*>::const_iterator e_iter;
548 for (e_iter = enums.begin(); e_iter != enums.end(); ++e_iter) {
549 t_enum* en = *e_iter;
550 if (en->has_doc()) {
551 printf("enum %s:\n%s\n", en->get_name().c_str(), en->get_doc().c_str());
552 }
553 }
554 const vector<t_const*>& consts = program->get_consts();
555 vector<t_const*>::const_iterator c_iter;
556 for (c_iter = consts.begin(); c_iter != consts.end(); ++c_iter) {
557 t_const* co = *c_iter;
558 if (co->has_doc()) {
559 printf("const %s:\n%s\n", co->get_name().c_str(), co->get_doc().c_str());
560 }
561 }
562 const vector<t_struct*>& structs = program->get_structs();
563 vector<t_struct*>::const_iterator s_iter;
564 for (s_iter = structs.begin(); s_iter != structs.end(); ++s_iter) {
565 t_struct* st = *s_iter;
566 if (st->has_doc()) {
567 printf("struct %s:\n%s\n", st->get_name().c_str(), st->get_doc().c_str());
568 }
569 }
570 const vector<t_struct*>& xceptions = program->get_xceptions();
571 vector<t_struct*>::const_iterator x_iter;
572 for (x_iter = xceptions.begin(); x_iter != xceptions.end(); ++x_iter) {
573 t_struct* xn = *x_iter;
574 if (xn->has_doc()) {
575 printf("xception %s:\n%s\n", xn->get_name().c_str(), xn->get_doc().c_str());
576 }
577 }
578 const vector<t_service*>& services = program->get_services();
579 vector<t_service*>::const_iterator v_iter;
580 for (v_iter = services.begin(); v_iter != services.end(); ++v_iter) {
581 t_service* sv = *v_iter;
582 if (sv->has_doc()) {
583 printf("service %s:\n%s\n", sv->get_name().c_str(), sv->get_doc().c_str());
David Reiss1ac05802007-07-30 22:00:27 +0000584 }
585 }
586}
587
588/**
David Reiss3c5d2fd2008-02-08 21:58:06 +0000589 * Call generate_fingerprint for every structure and enum.
David Reiss18bf22d2007-08-28 20:49:17 +0000590 */
591void generate_all_fingerprints(t_program* program) {
592 const vector<t_struct*>& structs = program->get_structs();
593 vector<t_struct*>::const_iterator s_iter;
594 for (s_iter = structs.begin(); s_iter != structs.end(); ++s_iter) {
595 t_struct* st = *s_iter;
596 st->generate_fingerprint();
597 }
598
David Reissd779cbe2007-08-31 01:42:55 +0000599 const vector<t_struct*>& xceptions = program->get_xceptions();
600 vector<t_struct*>::const_iterator x_iter;
601 for (x_iter = xceptions.begin(); x_iter != xceptions.end(); ++x_iter) {
602 t_struct* st = *x_iter;
603 st->generate_fingerprint();
604 }
605
David Reiss3c5d2fd2008-02-08 21:58:06 +0000606 const vector<t_enum*>& enums = program->get_enums();
607 vector<t_enum*>::const_iterator e_iter;
608 for (e_iter = enums.begin(); e_iter != enums.end(); ++e_iter) {
609 t_enum* e = *e_iter;
610 e->generate_fingerprint();
611 }
612
David Reiss47557bc2007-09-04 21:31:04 +0000613 g_type_void->generate_fingerprint();
614
David Reiss18bf22d2007-08-28 20:49:17 +0000615 // If you want to generate fingerprints for implicit structures, start here.
616 /*
617 const vector<t_service*>& services = program->get_services();
618 vector<t_service*>::const_iterator v_iter;
619 for (v_iter = services.begin(); v_iter != services.end(); ++v_iter) {
620 t_service* sv = *v_iter;
621 }
622 */
623}
624
625/**
David Reissdd08f6d2008-06-30 20:24:24 +0000626 * Prints the version number
627 */
628void version() {
Bryan Duxburya1e268c2010-05-03 21:33:00 +0000629 printf("Thrift version %s\n", THRIFT_VERSION);
David Reissdd08f6d2008-06-30 20:24:24 +0000630}
631
632/**
Jake Farrell2fd8a152012-09-29 00:26:36 +0000633 * Display the usage message and then exit with an error code.
Mark Slee31985722006-05-24 21:45:31 +0000634 */
635void usage() {
Jake Farrell2fd8a152012-09-29 00:26:36 +0000636 fprintf(stderr, "Usage: thrift [options] file\n\n");
637 fprintf(stderr, "Use thrift -help for a list of options\n");
638 exit(1);
639}
640
641/**
642 * Diplays the help message and then exits with an error code.
643 */
644void help() {
Mark Sleeb15a68b2006-06-07 06:46:24 +0000645 fprintf(stderr, "Usage: thrift [options] file\n");
646 fprintf(stderr, "Options:\n");
David Reissdd08f6d2008-06-30 20:24:24 +0000647 fprintf(stderr, " -version Print the compiler version\n");
dweatherford65b70752007-10-31 02:18:14 +0000648 fprintf(stderr, " -o dir Set the output directory for gen-* packages\n");
649 fprintf(stderr, " (default: current directory)\n");
Bryan Duxburybdca9f62011-03-01 19:53:07 +0000650 fprintf(stderr, " -out dir Set the ouput location for generated files.\n");
651 fprintf(stderr," (no gen-* folder will be created)\n");
David Reissd779cbe2007-08-31 01:42:55 +0000652 fprintf(stderr, " -I dir Add a directory to the list of directories\n");
Mark Slee227ac2c2007-03-07 05:46:50 +0000653 fprintf(stderr, " searched for include directives\n");
Mark Slee2329a832006-11-09 00:23:30 +0000654 fprintf(stderr, " -nowarn Suppress all compiler warnings (BAD!)\n");
655 fprintf(stderr, " -strict Strict compiler warnings on\n");
656 fprintf(stderr, " -v[erbose] Verbose mode\n");
657 fprintf(stderr, " -r[ecurse] Also generate included files\n");
658 fprintf(stderr, " -debug Parse debug trace to stdout\n");
Bryan Duxburyc7206a42011-08-17 23:17:04 +0000659 fprintf(stderr, " --allow-neg-keys Allow negative field keys (Used to "
660 "preserve protocol\n");
661 fprintf(stderr, " compatibility with older .thrift files)\n");
Roger Meier887ff752011-08-19 11:25:39 +0000662 fprintf(stderr, " --allow-64bit-consts Do not print warnings about using 64-bit constants\n");
David Reissbd0db882008-02-27 01:54:51 +0000663 fprintf(stderr, " --gen STR Generate code with a dynamically-registered generator.\n");
664 fprintf(stderr, " STR has the form language[:key1=val1[,key2,[key3=val3]]].\n");
665 fprintf(stderr, " Keys and values are options passed to the generator.\n");
666 fprintf(stderr, " Many options will not require values.\n");
667 fprintf(stderr, "\n");
668 fprintf(stderr, "Available generators (and options):\n");
669
670 t_generator_registry::gen_map_t gen_map = t_generator_registry::get_generator_map();
671 t_generator_registry::gen_map_t::iterator iter;
672 for (iter = gen_map.begin(); iter != gen_map.end(); ++iter) {
673 fprintf(stderr, " %s (%s):\n",
674 iter->second->get_short_name().c_str(),
675 iter->second->get_long_name().c_str());
676 fprintf(stderr, "%s", iter->second->get_documentation().c_str());
677 }
Mark Slee31985722006-05-24 21:45:31 +0000678 exit(1);
679}
680
681/**
Mark Slee30152872006-11-28 01:24:07 +0000682 * You know, when I started working on Thrift I really thought it wasn't going
683 * to become a programming language because it was just a generator and it
684 * wouldn't need runtime type information and all that jazz. But then we
685 * decided to add constants, and all of a sudden that means runtime type
686 * validation and inference, except the "runtime" is the code generator
David Reiss3bb5e052010-01-25 19:31:31 +0000687 * runtime.
Mark Slee30152872006-11-28 01:24:07 +0000688 */
689void validate_const_rec(std::string name, t_type* type, t_const_value* value) {
690 if (type->is_void()) {
691 throw "type error: cannot declare a void const: " + name;
692 }
693
694 if (type->is_base_type()) {
695 t_base_type::t_base tbase = ((t_base_type*)type)->get_base();
696 switch (tbase) {
697 case t_base_type::TYPE_STRING:
698 if (value->get_type() != t_const_value::CV_STRING) {
699 throw "type error: const \"" + name + "\" was declared as string";
700 }
701 break;
702 case t_base_type::TYPE_BOOL:
703 if (value->get_type() != t_const_value::CV_INTEGER) {
704 throw "type error: const \"" + name + "\" was declared as bool";
705 }
706 break;
707 case t_base_type::TYPE_BYTE:
708 if (value->get_type() != t_const_value::CV_INTEGER) {
709 throw "type error: const \"" + name + "\" was declared as byte";
710 }
711 break;
712 case t_base_type::TYPE_I16:
713 if (value->get_type() != t_const_value::CV_INTEGER) {
714 throw "type error: const \"" + name + "\" was declared as i16";
715 }
716 break;
717 case t_base_type::TYPE_I32:
718 if (value->get_type() != t_const_value::CV_INTEGER) {
719 throw "type error: const \"" + name + "\" was declared as i32";
720 }
721 break;
722 case t_base_type::TYPE_I64:
723 if (value->get_type() != t_const_value::CV_INTEGER) {
724 throw "type error: const \"" + name + "\" was declared as i64";
725 }
726 break;
727 case t_base_type::TYPE_DOUBLE:
728 if (value->get_type() != t_const_value::CV_INTEGER &&
729 value->get_type() != t_const_value::CV_DOUBLE) {
730 throw "type error: const \"" + name + "\" was declared as double";
731 }
732 break;
733 default:
David Reissdd7796f2007-08-28 21:09:06 +0000734 throw "compiler error: no const of base type " + t_base_type::t_base_name(tbase) + name;
Mark Slee30152872006-11-28 01:24:07 +0000735 }
736 } else if (type->is_enum()) {
Bryan Duxbury2d804702009-12-18 19:41:11 +0000737 if (value->get_type() != t_const_value::CV_IDENTIFIER) {
Mark Slee30152872006-11-28 01:24:07 +0000738 throw "type error: const \"" + name + "\" was declared as enum";
739 }
Bryan Duxbury2d804702009-12-18 19:41:11 +0000740
Bryan Duxbury1606f252010-11-24 00:25:57 +0000741 // see if there's a dot in the identifier
742 std::string name_portion = value->get_identifier_name();
743
Bryan Duxbury2d804702009-12-18 19:41:11 +0000744 const vector<t_enum_value*>& enum_values = ((t_enum*)type)->get_constants();
745 vector<t_enum_value*>::const_iterator c_iter;
746 bool found = false;
Bryan Duxbury9f0a7862010-09-12 14:38:36 +0000747
Bryan Duxbury1606f252010-11-24 00:25:57 +0000748 for (c_iter = enum_values.begin(); c_iter != enum_values.end(); ++c_iter) {
Bryan Duxbury9f0a7862010-09-12 14:38:36 +0000749 if ((*c_iter)->get_name() == name_portion) {
Bryan Duxbury2d804702009-12-18 19:41:11 +0000750 found = true;
751 break;
752 }
753 }
754 if (!found) {
755 throw "type error: const " + name + " was declared as type "
756 + type->get_name() + " which is an enum, but "
757 + value->get_identifier() + " is not a valid value for that enum";
758 }
Mark Slee30152872006-11-28 01:24:07 +0000759 } else if (type->is_struct() || type->is_xception()) {
760 if (value->get_type() != t_const_value::CV_MAP) {
761 throw "type error: const \"" + name + "\" was declared as struct/xception";
762 }
763 const vector<t_field*>& fields = ((t_struct*)type)->get_members();
764 vector<t_field*>::const_iterator f_iter;
765
766 const map<t_const_value*, t_const_value*>& val = value->get_map();
767 map<t_const_value*, t_const_value*>::const_iterator v_iter;
768 for (v_iter = val.begin(); v_iter != val.end(); ++v_iter) {
769 if (v_iter->first->get_type() != t_const_value::CV_STRING) {
770 throw "type error: " + name + " struct key must be string";
771 }
772 t_type* field_type = NULL;
773 for (f_iter = fields.begin(); f_iter != fields.end(); ++f_iter) {
774 if ((*f_iter)->get_name() == v_iter->first->get_string()) {
775 field_type = (*f_iter)->get_type();
776 }
777 }
778 if (field_type == NULL) {
779 throw "type error: " + type->get_name() + " has no field " + v_iter->first->get_string();
780 }
781
782 validate_const_rec(name + "." + v_iter->first->get_string(), field_type, v_iter->second);
783 }
784 } else if (type->is_map()) {
785 t_type* k_type = ((t_map*)type)->get_key_type();
786 t_type* v_type = ((t_map*)type)->get_val_type();
787 const map<t_const_value*, t_const_value*>& val = value->get_map();
788 map<t_const_value*, t_const_value*>::const_iterator v_iter;
789 for (v_iter = val.begin(); v_iter != val.end(); ++v_iter) {
790 validate_const_rec(name + "<key>", k_type, v_iter->first);
791 validate_const_rec(name + "<val>", v_type, v_iter->second);
Mark Slee2c44d202007-05-16 02:18:07 +0000792 }
Mark Slee30152872006-11-28 01:24:07 +0000793 } else if (type->is_list() || type->is_set()) {
794 t_type* e_type;
795 if (type->is_list()) {
796 e_type = ((t_list*)type)->get_elem_type();
797 } else {
798 e_type = ((t_set*)type)->get_elem_type();
799 }
800 const vector<t_const_value*>& val = value->get_list();
801 vector<t_const_value*>::const_iterator v_iter;
802 for (v_iter = val.begin(); v_iter != val.end(); ++v_iter) {
803 validate_const_rec(name + "<elem>", e_type, *v_iter);
804 }
805 }
806}
807
808/**
Jens Geyer12c09f42013-08-25 14:16:27 +0200809 * Check simple identifier names
810 * It's easier to do it this way instead of rewriting the whole grammar etc.
811 */
812void validate_simple_identifier(const char* identifier) {
813 string name( identifier);
814 if( name.find(".") != string::npos) {
815 yyerror("Identifier %s can't have a dot.", identifier);
816 exit(1);
817 }
818}
819
820/**
Mark Slee30152872006-11-28 01:24:07 +0000821 * Check the type of the parsed const information against its declared type
822 */
823void validate_const_type(t_const* c) {
824 validate_const_rec(c->get_name(), c->get_type(), c->get_value());
825}
826
827/**
Mark Slee7ff32452007-02-01 05:26:18 +0000828 * Check the type of a default value assigned to a field.
829 */
830void validate_field_value(t_field* field, t_const_value* cv) {
831 validate_const_rec(field->get_name(), field->get_type(), cv);
832}
833
834/**
Mark Slee91f2b7b2008-01-31 01:49:16 +0000835 * Check that all the elements of a throws block are actually exceptions.
836 */
837bool validate_throws(t_struct* throws) {
838 const vector<t_field*>& members = throws->get_members();
839 vector<t_field*>::const_iterator m_iter;
840 for (m_iter = members.begin(); m_iter != members.end(); ++m_iter) {
Bryan Duxburycff83572011-08-24 20:53:03 +0000841 if (!t_generator::get_true_type((*m_iter)->get_type())->is_xception()) {
Mark Slee91f2b7b2008-01-31 01:49:16 +0000842 return false;
843 }
844 }
845 return true;
846}
847
848/**
Jens Geyer03d49442013-09-04 22:34:41 +0200849 * Skips UTF-8 BOM if there is one
850 */
851bool skip_utf8_bom(FILE* f) {
852
853 // pretty straightforward, but works
854 if( fgetc(f) == 0xEF) {
855 if( fgetc(f) == 0xBB) {
856 if( fgetc(f) == 0xBF) {
857 return true;
858 }
859 }
860 }
861
862 rewind(f);
863 return false;
864}
865
866/**
Mark Sleef0712dc2006-10-25 19:03:57 +0000867 * Parses a program
868 */
Mark Slee2c44d202007-05-16 02:18:07 +0000869void parse(t_program* program, t_program* parent_program) {
Mark Sleef0712dc2006-10-25 19:03:57 +0000870 // Get scope file path
871 string path = program->get_path();
Mark Slee2c44d202007-05-16 02:18:07 +0000872
Mark Sleef0712dc2006-10-25 19:03:57 +0000873 // Set current dir global, which is used in the include_file function
874 g_curdir = directory_name(path);
875 g_curpath = path;
876
877 // Open the file
Jens Geyer03d49442013-09-04 22:34:41 +0200878 // skip UTF-8 BOM if there is one
Mark Sleef0712dc2006-10-25 19:03:57 +0000879 yyin = fopen(path.c_str(), "r");
880 if (yyin == 0) {
881 failure("Could not open input file: \"%s\"", path.c_str());
882 }
Jens Geyer03d49442013-09-04 22:34:41 +0200883 if( skip_utf8_bom( yyin))
884 pverbose("Skipped UTF-8 BOM at %s\n", path.c_str());
885
Mark Sleef0712dc2006-10-25 19:03:57 +0000886 // Create new scope and scan for includes
887 pverbose("Scanning %s for includes\n", path.c_str());
Mark Slee2c44d202007-05-16 02:18:07 +0000888 g_parse_mode = INCLUDES;
Mark Sleef0712dc2006-10-25 19:03:57 +0000889 g_program = program;
890 g_scope = program->scope();
Mark Slee30152872006-11-28 01:24:07 +0000891 try {
Mark Slee36bfa2e2007-01-19 20:09:51 +0000892 yylineno = 1;
Mark Slee30152872006-11-28 01:24:07 +0000893 if (yyparse() != 0) {
894 failure("Parser error during include pass.");
895 }
896 } catch (string x) {
897 failure(x.c_str());
Mark Sleef0712dc2006-10-25 19:03:57 +0000898 }
899 fclose(yyin);
900
901 // Recursively parse all the include programs
902 vector<t_program*>& includes = program->get_includes();
903 vector<t_program*>::iterator iter;
904 for (iter = includes.begin(); iter != includes.end(); ++iter) {
905 parse(*iter, program);
906 }
907
David Reiss204420f2008-01-11 20:59:03 +0000908 // Parse the program file
Mark Sleef0712dc2006-10-25 19:03:57 +0000909 g_parse_mode = PROGRAM;
910 g_program = program;
911 g_scope = program->scope();
912 g_parent_scope = (parent_program != NULL) ? parent_program->scope() : NULL;
913 g_parent_prefix = program->get_name() + ".";
914 g_curpath = path;
Jens Geyer03d49442013-09-04 22:34:41 +0200915
916 // Open the file
917 // skip UTF-8 BOM if there is one
Mark Sleef0712dc2006-10-25 19:03:57 +0000918 yyin = fopen(path.c_str(), "r");
919 if (yyin == 0) {
920 failure("Could not open input file: \"%s\"", path.c_str());
921 }
Jens Geyer03d49442013-09-04 22:34:41 +0200922 if( skip_utf8_bom( yyin))
923 pverbose("Skipped UTF-8 BOM at %s\n", path.c_str());
924
Mark Sleef0712dc2006-10-25 19:03:57 +0000925 pverbose("Parsing %s for types\n", path.c_str());
Mark Slee36bfa2e2007-01-19 20:09:51 +0000926 yylineno = 1;
David Reiss877237a2007-07-27 00:40:19 +0000927 try {
928 if (yyparse() != 0) {
929 failure("Parser error during types pass.");
930 }
931 } catch (string x) {
932 failure(x.c_str());
Mark Sleef0712dc2006-10-25 19:03:57 +0000933 }
934 fclose(yyin);
935}
936
937/**
938 * Generate code
939 */
David Reissbd0db882008-02-27 01:54:51 +0000940void generate(t_program* program, const vector<string>& generator_strings) {
Mark Sleef0712dc2006-10-25 19:03:57 +0000941 // Oooohh, recursive code generation, hot!!
942 if (gen_recurse) {
943 const vector<t_program*>& includes = program->get_includes();
944 for (size_t i = 0; i < includes.size(); ++i) {
dweatherford65b70752007-10-31 02:18:14 +0000945 // Propogate output path from parent to child programs
Bryan Duxburybdca9f62011-03-01 19:53:07 +0000946 includes[i]->set_out_path(program->get_out_path(), program->is_out_path_absolute());
Mark Slee5b743072007-11-13 04:00:29 +0000947
David Reissbd0db882008-02-27 01:54:51 +0000948 generate(includes[i], generator_strings);
Mark Sleef0712dc2006-10-25 19:03:57 +0000949 }
950 }
951
952 // Generate code!
953 try {
954 pverbose("Program: %s\n", program->get_path().c_str());
955
David Reiss18bf22d2007-08-28 20:49:17 +0000956 // Compute fingerprints.
957 generate_all_fingerprints(program);
958
David Reiss1ac05802007-07-30 22:00:27 +0000959 if (dump_docs) {
960 dump_docstrings(program);
961 }
David Reissbd0db882008-02-27 01:54:51 +0000962
963 vector<string>::const_iterator iter;
964 for (iter = generator_strings.begin(); iter != generator_strings.end(); ++iter) {
965 t_generator* generator = t_generator_registry::get_generator(program, *iter);
966
967 if (generator == NULL) {
968 pwarning(1, "Unable to get a generator for \"%s\".\n", iter->c_str());
969 } else {
970 pverbose("Generating \"%s\"\n", iter->c_str());
971 generator->generate_program();
David Reissc9342682008-03-27 21:39:49 +0000972 delete generator;
David Reissbd0db882008-02-27 01:54:51 +0000973 }
974 }
975
Mark Sleef0712dc2006-10-25 19:03:57 +0000976 } catch (string s) {
977 printf("Error: %s\n", s.c_str());
978 } catch (const char* exc) {
979 printf("Error: %s\n", exc);
980 }
981
982}
983
984/**
Mark Sleef5377b32006-10-10 01:42:59 +0000985 * Parse it up.. then spit it back out, in pretty much every language. Alright
986 * not that many languages, but the cool ones that we care about.
Mark Slee31985722006-05-24 21:45:31 +0000987 */
988int main(int argc, char** argv) {
989 int i;
dweatherford65b70752007-10-31 02:18:14 +0000990 std::string out_path;
Bryan Duxburybdca9f62011-03-01 19:53:07 +0000991 bool out_path_is_absolute = false;
Mark Sleef5377b32006-10-10 01:42:59 +0000992
Mark Sleeb15a68b2006-06-07 06:46:24 +0000993 // Setup time string
994 time_t now = time(NULL);
995 g_time_str = ctime(&now);
Mark Slee31985722006-05-24 21:45:31 +0000996
Mark Sleef0712dc2006-10-25 19:03:57 +0000997 // Check for necessary arguments, you gotta have at least a filename and
998 // an output language flag
Mark Sleeb15a68b2006-06-07 06:46:24 +0000999 if (argc < 2) {
1000 usage();
1001 }
Mark Slee31985722006-05-24 21:45:31 +00001002
David Reissbd0db882008-02-27 01:54:51 +00001003 vector<string> generator_strings;
1004
David Reiss9cc2c132008-02-27 01:54:47 +00001005 // Set the current path to a dummy value to make warning messages clearer.
1006 g_curpath = "arguments";
1007
Mark Sleef5377b32006-10-10 01:42:59 +00001008 // Hacky parameter handling... I didn't feel like using a library sorry!
Mark Slee31985722006-05-24 21:45:31 +00001009 for (i = 1; i < argc-1; i++) {
Mark Sleefdbee812006-09-27 18:50:48 +00001010 char* arg;
Mark Slee2329a832006-11-09 00:23:30 +00001011
Mark Sleefdbee812006-09-27 18:50:48 +00001012 arg = strtok(argv[i], " ");
1013 while (arg != NULL) {
Mark Slee2329a832006-11-09 00:23:30 +00001014 // Treat double dashes as single dashes
Mark Slee52cb2232006-11-10 22:32:07 +00001015 if (arg[0] == '-' && arg[1] == '-') {
Mark Slee2329a832006-11-09 00:23:30 +00001016 ++arg;
1017 }
1018
Jake Farrell2fd8a152012-09-29 00:26:36 +00001019 if (strcmp(arg, "-help") == 0) {
1020 help();
1021 } else if (strcmp(arg, "-version") == 0) {
David Reissdd08f6d2008-06-30 20:24:24 +00001022 version();
1023 exit(1);
1024 } else if (strcmp(arg, "-debug") == 0) {
Mark Sleefdbee812006-09-27 18:50:48 +00001025 g_debug = 1;
Mark Slee2329a832006-11-09 00:23:30 +00001026 } else if (strcmp(arg, "-nowarn") == 0) {
Mark Sleef0712dc2006-10-25 19:03:57 +00001027 g_warn = 0;
Mark Slee2329a832006-11-09 00:23:30 +00001028 } else if (strcmp(arg, "-strict") == 0) {
Bryan Duxburya145b4d2009-04-03 17:29:25 +00001029 g_strict = 255;
Mark Sleef0712dc2006-10-25 19:03:57 +00001030 g_warn = 2;
Mark Slee2329a832006-11-09 00:23:30 +00001031 } else if (strcmp(arg, "-v") == 0 || strcmp(arg, "-verbose") == 0 ) {
Mark Sleef0712dc2006-10-25 19:03:57 +00001032 g_verbose = 1;
Mark Slee2329a832006-11-09 00:23:30 +00001033 } else if (strcmp(arg, "-r") == 0 || strcmp(arg, "-recurse") == 0 ) {
Mark Sleef0712dc2006-10-25 19:03:57 +00001034 gen_recurse = true;
Bryan Duxburyc7206a42011-08-17 23:17:04 +00001035 } else if (strcmp(arg, "-allow-neg-keys") == 0) {
1036 g_allow_neg_field_keys = true;
Roger Meier887ff752011-08-19 11:25:39 +00001037 } else if (strcmp(arg, "-allow-64bit-consts") == 0) {
1038 g_allow_64bit_consts = true;
David Reissbd0db882008-02-27 01:54:51 +00001039 } else if (strcmp(arg, "-gen") == 0) {
1040 arg = argv[++i];
1041 if (arg == NULL) {
Jake Farrell2fd8a152012-09-29 00:26:36 +00001042 fprintf(stderr, "Missing generator specification\n");
David Reissbd0db882008-02-27 01:54:51 +00001043 usage();
1044 }
1045 generator_strings.push_back(arg);
Martin Kraemer32c66e12006-11-09 00:06:36 +00001046 } else if (strcmp(arg, "-I") == 0) {
1047 // An argument of "-I\ asdf" is invalid and has unknown results
1048 arg = argv[++i];
1049
1050 if (arg == NULL) {
Jake Farrell2fd8a152012-09-29 00:26:36 +00001051 fprintf(stderr, "Missing Include directory\n");
Martin Kraemer32c66e12006-11-09 00:06:36 +00001052 usage();
1053 }
1054 g_incl_searchpath.push_back(arg);
Bryan Duxburybdca9f62011-03-01 19:53:07 +00001055 } else if ((strcmp(arg, "-o") == 0) || (strcmp(arg, "-out") == 0)) {
1056 out_path_is_absolute = (strcmp(arg, "-out") == 0) ? true : false;
Roger Meier6d7473d2013-05-06 01:08:36 +02001057 arg = argv[++i];
dweatherford65b70752007-10-31 02:18:14 +00001058 if (arg == NULL) {
David Reiss9d866ac2008-06-10 22:56:19 +00001059 fprintf(stderr, "-o: missing output directory\n");
dweatherford65b70752007-10-31 02:18:14 +00001060 usage();
Mark Slee5b743072007-11-13 04:00:29 +00001061 }
dweatherford65b70752007-10-31 02:18:14 +00001062 out_path = arg;
David Reiss204420f2008-01-11 20:59:03 +00001063
1064#ifdef MINGW
1065 //strip out trailing \ on Windows
1066 int last = out_path.length()-1;
1067 if (out_path[last] == '\\')
1068 {
1069 out_path.erase(last);
1070 }
1071#endif
Roger Meier061d4a22012-10-07 11:51:00 +00001072 if (!check_is_directory(out_path.c_str()))
dweatherford65b70752007-10-31 02:18:14 +00001073 return -1;
Mark Sleefdbee812006-09-27 18:50:48 +00001074 } else {
Jake Farrell2fd8a152012-09-29 00:26:36 +00001075 fprintf(stderr, "Unrecognized option: %s\n", arg);
Mark Sleefdbee812006-09-27 18:50:48 +00001076 usage();
1077 }
1078
1079 // Tokenize more
1080 arg = strtok(NULL, " ");
Mark Slee31985722006-05-24 21:45:31 +00001081 }
1082 }
Mark Slee2c44d202007-05-16 02:18:07 +00001083
Jake Farrell2fd8a152012-09-29 00:26:36 +00001084 // display help
1085 if ((strcmp(argv[argc-1], "-help") == 0) || (strcmp(argv[argc-1], "--help") == 0)) {
1086 help();
1087 }
1088
David Reissdd08f6d2008-06-30 20:24:24 +00001089 // if you're asking for version, you have a right not to pass a file
Jake Farrell2fd8a152012-09-29 00:26:36 +00001090 if ((strcmp(argv[argc-1], "-version") == 0) || (strcmp(argv[argc-1], "--version") == 0)) {
David Reissdd08f6d2008-06-30 20:24:24 +00001091 version();
1092 exit(1);
1093 }
1094
Mark Sleef0712dc2006-10-25 19:03:57 +00001095 // You gotta generate something!
David Reissa9ea68b2009-02-17 20:28:24 +00001096 if (generator_strings.empty()) {
Jake Farrell2fd8a152012-09-29 00:26:36 +00001097 fprintf(stderr, "No output language(s) specified\n");
Mark Sleeb15a68b2006-06-07 06:46:24 +00001098 usage();
1099 }
Mark Sleef0712dc2006-10-25 19:03:57 +00001100
1101 // Real-pathify it
1102 char rp[PATH_MAX];
David Reiss5245f402008-06-10 22:56:26 +00001103 if (argv[i] == NULL) {
Jake Farrell2fd8a152012-09-29 00:26:36 +00001104 fprintf(stderr, "Missing file name\n");
David Reiss5245f402008-06-10 22:56:26 +00001105 usage();
1106 }
David Reiss204420f2008-01-11 20:59:03 +00001107 if (saferealpath(argv[i], rp) == NULL) {
1108 failure("Could not open input file with realpath: %s", argv[i]);
Mark Slee31985722006-05-24 21:45:31 +00001109 }
Mark Sleef0712dc2006-10-25 19:03:57 +00001110 string input_file(rp);
1111
Mark Sleef5377b32006-10-10 01:42:59 +00001112 // Instance of the global parse tree
Mark Sleef0712dc2006-10-25 19:03:57 +00001113 t_program* program = new t_program(input_file);
dweatherford65b70752007-10-31 02:18:14 +00001114 if (out_path.size()) {
Bryan Duxburybdca9f62011-03-01 19:53:07 +00001115 program->set_out_path(out_path, out_path_is_absolute);
dweatherford65b70752007-10-31 02:18:14 +00001116 }
kholst76f2c882008-01-16 02:47:41 +00001117
David Reiss4b6a3c72008-02-27 22:28:12 +00001118 // Compute the cpp include prefix.
1119 // infer this from the filename passed in
1120 string input_filename = argv[i];
1121 string include_prefix;
kholst76f2c882008-01-16 02:47:41 +00001122
David Reiss4b6a3c72008-02-27 22:28:12 +00001123 string::size_type last_slash = string::npos;
1124 if ((last_slash = input_filename.rfind("/")) != string::npos) {
1125 include_prefix = input_filename.substr(0, last_slash);
kholst76f2c882008-01-16 02:47:41 +00001126 }
Mark Sleef0712dc2006-10-25 19:03:57 +00001127
David Reiss4b6a3c72008-02-27 22:28:12 +00001128 program->set_include_prefix(include_prefix);
1129
Mark Sleef0712dc2006-10-25 19:03:57 +00001130 // Initialize global types
1131 g_type_void = new t_base_type("void", t_base_type::TYPE_VOID);
1132 g_type_string = new t_base_type("string", t_base_type::TYPE_STRING);
Mark Slee8d725a22007-04-13 01:57:12 +00001133 g_type_binary = new t_base_type("string", t_base_type::TYPE_STRING);
1134 ((t_base_type*)g_type_binary)->set_binary(true);
Mark Sleeb6200d82007-01-19 19:14:36 +00001135 g_type_slist = new t_base_type("string", t_base_type::TYPE_STRING);
1136 ((t_base_type*)g_type_slist)->set_string_list(true);
Mark Sleef0712dc2006-10-25 19:03:57 +00001137 g_type_bool = new t_base_type("bool", t_base_type::TYPE_BOOL);
1138 g_type_byte = new t_base_type("byte", t_base_type::TYPE_BYTE);
1139 g_type_i16 = new t_base_type("i16", t_base_type::TYPE_I16);
1140 g_type_i32 = new t_base_type("i32", t_base_type::TYPE_I32);
1141 g_type_i64 = new t_base_type("i64", t_base_type::TYPE_I64);
1142 g_type_double = new t_base_type("double", t_base_type::TYPE_DOUBLE);
Mark Sleee8540632006-05-30 09:24:40 +00001143
Mark Sleef5377b32006-10-10 01:42:59 +00001144 // Parse it!
Mark Sleef0712dc2006-10-25 19:03:57 +00001145 parse(program, NULL);
Mark Slee31985722006-05-24 21:45:31 +00001146
David Reiss9cc2c132008-02-27 01:54:47 +00001147 // The current path is not really relevant when we are doing generation.
1148 // Reset the variable to make warning messages clearer.
1149 g_curpath = "generation";
1150 // Reset yylineno for the heck of it. Use 1 instead of 0 because
1151 // That is what shows up during argument parsing.
1152 yylineno = 1;
1153
Mark Sleef0712dc2006-10-25 19:03:57 +00001154 // Generate it!
David Reissbd0db882008-02-27 01:54:51 +00001155 generate(program, generator_strings);
Mark Sleeb15a68b2006-06-07 06:46:24 +00001156
Mark Sleef0712dc2006-10-25 19:03:57 +00001157 // Clean up. Who am I kidding... this program probably orphans heap memory
1158 // all over the place, but who cares because it is about to exit and it is
1159 // all referenced and used by this wacky parse tree up until now anyways.
Mark Sleeb15a68b2006-06-07 06:46:24 +00001160
Mark Sleef0712dc2006-10-25 19:03:57 +00001161 delete program;
1162 delete g_type_void;
1163 delete g_type_string;
1164 delete g_type_bool;
1165 delete g_type_byte;
1166 delete g_type_i16;
1167 delete g_type_i32;
1168 delete g_type_i64;
1169 delete g_type_double;
Mark Slee31985722006-05-24 21:45:31 +00001170
1171 // Finished
Mark Slee31985722006-05-24 21:45:31 +00001172 return 0;
1173}