/* SCTP kernel implementation
* (C) Copyright IBM Corp. 2003, 2004
*
* This file is part of the SCTP kernel implementation
*
* This file contains the code relating the chunk abstraction.
*
* This SCTP implementation 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, or (at your option)
* any later version.
*
* This SCTP implementation is distributed in the hope that it
* will be useful, but WITHOUT ANY WARRANTY; without even the implied
* ************************
* warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with GNU CC; see the file COPYING. If not, see
* .
*
* Please send any bug reports or fixes you make to the
* email address(es):
* lksctp developers
*
* Written or modified by:
* Jon Grimm
* Sridhar Samudrala
*/
#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
#include
#include
#include
#include
#include
#include
#include
#include
#include
/* This file is mostly in anticipation of future work, but initially
* populate with fragment tracking for an outbound message.
*/
/* Initialize datamsg from memory. */
static void sctp_datamsg_init(struct sctp_datamsg *msg)
{
atomic_set(&msg->refcnt, 1);
msg->send_failed = 0;
msg->send_error = 0;
msg->can_delay = 1;
msg->expires_at = 0;
INIT_LIST_HEAD(&msg->chunks);
}
/* Allocate and initialize datamsg. */
static struct sctp_datamsg *sctp_datamsg_new(gfp_t gfp)
{
struct sctp_datamsg *msg;
msg = kmalloc(sizeof(struct sctp_datamsg), gfp);
if (msg) {
sctp_datamsg_init(msg);
SCTP_DBG_OBJCNT_INC(datamsg);
}
return msg;
}
void sctp_datamsg_free(struct sctp_datamsg *msg)
{
struct sctp_chunk *chunk;
/* This doesn't have to be a _safe vairant because
* sctp_chunk_free() only drops the refs.
*/
list_for_each_entry(chunk, &msg->chunks, frag_list)
sctp_chunk_free(chunk);
sctp_datamsg_put(msg);
}
/* Final destructruction of datamsg memory. */
static void sctp_datamsg_destroy(struct sctp_datamsg *msg)
{
struct list_head *pos, *temp;
struct sctp_chunk *chunk;
struct sctp_sock *sp;
struct sctp_ulpevent *ev;
struct sctp_association *asoc = NULL;
int error = 0, notify;
/* If we failed, we may need to notify. */
notify = msg->send_failed ? -1 : 0;
/* Release all references. */
list_for_each_safe(pos, temp, &msg->chunks) {
list_del_init(pos);
chunk = list_entry(pos, struct sctp_chunk, frag_list);
/* Check whether we _really_ need to notify. */
if (notify < 0) {
asoc = chunk->asoc;
if (msg->send_error)
error = msg->send_error;
else
error = asoc->outqueue.error;
sp = sctp_sk(asoc->base.sk);
notify = sctp_ulpevent_type_enabled(SCTP_SEND_FAILED,
&sp->subscribe);
}
/* Generate a SEND FAILED event only if enabled. */
if (notify > 0) {
int sent;
if (chunk->has_tsn)
sent = SCTP_DATA_SENT;
else
sent = SCTP_DATA_UNSENT;
ev = sctp_ulpevent_make_send_failed(asoc, chunk, sent,
error, GFP_ATOMIC);
if (ev)
sctp_ulpq_tail_event(&asoc->ulpq, ev);
}
sctp_chunk_put(chunk);
}
SCTP_DBG_OBJCNT_DEC(datamsg);
kfree(msg);
}
/* Hold a reference. */
static void sctp_datamsg_hold(struct sctp_datamsg *msg)
{
atomic_inc(&msg->refcnt);
}
/* Release a reference. */
void sctp_datamsg_put(struct sctp_datamsg *msg)
{
if (atomic_dec_and_test(&msg->refcnt))
sctp_datamsg_destroy(msg);
}
/* Assign a chunk to this datamsg. */
static void sctp_datamsg_assign(struct sctp_datamsg *msg, struct sctp_chunk *chunk)
{
sctp_datamsg_hold(msg);
chunk->msg = msg;
}
/* A data chunk can have a maximum payload of (2^16 - 20). Break
* down any such message into smaller chunks. Opportunistically, fragment
* the chunks down to the current MTU constraints. We may get refragmented
* later if the PMTU changes, but it is _much better_ to fragment immediately
* with a reasonable guess than always doing our fragmentation on the
* soft-interrupt.
*/
struct sctp_datamsg *sctp_datamsg_from_user(struct sctp_association *asoc,
struct sctp_sndrcvinfo *sinfo,
struct iov_iter *from)
{
size_t len, first_len, max_data, remaining;
size_t msg_len = iov_iter_count(from);
struct list_head *pos, *temp;
struct sctp_chunk *chunk;
struct sctp_datamsg *msg;
int err;
msg = sctp_datamsg_new(GFP_KERNEL);
if (!msg)
return ERR_PTR(-ENOMEM);
/* Note: Calculate this outside of the loop, so that all fragments
* have the same expiration.
*/
if (asoc->peer.prsctp_capable && sinfo->sinfo_timetolive &&
(SCTP_PR_TTL_ENABLED(sinfo->sinfo_flags) ||
!SCTP_PR_POLICY(sinfo->sinfo_flags)))
msg->expires_at = jiffies +
msecs_to_jiffies(sinfo->sinfo_timetolive);
/* This is the biggest possible DATA chunk that can fit into
* the packet
*/
max_data = asoc->pathmtu -
sctp_sk(asoc->base.sk)->pf->af->net_header_len -
sizeof(struct sctphdr) - sizeof(struct sctp_data_chunk);
max_data = SCTP_TRUNC4(max_data);
/* If the the peer requested that we authenticate DATA chunks
* we need to account for bundling of the AUTH chunks along with
* DATA.
*/
if (sctp_auth_send_cid(SCTP_CID_DATA, asoc)) {
struct sctp_hmac *hmac_desc = sctp_auth_asoc_get_hmac(asoc);
if (hmac_desc)
max_data -= SCTP_PAD4(sizeof(sctp_auth_chunk_t) +
hmac_desc->hmac_len);
}
/* Check what's our max considering the above */
max_data = min_t(size_t, max_data, asoc->frag_point);
/* Set first_len and then account for possible bundles on first frag */
first_len = max_data;
/* Check to see if we have a pending SACK and try to let it be bundled
* with this message. Do this if we don't have any data queued already.
* To check that, look at out_qlen and retransmit list.
* NOTE: we will not reduce to account for SACK, if the message would
* not have been fragmented.
*/
if (timer_pending(&asoc->timers[SCTP_EVENT_TIMEOUT_SACK]) &&
asoc->outqueue.out_qlen == 0 &&
list_empty(&asoc->outqueue.retransmit) &&
msg_len > max_data)
first_len -= SCTP_PAD4(sizeof(sctp_sack_chunk_t));
/* Encourage Cookie-ECHO bundling. */
if (asoc->state < SCTP_STATE_COOKIE_ECHOED)
first_len -= SCTP_ARBITRARY_COOKIE_ECHO_LEN;
/* Account for a different sized first fragment */
if (msg_len >= first_len) {
msg->can_delay = 0;
SCTP_INC_STATS(sock_net(asoc->base.sk), SCTP_MIB_FRAGUSRMSGS);
} else {
/* Which may be the only one... */
first_len = msg_len;
}
/* Create chunks for all DATA chunks. */
for (remaining = msg_len; remaining; remaining -= len) {
u8 frag = SCTP_DATA_MIDDLE_FRAG;
if (remaining == msg_len) {
/* First frag, which may also be the last */
frag |= SCTP_DATA_FIRST_FRAG;
len = first_len;
} else {
/* Middle frags */
len = max_data;
}
if (len >= remaining) {
/* Last frag, which may also be the first */
len = remaining;
frag |= SCTP_DATA_LAST_FRAG;
/* The application requests to set the I-bit of the
* last DATA chunk of a user message when providing
* the user message to the SCTP implementation.
*/
if ((sinfo->sinfo_flags & SCTP_EOF) ||
(sinfo->sinfo_flags & SCTP_SACK_IMMEDIATELY))
frag |= SCTP_DATA_SACK_IMM;
}
chunk = sctp_make_datafrag_empty(asoc, sinfo, len, frag,
0, GFP_KERNEL);
if (!chunk) {
err = -ENOMEM;
goto errout;
}
err = sctp_user_addto_chunk(chunk, len, from);
if (err < 0)
goto errout_chunk_free;
/* Put the chunk->skb back into the form expected by send. */
__skb_pull(chunk->skb, (__u8 *)chunk->chunk_hdr -
chunk->skb->data);
sctp_datamsg_assign(msg, chunk);
list_add_tail(&chunk->frag_list, &msg->chunks);
}
return msg;
errout_chunk_free:
sctp_chunk_free(chunk);
errout:
list_for_each_safe(pos, temp, &msg->chunks) {
list_del_init(pos);
chunk = list_entry(pos, struct sctp_chunk, frag_list);
sctp_chunk_free(chunk);
}
sctp_datamsg_put(msg);
return ERR_PTR(err);
}
/* Check whether this message has expired. */
int sctp_chunk_abandoned(struct sctp_chunk *chunk)
{
if (!chunk->asoc->peer.prsctp_capable)
return 0;
if (SCTP_PR_TTL_ENABLED(chunk->sinfo.sinfo_flags) &&
time_after(jiffies, chunk->msg->expires_at)) {
if (chunk->sent_count)
chunk->asoc->abandoned_sent[SCTP_PR_INDEX(TTL)]++;
else
chunk->asoc->abandoned_unsent[SCTP_PR_INDEX(TTL)]++;
return 1;
} else if (SCTP_PR_RTX_ENABLED(chunk->sinfo.sinfo_flags) &&
chunk->sent_count > chunk->sinfo.sinfo_timetolive) {
chunk->asoc->abandoned_sent[SCTP_PR_INDEX(RTX)]++;
return 1;
} else if (!SCTP_PR_POLICY(chunk->sinfo.sinfo_flags) &&
chunk->msg->expires_at &&
time_after(jiffies, chunk->msg->expires_at)) {
return 1;
}
/* PRIO policy is processed by sendmsg, not here */
return 0;
}
/* This chunk (and consequently entire message) has failed in its sending. */
void sctp_chunk_fail(struct sctp_chunk *chunk, int error)
{
chunk->msg->send_failed = 1;
chunk->msg->send_error = error;
}
c8b88de3b9c34b'>plain
| -rw-r--r-- | bpf-loader.h | 6215 | logplain |
| -rw-r--r-- | bpf-prologue.c | 11226 | logplain |
| -rw-r--r-- | bpf-prologue.h | 847 | logplain |
| -rw-r--r-- | build-id.c | 19054 | logplain |
| -rw-r--r-- | build-id.h | 1859 | logplain |
| d--------- | c++ | 184 | logplain |
| -rw-r--r-- | cache.h | 733 | logplain |
| -rw-r--r-- | call-path.c | 2893 | logplain |
| -rw-r--r-- | call-path.h | 2203 | logplain |
| -rw-r--r-- | callchain.c | 29332 | logplain |
| -rw-r--r-- | callchain.h | 7881 | logplain |
| -rw-r--r-- | cgroup.c | 3195 | logplain |
| -rw-r--r-- | cgroup.h | 359 | logplain |
| -rw-r--r-- | cloexec.c | 1950 | logplain |
| -rw-r--r-- | cloexec.h | 251 | logplain |
| -rw-r--r-- | color.c | 4787 | logplain |
| -rw-r--r-- | color.h | 1647 | logplain |
| -rw-r--r-- | comm.c | 2239 | logplain |
| -rw-r--r-- | comm.h | 561 | logplain |
| -rw-r--r-- | config.c | 16262 | logplain |
| -rw-r--r-- | config.h | 2113 | logplain |
| -rw-r--r-- | counts.c | 1026 | logplain |
| -rw-r--r-- | counts.h | 790 | logplain |
| -rw-r--r-- | cpumap.c | 12627 | logplain |
| -rw-r--r-- | cpumap.h | 1954 | logplain |
| -rw-r--r-- | cs-etm.h | 2061 | logplain |
| -rw-r--r-- | ctype.c | 2018 | logplain |
| -rw-r--r-- | data-convert-bt.c | 36671 | logplain |
| -rw-r--r-- | data-convert-bt.h | 302 | logplain |
| -rw-r--r-- | data-convert.h | 141 | logplain |
| -rw-r--r-- | data.c | 3459 | logplain |
| -rw-r--r-- | data.h | 1369 | logplain |
| -rw-r--r-- | db-export.c | 11434 | logplain |
| -rw-r--r-- | db-export.h | 3816 | logplain |
| -rw-r--r-- | debug.c | 4417 | logplain |
| -rw-r--r-- | debug.h | 2023 | logplain |
| -rw-r--r-- | demangle-java.c | 4219 | logplain |
| -rw-r--r-- | demangle-java.h | 249 | logplain |
| -rw-r--r-- | demangle-rust.c | 6602 | logplain |
| -rw-r--r-- | demangle-rust.h | 170 | logplain |
| -rw-r--r-- | drv_configs.c | 1834 | logplain |
| -rw-r--r-- | drv_configs.h | 844 | logplain |
| -rw-r--r-- | dso.c | 31994 | logplain |
| -rw-r--r-- | dso.h | 10399 | logplain |
| -rw-r--r-- | dwarf-aux.c | 33828 | logplain |
| -rw-r--r-- | dwarf-aux.h | 5101 | logplain |
| -rw-r--r-- | dwarf-regs.c | 1816 | logplain |
| -rw-r--r-- | env.c | 1884 | logplain |
| -rw-r--r-- | env.h | 1268 | logplain |
| -rw-r--r-- | event.c | 36670 | logplain |
| -rw-r--r-- | event.h | 15997 | logplain |
| -rw-r--r-- | evlist.c | 47104 | logplain |
| -rw-r--r-- | evlist.h | 12584 | logplain |
| -rw-r--r-- | evsel.c | 63917 | logplain |
| -rw-r--r-- | evsel.h | 13041 | logplain |
| -rw-r--r-- | evsel_fprintf.c | 5831 | logplain |
| -rw-r--r-- | find-vdso-map.c | 581 | logplain |
| -rw-r--r-- | genelf.c | 11653 | logplain |
| -rw-r--r-- | genelf.h | 1814 | logplain |
| -rw-r--r-- | genelf_debug.c | 14374 | logplain |
| -rwxr-xr-x | generate-cmdlist.sh | 1141 | logplain |
| -rw-r--r-- | group.h | 122 | logplain |
| -rw-r--r-- | header.c | 73410 | logplain |
| -rw-r--r-- | header.h | 4365 | logplain |
| -rw-r--r-- | help-unknown-cmd.c | 3221 | logplain |