AK-san, PseudoCylon wrote: >> Thank you very much. >> However it still panics when I tried to use bridge. >> > > > Please try this. > http://gitorious.org/run/run/trees/master/dev/usb/wlan > (if_run.c and if_runvar.h have been updated.) > > Sorry I haven't test on bridge (only with nat). It did panic with bridge. This should work. But, please > #sysctl hw.usb.run.debug=1 > just in case. > Thanks a lot, works no problem so far here with bridge (no auth/hostapd/WPA2). rspro# uname -an FreeBSD rspro 9.0-CURRENT FreeBSD 9.0-CURRENT #64 r207140M: Mon May 3 21:49:50 ULAT 2010 tsgan_at_beastie:/usr/obj/mips/usr/mysrc/sys/RSPRO_AR71XX mips ... wlan0: STA 00:26:bb:17:f6:61 IEEE 802.11: associated New STA wlan0: STA 00:26:bb:17:f6:61 WPA: event 1 notification bsd_del_key: addr=00:26:bb:17:f6:61 key_idx=0 wlan0: STA 00:26:bb:17:f6:61 WPA: start authentication WPA: 00:26:bb:17:f6:61 WPA_PTK entering state INITIALIZE bsd_del_key: addr=00:26:bb:17:f6:61 key_idx=0 bsd_set_sta_authorized: addr=00:26:bb:17:f6:61 authorized=0 wlan0: STA 00:26:bb:17:f6:61 IEEE 802.1X: unauthorizing port WPA: 00:26:bb:17:f6:61 WPA_PTK_GROUP entering state IDLE WPA: 00:26:bb:17:f6:61 WPA_PTK entering state AUTHENTICATION WPA: 00:26:bb:17:f6:61 WPA_PTK entering state AUTHENTICATION2 WPA: 00:26:bb:17:f6:61 WPA_PTK entering state INITPSK WPA: 00:26:bb:17:f6:61 WPA_PTK entering state PTKSTART wlan0: STA 00:26:bb:17:f6:61 WPA: sending 1/4 msg of 4-Way Handshake WPA: Send EAPOL(version=2 secure=0 mic=0 ack=1 install=0 pairwise=8 kde_len=0 keyidx=0 encr=0) IEEE 802.1X: 121 bytes from 00:26:bb:17:f6:61 IEEE 802.1X: version=1 type=3 length=117 wlan0: STA 00:26:bb:17:f6:61 WPA: received EAPOL-Key frame (2/4 Pairwise) WPA: 00:26:bb:17:f6:61 WPA_PTK entering state PTKCALCNEGOTIATING WPA: PTK derivation - A1=00:22:cf:03:e0:30 A2=00:26:bb:17:f6:61 WPA: PMK - hexdump(len=32): [REMOVED] WPA: PTK - hexdump(len=64): [REMOVED] WPA: 00:26:bb:17:f6:61 WPA_PTK entering state PTKCALCNEGOTIATING2 WPA: 00:26:bb:17:f6:61 WPA_PTK entering state PTKINITNEGOTIATING bsd_get_seqnum: addr=00:00:00:00:00:00 idx=1 wlan0: STA 00:26:bb:17:f6:61 WPA: sending 3/4 msg of 4-Way Handshake WPA: Send EAPOL(version=2 secure=1 mic=1 ack=1 install=1 pairwise=8 kde_len=94 keyidx=1 encr=1) Plaintext EAPOL-Key Key Data - hexdump(len=104): [REMOVED] IEEE 802.1X: 99 bytes from 00:26:bb:17:f6:61 IEEE 802.1X: version=1 type=3 length=95 wlan0: STA 00:26:bb:17:f6:61 WPA: received EAPOL-Key frame (4/4 Pairwise) WPA: 00:26:bb:17:f6:61 WPA_PTK entering state PTKINITDONE bsd_set_key: alg=CCMP addr=00:26:bb:17:f6:61 key_idx=0 bsd_set_sta_authorized: addr=00:26:bb:17:f6:61 authorized=1 wlan0: STA 00:26:bb:17:f6:61 IEEE 802.1X: authorizing port wlan0: STA 00:26:bb:17:f6:61 RADIUS: starting accounting session 4BDEE104-00000000 bsd_sta_clear_stats: addr=00:26:bb:17:f6:61 wlan0: STA 00:26:bb:17:f6:61 WPA: pairwise key handshake completed (RSN) ... thanks a bunch again, Ganbold > Thanks. > AK > > > > -- Every Horse has an Infinite Number of Legs (proof by intimidation): Horses have an even number of legs. Behind they have two legs, and in front they have fore-legs. This makes six legs, which is certainly an odd number of legs for a horse. But the only number that is both even and odd is infinity. Therefore, horses have an infinite number of legs. Now to show this for the general case, suppose that somewhere, there is a horse that has a finite number of legs. But that is a horse of another color, and by the [above] lemma ["All horses are the same color"], that does not exist.Received on Mon May 03 2010 - 12:54:33 UTC
This archive was generated by hypermail 2.4.0 : Wed May 19 2021 - 11:40:03 UTC