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

📄 protected.c

📁 The Kannel Open Source WAP and SMS gateway works as both an SMS gateway, for implementing keyword b
💻 C
字号:
/* ====================================================================  * The Kannel Software License, Version 1.0  *  * Copyright (c) 2001-2004 Kannel Group   * Copyright (c) 1998-2001 WapIT Ltd.    * All rights reserved.  *  * Redistribution and use in source and binary forms, with or without  * modification, are permitted provided that the following conditions  * are met:  *  * 1. Redistributions of source code must retain the above copyright  *    notice, this list of conditions and the following disclaimer.  *  * 2. Redistributions in binary form must reproduce the above copyright  *    notice, this list of conditions and the following disclaimer in  *    the documentation and/or other materials provided with the  *    distribution.  *  * 3. The end-user documentation included with the redistribution,  *    if any, must include the following acknowledgment:  *       "This product includes software developed by the  *        Kannel Group (http://www.kannel.org/)."  *    Alternately, this acknowledgment may appear in the software itself,  *    if and wherever such third-party acknowledgments normally appear.  *  * 4. The names "Kannel" and "Kannel Group" must not be used to  *    endorse or promote products derived from this software without  *    prior written permission. For written permission, please   *    contact org@kannel.org.  *  * 5. Products derived from this software may not be called "Kannel",  *    nor may "Kannel" appear in their name, without prior written  *    permission of the Kannel Group.  *  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED  * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE  * DISCLAIMED.  IN NO EVENT SHALL THE KANNEL GROUP OR ITS CONTRIBUTORS  * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY,   * OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT   * OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR   * BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,   * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE   * OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,   * EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  * ====================================================================  *  * This software consists of voluntary contributions made by many  * individuals on behalf of the Kannel Group.  For more information on   * the Kannel Group, please see <http://www.kannel.org/>.  *  * Portions of this software are based upon software originally written at   * WapIT Ltd., Helsinki, Finland for the Kannel project.   */ /* * protected.c - thread-safe versions of standard library functions * * Lars Wirzenius */#include <locale.h>#include <errno.h>#include "gwlib.h"/* * Undefine the accident protectors. */#undef localtime#undef gmtime#undef rand#undef gethostbyname#undef mktime#undef strftimeenum {    RAND,    GETHOSTBYNAME,    GWTIME,    NUM_LOCKS};static Mutex locks[NUM_LOCKS];static void lock(int which){    mutex_lock(&locks[which]);}static void unlock(int which){    mutex_unlock(&locks[which]);}void gwlib_protected_init(void){    int i;    for (i = 0; i < NUM_LOCKS; ++i)        mutex_init_static(&locks[i]);}void gwlib_protected_shutdown(void){    int i;    for (i = 0; i < NUM_LOCKS; ++i)        mutex_destroy(&locks[i]);}struct tm gw_localtime(time_t t){    struct tm tm;#ifndef HAVE_LOCALTIME_R    lock(GWTIME);    tm = *localtime(&t);    unlock(GWTIME);#else    localtime_r(&t, &tm);#endif    return tm;}struct tm gw_gmtime(time_t t){    struct tm tm;#ifndef HAVE_GMTIME_R    lock(GWTIME);    tm = *gmtime(&t);    unlock(GWTIME);#else    gmtime_r(&t, &tm);#endif    return tm;}time_t gw_mktime(struct tm *tm){    time_t t;    lock(GWTIME);    t = mktime(tm);    unlock(GWTIME);    return t;}size_t gw_strftime(char *s, size_t max, const char *format, const struct tm *tm){    size_t ret;    lock(GWTIME);    ret = strftime(s, max, format, tm);    unlock(GWTIME);    return ret;}int gw_rand(void){    int ret;    lock(RAND);    ret = rand();    unlock(RAND);    return ret;}#if HAVE_FUNC_GETHOSTBYNAME_R_6/* linux version */int gw_gethostbyname(struct hostent *ent, const char *name, char **buff){    struct hostent *tmphp, hp;    int herr, res;    size_t bufflen;    tmphp = NULL; /* for compiler please */    bufflen = 1024;    *buff = (char*) gw_malloc(bufflen);    while ((res=gethostbyname_r(name, &hp,*buff, bufflen, &tmphp, &herr)) == ERANGE) {        /* enlarge the buffer */	bufflen *= 2;	*buff = (char*) gw_realloc(*buff, bufflen);    }    if (res != 0 || tmphp == NULL) {        error(herr, "Error while gw_gethostbyname occurs.");        gw_free(*buff);        *buff = NULL;        res = -1;    }    else {        *ent = hp;    }    return res;}#elif HAVE_FUNC_GETHOSTBYNAME_R_5/* solaris */int gw_gethostbyname(struct hostent *ent, const char *name, char **buff){    int herr = 0;    size_t bufflen = 1024;    int res = 0;    struct hostent *tmphp = NULL;    *buff = gw_malloc(bufflen);    while ((tmphp = gethostbyname_r(name, ent, *buff, bufflen, &herr)) == NULL && (errno == ERANGE)) {        /* Enlarge the buffer. */        bufflen *= 2;        *buff = (char *) gw_realloc(*buff, bufflen);    }    if (tmphp == NULL) {        error(herr, "Error while gw_gethostbyname occurs.");        gw_free(*buff);        *buff = NULL;        res = -1;    }    return res;}/* not yet implemented, no machine for testing (alex) *//* #elif HAVE_FUNC_GETHOSTBYNAME_R_3 */#else/* * Hmm, we don't have a gethostbyname_r(), this is bad... * Here we must perform a "deep-copy" of a hostent struct returned * from gethostbyname. * Note: Bellow code is based on parts from cURL. */int gw_gethostbyname(struct hostent *ent, const char *name, char **buff){    int len, i;    struct hostent *p;    /* Allocate enough memory to hold the full name information structs and     * everything. OSF1 is known to require at least 8872 bytes. The buffer     * required for storing all possible aliases and IP numbers is according to     * Stevens' Unix Network Programming 2nd editor, p. 304: 8192 bytes!     */    size_t bufflen = 9000;    char *bufptr, *str;    lock(GETHOSTBYNAME);    p = gethostbyname(name);    if (p == NULL) {        unlock(GETHOSTBYNAME);        *buff = NULL;        return -1;    }    *ent = *p;    /* alloc mem */    bufptr = *buff = gw_malloc(bufflen);    ent->h_name = bufptr;    /* copy h_name into buff */    len = strlen(p->h_name) + 1;    strncpy(bufptr, p->h_name, len);    bufptr += len;  /* we align on even 64bit boundaries for safety */#define MEMALIGN(x) ((x)+(8-(((unsigned long)(x))&0x7)))    /* This must be aligned properly to work on many CPU architectures! */    bufptr = MEMALIGN(bufptr);    ent->h_aliases = (char**)bufptr;    /* Figure out how many aliases there are */    for (i = 0; p->h_aliases[i] != NULL; ++i)        ;    /* Reserve room for the array */    bufptr += (i + 1) * sizeof(char*);    /* Clone all known aliases */    for(i = 0; (str = p->h_aliases[i]); i++) {        len = strlen(str) + 1;        strncpy(bufptr, str, len);        ent->h_aliases[i] = bufptr;        bufptr += len;    }    /* Terminate the alias list with a NULL */    ent->h_aliases[i] = NULL;    ent->h_addrtype = p->h_addrtype;    ent->h_length = p->h_length;    /* align it for (at least) 32bit accesses */    bufptr = MEMALIGN(bufptr);    ent->h_addr_list = (char**)bufptr;    /* Figure out how many addresses there are */    for (i = 0; p->h_addr_list[i] != NULL; ++i)        ;    /* Reserve room for the array */    bufptr += (i + 1) * sizeof(char*);    i = 0;    len = p->h_length;    str = p->h_addr_list[i];    while (str != NULL) {        memcpy(bufptr, str, len);        ent->h_addr_list[i] = bufptr;        bufptr += len;        str = p->h_addr_list[++i];    }    ent->h_addr_list[i] = NULL;#undef MEMALIGN    unlock(GETHOSTBYNAME);    return 0;}#endif

⌨️ 快捷键说明

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