PageRenderTime 68ms CodeModel.GetById 20ms RepoModel.GetById 1ms app.codeStats 0ms

/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
  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_declaration
  1735. ;
  1736. .sensitivity_list.
  1737. : /*empty*/
  1738. | sensitivity_list
  1739. ;
  1740. sensitivity_list
  1741. : LeftParen
  1742. signal_list
  1743. RightParen
  1744. ;
  1745. signal_list
  1746. : name
  1747. ...name..
  1748. {
  1749. if($1.TYPE == 0)
  1750. {
  1751. fbl_error(17,$1.NAME) ;
  1752. }
  1753. FBL_NM1LST = addchain (FBL_NM1LST,$1.NAME); }
  1754. ;
  1755. ...name..
  1756. : /*empty*/
  1757. | Comma
  1758. name
  1759. ...name..
  1760. {
  1761. if($2.TYPE == 0)
  1762. {
  1763. fbl_error(17,$2.NAME) ;
  1764. }
  1765. FBL_NM1LST = addchain (FBL_NM1LST,$2.NAME); }
  1766. ;
  1767. sequence_of_statements
  1768. : ..sequential_statement..
  1769. ;
  1770. ..sequential_statement..
  1771. : /*empty*/
  1772. | ..sequential_statement..
  1773. sequential_statement
  1774. ;
  1775. sequential_statement
  1776. : assertion_statement
  1777. | signal_assignment_statement
  1778. | if_statement
  1779. | case_statement
  1780. | null_statement
  1781. ;
  1782. assertion_statement
  1783. : ASSERT
  1784. expression
  1785. .REPORT__expression.
  1786. .SEVERITY__expression.
  1787. Semicolon_ERR
  1788. {
  1789. FBL_BEFPNT->BEMSG = fbh_addfbmsg(FBL_BEFPNT->BEMSG,0,$4,$3,$2.LIST_ABL->DATA,0);
  1790. FBL_BEFPNT->BEMSG->LINE_NUM = FBL_LINNUM;
  1791. }
  1792. ;
  1793. signal_assignment_statement
  1794. : target
  1795. _LESym
  1796. waveform
  1797. Semicolon_ERR
  1798. { unsigned long type;
  1799. long sig_conf,i;
  1800. long left_bnd,right_bnd;
  1801. long in_bound,out_bound;
  1802. long left ,right;
  1803. long rev_flg, debut;
  1804. long sig_width;
  1805. struct chain *abl_pnt;
  1806. char extname[100];
  1807. struct fbl_expr expr;
  1808. struct ptype **pnt;
  1809. struct fbaux *fbaux_pnt;
  1810. struct fbout *fbout_pnt;
  1811. type = chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_TYPDFN);
  1812. sig_conf = chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_SIGDFN);
  1813. if( type == 0)
  1814. {
  1815. fbl_error(17,$1.NAME);
  1816. }
  1817. addauthelem( FBL_HASH_ASG_FSM, $1.NAME, 1 );
  1818. left_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMNDFN);
  1819. right_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMXDFN);
  1820. left = $1.LEFT;
  1821. right = $1.RIGHT;
  1822. expr = $3;
  1823. if (left_bnd <= right_bnd)
  1824. {
  1825. sig_width = right_bnd - left_bnd + 1;
  1826. if (left <= right)
  1827. {
  1828. rev_flg = 0;
  1829. in_bound = right_bnd - right;
  1830. out_bound = right_bnd - left;
  1831. if ((left < left_bnd) || (right > right_bnd))
  1832. {
  1833. fbl_error (36,$1.NAME);
  1834. }
  1835. debut = left;
  1836. }
  1837. else
  1838. {
  1839. rev_flg = 1;
  1840. in_bound = right_bnd - left;
  1841. out_bound = right_bnd - right;
  1842. if ((left > right_bnd) || (right < left_bnd))
  1843. {
  1844. fbl_error (36,$1.NAME);
  1845. }
  1846. debut = right;
  1847. }
  1848. }
  1849. else
  1850. {
  1851. sig_width = left_bnd - right_bnd + 1;
  1852. if (left <= right)
  1853. {
  1854. rev_flg = 1;
  1855. in_bound = left - right_bnd;
  1856. out_bound = right - right_bnd;
  1857. if ((left < right_bnd) || (right > left_bnd))
  1858. {
  1859. fbl_error (36,$1.NAME);
  1860. }
  1861. debut = left;
  1862. }
  1863. else
  1864. {
  1865. rev_flg = 0;
  1866. in_bound = right - right_bnd;
  1867. out_bound = left - right_bnd;
  1868. if ((left > left_bnd) || (right < right_bnd))
  1869. {
  1870. fbl_error (36,$1.NAME);
  1871. }
  1872. debut = right;
  1873. }
  1874. }
  1875. if ((out_bound - in_bound + 1) != expr.WIDTH)
  1876. {
  1877. fbl_error (35,$1.NAME);
  1878. }
  1879. if (rev_flg == 1)
  1880. expr.LIST_ABL = reverse (expr.LIST_ABL);
  1881. abl_pnt = expr.LIST_ABL;
  1882. if( sig_conf == FBL_ICNDFN)
  1883. {
  1884. fbl_error(21,$1.NAME);
  1885. }
  1886. /* LUDO
  1887. else if( sig_conf == 0)
  1888. {
  1889. fbl_error(17,$1.NAME);
  1890. }
  1891. */
  1892. else
  1893. {
  1894. pnt = (struct ptype**)(FBL_NM1LST->DATA);
  1895. if(sig_width >1)
  1896. {
  1897. for (i=0 ; i<sig_width ; i++)
  1898. {
  1899. char *newname;
  1900. sprintf (extname,"%s %d",$1.NAME,i+debut-in_bound);
  1901. newname = namealloc( extname );
  1902. if (i >= in_bound)
  1903. {
  1904. *pnt =fbh_addfbasg(*pnt,newname, (struct chain *)abl_pnt->DATA,type);
  1905. ((struct fbasg *)((*pnt)->DATA))->LINE_NUM = FBL_LINNUM;
  1906. abl_pnt = abl_pnt->NEXT;
  1907. addauthelem( FBL_HASH_ASG_FSM, newname, 1 );
  1908. }
  1909. if (i >= out_bound)
  1910. break;
  1911. }
  1912. }
  1913. else
  1914. {
  1915. *pnt = fbh_addfbasg(*pnt,$1.NAME,abl_pnt->DATA,type);
  1916. ((struct fbasg *)((*pnt)->DATA))->LINE_NUM = FBL_LINNUM;
  1917. }
  1918. }
  1919. }
  1920. ;
  1921. waveform_element
  1922. : expression
  1923. { $$ = $1; }
  1924. ;
  1925. if_statement
  1926. : IF
  1927. condition
  1928. THEN
  1929. {
  1930. struct ptype **pnt;
  1931. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1932. *pnt = fbh_addfbifs(*pnt,$2.LIST_ABL->DATA);
  1933. ((struct fbifs *)((*pnt)->DATA))->LINE_NUM = FBL_LINNUM;
  1934. FBL_NM1LST = addchain(FBL_NM1LST,&(((struct fbifs*)(*pnt)->DATA)->CNDTRUE));
  1935. }
  1936. sequence_of_statements
  1937. {
  1938. struct ptype **pnt;
  1939. struct ptype *ptype;
  1940. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1941. ptype = reversetype(*pnt);
  1942. *pnt = ptype;
  1943. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  1944. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1945. FBL_NM1LST = addchain(FBL_NM1LST,&(((struct fbifs*)(*pnt)->DATA)->CNDFALSE));
  1946. }
  1947. ..ELSIF__THEN__seq_of_stmts..
  1948. .ELSE__seq_of_stmts.
  1949. END_ERR
  1950. IF
  1951. Semicolon_ERR
  1952. ;
  1953. ..ELSIF__THEN__seq_of_stmts..
  1954. : /*empty*/
  1955. | ..ELSIF__THEN__seq_of_stmts..
  1956. ELSIF
  1957. condition
  1958. THEN
  1959. {
  1960. struct ptype **pnt;
  1961. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1962. *pnt = fbh_addfbifs(*pnt,$3.LIST_ABL->DATA);
  1963. ((struct fbifs *)((*pnt)->DATA))->LINE_NUM = FBL_LINNUM;
  1964. FBL_NM1LST = addchain(FBL_NM1LST,(void*)&((struct fbifs*)(*pnt)->DATA)->CNDTRUE);
  1965. }
  1966. sequence_of_statements
  1967. {
  1968. struct ptype **pnt;
  1969. struct ptype *ptype;
  1970. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1971. ptype = reversetype(*pnt);
  1972. *pnt = ptype;
  1973. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  1974. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1975. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  1976. FBL_NM1LST = addchain(FBL_NM1LST,&((struct fbifs*)(*pnt)->DATA)->CNDFALSE);
  1977. yyerrok; }
  1978. ;
  1979. .ELSE__seq_of_stmts.
  1980. : /*empty*/
  1981. {
  1982. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  1983. yyerrok;
  1984. }
  1985. | ELSE
  1986. sequence_of_statements
  1987. {
  1988. struct ptype *ptype;
  1989. struct ptype **pnt;
  1990. pnt = (struct ptype**)FBL_NM1LST->DATA;
  1991. ptype = reversetype(*pnt);
  1992. *pnt = ptype;
  1993. FBL_NM1LST = delchain (FBL_NM1LST, FBL_NM1LST);
  1994. yyerrok;
  1995. }
  1996. ;
  1997. case_statement
  1998. : CASE
  1999. expression
  2000. {
  2001. struct ptype **pnt;
  2002. pnt = (struct ptype**)FBL_NM1LST->DATA;
  2003. /*fbcas = (struct fbcas *)mbkalloc(sizeof(struct fbcas));
  2004. fbcas->CHOICE = 0;
  2005. fbcas->USER = 0;
  2006. fbcas->LINE_NUM = 0;
  2007. fbcas->SIZE = 0;
  2008. fbcas->TYPE = $2.TYPE;
  2009. fbcas->ABL = $2.LIST_ABL->DATA;*/
  2010. FBL_OTHPNT = 0;
  2011. *pnt = fbh_addfbcas(*pnt,$2.LIST_ABL->DATA,$2.TYPE);
  2012. ((struct fbcas *)((*pnt)->DATA))->LINE_NUM = FBL_LINNUM;
  2013. FBL_NM1LST = addchain(FBL_NM1LST,(void*)&(((struct fbcas*)((*pnt)->DATA))->SIZE));
  2014. FBL_NM1LST = addchain(FBL_NM1LST,(void*)&(((struct fbcas*)(*pnt)->DATA)->CHOICE));
  2015. }
  2016. IS
  2017. case_statement_alternative
  2018. ..case_statement_alternative..
  2019. END_ERR
  2020. CASE
  2021. Semicolon_ERR
  2022. {
  2023. unsigned long size=1;
  2024. unsigned long *size1;
  2025. long indice=0;
  2026. struct choice_chain *ch;
  2027. struct fbcho **pnt;
  2028. struct fbcho *tab;
  2029. struct choice_chain *nm1lst;
  2030. nm1lst = FBL_CASPNT;
  2031. while (nm1lst != 0)
  2032. {
  2033. size++;
  2034. nm1lst = nm1lst->NEXT;
  2035. }
  2036. pnt = (struct fbcho**)FBL_NM1LST->DATA;
  2037. FBL_NM1LST = delchain(FBL_NM1LST,FBL_NM1LST);
  2038. if( size != 0)
  2039. tab = (struct fbcho*)mbkalloc(size*sizeof(struct fbcho));
  2040. while(FBL_CASPNT)
  2041. {
  2042. tab[indice].INSTRUCTION = reversetype(FBL_CASPNT->INSTRUCTION);
  2043. tab[indice].SIZE = FBL_CASPNT->SIZE;
  2044. tab[indice++].VALUE = FBL_CASPNT->VALUE;
  2045. ch = FBL_CASPNT;
  2046. FBL_CASPNT =FBL_CASPNT->NEXT;
  2047. /*free(ch);*/
  2048. }
  2049. tab[indice].INSTRUCTION = reversetype(FBL_OTHPNT);
  2050. tab[indice].SIZE = -1;
  2051. tab[indice++].VALUE = namealloc("others");
  2052. (*pnt) = tab;
  2053. size1 = (unsigned long*) FBL_NM1LST->DATA;
  2054. *size1 = size;
  2055. FBL_NM1LST = delchain(FBL_NM1LST,FBL_NM1LST);
  2056. FBL_OTHPNT = 0;
  2057. }
  2058. ;
  2059. ..case_statement_alternative..
  2060. : /*empty*/
  2061. | ..case_statement_alternative..
  2062. case_statement_alternative
  2063. { yyerrok; }
  2064. ;
  2065. case_statement_alternative
  2066. : WHEN
  2067. choices
  2068. Arrow {
  2069. FBL_PTYPE = 0;
  2070. FBL_NM1LST = addchain(FBL_NM1LST,(void*)&FBL_PTYPE);
  2071. }
  2072. sequence_of_statements
  2073. {
  2074. if( FBL_CNDLST == 0)
  2075. {
  2076. fbl_error(85,"case");
  2077. }
  2078. else if ( FBL_CNDLST->DATA == 0)
  2079. {
  2080. FBL_OTHPNT = FBL_PTYPE ;
  2081. while (FBL_CNDLST )
  2082. {
  2083. FBL_CNDLST = delchain(FBL_CNDLST,FBL_CNDLST);
  2084. }
  2085. }
  2086. else
  2087. while(FBL_CNDLST)
  2088. {
  2089. char* val;
  2090. val = (char *)FBL_CNDLST->DATA;
  2091. FBL_CASPNT = order_choice(FBL_CASPNT,FBL_PTYPE,val,strlen(val));
  2092. FBL_CNDLST = delchain(FBL_CNDLST,FBL_CNDLST);
  2093. }
  2094. FBL_NM1LST = delchain(FBL_NM1LST,FBL_NM1LST);
  2095. }
  2096. ;
  2097. /* DEBUT LUDO */
  2098. ...waveform__WHEN__choices..
  2099. : /*empty*/
  2100. {
  2101. $$ = FBL_EMPSTR;
  2102. }
  2103. | ...waveform__WHEN__choices..
  2104. Comma
  2105. waveform__WHEN__choices
  2106. {
  2107. $$ = fbl_crtabl (ABL_OR,$1,$3,-1,-1);
  2108. }
  2109. ;
  2110. waveform__WHEN__choices
  2111. : waveform
  2112. WHEN
  2113. choices2
  2114. {
  2115. fbl_ablstr expr1;
  2116. fbl_select (&expr1,FBL_NM1LST,&FBL_BDDPNT,&FBL_SLCEXP);
  2117. freechain (FBL_NM1LST);
  2118. FBL_NM1LST = NULL;
  2119. $$ = fbl_crtabl(ANDM,$1,expr1,-1,-1);
  2120. }
  2121. ;
  2122. choices2
  2123. : choice
  2124. {
  2125. FBL_NM1LST = addchain (NULL ,$1.NAME);
  2126. }
  2127. ..Bar__choice2..
  2128. { yyerrok; }
  2129. ;
  2130. ..Bar__choice2..
  2131. : /*empty*/
  2132. | ..Bar__choice2..
  2133. Bar
  2134. choice
  2135. {
  2136. if ($3.NAME == "others")
  2137. {
  2138. fbl_error (30,NULL);
  2139. }
  2140. FBL_NM1LST = addchain (FBL_NM1LST ,$3.NAME);
  2141. fprintf( stdout, "%s%d: %s\n", basename(__FILE__),__LINE__,$3.NAME );
  2142. }
  2143. ;
  2144. /* FIN LUDO */
  2145. waveform
  2146. : waveform_element
  2147. { $$ = $1; }
  2148. ;
  2149. choices
  2150. : choice
  2151. {
  2152. if (strcmp($1.NAME , "others"))
  2153. FBL_CNDLST = addchain (0 ,(void*)$1.NAME);
  2154. else
  2155. FBL_CNDLST = addchain (0 ,0);
  2156. }
  2157. ..Bar__choice..
  2158. { yyerrok; }
  2159. ;
  2160. null_statement
  2161. : tok_NULL
  2162. Semicolon_ERR
  2163. ;
  2164. ..Bar__choice..
  2165. : /*empty*/
  2166. | ..Bar__choice..
  2167. Bar
  2168. choice
  2169. {
  2170. if (!strcmp($3.NAME , "others") || FBL_CNDLST->DATA == 0)
  2171. {
  2172. fbl_error (31,0);
  2173. }
  2174. FBL_CNDLST = addchain (FBL_CNDLST ,(void*)$3.NAME);
  2175. }
  2176. ;
  2177. choice
  2178. : literal
  2179. {
  2180. $$.NAME = $1;
  2181. $$.RIGHT = -1;
  2182. $$.TYPE = -1;
  2183. $$.LEFT = -1;}
  2184. | OTHERS
  2185. {
  2186. $$.RIGHT = -1;
  2187. $$.TYPE = -1;
  2188. $$.LEFT = -1;
  2189. $$.NAME = namealloc("others");}
  2190. | name
  2191. {
  2192. char *val;
  2193. char val2[256];
  2194. long left;
  2195. long right;
  2196. long in_bound;
  2197. long out_bound;
  2198. long left_bnd;
  2199. long right_bnd;
  2200. long sig_conf;
  2201. strcpy (val2,"B\"");
  2202. sig_conf = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_SIGDFN);
  2203. val = (char *) chktab (hshtab,$1.NAME,0,FBL_PNTDFN);
  2204. if (sig_conf == 0)
  2205. {
  2206. fbl_error (17,$1.NAME);
  2207. }
  2208. else
  2209. {
  2210. if (sig_conf != FBL_CSTDFN)
  2211. {
  2212. fbl_error (76,$1.NAME);
  2213. }
  2214. }
  2215. left_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMNDFN);
  2216. right_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMXDFN);
  2217. left = $1.LEFT;
  2218. right = $1.RIGHT;
  2219. if (left_bnd <= right_bnd)
  2220. {
  2221. if (left <= right)
  2222. {
  2223. in_bound = left - left_bnd;
  2224. out_bound = right - left_bnd;
  2225. if ((left < left_bnd) || (right > right_bnd))
  2226. {
  2227. fbl_error (36,$1.NAME);
  2228. }
  2229. }
  2230. else
  2231. {
  2232. in_bound = left - right_bnd;
  2233. out_bound = right - right_bnd;
  2234. if ((left > right_bnd) || (right < left_bnd))
  2235. {
  2236. fbl_error (36,$1.NAME);
  2237. }
  2238. }
  2239. }
  2240. else
  2241. {
  2242. if (left <= right)
  2243. {
  2244. in_bound = right - left_bnd;
  2245. out_bound = left - left_bnd;
  2246. if ((left < right_bnd) || (right > left_bnd))
  2247. {
  2248. fbl_error (36,$1.NAME);
  2249. }
  2250. }
  2251. else
  2252. {
  2253. in_bound = right - right_bnd;
  2254. out_bound = left - right_bnd;
  2255. if ((left > left_bnd) || (right < right_bnd))
  2256. {
  2257. fbl_error (36,$1.NAME);
  2258. }
  2259. }
  2260. }
  2261. if( chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_TYPDFN) == -1)
  2262. {
  2263. fbl_tobin (&val2[2],val,in_bound,out_bound);
  2264. strcat (val2,"\"");
  2265. $$.NAME = namealloc (val2);
  2266. $$.LEFT = -1;
  2267. $$.RIGHT = -1;
  2268. $$.TYPE = -1;
  2269. }
  2270. else
  2271. {
  2272. $$.LEFT = $1.LEFT;
  2273. $$.RIGHT = $1.RIGHT;
  2274. $$.TYPE = $1.TYPE;
  2275. /* sig_conf = chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_LBLDFN) ;
  2276. $$.NAME = (char *)fbl_numtobin(sig_conf); */
  2277. $$.NAME = $1.NAME;
  2278. }
  2279. }
  2280. ;
  2281. condition
  2282. : expression
  2283. { $$ = $1; }
  2284. ;
  2285. .REPORT__expression.
  2286. : /*empty*/
  2287. { $$ = 0;}
  2288. | REPORT
  2289. report__message
  2290. { $$ = $2;}
  2291. ;
  2292. .SEVERITY__expression.
  2293. : /*empty*/
  2294. { $$ = 'E';}
  2295. | SEVERITY
  2296. severity__message
  2297. { $$ = $1;}
  2298. ;
  2299. report__message
  2300. : StringLit
  2301. { fbl_stostr($1);}
  2302. ;
  2303. severity__message
  2304. : ERROR
  2305. { $$ = 'E';}
  2306. | WARNING
  2307. { $$ = 'W';}
  2308. ;
  2309. expression
  2310. : relation..AND__relation..
  2311. { $$ = $1; }
  2312. | relation..OR__relation..
  2313. { $$ = $1; }
  2314. | relation.NAND_NOR__relation.
  2315. { $$ = $1; }
  2316. | relation..XOR__relation..
  2317. { $$ = $1; }
  2318. ;
  2319. relation..AND__relation..
  2320. : relation
  2321. tok_AND
  2322. relation
  2323. { $$ = fbl_crtabl (ABL_AND ,$1 ,$3 ,-1,-1); }
  2324. | relation..AND__relation..
  2325. tok_AND
  2326. relation
  2327. { $$ = fbl_crtabl (ABL_AND ,$1 ,$3 ,-1,-1);}
  2328. ;
  2329. relation..OR__relation..
  2330. : relation
  2331. _OR
  2332. relation
  2333. { $$ = fbl_crtabl (ABL_OR ,$1 ,$3 ,-1,-1); }
  2334. | relation..OR__relation..
  2335. _OR
  2336. relation
  2337. { $$ = fbl_crtabl (ABL_OR ,$1 ,$3 ,-1,-1); }
  2338. ;
  2339. relation.NAND_NOR__relation.
  2340. : relation
  2341. { $$ = $1; }
  2342. | relation
  2343. _NAND
  2344. relation
  2345. { $$ = fbl_crtabl (ABL_NAND ,$1 ,$3 ,-1,-1); }
  2346. | relation
  2347. _NOR
  2348. relation
  2349. { $$ = fbl_crtabl (ABL_NAND ,$1 ,$3 ,-1,-1); }
  2350. ;
  2351. relation..XOR__relation..
  2352. : relation
  2353. _XOR
  2354. relation
  2355. { $$ = fbl_crtabl (ABL_XOR ,$1 ,$3 ,-1,-1); }
  2356. | relation..XOR__relation..
  2357. _XOR
  2358. relation
  2359. { $$ = fbl_crtabl (ABL_XOR ,$1 ,$3 ,-1,-1); }
  2360. ;
  2361. relation
  2362. : simple_expression
  2363. { $$ = $1; }
  2364. | simple_expression
  2365. relational_operator
  2366. simple_expression
  2367. { $$ = fbl_crtabl ($2 ,$1 ,$3 ,-1,-1); }
  2368. ;
  2369. simple_expression
  2370. : .sign.term..add_op__term..
  2371. { $$ = $1; }
  2372. ;
  2373. .sign.term..add_op__term..
  2374. : term
  2375. { $$ = $1; }
  2376. | .sign.term..add_op__term..
  2377. Ampersand
  2378. term
  2379. { $$ = fbl_crtabl (CONC,$1,$3,-1,-1); }
  2380. ;
  2381. term
  2382. : factor
  2383. { $$ = $1; }
  2384. ;
  2385. factor
  2386. : primary
  2387. { $$ = $1; }
  2388. | _NOT
  2389. primary
  2390. { $$ = fbl_crtabl (ABL_NOT,$2,FBL_EMPSTR,-1,-1); }
  2391. ;
  2392. primary
  2393. : literal
  2394. {
  2395. struct fbl_expr expr1;
  2396. expr1.IDENT = $1;
  2397. expr1.TYPE = -1;
  2398. $$ = fbl_crtabl (NOPS,expr1,FBL_EMPSTR,-1,-1);
  2399. }
  2400. | aggregate
  2401. { $$ = $1; }
  2402. | name
  2403. {
  2404. struct fbl_expr expr1;
  2405. long left;
  2406. long right;
  2407. long left_bnd;
  2408. long right_bnd;
  2409. long in_bound;
  2410. long out_bound;
  2411. long mode;
  2412. long prtype;
  2413. long type;
  2414. mode = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_SIGDFN);
  2415. type = chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_TYPDFN);
  2416. if( mode == FBL_OCNDFN)
  2417. {
  2418. {
  2419. fbl_error (26,$1.NAME);
  2420. }
  2421. $$.IDENT = 0;
  2422. $$.LIST_ABL = 0;
  2423. $$.WIDTH = 0;
  2424. $$.TYPE = 0;
  2425. }
  2426. else if( type == 0 || mode == FBL_TPEDFN)
  2427. {
  2428. {
  2429. fbl_error (17,$1.NAME);
  2430. }
  2431. $$.IDENT = 0;
  2432. $$.LIST_ABL = 0;
  2433. $$.WIDTH = 0;
  2434. $$.TYPE = 0;
  2435. }
  2436. else
  2437. {
  2438. left_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMNDFN);
  2439. right_bnd = chktab (hshtab,$1.NAME,FBL_MODNAM,FBL_WMXDFN);
  2440. left = $1.LEFT;
  2441. right = $1.RIGHT;
  2442. if (left_bnd <= right_bnd)
  2443. {
  2444. if (left <= right)
  2445. {
  2446. in_bound = left - left_bnd;
  2447. out_bound = right - left_bnd;
  2448. if ((left < left_bnd) || (right > right_bnd))
  2449. {
  2450. fbl_error (36,$1.NAME);
  2451. }
  2452. }
  2453. else
  2454. {
  2455. in_bound = right - left_bnd;
  2456. out_bound = left - left_bnd;
  2457. if ((left > right_bnd) || (right < left_bnd))
  2458. {
  2459. fbl_error (36,$1.NAME);
  2460. }
  2461. }
  2462. }
  2463. else
  2464. {
  2465. if (left <= right)
  2466. {
  2467. in_bound = left - right_bnd;
  2468. out_bound = right - right_bnd;
  2469. if ((left < right_bnd) || (right > left_bnd))
  2470. {
  2471. fbl_error (36,$1.NAME);
  2472. }
  2473. }
  2474. else
  2475. {
  2476. in_bound = right - right_bnd;
  2477. out_bound = left - right_bnd;
  2478. if ((left > left_bnd) || (right < right_bnd))
  2479. {
  2480. fbl_error (36,$1.NAME);
  2481. }
  2482. }
  2483. }
  2484. /* LUDO
  2485. if ( mode == FBL_VARDFN)
  2486. {
  2487. expr1.IDENT = 0;
  2488. expr1.TYPE = chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_TYPDFN);
  2489. expr1.LIST_ABL = (struct chain *)chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_PNTDFN);
  2490. $$ = fbl_crtabl (SUBVAR,expr1,FBL_EMPSTR,in_bound,out_bound);
  2491. }
  2492. else
  2493. */
  2494. if ((mode != FBL_CSTDFN)||
  2495. (chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_TYPDFN) != -1))
  2496. {
  2497. expr1.IDENT = $1.NAME;
  2498. prtype = chktab(hshtab,$1.NAME,FBL_MODNAM,FBL_USRDFN);
  2499. if(val_type((FBL_BEFPNT->BETYP + type -1)->NAME) !=-1)
  2500. expr1.TYPE = chktab(hshtab,namealloc("bit"),FBL_MODNAM,FBL_TYPDFN);
  2501. else
  2502. expr1.TYPE = type;
  2503. if($1.FLAG == 'X')
  2504. {
  2505. expr1 = fbl_crtabl (NOPI,expr1,FBL_EMPSTR,left,right);
  2506. $$ = fbl_crtabl (ABL_STABLE,expr1,FBL_EMPSTR,left,right);
  2507. }
  2508. else
  2509. if($1.FLAG == 'x')
  2510. {
  2511. expr1 = fbl_crtabl (NOPI,expr1,FBL_EMPSTR,left,right);
  2512. expr1 = fbl_crtabl (ABL_STABLE,expr1,FBL_EMPSTR,left,right);
  2513. $$ = fbl_crtabl (ABL_NOT,expr1,FBL_EMPSTR,left,right);
  2514. }
  2515. else
  2516. {
  2517. $$ = fbl_crtabl (NOPI,expr1,FBL_EMPSTR,left,right);
  2518. }
  2519. }
  2520. else
  2521. {
  2522. expr1.IDENT = (char *)chktab(hshtab,$1.NAME,0,FBL_PNTDFN);
  2523. expr1.TYPE =(long)-1;/*dec, cast long */
  2524. $$ = fbl_crtabl (NOPS,expr1,FBL_EMPSTR,in_bound,out_bound);
  2525. }
  2526. }
  2527. }
  2528. ;
  2529. relational_operator
  2530. : _EQSym
  2531. { $$ = EQ; }
  2532. | _NESym
  2533. { $$ = NE; }
  2534. | _GESym
  2535. { $$ = GE; }
  2536. | _GTSym
  2537. { $$ = GT; }
  2538. | _LESym
  2539. { $$ = LE; }
  2540. | _LTSym
  2541. { $$ = LT; }
  2542. ;
  2543. literal
  2544. : CharacterLit
  2545. { $$ = $1; }
  2546. | StringLit
  2547. { $$ = $1; }
  2548. | BitStringLit
  2549. { $$ = $1; }
  2550. ;
  2551. aggregate
  2552. : LeftParen
  2553. expression
  2554. RightParen
  2555. { $$ = $2; }
  2556. ;
  2557. name
  2558. : simple_name
  2559. {
  2560. $$.NAME = $1;
  2561. $$.TYPE = chktab (hshtab,$1,FBL_MODNAM,FBL_TYPDFN);
  2562. $$.LEFT = chktab (hshtab,$1,FBL_MODNAM,FBL_WMNDFN);
  2563. $$.RIGHT = chktab (hshtab,$1,FBL_MODNAM,FBL_WMXDFN);
  2564. }
  2565. | indexed_name
  2566. { $$ = $1; }
  2567. | slice_name
  2568. { $$ = $1; }
  2569. | attribute_name
  2570. { $$ = $1; }
  2571. ;
  2572. indexed_name
  2573. : simple_name
  2574. LeftParen
  2575. abstractlit
  2576. RightParen_ERR
  2577. {
  2578. $$.NAME = $1;
  2579. $$.LEFT = $3;
  2580. $$.TYPE = chktab (hshtab,$1,FBL_MODNAM,FBL_TYPDFN);
  2581. $$.RIGHT = $3;
  2582. }
  2583. ;
  2584. slice_name
  2585. : simple_name
  2586. LeftParen
  2587. abstractlit
  2588. direction
  2589. abstractlit
  2590. RightParen_ERR
  2591. {
  2592. if ((($3 > $5) && ($4 == FBL_UPTDFN)) ||
  2593. (($3 < $5) && ($4 == FBL_DWTDFN)))
  2594. {
  2595. fbl_error (32,$1);
  2596. }
  2597. $$.NAME = $1;
  2598. $$.TYPE = chktab (hshtab,$1,FBL_MODNAM,FBL_TYPDFN);
  2599. $$.LEFT = $3;
  2600. $$.RIGHT = $5;
  2601. }
  2602. ;
  2603. attribute_name
  2604. : simple_name
  2605. Apostrophe
  2606. attribute_designator
  2607. {
  2608. char extname[100];
  2609. char *lclname;
  2610. long sig_conf;
  2611. long type;
  2612. long kind;
  2613. struct fbl_expr expr1;
  2614. struct fbl_expr expr2;
  2615. struct chain *ptabl;
  2616. sprintf (extname,"%s'delayed",$1);
  2617. lclname = namealloc (extname);
  2618. if (chktab (hshtab,lclname,FBL_MODNAM,FBL_SIGDFN) == 0 )
  2619. {
  2620. sig_conf = chktab (hshtab,$1,FBL_MODNAM,FBL_SIGDFN);
  2621. switch (sig_conf)
  2622. {
  2623. case (FBL_ICNDFN + FBL_BITDFN + FBL_NORDFN) :
  2624. case (FBL_BCNDFN + FBL_BITDFN + FBL_NORDFN) :
  2625. case (FBL_BCNDFN + FBL_MUXDFN + FBL_BUSDFN) :
  2626. case (FBL_BCNDFN + FBL_WORDFN + FBL_BUSDFN) :
  2627. case (FBL_BITDFN + FBL_NORDFN):
  2628. case (FBL_MUXDFN + FBL_BUSDFN):
  2629. case (FBL_WORDFN + FBL_BUSDFN):
  2630. case (FBL_RBIDFN + FBL_REGDFN):
  2631. break;
  2632. default :
  2633. {
  2634. fbl_error (79,$1);
  2635. }
  2636. }
  2637. type = chktab (hshtab,$1,FBL_MODNAM,FBL_TYPDFN);
  2638. kind = chktab (hshtab,$1,FBL_MODNAM,FBL_LBLDFN);
  2639. if (chktab (hshtab,$1,FBL_MODNAM,FBL_WMNDFN) != -1)
  2640. {
  2641. fbl_error (79,$1);
  2642. }
  2643. if (FBL_ERRFLG == 0)
  2644. {
  2645. expr1.IDENT = $1;
  2646. expr1.WIDTH = 1;
  2647. expr2 = fbl_crtabl (NOPI,expr1,FBL_EMPSTR,-1,-1);
  2648. ptabl = (struct chain*)expr2.LIST_ABL->DATA;
  2649. FBL_BEFPNT->BEDLY = fbh_addfbaux(FBL_BEFPNT->BEDLY,lclname,
  2650. ptabl,0,type);
  2651. FBL_BEFPNT->BEDLY->LINE_NUM = FBL_LINNUM;
  2652. /* LUDO addtab (hshtab,$1,FBL_MODNAM,FBL_STBDFN,1); */
  2653. addtab (hshtab,lclname,FBL_MODNAM,FBL_WMNDFN,-1);
  2654. addtab (hshtab,lclname,FBL_MODNAM,FBL_WMXDFN,-1);
  2655. addtab (hshtab,lclname,FBL_MODNAM,FBL_TYPDFN, type);
  2656. addtab (hshtab,lclname,FBL_MODNAM,FBL_LBLDFN, kind);
  2657. addtab (hshtab,lclname,FBL_MODNAM,FBL_SIGDFN,
  2658. (FBL_ICNDFN + FBL_BITDFN + FBL_NORDFN));
  2659. }
  2660. }
  2661. $$.NAME = $1;
  2662. $$.LEFT = -1;
  2663. $$.RIGHT = -1;
  2664. if ( $3 == FBL_STABLE ) $$.FLAG = 'X';
  2665. else $$.FLAG = 'x';
  2666. }
  2667. ;
  2668. attribute_designator
  2669. : _STABLE { $$ = FBL_STABLE; }
  2670. | _EVENT { $$ = FBL_EVENT; }
  2671. ;
  2672. identifier_list
  2673. : Identifier
  2674. { FBL_NM1LST = addchain (FBL_NM1LST,$1); }
  2675. ...identifier..
  2676. ;
  2677. ...identifier..
  2678. : /*empty*/
  2679. | ...identifier..
  2680. Comma
  2681. Identifier
  2682. { FBL_NM1LST = addchain (FBL_NM1LST,$3); }
  2683. ;
  2684. .label.
  2685. : /*empty*/
  2686. { $$ = 0; }
  2687. | label
  2688. { $$ = $1; }
  2689. ;
  2690. /* DEBUT LUDO */
  2691. .guard_expression.
  2692. : /*empty*/
  2693. { $$ = NULL; }
  2694. | guard_expression
  2695. { $$ = $1; }
  2696. ;
  2697. guard_expression
  2698. : LeftParen
  2699. expression
  2700. RightParen_ERR
  2701. { $$ = (char *)$2.LIST_ABL->DATA; }
  2702. ;
  2703. .GUARDED.
  2704. : /*empty*/
  2705. { $$ = FBL_UNGDFN ; }
  2706. | GUARDED
  2707. { $$ = FBL_GRDDFN; }
  2708. ;
  2709. /* FIN LUDO */
  2710. .simple_name.
  2711. : /*empty*/
  2712. { $$ = 0; }
  2713. | simple_name
  2714. { $$ = $1; }
  2715. ;
  2716. simple_name
  2717. : Identifier
  2718. { $$ = $1; }
  2719. ;
  2720. target
  2721. : name
  2722. { $$ = $1; }
  2723. ;
  2724. a_label
  2725. : label
  2726. Colon
  2727. {
  2728. FBL_LBLNAM = $1;
  2729. $$ = $1;
  2730. }
  2731. ;
  2732. label
  2733. : Identifier
  2734. { $$ = $1; }
  2735. ;
  2736. abstractlit
  2737. : AbstractLit
  2738. { $$ = atoi($1); }
  2739. ;
  2740. RightParen_ERR
  2741. : RightParen
  2742. { yyerrok; }
  2743. ;
  2744. Semicolon_ERR
  2745. : Semicolon
  2746. { yyerrok; }
  2747. ;
  2748. END_ERR
  2749. : _END
  2750. { yyerrok; }
  2751. ;
  2752. %%
  2753. static struct dct_entry *addent (head , key)
  2754. struct dct_entry *head;
  2755. char *key;
  2756. {
  2757. struct dct_entry *entry;
  2758. long i;
  2759. if (FBL_DCEHED == 0)
  2760. {
  2761. FBL_DCEHED = (struct dct_entry *)
  2762. mbkalloc (sizeof(struct dct_entry) * FBL_ALODFN);
  2763. entry = FBL_DCEHED;
  2764. for (i=1 ; i<FBL_ALODFN ; i++)
  2765. {
  2766. entry->next = entry + 1;
  2767. entry++;
  2768. }
  2769. entry->next = 0;
  2770. }
  2771. entry = FBL_DCEHED;
  2772. FBL_DCEHED = FBL_DCEHED->next;
  2773. entry->next = head;
  2774. entry->data = 0;
  2775. entry->key = key;
  2776. return (entry);
  2777. }
  2778. static struct dct_recrd *addrcd (head , key)
  2779. struct dct_recrd *head;
  2780. char *key;
  2781. {
  2782. struct dct_recrd *recrd;
  2783. long i;
  2784. if (FBL_DCRHED == 0)
  2785. {
  2786. FBL_DCRHED = (struct dct_recrd *)
  2787. mbkalloc (sizeof(struct dct_recrd) * FBL_ALODFN);
  2788. recrd = FBL_DCRHED;
  2789. for (i=1 ; i<FBL_ALODFN ; i++)
  2790. {
  2791. recrd->next = recrd + 1;
  2792. recrd++;
  2793. }
  2794. recrd->next = 0;
  2795. }
  2796. recrd = FBL_DCRHED;
  2797. FBL_DCRHED = FBL_DCRHED->next;
  2798. recrd->next = head;
  2799. recrd->fd0_val = 0;
  2800. recrd->fd1_val = 0;
  2801. recrd->fd2_val = 0;
  2802. recrd->fd3_val = 0;
  2803. recrd->fd4_val = 0;
  2804. recrd->fd5_val = 0;
  2805. recrd->fd6_val = 0;
  2806. recrd->pnt_val = 0;
  2807. recrd->key = key;
  2808. return (recrd);
  2809. }
  2810. static struct dct_entry **initab ()
  2811. {
  2812. struct dct_entry **head;
  2813. long i;
  2814. head = (struct dct_entry **)
  2815. mbkalloc (sizeof(struct dct_entry *) * FBL_HSZDFN);
  2816. for (i=0 ; i<FBL_HSZDFN ; i++)
  2817. head[i] = 0;
  2818. return (head);
  2819. }
  2820. static void addtab (head,key_str,ctx_str,field,valu)
  2821. struct dct_entry **head;
  2822. char *key_str;
  2823. char *ctx_str;
  2824. long field;
  2825. long valu;
  2826. {
  2827. long found = 0;
  2828. long index;
  2829. struct dct_entry *entry_pnt;
  2830. struct dct_recrd *recrd_pnt;
  2831. index = ((unsigned long) key_str) % FBL_HSZDFN;
  2832. entry_pnt = head[index];
  2833. while (entry_pnt != 0)
  2834. {
  2835. if (entry_pnt->key == key_str)
  2836. {
  2837. found = 1;
  2838. break;
  2839. }
  2840. entry_pnt = entry_pnt->next;
  2841. }
  2842. if (found == 0)
  2843. {
  2844. head[index] = addent (head[index],key_str);
  2845. entry_pnt = head[index];
  2846. }
  2847. found = 0;
  2848. recrd_pnt = entry_pnt->data;
  2849. while (recrd_pnt != 0)
  2850. {
  2851. if (recrd_pnt->key == ctx_str)
  2852. {
  2853. found = 1;
  2854. break;
  2855. }
  2856. recrd_pnt = recrd_pnt->next;
  2857. }
  2858. if (found == 0)
  2859. {
  2860. entry_pnt->data = addrcd (entry_pnt->data,ctx_str);
  2861. recrd_pnt = entry_pnt->data ;
  2862. }
  2863. switch (field)
  2864. {
  2865. case 0 :
  2866. recrd_pnt->fd0_val = valu;
  2867. break;
  2868. case 1 :
  2869. recrd_pnt->fd1_val = valu;
  2870. break;
  2871. case 2 :
  2872. recrd_pnt->fd2_val = valu;
  2873. break;
  2874. case 3 :
  2875. recrd_pnt->fd3_val = valu;
  2876. break;
  2877. case 4 :
  2878. recrd_pnt->fd4_val = valu;
  2879. break;
  2880. case 5 :
  2881. recrd_pnt->fd5_val = valu;
  2882. break;
  2883. case 6 :
  2884. recrd_pnt->fd6_val = valu;
  2885. break;
  2886. case 7 :
  2887. recrd_pnt->pnt_val = valu;
  2888. break;
  2889. }
  2890. }
  2891. static long chktab (head,key_str,ctx_str,field)
  2892. struct dct_entry **head;
  2893. char *key_str;
  2894. char *ctx_str;
  2895. long field;
  2896. {
  2897. long found = 0;
  2898. long valu = 0;
  2899. struct dct_entry *entry_pnt;
  2900. struct dct_recrd *recrd_pnt;
  2901. entry_pnt = head [((unsigned long)key_str) % FBL_HSZDFN];
  2902. while (entry_pnt != 0)
  2903. {
  2904. if (entry_pnt->key == key_str)
  2905. {
  2906. found = 1;
  2907. break;
  2908. }
  2909. entry_pnt = entry_pnt->next;
  2910. }
  2911. if (found == 1)
  2912. {
  2913. found = 0;
  2914. recrd_pnt = entry_pnt->data;
  2915. while (recrd_pnt != 0)
  2916. {
  2917. if (recrd_pnt->key == ctx_str)
  2918. {
  2919. found = 1;
  2920. break;
  2921. }
  2922. recrd_pnt = recrd_pnt->next;
  2923. }
  2924. if (found == 1)
  2925. {
  2926. switch (field)
  2927. {
  2928. case 0 :
  2929. valu = recrd_pnt->fd0_val;
  2930. break;
  2931. case 1 :
  2932. valu = recrd_pnt->fd1_val;
  2933. break;
  2934. case 2 :
  2935. valu = recrd_pnt->fd2_val;
  2936. break;
  2937. case 3 :
  2938. valu = recrd_pnt->fd3_val;
  2939. break;
  2940. case 4 :
  2941. valu = recrd_pnt->fd4_val;
  2942. break;
  2943. case 5 :
  2944. valu = recrd_pnt->fd5_val;
  2945. break;
  2946. case 6 :
  2947. valu = recrd_pnt->fd6_val;
  2948. break;
  2949. case 7 :
  2950. valu = recrd_pnt->pnt_val;
  2951. break;
  2952. }
  2953. }
  2954. }
  2955. return (valu);
  2956. }
  2957. static void fretab (pt_hash)
  2958. struct dct_entry **pt_hash;
  2959. {
  2960. struct dct_entry *pt_entry;
  2961. struct dct_entry *pt_nxtentry;
  2962. struct dct_recrd *pt_record;
  2963. long i;
  2964. if (pt_hash != 0)
  2965. {
  2966. for (i=0 ; i<FBL_HSZDFN ; i++)
  2967. {
  2968. if ((pt_entry = pt_hash[i]) != 0)
  2969. {
  2970. while (pt_entry != 0)
  2971. {
  2972. pt_record = pt_entry->data;
  2973. while (pt_record->next != 0)
  2974. pt_record = pt_record->next;
  2975. pt_record->next = FBL_DCRHED;
  2976. FBL_DCRHED = pt_entry->data;
  2977. pt_nxtentry = pt_entry->next;
  2978. pt_entry->next = FBL_DCEHED;
  2979. FBL_DCEHED = pt_entry;
  2980. pt_entry = pt_nxtentry;
  2981. }
  2982. }
  2983. }
  2984. free (pt_hash);
  2985. }
  2986. }
  2987. void *fbl_addstr (ptfig,object,mode,prtype,type,flag,name,left,right)
  2988. struct fbfig *ptfig;
  2989. char object;
  2990. long mode;
  2991. long prtype;
  2992. unsigned char type;
  2993. char flag;
  2994. char *name;
  2995. short left;
  2996. short right;
  2997. {
  2998. void *pnt = 0;
  2999. char porflg = 0;
  3000. char rinflg = 0;
  3001. char outflg = 0;
  3002. char busflg = 0;
  3003. char auxflg = 0;
  3004. char buxflg = 0;
  3005. char regflg = 0;
  3006. char lclmod;
  3007. char lcltyp = type;
  3008. char extname[100];
  3009. short i;
  3010. short inc = 1;
  3011. switch (object)
  3012. {
  3013. case 'P':
  3014. /* ###------------------------------------------------------### */
  3015. /* if object is a port ... */
  3016. /* ###------------------------------------------------------### */
  3017. porflg = 1;
  3018. switch (mode)
  3019. {
  3020. case FBL_ICNDFN:
  3021. lclmod = 'I'; lcltyp = type ; rinflg = 1; break;
  3022. case FBL_OCNDFN:
  3023. switch (prtype)
  3024. {
  3025. case BIT :
  3026. lclmod = 'O'; lcltyp = type ; outflg = 1; break;
  3027. case MUX_BIT :
  3028. lclmod = 'Z'; lcltyp = type; busflg = 1; break;
  3029. case WOR_BIT :
  3030. lclmod = 'Z'; lcltyp = type; busflg = 1; break;
  3031. }
  3032. break;
  3033. case FBL_BCNDFN:
  3034. rinflg = 1;
  3035. switch (prtype)
  3036. {
  3037. case BIT:
  3038. lclmod = 'B'; lcltyp = type; outflg = 1; rinflg =1;break;
  3039. case MUX_BIT:
  3040. lclmod = 'T'; lcltyp = type; busflg = 1;rinflg =1; break;
  3041. case WOR_BIT:
  3042. lclmod = 'T'; lcltyp = type; busflg = 1; rinflg =1;break;
  3043. }
  3044. break;
  3045. }
  3046. break;
  3047. case 'S':
  3048. /* ###------------------------------------------------------### */
  3049. /* if object is a signal ... */
  3050. /* ###------------------------------------------------------### */
  3051. switch (prtype)
  3052. {
  3053. case BIT:
  3054. lcltyp = type; auxflg = 1; break;
  3055. case REG_BIT :
  3056. rinflg = 1; regflg = 1; break;
  3057. case MUX_BIT :
  3058. lcltyp = type; rinflg = 1; buxflg = 1; break;
  3059. case WOR_BIT :
  3060. lcltyp = type; rinflg = 1; buxflg = 1; break;
  3061. default : lcltyp = type ; auxflg =1;break;
  3062. }
  3063. break;
  3064. }
  3065. if (flag == 'A' || flag == 'U')
  3066. {
  3067. /* ###------------------------------------------------------### */
  3068. /* if object is an array ... */
  3069. /* ###------------------------------------------------------### */
  3070. if (left >= right)
  3071. inc = -1;
  3072. for (i=left ; i!=(right+inc) ; i+=inc)
  3073. {
  3074. sprintf (extname,"%s %d",name,i);
  3075. if (porflg == 1)
  3076. {
  3077. ptfig->BEPOR = fbh_addfbpor (ptfig->BEPOR,extname,lclmod,lcltyp);
  3078. ptfig->BEPOR->LINE_NUM = FBL_LINNUM;
  3079. }
  3080. if (rinflg == 1)
  3081. {
  3082. ptfig->BERIN = fbh_addfbrin (ptfig->BERIN,extname);
  3083. ptfig->BERIN->LINE_NUM = FBL_LINNUM;
  3084. }
  3085. if (outflg == 1)
  3086. {
  3087. ptfig->BEOUT = fbh_addfbout (ptfig->BEOUT,extname,0,0,lcltyp);
  3088. ptfig->BEOUT->LINE_NUM = FBL_LINNUM;
  3089. }
  3090. if (busflg == 1)
  3091. {
  3092. ptfig->BEBUS = fbh_addfbbus (ptfig->BEBUS,extname,0,0,lcltyp);
  3093. ptfig->BEBUS->LINE_NUM = FBL_LINNUM;
  3094. }
  3095. if (auxflg == 1)
  3096. {
  3097. ptfig->BEAUX = fbh_addfbaux (ptfig->BEAUX,extname,0,0,lcltyp);
  3098. ptfig->BEAUX->LINE_NUM = FBL_LINNUM;
  3099. }
  3100. if (buxflg == 1)
  3101. {
  3102. ptfig->BEBUX = fbh_addfbbux (ptfig->BEBUX,extname,0,0,lcltyp);
  3103. ptfig->BEBUX->LINE_NUM = FBL_LINNUM;
  3104. }
  3105. if (regflg == 1)
  3106. {
  3107. ptfig->BEREG = fbh_addfbreg (ptfig->BEREG,extname,0,0);
  3108. ptfig->BEREG->LINE_NUM = FBL_LINNUM;
  3109. }
  3110. }
  3111. }
  3112. else
  3113. {
  3114. /* ###------------------------------------------------------### */
  3115. /* if object is a scalar ... */
  3116. /* ###------------------------------------------------------### */
  3117. if (porflg == 1)
  3118. {
  3119. ptfig->BEPOR = fbh_addfbpor (ptfig->BEPOR,name,lclmod,lcltyp);
  3120. ptfig->BEPOR->LINE_NUM = FBL_LINNUM;
  3121. }
  3122. if (rinflg == 1)
  3123. {
  3124. ptfig->BERIN = fbh_addfbrin (ptfig->BERIN,name);
  3125. ptfig->BERIN->LINE_NUM = FBL_LINNUM;
  3126. }
  3127. if (outflg == 1)
  3128. {
  3129. ptfig->BEOUT = fbh_addfbout (ptfig->BEOUT,name,0,0,lcltyp);
  3130. ptfig->BEOUT->LINE_NUM = FBL_LINNUM;
  3131. }
  3132. if (busflg == 1)
  3133. {
  3134. ptfig->BEBUS = fbh_addfbbus (ptfig->BEBUS,name,0,0,lcltyp);
  3135. ptfig->BEBUS->LINE_NUM = FBL_LINNUM;
  3136. }
  3137. if (auxflg == 1)
  3138. {
  3139. ptfig->BEAUX = fbh_addfbaux (ptfig->BEAUX,name,0,0,lcltyp);
  3140. ptfig->BEAUX->LINE_NUM = FBL_LINNUM;
  3141. }
  3142. if (buxflg == 1)
  3143. {
  3144. ptfig->BEBUX = fbh_addfbbux (ptfig->BEBUX,name,0,0,lcltyp);
  3145. ptfig->BEBUX->LINE_NUM = FBL_LINNUM;
  3146. }
  3147. if (regflg == 1)
  3148. {
  3149. ptfig->BEREG = fbh_addfbreg (ptfig->BEREG,name,0,0);
  3150. ptfig->BEREG->LINE_NUM = FBL_LINNUM;
  3151. }
  3152. }
  3153. if (outflg == 1)
  3154. {
  3155. pnt = (void *) ptfig->BEOUT;
  3156. }
  3157. if (busflg == 1)
  3158. {
  3159. pnt = (void *) ptfig->BEBUS;
  3160. }
  3161. if (auxflg == 1)
  3162. {
  3163. pnt = (void *) ptfig->BEAUX;
  3164. }
  3165. if (buxflg == 1)
  3166. {
  3167. pnt = (void *) ptfig->BEBUX;
  3168. }
  3169. if (regflg == 1)
  3170. {
  3171. pnt = (void *) ptfig->BEREG;
  3172. }
  3173. return (pnt);
  3174. }
  3175. long fbl_chkdcl (object,mode,type,flag,kind,constraint,conf)
  3176. char object;
  3177. long mode;
  3178. long type;
  3179. char flag;
  3180. long kind;
  3181. char constraint;
  3182. long *conf;
  3183. {
  3184. long errflg = 0;
  3185. long lclcnf = 0;
  3186. if (flag != constraint && constraint !='U' && flag !='U')
  3187. {
  3188. errflg = 1;
  3189. {
  3190. fbl_error (33,0);
  3191. }
  3192. }
  3193. else
  3194. {
  3195. switch (object)
  3196. {
  3197. case 'P':
  3198. /* ###------------------------------------------------------### */
  3199. /* If object is a port : */
  3200. /* - if type is bit, no guard indication can be used */
  3201. /* - if type is wor_bit or mux_bit, bus kind must be used */
  3202. /* - other types are illegal */
  3203. /* ###------------------------------------------------------### */
  3204. switch (type)
  3205. {
  3206. case BIT :
  3207. lclcnf += FBL_BITDFN + FBL_NORDFN;
  3208. switch (mode)
  3209. {
  3210. case _IN :
  3211. lclcnf += FBL_ICNDFN; break;
  3212. case _OUT:
  3213. lclcnf += FBL_OCNDFN; break;
  3214. case _INOUT :
  3215. lclcnf += FBL_BCNDFN; break;
  3216. case _LINKAGE :
  3217. case 0 :
  3218. errflg = 1; break;
  3219. }
  3220. if (kind != 0)
  3221. errflg = 1;
  3222. break;
  3223. case MUX_BIT :
  3224. lclcnf += FBL_MUXDFN + FBL_BUSDFN;
  3225. switch (mode)
  3226. {
  3227. case _OUT :
  3228. lclcnf += FBL_OCNDFN; break;
  3229. case _INOUT :
  3230. lclcnf += FBL_BCNDFN; break;
  3231. case _IN :
  3232. case _LINKAGE :
  3233. case 0 :
  3234. errflg = 1; break;
  3235. }
  3236. if (kind != BUS)
  3237. errflg = 1;
  3238. break;
  3239. case WOR_BIT :
  3240. lclcnf += FBL_WORDFN + FBL_BUSDFN;
  3241. switch (mode)
  3242. {
  3243. case _OUT :
  3244. lclcnf += FBL_OCNDFN; break;
  3245. case _INOUT :
  3246. lclcnf += FBL_BCNDFN; break;
  3247. case _IN :
  3248. case _LINKAGE :
  3249. case 0 :
  3250. errflg = 1; break;
  3251. }
  3252. if (kind != BUS)
  3253. errflg = 1;
  3254. break;
  3255. case REG_BIT :
  3256. case NATURAL:
  3257. errflg = 1;
  3258. break;
  3259. }
  3260. if (errflg == 1)
  3261. {
  3262. fbl_error (5,0);
  3263. }
  3264. break;
  3265. case 'G':
  3266. /* ###------------------------------------------------------### */
  3267. /* If object is a generic : */
  3268. /* - only natural type is allowed */
  3269. /* ###------------------------------------------------------### */
  3270. if ((type != NATURAL) || (mode != 0) || (kind != 0))
  3271. {
  3272. errflg = 1;
  3273. {
  3274. fbl_error (77,0);
  3275. }
  3276. }
  3277. break;
  3278. case 'S':
  3279. /* ###------------------------------------------------------### */
  3280. /* If object is a signal : */
  3281. /* - no mode can be specified */
  3282. /* - if type is bit no guard indication can be used */
  3283. /* - if type is wor_bit or mux_bit, bus kind must be used */
  3284. /* - if type is reg_bit, register kind must be used */
  3285. /* - other types are illegal */
  3286. /* ###------------------------------------------------------### */
  3287. switch (type)
  3288. {
  3289. case BIT:
  3290. lclcnf += FBL_BITDFN + FBL_NORDFN;
  3291. if ((mode != 0) || (kind != 0))
  3292. errflg = 1;
  3293. break;
  3294. case MUX_BIT:
  3295. lclcnf += FBL_MUXDFN + FBL_BUSDFN;
  3296. if ((mode != 0) || (kind != BUS))
  3297. errflg = 1;
  3298. break;
  3299. case WOR_BIT:
  3300. lclcnf += FBL_WORDFN + FBL_BUSDFN;
  3301. if ((mode != 0) || (kind != BUS))
  3302. errflg = 1;
  3303. break;
  3304. case REG_BIT:
  3305. lclcnf += FBL_RBIDFN + FBL_REGDFN;
  3306. if ((mode != 0) || (kind != REGISTER))
  3307. errflg = 1;
  3308. break;
  3309. case NATURAL:
  3310. errflg = 1; break;
  3311. }
  3312. if (mode != 0)
  3313. errflg = 1;
  3314. if (errflg == 1)
  3315. {
  3316. fbl_error (11,NULL);
  3317. }
  3318. break;
  3319. case 'C':
  3320. /* ###------------------------------------------------------### */
  3321. /* If object is a constant : */
  3322. /* - only bit type without any other indication is legal */
  3323. /* ###------------------------------------------------------### */
  3324. lclcnf += FBL_CSTDFN;
  3325. if ((type != BIT) || (mode != 0) || (kind != 0))
  3326. {
  3327. errflg = 1;
  3328. {
  3329. fbl_error (78,NULL);
  3330. }
  3331. }
  3332. break;
  3333. }
  3334. }
  3335. *conf = lclcnf;
  3336. return (errflg);
  3337. }
  3338. long val_type(name)
  3339. char *name;
  3340. {
  3341. if(!name)
  3342. return(-1);
  3343. if (!strcmp(name,"severity_level"))
  3344. return(SEVERITY_LEVEL);
  3345. if (!strcmp(name,"boolean"))
  3346. return(BOOLEAN);
  3347. if (!strcmp(name,"bit"))
  3348. return(BIT);
  3349. if (!strcmp(name,"mux_bit"))
  3350. return(MUX_BIT);
  3351. if (!strcmp(name,"wor_bit"))
  3352. return(WOR_BIT);
  3353. if (!strcmp(name,"reg_bit"))
  3354. return(REG_BIT);
  3355. if (!strcmp(name,"bit_vector"))
  3356. return(BIT);
  3357. if (!strcmp(name,"mux_vector"))
  3358. return(MUX_BIT);
  3359. if (!strcmp(name,"wor_vector"))
  3360. return(WOR_BIT);
  3361. if (!strcmp(name,"reg_vector"))
  3362. return(REG_BIT);
  3363. if (!strcmp(name,"integer"))
  3364. return(INTEGER);
  3365. if (!strcmp(name,"natural"))
  3366. return(NATURAL);
  3367. if (!strcmp(name,"std_logic"))
  3368. return(BIT);
  3369. if (!strcmp(name,"std_ulogic"))
  3370. return(BIT);
  3371. if (!strcmp(name,"std_logic_vector"))
  3372. return(BIT);
  3373. if (!strcmp(name,"std_ulogic_vector"))
  3374. return(BIT);
  3375. return( -1 );
  3376. }
  3377. struct ptype *reversetype(pnt)
  3378. struct ptype *pnt;
  3379. {
  3380. struct ptype* revtype;
  3381. struct ptype* aux2;
  3382. struct ptype* aux1;
  3383. if(pnt == 0 || pnt->NEXT == 0)
  3384. return(pnt);
  3385. revtype = pnt;
  3386. aux1 = pnt->NEXT;
  3387. revtype->NEXT = 0;
  3388. while(aux1)
  3389. {
  3390. aux2 = revtype;
  3391. revtype = aux1;
  3392. aux1 = aux1->NEXT;
  3393. revtype->NEXT = aux2;
  3394. }
  3395. return(revtype);
  3396. }
  3397. struct choice_chain *addchoice(lastpnt,type,val,size)
  3398. struct choice_chain *lastpnt;
  3399. struct ptype *type;
  3400. char *val;
  3401. unsigned long size;
  3402. {
  3403. struct choice_chain *pnt;
  3404. pnt = (struct choice_chain*)mbkalloc(sizeof(struct choice_chain));
  3405. pnt->VALUE = val;
  3406. pnt->SIZE = size;
  3407. pnt->INSTRUCTION = type;
  3408. pnt->NEXT = lastpnt;
  3409. return(pnt);
  3410. }
  3411. struct choice_chain *order_choice(pnt,type,val,size)
  3412. struct choice_chain *pnt;
  3413. struct ptype *type;
  3414. char *val;
  3415. unsigned long size;
  3416. {
  3417. struct choice_chain *aux1;
  3418. struct choice_chain *aux2;
  3419. if(!pnt)
  3420. {
  3421. aux1 = addchoice (pnt,type,val,size);
  3422. return(aux1);
  3423. }
  3424. if(strcmp(pnt->VALUE,val)>0)
  3425. {
  3426. aux1 =addchoice(pnt,type,val,size);
  3427. return(aux1);
  3428. }
  3429. aux1 =pnt;
  3430. aux2 =pnt->NEXT;
  3431. while(aux2)
  3432. {
  3433. if(strcmp(aux2->VALUE, val)>0)
  3434. {
  3435. aux2 = addchoice (aux2,type,val,size);
  3436. aux1->NEXT = aux2;
  3437. return(pnt);
  3438. }
  3439. aux1 = aux2;
  3440. aux2 = aux2->NEXT;
  3441. }
  3442. aux2 = addchoice (aux2,type,val,size);
  3443. aux1->NEXT = aux2;
  3444. return(pnt);
  3445. }