| /freebsd-10.1-release/usr.bin/make/ |
| H A D | make.c | 114 Make_TimeStamp(GNode *pgn, GNode *cgn) argument
117 if (cgn->mtime > pgn->cmtime) {
118 pgn->cmtime = cgn->mtime;
119 pgn->cmtime_gn = cgn;
291 Make_HandleUse(GNode *cgn, GNode *pgn) argument
296 if (cgn->type & (OP_USE | OP_TRANSFORM)) {
297 if ((cgn->type & OP_USE) || Lst_IsEmpty(&pgn->commands)) {
302 Lst_Concat(&pgn->commands, &cgn->commands, LST_CONCNEW);
305 for (ln = Lst_First(&cgn->children); ln != NULL;
316 pgn->type |= cgn
355 Make_Update(GNode *cgn) argument
506 GNode *cgn; local
728 GNode *cgn; local
[all...] |
| H A D | parse.c | 430 * New elements are added to the parents lists of cgn and the
431 * children list of cgn. the unmade field of pgn is updated
436 ParseLinkSrc(Lst *parents, GNode *cgn) argument
443 if (Lst_Member(&pgn->children, cgn) == NULL) {
444 Lst_AtEnd(&pgn->children, cgn);
446 Lst_AtEnd(&cgn->parents, pgn);
|
| H A D | main.c | 845 GNode *cgn = Lst_Datum(ln);
848 Lst_EnQueue(&cleanup, cgn);
|
| /freebsd-10.1-release/contrib/gcc/ |
| H A D | c-gimplify.c | 82 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 D | tree-nested.c | 749 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 D | gimplify.c | 890 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 D | c-decl.c | 7284 struct cgraph_node *cgn;
7294 cgn = cgraph_node (fndecl);
7295 for (cgn = cgn->nested; cgn ; cgn = cgn->next_nested)
7296 c_gimple_diagnostics_recursively (cgn->decl);
7256 struct cgraph_node *cgn; local
|
| /freebsd-10.1-release/contrib/bmake/ |
| H A D | make.c | 162 * 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
530 GNode *cgn = (GNode *)cgnp; local
681 Make_Update(GNode *cgn) argument
872 GNode *cgn = (GNode *)cgnp; local
888 GNode *cgn = (GNode *)cgnp; local
1411 GNode *cgn; /* Each child in turn */ local
[all...] |
| H A D | suff.c | 1521 GNode *cgn = (GNode *)Lst_Datum(cln);
1525 if (!Lst_IsEmpty(cgn->order_pred) || !Lst_IsEmpty(cgn->order_succ))
1529 if (cgn->type & OP_WAIT)
1539 if (strchr(cgn->name, '$') == NULL) {
1545 fprintf(debug_file, "Expanding \"%s\"...", cgn->name);
1547 cp = Var_Subst(NULL, cgn->name, pgn, TRUE);
1552 if (cgn->type & OP_ARCHV) {
1662 Lst_Remove(cgn->parents, Lst_Member(cgn
1520 GNode *cgn = (GNode *)Lst_Datum(cln); local
1667 GNode *cgn = (GNode *)Lst_Datum(cln); local
[all...] |
| H A D | targ.c | 823 GNode *cgn = (GNode *)cgnp; local
826 cgn->type |= pgn->type & ~OP_OPMASK;
|
| H A D | parse.c | 840 * New elements are added to the parents list of cgn and the
841 * children list of cgn. the unmade field of pgn is updated
849 GNode *cgn = (GNode *)cgnp; local
853 (void)Lst_AtEnd(pgn->children, cgn);
855 (void)Lst_AtEnd(cgn->parents, pgn);
858 fprintf(debug_file, "# ParseLinkSrc: added child %s - %s\n", pgn->name, cgn->name);
860 Targ_PrintNode(cgn, 0);
|
| /freebsd-10.1-release/usr.sbin/pmcstat/ |
| H A D | pmcpl_callgraph.c | 255 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...] |