memset.c 3.1 KB
Newer Older
A
arvinzzz 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107
/*
 * Copyright (c) 2021-2021 Huawei Device Co., 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. Neither the name of the copyright holder nor the names of its contributors may be used
 *    to endorse or promote products derived from this software without specific prior written
 *    permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS 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 COPYRIGHT HOLDER OR
 * 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.
 */

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h>

void *memset(void *dest, int c, size_t n)
{
    char *pos = dest;
    uint32_t c32 = 0;
    uint64_t c64 = 0;

    if (n == 0) return dest;

    c = c & 0xFF;
    if (c) {
        c32 = c;
        c32 |= c32 << 8;
        c32 |= c32 << 16;
        c64 = c32;
        c64 |= c64 << 32;
    }

    if (((uintptr_t)(pos) & 7) != 0) {
        int unalignedCnt = 8 - ((uintptr_t)(pos) & 7);
        if (n >= unalignedCnt) {
            n = n - unalignedCnt;
        } else {
            unalignedCnt = n;
            n = 0;
        }
        for (int loop = 1; loop <= unalignedCnt; ++loop) {
            *pos = (char)c;
            pos++;
        }
    }

    /* L32_byte_aligned */
    while (n >= 32) {
        *(uint64_t *)(pos) = c64;
        *(uint64_t *)(pos + 8) = c64;
        *(uint64_t *)(pos + 16) = c64;
        *(uint64_t *)(pos + 24) = c64;
        n -= 32;
        pos += 32;
    }
    if (n == 0) return dest;

    /* L16_byte_aligned */
    if (n >= 16) {
        *(uint64_t *)(pos) = c64;
        *(uint64_t *)(pos + 8) = c64;
        n -= 16;
        pos += 16;
        if (n == 0) return dest;
    }

    /* L8_byte_aligned */
    if (n >= 8) {
        *(uint64_t *)(pos) = c64;
        n -= 8;
        pos += 8;
        if (n == 0) return dest;
    }

    /* L4_byte_aligned */
    if (n >= 4) {
        *(uint32_t *)(pos) = c32;
        n -= 4;
        pos += 4;
        if (n == 0) return dest;
    }
    while (n--) {
        *pos++ = c;
    }

    return dest;
}