/* * Utilities. */ /* * Copyright © 2016-2018 The TokTok team. * Copyright © 2013 Tox project. * Copyright © 2013 plutooo * * This file is part of Tox, the free peer to peer instant messenger. * This file is donated to the Tox Project. * * Tox is free software: you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation, either version 3 of the License, or * (at your option) any later version. * * Tox is distributed in the hope that it will be useful, * but WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the * GNU General Public License for more details. * * You should have received a copy of the GNU General Public License * along with Tox. If not, see . */ #ifdef HAVE_CONFIG_H #include "config.h" #endif #ifndef _XOPEN_SOURCE #define _XOPEN_SOURCE 600 #endif #include "util.h" #include "crypto_core.h" /* for CRYPTO_PUBLIC_KEY_SIZE */ #include #include #include /* id functions */ bool id_equal(const uint8_t *dest, const uint8_t *src) { return public_key_cmp(dest, src) == 0; } uint32_t id_copy(uint8_t *dest, const uint8_t *src) { memcpy(dest, src, CRYPTO_PUBLIC_KEY_SIZE); return CRYPTO_PUBLIC_KEY_SIZE; } void host_to_net(uint8_t *num, uint16_t numbytes) { #ifndef WORDS_BIGENDIAN uint32_t i; VLA(uint8_t, buff, numbytes); for (i = 0; i < numbytes; ++i) { buff[i] = num[numbytes - i - 1]; } memcpy(num, buff, numbytes); #endif } void net_to_host(uint8_t *num, uint16_t numbytes) { host_to_net(num, numbytes); } int create_recursive_mutex(pthread_mutex_t *mutex) { pthread_mutexattr_t attr; if (pthread_mutexattr_init(&attr) != 0) { return -1; } if (pthread_mutexattr_settype(&attr, PTHREAD_MUTEX_RECURSIVE) != 0) { pthread_mutexattr_destroy(&attr); return -1; } /* Create queue mutex */ if (pthread_mutex_init(mutex, &attr) != 0) { pthread_mutexattr_destroy(&attr); return -1; } pthread_mutexattr_destroy(&attr); return 0; } int16_t max_s16(int16_t a, int16_t b) { return a > b ? a : b; } int32_t max_s32(int32_t a, int32_t b) { return a > b ? a : b; } int64_t max_s64(int64_t a, int64_t b) { return a > b ? a : b; } int16_t min_s16(int16_t a, int16_t b) { return a < b ? a : b; } int32_t min_s32(int32_t a, int32_t b) { return a < b ? a : b; } int64_t min_s64(int64_t a, int64_t b) { return a < b ? a : b; } uint16_t max_u16(uint16_t a, uint16_t b) { return a > b ? a : b; } uint32_t max_u32(uint32_t a, uint32_t b) { return a > b ? a : b; } uint64_t max_u64(uint64_t a, uint64_t b) { return a > b ? a : b; } uint16_t min_u16(uint16_t a, uint16_t b) { return a < b ? a : b; } uint32_t min_u32(uint32_t a, uint32_t b) { return a < b ? a : b; } uint64_t min_u64(uint64_t a, uint64_t b) { return a < b ? a : b; }