Searched refs:pset (Results 1 - 20 of 20) sorted by relevance

/haiku-buildtools/gcc/gcc/c-family/
H A Dc-gimplify.c97 hash_set<tree> *pset = (hash_set<tree> *) data; local
110 walk_tree (&DECL_INITIAL (decl), ubsan_walk_array_refs_r, pset, local
111 pset); local
112 walk_tree (&DECL_SIZE (decl), ubsan_walk_array_refs_r, pset, pset); local
113 walk_tree (&DECL_SIZE_UNIT (decl), ubsan_walk_array_refs_r, pset, local
114 pset); local
126 pset->add (aref);
128 walk_tree (&TREE_OPERAND (aref, 0), ubsan_walk_array_refs_r, pset, pset);
152 hash_set<tree> pset; local
153 walk_tree (&DECL_SAVED_TREE (fndecl), ubsan_walk_array_refs_r, &pset, local
154 &pset); local
[all...]
/haiku-buildtools/gcc/gcc/
H A Dgimple-walk.c197 hash_set<tree> *pset = (wi) ? wi->pset : NULL; local
217 pset);
235 ret = walk_tree (gimple_op_ptr (stmt, 0), callback_op, wi, pset);
254 callback_op, wi, pset);
258 ret = walk_tree (gimple_call_fn_ptr (stmt), callback_op, wi, pset);
268 pset);
282 ret = walk_tree (gimple_call_lhs_ptr (stmt), callback_op, wi, pset);
296 callback_op, wi, pset);
303 pset);
[all...]
H A Dgimple-walk.h39 hash_set<tree> *pset; member in struct:walk_stmt_info
H A Dregrename.c295 merge_overlapping_regs (HARD_REG_SET *pset, struct du_head *head) argument
299 IOR_HARD_REG_SET (*pset, head->hard_conflicts);
306 SET_HARD_REG_BIT (*pset, other->regno + j);
982 verify_reg_in_set (rtx op, HARD_REG_SET *pset) argument
993 if (TEST_HARD_REG_BIT (*pset, regno + nregs))
H A Drtlanal.c1186 find_all_hard_regs (const_rtx x, HARD_REG_SET *pset)
1193 add_to_hard_reg_set (pset, GET_MODE (x), REGNO (x));
1203 HARD_REG_SET *pset = (HARD_REG_SET *)data;
1205 add_to_hard_reg_set (pset, GET_MODE (x), REGNO (x)); local
1211 find_all_hard_reg_sets (const_rtx insn, HARD_REG_SET *pset, bool implicit)
1215 CLEAR_HARD_REG_SET (*pset);
1216 note_stores (PATTERN (insn), record_hard_reg_sets, pset);
1220 IOR_HARD_REG_SET (*pset, call_used_reg_set);
1223 record_hard_reg_sets (XEXP (link, 0), NULL, pset);
1227 record_hard_reg_sets (XEXP (link, 0), NULL, pset);
1175 find_all_hard_regs(const_rtx x, HARD_REG_SET *pset) argument
1192 HARD_REG_SET *pset = (HARD_REG_SET *)data; local
1200 find_all_hard_reg_sets(const_rtx insn, HARD_REG_SET *pset, bool implicit) argument
[all...]
H A Dtree.c5336 hash_set<tree> *pset;
5401 if (t && !is_lang_specific (t) && !fld->pset->contains (t))
5567 if (!fld->pset->contains (t))
5568 walk_tree (&t, find_decls_types_r, fld, fld->pset);
5622 walk_tree (&c->type_list, find_decls_types_r, fld, fld->pset);
5630 walk_tree (&r->u.allowed.type_list, find_decls_types_r, fld, fld->pset);
5635 find_decls_types_r, fld, fld->pset);
5778 fld.pset = new hash_set<tree>;
5808 delete fld.pset;
11001 result = walk_tree_1 (&(NODE), func, data, pset, l
5315 hash_set<tree> *pset; member in struct:free_lang_data_d
10983 walk_type_fields(tree type, walk_tree_fn func, void *data, hash_set<tree> *pset, walk_tree_lh lh) argument
11065 walk_tree_1(tree *tp, walk_tree_fn func, void *data, hash_set<tree> *pset, walk_tree_lh lh) argument
11421 hash_set<tree> pset; local
[all...]
H A Dreload1.c3998 update_eliminables (HARD_REG_SET *pset)
4064 SET_HARD_REG_BIT (*pset, ep->from);
4072 SET_HARD_REG_BIT (*pset, HARD_FRAME_POINTER_REGNUM);
3982 update_eliminables(HARD_REG_SET *pset) argument
H A Dtree-inline.c3738 wi.pset = &visited_nodes;
5273 wi.pset = &visited;
H A Domp-low.c13131 walk_tree (tp, ipa_simd_modify_stmt_ops, wi, wi->pset);
/haiku-buildtools/gcc/gcc/cp/
H A Dcp-ubsan.c164 hash_set<tree> *pset; member in struct:cp_ubsan_check_member_access_data
183 cp_walk_tree (&base, cp_ubsan_check_member_access_r, ucmd, ucmd->pset);
220 data, ucmd->pset);
231 cp_walk_tree (&t, cp_ubsan_check_member_access_r, data, ucmd->pset);
251 cp_ubsan_check_member_access_r, data, ucmd->pset);
268 hash_set<tree> pset; local
270 ucmd.pset = &pset;
272 cp_walk_tree (t_p, cp_ubsan_check_member_access_r, &ucmd, &pset);
H A Dtree.c2523 hash_set<tree> *pset;
2591 hash_set<tree> pset;
3734 void *data, hash_set<tree> *pset)
3742 result = cp_walk_tree (&(NODE), func, data, pset); \
2517 hash_set<tree> *pset; member in struct:replace_placeholders_t
2585 hash_set<tree> pset; local
3727 cp_walk_subtrees(tree *tp, int *walk_subtrees_p, walk_tree_fn func, void *data, hash_set<tree> *pset) argument
H A Ddecl.c8426 hash_set<tree> *pset = (hash_set<tree> *)data;
8431 cp_walk_tree (&op, stabilize_save_expr_r, data, pset); local
8446 hash_set<tree> pset;
8448 cp_walk_tree (&size, stabilize_save_expr_r, &pset, &pset);
8411 hash_set<tree> *pset = (hash_set<tree> *)data; local
H A Dcp-tree.h6173 #define cp_walk_tree(tp,func,data,pset) \
6174 walk_tree_1 (tp, func, data, pset, cp_walk_subtrees)
/haiku-buildtools/legacy/gcc/gcc/
H A Dregmove.c112 rtx pset = single_set (insn); local
113 if (pset)
117 rtx use = find_use_as_address (pset, reg, 0);
968 rtx pset;
993 pset = single_set (p);
994 if (pset && SET_DEST (pset) == dst
995 && GET_CODE (SET_SRC (pset)) == PLUS
996 && XEXP (SET_SRC (pset), 0) == src
997 && GET_CODE (XEXP (SET_SRC (pset),
963 rtx pset; local
1417 rtx pset; local
[all...]
H A Dreload1.c3665 update_eliminables (pset)
3666 HARD_REG_SET *pset;
3730 SET_HARD_REG_BIT (*pset, ep->from);
3739 SET_HARD_REG_BIT (*pset, HARD_FRAME_POINTER_REGNUM);
/haiku-buildtools/jam/
H A Djamgram.yy68 # define pset( l,r,a ) parse_make( compile_set,l,r,P0,S0,S0,a )
120 { $$.parse = pset( $1.parse, $3.parse, $2.number ); }
H A Djamgram.y114 # define pset( l,r,a ) parse_make( compile_set,l,r,P0,S0,S0,a )
166 { $$.parse = pset( $1.parse, $3.parse, $2.number ); }
H A Djamgram.c203 # define pset( l,r,a ) parse_make( compile_set,l,r,P0,S0,S0,a ) macro
1660 { (yyval).parse = pset( (yyvsp[(1) - (4)]).parse, (yyvsp[(3) - (4)]).parse, (yyvsp[(2) - (4)]).number ); }
/haiku-buildtools/legacy/binutils/binutils/
H A Dobjcopy.c1304 struct section_list *pset;
1310 pset = find_section_list (padd->name, FALSE);
1311 if (pset != NULL)
1312 pset->used = TRUE;
1315 if (pset != NULL && pset->set_flags)
1316 flags = pset->flags | SEC_HAS_CONTENTS;
1342 if (pset != NULL)
1344 if (pset->change_vma != CHANGE_IGNORE)
1346 pset
1302 struct section_list *pset; local
[all...]
/haiku-buildtools/binutils/binutils/
H A Dobjcopy.c2054 struct section_list *pset;
2060 pset = find_section_list (padd->name, FALSE,
2062 if (pset != NULL)
2063 flags = pset->flags | SEC_HAS_CONTENTS;
2098 pset = find_section_list (padd->name, FALSE,
2100 if (pset != NULL
2101 && ! bfd_set_section_vma (obfd, padd->section, pset->vma_val))
2107 pset = find_section_list (padd->name, FALSE,
2109 if (pset != NULL)
2111 padd->section->lma = pset
2052 struct section_list *pset; local
[all...]

Completed in 302 milliseconds