16c00db4bb
Pull AFS fixes from David Howells:
"Here's a set of patches that fix a number of bugs in the in-kernel AFS
client, including:
- Fix directory locking to not use individual page locks for
directory reading/scanning but rather to use a semaphore on the
afs_vnode struct as the directory contents must be read in a single
blob and data from different reads must not be mixed as the entire
contents may be shuffled about between reads.
- Fix address list parsing to handle port specifiers correctly.
- Only give up callback records on a server if we actually talked to
that server (we might not be able to access a server).
- Fix some callback handling bugs, including refcounting,
whole-volume callbacks and when callbacks actually get broken in
response to a CB.CallBack op.
- Fix some server/address rotation bugs, including giving up if we
can't probe a server; giving up if a server says it doesn't have a
volume, but there are more servers to try.
- Fix the decoding of fetched statuses to be OpenAFS compatible.
- Fix the handling of server lookups in Cache Manager ops (such as
CB.InitCallBackState3) to use a UUID if possible and to handle no
server being found.
- Fix a bug in server lookup where not all addresses are compared.
- Fix the non-encryption of calls that prevents some servers from
being accessed (this also requires an AF_RXRPC patch that has
already gone in through the net tree).
There's also a patch that adds tracepoints to log Cache Manager ops
that don't find a matching server, either by UUID or by address"
* tag 'afs-fixes-20180514' of git://git.kernel.org/pub/scm/linux/kernel/git/dhowells/linux-fs:
afs: Fix the non-encryption of calls
afs: Fix CB.CallBack handling
afs: Fix whole-volume callback handling
afs: Fix afs_find_server search loop
afs: Fix the handling of an unfound server in CM operations
afs: Add a tracepoint to record callbacks from unlisted servers
afs: Fix the handling of CB.InitCallBackState3 to find the server by UUID
afs: Fix VNOVOL handling in address rotation
afs: Fix AFSFetchStatus decoder to provide OpenAFS compatibility
afs: Fix server rotation's handling of fileserver probe failure
afs: Fix refcounting in callback registration
afs: Fix giving up callbacks on server destruction
afs: Fix address list parsing
afs: Fix directory page locking
79 lines
2.1 KiB
C
79 lines
2.1 KiB
C
/* SPDX-License-Identifier: GPL-2.0 */
|
|
#ifndef __PERF_INTLIST_H
|
|
#define __PERF_INTLIST_H
|
|
|
|
#include <linux/rbtree.h>
|
|
#include <stdbool.h>
|
|
|
|
#include "rblist.h"
|
|
|
|
struct int_node {
|
|
struct rb_node rb_node;
|
|
int i;
|
|
void *priv;
|
|
};
|
|
|
|
struct intlist {
|
|
struct rblist rblist;
|
|
};
|
|
|
|
struct intlist *intlist__new(const char *slist);
|
|
void intlist__delete(struct intlist *ilist);
|
|
|
|
void intlist__remove(struct intlist *ilist, struct int_node *in);
|
|
int intlist__add(struct intlist *ilist, int i);
|
|
|
|
struct int_node *intlist__entry(const struct intlist *ilist, unsigned int idx);
|
|
struct int_node *intlist__find(struct intlist *ilist, int i);
|
|
struct int_node *intlist__findnew(struct intlist *ilist, int i);
|
|
|
|
static inline bool intlist__has_entry(struct intlist *ilist, int i)
|
|
{
|
|
return intlist__find(ilist, i) != NULL;
|
|
}
|
|
|
|
static inline bool intlist__empty(const struct intlist *ilist)
|
|
{
|
|
return rblist__empty(&ilist->rblist);
|
|
}
|
|
|
|
static inline unsigned int intlist__nr_entries(const struct intlist *ilist)
|
|
{
|
|
return rblist__nr_entries(&ilist->rblist);
|
|
}
|
|
|
|
/* For intlist iteration */
|
|
static inline struct int_node *intlist__first(struct intlist *ilist)
|
|
{
|
|
struct rb_node *rn = rb_first(&ilist->rblist.entries);
|
|
return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
|
|
}
|
|
static inline struct int_node *intlist__next(struct int_node *in)
|
|
{
|
|
struct rb_node *rn;
|
|
if (!in)
|
|
return NULL;
|
|
rn = rb_next(&in->rb_node);
|
|
return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;
|
|
}
|
|
|
|
/**
|
|
* intlist__for_each_entry - iterate over a intlist
|
|
* @pos: the &struct int_node to use as a loop cursor.
|
|
* @ilist: the &struct intlist for loop.
|
|
*/
|
|
#define intlist__for_each_entry(pos, ilist) \
|
|
for (pos = intlist__first(ilist); pos; pos = intlist__next(pos))
|
|
|
|
/**
|
|
* intlist__for_each_entry_safe - iterate over a intlist safe against removal of
|
|
* int_node
|
|
* @pos: the &struct int_node to use as a loop cursor.
|
|
* @n: another &struct int_node to use as temporary storage.
|
|
* @ilist: the &struct intlist for loop.
|
|
*/
|
|
#define intlist__for_each_entry_safe(pos, n, ilist) \
|
|
for (pos = intlist__first(ilist), n = intlist__next(pos); pos;\
|
|
pos = n, n = intlist__next(n))
|
|
#endif /* __PERF_INTLIST_H */
|