Searched refs:cgn (Results 1 - 9 of 9) sorted by relevance

/freebsd-11.0-release/contrib/gcc/
H A Dc-gimplify.c82 struct cgraph_node *cgn; local
114 cgn = cgraph_node (fndecl);
115 for (cgn = cgn->nested; cgn ; cgn = cgn->next_nested)
116 c_genericize (cgn->decl);
H A Dtree-nested.c749 struct cgraph_node *cgn = cgraph_node (fndecl);
752 for (cgn = cgn->nested; cgn ; cgn = cgn->next_nested)
754 for (arg = DECL_ARGUMENTS (cgn->decl); arg; arg = TREE_CHAIN (arg))
758 if (check_for_nested_with_variably_modified (cgn->decl, orig_fndecl))
769 create_nesting_tree (struct cgraph_node *cgn)
775 info->context = cgn
747 struct cgraph_node *cgn = cgraph_node (fndecl); local
767 create_nesting_tree(struct cgraph_node *cgn) argument
1976 struct cgraph_node *cgn; local
[all...]
H A Dgimplify.c890 struct cgraph_node *cgn = cgraph_node (fndecl); local
894 for (cgn = cgn->nested; cgn; cgn = cgn->next_nested)
895 unshare_body (&DECL_SAVED_TREE (cgn->decl), cgn->decl);
903 struct cgraph_node *cgn = cgraph_node (fndecl); local
907 for (cgn
[all...]
H A Dc-decl.c7278 struct cgraph_node *cgn;
7288 cgn = cgraph_node (fndecl);
7289 for (cgn = cgn->nested; cgn ; cgn = cgn->next_nested)
7290 c_gimple_diagnostics_recursively (cgn->decl);
7250 struct cgraph_node *cgn; local
/freebsd-11.0-release/contrib/bmake/
H A Dmake.c162 * cgn the child we've just examined
173 Make_TimeStamp(GNode *pgn, GNode *cgn) argument
175 if (pgn->cmgn == NULL || cgn->mtime > pgn->cmgn->mtime) {
176 pgn->cmgn = cgn;
184 * cgn the child we've just examined
188 MakeTimeStamp(void *pgn, void *cgn) argument
190 return Make_TimeStamp((GNode *)pgn, (GNode *)cgn);
433 * cgn The .USE node
446 Make_HandleUse(GNode *cgn, GNode *pgn)
451 if ((cgn
442 Make_HandleUse(GNode *cgn, GNode *pgn) argument
529 GNode *cgn = (GNode *)cgnp; local
680 Make_Update(GNode *cgn) argument
869 GNode *cgn = (GNode *)cgnp; local
885 GNode *cgn = (GNode *)cgnp; local
1405 GNode *cgn; /* Each child in turn */ local
[all...]
H A Dsuff.c1534 GNode *cgn = (GNode *)Lst_Datum(cln);
1538 if (!Lst_IsEmpty(cgn->order_pred) || !Lst_IsEmpty(cgn->order_succ))
1542 if (cgn->type & OP_WAIT)
1552 if (strchr(cgn->name, '$') == NULL) {
1558 fprintf(debug_file, "Expanding \"%s\"...", cgn->name);
1560 cp = Var_Subst(NULL, cgn->name, pgn, VARF_UNDEFERR|VARF_WANTRES);
1565 if (cgn->type & OP_ARCHV) {
1675 Lst_Remove(cgn->parents, Lst_Member(cgn
1533 GNode *cgn = (GNode *)Lst_Datum(cln); local
1680 GNode *cgn = (GNode *)Lst_Datum(cln); local
[all...]
H A Dtarg.c821 GNode *cgn = (GNode *)cgnp; local
824 cgn->type |= pgn->type & ~OP_OPMASK;
H A Dparse.c845 * New elements are added to the parents list of cgn and the
846 * children list of cgn. the unmade field of pgn is updated
854 GNode *cgn = (GNode *)cgnp; local
858 (void)Lst_AtEnd(pgn->children, cgn);
860 (void)Lst_AtEnd(cgn->parents, pgn);
864 pgn->name, cgn->name);
866 Targ_PrintNode(cgn, 0);
/freebsd-11.0-release/usr.sbin/pmcstat/
H A Dpmcpl_callgraph.c255 struct pmcstat_cgnode **sortbuffer, **cgn, *pcg; local
301 cgn = sortbuffer;
304 *cgn++ = pcg;
306 assert(cgn - sortbuffer == (int) cg->pcg_nchildren);
311 for (cgn = sortbuffer, n = 0; n < cg->pcg_nchildren; n++, cgn++)
312 pmcstat_cgnode_print(*cgn, depth+1, cg->pcg_count);
406 struct pmcstat_cgnode **sortbuffer, **cgn; local
422 cgn = sortbuffer;
428 *cgn
477 struct pmcstat_cgnode **sortbuffer, **cgn, *pcg; local
581 struct pmcstat_cgnode **sortbuffer, **cgn; local
[all...]

Completed in 117 milliseconds