Lines Matching refs:nodes
79 This function is responsible for lowering tree nodes not understood by
81 callgraph and varpool nodes referenced by the as needed.
180 /* Records tree nodes seen in record_reference. Simply using
507 /* Since we reclaim unreachable nodes at the end of every language
703 /* Verify cgraph nodes of given cgraph node. */
786 /* The nodes we're interested in are never shared, so walk
987 /* Look for externally_visible and used attributes and mark cgraph nodes
990 We cannot mark the nodes at the point the attributes are processed (in
1001 Furthermore, we can't mark these nodes in cgraph_finalize_function because:
1008 So, we walk the nodes at the end of the translation unit, applying the
1072 /* Keep track of already processed nodes when called multiple times for
1291 Attempt to topologically sort the nodes so function is output when
1367 struct cgraph_order_sort *nodes;
1375 nodes = (struct cgraph_order_sort *) alloca (size);
1376 memset (nodes, 0, size);
1385 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1386 nodes[i].kind = ORDER_FUNCTION;
1387 nodes[i].u.f = pf;
1394 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1395 nodes[i].kind = ORDER_VAR;
1396 nodes[i].u.v = pv;
1402 gcc_assert (nodes[i].kind == ORDER_UNDEFINED);
1403 nodes[i].kind = ORDER_ASM;
1404 nodes[i].u.a = pa;
1409 switch (nodes[i].kind)
1412 nodes[i].u.f->output = 0;
1413 cgraph_expand_function (nodes[i].u.f);
1417 cgraph_varpool_assemble_decl (nodes[i].u.v);
1421 assemble_asm (nodes[i].u.a->asm_str);
1631 internal_error ("nodes with no released memory found");
1846 TREE_MAP is a mapping of tree nodes we want to replace with