cmFortranParserImpl.cxx 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417
  1. /* Distributed under the OSI-approved BSD 3-Clause License. See accompanying
  2. file Copyright.txt or https://cmake.org/licensing for details. */
  3. #include "cmFortranParser.h"
  4. #include "cmSystemTools.h"
  5. #include <assert.h>
  6. #include <set>
  7. #include <stack>
  8. #include <stdio.h>
  9. #include <string>
  10. #include <utility>
  11. #include <vector>
  12. bool cmFortranParser_s::FindIncludeFile(const char* dir,
  13. const char* includeName,
  14. std::string& fileName)
  15. {
  16. // If the file is a full path, include it directly.
  17. if (cmSystemTools::FileIsFullPath(includeName)) {
  18. fileName = includeName;
  19. return cmSystemTools::FileExists(fileName, true);
  20. }
  21. // Check for the file in the directory containing the including
  22. // file.
  23. std::string fullName = dir;
  24. fullName += "/";
  25. fullName += includeName;
  26. if (cmSystemTools::FileExists(fullName, true)) {
  27. fileName = fullName;
  28. return true;
  29. }
  30. // Search the include path for the file.
  31. for (std::string const& i : this->IncludePath) {
  32. fullName = i;
  33. fullName += "/";
  34. fullName += includeName;
  35. if (cmSystemTools::FileExists(fullName, true)) {
  36. fileName = fullName;
  37. return true;
  38. }
  39. }
  40. return false;
  41. }
  42. cmFortranParser_s::cmFortranParser_s(std::vector<std::string> includes,
  43. std::set<std::string> defines,
  44. cmFortranSourceInfo& info)
  45. : IncludePath(std::move(includes))
  46. , PPDefinitions(std::move(defines))
  47. , Info(info)
  48. {
  49. this->InInterface = false;
  50. this->InPPFalseBranch = 0;
  51. // Initialize the lexical scanner.
  52. cmFortran_yylex_init(&this->Scanner);
  53. cmFortran_yyset_extra(this, this->Scanner);
  54. // Create a dummy buffer that is never read but is the fallback
  55. // buffer when the last file is popped off the stack.
  56. YY_BUFFER_STATE buffer =
  57. cmFortran_yy_create_buffer(nullptr, 4, this->Scanner);
  58. cmFortran_yy_switch_to_buffer(buffer, this->Scanner);
  59. }
  60. cmFortranParser_s::~cmFortranParser_s()
  61. {
  62. cmFortran_yylex_destroy(this->Scanner);
  63. }
  64. bool cmFortranParser_FilePush(cmFortranParser* parser, const char* fname)
  65. {
  66. // Open the new file and push it onto the stack. Save the old
  67. // buffer with it on the stack.
  68. if (FILE* file = cmsys::SystemTools::Fopen(fname, "rb")) {
  69. YY_BUFFER_STATE current = cmFortranLexer_GetCurrentBuffer(parser->Scanner);
  70. std::string dir = cmSystemTools::GetParentDirectory(fname);
  71. cmFortranFile f(file, current, dir);
  72. YY_BUFFER_STATE buffer =
  73. cmFortran_yy_create_buffer(nullptr, 16384, parser->Scanner);
  74. cmFortran_yy_switch_to_buffer(buffer, parser->Scanner);
  75. parser->FileStack.push(f);
  76. return true;
  77. }
  78. return false;
  79. }
  80. bool cmFortranParser_FilePop(cmFortranParser* parser)
  81. {
  82. // Pop one file off the stack and close it. Switch the lexer back
  83. // to the next one on the stack.
  84. if (parser->FileStack.empty()) {
  85. return false;
  86. }
  87. cmFortranFile f = parser->FileStack.top();
  88. parser->FileStack.pop();
  89. fclose(f.File);
  90. YY_BUFFER_STATE current = cmFortranLexer_GetCurrentBuffer(parser->Scanner);
  91. cmFortran_yy_delete_buffer(current, parser->Scanner);
  92. cmFortran_yy_switch_to_buffer(f.Buffer, parser->Scanner);
  93. return true;
  94. }
  95. int cmFortranParser_Input(cmFortranParser* parser, char* buffer,
  96. size_t bufferSize)
  97. {
  98. // Read from the file on top of the stack. If the stack is empty,
  99. // the end of the translation unit has been reached.
  100. if (!parser->FileStack.empty()) {
  101. cmFortranFile& ff = parser->FileStack.top();
  102. FILE* file = ff.File;
  103. size_t n = fread(buffer, 1, bufferSize, file);
  104. if (n > 0) {
  105. ff.LastCharWasNewline = buffer[n - 1] == '\n';
  106. } else if (!ff.LastCharWasNewline) {
  107. // The file ended without a newline. Inject one so
  108. // that the file always ends in an end-of-statement.
  109. buffer[0] = '\n';
  110. n = 1;
  111. ff.LastCharWasNewline = true;
  112. }
  113. return static_cast<int>(n);
  114. }
  115. return 0;
  116. }
  117. void cmFortranParser_StringStart(cmFortranParser* parser)
  118. {
  119. parser->TokenString.clear();
  120. }
  121. const char* cmFortranParser_StringEnd(cmFortranParser* parser)
  122. {
  123. return parser->TokenString.c_str();
  124. }
  125. void cmFortranParser_StringAppend(cmFortranParser* parser, char c)
  126. {
  127. parser->TokenString += c;
  128. }
  129. void cmFortranParser_SetInInterface(cmFortranParser* parser, bool in)
  130. {
  131. if (parser->InPPFalseBranch) {
  132. return;
  133. }
  134. parser->InInterface = in;
  135. }
  136. bool cmFortranParser_GetInInterface(cmFortranParser* parser)
  137. {
  138. return parser->InInterface;
  139. }
  140. void cmFortranParser_SetOldStartcond(cmFortranParser* parser, int arg)
  141. {
  142. parser->OldStartcond = arg;
  143. }
  144. int cmFortranParser_GetOldStartcond(cmFortranParser* parser)
  145. {
  146. return parser->OldStartcond;
  147. }
  148. void cmFortranParser_Error(cmFortranParser* parser, const char* msg)
  149. {
  150. parser->Error = msg ? msg : "unknown error";
  151. }
  152. void cmFortranParser_RuleUse(cmFortranParser* parser, const char* module_name)
  153. {
  154. if (parser->InPPFalseBranch) {
  155. return;
  156. }
  157. // syntax: "use module_name"
  158. // requires: "module_name.mod"
  159. std::string const& mod_name = cmSystemTools::LowerCase(module_name);
  160. parser->Info.Requires.insert(mod_name + ".mod");
  161. }
  162. void cmFortranParser_RuleLineDirective(cmFortranParser* parser,
  163. const char* filename)
  164. {
  165. // This is a #line directive naming a file encountered during preprocessing.
  166. std::string included = filename;
  167. // Skip #line directives referencing non-files like
  168. // "<built-in>" or "<command-line>".
  169. if (included.empty() || included[0] == '<') {
  170. return;
  171. }
  172. // Fix windows file path separators since our lexer does not
  173. // process escape sequences in string literals.
  174. cmSystemTools::ReplaceString(included, "\\\\", "\\");
  175. cmSystemTools::ConvertToUnixSlashes(included);
  176. // Save the named file as included in the source.
  177. if (cmSystemTools::FileExists(included, true)) {
  178. parser->Info.Includes.insert(included);
  179. }
  180. }
  181. void cmFortranParser_RuleInclude(cmFortranParser* parser, const char* name)
  182. {
  183. if (parser->InPPFalseBranch) {
  184. return;
  185. }
  186. // If processing an include statement there must be an open file.
  187. assert(!parser->FileStack.empty());
  188. // Get the directory containing the source in which the include
  189. // statement appears. This is always the first search location for
  190. // Fortran include files.
  191. std::string dir = parser->FileStack.top().Directory;
  192. // Find the included file. If it cannot be found just ignore the
  193. // problem because either the source will not compile or the user
  194. // does not care about depending on this included source.
  195. std::string fullName;
  196. if (parser->FindIncludeFile(dir.c_str(), name, fullName)) {
  197. // Found the included file. Save it in the set of included files.
  198. parser->Info.Includes.insert(fullName);
  199. // Parse it immediately to translate the source inline.
  200. cmFortranParser_FilePush(parser, fullName.c_str());
  201. }
  202. }
  203. void cmFortranParser_RuleModule(cmFortranParser* parser,
  204. const char* module_name)
  205. {
  206. if (parser->InPPFalseBranch) {
  207. return;
  208. }
  209. if (!parser->InInterface) {
  210. // syntax: "module module_name"
  211. // provides: "module_name.mod"
  212. std::string const& mod_name = cmSystemTools::LowerCase(module_name);
  213. parser->Info.Provides.insert(mod_name + ".mod");
  214. }
  215. }
  216. void cmFortranParser_RuleSubmodule(cmFortranParser* parser,
  217. const char* module_name,
  218. const char* submodule_name)
  219. {
  220. if (parser->InPPFalseBranch) {
  221. return;
  222. }
  223. // syntax: "submodule (module_name) submodule_name"
  224. // requires: "module_name.mod"
  225. // provides: "module_name@submodule_name.smod"
  226. //
  227. // FIXME: Some compilers split the submodule part of a module into a
  228. // separate "module_name.smod" file. Whether it is generated or
  229. // not depends on conditions more subtle than we currently detect.
  230. // For now we depend directly on "module_name.mod".
  231. std::string const& mod_name = cmSystemTools::LowerCase(module_name);
  232. std::string const& sub_name = cmSystemTools::LowerCase(submodule_name);
  233. parser->Info.Requires.insert(mod_name + ".mod");
  234. parser->Info.Provides.insert(mod_name + "@" + sub_name + ".smod");
  235. }
  236. void cmFortranParser_RuleSubmoduleNested(cmFortranParser* parser,
  237. const char* module_name,
  238. const char* submodule_name,
  239. const char* nested_submodule_name)
  240. {
  241. if (parser->InPPFalseBranch) {
  242. return;
  243. }
  244. // syntax: "submodule (module_name:submodule_name) nested_submodule_name"
  245. // requires: "module_name@submodule_name.smod"
  246. // provides: "module_name@nested_submodule_name.smod"
  247. std::string const& mod_name = cmSystemTools::LowerCase(module_name);
  248. std::string const& sub_name = cmSystemTools::LowerCase(submodule_name);
  249. std::string const& nest_name =
  250. cmSystemTools::LowerCase(nested_submodule_name);
  251. parser->Info.Requires.insert(mod_name + "@" + sub_name + ".smod");
  252. parser->Info.Provides.insert(mod_name + "@" + nest_name + ".smod");
  253. }
  254. void cmFortranParser_RuleDefine(cmFortranParser* parser, const char* macro)
  255. {
  256. if (!parser->InPPFalseBranch) {
  257. parser->PPDefinitions.insert(macro);
  258. }
  259. }
  260. void cmFortranParser_RuleUndef(cmFortranParser* parser, const char* macro)
  261. {
  262. if (!parser->InPPFalseBranch) {
  263. std::set<std::string>::iterator match;
  264. match = parser->PPDefinitions.find(macro);
  265. if (match != parser->PPDefinitions.end()) {
  266. parser->PPDefinitions.erase(match);
  267. }
  268. }
  269. }
  270. void cmFortranParser_RuleIfdef(cmFortranParser* parser, const char* macro)
  271. {
  272. // A new PP branch has been opened
  273. parser->SkipToEnd.push(false);
  274. if (parser->InPPFalseBranch) {
  275. parser->InPPFalseBranch++;
  276. } else if (parser->PPDefinitions.find(macro) ==
  277. parser->PPDefinitions.end()) {
  278. parser->InPPFalseBranch = 1;
  279. } else {
  280. parser->SkipToEnd.top() = true;
  281. }
  282. }
  283. void cmFortranParser_RuleIfndef(cmFortranParser* parser, const char* macro)
  284. {
  285. // A new PP branch has been opened
  286. parser->SkipToEnd.push(false);
  287. if (parser->InPPFalseBranch) {
  288. parser->InPPFalseBranch++;
  289. } else if (parser->PPDefinitions.find(macro) !=
  290. parser->PPDefinitions.end()) {
  291. parser->InPPFalseBranch = 1;
  292. } else {
  293. // ignore other branches
  294. parser->SkipToEnd.top() = true;
  295. }
  296. }
  297. void cmFortranParser_RuleIf(cmFortranParser* parser)
  298. {
  299. /* Note: The current parser is _not_ able to get statements like
  300. * #if 0
  301. * #if 1
  302. * #if MYSMBOL
  303. * #if defined(MYSYMBOL)
  304. * #if defined(MYSYMBOL) && ...
  305. * right. The same for #elif. Thus in
  306. * #if SYMBOL_1
  307. * ..
  308. * #elif SYMBOL_2
  309. * ...
  310. * ...
  311. * #elif SYMBOL_N
  312. * ..
  313. * #else
  314. * ..
  315. * #endif
  316. * _all_ N+1 branches are considered. If you got something like this
  317. * #if defined(MYSYMBOL)
  318. * #if !defined(MYSYMBOL)
  319. * use
  320. * #ifdef MYSYMBOL
  321. * #ifndef MYSYMBOL
  322. * instead.
  323. */
  324. // A new PP branch has been opened
  325. // Never skip! See note above.
  326. parser->SkipToEnd.push(false);
  327. }
  328. void cmFortranParser_RuleElif(cmFortranParser* parser)
  329. {
  330. /* Note: There are parser limitations. See the note at
  331. * cmFortranParser_RuleIf(..)
  332. */
  333. // Always taken unless an #ifdef or #ifndef-branch has been taken
  334. // already. If the second condition isn't meet already
  335. // (parser->InPPFalseBranch == 0) correct it.
  336. if (!parser->SkipToEnd.empty() && parser->SkipToEnd.top() &&
  337. !parser->InPPFalseBranch) {
  338. parser->InPPFalseBranch = 1;
  339. }
  340. }
  341. void cmFortranParser_RuleElse(cmFortranParser* parser)
  342. {
  343. // if the parent branch is false do nothing!
  344. if (parser->InPPFalseBranch > 1) {
  345. return;
  346. }
  347. // parser->InPPFalseBranch is either 0 or 1. We change it depending on
  348. // parser->SkipToEnd.top()
  349. if (!parser->SkipToEnd.empty() && parser->SkipToEnd.top()) {
  350. parser->InPPFalseBranch = 1;
  351. } else {
  352. parser->InPPFalseBranch = 0;
  353. }
  354. }
  355. void cmFortranParser_RuleEndif(cmFortranParser* parser)
  356. {
  357. if (!parser->SkipToEnd.empty()) {
  358. parser->SkipToEnd.pop();
  359. }
  360. // #endif doesn't know if there was a "#else" in before, so it
  361. // always decreases InPPFalseBranch
  362. if (parser->InPPFalseBranch) {
  363. parser->InPPFalseBranch--;
  364. }
  365. }