*/
#include <ctype.h>
+#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
+#include <string.h>
#include "parser.h"
int c = 0; // char
int i = 0; // increment
- int l = 0; // line length
int hc = 0; // header count
int lc = 0; // line count
- int sc = 0; // slide count
+ int sc = 1; // slide count
int bits = 0; // markdown bits
deck_t *deck = new_deck();
- slide_t *slide = new_slide();
+ slide_t *slide = deck->slide;
line_t *line = NULL;
line_t *tmp = NULL;
cstring_t *text = cstring_init();
- // assign first slide to deck
- deck->slide = slide;
- sc++;
-
while ((c = fgetc(input)) != EOF) {
+ if (ferror(input)) {
+ fprintf(stderr, "markdown_load() failed to read input: %s\n", strerror(errno));
+ exit(EXIT_FAILURE);
+ }
+
if(c == '\n') {
// markdown analyse
// clear text
(text->reset)(text);
- l = 0;
// create next slide
slide = next_slide(slide);
// add bits to line
line->bits = bits;
- // add length to line
- line->length = l;
-
// calc offset
line->offset = next_nonblank(text, 0);
+ // adjust line length dynamicaly - excluding markup
+ if(line->text->text)
+ adjust_line_length(line);
+
// new text
text = cstring_init();
- l = 0;
}
} else if(c == '\t') {
// expand tab to spaces
for (i = 0; i < EXPAND_TABS; i++) {
(text->expand)(text, ' ');
- l++;
}
} else if(c == '\\') {
// add char to line
(text->expand)(text, c);
- l++;
// if !IS_CODE add next char to line
// and do not increase line count
// add char to line
(text->expand)(text, c);
- l++;
} else if(is_utf8(c)) {
c = fgetc(input);
(text->expand)(text, c);
}
-
- l++;
}
}
}
// split linked list
- line->prev->next = (void*)0;
- line->prev = (void*)0;
+ line->prev->next = NULL;
+ line->prev = NULL;
// remove header lines from slide
deck->slide->line = line;
// delete line
(tmp->text->delete)(tmp->text);
free(tmp);
+
} else if(CHECK_BIT(line->bits, IS_UNORDERED_LIST_3)) {
tmp = line->next;
line_t *list_last_level_3 = line;
for(tmp = line; tmp != list_last_level_3; tmp = tmp->next) {
SET_BIT(tmp->bits, IS_UNORDERED_LIST_3);
}
+
} else if(CHECK_BIT(line->bits, IS_UNORDERED_LIST_2)) {
tmp = line->next;
line_t *list_last_level_2 = line;
for(tmp = line; tmp != list_last_level_2; tmp = tmp->next) {
SET_BIT(tmp->bits, IS_UNORDERED_LIST_2);
}
+
} else if(CHECK_BIT(line->bits, IS_UNORDERED_LIST_1)) {
tmp = line->next;
line_t *list_last_level_1 = line;
}
tmp = tmp->next;
}
-
+
for(tmp = line; tmp != list_last_level_1; tmp = tmp->next) {
SET_BIT(tmp->bits, IS_UNORDERED_LIST_1);
}
const int unordered_list_offset = unordered_list_level_offset[unordered_list_level];
+ // return IS_EMPTY on null pointers
+ if(!text || !text->text) {
+ SET_BIT(bits, IS_EMPTY);
+ return bits;
+ }
+
// count leading spaces
offset = next_nonblank(text, 0);
case 3: SET_BIT(bits, IS_UNORDERED_LIST_3); break;
default: break;
}
-
+
break;
}
}
}
-
+
if(!CHECK_BIT(bits, IS_UNORDERED_LIST_1) &&
!CHECK_BIT(bits, IS_UNORDERED_LIST_2) &&
!CHECK_BIT(bits, IS_UNORDERED_LIST_3)) {
} else {
+ // IS_QUOTE
+ if(text->text[offset] == '>') {
+ SET_BIT(bits, IS_QUOTE);
+ }
+
+ // IS_CENTER
+ if(text->size >= offset + 3 &&
+ text->text[offset] == '-' &&
+ text->text[offset + 1] == '>' &&
+ text->text[offset + 2] == ' ') {
+ SET_BIT(bits, IS_CENTER);
+
+ // remove start tag
+ (text->strip)(text, offset, 3);
+ eol -= 3;
+
+ if(text->size >= offset + 3 &&
+ text->text[eol - 1] == '-' &&
+ text->text[eol - 2] == '<' &&
+ text->text[eol - 3] == ' ') {
+
+ // remove end tags
+ (text->strip)(text, eol - 3, 3);
+
+ // adjust end of line
+ for(eol = text->size; eol > offset && isspace((unsigned char) text->text[eol - 1]); eol--);
+
+ }
+ }
+
for(i = offset; i < eol; i++) {
if(text->text[i] == ' ') {
spaces++;
- } else if(CHECK_BIT(bits, IS_CODE)) {
- other++;
-
} else {
switch(text->text[i]) {
case '=': equals++; break;
}
// IS_H1
- if((equals > 0 &&
- hashes + stars + minus + spaces + other == 0) ||
- (text &&
- text->text &&
- text->text[offset] == '#' &&
- text->text[offset+1] != '#')) {
-
+ if(equals > 0 &&
+ hashes + stars + minus + spaces + other == 0) {
+ SET_BIT(bits, IS_H1);
+ }
+ if(text->text[offset] == '#' &&
+ text->text[offset+1] == ' ') {
SET_BIT(bits, IS_H1);
+ SET_BIT(bits, IS_H1_ATX);
}
// IS_H2
- if((minus > 0 &&
- equals + hashes + stars + spaces + other == 0) ||
- (text &&
- text->text &&
- text->text[offset] == '#' &&
- text->text[offset+1] == '#')) {
-
+ if(minus > 0 &&
+ equals + hashes + stars + spaces + other == 0) {
SET_BIT(bits, IS_H2);
}
-
- // IS_QUOTE
- if(text &&
- text->text &&
- text->text[offset] == '>') {
-
- SET_BIT(bits, IS_QUOTE);
+ if(text->text[offset] == '#' &&
+ text->text[offset+1] == '#' &&
+ text->text[offset+2] == ' ') {
+ SET_BIT(bits, IS_H2);
+ SET_BIT(bits, IS_H2_ATX);
}
// IS_HR
}
}
-int is_utf8(char ch) {
- return (ch & 0x80);
+void adjust_line_length(line_t *line) {
+ int l = 0;
+ const static char *special = "\\*_`"; // list of interpreted chars
+ const char *c = &line->text->text[line->offset];
+ cstack_t *stack = cstack_init();
+
+ // for each char in line
+ for(; *c; c++) {
+ // if char is in special char list
+ if(strchr(special, *c)) {
+
+ // closing special char (or second backslash)
+ if((stack->top)(stack, *c)) {
+ if(*c == '\\') l++;
+ (stack->pop)(stack);
+
+ // treat special as regular char
+ } else if((stack->top)(stack, '\\')) {
+ l++;
+ (stack->pop)(stack);
+
+ // opening special char
+ } else {
+ (stack->push)(stack, *c);
+ }
+
+ } else {
+ // remove backslash from stack
+ if((stack->top)(stack, '\\'))
+ (stack->pop)(stack);
+ l++;
+ }
+ }
+
+ if(CHECK_BIT(line->bits, IS_H1_ATX))
+ l -= 2;
+ if(CHECK_BIT(line->bits, IS_H2_ATX))
+ l -= 3;
+
+ line->length = l;
+
+ (stack->delete)(stack);
+}
+
+bool is_utf8(char ch) {
+ return (ch & 0x80) != 0x00;
}
int length_utf8(char ch) {
int next_word(cstring_t *text, int i) {
return next_nonblank(text, next_blank(text, i));
}
-
