PageRenderTime 27ms CodeModel.GetById 19ms RepoModel.GetById 0ms app.codeStats 1ms

/alliance-5.0/fvh/src/fbl_bcomp_y.y

#
Happy | 3813 lines | 3445 code | 368 blank | 0 comment | 0 complexity | 0d67d6a476225cc619e759a748b10391 MD5 | raw file
Possible License(s): GPL-2.0, LGPL-2.0

Large files files are truncated, but you can click here to view the full file

  1. /*------------------------------------------------------------\
  2. | |
  3. | This file is part of the Alliance CAD System Copyright |
  4. | (C) Laboratoire LIP6 - Département ASIM Universite P&M Curie|
  5. | |
  6. | Home page : http://www-asim.lip6.fr/alliance/ |
  7. | E-mail : mailto:alliance-users@asim.lip6.fr |
  8. | |
  9. | This progam is free software; you can redistribute it |
  10. | and/or modify it under the terms of the GNU Library General|
  11. | Public License as published by the Free Software Foundation |
  12. | either version 2 of the License, or (at your option) any |
  13. | later version. |
  14. | |
  15. | Alliance VLSI CAD System is distributed in the hope that |
  16. | it will be useful, but WITHOUT ANY WARRANTY; |
  17. | without even the implied warranty of MERCHANTABILITY or |
  18. | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General |
  19. | Public License for more details. |
  20. | |
  21. | You should have received a copy of the GNU General Public |
  22. | License along with the GNU C Library; see the file COPYING. |
  23. | If not, write to the Free Software Foundation, Inc., |
  24. | 675 Mass Ave, Cambridge, MA 02139, USA. |
  25. | |
  26. \------------------------------------------------------------*/
  27. /* ###--------------------------------------------------------------### */
  28. /* */
  29. /* file : fbl_bcomp.yac */
  30. /* date : NOV 5 1992 */
  31. /* version : v100 */
  32. /* author : P. BAZARGAN, M. HANAFI */
  33. /* Modified by Ludovic Jacome */
  34. /* content : yacc rules for fbhavioural VHDL */
  35. /* */
  36. /* ###--------------------------------------------------------------### */
  37. %{
  38. #include <stdio.h>
  39. #include <string.h>
  40. #include <stdlib.h>
  41. #include "mut.h"
  42. #include "aut.h"
  43. #include "abl.h"
  44. #include "bdd.h"
  45. #include "fvh.h"
  46. #include "fbl_utype.h"
  47. #include "fbl_bedef.h"
  48. #include "fbl_bspec.h"
  49. #include "fbl_byacc.h"
  50. static struct dct_entry *addent ();
  51. static struct dct_recrd *addrcd ();
  52. static struct dct_entry **initab ();
  53. static void addtab ();
  54. static long chktab ();
  55. static void fretab ();
  56. void *fbl_addstr ();
  57. long fbl_chkdcl ();
  58. struct ptype *reversetype();
  59. struct choice_chain *order_choice();
  60. %}
  61. %union {
  62. long valu;
  63. char *text;
  64. struct ptype *ptyp;
  65. struct fbpcs proc;
  66. struct g_type dble;
  67. fbl_name name;
  68. fbl_ablstr list;
  69. struct fbtyp type;
  70. };
  71. %token <valu> tok_AND
  72. %token <valu> Pragma
  73. %token <valu> _BEGIN
  74. %token <valu> _END
  75. %token <valu> _EQSym
  76. %token <valu> _EXIT
  77. %token <valu> _FILE
  78. %token <valu> _GESym
  79. %token <valu> _GTSym
  80. %token <valu> _IN
  81. %token <valu> _INOUT
  82. %token <valu> _LABEL
  83. %token <valu> _LESym
  84. %token <valu> _LINKAGE
  85. %token <valu> _LTSym
  86. %token <valu> _NAND
  87. %token <valu> _NESym
  88. %token <valu> _NEXT
  89. %token <valu> _NOR
  90. %token <valu> _NOT
  91. %token tok_NULL
  92. %token <valu> _OR
  93. %token <valu> _OUT
  94. %token <valu> _XOR
  95. %token <valu> ABS
  96. %token <valu> ACCESS
  97. %token <valu> AFTER
  98. %token <valu> ALIAS
  99. %token <valu> ALL
  100. %token <valu> ARCHITECTURE
  101. %token <valu> ARRAY
  102. %token <valu> ASSERT
  103. %token <valu> ATTRIBUTE
  104. %token <text> AbstractLit
  105. %token <valu> Ampersand
  106. %token <valu> Apostrophe
  107. %token <valu> Arrow
  108. %token <valu> _BLOCK
  109. %token <valu> BODY
  110. %token <valu> BUFFER
  111. %token <valu> BUS
  112. %token <valu> Bar
  113. %token <valu> BasedInt
  114. %token <valu> BasedReal
  115. %token <text> BitStringLit
  116. %token <valu> Box
  117. %token <valu> CASE
  118. %token <valu> COMPONENT
  119. %token <valu> CONFIGURATION
  120. %token <valu> CONSTANT
  121. %token <text> CharacterLit
  122. %token <valu> Colon
  123. %token <valu> Comma
  124. %token <valu> DISCONNECT
  125. %token <valu> DOWNTO
  126. %token <valu> DecimalInt
  127. %token <valu> DecimalReal
  128. %token <valu> Dot
  129. %token <valu> DoubleStar
  130. %token <valu> ELSE
  131. %token <valu> ELSIF
  132. %token <valu> ENTITY
  133. %token <valu> ERROR
  134. %token <valu> FOR
  135. %token <valu> FUNCTION
  136. %token <valu> GENERATE
  137. %token <valu> GENERIC
  138. %token <valu> GUARDED
  139. %token <valu> IF
  140. %token <valu> IS
  141. %token <text> Identifier
  142. %token <valu> LIBRARY
  143. %token <valu> LOOP
  144. %token LeftParen
  145. %token <valu> MAP
  146. %token <valu> MOD
  147. %token <valu> Minus
  148. %token <valu> NEW
  149. %token <valu> OF
  150. %token <valu> ON
  151. %token <valu> OPEN
  152. %token <valu> OTHERS
  153. %token <valu> _PACKAGE
  154. %token PORT
  155. %token <valu> PROCEDURE
  156. %token <valu> PROCESS
  157. %token <valu> Plus
  158. %token <valu> RANGE
  159. %token <valu> RECORD
  160. %token <valu> REGISTER
  161. %token <valu> REM
  162. %token <valu> REPORT
  163. %token <valu> RETURN
  164. %token <valu> RightParen
  165. %token <valu> SELECT
  166. %token <valu> SEVERITY
  167. %token SIGNAL
  168. %token _STABLE
  169. %token _EVENT
  170. %token <valu> SUBTYPE
  171. %token <valu> Semicolon
  172. %token <valu> Star
  173. %token <text> StringLit
  174. %token <valu> THEN
  175. %token <valu> TO
  176. %token <valu> TRANSPORT
  177. %token <valu> FBHTYPE
  178. %token <valu> UNITS
  179. %token <valu> UNTIL
  180. %token <valu> USE
  181. %token <valu> VARIABLE
  182. %token <valu> VarAsgn
  183. %token <valu> WAIT
  184. %token <valu> WARNING
  185. %token <valu> WHEN
  186. %token <valu> WHILE
  187. %token <valu> WITH
  188. %left tok_AND _OR _NAND _NOR _XOR
  189. %left _EQSym _NESym
  190. %left _NOT
  191. %type <valu> .SEVERITY__expression.
  192. %type <valu> severity__message
  193. %type <text> .REPORT__expression.
  194. %type <text> report__message
  195. %type <text> .guard_expression.
  196. %type <text> guard_expression
  197. %type <list> waveform
  198. %type <list> waveform_element
  199. %type <list> ...waveform__WHEN__choices..
  200. %type <list> waveform__WHEN__choices
  201. %type <list> condition
  202. %type <list> expression
  203. %type <list> relation..AND__relation..
  204. %type <list> relation..OR__relation..
  205. %type <list> relation.NAND_NOR__relation.
  206. %type <list> relation..XOR__relation..
  207. %type <list> relation
  208. %type <list> simple_expression
  209. %type <list> .sign.term..add_op__term..
  210. %type <list> term
  211. %type <list> factor
  212. %type <list> primary
  213. %type <valu> relational_operator
  214. %type <text> literal
  215. %type <name> choice
  216. %type <list> aggregate
  217. %type <valu> .GUARDED.
  218. %type <type> type_definition
  219. %type <type> scalar_type_definition
  220. %type <type> composite_type_definition
  221. %type <type> enumeration_type_definition
  222. %type <type> subtype_indication
  223. %type <type> unconstrained_array_definition
  224. %type <type> constrained_array_definition
  225. %type <type> array_type_definition
  226. %type <name> index_subtype_definition
  227. %type <name> index_constraint
  228. %type <name> discrete_range
  229. %type <text> .label.
  230. %type <text> label
  231. %type <text> a_label
  232. %type <name> target
  233. %type <text> simple_name
  234. %type <name> name
  235. %type <name> attribute_name
  236. %type <name> indexed_name
  237. %type <name> slice_name
  238. %type <text> .simple_name.
  239. %type <name> .constraint.
  240. %type <name> constraint
  241. %type <name> range
  242. %type <name> range_constraint
  243. %type <valu> direction
  244. %type <valu> abstractlit
  245. %type <valu> .mode.
  246. %type <name> type_mark
  247. %type <valu> .signal_kind.
  248. %type <valu> attribute_designator
  249. %type <text> constant_VarAsgn__expression
  250. %start design_file
  251. %%
  252. design_file
  253. : /* empty */
  254. {
  255. /* ###----------------------------------------------### */
  256. /* Initializations */
  257. /* ###----------------------------------------------### */
  258. FBL_NM1LST = 0;
  259. FBL_GRDLST = 0;
  260. FBL_CNDLST = 0;
  261. FBL_VALLST = 0;
  262. hshtab = initab ();
  263. FBL_ERRFLG = 0;
  264. FBL_LINNUM = 1;
  265. FBL_NUMPTP = 0;
  266. FBL_HEADFIG = (fbfig_list *)0;
  267. FBL_MODNAM = 0;
  268. FBL_BEFPNT = fbh_addfbfig (FBL_HEADFIG,0);
  269. FBL_HEADFIG = FBL_BEFPNT;
  270. FBL_HASH_ASG_FSM = createauthtable( 1000 );
  271. }
  272. design_unit
  273. ..design_unit..
  274. {
  275. struct fbbus *fbbus_pnt;
  276. struct fbreg *fbreg_pnt;
  277. struct fbout *fbout_pnt;
  278. struct fbaux *fbaux_pnt;
  279. authelem *Element;
  280. /* ###----------------------------------------------### */
  281. /* Checking that each output have at least one driver*/
  282. /* ###----------------------------------------------### */
  283. /*printf("liste des types\n");
  284. fbtyp_pnt = FBL_BEFPNT->BETYP;
  285. while (fbtyp_pnt != 0)
  286. {
  287. printf("name : %s [%d]\n",fbtyp_pnt->NAME,j);
  288. printf("class : %c \n",fbtyp_pnt->CLASS);
  289. printf("BASE : %d \n",fbtyp_pnt->BASE);
  290. printf("INDEX : %d \n",fbtyp_pnt->INDEX);
  291. printf("TYPE : %d \n",chktab (hshtab,fbtyp_pnt->NAME,FBL_MODNAM,FBL_TYPDFN) );
  292. if(fbtyp_pnt->VALUE != 0)
  293. for ( i= 0; i< fbtyp_pnt->SIZE ; i++)
  294. printf("VAL : %s \n",*(fbtyp_pnt->VALUE + i));
  295. fbtyp_pnt = fbtyp_pnt->NEXT;
  296. j++;
  297. }*/
  298. fbout_pnt = FBL_BEFPNT->BEOUT;
  299. while (fbout_pnt != 0)
  300. {
  301. Element = searchauthelem( FBL_HASH_ASG_FSM, fbout_pnt->NAME );
  302. if ( Element != (authelem *)0 ) SetFbhAssignByFsm( fbout_pnt );
  303. /* LUDO
  304. if ( (fbout_pnt->ABL == 0) &&
  305. (! IsFbhAssignByFsm( fbout_pnt ) ) )
  306. {
  307. fbl_error (40,fbout_pnt->NAME);
  308. }
  309. */
  310. fbout_pnt = fbout_pnt->NEXT;
  311. }
  312. /*fbrin_pnt = FBL_BEFPNT->BERIN;
  313. while (fbout_pnt != 0)
  314. {
  315. printf("%s \n",fbrin_pnt->NAME);
  316. if (fbout_pnt->ABL == 0)
  317. fbl_error (40,fbrin_pnt->NAME);
  318. fbrin_pnt = fbrin_pnt->NEXT;
  319. }*/
  320. /*fbpcs_pnt = FBL_BEFPNT->BEPCS;
  321. while (fbpcs_pnt != 0)
  322. {
  323. struct fbpgm *fbpgm;
  324. struct ptype *fbtyp;
  325. printf("label : %s \n",fbpcs_pnt->LABEL);
  326. fbpgm = FBL_BEFPNT->BEPGM;
  327. while(fbpgm)
  328. {
  329. fbpgm = fbpgm->NEXT;
  330. }
  331. fbtyp = fbpcs_pnt->INSTRUCTION;
  332. while(fbtyp)
  333. {
  334. display_fbh(fbtyp);
  335. fbtyp = fbtyp->NEXT;
  336. }
  337. fbpcs_pnt = fbpcs_pnt->NEXT;
  338. }*/
  339. fbaux_pnt = FBL_BEFPNT->BEAUX;
  340. while (fbaux_pnt != 0)
  341. {
  342. Element = searchauthelem( FBL_HASH_ASG_FSM, fbaux_pnt->NAME );
  343. if ( Element != (authelem *)0 ) SetFbhAssignByFsm( fbaux_pnt );
  344. if ( (fbaux_pnt->ABL == 0) &&
  345. (! IsFbhAssignByFsm( fbaux_pnt ) ) )
  346. {
  347. fbl_error (40,fbaux_pnt->NAME);
  348. }
  349. fbaux_pnt = fbaux_pnt->NEXT;
  350. }
  351. fbbus_pnt = FBL_BEFPNT->BEBUS;
  352. while (fbbus_pnt != 0)
  353. {
  354. if (fbbus_pnt->BIABL == 0)
  355. {
  356. fbl_error (40,fbbus_pnt->NAME);
  357. }
  358. fbbus_pnt = fbbus_pnt->NEXT;
  359. }
  360. fbreg_pnt = FBL_BEFPNT->BEREG;
  361. while (fbreg_pnt != 0)
  362. {
  363. if (fbreg_pnt->BIABL == 0)
  364. {
  365. fbl_error (40,fbreg_pnt->NAME);
  366. }
  367. fbreg_pnt = fbreg_pnt->NEXT;
  368. }
  369. fretab (hshtab);
  370. destroyauthtable( FBL_HASH_ASG_FSM );
  371. }
  372. ;
  373. ..design_unit..
  374. : /*empty*/
  375. | design_unit
  376. ..design_unit..
  377. ;
  378. design_unit
  379. : context_clause
  380. library_unit
  381. ;
  382. library_unit
  383. : primary_unit
  384. { }
  385. | secondary_unit
  386. { }
  387. | error
  388. { }
  389. ;
  390. primary_unit
  391. : entity_declaration
  392. { }
  393. ;
  394. secondary_unit
  395. : architecture_body
  396. { }
  397. ;
  398. library_clause
  399. : LIBRARY
  400. logical_name_list
  401. Semicolon_ERR
  402. { }
  403. ;
  404. logical_name_list
  405. : Identifier
  406. ...logical_name..
  407. { }
  408. ;
  409. ...logical_name..
  410. : /*empty*/
  411. | ...logical_name..
  412. Comma
  413. Identifier
  414. { }
  415. ;
  416. /* 11.3 */
  417. context_clause
  418. : ..context_item..
  419. { }
  420. ;
  421. ..context_item..
  422. : /*empty*/
  423. | ..context_item..
  424. context_item
  425. { }
  426. ;
  427. context_item
  428. : library_clause
  429. { }
  430. | use_clause
  431. { }
  432. ;
  433. use_clause
  434. : USE
  435. selected_name /* package simple name */
  436. ...selected_name..
  437. Semicolon_ERR
  438. {
  439. }
  440. ;
  441. ...selected_name..
  442. : /*empty*/
  443. { }
  444. | ...selected_name..
  445. Comma
  446. selected_name
  447. { }
  448. ;
  449. selected_name
  450. : prefix
  451. Dot
  452. suffix
  453. {
  454. }
  455. ;
  456. suffix
  457. : simple_name
  458. { }
  459. | ALL
  460. { }
  461. ;
  462. prefix
  463. : simple_name
  464. { }
  465. | prefix
  466. Dot
  467. simple_name
  468. { }
  469. ;
  470. entity_declaration
  471. : ENTITY
  472. simple_name
  473. IS
  474. {
  475. long type,size=0;
  476. struct fbtyp *fbtyp_pnt;
  477. char *name;
  478. char *name_bit;
  479. char *name_bit_vector;
  480. char *name_std_logic;
  481. char *name_std_ulogic;
  482. char *name_std_logic_vector;
  483. char *name_std_ulogic_vector;
  484. FBL_BEFPNT->NAME = $2;
  485. FBL_MODNAM = $2;
  486. fbtyp_pnt = fbh_prdeftyp();
  487. FBL_BEFPNT->BETYP = fbtyp_pnt;
  488. FBL_NUMTYP =1;
  489. while(fbtyp_pnt)
  490. {
  491. size++;
  492. fbtyp_pnt = fbtyp_pnt->NEXT;
  493. }
  494. name_bit = namealloc( "bit" );
  495. name_bit_vector = namealloc( "bit_vector" );
  496. name_std_logic = namealloc( "std_logic" );
  497. name_std_ulogic = namealloc( "std_ulogic" );
  498. name_std_logic_vector = namealloc( "std_logic_vector" );
  499. name_std_ulogic_vector = namealloc( "std_ulogic_vector" );
  500. fbtyp_pnt =FBL_BEFPNT->BETYP ;
  501. while(fbtyp_pnt)
  502. {
  503. type = val_type(fbtyp_pnt->NAME);
  504. addtab(hshtab,fbtyp_pnt->NAME,FBL_MODNAM,FBL_SIGDFN,FBL_TPEDFN);
  505. addtab(hshtab,fbtyp_pnt->NAME,FBL_MODNAM,FBL_USRDFN,type);
  506. addtab(hshtab,fbtyp_pnt->NAME,FBL_MODNAM,FBL_LBLDFN,fbtyp_pnt->CLASS);
  507. addtab(hshtab,fbtyp_pnt->NAME,FBL_MODNAM,FBL_TYPDFN,size +1 - FBL_NUMTYP);
  508. addtab(hshtab,fbtyp_pnt->NAME,FBL_MODNAM,FBL_PNTDFN,(long)fbtyp_pnt);
  509. if ( ( fbtyp_pnt->NAME == name_bit ) ||
  510. ( fbtyp_pnt->NAME == name_bit_vector ) )
  511. {
  512. if ( fbtyp_pnt->NAME == name_bit ) name = name_std_logic;
  513. else name = name_std_logic_vector;
  514. addtab(hshtab,name,FBL_MODNAM,FBL_SIGDFN,FBL_TPEDFN);
  515. addtab(hshtab,name,FBL_MODNAM,FBL_USRDFN,type);
  516. addtab(hshtab,name,FBL_MODNAM,FBL_LBLDFN,fbtyp_pnt->CLASS);
  517. addtab(hshtab,name,FBL_MODNAM,FBL_TYPDFN,size +1 - FBL_NUMTYP);
  518. addtab(hshtab,name,FBL_MODNAM,FBL_PNTDFN,(long)fbtyp_pnt);
  519. if ( fbtyp_pnt->NAME == name_bit ) name = name_std_ulogic;
  520. else name = name_std_ulogic_vector;
  521. addtab(hshtab,name,FBL_MODNAM,FBL_SIGDFN,FBL_TPEDFN);
  522. addtab(hshtab,name,FBL_MODNAM,FBL_USRDFN,type);
  523. addtab(hshtab,name,FBL_MODNAM,FBL_LBLDFN,fbtyp_pnt->CLASS);
  524. addtab(hshtab,name,FBL_MODNAM,FBL_TYPDFN,size +1 - FBL_NUMTYP);
  525. addtab(hshtab,name,FBL_MODNAM,FBL_PNTDFN,(long)fbtyp_pnt);
  526. }
  527. fbtyp_pnt = fbtyp_pnt->NEXT;
  528. FBL_NUMTYP++;
  529. }
  530. }
  531. .port_clause.
  532. END_ERR
  533. .simple_name.
  534. Semicolon_ERR
  535. {
  536. if (($7 != 0) && ($7 != $2))
  537. {
  538. fbl_error (1,$7);
  539. }
  540. }
  541. | ENTITY
  542. error
  543. { fbl_error (2,0); }
  544. ;
  545. .constraint.
  546. : /*empty*/
  547. {
  548. $$.FLAG = 'U';
  549. $$.LEFT = -1;
  550. $$.RIGHT = -1;
  551. }
  552. | constraint
  553. { $$ = $1; }
  554. ;
  555. constraint
  556. : LeftParen
  557. range
  558. RightParen_ERR
  559. { $$ = $2; }
  560. ;
  561. range_constraint
  562. : RANGE
  563. range
  564. { $$ = $2; }
  565. ;
  566. range
  567. : abstractlit
  568. direction
  569. abstractlit
  570. {
  571. $$.FLAG = 'A';
  572. $$.LEFT = $1;
  573. $$.RIGHT = $3;
  574. if ((($1 > $3) && ($2 == FBL_UPTDFN)) ||
  575. (($1 < $3) && ($2 == FBL_DWTDFN)) ||
  576. (($1 < 0 ) || ($2 < 0 )))
  577. {
  578. fbl_error (32,0);
  579. }
  580. }
  581. ;
  582. direction
  583. : TO
  584. { $$ = FBL_UPTDFN; }
  585. | DOWNTO
  586. { $$ = FBL_DWTDFN; }
  587. ;
  588. .port_clause.
  589. : /*empty*/
  590. | port_clause
  591. ;
  592. port_clause
  593. : PORT
  594. LeftParen
  595. formal_port_list
  596. RightParen_ERR
  597. Semicolon_ERR
  598. | PORT
  599. error
  600. Semicolon_ERR
  601. { fbl_error (3,0); }
  602. ;
  603. formal_port_list
  604. : formal_port_element
  605. ...formal_port_element..
  606. ;
  607. ...formal_port_element..
  608. : /*empty*/
  609. | ...formal_port_element..
  610. Semicolon_ERR
  611. formal_port_element
  612. ;
  613. formal_port_element
  614. : .SIGNAL.
  615. identifier_list
  616. Colon
  617. .mode.
  618. type_mark
  619. .constraint.
  620. .signal_kind.
  621. {
  622. char *signame;
  623. long sigconf;
  624. void *pnt;
  625. /* ###----------------------------------------------### */
  626. /* First, check the validity of the declaration. */
  627. /* Then, for each port, create the apropriate set of */
  628. /* structures (fbrin, fbpor, fbout, fbbus) */
  629. /* ###----------------------------------------------### */
  630. fbl_chkdcl ('P', $4, val_type($5.NAME), $5.FLAG, $7, $6.FLAG,&sigconf);
  631. FBL_NM1LST = reverse (FBL_NM1LST);
  632. while (FBL_NM1LST != 0)
  633. {
  634. signame = (char *)FBL_NM1LST->DATA;
  635. if (chktab (hshtab,signame,FBL_MODNAM,FBL_SIGDFN) != 0)
  636. {
  637. fbl_error (4,signame);
  638. }
  639. pnt = fbl_addstr (FBL_BEFPNT,'P',$4,val_type($5.NAME),$5.TYPE,$5.FLAG,signame,
  640. $6.LEFT,$6.RIGHT);
  641. addtab (hshtab,signame,FBL_MODNAM,FBL_SIGDFN,sigconf);
  642. addtab (hshtab,signame,FBL_MODNAM,FBL_TYPDFN,$5.TYPE);
  643. addtab (hshtab,signame,FBL_MODNAM,FBL_WMNDFN,$6.LEFT);
  644. addtab (hshtab,signame,FBL_MODNAM,FBL_WMXDFN,$6.RIGHT);
  645. addtab (hshtab,signame,FBL_MODNAM,FBL_LBLDFN,$7);
  646. addtab (hshtab,signame,FBL_MODNAM,FBL_PNTDFN,(long)pnt);
  647. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  648. }
  649. }
  650. | error
  651. {
  652. /* ###----------------------------------------------### */
  653. /* The following 3 lines reject tokens until the */
  654. /* sync. token 'Semicolon' is found */
  655. /* ###----------------------------------------------### */
  656. /*do
  657. yychar = yylex ();
  658. while ((yychar != Semicolon) && (yychar != 0));
  659. yyerrok;
  660. */
  661. fbl_error (6,0);
  662. }
  663. ;
  664. .SIGNAL.
  665. : /*empty*/
  666. | SIGNAL
  667. ;
  668. .mode.
  669. : /*empty*/
  670. { $$ = FBL_ICNDFN; }
  671. | _IN
  672. { $$ = FBL_ICNDFN; }
  673. | _OUT
  674. { $$ = FBL_OCNDFN; }
  675. | _INOUT
  676. { $$ = FBL_BCNDFN; }
  677. ;
  678. architecture_body
  679. : ARCHITECTURE
  680. Identifier
  681. OF
  682. simple_name
  683. IS
  684. {
  685. if ($4 != FBL_MODNAM)
  686. {
  687. fbl_error (1,$4);
  688. }
  689. }
  690. architecture_declarative_part
  691. {
  692. struct fbtyp *listfbtyp;
  693. struct fbtyp *fbtypaux;
  694. struct fbtyp *revfbtyp = 0;
  695. listfbtyp = FBL_BEFPNT->BETYP;
  696. revfbtyp = listfbtyp;
  697. listfbtyp = listfbtyp->NEXT;
  698. revfbtyp->NEXT = 0;
  699. while(listfbtyp != 0)
  700. {
  701. fbtypaux = revfbtyp;
  702. revfbtyp = listfbtyp;
  703. listfbtyp = listfbtyp->NEXT;
  704. revfbtyp->NEXT = fbtypaux;
  705. }
  706. FBL_BEFPNT->BETYP = fbh_crtfbtyp(revfbtyp);
  707. }
  708. _BEGIN
  709. architecture_statement_part
  710. END_ERR
  711. .simple_name.
  712. Semicolon_ERR
  713. {
  714. if (($12 != 0) && ($12 != $2))
  715. {
  716. fbl_error (7,$12);
  717. }
  718. }
  719. | ARCHITECTURE
  720. error
  721. { fbl_error (8,0); }
  722. ;
  723. architecture_declarative_part
  724. : ..block_declarative_item..
  725. ;
  726. ..block_declarative_item..
  727. : /*empty*/
  728. | ..block_declarative_item..
  729. block_declarative_item
  730. ;
  731. block_declarative_item
  732. : signal_declaration
  733. | type_declaration
  734. | subtype_declaration
  735. | constant_declaration
  736. | pragma_declaration
  737. | error
  738. Semicolon_ERR
  739. { fbl_error (9,0); }
  740. ;
  741. pragma_declaration
  742. : Pragma
  743. {
  744. char pragma[30];
  745. char type[128];
  746. char name[128];
  747. char value[128];
  748. char *pt;
  749. long field;
  750. field = sscanf((char *)$1,"-- %s %s %s %s", pragma,type,name,value);
  751. if ( field == 3 ) pt = (void *)0;
  752. else
  753. if ( field == 4 ) pt = namealloc( value );
  754. else
  755. {
  756. fbl_error (86,0);
  757. }
  758. FBL_BEFPNT->BEPGM = fbh_addfbpgm(FBL_BEFPNT->BEPGM,type,name,pt);
  759. FBL_BEFPNT->BEPGM->LINE_NUM = FBL_LINNUM;
  760. }
  761. ;
  762. constant_declaration
  763. : CONSTANT
  764. Identifier
  765. Colon
  766. type_mark
  767. .constraint.
  768. constant_VarAsgn__expression
  769. Semicolon_ERR
  770. {
  771. long sigconf;
  772. if (fbl_chkdcl ('C',0,val_type($4.NAME),$4.FLAG,0,$5.FLAG,&sigconf) == 0)
  773. {
  774. addtab (hshtab,$2,FBL_MODNAM,FBL_WMNDFN,$5.LEFT);
  775. addtab (hshtab,$2,FBL_MODNAM,FBL_WMXDFN,$5.RIGHT);
  776. addtab (hshtab,$2,FBL_MODNAM,FBL_SIGDFN,sigconf);
  777. addtab (hshtab,$2,FBL_MODNAM,FBL_TYPDFN,-1);
  778. addtab (hshtab,$2,0,FBL_PNTDFN,$6);
  779. }
  780. }
  781. ;
  782. constant_VarAsgn__expression
  783. : VarAsgn
  784. literal
  785. { $$ = $2; }
  786. ;
  787. signal_declaration
  788. : SIGNAL
  789. identifier_list
  790. Colon
  791. type_mark
  792. .constraint.
  793. .signal_kind.
  794. Semicolon_ERR
  795. {
  796. char *signame;
  797. long sigconf;
  798. void *pnt;
  799. long errflg;
  800. errflg = fbl_chkdcl ('S',0,val_type($4.NAME),$4.FLAG,$6,$5.FLAG,&sigconf);
  801. /* ###----------------------------------------------### */
  802. /* First, check the validity of the declaration. */
  803. /* Then, for each signal, create the apropriate set of */
  804. /* structures (fbrin, fbreg, fbaux, fbbux)
  805. */
  806. /* ###----------------------------------------------### */
  807. /*if( val_type($4.NAME) != -1)
  808. fbl_error(81,$4.NAME);*/
  809. /*else */
  810. {
  811. FBL_NM1LST = reverse (FBL_NM1LST);
  812. while (FBL_NM1LST != 0)
  813. {
  814. signame = (char *)FBL_NM1LST->DATA;
  815. if (chktab (hshtab,signame,FBL_MODNAM,FBL_SIGDFN) != 0)
  816. {
  817. fbl_error (10,signame);
  818. }
  819. pnt = fbl_addstr (FBL_BEFPNT,'S',0,val_type($4.NAME),$4.TYPE,
  820. $4.FLAG,signame, $5.LEFT,$5.RIGHT);
  821. addtab (hshtab,signame,FBL_MODNAM,FBL_SIGDFN,sigconf);
  822. addtab (hshtab,signame,FBL_MODNAM,FBL_TYPDFN,$4.TYPE);
  823. addtab (hshtab,signame,FBL_MODNAM,FBL_WMNDFN,$5.LEFT);
  824. addtab (hshtab,signame,FBL_MODNAM,FBL_WMXDFN,$5.RIGHT);
  825. addtab (hshtab,signame,FBL_MODNAM,FBL_LBLDFN,$6);
  826. addtab (hshtab,signame,FBL_MODNAM,FBL_PNTDFN,(long)pnt);
  827. FBL_NM1LST = delchain (FBL_NM1LST,FBL_NM1LST);
  828. }
  829. }
  830. }
  831. ;
  832. type_declaration
  833. : full_type_declaration
  834. ;
  835. full_type_declaration
  836. : FBHTYPE
  837. Identifier
  838. IS
  839. type_definition
  840. {
  841. FBL_BEFPNT->BETYP = fbh_addfbtyp(FBL_BEFPNT->BETYP,$2,$4.LEFT,
  842. $4.RIGHT,$4.VALUE,$4.SIZE,$4.BYTE,$4.BASE,$4.INDEX,$4.RESOLV,$4.CLASS);
  843. FBL_BEFPNT->BETYP->LINE_NUM = FBL_LINNUM;
  844. addtab(hshtab,$2,FBL_MODNAM,FBL_SIGDFN,FBL_TPEDFN);
  845. addtab(hshtab,$2,FBL_MODNAM,FBL_LBLDFN,$4.CLASS);
  846. addtab(hshtab,$2,FBL_MODNAM,FBL_TYPDFN,FBL_NUMTYP);
  847. addtab (hshtab,$2,FBL_MODNAM,FBL_PNTDFN,(long)FBL_BEFPNT->BETYP);
  848. FBL_NUMTYP++;
  849. }
  850. Semicolon_ERR
  851. ;
  852. type_definition
  853. : scalar_type_definition
  854. { $$ = $1; }
  855. | composite_type_definition
  856. { $$ = $1; }
  857. | error Semicolon_ERR
  858. { yyerrok; }
  859. ;
  860. subtype_declaration
  861. : SUBTYPE
  862. Identifier
  863. IS
  864. subtype_indication
  865. {
  866. FBL_BEFPNT->BETYP = fbh_addfbtyp(FBL_BEFPNT->BETYP,$2,$4.LEFT,
  867. $4.RIGHT,$4.VALUE,$4.SIZE,$4.BYTE,$4.BASE,$4.INDEX,$4.RESOLV,$4.CLASS);
  868. FBL_BEFPNT->BETYP->LINE_NUM = FBL_LINNUM;
  869. addtab(hshtab,$2,FBL_MODNAM,FBL_SIGDFN,FBL_TPEDFN);
  870. addtab(hshtab,$2,FBL_MODNAM,FBL_LBLDFN,$4.CLASS);
  871. addtab(hshtab,$2,FBL_MODNAM,FBL_TYPDFN,FBL_NUMTYP);
  872. addtab (hshtab,$2,FBL_MODNAM,FBL_PNTDFN,(long)FBL_BEFPNT->BETYP);
  873. FBL_NUMTYP++;
  874. }
  875. Semicolon_ERR
  876. ;
  877. subtype_indication
  878. : type_mark
  879. .constraint.
  880. { struct fbtyp *fbtyp_pnt;
  881. fbtyp_pnt = (struct fbtyp*)chktab(hshtab,$1,FBL_MODNAM,FBL_PNTDFN);
  882. $$.BASE = $1.TYPE ;
  883. $$.VALUE = 0 ;
  884. $$.SIZE = 0 ;
  885. $$.BYTE = fbtyp_pnt->BYTE ;
  886. $$.LEFT = $2.LEFT ;
  887. $$.RIGHT = $2.RIGHT ;
  888. $$.CLASS = 'S' ;
  889. $$.RESOLV = 0 ;
  890. }
  891. ;
  892. scalar_type_definition
  893. : enumeration_type_definition
  894. {
  895. $$ = $1;
  896. }
  897. ;
  898. enumeration_type_definition
  899. : LeftParen
  900. enumeration_literal
  901. ...enumeration_literal..
  902. RightParen_ERR
  903. {
  904. char *enumname;
  905. long size=0;
  906. long indice=0;
  907. char **pnt;
  908. chain_list *nm1lst;
  909. FBL_NM1LST = reverse (FBL_NM1LST);
  910. nm1lst = FBL_NM1LST;
  911. while (nm1lst != 0)
  912. {
  913. size++;
  914. nm1lst = nm1lst->NEXT;
  915. }
  916. if( size != 0)
  917. pnt = (char **) malloc(size * sizeof(char*));
  918. while (FBL_NM1LST != 0)
  919. {
  920. enumname = namealloc((char *)FBL_NM1LST->DATA);
  921. if (chktab (hshtab,enumname,FBL_MODNAM,FBL_SIGDFN) != 0)
  922. {
  923. fbl_error (82,enumname);
  924. }
  925. addtab (hshtab,enumname,FBL_MODNAM,FBL_SIGDFN,FBL_CSTDFN);
  926. addtab (hshtab,enumname,FBL_MODNAM,FBL_TYPDFN,FBL_NUMTYP);
  927. addtab (hshtab,enumname,FBL_MODNAM,FBL_USRDFN,size);
  928. addtab (hshtab,enumname,FBL_MODNAM,FBL_WMNDFN,-1);
  929. addtab (hshtab,enumname,FBL_MODNAM,FBL_WMXDFN,-1);
  930. addtab (hshtab,enumname,FBL_MODNAM,FBL_LBLDFN,indice);
  931. addtab (hshtab,enumname,FBL_MODNAM,FBL_PNTDFN,(long)pnt);
  932. pnt[indice++] = enumname;
  933. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  934. }
  935. $$.VALUE = pnt ;
  936. $$.SIZE = size ;
  937. $$.LEFT = 0 ;
  938. $$.RIGHT = 0 ;
  939. $$.BYTE = size/256 +1;
  940. $$.CLASS = 'E' ;
  941. $$.BASE = 0 ;
  942. $$.RESOLV = 0 ;
  943. }
  944. ;
  945. ...enumeration_literal..
  946. : /*empty*/
  947. | ...enumeration_literal..
  948. Comma
  949. enumeration_literal
  950. { yyerrok; }
  951. ;
  952. enumeration_literal
  953. : Identifier
  954. { FBL_NM1LST = addchain (FBL_NM1LST,$1); }
  955. | CharacterLit
  956. { FBL_NM1LST = addchain (FBL_NM1LST,$1); }
  957. ;
  958. composite_type_definition
  959. : array_type_definition
  960. {
  961. $$ = $1;
  962. }
  963. ;
  964. array_type_definition
  965. : unconstrained_array_definition
  966. { $$ = $1; }
  967. | constrained_array_definition
  968. { $$ = $1; }
  969. ;
  970. unconstrained_array_definition
  971. : ARRAY
  972. LeftParen
  973. index_subtype_definition
  974. RightParen_ERR
  975. OF
  976. subtype_indication
  977. {
  978. $$ = $6;
  979. $$.CLASS = 'U';
  980. $$.INDEX = $3.TYPE;
  981. }
  982. ;
  983. constrained_array_definition
  984. : ARRAY
  985. index_constraint
  986. OF
  987. subtype_indication
  988. { $$ = $4;
  989. $$.CLASS = 'A';
  990. $$.INDEX = $2.TYPE;
  991. }
  992. ;
  993. index_subtype_definition
  994. : name /* type_mark - causes conflict */
  995. RANGE
  996. Box
  997. {
  998. $$.NAME = $1.NAME;
  999. $$.LEFT = $1.LEFT;
  1000. $$.RIGHT = $1.RIGHT;
  1001. /*$$.TYPE = chktab(hshtab,$1,FBL_MODNAM,FBL_TYPDFN); */
  1002. $$.TYPE = $1.TYPE;
  1003. $$.FLAG = chktab(hshtab,$1,FBL_MODNAM,FBL_LBLDFN);
  1004. if ($$.TYPE == 0 || $$.FLAG ==0)
  1005. {
  1006. fbl_error(83,$1.NAME);
  1007. }
  1008. }
  1009. ;
  1010. index_constraint
  1011. : LeftParen
  1012. discrete_range
  1013. RightParen_ERR
  1014. { $$ = $2;}
  1015. ;
  1016. discrete_range
  1017. : range /* includes attribute_name */
  1018. { $$ = $1;}
  1019. | name
  1020. range_constraint /* subtype_indication - causes conflict */
  1021. { $$ = $2;
  1022. $$.NAME = $1.NAME;
  1023. }
  1024. | type_mark /* type_mark causes 2 r/r conflicts - required for
  1025. louie's code */
  1026. { $$ = $1;}
  1027. ;
  1028. type_mark
  1029. : simple_name
  1030. {
  1031. long type;
  1032. $$.NAME = $1;
  1033. $$.LEFT = -1;
  1034. $$.RIGHT = -1;
  1035. $$.TYPE = chktab(hshtab,$1,FBL_MODNAM,FBL_TYPDFN);
  1036. $$.FLAG = chktab(hshtab,$1,FBL_MODNAM,FBL_LBLDFN);
  1037. type = chktab(hshtab,$1,FBL_MODNAM,FBL_SIGDFN);
  1038. if (type != FBL_TPEDFN || $$.TYPE ==0)
  1039. {
  1040. fbl_error(84,$1);
  1041. }
  1042. }
  1043. ;
  1044. .signal_kind.
  1045. : /*empty*/
  1046. { $$ = 0; }
  1047. | REGISTER
  1048. { $$ = REGISTER; }
  1049. | BUS
  1050. { $$ = BUS; }
  1051. ;
  1052. architecture_statement_part
  1053. : ..concurrent_statement..
  1054. ;
  1055. ..concurrent_statement..
  1056. : /*empty*/
  1057. | ..concurrent_statement..
  1058. concurrent_statement
  1059. ;
  1060. concurrent_statement
  1061. : process_statement
  1062. | block_statement
  1063. | concurrent_assertion_statement
  1064. | concurrent_signal_assignment_statement
  1065. | error
  1066. Semicolon_ERR
  1067. { fbl_error (18,0); }
  1068. ;
  1069. /* DEBUT LUDO */
  1070. block_statement
  1071. : a_label
  1072. _BLOCK
  1073. .guard_expression.
  1074. _BEGIN
  1075. {
  1076. if (chktab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN) != 0)
  1077. {
  1078. fbl_error (19,$1);
  1079. }
  1080. addtab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN,1);
  1081. if ($3 != NULL)
  1082. FBL_GRDLST = addchain (FBL_GRDLST,(char *)$3);
  1083. }
  1084. set_of_statements
  1085. END_ERR
  1086. _BLOCK
  1087. .label.
  1088. Semicolon_ERR
  1089. {
  1090. if ($3 != NULL)
  1091. FBL_GRDLST = delchain (FBL_GRDLST,FBL_GRDLST);
  1092. if (($9 != NULL) && ($9 != $1))
  1093. {
  1094. fbl_error (20,$9);
  1095. }
  1096. }
  1097. ;
  1098. set_of_statements
  1099. : ..concurrent_statement..
  1100. ;
  1101. concurrent_assertion_statement
  1102. : a_label
  1103. unlabeled_concurrent_assertion_statement
  1104. {
  1105. if (chktab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN) != 0)
  1106. {
  1107. fbl_error (19,$1);
  1108. }
  1109. addtab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN,1);
  1110. if (FBL_ERRFLG == 0)
  1111. FBL_BEFPNT->BEMSG->LABEL = $1;
  1112. }
  1113. | unlabeled_concurrent_assertion_statement
  1114. ;
  1115. concurrent_signal_assignment_statement
  1116. : a_label
  1117. unlabeled_conditional_signal_assignment
  1118. {
  1119. if (chktab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN) != 0)
  1120. {
  1121. fbl_error (19,$1);
  1122. }
  1123. addtab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN,1);
  1124. }
  1125. | unlabeled_conditional_signal_assignment
  1126. | a_label
  1127. unlabeled_selected_signal_assignment
  1128. {
  1129. if (chktab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN) != 0)
  1130. {
  1131. {
  1132. fbl_error (19,$1);
  1133. }
  1134. }
  1135. addtab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN,1);
  1136. }
  1137. | unlabeled_selected_signal_assignment
  1138. ;
  1139. unlabeled_concurrent_assertion_statement
  1140. : assertion_statement
  1141. ;
  1142. unlabeled_conditional_signal_assignment
  1143. : target
  1144. _LESym
  1145. .GUARDED.
  1146. ..waveform__WHEN__condition__ELSE..
  1147. waveform
  1148. Semicolon_ERR
  1149. {
  1150. long i;
  1151. struct fbout *fbout_pnt;
  1152. struct fbbus *fbbus_pnt;
  1153. struct fbreg *fbreg_pnt;
  1154. struct fbaux *fbaux_pnt;
  1155. struct fbbux *fbbux_pnt;
  1156. struct chain *abl_pnt;
  1157. struct fbl_expr expr0;
  1158. struct fbl_expr expr1;
  1159. struct fbl_expr expr2;
  1160. struct fbl_expr expr3;
  1161. struct fbl_expr expr4;
  1162. struct fbl_expr expr5;
  1163. struct fbl_expr expr6;
  1164. long rev_flg = 0;
  1165. long left_bnd;
  1166. long right_bnd;
  1167. long left;
  1168. long right;
  1169. long in_bound;
  1170. long out_bound;
  1171. long sig_width;
  1172. long sig_conf;
  1173. expr4 = $5;
  1174. while (FBL_CNDLST != NULL)
  1175. {
  1176. expr5 = *((fbl_ablstr *) FBL_CNDLST->DATA);
  1177. expr6 = *((fbl_ablstr *) FBL_VALLST->DATA);
  1178. expr0 = fbl_cpyablstr (expr5);
  1179. expr1 = fbl_crtabl (ABL_NOT , expr5, FBL_EMPSTR,-1,-1);
  1180. expr5 = expr0;
  1181. expr2 = fbl_crtabl (ANDM, expr4, expr1 ,-1,-1);
  1182. expr3 = fbl_crtabl (ANDM, expr6, expr5 ,-1,-1);
  1183. expr4 = fbl_crtabl (ABL_OR , expr2, expr3 ,-1,-1);
  1184. FBL_CNDLST = delchain (FBL_CNDLST,FBL_CNDLST);
  1185. FBL_VALLST = delchain (FBL_VALLST,FBL_VALLST);
  1186. }
  1187. left_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMNDFN);
  1188. right_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMXDFN);
  1189. sig_conf = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_SIGDFN);
  1190. left = $1.LEFT;
  1191. right = $1.RIGHT;
  1192. if (left_bnd <= right_bnd)
  1193. {
  1194. sig_width = right_bnd - left_bnd + 1;
  1195. if (left <= right)
  1196. {
  1197. rev_flg = 0;
  1198. in_bound = right_bnd - right;
  1199. out_bound = right_bnd - left;
  1200. if ((left < left_bnd) || (right > right_bnd))
  1201. {
  1202. fbl_error (36,$1.NAME);
  1203. }
  1204. }
  1205. else
  1206. {
  1207. rev_flg = 1;
  1208. in_bound = right_bnd - left;
  1209. out_bound = right_bnd - right;
  1210. if ((left > right_bnd) || (right < left_bnd))
  1211. {
  1212. fbl_error (36,$1.NAME);
  1213. }
  1214. }
  1215. }
  1216. else
  1217. {
  1218. sig_width = left_bnd - right_bnd + 1;
  1219. if (left <= right)
  1220. {
  1221. rev_flg = 1;
  1222. in_bound = left - right_bnd;
  1223. out_bound = right - right_bnd;
  1224. if ((left < right_bnd) || (right > left_bnd))
  1225. {
  1226. fbl_error (36,$1.NAME);
  1227. }
  1228. }
  1229. else
  1230. {
  1231. rev_flg = 0;
  1232. in_bound = right - right_bnd;
  1233. out_bound = left - right_bnd;
  1234. if ((left > left_bnd) || (right < right_bnd))
  1235. {
  1236. fbl_error (36,$1.NAME);
  1237. }
  1238. }
  1239. }
  1240. if ((out_bound - in_bound + 1) != expr4.WIDTH)
  1241. {
  1242. fbl_error (35,$1.NAME);
  1243. }
  1244. if (rev_flg == 1)
  1245. expr4.LIST_ABL = reverse (expr4.LIST_ABL);
  1246. abl_pnt = expr4.LIST_ABL;
  1247. switch (sig_conf)
  1248. {
  1249. case (FBL_ICNDFN + FBL_BITDFN + FBL_NORDFN) :
  1250. {
  1251. fbl_error (21,$1.NAME);
  1252. }
  1253. break;
  1254. case (FBL_OCNDFN + FBL_BITDFN + FBL_NORDFN) :
  1255. case (FBL_BCNDFN + FBL_BITDFN + FBL_NORDFN) :
  1256. if ($3 == FBL_GRDDFN)
  1257. {
  1258. fbl_error (22,$1.NAME);
  1259. }
  1260. fbout_pnt = (struct fbout *)
  1261. chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_PNTDFN);
  1262. if (FBL_ERRFLG == 0)
  1263. {
  1264. for (i=0 ; i<sig_width ; i++)
  1265. {
  1266. if (i >= in_bound)
  1267. {
  1268. if (fbout_pnt->ABL != NULL)
  1269. {
  1270. fbl_error (39,fbout_pnt->NAME);
  1271. }
  1272. else
  1273. fbout_pnt->ABL = (struct chain *)abl_pnt->DATA;
  1274. abl_pnt = abl_pnt->NEXT;
  1275. }
  1276. if (i >= out_bound)
  1277. break;
  1278. fbout_pnt = fbout_pnt->NEXT;
  1279. }
  1280. }
  1281. break;
  1282. case (FBL_OCNDFN + FBL_MUXDFN + FBL_BUSDFN) :
  1283. case (FBL_OCNDFN + FBL_WORDFN + FBL_BUSDFN) :
  1284. case (FBL_BCNDFN + FBL_MUXDFN + FBL_BUSDFN) :
  1285. case (FBL_BCNDFN + FBL_WORDFN + FBL_BUSDFN) :
  1286. if (($3 != FBL_GRDDFN) || (FBL_GRDLST == NULL))
  1287. {
  1288. fbl_error (23,$1.NAME);
  1289. }
  1290. fbbus_pnt = (struct fbbus *)
  1291. chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_PNTDFN);
  1292. if (FBL_ERRFLG == 0)
  1293. {
  1294. for (i=0 ; i<sig_width ; i++)
  1295. {
  1296. if (i >= in_bound)
  1297. {
  1298. fbbus_pnt->BINODE = fbh_addbinode (fbbus_pnt->BINODE,
  1299. NULL,NULL);
  1300. fbbus_pnt->BIABL = fbh_addbiabl (fbbus_pnt->BIABL,
  1301. FBL_LBLNAM,
  1302. dupablexpr(FBL_GRDLST->DATA) ,
  1303. abl_pnt->DATA);
  1304. abl_pnt = abl_pnt->NEXT;
  1305. }
  1306. if (i >= out_bound)
  1307. break;
  1308. fbbus_pnt = fbbus_pnt->NEXT;
  1309. }
  1310. }
  1311. break;
  1312. case (FBL_BITDFN + FBL_NORDFN):
  1313. if ($3 == FBL_GRDDFN)
  1314. {
  1315. fbl_error (22,$1.NAME);
  1316. }
  1317. fbaux_pnt = (struct fbaux *)
  1318. chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_PNTDFN);
  1319. if (FBL_ERRFLG == 0)
  1320. {
  1321. for (i=0 ; i<sig_width ; i++)
  1322. {
  1323. if (i >= in_bound)
  1324. {
  1325. if (fbaux_pnt->ABL != NULL)
  1326. {
  1327. fbl_error (39,fbaux_pnt->NAME);
  1328. }
  1329. else
  1330. fbaux_pnt->ABL = (struct chain *)abl_pnt->DATA;
  1331. abl_pnt = abl_pnt->NEXT;
  1332. }
  1333. if (i >= out_bound)
  1334. break;
  1335. fbaux_pnt = fbaux_pnt->NEXT;
  1336. }
  1337. }
  1338. break;
  1339. case (FBL_RBIDFN + FBL_REGDFN):
  1340. if (($3 != FBL_GRDDFN) || (FBL_GRDLST == NULL))
  1341. {
  1342. fbl_error (23,$1.NAME);
  1343. }
  1344. fbreg_pnt = (struct fbreg *)
  1345. chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_PNTDFN);
  1346. if (FBL_ERRFLG == 0)
  1347. {
  1348. for (i=0 ; i<sig_width ; i++)
  1349. {
  1350. if (i >= in_bound)
  1351. {
  1352. fbreg_pnt->BINODE = fbh_addbinode (fbreg_pnt->BINODE,
  1353. NULL,NULL);
  1354. fbreg_pnt->BIABL = fbh_addbiabl (fbreg_pnt->BIABL,
  1355. FBL_LBLNAM,
  1356. dupablexpr(FBL_GRDLST->DATA) ,
  1357. abl_pnt->DATA);
  1358. abl_pnt = abl_pnt->NEXT;
  1359. }
  1360. if (i >= out_bound)
  1361. break;
  1362. fbreg_pnt = fbreg_pnt->NEXT;
  1363. }
  1364. }
  1365. break;
  1366. case (FBL_MUXDFN + FBL_BUSDFN) :
  1367. case (FBL_WORDFN + FBL_BUSDFN) :
  1368. if (($3 != FBL_GRDDFN) || (FBL_GRDLST == NULL))
  1369. {
  1370. fbl_error (23,$1.NAME);
  1371. }
  1372. fbbux_pnt = (struct fbbux *)
  1373. chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_PNTDFN);
  1374. if (FBL_ERRFLG == 0)
  1375. {
  1376. for (i=0 ; i<sig_width ; i++)
  1377. {
  1378. if (i >= in_bound)
  1379. {
  1380. fbbux_pnt->BINODE = fbh_addbinode (fbbux_pnt->BINODE,
  1381. NULL,NULL);
  1382. fbbux_pnt->BIABL = fbh_addbiabl (fbbux_pnt->BIABL,
  1383. FBL_LBLNAM,
  1384. dupablexpr(FBL_GRDLST->DATA) ,
  1385. abl_pnt->DATA);
  1386. abl_pnt = abl_pnt->NEXT;
  1387. }
  1388. if (i >= out_bound)
  1389. break;
  1390. fbbux_pnt = fbbux_pnt->NEXT;
  1391. }
  1392. }
  1393. break;
  1394. default :
  1395. {
  1396. fbl_error (17,$1.NAME);
  1397. }
  1398. break;
  1399. }
  1400. }
  1401. ;
  1402. ..waveform__WHEN__condition__ELSE..
  1403. : /*empty*/
  1404. | ..waveform__WHEN__condition__ELSE..
  1405. waveform
  1406. WHEN
  1407. expression
  1408. ELSE
  1409. {
  1410. struct fbl_expr *expr_pnt;
  1411. expr_pnt = (fbl_ablstr *)mbkalloc(sizeof(fbl_ablstr));
  1412. expr_pnt->WIDTH = $4.WIDTH;
  1413. expr_pnt->LIST_ABL = $4.LIST_ABL;
  1414. FBL_CNDLST = addchain (FBL_CNDLST,(char *) expr_pnt);
  1415. expr_pnt = (fbl_ablstr *)mbkalloc(sizeof(fbl_ablstr));
  1416. expr_pnt->WIDTH = $2.WIDTH;
  1417. expr_pnt->LIST_ABL = $2.LIST_ABL;
  1418. FBL_VALLST = addchain (FBL_VALLST,(char *) expr_pnt);
  1419. }
  1420. ;
  1421. unlabeled_selected_signal_assignment
  1422. : WITH
  1423. expression
  1424. {
  1425. FBL_SLCEXP = $2;
  1426. FBL_BDDPNT = NULL;
  1427. }
  1428. SELECT
  1429. target
  1430. _LESym
  1431. .GUARDED.
  1432. waveform__WHEN__choices
  1433. ...waveform__WHEN__choices..
  1434. Semicolon_ERR
  1435. {
  1436. long i;
  1437. struct fbout *fbout_pnt;
  1438. struct fbbus *fbbus_pnt;
  1439. struct fbreg *fbreg_pnt;
  1440. struct fbaux *fbaux_pnt;
  1441. struct fbbux *fbbux_pnt;
  1442. struct chain *abl_pnt;
  1443. struct fbl_expr expr1;
  1444. long rev_flg = 0;
  1445. long left_bnd;
  1446. long right_bnd;
  1447. long left;
  1448. long right;
  1449. long in_bound;
  1450. long out_bound;
  1451. long sig_width;
  1452. long sig_conf;
  1453. expr1 = fbl_crtabl (ABL_OR ,$8 ,$9,-1,-1);
  1454. if (FBL_BDDPNT != getlogbddnodeone())
  1455. {
  1456. fbl_error (25,NULL);
  1457. }
  1458. left_bnd = chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_WMNDFN);
  1459. right_bnd = chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_WMXDFN);
  1460. sig_conf = chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_SIGDFN);
  1461. left = $5.LEFT;
  1462. right = $5.RIGHT;
  1463. if (left_bnd <= right_bnd)
  1464. {
  1465. sig_width = right_bnd - left_bnd + 1;
  1466. if (left <= right)
  1467. {
  1468. rev_flg = 0;
  1469. in_bound = right_bnd - right;
  1470. out_bound = right_bnd - left;
  1471. if ((left < left_bnd) || (right > right_bnd))
  1472. {
  1473. fbl_error (36,$5.NAME);
  1474. }
  1475. }
  1476. else
  1477. {
  1478. rev_flg = 1;
  1479. in_bound = right_bnd - left;
  1480. out_bound = right_bnd - right;
  1481. if ((left > right_bnd) || (right < left_bnd))
  1482. {
  1483. fbl_error (36,$5.NAME);
  1484. }
  1485. }
  1486. }
  1487. else
  1488. {
  1489. sig_width = left_bnd - right_bnd + 1;
  1490. if (left <= right)
  1491. {
  1492. rev_flg = 1;
  1493. in_bound = left - right_bnd;
  1494. out_bound = right - right_bnd;
  1495. if ((left < right_bnd) || (right > left_bnd))
  1496. {
  1497. fbl_error (36,$5.NAME);
  1498. }
  1499. }
  1500. else
  1501. {
  1502. rev_flg = 0;
  1503. in_bound = right - right_bnd;
  1504. out_bound = left - right_bnd;
  1505. if ((left > left_bnd) || (right < right_bnd))
  1506. {
  1507. fbl_error (36,$5.NAME);
  1508. }
  1509. }
  1510. }
  1511. if ((out_bound - in_bound + 1) != expr1.WIDTH)
  1512. {
  1513. fbl_error (35,$5.NAME);
  1514. }
  1515. if (rev_flg == 1)
  1516. expr1.LIST_ABL = reverse (expr1.LIST_ABL);
  1517. abl_pnt = expr1.LIST_ABL;
  1518. switch (sig_conf)
  1519. {
  1520. case (FBL_ICNDFN + FBL_BITDFN + FBL_NORDFN) :
  1521. {
  1522. fbl_error (21,$5.NAME);
  1523. }
  1524. break;
  1525. case (FBL_OCNDFN + FBL_BITDFN + FBL_NORDFN) :
  1526. case (FBL_BCNDFN + FBL_BITDFN + FBL_NORDFN) :
  1527. if ($7 == FBL_GRDDFN)
  1528. {
  1529. fbl_error (22,$5.NAME);
  1530. }
  1531. fbout_pnt = (struct fbout *)
  1532. chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_PNTDFN);
  1533. if (FBL_ERRFLG == 0)
  1534. {
  1535. for (i=0 ; i<sig_width ; i++)
  1536. {
  1537. if (i >= in_bound)
  1538. {
  1539. if (fbout_pnt->ABL != NULL)
  1540. {
  1541. fbl_error (39,fbout_pnt->NAME);
  1542. }
  1543. else
  1544. fbout_pnt->ABL = (struct chain *)abl_pnt->DATA;
  1545. abl_pnt = abl_pnt->NEXT;
  1546. }
  1547. if (i >= out_bound)
  1548. break;
  1549. fbout_pnt = fbout_pnt->NEXT;
  1550. }
  1551. }
  1552. break;
  1553. case (FBL_OCNDFN + FBL_MUXDFN + FBL_BUSDFN) :
  1554. case (FBL_OCNDFN + FBL_WORDFN + FBL_BUSDFN) :
  1555. case (FBL_BCNDFN + FBL_MUXDFN + FBL_BUSDFN) :
  1556. case (FBL_BCNDFN + FBL_WORDFN + FBL_BUSDFN) :
  1557. if (($7 != FBL_GRDDFN) || (FBL_GRDLST == NULL))
  1558. {
  1559. fbl_error (23,$5.NAME);
  1560. }
  1561. fbbus_pnt = (struct fbbus *)
  1562. chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_PNTDFN);
  1563. if (FBL_ERRFLG == 0)
  1564. {
  1565. for (i=0 ; i<sig_width ; i++)
  1566. {
  1567. if (i >= in_bound)
  1568. {
  1569. fbbus_pnt->BINODE = fbh_addbinode (fbbus_pnt->BINODE,
  1570. NULL,NULL);
  1571. fbbus_pnt->BIABL = fbh_addbiabl (fbbus_pnt->BIABL,
  1572. FBL_LBLNAM,
  1573. dupablexpr(FBL_GRDLST->DATA) ,
  1574. abl_pnt->DATA);
  1575. abl_pnt = abl_pnt->NEXT;
  1576. }
  1577. if (i >= out_bound)
  1578. break;
  1579. fbbus_pnt = fbbus_pnt->NEXT;
  1580. }
  1581. }
  1582. break;
  1583. case (FBL_BITDFN + FBL_NORDFN):
  1584. if ($7 == FBL_GRDDFN)
  1585. {
  1586. fbl_error (22,$5.NAME);
  1587. }
  1588. fbaux_pnt = (struct fbaux *)
  1589. chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_PNTDFN);
  1590. if (FBL_ERRFLG == 0)
  1591. {
  1592. for (i=0 ; i<sig_width ; i++)
  1593. {
  1594. if (i >= in_bound)
  1595. {
  1596. if (fbaux_pnt->ABL != NULL)
  1597. {
  1598. fbl_error (39,fbaux_pnt->NAME);
  1599. }
  1600. else
  1601. {
  1602. fbaux_pnt->ABL = (struct chain *)abl_pnt->DATA;
  1603. }
  1604. abl_pnt = abl_pnt->NEXT;
  1605. }
  1606. if (i >= out_bound)
  1607. break;
  1608. fbaux_pnt = fbaux_pnt->NEXT;
  1609. }
  1610. }
  1611. break;
  1612. case (FBL_RBIDFN + FBL_REGDFN):
  1613. if (($7 != FBL_GRDDFN) || (FBL_GRDLST == NULL))
  1614. {
  1615. fbl_error (23,$5.NAME);
  1616. }
  1617. fbreg_pnt = (struct fbreg *)
  1618. chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_PNTDFN);
  1619. if (FBL_ERRFLG == 0)
  1620. {
  1621. for (i=0 ; i<sig_width ; i++)
  1622. {
  1623. if (i >= in_bound)
  1624. {
  1625. fbreg_pnt->BINODE = fbh_addbinode (fbreg_pnt->BINODE,
  1626. NULL,NULL);
  1627. fbreg_pnt->BIABL = fbh_addbiabl (fbreg_pnt->BIABL,
  1628. FBL_LBLNAM,
  1629. dupablexpr(FBL_GRDLST->DATA) ,
  1630. abl_pnt->DATA);
  1631. abl_pnt = abl_pnt->NEXT;
  1632. }
  1633. if (i >= out_bound)
  1634. break;
  1635. fbreg_pnt = fbreg_pnt->NEXT;
  1636. }
  1637. }
  1638. break;
  1639. case (FBL_MUXDFN + FBL_BUSDFN) :
  1640. case (FBL_WORDFN + FBL_BUSDFN) :
  1641. if (($7 != FBL_GRDDFN) || (FBL_GRDLST == NULL))
  1642. {
  1643. fbl_error (23,$5.NAME);
  1644. }
  1645. fbbux_pnt = (struct fbbux *)
  1646. chktab (hshtab,$5.NAME,FBL_MODNAM,FBL_PNTDFN);
  1647. if (FBL_ERRFLG == 0)
  1648. {
  1649. for (i=0 ; i<sig_width ; i++)
  1650. {
  1651. if (i >= in_bound)
  1652. {
  1653. fbbux_pnt->BINODE = fbh_addbinode (fbbux_pnt->BINODE,
  1654. NULL,NULL);
  1655. fbbux_pnt->BIABL = fbh_addbiabl (fbbux_pnt->BIABL,
  1656. FBL_LBLNAM,
  1657. dupablexpr(FBL_GRDLST->DATA) ,
  1658. abl_pnt->DATA);
  1659. abl_pnt = abl_pnt->NEXT;
  1660. }
  1661. if (i >= out_bound)
  1662. break;
  1663. fbbux_pnt = fbbux_pnt->NEXT;
  1664. }
  1665. }
  1666. break;
  1667. default :
  1668. {
  1669. fbl_error (17,$5.NAME);
  1670. }
  1671. break;
  1672. }
  1673. }
  1674. ;
  1675. /* FIN LUDO */
  1676. process_statement
  1677. : a_label
  1678. {
  1679. FBL_LBLNAM = namealloc($1);
  1680. }
  1681. unlabeled_process_statement
  1682. | {
  1683. char buffer[ 64 ];
  1684. sprintf( buffer, "process_%d", FBL_LINNUM );
  1685. FBL_LBLNAM = namealloc( buffer );
  1686. }
  1687. unlabeled_process_statement
  1688. ;
  1689. unlabeled_process_statement
  1690. : PROCESS
  1691. {FBL_NM1LST = 0 ;}
  1692. .sensitivity_list.
  1693. { FBL_BEFPNT->BEPCS = fbh_addfbpcs(FBL_BEFPNT->BEPCS,FBL_LBLNAM,FBL_NM1LST,0,0,0);
  1694. FBL_BEFPNT->BEPCS->LINE_NUM = FBL_LINNUM;
  1695. FBL_NM1LST = 0; }
  1696. process_declarative_part
  1697. _BEGIN
  1698. {
  1699. void *pnt;
  1700. pnt = (void *)(&(FBL_BEFPNT->BEPCS->INSTRUCTION));
  1701. FBL_NM1LST = addchain(0,pnt);
  1702. }
  1703. sequence_of_statements
  1704. {
  1705. struct ptype **pnt;
  1706. struct ptype *ptype;
  1707. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1708. ptype = reversetype(*pnt);
  1709. *pnt = ptype;
  1710. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  1711. }
  1712. END_ERR
  1713. PROCESS
  1714. .label.
  1715. Semicolon_ERR
  1716. {
  1717. yyerrok;
  1718. }
  1719. ;
  1720. process_declarative_part
  1721. : ..process_declarative_item..
  1722. ;
  1723. ..process_declarative_item..
  1724. : /*empty*/
  1725. | ..process_declarative_item..
  1726. process_declarative_item
  1727. {
  1728. yyerrok;
  1729. }
  1730. ;
  1731. process_declarative_item
  1732. : constant_declaration
  1733. | type_declaration
  1734. | subtype_dec…

Large files files are truncated, but you can click here to view the full file