mirror of
https://github.com/hermitcore/libhermit.git
synced 2025-03-30 00:00:15 +01:00
163 lines
3.9 KiB
C
163 lines
3.9 KiB
C
/*
|
|
* Copyright (c) 2005-2006,2012 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
|
|
* OpenIB.org 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.
|
|
*
|
|
* $Id$
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <stdio.h>
|
|
#include <errno.h>
|
|
#include <sys/types.h>
|
|
#include <sys/socket.h>
|
|
#include <netdb.h>
|
|
|
|
#include <rdma/rdma_cma.h>
|
|
#include "common.h"
|
|
|
|
int use_rs = 1;
|
|
|
|
int get_rdma_addr(const char *src, const char *dst, const char *port,
|
|
struct rdma_addrinfo *hints, struct rdma_addrinfo **rai)
|
|
{
|
|
struct rdma_addrinfo rai_hints, *res;
|
|
int ret;
|
|
|
|
if (hints->ai_flags & RAI_PASSIVE)
|
|
return rdma_getaddrinfo(src, port, hints, rai);
|
|
|
|
rai_hints = *hints;
|
|
if (src) {
|
|
rai_hints.ai_flags |= RAI_PASSIVE;
|
|
ret = rdma_getaddrinfo(src, NULL, &rai_hints, &res);
|
|
if (ret)
|
|
return ret;
|
|
|
|
rai_hints.ai_src_addr = res->ai_src_addr;
|
|
rai_hints.ai_src_len = res->ai_src_len;
|
|
rai_hints.ai_flags &= ~RAI_PASSIVE;
|
|
}
|
|
|
|
ret = rdma_getaddrinfo(dst, port, &rai_hints, rai);
|
|
if (src)
|
|
rdma_freeaddrinfo(res);
|
|
|
|
return ret;
|
|
}
|
|
|
|
void size_str(char *str, size_t ssize, long long size)
|
|
{
|
|
long long base, fraction = 0;
|
|
char mag;
|
|
|
|
if (size >= (1 << 30)) {
|
|
base = 1 << 30;
|
|
mag = 'g';
|
|
} else if (size >= (1 << 20)) {
|
|
base = 1 << 20;
|
|
mag = 'm';
|
|
} else if (size >= (1 << 10)) {
|
|
base = 1 << 10;
|
|
mag = 'k';
|
|
} else {
|
|
base = 1;
|
|
mag = '\0';
|
|
}
|
|
|
|
if (size / base < 10)
|
|
fraction = (size % base) * 10 / base;
|
|
if (fraction) {
|
|
snprintf(str, ssize, "%lld.%lld%c", size / base, fraction, mag);
|
|
} else {
|
|
snprintf(str, ssize, "%lld%c", size / base, mag);
|
|
}
|
|
}
|
|
|
|
void cnt_str(char *str, size_t ssize, long long cnt)
|
|
{
|
|
if (cnt >= 1000000000)
|
|
snprintf(str, ssize, "%lldb", cnt / 1000000000);
|
|
else if (cnt >= 1000000)
|
|
snprintf(str, ssize, "%lldm", cnt / 1000000);
|
|
else if (cnt >= 1000)
|
|
snprintf(str, ssize, "%lldk", cnt / 1000);
|
|
else
|
|
snprintf(str, ssize, "%lld", cnt);
|
|
}
|
|
|
|
int size_to_count(int size)
|
|
{
|
|
if (size >= (1 << 20))
|
|
return 100;
|
|
else if (size >= (1 << 16))
|
|
return 1000;
|
|
else if (size >= (1 << 10))
|
|
return 10000;
|
|
else
|
|
return 100000;
|
|
}
|
|
|
|
void format_buf(void *buf, int size)
|
|
{
|
|
uint8_t *array = buf;
|
|
static uint8_t data;
|
|
int i;
|
|
|
|
for (i = 0; i < size; i++)
|
|
array[i] = data++;
|
|
}
|
|
|
|
int verify_buf(void *buf, int size)
|
|
{
|
|
static long long total_bytes;
|
|
uint8_t *array = buf;
|
|
static uint8_t data;
|
|
int i;
|
|
|
|
for (i = 0; i < size; i++, total_bytes++) {
|
|
if (array[i] != data++) {
|
|
printf("data verification failed byte %lld\n", total_bytes);
|
|
return -1;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int do_poll(struct pollfd *fds, int timeout)
|
|
{
|
|
int ret;
|
|
|
|
do {
|
|
ret = rs_poll(fds, 1, timeout);
|
|
} while (!ret);
|
|
|
|
return ret == 1 ? (fds->revents & (POLLERR | POLLHUP)) : ret;
|
|
}
|