Searched refs:get_or_insert (Results 1 - 25 of 30) sorted by relevance

12

/haiku-buildtools/gcc/gcc/
H A D	sanopt.c	329 auto_vec<gimple> &v = ctx->null_check_map.get_or_insert (ptr); 385 auto_vec<gimple> &v = ctx->vptr_check_map.get_or_insert (triplet); 496 auto_vec<gimple> *ptr_checks = &ctx->asan_check_map.get_or_insert (ptr); 502 base_checks = &ctx->asan_check_map.get_or_insert (base_addr);
H A D	alloc-pool.c	96 return &alloc_pool_hash->get_or_insert (name);
H A D	lto-section-out.c	194 = encoder->tree_hash_table->get_or_insert (name, &existed_p);
H A D	tree-streamer.c	169 unsigned int &ix = cache->node_map->get_or_insert (t, &existed_p);
H A D	symbol-summary.h	247 T **v = &m_map.get_or_insert (uid, &existed);
H A D	hash-map.h	229 Value &get_or_insert (const Key &k, bool *existed = NULL) function
H A D	tree-ssa-uncprop.c	354 val_ssa_equiv->get_or_insert (value).safe_push (equivalence);
H A D	ipa-icf-gimple.c	177 edge &slot = m_edge_map.get_or_insert (e1, &existed_p); 223 tree &slot = m_decl_map.get_or_insert (t1, &existed_p);
H A D	tree-nested.c	324 tree *slot = &info->field_map->get_or_insert (decl); 557 tree *slot = &info->var_map->get_or_insert (decl); 867 tree *slot = &info->var_map->get_or_insert (decl); 1521 tree *slot = &info->var_map->get_or_insert (decl); 2137 tree *slot = &i->var_map->get_or_insert (label);
H A D	symtab.c	1129 entry = &comdat_head_map.get_or_insert (node->get_comdat_group (), 1407 = &symtab->init_priority_hash->get_or_insert (this, &existed);
H A D	tree-ssa.c	86 auto_vec<edge_var_map> &slot = edge_var_maps->get_or_insert (e); 122 auto_vec<edge_var_map> *new_head = &edge_var_maps->get_or_insert (newe);
H A D	tree-affine.c	694 name_expansion **slot = &(*cache)->get_or_insert (e);
H A D	tree-if-conv.c	1791 phi_arg_map.get_or_insert (arg).safe_push (i);
H A D	predict.c	596 edge_prediction *&preds = bb_predictions->get_or_insert (e->src);
H A D	lto-streamer-out.c	531 sccs **slot = &sccstate.get_or_insert (expr);
H A D	except.c	724 tree *slot = &type_to_runtime_map->get_or_insert (type, &existed);
H A D	tree-ssa-strlen.c	359 stridxlist *list = &decl_to_stridxlist_htab->get_or_insert (base, &existed);
H A D	ipa-icf.c	2771 vec <sem_item *> *slot = &split_map.get_or_insert (collection);
H A D	tree-ssa-structalias.c	446 varinfo_t *slot_p = &call_stmt_vars->get_or_insert (call, &existed); 6091 pt_solution **slot = &final_solutions->get_or_insert (vi);
H A D	cfgexpand.c	1774 tree *slot = &ssa_name_decls.get_or_insert (TREE_TYPE (var)); 3836 tree &vexpr = deep_ter_debug_map->get_or_insert (use);
H A D	tree-cfg.c	1223 tree &s = edge_to_cases->get_or_insert (this_edge); 6353 tree &loc = vars_map->get_or_insert (t, &existed);
H A D	genmatch.c	2946 unsigned &num = capture_ids->get_or_insert (id, &existed);
H A D	tree-sra.c	873 base_access_vec->get_or_insert (base).safe_push (access);
/haiku-buildtools/gcc/gcc/lto/
H A D	lto-partition.c	313 ltrans_partition *slot = &pmap.get_or_insert (file_data);
/haiku-buildtools/gcc/gcc/config/m32c/
H A D	m32c.c	3094 unsigned int *slot = &pragma_htab->get_or_insert (name);

Completed in 479 milliseconds

12

Indexes created Wed Aug 28 06:45:35 MDT 2024