blob: bb977330002ac56307cda341fff68b2bc828baeb [file] [log] [blame]
Vlad Yasevich60c778b2008-01-11 09:57:09 -05001/* SCTP kernel implementation Copyright (C) 1999-2001
Linus Torvalds1da177e2005-04-16 15:20:36 -07002 * Cisco, Motorola, and IBM
3 * Copyright 2001 La Monte H.P. Yarroll
4 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -05005 * This file is part of the SCTP kernel implementation
Linus Torvalds1da177e2005-04-16 15:20:36 -07006 *
7 * These functions manipulate sctp command sequences.
8 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -05009 * This SCTP implementation is free software;
Linus Torvalds1da177e2005-04-16 15:20:36 -070010 * you can redistribute it and/or modify it under the terms of
11 * the GNU General Public License as published by
12 * the Free Software Foundation; either version 2, or (at your option)
13 * any later version.
14 *
Vlad Yasevich60c778b2008-01-11 09:57:09 -050015 * This SCTP implementation is distributed in the hope that it
Linus Torvalds1da177e2005-04-16 15:20:36 -070016 * will be useful, but WITHOUT ANY WARRANTY; without even the implied
17 * ************************
18 * warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
19 * See the GNU General Public License for more details.
20 *
21 * You should have received a copy of the GNU General Public License
22 * along with GNU CC; see the file COPYING. If not, write to
23 * the Free Software Foundation, 59 Temple Place - Suite 330,
24 * Boston, MA 02111-1307, USA.
25 *
26 * Please send any bug reports or fixes you make to the
27 * email address(es):
28 * lksctp developers <lksctp-developers@lists.sourceforge.net>
29 *
30 * Or submit a bug report through the following website:
31 * http://www.sf.net/projects/lksctp
32 *
33 * Written or modified by:
34 * La Monte H.P. Yarroll <piggy@acm.org>
35 * Karl Knutson <karl@athena.chicago.il.us>
36 *
37 * Any bugs reported given to us we will try to fix... any fixes shared will
38 * be incorporated into the next SCTP release.
39 */
40
41#include <linux/types.h>
42#include <net/sctp/sctp.h>
43#include <net/sctp/sm.h>
44
45/* Initialize a block of memory as a command sequence. */
46int sctp_init_cmd_seq(sctp_cmd_seq_t *seq)
47{
48 memset(seq, 0, sizeof(sctp_cmd_seq_t));
49 return 1; /* We always succeed. */
50}
51
52/* Add a command to a sctp_cmd_seq_t.
53 * Return 0 if the command sequence is full.
54 */
55int sctp_add_cmd(sctp_cmd_seq_t *seq, sctp_verb_t verb, sctp_arg_t obj)
56{
57 if (seq->next_free_slot >= SCTP_MAX_NUM_COMMANDS)
58 goto fail;
59
60 seq->cmds[seq->next_free_slot].verb = verb;
61 seq->cmds[seq->next_free_slot++].obj = obj;
62
63 return 1;
64
65fail:
66 return 0;
67}
68
69/* Return the next command structure in a sctp_cmd_seq.
70 * Returns NULL at the end of the sequence.
71 */
72sctp_cmd_t *sctp_next_cmd(sctp_cmd_seq_t *seq)
73{
74 sctp_cmd_t *retval = NULL;
75
76 if (seq->next_cmd < seq->next_free_slot)
77 retval = &seq->cmds[seq->next_cmd++];
78
79 return retval;
80}
81