113   cgraph_node *cnode = dyn_cast <cgraph_node *> (node);  in possible_inline_candidate_p()  local
114   if (!cnode)  in possible_inline_candidate_p()
116   if (DECL_UNINLINABLE (cnode->decl))  in possible_inline_candidate_p()
118   if (opt_for_fn (cnode->decl, optimize))  in possible_inline_candidate_p()
415       if (cgraph_node *cnode = dyn_cast <cgraph_node *> (node))  in remove_unreachable_nodes()  local
423 	      if (opt_for_fn (cnode->decl, optimize)  in remove_unreachable_nodes()
424 		  && opt_for_fn (cnode->decl, flag_devirtualize))  in remove_unreachable_nodes()
427 		  for (e = cnode->indirect_calls; e; e = next)  in remove_unreachable_nodes()
435 	      for (e = cnode->callees; e; e = e->next_callee)  in remove_unreachable_nodes()
458 	      if (cnode->inlined_to)  in remove_unreachable_nodes()
459 	        body_needed_for_clonning.add (cnode->decl);  in remove_unreachable_nodes()
463 	      while (cnode->clone_of)  in remove_unreachable_nodes()
465 		  bool noninline = cnode->clone_of->decl != cnode->decl;  in remove_unreachable_nodes()
466 		  cnode = cnode->clone_of;  in remove_unreachable_nodes()
469 		      body_needed_for_clonning.add (cnode->decl);  in remove_unreachable_nodes()
470 		      enqueue_node (cnode, &first, &reachable);  in remove_unreachable_nodes()
475 	  else if (cnode->thunk.thunk_p)  in remove_unreachable_nodes()
476 	    enqueue_node (cnode->callees->callee, &first, &reachable);  in remove_unreachable_nodes()
480 	  if (cnode->simd_clones)  in remove_unreachable_nodes()
483 	      for (next = cnode->simd_clones;  in remove_unreachable_nodes()
1421       struct cgraph_node *cnode = dyn_cast <cgraph_node *> (ref->referring);  in propagate_single_user()  local
1422       if (cnode)  in propagate_single_user()
1424 	  if (cnode->inlined_to)  in propagate_single_user()
1425 	    cnode = cnode->inlined_to;  in propagate_single_user()
1427 	    function = cnode;  in propagate_single_user()
1428 	  else if (function != cnode)  in propagate_single_user()