1 /*********************************************************************
3 * Filename: irlmp_frame.c
5 * Description: IrLMP frame implementation
6 * Status: Experimental.
8 * Created at: Tue Aug 19 02:09:59 1997
9 * Modified at: Mon Dec 13 13:41:12 1999
13 * All Rights Reserved.
16 * This program is free software; you can redistribute it and/or
17 * modify it under the terms of the GNU General Public License as
18 * published by the Free Software Foundation; either version 2 of
19 * the License, or (at your option) any later version.
21 * Neither Dag Brattli nor University of Tromsø admit liability nor
22 * provide warranty for any of this software. This material is
23 * provided "AS-IS" and at no charge.
25 ********************************************************************/
27 #include <linux/skbuff.h>
28 #include <linux/kernel.h>
30 #include <net/irda/irda.h>
31 #include <net/irda/irlap.h>
32 #include <net/irda/timer.h>
33 #include <net/irda/irlmp.h>
34 #include <net/irda/irlmp_frame.h>
35 #include <net/irda/discovery.h>
37 static struct lsap_cb *irlmp_find_lsap(struct lap_cb *self, __u8 dlsap,
38 __u8 slsap, int status, hashbin_t *);
40 inline void irlmp_send_data_pdu(struct lap_cb *self, __u8 dlsap, __u8 slsap,
41 int expedited, struct sk_buff *skb)
47 pr_debug("%s(), sending expedited data\n", __func__);
48 irlap_data_request(self->irlap, skb, TRUE);
50 irlap_data_request(self->irlap, skb, FALSE);
54 * Function irlmp_send_lcf_pdu (dlsap, slsap, opcode,skb)
56 * Send Link Control Frame to IrLAP
58 void irlmp_send_lcf_pdu(struct lap_cb *self, __u8 dlsap, __u8 slsap,
59 __u8 opcode, struct sk_buff *skb)
63 IRDA_ASSERT(self != NULL, return;);
64 IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
65 IRDA_ASSERT(skb != NULL, return;);
69 frame[0] = dlsap | CONTROL_BIT;
74 if (opcode == DISCONNECT)
75 frame[3] = 0x01; /* Service user request */
77 frame[3] = 0x00; /* rsvd */
79 irlap_data_request(self->irlap, skb, FALSE);
83 * Function irlmp_input (skb)
85 * Used by IrLAP to pass received data frames to IrLMP layer
88 void irlmp_link_data_indication(struct lap_cb *self, struct sk_buff *skb,
92 __u8 slsap_sel; /* Source (this) LSAP address */
93 __u8 dlsap_sel; /* Destination LSAP address */
96 IRDA_ASSERT(self != NULL, return;);
97 IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
98 IRDA_ASSERT(skb->len > 2, return;);
103 * The next statements may be confusing, but we do this so that
104 * destination LSAP of received frame is source LSAP in our view
106 slsap_sel = fp[0] & LSAP_MASK;
110 * Check if this is an incoming connection, since we must deal with
111 * it in a different way than other established connections.
113 if ((fp[0] & CONTROL_BIT) && (fp[2] == CONNECT_CMD)) {
114 pr_debug("%s(), incoming connection, source LSAP=%d, dest LSAP=%d\n",
115 __func__, slsap_sel, dlsap_sel);
117 /* Try to find LSAP among the unconnected LSAPs */
118 lsap = irlmp_find_lsap(self, dlsap_sel, slsap_sel, CONNECT_CMD,
119 irlmp->unconnected_lsaps);
121 /* Maybe LSAP was already connected, so try one more time */
123 pr_debug("%s(), incoming connection for LSAP already connected\n",
125 lsap = irlmp_find_lsap(self, dlsap_sel, slsap_sel, 0,
129 lsap = irlmp_find_lsap(self, dlsap_sel, slsap_sel, 0,
133 pr_debug("IrLMP, Sorry, no LSAP for received frame!\n");
134 pr_debug("%s(), slsap_sel = %02x, dlsap_sel = %02x\n",
135 __func__, slsap_sel, dlsap_sel);
136 if (fp[0] & CONTROL_BIT) {
137 pr_debug("%s(), received control frame %02x\n",
140 pr_debug("%s(), received data frame\n", __func__);
146 * Check if we received a control frame?
148 if (fp[0] & CONTROL_BIT) {
152 irlmp_do_lsap_event(lsap, LM_CONNECT_INDICATION, skb);
155 irlmp_do_lsap_event(lsap, LM_CONNECT_CONFIRM, skb);
158 pr_debug("%s(), Disconnect indication!\n",
160 irlmp_do_lsap_event(lsap, LM_DISCONNECT_INDICATION,
164 pr_debug("Access mode cmd not implemented!\n");
167 pr_debug("Access mode cnf not implemented!\n");
170 pr_debug("%s(), Unknown control frame %02x\n",
174 } else if (unreliable) {
175 /* Optimize and bypass the state machine if possible */
176 if (lsap->lsap_state == LSAP_DATA_TRANSFER_READY)
177 irlmp_udata_indication(lsap, skb);
179 irlmp_do_lsap_event(lsap, LM_UDATA_INDICATION, skb);
181 /* Optimize and bypass the state machine if possible */
182 if (lsap->lsap_state == LSAP_DATA_TRANSFER_READY)
183 irlmp_data_indication(lsap, skb);
185 irlmp_do_lsap_event(lsap, LM_DATA_INDICATION, skb);
190 * Function irlmp_link_unitdata_indication (self, skb)
195 #ifdef CONFIG_IRDA_ULTRA
196 void irlmp_link_unitdata_indication(struct lap_cb *self, struct sk_buff *skb)
198 struct lsap_cb *lsap;
199 __u8 slsap_sel; /* Source (this) LSAP address */
200 __u8 dlsap_sel; /* Destination LSAP address */
201 __u8 pid; /* Protocol identifier */
205 IRDA_ASSERT(self != NULL, return;);
206 IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
207 IRDA_ASSERT(skb->len > 2, return;);
212 * The next statements may be confusing, but we do this so that
213 * destination LSAP of received frame is source LSAP in our view
215 slsap_sel = fp[0] & LSAP_MASK;
220 pr_debug("%s(), extension in PID not supp!\n",
225 /* Check if frame is addressed to the connectionless LSAP */
226 if ((slsap_sel != LSAP_CONNLESS) || (dlsap_sel != LSAP_CONNLESS)) {
227 pr_debug("%s(), dropping frame!\n", __func__);
231 /* Search the connectionless LSAP */
232 spin_lock_irqsave(&irlmp->unconnected_lsaps->hb_spinlock, flags);
233 lsap = (struct lsap_cb *) hashbin_get_first(irlmp->unconnected_lsaps);
234 while (lsap != NULL) {
236 * Check if source LSAP and dest LSAP selectors and PID match.
238 if ((lsap->slsap_sel == slsap_sel) &&
239 (lsap->dlsap_sel == dlsap_sel) &&
244 lsap = (struct lsap_cb *) hashbin_get_next(irlmp->unconnected_lsaps);
246 spin_unlock_irqrestore(&irlmp->unconnected_lsaps->hb_spinlock, flags);
249 irlmp_connless_data_indication(lsap, skb);
251 pr_debug("%s(), found no matching LSAP!\n", __func__);
254 #endif /* CONFIG_IRDA_ULTRA */
257 * Function irlmp_link_disconnect_indication (reason, userdata)
259 * IrLAP has disconnected
262 void irlmp_link_disconnect_indication(struct lap_cb *lap,
263 struct irlap_cb *irlap,
267 IRDA_ASSERT(lap != NULL, return;);
268 IRDA_ASSERT(lap->magic == LMP_LAP_MAGIC, return;);
270 lap->reason = reason;
271 lap->daddr = DEV_ADDR_ANY;
273 /* FIXME: must do something with the skb if any */
276 * Inform station state machine
278 irlmp_do_lap_event(lap, LM_LAP_DISCONNECT_INDICATION, NULL);
282 * Function irlmp_link_connect_indication (qos)
284 * Incoming LAP connection!
287 void irlmp_link_connect_indication(struct lap_cb *self, __u32 saddr,
288 __u32 daddr, struct qos_info *qos,
291 /* Copy QoS settings for this session */
294 /* Update destination device address */
296 IRDA_ASSERT(self->saddr == saddr, return;);
298 irlmp_do_lap_event(self, LM_LAP_CONNECT_INDICATION, skb);
302 * Function irlmp_link_connect_confirm (qos)
304 * LAP connection confirmed!
307 void irlmp_link_connect_confirm(struct lap_cb *self, struct qos_info *qos,
310 IRDA_ASSERT(self != NULL, return;);
311 IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
312 IRDA_ASSERT(qos != NULL, return;);
314 /* Don't need use the skb for now */
316 /* Copy QoS settings for this session */
319 irlmp_do_lap_event(self, LM_LAP_CONNECT_CONFIRM, NULL);
323 * Function irlmp_link_discovery_indication (self, log)
325 * Device is discovering us
327 * It's not an answer to our own discoveries, just another device trying
328 * to perform discovery, but we don't want to miss the opportunity
329 * to exploit this information, because :
330 * o We may not actively perform discovery (just passive discovery)
331 * o This type of discovery is much more reliable. In some cases, it
332 * seem that less than 50% of our discoveries get an answer, while
333 * we always get ~100% of these.
334 * o Make faster discovery, statistically divide time of discovery
335 * events by 2 (important for the latency aspect and user feel)
336 * o Even is we do active discovery, the other node might not
337 * answer our discoveries (ex: Palm). The Palm will just perform
338 * one active discovery and connect directly to us.
340 * However, when both devices discover each other, they might attempt to
341 * connect to each other following the discovery event, and it would create
342 * collisions on the medium (SNRM battle).
343 * The "fix" for that is to disable all connection requests in IrLAP
344 * for 100ms after a discovery indication by setting the media_busy flag.
345 * Previously, we used to postpone the event which was quite ugly. Now
346 * that IrLAP takes care of this problem, just pass the event up...
350 void irlmp_link_discovery_indication(struct lap_cb *self,
351 discovery_t *discovery)
353 IRDA_ASSERT(self != NULL, return;);
354 IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
356 /* Add to main log, cleanup */
357 irlmp_add_discovery(irlmp->cachelog, discovery);
359 /* Just handle it the same way as a discovery confirm,
360 * bypass the LM_LAP state machine (see below) */
361 irlmp_discovery_confirm(irlmp->cachelog, DISCOVERY_PASSIVE);
365 * Function irlmp_link_discovery_confirm (self, log)
367 * Called by IrLAP with a list of discoveries after the discovery
368 * request has been carried out. A NULL log is received if IrLAP
369 * was unable to carry out the discovery request
372 void irlmp_link_discovery_confirm(struct lap_cb *self, hashbin_t *log)
374 IRDA_ASSERT(self != NULL, return;);
375 IRDA_ASSERT(self->magic == LMP_LAP_MAGIC, return;);
377 /* Add to main log, cleanup */
378 irlmp_add_discovery_log(irlmp->cachelog, log);
380 /* Propagate event to various LSAPs registered for it.
381 * We bypass the LM_LAP state machine because
382 * 1) We do it regardless of the LM_LAP state
383 * 2) It doesn't affect the LM_LAP state
384 * 3) Faster, slimer, simpler, ...
386 irlmp_discovery_confirm(irlmp->cachelog, DISCOVERY_ACTIVE);
389 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
390 static inline void irlmp_update_cache(struct lap_cb *lap,
391 struct lsap_cb *lsap)
393 /* Prevent concurrent read to get garbage */
394 lap->cache.valid = FALSE;
395 /* Update cache entry */
396 lap->cache.dlsap_sel = lsap->dlsap_sel;
397 lap->cache.slsap_sel = lsap->slsap_sel;
398 lap->cache.lsap = lsap;
399 lap->cache.valid = TRUE;
404 * Function irlmp_find_handle (self, dlsap_sel, slsap_sel, status, queue)
406 * Find handle associated with destination and source LSAP
408 * Any IrDA connection (LSAP/TSAP) is uniquely identified by
409 * 3 parameters, the local lsap, the remote lsap and the remote address.
410 * We may initiate multiple connections to the same remote service
411 * (they will have different local lsap), a remote device may initiate
412 * multiple connections to the same local service (they will have
413 * different remote lsap), or multiple devices may connect to the same
414 * service and may use the same remote lsap (and they will have
415 * different remote address).
416 * So, where is the remote address ? Each LAP connection is made with
417 * a single remote device, so imply a specific remote address.
420 static struct lsap_cb *irlmp_find_lsap(struct lap_cb *self, __u8 dlsap_sel,
421 __u8 slsap_sel, int status,
424 struct lsap_cb *lsap;
428 * Optimize for the common case. We assume that the last frame
429 * received is in the same connection as the last one, so check in
430 * cache first to avoid the linear search
432 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
433 if ((self->cache.valid) &&
434 (self->cache.slsap_sel == slsap_sel) &&
435 (self->cache.dlsap_sel == dlsap_sel))
437 return self->cache.lsap;
441 spin_lock_irqsave(&queue->hb_spinlock, flags);
443 lsap = (struct lsap_cb *) hashbin_get_first(queue);
444 while (lsap != NULL) {
446 * If this is an incoming connection, then the destination
447 * LSAP selector may have been specified as LM_ANY so that
448 * any client can connect. In that case we only need to check
449 * if the source LSAP (in our view!) match!
451 if ((status == CONNECT_CMD) &&
452 (lsap->slsap_sel == slsap_sel) &&
453 (lsap->dlsap_sel == LSAP_ANY)) {
454 /* This is where the dest lsap sel is set on incoming
456 lsap->dlsap_sel = dlsap_sel;
460 * Check if source LSAP and dest LSAP selectors match.
462 if ((lsap->slsap_sel == slsap_sel) &&
463 (lsap->dlsap_sel == dlsap_sel))
466 lsap = (struct lsap_cb *) hashbin_get_next(queue);
468 #ifdef CONFIG_IRDA_CACHE_LAST_LSAP
470 irlmp_update_cache(self, lsap);
472 spin_unlock_irqrestore(&queue->hb_spinlock, flags);
474 /* Return what we've found or NULL */