Home
last modified time | relevance | path

Searched refs:Junction (Results 1 – 17 of 17) sorted by relevance

/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
Dproto.h34 extern Junction *SynDiag;
77 extern Junction *CurRuleBlk;
126 extern Junction **RulePtr;
251 extern Junction *CurAltStart;
252 extern Junction *OuterAltStart; /* chain exception groups MR7 */
256 extern Junction *MR_RuleBlkWithHalt; /* MR10 */
324 extern Junction * newJunction( void );
337 extern Tree * tJunc( Junction *, int, set * );
347 extern Tree * VerifyAmbig( Junction *, Junction *, unsigned **, set *, Tree **, Tree **, int * );
348 extern set rJunc( Junction *, int, set * );
[all …]
Dbuild.c42 ((Junction *)g.left)->jtype = t; \
43 ((Junction *)g.left)->approx = approx; \
44 ((Junction *)g.left)->pFirstSetSymbol = first_set_symbol; \
45 ((Junction *)g.left)->end = (Junction *) g.right; \
46 ((Junction *)g.right)->jtype = EndBlk;}
72 ((Junction *)p)->parm = q; /* only one parameter allowed on subrules */
95 Junction *j1, *j2;
168 Junction *j1, *j2;
200 Junction *j1, *j2;
276 Junction *j1, *j2;
[all …]
Degman.c40 static Junction **altArray=NULL; /* start of alternates */
69 Junction *nextAlt;
70 Junction *innerAlt;
198 void altAdd(Junction *alt) in altAdd()
201 Junction *alt; in altAdd()
224 Junction **altArrayNew; in arrayCheck()
236 altArrayNew=(Junction **) in arrayCheck()
237 calloc(arraySizeNew,sizeof(Junction *)); in arrayCheck()
309 Junction *nextAlt; in altFixup()
310 Junction *innerAlt; in altFixup()
Ddumpnode.c43 ( (Junction *) p)->jtype == EndRule) {
163 Junction *j;
175 j = (Junction *) p;
211 fprintf(stderr," (p2=#%d)",( (Junction *) j->p2)->seq);
270 result=( (Junction *) p )->p1;
288 result=( (Junction *) p )->p2;
376 Junction *findnode1(Node *n) in findnode1()
378 Junction *findnode1(n) in findnode1()
383 Junction *j;
384 Junction *match;
[all …]
Dgen.c128 static set ComputeErrorSet(Junction *, int, int);
129 static void makeErrorClause(Junction *, set, int, int);
130 static void DumpFuncHeader( Junction *, RuleEntry * );
131 static int has_guess_block_as_first_item(Junction *);
186 static void genTraceOut(Junction *q) in genTraceOut()
189 Junction *q; in genTraceOut()
214 freeBlkFsets( Junction *q ) in freeBlkFsets()
217 Junction *q; in freeBlkFsets()
221 Junction *alt;
224 for (alt=q; alt != NULL; alt= (Junction *) alt->p2 )
[all …]
Dsyn.h65 class Junction; variable
166 if ( (p)->ntype == nJunction ) (*(fpJTrans[((Junction *)(p))->jtype]))( p );\
228 Junction *guardNodes; /* MR11 */
267 Junction *altstart; /* pointer to node that starts alt */
305 Junction *altstart;
318 class Junction : public Node {
344 Junction *end; /* pointer to node with EndBlk in it
378 Junction *pendingLink; /* MR7 */
386 } Junction;
Dfset.c47 (Junction *, Junction *, char *, Tree *);
112 rJunc( Junction *p, int k, set *rk ) in rJunc()
115 Junction *p; in rJunc()
126 if ( p->jtype == RuleBlk ) fprintf(stderr, "FIRST(%s,%d) \n",((Junction *)p)->rname,k);
128 decodeJType[p->jtype], ((Junction *)p)->rname);
302 Junction *r;
580 ( Junction *alt1, Junction *alt2, char *sub, Tree *ambig ) in ensure_predicates_cover_ambiguous_lookahead_sequences()
583 Junction *alt1; in ensure_predicates_cover_ambiguous_lookahead_sequences()
584 Junction *alt2;
674 void MR_doPredicatesHelp(int inGuessBlock,Junction *alt1,Junction *alt2,int jtype,char *sub) in MR_doPredicatesHelp()
[all …]
Dpred.c152 find_in_aSubBlk( Junction *alt ) in find_in_aSubBlk()
155 Junction *alt; in find_in_aSubBlk()
159 Junction *p = alt;
164 for (; p!=NULL; p=(Junction *)p->p2)
168 ((Junction *)p->p1)->jtype != EndBlk )
203 find_in_aOptBlk( Junction *alt ) in find_in_aOptBlk()
206 Junction *alt; in find_in_aOptBlk()
214 find_in_aLoopBegin( Junction *alt ) in find_in_aLoopBegin()
217 Junction *alt; in find_in_aLoopBegin()
220 return find_in_aSubBlk( (Junction *) alt->p1 ); /* get preds in alts */
[all …]
Dglobals.c292 Junction *CurRuleBlk=NULL; /* Pointer to current block node for enclosing block */
308 Junction *CurAltStart = NULL; /* Junction node that starts the alt */
309 Junction *OuterAltStart = NULL; /* For chaining exception groups MR7 */
324 Junction *SynDiag = NULL; /* Pointer to start of syntax diagram */
339 Junction **RulePtr=NULL; /* map rule # to RuleBlk node of rule */
431 Junction *MR_RuleBlkWithHalt; /* MR10 */
Dmisc.c361 Junction *j = (Junction *) p;
952 pBlk( Junction *q, int btype ) in pBlk()
955 Junction *q; in pBlk()
960 Junction *alt, *p;
967 alt = (Junction *)q->p2;
983 for (a=1,alt=q; alt != NULL; alt= (Junction *) alt->p2, a++)
1002 if ( alt->p2 != NULL && ((Junction *)alt->p2)->ignore ) break;
1004 if ( alt->p2 != NULL && !(((Junction *)alt->p2)->p2==NULL && btype == aOptBlk) )
1016 p = (Junction *) ((Junction *)alt->p2)->p1;
1021 p=(Junction *)((ActionNode *)p)->next;
[all …]
Dmrhoist.c245 Junction *lastOne;
524 case nJunction: return ((Junction *)n)->p1;
534 Junction * MR_find_endRule(Node *n) in MR_find_endRule()
536 Junction * MR_find_endRule(n) in MR_find_endRule()
544 ( (Junction *) next)->jtype == EndRule) {
548 return (Junction *)next;
848 set MR_First(int ck,Junction *j,set *incomplete) in MR_First()
852 Junction *j;
856 Junction *p;
863 p = analysis_point((Junction *)j->p1);
[all …]
Dantlr.c248 g=zzaArg(zztasp1,3); SynDiag = (Junction *) zzaArg(zztasp1,3 ).left; in grammar()
500 RuleEntry *q; Junction *p; Graph r; int f, l; ECnode *e; in rule()
653 CurRuleBlk = (Junction *)r.left; in rule()
666 ((Junction *)r.right)->p1 = (Node *)p; in rule()
1686 if ( ((Junction *)g.left)->p1->ntype == nAction )
1689 ( ( (Junction *)g.left) ->p1);
1699 ((Junction *)g.left)->blockid = CurBlockID;
1732 ((Junction *)g.left)->blockid = CurBlockID;
1844 TokNode *tk = (TokNode *)((Junction *)zzaArg(zztasp2,2 ).left)->p1;
1849 RuleRefNode *rn = (RuleRefNode *)((Junction *)zzaArg(zztasp2,2 ).left)->p1;
[all …]
Dfset2.c532 tJunc( Junction *p, int k, set *rk ) in tJunc()
535 Junction *p; in tJunc()
541 Junction *alt;
546 decodeJType[p->jtype], ((Junction *)p)->rname);
581 for (alt=(Junction *)p->p2; alt!=NULL; alt = (Junction *)alt->p2)
603 fprintf(stderr, "blk(%s) returns:",((Junction *)p)->rname); preorder(r); fprintf(stderr, "\n");
690 Junction *r;
1212 VerifyAmbig( Junction *alt1, Junction *alt2, unsigned **ft, set *fs, Tree **t, Tree **u, int *numAm… in VerifyAmbig()
1215 Junction *alt1; in VerifyAmbig()
1216 Junction *alt2;
[all …]
Dlex.c388 GenRuleFuncRedefs( FILE *f, Junction *p ) in GenRuleFuncRedefs()
392 Junction *p;
399 p = (Junction *)p->p2;
475 GenRulePrototypes( FILE *f, Junction *p ) in GenRulePrototypes()
479 Junction *p;
541 p = (Junction *)p->p2;
550 GenRuleMemberDeclarationsForCC( FILE *f, Junction *q ) in GenRuleMemberDeclarationsForCC()
554 Junction *q;
557 Junction *p = q;
579 p = (Junction *)p->p2;
[all …]
Dantlr.g707 rule <<g=$3; SynDiag = (Junction *) $3.left;>>
826 RuleEntry *q; Junction *p; Graph r; int f, l; ECnode *e;
903 CurRuleBlk = (Junction *)r.left;
916 ((Junction *)r.right)->p1 = (Node *)p;
1476 if ( ((Junction *)g.left)->p1->ntype == nAction )
1479 ( ( (Junction *)g.left) ->p1);
1489 ((Junction *)g.left)->blockid = CurBlockID;
1508 ((Junction *)g.left)->blockid = CurBlockID;
1558 TokNode *tk = (TokNode *)((Junction *)$2.left)->p1;
1563 RuleRefNode *rn = (RuleRefNode *)((Junction *)$2.left)->p1;
[all …]
Dmain.c1041 Junction *p = SynDiag; in buildRulePtr()
1042 RulePtr = (Junction **) calloc(NumRules+1, sizeof(Junction *)); in buildRulePtr()
1049 p = (Junction *)p->p2; in buildRulePtr()
Dbits.c212 Junction *r;