/* * Copyright (C) 2014, Red Hat Inc, Arnaldo Carvalho de Melo * * Released under the GPL v2. (and only v2, not any later version) */ #include "array.h" #include #include #include #include #include void fdarray__init(struct fdarray *fda, int nr_autogrow) { fda->entries = NULL; fda->priv = NULL; fda->nr = fda->nr_alloc = 0; fda->nr_autogrow = nr_autogrow; } int fdarray__grow(struct fdarray *fda, int nr) { void *priv; int nr_alloc = fda->nr_alloc + nr; size_t psize = sizeof(fda->priv[0]) * nr_alloc; size_t size = sizeof(struct pollfd) * nr_alloc; struct pollfd *entries = realloc(fda->entries, size); if (entries == NULL) return -ENOMEM; priv = realloc(fda->priv, psize); if (priv == NULL) { free(entries); return -ENOMEM; } fda->nr_alloc = nr_alloc; fda->entries = entries; fda->priv = priv; return 0; } struct fdarray *fdarray__new(int nr_alloc, int nr_autogrow) { struct fdarray *fda = calloc(1, sizeof(*fda)); if (fda != NULL) { if (fdarray__grow(fda, nr_alloc)) { free(fda); fda = NULL; } else { fda->nr_autogrow = nr_autogrow; } } return fda; } void fdarray__exit(struct fdarray *fda) { free(fda->entries); free(fda->priv); fdarray__init(fda, 0); } void fdarray__delete(struct fdarray *fda) { fdarray__exit(fda); free(fda); } int fdarray__add(struct fdarray *fda, int fd, short revents) { int pos = fda->nr; if (fda->nr == fda->nr_alloc && fdarray__grow(fda, fda->nr_autogrow) < 0) return -ENOMEM; fda->entries[fda->nr].fd = fd; fda->entries[fda->nr].events = revents; fda->nr++; return pos; } int fdarray__filter(struct fdarray *fda, short revents, void (*entry_destructor)(struct fdarray *fda, int fd, void *arg), void *arg) { int fd, nr = 0; if (fda->nr == 0) return 0; for (fd = 0; fd < fda->nr; ++fd) { if (fda->entries[fd].revents & revents) { if (entry_destructor) entry_destructor(fda, fd, arg); continue; } if (fd != nr) { fda->entries[nr] = fda->entries[fd]; fda->priv[nr] = fda->priv[fd]; } ++nr; } return fda->nr = nr; } int fdarray__poll(struct fdarray *fda, int timeout) { return poll(fda->entries, fda->nr, timeout); } int fdarray__fprintf(struct fdarray *fda, FILE *fp) { int fd, printed = fprintf(fp, "%d [ ", fda->nr); for (fd = 0; fd < fda->nr; ++fd) printed += fprintf(fp, "%s%d", fd ? ", " : "", fda->entries[fd].fd); return printed + fprintf(fp, " ]"); } ue='382e1eea2d983cd2343482c6a638f497bb44a636'/>

path: root/net/bluetooth/hidp/Makefile

ct name='ignorews' onchange='this.form.submit();'>

Age	Commit message (Expand)	Author	Files	Lines
mode:

author	Thomas Gleixner <tglx@linutronix.de>	2017-01-31 09:37:34 +0100
committer	Thomas Gleixner <tglx@linutronix.de>	2017-01-31 21:47:58 +0100
commit	0becc0ae5b42828785b589f686725ff5bc3b9b25 (patch)
tree	be6d0e1f37c38ed0a7dd5da2d4b1e93f0fb43101 /sound/hda/hdac_bus.c
parent	24c2503255d35c269b67162c397a1a1c1e02f6ce (diff)

x86/mce: Make timer handling more robust

Erik reported that on a preproduction hardware a CMCI storm triggers the BUG_ON in add_timer_on(). The reason is that the per CPU MCE timer is started by the CMCI logic before the MCE CPU hotplug callback starts the timer with add_timer_on(). So the timer is already queued which triggers the BUG. Using add_timer_on() is pretty pointless in this code because the timer is strictlty per CPU, initialized as pinned and all operations which arm the timer happen on the CPU to which the timer belongs. Simplify the whole machinery by using mod_timer() instead of add_timer_on() which avoids the problem because mod_timer() can handle already queued timers. Use __start_timer() everywhere so the earliest armed expiry time is preserved. Reported-by: Erik Veijola <erik.veijola@intel.com> Tested-by: Borislav Petkov <bp@alien8.de> Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Borislav Petkov <bp@alien8.de> Cc: Tony Luck <tony.luck@intel.com> Link: http://lkml.kernel.org/r/alpine.DEB.2.20.1701310936080.3457@nanos Signed-off-by: Thomas Gleixner <tglx@linutronix.de>

Diffstat (limited to 'sound/hda/hdac_bus.c')