mirror of
https://github.com/torvalds/linux
synced 2024-10-17 08:46:50 +00:00
d2ddc776a4
The current code assumes that volumes and servers are per-cell and are
never shared, but this is not enforced, and, indeed, public cells do exist
that are aliases of each other. Further, an organisation can, say, set up
a public cell and a private cell with overlapping, but not identical, sets
of servers. The difference is purely in the database attached to the VL
servers.
The current code will malfunction if it sees a server in two cells as it
assumes global address -> server record mappings and that each server is in
just one cell.
Further, each server may have multiple addresses - and may have addresses
of different families (IPv4 and IPv6, say).
To this end, the following structural changes are made:
(1) Server record management is overhauled:
(a) Server records are made independent of cell. The namespace keeps
track of them, volume records have lists of them and each vnode
has a server on which its callback interest currently resides.
(b) The cell record no longer keeps a list of servers known to be in
that cell.
(c) The server records are now kept in a flat list because there's no
single address to sort on.
(d) Server records are now keyed by their UUID within the namespace.
(e) The addresses for a server are obtained with the VL.GetAddrsU
rather than with VL.GetEntryByName, using the server's UUID as a
parameter.
(f) Cached server records are garbage collected after a period of
non-use and are counted out of existence before purging is allowed
to complete. This protects the work functions against rmmod.
(g) The servers list is now in /proc/fs/afs/servers.
(2) Volume record management is overhauled:
(a) An RCU-replaceable server list is introduced. This tracks both
servers and their coresponding callback interests.
(b) The superblock is now keyed on cell record and numeric volume ID.
(c) The volume record is now tied to the superblock which mounts it,
and is activated when mounted and deactivated when unmounted.
This makes it easier to handle the cache cookie without causing a
double-use in fscache.
(d) The volume record is loaded from the VLDB using VL.GetEntryByNameU
to get the server UUID list.
(e) The volume name is updated if it is seen to have changed when the
volume is updated (the update is keyed on the volume ID).
(3) The vlocation record is got rid of and VLDB records are no longer
cached. Sufficient information is stored in the volume record, though
an update to a volume record is now no longer shared between related
volumes (volumes come in bundles of three: R/W, R/O and backup).
and the following procedural changes are made:
(1) The fileserver cursor introduced previously is now fleshed out and
used to iterate over fileservers and their addresses.
(2) Volume status is checked during iteration, and the server list is
replaced if a change is detected.
(3) Server status is checked during iteration, and the address list is
replaced if a change is detected.
(4) The abort code is saved into the address list cursor and -ECONNABORTED
returned in afs_make_call() if a remote abort happened rather than
translating the abort into an error message. This allows actions to
be taken depending on the abort code more easily.
(a) If a VMOVED abort is seen then this is handled by rechecking the
volume and restarting the iteration.
(b) If a VBUSY, VRESTARTING or VSALVAGING abort is seen then this is
handled by sleeping for a short period and retrying and/or trying
other servers that might serve that volume. A message is also
displayed once until the condition has cleared.
(c) If a VOFFLINE abort is seen, then this is handled as VBUSY for the
moment.
(d) If a VNOVOL abort is seen, the volume is rechecked in the VLDB to
see if it has been deleted; if not, the fileserver is probably
indicating that the volume couldn't be attached and needs
salvaging.
(e) If statfs() sees one of these aborts, it does not sleep, but
rather returns an error, so as not to block the umount program.
(5) The fileserver iteration functions in vnode.c are now merged into
their callers and more heavily macroised around the cursor. vnode.c
is removed.
(6) Operations on a particular vnode are serialised on that vnode because
the server will lock that vnode whilst it operates on it, so a second
op sent will just have to wait.
(7) Fileservers are probed with FS.GetCapabilities before being used.
This is where service upgrade will be done.
(8) A callback interest on a fileserver is set up before an FS operation
is performed and passed through to afs_make_call() so that it can be
set on the vnode if the operation returns a callback. The callback
interest is passed through to afs_iget() also so that it can be set
there too.
In general, record updating is done on an as-needed basis when we try to
access servers, volumes or vnodes rather than offloading it to work items
and special threads.
Notes:
(1) Pre AFS-3.4 servers are no longer supported, though this can be added
back if necessary (AFS-3.4 was released in 1998).
(2) VBUSY is retried forever for the moment at intervals of 1s.
(3) /proc/fs/afs/<cell>/servers no longer exists.
Signed-off-by: David Howells <dhowells@redhat.com>
899 lines
21 KiB
C
899 lines
21 KiB
C
/* Maintain an RxRPC server socket to do AFS communications through
|
|
*
|
|
* Copyright (C) 2007 Red Hat, Inc. All Rights Reserved.
|
|
* Written by David Howells (dhowells@redhat.com)
|
|
*
|
|
* This program is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU General Public License
|
|
* as published by the Free Software Foundation; either version
|
|
* 2 of the License, or (at your option) any later version.
|
|
*/
|
|
|
|
#include <linux/slab.h>
|
|
#include <linux/sched/signal.h>
|
|
|
|
#include <net/sock.h>
|
|
#include <net/af_rxrpc.h>
|
|
#include "internal.h"
|
|
#include "afs_cm.h"
|
|
|
|
struct workqueue_struct *afs_async_calls;
|
|
|
|
static void afs_wake_up_call_waiter(struct sock *, struct rxrpc_call *, unsigned long);
|
|
static long afs_wait_for_call_to_complete(struct afs_call *, struct afs_addr_cursor *);
|
|
static void afs_wake_up_async_call(struct sock *, struct rxrpc_call *, unsigned long);
|
|
static void afs_process_async_call(struct work_struct *);
|
|
static void afs_rx_new_call(struct sock *, struct rxrpc_call *, unsigned long);
|
|
static void afs_rx_discard_new_call(struct rxrpc_call *, unsigned long);
|
|
static int afs_deliver_cm_op_id(struct afs_call *);
|
|
|
|
/* asynchronous incoming call initial processing */
|
|
static const struct afs_call_type afs_RXCMxxxx = {
|
|
.name = "CB.xxxx",
|
|
.deliver = afs_deliver_cm_op_id,
|
|
};
|
|
|
|
/*
|
|
* open an RxRPC socket and bind it to be a server for callback notifications
|
|
* - the socket is left in blocking mode and non-blocking ops use MSG_DONTWAIT
|
|
*/
|
|
int afs_open_socket(struct afs_net *net)
|
|
{
|
|
struct sockaddr_rxrpc srx;
|
|
struct socket *socket;
|
|
int ret;
|
|
|
|
_enter("");
|
|
|
|
ret = sock_create_kern(&init_net, AF_RXRPC, SOCK_DGRAM, PF_INET6, &socket);
|
|
if (ret < 0)
|
|
goto error_1;
|
|
|
|
socket->sk->sk_allocation = GFP_NOFS;
|
|
|
|
/* bind the callback manager's address to make this a server socket */
|
|
memset(&srx, 0, sizeof(srx));
|
|
srx.srx_family = AF_RXRPC;
|
|
srx.srx_service = CM_SERVICE;
|
|
srx.transport_type = SOCK_DGRAM;
|
|
srx.transport_len = sizeof(srx.transport.sin6);
|
|
srx.transport.sin6.sin6_family = AF_INET6;
|
|
srx.transport.sin6.sin6_port = htons(AFS_CM_PORT);
|
|
|
|
ret = kernel_bind(socket, (struct sockaddr *) &srx, sizeof(srx));
|
|
if (ret < 0)
|
|
goto error_2;
|
|
|
|
rxrpc_kernel_new_call_notification(socket, afs_rx_new_call,
|
|
afs_rx_discard_new_call);
|
|
|
|
ret = kernel_listen(socket, INT_MAX);
|
|
if (ret < 0)
|
|
goto error_2;
|
|
|
|
net->socket = socket;
|
|
afs_charge_preallocation(&net->charge_preallocation_work);
|
|
_leave(" = 0");
|
|
return 0;
|
|
|
|
error_2:
|
|
sock_release(socket);
|
|
error_1:
|
|
_leave(" = %d", ret);
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* close the RxRPC socket AFS was using
|
|
*/
|
|
void afs_close_socket(struct afs_net *net)
|
|
{
|
|
_enter("");
|
|
|
|
kernel_listen(net->socket, 0);
|
|
flush_workqueue(afs_async_calls);
|
|
|
|
if (net->spare_incoming_call) {
|
|
afs_put_call(net->spare_incoming_call);
|
|
net->spare_incoming_call = NULL;
|
|
}
|
|
|
|
_debug("outstanding %u", atomic_read(&net->nr_outstanding_calls));
|
|
wait_on_atomic_t(&net->nr_outstanding_calls, atomic_t_wait,
|
|
TASK_UNINTERRUPTIBLE);
|
|
_debug("no outstanding calls");
|
|
|
|
kernel_sock_shutdown(net->socket, SHUT_RDWR);
|
|
flush_workqueue(afs_async_calls);
|
|
sock_release(net->socket);
|
|
|
|
_debug("dework");
|
|
_leave("");
|
|
}
|
|
|
|
/*
|
|
* Allocate a call.
|
|
*/
|
|
static struct afs_call *afs_alloc_call(struct afs_net *net,
|
|
const struct afs_call_type *type,
|
|
gfp_t gfp)
|
|
{
|
|
struct afs_call *call;
|
|
int o;
|
|
|
|
call = kzalloc(sizeof(*call), gfp);
|
|
if (!call)
|
|
return NULL;
|
|
|
|
call->type = type;
|
|
call->net = net;
|
|
atomic_set(&call->usage, 1);
|
|
INIT_WORK(&call->async_work, afs_process_async_call);
|
|
init_waitqueue_head(&call->waitq);
|
|
|
|
o = atomic_inc_return(&net->nr_outstanding_calls);
|
|
trace_afs_call(call, afs_call_trace_alloc, 1, o,
|
|
__builtin_return_address(0));
|
|
return call;
|
|
}
|
|
|
|
/*
|
|
* Dispose of a reference on a call.
|
|
*/
|
|
void afs_put_call(struct afs_call *call)
|
|
{
|
|
struct afs_net *net = call->net;
|
|
int n = atomic_dec_return(&call->usage);
|
|
int o = atomic_read(&net->nr_outstanding_calls);
|
|
|
|
trace_afs_call(call, afs_call_trace_put, n + 1, o,
|
|
__builtin_return_address(0));
|
|
|
|
ASSERTCMP(n, >=, 0);
|
|
if (n == 0) {
|
|
ASSERT(!work_pending(&call->async_work));
|
|
ASSERT(call->type->name != NULL);
|
|
|
|
if (call->rxcall) {
|
|
rxrpc_kernel_end_call(net->socket, call->rxcall);
|
|
call->rxcall = NULL;
|
|
}
|
|
if (call->type->destructor)
|
|
call->type->destructor(call);
|
|
|
|
afs_put_server(call->net, call->cm_server);
|
|
afs_put_cb_interest(call->net, call->cbi);
|
|
kfree(call->request);
|
|
kfree(call);
|
|
|
|
o = atomic_dec_return(&net->nr_outstanding_calls);
|
|
trace_afs_call(call, afs_call_trace_free, 0, o,
|
|
__builtin_return_address(0));
|
|
if (o == 0)
|
|
wake_up_atomic_t(&net->nr_outstanding_calls);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Queue the call for actual work. Returns 0 unconditionally for convenience.
|
|
*/
|
|
int afs_queue_call_work(struct afs_call *call)
|
|
{
|
|
int u = atomic_inc_return(&call->usage);
|
|
|
|
trace_afs_call(call, afs_call_trace_work, u,
|
|
atomic_read(&call->net->nr_outstanding_calls),
|
|
__builtin_return_address(0));
|
|
|
|
INIT_WORK(&call->work, call->type->work);
|
|
|
|
if (!queue_work(afs_wq, &call->work))
|
|
afs_put_call(call);
|
|
return 0;
|
|
}
|
|
|
|
/*
|
|
* allocate a call with flat request and reply buffers
|
|
*/
|
|
struct afs_call *afs_alloc_flat_call(struct afs_net *net,
|
|
const struct afs_call_type *type,
|
|
size_t request_size, size_t reply_max)
|
|
{
|
|
struct afs_call *call;
|
|
|
|
call = afs_alloc_call(net, type, GFP_NOFS);
|
|
if (!call)
|
|
goto nomem_call;
|
|
|
|
if (request_size) {
|
|
call->request_size = request_size;
|
|
call->request = kmalloc(request_size, GFP_NOFS);
|
|
if (!call->request)
|
|
goto nomem_free;
|
|
}
|
|
|
|
if (reply_max) {
|
|
call->reply_max = reply_max;
|
|
call->buffer = kmalloc(reply_max, GFP_NOFS);
|
|
if (!call->buffer)
|
|
goto nomem_free;
|
|
}
|
|
|
|
init_waitqueue_head(&call->waitq);
|
|
return call;
|
|
|
|
nomem_free:
|
|
afs_put_call(call);
|
|
nomem_call:
|
|
return NULL;
|
|
}
|
|
|
|
/*
|
|
* clean up a call with flat buffer
|
|
*/
|
|
void afs_flat_call_destructor(struct afs_call *call)
|
|
{
|
|
_enter("");
|
|
|
|
kfree(call->request);
|
|
call->request = NULL;
|
|
kfree(call->buffer);
|
|
call->buffer = NULL;
|
|
}
|
|
|
|
#define AFS_BVEC_MAX 8
|
|
|
|
/*
|
|
* Load the given bvec with the next few pages.
|
|
*/
|
|
static void afs_load_bvec(struct afs_call *call, struct msghdr *msg,
|
|
struct bio_vec *bv, pgoff_t first, pgoff_t last,
|
|
unsigned offset)
|
|
{
|
|
struct page *pages[AFS_BVEC_MAX];
|
|
unsigned int nr, n, i, to, bytes = 0;
|
|
|
|
nr = min_t(pgoff_t, last - first + 1, AFS_BVEC_MAX);
|
|
n = find_get_pages_contig(call->mapping, first, nr, pages);
|
|
ASSERTCMP(n, ==, nr);
|
|
|
|
msg->msg_flags |= MSG_MORE;
|
|
for (i = 0; i < nr; i++) {
|
|
to = PAGE_SIZE;
|
|
if (first + i >= last) {
|
|
to = call->last_to;
|
|
msg->msg_flags &= ~MSG_MORE;
|
|
}
|
|
bv[i].bv_page = pages[i];
|
|
bv[i].bv_len = to - offset;
|
|
bv[i].bv_offset = offset;
|
|
bytes += to - offset;
|
|
offset = 0;
|
|
}
|
|
|
|
iov_iter_bvec(&msg->msg_iter, WRITE | ITER_BVEC, bv, nr, bytes);
|
|
}
|
|
|
|
/*
|
|
* Advance the AFS call state when the RxRPC call ends the transmit phase.
|
|
*/
|
|
static void afs_notify_end_request_tx(struct sock *sock,
|
|
struct rxrpc_call *rxcall,
|
|
unsigned long call_user_ID)
|
|
{
|
|
struct afs_call *call = (struct afs_call *)call_user_ID;
|
|
|
|
if (call->state == AFS_CALL_REQUESTING)
|
|
call->state = AFS_CALL_AWAIT_REPLY;
|
|
}
|
|
|
|
/*
|
|
* attach the data from a bunch of pages on an inode to a call
|
|
*/
|
|
static int afs_send_pages(struct afs_call *call, struct msghdr *msg)
|
|
{
|
|
struct bio_vec bv[AFS_BVEC_MAX];
|
|
unsigned int bytes, nr, loop, offset;
|
|
pgoff_t first = call->first, last = call->last;
|
|
int ret;
|
|
|
|
offset = call->first_offset;
|
|
call->first_offset = 0;
|
|
|
|
do {
|
|
afs_load_bvec(call, msg, bv, first, last, offset);
|
|
offset = 0;
|
|
bytes = msg->msg_iter.count;
|
|
nr = msg->msg_iter.nr_segs;
|
|
|
|
ret = rxrpc_kernel_send_data(call->net->socket, call->rxcall, msg,
|
|
bytes, afs_notify_end_request_tx);
|
|
for (loop = 0; loop < nr; loop++)
|
|
put_page(bv[loop].bv_page);
|
|
if (ret < 0)
|
|
break;
|
|
|
|
first += nr;
|
|
} while (first <= last);
|
|
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* initiate a call
|
|
*/
|
|
long afs_make_call(struct afs_addr_cursor *ac, struct afs_call *call,
|
|
gfp_t gfp, bool async)
|
|
{
|
|
struct sockaddr_rxrpc *srx = ac->addr;
|
|
struct rxrpc_call *rxcall;
|
|
struct msghdr msg;
|
|
struct kvec iov[1];
|
|
size_t offset;
|
|
s64 tx_total_len;
|
|
int ret;
|
|
|
|
_enter(",{%pISp},", &srx->transport);
|
|
|
|
ASSERT(call->type != NULL);
|
|
ASSERT(call->type->name != NULL);
|
|
|
|
_debug("____MAKE %p{%s,%x} [%d]____",
|
|
call, call->type->name, key_serial(call->key),
|
|
atomic_read(&call->net->nr_outstanding_calls));
|
|
|
|
call->async = async;
|
|
|
|
/* Work out the length we're going to transmit. This is awkward for
|
|
* calls such as FS.StoreData where there's an extra injection of data
|
|
* after the initial fixed part.
|
|
*/
|
|
tx_total_len = call->request_size;
|
|
if (call->send_pages) {
|
|
tx_total_len += call->last_to - call->first_offset;
|
|
tx_total_len += (call->last - call->first) * PAGE_SIZE;
|
|
}
|
|
|
|
/* create a call */
|
|
rxcall = rxrpc_kernel_begin_call(call->net->socket, srx, call->key,
|
|
(unsigned long)call,
|
|
tx_total_len, gfp,
|
|
(async ?
|
|
afs_wake_up_async_call :
|
|
afs_wake_up_call_waiter),
|
|
call->upgrade);
|
|
if (IS_ERR(rxcall)) {
|
|
ret = PTR_ERR(rxcall);
|
|
goto error_kill_call;
|
|
}
|
|
|
|
call->rxcall = rxcall;
|
|
|
|
/* send the request */
|
|
iov[0].iov_base = call->request;
|
|
iov[0].iov_len = call->request_size;
|
|
|
|
msg.msg_name = NULL;
|
|
msg.msg_namelen = 0;
|
|
iov_iter_kvec(&msg.msg_iter, WRITE | ITER_KVEC, iov, 1,
|
|
call->request_size);
|
|
msg.msg_control = NULL;
|
|
msg.msg_controllen = 0;
|
|
msg.msg_flags = MSG_WAITALL | (call->send_pages ? MSG_MORE : 0);
|
|
|
|
/* We have to change the state *before* sending the last packet as
|
|
* rxrpc might give us the reply before it returns from sending the
|
|
* request. Further, if the send fails, we may already have been given
|
|
* a notification and may have collected it.
|
|
*/
|
|
if (!call->send_pages)
|
|
call->state = AFS_CALL_AWAIT_REPLY;
|
|
ret = rxrpc_kernel_send_data(call->net->socket, rxcall,
|
|
&msg, call->request_size,
|
|
afs_notify_end_request_tx);
|
|
if (ret < 0)
|
|
goto error_do_abort;
|
|
|
|
if (call->send_pages) {
|
|
ret = afs_send_pages(call, &msg);
|
|
if (ret < 0)
|
|
goto error_do_abort;
|
|
}
|
|
|
|
/* at this point, an async call may no longer exist as it may have
|
|
* already completed */
|
|
if (call->async)
|
|
return -EINPROGRESS;
|
|
|
|
return afs_wait_for_call_to_complete(call, ac);
|
|
|
|
error_do_abort:
|
|
call->state = AFS_CALL_COMPLETE;
|
|
if (ret != -ECONNABORTED) {
|
|
rxrpc_kernel_abort_call(call->net->socket, rxcall,
|
|
RX_USER_ABORT, ret, "KSD");
|
|
} else {
|
|
offset = 0;
|
|
rxrpc_kernel_recv_data(call->net->socket, rxcall, NULL,
|
|
0, &offset, false, &call->abort_code,
|
|
&call->service_id);
|
|
ac->abort_code = call->abort_code;
|
|
ac->responded = true;
|
|
}
|
|
error_kill_call:
|
|
afs_put_call(call);
|
|
ac->error = ret;
|
|
_leave(" = %d", ret);
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* deliver messages to a call
|
|
*/
|
|
static void afs_deliver_to_call(struct afs_call *call)
|
|
{
|
|
u32 abort_code;
|
|
int ret;
|
|
|
|
_enter("%s", call->type->name);
|
|
|
|
while (call->state == AFS_CALL_AWAIT_REPLY ||
|
|
call->state == AFS_CALL_AWAIT_OP_ID ||
|
|
call->state == AFS_CALL_AWAIT_REQUEST ||
|
|
call->state == AFS_CALL_AWAIT_ACK
|
|
) {
|
|
if (call->state == AFS_CALL_AWAIT_ACK) {
|
|
size_t offset = 0;
|
|
ret = rxrpc_kernel_recv_data(call->net->socket,
|
|
call->rxcall,
|
|
NULL, 0, &offset, false,
|
|
&call->abort_code,
|
|
&call->service_id);
|
|
trace_afs_recv_data(call, 0, offset, false, ret);
|
|
|
|
if (ret == -EINPROGRESS || ret == -EAGAIN)
|
|
return;
|
|
if (ret == 1 || ret < 0) {
|
|
call->state = AFS_CALL_COMPLETE;
|
|
goto done;
|
|
}
|
|
return;
|
|
}
|
|
|
|
ret = call->type->deliver(call);
|
|
switch (ret) {
|
|
case 0:
|
|
if (call->state == AFS_CALL_AWAIT_REPLY)
|
|
call->state = AFS_CALL_COMPLETE;
|
|
goto done;
|
|
case -EINPROGRESS:
|
|
case -EAGAIN:
|
|
goto out;
|
|
case -ECONNABORTED:
|
|
goto save_error;
|
|
case -ENOTCONN:
|
|
abort_code = RX_CALL_DEAD;
|
|
rxrpc_kernel_abort_call(call->net->socket, call->rxcall,
|
|
abort_code, ret, "KNC");
|
|
goto save_error;
|
|
case -ENOTSUPP:
|
|
abort_code = RXGEN_OPCODE;
|
|
rxrpc_kernel_abort_call(call->net->socket, call->rxcall,
|
|
abort_code, ret, "KIV");
|
|
goto save_error;
|
|
case -ENODATA:
|
|
case -EBADMSG:
|
|
case -EMSGSIZE:
|
|
default:
|
|
abort_code = RXGEN_CC_UNMARSHAL;
|
|
if (call->state != AFS_CALL_AWAIT_REPLY)
|
|
abort_code = RXGEN_SS_UNMARSHAL;
|
|
rxrpc_kernel_abort_call(call->net->socket, call->rxcall,
|
|
abort_code, -EBADMSG, "KUM");
|
|
goto save_error;
|
|
}
|
|
}
|
|
|
|
done:
|
|
if (call->state == AFS_CALL_COMPLETE && call->incoming)
|
|
afs_put_call(call);
|
|
out:
|
|
_leave("");
|
|
return;
|
|
|
|
save_error:
|
|
call->error = ret;
|
|
call->state = AFS_CALL_COMPLETE;
|
|
goto done;
|
|
}
|
|
|
|
/*
|
|
* wait synchronously for a call to complete
|
|
*/
|
|
static long afs_wait_for_call_to_complete(struct afs_call *call,
|
|
struct afs_addr_cursor *ac)
|
|
{
|
|
signed long rtt2, timeout;
|
|
long ret;
|
|
u64 rtt;
|
|
u32 life, last_life;
|
|
|
|
DECLARE_WAITQUEUE(myself, current);
|
|
|
|
_enter("");
|
|
|
|
rtt = rxrpc_kernel_get_rtt(call->net->socket, call->rxcall);
|
|
rtt2 = nsecs_to_jiffies64(rtt) * 2;
|
|
if (rtt2 < 2)
|
|
rtt2 = 2;
|
|
|
|
timeout = rtt2;
|
|
last_life = rxrpc_kernel_check_life(call->net->socket, call->rxcall);
|
|
|
|
add_wait_queue(&call->waitq, &myself);
|
|
for (;;) {
|
|
set_current_state(TASK_UNINTERRUPTIBLE);
|
|
|
|
/* deliver any messages that are in the queue */
|
|
if (call->state < AFS_CALL_COMPLETE && call->need_attention) {
|
|
call->need_attention = false;
|
|
__set_current_state(TASK_RUNNING);
|
|
afs_deliver_to_call(call);
|
|
continue;
|
|
}
|
|
|
|
if (call->state == AFS_CALL_COMPLETE)
|
|
break;
|
|
|
|
life = rxrpc_kernel_check_life(call->net->socket, call->rxcall);
|
|
if (timeout == 0 &&
|
|
life == last_life && signal_pending(current))
|
|
break;
|
|
|
|
if (life != last_life) {
|
|
timeout = rtt2;
|
|
last_life = life;
|
|
}
|
|
|
|
timeout = schedule_timeout(timeout);
|
|
}
|
|
|
|
remove_wait_queue(&call->waitq, &myself);
|
|
__set_current_state(TASK_RUNNING);
|
|
|
|
/* Kill off the call if it's still live. */
|
|
if (call->state < AFS_CALL_COMPLETE) {
|
|
_debug("call interrupted");
|
|
if (rxrpc_kernel_abort_call(call->net->socket, call->rxcall,
|
|
RX_USER_ABORT, -EINTR, "KWI"))
|
|
call->error = -ERESTARTSYS;
|
|
}
|
|
|
|
ac->abort_code = call->abort_code;
|
|
ac->error = call->error;
|
|
|
|
ret = ac->error;
|
|
switch (ret) {
|
|
case 0:
|
|
if (call->ret_reply0) {
|
|
ret = (long)call->reply[0];
|
|
call->reply[0] = NULL;
|
|
}
|
|
/* Fall through */
|
|
case -ECONNABORTED:
|
|
ac->responded = true;
|
|
break;
|
|
}
|
|
|
|
_debug("call complete");
|
|
afs_put_call(call);
|
|
_leave(" = %p", (void *)ret);
|
|
return ret;
|
|
}
|
|
|
|
/*
|
|
* wake up a waiting call
|
|
*/
|
|
static void afs_wake_up_call_waiter(struct sock *sk, struct rxrpc_call *rxcall,
|
|
unsigned long call_user_ID)
|
|
{
|
|
struct afs_call *call = (struct afs_call *)call_user_ID;
|
|
|
|
call->need_attention = true;
|
|
wake_up(&call->waitq);
|
|
}
|
|
|
|
/*
|
|
* wake up an asynchronous call
|
|
*/
|
|
static void afs_wake_up_async_call(struct sock *sk, struct rxrpc_call *rxcall,
|
|
unsigned long call_user_ID)
|
|
{
|
|
struct afs_call *call = (struct afs_call *)call_user_ID;
|
|
int u;
|
|
|
|
trace_afs_notify_call(rxcall, call);
|
|
call->need_attention = true;
|
|
|
|
u = __atomic_add_unless(&call->usage, 1, 0);
|
|
if (u != 0) {
|
|
trace_afs_call(call, afs_call_trace_wake, u,
|
|
atomic_read(&call->net->nr_outstanding_calls),
|
|
__builtin_return_address(0));
|
|
|
|
if (!queue_work(afs_async_calls, &call->async_work))
|
|
afs_put_call(call);
|
|
}
|
|
}
|
|
|
|
/*
|
|
* Delete an asynchronous call. The work item carries a ref to the call struct
|
|
* that we need to release.
|
|
*/
|
|
static void afs_delete_async_call(struct work_struct *work)
|
|
{
|
|
struct afs_call *call = container_of(work, struct afs_call, async_work);
|
|
|
|
_enter("");
|
|
|
|
afs_put_call(call);
|
|
|
|
_leave("");
|
|
}
|
|
|
|
/*
|
|
* Perform I/O processing on an asynchronous call. The work item carries a ref
|
|
* to the call struct that we either need to release or to pass on.
|
|
*/
|
|
static void afs_process_async_call(struct work_struct *work)
|
|
{
|
|
struct afs_call *call = container_of(work, struct afs_call, async_work);
|
|
|
|
_enter("");
|
|
|
|
if (call->state < AFS_CALL_COMPLETE && call->need_attention) {
|
|
call->need_attention = false;
|
|
afs_deliver_to_call(call);
|
|
}
|
|
|
|
if (call->state == AFS_CALL_COMPLETE) {
|
|
call->reply[0] = NULL;
|
|
|
|
/* We have two refs to release - one from the alloc and one
|
|
* queued with the work item - and we can't just deallocate the
|
|
* call because the work item may be queued again.
|
|
*/
|
|
call->async_work.func = afs_delete_async_call;
|
|
if (!queue_work(afs_async_calls, &call->async_work))
|
|
afs_put_call(call);
|
|
}
|
|
|
|
afs_put_call(call);
|
|
_leave("");
|
|
}
|
|
|
|
static void afs_rx_attach(struct rxrpc_call *rxcall, unsigned long user_call_ID)
|
|
{
|
|
struct afs_call *call = (struct afs_call *)user_call_ID;
|
|
|
|
call->rxcall = rxcall;
|
|
}
|
|
|
|
/*
|
|
* Charge the incoming call preallocation.
|
|
*/
|
|
void afs_charge_preallocation(struct work_struct *work)
|
|
{
|
|
struct afs_net *net =
|
|
container_of(work, struct afs_net, charge_preallocation_work);
|
|
struct afs_call *call = net->spare_incoming_call;
|
|
|
|
for (;;) {
|
|
if (!call) {
|
|
call = afs_alloc_call(net, &afs_RXCMxxxx, GFP_KERNEL);
|
|
if (!call)
|
|
break;
|
|
|
|
call->async = true;
|
|
call->state = AFS_CALL_AWAIT_OP_ID;
|
|
init_waitqueue_head(&call->waitq);
|
|
}
|
|
|
|
if (rxrpc_kernel_charge_accept(net->socket,
|
|
afs_wake_up_async_call,
|
|
afs_rx_attach,
|
|
(unsigned long)call,
|
|
GFP_KERNEL) < 0)
|
|
break;
|
|
call = NULL;
|
|
}
|
|
net->spare_incoming_call = call;
|
|
}
|
|
|
|
/*
|
|
* Discard a preallocated call when a socket is shut down.
|
|
*/
|
|
static void afs_rx_discard_new_call(struct rxrpc_call *rxcall,
|
|
unsigned long user_call_ID)
|
|
{
|
|
struct afs_call *call = (struct afs_call *)user_call_ID;
|
|
|
|
call->rxcall = NULL;
|
|
afs_put_call(call);
|
|
}
|
|
|
|
/*
|
|
* Notification of an incoming call.
|
|
*/
|
|
static void afs_rx_new_call(struct sock *sk, struct rxrpc_call *rxcall,
|
|
unsigned long user_call_ID)
|
|
{
|
|
struct afs_net *net = afs_sock2net(sk);
|
|
|
|
queue_work(afs_wq, &net->charge_preallocation_work);
|
|
}
|
|
|
|
/*
|
|
* Grab the operation ID from an incoming cache manager call. The socket
|
|
* buffer is discarded on error or if we don't yet have sufficient data.
|
|
*/
|
|
static int afs_deliver_cm_op_id(struct afs_call *call)
|
|
{
|
|
int ret;
|
|
|
|
_enter("{%zu}", call->offset);
|
|
|
|
ASSERTCMP(call->offset, <, 4);
|
|
|
|
/* the operation ID forms the first four bytes of the request data */
|
|
ret = afs_extract_data(call, &call->tmp, 4, true);
|
|
if (ret < 0)
|
|
return ret;
|
|
|
|
call->operation_ID = ntohl(call->tmp);
|
|
call->state = AFS_CALL_AWAIT_REQUEST;
|
|
call->offset = 0;
|
|
|
|
/* ask the cache manager to route the call (it'll change the call type
|
|
* if successful) */
|
|
if (!afs_cm_incoming_call(call))
|
|
return -ENOTSUPP;
|
|
|
|
trace_afs_cb_call(call);
|
|
|
|
/* pass responsibility for the remainer of this message off to the
|
|
* cache manager op */
|
|
return call->type->deliver(call);
|
|
}
|
|
|
|
/*
|
|
* Advance the AFS call state when an RxRPC service call ends the transmit
|
|
* phase.
|
|
*/
|
|
static void afs_notify_end_reply_tx(struct sock *sock,
|
|
struct rxrpc_call *rxcall,
|
|
unsigned long call_user_ID)
|
|
{
|
|
struct afs_call *call = (struct afs_call *)call_user_ID;
|
|
|
|
if (call->state == AFS_CALL_REPLYING)
|
|
call->state = AFS_CALL_AWAIT_ACK;
|
|
}
|
|
|
|
/*
|
|
* send an empty reply
|
|
*/
|
|
void afs_send_empty_reply(struct afs_call *call)
|
|
{
|
|
struct afs_net *net = call->net;
|
|
struct msghdr msg;
|
|
|
|
_enter("");
|
|
|
|
rxrpc_kernel_set_tx_length(net->socket, call->rxcall, 0);
|
|
|
|
msg.msg_name = NULL;
|
|
msg.msg_namelen = 0;
|
|
iov_iter_kvec(&msg.msg_iter, WRITE | ITER_KVEC, NULL, 0, 0);
|
|
msg.msg_control = NULL;
|
|
msg.msg_controllen = 0;
|
|
msg.msg_flags = 0;
|
|
|
|
call->state = AFS_CALL_AWAIT_ACK;
|
|
switch (rxrpc_kernel_send_data(net->socket, call->rxcall, &msg, 0,
|
|
afs_notify_end_reply_tx)) {
|
|
case 0:
|
|
_leave(" [replied]");
|
|
return;
|
|
|
|
case -ENOMEM:
|
|
_debug("oom");
|
|
rxrpc_kernel_abort_call(net->socket, call->rxcall,
|
|
RX_USER_ABORT, -ENOMEM, "KOO");
|
|
default:
|
|
_leave(" [error]");
|
|
return;
|
|
}
|
|
}
|
|
|
|
/*
|
|
* send a simple reply
|
|
*/
|
|
void afs_send_simple_reply(struct afs_call *call, const void *buf, size_t len)
|
|
{
|
|
struct afs_net *net = call->net;
|
|
struct msghdr msg;
|
|
struct kvec iov[1];
|
|
int n;
|
|
|
|
_enter("");
|
|
|
|
rxrpc_kernel_set_tx_length(net->socket, call->rxcall, len);
|
|
|
|
iov[0].iov_base = (void *) buf;
|
|
iov[0].iov_len = len;
|
|
msg.msg_name = NULL;
|
|
msg.msg_namelen = 0;
|
|
iov_iter_kvec(&msg.msg_iter, WRITE | ITER_KVEC, iov, 1, len);
|
|
msg.msg_control = NULL;
|
|
msg.msg_controllen = 0;
|
|
msg.msg_flags = 0;
|
|
|
|
call->state = AFS_CALL_AWAIT_ACK;
|
|
n = rxrpc_kernel_send_data(net->socket, call->rxcall, &msg, len,
|
|
afs_notify_end_reply_tx);
|
|
if (n >= 0) {
|
|
/* Success */
|
|
_leave(" [replied]");
|
|
return;
|
|
}
|
|
|
|
if (n == -ENOMEM) {
|
|
_debug("oom");
|
|
rxrpc_kernel_abort_call(net->socket, call->rxcall,
|
|
RX_USER_ABORT, -ENOMEM, "KOO");
|
|
}
|
|
_leave(" [error]");
|
|
}
|
|
|
|
/*
|
|
* Extract a piece of data from the received data socket buffers.
|
|
*/
|
|
int afs_extract_data(struct afs_call *call, void *buf, size_t count,
|
|
bool want_more)
|
|
{
|
|
struct afs_net *net = call->net;
|
|
int ret;
|
|
|
|
_enter("{%s,%zu},,%zu,%d",
|
|
call->type->name, call->offset, count, want_more);
|
|
|
|
ASSERTCMP(call->offset, <=, count);
|
|
|
|
ret = rxrpc_kernel_recv_data(net->socket, call->rxcall,
|
|
buf, count, &call->offset,
|
|
want_more, &call->abort_code,
|
|
&call->service_id);
|
|
trace_afs_recv_data(call, count, call->offset, want_more, ret);
|
|
if (ret == 0 || ret == -EAGAIN)
|
|
return ret;
|
|
|
|
if (ret == 1) {
|
|
switch (call->state) {
|
|
case AFS_CALL_AWAIT_REPLY:
|
|
call->state = AFS_CALL_COMPLETE;
|
|
break;
|
|
case AFS_CALL_AWAIT_REQUEST:
|
|
call->state = AFS_CALL_REPLYING;
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
call->error = ret;
|
|
call->state = AFS_CALL_COMPLETE;
|
|
return ret;
|
|
}
|