| 1 |
145 |
lanttu |
/*
|
| 2 |
|
|
* Copyright (c) 2010, Mentor Graphics Corporation
|
| 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 are met:
|
| 7 |
|
|
*
|
| 8 |
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
| 9 |
|
|
* this list of conditions and the following disclaimer.
|
| 10 |
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
| 11 |
|
|
* this list of conditions and the following disclaimer in the documentation
|
| 12 |
|
|
* and/or other materials provided with the distribution.
|
| 13 |
|
|
* 3. Neither the name of the <ORGANIZATION> nor the names of its contributors
|
| 14 |
|
|
* may be used to endorse or promote products derived from this software
|
| 15 |
|
|
* without specific prior written permission.
|
| 16 |
|
|
*
|
| 17 |
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
|
| 18 |
|
|
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
| 19 |
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
| 20 |
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
|
| 21 |
|
|
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
|
| 22 |
|
|
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
|
| 23 |
|
|
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
|
| 24 |
|
|
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
|
| 25 |
|
|
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
|
| 26 |
|
|
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
| 27 |
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
| 28 |
|
|
*/
|
| 29 |
|
|
|
| 30 |
|
|
|
| 31 |
|
|
|
| 32 |
|
|
#include <openmcapi.h>
|
| 33 |
|
|
|
| 34 |
|
|
extern MCAPI_BUF_QUEUE MCAPI_Buf_Wait_List;
|
| 35 |
|
|
|
| 36 |
|
|
/*************************************************************************
|
| 37 |
|
|
*
|
| 38 |
|
|
* FUNCTION
|
| 39 |
|
|
*
|
| 40 |
|
|
* mcapi_pktchan_free
|
| 41 |
|
|
*
|
| 42 |
|
|
* DESCRIPTION
|
| 43 |
|
|
*
|
| 44 |
|
|
* Non-blocking API routine to return a system buffer.
|
| 45 |
|
|
*
|
| 46 |
|
|
* INPUTS
|
| 47 |
|
|
*
|
| 48 |
|
|
* *buffer A pointer to the buffer to return.
|
| 49 |
|
|
* *mcapi_status A pointer to memory that will be filled in
|
| 50 |
|
|
* with the status of the call.
|
| 51 |
|
|
*
|
| 52 |
|
|
* OUTPUTS
|
| 53 |
|
|
*
|
| 54 |
|
|
* The number of receive operations that are guaranteed to not block
|
| 55 |
|
|
* waiting for incoming data.
|
| 56 |
|
|
*
|
| 57 |
|
|
*************************************************************************/
|
| 58 |
|
|
void mcapi_pktchan_free(void *buffer, mcapi_status_t *mcapi_status)
|
| 59 |
|
|
{
|
| 60 |
|
|
MCAPI_BUFFER *cur_buf;
|
| 61 |
|
|
|
| 62 |
|
|
/* Validate mcapi_status input parameter. */
|
| 63 |
|
|
if (mcapi_status)
|
| 64 |
|
|
{
|
| 65 |
|
|
/* Validate buffer input parameter. */
|
| 66 |
|
|
if (buffer)
|
| 67 |
|
|
{
|
| 68 |
|
|
/* Get the lock. */
|
| 69 |
|
|
mcapi_lock_node_data();
|
| 70 |
|
|
|
| 71 |
|
|
/* Get a pointer to the first buffer on the wait list. */
|
| 72 |
|
|
cur_buf = MCAPI_Buf_Wait_List.head;
|
| 73 |
|
|
|
| 74 |
|
|
/* Find the buffer structure associated with this buffer. */
|
| 75 |
|
|
while (cur_buf)
|
| 76 |
|
|
{
|
| 77 |
|
|
/* If the buffer matches the buffer being free. */
|
| 78 |
|
|
if (cur_buf->buf_ptr == ((unsigned char*)buffer - MCAPI_HEADER_LEN))
|
| 79 |
|
|
{
|
| 80 |
|
|
/* Remove this buffer from the Wait List. */
|
| 81 |
|
|
mcapi_remove(&MCAPI_Buf_Wait_List, cur_buf);
|
| 82 |
|
|
|
| 83 |
|
|
/* Return the buffer to the list of free buffers. */
|
| 84 |
|
|
((MCAPI_INTERFACE*)(cur_buf->mcapi_dev_ptr))->
|
| 85 |
|
|
mcapi_recover_buffer(cur_buf);
|
| 86 |
|
|
|
| 87 |
|
|
break;
|
| 88 |
|
|
}
|
| 89 |
|
|
|
| 90 |
|
|
/* Get a pointer to the next buffer. */
|
| 91 |
|
|
cur_buf = (MCAPI_BUFFER*)(cur_buf->next_buf);
|
| 92 |
|
|
}
|
| 93 |
|
|
|
| 94 |
|
|
/* The buffer was found on the list. */
|
| 95 |
|
|
if (cur_buf)
|
| 96 |
|
|
{
|
| 97 |
|
|
*mcapi_status = MCAPI_SUCCESS;
|
| 98 |
|
|
}
|
| 99 |
|
|
|
| 100 |
|
|
/* The buffer was not found. */
|
| 101 |
|
|
else
|
| 102 |
|
|
{
|
| 103 |
|
|
*mcapi_status = MCAPI_ERR_BUF_INVALID;
|
| 104 |
|
|
}
|
| 105 |
|
|
|
| 106 |
|
|
/* Release the lock. */
|
| 107 |
|
|
mcapi_unlock_node_data();
|
| 108 |
|
|
}
|
| 109 |
|
|
|
| 110 |
|
|
/* The buffer is not valid. */
|
| 111 |
|
|
else
|
| 112 |
|
|
{
|
| 113 |
|
|
*mcapi_status = MCAPI_ERR_BUF_INVALID;
|
| 114 |
|
|
}
|
| 115 |
|
|
}
|
| 116 |
|
|
|
| 117 |
|
|
}
|
