| /src/usr.bin/make/ |
| compat.c | 510 GNode *cgn = ln->datum; local
511 Compat_Make(cgn, pgn);
|
| make.c | 221 GNode_UpdateYoungestChild(GNode *gn, GNode *cgn)
223 if (gn->youngestChild == NULL || cgn->mtime > gn->youngestChild->mtime)
224 gn->youngestChild = cgn;
388 GNode *cgn = ln->datum; local
390 /* This may also update cgn->path. */
391 Dir_UpdateMTime(cgn, false);
392 GNode_UpdateYoungestChild(pgn, cgn);
407 * cgn The source node, which is either a .USE/.USEBEFORE
412 Make_HandleUse(GNode *cgn, GNode *pgn)
417 if (!(cgn->type & (OP_USE | OP_USEBEFORE | OP_TRANSFORM)))
1341 GNode *cgn = ln->datum; local
1371 GNode *cgn = ln->datum; local
[all...] |
| suff.c | 1206 GNode *cgn = cln->datum; local
1209 if (!Dir_HasWildcards(cgn->name))
1214 SearchPath_Expand(Suff_FindPath(cgn), cgn->name, &expansions);
1243 Lst_Remove(&cgn->parents, Lst_FindDatum(&cgn->parents, pgn));
1323 GNode *cgn = cln->datum; local
1326 if (!Lst_IsEmpty(&cgn->order_pred) || !Lst_IsEmpty(&cgn->order_succ))
1330 if (cgn->type & OP_WAIT
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/c-family/ |
| c-gimplify.cc | 572 struct cgraph_node *cgn; local
620 cgn = cgraph_node::get_create (fndecl);
621 for (cgn = first_nested_function (cgn);
622 cgn; cgn = next_nested_function (cgn))
623 c_genericize (cgn->decl);
|
| /src/external/gpl3/gcc/dist/gcc/c-family/ |
| c-gimplify.cc | 658 struct cgraph_node *cgn; local
708 cgn = cgraph_node::get_create (fndecl);
709 for (cgn = first_nested_function (cgn);
710 cgn; cgn = next_nested_function (cgn))
711 c_genericize (cgn->decl);
|
| /src/sbin/resize_ffs/ |
| resize_ffs.c | 463 initcg(uint32_t cgn)
474 cg = cgs[cgn];
476 base = cgbase(newsb, cgn);
477 dlow = cgsblock(newsb, cgn) - base;
478 dhigh = cgdmin(newsb, cgn) - base;
493 cg->cg_cgx = cgn;
511 if (cgn == newsb->fs_ncg - 1) {
618 csums[cgn] = cg->cg_cs;
624 writeat(FFS_FSBTODB(newsb, cgimin(newsb, cgn)), zinodes2,
628 writeat(FFS_FSBTODB(newsb, cgimin(newsb, cgn)), zinodes1
661 uint32_t cgn; \/* number of cg hand currently points into *\/ local
714 uint32_t cgn; \/* cg number of cg hand points into *\/ local
757 uint32_t cgn; \/* cg number of cg hand points into *\/ local
793 int cgn; local
806 int cgn; local
830 int cgn; \/* cg number, used when shrinking *\/ local
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| tree-nested.cc | 925 struct cgraph_node *cgn = cgraph_node::get (fndecl); local
928 for (cgn = first_nested_function (cgn); cgn;
929 cgn = next_nested_function (cgn))
931 for (arg = DECL_ARGUMENTS (cgn->decl); arg; arg = DECL_CHAIN (arg))
935 if (check_for_nested_with_variably_modified (cgn->decl,
944 tree rooted by CGN. */
947 create_nesting_tree (struct cgraph_node *cgn)
3815 struct cgraph_node *cgn; local
[all...] |
| omp-offload.cc | 353 struct cgraph_node *cgn; local
362 for (cgn = first_nested_function (node);
363 cgn; cgn = next_nested_function (cgn))
364 if (omp_declare_target_fn_p (cgn->decl))
365 worklist.safe_push (cgn->decl);
366 else if (DECL_STRUCT_FUNCTION (cgn->decl)
367 && DECL_STRUCT_FUNCTION (cgn->decl)->has_omp_target)
368 worklist.safe_push (cgn->decl)
[all...] |
| gimplify.cc | 993 struct cgraph_node *cgn = cgraph_node::get (fndecl);
1005 if (cgn)
1006 for (cgn = first_nested_function (cgn); cgn;
1007 cgn = next_nested_function (cgn))
1008 unshare_body (cgn->decl);
1043 struct cgraph_node *cgn = cgraph_node::get (fndecl);
1049 if (cgn)
992 struct cgraph_node *cgn = cgraph_node::get (fndecl); local
1042 struct cgraph_node *cgn = cgraph_node::get (fndecl); local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| omp-offload.cc | 352 struct cgraph_node *cgn; local
358 for (cgn = first_nested_function (node);
359 cgn; cgn = next_nested_function (cgn))
360 if (omp_declare_target_fn_p (cgn->decl))
361 worklist.safe_push (cgn->decl);
362 else if (DECL_STRUCT_FUNCTION (cgn->decl)
363 && DECL_STRUCT_FUNCTION (cgn->decl)->has_omp_target)
364 worklist.safe_push (cgn->decl)
[all...] |
| tree-nested.cc | 917 struct cgraph_node *cgn = cgraph_node::get (fndecl); local
920 for (cgn = first_nested_function (cgn); cgn;
921 cgn = next_nested_function (cgn))
923 for (arg = DECL_ARGUMENTS (cgn->decl); arg; arg = DECL_CHAIN (arg))
927 if (check_for_nested_with_variably_modified (cgn->decl,
936 tree rooted by CGN. */
939 create_nesting_tree (struct cgraph_node *cgn)
3721 struct cgraph_node *cgn; local
[all...] |
| gimplify.cc | 962 struct cgraph_node *cgn = cgraph_node::get (fndecl);
974 if (cgn)
975 for (cgn = first_nested_function (cgn); cgn;
976 cgn = next_nested_function (cgn))
977 unshare_body (cgn->decl);
1012 struct cgraph_node *cgn = cgraph_node::get (fndecl);
1018 if (cgn)
961 struct cgraph_node *cgn = cgraph_node::get (fndecl); local
1011 struct cgraph_node *cgn = cgraph_node::get (fndecl); local
[all...] |
