1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
|
/* $OpenBSD: if_qe.c,v 1.8 1997/05/29 00:04:32 niklas Exp $ */
/* $NetBSD: if_qe.c,v 1.18 1996/10/13 03:34:55 christos Exp $ */
/*
* Copyright (c) 1988 Regents of the University of California.
* All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Digital Equipment Corp.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* @(#)if_qe.c 7.20 (Berkeley) 3/28/91
*/
/* from @(#)if_qe.c 1.15 (ULTRIX) 4/16/86 */
/****************************************************************
* *
* Licensed from Digital Equipment Corporation *
* Copyright (c) *
* Digital Equipment Corporation *
* Maynard, Massachusetts *
* 1985, 1986 *
* All rights reserved. *
* *
* The Information in this software is subject to change *
* without notice and should not be construed as a commitment *
* by Digital Equipment Corporation. Digital makes no *
* representations about the suitability of this software for *
* any purpose. It is supplied "As Is" without expressed or *
* implied warranty. *
* *
* If the Regents of the University of California or its *
* licensees modify the software in a manner creating *
* derivative copyright rights, appropriate copyright *
* legends may be placed on the derivative work in addition *
* to that set forth above. *
* *
****************************************************************/
/* ---------------------------------------------------------------------
* Modification History
*
* 15-Apr-86 -- afd
* Rename "unused_multi" to "qunused_multi" for extending Generic
* kernel to MicroVAXen.
*
* 18-mar-86 -- jaw br/cvec changed to NOT use registers.
*
* 12 March 86 -- Jeff Chase
* Modified to handle the new MCLGET macro
* Changed if_qe_data.c to use more receive buffers
* Added a flag to poke with adb to log qe_restarts on console
*
* 19 Oct 85 -- rjl
* Changed the watch dog timer from 30 seconds to 3. VMS is using
* less than 1 second in their's. Also turned the printf into an
* mprintf.
*
* 09/16/85 -- Larry Cohen
* Add 43bsd alpha tape changes for subnet routing
*
* 1 Aug 85 -- rjl
* Panic on a non-existent memory interrupt and the case where a packet
* was chained. The first should never happen because non-existant
* memory interrupts cause a bus reset. The second should never happen
* because we hang 2k input buffers on the device.
*
* 1 Aug 85 -- rich
* Fixed the broadcast loopback code to handle Clusters without
* wedging the system.
*
* 27 Feb. 85 -- ejf
* Return default hardware address on ioctl request.
*
* 12 Feb. 85 -- ejf
* Added internal extended loopback capability.
*
* 27 Dec. 84 -- rjl
* Fixed bug that caused every other transmit descriptor to be used
* instead of every descriptor.
*
* 21 Dec. 84 -- rjl
* Added watchdog timer to mask hardware bug that causes device lockup.
*
* 18 Dec. 84 -- rjl
* Reworked driver to use q-bus mapping routines. MicroVAX-I now does
* copying instead of m-buf shuffleing.
* A number of deficencies in the hardware/firmware were compensated
* for. See comments in qestart and qerint.
*
* 14 Nov. 84 -- jf
* Added usage counts for multicast addresses.
* Updated general protocol support to allow access to the Ethernet
* header.
*
* 04 Oct. 84 -- jf
* Added support for new ioctls to add and delete multicast addresses
* and set the physical address.
* Add support for general protocols.
*
* 14 Aug. 84 -- rjl
* Integrated Shannon changes. (allow arp above 1024 and ? )
*
* 13 Feb. 84 -- rjl
*
* Initial version of driver. derived from IL driver.
*
* ---------------------------------------------------------------------
*/
/*
* Digital Q-BUS to NI Adapter
*/
#include <sys/param.h>
#include <sys/systm.h>
#include <sys/mbuf.h>
#include <sys/buf.h>
#include <sys/protosw.h>
#include <sys/socket.h>
#include <sys/ioctl.h>
#include <sys/errno.h>
#include <sys/syslog.h>
#include <sys/device.h>
#include <sys/time.h>
#include <sys/kernel.h>
#include <net/if.h>
#include <net/netisr.h>
#include <net/route.h>
#ifdef INET
#include <netinet/in.h>
#include <netinet/in_systm.h>
#include <netinet/in_var.h>
#include <netinet/ip.h>
#include <netinet/if_ether.h>
#endif
#ifdef NS
#include <netns/ns.h>
#include <netns/ns_if.h>
#endif
#ifdef ISO
#include <netiso/iso.h>
#include <netiso/iso_var.h>
extern char all_es_snpa[], all_is_snpa[], all_l1is_snpa[], all_l2is_snpa[];
#endif
#include <machine/pte.h>
#include <machine/cpu.h>
#include <machine/mtpr.h>
#include <vax/if/if_qereg.h>
#include <vax/if/if_uba.h>
#include <vax/uba/ubareg.h>
#include <vax/uba/ubavar.h>
#define NRCV 15 /* Receive descriptors */
#define NXMT 5 /* Transmit descriptors */
#define NTOT (NXMT + NRCV)
#define QETIMEOUT 2 /* transmit timeout, must be > 1 */
#define QESLOWTIMEOUT 40 /* timeout when no xmits in progress */
#define MINDATA 60
/*
* Ethernet software status per interface.
*
* Each interface is referenced by a network interface structure,
* qe_if, which the routing code uses to locate the interface.
* This structure contains the output queue for the interface, its address, ...
*/
struct qe_softc {
struct device qe_dev; /* Configuration common part */
struct arpcom qe_ac; /* Ethernet common part */
#define qe_if qe_ac.ac_if /* network-visible interface */
#define qe_addr qe_ac.ac_enaddr /* hardware Ethernet address */
struct ifubinfo qe_uba; /* Q-bus resources */
struct ifrw qe_ifr[NRCV]; /* for receive buffers; */
struct ifxmt qe_ifw[NXMT]; /* for xmit buffers; */
struct qedevice *qe_vaddr;
int qe_flags; /* software state */
#define QEF_RUNNING 0x01
#define QEF_SETADDR 0x02
#define QEF_FASTTIMEO 0x04
int setupaddr; /* mapping info for setup pkts */
int ipl; /* interrupt priority */
struct qe_ring *rringaddr; /* mapping info for rings */
struct qe_ring *tringaddr; /* "" */
struct qe_ring rring[NRCV+1]; /* Receive ring descriptors */
struct qe_ring tring[NXMT+1]; /* Xmit ring descriptors */
u_char setup_pkt[16][8]; /* Setup packet */
int rindex; /* Receive index */
int tindex; /* Transmit index */
int otindex; /* Old transmit index */
int qe_intvec; /* Interrupt vector */
struct qedevice *addr; /* device addr */
int setupqueued; /* setup packet queued */
int nxmit; /* Transmits in progress */
int qe_restarts; /* timeouts */
};
int qematch __P((struct device *, void *, void *));
void qeattach __P((struct device *, struct device *, void *));
void qereset __P((int));
void qeinit __P((struct qe_softc *));
void qestart __P((struct ifnet *));
void qeintr __P((int));
void qetint __P((int));
void qerint __P((int));
int qeioctl __P((struct ifnet *, u_long, caddr_t));
void qe_setaddr __P((u_char *, struct qe_softc *));
void qeinitdesc __P((struct qe_ring *, caddr_t, int));
void qesetup __P((struct qe_softc *));
void qeread __P((struct qe_softc *, struct ifrw *, int));
void qetimeout __P((struct ifnet *));
void qerestart __P((struct qe_softc *));
struct cfdriver qe_cd = {
NULL, "qe", DV_IFNET
};
struct cfattach qe_ca = {
sizeof(struct qe_softc), qematch, qeattach
};
#define QEUNIT(x) minor(x)
/*
* The deqna shouldn't receive more than ETHERMTU + sizeof(struct ether_header)
* but will actually take in up to 2048 bytes. To guard against the receiver
* chaining buffers (which we aren't prepared to handle) we allocate 2kb
* size buffers.
*/
#define MAXPACKETSIZE 2048 /* Should really be ETHERMTU */
/*
* Probe the QNA to see if it's there
*/
int
qematch(parent, match, aux)
struct device *parent;
void *match, *aux;
{
struct qe_softc *sc = match;
struct uba_attach_args *ua = aux;
struct uba_softc *ubasc = (struct uba_softc *)parent;
struct qe_ring *rp;
struct qe_ring *prp; /* physical rp */
volatile struct qedevice *addr = (struct qedevice *)ua->ua_addr;
int i;
/*
* The QNA interrupts on i/o operations. To do an I/O operation
* we have to setup the interface by transmitting a setup packet.
*/
addr->qe_csr = QE_RESET;
addr->qe_csr &= ~QE_RESET;
addr->qe_vector = (ubasc->uh_lastiv -= 4);
/*
* Map the communications area and the setup packet.
*/
sc->setupaddr =
uballoc(ubasc, (caddr_t)sc->setup_pkt, sizeof(sc->setup_pkt), 0);
sc->rringaddr = (struct qe_ring *) uballoc(ubasc, (caddr_t)sc->rring,
sizeof(struct qe_ring) * (NTOT+2), 0);
prp = (struct qe_ring *)UBAI_ADDR((int)sc->rringaddr);
/*
* The QNA will loop the setup packet back to the receive ring
* for verification, therefore we initialize the first
* receive & transmit ring descriptors and link the setup packet
* to them.
*/
qeinitdesc(sc->tring, (caddr_t)UBAI_ADDR(sc->setupaddr),
sizeof(sc->setup_pkt));
qeinitdesc(sc->rring, (caddr_t)UBAI_ADDR(sc->setupaddr),
sizeof(sc->setup_pkt));
rp = (struct qe_ring *)sc->tring;
rp->qe_setup = 1;
rp->qe_eomsg = 1;
rp->qe_flag = rp->qe_status1 = QE_NOTYET;
rp->qe_valid = 1;
rp = (struct qe_ring *)sc->rring;
rp->qe_flag = rp->qe_status1 = QE_NOTYET;
rp->qe_valid = 1;
/*
* Get the addr off of the interface and place it into the setup
* packet. This code looks strange due to the fact that the address
* is placed in the setup packet in col. major order.
*/
for (i = 0; i < 6; i++)
sc->setup_pkt[i][1] = addr->qe_sta_addr[i];
qesetup(sc);
/*
* Start the interface and wait for the packet.
*/
addr->qe_csr = QE_INT_ENABLE | QE_XMIT_INT | QE_RCV_INT;
addr->qe_rcvlist_lo = (short)((int)prp);
addr->qe_rcvlist_hi = (short)((int)prp >> 16);
prp += NRCV+1;
addr->qe_xmtlist_lo = (short)((int)prp);
addr->qe_xmtlist_hi = (short)((int)prp >> 16);
DELAY(10000);
/*
* All done with the bus resources.
*/
ubarelse(ubasc, &sc->setupaddr);
ubarelse(ubasc, (int *)&sc->rringaddr);
sc->ipl = 0x15;
ua->ua_ivec = qeintr;
return 1;
}
/*
* Interface exists: make available by filling in network interface
* record. System will initialize the interface when it is ready
* to accept packets.
*/
void
qeattach(parent, self, aux)
struct device *parent, *self;
void *aux;
{
struct uba_attach_args *ua = aux;
struct qe_softc *sc = (struct qe_softc *)self;
struct ifnet *ifp = (struct ifnet *)&sc->qe_if;
struct qedevice *addr =(struct qedevice *)ua->ua_addr;
int i;
printf("\n");
sc->qe_vaddr = addr;
bcopy(sc->qe_dev.dv_xname, ifp->if_xname, IFNAMSIZ);
ifp->if_softc = sc;
/*
* The Deqna is cable of transmitting broadcasts, but
* doesn't listen to its own.
*/
ifp->if_flags = IFF_BROADCAST | IFF_SIMPLEX | IFF_NOTRAILERS;
/*
* Read the address from the prom and save it.
*/
for (i = 0; i < 6; i++)
sc->setup_pkt[i][1] = sc->qe_addr[i] =
addr->qe_sta_addr[i] & 0xff;
addr->qe_vector |= 1;
printf("qe%d: %s, hardware address %s\n", sc->qe_dev.dv_unit,
addr->qe_vector&01 ? "delqa":"deqna",
ether_sprintf(sc->qe_addr));
addr->qe_vector &= ~1;
/*
* Save the vector for initialization at reset time.
*/
sc->qe_intvec = addr->qe_vector;
ifp->if_start = qestart;
ifp->if_ioctl = qeioctl;
ifp->if_watchdog = qetimeout;
sc->qe_uba.iff_flags = UBA_CANTWAIT;
if_attach(ifp);
ether_ifattach(ifp);
}
/*
* Reset of interface after UNIBUS reset.
*/
void
qereset(unit)
int unit;
{
struct qe_softc *sc = qe_cd.cd_devs[unit];
printf(" %s", sc->qe_dev.dv_xname);
sc->qe_if.if_flags &= ~IFF_RUNNING;
qeinit(sc);
}
/*
* Initialization of interface.
*/
void
qeinit(sc)
struct qe_softc *sc;
{
struct qedevice *addr = sc->qe_vaddr;
struct uba_softc *ubasc = (void *)sc->qe_dev.dv_parent;
struct ifnet *ifp = (struct ifnet *)&sc->qe_if;
int i;
int s;
/* address not known */
if (ifp->if_addrlist.tqh_first == (struct ifaddr *)0)
return;
if (sc->qe_flags & QEF_RUNNING)
return;
if ((ifp->if_flags & IFF_RUNNING) == 0) {
/*
* map the communications area onto the device
*/
i = uballoc(ubasc, (caddr_t)sc->rring,
sizeof(struct qe_ring) * (NTOT+2), 0);
if (i == 0)
goto fail;
sc->rringaddr = (struct qe_ring *)UBAI_ADDR(i);
sc->tringaddr = sc->rringaddr + NRCV + 1;
i = uballoc(ubasc, (caddr_t)sc->setup_pkt,
sizeof(sc->setup_pkt), 0);
if (i == 0)
goto fail;
sc->setupaddr = UBAI_ADDR(i);
/*
* init buffers and maps
*/
if (if_ubaminit(&sc->qe_uba, (void *)sc->qe_dev.dv_parent,
sizeof (struct ether_header), (int)btoc(MAXPACKETSIZE),
sc->qe_ifr, NRCV, sc->qe_ifw, NXMT) == 0) {
fail:
printf("%s: can't allocate uba resources\n",
sc->qe_dev.dv_xname);
sc->qe_if.if_flags &= ~IFF_UP;
return;
}
}
/*
* Init the buffer descriptors and indexes for each of the lists and
* loop them back to form a ring.
*/
for (i = 0; i < NRCV; i++) {
qeinitdesc( &sc->rring[i],
(caddr_t)UBAI_ADDR(sc->qe_ifr[i].ifrw_info), MAXPACKETSIZE);
sc->rring[i].qe_flag = sc->rring[i].qe_status1 = QE_NOTYET;
sc->rring[i].qe_valid = 1;
}
qeinitdesc(&sc->rring[i], (caddr_t)NULL, 0);
sc->rring[i].qe_addr_lo = (short)((int)sc->rringaddr);
sc->rring[i].qe_addr_hi = (short)((int)sc->rringaddr >> 16);
sc->rring[i].qe_chain = 1;
sc->rring[i].qe_flag = sc->rring[i].qe_status1 = QE_NOTYET;
sc->rring[i].qe_valid = 1;
for( i = 0 ; i <= NXMT ; i++ )
qeinitdesc(&sc->tring[i], (caddr_t)NULL, 0);
i--;
sc->tring[i].qe_addr_lo = (short)((int)sc->tringaddr);
sc->tring[i].qe_addr_hi = (short)((int)sc->tringaddr >> 16);
sc->tring[i].qe_chain = 1;
sc->tring[i].qe_flag = sc->tring[i].qe_status1 = QE_NOTYET;
sc->tring[i].qe_valid = 1;
sc->nxmit = sc->otindex = sc->tindex = sc->rindex = 0;
/*
* Take the interface out of reset, program the vector,
* enable interrupts, and tell the world we are up.
*/
s = splnet();
addr->qe_vector = sc->qe_intvec;
sc->addr = addr;
addr->qe_csr = QE_RCV_ENABLE | QE_INT_ENABLE | QE_XMIT_INT |
QE_RCV_INT | QE_ILOOP;
addr->qe_rcvlist_lo = (short)((int)sc->rringaddr);
addr->qe_rcvlist_hi = (short)((int)sc->rringaddr >> 16);
ifp->if_flags |= IFF_UP | IFF_RUNNING;
sc->qe_flags |= QEF_RUNNING;
qesetup( sc );
qestart( ifp );
sc->qe_if.if_timer = QESLOWTIMEOUT; /* Start watchdog */
splx( s );
}
/*
* Start output on interface.
*
*/
void
qestart(ifp)
struct ifnet *ifp;
{
register struct qe_softc *sc = ifp->if_softc;
volatile struct qedevice *addr = sc->qe_vaddr;
register struct qe_ring *rp;
register index;
struct mbuf *m;
int buf_addr, len, s;
s = splnet();
/*
* The deqna doesn't look at anything but the valid bit
* to determine if it should transmit this packet. If you have
* a ring and fill it the device will loop indefinately on the
* packet and continue to flood the net with packets until you
* break the ring. For this reason we never queue more than n-1
* packets in the transmit ring.
*
* The microcoders should have obeyed their own defination of the
* flag and status words, but instead we have to compensate.
*/
for( index = sc->tindex;
sc->tring[index].qe_valid == 0 && sc->nxmit < (NXMT-1) ;
sc->tindex = index = ++index % NXMT){
rp = &sc->tring[index];
if( sc->setupqueued ) {
buf_addr = sc->setupaddr;
len = 128;
rp->qe_setup = 1;
sc->setupqueued = 0;
} else {
IF_DEQUEUE(&sc->qe_if.if_snd, m);
if (m == 0) {
splx(s);
return;
}
buf_addr = sc->qe_ifw[index].ifw_info;
len = if_ubaput(&sc->qe_uba, &sc->qe_ifw[index], m);
}
if( len < MINDATA )
len = MINDATA;
/*
* Does buffer end on odd byte ?
*/
if( len & 1 ) {
len++;
rp->qe_odd_end = 1;
}
rp->qe_buf_len = -(len/2);
buf_addr = UBAI_ADDR(buf_addr);
rp->qe_flag = rp->qe_status1 = QE_NOTYET;
rp->qe_addr_lo = (short)buf_addr;
rp->qe_addr_hi = (short)(buf_addr >> 16);
rp->qe_eomsg = 1;
rp->qe_flag = rp->qe_status1 = QE_NOTYET;
rp->qe_valid = 1;
if (sc->nxmit++ == 0) {
sc->qe_flags |= QEF_FASTTIMEO;
sc->qe_if.if_timer = QETIMEOUT;
}
/*
* See if the xmit list is invalid.
*/
if( addr->qe_csr & QE_XL_INVALID ) {
buf_addr = (int)(sc->tringaddr+index);
addr->qe_xmtlist_lo = (short)buf_addr;
addr->qe_xmtlist_hi = (short)(buf_addr >> 16);
}
}
splx(s);
return;
}
/*
* Ethernet interface interrupt processor
*/
void
qeintr(unit)
int unit;
{
register struct qe_softc *sc;
volatile struct qedevice *addr;
int buf_addr, csr;
sc = qe_cd.cd_devs[unit];
addr = sc->qe_vaddr;
splx(sc->ipl);
if (!(sc->qe_flags & QEF_FASTTIMEO))
sc->qe_if.if_timer = QESLOWTIMEOUT; /* Restart timer clock */
csr = addr->qe_csr;
addr->qe_csr = QE_RCV_ENABLE | QE_INT_ENABLE |
QE_XMIT_INT | QE_RCV_INT | QE_ILOOP;
if (csr & QE_RCV_INT)
qerint(unit);
if (csr & QE_XMIT_INT)
qetint(unit );
if (csr & QE_NEX_MEM_INT)
printf("qe%d: Nonexistent memory interrupt\n", unit);
if (addr->qe_csr & QE_RL_INVALID && sc->rring[sc->rindex].qe_status1 ==
QE_NOTYET) {
buf_addr = (int)&sc->rringaddr[sc->rindex];
addr->qe_rcvlist_lo = (short)buf_addr;
addr->qe_rcvlist_hi = (short)(buf_addr >> 16);
}
}
/*
* Ethernet interface transmit interrupt.
*/
void
qetint(unit)
int unit;
{
register struct qe_softc *sc = qe_cd.cd_devs[unit];
register struct qe_ring *rp;
register struct ifxmt *ifxp;
int status1, setupflag;
short len;
while (sc->otindex != sc->tindex && sc->tring[sc->otindex].qe_status1
!= QE_NOTYET && sc->nxmit > 0) {
/*
* Save the status words from the descriptor so that it can
* be released.
*/
rp = &sc->tring[sc->otindex];
status1 = rp->qe_status1;
setupflag = rp->qe_setup;
len = (-rp->qe_buf_len) * 2;
if( rp->qe_odd_end )
len++;
/*
* Init the buffer descriptor
*/
bzero((caddr_t)rp, sizeof(struct qe_ring));
if( --sc->nxmit == 0 ) {
sc->qe_flags &= ~QEF_FASTTIMEO;
sc->qe_if.if_timer = QESLOWTIMEOUT;
}
if( !setupflag ) {
/*
* Do some statistics.
*/
sc->qe_if.if_opackets++;
sc->qe_if.if_collisions += ( status1 & QE_CCNT ) >> 4;
if (status1 & QE_ERROR)
sc->qe_if.if_oerrors++;
ifxp = &sc->qe_ifw[sc->otindex];
if (ifxp->ifw_xtofree) {
m_freem(ifxp->ifw_xtofree);
ifxp->ifw_xtofree = 0;
}
}
sc->otindex = ++sc->otindex % NXMT;
}
qestart(&sc->qe_if);
}
/*
* Ethernet interface receiver interrupt.
* If can't determine length from type, then have to drop packet.
* Othewise decapsulate packet based on type and pass to type specific
* higher-level input routine.
*/
void
qerint(unit)
int unit;
{
register struct qe_softc *sc = qe_cd.cd_devs[unit];
register struct qe_ring *rp;
register int nrcv = 0;
int len, status1, status2;
int bufaddr;
/*
* Traverse the receive ring looking for packets to pass back.
* The search is complete when we find a descriptor not in use.
*
* As in the transmit case the deqna doesn't honor it's own protocols
* so there exists the possibility that the device can beat us around
* the ring. The proper way to guard against this is to insure that
* there is always at least one invalid descriptor. We chose instead
* to make the ring large enough to minimize the problem. With a ring
* size of 4 we haven't been able to see the problem. To be safe we
* doubled that to 8.
*
*/
while (sc->rring[sc->rindex].qe_status1 == QE_NOTYET && nrcv < NRCV) {
/*
* We got an interrupt but did not find an input packet
* where we expected one to be, probably because the ring
* was overrun.
* We search forward to find a valid packet and start
* processing from there. If no valid packet is found it
* means we processed all the packets during a previous
* interrupt and that the QE_RCV_INT bit was set while
* we were processing one of these earlier packets. In
* this case we can safely ignore the interrupt (by dropping
* through the code below).
*/
sc->rindex = (sc->rindex + 1) % NRCV;
nrcv++;
}
if (nrcv && nrcv < NRCV)
log(LOG_ERR, "qe%d: ring overrun, resync'd by skipping %d\n",
unit, nrcv);
for (; sc->rring[sc->rindex].qe_status1 != QE_NOTYET;
sc->rindex = ++sc->rindex % NRCV) {
rp = &sc->rring[sc->rindex];
status1 = rp->qe_status1;
status2 = rp->qe_status2;
bzero((caddr_t)rp, sizeof(struct qe_ring));
if( (status1 & QE_MASK) == QE_MASK )
panic("qe: chained packet");
len = ((status1 & QE_RBL_HI) | (status2 & QE_RBL_LO)) + 60;
sc->qe_if.if_ipackets++;
if (status1 & QE_ERROR) {
if ((status1 & QE_RUNT) == 0)
sc->qe_if.if_ierrors++;
} else {
/*
* We don't process setup packets.
*/
if (!(status1 & QE_ESETUP))
qeread(sc, &sc->qe_ifr[sc->rindex],
len - sizeof(struct ether_header));
}
/*
* Return the buffer to the ring
*/
bufaddr = (int)UBAI_ADDR(sc->qe_ifr[sc->rindex].ifrw_info);
rp->qe_buf_len = -((MAXPACKETSIZE)/2);
rp->qe_addr_lo = (short)bufaddr;
rp->qe_addr_hi = (short)((int)bufaddr >> 16);
rp->qe_flag = rp->qe_status1 = QE_NOTYET;
rp->qe_valid = 1;
}
}
/*
* Process an ioctl request.
*/
int
qeioctl(ifp, cmd, data)
register struct ifnet *ifp;
u_long cmd;
caddr_t data;
{
struct qe_softc *sc = ifp->if_softc;
struct ifaddr *ifa = (struct ifaddr *)data;
int s = splnet(), error = 0;
switch (cmd) {
case SIOCSIFADDR:
ifp->if_flags |= IFF_UP;
qeinit(sc);
switch(ifa->ifa_addr->sa_family) {
#ifdef INET
case AF_INET:
arp_ifinit(&sc->qe_ac, ifa);
break;
#endif
#ifdef NS
case AF_NS:
{
register struct ns_addr *ina = &(IA_SNS(ifa)->sns_addr);
if (ns_nullhost(*ina))
ina->x_host = *(union ns_host *)(sc->qe_addr);
else
qe_setaddr(ina->x_host.c_host, sc);
break;
}
#endif
}
break;
case SIOCSIFFLAGS:
if ((ifp->if_flags & IFF_UP) == 0 &&
sc->qe_flags & QEF_RUNNING) {
sc->qe_vaddr->qe_csr = QE_RESET;
sc->qe_flags &= ~QEF_RUNNING;
} else if ((ifp->if_flags & (IFF_UP|IFF_RUNNING)) ==
IFF_RUNNING && (sc->qe_flags & QEF_RUNNING) == 0)
qerestart(sc);
break;
default:
error = EINVAL;
}
splx(s);
return (error);
}
/*
* set ethernet address for unit
*/
void
qe_setaddr(physaddr, sc)
u_char *physaddr;
struct qe_softc *sc;
{
register int i;
for (i = 0; i < 6; i++)
sc->setup_pkt[i][1] = sc->qe_addr[i] = physaddr[i];
sc->qe_flags |= QEF_SETADDR;
if (sc->qe_if.if_flags & IFF_RUNNING)
qesetup(sc);
qeinit(sc);
}
/*
* Initialize a ring descriptor with mbuf allocation side effects
*/
void
qeinitdesc(rp, addr, len)
register struct qe_ring *rp;
caddr_t addr; /* mapped address */
int len;
{
/*
* clear the entire descriptor
*/
bzero((caddr_t)rp, sizeof(struct qe_ring));
if (len) {
rp->qe_buf_len = -(len/2);
rp->qe_addr_lo = (short)((int)addr);
rp->qe_addr_hi = (short)((int)addr >> 16);
}
}
/*
* Build a setup packet - the physical address will already be present
* in first column.
*/
void
qesetup(sc)
struct qe_softc *sc;
{
register i, j;
/*
* Copy the target address to the rest of the entries in this row.
*/
for (j = 0; j < 6; j++)
for (i = 2; i < 8; i++)
sc->setup_pkt[j][i] = sc->setup_pkt[j][1];
/*
* Duplicate the first half.
*/
bcopy((caddr_t)sc->setup_pkt[0], (caddr_t)sc->setup_pkt[8], 64);
/*
* Fill in the broadcast (and ISO multicast) address(es).
*/
for (i = 0; i < 6; i++) {
sc->setup_pkt[i][2] = 0xff;
#ifdef ISO
sc->setup_pkt[i][3] = all_es_snpa[i];
sc->setup_pkt[i][4] = all_is_snpa[i];
sc->setup_pkt[i][5] = all_l1is_snpa[i];
sc->setup_pkt[i][6] = all_l2is_snpa[i];
#endif
}
sc->setupqueued++;
}
/*
* Pass a packet to the higher levels.
* We deal with the trailer protocol here.
*/
void
qeread(sc, ifrw, len)
register struct qe_softc *sc;
struct ifrw *ifrw;
int len;
{
struct ether_header *eh;
struct mbuf *m;
/*
* Deal with trailer protocol: if type is INET trailer
* get true type from first 16-bit word past data.
* Remember that type was trailer by setting off.
*/
eh = (struct ether_header *)ifrw->ifrw_addr;
if (len == 0)
return;
/*
* Pull packet off interface. Off is nonzero if packet
* has trailing header; qeget will then force this header
* information to be at the front, but we still have to drop
* the type and length which are at the front of any trailer data.
*/
m = if_ubaget(&sc->qe_uba, ifrw, len, &sc->qe_if);
#ifdef notdef
if (m) {
*(((u_long *)m->m_data)+0),
*(((u_long *)m->m_data)+1),
*(((u_long *)m->m_data)+2),
*(((u_long *)m->m_data)+3)
); }
#endif
if (m)
ether_input((struct ifnet *)&sc->qe_if, eh, m);
}
/*
* Watchdog timeout routine. There is a condition in the hardware that
* causes the board to lock up under heavy load. This routine detects
* the hang up and restarts the device.
*/
void
qetimeout(ifp)
struct ifnet *ifp;
{
register struct qe_softc *sc = ifp->if_softc;
#ifdef notdef
log(LOG_ERR, "%s: transmit timeout, restarted %d\n",
sc->sc_dev.dv_xname, sc->qe_restarts++);
#endif
qerestart(sc);
}
/*
* Restart for board lockup problem.
*/
void
qerestart(sc)
struct qe_softc *sc;
{
register struct ifnet *ifp = (struct ifnet *)&sc->qe_if;
register struct qedevice *addr = sc->addr;
register struct qe_ring *rp;
register i;
addr->qe_csr = QE_RESET;
addr->qe_csr &= ~QE_RESET;
qesetup(sc);
for (i = 0, rp = sc->tring; i < NXMT; rp++, i++) {
rp->qe_flag = rp->qe_status1 = QE_NOTYET;
rp->qe_valid = 0;
}
sc->nxmit = sc->otindex = sc->tindex = sc->rindex = 0;
addr->qe_csr = QE_RCV_ENABLE | QE_INT_ENABLE | QE_XMIT_INT |
QE_RCV_INT | QE_ILOOP;
addr->qe_rcvlist_lo = (short)((int)sc->rringaddr);
addr->qe_rcvlist_hi = (short)((int)sc->rringaddr >> 16);
sc->qe_flags |= QEF_RUNNING;
qestart(ifp);
}
|