|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1980, 1986 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution is only permitted until one year after the first shipment ! 6: * of 4.4BSD by the Regents. Otherwise, redistribution and use in source and ! 7: * binary forms are permitted provided that: (1) source distributions retain ! 8: * this entire copyright notice and comment, and (2) distributions including ! 9: * binaries display the following acknowledgement: This product includes ! 10: * software developed by the University of California, Berkeley and its ! 11: * contributors'' in the documentation or other materials provided with the ! 12: * distribution and in all advertising materials mentioning features or use ! 13: * of this software. Neither the name of the University nor the names of ! 14: * its contributors may be used to endorse or promote products derived from ! 15: * this software without specific prior written permission. ! 16: * THIS SOFTWARE IS PROVIDED AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 17: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 18: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 19: * ! 20: * @(#)raw_cb.h 7.6 (Berkeley) 6/28/90 ! 21: */ ! 22: ! 23: /* ! 24: * Raw protocol interface control block. Used ! 25: * to tie a socket to the generic raw interface. ! 26: */ ! 27: struct rawcb { ! 28: struct rawcb *rcb_next; /* doubly linked list */ ! 29: struct rawcb *rcb_prev; ! 30: struct socket *rcb_socket; /* back pointer to socket */ ! 31: struct sockaddr *rcb_faddr; /* destination address */ ! 32: struct sockaddr *rcb_laddr; /* socket's address */ ! 33: struct sockproto rcb_proto; /* protocol family, protocol */ ! 34: }; ! 35: ! 36: #define sotorawcb(so) ((struct rawcb *)(so)->so_pcb) ! 37: ! 38: /* ! 39: * Nominal space allocated to a raw socket. ! 40: */ ! 41: #define RAWSNDQ 8192 ! 42: #define RAWRCVQ 8192 ! 43: ! 44: #ifdef KERNEL ! 45: struct rawcb rawcb; /* head of list */ ! 46: #endif
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.