Fixed warnings.

ir/ana/irmemory.c

@@ -764,7 +764,7 @@ ir_alias_relation get_alias_relation_ex(
 
 	key.result = get_alias_relation(adr1, mode1, adr2, mode2);
 
-	set_insert(mem_disambig_entry, result_cache, &key, sizeof(key), HASH_ENTRY(adr1, adr2));
+	(void)set_insert(mem_disambig_entry, result_cache, &key, sizeof(key), HASH_ENTRY(adr1, adr2));
 	return key.result;
 }
 

ir/be/beabi.c

@@ -196,11 +196,11 @@ static void remember_call_arg(be_abi_call_arg_t *arg, be_abi_call_t *call, be_ab
 	unsigned hash = arg->is_res * 128 + arg->pos;
 	if (context & ABI_CONTEXT_CALLEE) {
 		arg->callee = 1;
-		set_insert(be_abi_call_arg_t, call->params, arg, sizeof(*arg), hash);
+		(void)set_insert(be_abi_call_arg_t, call->params, arg, sizeof(*arg), hash);
 	}
 	if (context & ABI_CONTEXT_CALLER) {
 		arg->callee = 0;
-		set_insert(be_abi_call_arg_t, call->params, arg, sizeof(*arg), hash);
+		(void)set_insert(be_abi_call_arg_t, call->params, arg, sizeof(*arg), hash);
 	}
 }
 

ir/be/becopyheur.c

@@ -126,7 +126,7 @@ static inline void qnode_add_conflict(const qnode_t *qn, const ir_node *n1, cons
 		c.n1 = n2;
 		c.n2 = n1;
 	}
-	set_insert(conflict_t, qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
+	(void)set_insert(conflict_t, qn->conflicts, &c, sizeof(c), HASH_CONFLICT(c));
 }
 
 /**

ir/be/bessadestr.c

@@ -140,7 +140,7 @@ static void insert_all_perms_walker(ir_node *bl, void *data)
 			 */
 			if (!pp && !be_is_live_in(lv, bl, arg)) {
 				templ.pos = n_projs++;
-				set_insert(perm_proj_t, arg_set, &templ, sizeof(templ), hash);
+				(void)set_insert(perm_proj_t, arg_set, &templ, sizeof(templ), hash);
 			}
 		}
 

ir/ir/irio.c

@@ -199,7 +199,7 @@ static void symtbl_init(void)
 	key.str = (s);                                               \
 	key.typetag = (tt);                                          \
 	key.code = (cod);                                            \
-	set_insert(symbol_t, symtbl, &key, sizeof(key), hash_str(s) + tt * 17)
+	(void)set_insert(symbol_t, symtbl, &key, sizeof(key), hash_str(s) + tt * 17)
 
 #define INSERTENUM(tt, e) INSERT(tt, #e, e)
 #define INSERTKEYWORD(k) INSERT(tt_keyword, #k, kw_##k)
@@ -1463,7 +1463,7 @@ static void set_id(read_env_t *env, long id, void *elem)
 	id_entry key;
 	key.id = id;
 	key.elem = elem;
-	set_insert(id_entry, env->idset, &key, sizeof(key), (unsigned) id);
+	(void)set_insert(id_entry, env->idset, &key, sizeof(key), (unsigned) id);
 }
 
 static ir_node *get_node_or_null(read_env_t *env, long nodenr)

ir/ir/irprofile.c

@@ -557,7 +557,7 @@ static void block_associate_walker(ir_node *bb, void *env)
 	query.count = b->counters[(b->i)++];
 	DBG((dbg, LEVEL_4, "execcount(%+F, %u): %u\n", bb, query.block,
 	    query.count));
-	set_insert(execcount_t, profile, &query, sizeof(query), query.block);
+	(void)set_insert(execcount_t, profile, &query, sizeof(query), query.block);
 }
 
 static void irp_associate_blocks(block_assoc_t *env)

ir/opt/ldstopt.c

@@ -1746,7 +1746,7 @@ static void move_loads_out_of_loops(scc *pscc, loop_env *env)
 					} else {
 						irn = new_rd_Load(db, pred, get_Phi_pred(phi, pos), ptr, load_mode, cons_none);
 						entry.load = irn;
-						set_insert(avail_entry_t, avail, &entry, sizeof(entry), hash_cache_entry(&entry));
+						(void)set_insert(avail_entry_t, avail, &entry, sizeof(entry), hash_cache_entry(&entry));
 						DB((dbg, LEVEL_1, "  Created %+F in %+F\n", irn, pred));
 					}
 					pe->load = irn;

ir/opt/opt_osr.c

@@ -164,7 +164,7 @@ static void LFTR_add(ir_node *src, ir_node *dst, unsigned code, ir_node *rc, iv_
 	 * There might be more than one edge here. This is rather bad
 	 * because we currently store only one.
 	 */
-	set_insert(LFTR_edge, env->lftr_edges, &key, sizeof(key), hash_ptr(src));
+	(void)set_insert(LFTR_edge, env->lftr_edges, &key, sizeof(key), hash_ptr(src));
 }  /* LFTR_add */
 
 /**
@@ -277,7 +277,7 @@ static void add(unsigned code, ir_node *op1, ir_node *op2, ir_node *result, iv_e
 	key.op2  = op2;
 	key.res  = result;
 
-	set_insert(quadruple_t, env->quad_map, &key, sizeof(key), (code * 9) ^ hash_ptr(op1) ^ hash_ptr(op2));
+	(void)set_insert(quadruple_t, env->quad_map, &key, sizeof(key), (code * 9) ^ hash_ptr(op1) ^ hash_ptr(op2));
 }  /* add */
 
 /**

ir/opt/scalar_replace.c

@@ -505,7 +505,7 @@ static unsigned allocate_value_numbers(pset *sels, ir_entity *ent, unsigned vnum
 		} else {
 			key->vnum = vnum++;
 
-			set_insert(path_t, pathes, key, path_size(key), path_hash(key));
+			(void)set_insert(path_t, pathes, key, path_size(key), path_hash(key));
 
 			set_vnum(sel, key->vnum);
 			DB((dbg, SET_LEVEL_3, "  %+F represents value %u\n", sel, key->vnum));
@@ -725,7 +725,7 @@ void scalar_replacement_opt(ir_graph *irg)
 				ent_type = get_entity_type(ent);
 
 				key.ent       = ent;
-				set_insert(scalars_t, set_ent, &key, sizeof(key), hash_ptr(key.ent));
+				(void)set_insert(scalars_t, set_ent, &key, sizeof(key), hash_ptr(key.ent));
 
 #ifdef DEBUG_libfirm
 				if (is_Array_type(ent_type)) {

ir/stat/firmstat.c

@@ -973,7 +973,7 @@ static unsigned get_adr_mark(graph_entry_t *graph, ir_node *node)
 static void set_adr_mark(graph_entry_t *graph, ir_node *node, unsigned val)
 {
 	address_mark_entry_t const value = { node, val };
-	set_insert(address_mark_entry_t, graph->address_mark, &value, sizeof(value), hash_ptr(node));
+	(void)set_insert(address_mark_entry_t, graph->address_mark, &value, sizeof(value), hash_ptr(node));
 }  /* set_adr_mark */
 
 #undef DUMP_ADR_MODE