mirror of
https://gitlab.xiph.org/xiph/icecast-common.git
synced 2024-12-04 14:46:31 -05:00
508795aa8b
- connections are now matched to format plugins based on content-type headers, and are rejected if there isn't a format handler for that content-type, or there is no content-type at all. - format_vorbis now handles pages with granulepos of -1 in the headers correctly (this happens if the headers are fairly large, because of many comments, for example). - various #include fixes. - buffer overflow in httpp.c fixed. svn path=/trunk/avl/; revision=3042
170 lines
3.4 KiB
C
170 lines
3.4 KiB
C
/*
|
|
* Copyright (C) 1995 by Sam Rushing <rushing@nightmare.com>
|
|
*/
|
|
|
|
/* $Id: avl.h,v 1.2 2002/02/11 09:11:18 msmith Exp $ */
|
|
|
|
#ifndef __AVL_H
|
|
#define __AVL_H
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
#include "thread.h"
|
|
|
|
typedef struct avl_node_tag {
|
|
void * key;
|
|
struct avl_node_tag * left;
|
|
struct avl_node_tag * right;
|
|
struct avl_node_tag * parent;
|
|
/*
|
|
* The lower 2 bits of <rank_and_balance> specify the balance
|
|
* factor: 00==-1, 01==0, 10==+1.
|
|
* The rest of the bits are used for <rank>
|
|
*/
|
|
unsigned long rank_and_balance;
|
|
|
|
rwlock_t rwlock;
|
|
} avl_node;
|
|
|
|
#define AVL_GET_BALANCE(n) ((int)(((n)->rank_and_balance & 3) - 1))
|
|
|
|
#define AVL_GET_RANK(n) (((n)->rank_and_balance >> 2))
|
|
|
|
#define AVL_SET_BALANCE(n,b) \
|
|
((n)->rank_and_balance) = \
|
|
(((n)->rank_and_balance & (~3)) | ((int)((b) + 1)))
|
|
|
|
#define AVL_SET_RANK(n,r) \
|
|
((n)->rank_and_balance) = \
|
|
(((n)->rank_and_balance & 3) | (r << 2))
|
|
|
|
struct _avl_tree;
|
|
|
|
typedef int (*avl_key_compare_fun_type) (void * compare_arg, void * a, void * b);
|
|
typedef int (*avl_iter_fun_type) (void * key, void * iter_arg);
|
|
typedef int (*avl_iter_index_fun_type) (unsigned long index, void * key, void * iter_arg);
|
|
typedef int (*avl_free_key_fun_type) (void * key);
|
|
typedef int (*avl_key_printer_fun_type) (char *, void *);
|
|
|
|
/*
|
|
* <compare_fun> and <compare_arg> let us associate a particular compare
|
|
* function with each tree, separately.
|
|
*/
|
|
|
|
typedef struct _avl_tree {
|
|
avl_node * root;
|
|
unsigned long height;
|
|
unsigned long length;
|
|
avl_key_compare_fun_type compare_fun;
|
|
void * compare_arg;
|
|
|
|
rwlock_t rwlock;
|
|
} avl_tree;
|
|
|
|
avl_tree * avl_tree_new (avl_key_compare_fun_type compare_fun, void * compare_arg);
|
|
avl_node * avl_node_new (void * key, avl_node * parent);
|
|
|
|
void avl_tree_free (
|
|
avl_tree * tree,
|
|
avl_free_key_fun_type free_key_fun
|
|
);
|
|
|
|
int avl_insert (
|
|
avl_tree * ob,
|
|
void * key
|
|
);
|
|
|
|
int avl_delete (
|
|
avl_tree * tree,
|
|
void * key,
|
|
avl_free_key_fun_type free_key_fun
|
|
);
|
|
|
|
int avl_get_by_index (
|
|
avl_tree * tree,
|
|
unsigned long index,
|
|
void ** value_address
|
|
);
|
|
|
|
int avl_get_by_key (
|
|
avl_tree * tree,
|
|
void * key,
|
|
void ** value_address
|
|
);
|
|
|
|
int avl_iterate_inorder (
|
|
avl_tree * tree,
|
|
avl_iter_fun_type iter_fun,
|
|
void * iter_arg
|
|
);
|
|
|
|
int avl_iterate_index_range (
|
|
avl_tree * tree,
|
|
avl_iter_index_fun_type iter_fun,
|
|
unsigned long low,
|
|
unsigned long high,
|
|
void * iter_arg
|
|
);
|
|
|
|
int avl_get_span_by_key (
|
|
avl_tree * tree,
|
|
void * key,
|
|
unsigned long * low,
|
|
unsigned long * high
|
|
);
|
|
|
|
int avl_get_span_by_two_keys (
|
|
avl_tree * tree,
|
|
void * key_a,
|
|
void * key_b,
|
|
unsigned long * low,
|
|
unsigned long * high
|
|
);
|
|
|
|
int avl_verify (avl_tree * tree);
|
|
|
|
void avl_print_tree (
|
|
avl_tree * tree,
|
|
avl_key_printer_fun_type key_printer
|
|
);
|
|
|
|
avl_node *avl_get_first(avl_tree *tree);
|
|
|
|
avl_node *avl_get_prev(avl_node * node);
|
|
|
|
avl_node *avl_get_next(avl_node * node);
|
|
|
|
/* These two are from David Ascher <david_ascher@brown.edu> */
|
|
|
|
int avl_get_item_by_key_most (
|
|
avl_tree * tree,
|
|
void * key,
|
|
void ** value_address
|
|
);
|
|
|
|
int avl_get_item_by_key_least (
|
|
avl_tree * tree,
|
|
void * key,
|
|
void ** value_address
|
|
);
|
|
|
|
/* optional locking stuff */
|
|
void avl_tree_rlock(avl_tree *tree);
|
|
void avl_tree_wlock(avl_tree *tree);
|
|
void avl_tree_unlock(avl_tree *tree);
|
|
void avl_node_rlock(avl_node *node);
|
|
void avl_node_wlock(avl_node *node);
|
|
void avl_node_unlock(avl_node *node);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|
|
|
|
#endif /* __AVL_H */
|
|
|
|
|
|
|
|
|