/* Inline functions for tree-flow.h
|
/* Inline functions for tree-flow.h
|
Copyright (C) 2001, 2003, 2005, 2006, 2007, 2008, 2010
|
Copyright (C) 2001, 2003, 2005, 2006, 2007, 2008, 2010
|
Free Software Foundation, Inc.
|
Free Software Foundation, Inc.
|
Contributed by Diego Novillo <dnovillo@redhat.com>
|
Contributed by Diego Novillo <dnovillo@redhat.com>
|
|
|
This file is part of GCC.
|
This file is part of GCC.
|
|
|
GCC is free software; you can redistribute it and/or modify
|
GCC is free software; you can redistribute it and/or modify
|
it under the terms of the GNU General Public License as published by
|
it under the terms of the GNU General Public License as published by
|
the Free Software Foundation; either version 3, or (at your option)
|
the Free Software Foundation; either version 3, or (at your option)
|
any later version.
|
any later version.
|
|
|
GCC is distributed in the hope that it will be useful,
|
GCC is distributed in the hope that it will be useful,
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
GNU General Public License for more details.
|
GNU General Public License for more details.
|
|
|
You should have received a copy of the GNU General Public License
|
You should have received a copy of the GNU General Public License
|
along with GCC; see the file COPYING3. If not see
|
along with GCC; see the file COPYING3. If not see
|
<http://www.gnu.org/licenses/>. */
|
<http://www.gnu.org/licenses/>. */
|
|
|
#ifndef _TREE_FLOW_INLINE_H
|
#ifndef _TREE_FLOW_INLINE_H
|
#define _TREE_FLOW_INLINE_H 1
|
#define _TREE_FLOW_INLINE_H 1
|
|
|
/* Inline functions for manipulating various data structures defined in
|
/* Inline functions for manipulating various data structures defined in
|
tree-flow.h. See tree-flow.h for documentation. */
|
tree-flow.h. See tree-flow.h for documentation. */
|
|
|
/* Return true when gimple SSA form was built.
|
/* Return true when gimple SSA form was built.
|
gimple_in_ssa_p is queried by gimplifier in various early stages before SSA
|
gimple_in_ssa_p is queried by gimplifier in various early stages before SSA
|
infrastructure is initialized. Check for presence of the datastructures
|
infrastructure is initialized. Check for presence of the datastructures
|
at first place. */
|
at first place. */
|
static inline bool
|
static inline bool
|
gimple_in_ssa_p (const struct function *fun)
|
gimple_in_ssa_p (const struct function *fun)
|
{
|
{
|
return fun && fun->gimple_df && fun->gimple_df->in_ssa_p;
|
return fun && fun->gimple_df && fun->gimple_df->in_ssa_p;
|
}
|
}
|
|
|
/* Array of all variables referenced in the function. */
|
/* Array of all variables referenced in the function. */
|
static inline htab_t
|
static inline htab_t
|
gimple_referenced_vars (const struct function *fun)
|
gimple_referenced_vars (const struct function *fun)
|
{
|
{
|
if (!fun->gimple_df)
|
if (!fun->gimple_df)
|
return NULL;
|
return NULL;
|
return fun->gimple_df->referenced_vars;
|
return fun->gimple_df->referenced_vars;
|
}
|
}
|
|
|
/* Artificial variable used for the virtual operand FUD chain. */
|
/* Artificial variable used for the virtual operand FUD chain. */
|
static inline tree
|
static inline tree
|
gimple_vop (const struct function *fun)
|
gimple_vop (const struct function *fun)
|
{
|
{
|
gcc_assert (fun && fun->gimple_df);
|
gcc_assert (fun && fun->gimple_df);
|
return fun->gimple_df->vop;
|
return fun->gimple_df->vop;
|
}
|
}
|
|
|
/* Initialize the hashtable iterator HTI to point to hashtable TABLE */
|
/* Initialize the hashtable iterator HTI to point to hashtable TABLE */
|
|
|
static inline void *
|
static inline void *
|
first_htab_element (htab_iterator *hti, htab_t table)
|
first_htab_element (htab_iterator *hti, htab_t table)
|
{
|
{
|
hti->htab = table;
|
hti->htab = table;
|
hti->slot = table->entries;
|
hti->slot = table->entries;
|
hti->limit = hti->slot + htab_size (table);
|
hti->limit = hti->slot + htab_size (table);
|
do
|
do
|
{
|
{
|
PTR x = *(hti->slot);
|
PTR x = *(hti->slot);
|
if (x != HTAB_EMPTY_ENTRY && x != HTAB_DELETED_ENTRY)
|
if (x != HTAB_EMPTY_ENTRY && x != HTAB_DELETED_ENTRY)
|
break;
|
break;
|
} while (++(hti->slot) < hti->limit);
|
} while (++(hti->slot) < hti->limit);
|
|
|
if (hti->slot < hti->limit)
|
if (hti->slot < hti->limit)
|
return *(hti->slot);
|
return *(hti->slot);
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Return current non-empty/deleted slot of the hashtable pointed to by HTI,
|
/* Return current non-empty/deleted slot of the hashtable pointed to by HTI,
|
or NULL if we have reached the end. */
|
or NULL if we have reached the end. */
|
|
|
static inline bool
|
static inline bool
|
end_htab_p (const htab_iterator *hti)
|
end_htab_p (const htab_iterator *hti)
|
{
|
{
|
if (hti->slot >= hti->limit)
|
if (hti->slot >= hti->limit)
|
return true;
|
return true;
|
return false;
|
return false;
|
}
|
}
|
|
|
/* Advance the hashtable iterator pointed to by HTI to the next element of the
|
/* Advance the hashtable iterator pointed to by HTI to the next element of the
|
hashtable. */
|
hashtable. */
|
|
|
static inline void *
|
static inline void *
|
next_htab_element (htab_iterator *hti)
|
next_htab_element (htab_iterator *hti)
|
{
|
{
|
while (++(hti->slot) < hti->limit)
|
while (++(hti->slot) < hti->limit)
|
{
|
{
|
PTR x = *(hti->slot);
|
PTR x = *(hti->slot);
|
if (x != HTAB_EMPTY_ENTRY && x != HTAB_DELETED_ENTRY)
|
if (x != HTAB_EMPTY_ENTRY && x != HTAB_DELETED_ENTRY)
|
return x;
|
return x;
|
};
|
};
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
/* Initialize ITER to point to the first referenced variable in the
|
/* Initialize ITER to point to the first referenced variable in the
|
referenced_vars hashtable, and return that variable. */
|
referenced_vars hashtable, and return that variable. */
|
|
|
static inline tree
|
static inline tree
|
first_referenced_var (referenced_var_iterator *iter)
|
first_referenced_var (referenced_var_iterator *iter)
|
{
|
{
|
return (tree) first_htab_element (&iter->hti,
|
return (tree) first_htab_element (&iter->hti,
|
gimple_referenced_vars (cfun));
|
gimple_referenced_vars (cfun));
|
}
|
}
|
|
|
/* Return true if we have hit the end of the referenced variables ITER is
|
/* Return true if we have hit the end of the referenced variables ITER is
|
iterating through. */
|
iterating through. */
|
|
|
static inline bool
|
static inline bool
|
end_referenced_vars_p (const referenced_var_iterator *iter)
|
end_referenced_vars_p (const referenced_var_iterator *iter)
|
{
|
{
|
return end_htab_p (&iter->hti);
|
return end_htab_p (&iter->hti);
|
}
|
}
|
|
|
/* Make ITER point to the next referenced_var in the referenced_var hashtable,
|
/* Make ITER point to the next referenced_var in the referenced_var hashtable,
|
and return that variable. */
|
and return that variable. */
|
|
|
static inline tree
|
static inline tree
|
next_referenced_var (referenced_var_iterator *iter)
|
next_referenced_var (referenced_var_iterator *iter)
|
{
|
{
|
return (tree) next_htab_element (&iter->hti);
|
return (tree) next_htab_element (&iter->hti);
|
}
|
}
|
|
|
/* Return the variable annotation for T, which must be a _DECL node.
|
/* Return the variable annotation for T, which must be a _DECL node.
|
Return NULL if the variable annotation doesn't already exist. */
|
Return NULL if the variable annotation doesn't already exist. */
|
static inline var_ann_t
|
static inline var_ann_t
|
var_ann (const_tree t)
|
var_ann (const_tree t)
|
{
|
{
|
const var_ann_t *p = DECL_VAR_ANN_PTR (t);
|
const var_ann_t *p = DECL_VAR_ANN_PTR (t);
|
return p ? *p : NULL;
|
return p ? *p : NULL;
|
}
|
}
|
|
|
/* Return the variable annotation for T, which must be a _DECL node.
|
/* Return the variable annotation for T, which must be a _DECL node.
|
Create the variable annotation if it doesn't exist. */
|
Create the variable annotation if it doesn't exist. */
|
static inline var_ann_t
|
static inline var_ann_t
|
get_var_ann (tree var)
|
get_var_ann (tree var)
|
{
|
{
|
var_ann_t *p = DECL_VAR_ANN_PTR (var);
|
var_ann_t *p = DECL_VAR_ANN_PTR (var);
|
gcc_assert (p);
|
gcc_assert (p);
|
return *p ? *p : create_var_ann (var);
|
return *p ? *p : create_var_ann (var);
|
}
|
}
|
|
|
/* Get the number of the next statement uid to be allocated. */
|
/* Get the number of the next statement uid to be allocated. */
|
static inline unsigned int
|
static inline unsigned int
|
gimple_stmt_max_uid (struct function *fn)
|
gimple_stmt_max_uid (struct function *fn)
|
{
|
{
|
return fn->last_stmt_uid;
|
return fn->last_stmt_uid;
|
}
|
}
|
|
|
/* Set the number of the next statement uid to be allocated. */
|
/* Set the number of the next statement uid to be allocated. */
|
static inline void
|
static inline void
|
set_gimple_stmt_max_uid (struct function *fn, unsigned int maxid)
|
set_gimple_stmt_max_uid (struct function *fn, unsigned int maxid)
|
{
|
{
|
fn->last_stmt_uid = maxid;
|
fn->last_stmt_uid = maxid;
|
}
|
}
|
|
|
/* Set the number of the next statement uid to be allocated. */
|
/* Set the number of the next statement uid to be allocated. */
|
static inline unsigned int
|
static inline unsigned int
|
inc_gimple_stmt_max_uid (struct function *fn)
|
inc_gimple_stmt_max_uid (struct function *fn)
|
{
|
{
|
return fn->last_stmt_uid++;
|
return fn->last_stmt_uid++;
|
}
|
}
|
|
|
/* Return the line number for EXPR, or return -1 if we have no line
|
/* Return the line number for EXPR, or return -1 if we have no line
|
number information for it. */
|
number information for it. */
|
static inline int
|
static inline int
|
get_lineno (const_gimple stmt)
|
get_lineno (const_gimple stmt)
|
{
|
{
|
location_t loc;
|
location_t loc;
|
|
|
if (!stmt)
|
if (!stmt)
|
return -1;
|
return -1;
|
|
|
loc = gimple_location (stmt);
|
loc = gimple_location (stmt);
|
if (loc == UNKNOWN_LOCATION)
|
if (loc == UNKNOWN_LOCATION)
|
return -1;
|
return -1;
|
|
|
return LOCATION_LINE (loc);
|
return LOCATION_LINE (loc);
|
}
|
}
|
|
|
/* Delink an immediate_uses node from its chain. */
|
/* Delink an immediate_uses node from its chain. */
|
static inline void
|
static inline void
|
delink_imm_use (ssa_use_operand_t *linknode)
|
delink_imm_use (ssa_use_operand_t *linknode)
|
{
|
{
|
/* Return if this node is not in a list. */
|
/* Return if this node is not in a list. */
|
if (linknode->prev == NULL)
|
if (linknode->prev == NULL)
|
return;
|
return;
|
|
|
linknode->prev->next = linknode->next;
|
linknode->prev->next = linknode->next;
|
linknode->next->prev = linknode->prev;
|
linknode->next->prev = linknode->prev;
|
linknode->prev = NULL;
|
linknode->prev = NULL;
|
linknode->next = NULL;
|
linknode->next = NULL;
|
}
|
}
|
|
|
/* Link ssa_imm_use node LINKNODE into the chain for LIST. */
|
/* Link ssa_imm_use node LINKNODE into the chain for LIST. */
|
static inline void
|
static inline void
|
link_imm_use_to_list (ssa_use_operand_t *linknode, ssa_use_operand_t *list)
|
link_imm_use_to_list (ssa_use_operand_t *linknode, ssa_use_operand_t *list)
|
{
|
{
|
/* Link the new node at the head of the list. If we are in the process of
|
/* Link the new node at the head of the list. If we are in the process of
|
traversing the list, we won't visit any new nodes added to it. */
|
traversing the list, we won't visit any new nodes added to it. */
|
linknode->prev = list;
|
linknode->prev = list;
|
linknode->next = list->next;
|
linknode->next = list->next;
|
list->next->prev = linknode;
|
list->next->prev = linknode;
|
list->next = linknode;
|
list->next = linknode;
|
}
|
}
|
|
|
/* Link ssa_imm_use node LINKNODE into the chain for DEF. */
|
/* Link ssa_imm_use node LINKNODE into the chain for DEF. */
|
static inline void
|
static inline void
|
link_imm_use (ssa_use_operand_t *linknode, tree def)
|
link_imm_use (ssa_use_operand_t *linknode, tree def)
|
{
|
{
|
ssa_use_operand_t *root;
|
ssa_use_operand_t *root;
|
|
|
if (!def || TREE_CODE (def) != SSA_NAME)
|
if (!def || TREE_CODE (def) != SSA_NAME)
|
linknode->prev = NULL;
|
linknode->prev = NULL;
|
else
|
else
|
{
|
{
|
root = &(SSA_NAME_IMM_USE_NODE (def));
|
root = &(SSA_NAME_IMM_USE_NODE (def));
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
if (linknode->use)
|
if (linknode->use)
|
gcc_assert (*(linknode->use) == def);
|
gcc_assert (*(linknode->use) == def);
|
#endif
|
#endif
|
link_imm_use_to_list (linknode, root);
|
link_imm_use_to_list (linknode, root);
|
}
|
}
|
}
|
}
|
|
|
/* Set the value of a use pointed to by USE to VAL. */
|
/* Set the value of a use pointed to by USE to VAL. */
|
static inline void
|
static inline void
|
set_ssa_use_from_ptr (use_operand_p use, tree val)
|
set_ssa_use_from_ptr (use_operand_p use, tree val)
|
{
|
{
|
delink_imm_use (use);
|
delink_imm_use (use);
|
*(use->use) = val;
|
*(use->use) = val;
|
link_imm_use (use, val);
|
link_imm_use (use, val);
|
}
|
}
|
|
|
/* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
|
/* Link ssa_imm_use node LINKNODE into the chain for DEF, with use occurring
|
in STMT. */
|
in STMT. */
|
static inline void
|
static inline void
|
link_imm_use_stmt (ssa_use_operand_t *linknode, tree def, gimple stmt)
|
link_imm_use_stmt (ssa_use_operand_t *linknode, tree def, gimple stmt)
|
{
|
{
|
if (stmt)
|
if (stmt)
|
link_imm_use (linknode, def);
|
link_imm_use (linknode, def);
|
else
|
else
|
link_imm_use (linknode, NULL);
|
link_imm_use (linknode, NULL);
|
linknode->loc.stmt = stmt;
|
linknode->loc.stmt = stmt;
|
}
|
}
|
|
|
/* Relink a new node in place of an old node in the list. */
|
/* Relink a new node in place of an old node in the list. */
|
static inline void
|
static inline void
|
relink_imm_use (ssa_use_operand_t *node, ssa_use_operand_t *old)
|
relink_imm_use (ssa_use_operand_t *node, ssa_use_operand_t *old)
|
{
|
{
|
/* The node one had better be in the same list. */
|
/* The node one had better be in the same list. */
|
gcc_assert (*(old->use) == *(node->use));
|
gcc_assert (*(old->use) == *(node->use));
|
node->prev = old->prev;
|
node->prev = old->prev;
|
node->next = old->next;
|
node->next = old->next;
|
if (old->prev)
|
if (old->prev)
|
{
|
{
|
old->prev->next = node;
|
old->prev->next = node;
|
old->next->prev = node;
|
old->next->prev = node;
|
/* Remove the old node from the list. */
|
/* Remove the old node from the list. */
|
old->prev = NULL;
|
old->prev = NULL;
|
}
|
}
|
}
|
}
|
|
|
/* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
|
/* Relink ssa_imm_use node LINKNODE into the chain for OLD, with use occurring
|
in STMT. */
|
in STMT. */
|
static inline void
|
static inline void
|
relink_imm_use_stmt (ssa_use_operand_t *linknode, ssa_use_operand_t *old,
|
relink_imm_use_stmt (ssa_use_operand_t *linknode, ssa_use_operand_t *old,
|
gimple stmt)
|
gimple stmt)
|
{
|
{
|
if (stmt)
|
if (stmt)
|
relink_imm_use (linknode, old);
|
relink_imm_use (linknode, old);
|
else
|
else
|
link_imm_use (linknode, NULL);
|
link_imm_use (linknode, NULL);
|
linknode->loc.stmt = stmt;
|
linknode->loc.stmt = stmt;
|
}
|
}
|
|
|
|
|
/* Return true is IMM has reached the end of the immediate use list. */
|
/* Return true is IMM has reached the end of the immediate use list. */
|
static inline bool
|
static inline bool
|
end_readonly_imm_use_p (const imm_use_iterator *imm)
|
end_readonly_imm_use_p (const imm_use_iterator *imm)
|
{
|
{
|
return (imm->imm_use == imm->end_p);
|
return (imm->imm_use == imm->end_p);
|
}
|
}
|
|
|
/* Initialize iterator IMM to process the list for VAR. */
|
/* Initialize iterator IMM to process the list for VAR. */
|
static inline use_operand_p
|
static inline use_operand_p
|
first_readonly_imm_use (imm_use_iterator *imm, tree var)
|
first_readonly_imm_use (imm_use_iterator *imm, tree var)
|
{
|
{
|
imm->end_p = &(SSA_NAME_IMM_USE_NODE (var));
|
imm->end_p = &(SSA_NAME_IMM_USE_NODE (var));
|
imm->imm_use = imm->end_p->next;
|
imm->imm_use = imm->end_p->next;
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
imm->iter_node.next = imm->imm_use->next;
|
imm->iter_node.next = imm->imm_use->next;
|
#endif
|
#endif
|
if (end_readonly_imm_use_p (imm))
|
if (end_readonly_imm_use_p (imm))
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
return imm->imm_use;
|
return imm->imm_use;
|
}
|
}
|
|
|
/* Bump IMM to the next use in the list. */
|
/* Bump IMM to the next use in the list. */
|
static inline use_operand_p
|
static inline use_operand_p
|
next_readonly_imm_use (imm_use_iterator *imm)
|
next_readonly_imm_use (imm_use_iterator *imm)
|
{
|
{
|
use_operand_p old = imm->imm_use;
|
use_operand_p old = imm->imm_use;
|
|
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
/* If this assertion fails, it indicates the 'next' pointer has changed
|
/* If this assertion fails, it indicates the 'next' pointer has changed
|
since the last bump. This indicates that the list is being modified
|
since the last bump. This indicates that the list is being modified
|
via stmt changes, or SET_USE, or somesuch thing, and you need to be
|
via stmt changes, or SET_USE, or somesuch thing, and you need to be
|
using the SAFE version of the iterator. */
|
using the SAFE version of the iterator. */
|
gcc_assert (imm->iter_node.next == old->next);
|
gcc_assert (imm->iter_node.next == old->next);
|
imm->iter_node.next = old->next->next;
|
imm->iter_node.next = old->next->next;
|
#endif
|
#endif
|
|
|
imm->imm_use = old->next;
|
imm->imm_use = old->next;
|
if (end_readonly_imm_use_p (imm))
|
if (end_readonly_imm_use_p (imm))
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
return imm->imm_use;
|
return imm->imm_use;
|
}
|
}
|
|
|
/* tree-cfg.c */
|
/* tree-cfg.c */
|
extern bool has_zero_uses_1 (const ssa_use_operand_t *head);
|
extern bool has_zero_uses_1 (const ssa_use_operand_t *head);
|
extern bool single_imm_use_1 (const ssa_use_operand_t *head,
|
extern bool single_imm_use_1 (const ssa_use_operand_t *head,
|
use_operand_p *use_p, gimple *stmt);
|
use_operand_p *use_p, gimple *stmt);
|
|
|
/* Return true if VAR has no nondebug uses. */
|
/* Return true if VAR has no nondebug uses. */
|
static inline bool
|
static inline bool
|
has_zero_uses (const_tree var)
|
has_zero_uses (const_tree var)
|
{
|
{
|
const ssa_use_operand_t *const ptr = &(SSA_NAME_IMM_USE_NODE (var));
|
const ssa_use_operand_t *const ptr = &(SSA_NAME_IMM_USE_NODE (var));
|
|
|
/* A single use_operand means there is no items in the list. */
|
/* A single use_operand means there is no items in the list. */
|
if (ptr == ptr->next)
|
if (ptr == ptr->next)
|
return true;
|
return true;
|
|
|
/* If there are debug stmts, we have to look at each use and see
|
/* If there are debug stmts, we have to look at each use and see
|
whether there are any nondebug uses. */
|
whether there are any nondebug uses. */
|
if (!MAY_HAVE_DEBUG_STMTS)
|
if (!MAY_HAVE_DEBUG_STMTS)
|
return false;
|
return false;
|
|
|
return has_zero_uses_1 (ptr);
|
return has_zero_uses_1 (ptr);
|
}
|
}
|
|
|
/* Return true if VAR has a single nondebug use. */
|
/* Return true if VAR has a single nondebug use. */
|
static inline bool
|
static inline bool
|
has_single_use (const_tree var)
|
has_single_use (const_tree var)
|
{
|
{
|
const ssa_use_operand_t *const ptr = &(SSA_NAME_IMM_USE_NODE (var));
|
const ssa_use_operand_t *const ptr = &(SSA_NAME_IMM_USE_NODE (var));
|
|
|
/* If there aren't any uses whatsoever, we're done. */
|
/* If there aren't any uses whatsoever, we're done. */
|
if (ptr == ptr->next)
|
if (ptr == ptr->next)
|
return false;
|
return false;
|
|
|
/* If there's a single use, check that it's not a debug stmt. */
|
/* If there's a single use, check that it's not a debug stmt. */
|
if (ptr == ptr->next->next)
|
if (ptr == ptr->next->next)
|
return !is_gimple_debug (USE_STMT (ptr->next));
|
return !is_gimple_debug (USE_STMT (ptr->next));
|
|
|
/* If there are debug stmts, we have to look at each of them. */
|
/* If there are debug stmts, we have to look at each of them. */
|
if (!MAY_HAVE_DEBUG_STMTS)
|
if (!MAY_HAVE_DEBUG_STMTS)
|
return false;
|
return false;
|
|
|
return single_imm_use_1 (ptr, NULL, NULL);
|
return single_imm_use_1 (ptr, NULL, NULL);
|
}
|
}
|
|
|
|
|
/* If VAR has only a single immediate nondebug use, return true, and
|
/* If VAR has only a single immediate nondebug use, return true, and
|
set USE_P and STMT to the use pointer and stmt of occurrence. */
|
set USE_P and STMT to the use pointer and stmt of occurrence. */
|
static inline bool
|
static inline bool
|
single_imm_use (const_tree var, use_operand_p *use_p, gimple *stmt)
|
single_imm_use (const_tree var, use_operand_p *use_p, gimple *stmt)
|
{
|
{
|
const ssa_use_operand_t *const ptr = &(SSA_NAME_IMM_USE_NODE (var));
|
const ssa_use_operand_t *const ptr = &(SSA_NAME_IMM_USE_NODE (var));
|
|
|
/* If there aren't any uses whatsoever, we're done. */
|
/* If there aren't any uses whatsoever, we're done. */
|
if (ptr == ptr->next)
|
if (ptr == ptr->next)
|
{
|
{
|
return_false:
|
return_false:
|
*use_p = NULL_USE_OPERAND_P;
|
*use_p = NULL_USE_OPERAND_P;
|
*stmt = NULL;
|
*stmt = NULL;
|
return false;
|
return false;
|
}
|
}
|
|
|
/* If there's a single use, check that it's not a debug stmt. */
|
/* If there's a single use, check that it's not a debug stmt. */
|
if (ptr == ptr->next->next)
|
if (ptr == ptr->next->next)
|
{
|
{
|
if (!is_gimple_debug (USE_STMT (ptr->next)))
|
if (!is_gimple_debug (USE_STMT (ptr->next)))
|
{
|
{
|
*use_p = ptr->next;
|
*use_p = ptr->next;
|
*stmt = ptr->next->loc.stmt;
|
*stmt = ptr->next->loc.stmt;
|
return true;
|
return true;
|
}
|
}
|
else
|
else
|
goto return_false;
|
goto return_false;
|
}
|
}
|
|
|
/* If there are debug stmts, we have to look at each of them. */
|
/* If there are debug stmts, we have to look at each of them. */
|
if (!MAY_HAVE_DEBUG_STMTS)
|
if (!MAY_HAVE_DEBUG_STMTS)
|
goto return_false;
|
goto return_false;
|
|
|
return single_imm_use_1 (ptr, use_p, stmt);
|
return single_imm_use_1 (ptr, use_p, stmt);
|
}
|
}
|
|
|
/* Return the number of nondebug immediate uses of VAR. */
|
/* Return the number of nondebug immediate uses of VAR. */
|
static inline unsigned int
|
static inline unsigned int
|
num_imm_uses (const_tree var)
|
num_imm_uses (const_tree var)
|
{
|
{
|
const ssa_use_operand_t *const start = &(SSA_NAME_IMM_USE_NODE (var));
|
const ssa_use_operand_t *const start = &(SSA_NAME_IMM_USE_NODE (var));
|
const ssa_use_operand_t *ptr;
|
const ssa_use_operand_t *ptr;
|
unsigned int num = 0;
|
unsigned int num = 0;
|
|
|
if (!MAY_HAVE_DEBUG_STMTS)
|
if (!MAY_HAVE_DEBUG_STMTS)
|
for (ptr = start->next; ptr != start; ptr = ptr->next)
|
for (ptr = start->next; ptr != start; ptr = ptr->next)
|
num++;
|
num++;
|
else
|
else
|
for (ptr = start->next; ptr != start; ptr = ptr->next)
|
for (ptr = start->next; ptr != start; ptr = ptr->next)
|
if (!is_gimple_debug (USE_STMT (ptr)))
|
if (!is_gimple_debug (USE_STMT (ptr)))
|
num++;
|
num++;
|
|
|
return num;
|
return num;
|
}
|
}
|
|
|
/* Return the tree pointed-to by USE. */
|
/* Return the tree pointed-to by USE. */
|
static inline tree
|
static inline tree
|
get_use_from_ptr (use_operand_p use)
|
get_use_from_ptr (use_operand_p use)
|
{
|
{
|
return *(use->use);
|
return *(use->use);
|
}
|
}
|
|
|
/* Return the tree pointed-to by DEF. */
|
/* Return the tree pointed-to by DEF. */
|
static inline tree
|
static inline tree
|
get_def_from_ptr (def_operand_p def)
|
get_def_from_ptr (def_operand_p def)
|
{
|
{
|
return *def;
|
return *def;
|
}
|
}
|
|
|
/* Return a use_operand_p pointer for argument I of PHI node GS. */
|
/* Return a use_operand_p pointer for argument I of PHI node GS. */
|
|
|
static inline use_operand_p
|
static inline use_operand_p
|
gimple_phi_arg_imm_use_ptr (gimple gs, int i)
|
gimple_phi_arg_imm_use_ptr (gimple gs, int i)
|
{
|
{
|
return &gimple_phi_arg (gs, i)->imm_use;
|
return &gimple_phi_arg (gs, i)->imm_use;
|
}
|
}
|
|
|
/* Return the tree operand for argument I of PHI node GS. */
|
/* Return the tree operand for argument I of PHI node GS. */
|
|
|
static inline tree
|
static inline tree
|
gimple_phi_arg_def (gimple gs, size_t index)
|
gimple_phi_arg_def (gimple gs, size_t index)
|
{
|
{
|
struct phi_arg_d *pd = gimple_phi_arg (gs, index);
|
struct phi_arg_d *pd = gimple_phi_arg (gs, index);
|
return get_use_from_ptr (&pd->imm_use);
|
return get_use_from_ptr (&pd->imm_use);
|
}
|
}
|
|
|
/* Return a pointer to the tree operand for argument I of PHI node GS. */
|
/* Return a pointer to the tree operand for argument I of PHI node GS. */
|
|
|
static inline tree *
|
static inline tree *
|
gimple_phi_arg_def_ptr (gimple gs, size_t index)
|
gimple_phi_arg_def_ptr (gimple gs, size_t index)
|
{
|
{
|
return &gimple_phi_arg (gs, index)->def;
|
return &gimple_phi_arg (gs, index)->def;
|
}
|
}
|
|
|
/* Return the edge associated with argument I of phi node GS. */
|
/* Return the edge associated with argument I of phi node GS. */
|
|
|
static inline edge
|
static inline edge
|
gimple_phi_arg_edge (gimple gs, size_t i)
|
gimple_phi_arg_edge (gimple gs, size_t i)
|
{
|
{
|
return EDGE_PRED (gimple_bb (gs), i);
|
return EDGE_PRED (gimple_bb (gs), i);
|
}
|
}
|
|
|
/* Return the source location of gimple argument I of phi node GS. */
|
/* Return the source location of gimple argument I of phi node GS. */
|
|
|
static inline source_location
|
static inline source_location
|
gimple_phi_arg_location (gimple gs, size_t i)
|
gimple_phi_arg_location (gimple gs, size_t i)
|
{
|
{
|
return gimple_phi_arg (gs, i)->locus;
|
return gimple_phi_arg (gs, i)->locus;
|
}
|
}
|
|
|
/* Return the source location of the argument on edge E of phi node GS. */
|
/* Return the source location of the argument on edge E of phi node GS. */
|
|
|
static inline source_location
|
static inline source_location
|
gimple_phi_arg_location_from_edge (gimple gs, edge e)
|
gimple_phi_arg_location_from_edge (gimple gs, edge e)
|
{
|
{
|
return gimple_phi_arg (gs, e->dest_idx)->locus;
|
return gimple_phi_arg (gs, e->dest_idx)->locus;
|
}
|
}
|
|
|
/* Set the source location of gimple argument I of phi node GS to LOC. */
|
/* Set the source location of gimple argument I of phi node GS to LOC. */
|
|
|
static inline void
|
static inline void
|
gimple_phi_arg_set_location (gimple gs, size_t i, source_location loc)
|
gimple_phi_arg_set_location (gimple gs, size_t i, source_location loc)
|
{
|
{
|
gimple_phi_arg (gs, i)->locus = loc;
|
gimple_phi_arg (gs, i)->locus = loc;
|
}
|
}
|
|
|
/* Return TRUE if argument I of phi node GS has a location record. */
|
/* Return TRUE if argument I of phi node GS has a location record. */
|
|
|
static inline bool
|
static inline bool
|
gimple_phi_arg_has_location (gimple gs, size_t i)
|
gimple_phi_arg_has_location (gimple gs, size_t i)
|
{
|
{
|
return gimple_phi_arg_location (gs, i) != UNKNOWN_LOCATION;
|
return gimple_phi_arg_location (gs, i) != UNKNOWN_LOCATION;
|
}
|
}
|
|
|
|
|
/* Return the PHI nodes for basic block BB, or NULL if there are no
|
/* Return the PHI nodes for basic block BB, or NULL if there are no
|
PHI nodes. */
|
PHI nodes. */
|
static inline gimple_seq
|
static inline gimple_seq
|
phi_nodes (const_basic_block bb)
|
phi_nodes (const_basic_block bb)
|
{
|
{
|
gcc_assert (!(bb->flags & BB_RTL));
|
gcc_assert (!(bb->flags & BB_RTL));
|
if (!bb->il.gimple)
|
if (!bb->il.gimple)
|
return NULL;
|
return NULL;
|
return bb->il.gimple->phi_nodes;
|
return bb->il.gimple->phi_nodes;
|
}
|
}
|
|
|
/* Set PHI nodes of a basic block BB to SEQ. */
|
/* Set PHI nodes of a basic block BB to SEQ. */
|
|
|
static inline void
|
static inline void
|
set_phi_nodes (basic_block bb, gimple_seq seq)
|
set_phi_nodes (basic_block bb, gimple_seq seq)
|
{
|
{
|
gimple_stmt_iterator i;
|
gimple_stmt_iterator i;
|
|
|
gcc_assert (!(bb->flags & BB_RTL));
|
gcc_assert (!(bb->flags & BB_RTL));
|
bb->il.gimple->phi_nodes = seq;
|
bb->il.gimple->phi_nodes = seq;
|
if (seq)
|
if (seq)
|
for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
|
for (i = gsi_start (seq); !gsi_end_p (i); gsi_next (&i))
|
gimple_set_bb (gsi_stmt (i), bb);
|
gimple_set_bb (gsi_stmt (i), bb);
|
}
|
}
|
|
|
/* Return the phi argument which contains the specified use. */
|
/* Return the phi argument which contains the specified use. */
|
|
|
static inline int
|
static inline int
|
phi_arg_index_from_use (use_operand_p use)
|
phi_arg_index_from_use (use_operand_p use)
|
{
|
{
|
struct phi_arg_d *element, *root;
|
struct phi_arg_d *element, *root;
|
size_t index;
|
size_t index;
|
gimple phi;
|
gimple phi;
|
|
|
/* Since the use is the first thing in a PHI argument element, we can
|
/* Since the use is the first thing in a PHI argument element, we can
|
calculate its index based on casting it to an argument, and performing
|
calculate its index based on casting it to an argument, and performing
|
pointer arithmetic. */
|
pointer arithmetic. */
|
|
|
phi = USE_STMT (use);
|
phi = USE_STMT (use);
|
gcc_assert (gimple_code (phi) == GIMPLE_PHI);
|
gcc_assert (gimple_code (phi) == GIMPLE_PHI);
|
|
|
element = (struct phi_arg_d *)use;
|
element = (struct phi_arg_d *)use;
|
root = gimple_phi_arg (phi, 0);
|
root = gimple_phi_arg (phi, 0);
|
index = element - root;
|
index = element - root;
|
|
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
/* Make sure the calculation doesn't have any leftover bytes. If it does,
|
/* Make sure the calculation doesn't have any leftover bytes. If it does,
|
then imm_use is likely not the first element in phi_arg_d. */
|
then imm_use is likely not the first element in phi_arg_d. */
|
gcc_assert ((((char *)element - (char *)root)
|
gcc_assert ((((char *)element - (char *)root)
|
% sizeof (struct phi_arg_d)) == 0
|
% sizeof (struct phi_arg_d)) == 0
|
&& index < gimple_phi_capacity (phi));
|
&& index < gimple_phi_capacity (phi));
|
#endif
|
#endif
|
|
|
return index;
|
return index;
|
}
|
}
|
|
|
/* Mark VAR as used, so that it'll be preserved during rtl expansion. */
|
/* Mark VAR as used, so that it'll be preserved during rtl expansion. */
|
|
|
static inline void
|
static inline void
|
set_is_used (tree var)
|
set_is_used (tree var)
|
{
|
{
|
var_ann_t ann = get_var_ann (var);
|
var_ann_t ann = get_var_ann (var);
|
ann->used = 1;
|
ann->used = 1;
|
}
|
}
|
|
|
|
|
/* Return true if T (assumed to be a DECL) is a global variable.
|
/* Return true if T (assumed to be a DECL) is a global variable.
|
A variable is considered global if its storage is not automatic. */
|
A variable is considered global if its storage is not automatic. */
|
|
|
static inline bool
|
static inline bool
|
is_global_var (const_tree t)
|
is_global_var (const_tree t)
|
{
|
{
|
return (TREE_STATIC (t) || DECL_EXTERNAL (t));
|
return (TREE_STATIC (t) || DECL_EXTERNAL (t));
|
}
|
}
|
|
|
|
|
/* Return true if VAR may be aliased. A variable is considered as
|
/* Return true if VAR may be aliased. A variable is considered as
|
maybe aliased if it has its address taken by the local TU
|
maybe aliased if it has its address taken by the local TU
|
or possibly by another TU and might be modified through a pointer. */
|
or possibly by another TU and might be modified through a pointer. */
|
|
|
static inline bool
|
static inline bool
|
may_be_aliased (const_tree var)
|
may_be_aliased (const_tree var)
|
{
|
{
|
return (TREE_CODE (var) != CONST_DECL
|
return (TREE_CODE (var) != CONST_DECL
|
&& !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
|
&& !((TREE_STATIC (var) || TREE_PUBLIC (var) || DECL_EXTERNAL (var))
|
&& TREE_READONLY (var)
|
&& TREE_READONLY (var)
|
&& !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
|
&& !TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (var)))
|
&& (TREE_PUBLIC (var)
|
&& (TREE_PUBLIC (var)
|
|| DECL_EXTERNAL (var)
|
|| DECL_EXTERNAL (var)
|
|| TREE_ADDRESSABLE (var)));
|
|| TREE_ADDRESSABLE (var)));
|
}
|
}
|
|
|
|
|
/* PHI nodes should contain only ssa_names and invariants. A test
|
/* PHI nodes should contain only ssa_names and invariants. A test
|
for ssa_name is definitely simpler; don't let invalid contents
|
for ssa_name is definitely simpler; don't let invalid contents
|
slip in in the meantime. */
|
slip in in the meantime. */
|
|
|
static inline bool
|
static inline bool
|
phi_ssa_name_p (const_tree t)
|
phi_ssa_name_p (const_tree t)
|
{
|
{
|
if (TREE_CODE (t) == SSA_NAME)
|
if (TREE_CODE (t) == SSA_NAME)
|
return true;
|
return true;
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
gcc_assert (is_gimple_min_invariant (t));
|
gcc_assert (is_gimple_min_invariant (t));
|
#endif
|
#endif
|
return false;
|
return false;
|
}
|
}
|
|
|
|
|
/* Returns the loop of the statement STMT. */
|
/* Returns the loop of the statement STMT. */
|
|
|
static inline struct loop *
|
static inline struct loop *
|
loop_containing_stmt (gimple stmt)
|
loop_containing_stmt (gimple stmt)
|
{
|
{
|
basic_block bb = gimple_bb (stmt);
|
basic_block bb = gimple_bb (stmt);
|
if (!bb)
|
if (!bb)
|
return NULL;
|
return NULL;
|
|
|
return bb->loop_father;
|
return bb->loop_father;
|
}
|
}
|
|
|
|
|
/* Return true if VAR is clobbered by function calls. */
|
/* Return true if VAR is clobbered by function calls. */
|
static inline bool
|
static inline bool
|
is_call_clobbered (const_tree var)
|
is_call_clobbered (const_tree var)
|
{
|
{
|
return (is_global_var (var)
|
return (is_global_var (var)
|
|| (may_be_aliased (var)
|
|| (may_be_aliased (var)
|
&& pt_solution_includes (&cfun->gimple_df->escaped, var)));
|
&& pt_solution_includes (&cfun->gimple_df->escaped, var)));
|
}
|
}
|
|
|
/* Return true if VAR is used by function calls. */
|
/* Return true if VAR is used by function calls. */
|
static inline bool
|
static inline bool
|
is_call_used (const_tree var)
|
is_call_used (const_tree var)
|
{
|
{
|
return (is_call_clobbered (var)
|
return (is_call_clobbered (var)
|
|| (may_be_aliased (var)
|
|| (may_be_aliased (var)
|
&& pt_solution_includes (&cfun->gimple_df->callused, var)));
|
&& pt_solution_includes (&cfun->gimple_df->callused, var)));
|
}
|
}
|
|
|
/* ----------------------------------------------------------------------- */
|
/* ----------------------------------------------------------------------- */
|
|
|
/* The following set of routines are used to iterator over various type of
|
/* The following set of routines are used to iterator over various type of
|
SSA operands. */
|
SSA operands. */
|
|
|
/* Return true if PTR is finished iterating. */
|
/* Return true if PTR is finished iterating. */
|
static inline bool
|
static inline bool
|
op_iter_done (const ssa_op_iter *ptr)
|
op_iter_done (const ssa_op_iter *ptr)
|
{
|
{
|
return ptr->done;
|
return ptr->done;
|
}
|
}
|
|
|
/* Get the next iterator use value for PTR. */
|
/* Get the next iterator use value for PTR. */
|
static inline use_operand_p
|
static inline use_operand_p
|
op_iter_next_use (ssa_op_iter *ptr)
|
op_iter_next_use (ssa_op_iter *ptr)
|
{
|
{
|
use_operand_p use_p;
|
use_operand_p use_p;
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
gcc_assert (ptr->iter_type == ssa_op_iter_use);
|
gcc_assert (ptr->iter_type == ssa_op_iter_use);
|
#endif
|
#endif
|
if (ptr->uses)
|
if (ptr->uses)
|
{
|
{
|
use_p = USE_OP_PTR (ptr->uses);
|
use_p = USE_OP_PTR (ptr->uses);
|
ptr->uses = ptr->uses->next;
|
ptr->uses = ptr->uses->next;
|
return use_p;
|
return use_p;
|
}
|
}
|
if (ptr->phi_i < ptr->num_phi)
|
if (ptr->phi_i < ptr->num_phi)
|
{
|
{
|
return PHI_ARG_DEF_PTR (ptr->phi_stmt, (ptr->phi_i)++);
|
return PHI_ARG_DEF_PTR (ptr->phi_stmt, (ptr->phi_i)++);
|
}
|
}
|
ptr->done = true;
|
ptr->done = true;
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
}
|
}
|
|
|
/* Get the next iterator def value for PTR. */
|
/* Get the next iterator def value for PTR. */
|
static inline def_operand_p
|
static inline def_operand_p
|
op_iter_next_def (ssa_op_iter *ptr)
|
op_iter_next_def (ssa_op_iter *ptr)
|
{
|
{
|
def_operand_p def_p;
|
def_operand_p def_p;
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
gcc_assert (ptr->iter_type == ssa_op_iter_def);
|
gcc_assert (ptr->iter_type == ssa_op_iter_def);
|
#endif
|
#endif
|
if (ptr->defs)
|
if (ptr->defs)
|
{
|
{
|
def_p = DEF_OP_PTR (ptr->defs);
|
def_p = DEF_OP_PTR (ptr->defs);
|
ptr->defs = ptr->defs->next;
|
ptr->defs = ptr->defs->next;
|
return def_p;
|
return def_p;
|
}
|
}
|
ptr->done = true;
|
ptr->done = true;
|
return NULL_DEF_OPERAND_P;
|
return NULL_DEF_OPERAND_P;
|
}
|
}
|
|
|
/* Get the next iterator tree value for PTR. */
|
/* Get the next iterator tree value for PTR. */
|
static inline tree
|
static inline tree
|
op_iter_next_tree (ssa_op_iter *ptr)
|
op_iter_next_tree (ssa_op_iter *ptr)
|
{
|
{
|
tree val;
|
tree val;
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
gcc_assert (ptr->iter_type == ssa_op_iter_tree);
|
gcc_assert (ptr->iter_type == ssa_op_iter_tree);
|
#endif
|
#endif
|
if (ptr->uses)
|
if (ptr->uses)
|
{
|
{
|
val = USE_OP (ptr->uses);
|
val = USE_OP (ptr->uses);
|
ptr->uses = ptr->uses->next;
|
ptr->uses = ptr->uses->next;
|
return val;
|
return val;
|
}
|
}
|
if (ptr->defs)
|
if (ptr->defs)
|
{
|
{
|
val = DEF_OP (ptr->defs);
|
val = DEF_OP (ptr->defs);
|
ptr->defs = ptr->defs->next;
|
ptr->defs = ptr->defs->next;
|
return val;
|
return val;
|
}
|
}
|
|
|
ptr->done = true;
|
ptr->done = true;
|
return NULL_TREE;
|
return NULL_TREE;
|
|
|
}
|
}
|
|
|
|
|
/* This functions clears the iterator PTR, and marks it done. This is normally
|
/* This functions clears the iterator PTR, and marks it done. This is normally
|
used to prevent warnings in the compile about might be uninitialized
|
used to prevent warnings in the compile about might be uninitialized
|
components. */
|
components. */
|
|
|
static inline void
|
static inline void
|
clear_and_done_ssa_iter (ssa_op_iter *ptr)
|
clear_and_done_ssa_iter (ssa_op_iter *ptr)
|
{
|
{
|
ptr->defs = NULL;
|
ptr->defs = NULL;
|
ptr->uses = NULL;
|
ptr->uses = NULL;
|
ptr->iter_type = ssa_op_iter_none;
|
ptr->iter_type = ssa_op_iter_none;
|
ptr->phi_i = 0;
|
ptr->phi_i = 0;
|
ptr->num_phi = 0;
|
ptr->num_phi = 0;
|
ptr->phi_stmt = NULL;
|
ptr->phi_stmt = NULL;
|
ptr->done = true;
|
ptr->done = true;
|
}
|
}
|
|
|
/* Initialize the iterator PTR to the virtual defs in STMT. */
|
/* Initialize the iterator PTR to the virtual defs in STMT. */
|
static inline void
|
static inline void
|
op_iter_init (ssa_op_iter *ptr, gimple stmt, int flags)
|
op_iter_init (ssa_op_iter *ptr, gimple stmt, int flags)
|
{
|
{
|
/* We do not support iterating over virtual defs or uses without
|
/* We do not support iterating over virtual defs or uses without
|
iterating over defs or uses at the same time. */
|
iterating over defs or uses at the same time. */
|
gcc_assert ((!(flags & SSA_OP_VDEF) || (flags & SSA_OP_DEF))
|
gcc_assert ((!(flags & SSA_OP_VDEF) || (flags & SSA_OP_DEF))
|
&& (!(flags & SSA_OP_VUSE) || (flags & SSA_OP_USE)));
|
&& (!(flags & SSA_OP_VUSE) || (flags & SSA_OP_USE)));
|
ptr->defs = (flags & (SSA_OP_DEF|SSA_OP_VDEF)) ? gimple_def_ops (stmt) : NULL;
|
ptr->defs = (flags & (SSA_OP_DEF|SSA_OP_VDEF)) ? gimple_def_ops (stmt) : NULL;
|
if (!(flags & SSA_OP_VDEF)
|
if (!(flags & SSA_OP_VDEF)
|
&& ptr->defs
|
&& ptr->defs
|
&& gimple_vdef (stmt) != NULL_TREE)
|
&& gimple_vdef (stmt) != NULL_TREE)
|
ptr->defs = ptr->defs->next;
|
ptr->defs = ptr->defs->next;
|
ptr->uses = (flags & (SSA_OP_USE|SSA_OP_VUSE)) ? gimple_use_ops (stmt) : NULL;
|
ptr->uses = (flags & (SSA_OP_USE|SSA_OP_VUSE)) ? gimple_use_ops (stmt) : NULL;
|
if (!(flags & SSA_OP_VUSE)
|
if (!(flags & SSA_OP_VUSE)
|
&& ptr->uses
|
&& ptr->uses
|
&& gimple_vuse (stmt) != NULL_TREE)
|
&& gimple_vuse (stmt) != NULL_TREE)
|
ptr->uses = ptr->uses->next;
|
ptr->uses = ptr->uses->next;
|
ptr->done = false;
|
ptr->done = false;
|
|
|
ptr->phi_i = 0;
|
ptr->phi_i = 0;
|
ptr->num_phi = 0;
|
ptr->num_phi = 0;
|
ptr->phi_stmt = NULL;
|
ptr->phi_stmt = NULL;
|
}
|
}
|
|
|
/* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
|
/* Initialize iterator PTR to the use operands in STMT based on FLAGS. Return
|
the first use. */
|
the first use. */
|
static inline use_operand_p
|
static inline use_operand_p
|
op_iter_init_use (ssa_op_iter *ptr, gimple stmt, int flags)
|
op_iter_init_use (ssa_op_iter *ptr, gimple stmt, int flags)
|
{
|
{
|
gcc_assert ((flags & SSA_OP_ALL_DEFS) == 0
|
gcc_assert ((flags & SSA_OP_ALL_DEFS) == 0
|
&& (flags & SSA_OP_USE));
|
&& (flags & SSA_OP_USE));
|
op_iter_init (ptr, stmt, flags);
|
op_iter_init (ptr, stmt, flags);
|
ptr->iter_type = ssa_op_iter_use;
|
ptr->iter_type = ssa_op_iter_use;
|
return op_iter_next_use (ptr);
|
return op_iter_next_use (ptr);
|
}
|
}
|
|
|
/* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
|
/* Initialize iterator PTR to the def operands in STMT based on FLAGS. Return
|
the first def. */
|
the first def. */
|
static inline def_operand_p
|
static inline def_operand_p
|
op_iter_init_def (ssa_op_iter *ptr, gimple stmt, int flags)
|
op_iter_init_def (ssa_op_iter *ptr, gimple stmt, int flags)
|
{
|
{
|
gcc_assert ((flags & SSA_OP_ALL_USES) == 0
|
gcc_assert ((flags & SSA_OP_ALL_USES) == 0
|
&& (flags & SSA_OP_DEF));
|
&& (flags & SSA_OP_DEF));
|
op_iter_init (ptr, stmt, flags);
|
op_iter_init (ptr, stmt, flags);
|
ptr->iter_type = ssa_op_iter_def;
|
ptr->iter_type = ssa_op_iter_def;
|
return op_iter_next_def (ptr);
|
return op_iter_next_def (ptr);
|
}
|
}
|
|
|
/* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
|
/* Initialize iterator PTR to the operands in STMT based on FLAGS. Return
|
the first operand as a tree. */
|
the first operand as a tree. */
|
static inline tree
|
static inline tree
|
op_iter_init_tree (ssa_op_iter *ptr, gimple stmt, int flags)
|
op_iter_init_tree (ssa_op_iter *ptr, gimple stmt, int flags)
|
{
|
{
|
op_iter_init (ptr, stmt, flags);
|
op_iter_init (ptr, stmt, flags);
|
ptr->iter_type = ssa_op_iter_tree;
|
ptr->iter_type = ssa_op_iter_tree;
|
return op_iter_next_tree (ptr);
|
return op_iter_next_tree (ptr);
|
}
|
}
|
|
|
|
|
/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
|
/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
|
return NULL. */
|
return NULL. */
|
static inline tree
|
static inline tree
|
single_ssa_tree_operand (gimple stmt, int flags)
|
single_ssa_tree_operand (gimple stmt, int flags)
|
{
|
{
|
tree var;
|
tree var;
|
ssa_op_iter iter;
|
ssa_op_iter iter;
|
|
|
var = op_iter_init_tree (&iter, stmt, flags);
|
var = op_iter_init_tree (&iter, stmt, flags);
|
if (op_iter_done (&iter))
|
if (op_iter_done (&iter))
|
return NULL_TREE;
|
return NULL_TREE;
|
op_iter_next_tree (&iter);
|
op_iter_next_tree (&iter);
|
if (op_iter_done (&iter))
|
if (op_iter_done (&iter))
|
return var;
|
return var;
|
return NULL_TREE;
|
return NULL_TREE;
|
}
|
}
|
|
|
|
|
/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
|
/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
|
return NULL. */
|
return NULL. */
|
static inline use_operand_p
|
static inline use_operand_p
|
single_ssa_use_operand (gimple stmt, int flags)
|
single_ssa_use_operand (gimple stmt, int flags)
|
{
|
{
|
use_operand_p var;
|
use_operand_p var;
|
ssa_op_iter iter;
|
ssa_op_iter iter;
|
|
|
var = op_iter_init_use (&iter, stmt, flags);
|
var = op_iter_init_use (&iter, stmt, flags);
|
if (op_iter_done (&iter))
|
if (op_iter_done (&iter))
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
op_iter_next_use (&iter);
|
op_iter_next_use (&iter);
|
if (op_iter_done (&iter))
|
if (op_iter_done (&iter))
|
return var;
|
return var;
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
}
|
}
|
|
|
|
|
|
|
/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
|
/* If there is a single operand in STMT matching FLAGS, return it. Otherwise
|
return NULL. */
|
return NULL. */
|
static inline def_operand_p
|
static inline def_operand_p
|
single_ssa_def_operand (gimple stmt, int flags)
|
single_ssa_def_operand (gimple stmt, int flags)
|
{
|
{
|
def_operand_p var;
|
def_operand_p var;
|
ssa_op_iter iter;
|
ssa_op_iter iter;
|
|
|
var = op_iter_init_def (&iter, stmt, flags);
|
var = op_iter_init_def (&iter, stmt, flags);
|
if (op_iter_done (&iter))
|
if (op_iter_done (&iter))
|
return NULL_DEF_OPERAND_P;
|
return NULL_DEF_OPERAND_P;
|
op_iter_next_def (&iter);
|
op_iter_next_def (&iter);
|
if (op_iter_done (&iter))
|
if (op_iter_done (&iter))
|
return var;
|
return var;
|
return NULL_DEF_OPERAND_P;
|
return NULL_DEF_OPERAND_P;
|
}
|
}
|
|
|
|
|
/* Return true if there are zero operands in STMT matching the type
|
/* Return true if there are zero operands in STMT matching the type
|
given in FLAGS. */
|
given in FLAGS. */
|
static inline bool
|
static inline bool
|
zero_ssa_operands (gimple stmt, int flags)
|
zero_ssa_operands (gimple stmt, int flags)
|
{
|
{
|
ssa_op_iter iter;
|
ssa_op_iter iter;
|
|
|
op_iter_init_tree (&iter, stmt, flags);
|
op_iter_init_tree (&iter, stmt, flags);
|
return op_iter_done (&iter);
|
return op_iter_done (&iter);
|
}
|
}
|
|
|
|
|
/* Return the number of operands matching FLAGS in STMT. */
|
/* Return the number of operands matching FLAGS in STMT. */
|
static inline int
|
static inline int
|
num_ssa_operands (gimple stmt, int flags)
|
num_ssa_operands (gimple stmt, int flags)
|
{
|
{
|
ssa_op_iter iter;
|
ssa_op_iter iter;
|
tree t;
|
tree t;
|
int num = 0;
|
int num = 0;
|
|
|
FOR_EACH_SSA_TREE_OPERAND (t, stmt, iter, flags)
|
FOR_EACH_SSA_TREE_OPERAND (t, stmt, iter, flags)
|
num++;
|
num++;
|
return num;
|
return num;
|
}
|
}
|
|
|
|
|
/* Delink all immediate_use information for STMT. */
|
/* Delink all immediate_use information for STMT. */
|
static inline void
|
static inline void
|
delink_stmt_imm_use (gimple stmt)
|
delink_stmt_imm_use (gimple stmt)
|
{
|
{
|
ssa_op_iter iter;
|
ssa_op_iter iter;
|
use_operand_p use_p;
|
use_operand_p use_p;
|
|
|
if (ssa_operands_active ())
|
if (ssa_operands_active ())
|
FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES)
|
FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter, SSA_OP_ALL_USES)
|
delink_imm_use (use_p);
|
delink_imm_use (use_p);
|
}
|
}
|
|
|
|
|
/* If there is a single DEF in the PHI node which matches FLAG, return it.
|
/* If there is a single DEF in the PHI node which matches FLAG, return it.
|
Otherwise return NULL_DEF_OPERAND_P. */
|
Otherwise return NULL_DEF_OPERAND_P. */
|
static inline tree
|
static inline tree
|
single_phi_def (gimple stmt, int flags)
|
single_phi_def (gimple stmt, int flags)
|
{
|
{
|
tree def = PHI_RESULT (stmt);
|
tree def = PHI_RESULT (stmt);
|
if ((flags & SSA_OP_DEF) && is_gimple_reg (def))
|
if ((flags & SSA_OP_DEF) && is_gimple_reg (def))
|
return def;
|
return def;
|
if ((flags & SSA_OP_VIRTUAL_DEFS) && !is_gimple_reg (def))
|
if ((flags & SSA_OP_VIRTUAL_DEFS) && !is_gimple_reg (def))
|
return def;
|
return def;
|
return NULL_TREE;
|
return NULL_TREE;
|
}
|
}
|
|
|
/* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
|
/* Initialize the iterator PTR for uses matching FLAGS in PHI. FLAGS should
|
be either SSA_OP_USES or SSA_OP_VIRTUAL_USES. */
|
be either SSA_OP_USES or SSA_OP_VIRTUAL_USES. */
|
static inline use_operand_p
|
static inline use_operand_p
|
op_iter_init_phiuse (ssa_op_iter *ptr, gimple phi, int flags)
|
op_iter_init_phiuse (ssa_op_iter *ptr, gimple phi, int flags)
|
{
|
{
|
tree phi_def = gimple_phi_result (phi);
|
tree phi_def = gimple_phi_result (phi);
|
int comp;
|
int comp;
|
|
|
clear_and_done_ssa_iter (ptr);
|
clear_and_done_ssa_iter (ptr);
|
ptr->done = false;
|
ptr->done = false;
|
|
|
gcc_assert ((flags & (SSA_OP_USE | SSA_OP_VIRTUAL_USES)) != 0);
|
gcc_assert ((flags & (SSA_OP_USE | SSA_OP_VIRTUAL_USES)) != 0);
|
|
|
comp = (is_gimple_reg (phi_def) ? SSA_OP_USE : SSA_OP_VIRTUAL_USES);
|
comp = (is_gimple_reg (phi_def) ? SSA_OP_USE : SSA_OP_VIRTUAL_USES);
|
|
|
/* If the PHI node doesn't the operand type we care about, we're done. */
|
/* If the PHI node doesn't the operand type we care about, we're done. */
|
if ((flags & comp) == 0)
|
if ((flags & comp) == 0)
|
{
|
{
|
ptr->done = true;
|
ptr->done = true;
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
}
|
}
|
|
|
ptr->phi_stmt = phi;
|
ptr->phi_stmt = phi;
|
ptr->num_phi = gimple_phi_num_args (phi);
|
ptr->num_phi = gimple_phi_num_args (phi);
|
ptr->iter_type = ssa_op_iter_use;
|
ptr->iter_type = ssa_op_iter_use;
|
return op_iter_next_use (ptr);
|
return op_iter_next_use (ptr);
|
}
|
}
|
|
|
|
|
/* Start an iterator for a PHI definition. */
|
/* Start an iterator for a PHI definition. */
|
|
|
static inline def_operand_p
|
static inline def_operand_p
|
op_iter_init_phidef (ssa_op_iter *ptr, gimple phi, int flags)
|
op_iter_init_phidef (ssa_op_iter *ptr, gimple phi, int flags)
|
{
|
{
|
tree phi_def = PHI_RESULT (phi);
|
tree phi_def = PHI_RESULT (phi);
|
int comp;
|
int comp;
|
|
|
clear_and_done_ssa_iter (ptr);
|
clear_and_done_ssa_iter (ptr);
|
ptr->done = false;
|
ptr->done = false;
|
|
|
gcc_assert ((flags & (SSA_OP_DEF | SSA_OP_VIRTUAL_DEFS)) != 0);
|
gcc_assert ((flags & (SSA_OP_DEF | SSA_OP_VIRTUAL_DEFS)) != 0);
|
|
|
comp = (is_gimple_reg (phi_def) ? SSA_OP_DEF : SSA_OP_VIRTUAL_DEFS);
|
comp = (is_gimple_reg (phi_def) ? SSA_OP_DEF : SSA_OP_VIRTUAL_DEFS);
|
|
|
/* If the PHI node doesn't have the operand type we care about,
|
/* If the PHI node doesn't have the operand type we care about,
|
we're done. */
|
we're done. */
|
if ((flags & comp) == 0)
|
if ((flags & comp) == 0)
|
{
|
{
|
ptr->done = true;
|
ptr->done = true;
|
return NULL_DEF_OPERAND_P;
|
return NULL_DEF_OPERAND_P;
|
}
|
}
|
|
|
ptr->iter_type = ssa_op_iter_def;
|
ptr->iter_type = ssa_op_iter_def;
|
/* The first call to op_iter_next_def will terminate the iterator since
|
/* The first call to op_iter_next_def will terminate the iterator since
|
all the fields are NULL. Simply return the result here as the first and
|
all the fields are NULL. Simply return the result here as the first and
|
therefore only result. */
|
therefore only result. */
|
return PHI_RESULT_PTR (phi);
|
return PHI_RESULT_PTR (phi);
|
}
|
}
|
|
|
/* Return true is IMM has reached the end of the immediate use stmt list. */
|
/* Return true is IMM has reached the end of the immediate use stmt list. */
|
|
|
static inline bool
|
static inline bool
|
end_imm_use_stmt_p (const imm_use_iterator *imm)
|
end_imm_use_stmt_p (const imm_use_iterator *imm)
|
{
|
{
|
return (imm->imm_use == imm->end_p);
|
return (imm->imm_use == imm->end_p);
|
}
|
}
|
|
|
/* Finished the traverse of an immediate use stmt list IMM by removing the
|
/* Finished the traverse of an immediate use stmt list IMM by removing the
|
placeholder node from the list. */
|
placeholder node from the list. */
|
|
|
static inline void
|
static inline void
|
end_imm_use_stmt_traverse (imm_use_iterator *imm)
|
end_imm_use_stmt_traverse (imm_use_iterator *imm)
|
{
|
{
|
delink_imm_use (&(imm->iter_node));
|
delink_imm_use (&(imm->iter_node));
|
}
|
}
|
|
|
/* Immediate use traversal of uses within a stmt require that all the
|
/* Immediate use traversal of uses within a stmt require that all the
|
uses on a stmt be sequentially listed. This routine is used to build up
|
uses on a stmt be sequentially listed. This routine is used to build up
|
this sequential list by adding USE_P to the end of the current list
|
this sequential list by adding USE_P to the end of the current list
|
currently delimited by HEAD and LAST_P. The new LAST_P value is
|
currently delimited by HEAD and LAST_P. The new LAST_P value is
|
returned. */
|
returned. */
|
|
|
static inline use_operand_p
|
static inline use_operand_p
|
move_use_after_head (use_operand_p use_p, use_operand_p head,
|
move_use_after_head (use_operand_p use_p, use_operand_p head,
|
use_operand_p last_p)
|
use_operand_p last_p)
|
{
|
{
|
#ifdef ENABLE_CHECKING
|
#ifdef ENABLE_CHECKING
|
gcc_assert (USE_FROM_PTR (use_p) == USE_FROM_PTR (head));
|
gcc_assert (USE_FROM_PTR (use_p) == USE_FROM_PTR (head));
|
#endif
|
#endif
|
/* Skip head when we find it. */
|
/* Skip head when we find it. */
|
if (use_p != head)
|
if (use_p != head)
|
{
|
{
|
/* If use_p is already linked in after last_p, continue. */
|
/* If use_p is already linked in after last_p, continue. */
|
if (last_p->next == use_p)
|
if (last_p->next == use_p)
|
last_p = use_p;
|
last_p = use_p;
|
else
|
else
|
{
|
{
|
/* Delink from current location, and link in at last_p. */
|
/* Delink from current location, and link in at last_p. */
|
delink_imm_use (use_p);
|
delink_imm_use (use_p);
|
link_imm_use_to_list (use_p, last_p);
|
link_imm_use_to_list (use_p, last_p);
|
last_p = use_p;
|
last_p = use_p;
|
}
|
}
|
}
|
}
|
return last_p;
|
return last_p;
|
}
|
}
|
|
|
|
|
/* This routine will relink all uses with the same stmt as HEAD into the list
|
/* This routine will relink all uses with the same stmt as HEAD into the list
|
immediately following HEAD for iterator IMM. */
|
immediately following HEAD for iterator IMM. */
|
|
|
static inline void
|
static inline void
|
link_use_stmts_after (use_operand_p head, imm_use_iterator *imm)
|
link_use_stmts_after (use_operand_p head, imm_use_iterator *imm)
|
{
|
{
|
use_operand_p use_p;
|
use_operand_p use_p;
|
use_operand_p last_p = head;
|
use_operand_p last_p = head;
|
gimple head_stmt = USE_STMT (head);
|
gimple head_stmt = USE_STMT (head);
|
tree use = USE_FROM_PTR (head);
|
tree use = USE_FROM_PTR (head);
|
ssa_op_iter op_iter;
|
ssa_op_iter op_iter;
|
int flag;
|
int flag;
|
|
|
/* Only look at virtual or real uses, depending on the type of HEAD. */
|
/* Only look at virtual or real uses, depending on the type of HEAD. */
|
flag = (is_gimple_reg (use) ? SSA_OP_USE : SSA_OP_VIRTUAL_USES);
|
flag = (is_gimple_reg (use) ? SSA_OP_USE : SSA_OP_VIRTUAL_USES);
|
|
|
if (gimple_code (head_stmt) == GIMPLE_PHI)
|
if (gimple_code (head_stmt) == GIMPLE_PHI)
|
{
|
{
|
FOR_EACH_PHI_ARG (use_p, head_stmt, op_iter, flag)
|
FOR_EACH_PHI_ARG (use_p, head_stmt, op_iter, flag)
|
if (USE_FROM_PTR (use_p) == use)
|
if (USE_FROM_PTR (use_p) == use)
|
last_p = move_use_after_head (use_p, head, last_p);
|
last_p = move_use_after_head (use_p, head, last_p);
|
}
|
}
|
else
|
else
|
{
|
{
|
if (flag == SSA_OP_USE)
|
if (flag == SSA_OP_USE)
|
{
|
{
|
FOR_EACH_SSA_USE_OPERAND (use_p, head_stmt, op_iter, flag)
|
FOR_EACH_SSA_USE_OPERAND (use_p, head_stmt, op_iter, flag)
|
if (USE_FROM_PTR (use_p) == use)
|
if (USE_FROM_PTR (use_p) == use)
|
last_p = move_use_after_head (use_p, head, last_p);
|
last_p = move_use_after_head (use_p, head, last_p);
|
}
|
}
|
else if ((use_p = gimple_vuse_op (head_stmt)) != NULL_USE_OPERAND_P)
|
else if ((use_p = gimple_vuse_op (head_stmt)) != NULL_USE_OPERAND_P)
|
{
|
{
|
if (USE_FROM_PTR (use_p) == use)
|
if (USE_FROM_PTR (use_p) == use)
|
last_p = move_use_after_head (use_p, head, last_p);
|
last_p = move_use_after_head (use_p, head, last_p);
|
}
|
}
|
}
|
}
|
/* Link iter node in after last_p. */
|
/* Link iter node in after last_p. */
|
if (imm->iter_node.prev != NULL)
|
if (imm->iter_node.prev != NULL)
|
delink_imm_use (&imm->iter_node);
|
delink_imm_use (&imm->iter_node);
|
link_imm_use_to_list (&(imm->iter_node), last_p);
|
link_imm_use_to_list (&(imm->iter_node), last_p);
|
}
|
}
|
|
|
/* Initialize IMM to traverse over uses of VAR. Return the first statement. */
|
/* Initialize IMM to traverse over uses of VAR. Return the first statement. */
|
static inline gimple
|
static inline gimple
|
first_imm_use_stmt (imm_use_iterator *imm, tree var)
|
first_imm_use_stmt (imm_use_iterator *imm, tree var)
|
{
|
{
|
imm->end_p = &(SSA_NAME_IMM_USE_NODE (var));
|
imm->end_p = &(SSA_NAME_IMM_USE_NODE (var));
|
imm->imm_use = imm->end_p->next;
|
imm->imm_use = imm->end_p->next;
|
imm->next_imm_name = NULL_USE_OPERAND_P;
|
imm->next_imm_name = NULL_USE_OPERAND_P;
|
|
|
/* iter_node is used as a marker within the immediate use list to indicate
|
/* iter_node is used as a marker within the immediate use list to indicate
|
where the end of the current stmt's uses are. Initialize it to NULL
|
where the end of the current stmt's uses are. Initialize it to NULL
|
stmt and use, which indicates a marker node. */
|
stmt and use, which indicates a marker node. */
|
imm->iter_node.prev = NULL_USE_OPERAND_P;
|
imm->iter_node.prev = NULL_USE_OPERAND_P;
|
imm->iter_node.next = NULL_USE_OPERAND_P;
|
imm->iter_node.next = NULL_USE_OPERAND_P;
|
imm->iter_node.loc.stmt = NULL;
|
imm->iter_node.loc.stmt = NULL;
|
imm->iter_node.use = NULL;
|
imm->iter_node.use = NULL;
|
|
|
if (end_imm_use_stmt_p (imm))
|
if (end_imm_use_stmt_p (imm))
|
return NULL;
|
return NULL;
|
|
|
link_use_stmts_after (imm->imm_use, imm);
|
link_use_stmts_after (imm->imm_use, imm);
|
|
|
return USE_STMT (imm->imm_use);
|
return USE_STMT (imm->imm_use);
|
}
|
}
|
|
|
/* Bump IMM to the next stmt which has a use of var. */
|
/* Bump IMM to the next stmt which has a use of var. */
|
|
|
static inline gimple
|
static inline gimple
|
next_imm_use_stmt (imm_use_iterator *imm)
|
next_imm_use_stmt (imm_use_iterator *imm)
|
{
|
{
|
imm->imm_use = imm->iter_node.next;
|
imm->imm_use = imm->iter_node.next;
|
if (end_imm_use_stmt_p (imm))
|
if (end_imm_use_stmt_p (imm))
|
{
|
{
|
if (imm->iter_node.prev != NULL)
|
if (imm->iter_node.prev != NULL)
|
delink_imm_use (&imm->iter_node);
|
delink_imm_use (&imm->iter_node);
|
return NULL;
|
return NULL;
|
}
|
}
|
|
|
link_use_stmts_after (imm->imm_use, imm);
|
link_use_stmts_after (imm->imm_use, imm);
|
return USE_STMT (imm->imm_use);
|
return USE_STMT (imm->imm_use);
|
}
|
}
|
|
|
/* This routine will return the first use on the stmt IMM currently refers
|
/* This routine will return the first use on the stmt IMM currently refers
|
to. */
|
to. */
|
|
|
static inline use_operand_p
|
static inline use_operand_p
|
first_imm_use_on_stmt (imm_use_iterator *imm)
|
first_imm_use_on_stmt (imm_use_iterator *imm)
|
{
|
{
|
imm->next_imm_name = imm->imm_use->next;
|
imm->next_imm_name = imm->imm_use->next;
|
return imm->imm_use;
|
return imm->imm_use;
|
}
|
}
|
|
|
/* Return TRUE if the last use on the stmt IMM refers to has been visited. */
|
/* Return TRUE if the last use on the stmt IMM refers to has been visited. */
|
|
|
static inline bool
|
static inline bool
|
end_imm_use_on_stmt_p (const imm_use_iterator *imm)
|
end_imm_use_on_stmt_p (const imm_use_iterator *imm)
|
{
|
{
|
return (imm->imm_use == &(imm->iter_node));
|
return (imm->imm_use == &(imm->iter_node));
|
}
|
}
|
|
|
/* Bump to the next use on the stmt IMM refers to, return NULL if done. */
|
/* Bump to the next use on the stmt IMM refers to, return NULL if done. */
|
|
|
static inline use_operand_p
|
static inline use_operand_p
|
next_imm_use_on_stmt (imm_use_iterator *imm)
|
next_imm_use_on_stmt (imm_use_iterator *imm)
|
{
|
{
|
imm->imm_use = imm->next_imm_name;
|
imm->imm_use = imm->next_imm_name;
|
if (end_imm_use_on_stmt_p (imm))
|
if (end_imm_use_on_stmt_p (imm))
|
return NULL_USE_OPERAND_P;
|
return NULL_USE_OPERAND_P;
|
else
|
else
|
{
|
{
|
imm->next_imm_name = imm->imm_use->next;
|
imm->next_imm_name = imm->imm_use->next;
|
return imm->imm_use;
|
return imm->imm_use;
|
}
|
}
|
}
|
}
|
|
|
/* Return true if VAR cannot be modified by the program. */
|
/* Return true if VAR cannot be modified by the program. */
|
|
|
static inline bool
|
static inline bool
|
unmodifiable_var_p (const_tree var)
|
unmodifiable_var_p (const_tree var)
|
{
|
{
|
if (TREE_CODE (var) == SSA_NAME)
|
if (TREE_CODE (var) == SSA_NAME)
|
var = SSA_NAME_VAR (var);
|
var = SSA_NAME_VAR (var);
|
|
|
return TREE_READONLY (var) && (TREE_STATIC (var) || DECL_EXTERNAL (var));
|
return TREE_READONLY (var) && (TREE_STATIC (var) || DECL_EXTERNAL (var));
|
}
|
}
|
|
|
/* Return true if REF, an ARRAY_REF, has an INDIRECT_REF somewhere in it. */
|
/* Return true if REF, an ARRAY_REF, has an INDIRECT_REF somewhere in it. */
|
|
|
static inline bool
|
static inline bool
|
array_ref_contains_indirect_ref (const_tree ref)
|
array_ref_contains_indirect_ref (const_tree ref)
|
{
|
{
|
gcc_assert (TREE_CODE (ref) == ARRAY_REF);
|
gcc_assert (TREE_CODE (ref) == ARRAY_REF);
|
|
|
do {
|
do {
|
ref = TREE_OPERAND (ref, 0);
|
ref = TREE_OPERAND (ref, 0);
|
} while (handled_component_p (ref));
|
} while (handled_component_p (ref));
|
|
|
return TREE_CODE (ref) == INDIRECT_REF;
|
return TREE_CODE (ref) == INDIRECT_REF;
|
}
|
}
|
|
|
/* Return true if REF, a handled component reference, has an ARRAY_REF
|
/* Return true if REF, a handled component reference, has an ARRAY_REF
|
somewhere in it. */
|
somewhere in it. */
|
|
|
static inline bool
|
static inline bool
|
ref_contains_array_ref (const_tree ref)
|
ref_contains_array_ref (const_tree ref)
|
{
|
{
|
gcc_assert (handled_component_p (ref));
|
gcc_assert (handled_component_p (ref));
|
|
|
do {
|
do {
|
if (TREE_CODE (ref) == ARRAY_REF)
|
if (TREE_CODE (ref) == ARRAY_REF)
|
return true;
|
return true;
|
ref = TREE_OPERAND (ref, 0);
|
ref = TREE_OPERAND (ref, 0);
|
} while (handled_component_p (ref));
|
} while (handled_component_p (ref));
|
|
|
return false;
|
return false;
|
}
|
}
|
|
|
/* Return true if REF has an VIEW_CONVERT_EXPR somewhere in it. */
|
/* Return true if REF has an VIEW_CONVERT_EXPR somewhere in it. */
|
|
|
static inline bool
|
static inline bool
|
contains_view_convert_expr_p (const_tree ref)
|
contains_view_convert_expr_p (const_tree ref)
|
{
|
{
|
while (handled_component_p (ref))
|
while (handled_component_p (ref))
|
{
|
{
|
if (TREE_CODE (ref) == VIEW_CONVERT_EXPR)
|
if (TREE_CODE (ref) == VIEW_CONVERT_EXPR)
|
return true;
|
return true;
|
ref = TREE_OPERAND (ref, 0);
|
ref = TREE_OPERAND (ref, 0);
|
}
|
}
|
|
|
return false;
|
return false;
|
}
|
}
|
|
|
/* Return true, if the two ranges [POS1, SIZE1] and [POS2, SIZE2]
|
/* Return true, if the two ranges [POS1, SIZE1] and [POS2, SIZE2]
|
overlap. SIZE1 and/or SIZE2 can be (unsigned)-1 in which case the
|
overlap. SIZE1 and/or SIZE2 can be (unsigned)-1 in which case the
|
range is open-ended. Otherwise return false. */
|
range is open-ended. Otherwise return false. */
|
|
|
static inline bool
|
static inline bool
|
ranges_overlap_p (unsigned HOST_WIDE_INT pos1,
|
ranges_overlap_p (unsigned HOST_WIDE_INT pos1,
|
unsigned HOST_WIDE_INT size1,
|
unsigned HOST_WIDE_INT size1,
|
unsigned HOST_WIDE_INT pos2,
|
unsigned HOST_WIDE_INT pos2,
|
unsigned HOST_WIDE_INT size2)
|
unsigned HOST_WIDE_INT size2)
|
{
|
{
|
if (pos1 >= pos2
|
if (pos1 >= pos2
|
&& (size2 == (unsigned HOST_WIDE_INT)-1
|
&& (size2 == (unsigned HOST_WIDE_INT)-1
|
|| pos1 < (pos2 + size2)))
|
|| pos1 < (pos2 + size2)))
|
return true;
|
return true;
|
if (pos2 >= pos1
|
if (pos2 >= pos1
|
&& (size1 == (unsigned HOST_WIDE_INT)-1
|
&& (size1 == (unsigned HOST_WIDE_INT)-1
|
|| pos2 < (pos1 + size1)))
|
|| pos2 < (pos1 + size1)))
|
return true;
|
return true;
|
|
|
return false;
|
return false;
|
}
|
}
|
|
|
/* Accessor to tree-ssa-operands.c caches. */
|
/* Accessor to tree-ssa-operands.c caches. */
|
static inline struct ssa_operands *
|
static inline struct ssa_operands *
|
gimple_ssa_operands (const struct function *fun)
|
gimple_ssa_operands (const struct function *fun)
|
{
|
{
|
return &fun->gimple_df->ssa_operands;
|
return &fun->gimple_df->ssa_operands;
|
}
|
}
|
|
|
/* Given an edge_var_map V, return the PHI arg definition. */
|
/* Given an edge_var_map V, return the PHI arg definition. */
|
|
|
static inline tree
|
static inline tree
|
redirect_edge_var_map_def (edge_var_map *v)
|
redirect_edge_var_map_def (edge_var_map *v)
|
{
|
{
|
return v->def;
|
return v->def;
|
}
|
}
|
|
|
/* Given an edge_var_map V, return the PHI result. */
|
/* Given an edge_var_map V, return the PHI result. */
|
|
|
static inline tree
|
static inline tree
|
redirect_edge_var_map_result (edge_var_map *v)
|
redirect_edge_var_map_result (edge_var_map *v)
|
{
|
{
|
return v->result;
|
return v->result;
|
}
|
}
|
|
|
/* Given an edge_var_map V, return the PHI arg location. */
|
/* Given an edge_var_map V, return the PHI arg location. */
|
|
|
static inline source_location
|
static inline source_location
|
redirect_edge_var_map_location (edge_var_map *v)
|
redirect_edge_var_map_location (edge_var_map *v)
|
{
|
{
|
return v->locus;
|
return v->locus;
|
}
|
}
|
|
|
|
|
/* Return an SSA_NAME node for variable VAR defined in statement STMT
|
/* Return an SSA_NAME node for variable VAR defined in statement STMT
|
in function cfun. */
|
in function cfun. */
|
|
|
static inline tree
|
static inline tree
|
make_ssa_name (tree var, gimple stmt)
|
make_ssa_name (tree var, gimple stmt)
|
{
|
{
|
return make_ssa_name_fn (cfun, var, stmt);
|
return make_ssa_name_fn (cfun, var, stmt);
|
}
|
}
|
|
|
#endif /* _TREE_FLOW_INLINE_H */
|
#endif /* _TREE_FLOW_INLINE_H */
|
|
|
