- 25 Jan, 2021 1 commit
-
-
Rosen Penev authored
calloc is faster for big allocations. It's also simpler. Signed-off-by:
Rosen Penev <rosenp@gmail.com>
-
- 08 Jun, 2020 1 commit
-
-
Martin Szulecki authored
-
- 02 Sep, 2019 1 commit
-
-
Nikias Bassen authored
This prevents a UaF in node_list_add. The issue became visible after removing the last (and only) item from a PLIST_DICT or PLIST_ARRAY node, and then adding a new item - the item will not make it into the actual dictionary or array because the list->end pointer points to invalid memory, effectively causing memory corruption.
-
- 21 Jan, 2019 1 commit
-
-
Nikias Bassen authored
-
- 28 Mar, 2017 1 commit
-
-
Nikias Bassen authored
-
- 20 May, 2014 1 commit
-
-
Martin Szulecki authored
-
- 23 Apr, 2012 1 commit
-
-
Nikias Bassen authored
-
- 11 Jan, 2012 1 commit
-
-
Nikias Bassen authored
The corruption occured if you removed the last node from the list and later add a new node to the list.
-
- 25 Jun, 2011 1 commit
-
-
Nikias Bassen authored
-
- 13 Jun, 2011 2 commits
-
-
Nikias Bassen authored
-
Nikias Bassen authored
-
- 27 May, 2011 1 commit
-
-
Nikias Bassen authored
-