치카냥3, C (gcc)

치카냥3

Language: Layout:

// 치카냥

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <assert.h>

void print_bits(int width, int x, int newline) // 테스트용
{
    for (int i = width-1; i >= 0; i--) printf("%01d", x >> i&1);
    if (newline) puts(""); else printf(" ");
}

int bit_count_2bits(int x) // 2개씩 카운트
{
    int ret = 0;
    while (x > 0) { // 16번 수행
        ret = ret + (x & 0x03) - ((x & 0x03) >> 1);
        // 00 -> 00
        // 01 -> 01
        // 10 -> 01
        // 11 -> 10
        x = x >> 2;
        // loop unroll시 연산자 총 95개
    }
    return ret;
}

int bit_count_4bits(int x) // 4개씩 카운트
{
    int ret = 0;
    while (x > 0) { // 8번 수행
        x = x & ~0x0F | ((x & 0x0F) - ((x & 0x0A) >> 1));
        // 1101 -> 1001
        // 0101 -> 0101
        ret = ret + ((x & 0x03) + (x >> 2 & 0x03));
        x = x >> 4;
        // unroll시 연산자 총 103개
    }
    return ret;
}

int bit_count_8bits(int x) // 8개씩 카운트
{
    int ret = 0;
    x = x & ~0xFF | ((x & 0xFF) - ((x & 0xAA) >> 1));
    x = x & ~0xFF | ((x & 0x33) + (x >> 2 & 0x33));
    ret = ret + (x & 0x0F) + (x >> 4 & 0x0F);
    x = x >> 8;
    x = x & ~0xFF | ((x & 0xFF) - ((x & 0xAA) >> 1));
    x = x & ~0xFF | ((x & 0x33) + (x >> 2 & 0x33));
    ret = ret + (x & 0x0F) + (x >> 4 & 0x0F);
    x = x >> 8;
    x = x & ~0xFF | ((x & 0xFF) - ((x & 0xAA) >> 1));
    x = x & ~0xFF | ((x & 0x33) + (x >> 2 & 0x33));
    ret = ret + (x & 0x0F) + (x >> 4 & 0x0F);
    x = x >> 8;
    x = x - ((x & 0xAA) >> 1);
    x = (x & 0x33) + (x >> 2 & 0x33);
    ret = ret + (x & 0x0F) + (x >> 4 & 0x0F);
    // 연산자 72개
    return ret;
}

int bit_count_16bits(int x) // 16개씩 카운트
{
    int ret = 0;
    x = x & ~(0xFF << 8 | 0xFF) | ((x & (0xFF << 8 | 0xFF)) - ((x & (0xAA << 8 | 0xAA)) >> 1));
    x = x & ~(0xFF << 8 | 0xFF) | ((x & (0x33 << 8 | 0x33)) + (x >> 2 & (0x33 << 8 | 0x33)));
    ret = ((x & (0xFF << 8 | 0xFF)) + ((x & (0xFF << 8 | 0xFF)) >> 4)) & (0x0F << 8 | 0x0F);
    ret = (ret & 0x0F) + (ret >> 8 & 0x0F);
    x = x >> 16;
    x = x - ((x & (0xAA << 8 | 0xAA)) >> 1);
    x = (x & (0x33 << 8 | 0x33)) + (x >> 2 & (0x33 << 8 | 0x33));
    x = x + ((x >> 4) & (0x0F << 8 | 0x0F));
    ret = ret + (x & 0x0F) + (x >> 8 & 0x0F);
    // 연산자 65개
    return ret;
}

int bit_count(int x) {
    return bit_count_16bits(x);
}

int main()
{
    srand(time(NULL));
    for (int i = 0; i < 100; i++) {
        int number = (rand() & 0xFFFF) << 16 | (rand() & 0xFFFF);
        printf("%9d: %2d (should be %2d)\n", number, bit_count(number), __builtin_popcount(number));
        assert(bit_count(number) == __builtin_popcount(number));
    }
}

Show compiler warnings [ + ] Compiler args [ + ] Show input
Compilation time: 0.24 sec, absolute running time: 0.12 sec, cpu time: 0.04 sec, memory peak: 3 Mb, absolute service time: 0,36 sec

-196305990: 18 (should be 18) -1796089676: 16 (should be 16) 872942099: 9 (should be 9) -888096824: 15 (should be 15) 785793654: 16 (should be 16) 1784369000: 17 (should be 17) -266039125: 13 (should be 13) 1024610440: 11 (should be 11) 90818131: 14 (should be 14) -680185330: 17 (should be 17) -1222035630: 17 (should be 17) -500575650: 16 (should be 16) 543650918: 14 (should be 14) 1394893563: 16 (should be 16) 466349135: 19 (should be 19) 1592528919: 15 (should be 15) -2012613667: 16 (should be 16) -389235694: 15 (should be 15) -34556964: 21 (should be 21) 1943678150: 17 (should be 17) -162341323: 19 (should be 19) 2083448438: 19 (should be 19) 1860221248: 14 (should be 14) 922645577: 18 (should be 18) 2140343923: 19 (should be 19) -1504233796: 18 (should be 18) 1170573441: 11 (should be 11) 152790573: 14 (should be 14) -51946433: 22 (should be 22) -920119118: 12 (should be 12) 1217275925: 11 (should be 11) 684314776: 12 (should be 12) 468849045: 15 (should be 15) -1935009309: 15 (should be 15) -982450044: 10 (should be 10) 1185528772: 16 (should be 16) -558185768: 18 (should be 18) -1573237350: 15 (should be 15) 2082003257: 16 (should be 16) -1041957972: 18 (should be 18) -408131525: 18 (should be 18) 845688178: 14 (should be 14) -256099453: 17 (should be 17) -1818235485: 20 (should be 20) -1748869945: 17 (should be 17) 106291281: 12 (should be 12) -2065944801: 17 (should be 17) -1326866225: 16 (should be 16) 1085554067: 14 (should be 14) -1162738138: 14 (should be 14) 1041695067: 15 (should be 15) -1041621807: 15 (should be 15) -1003264988: 12 (should be 12) 1785479244: 12 (should be 12) 1029516368: 15 (should be 15) 1006118154: 15 (should be 15) -1802801568: 14 (should be 14) 1383892296: 13 (should be 13) -1444616677: 17 (should be 17) 1928020390: 16 (should be 16) 1122138433: 13 (should be 13) 569886655: 21 (should be 21) -1470049568: 12 (should be 12) 1754196244: 14 (should be 14) 275981120: 10 (should be 10) -281391477: 19 (should be 19) 614183204: 13 (should be 13) 1801251023: 19 (should be 19) 357160392: 14 (should be 14) 689656486: 14 (should be 14) 35153171: 10 (should be 10) 2008061604: 16 (should be 16) -747386324: 17 (should be 17) 468483415: 20 (should be 20) -1337487657: 17 (should be 17) -1090587862: 22 (should be 22) 135848181: 12 (should be 12) -1159090056: 17 (should be 17) -1277811849: 19 (should be 19) -1718762423: 14 (should be 14) 1186433223: 16 (should be 16) 315910994: 14 (should be 14) 971800113: 18 (should be 18) 1411469109: 14 (should be 14) 1408859452: 20 (should be 20) -1579461102: 15 (should be 15) -498132596: 15 (should be 15) -323570237: 19 (should be 19) -474478430: 13 (should be 13) 857379840: 10 (should be 10) -1753615848: 17 (should be 17) -2027249774: 16 (should be 16) -754040301: 13 (should be 13) 1342867172: 11 (should be 11) 1703602583: 17 (should be 17) 1261284417: 14 (should be 14) 1918852610: 16 (should be 16) 395553867: 16 (should be 16) -600609867: 19 (should be 19) -75485140: 13 (should be 13)