mirror of
https://gitlab.isc.org/isc-projects/bind9
synced 2025-08-24 11:08:45 +00:00
58bd26b6cf
This commit converts the license handling to adhere to the REUSE specification. It specifically: 1. Adds used licnses to LICENSES/ directory 2. Add "isc" template for adding the copyright boilerplate 3. Changes all source files to include copyright and SPDX license header, this includes all the C sources, documentation, zone files, configuration files. There are notes in the doc/dev/copyrights file on how to add correct headers to the new files. 4. Handle the rest that can't be modified via .reuse/dep5 file. The binary (or otherwise unmodifiable) files could have license places next to them in <foo>.license file, but this would lead to cluttered repository and most of the files handled in the .reuse/dep5 file are system test files.
86 lines
1.8 KiB
C
86 lines
1.8 KiB
C
/*
|
|
* Copyright (C) Internet Systems Consortium, Inc. ("ISC")
|
|
*
|
|
* SPDX-License-Identifier: MPL-2.0
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, you can obtain one at https://mozilla.org/MPL/2.0/.
|
|
*
|
|
* See the COPYRIGHT file distributed with this work for additional
|
|
* information regarding copyright ownership.
|
|
*/
|
|
|
|
#include <inttypes.h>
|
|
#include <string.h>
|
|
|
|
#include <isc/astack.h>
|
|
#include <isc/atomic.h>
|
|
#include <isc/mem.h>
|
|
#include <isc/mutex.h>
|
|
#include <isc/types.h>
|
|
#include <isc/util.h>
|
|
|
|
struct isc_astack {
|
|
isc_mem_t *mctx;
|
|
size_t size;
|
|
size_t pos;
|
|
isc_mutex_t lock;
|
|
uintptr_t nodes[];
|
|
};
|
|
|
|
isc_astack_t *
|
|
isc_astack_new(isc_mem_t *mctx, size_t size) {
|
|
isc_astack_t *stack = isc_mem_get(
|
|
mctx, sizeof(isc_astack_t) + size * sizeof(uintptr_t));
|
|
|
|
*stack = (isc_astack_t){
|
|
.size = size,
|
|
};
|
|
isc_mem_attach(mctx, &stack->mctx);
|
|
memset(stack->nodes, 0, size * sizeof(uintptr_t));
|
|
isc_mutex_init(&stack->lock);
|
|
return (stack);
|
|
}
|
|
|
|
bool
|
|
isc_astack_trypush(isc_astack_t *stack, void *obj) {
|
|
if (!isc_mutex_trylock(&stack->lock)) {
|
|
if (stack->pos >= stack->size) {
|
|
UNLOCK(&stack->lock);
|
|
return (false);
|
|
}
|
|
stack->nodes[stack->pos++] = (uintptr_t)obj;
|
|
UNLOCK(&stack->lock);
|
|
return (true);
|
|
} else {
|
|
return (false);
|
|
}
|
|
}
|
|
|
|
void *
|
|
isc_astack_pop(isc_astack_t *stack) {
|
|
LOCK(&stack->lock);
|
|
uintptr_t rv;
|
|
if (stack->pos == 0) {
|
|
rv = 0;
|
|
} else {
|
|
rv = stack->nodes[--stack->pos];
|
|
}
|
|
UNLOCK(&stack->lock);
|
|
return ((void *)rv);
|
|
}
|
|
|
|
void
|
|
isc_astack_destroy(isc_astack_t *stack) {
|
|
LOCK(&stack->lock);
|
|
REQUIRE(stack->pos == 0);
|
|
UNLOCK(&stack->lock);
|
|
|
|
isc_mutex_destroy(&stack->lock);
|
|
|
|
isc_mem_putanddetach(&stack->mctx, stack,
|
|
sizeof(struct isc_astack) +
|
|
stack->size * sizeof(uintptr_t));
|
|
}
|