Wed, 10 Jul 2013 13:38:28 +0200
option for output file
universe@1 | 1 | /* |
universe@1 | 2 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS HEADER. |
universe@1 | 3 | * |
universe@1 | 4 | * Copyright 2013 Mike Becker. All rights reserved. |
universe@1 | 5 | * |
universe@1 | 6 | * Redistribution and use in source and binary forms, with or without |
universe@1 | 7 | * modification, are permitted provided that the following conditions are met: |
universe@1 | 8 | * |
universe@1 | 9 | * 1. Redistributions of source code must retain the above copyright |
universe@1 | 10 | * notice, this list of conditions and the following disclaimer. |
universe@1 | 11 | * |
universe@1 | 12 | * 2. Redistributions in binary form must reproduce the above copyright |
universe@1 | 13 | * notice, this list of conditions and the following disclaimer in the |
universe@1 | 14 | * documentation and/or other materials provided with the distribution. |
universe@1 | 15 | * |
universe@1 | 16 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
universe@1 | 17 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
universe@1 | 18 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
universe@1 | 19 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
universe@1 | 20 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
universe@1 | 21 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
universe@1 | 22 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
universe@1 | 23 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
universe@1 | 24 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
universe@1 | 25 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
universe@1 | 26 | * POSSIBILITY OF SUCH DAMAGE. |
universe@1 | 27 | * |
universe@1 | 28 | */ |
universe@1 | 29 | |
universe@1 | 30 | #include <stdio.h> |
universe@1 | 31 | #include <stdlib.h> |
universe@1 | 32 | #include <string.h> |
universe@1 | 33 | #include <fcntl.h> |
universe@1 | 34 | #include <unistd.h> |
universe@4 | 35 | #include <ctype.h> |
universe@4 | 36 | |
universe@4 | 37 | #define INPUTBUF_SIZE 2048 |
universe@5 | 38 | #define WORDBUF_SIZE 16 |
universe@5 | 39 | |
universe@5 | 40 | const char* keywords[] = { |
universe@5 | 41 | "auto", "break", "case", "char", "const", "continue", "default", "do", |
universe@5 | 42 | "double", "else", "enum", "extern", "float", "for", "goto", "if", "int", |
universe@5 | 43 | "long", "register", "return", "short", "signed", "sizeof", "static", "struct", |
universe@5 | 44 | "switch", "typedef", "union", "unsigned", "void", "volatile", "while", NULL |
universe@5 | 45 | }; |
universe@4 | 46 | |
universe@11 | 47 | typedef struct { |
universe@11 | 48 | char* outfilename; |
universe@11 | 49 | char* infilename; |
universe@11 | 50 | } settings_t; |
universe@4 | 51 | |
universe@4 | 52 | typedef struct { |
universe@4 | 53 | size_t count; |
universe@4 | 54 | size_t capacity; |
universe@4 | 55 | size_t maxlinewidth; |
universe@4 | 56 | char** lines; |
universe@4 | 57 | } inputfile_t; |
universe@1 | 58 | |
universe@1 | 59 | inputfile_t *inputfilebuffer(size_t capacity) { |
universe@1 | 60 | inputfile_t *inputfile = (inputfile_t*) malloc(sizeof(inputfile_t)); |
universe@1 | 61 | inputfile->lines = (char**) malloc(capacity * sizeof(char*)); |
universe@1 | 62 | inputfile->capacity = capacity; |
universe@1 | 63 | inputfile->count = 0; |
universe@4 | 64 | inputfile->maxlinewidth = 0; |
universe@1 | 65 | |
universe@1 | 66 | return inputfile; |
universe@0 | 67 | } |
universe@0 | 68 | |
universe@1 | 69 | void addline(inputfile_t *inputfile, char* line, size_t width) { |
universe@1 | 70 | char *l = (char*) malloc(width+1); |
universe@1 | 71 | memcpy(l, line, width); |
universe@1 | 72 | l[width] = 0; |
universe@1 | 73 | if (inputfile->count >= inputfile->capacity) { |
universe@1 | 74 | inputfile->capacity <<= 1; |
universe@1 | 75 | inputfile->lines = realloc(inputfile->lines, inputfile->capacity); |
universe@1 | 76 | } |
universe@1 | 77 | inputfile->lines[inputfile->count] = l; |
universe@4 | 78 | inputfile->maxlinewidth = |
universe@4 | 79 | width > inputfile->maxlinewidth ? width : inputfile->maxlinewidth; |
universe@1 | 80 | inputfile->count++; |
universe@1 | 81 | } |
universe@1 | 82 | |
universe@1 | 83 | void freeinputfilebuffer(inputfile_t *inputfile) { |
universe@1 | 84 | for (int i = 0 ; i < inputfile->count ; i++) { |
universe@1 | 85 | free(inputfile->lines[i]); |
universe@1 | 86 | } |
universe@1 | 87 | free(inputfile->lines); |
universe@1 | 88 | free(inputfile); |
universe@1 | 89 | } |
universe@1 | 90 | |
universe@1 | 91 | inputfile_t *readinput(char *filename) { |
universe@1 | 92 | |
universe@1 | 93 | int fd = open(filename, O_RDONLY); |
universe@1 | 94 | if (fd == -1) return NULL; |
universe@1 | 95 | |
universe@1 | 96 | inputfile_t *inputfile = inputfilebuffer(512); |
universe@1 | 97 | |
universe@4 | 98 | char buf[INPUTBUF_SIZE]; |
universe@1 | 99 | ssize_t r; |
universe@1 | 100 | |
universe@4 | 101 | size_t maxlinewidth = 256; |
universe@1 | 102 | char *line = (char*) malloc(maxlinewidth); |
universe@1 | 103 | size_t col = 0; |
universe@1 | 104 | |
universe@4 | 105 | while ((r = read(fd, buf, INPUTBUF_SIZE)) > 0) { |
universe@1 | 106 | for (size_t i = 0 ; i < r ; i++) { |
universe@1 | 107 | if (col >= maxlinewidth-4) { |
universe@1 | 108 | maxlinewidth <<= 1; |
universe@1 | 109 | line = realloc(line, maxlinewidth); |
universe@1 | 110 | } |
universe@1 | 111 | |
universe@1 | 112 | if (buf[i] == '\n') { |
universe@5 | 113 | line[col++] = '\n'; |
universe@1 | 114 | line[col] = 0; |
universe@1 | 115 | addline(inputfile, line, col); |
universe@1 | 116 | col = 0; |
universe@1 | 117 | } else { |
universe@1 | 118 | line[col++] = buf[i]; |
universe@1 | 119 | } |
universe@1 | 120 | } |
universe@1 | 121 | } |
universe@1 | 122 | |
universe@1 | 123 | free(line); |
universe@1 | 124 | |
universe@1 | 125 | close(fd); |
universe@1 | 126 | |
universe@1 | 127 | return inputfile; |
universe@1 | 128 | } |
universe@1 | 129 | |
universe@5 | 130 | size_t writeescapedchar(char *dest, size_t dp, char c) { |
universe@5 | 131 | if (c == '>') { |
universe@5 | 132 | dest[dp++] = '&'; dest[dp++] = 'g'; |
universe@5 | 133 | dest[dp++] = 't'; dest[dp++] = ';'; |
universe@5 | 134 | } else if (c == '<') { |
universe@5 | 135 | dest[dp++] = '&'; dest[dp++] = 'l'; |
universe@5 | 136 | dest[dp++] = 't'; dest[dp++] = ';'; |
universe@5 | 137 | } else { |
universe@5 | 138 | dest[dp++] = c; |
universe@5 | 139 | } |
universe@5 | 140 | |
universe@5 | 141 | return dp; |
universe@5 | 142 | } |
universe@5 | 143 | |
universe@5 | 144 | int iskeyword(char *word) { |
universe@5 | 145 | for (int i = 0 ; keywords[i] ; i++) { |
universe@5 | 146 | if (strncmp(keywords[i], word, WORDBUF_SIZE) == 0) { |
universe@5 | 147 | return 1; |
universe@5 | 148 | } |
universe@5 | 149 | } |
universe@5 | 150 | return 0; |
universe@5 | 151 | } |
universe@5 | 152 | |
universe@5 | 153 | #define istype(word, len) (word[len-2] == '_' && word[len-1] == 't') |
universe@5 | 154 | |
universe@4 | 155 | void parseline(char *src, char *dest) { |
universe@4 | 156 | size_t sp = 0, dp = 0; |
universe@4 | 157 | /* indent */ |
universe@4 | 158 | while (isspace(src[sp])) { |
universe@4 | 159 | dest[dp++] = src[sp++]; |
universe@4 | 160 | } |
universe@5 | 161 | char word[WORDBUF_SIZE]; |
universe@5 | 162 | memset(word, 0, WORDBUF_SIZE); |
universe@5 | 163 | size_t wp = 0; |
universe@5 | 164 | int closespan; |
universe@4 | 165 | for (char c = src[sp] ; c ; c=src[++sp]) { |
universe@5 | 166 | if (!isalnum(c) && c != '_') { |
universe@5 | 167 | /* interpret word int_t */ |
universe@5 | 168 | if (wp > 0 && wp < WORDBUF_SIZE) { |
universe@5 | 169 | if (iskeyword(word)) { |
universe@5 | 170 | memcpy(&(dest[dp]), "<span class=\"c2html-keyword\">", 29); |
universe@5 | 171 | dp += 29; |
universe@5 | 172 | closespan = 1; |
universe@5 | 173 | } else if (istype(word, wp)) { |
universe@5 | 174 | memcpy(&(dest[dp]), "<span class=\"c2html-type\">", 26); |
universe@5 | 175 | dp += 26; |
universe@5 | 176 | closespan = 1; |
universe@5 | 177 | } else { |
universe@5 | 178 | closespan = 0; |
universe@5 | 179 | } |
universe@5 | 180 | for (int i = 0 ; i < wp ; i++) { |
universe@5 | 181 | dp = writeescapedchar(dest, dp, word[i]); |
universe@5 | 182 | } |
universe@5 | 183 | if (closespan) { |
universe@5 | 184 | memcpy(&(dest[dp]), "</span>", 7); |
universe@5 | 185 | dp += 7; |
universe@5 | 186 | } |
universe@6 | 187 | memset(word, 0, WORDBUF_SIZE); |
universe@6 | 188 | wp = 0; |
universe@5 | 189 | } |
universe@5 | 190 | dp = writeescapedchar(dest, dp, c); |
universe@5 | 191 | } else { |
universe@5 | 192 | /* read word */ |
universe@5 | 193 | if (wp < WORDBUF_SIZE) { |
universe@5 | 194 | word[wp++] = c; |
universe@5 | 195 | } else if (wp == WORDBUF_SIZE) { |
universe@5 | 196 | for (int i = 0 ; i < WORDBUF_SIZE ; i++) { |
universe@5 | 197 | dp = writeescapedchar(dest, dp, word[i]); |
universe@5 | 198 | } |
universe@5 | 199 | wp++; |
universe@5 | 200 | dp = writeescapedchar(dest, dp, c); |
universe@5 | 201 | } else { |
universe@5 | 202 | dp = writeescapedchar(dest, dp, c); |
universe@5 | 203 | } |
universe@4 | 204 | } |
universe@4 | 205 | } |
universe@4 | 206 | dest[dp] = 0; |
universe@4 | 207 | } |
universe@4 | 208 | |
universe@1 | 209 | void printhelp() { |
universe@1 | 210 | printf("Formats source code using HTML.\n\nUsage:\n" |
universe@11 | 211 | " c2html [Options] FILE\n\n" |
universe@11 | 212 | " Options:\n" |
universe@11 | 213 | " -h Prints this help message\n" |
universe@11 | 214 | " -o <output> Output file (if not specified, stdout is used)\n" |
universe@1 | 215 | "\n"); |
universe@1 | 216 | |
universe@1 | 217 | |
universe@1 | 218 | } |
universe@1 | 219 | |
universe@4 | 220 | int lnint(size_t lnc) { |
universe@1 | 221 | int w = 1, p = 1; |
universe@1 | 222 | while ((p*=10) < lnc) w++; |
universe@1 | 223 | return w; |
universe@1 | 224 | } |
universe@1 | 225 | |
universe@1 | 226 | int main(int argc, char** argv) { |
universe@1 | 227 | |
universe@11 | 228 | settings_t settings; |
universe@11 | 229 | settings.outfilename = NULL; |
universe@11 | 230 | |
universe@11 | 231 | char optc; |
universe@11 | 232 | while ((optc = getopt(argc, argv, "ho:")) != -1) { |
universe@11 | 233 | switch (optc) { |
universe@11 | 234 | case 'o': |
universe@11 | 235 | if (!(optarg[0] == '-' && optarg[1] == 0)) { |
universe@11 | 236 | settings.outfilename = optarg; |
universe@11 | 237 | } |
universe@11 | 238 | break; |
universe@11 | 239 | case 'h': |
universe@11 | 240 | printhelp(); |
universe@11 | 241 | return 0; |
universe@11 | 242 | default: |
universe@11 | 243 | return 1; |
universe@11 | 244 | } |
universe@11 | 245 | } |
universe@11 | 246 | |
universe@11 | 247 | if (optind != argc-1) { |
universe@1 | 248 | printhelp(); |
universe@11 | 249 | return 1; |
universe@1 | 250 | } else { |
universe@11 | 251 | settings.infilename = argv[optind]; |
universe@1 | 252 | |
universe@11 | 253 | inputfile_t *inputfile = readinput(settings.infilename); |
universe@1 | 254 | if (inputfile) { |
universe@11 | 255 | FILE *fout; |
universe@11 | 256 | if (settings.outfilename) { |
universe@11 | 257 | fout = fopen(settings.outfilename, "w"); |
universe@11 | 258 | } else { |
universe@11 | 259 | fout = stdout; |
universe@11 | 260 | } |
universe@11 | 261 | fprintf(fout, "<pre>\n"); |
universe@4 | 262 | char *line = (char*) malloc(inputfile->maxlinewidth*64); |
universe@4 | 263 | int lnw = lnint(inputfile->count); |
universe@1 | 264 | for (int i = 0 ; i < inputfile->count ; i++) { |
universe@4 | 265 | parseline(inputfile->lines[i], line); |
universe@11 | 266 | fprintf(fout, "<span class=\"c2html-lineno\">%*d:</span> %s", |
universe@4 | 267 | lnw, i, line); |
universe@1 | 268 | } |
universe@4 | 269 | free(line); |
universe@11 | 270 | fprintf(fout, "</pre>\n"); |
universe@11 | 271 | |
universe@11 | 272 | if (fout != stdout) { |
universe@11 | 273 | fclose(fout); |
universe@11 | 274 | } |
universe@11 | 275 | |
universe@1 | 276 | freeinputfilebuffer(inputfile); |
universe@1 | 277 | } |
universe@1 | 278 | |
universe@1 | 279 | return 0; |
universe@1 | 280 | } |
universe@1 | 281 | } |
universe@1 | 282 |