/********************************************************************* * * Filename: discovery.h * Version: * Description: * Status: Experimental. * Author: Dag Brattli * Created at: Tue Apr 6 16:53:53 1999 * Modified at: Tue Oct 5 10:05:10 1999 * Modified by: Dag Brattli * * Copyright (c) 1999 Dag Brattli, All Rights Reserved. * Copyright (c) 2000-2002 Jean Tourrilhes * * This program is free software; you can redistribute it and/or * modify it under the terms of the GNU General Public License as * published by the Free Software Foundation; either version 2 of * the License, or (at your option) any later version. * * This program is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with this program; if not, see . * ********************************************************************/ #ifndef DISCOVERY_H #define DISCOVERY_H #include #include #include /* irda_queue_t */ #include /* LAP_REASON */ #define DISCOVERY_EXPIRE_TIMEOUT (2*sysctl_discovery_timeout*HZ) #define DISCOVERY_DEFAULT_SLOTS 0 /* * This type is used by the protocols that transmit 16 bits words in * little endian format. A little endian machine stores MSB of word in * byte[1] and LSB in byte[0]. A big endian machine stores MSB in byte[0] * and LSB in byte[1]. * * This structure is used in the code for things that are endian neutral * but that fit in a word so that we can manipulate them efficiently. * By endian neutral, I mean things that are really an array of bytes, * and always used as such, for example the hint bits. Jean II */ typedef union { __u16 word; __u8 byte[2]; } __u16_host_order; /* Types of discovery */ typedef enum { DISCOVERY_LOG, /* What's in our discovery log */ DISCOVERY_ACTIVE, /* Doing our own discovery on the medium */ DISCOVERY_PASSIVE, /* Peer doing discovery on the medium */ EXPIRY_TIMEOUT, /* Entry expired due to timeout */ } DISCOVERY_MODE; #define NICKNAME_MAX_LEN 21 /* Basic discovery information about a peer */ typedef struct irda_device_info discinfo_t; /* linux/irda.h */ /* * The DISCOVERY structure is used for both discovery requests and responses */ typedef struct discovery_t { irda_queue_t q; /* Must be first! */ discinfo_t data; /* Basic discovery information */ int name_len; /* Length of nickname */ LAP_REASON condition; /* More info about the discovery */ int gen_addr_bit; /* Need to generate a new device * address? */ int nslots; /* Number of slots to use when * discovering */ unsigned long timestamp; /* Last time discovered */ unsigned long firststamp; /* First time discovered */ } discovery_t; void irlmp_add_discovery(hashbin_t *cachelog, discovery_t *discovery); void irlmp_add_discovery_log(hashbin_t *cachelog, hashbin_t *log); void irlmp_expire_discoveries(hashbin_t *log, __u32 saddr, int force); struct irda_device_info *irlmp_copy_discoveries(hashbin_t *log, int *pn, __u16 mask, int old_entries); #endif ptions
context:
space:
mode:
authorDavid S. Miller <davem@davemloft.net>2017-01-30 14:28:22 -0800
committerDavid S. Miller <davem@davemloft.net>2017-01-30 14:28:22 -0800
commit54791b276b4000b307339f269d3bf7db877d536f (patch)
tree1c2616bd373ce5ea28aac2a53e32f5b5834901ce /include/net/dst_ops.h
parent5d0e7705774dd412a465896d08d59a81a345c1e4 (diff)
parent047487241ff59374fded8c477f21453681f5995c (diff)
Merge branch 'sparc64-non-resumable-user-error-recovery'
Liam R. Howlett says: ==================== sparc64: Recover from userspace non-resumable PIO & MEM errors A non-resumable error from userspace is able to cause a kernel panic or trap loop due to the setup and handling of the queued traps once in the kernel. This patch series addresses both of these issues. The queues are fixed by simply zeroing the memory before use. PIO errors from userspace will result in a SIGBUS being sent to the user process. The MEM errors form userspace will result in a SIGKILL and also cause the offending pages to be claimed so they are no longer used in future tasks. SIGKILL is used to ensure that the process does not try to coredump and result in an attempt to read the memory again from within kernel space. Although there is a HV call to scrub the memory (mem_scrub), there is no easy way to guarantee that the real memory address(es) are not used by other tasks. Clearing the error with mem_scrub would zero the memory and cause the other processes to proceed with bad data. The handling of other non-resumable errors remain unchanged and will cause a panic. ==================== Signed-off-by: David S. Miller <davem@davemloft.net>
Diffstat (limited to 'include/net/dst_ops.h')