mirror of
https://github.com/Motorhead1991/qemu.git
synced 2025-08-04 00:03:54 -06:00
Use g_new() & friends where that makes obvious sense
g_new(T, n) is neater than g_malloc(sizeof(T) * n). It's also safer, for two reasons. One, it catches multiplication overflowing size_t. Two, it returns T * rather than void *, which lets the compiler catch more type errors. This commit only touches allocations with size arguments of the form sizeof(T). Patch created mechanically with: $ spatch --in-place --sp-file scripts/coccinelle/use-g_new-etc.cocci \ --macro-file scripts/cocci-macro-file.h FILES... Signed-off-by: Markus Armbruster <armbru@redhat.com> Reviewed-by: Philippe Mathieu-Daudé <f4bug@amsat.org> Reviewed-by: Cédric Le Goater <clg@kaod.org> Reviewed-by: Alex Bennée <alex.bennee@linaro.org> Acked-by: Dr. David Alan Gilbert <dgilbert@redhat.com> Message-Id: <20220315144156.1595462-4-armbru@redhat.com> Reviewed-by: Pavel Dovgalyuk <Pavel.Dovgalyuk@ispras.ru>
This commit is contained in:
parent
1366244ab6
commit
b21e238037
102 changed files with 195 additions and 200 deletions
|
@ -217,7 +217,7 @@ envlist_to_environ(const envlist_t *envlist, size_t *count)
|
|||
struct envlist_entry *entry;
|
||||
char **env, **penv;
|
||||
|
||||
penv = env = g_malloc((envlist->el_count + 1) * sizeof(char *));
|
||||
penv = env = g_new(char *, envlist->el_count + 1);
|
||||
|
||||
for (entry = envlist->el_entries.lh_first; entry != NULL;
|
||||
entry = entry->ev_link.le_next) {
|
||||
|
|
|
@ -862,7 +862,7 @@ void hbitmap_truncate(HBitmap *hb, uint64_t size)
|
|||
}
|
||||
old = hb->sizes[i];
|
||||
hb->sizes[i] = size;
|
||||
hb->levels[i] = g_realloc(hb->levels[i], size * sizeof(unsigned long));
|
||||
hb->levels[i] = g_renew(unsigned long, hb->levels[i], size);
|
||||
if (!shrink) {
|
||||
memset(&hb->levels[i][old], 0x00,
|
||||
(size - old) * sizeof(*hb->levels[i]));
|
||||
|
|
|
@ -273,7 +273,7 @@ static PollingEntry *first_polling_entry;
|
|||
int qemu_add_polling_cb(PollingFunc *func, void *opaque)
|
||||
{
|
||||
PollingEntry **ppe, *pe;
|
||||
pe = g_malloc0(sizeof(PollingEntry));
|
||||
pe = g_new0(PollingEntry, 1);
|
||||
pe->func = func;
|
||||
pe->opaque = opaque;
|
||||
for(ppe = &first_polling_entry; *ppe != NULL; ppe = &(*ppe)->next);
|
||||
|
|
|
@ -100,7 +100,7 @@ QEMUTimerList *timerlist_new(QEMUClockType type,
|
|||
QEMUTimerList *timer_list;
|
||||
QEMUClock *clock = qemu_clock_ptr(type);
|
||||
|
||||
timer_list = g_malloc0(sizeof(QEMUTimerList));
|
||||
timer_list = g_new0(QEMUTimerList, 1);
|
||||
qemu_event_init(&timer_list->timers_done_ev, true);
|
||||
timer_list->clock = clock;
|
||||
timer_list->notify_cb = cb;
|
||||
|
|
|
@ -279,8 +279,8 @@ static void collect_usable_iova_ranges(QEMUVFIOState *s, void *buf)
|
|||
s->nb_iova_ranges = cap_iova_range->nr_iovas;
|
||||
if (s->nb_iova_ranges > 1) {
|
||||
s->usable_iova_ranges =
|
||||
g_realloc(s->usable_iova_ranges,
|
||||
s->nb_iova_ranges * sizeof(struct IOVARange));
|
||||
g_renew(struct IOVARange, s->usable_iova_ranges,
|
||||
s->nb_iova_ranges);
|
||||
}
|
||||
|
||||
for (i = 0; i < s->nb_iova_ranges; i++) {
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue