| /dflybsd-src/contrib/gcc-4.7/gcc/ |
| H A D | ipa-utils.c | 394 slot = pointer_map_contains (set->map, node); in cgraph_node_set_remove()
407 last_slot = pointer_map_contains (set->map, last_node); in cgraph_node_set_remove()
429 slot = pointer_map_contains (set->map, node); in cgraph_node_set_find()
523 slot = pointer_map_contains (set->map, node); in varpool_node_set_remove()
536 last_slot = pointer_map_contains (set->map, last_node); in varpool_node_set_remove()
558 slot = pointer_map_contains (set->map, node); in varpool_node_set_find()
|
| H A D | pointer-set.h | 37 void **pointer_map_contains (const struct pointer_map_t *pmap, const void *p);
|
| H A D | tree-inline.c | 185 n = (tree *) pointer_map_contains (id->decl_map, name); in remap_ssa_name()
201 n = (tree *) pointer_map_contains (id->decl_map, val); in remap_ssa_name()
302 n = (tree *) pointer_map_contains (id->decl_map, decl); in remap_decl()
487 node = (tree *) pointer_map_contains (id->decl_map, type); in remap_type()
517 node = (tree *) pointer_map_contains (id->decl_map, type); in remapped_type()
825 tree *n = (tree *) pointer_map_contains (id->decl_map, *tp); in remap_gimple_op_r()
1044 n = (tree *) pointer_map_contains (id->decl_map, decl); in copy_tree_body_r()
1063 n = (tree *) pointer_map_contains (id->decl_map, decl); in copy_tree_body_r()
1113 n = (tree *) pointer_map_contains (id->decl_map, decl); in copy_tree_body_r()
1147 n = (tree *) pointer_map_contains (id->decl_map, in copy_tree_body_r()
[all …]
|
| H A D | tree-nested.c | 281 slot = pointer_map_contains (info->field_map, decl); in lookup_field_for_decl()
516 slot = pointer_map_contains (info->var_map, decl); in lookup_tramp_for_decl()
1848 slot = pointer_map_contains (info->var_map, label); in convert_nl_goto_receiver()
2160 void **slot = pointer_map_contains (nid->root->var_map, decl); in nesting_copy_decl()
2194 slot = pointer_map_contains (root->var_map, t); in contains_remapped_vars()
2227 if (pointer_map_contains (root->var_map, TREE_OPERAND (val, 0)) in remap_vla_decls()
2255 slot = pointer_map_contains (root->var_map, TREE_OPERAND (val, 0)); in remap_vla_decls()
|
| H A D | tree-streamer.c | 216 slot = pointer_map_contains (cache->node_map, t); in streamer_tree_cache_lookup()
|
| H A D | ifcvt.c | 2741 && pointer_map_contains (vals, src)) in check_cond_move_block()
2743 && pointer_map_contains (vals, SUBREG_REG (src)))) in check_cond_move_block()
2748 if (pointer_map_contains (vals, dest)) in check_cond_move_block()
2805 then_slot = pointer_map_contains (then_vals, dest); in cond_move_convert_if_block()
2806 else_slot = pointer_map_contains (else_vals, dest); in cond_move_convert_if_block()
2881 void **then_slot = pointer_map_contains (then_vals, reg); in cond_move_process_if_block()
2882 void **else_slot = pointer_map_contains (else_vals, reg); in cond_move_process_if_block()
2900 gcc_checking_assert (pointer_map_contains (else_vals, reg)); in cond_move_process_if_block()
2901 if (!pointer_map_contains (then_vals, reg)) in cond_move_process_if_block()
|
| H A D | pointer-set.c | 229 pointer_map_contains (const struct pointer_map_t *pmap, const void *p) in pointer_map_contains() function
|
| H A D | predict.c | 424 void **preds = pointer_map_contains (bb_predictions, bb); in gimple_predicted_by_p()
550 preds = pointer_map_contains (bb_predictions, e->src); in remove_predictions_associated_with_edge()
576 void **preds = pointer_map_contains (bb_predictions, bb); in clear_bb_predictions()
849 preds = pointer_map_contains (bb_predictions, bb); in combine_predictions_for_bb()
|
| H A D | lto-cgraph.c | 112 slot = pointer_map_contains (encoder->map, node); in lto_cgraph_encoder_encode()
135 void **slot = pointer_map_contains (encoder->map, node); in lto_cgraph_encoder_lookup()
206 slot = pointer_map_contains (encoder->map, node); in lto_varpool_encoder_encode()
227 void **slot = pointer_map_contains (encoder->map, node); in lto_varpool_encoder_lookup()
|
| H A D | tree-ssa.c | 95 slot = pointer_map_contains (edge_var_maps, e); in redirect_edge_var_map_clear()
122 old_slot = pointer_map_contains (edge_var_maps, olde); in redirect_edge_var_map_dup()
146 slot = pointer_map_contains (edge_var_maps, e); in redirect_edge_var_map_vector()
|
| H A D | omp-low.c | 691 n = (tree *) pointer_map_contains (ctx->cb.decl_map, var); in lookup_decl()
699 n = (tree *) pointer_map_contains (ctx->cb.decl_map, var); in maybe_lookup_decl()
6556 p = (tree *) pointer_map_contains (tcctx.cb.decl_map, decl); in create_task_copyfn()
6561 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); in create_task_copyfn()
6580 f = *(tree *) pointer_map_contains (tcctx.cb.decl_map, f); in create_task_copyfn()
6584 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); in create_task_copyfn()
6601 f = *(tree *) pointer_map_contains (tcctx.cb.decl_map, f); in create_task_copyfn()
6607 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); in create_task_copyfn()
6627 f = *(tree *) pointer_map_contains (tcctx.cb.decl_map, f); in create_task_copyfn()
6633 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); in create_task_copyfn()
[all …]
|
| H A D | gimple.c | 3485 if ((slot = pointer_map_contains (sccstate, p)) != NULL) in gtc_visit()
3492 cstate = (struct sccs *)* pointer_map_contains (sccstate, p); in gtc_visit()
3802 cstate = (struct sccs *)*pointer_map_contains (sccstate, x); in gimple_types_compatible_p_1()
3949 if ((slot = pointer_map_contains (sccstate, t)) != NULL) in visit()
3958 cstate = (struct sccs *)* pointer_map_contains (sccstate, t); in visit()
4036 gcc_checking_assert (!pointer_map_contains (sccstate, type)); in iterative_hash_gimple_type()
4180 cstate = (struct sccs *)*pointer_map_contains (sccstate, x); in iterative_hash_gimple_type()
4187 cstate = (struct sccs *)*pointer_map_contains (sccstate, x); in iterative_hash_gimple_type()
|
| H A D | cfgexpand.c | 406 size_t *v = (size_t *) pointer_map_contains (decl_to_stack_part, op); in visit_op()
427 (size_t *) pointer_map_contains (decl_to_stack_part, op); in visit_conflict()
479 pointer_map_contains (decl_to_stack_part, lhs))) in add_scope_conflicts_1()
638 && (part = (bitmap *) pointer_map_contains (decls_to_partitions, in add_partitioned_vars_to_ptset()
1734 elt = pointer_map_contains (lab_rtx_for_bb, bb); in label_rtx_for_bb()
3804 elt = pointer_map_contains (lab_rtx_for_bb, bb); in expand_gimple_basic_block()
|
| H A D | tree-eh.c | 439 slot = pointer_map_contains (tf->goto_queue_map, stmt.g); in find_goto_replacement()
1477 slot = pointer_map_contains (cont_map, last_case); in lower_try_finally_switch()
2780 slot = pointer_map_contains (map, old_lp); in maybe_duplicate_eh_stmt_fn()
2789 slot = pointer_map_contains (map, old_r); in maybe_duplicate_eh_stmt_fn()
3035 slot = pointer_map_contains (mnt_map, dst_r); in lower_resx()
|
| H A D | alias.c | 294 namep = pointer_map_contains (cfun->gimple_df->decls_to_pointers, base); in ao_ref_from_mem()
305 namep = pointer_map_contains (cfun->gimple_df->decls_to_pointers, in ao_ref_from_mem()
|
| H A D | tree-cfg.c | 914 slot = pointer_map_contains (edge_to_cases, e); in get_cases_for_edge()
937 return (tree) *pointer_map_contains (edge_to_cases, e); in get_cases_for_edge()
5809 loc = pointer_map_contains (vars_map, t); in replace_by_duplicate_decl()
5848 loc = pointer_map_contains (vars_map, name); in replace_ssa_name()
5956 slot = pointer_map_contains (p->eh_map, old_r); in move_stmt_eh_region_nr()
|
| H A D | tree-ssa-loop-im.c | 215 void **p = pointer_map_contains (lim_aux_data_map, stmt); in get_lim_data()
240 void **p = pointer_map_contains (lim_aux_data_map, stmt); in clear_lim_data()
|
| H A D | dominance.c | 1356 dom_i = (size_t) *pointer_map_contains (map, dom); in iterate_fix_dominators()
|
| H A D | tree-sra.c | 465 slot = pointer_map_contains (base_access_vec, base); in VEC()
801 slot = pointer_map_contains (base_access_vec, base); in create_access_1()
|
| H A D | tree-ssa-structalias.c | 413 slot_p = pointer_map_contains (call_stmt_vars, call); in lookup_call_use_vi()
2668 void **slot = pointer_map_contains (vi_for_tree, t); in lookup_vi_for_tree()
2719 void **slot = pointer_map_contains (vi_for_tree, t); in get_vi_for_tree()
|
| H A D | tree-ssa-reassoc.c | 310 void **slot = pointer_map_contains (operand_rank, e); in find_operand_rank()
|
| H A D | dse.c | 1015 = pointer_map_contains (cfun->gimple_df->decls_to_pointers, decl); in local_variable_can_escape()
|
| H A D | tree-ssa-loop-ivopts.c | 792 slot = pointer_map_contains (data->niters, exit); in niter_for_exit()
|
| H A D | gimplify.c | 131 = pointer_map_contains (cfun->gimple_df->decls_to_pointers, x); in mark_addressable()
|
| /dflybsd-src/contrib/gcc-4.7/gcc/lto/ |
| H A D | lto.c | 1641 slot = pointer_map_contains (pmap, file_data); in lto_1_to_1_map()
1672 slot = pointer_map_contains (pmap, file_data); in lto_1_to_1_map()
|