/****************************************************************************
 * Copyright 2020,2023 Thomas E. Dickey                                     *
 * Copyright 2013-2014,2016 Free Software Foundation, Inc.                  *
 *                                                                          *
 * Permission is hereby granted, free of charge, to any person obtaining a  *
 * copy of this software and associated documentation files (the            *
 * "Software"), to deal in the Software without restriction, including      *
 * without limitation the rights to use, copy, modify, merge, publish,      *
 * distribute, distribute with modifications, sublicense, and/or sell       *
 * copies of the Software, and to permit persons to whom the Software is    *
 * furnished to do so, subject to the following conditions:                 *
 *                                                                          *
 * The above copyright notice and this permission notice shall be included  *
 * in all copies or substantial portions of the Software.                   *
 *                                                                          *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS  *
 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF               *
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.   *
 * IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,   *
 * DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR    *
 * OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR    *
 * THE USE OR OTHER DEALINGS IN THE SOFTWARE.                               *
 *                                                                          *
 * Except as contained in this notice, the name(s) of the above copyright   *
 * holders shall not be used in advertising or otherwise to promote the     *
 * sale, use or other dealings in this Software without prior written       *
 * authorization.                                                           *
 ****************************************************************************/

/****************************************************************************
 *  Author: Thomas E. Dickey                        2013-on                 *
 ****************************************************************************/

/*
**      Support for obsolete/unusual features.
*/

#include <curses.priv.h>

MODULE_ID("$Id: obsolete.c,v 1.1 2023/10/17 09:52:09 nicm Exp $")

/*
 * Obsolete entrypoint retained for binary compatibility.
 */
NCURSES_EXPORT(void)
NCURSES_SP_NAME(_nc_set_buffer) (NCURSES_SP_DCLx FILE *ofp, int buffered)
{
#if NCURSES_SP_FUNCS
    (void) SP_PARM;
#endif
    (void) ofp;
    (void) buffered;
}

#if NCURSES_SP_FUNCS
NCURSES_EXPORT(void)
_nc_set_buffer(FILE *ofp, int buffered)
{
    NCURSES_SP_NAME(_nc_set_buffer) (CURRENT_SCREEN, ofp, buffered);
}
#endif

#if !HAVE_STRDUP
NCURSES_EXPORT(char *)
_nc_strdup(const char *s)
{
    char *result = 0;
    if (s != 0) {
        size_t need = strlen(s);
        result = malloc(need + 1);
        if (result != 0) {
            _nc_STRCPY(result, s, need);
        }
    }
    return result;
}
#endif

#if USE_MY_MEMMOVE
#define DST ((char *)s1)
#define SRC ((const char *)s2)
NCURSES_EXPORT(void *)
_nc_memmove(void *s1, const void *s2, size_t n)
{
    if (n != 0) {
        if ((DST + n > SRC) && (SRC + n > DST)) {
            static char *bfr;
            static size_t length;
            register size_t j;
            if (length < n) {
                length = (n * 3) / 2;
                bfr = typeRealloc(char, length, bfr);
            }
            for (j = 0; j < n; j++)
                bfr[j] = SRC[j];
            s2 = bfr;
        }
        while (n-- != 0)
            DST[n] = SRC[n];
    }
    return s1;
}
#endif /* USE_MY_MEMMOVE */

#ifdef EXP_XTERM_1005
NCURSES_EXPORT(int)
_nc_conv_to_utf8(unsigned char *target, unsigned source, unsigned limit)
{
#define CH(n) UChar((source) >> ((n) * 8))
    int rc = 0;

    if (source <= 0x0000007f)
        rc = 1;
    else if (source <= 0x000007ff)
        rc = 2;
    else if (source <= 0x0000ffff)
        rc = 3;
    else if (source <= 0x001fffff)
        rc = 4;
    else if (source <= 0x03ffffff)
        rc = 5;
    else                        /* (source <= 0x7fffffff) */
        rc = 6;

    if ((unsigned) rc > limit) {        /* whatever it is, we cannot decode it */
        rc = 0;
    }

    if (target != 0) {
        switch (rc) {
        case 1:
            target[0] = CH(0);
            break;

        case 2:
            target[1] = UChar(0x80 | (CH(0) & 0x3f));
            target[0] = UChar(0xc0 | (CH(0) >> 6) | ((CH(1) & 0x07) << 2));
            break;

        case 3:
            target[2] = UChar(0x80 | (CH(0) & 0x3f));
            target[1] = UChar(0x80 | (CH(0) >> 6) | ((CH(1) & 0x0f) << 2));
            target[0] = UChar(0xe0 | ((int) (CH(1) & 0xf0) >> 4));
            break;

        case 4:
            target[3] = UChar(0x80 | (CH(0) & 0x3f));
            target[2] = UChar(0x80 | (CH(0) >> 6) | ((CH(1) & 0x0f) << 2));
            target[1] = UChar(0x80 |
                              ((int) (CH(1) & 0xf0) >> 4) |
                              ((int) (CH(2) & 0x03) << 4));
            target[0] = UChar(0xf0 | ((int) (CH(2) & 0x1f) >> 2));
            break;

        case 5:
            target[4] = UChar(0x80 | (CH(0) & 0x3f));
            target[3] = UChar(0x80 | (CH(0) >> 6) | ((CH(1) & 0x0f) << 2));
            target[2] = UChar(0x80 |
                              ((int) (CH(1) & 0xf0) >> 4) |
                              ((int) (CH(2) & 0x03) << 4));
            target[1] = UChar(0x80 | (CH(2) >> 2));
            target[0] = UChar(0xf8 | (CH(3) & 0x03));
            break;

        case 6:
            target[5] = UChar(0x80 | (CH(0) & 0x3f));
            target[4] = UChar(0x80 | (CH(0) >> 6) | ((CH(1) & 0x0f) << 2));
            target[3] = UChar(0x80 | (CH(1) >> 4) | ((CH(2) & 0x03) << 4));
            target[2] = UChar(0x80 | (CH(2) >> 2));
            target[1] = UChar(0x80 | (CH(3) & 0x3f));
            target[0] = UChar(0xfc | ((int) (CH(3) & 0x40) >> 6));
            break;
        }
    }

    return rc;                  /* number of bytes needed in target */
#undef CH
}

NCURSES_EXPORT(int)
_nc_conv_to_utf32(unsigned *target, const char *source, unsigned limit)
{
#define CH(n) UChar((*target) >> ((n) * 8))
    int rc = 0;
    int j;
    unsigned mask = 0;

    /*
     * Find the number of bytes we will need from the source.
     */
    if ((*source & 0x80) == 0) {
        rc = 1;
        mask = (unsigned) *source;
    } else if ((*source & 0xe0) == 0xc0) {
        rc = 2;
        mask = (unsigned) (*source & 0x1f);
    } else if ((*source & 0xf0) == 0xe0) {
        rc = 3;
        mask = (unsigned) (*source & 0x0f);
    } else if ((*source & 0xf8) == 0xf0) {
        rc = 4;
        mask = (unsigned) (*source & 0x07);
    } else if ((*source & 0xfc) == 0xf8) {
        rc = 5;
        mask = (unsigned) (*source & 0x03);
    } else if ((*source & 0xfe) == 0xfc) {
        rc = 6;
        mask = (unsigned) (*source & 0x01);
    }

    if ((unsigned) rc > limit) {        /* whatever it is, we cannot decode it */
        rc = 0;
    }

    /*
     * sanity-check.
     */
    if (rc > 1) {
        for (j = 1; j < rc; j++) {
            if ((source[j] & 0xc0) != 0x80)
                break;
        }
        if (j != rc) {
            rc = 0;
        }
    }

    if (target != 0) {
        int shift = 0;
        *target = 0;
        for (j = 1; j < rc; j++) {
            *target |= (unsigned) (source[rc - j] & 0x3f) << shift;
            shift += 6;
        }
        *target |= mask << shift;
    }
    return rc;
#undef CH
}
#endif /* EXP_XTERM_1005 */

#ifdef EXP_OOM_TESTING
/*
 * Out-of-memory testing, suitable for checking if initialization (and limited
 * running) recovers from errors due to insufficient memory.  In practice, this
 * is unlikely except with artifically constructed tests (or poorly behaved
 * applications).
 */
#undef malloc
#undef calloc
#undef realloc
#undef free
#undef strdup

#define TR_OOM(stmt) T(stmt)

static long oom_limit = -1;
static long oom_count = 0;

static bool
oom_check(void)
{
    static bool initialized = FALSE;
    static bool triggered = FALSE;
    bool result = FALSE;

    if (!initialized) {
        char *env = getenv("NCURSES_OOM_TESTING");
        initialized = TRUE;
        if (env != NULL) {
            char *check;
            oom_limit = strtol(env, &check, 0);
            if (check != NULL && *check != '\0')
                oom_limit = 0;
        }
    }
    ++oom_count;
    if (oom_limit >= 0) {
        result = (oom_count > oom_limit);
        if (result && !triggered) {
            triggered = TRUE;
            TR_OOM(("out-of-memory"));
        }
    }
    return result;
}

NCURSES_EXPORT(void *)
_nc_oom_malloc(size_t size)
{
    char *result = (oom_check()
                    ? NULL
                    : malloc(size));
    TR_OOM(("oom #%ld malloc(%ld) %p", oom_count, size, result));
    return result;
}

NCURSES_EXPORT(void *)
_nc_oom_calloc(size_t nmemb, size_t size)
{
    char *result = (oom_check()
                    ? NULL
                    : calloc(nmemb, size));
    TR_OOM(("oom #%ld calloc(%ld, %ld) %p", oom_count, nmemb, size, result));
    return result;
}

NCURSES_EXPORT(void *)
_nc_oom_realloc(void *ptr, size_t size)
{
    char *result = (oom_check()
                    ? NULL
                    : realloc(ptr, size));
    TR_OOM(("oom #%ld realloc(%p, %ld) %p", oom_count, ptr, size, result));
    return result;
}

NCURSES_EXPORT(void)
_nc_oom_free(void *ptr)
{
    ++oom_count;
    TR_OOM(("oom #%ld free(%p)", oom_count, ptr));
    free(ptr);
}

NCURSES_EXPORT(char *)
_nc_oom_strdup(const char *ptr)
{
    char *result = (oom_check()
                    ? NULL
                    : strdup(ptr));
    TR_OOM(("oom #%ld strdup(%p) %p", oom_count, ptr, result));
    return result;
}
#endif /* EXP_OOM_TESTING */