diff options
author | Andrew Morton <akpm@osdl.org> | 2006-01-11 15:17:49 -0500 |
---|---|---|
committer | Linus Torvalds <torvalds@g5.osdl.org> | 2006-01-11 21:42:14 -0500 |
commit | 8d8706e2f86d28814c1b40a116ffdeca35e4c949 (patch) | |
tree | 146567d7a807feb37a5368fbb4a6ee76d9d7bc7e /drivers/char/rio/route.h | |
parent | a9415644583ef344e02f84faf5fe24bfadb2af8e (diff) |
[PATCH] lindent rio drivers
Run all rio files through indent -kr -i8 -bri0 -l255, as requested by Alan.
rioboot.c and rioinit.c were skipped due to worrisome lindent warnings.
Cc: Alan Cox <alan@lxorguk.ukuu.org.uk>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
Diffstat (limited to 'drivers/char/rio/route.h')
-rw-r--r-- | drivers/char/rio/route.h | 61 |
1 files changed, 30 insertions, 31 deletions
diff --git a/drivers/char/rio/route.h b/drivers/char/rio/route.h index c42dbb971718..769744e575ab 100644 --- a/drivers/char/rio/route.h +++ b/drivers/char/rio/route.h | |||
@@ -44,26 +44,26 @@ | |||
44 | #endif | 44 | #endif |
45 | 45 | ||
46 | #define MAX_LINKS 4 | 46 | #define MAX_LINKS 4 |
47 | #define MAX_NODES 17 /* Maximum nodes in a subnet */ | 47 | #define MAX_NODES 17 /* Maximum nodes in a subnet */ |
48 | #define NODE_BYTES ((MAX_NODES / 8) + 1) /* Number of bytes needed for | 48 | #define NODE_BYTES ((MAX_NODES / 8) + 1) /* Number of bytes needed for |
49 | 1 bit per node */ | 49 | 1 bit per node */ |
50 | #define ROUTE_DATA_SIZE (NODE_BYTES + 2) /* Number of bytes for complete | 50 | #define ROUTE_DATA_SIZE (NODE_BYTES + 2) /* Number of bytes for complete |
51 | info about cost etc. */ | 51 | info about cost etc. */ |
52 | #define ROUTES_PER_PACKET ((PKT_MAX_DATA_LEN -2)/ ROUTE_DATA_SIZE) | 52 | #define ROUTES_PER_PACKET ((PKT_MAX_DATA_LEN -2)/ ROUTE_DATA_SIZE) |
53 | /* Number of nodes we can squeeze | 53 | /* Number of nodes we can squeeze |
54 | into one packet */ | 54 | into one packet */ |
55 | #define MAX_TOPOLOGY_PACKETS (MAX_NODES / ROUTES_PER_PACKET + 1) | 55 | #define MAX_TOPOLOGY_PACKETS (MAX_NODES / ROUTES_PER_PACKET + 1) |
56 | /************************************************ | 56 | /************************************************ |
57 | * Define the types of command for the ROUTE RUP. | 57 | * Define the types of command for the ROUTE RUP. |
58 | ************************************************/ | 58 | ************************************************/ |
59 | #define ROUTE_REQUEST 0 /* Request an ID */ | 59 | #define ROUTE_REQUEST 0 /* Request an ID */ |
60 | #define ROUTE_FOAD 1 /* Kill the RTA */ | 60 | #define ROUTE_FOAD 1 /* Kill the RTA */ |
61 | #define ROUTE_ALREADY 2 /* ID given already */ | 61 | #define ROUTE_ALREADY 2 /* ID given already */ |
62 | #define ROUTE_USED 3 /* All ID's used */ | 62 | #define ROUTE_USED 3 /* All ID's used */ |
63 | #define ROUTE_ALLOCATE 4 /* Here it is */ | 63 | #define ROUTE_ALLOCATE 4 /* Here it is */ |
64 | #define ROUTE_REQ_TOP 5 /* I bet you didn't expect.... | 64 | #define ROUTE_REQ_TOP 5 /* I bet you didn't expect.... |
65 | the Topological Inquisition */ | 65 | the Topological Inquisition */ |
66 | #define ROUTE_TOPOLOGY 6 /* Topology request answered FD */ | 66 | #define ROUTE_TOPOLOGY 6 /* Topology request answered FD */ |
67 | /******************************************************************* | 67 | /******************************************************************* |
68 | * Define the Route Map Structure | 68 | * Define the Route Map Structure |
69 | * | 69 | * |
@@ -72,22 +72,22 @@ | |||
72 | ******************************************************************/ | 72 | ******************************************************************/ |
73 | typedef struct COST_ROUTE COST_ROUTE; | 73 | typedef struct COST_ROUTE COST_ROUTE; |
74 | struct COST_ROUTE { | 74 | struct COST_ROUTE { |
75 | unsigned char cost; /* Cost down this link */ | 75 | unsigned char cost; /* Cost down this link */ |
76 | unsigned char route[NODE_BYTES]; /* Nodes thorough this route */ | 76 | unsigned char route[NODE_BYTES]; /* Nodes thorough this route */ |
77 | } ; | 77 | }; |
78 | 78 | ||
79 | typedef struct ROUTE_STR ROUTE_STR ; | 79 | typedef struct ROUTE_STR ROUTE_STR; |
80 | struct ROUTE_STR { | 80 | struct ROUTE_STR { |
81 | COST_ROUTE cost_route[MAX_LINKS]; | 81 | COST_ROUTE cost_route[MAX_LINKS]; |
82 | /* cost / route for this link */ | 82 | /* cost / route for this link */ |
83 | ushort favoured; /* favoured link */ | 83 | ushort favoured; /* favoured link */ |
84 | } ; | 84 | }; |
85 | 85 | ||
86 | 86 | ||
87 | #define NO_LINK (short) 5 /* Link unattached */ | 87 | #define NO_LINK (short) 5 /* Link unattached */ |
88 | #define ROUTE_NO_ID (short) 100 /* No Id */ | 88 | #define ROUTE_NO_ID (short) 100 /* No Id */ |
89 | #define ROUTE_DISCONNECT (ushort) 0xff /* Not connected */ | 89 | #define ROUTE_DISCONNECT (ushort) 0xff /* Not connected */ |
90 | #define ROUTE_INTERCONNECT (ushort) 0x40 /* Sub-net interconnect */ | 90 | #define ROUTE_INTERCONNECT (ushort) 0x40 /* Sub-net interconnect */ |
91 | 91 | ||
92 | 92 | ||
93 | #define SYNC_RUP (ushort) 255 | 93 | #define SYNC_RUP (ushort) 255 |
@@ -99,10 +99,9 @@ struct ROUTE_STR { | |||
99 | #define STATUS_RUP (ushort) 249 | 99 | #define STATUS_RUP (ushort) 249 |
100 | #define POWER_RUP (ushort) 248 | 100 | #define POWER_RUP (ushort) 248 |
101 | 101 | ||
102 | #define HIGHEST_RUP (ushort) 255 /* Set to Top one */ | 102 | #define HIGHEST_RUP (ushort) 255 /* Set to Top one */ |
103 | #define LOWEST_RUP (ushort) 248 /* Set to bottom one */ | 103 | #define LOWEST_RUP (ushort) 248 /* Set to bottom one */ |
104 | 104 | ||
105 | #endif | 105 | #endif |
106 | 106 | ||
107 | /*********** end of file ***********/ | 107 | /*********** end of file ***********/ |
108 | |||