b902641d73
I've also added insque(3) and remque(3) (from NetBSD because the OpenBSD
ones are currently broken for non-circular lists).
I've not added the three hash table functions that should be in this header
because they operate on a single global hash table and thus aren't likely
to be useful.
Bug: https://code.google.com/p/android/issues/detail?id=73719
(cherry picked from commit 3e424d0a24)
Change-Id: I5882a6b48c80fea8ac6b9c27e7b9de10b202b4ff
36 lines
1.1 KiB
C++
36 lines
1.1 KiB
C++
/*
|
|
* Copyright (C) 2012 The Android Open Source Project
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
#define _SEARCH_PRIVATE
|
|
#include <search.h>
|
|
#include <stdlib.h>
|
|
|
|
// Destroy a tree and free all allocated resources.
|
|
// This is a GNU extension, not available from BSD.
|
|
void tdestroy(void* root, void (*destroy_func)(void*)) {
|
|
node_t* root_node = (node_t*) root;
|
|
if (root_node == NULL) {
|
|
return;
|
|
}
|
|
if (root_node->llink) {
|
|
tdestroy(root_node->llink, destroy_func);
|
|
}
|
|
if (root_node->rlink) {
|
|
tdestroy(root_node->rlink, destroy_func);
|
|
}
|
|
(*destroy_func)(root_node->key);
|
|
free(root);
|
|
}
|