2011-07-03 05:56:22 +00:00
|
|
|
/*
|
|
|
|
* This file is provided under a dual BSD/GPLv2 license. When using or
|
|
|
|
* redistributing this file, you may do so under either license.
|
|
|
|
*
|
|
|
|
* GPL LICENSE SUMMARY
|
|
|
|
*
|
|
|
|
* Copyright(c) 2008 - 2011 Intel Corporation. All rights reserved.
|
|
|
|
*
|
|
|
|
* This program is free software; you can redistribute it and/or modify
|
|
|
|
* it under the terms of version 2 of the GNU General Public License as
|
|
|
|
* published by the Free Software Foundation.
|
|
|
|
*
|
|
|
|
* 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, write to the Free Software
|
|
|
|
* Foundation, Inc., 51 Franklin St - Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
|
* The full GNU General Public License is included in this distribution
|
|
|
|
* in the file called LICENSE.GPL.
|
|
|
|
*
|
|
|
|
* BSD LICENSE
|
|
|
|
*
|
|
|
|
* Copyright(c) 2008 - 2011 Intel Corporation. All rights reserved.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
*
|
|
|
|
* * Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* * Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in
|
|
|
|
* the documentation and/or other materials provided with the
|
|
|
|
* distribution.
|
|
|
|
* * Neither the name of Intel Corporation nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived
|
|
|
|
* from this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
2011-05-04 07:58:16 +00:00
|
|
|
#ifndef _ISCI_TASK_H_
|
2011-07-03 05:56:22 +00:00
|
|
|
#define _ISCI_TASK_H_
|
|
|
|
|
2011-03-31 20:10:40 +00:00
|
|
|
#include <scsi/sas_ata.h>
|
2011-05-08 22:49:15 +00:00
|
|
|
#include "host.h"
|
2011-03-31 20:10:40 +00:00
|
|
|
|
2011-10-27 22:05:06 +00:00
|
|
|
#define ISCI_TERMINATION_TIMEOUT_MSEC 500
|
|
|
|
|
2011-07-03 05:56:22 +00:00
|
|
|
struct isci_request;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* enum isci_tmf_function_codes - This enum defines the possible preparations
|
|
|
|
* of task management requests.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
enum isci_tmf_function_codes {
|
|
|
|
|
|
|
|
isci_tmf_func_none = 0,
|
|
|
|
isci_tmf_ssp_task_abort = TMF_ABORT_TASK,
|
|
|
|
isci_tmf_ssp_lun_reset = TMF_LU_RESET,
|
|
|
|
};
|
2012-03-09 06:41:54 +00:00
|
|
|
|
2011-07-03 05:56:22 +00:00
|
|
|
/**
|
|
|
|
* struct isci_tmf - This class represents the task management object which
|
|
|
|
* acts as an interface to libsas for processing task management requests
|
|
|
|
*
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
struct isci_tmf {
|
|
|
|
|
|
|
|
struct completion *complete;
|
|
|
|
enum sas_protocol proto;
|
|
|
|
union {
|
2011-05-05 00:53:24 +00:00
|
|
|
struct ssp_response_iu resp_iu;
|
2011-07-03 05:56:22 +00:00
|
|
|
struct dev_to_host_fis d2h_fis;
|
2011-06-15 18:11:03 +00:00
|
|
|
u8 rsp_buf[SSP_RESP_IU_MAX_SIZE];
|
|
|
|
} resp;
|
2011-07-03 05:56:22 +00:00
|
|
|
unsigned char lun[8];
|
|
|
|
u16 io_tag;
|
|
|
|
enum isci_tmf_function_codes tmf_code;
|
|
|
|
int status;
|
|
|
|
};
|
|
|
|
|
2012-01-04 09:33:05 +00:00
|
|
|
static inline void isci_print_tmf(struct isci_host *ihost, struct isci_tmf *tmf)
|
2011-07-03 05:56:22 +00:00
|
|
|
{
|
|
|
|
if (SAS_PROTOCOL_SATA == tmf->proto)
|
2012-01-04 09:33:05 +00:00
|
|
|
dev_dbg(&ihost->pdev->dev,
|
2011-07-03 05:56:22 +00:00
|
|
|
"%s: status = %x\n"
|
|
|
|
"tmf->resp.d2h_fis.status = %x\n"
|
|
|
|
"tmf->resp.d2h_fis.error = %x\n",
|
|
|
|
__func__,
|
|
|
|
tmf->status,
|
|
|
|
tmf->resp.d2h_fis.status,
|
|
|
|
tmf->resp.d2h_fis.error);
|
|
|
|
else
|
2012-01-04 09:33:05 +00:00
|
|
|
dev_dbg(&ihost->pdev->dev,
|
2011-07-03 05:56:22 +00:00
|
|
|
"%s: status = %x\n"
|
|
|
|
"tmf->resp.resp_iu.data_present = %x\n"
|
|
|
|
"tmf->resp.resp_iu.status = %x\n"
|
|
|
|
"tmf->resp.resp_iu.data_length = %x\n"
|
|
|
|
"tmf->resp.resp_iu.data[0] = %x\n"
|
|
|
|
"tmf->resp.resp_iu.data[1] = %x\n"
|
|
|
|
"tmf->resp.resp_iu.data[2] = %x\n"
|
|
|
|
"tmf->resp.resp_iu.data[3] = %x\n",
|
|
|
|
__func__,
|
|
|
|
tmf->status,
|
2011-05-05 00:53:24 +00:00
|
|
|
tmf->resp.resp_iu.datapres,
|
2011-07-03 05:56:22 +00:00
|
|
|
tmf->resp.resp_iu.status,
|
2011-05-05 00:53:24 +00:00
|
|
|
be32_to_cpu(tmf->resp.resp_iu.response_data_len),
|
|
|
|
tmf->resp.resp_iu.resp_data[0],
|
|
|
|
tmf->resp.resp_iu.resp_data[1],
|
|
|
|
tmf->resp.resp_iu.resp_data[2],
|
|
|
|
tmf->resp.resp_iu.resp_data[3]);
|
2011-07-03 05:56:22 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
int isci_task_execute_task(
|
|
|
|
struct sas_task *task,
|
|
|
|
gfp_t gfp_flags);
|
|
|
|
|
|
|
|
int isci_task_abort_task(
|
|
|
|
struct sas_task *task);
|
|
|
|
|
|
|
|
int isci_task_abort_task_set(
|
|
|
|
struct domain_device *d_device,
|
|
|
|
u8 *lun);
|
|
|
|
|
|
|
|
int isci_task_clear_aca(
|
|
|
|
struct domain_device *d_device,
|
|
|
|
u8 *lun);
|
|
|
|
|
|
|
|
int isci_task_clear_task_set(
|
|
|
|
struct domain_device *d_device,
|
|
|
|
u8 *lun);
|
|
|
|
|
|
|
|
int isci_task_query_task(
|
|
|
|
struct sas_task *task);
|
|
|
|
|
|
|
|
int isci_task_lu_reset(
|
|
|
|
struct domain_device *d_device,
|
|
|
|
u8 *lun);
|
|
|
|
|
|
|
|
int isci_task_clear_nexus_port(
|
|
|
|
struct asd_sas_port *port);
|
|
|
|
|
|
|
|
int isci_task_clear_nexus_ha(
|
|
|
|
struct sas_ha_struct *ha);
|
|
|
|
|
|
|
|
int isci_task_I_T_nexus_reset(
|
|
|
|
struct domain_device *d_device);
|
|
|
|
|
|
|
|
void isci_task_request_complete(
|
|
|
|
struct isci_host *isci_host,
|
|
|
|
struct isci_request *request,
|
|
|
|
enum sci_task_status completion_status);
|
|
|
|
|
|
|
|
u16 isci_task_ssp_request_get_io_tag_to_manage(
|
|
|
|
struct isci_request *request);
|
|
|
|
|
|
|
|
u8 isci_task_ssp_request_get_function(
|
|
|
|
struct isci_request *request);
|
|
|
|
|
|
|
|
|
|
|
|
void *isci_task_ssp_request_get_response_data_address(
|
|
|
|
struct isci_request *request);
|
|
|
|
|
|
|
|
u32 isci_task_ssp_request_get_response_data_length(
|
|
|
|
struct isci_request *request);
|
|
|
|
|
|
|
|
int isci_queuecommand(
|
|
|
|
struct scsi_cmnd *scsi_cmd,
|
|
|
|
void (*donefunc)(struct scsi_cmnd *));
|
|
|
|
|
|
|
|
#endif /* !defined(_SCI_TASK_H_) */
|