Repository navigation
Expand file tree
/
Copy pathfilter.h
More file actions
54 lines (50 loc) · 2.05 KB
/
Copy pathfilter.h
File metadata and controls
54 lines (50 loc) · 2.05 KB
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
/*
* Copyright (c) 2002, 2003, 2004 Niels Provos <provos@citi.umich.edu>
* All rights reserved.
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program 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 General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifndef _FILTER_H_
#define _FILTER_H_
/*
* Very simple filtering based on a count. We insert the count and a
* back-pointer for all keys and then select the top numbers.
*/
struct report;
struct filter {
SPLAY_ENTRY(filter) node;
uint32_t count;
void *report;
};
struct filtertree;
struct filtertree *filter_create(void);
void filter_free(struct filtertree *);
void filter_insert(struct filtertree *filters, uint32_t count, void *report);
void filter_top(struct filtertree *filters, int n,
void (*cb)(void *, void *), void *);
#endif /* _FILTER_H_ */