drivers: power: report battery voltage in AOSP compatible format
[GitHub/mt8127/android_kernel_alcatel_ttab.git] / net / sctp / inqueue.c
CommitLineData
60c778b2 1/* SCTP kernel implementation
1da177e4
LT
2 * Copyright (c) 1999-2000 Cisco, Inc.
3 * Copyright (c) 1999-2001 Motorola, Inc.
4 * Copyright (c) 2002 International Business Machines, Corp.
d808ad9a 5 *
60c778b2 6 * This file is part of the SCTP kernel implementation
d808ad9a 7 *
1da177e4
LT
8 * These functions are the methods for accessing the SCTP inqueue.
9 *
10 * An SCTP inqueue is a queue into which you push SCTP packets
11 * (which might be bundles or fragments of chunks) and out of which you
12 * pop SCTP whole chunks.
d808ad9a 13 *
60c778b2 14 * This SCTP implementation is free software;
d808ad9a 15 * you can redistribute it and/or modify it under the terms of
1da177e4
LT
16 * the GNU General Public License as published by
17 * the Free Software Foundation; either version 2, or (at your option)
18 * any later version.
d808ad9a 19 *
60c778b2 20 * This SCTP implementation is distributed in the hope that it
1da177e4
LT
21 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
22 * ************************
23 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
24 * See the GNU General Public License for more details.
d808ad9a 25 *
1da177e4
LT
26 * You should have received a copy of the GNU General Public License
27 * along with GNU CC; see the file COPYING. If not, write to
28 * the Free Software Foundation, 59 Temple Place - Suite 330,
d808ad9a
YH
29 * Boston, MA 02111-1307, USA.
30 *
1da177e4
LT
31 * Please send any bug reports or fixes you make to the
32 * email address(es):
33 * lksctp developers <lksctp-developers@lists.sourceforge.net>
d808ad9a 34 *
1da177e4
LT
35 * Or submit a bug report through the following website:
36 * http://www.sf.net/projects/lksctp
37 *
d808ad9a 38 * Written or modified by:
1da177e4
LT
39 * La Monte H.P. Yarroll <piggy@acm.org>
40 * Karl Knutson <karl@athena.chicago.il.us>
d808ad9a 41 *
1da177e4
LT
42 * Any bugs reported given to us we will try to fix... any fixes shared will
43 * be incorporated into the next SCTP release.
44 */
45
145ce502
JP
46#define pr_fmt(fmt) KBUILD_MODNAME ": " fmt
47
1da177e4
LT
48#include <net/sctp/sctp.h>
49#include <net/sctp/sm.h>
50#include <linux/interrupt.h>
5a0e3ad6 51#include <linux/slab.h>
1da177e4
LT
52
53/* Initialize an SCTP inqueue. */
54void sctp_inq_init(struct sctp_inq *queue)
55{
79af02c2 56 INIT_LIST_HEAD(&queue->in_chunk_list);
1da177e4
LT
57 queue->in_progress = NULL;
58
59 /* Create a task for delivering data. */
c4028958 60 INIT_WORK(&queue->immediate, NULL);
1da177e4
LT
61}
62
63/* Release the memory associated with an SCTP inqueue. */
64void sctp_inq_free(struct sctp_inq *queue)
65{
79af02c2 66 struct sctp_chunk *chunk, *tmp;
1da177e4
LT
67
68 /* Empty the queue. */
79af02c2
DM
69 list_for_each_entry_safe(chunk, tmp, &queue->in_chunk_list, list) {
70 list_del_init(&chunk->list);
1da177e4 71 sctp_chunk_free(chunk);
79af02c2 72 }
1da177e4
LT
73
74 /* If there is a packet which is currently being worked on,
75 * free it as well.
76 */
7a48f923 77 if (queue->in_progress) {
1da177e4 78 sctp_chunk_free(queue->in_progress);
7a48f923
SS
79 queue->in_progress = NULL;
80 }
1da177e4
LT
81}
82
83/* Put a new packet in an SCTP inqueue.
84 * We assume that packet->sctp_hdr is set and in host byte order.
85 */
ac0b0462 86void sctp_inq_push(struct sctp_inq *q, struct sctp_chunk *chunk)
1da177e4
LT
87{
88 /* Directly call the packet handling routine. */
027f6e1a
VY
89 if (chunk->rcvr->dead) {
90 sctp_chunk_free(chunk);
91 return;
92 }
1da177e4
LT
93
94 /* We are now calling this either from the soft interrupt
95 * or from the backlog processing.
96 * Eventually, we should clean up inqueue to not rely
97 * on the BH related data structures.
98 */
ac0b0462 99 list_add_tail(&chunk->list, &q->in_chunk_list);
196d6759
MB
100 if (chunk->asoc)
101 chunk->asoc->stats.ipackets++;
c4028958 102 q->immediate.func(&q->immediate);
1da177e4
LT
103}
104
bbd0d598
VY
105/* Peek at the next chunk on the inqeue. */
106struct sctp_chunkhdr *sctp_inq_peek(struct sctp_inq *queue)
107{
108 struct sctp_chunk *chunk;
109 sctp_chunkhdr_t *ch = NULL;
110
111 chunk = queue->in_progress;
112 /* If there is no more chunks in this packet, say so */
113 if (chunk->singleton ||
114 chunk->end_of_packet ||
115 chunk->pdiscard)
116 return NULL;
117
118 ch = (sctp_chunkhdr_t *)chunk->chunk_end;
119
120 return ch;
121}
122
123
1da177e4
LT
124/* Extract a chunk from an SCTP inqueue.
125 *
126 * WARNING: If you need to put the chunk on another queue, you need to
127 * make a shallow copy (clone) of it.
128 */
129struct sctp_chunk *sctp_inq_pop(struct sctp_inq *queue)
130{
131 struct sctp_chunk *chunk;
132 sctp_chunkhdr_t *ch = NULL;
133
134 /* The assumption is that we are safe to process the chunks
135 * at this time.
136 */
137
138 if ((chunk = queue->in_progress)) {
139 /* There is a packet that we have been working on.
140 * Any post processing work to do before we move on?
141 */
142 if (chunk->singleton ||
143 chunk->end_of_packet ||
144 chunk->pdiscard) {
145 sctp_chunk_free(chunk);
146 chunk = queue->in_progress = NULL;
147 } else {
148 /* Nothing to do. Next chunk in the packet, please. */
149 ch = (sctp_chunkhdr_t *) chunk->chunk_end;
1da177e4 150 /* Force chunk->skb->data to chunk->chunk_end. */
bf53932b
DB
151 skb_pull(chunk->skb, chunk->chunk_end - chunk->skb->data);
152 /* We are guaranteed to pull a SCTP header. */
1da177e4
LT
153 }
154 }
155
156 /* Do we need to take the next packet out of the queue to process? */
157 if (!chunk) {
79af02c2
DM
158 struct list_head *entry;
159
1da177e4 160 /* Is the queue empty? */
79af02c2 161 if (list_empty(&queue->in_chunk_list))
1da177e4
LT
162 return NULL;
163
79af02c2 164 entry = queue->in_chunk_list.next;
1da177e4 165 chunk = queue->in_progress =
79af02c2
DM
166 list_entry(entry, struct sctp_chunk, list);
167 list_del_init(entry);
1da177e4
LT
168
169 /* This is the first chunk in the packet. */
170 chunk->singleton = 1;
171 ch = (sctp_chunkhdr_t *) chunk->skb->data;
7c3ceb4f 172 chunk->data_accepted = 0;
1da177e4
LT
173 }
174
d808ad9a
YH
175 chunk->chunk_hdr = ch;
176 chunk->chunk_end = ((__u8 *)ch) + WORD_ROUND(ntohs(ch->length));
1da177e4
LT
177 /* In the unlikely case of an IP reassembly, the skb could be
178 * non-linear. If so, update chunk_end so that it doesn't go past
179 * the skb->tail.
180 */
181 if (unlikely(skb_is_nonlinear(chunk->skb))) {
27a884dc
ACM
182 if (chunk->chunk_end > skb_tail_pointer(chunk->skb))
183 chunk->chunk_end = skb_tail_pointer(chunk->skb);
1da177e4
LT
184 }
185 skb_pull(chunk->skb, sizeof(sctp_chunkhdr_t));
186 chunk->subh.v = NULL; /* Subheader is no longer valid. */
187
bf53932b
DB
188 if (chunk->chunk_end + sizeof(sctp_chunkhdr_t) <
189 skb_tail_pointer(chunk->skb)) {
1da177e4
LT
190 /* This is not a singleton */
191 chunk->singleton = 0;
27a884dc 192 } else if (chunk->chunk_end > skb_tail_pointer(chunk->skb)) {
bf53932b
DB
193 /* Discard inside state machine. */
194 chunk->pdiscard = 1;
195 chunk->chunk_end = skb_tail_pointer(chunk->skb);
1da177e4
LT
196 } else {
197 /* We are at the end of the packet, so mark the chunk
198 * in case we need to send a SACK.
199 */
200 chunk->end_of_packet = 1;
201 }
202
203 SCTP_DEBUG_PRINTK("+++sctp_inq_pop+++ chunk %p[%s],"
204 " length %d, skb->len %d\n",chunk,
205 sctp_cname(SCTP_ST_CHUNK(chunk->chunk_hdr->type)),
206 ntohs(chunk->chunk_hdr->length), chunk->skb->len);
207 return chunk;
208}
209
210/* Set a top-half handler.
211 *
212 * Originally, we the top-half handler was scheduled as a BH. We now
213 * call the handler directly in sctp_inq_push() at a time that
214 * we know we are lock safe.
215 * The intent is that this routine will pull stuff out of the
216 * inqueue and process it.
217 */
c4028958 218void sctp_inq_set_th_handler(struct sctp_inq *q, work_func_t callback)
1da177e4 219{
c4028958 220 INIT_WORK(&q->immediate, callback);
1da177e4
LT
221}
222