Searched refs:hstate (Results 1 - 15 of 15) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Drtlhash.c34 add_rtx (const_rtx x, hash &hstate) argument
44 hstate.add_object (code);
46 hstate.add_object (mode);
50 hstate.add_int (REGNO (x));
53 hstate.add_object (INTVAL (x));
57 hstate.add_object (CONST_WIDE_INT_ELT (x, i));
61 hstate.add (XSTR (x, 0), strlen (XSTR (x, 0)) + 1);
81 hstate.add_object (XWINT (x, i));
85 hstate.add_object (XINT (x, i));
90 hstate
92 inchash::add_rtx (XVECEXP (x, i, j), hstate); local
95 inchash::add_rtx (XEXP (x, i), hstate); local
[all...]
H A Dlto-streamer-out.c955 inchash::hash hstate; local
961 hstate.add_int (0); \
963 hstate.add_int (streamer_tree_cache_get_hash (cache, ix)); \
965 hstate.add_int (*map->get (SIBLING)); \
967 hstate.add_int (1); \
972 hstate.add_int (code);
975 hstate.add_flag (TREE_SIDE_EFFECTS (t));
976 hstate.add_flag (TREE_CONSTANT (t));
977 hstate.add_flag (TREE_READONLY (t));
978 hstate
[all...]
H A Dipa-icf.c305 inchash::hash hstate; local
307 hstate.add_int (basic_block->nondbg_stmt_count);
308 hstate.add_int (basic_block->edge_count);
310 return hstate.end ();
320 inchash::hash hstate; local
321 hstate.add_int (177454); /* Random number for function type. */
323 hstate.add_int (arg_count);
324 hstate.add_int (cfg_checksum);
325 hstate.add_int (gcode_hash);
328 hstate
1250 inchash::hash hstate; local
1293 add_expr(const_tree exp, inchash::hash &hstate) argument
1372 add_type(const_tree type, inchash::hash &hstate) argument
1390 sem_item::add_type (TREE_TYPE (type), hstate); local
1402 sem_item::add_type (TREE_TYPE (type), hstate); local
1408 sem_item::add_type (TREE_TYPE (type), hstate); local
1444 hash_stmt(gimple stmt, inchash::hash &hstate) argument
1468 add_expr (gimple_assign_rhs3 (stmt), hstate); local
1471 add_expr (gimple_assign_lhs (stmt), hstate); local
1484 add_expr (gimple_op (stmt, i), hstate); local
1970 inchash::hash hstate; local
[all...]
H A Dtree-ssa-sccvn.h145 inchash::hash hstate; local
146 inchash::add_expr (constant, hstate);
147 hstate.merge_hash (vn_hash_type (TREE_TYPE (constant)));
148 return hstate.end ();
H A Dipa-icf.h95 inchash::hash hstate; local
96 hstate.add_int (v->m_references.length ());
99 hstate.add_int (v->m_references[i]->ultimate_alias_target ()->order);
101 hstate.add_int (v->m_interposables.length ());
104 hstate.add_int (v->m_interposables[i]->ultimate_alias_target ()->order);
106 return hstate.end ();
247 static void add_expr (const_tree exp, inchash::hash &hstate);
249 static void add_type (const_tree t, inchash::hash &hstate);
H A Dtree-ssa-dom.c581 add_expr_commutative (const_tree t1, const_tree t2, hash &hstate) argument
587 hstate.add_commutative (one, two);
597 add_hashable_expr (const struct hashable_expr *expr, hash &hstate) argument
602 inchash::add_expr (expr->ops.single.rhs, hstate);
606 hstate.add_object (expr->ops.unary.op);
614 hstate.add_int (TYPE_UNSIGNED (expr->type));
616 inchash::add_expr (expr->ops.unary.opnd, hstate);
620 hstate.add_object (expr->ops.binary.op);
623 expr->ops.binary.opnd1, hstate);
626 inchash::add_expr (expr->ops.binary.opnd0, hstate);
655 inchash::add_expr (gimple_call_fn (fn_from), hstate); local
2733 inchash::hash hstate; local
[all...]
H A Dsanopt.c137 inchash::hash hstate (0);
138 inchash::add_expr (ref.t1, hstate);
139 inchash::add_expr (ref.t2, hstate);
140 inchash::add_expr (ref.t3, hstate);
141 return hstate.end ();
H A Dtree-ssa-tail-merge.c475 inchash::hash hstate (bitmap_hash (e->succs));
495 hstate.add_int (gimple_code (stmt));
497 hstate.add_int (gimple_assign_rhs_code (stmt));
501 hstate.add_int (gimple_call_internal_fn (stmt));
504 inchash::add_expr (gimple_call_fn (stmt), hstate); local
506 inchash::add_expr (gimple_call_chain (stmt), hstate); local
512 inchash::add_expr (arg, hstate);
516 hstate.add_int (size);
523 hstate.add_int (flags);
543 return hstate
[all...]
H A Dtree.c4755 inchash::hash hstate;
4783 hstate.add_int (code);
4785 hstate.add_object (TYPE_HASH (TREE_TYPE (ntype)));
4786 attribute_hash_list (attribute, hstate);
4791 type_hash_list (TYPE_ARG_TYPES (ntype), hstate);
4795 hstate.add_object (TYPE_HASH (TYPE_DOMAIN (ntype)));
4800 hstate.add_object (TREE_INT_CST_ELT (t, i));
4806 hstate.add_object (precision);
4813 ntype = type_hash_canon (hstate.end(), ntype);
6824 type_hash_list (const_tree list, inchash::hash &hstate)
4734 inchash::hash hstate; local
4770 type_hash_list (TYPE_ARG_TYPES (ntype), hstate); local
6801 type_hash_list(const_tree list, inchash::hash &hstate) argument
6989 attribute_hash_list(const_tree list, inchash::hash &hstate) argument
7518 add_expr(const_tree t, inchash::hash &hstate) argument
7559 inchash::add_expr (TREE_REALPART (t), hstate); local
7560 inchash::add_expr (TREE_IMAGPART (t), hstate); local
7566 inchash::add_expr (VECTOR_CST_ELT (t, i), hstate); local
7580 inchash::add_expr (TREE_VALUE (t), hstate); local
7644 inchash::add_expr (TREE_OPERAND (t, i), hstate); local
7841 inchash::hash hstate; local
7869 inchash::add_expr (TYPE_MIN_VALUE (itype), hstate); local
7870 inchash::add_expr (TYPE_MAX_VALUE (itype), hstate); local
7977 inchash::hash hstate; local
8121 inchash::hash hstate; local
8276 inchash::hash hstate; local
8344 inchash::hash hstate; local
8381 inchash::hash hstate; local
9533 inchash::hash hstate; local
[all...]
H A Dtree-ssa-sccvn.c629 vn_reference_op_compute_hash (const vn_reference_op_t vro1, inchash::hash &hstate) argument
631 hstate.add_int (vro1->opcode);
633 inchash::add_expr (vro1->op0, hstate);
635 inchash::add_expr (vro1->op1, hstate);
637 inchash::add_expr (vro1->op2, hstate);
645 inchash::hash hstate; local
668 hstate.add_int (off);
676 hstate.add_int (TREE_CODE (op));
677 inchash::add_expr (op, hstate);
681 vn_reference_op_compute_hash (vro, hstate);
2364 inchash::hash hstate; local
[all...]
H A Dipa-devirt.c396 inchash::hash hstate; local
406 add_expr (TREE_OPERAND (v, 1), hstate);
410 hstate.add_wide_int (IDENTIFIER_HASH_VALUE (DECL_ASSEMBLER_NAME (v)));
411 return hstate.end ();
2523 inchash::hash hstate (odr_query->otr_token);
2525 hstate.add_wide_int (odr_query->type->id);
2526 hstate.merge_hash (TYPE_UID (odr_query->context.outer_type));
2527 hstate.add_wide_int (odr_query->context.offset);
2531 hstate.merge_hash (TYPE_UID (odr_query->context.speculative_outer_type));
2532 hstate
[all...]
H A Ddwarf2out.c4281 inchash::hash hstate;
4285 hstate.add_int (0);
4288 hstate.add_int (1);
4295 inchash::add_rtx (a->addr.rtl, hstate);
4296 return hstate.end ();
5709 inchash::hash hstate;
5714 hash_loc_operands (loc, hstate);
5715 hash = hstate.end();
5927 inchash::hash hstate;
5932 hash_loc_operands (loc, hstate);
4273 inchash::hash hstate; local
5699 inchash::hash hstate; local
5917 inchash::hash hstate; local
24055 hash_loc_operands(dw_loc_descr_ref loc, inchash::hash &hstate) argument
24260 hash_locs(dw_loc_descr_ref loc, inchash::hash &hstate) argument
24286 inchash::hash hstate; local
[all...]
H A Dtree.h4511 inchash::hash hstate (seed);
4512 inchash::add_expr (tree, hstate);
4513 return hstate.end ();
/haiku-buildtools/legacy/gcc/gcc/ch/
H A Dexcept.c198 register struct handler_state *hstate;
207 hstate = free_handlers;
208 free_handlers = hstate->next;
212 hstate =
216 hstate->next = current_handler;
217 current_handler = hstate;
218 hstate->prev_on_alternative = 0;
219 hstate->else_handler = 0;
220 hstate->on_alt_list = NULL_TREE;
221 hstate
197 register struct handler_state *hstate; local
[all...]
/haiku-buildtools/gcc/gcc/lto/
H A Dlto.c298 static void iterative_hash_canonical_type (tree type, inchash::hash &hstate);
310 inchash::hash hstate; local
316 hstate.add_int (TREE_CODE (type));
317 hstate.add_int (TYPE_MODE (type));
326 hstate.add_int (TYPE_UNSIGNED (type));
327 hstate.add_int (TYPE_PRECISION (type));
332 hstate.add_int (TYPE_VECTOR_SUBPARTS (type));
333 hstate.add_int (TYPE_UNSIGNED (type));
337 hstate.add_int (TYPE_UNSIGNED (type));
343 hstate
367 iterative_hash_canonical_type (TREE_TYPE (type), hstate); local
377 iterative_hash_canonical_type (TYPE_METHOD_BASETYPE (type), hstate); local
379 iterative_hash_canonical_type (TREE_TYPE (type), hstate); local
383 iterative_hash_canonical_type (TREE_VALUE (p), hstate); local
398 iterative_hash_canonical_type (TREE_TYPE (f), hstate); local
411 iterative_hash_canonical_type(tree type, inchash::hash &hstate) argument
[all...]

Completed in 323 milliseconds