#include <df.h>
◆ pred()
◆ set_pred()
◆ unionfind_root()
Web construction code for GNU compiler.
Contributed by Jan Hubicka.
Copyright (C) 2001-2024 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().
◆ unionfind_union
Union sets.
Return true if FIRST and SECOND points to the same web entry structure and
nothing is done. Otherwise, return false.
◆ pred_pvt
The documentation for this struct was generated from the following files: