NineSec Team Shell

/* obstack.h - object stack macros Copyright (C) 1988-2020 Free Software Foundation, Inc. This file is part of the GNU C Library. The GNU C Library is free software; you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation; either version 2.1 of the License, or (at your option) any later version. The GNU C Library 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 Lesser General Public License for more details. You should have received a copy of the GNU Lesser General Public License along with the GNU C Library; if not, see <https://www.gnu.org/licenses/>. */ /* Summary: All the apparent functions defined here are macros. The idea is that you would use these pre-tested macros to solve a very specific set of problems, and they would run fast. Caution: no side-effects in arguments please!! They may be evaluated MANY times!! These macros operate a stack of objects. Each object starts life small, and may grow to maturity. (Consider building a word syllable by syllable.) An object can move while it is growing. Once it has been "finished" it never changes address again. So the "top of the stack" is typically an immature growing object, while the rest of the stack is of mature, fixed size and fixed address objects. These routines grab large chunks of memory, using a function you supply, called 'obstack_chunk_alloc'. On occasion, they free chunks, by calling 'obstack_chunk_free'. You must define them and declare them before using any obstack macros. Each independent stack is represented by a 'struct obstack'. Each of the obstack macros expects a pointer to such a structure as the first argument. One motivation for this package is the problem of growing char strings in symbol tables. Unless you are "fascist pig with a read-only mind" --Gosper's immortal quote from HAKMEM item 154, out of context--you would not like to put any arbitrary upper limit on the length of your symbols. In practice this often means you will build many short symbols and a few long symbols. At the time you are reading a symbol you don't know how long it is. One traditional method is to read a symbol into a buffer, realloc()ating the buffer every time you try to read a symbol that is longer than the buffer. This is beaut, but you still will want to copy the symbol from the buffer to a more permanent symbol-table entry say about half the time. With obstacks, you can work differently. Use one obstack for all symbol names. As you read a symbol, grow the name in the obstack gradually. When the name is complete, finalize it. Then, if the symbol exists already, free the newly read name. The way we do this is to take a large chunk, allocating memory from low addresses. When you want to build a symbol in the chunk you just add chars above the current "high water mark" in the chunk. When you have finished adding chars, because you got to the end of the symbol, you know how long the chars are, and you can create a new object. Mostly the chars will not burst over the highest address of the chunk, because you would typically expect a chunk to be (say) 100 times as long as an average object. In case that isn't clear, when we have enough chars to make up the object, THEY ARE ALREADY CONTIGUOUS IN THE CHUNK (guaranteed) so we just point to it where it lies. No moving of chars is needed and this is the second win: potentially long strings need never be explicitly shuffled. Once an object is formed, it does not change its address during its lifetime. When the chars burst over a chunk boundary, we allocate a larger chunk, and then copy the partly formed object from the end of the old chunk to the beginning of the new larger chunk. We then carry on accreting characters to the end of the object as we normally would. A special macro is provided to add a single char at a time to a growing object. This allows the use of register variables, which break the ordinary 'growth' macro. Summary: We allocate large chunks. We carve out one object at a time from the current chunk. Once carved, an object never moves. We are free to append data of any size to the currently growing object. Exactly one object is growing in an obstack at any one time. You can run one obstack per control block. You may have as many control blocks as you dare. Because of the way we do it, you can "unwind" an obstack back to a previous state. (You may remove objects much as you would with a stack.) */ /* Don't do the contents of this file more than once. */ #ifndef _OBSTACK_H #define _OBSTACK_H 1 /* We need the type of a pointer subtraction. If __PTRDIFF_TYPE__ is defined, as with GNU C, use that; that way we don't pollute the namespace with <stddef.h>'s symbols. Otherwise, include <stddef.h> and use ptrdiff_t. */ #ifdef __PTRDIFF_TYPE__ # define PTR_INT_TYPE __PTRDIFF_TYPE__ #else # include <stddef.h> # define PTR_INT_TYPE ptrdiff_t #endif /* If B is the base of an object addressed by P, return the result of aligning P to the next multiple of A + 1. B and P must be of type char *. A + 1 must be a power of 2. */ #define __BPTR_ALIGN(B, P, A) ((B) + (((P) - (B) + (A)) & ~(A))) /* Similar to _BPTR_ALIGN (B, P, A), except optimize the common case where pointers can be converted to integers, aligned as integers, and converted back again. If PTR_INT_TYPE is narrower than a pointer (e.g., the AS/400), play it safe and compute the alignment relative to B. Otherwise, use the faster strategy of computing the alignment relative to 0. */ #define __PTR_ALIGN(B, P, A) \ __BPTR_ALIGN (sizeof (PTR_INT_TYPE) < sizeof (void *) ? (B) : (char *) 0, \ P, A) #include <string.h> #ifndef __attribute_pure__ # define __attribute_pure__ _GL_ATTRIBUTE_PURE #endif #ifdef __cplusplus extern "C" { #endif struct _obstack_chunk /* Lives at front of each chunk. */ { char *limit; /* 1 past end of this chunk */ struct _obstack_chunk *prev; /* address of prior chunk or NULL */ char contents[4]; /* objects begin here */ }; struct obstack /* control current object in current chunk */ { long chunk_size; /* preferred size to allocate chunks in */ struct _obstack_chunk *chunk; /* address of current struct obstack_chunk */ char *object_base; /* address of object we are building */ char *next_free; /* where to add next char to current object */ char *chunk_limit; /* address of char after current chunk */ union { PTR_INT_TYPE tempint; void *tempptr; } temp; /* Temporary for some macros. */ int alignment_mask; /* Mask of alignment for each object. */ /* These prototypes vary based on 'use_extra_arg', and we use casts to the prototypeless function type in all assignments, but having prototypes here quiets -Wstrict-prototypes. */ struct _obstack_chunk *(*chunkfun) (void *, long); void (*freefun) (void *, struct _obstack_chunk *); void *extra_arg; /* first arg for chunk alloc/dealloc funcs */ unsigned use_extra_arg : 1; /* chunk alloc/dealloc funcs take extra arg */ unsigned maybe_empty_object : 1; /* There is a possibility that the current chunk contains a zero-length object. This prevents freeing the chunk if we allocate a bigger chunk to replace it. */ unsigned alloc_failed : 1; /* No longer used, as we now call the failed handler on error, but retained for binary compatibility. */ }; /* Declare the external functions we use; they are in obstack.c. */ extern void _obstack_newchunk (struct obstack *, int); extern int _obstack_begin (struct obstack *, int, int, void *(*)(long), void (*)(void *)); extern int _obstack_begin_1 (struct obstack *, int, int, void *(*)(void *, long), void (*)(void *, void *), void *); extern int _obstack_memory_used (struct obstack *) __attribute_pure__; /* The default name of the function for freeing a chunk is 'obstack_free', but gnulib users can override this by defining '__obstack_free'. */ #ifndef __obstack_free # define __obstack_free obstack_free #endif extern void __obstack_free (struct obstack *, void *); /* Error handler called when 'obstack_chunk_alloc' failed to allocate more memory. This can be set to a user defined function which should either abort gracefully or use longjump - but shouldn't return. The default action is to print a message and abort. */ extern void (*obstack_alloc_failed_handler) (void); /* Exit value used when 'print_and_abort' is used. */ extern int obstack_exit_failure; /* Pointer to beginning of object being allocated or to be allocated next. Note that this might not be the final address of the object because a new chunk might be needed to hold the final size. */ #define obstack_base(h) ((void *) (h)->object_base) /* Size for allocating ordinary chunks. */ #define obstack_chunk_size(h) ((h)->chunk_size) /* Pointer to next byte not yet allocated in current chunk. */ #define obstack_next_free(h) ((h)->next_free) /* Mask specifying low bits that should be clear in address of an object. */ #define obstack_alignment_mask(h) ((h)->alignment_mask) /* To prevent prototype warnings provide complete argument list. */ #define obstack_init(h) \ _obstack_begin ((h), 0, 0, \ (void *(*)(long))obstack_chunk_alloc, \ (void (*)(void *))obstack_chunk_free) #define obstack_begin(h, size) \ _obstack_begin ((h), (size), 0, \ (void *(*)(long))obstack_chunk_alloc, \ (void (*)(void *))obstack_chunk_free) #define obstack_specify_allocation(h, size, alignment, chunkfun, freefun) \ _obstack_begin ((h), (size), (alignment), \ (void *(*)(long))(chunkfun), \ (void (*)(void *))(freefun)) #define obstack_specify_allocation_with_arg(h, size, alignment, chunkfun, freefun, arg) \ _obstack_begin_1 ((h), (size), (alignment), \ (void *(*)(void *, long))(chunkfun), \ (void (*)(void *, void *))(freefun), (arg)) #define obstack_chunkfun(h, newchunkfun) \ ((h)->chunkfun = (struct _obstack_chunk *(*)(void *, long))(newchunkfun)) #define obstack_freefun(h, newfreefun) \ ((h)->freefun = (void (*)(void *, struct _obstack_chunk *))(newfreefun)) #define obstack_1grow_fast(h, achar) (*((h)->next_free)++ = (achar)) #define obstack_blank_fast(h, n) ((h)->next_free += (n)) #define obstack_memory_used(h) _obstack_memory_used (h) #if defined __GNUC__ # if ! (2 < __GNUC__ + (8 <= __GNUC_MINOR__)) # define __extension__ # endif /* For GNU C, if not -traditional, we can define these macros to compute all args only once without using a global variable. Also, we can avoid using the 'temp' slot, to make faster code. */ # define obstack_object_size(OBSTACK) \ __extension__ \ ({ struct obstack const *__o = (OBSTACK); \ (unsigned) (__o->next_free - __o->object_base); }) # define obstack_room(OBSTACK) \ __extension__ \ ({ struct obstack const *__o = (OBSTACK); \ (unsigned) (__o->chunk_limit - __o->next_free); }) # define obstack_make_room(OBSTACK, length) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ int __len = (length); \ if (__o->chunk_limit - __o->next_free < __len) \ _obstack_newchunk (__o, __len); \ (void) 0; }) # define obstack_empty_p(OBSTACK) \ __extension__ \ ({ struct obstack const *__o = (OBSTACK); \ (__o->chunk->prev == 0 \ && __o->next_free == __PTR_ALIGN ((char *) __o->chunk, \ __o->chunk->contents, \ __o->alignment_mask)); }) # define obstack_grow(OBSTACK, where, length) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ int __len = (length); \ if (__o->next_free + __len > __o->chunk_limit) \ _obstack_newchunk (__o, __len); \ memcpy (__o->next_free, where, __len); \ __o->next_free += __len; \ (void) 0; }) # define obstack_grow0(OBSTACK, where, length) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ int __len = (length); \ if (__o->next_free + __len + 1 > __o->chunk_limit) \ _obstack_newchunk (__o, __len + 1); \ memcpy (__o->next_free, where, __len); \ __o->next_free += __len; \ *(__o->next_free)++ = 0; \ (void) 0; }) # define obstack_1grow(OBSTACK, datum) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ if (__o->next_free + 1 > __o->chunk_limit) \ _obstack_newchunk (__o, 1); \ obstack_1grow_fast (__o, datum); \ (void) 0; }) /* These assume that the obstack alignment is good enough for pointers or ints, and that the data added so far to the current object shares that much alignment. */ # define obstack_ptr_grow(OBSTACK, datum) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ if (__o->next_free + sizeof (void *) > __o->chunk_limit) \ _obstack_newchunk (__o, sizeof (void *)); \ obstack_ptr_grow_fast (__o, datum); }) \ # define obstack_int_grow(OBSTACK, datum) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ if (__o->next_free + sizeof (int) > __o->chunk_limit) \ _obstack_newchunk (__o, sizeof (int)); \ obstack_int_grow_fast (__o, datum); }) # define obstack_ptr_grow_fast(OBSTACK, aptr) \ __extension__ \ ({ struct obstack *__o1 = (OBSTACK); \ void *__p1 = __o1->next_free; \ *(const void **) __p1 = (aptr); \ __o1->next_free += sizeof (const void *); \ (void) 0; }) # define obstack_int_grow_fast(OBSTACK, aint) \ __extension__ \ ({ struct obstack *__o1 = (OBSTACK); \ void *__p1 = __o1->next_free; \ *(int *) __p1 = (aint); \ __o1->next_free += sizeof (int); \ (void) 0; }) # define obstack_blank(OBSTACK, length) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ int __len = (length); \ if (__o->chunk_limit - __o->next_free < __len) \ _obstack_newchunk (__o, __len); \ obstack_blank_fast (__o, __len); \ (void) 0; }) # define obstack_alloc(OBSTACK, length) \ __extension__ \ ({ struct obstack *__h = (OBSTACK); \ obstack_blank (__h, (length)); \ obstack_finish (__h); }) # define obstack_copy(OBSTACK, where, length) \ __extension__ \ ({ struct obstack *__h = (OBSTACK); \ obstack_grow (__h, (where), (length)); \ obstack_finish (__h); }) # define obstack_copy0(OBSTACK, where, length) \ __extension__ \ ({ struct obstack *__h = (OBSTACK); \ obstack_grow0 (__h, (where), (length)); \ obstack_finish (__h); }) /* The local variable is named __o1 to avoid a name conflict when obstack_blank is called. */ # define obstack_finish(OBSTACK) \ __extension__ \ ({ struct obstack *__o1 = (OBSTACK); \ void *__value = (void *) __o1->object_base; \ if (__o1->next_free == __value) \ __o1->maybe_empty_object = 1; \ __o1->next_free \ = __PTR_ALIGN (__o1->object_base, __o1->next_free, \ __o1->alignment_mask); \ if (__o1->next_free - (char *) __o1->chunk \ > __o1->chunk_limit - (char *) __o1->chunk) \ __o1->next_free = __o1->chunk_limit; \ __o1->object_base = __o1->next_free; \ __value; }) # define obstack_free(OBSTACK, OBJ) \ __extension__ \ ({ struct obstack *__o = (OBSTACK); \ void *__obj = (OBJ); \ if (__obj > (void *) __o->chunk && __obj < (void *) __o->chunk_limit) \ __o->next_free = __o->object_base = (char *) __obj; \ else (__obstack_free) (__o, __obj); }) #else /* not __GNUC__ */ # define obstack_object_size(h) \ (unsigned) ((h)->next_free - (h)->object_base) # define obstack_room(h) \ (unsigned) ((h)->chunk_limit - (h)->next_free) # define obstack_empty_p(h) \ ((h)->chunk->prev == 0 \ && (h)->next_free == __PTR_ALIGN ((char *) (h)->chunk, \ (h)->chunk->contents, \ (h)->alignment_mask)) /* Note that the call to _obstack_newchunk is enclosed in (..., 0) so that we can avoid having void expressions in the arms of the conditional expression. Casting the third operand to void was tried before, but some compilers won't accept it. */ # define obstack_make_room(h, length) \ ((h)->temp.tempint = (length), \ (((h)->next_free + (h)->temp.tempint > (h)->chunk_limit) \ ? (_obstack_newchunk ((h), (h)->temp.tempint), 0) : 0)) # define obstack_grow(h, where, length) \ ((h)->temp.tempint = (length), \ (((h)->next_free + (h)->temp.tempint > (h)->chunk_limit) \ ? (_obstack_newchunk ((h), (h)->temp.tempint), 0) : 0), \ memcpy ((h)->next_free, where, (h)->temp.tempint), \ (h)->next_free += (h)->temp.tempint) # define obstack_grow0(h, where, length) \ ((h)->temp.tempint = (length), \ (((h)->next_free + (h)->temp.tempint + 1 > (h)->chunk_limit) \ ? (_obstack_newchunk ((h), (h)->temp.tempint + 1), 0) : 0), \ memcpy ((h)->next_free, where, (h)->temp.tempint), \ (h)->next_free += (h)->temp.tempint, \ *((h)->next_free)++ = 0) # define obstack_1grow(h, datum) \ ((((h)->next_free + 1 > (h)->chunk_limit) \ ? (_obstack_newchunk ((h), 1), 0) : 0), \ obstack_1grow_fast (h, datum)) # define obstack_ptr_grow(h, datum) \ ((((h)->next_free + sizeof (char *) > (h)->chunk_limit) \ ? (_obstack_newchunk ((h), sizeof (char *)), 0) : 0), \ obstack_ptr_grow_fast (h, datum)) # define obstack_int_grow(h, datum) \ ((((h)->next_free + sizeof (int) > (h)->chunk_limit) \ ? (_obstack_newchunk ((h), sizeof (int)), 0) : 0), \ obstack_int_grow_fast (h, datum)) # define obstack_ptr_grow_fast(h, aptr) \ (((const void **) ((h)->next_free += sizeof (void *)))[-1] = (aptr)) # define obstack_int_grow_fast(h, aint) \ (((int *) ((h)->next_free += sizeof (int)))[-1] = (aint)) # define obstack_blank(h, length) \ ((h)->temp.tempint = (length), \ (((h)->chunk_limit - (h)->next_free < (h)->temp.tempint) \ ? (_obstack_newchunk ((h), (h)->temp.tempint), 0) : 0), \ obstack_blank_fast (h, (h)->temp.tempint)) # define obstack_alloc(h, length) \ (obstack_blank ((h), (length)), obstack_finish ((h))) # define obstack_copy(h, where, length) \ (obstack_grow ((h), (where), (length)), obstack_finish ((h))) # define obstack_copy0(h, where, length) \ (obstack_grow0 ((h), (where), (length)), obstack_finish ((h))) # define obstack_finish(h) \ (((h)->next_free == (h)->object_base \ ? (((h)->maybe_empty_object = 1), 0) \ : 0), \ (h)->temp.tempptr = (h)->object_base, \ (h)->next_free \ = __PTR_ALIGN ((h)->object_base, (h)->next_free, \ (h)->alignment_mask), \ (((h)->next_free - (char *) (h)->chunk \ > (h)->chunk_limit - (char *) (h)->chunk) \ ? ((h)->next_free = (h)->chunk_limit) : 0), \ (h)->object_base = (h)->next_free, \ (h)->temp.tempptr) # define obstack_free(h, obj) \ ((h)->temp.tempint = (char *) (obj) - (char *) (h)->chunk, \ ((((h)->temp.tempint > 0 \ && (h)->temp.tempint < (h)->chunk_limit - (char *) (h)->chunk)) \ ? (void) ((h)->next_free = (h)->object_base \ = (h)->temp.tempint + (char *) (h)->chunk) \ : (__obstack_free) (h, (h)->temp.tempint + (char *) (h)->chunk))) #endif /* not __GNUC__ */ #ifdef __cplusplus } /* C++ */ #endif #endif /* obstack.h */

Name	Size	Last Modified	Owner	Permissions	Options
..	--	March 29 2022 11:10:06	root	0755
X11	--	April 25 2020 3:53:29	root	0755
arpa	--	December 13 2023 9:42:27	root	0755
asm-generic	--	February 12 2024 9:08:13	root	0755
c++	--	April 08 2022 2:42:58	root	0755
drm	--	February 12 2024 9:08:13	root	0755
finclude	--	December 13 2023 9:42:27	root	0755
iproute2	--	April 25 2020 3:53:03	root	0755
linux	--	February 12 2024 9:08:13	root	0755
misc	--	February 12 2024 9:08:13	root	0755
mtd	--	February 12 2024 9:08:13	root	0755
net	--	December 13 2023 9:42:27	root	0755
netash	--	December 13 2023 9:42:27	root	0755
netatalk	--	December 13 2023 9:42:27	root	0755
netax25	--	December 13 2023 9:42:27	root	0755
neteconet	--	December 13 2023 9:42:27	root	0755
netinet	--	December 13 2023 9:42:27	root	0755
netipx	--	December 13 2023 9:42:27	root	0755
netiucv	--	December 13 2023 9:42:27	root	0755
netpacket	--	December 13 2023 9:42:27	root	0755
netrom	--	December 13 2023 9:42:27	root	0755
netrose	--	December 13 2023 9:42:27	root	0755
nfs	--	December 13 2023 9:42:27	root	0755
node	--	October 23 2023 6:29:41	root	0755
openssl	--	February 12 2024 9:07:13	root	0755
php	--	October 23 2023 10:09:35	root	0755
protocols	--	December 13 2023 9:42:27	root	0755
rdma	--	February 12 2024 9:08:13	root	0755
rpc	--	December 13 2023 9:42:27	root	0755
rpcsvc	--	December 13 2023 9:42:27	root	0755
scsi	--	February 12 2024 9:08:13	root	0755
sound	--	February 12 2024 9:08:13	root	0755
uv	--	April 12 2022 9:21:16	root	0755
video	--	February 12 2024 9:08:13	root	0755
x86_64-linux-gnu	--	December 13 2023 9:42:27	root	0755
xen	--	February 12 2024 9:08:13	root	0755

aio.h	7.282 KB	November 22 2023 2:32:50	root	0644
aliases.h	1.984 KB	November 22 2023 2:32:50	root	0644
alloca.h	1.176 KB	November 22 2023 2:32:50	root	0644
ar.h	1.69 KB	November 22 2023 2:32:50	root	0644
argp.h	24.876 KB	November 22 2023 2:32:50	root	0644
argz.h	5.909 KB	November 22 2023 2:32:50	root	0644
assert.h	4.534 KB	November 22 2023 2:32:50	root	0644
byteswap.h	1.372 KB	November 22 2023 2:32:50	root	0644
complex.h	6.996 KB	November 22 2023 2:32:50	root	0644
cpio.h	2.215 KB	November 22 2023 2:32:50	root	0644
crypt.h	10.898 KB	March 10 2020 5:24:31	root	0644
ctype.h	10.712 KB	November 22 2023 2:32:50	root	0644
dirent.h	12.222 KB	November 22 2023 2:32:50	root	0644
dlfcn.h	7.304 KB	November 22 2023 2:32:50	root	0644
elf.h	173.189 KB	November 22 2023 2:32:50	root	0644
endian.h	2.245 KB	November 22 2023 2:32:50	root	0644
envz.h	2.8 KB	November 22 2023 2:32:50	root	0644
err.h	2.214 KB	November 22 2023 2:32:50	root	0644
errno.h	1.64 KB	November 22 2023 2:32:50	root	0644
error.h	2.229 KB	November 22 2023 2:32:50	root	0644
execinfo.h	1.487 KB	November 22 2023 2:32:50	root	0644
fastcgi.h	2.899 KB	March 22 2020 4:45:46	root	0644
fcgi_config.h	3.877 KB	March 22 2020 4:45:46	root	0644
fcgi_stdio.h	5.647 KB	March 22 2020 4:45:46	root	0644
fcgiapp.h	18.146 KB	March 22 2020 4:45:46	root	0644
fcgimisc.h	0.623 KB	March 22 2020 4:45:46	root	0644
fcgio.h	3.633 KB	March 22 2020 4:45:46	root	0644
fcgios.h	3.421 KB	March 22 2020 4:45:46	root	0644
fcntl.h	9.482 KB	November 22 2023 2:32:50	root	0644
features.h	16.679 KB	November 22 2023 2:32:50	root	0644
fenv.h	5.736 KB	November 22 2023 2:32:50	root	0644
fmtmsg.h	3.164 KB	November 22 2023 2:32:50	root	0644
fnmatch.h	2.242 KB	November 22 2023 2:32:50	root	0644
fstab.h	3.038 KB	November 22 2023 2:32:50	root	0644
fts.h	8.177 KB	November 22 2023 2:32:50	root	0644
ftw.h	5.129 KB	November 22 2023 2:32:50	root	0644
gconv.h	4.112 KB	November 22 2023 2:32:50	root	0644
getopt.h	1.435 KB	November 22 2023 2:32:50	root	0644
glob.h	6.462 KB	November 22 2023 2:32:50	root	0644
gnu-versions.h	2.288 KB	November 22 2023 2:32:50	root	0644
gnumake.h	2.844 KB	July 28 2018 12:07:31	root	0644
grp.h	6.53 KB	November 22 2023 2:32:50	root	0644
gshadow.h	4.423 KB	November 22 2023 2:32:50	root	0644
iconv.h	1.814 KB	November 22 2023 2:32:50	root	0644
ifaddrs.h	2.774 KB	November 22 2023 2:32:50	root	0644
inttypes.h	11.614 KB	November 22 2023 2:32:50	root	0644
langinfo.h	17.431 KB	November 22 2023 2:32:50	root	0644
lastlog.h	0.123 KB	November 22 2023 2:32:50	root	0644
libgen.h	1.354 KB	November 22 2023 2:32:50	root	0644
libintl.h	4.473 KB	November 22 2023 2:32:50	root	0644
limits.h	5.29 KB	November 22 2023 2:32:50	root	0644
link.h	7.038 KB	November 22 2023 2:32:50	root	0644
locale.h	7.495 KB	November 22 2023 2:32:50	root	0644
malloc.h	6.041 KB	November 22 2023 2:32:50	root	0644
math.h	45.316 KB	November 22 2023 2:32:50	root	0644
mcheck.h	2.378 KB	November 22 2023 2:32:50	root	0644
memory.h	0.934 KB	November 22 2023 2:32:50	root	0644
mntent.h	3.28 KB	November 22 2023 2:32:50	root	0644
monetary.h	1.762 KB	November 22 2023 2:32:50	root	0644
mqueue.h	3.672 KB	November 22 2023 2:32:50	root	0644
netdb.h	27.441 KB	November 22 2023 2:32:50	root	0644
nl_types.h	1.712 KB	November 22 2023 2:32:50	root	0644
nss.h	1.835 KB	November 22 2023 2:32:50	root	0644
obstack.h	20.808 KB	November 22 2023 2:32:50	root	0644
paths.h	2.913 KB	November 22 2023 2:32:50	root	0644
poll.h	0.021 KB	November 22 2023 2:32:50	root	0644
printf.h	6.642 KB	November 22 2023 2:32:50	root	0644
proc_service.h	3.396 KB	November 22 2023 2:32:50	root	0644
pthread.h	40.724 KB	November 22 2023 2:32:50	root	0644
pty.h	1.533 KB	November 22 2023 2:32:50	root	0644
pwd.h	6.015 KB	November 22 2023 2:32:50	root	0644
re_comp.h	0.94 KB	November 22 2023 2:32:50	root	0644
regex.h	24.136 KB	November 22 2023 2:32:50	root	0644
regexp.h	1.414 KB	November 22 2023 2:32:50	root	0644
resolv.h	11.595 KB	November 22 2023 2:32:50	root	0644
sched.h	4.622 KB	November 22 2023 2:32:50	root	0644
search.h	5.322 KB	November 22 2023 2:32:50	root	0644
semaphore.h	2.671 KB	November 22 2023 2:32:50	root	0644
setjmp.h	3.584 KB	November 22 2023 2:32:50	root	0644
sgtty.h	1.313 KB	November 22 2023 2:32:50	root	0644
shadow.h	5.344 KB	November 22 2023 2:32:50	root	0644
signal.h	12.021 KB	November 22 2023 2:32:50	root	0644
spawn.h	7.576 KB	November 22 2023 2:32:50	root	0644
stab.h	0.258 KB	November 22 2023 2:32:50	root	0644
stdc-predef.h	2.236 KB	November 22 2023 2:32:50	root	0644
stdint.h	8.275 KB	November 22 2023 2:32:50	root	0644
stdio.h	29.248 KB	November 22 2023 2:32:50	root	0644
stdio_ext.h	2.734 KB	November 22 2023 2:32:50	root	0644
stdlib.h	34.995 KB	November 22 2023 2:32:50	root	0644
string.h	17.246 KB	November 22 2023 2:32:50	root	0644
strings.h	4.642 KB	November 22 2023 2:32:50	root	0644
sudo_plugin.h	8.028 KB	April 04 2023 1:56:28	root	0644
syscall.h	0.024 KB	November 22 2023 2:32:50	root	0644
sysexits.h	5.109 KB	November 22 2023 2:32:50	root	0644
syslog.h	0.023 KB	November 22 2023 2:32:50	root	0644
tar.h	3.697 KB	November 22 2023 2:32:50	root	0644
termio.h	0.209 KB	November 22 2023 2:32:50	root	0644
termios.h	3.515 KB	November 22 2023 2:32:50	root	0644
tgmath.h	36.542 KB	November 22 2023 2:32:50	root	0644
thread_db.h	15.648 KB	November 22 2023 2:32:50	root	0644
threads.h	6.505 KB	November 22 2023 2:32:50	root	0644
time.h	10.035 KB	November 22 2023 2:32:50	root	0644
ttyent.h	2.436 KB	November 22 2023 2:32:50	root	0644
uchar.h	1.955 KB	November 22 2023 2:32:50	root	0644
ucontext.h	1.989 KB	November 22 2023 2:32:50	root	0644
ulimit.h	1.547 KB	November 22 2023 2:32:50	root	0644
unistd.h	41.801 KB	November 22 2023 2:32:50	root	0644
utime.h	1.467 KB	November 22 2023 2:32:50	root	0644
utmp.h	3.147 KB	November 22 2023 2:32:50	root	0644
utmpx.h	4.004 KB	November 22 2023 2:32:50	root	0644
uv.h	62.506 KB	July 05 2021 7:32:59	root	0644
values.h	1.91 KB	November 22 2023 2:32:50	root	0644
wait.h	0.021 KB	November 22 2023 2:32:50	root	0644
wchar.h	30.382 KB	November 22 2023 2:32:50	root	0644
wctype.h	5.419 KB	November 22 2023 2:32:50	root	0644
wordexp.h	2.443 KB	November 22 2023 2:32:50	root	0644

NineSec Team - 2022