58 	cgraph_node_ptr node;  in add_stack_tracking_gcall()  local
71 	node = cgraph_get_create_node(track_function_decl);  in add_stack_tracking_gcall()
72 	gcc_assert(node);  in add_stack_tracking_gcall()
73 	cgraph_create_edge(cgraph_get_node(current_function_decl), node,  in add_stack_tracking_gcall()
91 	varpool_node_ptr node;  in get_current_stack_pointer_decl()  local
93 	FOR_EACH_VARIABLE(node) {  in get_current_stack_pointer_decl()
94 		tree var = NODE_DECL(node);  in get_current_stack_pointer_decl()
436 static inline bool string_equal(tree node, const char *string, int length)  in string_equal()  argument
438 	if (TREE_STRING_LENGTH(node) < length)  in string_equal()
440 	if (TREE_STRING_LENGTH(node) > length + 1)  in string_equal()
442 	if (TREE_STRING_LENGTH(node) == length + 1 &&  in string_equal()
443 	    TREE_STRING_POINTER(node)[length] != '\0')  in string_equal()
445 	return !memcmp(TREE_STRING_POINTER(node), string, length);  in string_equal()
447 #define STRING_EQUAL(node, str)	string_equal(node, str, strlen(str))  argument