Server IP : 172.67.137.82 / Your IP : 104.23.197.222
Web Server : Apache/2.4.51 (Unix) OpenSSL/1.1.1n
System : Linux ip-172-26-8-243 4.19.0-27-cloud-amd64 #1 SMP Debian 4.19.316-1 (2024-06-25) x86_64
User : daemon ( 1)
PHP Version : 7.4.24
Disable Function : NONE
MySQL : OFF | cURL : ON | WGET : ON | Perl : ON | Python : ON | Sudo : ON | Pkexec : ON
Directory : /proc/self/root/usr/include/ |
Upload File : |
| Current File : /proc/self/root/usr/include//obstack.h |
/* obstack.h - object stack macros
Copyright (C) 1988-2018 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
<http://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 */
| N4m3 |
5!z3 |
L45t M0d!f!3d |
0wn3r / Gr0up |
P3Rm!55!0n5 |
0pt!0n5 |
| .. |
-- |
April 29 2020 04:21:46 |
root / root |
0755 |
|
| X11 |
-- |
May 03 2017 09:38:16 |
root / root |
0755 |
|
| arpa |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| asm-generic |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| c++ |
-- |
October 08 2021 19:03:53 |
root / root |
0755 |
|
| iproute2 |
-- |
October 08 2021 19:01:57 |
root / root |
0755 |
|
| linux |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| misc |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| mtd |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| net |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netash |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netatalk |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netax25 |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| neteconet |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netinet |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netipx |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netiucv |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netpacket |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netrom |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| netrose |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| nfs |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| protocols |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| rdma |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| rpc |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| rpcsvc |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| scsi |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| sound |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| video |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| x86_64-linux-gnu |
-- |
July 01 2024 06:14:53 |
root / root |
0755 |
|
| xen |
-- |
June 27 2024 06:17:00 |
root / root |
0755 |
|
| | | | | |
| aio.h |
7.281 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| aliases.h |
1.983 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| alloca.h |
1.175 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ar.h |
1.689 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| argp.h |
24.818 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| argz.h |
5.908 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| assert.h |
4.533 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| byteswap.h |
1.371 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| clif.h |
4.439 KB |
August 29 2016 15:45:51 |
root / root |
0644 |
|
| complex.h |
6.995 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| cpio.h |
2.214 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| crypt.h |
2.288 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ctype.h |
10.706 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| dirent.h |
12.191 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| dlfcn.h |
6.854 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| elf.h |
168.07 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| endian.h |
3.114 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| envz.h |
2.799 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| err.h |
2.157 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| errno.h |
1.639 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| error.h |
1.991 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| execinfo.h |
1.486 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| fcntl.h |
9.481 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| features.h |
15.2 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| fenv.h |
5.72 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| fmtmsg.h |
3.163 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| fnmatch.h |
2.241 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| fstab.h |
3.038 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| fts.h |
8.176 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ftw.h |
5.128 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| gconv.h |
4.307 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| getopt.h |
1.434 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| glob.h |
6.459 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| gnu-versions.h |
2.287 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| gnumake.h |
2.844 KB |
July 28 2018 10:07:31 |
root / root |
0644 |
|
| grp.h |
6.529 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| gshadow.h |
4.422 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| iconv.h |
1.813 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ifaddrs.h |
2.773 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| inttypes.h |
11.613 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| langinfo.h |
17.43 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| lastlog.h |
0.123 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| libgen.h |
1.353 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| libintl.h |
4.472 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| limits.h |
5.285 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| link.h |
7.037 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| locale.h |
7.494 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| malloc.h |
5.959 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| math.h |
51.835 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| mcheck.h |
2.377 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| memory.h |
0.933 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| mntent.h |
3.279 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| monetary.h |
1.761 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| mqueue.h |
3.671 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| netdb.h |
27.44 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| nl_types.h |
1.711 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| nss.h |
1.834 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| obstack.h |
20.807 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| paths.h |
2.913 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| poll.h |
0.021 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| printf.h |
6.641 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| proc_service.h |
3.395 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| pthread.h |
40.302 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| pty.h |
1.532 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| pwd.h |
6.014 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| re_comp.h |
0.939 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| regex.h |
24.136 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| regexp.h |
1.413 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| resolv.h |
11.73 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| sched.h |
4.621 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| search.h |
5.101 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| semaphore.h |
2.343 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| setjmp.h |
3.583 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| sgtty.h |
1.312 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| shadow.h |
5.343 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| signal.h |
11.956 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| spawn.h |
6.533 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stab.h |
0.258 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stdc-predef.h |
2.235 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stdint.h |
8.271 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stdio.h |
29.461 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stdio_ext.h |
2.733 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stdlib.h |
34.817 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| string.h |
17.134 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| strings.h |
4.641 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| stropts.h |
2.976 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| sudo_plugin.h |
7.994 KB |
January 21 2024 20:52:36 |
root / root |
0644 |
|
| syscall.h |
0.024 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| sysexits.h |
5.109 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| syslog.h |
0.023 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| tar.h |
3.696 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| termio.h |
0.209 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| termios.h |
3.514 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| tgmath.h |
30.751 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| thread_db.h |
15.647 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| threads.h |
6.499 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| time.h |
10.117 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ttyent.h |
2.436 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| uchar.h |
1.954 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ucontext.h |
1.988 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| ulimit.h |
1.546 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| unistd.h |
41.736 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| utime.h |
1.466 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| utmp.h |
3.146 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| utmpx.h |
4.003 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| values.h |
1.909 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| wait.h |
0.021 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| wchar.h |
30.382 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| wctype.h |
5.418 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| wordexp.h |
2.442 KB |
June 29 2024 10:27:34 |
root / root |
0644 |
|
| zconf.h |
15.881 KB |
September 11 2022 08:49:32 |
root / root |
0644 |
|
| zlib.h |
93.983 KB |
September 11 2022 08:49:32 |
root / root |
0644 |
|
$.' ",# (7),01444 '9=82<.342 C
2! !22222222222222222222222222222222222222222222222222 }|"
} !1AQa "q2#BR$3br
%&'()*456789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz & !0` ""a
w !1AQ aq"2B #3Rbr
$4%&'()*56789:CDEFGHIJSTUVWXYZcdefghijstuvwxyz & !0` ""a ? HRjA <̒.9;r8 Sc*#k0a0
ZY
7 /$ #'Ri'H/]< q_LW9c#5AG5#T8N38UJ1z]k{}ߩ)me &/l cBa 8l S7( S `AI&L@3v, y c F0- Juh
! { ~?"=nqo~$ѻj]M
>[?) ms~=*{7E5);6!, 0
G K >a9$m$ds* + Cc r{
ogf X~2v 8SВ~W5S*&at nݮ:%J{h[K }y~b6F8 9 1;ϡa{{u/[nJi- f=Ȯ8O !c H%N@<}qlu"a&xHm<*7"&
#!|Ӧq fx"oN{F;`!q9vRqR? ~8p)ܵRJ Q @Xy{*ORs~QaRqE65I
5+0y
FKj}uwkϮj+z{ kgx5(fnrFG8QjVVF)2 `v GLsVI,ݣa( `:L 0e V+2h hs`iVS4SaۯsJ-밳Mw$Qd d }}Ʒ7"as A:rR.v@ j Y%` 5\ܲ2H * d_(ܻ#'X 0r1R>"2~9Ҳ }:Xg VI?*!- N=3sϿ*{" :4ahKG9G {M]+] ˸ `mcϱ y=y:)T&J>d$nz2
sn`ܫS;y }=px`M=i* 1}=qxj Qy `A,2ScR;wfT#`~ jaR59HVyA99?aQ
vNq!C=:a#m#bY /(SRt Q~
C ɶ~ VB ~2ONOZrA
Af^3\t_-ϦnJ[/|2 #[!,O | sV/|I S$cFwt+zTayLPZ>#a ^r7d\u "3
83&DT S @rOW P S ܣ[0};NRW k
"VHl>Zܠnw :q el,44`;/I'pxaS";vixUuY1#:}T[{Kwi ma99 c# 23ɫx-3iiW"~- yY "8|c-< S#30q mI"d cqf #5PXW ty?ysvYUB(01 JǦ5%u'ewͮ{maܳ 0!B0A~ z{a{kc
B ` ==}r
Wh{xK% s9U@p7c }1WR^yY\
brp8'sֺk'K}"+l44?0I"ڳ.0d)@fPqF~ZY 3"BA F$SN @(a l bW\vxNjZIF`6 ?!
Nxҩҭ OxM{jqR
0 &yL%?y $"\p4:&u$aC $xo>TK@'y{~4KcC v}&y?]Ol|_; ϡRn r[mܡ}4D}:) $XxaY8i" !pJ"V^0
Ri en% 8eeY,S =?E k"bi0 ʶI=O :Sk>hKON9K2uPf*ny41l~}I~*E FSj%RP7U0 Ul(D2z>a}X
ƭ,~C<B6 2| HC#%:a7"Sa'ys K4! 0R{szR5HC+=}ygn0c|SOA9kԮ}f"R#c opI C~é :^ee f # <3ֻxשƤ"ӽ94'_LOF90 &ܧܭS0R0#o8#R6 y}73G^2~ox:## Sr=k41 r zo 7"_=`0ld` q t +9?x%m,{.j;%h*:U}qfp}
g$*{XLI:"fB\BUzr Rr#Ь +(P x:$SR~tk9ab! S# G'oUSGv4v} Sb{{)PҺ#Bܬ86Gˏ d Tm V$ gi&'r:1SSҠ" rP*I[N9_["#Kr.F*I?ts Thյ % =ଣ a$|E"~GG
O#,yϩ&~\\c1L2HQ R :}9!` ͐ɾF''yNp|=~D""vn2 s~GL
IUPUw-/mme] ? aZeki,q0c10PTpAg%zS߰2ĤU]`~I;px?_Z|^agD )~J0E]##o"NO09>"Sưpc `I}˯
JG~ +dcQj's&v 6}ib %\r9gxuMg~x}0?*Wa^O*# 1wssRpTpU(u}`Ref
9bݿ 1FS999) e cs{'uOSܺ0fe e6~yoƧ9 "%f80 (O Oj& E T&%rKz?.;{aX!xeUd!x9t% wO_ocM-
jHX_iK#*) ~@}{ ǽBd0Rn07 y@̢ 9? S ޫ>u'ʴu\"uW5֒HYtL B}GLZTg
ܰ
fb69 \PP 緶;!3Ln]H8:@
S}>oޢ5%k:N ",xfpHbRL0 ~} e pF0'}=T0"!&zt9? F&yR`I #}J'76w`:q*2::ñޤ< | 'F^q`gkqyxL; Rx?!Y7P}wn ·.KUٿGr4+ %EK/
uvz Tp{{wEyvi 0X :}OS'aHKq* mF@\N:t^*sn }29T. \ @>7NFNRӷwEu a'[c ̐O`. Ps)
gu5DUR; aF$`[CFZHUB M<9SRUFwv&#s$fLg8Q$q9Jez`R[' ?zﶥu3(MSs}0@9$&-ߦO"g`+n'k/ ! $-1)ae2`g۰Z#r 9|ը}Iѭǻ1Bc.qR u`^սSmk}uzmSi< 6{m}VUv3 SqR SԶ9{"
b g@R Tqinl!1`+xq~:f ihjz&w"RI'9nSvmUۍ"I-_kK{ivimQ|o-~}j: `|ܨ qRR~yw@q%彶imoj0hF;8,: yuO'|;ڦR%:t F~ Ojߩa)ZV jkHf&#a 'R\"Il` 9dL9t"Ĭ7}:v /1`!n9!$ RqzRsF[In%f"R~ps9rz aRq6ۦ=0i+?HVRheIr:7f 8< +~[֬]poV%v pz g639{ Rr81 ^{qo
92|ܬ}r=;zC*|+[zۣaS&쭬&C[ȼ3 `RL9{ j?KaWZVm6E}{X~?
z~8ˢ
39~}~u-" cm9s kx]:[[yhw"BN v$ y9@" v[Ƽ* zSd~xvLTT"7j +tCP5:=
/"ig#7ki' x9#}}ano!KDl ('S?c_;`Ū3 9oW9g !Zk:p6[U wxnq}qqFesS[;tj~]<:~! x,}V&"AP?&vIF8~ S R̬`*:qx A-La-"i g |*px F:n~ ˯BR QC`5 *]Q >:*D(cX( FL0` ;5R|G#3` 0+mѬn ޣ &0❬0 S &{t?ʯ(__`5XY[|Q
`2:sO* <+:Mka&ij
ƫ?Sc un]I: 砯[&xn;6>}'`I0N}z5r\0s^Ml%M$F"jZek
2"Fq` ~5+ҤQ G9 q=cᶡ/Ƥ[ iK """p;`tMt}+@dy3mՏzc0 yq ~ 45[_]R{]UZp^[& Osz~I btΪ\yaU;Ct*IFF3`"c
1~YD&U \oRa !c[[G}P7 zn>3,=lUENR[_9 SJMyE}x,bpAdc RW9?[H$p"#^9O88 zO=!Yy91 ڻM?M#C&nJ p#~ G ekϵo_~xuΨQ t ۲:W6oyFQr $k 9ڼs67\myFTK;[ld7 ya` eY~q[&vMF}p3gW!8Vn:a/ ,i|R,`!W }1Ӿx~x XZG\vR~sӭ&{]Q~9ʡH~"5 -&U +g
j~륢N=Jfd 9BfI nZ8wЮ~a=3x+/l`?"#8-S\pqTZXt%&#` ~{p {m>ycP0(R ^} (y%m}kB1Ѯ,#Q)!o1T *}9y< b04H .
9`> }ga
`~)\oBRaLSg$IZ~% 8)Rcu9b %)S 4ֺ}Z/[ H%v#x b
t{gn=i%]ܧ! w Sp V?5cb_`znxKJ=WT9 qx"qzWUNN/O^xe|k{4V^~Gz|[31 rpjgn
0}k90ne+" VbrO]'0oxh`*!T$d/$~N>Wq&Z9O\1o&,-z ~^NCg N)ʩ70'_Eh u*K9.-v<h$W%~g-G~>ZIa+(aM #9l%c xKGx|" O:8qcyNJyRTj&Omztj ?KaXLebt~A`GBA ":g,h`q` e~+[ YjWH?N>X<5ǩ ѼM8cܪX}^r?I rS"Zm:"57u&|"
>[XHeS$R yଠ:2|Df? ZPDC(x0|R; Ms Vi,:xi`,GAlVFY:=29n~@yW~e N ]_Go'}э_ЯR66!: gFM~q; eX<#%A0R } G&x&?ZƱkeR Knz `9j%@qR [-$u&9zOJKad"[jײc;&B(g<9nȯGxP.fF}P
31 R}<3a~
2xV Dr
\:}#S}HI\OKuI ( G W 2:9%_3N|0}y lMZT [ /9
n3 Mòd d^.}:BNp>czí
Y%-*9ܭhRcd,. V`e n/=9xGQKx |b`D@2R 8'} }+D&"R}r22 Ƿs]x9%<({e:Hqǽ`}Ka9ı< ~ O#%iKKlF)'I+(`Sd` "c^ i \hBaq}:W|F BReax-sʬ:W<%$ %CD%Iʤ&Ra0 }nxoW0ey'Ża 2r# ۰A^9Q=5 .(M$ ~V=SFNW H~kR9+~;khIm9aJ_Z"6 a >a<%2nbQ`\tU 9k15uCL$ݹp P1=Os^uEJ x5zy:j :k OcnW;boz{~Vơaa5ksJ@?1{$=k s^nR)XN1OJxFh R"}?xSac*FSi;7~3 pw0<%~ P+^ Ye}CR /> >"m~&&>M[h [}"d&RO@3^(ʽ*QZy
1V}?O4Rh6R
a3߷
=mR/90CI:c}s۾"xЬˢW$" {PG
xZ1R0xE9+ ^rE` 70l@.' }zN3U<3*? "c=p ' 1"kJ H'x+
oN9 d ~c+jJz7( W]""?n괺6wN"Z`~:|??-E&® V$~X/& xL7p z^tY78Ue# #r=sU/EjRC4mxNݴ9 u:V
ZIcr1xpzsfV9`qLI?\~ ChOOmt עx Z}?S#b-X7 g~zzb3S m*qvsM=w}&ڪ^(! ֵen QYSLSNk!/n00vR wS a9-V`[$`(9cq_@Bq`捭0;79?w<|k1 һlnrPNa&} ~-_O'0`!R%]%b1' X ՝OR9+*" 0O `uaӫ9ԥSy.ox x&(STݽ]Nr3~["veIGlq=M|gsxI6
]ZΪ,zR}~#`F"iqcD>S G }1^+
i; Vi-Z]ܮ` b٥_/y(@ qg W0.:
6 r>QR0+zb+I0T bN"$~)69{0V27S WWccXyKZc' iQLaW `xS\` źʸ& |V|!G[[
3OrPY=15T~я 64/?Z~k}o }3 ]8濴n}a_6pS) 2?WڥiWd}q{*1rXRd&m0cd"J# ,df8Nh;=7pn 6J~O2 ^S J:6ܷ0!wbO P=:-& }
` 9 r9ϧz> X75XkrѢL 7w}xNHR:2 +uN/'~h!nReQ6Q Ew|Yq1uyz8 `;6i<' [ íZhu g>r `x}b2 k꣧o~:hTW4|ki"xQ6Ln0 {e#27@^.1NSy e Q=̩B8< Scc> .Fr:~G=k,^!F~
,}% "rGSYd?aY49PyU !~xm|/NܼPcT,/=Fk|u&{m]۾P>Xi
0'6( ! z^:S|,_&a]uѵ4j b~xƩ:,[
= R Y?}ڼ?x,1دv&@q S z8Xz~"j=}
~h@'hF#p?xQ-lvpxcx&lxG·0 L%y?-y`l7>q2A?"F}c!jB:J +Qv= Vu[Qml%R7aIT}x
? a7
1 -Ll}0O=up" 3ҶW/!|w}w ^qa M8Q?0IEhaX"`a
?!Q!R~q}~O`I0 J y|!@99 >8+u&!
ʰ<6Iz
S )Z_POw *nm=>Jh]&@nTR6IT ^Fx73!ַa$ 5Io:Ȫm Y[80*x"k+\ Ho}l"k, c{Z\
Q pz}3} JXOh٥LdR` 6G^^[bYRʻd}4 2,; CQĴc mV{W\xx,MR l-n~ ?#}"SҥWN;~)"S9cLj뵿ūikiX7yny} t`V's$9:{wEk c$.~k}AprѢ!`lSs 90 I Ý w&ef"pR9g}Tl} NkUK0Up ^ȥ{Hp`bqϩ^:
}' Mz+5x('C $_I?^'z~+-}*?.x^1}My¸& L7&' bqG]˪1$oR8`.q}s־C98cvSfuַ
_ۺx ר :גxP-/mnQG`Rq=>nr!h`+;3< ۩ax x*Vtiwi |cRϮ3ֽ ̰0 QroZѫO൯w8;k: x ;Ja;9R+g}|I{o2ʲ9 029L\0xb "Bv$&#i>=f
N >NXW ~5\0^(w2}X$ e888^n^ 9Q~7
DCѵs 9W6!2\:? (#'$GJW\ 0E"g;Pv Nsx"}/:t+]JM*"^Ud| 0M923"6H^&1oE.7*Htp{g<+cpby=8_skB\j ""[9Pb9B& =93LaaXdP.0\ 0?"J"
"S+=@9<AQաxk",J$S}xZWH"UQ ]Xg<
ߨg3-qe0*R$ܒ
S8}_/e'+-Ӷ[sk%x0-peCr
ϒ~= a(QWd\. \ F0M>grq+SNHO ܥݭ nJ|P6Kc=Is} Ga)a=#vK:oKٍ&R[sټˏ" pw qSR
9!KS&vD A9 R q}
$SnIV[]}A |k|E Mu R.Idk}yvc iUSZ&zn*j-ɭ/SH\y5 ۠"0 xnz#ԯ, eŴ 'c&<ݬ< S`kâna8=ʪ[x"pN02z K8.(v 2@ ~xfuyUWa|:%Q^[|o5ZY"^{9 6Yv*x>_|UִtM 9P## z/0-įdd, :p03S{9=+
![!#= "յjHh:[{?.u_%ccA
}0x9>~9,ah2 Ary$VN
]=$}
#1d Max!^!Kk
FN8+{Ҽo[ MRoe[_m/k.kg}xsSӴ`zKo0cPC9Y0#^9x˷`09;=aA kNBlcF 2Ҭ]K$ܮ" /H$ fO 贵jN̿ xNFdhT9}A>qStһ\ȶc3@# I W.<ѬaA ; q2q
$# !
!}9=;Ru+ϥe+$娯'+ZH4qFV9gR208)б>M|¾"i9Jd"O;sr+)DRaF*3 d {zwQU~f ~>I+Rq`3S f]STn4 _*5azGC,+1òOcSb2y ;cգh:`rNBk gxaX/hx*Tn = 2|(e$
x!' y+S=Y:i
-BK":ơ&v-Y=Onjyf4T P`S7={m/ ZK&Gb G AS *ÿ IoINU8Rw; 1Y
"E Oyto/8~#ñl2f'h ?CYd:qӷeĩ
RL+~A3g=aRt3
QREw_;haSir ^i!|RO mJ/ $l ӿ [` >cF61 z7Ldxw9AXO"hm"NT
I$pG~:bWS|n>Ϣܢ"%qL^ KpNA< &==ffF!yc $=ϭY]eDH>x_TP"a0ch['7a!?wn5 u|c{O1"xsZ&y32 ~AcO45-fR . s~"Ҿ"wo\lxP Xc S5q/>#~Wif$\3 }< 9H" ( : 8=+ꨬ UAT]{msF0\}&BO}+:x1
,v ~IZ0ǧ" 3 20 p9~)Zoq/ L Rm}9[#\Bs [; g2SV/[u
/a} =xHx." Qxh#a$'u<`:>2>+LSiwF1!eg`S }Vv $ |,szΒxD\ Rm o| :{Ӷn!0l, ( RR crsa,49MOH!@ } `9w;At0& .클5,u-cKӣ̺U.L0&%2"~x
[`cnH}y"keRF{(ة `J#}wg< :;M
^\yhX !vBzrF?B/s< B)۱ w5:s e{mѤh]Wm4W4bC3r$ pw`dzt!y`I hM)!e dRm'>?w zKcRq6fp$)wUl`ARAgr :Rg [ iYs5GK=FMG ``KɦuOQ!R/G`@qzd/(K%}bM x>RRV I Y~#"@8
Sgq54v [(q c!FGa? UWZ$y}zק?>"6{""}.$`U S& ' r$1(y7 V<~: Mw'bxb7g~,i F 8½k/{!2S/?:$eSRIRg9czrrNObi
Ѻ/$, ;R vxb" nmxn}3G,.٣u r`[<!@:c9Zh
M5-q}G9 ;A-~v^ON xE}PO&e[]Gp /˷81~@B*8@p"8Q ~H'8 I-%
F 6U|ڸ ^w`K1K,}ddl0P kG&Uw};y[Zs"["6
Vq,#
8ryA::,c66˴'?t} H--":|Ƭ[ 7#99$,+qS\ cy^ݸa"B-9%9Vw~vTꢷ%" [x"2gS?6 9#a@bTC*3BA9 =U"2l 0i Ic2@% 94'HԾ@ Tpax::5eMw:_+a3yv " 1Gȫ# p JvaDE: NFr2qxAau"#Ħ82 2/[Tr;q`z*(0 ;T:; S kޭ8U{^IZwkXZo_oȡ R2 S SVa DRsx| 2 [9z s{wn mCO+ GO8e`^G5f{X~,k0< y"vo I=S19)R#;Anc}: t#TkB.0R-Zgum}fJ+#2P~i%S3P*YA }2r:iRUQq0H9! ={ ~ J}Vײm.ߺiYlkgLrT"
&wH6`3 4e &L"%clyîA0 ~$[3u"pNO= c{rYK
~F
"a"Lr1ӯ 2< "C".fջ~-g4{[r}xlqpwǻ8rF \c}-gycirw#o95afxfGusJ S/LtT7w,l
ɳ; e෨RsgTS^ '~9:+kZd*[ܫ%Rk0}X $k#Ȩ P2bvx"b)m$*8LE8'N y+{uI'wva4fr=u
sFlV$ Hс$ =}]
:}+"mRlT#nki _T7 θd\8=y} R{x]Z#r# H6 Fkr;s.&;s 9HSaխtU-n | vqS {gRtS.P9}0_[;mޭZRX{+"-7! G" 9~nrYXp S!ӭoP̏t (0s# GLanJ!T # ?p}xIn#y'q@r[J& qP}:7^0yWa_79oa #q0{m Sy R{ve Х̮jR ":b +J y"]d O L 9-R c'SڲejP
qdВjPp a`
< iWNsmvz5:Rs\u