int main()

in c_src/valgrind_sample.c [22:71]

• 39 lines of code
• 6 McCabe index (conditional complexity)

int main(void)
{
    int str_len = 100;
    int iterations = 1000;
    uint32_t max_elems = 1024;
    uint32_t heap_size = 64;
    hqueue_t* hq = hqueue_new(max_elems, heap_size);
    double priority;
    double priority_res;
    char* val;
    char* val_res;
    int i;

    assert(max_elems == hqueue_max_elems(hq));
    assert(heap_size == hqueue_heap_size(hq));

    for(i = 0; i < iterations; i++) {
        priority = 1234.4321 * i;
        val = (char*) malloc(str_len + 1);

        if(val == NULL) {
            return 1;
        }

        assert(hqueue_size(hq) == i);

        if(snprintf(val, str_len + 1, "Fun string #%d\n", i)) {
            if(!hqueue_insert(hq, priority, val)) {
                return 1;
            }
        } else {
            return 1;
        }
    }

    hqueue_scale_by(hq, 3.7);

    // Added 1000 elements, so heap size should have expanded to 1024
    assert(max_elems == hqueue_max_elems(hq));
    assert(max_elems == hqueue_heap_size(hq));

    if(!hqueue_extract_max(hq, &priority_res, (void**) &val_res)) {
        return 1;
    }
    free(val_res);

    hqueue_free2(hq, free);

    return 0;
}