trans.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677
  1. /*
  2. * (c) copyright 1987 by the Vrije Universiteit, Amsterdam, The Netherlands.
  3. * See the copyright notice in the ACK home directory, in the file "Copyright".
  4. *
  5. */
  6. #include <stdlib.h>
  7. #include <string.h>
  8. #include "ack.h"
  9. #include "list.h"
  10. #include "trans.h"
  11. #include "grows.h"
  12. #include "data.h"
  13. /****************************************************************************/
  14. /* Routines for transforming from one file type to another */
  15. /****************************************************************************/
  16. static growstring head ;
  17. static int touch_head= NO ;
  18. static growstring tail ;
  19. static int touch_tail= NO ;
  20. int transform(trf *phase)
  21. {
  22. int ok ;
  23. if ( !setfiles(phase) ) {
  24. disc_files(phase) ;
  25. return 0 ;
  26. }
  27. getcallargs(phase) ;
  28. ok= runphase(phase) ;
  29. if ( !ok ) rmfile(&out) ;
  30. /* Free the space occupied by the arguments,
  31. except for the linker, since we are bound to exit soon
  32. and do not foresee further need of memory space */
  33. if ( !phase->t_linker ) discardargs(phase) ;
  34. disc_files(phase) ;
  35. return ok ;
  36. }
  37. void getmapflags(trf *phase)
  38. {
  39. register path *l_in ;
  40. register list_elem *elem ;
  41. int scanned ;
  42. register char *ptr ;
  43. scanlist(l_first(flags),elem) {
  44. scanned= *(l_content(*elem))&NO_SCAN ;
  45. *(l_content(*elem)) &= ~NO_SCAN ;
  46. if ( mapflag(&(phase->t_mapf),l_content(*elem)) ) {
  47. scanned=NO_SCAN ;
  48. #ifdef DEBUG
  49. if ( debug >=4 ) {
  50. vprint("phase %s, added mapflag for %s\n",
  51. phase->t_name,
  52. l_content(*elem) ) ;
  53. }
  54. #endif
  55. }
  56. *(l_content(*elem)) |= scanned ;
  57. }
  58. if ( phase->t_linker ) {
  59. scanlist(l_first(phase->t_inputs),elem) {
  60. l_in = p_cont(*elem) ;
  61. if ( mapflag(&(phase->t_mapf),l_in->p_path) ) {
  62. ptr= keeps(getvar(LIBVAR)) ;
  63. clr_noscan(ptr) ;
  64. #ifdef DEBUG
  65. if ( debug >=4 ) {
  66. vprint("phase %s, library %s(%s)\n",
  67. phase->t_name,l_in->p_path,ptr) ;
  68. }
  69. #endif
  70. if ( l_in->p_keeps) throws(l_in->p_path) ;
  71. l_in->p_path= ptr ;
  72. l_in->p_keeps=YES ;
  73. }
  74. }
  75. scanlist(l_first(flags),elem) {
  76. /* Get the flags remaining for the loader,
  77. That is: all the flags neither eaten by ack nor
  78. one of the subprograms called so-far.
  79. The last fact is indicated by the NO_SCAN bit
  80. in the first character of the flag.
  81. */
  82. if ( !( *(l_content(*elem))&NO_SCAN ) ) {
  83. l_add(&(phase->t_flags),l_content(*elem)) ;
  84. #ifdef DEBUG
  85. if ( debug >=4 ) {
  86. vprint("phase %s, added flag %s\n",
  87. phase->t_name,
  88. l_content(*elem) ) ;
  89. }
  90. #endif
  91. }
  92. }
  93. }
  94. }
  95. void do_Rflag(char *argp)
  96. {
  97. l_add(&R_list,argp) ;
  98. }
  99. char *headvar()
  100. {
  101. if ( !touch_head) return "" ;
  102. return gr_start(head) ;
  103. }
  104. void add_head(char *str)
  105. {
  106. if ( !touch_head) {
  107. gr_init(&head) ;
  108. touch_head=YES ;
  109. }
  110. gr_cat(&head,str) ;
  111. }
  112. char *tailvar()
  113. {
  114. if ( !touch_tail ) return "" ;
  115. return gr_start(tail) ;
  116. }
  117. void add_tail(char *str)
  118. {
  119. if ( !touch_tail ) {
  120. gr_init(&tail) ;
  121. touch_tail=YES ;
  122. }
  123. gr_cat(&tail,str) ;
  124. }
  125. void transini()
  126. {
  127. register list_elem *elem ;
  128. register trf *phase ;
  129. scanlist(l_first(tr_list), elem) {
  130. phase = t_cont(*elem) ;
  131. if ( !phase->t_linker ) getmapflags(phase);
  132. }
  133. scanlist(l_first(R_list), elem) {
  134. set_Rflag(l_content(*elem)) ;
  135. }
  136. l_clear(&R_list) ;
  137. setpvar(keeps(HEAD),headvar) ;
  138. setpvar(keeps(TAIL),tailvar) ;
  139. }
  140. void set_Rflag(char *argp)
  141. {
  142. register char *eos ;
  143. register list_elem *prog ;
  144. register int length ;
  145. char *eq, *colon ;
  146. eos= strchr(&argp[2],'-');
  147. eq= strchr(&argp[2],EQUAL) ;
  148. colon= strchr(&argp[2],':');
  149. if ( !eos ) {
  150. eos= eq ;
  151. } else {
  152. if ( eq && eq<eos ) eos= eq ;
  153. }
  154. if ( colon && ( !eos || eos>colon ) ) eos= colon ;
  155. if ( !eos ) {
  156. if ( !(argp[0]&NO_SCAN) ) werror("Incorrect use of -R flag") ;
  157. return ;
  158. }
  159. length= eos - &argp[2] ;
  160. scanlist(l_first(tr_list), prog) {
  161. if ( strncmp(t_cont(*prog)->t_name, &argp[2], length )==0 &&
  162. t_cont(*prog)->t_name[length]==0 /* Same name length */) {
  163. if ( *eos=='-' ) {
  164. if ( !(argp[0]&NO_SCAN) ) {
  165. /* If not already taken by a mapflag */
  166. l_add(&(t_cont(*prog)->t_flags),eos) ;
  167. }
  168. } else
  169. if ( *eos=='=' ) {
  170. t_cont(*prog)->t_prog= eos+1 ;
  171. } else {
  172. t_cont(*prog)->t_priority= atoi(eos+1) ;
  173. }
  174. argp[0] |= NO_SCAN ;
  175. return ;
  176. }
  177. }
  178. if ( !(argp[0]&NO_SCAN) ) werror("Cannot find program for %s",argp) ;
  179. return ;
  180. }
  181. /**************************************************************************/
  182. /* */
  183. /* The creation of arguments for exec for a transformation */
  184. /* */
  185. /**************************************************************************/
  186. growstring scanb(char *line)
  187. {
  188. /* Scan a line for backslashes, setting the NO_SCAN bit in characters
  189. preceded by a backslash.
  190. */
  191. register char *in_c ;
  192. register int token ;
  193. growstring result ;
  194. enum { TEXT, ESCAPED } state = TEXT ;
  195. gr_init(&result) ;
  196. for ( in_c= line ; *in_c ; in_c++ ) {
  197. token= *in_c&0377 ;
  198. switch( state ) {
  199. case TEXT :
  200. if ( token==BSLASH ) {
  201. state= ESCAPED ;
  202. } else {
  203. gr_add(&result,token) ;
  204. }
  205. break ;
  206. case ESCAPED :
  207. gr_add(&result,token|NO_SCAN) ;
  208. state=TEXT ;
  209. break ;
  210. }
  211. }
  212. gr_add(&result,0) ;
  213. if ( state!=TEXT ) werror("flag line ends with %c",BSLASH) ;
  214. return result ;
  215. }
  216. growstring scanvars(char *line)
  217. {
  218. /* Scan a line variable replacements started by S_VAR.
  219. Two sequences exist: S_VAR name E_VAR, S_VAR name A_VAR text E_VAR.
  220. neither name nor text may contain further replacements.
  221. In the first form an error message is issued if the name is not
  222. present in the variables, the second form produces text
  223. in that case.
  224. The sequence S_VAR S_VAR is transformed into S_VAR.
  225. This to allow later recognition in mapflags, where B_SLASH
  226. would be preventing any recognition.
  227. */
  228. register char *in_c ;
  229. register int token ;
  230. growstring result ;
  231. growstring name ;
  232. register char *tr ;
  233. enum { TEXT, FIRST, NAME, SKIP, COPY } state = TEXT ;
  234. gr_init(&result) ; gr_init(&name) ;
  235. for ( in_c= line ; *in_c ; in_c++ ) {
  236. token= *in_c&0377 ;
  237. switch( state ) {
  238. case TEXT :
  239. if ( token==S_VAR ) {
  240. state= FIRST ;
  241. } else {
  242. gr_add(&result,token) ;
  243. }
  244. break ;
  245. case FIRST :
  246. switch ( token ) {
  247. case S_VAR :
  248. state= TEXT ;
  249. gr_add(&result,token) ;
  250. break ;
  251. case A_VAR :
  252. case C_VAR :
  253. fatal("empty string variable name") ;
  254. default :
  255. state=NAME ;
  256. gr_add(&name,token) ;
  257. break ;
  258. }
  259. break ;
  260. case NAME:
  261. switch ( token ) {
  262. case A_VAR :
  263. gr_add(&name,0) ;
  264. if ( (tr=getvar(gr_start(name))) ) {
  265. while ( *tr ) {
  266. gr_add(&result,*tr++) ;
  267. }
  268. state=SKIP ;
  269. } else {
  270. state=COPY ;
  271. }
  272. gr_throw(&name) ;
  273. break ;
  274. case C_VAR :
  275. gr_add(&name,0) ;
  276. if ( (tr=getvar(gr_start(name))) ) {
  277. while ( *tr ) {
  278. gr_add(&result,*tr++);
  279. }
  280. } else {
  281. werror("No definition for %s",
  282. gr_start(name)) ;
  283. }
  284. state=TEXT ;
  285. gr_throw(&name) ;
  286. break ;
  287. default:
  288. gr_add(&name,token) ;
  289. break ;
  290. }
  291. break ;
  292. case SKIP :
  293. if ( token==C_VAR ) state= TEXT ;
  294. break ;
  295. case COPY :
  296. if ( token==C_VAR ) state= TEXT ; else {
  297. gr_add(&result,token) ;
  298. }
  299. break ;
  300. }
  301. }
  302. gr_add(&result,0) ;
  303. if ( state!=TEXT ) {
  304. werror("flag line misses %c",C_VAR) ;
  305. gr_throw(&name) ;
  306. }
  307. return result ;
  308. }
  309. growstring scanexpr(char *line)
  310. {
  311. /* Scan a line for conditional or flag expressions,
  312. dependent on the type. The format is
  313. S_EXPR suflist M_EXPR suflist T_EXPR tail C_EXPR
  314. the head and tail are passed to treat, together with the
  315. growstring for futher treatment.
  316. Nesting is not allowed.
  317. */
  318. register char *in_c ;
  319. char *heads ;
  320. register int token ;
  321. growstring sufs, tailval ;
  322. growstring result ;
  323. static list_head fsuff, lsuff ;
  324. enum { TEXT, FDOT, FSUF, LDOT, LSUF, FTAIL } state = TEXT ;
  325. gr_init(&result) ; gr_init(&sufs) ; gr_init(&tailval) ;
  326. for ( in_c= line ; *in_c ; in_c++ ) {
  327. token= *in_c&0377 ;
  328. switch( state ) {
  329. case TEXT :
  330. if ( token==S_EXPR ) {
  331. state= FDOT ;
  332. heads=in_c ;
  333. } else gr_add(&result,token) ;
  334. break ;
  335. case FDOT :
  336. if ( token==M_EXPR ) {
  337. state=LDOT ;
  338. break ;
  339. }
  340. token &= ~NO_SCAN ;
  341. if ( token!=SUFCHAR ) {
  342. error("Missing %c in expression",SUFCHAR) ;
  343. }
  344. gr_add(&sufs,token) ; state=FSUF ;
  345. break ;
  346. case FSUF :
  347. if ( token==M_EXPR || (token&~NO_SCAN)==SUFCHAR) {
  348. gr_add(&sufs,0) ;
  349. l_add(&fsuff,gr_final(&sufs)) ;
  350. }
  351. if ( token==M_EXPR ) {
  352. state=LDOT ;
  353. } else gr_add(&sufs,token&~NO_SCAN) ;
  354. break ;
  355. case LDOT :
  356. if ( token==T_EXPR ) {
  357. state=FTAIL ;
  358. break ;
  359. }
  360. token &= ~NO_SCAN ;
  361. if ( token!=SUFCHAR ) {
  362. error("Missing %c in expression",SUFCHAR) ;
  363. }
  364. gr_add(&sufs,token) ; state=LSUF ;
  365. break ;
  366. case LSUF :
  367. if ( token==T_EXPR || (token&~NO_SCAN)==SUFCHAR) {
  368. gr_add(&sufs,0) ;
  369. l_add(&lsuff,gr_final(&sufs)) ;
  370. }
  371. if ( token==T_EXPR ) {
  372. state=FTAIL ;
  373. } else gr_add(&sufs,token&~NO_SCAN) ;
  374. break ;
  375. case FTAIL :
  376. if ( token==C_EXPR ) {
  377. /* Found one !! */
  378. gr_add(&tailval,0) ;
  379. condit(&result,&fsuff,&lsuff,gr_start(tailval)) ;
  380. l_throw(&fsuff) ; l_throw(&lsuff) ;
  381. gr_throw(&tailval) ;
  382. state=TEXT ;
  383. } else gr_add(&tailval,token) ;
  384. break ;
  385. }
  386. }
  387. gr_add(&result,0) ;
  388. if ( state!=TEXT ) {
  389. l_throw(&fsuff) ; l_throw(&lsuff) ; gr_throw(&tailval) ;
  390. werror("flag line has unclosed expression starting with %6s",
  391. heads) ;
  392. }
  393. return result ;
  394. }
  395. void condit(growstring *line, list_head *fsuff, list_head *lsuff, char *tailval)
  396. {
  397. register list_elem *first ;
  398. register list_elem *last ;
  399. #ifdef DEBUG
  400. if ( debug>=4 ) vprint("Conditional for %s, ",tailval) ;
  401. #endif
  402. scanlist( l_first(*fsuff), first ) {
  403. scanlist( l_first(*lsuff), last ) {
  404. if ( strcmp(l_content(*first),l_content(*last))==0 ) {
  405. /* Found */
  406. #ifdef DEBUG
  407. if ( debug>=4 ) vprint(" matched\n") ;
  408. #endif
  409. while ( *tailval) gr_add(line,*tailval++ ) ;
  410. return ;
  411. }
  412. }
  413. }
  414. #ifdef DEBUG
  415. if ( debug>=4) vprint(" non-matched\n") ;
  416. #endif
  417. }
  418. int mapflag(list_head *maplist, char *cflag)
  419. {
  420. /* Expand a flag expression */
  421. /* The flag "cflag" is checked for each of the mapflags.
  422. A mapflag entry has the form
  423. -text NAME=replacement or -text*text NAME=replacement
  424. The star matches anything as in the shell.
  425. If the entry matches the assignment will take place
  426. This replacement is subjected to argument matching only.
  427. When a match took place the replacement is returned
  428. when not, (char *)0.
  429. The replacement sits in stable storage.
  430. */
  431. register list_elem *elem ;
  432. scanlist(l_first(*maplist),elem) {
  433. if ( mapexpand(l_content(*elem),cflag) ) {
  434. return 1 ;
  435. }
  436. }
  437. return 0 ;
  438. }
  439. int mapexpand(char *mapentry, char *cflag)
  440. {
  441. register char *star ;
  442. register char *ptr ;
  443. register char *space ;
  444. int length ;
  445. star=strchr(mapentry,STAR) ;
  446. space=firstblank(mapentry) ;
  447. if ( star >space ) star= (char *)0 ;
  448. if ( star ) {
  449. length= space-star-1 ;
  450. if ( strncmp(mapentry,cflag,star-mapentry) ||
  451. strncmp(star+1,cflag+strlen(cflag)-length,length) ) {
  452. return 0 ;
  453. }
  454. /* Match */
  455. /* Now set star to the first char of the star
  456. replacement and length to its length
  457. */
  458. length=strlen(cflag)-(star-mapentry)-length ;
  459. if ( length<0 ) return 0 ;
  460. star=cflag+(star-mapentry) ;
  461. #ifdef DEBUG
  462. if ( debug>=6 ) {
  463. vprint("Starmatch (%s,%s) %.*s\n",
  464. mapentry,cflag,length,star) ;
  465. }
  466. #endif
  467. } else {
  468. if ( strncmp(mapentry,cflag,space-mapentry)!=0 ||
  469. cflag[space-mapentry] ) {
  470. return 0 ;
  471. }
  472. }
  473. ptr= skipblank(space) ;
  474. if ( *ptr==0 ) return 1 ;
  475. doassign(ptr,star,length) ;
  476. return 1 ;
  477. }
  478. void doassign(char *line, char *star, int length)
  479. {
  480. growstring varval, name, temp ;
  481. register char *ptr ;
  482. gr_init(&varval) ;
  483. gr_init(&name) ;
  484. ptr= line ;
  485. for ( ; *ptr && *ptr!=SPACE && *ptr!=TAB && *ptr!=EQUAL ; ptr++ ) {
  486. gr_add(&name,*ptr) ;
  487. }
  488. ptr= strchr(ptr,EQUAL) ;
  489. if ( !ptr ) {
  490. error("Missing %c in assignment %s",EQUAL,line);
  491. return ;
  492. }
  493. temp= scanvars(ptr+1) ;
  494. for ( ptr=gr_start(temp); *ptr; ptr++ ) switch ( *ptr ) {
  495. case STAR :
  496. if ( star ) {
  497. while ( length-- ) gr_add(&varval,*star++|NO_SCAN) ;
  498. break ;
  499. }
  500. default :
  501. gr_add(&varval,*ptr) ;
  502. break ;
  503. }
  504. gr_throw(&temp) ;
  505. gr_add(&name,0) ; gr_add(&varval,0) ;
  506. setsvar(gr_final(&name),gr_final(&varval)) ;
  507. }
  508. #define ISBLANK(c) ( (c)==SPACE || (c)==TAB )
  509. void unravel(char *line, void (*action)(char *))
  510. {
  511. /* Unravel the line, get arguments a la shell */
  512. /* each argument is handled to action */
  513. /* The input string is left intact */
  514. register char *in_c ;
  515. register int token ;
  516. enum { BLANK, ARG } state = BLANK ;
  517. growstring argum ;
  518. in_c=line ;
  519. for (;;) {
  520. token= *in_c&0377 ;
  521. switch ( state ) {
  522. case BLANK :
  523. if ( token==0 ) break ;
  524. if ( !ISBLANK(token) ) {
  525. state= ARG ;
  526. gr_init(&argum) ;
  527. gr_add(&argum,token&~NO_SCAN) ;
  528. }
  529. break ;
  530. case ARG :
  531. if ( ISBLANK(token) || token==0 ) {
  532. gr_add(&argum,0) ;
  533. (*action)(gr_start(argum)) ;
  534. gr_throw(&argum) ;
  535. state=BLANK ;
  536. } else {
  537. gr_add(&argum,token&~NO_SCAN) ;
  538. }
  539. break ;
  540. }
  541. if ( token == 0 ) break ;
  542. in_c++ ;
  543. }
  544. }
  545. char *c_rep(char *string, char *place, char *rep)
  546. {
  547. /* Produce a string in stable storage produced from 'string'
  548. with the character at place replaced by rep
  549. */
  550. growstring name ;
  551. register char *nc ;
  552. register char *xc ;
  553. gr_init(&name) ;
  554. for ( nc=string ; *nc && nc<place ; nc++ ) {
  555. gr_add(&name,*nc) ;
  556. }
  557. #ifdef DEBUG
  558. if ( *nc==0 ) fatal("Place is not in string") ;
  559. #endif
  560. for ( xc=rep ; *xc ; xc++ ) gr_add(&name,*xc|NO_SCAN) ;
  561. gr_add(&name,0) ;
  562. gr_cat(&name,nc+1) ;
  563. return gr_final(&name) ;
  564. }
  565. static list_head *curargs ;
  566. static list_head *comb_args ;
  567. void addargs(char *string)
  568. {
  569. register char *temp, *repc ;
  570. register list_elem *elem ;
  571. repc=strchr(string,C_IN) ;
  572. if ( repc ) {
  573. /* INPUT FILE TOKEN seen, replace it and scan further */
  574. if ( repc==string && string[1]==0 ) {
  575. if ( in.p_path ) { /* All but combiner */
  576. l_add(curargs,keeps(in.p_path)) ;
  577. } else {
  578. scanlist( l_first(*comb_args), elem ) {
  579. l_add(curargs,
  580. keeps(p_cont(*elem)->p_path)) ;
  581. }
  582. }
  583. return ;
  584. }
  585. if ( in.p_path ) { /* Not for the combiners */
  586. temp=c_rep(string,repc,in.p_path) ;
  587. addargs(temp) ;
  588. throws(temp) ;
  589. } else { /* For the combiners */
  590. scanlist( l_first(*comb_args), elem ) {
  591. temp=c_rep(string,repc,p_cont(*elem)->p_path);
  592. addargs(temp) ;
  593. throws(temp) ;
  594. }
  595. }
  596. return ;
  597. }
  598. repc=strchr(string,C_OUT) ;
  599. if ( repc ) {
  600. /* replace the outfile token as with the infile token */
  601. #ifdef DEBUG
  602. if ( !out.p_path ) fatal("missing output filename") ;
  603. #endif
  604. temp=c_rep(string,repc,out.p_path) ;
  605. addargs(temp) ;
  606. throws(temp) ;
  607. return ;
  608. }
  609. temp= keeps(string) ;
  610. clr_noscan(temp) ;
  611. l_add(curargs,temp) ;
  612. }
  613. void getcallargs(trf *phase)
  614. {
  615. growstring arg1, arg2 ;
  616. arg1= scanvars(phase->t_argd) ;
  617. #ifdef DEBUG
  618. if ( debug>=3 ) { vprint("\tvars: ") ; prns(gr_start(arg1)) ; }
  619. #endif
  620. arg2= scanexpr(gr_start(arg1)) ;
  621. #ifdef DEBUG
  622. if ( debug>=3 ) { vprint("\texpr: ") ; prns(gr_start(arg2)) ; }
  623. #endif
  624. gr_throw(&arg1) ;
  625. curargs= &phase->t_args ;
  626. if (phase->t_combine) comb_args = &phase->t_inputs ;
  627. unravel( gr_start(arg2), addargs ) ;
  628. gr_throw(&arg2) ;
  629. }
  630. void discardargs(trf *phase)
  631. {
  632. l_throw(&phase->t_args) ;
  633. }