blob: 628c466fa11a47a78fbf9a2f5e0d70df281bd738 (
plain)
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
|
/*
*
* Copyright (c) 2018 Huawei Technologies Co.,Ltd.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#ifndef _NSTACK_LOG_SUPPRESS_RB_TREE_H_
#define _NSTACK_LOG_SUPPRESS_RB_TREE_H_
#include "nstack_log.h"
typedef int (*log_entry_worker_fn) (log_entry * entry);
typedef int (*log_entry_cpmpare_fn) (const log_entry * left,
const log_entry * right);
log_sup_node *__log_sup_rb_insert(log_entry * entry, log_sup_node ** root);
log_sup_node *__log_sup_rb_search(const log_entry * entry,
log_sup_node * root);
void __log_sup_rb_erase(log_sup_node * node, log_sup_node ** root);
void __log_sup_rb_traversal_preorder(log_sup_node * root,
log_entry_worker_fn foo,
log_sup_node ** resnode, int *recur_cnt);
#endif
|
