1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
|
/* $OpenBSD: expand.c,v 1.8 2010/06/01 23:06:23 jacekm Exp $ */
/*
* Copyright (c) 2009 Gilles Chehade <gilles@openbsd.org>
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#include <sys/types.h>
#include <sys/queue.h>
#include <sys/tree.h>
#include <sys/param.h>
#include <sys/socket.h>
#include <ctype.h>
#include <errno.h>
#include <event.h>
#include <fcntl.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "smtpd.h"
struct expandnode *
expandtree_lookup(struct expandtree *tree, struct expandnode *node)
{
struct expandnode key;
key = *node;
return RB_FIND(expandtree, tree, &key);
}
void
expandtree_increment_node(struct expandtree *tree, struct expandnode *node)
{
struct expandnode *p;
p = expandtree_lookup(tree, node);
if (p == NULL) {
p = malloc(sizeof *node);
if (p == NULL)
fatal(NULL);
*p = *node; /* XXX p->refcnt == node->refcnt */
RB_INSERT(expandtree, tree, p);
}
p->refcnt++;
}
void
expandtree_decrement_node(struct expandtree *expandtree, struct expandnode *node)
{
struct expandnode *p;
p = expandtree_lookup(expandtree, node);
if (p == NULL)
fatalx("expandtree_decrement_node: node doesn't exist.");
p->refcnt--;
}
void
expandtree_remove_node(struct expandtree *expandtree, struct expandnode *node)
{
struct expandnode *p;
p = expandtree_lookup(expandtree, node);
if (p == NULL)
fatalx("expandtree_remove: node doesn't exist.");
RB_REMOVE(expandtree, expandtree, p);
}
void
expandtree_free_nodes(struct expandtree *expandtree)
{
struct expandnode *p;
while ((p = RB_MIN(expandtree, expandtree))) {
RB_REMOVE(expandtree, expandtree, p);
free(p);
}
}
int
expand_cmp(struct expandnode *e1, struct expandnode *e2)
{
if (e1->type < e2->type)
return -1;
if (e1->type > e2->type)
return 1;
return memcmp(&e1->u, &e2->u, sizeof(e1->u));
}
RB_GENERATE(expandtree, expandnode, entry, expand_cmp);
|
