| /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
| proto.h | 34 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 * );
[all...] |
| build.c | 42 ((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;}
48 /* Add the parameter string 'parm' to the parms field of a block-type junction
50 * the actual junction with its jtype == some block-type.
72 ((Junction *)p)->parm = q; /* only one parameter allowed on subrules */
82 * Where o is a junction node.
[all...] |
| egman.c | 40 static Junction **altArray=NULL; /* start of alternates */
69 Junction *nextAlt;
70 Junction *innerAlt;
198 void altAdd(Junction *alt)
201 Junction *alt;
224 Junction **altArrayNew;
236 altArrayNew=(Junction **)
237 calloc(arraySizeNew,sizeof(Junction *));
309 Junction *nextAlt;
310 Junction *innerAlt;
[all...] |
| dumpnode.c | 43 ( (Junction *) p)->jtype == EndRule) {
163 Junction *j;
175 j = (Junction *) p;
176 fprintf(stderr, "Junction (#%d in rule %s line %d) ",j->seq,j->rname,j->line);
211 fprintf(stderr," (p2=#%d)",( (Junction *) j->p2)->seq);
270 result=( (Junction *) p )->p1;
273 fprintf(stderr,"dp1: Not a Junction node");
288 result=( (Junction *) p )->p2;
291 fprintf(stderr,"dp2: Not a Junction node");
376 Junction *findnode1(Node *n)
[all...] |
| syn.h | 50 #define Generic 6 /* just a junction--no unusual characteristics */
65 class Junction;
161 * assumes a 'Junction *r' exists. This macro calls a function with
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 {
323 char *rname; /* name of rule junction is in */
342 Junction type */
[all...] |
| pred.c | 152 find_in_aSubBlk( Junction *alt )
155 Junction *alt;
159 Junction *p = alt;
164 for (; p!=NULL; p=(Junction *)p->p2)
168 ((Junction *)p->p1)->jtype != EndBlk )
203 find_in_aOptBlk( Junction *alt )
206 Junction *alt;
214 find_in_aLoopBegin( Junction *alt )
217 Junction *alt;
220 return find_in_aSubBlk( (Junction *) alt->p1 ); /* get preds in alts */
[all...] |
| fset.c | 47 (Junction *, Junction *, char *, Tree *);
53 * What tokens are k tokens away from junction q?
57 * We lock the junction according to k--the lookahead. If we have been at this
58 * junction before looking for the same, k, number of lookahead tokens, we will
69 * junction yields an empty set, replace the empty set with EOF. No FOLLOW means that
112 rJunc( Junction *p, int k, set *rk )
115 Junction *p;
123 require(p->ntype==nJunction, "rJunc: not junction");
126 if ( p->jtype == RuleBlk ) fprintf(stderr, "FIRST(%s,%d) \n",((Junction *)p)->rname,k);
[all...] |
| antlr.g | 707 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;
[all...] |
| gen.c | 70 /* C_JTrans[Junction type] == pointer to function that knows how to translate that
71 * kind of junction node.
128 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 *);
183 /* MR10 genTraceOut(Junction *) */
186 static void genTraceOut(Junction *q)
189 Junction *q;
214 freeBlkFsets( Junction *q )
[all...] |
| globals.c | 292 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 */
|
| misc.c | 361 Junction *j = (Junction *) p;
952 pBlk( Junction *q, int btype )
955 Junction *q;
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;
[all...] |
| mrhoist.c | 245 Junction *lastOne;
524 case nJunction: return ((Junction *)n)->p1;
534 Junction * MR_find_endRule(Node *n)
536 Junction * MR_find_endRule(n)
544 ( (Junction *) next)->jtype == EndRule) {
548 return (Junction *)next;
848 set MR_First(int ck,Junction *j,set *incomplete)
852 Junction *j;
856 Junction *p;
861 require(j->ntype==nJunction, "MR_First: non junction passed");
[all...] |
| antlr.c | 248 g=zzaArg(zztasp1,3); SynDiag = (Junction *) zzaArg(zztasp1,3 ).left;
500 RuleEntry *q; Junction *p; Graph r; int f, l; ECnode *e;
653 CurRuleBlk = (Junction *)r.left;
666 ((Junction *)r.right)->p1 = (Node *)p;
[all...] |
| lex.c | 388 GenRuleFuncRedefs( FILE *f, Junction *p )
392 Junction *p;
399 p = (Junction *)p->p2;
475 GenRulePrototypes( FILE *f, Junction *p )
479 Junction *p;
541 p = (Junction *)p->p2;
550 GenRuleMemberDeclarationsForCC( FILE *f, Junction *q )
554 Junction *q;
557 Junction *p = q;
579 p = (Junction *)p->p2;
[all...] |
| fset2.c | 532 tJunc( Junction *p, int k, set *rk )
535 Junction *p;
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 *numAmbig )
[all...] |
| main.c | 799 buildRulePtr(); /* create mapping from rule # to RuleBlk junction */
[all...] |
| bits.c | 212 Junction *r;
|
| /external/ImageMagick/www/api/ |
| morphology.php | 254 <dd> Peak:radius1,radius2 Find any peak larger than the pixels the fall between the two radii. The default ring of pixels is as per "Ring". Edges Find flat orthogonal edges of a binary shape Corners Find 90 degree corners of a binary shape Diagonals:type A special kernel to thin the 'outside' of diagonals LineEnds:type Find end points of lines (for pruning a skeletion) Two types of lines ends (default to both) can be searched for Type 0: All line ends Type 1: single kernel for 4-conneected line ends Type 2: single kernel for simple line ends LineJunctions Find three line junctions (within a skeletion) Type 0: all line junctions Type 1: Y Junction kernel Type 2: Diagonal T Junction kernel Type 3: Orthogonal T Junction kernel Type 4: Diagonal X Junction kernel Type 5: Orthogonal + Junction kernel Ridges:type Find single pixel ridges or thin lines Type 1: Fine single pixel thick lines and ridges Type 2: Find two pixel thick lines and ridges ConvexHull Octagonal Thickening Kernel, to generate convex hulls of 45 degrees Skeleton:type Traditional skeleton generating kernels. Type 1: Tradional Skeleton kernel (4 connected skeleton) Type 2: HIPR2 Skeleton kernel (8 connected skeleton) Type 3: Thinning skeleton based on a ressearch paper by Dan S. Bloomberg (Default Type) ThinSE:type A huge variety of Thinning Kernels designed to preserve conectivity. many other kernel sets use these kernels as source definitions. Type numbers are 41-49, 81-89, 481, and 482 which are based on the super and sub notations used in the source research paper. </dd>
[all...] |
| /external/mockito/lib/ |
| byte-buddy-1.6.9.jar | |
| /prebuilts/tools/common/m2/repository/net/bytebuddy/byte-buddy/1.6.5/ |
| byte-buddy-1.6.5.jar | |
| /prebuilts/tools/common/m2/repository/net/bytebuddy/byte-buddy/1.4.33/ |
| byte-buddy-1.4.33.jar | |
| /prebuilts/tools/common/m2/repository/net/bytebuddy/byte-buddy/1.5.5/ |
| byte-buddy-1.5.5.jar | |
| /prebuilts/tools/common/m2/repository/nl/jqno/equalsverifier/equalsverifier/2.1.5/ |
| equalsverifier-2.1.5.jar | |
| /external/guice/extensions/persist/lib/ |
| hibernate3.jar | |
