You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
99 lines
3.0 KiB
99 lines
3.0 KiB
10 years ago
|
.\"
|
||
|
|
.\" Copyright 2013 Samy Al Bahra.
|
||
|
|
.\" All rights reserved.
|
||
|
|
.\"
|
||
|
|
.\" Redistribution and use in source and binary forms, with or without
|
||
|
|
.\" modification, are permitted provided that the following conditions
|
||
|
|
.\" are met:
|
||
|
|
.\" 1. Redistributions of source code must retain the above copyright
|
||
|
|
.\" notice, this list of conditions and the following disclaimer.
|
||
|
|
.\" 2. 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.
|
||
|
|
.\"
|
||
|
|
.\" THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
||
|
|
.\" ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
||
|
|
.\" IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
||
|
|
.\" ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
||
|
|
.\" FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
||
|
|
.\" DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
||
|
|
.\" OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
||
|
|
.\" HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
||
|
|
.\" LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
||
|
|
.\" OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
||
|
|
.\" SUCH DAMAGE.
|
||
|
|
.\"
|
||
|
|
.\"
|
||
|
|
.Dd June 20, 2013
|
||
|
|
.Dt CK_RHS_FAS 3
|
||
|
|
.Sh NAME
|
||
|
|
.Nm ck_rhs_fas
|
||
|
|
.Nd fetch and store key in hash set
|
||
|
|
.Sh LIBRARY
|
||
|
|
Concurrency Kit (libck, \-lck)
|
||
|
|
.Sh SYNOPSIS
|
||
|
|
.In ck_rhs.h
|
||
|
|
.Ft bool
|
||
|
|
.Fn ck_rhs_fas "ck_rhs_t *hs" "unsigned long hash" "const void *key" "void **previous"
|
||
|
|
.Sh DESCRIPTION
|
||
|
|
The
|
||
|
|
.Fn ck_rhs_fas 3
|
||
|
|
function will fetch and store the key specified by the
|
||
|
|
.Fa key
|
||
|
|
argument in the hash set pointed to by the
|
||
|
|
.Fa hs
|
||
|
|
argument. The key specified by
|
||
|
|
.Fa key
|
||
|
|
is expected to have the hash value specified by the
|
||
|
|
.Fa hash
|
||
|
|
argument (which was previously generated using the
|
||
|
|
.Xr CK_RHS_HASH 3
|
||
|
|
macro).
|
||
|
|
.Pp
|
||
|
|
If the call to
|
||
|
|
.Fn ck_rhs_fas 3
|
||
|
|
was successful then the key specified by
|
||
|
|
.Fa key
|
||
|
|
was successfully stored in the hash set pointed to by
|
||
|
|
.Fa hs .
|
||
|
|
The key must already exist in the hash set, and is
|
||
|
|
replaced by
|
||
|
|
.Fa key
|
||
|
|
and the previous value is stored into the void pointer
|
||
|
|
pointed to by the
|
||
|
|
.Fa previous
|
||
|
|
argument. If the key does not exist in the hash set
|
||
|
|
then the function will return false and the hash set
|
||
|
|
is unchanged. This function
|
||
|
|
is guaranteed to be stable with respect to memory usage.
|
||
|
|
.Sh RETURN VALUES
|
||
|
|
Upon successful completion,
|
||
|
|
.Fn ck_rhs_fas 3
|
||
|
|
returns true and otherwise returns false on failure.
|
||
|
|
.Sh ERRORS
|
||
|
|
Behavior is undefined if
|
||
|
|
.Fa key
|
||
|
|
or
|
||
|
|
.Fa hs
|
||
|
|
are uninitialized.
|
||
|
|
.Sh SEE ALSO
|
||
|
|
.Xr ck_rhs_init 3 ,
|
||
|
|
.Xr ck_rhs_move 3 ,
|
||
|
|
.Xr ck_rhs_destroy 3 ,
|
||
|
|
.Xr CK_RHS_HASH 3 ,
|
||
|
|
.Xr ck_rhs_iterator_init 3 ,
|
||
|
|
.Xr ck_rhs_next 3 ,
|
||
|
|
.Xr ck_rhs_get 3 ,
|
||
|
|
.Xr ck_rhs_put 3 ,
|
||
|
|
.Xr ck_rhs_put_unique 3 ,
|
||
|
|
.Xr ck_rhs_remove 3 ,
|
||
|
|
.Xr ck_rhs_grow 3 ,
|
||
|
|
.Xr ck_rhs_rebuild 3 ,
|
||
|
|
.Xr ck_rhs_gc 3 ,
|
||
|
|
.Xr ck_rhs_count 3 ,
|
||
|
|
.Xr ck_rhs_reset 3 ,
|
||
|
|
.Xr ck_rhs_reset_size 3 ,
|
||
|
|
.Xr ck_rhs_stat 3
|
||
|
|
.Pp
|
||
|
|
Additional information available at http://concurrencykit.org/
|