GCC Middle and Back End API Reference
web_entry_base Struct Reference

#include <df.h>

Inheritance diagram for web_entry_base:
Collaboration diagram for web_entry_base:

Public Member Functions

web_entry_basepred ()
 
void set_pred (web_entry_base *p)
 
web_entry_baseunionfind_root ()
 

Private Attributes

web_entry_basepred_pvt
 

Friends

bool unionfind_union (web_entry_base *first, web_entry_base *second)
 

Detailed Description

web

Member Function Documentation

◆ pred()

web_entry_base * web_entry_base::pred ( )
inline

References pred_pvt.

Referenced by unionfind_root().

◆ set_pred()

void web_entry_base::set_pred ( web_entry_base * p)
inline

References pred_pvt.

Referenced by unionfind_union.

◆ unionfind_root()

web_entry_base * web_entry_base::unionfind_root ( )
Web construction code for GNU compiler. Contributed by Jan Hubicka. Copyright (C) 2001-2025 Free Software Foundation, Inc. This file is part of GCC. GCC is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 3, or (at your option) any later version. GCC is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with GCC; see the file COPYING3. If not see <http://www.gnu.org/licenses/>.
Simple optimization pass that splits independent uses of each pseudo, increasing effectiveness of other optimizations. The optimization can serve as an example of use for the dataflow module. TODO - We may use profile information and ignore infrequent use for the purpose of web unifying, inserting the compensation code later to implement full induction variable expansion for loops (currently we expand only if the induction variable is dead afterward, which is often the case).
Find the root of unionfind tree (the representative of set).

References pred().

Referenced by entry_register(), and unionfind_union.

Friends And Related Symbol Documentation

◆ unionfind_union

bool unionfind_union ( web_entry_base * first,
web_entry_base * second )
friend
Union sets. Return true if FIRST and SECOND points to the same web entry structure and nothing is done. Otherwise, return false.

References set_pred(), and unionfind_root().

Field Documentation

◆ pred_pvt

web_entry_base* web_entry_base::pred_pvt
private

Referenced by pred(), and set_pred().


The documentation for this struct was generated from the following files: