003 File Manager
Current Path:
/usr/src/lib/libc/stdlib
usr
/
src
/
lib
/
libc
/
stdlib
/
📁
..
📄
Makefile.inc
(2.73 KB)
📄
Symbol.map
(1.38 KB)
📄
_Exit.c
(529 B)
📄
a64l.3
(4.79 KB)
📄
a64l.c
(846 B)
📄
abort.3
(2.55 KB)
📄
abort.c
(2.76 KB)
📄
abs.3
(2.36 KB)
📄
abs.c
(1.84 KB)
📄
alloca.3
(2.8 KB)
📄
at_quick_exit.3
(2.12 KB)
📄
atexit.3
(3.25 KB)
📄
atexit.c
(6.73 KB)
📄
atexit.h
(1.76 KB)
📄
atof.3
(2.77 KB)
📄
atof.c
(2.17 KB)
📄
atoi.3
(2.59 KB)
📄
atoi.c
(2.16 KB)
📄
atol.3
(3.16 KB)
📄
atol.c
(2.17 KB)
📄
atoll.c
(2.05 KB)
📄
bsearch.3
(4.53 KB)
📄
bsearch.c
(3.35 KB)
📄
bsearch_b.c
(1.38 KB)
📄
cxa_thread_atexit.c
(1.67 KB)
📄
cxa_thread_atexit_impl.c
(4.63 KB)
📄
div.3
(2.22 KB)
📄
div.c
(3 KB)
📄
exit.3
(3.66 KB)
📄
exit.c
(2.72 KB)
📄
getenv.3
(5.32 KB)
📄
getenv.c
(17.03 KB)
📄
getopt.3
(7.57 KB)
📄
getopt.c
(4.22 KB)
📄
getopt_long.3
(11.45 KB)
📄
getopt_long.c
(16.41 KB)
📄
getsubopt.3
(3.98 KB)
📄
getsubopt.c
(3.13 KB)
📄
hcreate.3
(7.04 KB)
📄
hcreate.c
(2.23 KB)
📄
hcreate_r.c
(2.27 KB)
📄
hdestroy_r.c
(1.6 KB)
📄
heapsort.c
(6.63 KB)
📄
heapsort_b.c
(1.38 KB)
📄
hsearch.h
(1.63 KB)
📄
hsearch_r.c
(4.36 KB)
📄
imaxabs.3
(1.92 KB)
📄
imaxabs.c
(1.52 KB)
📄
imaxdiv.3
(2.09 KB)
📄
imaxdiv.c
(1.81 KB)
📄
insque.3
(1.13 KB)
📄
insque.c
(925 B)
📁
jemalloc
📄
l64a.c
(726 B)
📄
labs.3
(2.28 KB)
📄
labs.c
(1.85 KB)
📄
ldiv.3
(2.34 KB)
📄
ldiv.c
(2.17 KB)
📄
llabs.3
(1.91 KB)
📄
llabs.c
(1.52 KB)
📄
lldiv.3
(2.08 KB)
📄
lldiv.c
(1.8 KB)
📄
lsearch.3
(2.9 KB)
📄
lsearch.c
(1.47 KB)
📄
memory.3
(2.48 KB)
📄
merge.c
(9.27 KB)
📄
mergesort_b.c
(1.38 KB)
📄
ptsname.3
(4.64 KB)
📄
ptsname.c
(3.29 KB)
📄
qsort.3
(9.67 KB)
📄
qsort.c
(6.32 KB)
📄
qsort_r.c
(430 B)
📄
qsort_s.c
(147 B)
📄
quick_exit.3
(2.13 KB)
📄
quick_exit.c
(2.53 KB)
📄
radixsort.3
(4.35 KB)
📄
radixsort.c
(7.89 KB)
📄
rand.3
(4.31 KB)
📄
rand.c
(4.58 KB)
📄
random.3
(5.11 KB)
📄
random.c
(17.58 KB)
📄
random.h
(2.91 KB)
📄
reallocarray.3
(3.75 KB)
📄
reallocarray.c
(1.38 KB)
📄
reallocf.3
(2.72 KB)
📄
reallocf.c
(1.83 KB)
📄
realpath.3
(3.73 KB)
📄
realpath.c
(6.32 KB)
📄
remque.c
(581 B)
📄
set_constraint_handler_s.3
(3.96 KB)
📄
set_constraint_handler_s.c
(2.91 KB)
📄
strfmon.3
(4.83 KB)
📄
strfmon.c
(16.2 KB)
📄
strtod.3
(5.87 KB)
📄
strtoimax.c
(4.77 KB)
📄
strtol.3
(5.26 KB)
📄
strtol.c
(4.7 KB)
📄
strtold.c
(1.71 KB)
📄
strtoll.c
(4.77 KB)
📄
strtonum.3
(3.45 KB)
📄
strtonum.c
(1.79 KB)
📄
strtoq.c
(1.97 KB)
📄
strtoul.3
(5.17 KB)
📄
strtoul.c
(3.72 KB)
📄
strtoull.c
(3.75 KB)
📄
strtoumax.c
(3.72 KB)
📄
strtouq.c
(1.98 KB)
📄
system.3
(3.09 KB)
📄
system.c
(3.8 KB)
📄
tdelete.c
(5.53 KB)
📄
tfind.c
(1.06 KB)
📄
tsearch.3
(5.43 KB)
📄
tsearch.c
(5.01 KB)
📄
tsearch_path.h
(2.8 KB)
📄
twalk.c
(1.18 KB)
Editing: tsearch_path.h
/*- * Copyright (c) 2015 Nuxi, https://nuxi.nl/ * * 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 AUTHOR 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 AUTHOR 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. * * $FreeBSD$ */ #ifndef TSEARCH_PATH_H #define TSEARCH_PATH_H #include <limits.h> #include <stdbool.h> #include <stdint.h> /* * Bookkeeping for storing a path in a balanced binary search tree from * the root to a leaf node. * * For an AVL tree we know that its maximum height of a tree is bounded * by approximately 1.44 * log2(n) - 0.328. Given that the number of * entries of the tree is constrained by the size of the address space, * two uintptr_t's provide sufficient space to store the path from the * root to any leaf. */ struct path { uintptr_t steps[2]; unsigned int nsteps; }; /* Initializes the path structure with a zero-length path. */ static inline void path_init(struct path *p) { p->nsteps = 0; } #define STEPS_BIT (sizeof(uintptr_t) * CHAR_BIT) /* Pushes a step to the left to the end of the path. */ static inline void path_taking_left(struct path *p) { p->steps[p->nsteps / STEPS_BIT] |= (uintptr_t)1 << (p->nsteps % STEPS_BIT); ++p->nsteps; } /* Pushes a step to the right to the end of the path. */ static inline void path_taking_right(struct path *p) { p->steps[p->nsteps / STEPS_BIT] &= ~((uintptr_t)1 << (p->nsteps % STEPS_BIT)); ++p->nsteps; } /* * Pops the first step from the path and returns whether it was a step * to the left. */ static inline bool path_took_left(struct path *p) { bool result; result = p->steps[0] & 0x1; p->steps[0] = (p->steps[0] >> 1) | (p->steps[1] << (STEPS_BIT - 1)); p->steps[1] >>= 1; return (result); } #undef STEPS_BIT #endif
Upload File
Create Folder