mirror of
https://github.com/curl/curl.git
synced 2026-05-14 14:46:21 +03:00
657aae79c0
With a meta_hash at each connection (similar to easy handle, let multi_ev.c store its pollsets as meta data, no longer needing its own hashes. This eliminates the last use of Curl_hash_offt. Remove it. Closes #17095
87 lines
2.5 KiB
C
87 lines
2.5 KiB
C
/***************************************************************************
|
|
* _ _ ____ _
|
|
* Project ___| | | | _ \| |
|
|
* / __| | | | |_) | |
|
|
* | (__| |_| | _ <| |___
|
|
* \___|\___/|_| \_\_____|
|
|
*
|
|
* Copyright (C) Daniel Stenberg, <daniel@haxx.se>, et al.
|
|
*
|
|
* This software is licensed as described in the file COPYING, which
|
|
* you should have received as part of this distribution. The terms
|
|
* are also available at https://curl.se/docs/copyright.html.
|
|
*
|
|
* You may opt to use, copy, modify, merge, publish, distribute and/or sell
|
|
* copies of the Software, and permit persons to whom the Software is
|
|
* furnished to do so, under the terms of the COPYING file.
|
|
*
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
* KIND, either express or implied.
|
|
*
|
|
* SPDX-License-Identifier: curl
|
|
*
|
|
***************************************************************************/
|
|
#include "curlcheck.h"
|
|
|
|
#include "curlx.h"
|
|
|
|
#include "uint-hash.h"
|
|
|
|
#include "memdebug.h" /* LAST include file */
|
|
|
|
static struct uint_hash hash_static;
|
|
|
|
static void mydtor(unsigned int id, void *elem)
|
|
{
|
|
int *ptr = (int *)elem;
|
|
(void)id;
|
|
free(ptr);
|
|
}
|
|
|
|
static CURLcode unit_setup(void)
|
|
{
|
|
Curl_uint_hash_init(&hash_static, 15, mydtor);
|
|
return CURLE_OK;
|
|
}
|
|
|
|
static void unit_stop(void)
|
|
{
|
|
Curl_uint_hash_destroy(&hash_static);
|
|
}
|
|
|
|
UNITTEST_START
|
|
int *value, *v;
|
|
int *value2;
|
|
bool ok;
|
|
|
|
unsigned int key = 20;
|
|
unsigned int key2 = 25;
|
|
|
|
|
|
value = malloc(sizeof(int));
|
|
abort_unless(value != NULL, "Out of memory");
|
|
*value = 199;
|
|
ok = Curl_uint_hash_set(&hash_static, key, value);
|
|
if(!ok)
|
|
free(value);
|
|
abort_unless(ok, "insertion into hash failed");
|
|
v = Curl_uint_hash_get(&hash_static, key);
|
|
abort_unless(v == value, "lookup present entry failed");
|
|
v = Curl_uint_hash_get(&hash_static, key2);
|
|
abort_unless(!v, "lookup missing entry failed");
|
|
Curl_uint_hash_clear(&hash_static);
|
|
|
|
/* Attempt to add another key/value pair */
|
|
value2 = malloc(sizeof(int));
|
|
abort_unless(value2 != NULL, "Out of memory");
|
|
*value2 = 204;
|
|
ok = Curl_uint_hash_set(&hash_static, key2, value2);
|
|
if(!ok)
|
|
free(value2);
|
|
abort_unless(ok, "insertion into hash failed");
|
|
v = Curl_uint_hash_get(&hash_static, key2);
|
|
abort_unless(v == value2, "lookup present entry failed");
|
|
v = Curl_uint_hash_get(&hash_static, key);
|
|
abort_unless(!v, "lookup missing entry failed");
|
|
|
|
UNITTEST_STOP
|