2 * Connection oriented routing
3 * Copyright (C) 2007-2008 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 <linux/gfp.h>
22 #include <linux/jiffies.h>
23 #include <linux/slab.h>
27 static struct htable retransmits
;
29 static void free_skb(struct ref_counter
*cnt
)
31 struct skb_procstate
*ps
= container_of(cnt
, struct skb_procstate
,
32 funcstate
.retransmit_queue
.refs
);
34 struct sk_buff
*skb
= skb_from_pstate(ps
);
36 ref_counter_decr(&(ps
->rconn
->refs
));
40 static struct ref_counter_def skb_refcnt
= {
44 struct retransmit_matchparam
{
50 static __u32
rm_to_key(struct retransmit_matchparam
*rm
)
52 return rm
->conn_id
^ rm
->seqno
;
55 /* static struct sk_buff * cor_dequeue(struct Qdisc *sch)
59 struct cor_sched_data *q = qdisc_priv(sch);
61 struct list_head *ln = q->conn_list.next;
62 struct conn *best = 0;
64 __u64 currcost_limit = 0;
67 spin_lock(&(q->lock));
69 if (!(skb_queue_empty(&(q->requeue_queue)))) {
70 ret = __skb_dequeue(&(q->requeue_queue));
74 while (&(q->conn_list) != ln) {
75 __u32 max1, max2, maxcost;
76 struct conn *curr = (struct conn *)
77 (((char *) ln) - offsetof(struct conn,
78 target.out.queue_list));
80 BUG_ON(TARGET_OUT != curr->targettype);
81 max1 = (256 * ((__u64)curr->credits)) /
82 ((__u64)curr->bytes_queued + curr->avg_rate);
84 max2 = (256 * ((__u64)curr->credits +
85 curr->credit_sender - curr->credit_recp)) /
86 ((__u64)curr->bytes_queued + 2*curr->avg_rate);
88 maxcost = max((__u32) 0, min((max1), (max2)));
90 if (maxcost > currcost_limit) {
91 currcost = currcost_limit;
92 currcost_limit = maxcost;
99 best->credits -= currcost;
101 ret = __skb_dequeue(&(best->target.out.queue));
103 if (skb_queue_empty(&(best->target.out.queue))) {
104 list_del(&(best->target.out.queue_list));
105 best->target.out.qdisc_active = 0;
109 spin_unlock(&(q->lock));
111 if (likely(0 != ret)) {
112 sch->qstats.backlog -= ret->len;
119 static int cor_enqueue(struct sk_buff *skb, struct Qdisc *sch)
121 struct cor_sched_data *q = qdisc_priv(sch);
124 rconn = skb_pstate(skb)->rconn;
126 BUG_ON(TARGET_OUT != rconn->targettype);
128 spin_lock(&(rconn->target.out.qdisc_lock));
130 __skb_queue_tail(&(rconn->target.out.queue), skb);
132 if (unlikely(0 == rconn->target.out.qdisc_active)) {
133 spin_lock(&(q->lock));
134 list_add(&(rconn->target.out.queue_list), &(q->conn_list));
135 rconn->target.out.qdisc_active = 1;
136 spin_unlock(&(q->lock));
139 spin_unlock(&(rconn->target.out.qdisc_lock));
141 sch->bstats.bytes += skb->len;
142 sch->bstats.packets++;
145 return NET_XMIT_SUCCESS;
148 static void cor_xmit(struct sk_buff
*skb
)
150 struct sk_buff
*skb2
;
154 skb2
= skb_clone(skb
, __GFP_DMA
| GFP_KERNEL
);
157 printk(KERN_WARNING
"cor_xmit: cannot clone skb, "
158 "allocation failure?");
161 dev_queue_xmit(skb2
);
164 void retransmit_timerfunc(unsigned long arg
)
166 unsigned long iflags
;
168 struct neighbor
*nb
= (struct neighbor
*) arg
;
169 struct sk_buff
*skb
= 0;
170 struct skb_procstate
*ps
= 0;
171 unsigned long timeout
;
175 spin_lock_irqsave( &(nb
->retrans_lock
), iflags
);
176 skb
= __skb_dequeue(&(nb
->retrans_list
));
181 ps
= skb_pstate(skb
);
182 timeout
= ps
->funcstate
.retransmit_queue
.timeout
;
184 if (time_before(timeout
, jiffies
)) {
185 __skb_queue_head(&(nb
->retrans_list
), skb
);
189 ps
->funcstate
.retransmit_queue
.timeout
= jiffies
+ nb
->latency
;
190 __skb_queue_tail(&(nb
->retrans_list
), skb
);
192 spin_unlock_irqrestore( &(nb
->retrans_lock
), iflags
);
197 mod_timer(&(nb
->retrans_timer
), timeout
);
200 spin_unlock_irqrestore( &(nb
->retrans_lock
), iflags
);
203 static struct sk_buff
*create_packet(struct neighbor
*nb
, int size
,
204 gfp_t alloc_flags
, __u32 keyid
, __u32 keyseq
, __u32 conn_id
,
207 struct net_device
*dev
= nb
->dev
;
209 struct skb_procstate
*ps
;
212 ret
= alloc_skb(size
+ 17 + LL_ALLOCATED_SPACE(dev
), alloc_flags
);
213 if (unlikely(0 == ret
))
216 ret
->protocol
= htons(ETH_P_COR
);
217 ps
= skb_pstate(ret
);
218 ps
->funcstate
.retransmit_queue
.conn_id
= conn_id
;
219 ps
->funcstate
.retransmit_queue
.seqno
= seqno
;
220 skb_reserve(ret
, LL_RESERVED_SPACE(dev
));
221 if(unlikely(dev_hard_header(ret
, dev
, ETH_P_COR
, nb
->mac
,
222 dev
->dev_addr
, ret
->len
) < 0))
225 skb_reserve(ret
, LL_RESERVED_SPACE(dev
));
226 skb_reset_network_header(ret
);
228 dest
= skb_put(ret
, 17);
231 dest
[0] = PACKET_TYPE_DATA
;
234 put_u32(dest
, keyid
, 1);
236 put_u32(dest
, keyseq
, 1);
238 put_u32(dest
, conn_id
, 1);
240 put_u32(dest
, seqno
, 1);
246 struct sk_buff
*create_packet_conn(struct conn
*target
, int size
,
249 __u32 connid
= target
->target
.out
.conn_id
;
252 seqno
= target
->target
.out
.seqno
;
253 target
->target
.out
.seqno
+= size
;
255 return create_packet(target
->target
.out
.nb
, size
, alloc_flags
, 0, 0,
259 struct sk_buff
*create_packet_kernel(struct neighbor
*nb
, int size
,
262 __u32 seqno
= atomic_add_return(1, &(nb
->kpacket_seqno
));
263 return create_packet(nb
, size
, alloc_flags
, 0, 0, 0, seqno
);
266 void send_conn_flushdata(struct conn
*rconn
, char *data
, __u32 datalen
)
269 struct control_msg_out
*cm
= alloc_control_msg();
271 seqno
= rconn
->target
.out
.seqno
;
272 rconn
->target
.out
.seqno
+= datalen
;
274 #warning todo retransmit/controlmsg == 0
276 send_conndata(cm
, rconn
->target
.out
.nb
, rconn
->target
.out
.conn_id
,
277 seqno
, data
, data
, datalen
);
280 void send_packet(struct sk_buff
*skb
, struct neighbor
*nb
)
282 unsigned long iflags
;
284 struct skb_procstate
*ps
= skb_pstate(skb
);
285 struct retransmit_matchparam rm
;
288 printk(KERN_ERR
"send_packet");
290 BUG_ON(ps
->rconn
->targettype
!= TARGET_OUT
);
292 rm
.conn_id
= ps
->funcstate
.retransmit_queue
.conn_id
;
293 rm
.seqno
= ps
->funcstate
.retransmit_queue
.seqno
;
296 ps
->funcstate
.retransmit_queue
.timeout
= jiffies
+ nb
->latency
;
297 ref_counter_init(&(ps
->funcstate
.retransmit_queue
.refs
), &skb_refcnt
);
299 htable_insert(&retransmits
, (char *) skb
, rm_to_key(&rm
));
301 spin_lock_irqsave( &(nb
->retrans_lock
), iflags
);
303 first
= unlikely(skb_queue_empty(&(nb
->retrans_list
)));
304 __skb_queue_tail(&(nb
->retrans_list
), skb
);
307 mod_timer(&(nb
->retrans_timer
),
308 ps
->funcstate
.retransmit_queue
.timeout
);
311 spin_unlock_irqrestore( &(nb
->retrans_lock
), iflags
);
313 ref_counter_incr(&(ps
->rconn
->refs
));
317 ref_counter_incr(&(ps
->funcstate
.retransmit_queue
.refs
));
320 void ack_received(struct neighbor
*nb
, __u32 conn_id
, __u32 seqno
,
323 unsigned long iflags
;
325 struct sk_buff
*skb
= 0;
326 struct skb_procstate
*ps
;
327 struct retransmit_matchparam rm
;
333 rm
.conn_id
= conn_id
;
337 skb
= (struct sk_buff
*) htable_get(&retransmits
, rm_to_key(&rm
), &rm
);
342 ps
= skb_pstate(skb
);
344 ret
= htable_delete(&retransmits
, rm_to_key(&rm
), &rm
);
346 /* somebody else has already deleted it in the meantime */
350 spin_lock_irqsave( &(nb
->retrans_lock
), iflags
);
352 if (unlikely(nb
->retrans_list
.next
== skb
))
354 skb
->next
->prev
= skb
->prev
;
355 skb
->prev
->next
= skb
->next
;
358 if (unlikely(skb_queue_empty(&(nb
->retrans_list
)))) {
359 mod_timer(&(nb
->retrans_timer
), jiffies
+ nb
->latency
);
363 spin_unlock_irqrestore( &(nb
->retrans_lock
), iflags
);
366 void flush_out(struct conn
*rconn
)
368 int targetmss
= mss(rconn
->target
.out
.nb
);
373 printk(KERN_ERR
"flush_out");
375 if (unlikely(rconn
->target
.out
.conn_id
== 0))
378 while (rconn
->buf
.read_remaining
>= targetmss
) {
379 struct sk_buff
*newskb
= create_packet_conn(rconn
, targetmss
,
382 char *dst
= skb_put(newskb
, targetmss
);
383 databuf_pull(&(rconn
->buf
), dst
, targetmss
);
384 databuf_ackread(&(rconn
->buf
));
385 send_packet(newskb
, rconn
->target
.out
.nb
);
388 if (rconn
->buf
.read_remaining
== 0)
391 len
= rconn
->buf
.read_remaining
;
392 buf
= kmalloc(len
, GFP_KERNEL
);
394 databuf_pull(&(rconn
->buf
), buf
, len
);
395 databuf_ackread(&(rconn
->buf
));
397 send_conn_flushdata(rconn
, buf
, len
);
400 printk(KERN_ERR
"flush_out1");
403 static int matches_skb_connid_seqno(void *htentry
, void *searcheditem
)
405 struct sk_buff
*skb
= (struct sk_buff
*) htentry
;
406 struct skb_procstate
*ps
= skb_pstate(skb
);
407 struct retransmit_matchparam
*rm
= (struct retransmit_matchparam
*)
410 return rm
->conn_id
== ps
->funcstate
.retransmit_queue
.conn_id
&&
411 rm
->seqno
== ps
->funcstate
.retransmit_queue
.seqno
&&
412 rm
->nb
== ps
->rconn
->target
.out
.nb
;
415 static inline __u32
retransmit_entryoffset(void)
417 return offsetof(struct sk_buff
, cb
) + offsetof(struct skb_procstate
,
418 funcstate
.retransmit_queue
.htab_entry
);
421 static inline __u32
retransmit_refsoffset(void)
423 return offsetof(struct sk_buff
, cb
) + offsetof(struct skb_procstate
,
424 funcstate
.retransmit_queue
.refs
);
427 int __init
cor_snd_init(void)
429 htable_init(&retransmits
, matches_skb_connid_seqno
,
430 retransmit_entryoffset(), retransmit_refsoffset());
435 MODULE_LICENSE("GPL");