ifparser.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552
  1. /*
  2. * $Xorg: ifparser.c,v 1.3 2000/08/17 19:41:50 cpqbld Exp $
  3. *
  4. * Copyright 1992 Network Computing Devices, Inc.
  5. *
  6. * Permission to use, copy, modify, and distribute this software and its
  7. * documentation for any purpose and without fee is hereby granted, provided
  8. * that the above copyright notice appear in all copies and that both that
  9. * copyright notice and this permission notice appear in supporting
  10. * documentation, and that the name of Network Computing Devices may not be
  11. * used in advertising or publicity pertaining to distribution of the software
  12. * without specific, written prior permission. Network Computing Devices makes
  13. * no representations about the suitability of this software for any purpose.
  14. * It is provided ``as is'' without express or implied warranty.
  15. *
  16. * NETWORK COMPUTING DEVICES DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
  17. * SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS,
  18. * IN NO EVENT SHALL NETWORK COMPUTING DEVICES BE LIABLE FOR ANY SPECIAL,
  19. * INDIRECT OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
  20. * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
  21. * OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
  22. * PERFORMANCE OF THIS SOFTWARE.
  23. *
  24. * Author: Jim Fulton
  25. * Network Computing Devices, Inc.
  26. *
  27. * Simple if statement processor
  28. *
  29. * This module can be used to evaluate string representations of C language
  30. * if constructs. It accepts the following grammar:
  31. *
  32. * EXPRESSION := VALUE
  33. * | VALUE BINOP EXPRESSION
  34. * | VALUE '?' EXPRESSION ':' EXPRESSION
  35. *
  36. * VALUE := '(' EXPRESSION ')'
  37. * | '!' VALUE
  38. * | '-' VALUE
  39. * | '+' VALUE
  40. * | '~' VALUE
  41. * | 'defined' '(' variable ')'
  42. * | 'defined' variable
  43. * | # variable '(' variable-list ')'
  44. * | variable
  45. * | number
  46. *
  47. * BINOP := '*' | '/' | '%'
  48. * | '+' | '-'
  49. * | '<<' | '>>'
  50. * | '<' | '>' | '<=' | '>='
  51. * | '==' | '!='
  52. * | '&' | '^' | '|'
  53. * | '&&' | '||'
  54. *
  55. * The normal C order of precedence is supported.
  56. *
  57. *
  58. * External Entry Points:
  59. *
  60. * ParseIfExpression parse a string for #if
  61. */
  62. /* $XFree86: xc/config/makedepend/ifparser.c,v 3.11 2002/09/23 01:48:08 tsi Exp $ */
  63. #include "ifparser.h"
  64. #include <ctype.h>
  65. #include <stdlib.h>
  66. #include <string.h>
  67. /****************************************************************************
  68. Internal Macros and Utilities for Parser
  69. ****************************************************************************/
  70. #define DO(val) if (!(val)) return NULL
  71. #define CALLFUNC(ggg,fff) (*((ggg)->funcs.fff))
  72. #define SKIPSPACE(ccc) while (isspace(*ccc)) ccc++
  73. #define isvarfirstletter(ccc) (isalpha(ccc) || (ccc) == '_')
  74. static const char *
  75. parse_variable (IfParser *g, const char *cp, const char **varp)
  76. {
  77. SKIPSPACE (cp);
  78. if (!isvarfirstletter (*cp))
  79. return CALLFUNC(g, handle_error) (g, cp, "variable name");
  80. *varp = cp;
  81. /* EMPTY */
  82. for (cp++; isalnum(*cp) || *cp == '_'; cp++) ;
  83. return cp;
  84. }
  85. static const char *
  86. parse_number (IfParser *g, const char *cp, long *valp)
  87. {
  88. long base = 10;
  89. SKIPSPACE (cp);
  90. if (!isdigit(*cp))
  91. return CALLFUNC(g, handle_error) (g, cp, "number");
  92. *valp = 0;
  93. if (*cp == '0') {
  94. cp++;
  95. if ((*cp == 'x') || (*cp == 'X')) {
  96. base = 16;
  97. cp++;
  98. } else {
  99. base = 8;
  100. }
  101. }
  102. /* Ignore overflows and assume ASCII, what source is usually written in */
  103. while (1) {
  104. int increment = -1;
  105. if (base == 8) {
  106. if ((*cp >= '0') && (*cp <= '7'))
  107. increment = *cp++ - '0';
  108. } else if (base == 16) {
  109. if ((*cp >= '0') && (*cp <= '9'))
  110. increment = *cp++ - '0';
  111. else if ((*cp >= 'A') && (*cp <= 'F'))
  112. increment = *cp++ - ('A' - 10);
  113. else if ((*cp >= 'a') && (*cp <= 'f'))
  114. increment = *cp++ - ('a' - 10);
  115. } else { /* Decimal */
  116. if ((*cp >= '0') && (*cp <= '9'))
  117. increment = *cp++ - '0';
  118. }
  119. if (increment < 0)
  120. break;
  121. *valp = (*valp * base) + increment;
  122. }
  123. /* Skip trailing qualifiers */
  124. while (*cp == 'U' || *cp == 'u' || *cp == 'L' || *cp == 'l') cp++;
  125. return cp;
  126. }
  127. static const char *
  128. parse_character (IfParser *g, const char *cp, long *valp)
  129. {
  130. char val;
  131. SKIPSPACE (cp);
  132. if (*cp == '\\')
  133. switch (cp[1]) {
  134. case 'n': val = '\n'; break;
  135. case 't': val = '\t'; break;
  136. case 'v': val = '\v'; break;
  137. case 'b': val = '\b'; break;
  138. case 'r': val = '\r'; break;
  139. case 'f': val = '\f'; break;
  140. case 'a': val = '\a'; break;
  141. case '\\': val = '\\'; break;
  142. case '?': val = '\?'; break;
  143. case '\'': val = '\''; break;
  144. case '\"': val = '\"'; break;
  145. case 'x': val = (char) strtol (cp + 2, NULL, 16); break;
  146. default: val = (char) strtol (cp + 1, NULL, 8); break;
  147. }
  148. else
  149. val = *cp;
  150. while (*cp != '\'') cp++;
  151. *valp = (long) val;
  152. return cp;
  153. }
  154. static const char *
  155. parse_value (IfParser *g, const char *cp, long *valp)
  156. {
  157. const char *var, *varend;
  158. *valp = 0;
  159. SKIPSPACE (cp);
  160. if (!*cp)
  161. return cp;
  162. switch (*cp) {
  163. case '(':
  164. DO (cp = ParseIfExpression (g, cp + 1, valp));
  165. SKIPSPACE (cp);
  166. if (*cp != ')')
  167. return CALLFUNC(g, handle_error) (g, cp, ")");
  168. return cp + 1; /* skip the right paren */
  169. case '!':
  170. DO (cp = parse_value (g, cp + 1, valp));
  171. *valp = !(*valp);
  172. return cp;
  173. case '-':
  174. DO (cp = parse_value (g, cp + 1, valp));
  175. *valp = -(*valp);
  176. return cp;
  177. case '+':
  178. DO (cp = parse_value (g, cp + 1, valp));
  179. return cp;
  180. case '~':
  181. DO (cp = parse_value (g, cp + 1, valp));
  182. *valp = ~(*valp);
  183. return cp;
  184. case '#':
  185. DO (cp = parse_variable (g, cp + 1, &var));
  186. SKIPSPACE (cp);
  187. if (*cp != '(')
  188. return CALLFUNC(g, handle_error) (g, cp, "(");
  189. do {
  190. DO (cp = parse_variable (g, cp + 1, &var));
  191. SKIPSPACE (cp);
  192. } while (*cp && *cp != ')');
  193. if (*cp != ')')
  194. return CALLFUNC(g, handle_error) (g, cp, ")");
  195. *valp = 1; /* XXX */
  196. return cp + 1;
  197. case '\'':
  198. DO (cp = parse_character (g, cp + 1, valp));
  199. if (*cp != '\'')
  200. return CALLFUNC(g, handle_error) (g, cp, "'");
  201. return cp + 1;
  202. case 'd':
  203. if (strncmp (cp, "defined", 7) == 0 && !isalnum(cp[7])) {
  204. int paren = 0;
  205. int len;
  206. cp += 7;
  207. SKIPSPACE (cp);
  208. if (*cp == '(') {
  209. paren = 1;
  210. cp++;
  211. }
  212. DO (cp = parse_variable (g, cp, &var));
  213. len = cp - var;
  214. SKIPSPACE (cp);
  215. if (paren && *cp != ')')
  216. return CALLFUNC(g, handle_error) (g, cp, ")");
  217. *valp = (*(g->funcs.eval_defined)) (g, var, len);
  218. return cp + paren; /* skip the right paren */
  219. }
  220. /* fall out */
  221. }
  222. if (isdigit(*cp)) {
  223. DO (cp = parse_number (g, cp, valp));
  224. } else if (!isvarfirstletter(*cp))
  225. return CALLFUNC(g, handle_error) (g, cp, "variable or number");
  226. else {
  227. DO (cp = parse_variable (g, cp, &var));
  228. varend = cp;
  229. SKIPSPACE(cp);
  230. if (*cp != '(') {
  231. *valp = (*(g->funcs.eval_variable)) (g, var, varend - var);
  232. } else {
  233. do {
  234. long dummy;
  235. DO (cp = ParseIfExpression (g, cp + 1, &dummy));
  236. SKIPSPACE(cp);
  237. if (*cp == ')')
  238. break;
  239. if (*cp != ',')
  240. return CALLFUNC(g, handle_error) (g, cp, ",");
  241. } while (1);
  242. *valp = 1; /* XXX */
  243. cp++;
  244. }
  245. }
  246. return cp;
  247. }
  248. static const char *
  249. parse_product (IfParser *g, const char *cp, long *valp)
  250. {
  251. long rightval;
  252. DO (cp = parse_value (g, cp, valp));
  253. SKIPSPACE (cp);
  254. switch (*cp) {
  255. case '*':
  256. DO (cp = parse_product (g, cp + 1, &rightval));
  257. *valp = (*valp * rightval);
  258. break;
  259. case '/':
  260. DO (cp = parse_product (g, cp + 1, &rightval));
  261. if (rightval == 0)
  262. return CALLFUNC(g, handle_error) (g, cp, "0");
  263. *valp = (*valp / rightval);
  264. break;
  265. case '%':
  266. DO (cp = parse_product (g, cp + 1, &rightval));
  267. *valp = (*valp % rightval);
  268. break;
  269. }
  270. return cp;
  271. }
  272. static const char *
  273. parse_sum (IfParser *g, const char *cp, long *valp)
  274. {
  275. long rightval;
  276. DO (cp = parse_product (g, cp, valp));
  277. SKIPSPACE (cp);
  278. switch (*cp) {
  279. case '+':
  280. DO (cp = parse_sum (g, cp + 1, &rightval));
  281. *valp = (*valp + rightval);
  282. break;
  283. case '-':
  284. DO (cp = parse_sum (g, cp + 1, &rightval));
  285. *valp = (*valp - rightval);
  286. break;
  287. }
  288. return cp;
  289. }
  290. static const char *
  291. parse_shift (IfParser *g, const char *cp, long *valp)
  292. {
  293. long rightval;
  294. DO (cp = parse_sum (g, cp, valp));
  295. SKIPSPACE (cp);
  296. switch (*cp) {
  297. case '<':
  298. if (cp[1] == '<') {
  299. DO (cp = parse_shift (g, cp + 2, &rightval));
  300. *valp = (*valp << rightval);
  301. }
  302. break;
  303. case '>':
  304. if (cp[1] == '>') {
  305. DO (cp = parse_shift (g, cp + 2, &rightval));
  306. *valp = (*valp >> rightval);
  307. }
  308. break;
  309. }
  310. return cp;
  311. }
  312. static const char *
  313. parse_inequality (IfParser *g, const char *cp, long *valp)
  314. {
  315. long rightval;
  316. DO (cp = parse_shift (g, cp, valp));
  317. SKIPSPACE (cp);
  318. switch (*cp) {
  319. case '<':
  320. if (cp[1] == '=') {
  321. DO (cp = parse_inequality (g, cp + 2, &rightval));
  322. *valp = (*valp <= rightval);
  323. } else {
  324. DO (cp = parse_inequality (g, cp + 1, &rightval));
  325. *valp = (*valp < rightval);
  326. }
  327. break;
  328. case '>':
  329. if (cp[1] == '=') {
  330. DO (cp = parse_inequality (g, cp + 2, &rightval));
  331. *valp = (*valp >= rightval);
  332. } else {
  333. DO (cp = parse_inequality (g, cp + 1, &rightval));
  334. *valp = (*valp > rightval);
  335. }
  336. break;
  337. }
  338. return cp;
  339. }
  340. static const char *
  341. parse_equality (IfParser *g, const char *cp, long *valp)
  342. {
  343. long rightval;
  344. DO (cp = parse_inequality (g, cp, valp));
  345. SKIPSPACE (cp);
  346. switch (*cp) {
  347. case '=':
  348. if (cp[1] == '=')
  349. cp++;
  350. DO (cp = parse_equality (g, cp + 1, &rightval));
  351. *valp = (*valp == rightval);
  352. break;
  353. case '!':
  354. if (cp[1] != '=')
  355. break;
  356. DO (cp = parse_equality (g, cp + 2, &rightval));
  357. *valp = (*valp != rightval);
  358. break;
  359. }
  360. return cp;
  361. }
  362. static const char *
  363. parse_band (IfParser *g, const char *cp, long *valp)
  364. {
  365. long rightval;
  366. DO (cp = parse_equality (g, cp, valp));
  367. SKIPSPACE (cp);
  368. switch (*cp) {
  369. case '&':
  370. if (cp[1] != '&') {
  371. DO (cp = parse_band (g, cp + 1, &rightval));
  372. *valp = (*valp & rightval);
  373. }
  374. break;
  375. }
  376. return cp;
  377. }
  378. static const char *
  379. parse_bxor (IfParser *g, const char *cp, long *valp)
  380. {
  381. long rightval;
  382. DO (cp = parse_band (g, cp, valp));
  383. SKIPSPACE (cp);
  384. switch (*cp) {
  385. case '^':
  386. DO (cp = parse_bxor (g, cp + 1, &rightval));
  387. *valp = (*valp ^ rightval);
  388. break;
  389. }
  390. return cp;
  391. }
  392. static const char *
  393. parse_bor (IfParser *g, const char *cp, long *valp)
  394. {
  395. long rightval;
  396. DO (cp = parse_bxor (g, cp, valp));
  397. SKIPSPACE (cp);
  398. switch (*cp) {
  399. case '|':
  400. if (cp[1] != '|') {
  401. DO (cp = parse_bor (g, cp + 1, &rightval));
  402. *valp = (*valp | rightval);
  403. }
  404. break;
  405. }
  406. return cp;
  407. }
  408. static const char *
  409. parse_land (IfParser *g, const char *cp, long *valp)
  410. {
  411. long rightval;
  412. DO (cp = parse_bor (g, cp, valp));
  413. SKIPSPACE (cp);
  414. switch (*cp) {
  415. case '&':
  416. if (cp[1] != '&')
  417. return CALLFUNC(g, handle_error) (g, cp, "&&");
  418. DO (cp = parse_land (g, cp + 2, &rightval));
  419. *valp = (*valp && rightval);
  420. break;
  421. }
  422. return cp;
  423. }
  424. static const char *
  425. parse_lor (IfParser *g, const char *cp, long *valp)
  426. {
  427. long rightval;
  428. DO (cp = parse_land (g, cp, valp));
  429. SKIPSPACE (cp);
  430. switch (*cp) {
  431. case '|':
  432. if (cp[1] != '|')
  433. return CALLFUNC(g, handle_error) (g, cp, "||");
  434. DO (cp = parse_lor (g, cp + 2, &rightval));
  435. *valp = (*valp || rightval);
  436. break;
  437. }
  438. return cp;
  439. }
  440. static const char *
  441. parse_cond(IfParser *g, const char *cp, long *valp)
  442. {
  443. long trueval, falseval;
  444. DO (cp = parse_lor (g, cp, valp));
  445. SKIPSPACE (cp);
  446. switch (*cp) {
  447. case '?':
  448. DO (cp = parse_cond (g, cp + 1, &trueval));
  449. SKIPSPACE (cp);
  450. if (*cp != ':')
  451. return CALLFUNC(g, handle_error) (g, cp, ":");
  452. DO (cp = parse_cond (g, cp + 1, &falseval));
  453. *valp = (*valp ? trueval : falseval);
  454. break;
  455. }
  456. return cp;
  457. }
  458. /****************************************************************************
  459. External Entry Points
  460. ****************************************************************************/
  461. const char *
  462. ParseIfExpression (IfParser *g, const char *cp, long *valp)
  463. {
  464. return parse_cond (g, cp, valp);
  465. }