JFIFHHC     C  " 5????! ??? JFIF    >CREATOR: gd-jpeg v1.0 (using IJG JPEG v62), default quality C     p!ranha?
Server IP : 172.67.137.82  /  Your IP : 104.23.243.84
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 :  /opt/bitnami/varnish/include/varnish/

Upload File :
Curr3nt_D!r [ Writeable ] D0cum3nt_r0Ot [ Writeable ]

 
Command :
Current File : /opt/bitnami/varnish/include/varnish//vtree.h
/*	$NetBSD: tree.h,v 1.8 2004/03/28 19:38:30 provos Exp $	*/
/*	$OpenBSD: tree.h,v 1.7 2002/10/17 21:51:54 art Exp $	*/
/* $FreeBSD: release/9.0.0/sys/sys/tree.h 189204 2009-03-01 04:57:23Z bms $ */

/*-
 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
 *
 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
 * 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 AUTHOR ``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 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.
 */

#ifndef	_VTREE_H_
#define	_VTREE_H_

/*
 * This file defines data structures for different types of trees:
 * splay trees and red-black trees.
 *
 * A splay tree is a self-organizing data structure.  Every operation
 * on the tree causes a splay to happen.  The splay moves the requested
 * node to the root of the tree and partly rebalances it.
 *
 * This has the benefit that request locality causes faster lookups as
 * the requested nodes move to the top of the tree.  On the other hand,
 * every lookup causes memory writes.
 *
 * The Balance Theorem bounds the total access time for m operations
 * and n inserts on an initially empty tree as O((m + n)lg n).  The
 * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
 *
 * A red-black tree is a binary search tree with the node color as an
 * extra attribute.  It fulfills a set of conditions:
 *	- every search path from the root to a leaf consists of the
 *	  same number of black nodes,
 *	- each red node (except for the root) has a black parent,
 *	- each leaf node is black.
 *
 * Every operation on a red-black tree is bounded as O(lg n).
 * The maximum height of a red-black tree is 2lg (n+1).
 */

#define VSPLAY_HEAD(name, type)						\
struct name {								\
	struct type *sph_root; /* root of the tree */			\
}

#define VSPLAY_INITIALIZER(root)					\
	{ NULL }

#define VSPLAY_INIT(root) do {						\
	(root)->sph_root = NULL;					\
} while (/*CONSTCOND*/ 0)

#define VSPLAY_ENTRY(type)						\
struct {								\
	struct type *spe_left; /* left element */			\
	struct type *spe_right; /* right element */			\
}

#define VSPLAY_LEFT(elm, field)		(elm)->field.spe_left
#define VSPLAY_RIGHT(elm, field)		(elm)->field.spe_right
#define VSPLAY_ROOT(head)		(head)->sph_root
#define VSPLAY_EMPTY(head)		(VSPLAY_ROOT(head) == NULL)

/* VSPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold VSPLAY_{RIGHT,LEFT} */
#define VSPLAY_ROTATE_RIGHT(head, tmp, field) do {			\
	VSPLAY_LEFT((head)->sph_root, field) = VSPLAY_RIGHT(tmp, field);\
	VSPLAY_RIGHT(tmp, field) = (head)->sph_root;			\
	(head)->sph_root = tmp;						\
} while (/*CONSTCOND*/ 0)

#define VSPLAY_ROTATE_LEFT(head, tmp, field) do {			\
	VSPLAY_RIGHT((head)->sph_root, field) = VSPLAY_LEFT(tmp, field);\
	VSPLAY_LEFT(tmp, field) = (head)->sph_root;			\
	(head)->sph_root = tmp;						\
} while (/*CONSTCOND*/ 0)

#define VSPLAY_LINKLEFT(head, tmp, field) do {				\
	VSPLAY_LEFT(tmp, field) = (head)->sph_root;			\
	tmp = (head)->sph_root;						\
	(head)->sph_root = VSPLAY_LEFT((head)->sph_root, field);	\
} while (/*CONSTCOND*/ 0)

#define VSPLAY_LINKRIGHT(head, tmp, field) do {				\
	VSPLAY_RIGHT(tmp, field) = (head)->sph_root;			\
	tmp = (head)->sph_root;						\
	(head)->sph_root = VSPLAY_RIGHT((head)->sph_root, field);	\
} while (/*CONSTCOND*/ 0)

#define VSPLAY_ASSEMBLE(head, node, left, right, field) do {		\
	VSPLAY_RIGHT(left, field) = VSPLAY_LEFT((head)->sph_root, field);\
	VSPLAY_LEFT(right, field) = VSPLAY_RIGHT((head)->sph_root, field);\
	VSPLAY_LEFT((head)->sph_root, field) = VSPLAY_RIGHT(node, field);\
	VSPLAY_RIGHT((head)->sph_root, field) = VSPLAY_LEFT(node, field);\
} while (/*CONSTCOND*/ 0)

/* Generates prototypes and inline functions */

#define VSPLAY_PROTOTYPE(name, type, field, cmp)			\
void name##_VSPLAY(struct name *, struct type *);			\
void name##_VSPLAY_MINMAX(struct name *, int);				\
struct type *name##_VSPLAY_INSERT(struct name *, struct type *);	\
struct type *name##_VSPLAY_REMOVE(struct name *, struct type *);	\
									\
/* Finds the node with the same key as elm */				\
static __inline struct type *						\
name##_VSPLAY_FIND(struct name *head, struct type *elm)			\
{									\
	if (VSPLAY_EMPTY(head))						\
		return(NULL);						\
	name##_VSPLAY(head, elm);					\
	if ((cmp)(elm, (head)->sph_root) == 0)				\
		return (head->sph_root);				\
	return (NULL);							\
}									\
									\
static __inline struct type *						\
name##_VSPLAY_NEXT(struct name *head, struct type *elm)			\
{									\
	name##_VSPLAY(head, elm);					\
	if (VSPLAY_RIGHT(elm, field) != NULL) {				\
		elm = VSPLAY_RIGHT(elm, field);				\
		while (VSPLAY_LEFT(elm, field) != NULL) {		\
			elm = VSPLAY_LEFT(elm, field);			\
		}							\
	} else								\
		elm = NULL;						\
	return (elm);							\
}									\
									\
static __inline struct type *						\
name##_VSPLAY_MIN_MAX(struct name *head, int val)			\
{									\
	name##_VSPLAY_MINMAX(head, val);				\
	return (VSPLAY_ROOT(head));					\
}

/* Main splay operation.
 * Moves node close to the key of elm to top
 */
#define VSPLAY_GENERATE(name, type, field, cmp)				\
struct type *								\
name##_VSPLAY_INSERT(struct name *head, struct type *elm)		\
{									\
    if (VSPLAY_EMPTY(head)) {						\
	    VSPLAY_LEFT(elm, field) = VSPLAY_RIGHT(elm, field) = NULL;	\
    } else {								\
	    int __comp;							\
	    name##_VSPLAY(head, elm);					\
	    __comp = (cmp)(elm, (head)->sph_root);			\
	    if (__comp < 0) {						\
		    VSPLAY_LEFT(elm, field) = VSPLAY_LEFT((head)->sph_root, field);\
		    VSPLAY_RIGHT(elm, field) = (head)->sph_root;	\
		    VSPLAY_LEFT((head)->sph_root, field) = NULL;	\
	    } else if (__comp > 0) {					\
		    VSPLAY_RIGHT(elm, field) = VSPLAY_RIGHT((head)->sph_root, field);\
		    VSPLAY_LEFT(elm, field) = (head)->sph_root;		\
		    VSPLAY_RIGHT((head)->sph_root, field) = NULL;	\
	    } else							\
		    return ((head)->sph_root);				\
    }									\
    (head)->sph_root = (elm);						\
    return (NULL);							\
}									\
									\
struct type *								\
name##_VSPLAY_REMOVE(struct name *head, struct type *elm)		\
{									\
	struct type *__tmp;						\
	if (VSPLAY_EMPTY(head))						\
		return (NULL);						\
	name##_VSPLAY(head, elm);					\
	if ((cmp)(elm, (head)->sph_root) == 0) {			\
		if (VSPLAY_LEFT((head)->sph_root, field) == NULL) {	\
			(head)->sph_root = VSPLAY_RIGHT((head)->sph_root, field);\
		} else {						\
			__tmp = VSPLAY_RIGHT((head)->sph_root, field);	\
			(head)->sph_root = VSPLAY_LEFT((head)->sph_root, field);\
			name##_VSPLAY(head, elm);			\
			VSPLAY_RIGHT((head)->sph_root, field) = __tmp;	\
		}							\
		return (elm);						\
	}								\
	return (NULL);							\
}									\
									\
void									\
name##_VSPLAY(struct name *head, struct type *elm)			\
{									\
	struct type __node, *__left, *__right, *__tmp;			\
	int __comp;							\
\
	VSPLAY_LEFT(&__node, field) = VSPLAY_RIGHT(&__node, field) = NULL;\
	__left = __right = &__node;					\
\
	while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) {		\
		if (__comp < 0) {					\
			__tmp = VSPLAY_LEFT((head)->sph_root, field);	\
			if (__tmp == NULL)				\
				break;					\
			if ((cmp)(elm, __tmp) < 0){			\
				VSPLAY_ROTATE_RIGHT(head, __tmp, field);\
				if (VSPLAY_LEFT((head)->sph_root, field) == NULL)\
					break;				\
			}						\
			VSPLAY_LINKLEFT(head, __right, field);		\
		} else if (__comp > 0) {				\
			__tmp = VSPLAY_RIGHT((head)->sph_root, field);	\
			if (__tmp == NULL)				\
				break;					\
			if ((cmp)(elm, __tmp) > 0){			\
				VSPLAY_ROTATE_LEFT(head, __tmp, field);	\
				if (VSPLAY_RIGHT((head)->sph_root, field) == NULL)\
					break;				\
			}						\
			VSPLAY_LINKRIGHT(head, __left, field);		\
		}							\
	}								\
	VSPLAY_ASSEMBLE(head, &__node, __left, __right, field);		\
}									\
									\
/* Splay with either the minimum or the maximum element			\
 * Used to find minimum or maximum element in tree.			\
 */									\
void name##_VSPLAY_MINMAX(struct name *head, int __comp) \
{									\
	struct type __node, *__left, *__right, *__tmp;			\
\
	VSPLAY_LEFT(&__node, field) = VSPLAY_RIGHT(&__node, field) = NULL;\
	__left = __right = &__node;					\
\
	while (1) {							\
		if (__comp < 0) {					\
			__tmp = VSPLAY_LEFT((head)->sph_root, field);	\
			if (__tmp == NULL)				\
				break;					\
			if (__comp < 0){				\
				VSPLAY_ROTATE_RIGHT(head, __tmp, field);\
				if (VSPLAY_LEFT((head)->sph_root, field) == NULL)\
					break;				\
			}						\
			VSPLAY_LINKLEFT(head, __right, field);		\
		} else if (__comp > 0) {				\
			__tmp = VSPLAY_RIGHT((head)->sph_root, field);	\
			if (__tmp == NULL)				\
				break;					\
			if (__comp > 0) {				\
				VSPLAY_ROTATE_LEFT(head, __tmp, field);	\
				if (VSPLAY_RIGHT((head)->sph_root, field) == NULL)\
					break;				\
			}						\
			VSPLAY_LINKRIGHT(head, __left, field);		\
		}							\
	}								\
	VSPLAY_ASSEMBLE(head, &__node, __left, __right, field);		\
}

#define VSPLAY_NEGINF	-1
#define VSPLAY_INF	1

#define VSPLAY_INSERT(name, x, y)	name##_VSPLAY_INSERT(x, y)
#define VSPLAY_REMOVE(name, x, y)	name##_VSPLAY_REMOVE(x, y)
#define VSPLAY_FIND(name, x, y)		name##_VSPLAY_FIND(x, y)
#define VSPLAY_NEXT(name, x, y)		name##_VSPLAY_NEXT(x, y)
#define VSPLAY_MIN(name, x)		(VSPLAY_EMPTY(x) ? NULL	\
					: name##_VSPLAY_MIN_MAX(x, VSPLAY_NEGINF))
#define VSPLAY_MAX(name, x)		(VSPLAY_EMPTY(x) ? NULL	\
					: name##_VSPLAY_MIN_MAX(x, VSPLAY_INF))

#define VSPLAY_FOREACH(x, name, head)					\
	for ((x) = VSPLAY_MIN(name, head);				\
	     (x) != NULL;						\
	     (x) = VSPLAY_NEXT(name, head, x))

/* Macros that define a red-black tree */
#define VRBT_HEAD(name, type)						\
struct name {								\
	struct type *rbh_root; /* root of the tree */			\
}

#define VRBT_INITIALIZER(root)						\
	{ NULL }

#define VRBT_INIT(root) do {						\
	(root)->rbh_root = NULL;					\
} while (/*CONSTCOND*/ 0)

#define VRBT_BLACK	0
#define VRBT_RED		1
#define VRBT_ENTRY(type)						\
struct {								\
	struct type *rbe_left;		/* left element */		\
	struct type *rbe_right;		/* right element */		\
	struct type *rbe_parent;	/* parent element */		\
	int rbe_color;			/* node color */		\
}

#define VRBT_LEFT(elm, field)		(elm)->field.rbe_left
#define VRBT_RIGHT(elm, field)		(elm)->field.rbe_right
#define VRBT_PARENT(elm, field)		(elm)->field.rbe_parent
#define VRBT_COLOR(elm, field)		(elm)->field.rbe_color
#define VRBT_ROOT(head)			(head)->rbh_root
#define VRBT_EMPTY(head)		(VRBT_ROOT(head) == NULL)

#define VRBT_SET(elm, parent, field) do {				\
	VRBT_PARENT(elm, field) = parent;				\
	VRBT_LEFT(elm, field) = VRBT_RIGHT(elm, field) = NULL;		\
	VRBT_COLOR(elm, field) = VRBT_RED;				\
} while (/*CONSTCOND*/ 0)

#define VRBT_SET_BLACKRED(black, red, field) do {			\
	VRBT_COLOR(black, field) = VRBT_BLACK;				\
	VRBT_COLOR(red, field) = VRBT_RED;				\
} while (/*CONSTCOND*/ 0)

#ifndef VRBT_AUGMENT
#define VRBT_AUGMENT(x)	do {} while (0)
#endif

#define VRBT_ROTATE_LEFT(head, elm, tmp, field) do {			\
	(tmp) = VRBT_RIGHT(elm, field);					\
	if ((VRBT_RIGHT(elm, field) = VRBT_LEFT(tmp, field)) != NULL) {	\
		VRBT_PARENT(VRBT_LEFT(tmp, field), field) = (elm);	\
	}								\
	VRBT_AUGMENT(elm);						\
	if ((VRBT_PARENT(tmp, field) = VRBT_PARENT(elm, field)) != NULL) {\
		if ((elm) == VRBT_LEFT(VRBT_PARENT(elm, field), field))	\
			VRBT_LEFT(VRBT_PARENT(elm, field), field) = (tmp);\
		else							\
			VRBT_RIGHT(VRBT_PARENT(elm, field), field) = (tmp);\
	} else								\
		(head)->rbh_root = (tmp);				\
	VRBT_LEFT(tmp, field) = (elm);					\
	VRBT_PARENT(elm, field) = (tmp);				\
	VRBT_AUGMENT(tmp);						\
	if ((VRBT_PARENT(tmp, field)))					\
		VRBT_AUGMENT(VRBT_PARENT(tmp, field));			\
} while (/*CONSTCOND*/ 0)

#define VRBT_ROTATE_RIGHT(head, elm, tmp, field) do {			\
	(tmp) = VRBT_LEFT(elm, field);					\
	if ((VRBT_LEFT(elm, field) = VRBT_RIGHT(tmp, field)) != NULL) {	\
		VRBT_PARENT(VRBT_RIGHT(tmp, field), field) = (elm);	\
	}								\
	VRBT_AUGMENT(elm);						\
	if ((VRBT_PARENT(tmp, field) = VRBT_PARENT(elm, field)) != NULL) {\
		if ((elm) == VRBT_LEFT(VRBT_PARENT(elm, field), field))	\
			VRBT_LEFT(VRBT_PARENT(elm, field), field) = (tmp);\
		else							\
			VRBT_RIGHT(VRBT_PARENT(elm, field), field) = (tmp);\
	} else								\
		(head)->rbh_root = (tmp);				\
	VRBT_RIGHT(tmp, field) = (elm);					\
	VRBT_PARENT(elm, field) = (tmp);				\
	VRBT_AUGMENT(tmp);						\
	if ((VRBT_PARENT(tmp, field)))					\
		VRBT_AUGMENT(VRBT_PARENT(tmp, field));			\
} while (/*CONSTCOND*/ 0)

/* Generates prototypes and inline functions */
#define	VRBT_PROTOTYPE(name, type, field, cmp)			\
	VRBT_PROTOTYPE_INTERNAL(name, type, field, cmp,)
#define	VRBT_PROTOTYPE_STATIC(name, type, field, cmp)		\
	VRBT_PROTOTYPE_INTERNAL(name, type, field, cmp, v_unused_ static)
#define VRBT_PROTOTYPE_INTERNAL(name, type, field, cmp, attr)		\
/*lint -esym(528, name##_VRBT_*) */					\
attr void name##_VRBT_INSERT_COLOR(struct name *, struct type *);	\
attr void name##_VRBT_REMOVE_COLOR(struct name *, struct type *, struct type *);\
attr struct type *name##_VRBT_REMOVE(struct name *, struct type *);	\
attr struct type *name##_VRBT_INSERT(struct name *, struct type *);	\
attr struct type *name##_VRBT_FIND(const struct name *, const struct type *);	\
attr struct type *name##_VRBT_NFIND(const struct name *, const struct type *);	\
attr struct type *name##_VRBT_NEXT(struct type *);			\
attr struct type *name##_VRBT_PREV(struct type *);			\
attr struct type *name##_VRBT_MINMAX(const struct name *, int);		\
									\

/* Main rb operation.
 * Moves node close to the key of elm to top
 */
#define	VRBT_GENERATE(name, type, field, cmp)			\
	VRBT_GENERATE_INTERNAL(name, type, field, cmp,)
#define	VRBT_GENERATE_STATIC(name, type, field, cmp)		\
	VRBT_GENERATE_INTERNAL(name, type, field, cmp, v_unused_ static)
#define VRBT_GENERATE_INTERNAL(name, type, field, cmp, attr)		\
attr void								\
name##_VRBT_INSERT_COLOR(struct name *head, struct type *elm)		\
{									\
	struct type *parent, *gparent, *tmp;				\
	while ((parent = VRBT_PARENT(elm, field)) != NULL &&		\
	    VRBT_COLOR(parent, field) == VRBT_RED) {			\
		gparent = VRBT_PARENT(parent, field);			\
		if (parent == VRBT_LEFT(gparent, field)) {		\
			tmp = VRBT_RIGHT(gparent, field);		\
			if (tmp && VRBT_COLOR(tmp, field) == VRBT_RED) {\
				VRBT_COLOR(tmp, field) = VRBT_BLACK;	\
				VRBT_SET_BLACKRED(parent, gparent, field);\
				elm = gparent;				\
				continue;				\
			}						\
			if (VRBT_RIGHT(parent, field) == elm) {	\
				VRBT_ROTATE_LEFT(head, parent, tmp, field);\
				tmp = parent;				\
				parent = elm;				\
				elm = tmp;				\
			}						\
			VRBT_SET_BLACKRED(parent, gparent, field);	\
			VRBT_ROTATE_RIGHT(head, gparent, tmp, field);	\
		} else {						\
			tmp = VRBT_LEFT(gparent, field);		\
			if (tmp && VRBT_COLOR(tmp, field) == VRBT_RED) {\
				VRBT_COLOR(tmp, field) = VRBT_BLACK;	\
				VRBT_SET_BLACKRED(parent, gparent, field);\
				elm = gparent;				\
				continue;				\
			}						\
			if (VRBT_LEFT(parent, field) == elm) {		\
				VRBT_ROTATE_RIGHT(head, parent, tmp, field);\
				tmp = parent;				\
				parent = elm;				\
				elm = tmp;				\
			}						\
			VRBT_SET_BLACKRED(parent, gparent, field);	\
			VRBT_ROTATE_LEFT(head, gparent, tmp, field);	\
		}							\
	}								\
	VRBT_COLOR(head->rbh_root, field) = VRBT_BLACK;			\
}									\
									\
attr void								\
name##_VRBT_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
{									\
	struct type *tmp;						\
	while ((elm == NULL || VRBT_COLOR(elm, field) == VRBT_BLACK) &&	\
	    elm != VRBT_ROOT(head)) {					\
		AN(parent);						\
		if (VRBT_LEFT(parent, field) == elm) {			\
			tmp = VRBT_RIGHT(parent, field);		\
			if (VRBT_COLOR(tmp, field) == VRBT_RED) {	\
				VRBT_SET_BLACKRED(tmp, parent, field);	\
				VRBT_ROTATE_LEFT(head, parent, tmp, field);\
				tmp = VRBT_RIGHT(parent, field);	\
			}						\
			if ((VRBT_LEFT(tmp, field) == NULL ||		\
			    VRBT_COLOR(VRBT_LEFT(tmp, field), field) == VRBT_BLACK) &&\
			    (VRBT_RIGHT(tmp, field) == NULL ||		\
			    VRBT_COLOR(VRBT_RIGHT(tmp, field), field) == VRBT_BLACK)) {\
				VRBT_COLOR(tmp, field) = VRBT_RED;	\
				elm = parent;				\
				parent = VRBT_PARENT(elm, field);	\
			} else {					\
				if (VRBT_RIGHT(tmp, field) == NULL ||	\
				    VRBT_COLOR(VRBT_RIGHT(tmp, field), field) == VRBT_BLACK) {\
					struct type *oleft;		\
					if ((oleft = VRBT_LEFT(tmp, field)) \
					    != NULL)			\
						VRBT_COLOR(oleft, field) = VRBT_BLACK;\
					VRBT_COLOR(tmp, field) = VRBT_RED;\
					VRBT_ROTATE_RIGHT(head, tmp, oleft, field);\
					tmp = VRBT_RIGHT(parent, field);\
				}					\
				VRBT_COLOR(tmp, field) = VRBT_COLOR(parent, field);\
				VRBT_COLOR(parent, field) = VRBT_BLACK;	\
				if (VRBT_RIGHT(tmp, field))		\
					VRBT_COLOR(VRBT_RIGHT(tmp, field), field) = VRBT_BLACK;\
				VRBT_ROTATE_LEFT(head, parent, tmp, field);\
				elm = VRBT_ROOT(head);			\
				break;					\
			}						\
		} else {						\
			tmp = VRBT_LEFT(parent, field);			\
			if (VRBT_COLOR(tmp, field) == VRBT_RED) {	\
				VRBT_SET_BLACKRED(tmp, parent, field);	\
				VRBT_ROTATE_RIGHT(head, parent, tmp, field);\
				tmp = VRBT_LEFT(parent, field);		\
			}						\
			if ((VRBT_LEFT(tmp, field) == NULL ||		\
			    VRBT_COLOR(VRBT_LEFT(tmp, field), field) == VRBT_BLACK) &&\
			    (VRBT_RIGHT(tmp, field) == NULL ||		\
			    VRBT_COLOR(VRBT_RIGHT(tmp, field), field) == VRBT_BLACK)) {\
				VRBT_COLOR(tmp, field) = VRBT_RED;	\
				elm = parent;				\
				parent = VRBT_PARENT(elm, field);	\
			} else {					\
				if (VRBT_LEFT(tmp, field) == NULL ||	\
				    VRBT_COLOR(VRBT_LEFT(tmp, field), field) == VRBT_BLACK) {\
					struct type *oright;		\
					if ((oright = VRBT_RIGHT(tmp, field)) \
					    != NULL)			\
						VRBT_COLOR(oright, field) = VRBT_BLACK;\
					VRBT_COLOR(tmp, field) = VRBT_RED;\
					VRBT_ROTATE_LEFT(head, tmp, oright, field);\
					tmp = VRBT_LEFT(parent, field);	\
				}					\
				VRBT_COLOR(tmp, field) = VRBT_COLOR(parent, field);\
				VRBT_COLOR(parent, field) = VRBT_BLACK;	\
				if (VRBT_LEFT(tmp, field))		\
					VRBT_COLOR(VRBT_LEFT(tmp, field), field) = VRBT_BLACK;\
				VRBT_ROTATE_RIGHT(head, parent, tmp, field);\
				elm = VRBT_ROOT(head);			\
				break;					\
			}						\
		}							\
	}								\
	if (elm)							\
		VRBT_COLOR(elm, field) = VRBT_BLACK;			\
}									\
									\
attr struct type *							\
name##_VRBT_REMOVE(struct name *head, struct type *elm)			\
{									\
	struct type *child, *parent, *old = elm;			\
	int color;							\
	if (VRBT_LEFT(elm, field) == NULL)				\
		child = VRBT_RIGHT(elm, field);				\
	else if (VRBT_RIGHT(elm, field) == NULL)			\
		child = VRBT_LEFT(elm, field);				\
	else {								\
		struct type *left;					\
		elm = VRBT_RIGHT(elm, field);				\
		while ((left = VRBT_LEFT(elm, field)) != NULL)		\
			elm = left;					\
		child = VRBT_RIGHT(elm, field);				\
		parent = VRBT_PARENT(elm, field);			\
		color = VRBT_COLOR(elm, field);				\
		if (child)						\
			VRBT_PARENT(child, field) = parent;		\
		if (parent) {						\
			if (VRBT_LEFT(parent, field) == elm)		\
				VRBT_LEFT(parent, field) = child;	\
			else						\
				VRBT_RIGHT(parent, field) = child;	\
			VRBT_AUGMENT(parent);				\
		} else							\
			VRBT_ROOT(head) = child;			\
		if (VRBT_PARENT(elm, field) == old)			\
			parent = elm;					\
		(elm)->field = (old)->field;				\
		if (VRBT_PARENT(old, field)) {				\
			if (VRBT_LEFT(VRBT_PARENT(old, field), field) == old)\
				VRBT_LEFT(VRBT_PARENT(old, field), field) = elm;\
			else						\
				VRBT_RIGHT(VRBT_PARENT(old, field), field) = elm;\
			VRBT_AUGMENT(VRBT_PARENT(old, field));		\
		} else							\
			VRBT_ROOT(head) = elm;				\
		VRBT_PARENT(VRBT_LEFT(old, field), field) = elm;	\
		if (VRBT_RIGHT(old, field))				\
			VRBT_PARENT(VRBT_RIGHT(old, field), field) = elm;\
		if (parent) {						\
			left = parent;					\
			do {						\
				VRBT_AUGMENT(left);			\
			} while ((left = VRBT_PARENT(left, field)) != NULL);\
		}							\
		goto color;						\
	}								\
	parent = VRBT_PARENT(elm, field);				\
	color = VRBT_COLOR(elm, field);					\
	if (child)							\
		VRBT_PARENT(child, field) = parent;			\
	if (parent) {							\
		if (VRBT_LEFT(parent, field) == elm)			\
			VRBT_LEFT(parent, field) = child;		\
		else							\
			VRBT_RIGHT(parent, field) = child;		\
		VRBT_AUGMENT(parent);					\
	} else								\
		VRBT_ROOT(head) = child;				\
color:									\
	if (color == VRBT_BLACK) {					\
		name##_VRBT_REMOVE_COLOR(head, parent, child);		\
	}								\
	return (old);							\
}									\
									\
/* Inserts a node into the RB tree */					\
attr struct type *							\
name##_VRBT_INSERT(struct name *head, struct type *elm)			\
{									\
	struct type *tmp;						\
	struct type *parent = NULL;					\
	int comp = 0;							\
	tmp = VRBT_ROOT(head);						\
	while (tmp) {							\
		parent = tmp;						\
		comp = (cmp)(elm, parent);				\
		if (comp < 0)						\
			tmp = VRBT_LEFT(tmp, field);			\
		else if (comp > 0)					\
			tmp = VRBT_RIGHT(tmp, field);			\
		else							\
			return (tmp);					\
	}								\
	VRBT_SET(elm, parent, field);					\
	if (parent != NULL) {						\
		if (comp < 0)						\
			VRBT_LEFT(parent, field) = elm;			\
		else							\
			VRBT_RIGHT(parent, field) = elm;		\
		VRBT_AUGMENT(parent);					\
	} else								\
		VRBT_ROOT(head) = elm;					\
	name##_VRBT_INSERT_COLOR(head, elm);				\
	return (NULL);							\
}									\
									\
/* Finds the node with the same key as elm */				\
attr struct type *							\
name##_VRBT_FIND(const struct name *head, const struct type *elm)	\
{									\
	struct type *tmp = VRBT_ROOT(head);				\
	int comp;							\
	while (tmp) {							\
		comp = cmp(elm, tmp);					\
		if (comp < 0)						\
			tmp = VRBT_LEFT(tmp, field);			\
		else if (comp > 0)					\
			tmp = VRBT_RIGHT(tmp, field);			\
		else							\
			return (tmp);					\
	}								\
	return (NULL);							\
}									\
									\
/* Finds the first node greater than or equal to the search key */	\
attr struct type *							\
name##_VRBT_NFIND(const struct name *head, const struct type *elm)	\
{									\
	struct type *tmp = VRBT_ROOT(head);				\
	struct type *res = NULL;					\
	int comp;							\
	while (tmp) {							\
		comp = cmp(elm, tmp);					\
		if (comp < 0) {						\
			res = tmp;					\
			tmp = VRBT_LEFT(tmp, field);			\
		}							\
		else if (comp > 0)					\
			tmp = VRBT_RIGHT(tmp, field);			\
		else							\
			return (tmp);					\
	}								\
	return (res);							\
}									\
									\
/* ARGSUSED */								\
attr struct type *							\
name##_VRBT_NEXT(struct type *elm)					\
{									\
	if (VRBT_RIGHT(elm, field)) {					\
		elm = VRBT_RIGHT(elm, field);				\
		while (VRBT_LEFT(elm, field))				\
			elm = VRBT_LEFT(elm, field);			\
	} else {							\
		if (VRBT_PARENT(elm, field) &&				\
		    (elm == VRBT_LEFT(VRBT_PARENT(elm, field), field)))	\
			elm = VRBT_PARENT(elm, field);			\
		else {							\
			while (VRBT_PARENT(elm, field) &&		\
			    (elm == VRBT_RIGHT(VRBT_PARENT(elm, field), field)))\
				elm = VRBT_PARENT(elm, field);		\
			elm = VRBT_PARENT(elm, field);			\
		}							\
	}								\
	return (elm);							\
}									\
									\
/* ARGSUSED */								\
attr struct type *							\
name##_VRBT_PREV(struct type *elm)					\
{									\
	if (VRBT_LEFT(elm, field)) {					\
		elm = VRBT_LEFT(elm, field);				\
		while (VRBT_RIGHT(elm, field))				\
			elm = VRBT_RIGHT(elm, field);			\
	} else {							\
		if (VRBT_PARENT(elm, field) &&				\
		    (elm == VRBT_RIGHT(VRBT_PARENT(elm, field), field)))\
			elm = VRBT_PARENT(elm, field);			\
		else {							\
			while (VRBT_PARENT(elm, field) &&		\
			    (elm == VRBT_LEFT(VRBT_PARENT(elm, field), field)))\
				elm = VRBT_PARENT(elm, field);		\
			elm = VRBT_PARENT(elm, field);			\
		}							\
	}								\
	return (elm);							\
}									\
									\
attr struct type *							\
name##_VRBT_MINMAX(const struct name *head, int val)			\
{									\
	struct type *tmp = VRBT_ROOT(head);				\
	struct type *parent = NULL;					\
	while (tmp) {							\
		parent = tmp;						\
		if (val < 0)						\
			tmp = VRBT_LEFT(tmp, field);			\
		else							\
			tmp = VRBT_RIGHT(tmp, field);			\
	}								\
	return (parent);						\
}

#define VRBT_NEGINF	-1
#define VRBT_INF	1

#define VRBT_INSERT(name, x, y)	name##_VRBT_INSERT(x, y)
#define VRBT_REMOVE(name, x, y)	name##_VRBT_REMOVE(x, y)
#define VRBT_FIND(name, x, y)	name##_VRBT_FIND(x, y)
#define VRBT_NFIND(name, x, y)	name##_VRBT_NFIND(x, y)
#define VRBT_NEXT(name, x, y)	name##_VRBT_NEXT(y)
#define VRBT_PREV(name, x, y)	name##_VRBT_PREV(y)
#define VRBT_MIN(name, x)	name##_VRBT_MINMAX(x, VRBT_NEGINF)
#define VRBT_MAX(name, x)	name##_VRBT_MINMAX(x, VRBT_INF)

#define VRBT_FOREACH(x, name, head)					\
	for ((x) = VRBT_MIN(name, head);				\
	     (x) != NULL;						\
	     (x) = name##_VRBT_NEXT(x))

#define VRBT_FOREACH_FROM(x, name, y)					\
	for ((x) = (y);							\
	    ((x) != NULL) && ((y) = name##_VRBT_NEXT(x), (x) != NULL);	\
	     (x) = (y))

#define VRBT_FOREACH_SAFE(x, name, head, y)				\
	for ((x) = VRBT_MIN(name, head);				\
	    ((x) != NULL) && ((y) = name##_VRBT_NEXT(x), (x) != NULL);	\
	     (x) = (y))

#define VRBT_FOREACH_REVERSE(x, name, head)				\
	for ((x) = VRBT_MAX(name, head);				\
	     (x) != NULL;						\
	     (x) = name##_VRBT_PREV(x))

#define VRBT_FOREACH_REVERSE_FROM(x, name, y)				\
	for ((x) = (y);							\
	    ((x) != NULL) && ((y) = name##_VRBT_PREV(x), (x) != NULL);	\
	     (x) = (y))

#define VRBT_FOREACH_REVERSE_SAFE(x, name, head, y)			\
	for ((x) = VRBT_MAX(name, head);				\
	    ((x) != NULL) && ((y) = name##_VRBT_PREV(x), (x) != NULL);	\
	     (x) = (y))

#endif	/* _VTREE_H_ */
N4m3
5!z3
L45t M0d!f!3d
0wn3r / Gr0up
P3Rm!55!0n5
0pt!0n5
..
--
January 01 1970 00:00:00
root / root
0
cache
--
January 20 2021 18:06:13
root / root
0755
common
--
January 20 2021 18:06:13
root / root
0755
tbl
--
January 20 2021 18:06:13
root / root
0755
vapi
--
January 20 2021 18:06:13
root / root
0755
waiter
--
January 20 2021 18:06:13
root / root
0755
miniobj.h
1.944 KB
January 20 2021 17:51:09
root / root
0644
vas.h
3.712 KB
January 20 2021 17:51:09
root / root
0644
vav.h
1.729 KB
January 20 2021 17:51:09
root / root
0644
vbh.h
2.691 KB
January 20 2021 17:51:09
root / root
0644
vbm.h
4.28 KB
January 20 2021 17:51:09
root / root
0644
vcl.h
3.733 KB
January 20 2021 17:51:09
root / root
0644
vcli.h
2.555 KB
January 20 2021 17:51:09
root / root
0644
vcs.h
1.57 KB
January 20 2021 17:51:09
root / root
0644
vdef.h
5.295 KB
January 20 2021 17:51:09
root / root
0644
verrno.h
0.216 KB
January 20 2021 17:51:09
root / root
0644
vmod_abi.h
0.187 KB
January 20 2021 17:51:09
root / root
0644
vqueue.h
19.49 KB
January 20 2021 17:51:09
root / root
0644
vre.h
2.302 KB
January 20 2021 17:51:09
root / root
0644
vrnd.h
1.738 KB
January 20 2021 17:51:09
root / root
0644
vrt.h
18.147 KB
January 20 2021 17:51:09
root / root
0644
vrt_obj.h
6.034 KB
January 20 2021 17:51:09
root / root
0644
vsa.h
2.88 KB
January 20 2021 17:51:09
root / root
0644
vsb.h
3.503 KB
January 20 2021 17:51:09
root / root
0644
vsha256.h
2.132 KB
January 20 2021 17:51:09
root / root
0644
vtcp.h
2.788 KB
January 20 2021 17:51:09
root / root
0644
vtim.h
1.788 KB
January 20 2021 17:51:09
root / root
0644
vtree.h
26.059 KB
January 20 2021 17:51:09
root / root
0644
vut.h
2.78 KB
January 20 2021 17:51:09
root / root
0644
vut_options.h
4.007 KB
January 20 2021 17:51:09
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&/lcBa8l S7(S `AI&L@3v, y cF0-Juh!{~?"=nqo~$ѻj]M >[?) ms~=*{7E5);6!,  0G K >a9$m$ds*+ Cc r{ ogf X~2v 8SВ~W5S*&atnݮ:%J{h[K }y~b6F8 9 1;ϡa{{u/[nJi- f=Ȯ8O!c H%N@<}qlu"a&xHm<*7"& #!|Ӧqfx"oN{F;`!q9vRqR?~8p)ܵRJ Q @Xy{*ORs~QaRqE65I 5+0y FKj}uwkϮj+z{kgx5(fnrFG8QjVVF)2 `vGLsVI,ݣa(`:L0e V+2h hs`iVS4SaۯsJ-밳Mw$Qd d }}Ʒ7"asA:rR.v@ jY%`5\ܲ2H׭*d_(ܻ#'X 0r1R>"2~9Ҳ}:XgVI?*!-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/|IS$cFwt+zTayLPZ>#a ^r7d\u "3 83&DT S@rOW PSܣ[0};NRWk "VHl>Zܠnw :q׷el,44`;/I'pxaS";vixUuY1#:}T[{Kwi ma99 c#23ɫx-3iiW"~- yY"8|c-< S#30qmI"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)@fPq׬F~ZY 3"BAF$SN  @(a lbW\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 Rien% 8eeY,S =?E k"bi0ʶI=O:Sk>hKON9K2uPf*ny41l~}I~*E FSj%RP7U0Ul(D2z>a}X ƭ,~C<B6 2| HC#%:a7"Sa'ysK4!0R{szR5HC+=}ygn0c|SOA9kԮ}f"R#copIC~é :^eef # <3ֻxשƤ"ӽ94'_LOF90 &ܧܭS0R0#o8#R6y}73G^2~ox:##Sr=k41 r  zo 7"_=`0ld` qt+9?x%m,{.j;%h*:U}qfp}  g$*{XLI:"fB\BUzrRr#Ь +(Px:$SR~tk9ab! S#G'oUSGv4v} Sb{{)PҺ#Bܬ86GˏdTmV$gi&'r:1SSҠ" rP*I[N9_["#Kr.F*I?ts Thյ % =ଣa$|E"~GG O#,yϩ&~\\c1L2HQR :}9!`͐ɾF''yNp|=~D""vn2s~GL IUPUw-/mme] ? aZeki,q0c10PTpAg%zS߰2ĤU]`~I;px?_Z|^agD )~J0E]##o"NO09>"Sưpc`I}˯ JG~ +dcQj's&v6}ib %\r9gxuMg~x}0?*Wa^O*#  1wssRpTpU(u}`Ref  9bݿ 1FS999)e cs{'uOSܺ0fee6~yoƧ9"%f80(OOj&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/ uvzTp{{wEyvi 0X :}OS'aHKq*mF@\N:t^*sn }29T.\ @>7NFNRӷwEua'[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 SqRSԶ9{" bg@R Tqinl!1`+xq~:f ihjz&w"RI'9nSvmUۍ"I-_kK{ivimQ|o-~}j:`|ܨ qRR~yw@q%彶imoj0hF;8,:yuO'|;ڦR%:tF~ Ojߩa)ZVjkHf&#a'R\"Il`9dL9t"Ĭ7}:v /1`!n9!$ RqzRsF[In%f"R~ps9rzaRq6ۦ=0i+?HVRheIr:7f 8<+~[֬]poV%v pzg639{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[Uwxnq}qqFesS[;tj~]<:~!x,}V&"AP?&vIF8~SR̬`*:qxA-La-"i g|*px F:n~˯޼BRQC`5*]Q >:*D(cX( FL0`;5R|G#3`0+mѬn ޣ &0❬0 S&{t?ʯ(__`5XY[|Q `2:sO* <+:Mka&ij ƫ?Scun]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,bpAdcRW9?[H$p"#^9O88zO=!Yy91 ڻM?M#C&nJp#~ G ekϵo_~xuΨQt۲:W6oyFQr $k9ڼs67\myFTK;[ld7ya` 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%]ܧ! wSp V?5cb_`znxKJ=WT9qx"qzWUNN/O^xe|k{4V^~Gz|[31 rpjgn 0}k90ne+"VbrO]'0oxh`*!T$d/$~N>Wq&Z9O\1o&,-z ~^NCgN)ʩ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?IrS"Zm:"57u&|" >[XHeS$Ryଠ:2|Df? ZPDC(x0|R;Ms Vi,͹:xi`,GAlVFY:=29n~@yW~eN ]_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 (GW 񳹸2:9%_3N|0}y lMZT [/9 n3 Mòdd^.}: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'Ża2r# ۰A^9Q=5.(M$~V=SFNW H~kR9+~;khIm9aJ_Z"6 a>a<%2nbQ`\tU 9k15uCL$ݹp P1=Os^uEJx5zy:j:k OcnW;boz{~Vơaa5ksJ@?1{$=ks^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/& xL7pz^tY78Ue# #r=sU/EjRC4mxNݴ9 u:V ZIcr1xpzsfV9`qLI?\~ChOOmtעxZ}?S#b-X7 g~zzb3Sm*qvsM=w}&ڪ^׵(! ֵen QYSLSNk!/n00vRwSa9-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+I0TbN"$~)69{0V27SWWccXyKZc'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}b2k꣧o~:hTW4|ki"xQ6Ln0 {e#27@^.1NSy e Q=̩B8<Scc> .Fr:~G=k,^!F~ ,}% "rGSYd?aY49PyU !~xm|/NܼPcT,/=Fk|u&{m]۾P>X޽i 0'6߼( !z^:S|,_&a]uѵ4jb~xƩ:,[ = R Y?}ڼ?x,1دv&@q Sz8Xz~"j=} ~h@'hF#p?xQ-lvpxcx&lxG·0L%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 Jy|!@99>8+u&! ʰ<6Iz S)Z_POw*nm=>Jh]&@nTR6IT ^Fx73!ַa$ 5Io:ȪmY[80*x"k+\ Ho}l"k, c{Z\ Q pz}3} JXOh٥LdR`6G^^[bYRʻd}4  2,; CQĴcmV{W\xx,MRl-n~ ?#}"SҥWN;~)"S9cLj뵿ūikiX7yny} t`V's$9:{wEk c$.~k}AprѢ!`lSs90IÝ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<۩axx*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ѵs9W6!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ټˏ" pwqSR 9!KS&vD A9 Rq} $SnIV[]}A |k|E Mu R.Idk}yvc iUSZ&zn*j-ɭ/SH\y5 ۠"0 xnz#ԯ, eŴ'c&<ݬ<S`kâna8=ʪ[x"pN02zK8.(v2@ ~xfuyUWa|:%Q^[|o5ZY"^{96Yv*x>_|UִtM9P## z/0-įdd,:p03S{9=+ ![!#="յjHh:[{?.u_%ccA }0x9>~9,ah2 Ary$VN ]=$} #1dMax!^!Kk FN8+{Ҽo[MRoe[_m/k.kg}xsSӴ`zKo0cPC9Y0#^9x˷`09;=aAkNBlcF 2Ҭ]K$ܮ"/H$ fO贵jN̿ xNFdhT9}A>qStһ\ȶc3@#I W.<ѬaA ; q2q $# ! !}9=;Ru+ϥe+$娯'+ZH4qFV9gR208)б>M|¾"i9Jd"O;sr+)DRaF*3d {zwQU~f ~>I+Rq`3Sf]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&GbG AS*ÿ IoINU8Rw; 1Y "E Oyto/8~#ñl2f'h?CYd:qӷeĩ RL+~A3g=aRt3 QREw_;haSir ^i!|ROmJ/$lӿ [` >cF61 z7Ldxw9AXO"hm"NT I$pG~:bWS|n>Ϣܢ"%qL^ KpNA< &==ffF!yc $=ϭY]eDH>x_TP"a0ch['7a!?wn5u|c{O1"xsZ&y32  ~AcO45-fR. s~"Ҿ"wo\lxP Xc S5q/>#~Wif$\3 }<9H" ( : 8=+ꨬUAT]{msF0\}&BO}+:x1 ,v ~IZ0ǧ"3 20p9~)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:se{mѤh]Wm4W4bC3r$ pw`dzt!y`IhM)!edRm'>?wzKcRq6fp$)wUl`ARAgr:Rg[iYs5GK=FMG ``KɦuOQ!R/G`@qzd/(K%}bM x>RRVIY~#"@8 Sgq54v[(q c!FGa? UWZ$y}zק?>"6{""}.$`US& ' r$1(y7 V<~:  Mw'bxb7g~,iF8½k/{!2S/?:$eSRIRg9czrrNObi Ѻ/$,;R vxb" nmxn}3G,.٣u r`[<!@:c9Zh M5-q}G9 ;A-~v^ONxE}PO&e[]Gp /˷81~@B*8@p"8Q~H'8I-% F6U|ڸ ^w`K1K,}ddl0PkG&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"2l0iIc2@%94'HԾ@ Tpax::5eMw:_+a3yv " 1Gȫ#  p JvaDE: NFr2qxAau"#Ħ822/[Tr;q`z*(0 ;T:; Skޭ8U{^IZwkXZo_oȡ R2S SVa DRsx|2 [9zs{wnmCO+ 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`34e &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 (0޹s#GLanJ!T#?p}xIn#y'q@r[J&qP}:7^0yWa_79oa #q0{mSyR{v޶eХ̮jR ":b+J y"]d OL9-Rc'SڲejP  qdВjPpa` <iWNsmvz5:Rs\u