(ignore_dotfiles && name[0] == '.');
}
-void print_size_sum(size_sum_t s) {
- char tmp[128];
- char *a = tmp + sizeof(tmp)/sizeof(char);
- *(--a) = '\0';
- if(s) {
- while(s) {
- *(--a) = s%10 + '0';
- s /= 10;
- }
- } else {
- *(--a) = '0';
- }
- printf("%s", a);
-}
-
size_sum_t entry_size(const char *name) {
DIR *dir;
struct dirent *dir_e;
}
}
-void raw_print(char *buffer, char *filename, size_sum_t size) {
+void raw_print(char *buffer, size_t buffer_size, char *filename, size_sum_t size) {
char *a, *b, *c, u;
b = buffer;
- if(size) {
- while(size) {
- *(b++) = size%10 + '0';
- size /= 10;
+ do {
+ if(b >= buffer + buffer_size) {
+ fprintf(stderr, "Buffer overflow in raw_print (hu?!).\n");
+ exit(EXIT_FAILURE);
}
- } else {
- *(b++) = '0';
- }
+ *(b++) = size%10 + '0';
+ size /= 10;
+ } while(size);
a = buffer;
c = b;
*(b++) = ' ';
- sprintf(b, "%s\n", filename);
+ snprintf(b, buffer_size - (b - buffer), "%s\n", filename);
}
-void fancy_print(char *buffer, char *filename, size_sum_t size) {
+void fancy_print(char *buffer, size_t buffer_size, char *filename, size_sum_t size) {
if(size < 1024) {
- sprintf(buffer,
- "% 7d -- %s\n",
- ((int) size),
- filename);
+ snprintf(buffer,
+ buffer_size,
+ "% 7d -- %s\n",
+ ((int) size),
+ filename);
} else if(size < 1024 * 1024) {
- sprintf(buffer,
- "% 6.1fK -- %s\n",
- ((double) (size))/(1024.0),
- filename);
+ snprintf(buffer,
+ buffer_size,
+ "% 6.1fK -- %s\n",
+ ((double) (size))/(1024.0),
+ filename);
} else if(size < 1024 * 1024 * 1024) {
- sprintf(buffer,
- "% 6.1fM -- %s\n",
- ((double) (size))/(1024.0 * 1024),
- filename);
+ snprintf(buffer,
+ buffer_size,
+ "% 6.1fM -- %s\n",
+ ((double) (size))/(1024.0 * 1024),
+ filename);
} else {
- sprintf(buffer,
- "% 6.1fG -- %s\n",
- ((double) (size))/(1024.0 * 1024.0 * 1024.0),
- filename);
+ snprintf(buffer,
+ buffer_size,
+ "% 6.1fG -- %s\n",
+ ((double) (size))/(1024.0 * 1024.0 * 1024.0),
+ filename);
}
}
first = nb_nodes - n;
}
+ /* I do not like valgrind to complain about uninitialized data */
+ if(width < BUFFER_SIZE) {
+ line[width] = '\0';
+ }
+
for(n = first; n < last; n++) {
if(fancy_size_display) {
- fancy_print(line, nodes[n]->name, nodes[n]->size);
+ fancy_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size);
} else {
- raw_print(line, nodes[n]->name, nodes[n]->size);
+ raw_print(line, BUFFER_SIZE, nodes[n]->name, nodes[n]->size);
}
if(width >= 1 && width + 1 < BUFFER_SIZE && line[width]) {
line[width] = '\n';