/* SPDX-License-Identifier: Apache-2.0 OR MIT */
/*
 * Copyright (c) 2015 Rockchip Electronics Co., Ltd.
 */

#include <errno.h>
#include <dirent.h>
#include <string.h>

#include "mpp_common.h"

#define MPP_PATH_MAX_LEN    1024

static const RK_U8 log2_tab[256] = {
    0, 0, 1, 1, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4,
    5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5,
    6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
    6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
    7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7
};

RK_S32 mpp_log2(RK_U32 v)
{
    RK_S32 n = 0;

    if (v & 0xffff0000) {
        v >>= 16;
        n += 16;
    }
    if (v & 0xff00) {
        v >>= 8;
        n += 8;
    }
    n += log2_tab[v];

    return n;
}

RK_S32 mpp_log2_16bit(RK_U32 v)
{
    RK_S32 n = 0;

    if (v & 0xff00) {
        v >>= 8;
        n += 8;
    }
    n += log2_tab[v];

    return n;
}

RK_S32 axb_div_c(RK_S32 a, RK_S32 b, RK_S32 c)
{
    RK_U32 left = 32;
    RK_U32 right = 0;
    RK_U32 shift;
    RK_S32 sign = 1;
    RK_S32 tmp;

    if (a == 0 || b == 0)
        return 0;
    else if ((a * b / b) == a && c != 0)
        return (a * b / c);

    if (a < 0) {
        sign = -1;
        a = -a;
    }
    if (b < 0) {
        sign *= -1;
        b = -b;
    }
    if (c < 0) {
        sign *= -1;
        c = -c;
    }

    if (c == 0)
        return 0x7FFFFFFF * sign;

    if (b > a) {
        tmp = b;
        b = a;
        a = tmp;
    }

    for (--left; (((RK_U32)a << left) >> left) != (RK_U32)a; --left)
        ;

    left--;

    while (((RK_U32)b >> right) > (RK_U32)c)
        right++;

    if (right > left) {
        return 0x7FFFFFFF * sign;
    } else {
        shift = left - right;
        return (RK_S32)((((RK_U32)a << shift) /
                         (RK_U32)c * (RK_U32)b) >> shift) * sign;
    }
}

RK_U32 mpp_align_8(RK_U32 val)
{
    return MPP_ALIGN(val, 8);
}

RK_U32 mpp_align_16(RK_U32 val)
{
    return MPP_ALIGN(val, 16);
}

RK_U32 mpp_align_64(RK_U32 val)
{
    return MPP_ALIGN(val, 64);
}

RK_U32 mpp_align_128(RK_U32 val)
{
    return MPP_ALIGN(val, 128);
}

RK_U32 mpp_align_256_odd(RK_U32 val)
{
    return MPP_ALIGN(val, 256) | 256;
}

RK_U32 mpp_align_128_odd_plus_64(RK_U32 val)
{
    val = MPP_ALIGN(val, 64);
    if (((val - 64) % 256 == 128))
        return val;
    else
        return ((MPP_ALIGN(val, 128) | 128) + 64);
}

RK_U32 mpp_align_wxh2yuv420(RK_U32 val)
{
    return (val * 3 / 2);
}

RK_U32 mpp_align_wxh2yuv422(RK_U32 val)
{
    return (val * 2);
}

RK_U32 mpp_align_wxh2yuv444(RK_U32 val)
{
    return (val * 3);
}

// Clip a signed integer to the range [0, 2^n - 1]
RK_U32 mpp_clip_uint_pow2(RK_S32 val, RK_S32 n)
{
    /* Calculate mask: 2^n - 1 */
    RK_U32 mask = (1 << n) - 1;

    /* Check if value is out of range */
    RK_U32 sign = val & ~mask;

    /* If out of range, return boundary value; otherwise return original value */
    return sign ? (RK_U32)(-val >> 31 & mask) : (RK_U32)val;
}

// Divide an unsigned integer x by 2^n and round to nearest integer
RK_U64 mpp_round_pow2(RK_U64 x, RK_U16 n)
{
    /* Special case: no division needed when n=0 */
    if (n == 0)
        return x;

    /* Calculate offset: 2^(n-1) for rounding */
    RK_U64 offset = (RK_U64)1 << (n - 1);

    /* Add offset then right-shift n bits to achieve division and rounding */
    return (x + offset) >> n;
}

// Divide a signed integer x by 2^n and round to nearest integer
RK_S64 mpp_round_pow2_signed(RK_S64 x, RK_U16 n)
{
    if (x < 0)
        return -((RK_S64)mpp_round_pow2(-x, n));
    else
        return (RK_S64)mpp_round_pow2(x, n);
}

MPP_RET mpp_mkdir_p(const char *path)
{
    char tmp[MPP_PATH_MAX_LEN];
    char *p = NULL;

    if (!path) {
        errno = EINVAL;
        return MPP_NOK;
    }

    if (strlen(path) >= sizeof(tmp)) {
        errno = ENAMETOOLONG;
        return MPP_NOK;
    }

    strncpy(tmp, path, sizeof(tmp) - 1);
    tmp[sizeof(tmp) - 1] = '\0';

    for (p = tmp + 1; *p; p++) {
        if (*p != '/')
            continue;

        *p = '\0';
        if (mkdir(tmp) == -1 && errno != EEXIST)
            return MPP_NOK;
        *p = '/';
    }

    return (mkdir(tmp) == -1 && errno != EEXIST) ? MPP_NOK : MPP_OK;
}