diff options
Diffstat (limited to 'render.c')
| -rw-r--r-- | render.c | 86 |
1 files changed, 43 insertions, 43 deletions
@@ -11,11 +11,11 @@ /* Adding submap i to all submaps > i to reconstruct the result of single buddhabrot calculations. */ static void add_submaps(config_t* conf, uint32_t* map) { - int i, j; + int i, j; size_t k, mapsize, off_i, off_j; - + mapsize = conf->width * conf->height; - + for(i = conf->iters_n - 1; i <= 0; i--) { off_i = mapsize * i; for(j = 0; j < i; j++) { @@ -28,7 +28,7 @@ add_submaps(config_t* conf, uint32_t* map) { } typedef struct lookup_elem_t { - uint32_t val; + uint32_t val; struct lookup_elem_t* prev; struct lookup_elem_t* next; } lookup_elem_t; @@ -39,22 +39,22 @@ new_lookup_elem(uint32_t val, lookup_elem_t* prev, lookup_elem_t* next) { if(!rv) { return NULL; } - - rv->val = val; + + rv->val = val; rv->prev = prev; rv->next = next; - + return rv; } static int maybe_insert(uint32_t val, lookup_elem_t* a, lookup_elem_t* b) { lookup_elem_t* new; - + if(!(new = new_lookup_elem(val, a, b))) { return 0; } - + if(!a) { b->prev = new; return 1; @@ -63,7 +63,7 @@ maybe_insert(uint32_t val, lookup_elem_t* a, lookup_elem_t* b) { a->next = new; return 1; } - + if((a->val < val) && (val < b->val)) { a->next = new; b->prev = new; @@ -75,24 +75,24 @@ maybe_insert(uint32_t val, lookup_elem_t* a, lookup_elem_t* b) { static int build_lookup(uint32_t* map, size_t mapsize, lookup_elem_t** e) { - size_t i; + size_t i; uint32_t val; - + for(i = 0; i < mapsize; i++) { val = map[i]; - + if(!*e) { if(!(*e = new_lookup_elem(val, NULL, NULL))) { return 0; } continue; } - - for(;;) { + + for(;; ) { if((*e)->val == val) { break; } - + if(val > (*e)->val) { if(!maybe_insert(val, *e, (*e)->next)) { return 0; @@ -106,26 +106,26 @@ build_lookup(uint32_t* map, size_t mapsize, lookup_elem_t** e) { } } } - + while((*e)->prev) { *e = (*e)->prev; } - + return 1; } static size_t lookup_len(lookup_elem_t* e) { size_t len; - + if(!e) { return 0; } - + while(e->prev) { e = e->prev; } - + len = 0; while(e) { len++; @@ -163,58 +163,58 @@ lookup(uint32_t val, lookup_elem_t** e, size_t* pos) { int render(config_t* conf, uint32_t* map) { - int rv = 0; - size_t i, j; - color_t col; - double factor; - bmp_write_handle_t* bmph = NULL; - size_t mapsize = conf->width * conf->height; - + int rv = 0; + size_t i, j; + color_t col; + double factor; + bmp_write_handle_t* bmph = NULL; + size_t mapsize = conf->width * conf->height; + lookup_elem_t** lookups = NULL; - size_t* poss = NULL; - size_t* lens = NULL; - + size_t* poss = NULL; + size_t* lens = NULL; + lookups = calloc(sizeof(lookup_elem_t*), conf->iters_n); - poss = calloc(sizeof(size_t), conf->iters_n); - lens = calloc(sizeof(size_t), conf->iters_n); + poss = calloc(sizeof(size_t), conf->iters_n); + lens = calloc(sizeof(size_t), conf->iters_n); if((!lookups) || (!poss) || (!lens)) { fputs("Could not allocate memory for lookup tables.\n", stderr); goto tidyup; } - + if(!(bmph = bmp_create(conf->output, conf->width, conf->height))) { fprintf(stderr, "Could not create BMP.\n"); /* TODO: More details? */ goto tidyup; } - + add_submaps(conf, map); - + for(i = 0; i < conf->iters_n; i++) { - if(!build_lookup(map+(mapsize*i), mapsize, &(lookups[i]))) { + if(!build_lookup(map + (mapsize * i), mapsize, &(lookups[i]))) { fputs("Could not build lookup table.\n", stderr); goto tidyup; } lens[i] = lookup_len(lookups[i]); } - + for(i = 0; i < mapsize; i++) { col.r = 0; col.g = 0; col.b = 0; - + for(j = 0; j < conf->iters_n; j++) { factor = (double) lookup(map[i + mapsize * j], &(lookups[j]), &(poss[j])) / (double) lens[j]; - col = color_add(col, color_mul(conf->colors[j], factor)); + col = color_add(col, color_mul(conf->colors[j], factor)); } if(!bmp_write_pixel(bmph, color_fix(col))) { fputs("Could not write pixel data.\n", stderr); goto tidyup; } } - + rv = 1; - + tidyup: if(bmph) { bmp_destroy(bmph); @@ -233,6 +233,6 @@ tidyup: if(lens) { free(lens); } - + return rv; } |