📄 graphviz_digraph_parser.cpp
字号:
/* Push a new state, which is found in yystate . */
/* In all cases, when you get here, the value and location stacks
have just been pushed. so pushing a state here evens the stacks. */
yynewstate:
*++yyssp = yystate;
if (yyssp >= yyss + yystacksize - 1)
{
/* Give user a chance to reallocate the stack */
/* Use copies of these so that the &'s don't force the real ones into memory. */
YYSTYPE *yyvs1 = yyvs;
short *yyss1 = yyss;
#ifdef YYLSP_NEEDED
YYLTYPE *yyls1 = yyls;
#endif
/* Get the current used size of the three stacks, in elements. */
int size = yyssp - yyss + 1;
#ifdef yyoverflow
/* Each stack pointer address is followed by the size of
the data in use in that stack, in bytes. */
#ifdef YYLSP_NEEDED
/* This used to be a conditional around just the two extra args,
but that might be undefined if yyoverflow is a macro. */
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yyls1, size * sizeof (*yylsp),
&yystacksize);
#else
yyoverflow("parser stack overflow",
&yyss1, size * sizeof (*yyssp),
&yyvs1, size * sizeof (*yyvsp),
&yystacksize);
#endif
yyss = yyss1; yyvs = yyvs1;
#ifdef YYLSP_NEEDED
yyls = yyls1;
#endif
#else /* no yyoverflow */
/* Extend the stack our own way. */
if (yystacksize >= YYMAXDEPTH)
{
bgl_dir_error("parser stack overflow");
if (yyfree_stacks)
{
free (yyss);
free (yyvs);
#ifdef YYLSP_NEEDED
free (yyls);
#endif
}
return 2;
}
yystacksize *= 2;
if (yystacksize > YYMAXDEPTH)
yystacksize = YYMAXDEPTH;
#ifndef YYSTACK_USE_ALLOCA
yyfree_stacks = 1;
#endif
yyss = (short *) YYSTACK_ALLOC (yystacksize * sizeof (*yyssp));
__yy_memcpy ((char *)yyss, (char *)yyss1,
size * (unsigned int) sizeof (*yyssp));
yyvs = (YYSTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yyvsp));
__yy_memcpy ((char *)yyvs, (char *)yyvs1,
size * (unsigned int) sizeof (*yyvsp));
#ifdef YYLSP_NEEDED
yyls = (YYLTYPE *) YYSTACK_ALLOC (yystacksize * sizeof (*yylsp));
__yy_memcpy ((char *)yyls, (char *)yyls1,
size * (unsigned int) sizeof (*yylsp));
#endif
#endif /* no yyoverflow */
yyssp = yyss + size - 1;
yyvsp = yyvs + size - 1;
#ifdef YYLSP_NEEDED
yylsp = yyls + size - 1;
#endif
#if YYDEBUG != 0
if (bgl_dir_debug)
fprintf(stderr, "Stack size increased to %d\n", yystacksize);
#endif
if (yyssp >= yyss + yystacksize - 1)
YYABORT;
}
#if YYDEBUG != 0
if (bgl_dir_debug)
fprintf(stderr, "Entering state %d\n", yystate);
#endif
goto yybackup;
yybackup:
/* Do appropriate processing given the current state. */
/* Read a lookahead token if we need one and don't already have one. */
/* yyresume: */
/* First try to decide what to do without reference to lookahead token. */
yyn = yypact[yystate];
if (yyn == YYFLAG)
goto yydefault;
/* Not known => get a lookahead token if don't already have one. */
/* bgl_dir_char is either YYEMPTY or YYEOF
or a valid token in external form. */
if (bgl_dir_char == YYEMPTY)
{
#if YYDEBUG != 0
if (bgl_dir_debug)
fprintf(stderr, "Reading a token: ");
#endif
bgl_dir_char = YYLEX;
}
/* Convert token to internal form (in bgl_dir_char1) for indexing tables with */
if (bgl_dir_char <= 0) /* This means end of input. */
{
bgl_dir_char1 = 0;
bgl_dir_char = YYEOF; /* Don't call YYLEX any more */
#if YYDEBUG != 0
if (bgl_dir_debug)
fprintf(stderr, "Now at end of input.\n");
#endif
}
else
{
bgl_dir_char1 = YYTRANSLATE(bgl_dir_char);
#if YYDEBUG != 0
if (bgl_dir_debug)
{
fprintf (stderr, "Next token is %d (%s", bgl_dir_char, yytname[bgl_dir_char1]);
/* Give the individual parser a way to print the precise meaning
of a token, for further debugging info. */
#ifdef YYPRINT
YYPRINT (stderr, bgl_dir_char, bgl_dir_lval);
#endif
fprintf (stderr, ")\n");
}
#endif
}
yyn += bgl_dir_char1;
if (yyn < 0 || yyn > YYLAST || yycheck[yyn] != bgl_dir_char1)
goto yydefault;
yyn = yytable[yyn];
/* yyn is what to do for this token type in this state.
Negative => reduce, -yyn is rule number.
Positive => shift, yyn is new state.
New state is final state => don't bother to shift,
just return success.
0, or most negative number => error. */
if (yyn < 0)
{
if (yyn == YYFLAG)
goto yyerrlab;
yyn = -yyn;
goto yyreduce;
}
else if (yyn == 0)
goto yyerrlab;
if (yyn == YYFINAL)
YYACCEPT;
/* Shift the lookahead token. */
#if YYDEBUG != 0
if (bgl_dir_debug)
fprintf(stderr, "Shifting token %d (%s), ", bgl_dir_char, yytname[bgl_dir_char1]);
#endif
/* Discard the token being shifted unless it is eof. */
if (bgl_dir_char != YYEOF)
bgl_dir_char = YYEMPTY;
*++yyvsp = bgl_dir_lval;
#ifdef YYLSP_NEEDED
*++yylsp = yylloc;
#endif
/* count tokens shifted since error; after three, turn off error status. */
if (yyerrstatus) yyerrstatus--;
yystate = yyn;
goto yynewstate;
/* Do the default action for the current state. */
yydefault:
yyn = yydefact[yystate];
if (yyn == 0)
goto yyerrlab;
/* Do a reduction. yyn is the number of a rule to reduce with. */
yyreduce:
yylen = yyr2[yyn];
if (yylen > 0)
yyval = yyvsp[1-yylen]; /* implement default value of the action */
#if YYDEBUG != 0
if (bgl_dir_debug)
{
int i;
fprintf (stderr, "Reducing via rule %d (line %d), ",
yyn, yyrline[yyn]);
/* Print the symbols being reduced, and their result. */
for (i = yyprhs[yyn]; yyrhs[i] > 0; i++)
fprintf (stderr, "%s ", yytname[yyrhs[i]]);
fprintf (stderr, " -> %s\n", yytname[yyr1[yyn]]);
}
#endif
switch (yyn) {
case 2:
#line 249 "graphviz_parser.y"
{yyval.i=0;;
break;}
case 3:
#line 253 "graphviz_parser.y"
{
std::string* name = static_cast<std::string*>(yyvsp[0].ptr);
graphviz::previous_graph = static_cast<graphviz::Subgraph*>(g);
graphviz::current_graph = static_cast<graphviz::Subgraph*>(g);
graphviz::set_graph_name(*name);
delete name;
;
break;}
case 6:
#line 265 "graphviz_parser.y"
{yyval.ptr = yyvsp[0].ptr; ;
break;}
case 7:
#line 265 "graphviz_parser.y"
{yyval.ptr=(void*)(new std::string("G")); ;
break;}
case 14:
#line 279 "graphviz_parser.y"
{
graphviz::set_attribute(*graphviz::current_graph,
graphviz::attribute_state);
;
break;}
case 15:
#line 285 "graphviz_parser.y"
{ graphviz::attribute_state = GRAPH_GRAPH_A; ;
break;}
case 16:
#line 286 "graphviz_parser.y"
{ graphviz::attribute_state = GRAPH_NODE_A; ;
break;}
case 17:
#line 287 "graphviz_parser.y"
{ graphviz::attribute_state = GRAPH_EDGE_A; ;
break;}
case 20:
#line 294 "graphviz_parser.y"
{
std::string* name = static_cast<std::string*>(yyvsp[-2].ptr);
std::string* value = static_cast<std::string*>(yyvsp[0].ptr);
graphviz::attributes[*name] = *value;
delete name;
delete value;
;
break;}
case 27:
#line 306 "graphviz_parser.y"
{ yyval.i = 0; ;
break;}
case 28:
#line 310 "graphviz_parser.y"
{
graphviz::set_attribute(
*static_cast<graphviz::Subgraph*>(graphviz::current_graph),
GRAPH_GRAPH_A);
;
break;}
case 29:
#line 318 "graphviz_parser.y"
{
graphviz::Vertex* temp = static_cast<graphviz::Vertex*>(yyvsp[-1].ptr);
graphviz::current_vertex = *temp;
graphviz::set_attribute(*static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM),
NODE_A);
delete temp;
yyval.i = 0;
;
break;}
case 30:
#line 328 "graphviz_parser.y"
{ yyval.i=0; ;
break;}
case 31:
#line 328 "graphviz_parser.y"
{ yyval.i=0; ;
break;}
case 32:
#line 332 "graphviz_parser.y"
{
std::string* name = static_cast<std::string*>(yyvsp[0].ptr);
std::pair<graphviz::Iter, bool> result = graphviz::lookup(*name);
if (result.second) {
graphviz::current_vertex = result.first->second;
if (! graphviz::current_graph->is_root())
boost::add_vertex(graphviz::current_vertex, *graphviz::current_graph);
} else
graphviz::current_vertex = graphviz::add_name(*name, *static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM)) ;
graphviz::Vertex* temp = new graphviz::Vertex(graphviz::current_vertex);
yyval.ptr = (void *)temp;
graphviz::attribute_state = NODE_A;
delete name;
;
break;}
case 33:
#line 346 "graphviz_parser.y"
{ yyval.ptr=yyvsp[0].ptr; ;
break;}
case 34:
#line 350 "graphviz_parser.y"
{
//consider port as a special properties ?? --need work here
std::string* name = static_cast<std::string*>(yyvsp[-2].ptr);
std::string* port = static_cast<std::string*>(yyvsp[0].ptr);
std::pair<graphviz::Iter, bool> result = graphviz::lookup(*name);
if (result.second)
graphviz::current_vertex = result.first->second;
else
graphviz::current_vertex = graphviz::add_name(*name, *static_cast<GRAPHVIZ_GRAPH*>(YYPARSE_PARAM)) ;
graphviz::Vertex* temp = new graphviz::Vertex(graphviz::current_vertex);
yyval.ptr = (void *)temp;
graphviz::attribute_state = NODE_A;
delete name;
delete port;
;
break;}
case 35:
#line 369 "graphviz_parser.y"
{
typedef std::pair<void*, bool>* Ptr;
Ptr source = static_cast<Ptr>(yyvsp[-2].ptr);
for (std::vector<Ptr>::iterator it=graphviz::vlist.begin();
it !=graphviz::vlist.end(); ++it) {
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -