idm_impl.c revision c2b2c94b55bdcff203640921e4879b4b968d8183
/*
* CDDL HEADER START
*
* The contents of this file are subject to the terms of the
* Common Development and Distribution License (the "License").
* You may not use this file except in compliance with the License.
*
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE
* See the License for the specific language governing permissions
* and limitations under the License.
*
* When distributing Covered Code, include this CDDL HEADER in each
* file and include the License file at usr/src/OPENSOLARIS.LICENSE.
* If applicable, add the following below this CDDL HEADER, with the
* fields enclosed by brackets "[]" replaced with your own identifying
* information: Portions Copyright [yyyy] [name of copyright owner]
*
* CDDL HEADER END
*/
/*
*/
#include <sys/socketvar.h>
#include <sys/sysmacros.h>
#include <hd_crc.h>
extern idm_transport_t idm_transport_list[];
/*
* -1 - uninitialized
* 0 - applicable
* others - NA
*/
static int iscsi_crc32_hd = -1;
void
{
/*
* If we are in full-featured mode then route SCSI-related
* commands to the appropriate function vector
*/
/* Forwarded SCSI-related commands */
return;
}
}
/*
* If we get here with a SCSI-related PDU then we are not in
* full-feature mode and the PDU is a protocol error (SCSI command
* PDU's may sometimes be an exception, see below). All
* non-SCSI PDU's get treated them the same regardless of whether
* we are in full-feature mode.
*
* Look at the opcode and in some cases the PDU status and
* determine the appropriate event to send to the connection
* state machine. Generate the event, passing the PDU as data.
* If the current connection state allows reception of the event
* the PDU will be submitted to the IDM client for processing,
* otherwise the PDU will be dropped.
*/
switch (IDM_PDU_OPCODE(pdu)) {
case ISCSI_OP_LOGIN_CMD:
break;
case ISCSI_OP_LOGIN_RSP:
break;
case ISCSI_OP_LOGOUT_CMD:
break;
case ISCSI_OP_LOGOUT_RSP:
break;
case ISCSI_OP_ASYNC_EVENT:
switch (async_evt->async_event) {
break;
break;
break;
default:
break;
}
break;
case ISCSI_OP_SCSI_CMD:
/*
* Consider this scenario: We are a target connection
* in "in login" state and a "login success sent" event has
* been generated but not yet handled. Since we've sent
* the login response but we haven't actually transitioned
* to FFP mode we might conceivably receive a SCSI command
* from the initiator before we are ready. We are actually
* in FFP we just don't know it yet -- to address this we
* can generate an event corresponding to the SCSI command.
* At the point when the event is handled by the state
* machine the login request will have been handled and we
* should be in FFP. If we are not in FFP by that time
* we can reject the SCSI command with a protocol error.
*
* This scenario only applies to the target.
*
* Handle dtrace probe in iscsit so we can find all the
* pieces of the CDB
*/
break;
case ISCSI_OP_SCSI_DATA:
break;
break;
case ISCSI_OP_NOOP_OUT:
break;
case ISCSI_OP_TEXT_CMD:
break;
/* Initiator PDU's */
case ISCSI_OP_SCSI_DATA_RSP:
case ISCSI_OP_RTT_RSP:
case ISCSI_OP_SNACK_CMD:
case ISCSI_OP_NOOP_IN:
case ISCSI_OP_TEXT_RSP:
case ISCSI_OP_REJECT_MSG:
/* Validate received PDU against current state */
break;
}
}
void
{
}
{
/*
* If this is an FFP request, call the appropriate handler
* and return B_TRUE, otherwise return B_FALSE.
*/
switch (IDM_PDU_OPCODE(pdu)) {
case ISCSI_OP_SCSI_CMD:
return (B_TRUE);
case ISCSI_OP_SCSI_DATA:
return (B_TRUE);
return (B_TRUE);
case ISCSI_OP_NOOP_OUT:
return (B_TRUE);
case ISCSI_OP_TEXT_CMD:
return (B_TRUE);
/* Initiator only */
case ISCSI_OP_SCSI_RSP:
return (B_TRUE);
case ISCSI_OP_SCSI_DATA_RSP:
return (B_TRUE);
case ISCSI_OP_RTT_RSP:
return (B_TRUE);
case ISCSI_OP_TEXT_RSP:
case ISCSI_OP_NOOP_IN:
return (B_TRUE);
default:
return (B_FALSE);
}
/*NOTREACHED*/
}
void
{
/*
* Some PDU's specific to FFP get special handling. This function
* will normally never be called in FFP with an FFP PDU since this
* is a slow path but in can happen on the target side during
* the transition to FFP. We primarily call
* idm_pdu_rx_forward_ffp here to avoid code duplication.
*/
/*
* Non-FFP PDU, use generic RC handler
*/
}
}
void
{
} else {
}
} else {
}
if (rx) {
} else {
}
}
void
{
/*
* For a normal logout (close connection or close session) IDM
* will terminate processing of all tasks completing the tasks
* back to the client with a status indicating the connection
* was logged out. These tasks do not get completed.
*
* For a "close connection for recovery logout) IDM suspends
* processing of all tasks and completes them back to the client
* with a status indicating connection was logged out for
* recovery. Both initiator and target hang onto these tasks.
* When we add ERL2 support IDM will need to provide mechanisms
* to change the task and buffer associations to a new connection.
*
* This code doesn't address the possibility of MC/S. We'll
* need to decide how the separate connections get handled
* in that case. One simple option is to make the client
* generate the events for the other connections.
*/
if (reason == ISCSI_LOGOUT_REASON_CLOSE_SESSION) {
} else if ((reason == ISCSI_LOGOUT_REASON_CLOSE_CONNECTION) ||
(reason == ISCSI_LOGOUT_REASON_RECOVERY)) {
/* Check logout CID against this connection's CID */
/* Logout is for this connection */
} else {
/*
* Logout affects another connection. This is not
* a relevant event for this connection so we'll
* just treat it as a normal PDU event. Client
* will need to lookup the other connection and
* generate the event.
*/
}
} else {
/* Invalid reason code */
}
if (rx) {
} else {
}
}
void
{
} else {
}
if (rx) {
} else {
}
}
/*
* idm_svc_conn_create()
* Transport-agnostic service connection creation, invoked from the transport
* layer.
*/
{
idm_conn_t *ic;
/*
* Skip some work if we can already tell we are going offline.
* Otherwise we will destroy this connection later as part of
* shutting down the svc.
*/
return (IDM_STATUS_FAIL);
}
return (IDM_STATUS_FAIL);
}
/*
* Prepare connection state machine
*/
return (rc);
}
return (IDM_STATUS_SUCCESS);
}
void
{
}
}
/*
* idm_conn_create_common()
*
* Allocate and initialize IDM connection context
*/
{
idm_conn_t *ic;
break;
}
return (NULL);
/* Initialize data */
if (ic->ic_internal_cid == 0) {
return (NULL);
}
return (ic);
}
void
{
}
/*
* Invoked from the SM as a result of client's invocation of
* idm_ini_conn_connect()
*/
{
/* invoke transport-specific connection */
}
{
if (rc != IDM_STATUS_SUCCESS) {
return (IDM_STATUS_REJECT);
}
/* Target client is ready to receive a login, start connection */
}
{
/*
* Make sure all available transports are setup. We call this now
* instead of at initialization time in case IB has become available
* since we started (hotplug, etc).
*/
/* Determine the transport for this connection */
/* transport is not registered */
continue;
}
return (it);
}
}
ASSERT(0);
return (NULL); /* Make gcc happy */
}
void
{
int rc;
/*
* We may want to store the LDI handle in the idm_svc_t
* and then allow multiple calls to ldi_open_by_name. This
* would enable the LDI code to track who has the device open
* which could be useful in the case where we have multiple
* services and perhaps also have initiator and target opening
* the transport simultaneously. For now we stick with the
* plan.
*/
/* transport is not ready, try to initialize it */
} else {
/*
* iSCSI boot doesn't need iSER.
* Open iSER here may drive IO to
* a failed session and cause
* deadlock
*/
continue;
}
/*
* If the open is successful we will have
* filled in the LDI handle in the transport
* table and we expect that the transport
* registered itself.
*/
if (rc != 0) {
}
}
}
}
}
void
{
/* Caller holds the IDM global mutex */
/* If we have an open LDI handle on this driver, close it */
}
}
}
/*
* ID pool code. We use this to generate unique structure identifiers without
* searching the existing structures. This avoids the need to lock entire
* sets of structures at inopportune times. Adapted from the CIFS server code.
*
* A pool of IDs is a pool of 16 bit numbers. It is implemented as a bitmap.
* A bit set to '1' indicates that that particular value has been allocated.
* The allocation process is done shifting a bit through the whole bitmap.
* The current position of that index bit is kept in the idm_idpool_t
* structure and represented by a byte index (0 to buffer size minus 1) and
* a bit index (0 to 7).
*
* The pools start with a size of 8 bytes or 64 IDs. Each time the pool runs
* out of IDs its current size is doubled until it reaches its maximum size
* (8192 bytes or 65536 IDs). The IDs 0 and 65535 are never given out which
* means that a pool can have a maximum number of 65534 IDs available.
*/
static int
{
if (new_size <= IDM_IDPOOL_MAX_SIZE) {
if (new_pool) {
if (new_size >= IDM_IDPOOL_MAX_SIZE) {
/* id -1 made unavailable */
pool->id_free_counter--;
}
return (0);
}
}
return (-1);
}
/*
* idm_idpool_constructor
*
* This function initializes the pool structure provided.
*/
int
{
KM_SLEEP);
/* -1 id made unavailable */
return (0);
}
/*
* idm_idpool_destructor
*
* This function tears down and frees the resources associated with the
* pool provided.
*/
void
{
}
/*
* idm_idpool_alloc
*
* This function allocates an ID from the pool provided.
*/
int
{
uint32_t i;
return (-1);
}
while (i) {
while (bit) {
bit_idx++;
continue;
}
pool->id_free_counter--;
return (0);
}
pool->id_bit_idx = 0;
--i;
}
/*
* This section of code shouldn't be reached. If there are IDs
* available and none could be found there's a problem.
*/
ASSERT(0);
return (-1);
}
/*
* idm_idpool_free
*
* This function frees the ID provided.
*/
void
{
pool->id_free_counter++;
return;
}
/* Freeing a free ID. */
ASSERT(0);
}
idm_cid_alloc(void)
{
/*
* ID pool works with 16-bit identifiers right now. That should
* be plenty since we will probably never have more than 2^16
* connections simultaneously.
*/
return (0); /* Fail */
}
}
void
{
}
/*
* Code for generating the header and data digests
*
* This is the CRC-32C table
* Generated with:
* width = 32 bits
* poly = 0x1EDC6F41
* reflect input bytes = true
* reflect output bytes = true
*/
{
0x00000000, 0xF26B8303, 0xE13B70F7, 0x1350F3F4,
0xC79A971F, 0x35F1141C, 0x26A1E7E8, 0xD4CA64EB,
0x8AD958CF, 0x78B2DBCC, 0x6BE22838, 0x9989AB3B,
0x4D43CFD0, 0xBF284CD3, 0xAC78BF27, 0x5E133C24,
0x105EC76F, 0xE235446C, 0xF165B798, 0x030E349B,
0xD7C45070, 0x25AFD373, 0x36FF2087, 0xC494A384,
0x9A879FA0, 0x68EC1CA3, 0x7BBCEF57, 0x89D76C54,
0x5D1D08BF, 0xAF768BBC, 0xBC267848, 0x4E4DFB4B,
0x20BD8EDE, 0xD2D60DDD, 0xC186FE29, 0x33ED7D2A,
0xE72719C1, 0x154C9AC2, 0x061C6936, 0xF477EA35,
0xAA64D611, 0x580F5512, 0x4B5FA6E6, 0xB93425E5,
0x6DFE410E, 0x9F95C20D, 0x8CC531F9, 0x7EAEB2FA,
0x30E349B1, 0xC288CAB2, 0xD1D83946, 0x23B3BA45,
0xF779DEAE, 0x05125DAD, 0x1642AE59, 0xE4292D5A,
0xBA3A117E, 0x4851927D, 0x5B016189, 0xA96AE28A,
0x7DA08661, 0x8FCB0562, 0x9C9BF696, 0x6EF07595,
0x417B1DBC, 0xB3109EBF, 0xA0406D4B, 0x522BEE48,
0x86E18AA3, 0x748A09A0, 0x67DAFA54, 0x95B17957,
0xCBA24573, 0x39C9C670, 0x2A993584, 0xD8F2B687,
0x0C38D26C, 0xFE53516F, 0xED03A29B, 0x1F682198,
0x5125DAD3, 0xA34E59D0, 0xB01EAA24, 0x42752927,
0x96BF4DCC, 0x64D4CECF, 0x77843D3B, 0x85EFBE38,
0xDBFC821C, 0x2997011F, 0x3AC7F2EB, 0xC8AC71E8,
0x1C661503, 0xEE0D9600, 0xFD5D65F4, 0x0F36E6F7,
0x61C69362, 0x93AD1061, 0x80FDE395, 0x72966096,
0xA65C047D, 0x5437877E, 0x4767748A, 0xB50CF789,
0xEB1FCBAD, 0x197448AE, 0x0A24BB5A, 0xF84F3859,
0x2C855CB2, 0xDEEEDFB1, 0xCDBE2C45, 0x3FD5AF46,
0x7198540D, 0x83F3D70E, 0x90A324FA, 0x62C8A7F9,
0xB602C312, 0x44694011, 0x5739B3E5, 0xA55230E6,
0xFB410CC2, 0x092A8FC1, 0x1A7A7C35, 0xE811FF36,
0x3CDB9BDD, 0xCEB018DE, 0xDDE0EB2A, 0x2F8B6829,
0x82F63B78, 0x709DB87B, 0x63CD4B8F, 0x91A6C88C,
0x456CAC67, 0xB7072F64, 0xA457DC90, 0x563C5F93,
0x082F63B7, 0xFA44E0B4, 0xE9141340, 0x1B7F9043,
0xCFB5F4A8, 0x3DDE77AB, 0x2E8E845F, 0xDCE5075C,
0x92A8FC17, 0x60C37F14, 0x73938CE0, 0x81F80FE3,
0x55326B08, 0xA759E80B, 0xB4091BFF, 0x466298FC,
0x1871A4D8, 0xEA1A27DB, 0xF94AD42F, 0x0B21572C,
0xDFEB33C7, 0x2D80B0C4, 0x3ED04330, 0xCCBBC033,
0xA24BB5A6, 0x502036A5, 0x4370C551, 0xB11B4652,
0x65D122B9, 0x97BAA1BA, 0x84EA524E, 0x7681D14D,
0x2892ED69, 0xDAF96E6A, 0xC9A99D9E, 0x3BC21E9D,
0xEF087A76, 0x1D63F975, 0x0E330A81, 0xFC588982,
0xB21572C9, 0x407EF1CA, 0x532E023E, 0xA145813D,
0x758FE5D6, 0x87E466D5, 0x94B49521, 0x66DF1622,
0x38CC2A06, 0xCAA7A905, 0xD9F75AF1, 0x2B9CD9F2,
0xFF56BD19, 0x0D3D3E1A, 0x1E6DCDEE, 0xEC064EED,
0xC38D26C4, 0x31E6A5C7, 0x22B65633, 0xD0DDD530,
0x0417B1DB, 0xF67C32D8, 0xE52CC12C, 0x1747422F,
0x49547E0B, 0xBB3FFD08, 0xA86F0EFC, 0x5A048DFF,
0x8ECEE914, 0x7CA56A17, 0x6FF599E3, 0x9D9E1AE0,
0xD3D3E1AB, 0x21B862A8, 0x32E8915C, 0xC083125F,
0x144976B4, 0xE622F5B7, 0xF5720643, 0x07198540,
0x590AB964, 0xAB613A67, 0xB831C993, 0x4A5A4A90,
0x9E902E7B, 0x6CFBAD78, 0x7FAB5E8C, 0x8DC0DD8F,
0xE330A81A, 0x115B2B19, 0x020BD8ED, 0xF0605BEE,
0x24AA3F05, 0xD6C1BC06, 0xC5914FF2, 0x37FACCF1,
0x69E9F0D5, 0x9B8273D6, 0x88D28022, 0x7AB90321,
0xAE7367CA, 0x5C18E4C9, 0x4F48173D, 0xBD23943E,
0xF36E6F75, 0x0105EC76, 0x12551F82, 0xE03E9C81,
0x34F4F86A, 0xC69F7B69, 0xD5CF889D, 0x27A40B9E,
0x79B737BA, 0x8BDCB4B9, 0x988C474D, 0x6AE7C44E,
0xBE2DA0A5, 0x4C4623A6, 0x5F16D052, 0xAD7D5351
};
/*
* iscsi_crc32c - Steps through buffer one byte at at time, calculates
* reflected crc using table.
*/
{
#ifdef _BIG_ENDIAN
#endif
if (iscsi_crc32_hd == -1) {
iscsi_crc32_hd = 0;
} else {
iscsi_crc32_hd = 1;
}
}
if (iscsi_crc32_hd == 0)
while (length--) {
(crc >> 8);
}
#ifdef _BIG_ENDIAN
#endif /* _BIG_ENDIAN */
return (result);
}
/*
* idm_crc32c_continued - Continues stepping through buffer one
* byte at at time, calculates reflected crc using table.
*/
{
#ifdef _BIG_ENDIAN
#endif
if (iscsi_crc32_hd == -1) {
iscsi_crc32_hd = 0;
} else {
iscsi_crc32_hd = 1;
}
}
if (iscsi_crc32_hd == 0)
#ifdef _BIG_ENDIAN
#endif
while (length--) {
(crc >> 8);
}
#ifdef _BIG_ENDIAN
#endif
return (result);
}
/* ARGSUSED */
int
{
/* Find the next free task ID */
next_task++;
next_task = 0;
return (-1);
}
}
/*
* Set the transport header pointer explicitly. This removes the
* need for per-transport header allocation, which simplifies cache
* init considerably. If at a later date we have an additional IDM
* transport that requires a different size, we'll revisit this.
*/
return (0);
}
/* ARGSUSED */
void
{
/* Remove the task from the ID table */
/* free the inbuf and outbuf */
/*
* The final call to idm_task_rele may happen with the task
* mutex held which may invoke this destructor immediately.
* Stall here until the task mutex owner lets go.
*/
}
/*
* idm_listbuf_insert searches from the back of the list looking for the
* insertion point.
*/
void
{
/* iterate through the list to find the insertion point */
return;
}
}
/* add the buf to the head of the list */
}
/*ARGSUSED*/
void
idm_wd_thread(void *arg)
{
idm_conn_t *ic;
/* Record the thread id for thread_join() */
while (idm.idm_wd_thread_running) {
/*
* If this connection is in FFP then grab a hold
* and check the various timeout thresholds. Otherwise
* the connection is closing and we should just
* move on to the next one.
*/
} else {
continue;
}
/*
* If there hasn't been any activity on this
* connection for the keepalive timeout period
* and if the client has provided a keepalive
* callback then call the keepalive callback.
* This allows the client to take action to keep
* the link alive (like send a nop PDU).
*/
if ((TICK_TO_SEC(idle_time) >=
!ic->ic_keepalive) {
}
} else if ((TICK_TO_SEC(idle_time) <
/* Reset keepalive */
}
/*
* If there hasn't been any activity on this
* connection for the failure timeout period then
* drop the connection. We expect the initiator
* to keep the connection alive if it wants the
* connection to stay open.
*
* If it turns out to be desireable to take a
* more active role in maintaining the connect
* we could add a client callback to send
* a "keepalive" kind of message (no doubt a nop)
* and fire that on a shorter timer.
*/
if (TICK_TO_SEC(idle_time) >
"conn %p idle for %d seconds, "
"sending CE_TRANSPORT_FAIL",
}
}
}
thread_exit();
}