tree 77b1e642a7ffbcc1d825cee13ffcdf975c838536
parent 30bfd48aeffa6465d2de0e927cdfc6205c1f1fd2
author Lukas Anzinger <lukas@lukasanzinger.at> 1400431219 +0200
committer Lucas De Marchi <lucas.demarchi@intel.com> 1400439890 -0300

Fix use-after-free in hash implementation.

If a value is added to the hash under a key that already exists the new value
replaces the old value for that key. Since key can be a pointer to data that
is part of value and freed by hash->free_value(), the key must be also
replaced and not only the value. Otherwise key potentially points to freed data.