1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293
|
/*
* Copyright (c) 2016 Intel Corporation. All rights reserved.
*
* This software is available to you under a choice of one of two
* licenses. You may choose to be licensed under the terms of the GNU
* General Public License (GPL) Version 2, available from the file
* COPYING in the main directory of this source tree, or the
* BSD license below:
*
* 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.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
* BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
* ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*
*/
#ifndef _OFI_IOV_H_
#define _OFI_IOV_H_
#include "config.h"
#include <ofi.h>
#include <stdbool.h>
#include <stdlib.h>
#include <string.h>
#include <sys/uio.h>
#include <inttypes.h>
#include <rdma/fabric.h>
static inline size_t ofi_total_iov_len(const struct iovec *iov, size_t iov_count)
{
size_t i, len = 0;
for (i = 0; i < iov_count; i++)
len += iov[i].iov_len;
return len;
}
static inline size_t ofi_total_ioc_cnt(const struct fi_ioc *ioc, size_t ioc_count)
{
size_t i, cnt = 0;
for (i = 0; i < ioc_count; i++)
cnt += ioc[i].count;
return cnt;
}
static inline size_t ofi_total_rma_iov_len(const struct fi_rma_iov *rma_iov,
size_t iov_count)
{
size_t i, len = 0;
for (i = 0; i < iov_count; i++)
len += rma_iov[i].len;
return len;
}
static inline size_t ofi_total_rma_ioc_cnt(const struct fi_rma_ioc *rma_ioc,
size_t ioc_count)
{
size_t i, cnt = 0;
for (i = 0; i < ioc_count; i++)
cnt += rma_ioc[i].count;
return cnt;
}
#define OFI_COPY_IOV_TO_BUF 0
#define OFI_COPY_BUF_TO_IOV 1
static inline size_t ofi_iov_bytes_to_copy(const struct iovec *iov,
size_t *size, size_t *offset, char **copy_buf)
{
size_t len;
len = iov->iov_len;
if (*offset > len) {
*offset -= len;
return 0;
}
*copy_buf = (char *)iov->iov_base + *offset;
len -= *offset;
*offset = 0;
len = MIN(len, *size);
*size -= len;
return len;
}
size_t ofi_copy_iov_buf(const struct iovec *iov, size_t iov_count, size_t iov_offset,
void *buf, size_t bufsize, int dir);
static inline size_t
ofi_copy_to_iov(const struct iovec *iov, size_t iov_count, size_t iov_offset,
void *buf, size_t bufsize)
{
if (iov_count == 1) {
size_t size = ((iov_offset > iov[0].iov_len) ?
0 : MIN(bufsize, iov[0].iov_len - iov_offset));
memcpy((char *)iov[0].iov_base + iov_offset, buf, size);
return size;
} else {
return ofi_copy_iov_buf(iov, iov_count, iov_offset, buf, bufsize,
OFI_COPY_BUF_TO_IOV);
}
}
static inline size_t
ofi_copy_from_iov(void *buf, size_t bufsize,
const struct iovec *iov, size_t iov_count, size_t iov_offset)
{
if (iov_count == 1) {
size_t size = ((iov_offset > iov[0].iov_len) ?
0 : MIN(bufsize, iov[0].iov_len - iov_offset));
memcpy(buf, (char *)iov[0].iov_base + iov_offset, size);
return size;
} else {
return ofi_copy_iov_buf(iov, iov_count, iov_offset, buf, bufsize,
OFI_COPY_IOV_TO_BUF);
}
}
static inline void ofi_ioc_to_iov(const struct fi_ioc *ioc, struct iovec *iov,
size_t count, size_t size)
{
int i;
for (i = 0; i < count; i++) {
iov[i].iov_base = ioc[i].addr;
iov[i].iov_len = ioc[i].count * size;
}
}
static inline void ofi_rma_ioc_to_iov(const struct fi_rma_ioc *ioc,
struct fi_rma_iov *iov,
size_t count, size_t size)
{
int i;
for (i = 0; i < count; i++) {
iov[i].addr = ioc[i].addr;
iov[i].len = ioc[i].count * size;
iov[i].key = ioc[i].key;
}
}
static inline void *
ofi_iov_end(const struct iovec *iov)
{
return ((char *) iov->iov_base) + iov->iov_len - 1;
}
static inline bool
ofi_iov_left(const struct iovec *iov1, const struct iovec *iov2)
{
return ofi_iov_end(iov1) < iov2->iov_base;
}
static inline bool
ofi_iov_right(const struct iovec *iov1, const struct iovec *iov2)
{
return iov1->iov_base > ofi_iov_end(iov2);
}
static inline bool
ofi_iov_shifted_left(const struct iovec *iov1, const struct iovec *iov2)
{
return ((iov1->iov_base < iov2->iov_base) &&
(ofi_iov_end(iov1) < ofi_iov_end(iov2)));
}
static inline bool
ofi_iov_shifted_right(const struct iovec *iov1, const struct iovec *iov2)
{
return ((iov1->iov_base > iov2->iov_base) &&
(ofi_iov_end(iov1) > ofi_iov_end(iov2)));
}
static inline bool
ofi_iov_within(const struct iovec *iov1, const struct iovec *iov2)
{
return (iov1->iov_base >= iov2->iov_base) &&
(ofi_iov_end(iov1) <= ofi_iov_end(iov2));
}
void ofi_consume_iov(struct iovec *iovec, size_t *iovec_count, size_t offset);
void ofi_consume_iov_desc(struct iovec *iovec, void **desc,
size_t *iovec_count, size_t offset);
void ofi_consume_rma_iov(struct fi_rma_iov *rma_iov, size_t *rma_iov_count,
size_t length);
int ofi_truncate_iov(struct iovec *iov, size_t *iov_count, size_t new_size);
/* Copy 'len' bytes worth of src iovec to dst */
int ofi_copy_iov_desc(struct iovec *dst_iov, void **dst_desc, size_t *dst_count,
struct iovec *src_iov, void **src_desc, size_t src_count,
size_t *index, size_t *offset, size_t len);
/* Copy 'len' bytes worth of src fi_rma_iov to dst */
int ofi_copy_rma_iov(struct fi_rma_iov *dst_iov, size_t *dst_count,
struct fi_rma_iov *src_iov, size_t src_count,
size_t *index, size_t *offset, size_t len);
/* for a given offset, find the iov_index and iov_offset.
* return 0 on success, -FI_EINVAL if offset is out of range
*/
static inline
int ofi_iov_locate(struct iovec *iov, int iov_count, size_t offset,
int *iov_idx, size_t *iov_offset)
{
int i;
size_t curoffset;
if (iov_count == 1) {
if (offset >= iov[0].iov_len)
return -FI_EINVAL;
*iov_idx = 0;
*iov_offset = offset;
return 0;
}
curoffset = 0;
for (i = 0; i < iov_count; ++i) {
if (offset >= curoffset &&
offset < curoffset + iov[i].iov_len) {
*iov_idx = i;
*iov_offset = offset - curoffset;
return 0;
}
curoffset += iov[i].iov_len;
}
return -FI_EINVAL;
}
/* for a given offset, find the rma_iov_index and rma_iov_offset.
* return 0 on success, -FI_EINVAL if offset is out of range
*/
static inline
int ofi_rma_iov_locate(struct fi_rma_iov *rma_iov,
int rma_iov_count, size_t offset,
int *rma_iov_idx, size_t *rma_iov_offset)
{
int i;
size_t curoffset;
if (rma_iov_count == 1) {
if (offset >= rma_iov[0].len)
return -FI_EINVAL;
*rma_iov_idx = 0;
*rma_iov_offset = offset;
return 0;
}
curoffset = 0;
for (i = 0; i < rma_iov_count; ++i) {
if (offset >= curoffset &&
offset < curoffset + rma_iov[i].len) {
*rma_iov_idx = i;
*rma_iov_offset = offset - curoffset;
return 0;
}
curoffset += rma_iov[i].len;
}
return -FI_EINVAL;
}
#endif /* _OFI_IOV_H_ */
|