328 lines
9.4 KiB
C
328 lines
9.4 KiB
C
/* command processing for pipe put operation */
|
|
|
|
/*
|
|
* Copyright (c) 1997-2014 Wind River Systems, Inc.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions are met:
|
|
*
|
|
* 1) Redistributions of source code must retain the above copyright notice,
|
|
* this list of conditions and the following disclaimer.
|
|
*
|
|
* 2) 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.
|
|
*
|
|
* 3) Neither the name of Wind River Systems 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 HOLDER 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.
|
|
*/
|
|
|
|
#include <minik.h>
|
|
#include <k_pipe_util.h>
|
|
#include <toolchain.h>
|
|
#include <sections.h>
|
|
#include <misc/__assert.h>
|
|
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* K_ChSendReq - process request command for a pipe put operation
|
|
*
|
|
* RETURNS: N/A
|
|
*/
|
|
|
|
void K_ChSendReq(struct k_args *RequestOrig)
|
|
{
|
|
struct k_args *Request;
|
|
struct k_args *RequestProc;
|
|
|
|
kpipe_t pipeId = RequestOrig->Args.ChReq.ReqInfo.ChRef.Id;
|
|
|
|
BOOL bAsync;
|
|
|
|
if (_ASYNCREQ == ChxxxGetReqType(&(RequestOrig->Args))) {
|
|
bAsync = TRUE;
|
|
} else {
|
|
bAsync = FALSE;
|
|
}
|
|
|
|
if (!bAsync) {
|
|
/* First save the pointer to the task's TCB for rescheduling later */
|
|
RequestOrig->Ctxt.proc = _k_current_task;
|
|
set_state_bit(_k_current_task, TF_SEND);
|
|
} else {
|
|
/* No need to put in data about sender, since it's a poster */
|
|
RequestOrig->Ctxt.proc = NULL;
|
|
}
|
|
|
|
mycopypacket(&Request, RequestOrig);
|
|
|
|
/* if we end up here, we arrived at destination node and the packet
|
|
Request is not local */
|
|
|
|
/* Now, we need a new packet for processing of the request; the
|
|
Request package is too small b/c of space lost due to possible
|
|
embedded local data
|
|
*/
|
|
|
|
mycopypacket(&RequestProc, Request);
|
|
RequestProc->Args.ChProc.ReqInfo.ChRef.pPipe =
|
|
&(_k_pipe_list[OBJ_INDEX(pipeId)]);
|
|
|
|
switch (ChxxxGetReqType(&(RequestProc->Args))) {
|
|
case _SYNCREQ:
|
|
RequestProc->Args.ChProc.pData =
|
|
Request->Args.ChReq.ReqType.Sync.pData;
|
|
RequestProc->Args.ChProc.iSizeTotal =
|
|
Request->Args.ChReq.ReqType.Sync.iSizeTotal;
|
|
break;
|
|
case _ASYNCREQ:
|
|
RequestProc->Args.ChProc.pData =
|
|
Request->Args.ChReq.ReqType.Async.block.pointer_to_data;
|
|
RequestProc->Args.ChProc.iSizeTotal =
|
|
Request->Args.ChReq.ReqType.Async.iSizeTotal;
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
RequestProc->Args.ChProc.Status = XFER_IDLE;
|
|
RequestProc->Args.ChProc.iNbrPendXfers = 0;
|
|
RequestProc->Args.ChProc.iSizeXferred = 0;
|
|
|
|
RequestProc->Forw = NULL;
|
|
RequestProc->Head = NULL;
|
|
|
|
switch (RequestProc->Time.ticks) {
|
|
case TICKS_NONE:
|
|
ChxxxSetTimeType((K_ARGS_ARGS *)&(RequestProc->Args), _TIME_NB);
|
|
break;
|
|
case TICKS_UNLIMITED:
|
|
ChxxxSetTimeType((K_ARGS_ARGS *)&(RequestProc->Args), _TIME_B);
|
|
break;
|
|
default:
|
|
ChxxxSetTimeType((K_ARGS_ARGS *)&(RequestProc->Args), _TIME_BT);
|
|
break;
|
|
}
|
|
|
|
/* start processing */
|
|
|
|
struct pipe_struct *pPipe;
|
|
struct k_chproc *pReqProcArgs;
|
|
|
|
pReqProcArgs = &(RequestProc->Args.ChProc);
|
|
pPipe = pReqProcArgs->ReqInfo.ChRef.pPipe;
|
|
|
|
do {
|
|
int iSpace2WriteinReaders;
|
|
int iFreeBufferSpace;
|
|
int iTotalSpace2Write;
|
|
int32_t ticks;
|
|
|
|
iSpace2WriteinReaders = CalcFreeReaderSpace(pPipe->Readers);
|
|
iFreeBufferSpace =
|
|
pPipe->Buff.iFreeSpaceCont + pPipe->Buff.iFreeSpaceAWA;
|
|
iTotalSpace2Write =
|
|
iFreeBufferSpace + iSpace2WriteinReaders;
|
|
|
|
if (0 == iTotalSpace2Write)
|
|
break; /* special case b/c even not good enough for 1_TO_N */
|
|
|
|
/* (possibly) do some processing */
|
|
|
|
ticks = RequestProc->Time.ticks;
|
|
RequestProc->Time.timer = NULL;
|
|
K_ChProc(pPipe, RequestProc /* writer */, NULL /* reader */);
|
|
RequestProc->Time.ticks = ticks;
|
|
|
|
/* check if request was processed */
|
|
|
|
if (TERM_XXX & ChReqGetStatus(&(RequestProc->Args.ChProc))) {
|
|
RequestProc->Time.timer = NULL; /* not really required */
|
|
return; /* not listed anymore --> completely processed */
|
|
}
|
|
|
|
} while (0);
|
|
|
|
/* if we got up to here, we did none or SOME (partial)
|
|
* processing on the request
|
|
*/
|
|
|
|
if (_TIME_NB !=
|
|
ChxxxGetTimeType((K_ARGS_ARGS *)&(RequestProc->Args))) {
|
|
/* call is blocking */
|
|
INSERT_ELM(pPipe->Writers, RequestProc);
|
|
/*
|
|
* NOTE: It is both faster and simpler to blindly assign the
|
|
* CHENQ_TMO microkernel command to the packet even though it
|
|
* is only useful to the finite timeout case.
|
|
*/
|
|
RequestProc->Comm = CHENQ_TMO;
|
|
if (_TIME_B == ChxxxGetTimeType((K_ARGS_ARGS *)&(RequestProc->Args))) {
|
|
/*
|
|
* The writer specified TICKS_UNLIMITED; NULL the timer.
|
|
*/
|
|
RequestProc->Time.timer = NULL;
|
|
return;
|
|
} else {
|
|
/* { TIME_BT } */
|
|
#ifdef CANCEL_TIMERS
|
|
if (ChReqSizeXferred(&(RequestProc->Args.ChProc))) {
|
|
RequestProc->Time.timer = NULL;
|
|
} else
|
|
#endif
|
|
/* enlist a new timer into the timeout chain */
|
|
enlist_timeout(RequestProc);
|
|
|
|
return;
|
|
}
|
|
} else {
|
|
/* call is non-blocking;
|
|
Check if we don't have to queue it b/c it could not
|
|
be processed at once
|
|
*/
|
|
RequestProc->Time.timer = NULL;
|
|
|
|
if (XFER_BUSY == ChReqGetStatus(&(RequestProc->Args.ChProc))) {
|
|
INSERT_ELM(pPipe->Writers, RequestProc);
|
|
} else {
|
|
__ASSERT_NO_MSG(XFER_IDLE ==
|
|
ChReqGetStatus(&(RequestProc->Args.ChProc)));
|
|
__ASSERT_NO_MSG(0 ==
|
|
ChReqSizeXferred(&(RequestProc->Args.ChProc)));
|
|
RequestProc->Comm = CHENQ_RPL;
|
|
K_ChSendRpl(RequestProc);
|
|
}
|
|
return;
|
|
}
|
|
}
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* K_ChSendTmo - perform timeout command for a pipe put operation
|
|
*
|
|
* RETURNS: N/A
|
|
*/
|
|
|
|
void K_ChSendTmo(struct k_args *ReqProc)
|
|
{
|
|
__ASSERT_NO_MSG(NULL != ReqProc->Time.timer);
|
|
|
|
myfreetimer(&(ReqProc->Time.timer));
|
|
ChReqSetStatus(&(ReqProc->Args.ChProc), TERM_TMO);
|
|
|
|
DeListWaiter(ReqProc);
|
|
if (0 == ReqProc->Args.ChProc.iNbrPendXfers) {
|
|
K_ChSendRpl(ReqProc);
|
|
}
|
|
}
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* K_ChSendRpl - process reply command for a pipe put operation
|
|
*
|
|
* RETURNS: N/A
|
|
*/
|
|
|
|
void K_ChSendRpl(struct k_args *ReqProc)
|
|
{
|
|
__ASSERT_NO_MSG(
|
|
0 == ReqProc->Args.ChProc.iNbrPendXfers /* no pending Xfers */
|
|
&& NULL == ReqProc->Time.timer /* no pending timer */
|
|
&& NULL == ReqProc->Head); /* not in list */
|
|
|
|
/* orig packet must be sent back, not ReqProc */
|
|
|
|
struct k_args *ReqOrig = ReqProc->Ctxt.args;
|
|
CHREQ_STATUS ChReqStatus;
|
|
|
|
ReqOrig->Comm = CHENQ_ACK;
|
|
|
|
/* determine return value:
|
|
*/
|
|
ChReqStatus = ChReqGetStatus(&(ReqProc->Args.ChProc));
|
|
if (unlikely(TERM_TMO == ChReqStatus)) {
|
|
ReqOrig->Time.rcode = RC_TIME;
|
|
} else if ((TERM_XXX | XFER_IDLE) & ChReqStatus) {
|
|
K_PIPE_OPTION Option = ChxxxGetChOpt(&(ReqProc->Args));
|
|
|
|
if (likely(0 == ChReqSizeLeft(&(ReqProc->Args.ChProc)))) {
|
|
/* All data has been transferred */
|
|
ReqOrig->Time.rcode = RC_OK;
|
|
} else if (ChReqSizeXferred(&(ReqProc->Args.ChProc))) {
|
|
/* Some but not all data has been transferred */
|
|
ReqOrig->Time.rcode = (Option == _ALL_N) ? RC_INCOMPLETE : RC_OK;
|
|
} else {
|
|
/* No data has been transferred */
|
|
ReqOrig->Time.rcode = (Option == _0_TO_N) ? RC_OK : RC_FAIL;
|
|
}
|
|
} else {
|
|
/* unknown (invalid) status */
|
|
__ASSERT_NO_MSG(1 == 0); /* should not come here */
|
|
}
|
|
if (_ASYNCREQ != ChxxxGetReqType(&(ReqOrig->Args))) {
|
|
ReqOrig->Args.ChAck.iSizeXferred = ReqProc->Args.ChProc.iSizeXferred;
|
|
}
|
|
|
|
SENDARGS(ReqOrig);
|
|
|
|
FREEARGS(ReqProc);
|
|
}
|
|
|
|
/*******************************************************************************
|
|
*
|
|
* K_ChSendAck - process acknowledgement command for a pipe put operation
|
|
*
|
|
* RETURNS: N/A
|
|
*/
|
|
|
|
void K_ChSendAck(struct k_args *Request)
|
|
{
|
|
if (_ASYNCREQ == ChxxxGetReqType(&(Request->Args))) {
|
|
struct k_chack *pChAck = (struct k_chack *)&(Request->Args.ChAck);
|
|
struct k_args A;
|
|
struct k_block *blockptr;
|
|
|
|
/* invoke command to release block */
|
|
blockptr = &(pChAck->ReqType.Async.block);
|
|
A.Comm = REL_BLOCK;
|
|
A.Args.p1.poolid = blockptr->poolid;
|
|
A.Args.p1.req_size = blockptr->req_size;
|
|
A.Args.p1.rep_poolptr = blockptr->address_in_pool;
|
|
A.Args.p1.rep_dataptr = blockptr->pointer_to_data;
|
|
_k_mem_pool_block_release(&A); /* will return immediately */
|
|
|
|
if ((ksem_t)NULL != pChAck->ReqType.Async.sema) {
|
|
/* invoke command to signal sema */
|
|
struct k_args A;
|
|
|
|
A.Comm = SIGNALS;
|
|
A.Args.s1.sema = pChAck->ReqType.Async.sema;
|
|
_k_sem_signal(&A); /* will return immediately */
|
|
}
|
|
} else {
|
|
/* Reschedule the sender task */
|
|
struct k_args *LocalReq;
|
|
|
|
LocalReq = Request->Ctxt.args;
|
|
LocalReq->Time.rcode = Request->Time.rcode;
|
|
LocalReq->Args.ChAck = Request->Args.ChAck;
|
|
|
|
reset_state_bit(LocalReq->Ctxt.proc, TF_SEND | TF_SENDDATA);
|
|
}
|
|
|
|
FREEARGS(Request);
|
|
}
|