Searched refs:pointer_map_contains (Results 1 - 20 of 20) sorted by relevance
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/ |
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 | 190 n = (tree *) pointer_map_contains (id->decl_map, name); 270 n = (tree *) pointer_map_contains (id->decl_map, decl); 451 node = (tree *) pointer_map_contains (id->decl_map, type); 481 node = (tree *) pointer_map_contains (id->decl_map, type); 815 n = (tree *) pointer_map_contains (id->decl_map, decl); 1029 n = (tree *) pointer_map_contains (id->decl_map, decl); 1048 n = (tree *) pointer_map_contains (id->decl_map, decl); 1111 n = (tree *) pointer_map_contains (id->decl_map, 1169 slot = pointer_map_contains (id->eh_map, old_r); 1358 n = (tree *) pointer_map_contains (i [all...] |
H A D | pointer-set.c | 230 pointer_map_contains (const struct pointer_map_t *pmap, const void *p) 229 pointer_map_contains (const struct pointer_map_t *pmap, const void *p) function
|
H A D | tree-ssa.c | 97 slot = pointer_map_contains (edge_var_maps, e); 124 old_slot = pointer_map_contains (edge_var_maps, olde); 148 slot = pointer_map_contains (edge_var_maps, e);
|
H A D | predict.c | 385 void **preds = pointer_map_contains (bb_predictions, bb); 511 preds = pointer_map_contains (bb_predictions, e->src); 537 void **preds = pointer_map_contains (bb_predictions, bb); 810 preds = pointer_map_contains (bb_predictions, bb);
|
H A D | gimple.c | 3549 if ((slot = pointer_map_contains (type_hash_cache, t))) 3552 if ((slot = pointer_map_contains (sccstate, t)) != NULL) 3561 cstate = (struct sccs *)* pointer_map_contains (sccstate, t); 3618 gcc_assert (!pointer_map_contains (type_hash_cache, type) 3619 && !pointer_map_contains (sccstate, type)); 3751 gcc_assert (!pointer_map_contains (type_hash_cache, x)); 3752 cstate = (struct sccs *)*pointer_map_contains (sccstate, x); 3785 if ((slot = pointer_map_contains (type_hash_cache, p)) != NULL)
|
H A D | lto-cgraph.c | 84 slot = pointer_map_contains (encoder->map, node); 106 void **slot = pointer_map_contains (encoder->map, node);
|
H A D | tree-nested.c | 282 slot = pointer_map_contains (info->field_map, decl); 517 slot = pointer_map_contains (info->var_map, decl); 1829 slot = pointer_map_contains (info->var_map, label); 2123 void **slot = pointer_map_contains (nid->root->var_map, decl); 2157 slot = pointer_map_contains (root->var_map, t);
|
H A D | omp-low.c | 693 n = (tree *) pointer_map_contains (ctx->cb.decl_map, var); 701 n = (tree *) pointer_map_contains (ctx->cb.decl_map, var); 6291 p = (tree *) pointer_map_contains (tcctx.cb.decl_map, decl); 6296 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); 6315 f = *(tree *) pointer_map_contains (tcctx.cb.decl_map, f); 6319 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); 6336 f = *(tree *) pointer_map_contains (tcctx.cb.decl_map, f); 6342 sf = *(tree *) pointer_map_contains (tcctx.cb.decl_map, sf); 6362 f = *(tree *) pointer_map_contains (tcctx.cb.decl_map, f); 6368 sf = *(tree *) pointer_map_contains (tcct [all...] |
H A D | tree-eh.c | 456 slot = pointer_map_contains (tf->goto_queue_map, stmt.g); 1446 slot = pointer_map_contains (cont_map, last_case); 2664 slot = pointer_map_contains (map, old_lp); 2673 slot = pointer_map_contains (map, old_r); 2917 slot = pointer_map_contains (mnt_map, dst_r);
|
H A D | tree-ssa-loop-im.c | 218 void **p = pointer_map_contains (lim_aux_data_map, stmt); 243 void **p = pointer_map_contains (lim_aux_data_map, stmt);
|
H A D | tree-cfg.c | 887 slot = pointer_map_contains (edge_to_cases, e); 910 return (tree) *pointer_map_contains (edge_to_cases, e); 5402 loc = pointer_map_contains (vars_map, t); 5441 loc = pointer_map_contains (vars_map, name); 5549 slot = pointer_map_contains (p->eh_map, old_r);
|
H A D | dominance.c | 1339 dom_i = (size_t) *pointer_map_contains (map, dom);
|
H A D | cfgexpand.c | 454 && (part = (bitmap *) pointer_map_contains (decls_to_partitions, 1513 elt = pointer_map_contains (lab_rtx_for_bb, bb); 3178 elt = pointer_map_contains (lab_rtx_for_bb, bb);
|
H A D | alias.c | 301 namep = pointer_map_contains (cfun->gimple_df->decls_to_pointers, base);
|
H A D | tree-ssa-reassoc.c | 195 void **slot = pointer_map_contains (operand_rank, e);
|
H A D | tree-sra.c | 427 slot = pointer_map_contains (base_access_vec, base); 727 slot = pointer_map_contains (base_access_vec, base);
|
H A D | tree-ssa-structalias.c | 2619 void **slot = pointer_map_contains (vi_for_tree, t); 2666 void **slot = pointer_map_contains (vi_for_tree, t);
|
H A D | tree-ssa-loop-ivopts.c | 722 slot = pointer_map_contains (data->niters, exit);
|
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/lto/ |
H A D | lto.c | 563 slot = pointer_map_contains (pmap, file_data);
|
Completed in 475 milliseconds