⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 talloc.c

📁 samba-3.0.22.tar.gz 编译smb服务器的源码
💻 C
📖 第 1 页 / 共 2 页
字号:
/*   Samba Unix SMB/CIFS implementation.   Samba trivial allocation library - new interface   NOTE: Please read talloc_guide.txt for full documentation   Copyright (C) Andrew Tridgell 2004     ** NOTE! The following LGPL license applies to the talloc     ** library. This does NOT imply that all of Samba is released     ** under the LGPL   This library is free software; you can redistribute it and/or   modify it under the terms of the GNU Lesser General Public   License as published by the Free Software Foundation; either   version 2 of the License, or (at your option) any later version.   This library 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   Lesser General Public License for more details.   You should have received a copy of the GNU Lesser General Public   License along with this library; if not, write to the Free Software   Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA*//*  inspired by http://swapped.cc/halloc/*/#ifdef _SAMBA_BUILD_#include "includes.h"#if ((SAMBA_VERSION_MAJOR==3)&&(SAMBA_VERSION_MINOR<9))/* This is to circumvent SAMBA3's paranoid malloc checker. Here in this file * we trust ourselves... */#ifdef malloc#undef malloc#endif#ifdef realloc#undef realloc#endif#endif#else#include <stdio.h>#include <stdlib.h>#include <string.h>#include <stdarg.h>#include <stdint.h>#include "talloc.h"/* assume a modern system */#define HAVE_VA_COPY#endif/* use this to force every realloc to change the pointer, to stress test   code that might not cope */#define ALWAYS_REALLOC 0#define MAX_TALLOC_SIZE 0x10000000#define TALLOC_MAGIC 0xe814ec70#define TALLOC_FLAG_FREE 0x01#define TALLOC_FLAG_LOOP 0x02#define TALLOC_MAGIC_REFERENCE ((const char *)1)/* by default we abort when given a bad pointer (such as when talloc_free() is called    on a pointer that came from malloc() */#ifndef TALLOC_ABORT#define TALLOC_ABORT(reason) abort()#endif#ifndef discard_const_p#if defined(__intptr_t_defined) || defined(HAVE_INTPTR_T)# define discard_const_p(type, ptr) ((type *)((intptr_t)(ptr)))#else# define discard_const_p(type, ptr) ((type *)(ptr))#endif#endif/* this null_context is only used if talloc_enable_leak_report() or   talloc_enable_leak_report_full() is called, otherwise it remains   NULL*/static const void *null_context;static void *cleanup_context;struct talloc_reference_handle {	struct talloc_reference_handle *next, *prev;	void *ptr;};typedef int (*talloc_destructor_t)(void *);struct talloc_chunk {	struct talloc_chunk *next, *prev;	struct talloc_chunk *parent, *child;	struct talloc_reference_handle *refs;	talloc_destructor_t destructor;	const char *name;	size_t size;	unsigned flags;};/* 16 byte alignment seems to keep everyone happy */#define TC_HDR_SIZE ((sizeof(struct talloc_chunk)+15)&~15)#define TC_PTR_FROM_CHUNK(tc) ((void *)(TC_HDR_SIZE + (char*)tc))/* panic if we get a bad magic value */static struct talloc_chunk *talloc_chunk_from_ptr(const void *ptr){	const char *pp = ptr;	struct talloc_chunk *tc = discard_const_p(struct talloc_chunk, pp - TC_HDR_SIZE);	if ((tc->flags & ~0xF) != TALLOC_MAGIC) { 		TALLOC_ABORT("Bad talloc magic value - unknown value"); 	}	if (tc->flags & TALLOC_FLAG_FREE) {		TALLOC_ABORT("Bad talloc magic value - double free"); 	}	return tc;}/* hook into the front of the list */#define _TLIST_ADD(list, p) \do { \        if (!(list)) { \		(list) = (p); \		(p)->next = (p)->prev = NULL; \	} else { \		(list)->prev = (p); \		(p)->next = (list); \		(p)->prev = NULL; \		(list) = (p); \	}\} while (0)/* remove an element from a list - element doesn't have to be in list. */#define _TLIST_REMOVE(list, p) \do { \	if ((p) == (list)) { \		(list) = (p)->next; \		if (list) (list)->prev = NULL; \	} else { \		if ((p)->prev) (p)->prev->next = (p)->next; \		if ((p)->next) (p)->next->prev = (p)->prev; \	} \	if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \} while (0)/*  return the parent chunk of a pointer*/static struct talloc_chunk *talloc_parent_chunk(const void *ptr){	struct talloc_chunk *tc = talloc_chunk_from_ptr(ptr);	while (tc->prev) tc=tc->prev;	return tc->parent;}void *talloc_parent(const void *ptr){	struct talloc_chunk *tc = talloc_parent_chunk(ptr);	return tc? TC_PTR_FROM_CHUNK(tc) : NULL;}/*    Allocate a bit of memory as a child of an existing pointer*/void *_talloc(const void *context, size_t size){	struct talloc_chunk *tc;	if (context == NULL) {		context = null_context;	}	if (size >= MAX_TALLOC_SIZE) {		return NULL;	}	tc = malloc(TC_HDR_SIZE+size);	if (tc == NULL) return NULL;	tc->size = size;	tc->flags = TALLOC_MAGIC;	tc->destructor = NULL;	tc->child = NULL;	tc->name = NULL;	tc->refs = NULL;	if (context) {		struct talloc_chunk *parent = talloc_chunk_from_ptr(context);		tc->parent = parent;		if (parent->child) {			parent->child->parent = NULL;		}		_TLIST_ADD(parent->child, tc);	} else {		tc->next = tc->prev = tc->parent = NULL;	}	return TC_PTR_FROM_CHUNK(tc);}/*  setup a destructor to be called on free of a pointer  the destructor should return 0 on success, or -1 on failure.  if the destructor fails then the free is failed, and the memory can  be continued to be used*/void talloc_set_destructor(const void *ptr, int (*destructor)(void *)){	struct talloc_chunk *tc = talloc_chunk_from_ptr(ptr);	tc->destructor = destructor;}/*  increase the reference count on a piece of memory. */void talloc_increase_ref_count(const void *ptr){	talloc_reference(null_context, ptr);}/*  helper for talloc_reference()*/static int talloc_reference_destructor(void *ptr){	struct talloc_reference_handle *handle = ptr;	struct talloc_chunk *tc1 = talloc_chunk_from_ptr(ptr);	struct talloc_chunk *tc2 = talloc_chunk_from_ptr(handle->ptr);	if (tc1->destructor != (talloc_destructor_t)-1) {		tc1->destructor = NULL;	}	_TLIST_REMOVE(tc2->refs, handle);	talloc_free(handle);	return 0;}/*  make a secondary reference to a pointer, hanging off the given context.  the pointer remains valid until both the original caller and this given  context are freed.    the major use for this is when two different structures need to reference the   same underlying data, and you want to be able to free the two instances separately,  and in either order*/void *talloc_reference(const void *context, const void *ptr){	struct talloc_chunk *tc;	struct talloc_reference_handle *handle;	if (ptr == NULL) return NULL;	tc = talloc_chunk_from_ptr(ptr);	handle = talloc_named_const(context, sizeof(*handle), TALLOC_MAGIC_REFERENCE);	if (handle == NULL) return NULL;	/* note that we hang the destructor off the handle, not the	   main context as that allows the caller to still setup their	   own destructor on the context if they want to */	talloc_set_destructor(handle, talloc_reference_destructor);	handle->ptr = discard_const_p(void, ptr);	_TLIST_ADD(tc->refs, handle);	return handle->ptr;}/*  remove a secondary reference to a pointer. This undo's what  talloc_reference() has done. The context and pointer arguments  must match those given to a talloc_reference()*/static int talloc_unreference(const void *context, const void *ptr){	struct talloc_chunk *tc = talloc_chunk_from_ptr(ptr);	struct talloc_reference_handle *h;	if (context == NULL) {		context = null_context;	}	for (h=tc->refs;h;h=h->next) {		struct talloc_chunk *p = talloc_parent_chunk(h);		if ((p==NULL && context==NULL) || TC_PTR_FROM_CHUNK(p) == context) break;	}	if (h == NULL) {		return -1;	}	talloc_set_destructor(h, NULL);	_TLIST_REMOVE(tc->refs, h);	talloc_free(h);	return 0;}/*  remove a specific parent context from a pointer. This is a more  controlled varient of talloc_free()*/int talloc_unlink(const void *context, void *ptr){	struct talloc_chunk *tc_p, *new_p;	void *new_parent;	if (ptr == NULL) {		return -1;	}	if (context == NULL) {		context = null_context;	}	if (talloc_unreference(context, ptr) == 0) {		return 0;	}	if (context == NULL) {		if (talloc_parent_chunk(ptr) != NULL) {			return -1;		}	} else {		if (talloc_chunk_from_ptr(context) != talloc_parent_chunk(ptr)) {			return -1;		}	}		tc_p = talloc_chunk_from_ptr(ptr);	if (tc_p->refs == NULL) {		return talloc_free(ptr);	}	new_p = talloc_parent_chunk(tc_p->refs);	if (new_p) {		new_parent = TC_PTR_FROM_CHUNK(new_p);	} else {		new_parent = NULL;	}	if (talloc_unreference(new_parent, ptr) != 0) {		return -1;	}	talloc_steal(new_parent, ptr);	return 0;}/*  add a name to an existing pointer - va_list version*/static void talloc_set_name_v(const void *ptr, const char *fmt, va_list ap) PRINTF_ATTRIBUTE(2,0);static void talloc_set_name_v(const void *ptr, const char *fmt, va_list ap){	struct talloc_chunk *tc = talloc_chunk_from_ptr(ptr);	tc->name = talloc_vasprintf(ptr, fmt, ap);	if (tc->name) {		talloc_set_name_const(tc->name, ".name");	}}/*  add a name to an existing pointer*/void talloc_set_name(const void *ptr, const char *fmt, ...){	va_list ap;	va_start(ap, fmt);	talloc_set_name_v(ptr, fmt, ap);	va_end(ap);}/*   more efficient way to add a name to a pointer - the name must point to a    true string constant*/void talloc_set_name_const(const void *ptr, const char *name){	struct talloc_chunk *tc = talloc_chunk_from_ptr(ptr);	tc->name = name;}/*  create a named talloc pointer. Any talloc pointer can be named, and  talloc_named() operates just like talloc() except that it allows you  to name the pointer.*/void *talloc_named(const void *context, size_t size, const char *fmt, ...){	va_list ap;	void *ptr;	ptr = _talloc(context, size);	if (ptr == NULL) return NULL;	va_start(ap, fmt);	talloc_set_name_v(ptr, fmt, ap);	va_end(ap);	return ptr;}/*  create a named talloc pointer. Any talloc pointer can be named, and  talloc_named() operates just like talloc() except that it allows you  to name the pointer.*/void *talloc_named_const(const void *context, size_t size, const char *name){	void *ptr;	ptr = _talloc(context, size);	if (ptr == NULL) {		return NULL;	}	talloc_set_name_const(ptr, name);	return ptr;}/*  return the name of a talloc ptr, or "UNNAMED"*/const char *talloc_get_name(const void *ptr){	struct talloc_chunk *tc = talloc_chunk_from_ptr(ptr);	if (tc->name == TALLOC_MAGIC_REFERENCE) {		return ".reference";	}	if (tc->name) {		return tc->name;	}	return "UNNAMED";}/*  check if a pointer has the given name. If it does, return the pointer,  otherwise return NULL*/void *talloc_check_name(const void *ptr, const char *name){	const char *pname;	if (ptr == NULL) return NULL;	pname = talloc_get_name(ptr);	if (pname == name || strcmp(pname, name) == 0) {		return discard_const_p(void, ptr);	}	return NULL;}/*  this is for compatibility with older versions of talloc*/void *talloc_init(const char *fmt, ...){	va_list ap;	void *ptr;	talloc_enable_null_tracking();	ptr = _talloc(NULL, 0);	if (ptr == NULL) return NULL;	va_start(ap, fmt);	talloc_set_name_v(ptr, fmt, ap);	va_end(ap);	return ptr;}/*  this is a replacement for the Samba3 talloc_destroy_pool functionality. It  should probably not be used in new code. It's in here to keep the talloc  code consistent across Samba 3 and 4.*/void talloc_free_children(void *ptr){	struct talloc_chunk *tc;	if (ptr == NULL) {		return;	}	tc = talloc_chunk_from_ptr(ptr);	while (tc->child) {		/* we need to work out who will own an abandoned child		   if it cannot be freed. In priority order, the first		   choice is owner of any remaining reference to this		   pointer, the second choice is our parent, and the		   final choice is the null context. */		void *child = TC_PTR_FROM_CHUNK(tc->child);		const void *new_parent = null_context;		if (tc->child->refs) {			struct talloc_chunk *p = talloc_parent_chunk(tc->child->refs);			if (p) new_parent = TC_PTR_FROM_CHUNK(p);		}		if (talloc_free(child) == -1) {			if (new_parent == null_context) {				struct talloc_chunk *p = talloc_parent_chunk(ptr);				if (p) new_parent = TC_PTR_FROM_CHUNK(p);			}			talloc_steal(new_parent, child);		}	}}/*    free a talloc pointer. This also frees all child pointers of this    pointer recursively   return 0 if the memory is actually freed, otherwise -1. The memory   will not be freed if the ref_count is > 1 or the destructor (if   any) returns non-zero*/int talloc_free(void *ptr){	struct talloc_chunk *tc;	if (ptr == NULL) {		return -1;	}	tc = talloc_chunk_from_ptr(ptr);	if (tc->refs) {		talloc_reference_destructor(tc->refs);		return -1;	}	if (tc->flags & TALLOC_FLAG_LOOP) {		/* we have a free loop - stop looping */		return 0;	}	if (tc->destructor) {		talloc_destructor_t d = tc->destructor;		if (d == (talloc_destructor_t)-1) {			return -1;		}		tc->destructor = (talloc_destructor_t)-1;		if (d(ptr) == -1) {			tc->destructor = d;			return -1;		}		tc->destructor = NULL;	}	tc->flags |= TALLOC_FLAG_LOOP;	talloc_free_children(ptr);	if (tc->parent) {		_TLIST_REMOVE(tc->parent->child, tc);		if (tc->parent->child) {			tc->parent->child->parent = tc->parent;		}	} else {		if (tc->prev) tc->prev->next = tc->next;		if (tc->next) tc->next->prev = tc->prev;	}	tc->flags |= TALLOC_FLAG_FREE;	free(tc);	return 0;}/*  A talloc version of realloc. The context argument is only used if  ptr is NULL*/void *_talloc_realloc(const void *context, void *ptr, size_t size, const char *name){	struct talloc_chunk *tc;	void *new_ptr;	/* size zero is equivalent to free() */	if (size == 0) {		talloc_free(ptr);		return NULL;	}	if (size >= MAX_TALLOC_SIZE) {		return NULL;	}	/* realloc(NULL) is equavalent to malloc() */	if (ptr == NULL) {		return talloc_named_const(context, size, name);	}	tc = talloc_chunk_from_ptr(ptr);	/* don't allow realloc on referenced pointers */	if (tc->refs) {		return NULL;	}	/* by resetting magic we catch users of the old memory */	tc->flags |= TALLOC_FLAG_FREE;#if ALWAYS_REALLOC	new_ptr = malloc(size + TC_HDR_SIZE);	if (new_ptr) {		memcpy(new_ptr, tc, tc->size + TC_HDR_SIZE);		free(tc);	}#else	new_ptr = realloc(tc, size + TC_HDR_SIZE);#endif	if (!new_ptr) {			tc->flags &= ~TALLOC_FLAG_FREE; 		return NULL; 	}	tc = new_ptr;	tc->flags &= ~TALLOC_FLAG_FREE; 	if (tc->parent) {		tc->parent->child = new_ptr;	}	if (tc->child) {		tc->child->parent = new_ptr;	}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -