#ifndef __PERF_STRLIST_H #define __PERF_STRLIST_H #include #include #include "rblist.h" struct str_node { struct rb_node rb_node; const char *s; }; struct strlist { struct rblist rblist; bool dupstr; bool file_only; }; /* * @file_only: When dirname is present, only consider entries as filenames, * that should not be added to the list if dirname/entry is not * found */ struct strlist_config { bool dont_dupstr; bool file_only; const char *dirname; }; struct strlist *strlist__new(const char *slist, const struct strlist_config *config); void strlist__delete(struct strlist *slist); void strlist__remove(struct strlist *slist, struct str_node *sn); int strlist__load(struct strlist *slist, const char *filename); int strlist__add(struct strlist *slist, const char *str); struct str_node *strlist__entry(const struct strlist *slist, unsigned int idx); struct str_node *strlist__find(struct strlist *slist, const char *entry); static inline bool strlist__has_entry(struct strlist *slist, const char *entry) { return strlist__find(slist, entry) != NULL; } static inline bool strlist__empty(const struct strlist *slist) { return rblist__empty(&slist->rblist); } static inline unsigned int strlist__nr_entries(const struct strlist *slist) { return rblist__nr_entries(&slist->rblist); } /* For strlist iteration */ static inline struct str_node *strlist__first(struct strlist *slist) { struct rb_node *rn = rb_first(&slist->rblist.entries); return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; } static inline struct str_node *strlist__next(struct str_node *sn) { struct rb_node *rn; if (!sn) return NULL; rn = rb_next(&sn->rb_node); return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; } /** * strlist_for_each - iterate over a strlist * @pos: the &struct str_node to use as a loop cursor. * @slist: the &struct strlist for loop. */ #define strlist__for_each_entry(pos, slist) \ for (pos = strlist__first(slist); pos; pos = strlist__next(pos)) /** * strlist_for_each_safe - iterate over a strlist safe against removal of * str_node * @pos: the &struct str_node to use as a loop cursor. * @n: another &struct str_node to use as temporary storage. * @slist: the &struct strlist for loop. */ #define strlist__for_each_entry_safe(pos, n, slist) \ for (pos = strlist__first(slist), n = strlist__next(pos); pos;\ pos = n, n = strlist__next(n)) #endif /* __PERF_STRLIST_H */ me='qt'>
path: root/sound/soc/omap
diff options
context:
space:
mode:
authorDaniel Vetter <daniel.vetter@ffwll.ch>2016-12-18 14:35:45 +0100
committerDaniel Vetter <daniel.vetter@ffwll.ch>2017-01-30 10:17:17 +0100
commit4e5b54f127426c82dc2816340c26d951a5bb3429 (patch)
treecc3a8f7e335cf12880bc8d1a1e2066f6cfe0a68e /sound/soc/omap
parent566cf877a1fcb6d6dc0126b076aad062054c2637 (diff)
drm: prevent double-(un)registration for connectors
If we're unlucky then the registration from a hotplugged connector might race with the final registration step on driver load. And since MST topology discover is asynchronous that's even somewhat likely. v2: Also update the kerneldoc for @registered! v3: Review from Chris: - Improve kerneldoc for late_register/early_unregister callbacks. - Use mutex_destroy. Reviewed-by: Chris Wilson <chris@chris-wilson.co.uk> Cc: Chris Wilson <chris@chris-wilson.co.uk> Reviewed-by: Sean Paul <seanpaul@chromium.org> Reported-by: Chris Wilson <chris@chris-wilson.co.uk> Signed-off-by: Daniel Vetter <daniel.vetter@intel.com> Link: http://patchwork.freedesktop.org/patch/msgid/20161218133545.2106-1-daniel.vetter@ffwll.ch (cherry picked from commit e73ab00e9a0f1731f34d0620a9c55f5c30c4ad4e)
Diffstat (limited to 'sound/soc/omap')