2 * Connection oriented routing
3 * Copyright (C) 2007-2010 Michael Blizek
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License
7 * as published by the Free Software Foundation; either version 2
8 * of the License, or (at your option) any later version.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License
16 * along with this program; if not, write to the Free Software
17 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
21 #include <asm/atomic.h>
23 #include <linux/types.h>
24 #include <linux/netdevice.h>
25 #include <linux/skbuff.h>
26 #include <linux/spinlock.h>
27 #include <linux/workqueue.h>
28 #include <linux/kref.h>
34 #define PIDOUT_NEWCONN 16
35 #define PIDOUT_SENDDEF_THRES 8
36 #define PIDOUT_SENDDEF_COUNT 16
40 #define ETH_P_COR 0x1022
44 #define SOCKADDRTYPE_PORT 1
53 #define MAX_CONN_CMD_LEN 4096
56 #define PACKET_TYPE_ANNOUNCE 1
57 #define PACKET_TYPE_DATA 2
60 * Kernel packet data - these commands are sent by the neighbor
61 * The end nodes may cause these commands to be sent, but they see them beyond
69 * KP_PING[1] cookie[4]
70 * KP_PONG[1] cookie[4] respdelay[4]
72 * This is needed to find out whether the other node is reachable. After a new
73 * neighbor is seen, ping requests are sent and the neighbor is only reachable
74 * after a few pongs are received. These requests are also used to find out
75 * whether a neighber is gone.
78 * The receiver of a ping may delay the sending of the pong e.g. to create
79 * bigger kernel packets. The respdelay is the time in microseconds the packet
85 /* KP_ACK[1] seqno[4] */
89 * KP_ACK_CONN[1] conn_id[4] seqno[4] window[1]
90 * KP_ACK_CONN_OOO[1] conn_id[4] seqno[4] window[1] seqno_ooo[4] length[4]
92 * conn_id is the conn_id we use if we sent something through this conn and
93 * *not* the conn_id that the neighbor used to send us the data
95 * seqno = the seqno which is expected in the next non-out-of-order packet
96 * seqno_ooo, length = in case
98 * window = amount of data which can be sent without receiving the next ack
99 * packets with lower seqno do not overwrite the last window size
100 * note: the other side may also reduce the window size
103 * 1...255 = 64*2^((value-1)/11) end result is rounded down to an integer
106 #define KP_ACK_CONN 5
107 #define KP_ACK_CONN_OOO 6
110 * NOTE on connection ids:
111 * connection ids + init seqnos we send are used for the receive channel
112 * connection ids + init seqnos we receive are used for the send channel
116 * incoming connection
117 * KP_CONNECT[1] conn_id[4] init_seqno[4] window[1]
122 * incoming connection successful,
123 * the first conn_id is the same as previously sent/received in KP_CONNECT
124 * the second conn_id is generated by us and used for the other direction
125 * KP_CONNECT_SUCCESS[1] conn_id[4] conn_id[4] init_seqno[4] window[1]
127 #define KP_CONNECT_SUCCESS 8
129 /* KP_CONN_DATA[1] conn_id[4] seqno[4] length[2] data[length] */
130 #define KP_CONN_DATA 9
133 * KP_PING_CONN[1] conn_id[4]
135 * This is for querying the status of an open connection. The response is either
136 * KP_ACK_CONN or CONNID_UNKNOWN
138 #define KP_PING_CONN 10
141 * { KP_RESET_CONN[1] conn_id[4] }
142 * We send this, if there is an established connection we want to close.
144 #define KP_RESET_CONN 11
147 * KP_CONNID_UNKNOWN[1] sent_conn_id[4]
148 * We send this, if we receive an invalid conn_id
150 #define KP_CONNID_UNKNOWN 12
153 * KP_PING_ALL_CONNS[1]
154 * We send this, if we we lost a conn, but could not send reset_conn and
157 #define KP_PING_ALL_CONNS 13
160 * KP_SET_MAX_CMSG_DELAY[1] delay[4]
161 * Sent after connecting and at any change
162 * delay in specifies in microsecs
164 #define KP_SET_MAX_CMSG_DELAY 14
167 * KP_SET_CREDITS[1] credits[8] rate_initial[4] rate_earning[4] rate_spending[4]
169 #define KP_SET_CREDITS 15
172 * KP_SET_CONN_CREDITS[1] conn_id[4] credit_rate[4]
174 #define KP_SET_CONN_CREDITS 16
178 * Connection data which in interpreted when connection has no target yet
179 * These commands are sent by the end node.
182 * cmd[2] length[1-4] parameter[length]
183 * unrecogniced commands are ignored
184 * parameters which are longer than expected are ignored as well
187 /* outgoing connection: CD_CONNECT_NB[2] length[1-4]
188 * addrtypelen[1-4] addrlen[1-4] addrtype[addrtypelen] addr[addrlen] */
189 #define CD_CONNECT_NB 1
191 /* connection to local open part: CD_CONNECT_PORT[2] length[1-4] port[8] */
192 #define CD_CONNECT_PORT 2
195 * CD_LIST_NEIGH sends CDR_BINDATA if the command was successful. The response
198 * totalneighs[1-4] response_rows[1-4]
199 * numfields[1-4] (field[2] fieldlen[1-4])[numfields]
200 * rows[responserows]:
201 * fieldlen[1-4], only if fieldlen in the header was "0"
202 * fielddata[fieldlen]
204 * Neighbors have to be sorted by uptime, new neighbors first. This is so that
205 * the routing daemon can easily find out whether there are new neighbors. It
206 * only needs to send a query with offset 0. If the totalneighs stays the same
207 * while new were added, a connection to another neighbor was lost.
209 * Future versions may append data to field definition. Therefore clients must
210 * silently discard data at the end they do not expect.
213 /* list connected neighbors: CD_LIST_NEIGH[2] length[1-4] limit[1-4]
215 #define CD_LIST_NEIGH 3
218 * numaddr[1-4] (addrtypelen[1-4] addrlen[1-4] addrtype[addrtypelen]
219 * addr[addrlen])[numaddr]
221 #define LIST_NEIGH_FIELD_ADDR 1
224 * latency_in_microsecs[4]
225 * Only raw network latency in measured. Delays caused by the credit system are
228 #define LIST_NEIGH_FIELD_LATENCY 2
232 * CD_SET_TOS[2] length[1-4] forward_tos[1] backward_tos[1]
233 * Only 2 bits of the tos flags are used, the highers 6 bits are ignored.
238 #define TOS_LATENCY 1
239 #define TOS_THROUGHPUT 2
240 #define TOS_PRIVACY 3
245 * Connection data response
246 * Format is the same as with connection data
255 * CDR_EXECFAILED[1] reasoncode[2]
256 * reasontextlength[1-4] reasontext[reasontextlength]
257 * reasontextlength may be 0
259 #define CDR_EXECFAILED 2
260 #define CDR_EXECFAILED_UNKNOWN_COMMAND 1
261 #define CDR_EXECFAILED_PERMISSION_DENIED 2
262 #define CDR_EXECFAILED_TEMPORARILY_OUT_OF_RESSOURCES 3
263 #define CDR_EXECFAILED_CMD_TOO_SHORT 4
264 #define CDR_EXECFAILED_CMD_TOO_LONG 5
265 #define CDR_EXECFAILED_TARGETADDRTYPE_UNKNOWN 6
266 #define CDR_EXECFAILED_TARGETADDR_DOESNTEXIST 7
267 #define CDR_EXECFAILED_TARGETADDR_PORTCLOSED 8
268 #define CDR_EXECFAILED_LISTENERQUEUE_FULL 9
269 #define CDR_EXECFAILED_ILLEGAL_COMMAND 10
272 * must be sent after CDR_EXEC{OK|FAILED}
273 * CDR_EXEOK_BINDATA[1] bindatalen[1-4] bindata[bindatalen] */
274 #define CDR_BINDATA 3
277 /* result codes for rcv.c/proc_packet */
279 #define RC_FINISHED 1
281 #define RC_RCV1_ANNOUNCE 2
282 #define RC_RCV1_KERNEL 3
283 #define RC_RCV1_CONN 4
286 /* start of next element, *not* next htab_entry */
291 struct htab_entry
**htable
;
296 int (*matches
)(void *htentry
, void *searcheditem
);
307 struct announce_data
{
311 struct net_device
*dev
;
312 struct delayed_work announce_work
;
313 struct announce
*ann
;
314 struct resume_block rb
;
316 __u32 curr_announce_msg_offset
;
317 __u64 scheduled_announce_timer
;
323 __u8 pongs
; /* count of pongs for pings sent after this one */
326 #define NEIGHBOR_STATE_INITIAL 0
327 #define NEIGHBOR_STATE_ACTIVE 1
328 #define NEIGHBOR_STATE_STALLED 2
329 #define NEIGHBOR_STATE_KILLED 3
332 struct list_head nb_list
;
336 struct net_device
*dev
;
337 char mac
[MAX_ADDR_LEN
];
342 struct delayed_work cmsg_timer
;
343 struct mutex cmsg_lock
;
344 struct list_head control_msgs_out
;
346 * urgent messages; These are sent even if the neighbor state is not
347 * active. If the queue gets full, the oldest ones are dropped. It thus
348 * may only contain messages which are allowed to be dropped.
350 struct list_head ucontrol_msgs_out
;
351 unsigned long timeout
;
355 atomic_t cmcnt
; /* size of queue + retransmits */
356 atomic_t ucmcnt
; /* size of queue only */
360 __u8 max_cmsg_delay_sent
;
362 /* see snd.c/qos_queue */
363 /* protected by cmsg_lock */
366 /* procected by queues_lock */
367 struct resume_block rb_kp
;
368 struct resume_block rb_cr
;
370 struct mutex pingcookie_lock
;
371 unsigned long last_ping_time
;
372 __u32 ping_intransit
;
373 struct ping_cookie cookies
[PING_COOKIES_PER_NEIGH
];
375 atomic_t latency
; /* microsecs */
376 atomic_t max_remote_cmsg_delay
; /* microsecs */
378 spinlock_t state_lock
;
380 __u64 last_state_change
;/* initial state */
383 * time of the last sent packet which has been acked or
384 * otherwise responded to (e.g. pong)
386 unsigned long last_roundtrip
;/* active/stalled state */
391 struct delayed_work stalltimeout_timer
;
392 __u8 str_timer_pending
;
395 atomic_t kpacket_seqno
;
396 atomic_t ooo_packets
;
398 spinlock_t credits_lock
;
399 long jiffies_credit_update
;
401 /* all cretid rates are in credits/ms */
402 __u64 credits
; /* how much we can spend */
404 __u64 credits_diff
; /* diff between the neighbor's and our calc */
405 __u32 credits_diff_fract
;
406 __s32 creditrate_initial
;
407 __u32 creditrate_earning
;
408 __u32 creditrate_spending
;
409 __u32 creditrate_spending_expected
;
411 __s32 creditrate_spending_diff
;
413 __u64 debits
; /* how much the other side can spend */
415 __s32 debitrate_initial
;
416 __s32 debitrate_initial_adj
;
417 __u32 debitrate_earning
;
418 __u32 debitrate_spending
;
421 * connecions which receive data from/send data to this node
422 * used when terminating all connections of a neighbor
424 struct mutex conn_list_lock
;
425 struct list_head rcv_conn_list
;
426 struct list_head snd_conn_list
;
427 __u32 num_send_conns
;
430 * used for ping_all conns, if not zero this is the next conn we need to
431 * ping, protected by conn_list_lock
433 struct conn
*next_ping_conn
;
434 __u32 ping_conns_remaining
;
435 __u32 ping_conns_retrans_remaining
;
436 __u32 pong_conns_expected
;
437 unsigned long ping_conn_completed
; /* jiffies */
440 * the timer has to be inited when adding the neighbor
441 * init_timer(struct timer_list * timer);
442 * add_timer(struct timer_list * timer);
444 spinlock_t retrans_lock
;
445 struct delayed_work retrans_timer_conn
;
446 struct delayed_work retrans_timer
;
447 __u8 retrans_timer_conn_running
;
448 __u8 retrans_timer_running
;
450 struct list_head retrans_list
;
451 struct list_head retrans_list_conn
;
453 struct conn
*firstboundconn
;
456 struct cor_sched_data
{
458 struct list_head conn_list
;
459 struct sk_buff_head requeue_queue
;
465 struct data_buf_item
{
466 struct list_head buf_list
;
486 struct connlistener
*owner
;
490 #define SOCKSTATE_LISTENER 1
491 #define SOCKSTATE_CONN 2
494 /* The first member of connlistener/conn (see sock.c) */
498 struct connlistener
{
499 /* The first member has to be the same as in conn (see sock.c) */
505 struct list_head conn_queue
;
506 wait_queue_head_t wait
;
511 __u64 speed
;/* bytes*65536/jiffie */
512 unsigned long jiffies_last_update
;
517 * There are 2 conn objects per bi-directional connection. They refer to each
518 * other with in the reversedir field. To distinguish them, the variables on
519 * the stack are usually called rconn and sconn. rconn refers to the conn object
520 * which has received a command. sconn is the other conn object.
523 /* The first member has to be the same as in connlistener (see sock.c)*/
526 #define SOURCE_NONE 0
528 #define SOURCE_SOCK 2
530 #define TARGET_UNCONNECTED 0
532 #define TARGET_SOCK 2
539 __u8 last_bufferstate
:1,
544 * 0... connection active
545 * 1... connection is about to be reset, target does not need to be
547 * 2... connection is reset
548 * 3... connection is reset + no pointers to "struct conn *reversedir"
549 * remaining except from this conn
553 struct list_head queue_list
;
559 * If one side is SOCK or NONE/UNCONNECTED and both directions
560 * need to be locked, the direction with TARGET_UNCONNECTED or
561 * TARGET_SOCK has to be locked first, the direction with
562 * SOURCE_NONE or SOURCE_SOCK afterwards. If one side is TARGET_SOCK
563 * and the other is TARGET_UNCONNECTED, TARGET_SOCK needs to be locked
564 * first. This is needed for changing source/targettype, credit flow
565 * and TARGET_UNCONNECTED generating responses.
566 * If data is forwarded, (both sides are IN/OUT), only one direction
569 struct mutex rcv_lock
;
571 unsigned long jiffies_credit_update
;
572 struct list_head credit_list
;
576 /* credit rates, locked by credit_lock (in credit.c) */
580 * This is how much we *want* to forward, but how much we actually do.
588 /* list of all connections from this neighbor */
589 struct list_head nb_list
;
591 struct sk_buff_head reorder_queue
;
593 struct htab_entry htab_entry
;
598 atomic_t pong_awaiting
;
603 __u32 window_seqnolimit_max
;
604 __u32 window_seqnolimit_last
;
606 struct list_head buffer_list
;
617 struct speedtracker st
;
619 unsigned long jiffies_last_window_set
;
623 struct list_head cl_list
;
624 wait_queue_head_t wait
;
630 struct sock_buffertracker
*sbt
;
631 struct list_head delflush_list
;
632 struct list_head alwait_list
;
646 char paramlen_buf
[4];
648 __u8 in_buffer_wait_list
;
649 struct list_head buffer_wait_list
;
653 /* has to be first (because it is first in target
657 /* list of all connections to this neighbor */
658 struct list_head nb_list
;
659 /* protected by nb->retrans_lock, sorted by seqno */
660 struct list_head retrans_list
;
662 /* reverse conn_id lookup */
663 struct htab_entry htab_entry
;
666 __u32 seqno_nextsend
;
668 __u32 seqno_windowlimit
;
669 __u32 kp_windowsetseqno
;
671 struct resume_block rb
;
674 long jiffies_crate_send
;
679 wait_queue_head_t wait
;
686 struct list_head items
;
687 struct data_buf_item
*lastread
;
692 __u32 read_remaining
;
694 __u16 last_read_offset
;
696 __u16 cpacket_buffer
;/* including overhead */
699 struct conn
*reversedir
;
703 struct skb_procstate
{
706 struct work_struct work
;
719 struct sock_buffertracker
{
725 struct list_head delflush_conns
;
726 struct list_head waiting_conns
;
733 extern atomic_t num_conns
;
735 extern __u8
enc_log_64_11(__u32 window_bytes
);
737 extern __u32
dec_log_64_11(__u8 window
);
739 extern char *htable_get(struct htable
*ht
, __u32 key
, void *searcheditem
);
741 extern int htable_delete(struct htable
*ht
, __u32 key
, void *searcheditem
,
742 void (*free
) (struct kref
*ref
));
744 extern void htable_insert(struct htable
*ht
, char *newelement
, __u32 key
);
746 extern void htable_init(struct htable
*ht
, int (*matches
)(void *htentry
,
747 void *searcheditem
), __u32 entry_offset
,
750 extern struct conn
*get_conn_reverse(struct neighbor
*nb
, __u32 conn_id
);
752 extern void insert_reverse_connid(struct conn
*rconn
);
754 extern struct conn
*get_conn(__u32 conn_id
);
756 extern void free_conn(struct kref
*ref
);
758 extern int conn_init_out(struct conn
*rconn
, struct neighbor
*nb
);
760 extern void conn_init_sock_source(struct conn
*conn
);
762 extern void conn_init_sock_target(struct conn
*conn
);
764 extern void close_port(struct connlistener
*listener
);
766 extern struct connlistener
*open_port(__be64 port
);
768 extern int connect_port(struct conn
*rconn
, __be64 port
);
770 extern int connect_neigh(struct conn
*rconn
,
771 __u16 addrtypelen
, __u8
*addrtype
,
772 __u16 addrlen
, __u8
*addr
);
774 extern struct conn
* alloc_conn(gfp_t allocflags
);
776 extern void reset_ping(struct conn
*rconn
);
778 extern void reset_conn(struct conn
*conn
);
781 extern int refresh_credits_state(struct neighbor
*nb
);
783 extern void check_credit_state(struct neighbor
*nb
);
785 extern int debit_adj_needed(struct neighbor
*nb
);
787 extern int refresh_conn_credits(struct conn
*conn
, int fromperiodic
);
789 extern void set_credits(struct neighbor
*nb
, __u64 credits
,
790 __s32 creditrate_initial
, __u32 creditrate_earning
,
791 __u32 creditrate_spending
);
793 extern void set_debitrate_initial(struct neighbor
*nb
, __u32 debitrate
);
795 extern void set_conn_in_crate(struct conn
*rconn
, __u32 crate_in
);
797 extern void connreset_credits(struct conn
*conn
);
799 extern void credits_init(void);
802 extern void neighbor_free(struct kref
*ref
);
804 extern struct neighbor
*get_neigh_by_mac(struct sk_buff
*skb
);
806 extern struct neighbor
*find_neigh(__u16 addrtypelen
, __u8
*addrtype
,
807 __u16 addrlen
, __u8
*addr
);
809 extern __u32
generate_neigh_list(char *buf
, __u32 buflen
, __u32 limit
,
812 extern int get_neigh_state(struct neighbor
*nb
);
814 extern void ping_resp(struct neighbor
*nb
, __u32 cookie
, __u32 respdelay
);
816 extern __u32
add_ping_req(struct neighbor
*nb
);
818 extern void unadd_ping_req(struct neighbor
*nb
, __u32 cookie
);
820 extern int time_to_send_ping(struct neighbor
*nb
);
822 extern int force_ping(struct neighbor
*nb
);
824 extern void rcv_announce(struct sk_buff
*skb
);
826 extern int send_announce_qos(struct announce_data
*ann
);
828 extern void announce_data_free(struct kref
*ref
);
830 extern int __init
cor_neighbor_init(void);
833 extern __u8
get_window(struct conn
*rconn
);
835 extern void reset_bufferusage(struct conn
*conn
);
837 extern void refresh_speedstat(struct conn
*rconn
, __u32 written
);
839 extern void drain_ooo_queue(struct conn
*rconn
);
841 extern void conn_rcv_buildskb(char *data
, __u32 datalen
, __u32 conn_id
,
844 extern int __init
cor_rcv_init(void);
846 /* kpacket_parse.c */
847 extern void kernel_packet(struct neighbor
*nb
, struct sk_buff
*skb
, __u32 seqno
);
850 extern void schedule_controlmsg_timerfunc(struct neighbor
*nb
);
852 struct control_msg_out
;
854 #define ACM_PRIORITY_LOW 1
855 #define ACM_PRIORITY_MED 2
856 #define ACM_PRIORITY_HIGH 3
858 extern int may_alloc_control_msg(struct neighbor
*nb
, int priority
);
860 extern struct control_msg_out
*alloc_control_msg(struct neighbor
*nb
,
863 extern void free_control_msg(struct control_msg_out
*cm
);
865 extern void retransmit_timerfunc(struct work_struct
*work
);
867 extern void kern_ack_rcvd(struct neighbor
*nb
, __u32 seqno
);
869 extern int send_messages(struct neighbor
*nb
, int allmsgs
, int resume
);
871 extern void send_pong(struct neighbor
*nb
,
874 extern void send_reset_conn(struct control_msg_out
*cm
, __u32 conn_id
);
876 extern void send_ack(struct neighbor
*nb
,
879 extern void send_ack_conn(struct control_msg_out
*cm
, struct conn
*rconn
,
880 __u32 conn_id
, __u32 seqno
);
882 extern void send_ack_conn_ooo(struct control_msg_out
*cm
, struct conn
*rconn
,
883 __u32 conn_id
, __u32 seqno
, __u32 seqno_ooo
, __u32 length
);
885 extern void send_connect_success(struct control_msg_out
*cm
, __u32 rcvd_conn_id
,
886 __u32 gen_conn_id
, __u32 init_seqno
, struct conn
*rconn
);
888 extern void send_connect_nb(struct control_msg_out
*cm
, __u32 conn_id
,
889 __u32 init_seqno
, struct conn
*sconn
);
891 extern void send_conndata(struct control_msg_out
*cm
, __u32 conn_id
,
892 __u32 seqno
, char *data_orig
, char *data
, __u32 datalen
);
894 extern void send_ping_conn(struct control_msg_out
*cm
, __u32 conn_id
);
896 extern void send_connid_unknown(struct control_msg_out
*cm
, __u32 conn_id
);
898 extern void send_ping_all_conns(struct neighbor
*nb
);
900 extern void send_credits(struct neighbor
*nb
);
902 extern void cor_kgen_init(void);
904 /* cpacket_parse.c */
905 extern void free_cpacket_buffer(__s32 amount
);
907 extern void connreset_cpacket_buffer(struct conn
*rconn
);
909 extern int encode_len(char *buf
, int buflen
, __u32 len
);
911 extern int decode_len(char *buf
, int buflen
, __u32
*len
);
913 extern void parse(struct conn
*rconn
, int fromresume
);
915 extern int __init
cor_cpacket_init(void);
918 extern int destroy_queue(struct net_device
*dev
);
920 extern int create_queue(struct net_device
*dev
);
922 #define QOS_CALLER_KPACKET 0
923 #define QOS_CALLER_CONN_RETRANS 1
924 #define QOS_CALLER_ANNOUNCE 2
925 #define QOS_CALLER_CONN 3
927 extern void qos_enqueue(struct net_device
*dev
, struct resume_block
*rb
,
930 extern void qos_remove_conn(struct conn
*rconn
);
932 extern struct sk_buff
*create_packet(struct neighbor
*nb
, int size
,
933 gfp_t alloc_flags
, __u32 conn_id
, __u32 seqno
);
935 extern void cancel_retrans(struct conn
*rconn
);
937 extern void retransmit_conn_timerfunc(struct work_struct
*work
);
939 extern void conn_ack_rcvd(__u32 kpacket_seqno
, struct conn
*rconn
, __u32 seqno
,
940 __u8 window
, __u32 seqno_ooo
, __u32 length
);
942 #define RC_FLUSH_CONN_OUT_OK 0
943 #define RC_FLUSH_CONN_OUT_OK_SENT 1
944 #define RC_FLUSH_CONN_OUT_CONG 2
945 #define RC_FLUSH_CONN_OUT_CREDITS 3
946 #define RC_FLUSH_CONN_OUT_OOM 4
947 extern int flush_out(struct conn
*rconn
, int fromqos
, __u32 creditsperbyte
);
949 extern int __init
cor_snd_init(void);
952 extern void databuf_pull(struct conn
*conn
, char *dst
, int len
);
954 extern size_t databuf_pulluser(struct conn
*sconn
, struct msghdr
*msg
);
956 extern void databuf_unpull(struct conn
*conn
, __u32 bytes
);
958 extern void databuf_pullold(struct conn
*conn
, __u32 startpos
, char *dst
,
961 extern void databuf_ack(struct conn
*rconn
, __u32 pos
);
963 extern void databuf_ackread(struct conn
*rconn
);
965 extern void flush_buf(struct conn
*rconn
);
967 extern void reset_seqno(struct conn
*conn
, __u32 initseqno
);
969 extern void databuf_free(struct conn
*conn
);
971 extern void databuf_init(struct conn
*conn
);
973 __s64
receive_userbuf(struct conn
*rconn
, struct msghdr
*msg
, __u32 maxcpy
,
976 extern void receive_cpacketresp(struct conn
*rconn
, char *buf
, int len
);
978 extern int receive_skb(struct conn
*rconn
, struct sk_buff
*skb
);
980 extern void wake_sender(struct conn
*rconn
);
982 extern void forward_init(void);
985 extern struct mutex sock_bufferlimits_lock
;
987 extern void free_sbt(struct kref
*ref
);
989 extern void unreserve_sock_buffer(struct conn
*conn
);
992 static inline struct skb_procstate
*skb_pstate(struct sk_buff
*skb
)
994 return (struct skb_procstate
*) &(skb
->cb
[0]);
997 static inline struct sk_buff
*skb_from_pstate(struct skb_procstate
*ps
)
999 return (struct sk_buff
*) (((char *)ps
) - offsetof(struct sk_buff
,cb
));
1003 static inline __u32
mss(struct neighbor
*nb
)
1005 return nb
->dev
->mtu
- LL_RESERVED_SPACE(nb
->dev
) - 9;
1009 static inline void put_u64(char *dst
, __u64 value
, int convbo
)
1011 char *p_value
= (char *) &value
;
1014 value
= cpu_to_be64(value
);
1016 dst
[0] = p_value
[0];
1017 dst
[1] = p_value
[1];
1018 dst
[2] = p_value
[2];
1019 dst
[3] = p_value
[3];
1020 dst
[4] = p_value
[4];
1021 dst
[5] = p_value
[5];
1022 dst
[6] = p_value
[6];
1023 dst
[7] = p_value
[7];
1026 static inline void put_u32(char *dst
, __u32 value
, int convbo
)
1028 char *p_value
= (char *) &value
;
1031 value
= cpu_to_be32(value
);
1033 dst
[0] = p_value
[0];
1034 dst
[1] = p_value
[1];
1035 dst
[2] = p_value
[2];
1036 dst
[3] = p_value
[3];
1039 static inline void put_u16(char *dst
, __u16 value
, int convbo
)
1041 char *p_value
= (char *) &value
;
1044 value
= cpu_to_be16(value
);
1046 dst
[0] = p_value
[0];
1047 dst
[1] = p_value
[1];
1050 static inline char *cor_pull_skb(struct sk_buff
*skb
, unsigned int len
)
1052 char *ptr
= skb_pull(skb
, len
);
1054 if(unlikely(ptr
== 0))
1061 static inline __u64
mul_saturated(__u64 a
, __u64 b
)
1069 static inline int numdigits(__u64 value
)
1072 for (;value
!= 0;value
= (value
>> 1)) {
1078 /* approximate (a*b) / c without overflowing a*b */
1079 static inline __u64
multiply_div(__u64 a
, __u64 b
, __u64 c
)
1081 int alen
= numdigits(a
);
1082 int blen
= numdigits(b
);
1083 int clen
= numdigits(c
);
1085 BUG_ON(alen
< 0 || alen
> 64);
1086 BUG_ON(blen
< 0 || blen
> 64);
1087 BUG_ON(clen
< 0 || clen
> 64);
1089 BUG_ON((a
== 0 && alen
!= 0) || (a
!= 0 && alen
== 0));
1090 BUG_ON((b
== 0 && blen
!= 0) || (b
!= 0 && blen
== 0));
1091 BUG_ON((c
== 0 && clen
!= 0) || (c
!= 0 && clen
== 0));
1093 BUG_ON(a
>= b
&& alen
< blen
);
1094 BUG_ON(a
>= c
&& alen
< clen
);
1095 BUG_ON(b
>= a
&& blen
< alen
);
1096 BUG_ON(b
>= c
&& blen
< clen
);
1097 BUG_ON(c
>= a
&& clen
< alen
);
1098 BUG_ON(c
>= b
&& clen
< blen
);
1100 if (alen
== 0 || blen
== 0)
1105 if (alen
+ blen
<= 64)
1108 if (a
>= b
&& alen
> clen
+ 16)
1109 return mul_saturated(a
/c
, b
);
1110 else if (a
< b
&& blen
> clen
+ 16)
1111 return mul_saturated(b
/c
, a
);
1113 while (alen
+ blen
> 64) {
1114 if (alen
> blen
|| (alen
== blen
&& a
> b
)) {