1/*- 2 * Copyright (c) 2001 Michael Smith 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 * 26 * $FreeBSD$ 27 */ 28 29/* 30 * CISS adapter driver datastructures 31 */ 32 33typedef STAILQ_HEAD(, ciss_request) cr_qhead_t; 34 35/************************************************************************ 36 * Tunable parameters 37 */ 38 39/* 40 * There is no guaranteed upper bound on the number of concurrent 41 * commands an adapter may claim to support. Cap it at a reasonable 42 * value. 43 */ 44#define CISS_MAX_REQUESTS 1024 45 46/* 47 * Maximum number of logical drives we support. 48 * If the controller does not indicate a maximum 49 * value. This is a compatibiliy value to support 50 * older ciss controllers (e.g. model 6i) 51 */ 52#define CISS_MAX_LOGICAL 16 53 54/* 55 * Maximum number of physical devices we support. 56 */ 57#define CISS_MAX_PHYSICAL 1024 58 59/* 60 * Interrupt reduction can be controlled by tuning the interrupt 61 * coalesce delay and count paramters. The delay (in microseconds) 62 * defers delivery of interrupts to increase the chance of there being 63 * more than one completed command ready when the interrupt is 64 * delivered. The count expedites the delivery of the interrupt when 65 * the given number of commands are ready. 66 * 67 * If the delay is set to 0, interrupts are delivered immediately. 68 */ 69#define CISS_INTERRUPT_COALESCE_DELAY 0 70#define CISS_INTERRUPT_COALESCE_COUNT 16 71 72/* 73 * Heartbeat routine timeout in seconds. Note that since event 74 * handling is performed on a callback basis, we don't need this to 75 * run very often. 76 */ 77#define CISS_HEARTBEAT_RATE 10 78 79/************************************************************************ 80 * Compatibility with older versions of FreeBSD 81 */ 82#if __FreeBSD_version < 440001 83#warning testing old-FreeBSD compat 84typedef struct proc d_thread_t; 85#endif 86 87/************************************************************************ 88 * Driver version. Only really significant to the ACU interface. 89 */ 90#define CISS_DRIVER_VERSION 20011201 91 92/************************************************************************ 93 * Driver data structures 94 */ 95 96/* 97 * Each command issued to the adapter is managed by a request 98 * structure. 99 */ 100struct ciss_request 101{ 102 STAILQ_ENTRY(ciss_request) cr_link; 103 int cr_onq; /* which queue we are on */ 104 105 struct ciss_softc *cr_sc; /* controller softc */ 106 void *cr_data; /* data buffer */ 107 u_int32_t cr_length; /* data length */ 108 bus_dmamap_t cr_datamap; /* DMA map for data */ 109 struct ciss_command *cr_cc; 110 uint32_t cr_ccphys; 111 int cr_tag; 112 int cr_flags; 113#define CISS_REQ_MAPPED (1<<0) /* data mapped */ 114#define CISS_REQ_SLEEP (1<<1) /* submitter sleeping */ 115#define CISS_REQ_POLL (1<<2) /* submitter polling */ 116#define CISS_REQ_DATAOUT (1<<3) /* data host->adapter */ 117#define CISS_REQ_DATAIN (1<<4) /* data adapter->host */ 118#define CISS_REQ_BUSY (1<<5) /* controller has req */ 119#define CISS_REQ_CCB (1<<6) /* data is ccb */ 120 121 void (* cr_complete)(struct ciss_request *); 122 void *cr_private; 123 int cr_sg_tag; 124#define CISS_SG_MAX ((CISS_SG_FETCH_MAX << 1) | 0x1) 125#define CISS_SG_1 ((CISS_SG_FETCH_1 << 1) | 0x01) 126#define CISS_SG_2 ((CISS_SG_FETCH_2 << 1) | 0x01) 127#define CISS_SG_4 ((CISS_SG_FETCH_4 << 1) | 0x01) 128#define CISS_SG_8 ((CISS_SG_FETCH_8 << 1) | 0x01) 129#define CISS_SG_16 ((CISS_SG_FETCH_16 << 1) | 0x01) 130#define CISS_SG_32 ((CISS_SG_FETCH_32 << 1) | 0x01) 131#define CISS_SG_NONE ((CISS_SG_FETCH_NONE << 1) | 0x01) 132}; 133 134/* 135 * The adapter command structure is defined with a zero-length 136 * scatter/gather list size. In practise, we want space for a 137 * scatter-gather list, and we also want to avoid having commands 138 * cross page boundaries. 139 * 140 * The size of the ciss_command is 52 bytes. 65 s/g elements are reserved 141 * to allow a max i/o size of 256k. This gives a total command size of 142 * 1120 bytes, including the 32 byte alignment padding. Modern controllers 143 * seem to saturate nicely at this value. 144 */ 145 146#define CISS_MAX_SG_ELEMENTS 65 147#define CISS_COMMAND_ALIGN 32 148#define CISS_COMMAND_SG_LENGTH (sizeof(struct ciss_sg_entry) * CISS_MAX_SG_ELEMENTS) 149#define CISS_COMMAND_ALLOC_SIZE (roundup2(sizeof(struct ciss_command) + CISS_COMMAND_SG_LENGTH, CISS_COMMAND_ALIGN)) 150 151/* 152 * Per-logical-drive data. 153 */ 154struct ciss_ldrive 155{ 156 union ciss_device_address cl_address; 157 union ciss_device_address *cl_controller; 158 int cl_status; 159#define CISS_LD_NONEXISTENT 0 160#define CISS_LD_ONLINE 1 161#define CISS_LD_OFFLINE 2 162 163 int cl_update; 164 165 struct ciss_bmic_id_ldrive *cl_ldrive; 166 struct ciss_bmic_id_lstatus *cl_lstatus; 167 struct ciss_ldrive_geometry cl_geometry; 168 169 char cl_name[16]; /* device name */ 170}; 171 172/* 173 * Per-physical-drive data 174 */ 175struct ciss_pdrive 176{ 177 union ciss_device_address cp_address; 178 int cp_online; 179}; 180 181#define CISS_PHYSICAL_SHIFT 5 182#define CISS_PHYSICAL_BASE (1 << CISS_PHYSICAL_SHIFT) 183#define CISS_MAX_PHYSTGT 256 184 185#define CISS_IS_PHYSICAL(bus) (bus >= CISS_PHYSICAL_BASE) 186#define CISS_CAM_TO_PBUS(bus) (bus - CISS_PHYSICAL_BASE) 187 188/* 189 * Per-adapter data 190 */ 191struct ciss_softc 192{ 193 /* bus connections */ 194 device_t ciss_dev; /* bus attachment */ 195 struct cdev *ciss_dev_t; /* control device */ 196 197 struct resource *ciss_regs_resource; /* register interface window */ 198 int ciss_regs_rid; /* resource ID */ 199 bus_space_handle_t ciss_regs_bhandle; /* bus space handle */ 200 bus_space_tag_t ciss_regs_btag; /* bus space tag */ 201 202 struct resource *ciss_cfg_resource; /* config struct interface window */ 203 int ciss_cfg_rid; /* resource ID */ 204 struct ciss_config_table *ciss_cfg; /* config table in adapter memory */ 205 struct ciss_perf_config *ciss_perf; /* config table for the performant */ 206 struct ciss_bmic_id_table *ciss_id; /* ID table in host memory */ 207 u_int32_t ciss_heartbeat; /* last heartbeat value */ 208 int ciss_heart_attack; /* number of times we have seen this value */ 209 210 int ciss_msi; 211 struct resource *ciss_irq_resource; /* interrupt */ 212 int ciss_irq_rid[CISS_MSI_COUNT]; /* resource ID */ 213 void *ciss_intr; /* interrupt handle */ 214 215 bus_dma_tag_t ciss_parent_dmat; /* parent DMA tag */ 216 bus_dma_tag_t ciss_buffer_dmat; /* data buffer/command DMA tag */ 217 218 u_int32_t ciss_interrupt_mask; /* controller interrupt mask bits */ 219 220 uint64_t *ciss_reply; 221 int ciss_cycle; 222 int ciss_rqidx; 223 bus_dma_tag_t ciss_reply_dmat; 224 bus_dmamap_t ciss_reply_map; 225 uint32_t ciss_reply_phys; 226 227 int ciss_max_requests; 228 struct ciss_request ciss_request[CISS_MAX_REQUESTS]; /* requests */ 229 void *ciss_command; /* command structures */ 230 bus_dma_tag_t ciss_command_dmat; /* command DMA tag */ 231 bus_dmamap_t ciss_command_map; /* command DMA map */ 232 u_int32_t ciss_command_phys; /* command array base address */ 233 cr_qhead_t ciss_free; /* requests available for reuse */ 234 cr_qhead_t ciss_notify; /* requests which are defered for processing */ 235 struct proc *ciss_notify_thread; 236 237 struct callout ciss_periodic; /* periodic event handling */ 238 struct ciss_request *ciss_periodic_notify; /* notify callback request */ 239 240 struct mtx ciss_mtx; 241 struct ciss_ldrive **ciss_logical; 242 struct ciss_pdrive **ciss_physical; 243 union ciss_device_address *ciss_controllers; /* controller address */ 244 int ciss_max_bus_number; /* maximum bus number */ 245 int ciss_max_logical_bus; 246 int ciss_max_physical_bus; 247 248 struct cam_devq *ciss_cam_devq; 249 struct cam_sim **ciss_cam_sim; 250 251 int ciss_soft_reset; 252 253 int ciss_flags; 254#define CISS_FLAG_NOTIFY_OK (1<<0) /* notify command running OK */ 255#define CISS_FLAG_CONTROL_OPEN (1<<1) /* control device is open */ 256#define CISS_FLAG_ABORTING (1<<2) /* driver is going away */ 257#define CISS_FLAG_RUNNING (1<<3) /* driver is running (interrupts usable) */ 258#define CISS_FLAG_BUSY (1<<4) /* no free commands */ 259 260#define CISS_FLAG_FAKE_SYNCH (1<<16) /* needs SYNCHRONISE_CACHE faked */ 261#define CISS_FLAG_BMIC_ABORT (1<<17) /* use BMIC command to abort Notify on Event */ 262#define CISS_FLAG_THREAD_SHUT (1<<20) /* shutdown the kthread */ 263 264 struct ciss_qstat ciss_qstat[CISSQ_COUNT]; /* queue statistics */ 265}; 266 267/************************************************************************ 268 * Debugging/diagnostic output. 269 */ 270 271/* 272 * Debugging levels: 273 * 0 - quiet, only emit warnings 274 * 1 - talkative, log major events, but nothing on the I/O path 275 * 2 - noisy, log events on the I/O path 276 * 3 - extremely noisy, log items in loops 277 */ 278#ifdef CISS_DEBUG 279# define debug(level, fmt, args...) \ 280 do { \ 281 if (level <= CISS_DEBUG) printf("%s: " fmt "\n", __func__ , ##args); \ 282 } while(0) 283# define debug_called(level) \ 284 do { \ 285 if (level <= CISS_DEBUG) printf("%s: called\n", __func__); \ 286 } while(0) 287# define debug_struct(s) printf(" SIZE %s: %zu\n", #s, sizeof(struct s)) 288# define debug_union(s) printf(" SIZE %s: %zu\n", #s, sizeof(union s)) 289# define debug_type(s) printf(" SIZE %s: %zu\n", #s, sizeof(s)) 290# define debug_field(s, f) printf(" OFFSET %s.%s: %d\n", #s, #f, ((int)&(((struct s *)0)->f))) 291# define debug_const(c) printf(" CONST %s %jd/0x%jx\n", #c, (intmax_t)c, (intmax_t)c); 292#else 293# define debug(level, fmt, args...) 294# define debug_called(level) 295# define debug_struct(s) 296# define debug_union(s) 297# define debug_type(s) 298# define debug_field(s, f) 299# define debug_const(c) 300#endif 301 302#define ciss_printf(sc, fmt, args...) device_printf(sc->ciss_dev, fmt , ##args) 303 304/************************************************************************ 305 * Queue primitives 306 */ 307 308#define CISSQ_ADD(sc, qname) \ 309 do { \ 310 struct ciss_qstat *qs = &(sc)->ciss_qstat[qname]; \ 311 \ 312 qs->q_length++; \ 313 if (qs->q_length > qs->q_max) \ 314 qs->q_max = qs->q_length; \ 315 } while(0) 316 317#define CISSQ_REMOVE(sc, qname) (sc)->ciss_qstat[qname].q_length-- 318#define CISSQ_INIT(sc, qname) \ 319 do { \ 320 sc->ciss_qstat[qname].q_length = 0; \ 321 sc->ciss_qstat[qname].q_max = 0; \ 322 } while(0) 323 324 325#define CISSQ_REQUEST_QUEUE(name, index) \ 326static __inline void \ 327ciss_initq_ ## name (struct ciss_softc *sc) \ 328{ \ 329 STAILQ_INIT(&sc->ciss_ ## name); \ 330 CISSQ_INIT(sc, index); \ 331} \ 332static __inline void \ 333ciss_enqueue_ ## name (struct ciss_request *cr) \ 334{ \ 335 \ 336 STAILQ_INSERT_TAIL(&cr->cr_sc->ciss_ ## name, cr, cr_link); \ 337 CISSQ_ADD(cr->cr_sc, index); \ 338 cr->cr_onq = index; \ 339} \ 340static __inline void \ 341ciss_requeue_ ## name (struct ciss_request *cr) \ 342{ \ 343 \ 344 STAILQ_INSERT_HEAD(&cr->cr_sc->ciss_ ## name, cr, cr_link); \ 345 CISSQ_ADD(cr->cr_sc, index); \ 346 cr->cr_onq = index; \ 347} \ 348static __inline struct ciss_request * \ 349ciss_dequeue_ ## name (struct ciss_softc *sc) \ 350{ \ 351 struct ciss_request *cr; \ 352 \ 353 if ((cr = STAILQ_FIRST(&sc->ciss_ ## name)) != NULL) { \ 354 STAILQ_REMOVE_HEAD(&sc->ciss_ ## name, cr_link); \ 355 CISSQ_REMOVE(sc, index); \ 356 cr->cr_onq = -1; \ 357 } \ 358 return(cr); \ 359} \ 360struct hack 361 362CISSQ_REQUEST_QUEUE(free, CISSQ_FREE); 363CISSQ_REQUEST_QUEUE(notify, CISSQ_NOTIFY); 364 365static __inline void 366ciss_enqueue_complete(struct ciss_request *ac, cr_qhead_t *head) 367{ 368 369 STAILQ_INSERT_TAIL(head, ac, cr_link); 370} 371 372static __inline struct ciss_request * 373ciss_dequeue_complete(struct ciss_softc *sc, cr_qhead_t *head) 374{ 375 struct ciss_request *ac; 376 377 if ((ac = STAILQ_FIRST(head)) != NULL) 378 STAILQ_REMOVE_HEAD(head, cr_link); 379 return(ac); 380} 381 382/******************************************************************************** 383 * space-fill a character string 384 */ 385static __inline void 386padstr(char *targ, const char *src, int len) 387{ 388 while (len-- > 0) { 389 if (*src != 0) { 390 *targ++ = *src++; 391 } else { 392 *targ++ = ' '; 393 } 394 } 395} 396 397#define ciss_report_request(a, b, c) \ 398 _ciss_report_request(a, b, c, __FUNCTION__) 399