| 1 |
/* |
| 2 |
* Copyright (c) 2006-2012. QLogic Corporation. All rights reserved. |
| 3 |
* Copyright (c) 2003-2006, PathScale, Inc. All rights reserved. |
| 4 |
* |
| 5 |
* This software is available to you under a choice of one of two |
| 6 |
* licenses. You may choose to be licensed under the terms of the GNU |
| 7 |
* General Public License (GPL) Version 2, available from the file |
| 8 |
* COPYING in the main directory of this source tree, or the |
| 9 |
* OpenIB.org BSD license below: |
| 10 |
* |
| 11 |
* Redistribution and use in source and binary forms, with or |
| 12 |
* without modification, are permitted provided that the following |
| 13 |
* conditions are met: |
| 14 |
* |
| 15 |
* - Redistributions of source code must retain the above |
| 16 |
* copyright notice, this list of conditions and the following |
| 17 |
* disclaimer. |
| 18 |
* |
| 19 |
* - Redistributions in binary form must reproduce the above |
| 20 |
* copyright notice, this list of conditions and the following |
| 21 |
* disclaimer in the documentation and/or other materials |
| 22 |
* provided with the distribution. |
| 23 |
* |
| 24 |
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, |
| 25 |
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF |
| 26 |
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND |
| 27 |
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS |
| 28 |
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN |
| 29 |
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN |
| 30 |
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE |
| 31 |
* SOFTWARE. |
| 32 |
*/ |
| 33 |
|
| 34 |
#include "ips_recvq.h" |
| 35 |
|
| 36 |
/* We return a table of pointer indexes. |
| 37 |
* |
| 38 |
* From the point of view of the returned pointer, index -1 always points to |
| 39 |
* the address to call psmi_free on (since we force page-alignment). |
| 40 |
*/ |
| 41 |
void ** |
| 42 |
ips_recvq_egrbuf_table_alloc(psm_ep_t ep, void *baseptr, |
| 43 |
uint32_t chunksize, |
| 44 |
uint32_t bufnum, uint32_t bufsize) |
| 45 |
{ |
| 46 |
unsigned i; |
| 47 |
uint32_t bufperchunk = chunksize / bufsize; |
| 48 |
void *ptr_alloc; |
| 49 |
uintptr_t *buft; |
| 50 |
uintptr_t base = (uintptr_t) baseptr; |
| 51 |
|
| 52 |
ptr_alloc = psmi_malloc(ep, UNDEFINED, |
| 53 |
PSMI_PAGESIZE + sizeof(uintptr_t)*(bufnum+1)); |
| 54 |
if (ptr_alloc == NULL) |
| 55 |
return NULL; |
| 56 |
/* First pointer is to the actual allocated address, so we can free it but |
| 57 |
* buft[1] is first on the page boundary |
| 58 |
*/ |
| 59 |
buft = (uintptr_t *) PSMI_ALIGNUP(ptr_alloc+1, PSMI_PAGESIZE); |
| 60 |
buft[-1] = (uintptr_t) ptr_alloc; |
| 61 |
for (i=0; i<bufnum; i++) |
| 62 |
buft[i] = base + (i / bufperchunk) * chunksize + |
| 63 |
(i % bufperchunk) * bufsize; |
| 64 |
return (void **)buft; |
| 65 |
} |
| 66 |
|
| 67 |
void |
| 68 |
ips_recvq_egrbuf_table_free(void **buftable) |
| 69 |
{ |
| 70 |
uintptr_t *buft = (uintptr_t *) buftable; |
| 71 |
void *ptr_alloc = (void *) buft[-1]; |
| 72 |
psmi_free(ptr_alloc); |
| 73 |
} |
| 74 |
|