Lines Matching defs:node

112 get_reference_vars_info_from_cgraph (struct cgraph_node * node)
114 return get_function_ann (node->decl)->reference_vars_info;
433 parameter is the tree node for the caller and the second operand is
434 the tree node for the entire call expression. */
585 /* Lookup the tree node for the static variable that has UID. */
596 /* Lookup the tree node for the static variable that has UID and
643 /* Skip bitmaps that are pointer equal to node's bitmap
661 /* Skip bitmaps that are pointer equal to node's bitmap
746 struct cgraph_node *node;
758 for (node = cgraph_nodes; node; node = node->next)
759 has_proper_scope_for_analysis (node->decl);
897 struct cgraph_node *node;
922 for (node = cgraph_nodes; node; node = node->next)
923 if (node->analyzed
924 && (cgraph_is_master_clone (node)
925 || (cgraph_function_body_availability (node)
927 analyze_function (node);
1013 node = order[i];
1014 l = get_reference_vars_info_from_cgraph (node)->local;
1039 node = order[i];
1040 l = get_reference_vars_info_from_cgraph (node)->local;
1043 cgraph_node_name (node), node->uid);
1080 node = order[i];
1081 node_info = get_reference_vars_info_from_cgraph (node);
1084 dump_cgraph_node (stderr, node);
1095 /* If any node in a cycle is calls_read_all or calls_write_all
1097 w_info = node->aux;
1129 w_info = node->aux;
1154 w = node;
1172 node = order[i];
1173 merge_callee_local_info (node, node);
1175 w_info = node->aux;
1196 node = order[i];
1197 node_info = get_reference_vars_info_from_cgraph (node);
1202 cgraph_node_name (node), node->uid);
1218 w_info = node->aux;
1269 node = order[i];
1270 node_info = get_reference_vars_info_from_cgraph (node);
1294 for (node = cgraph_nodes; node; node = node->next)
1298 if (node->aux)
1300 free (node->aux);
1301 node->aux = NULL;
1304 if (node->analyzed
1305 && (cgraph_function_body_availability (node) == AVAIL_OVERWRITABLE))
1306 clean_function (node);