mirror of
https://github.com/Orc/discount.git
synced 2026-09-25 04:10:00 +03:00
david parsons
ed662dfea3
by writing compiled output into a token queue, then running
an emphasis maker on that queue. The token queue is an array
of TEXT and EMPHASIS tokens -- `TEXT` being what you'd expect,
and `EMPHASIS` holding counts of consecutive emphasis characters.
It's easier to explain with pretty pictures:
During the process of compiling the string `***HI***`, it gets
broken into five tokens:
1. TEXT `<p>`
2. EMPHASIS `*`3
3. TEXT `HI`
4. EMPHASIS `*`3
5. TEXT `</p>`
and then pasted together into a compiled document. During the
pasting, emphasis tokens are paired with the next matching emphasis
token, then rewritten into two text sections (opens & closes) which
are treated as normal text during the pasting.
The above tokens are processed like so; first to
1. TEXT `<p>`
2. EMPHASIS `*`1 [] [`<strong>`]
3. TEXT `HI`
4. EMPHASIS `*`1 [`</strong>`] []
5. TEXT `</p>`
then to
1. TEXT `<p>`
2. EMPHASIS `*`0 [] [`<strong><em>`]
3. TEXT `HI`
4. EMPHASIS `*`0 [`</em></strong>`] []
5. TEXT `</p>`
which is then concatenated to
<p><strong><em>HI</em></strong></p>
And Bob's your uncle.
112 lines
2.0 KiB
C
112 lines
2.0 KiB
C
/*
|
|
* debugging malloc()/realloc()/calloc()/free() that attempts
|
|
* to keep track of just what's been allocated today.
|
|
*/
|
|
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#define MAGIC 0x1f2e3d4c
|
|
|
|
struct alist { int magic, size; struct alist *next, *last; };
|
|
|
|
static struct alist list = { 0, 0, 0, 0 };
|
|
|
|
static int mallocs=0;
|
|
static int reallocs=0;
|
|
static int frees=0;
|
|
|
|
void *
|
|
acalloc(int size, int count)
|
|
{
|
|
struct alist *ret = calloc(size + sizeof(struct alist), count);
|
|
|
|
if ( ret ) {
|
|
ret->magic = MAGIC;
|
|
ret->size = size * count;
|
|
if ( list.next ) {
|
|
ret->next = list.next;
|
|
ret->last = &list;
|
|
ret->next->last = ret;
|
|
list.next = ret;
|
|
}
|
|
else {
|
|
ret->last = ret->next = &list;
|
|
list.next = list.last = ret;
|
|
}
|
|
++mallocs;
|
|
return ret+1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
|
|
void*
|
|
amalloc(int size)
|
|
{
|
|
return acalloc(size,1);
|
|
}
|
|
|
|
|
|
void
|
|
afree(void *ptr)
|
|
{
|
|
struct alist *p2 = ((struct alist*)ptr)-1;
|
|
|
|
if ( p2->magic == MAGIC ) {
|
|
p2->last->next = p2->next;
|
|
p2->next->last = p2->last;
|
|
++frees;
|
|
free(p2);
|
|
}
|
|
else
|
|
free(ptr);
|
|
}
|
|
|
|
|
|
void *
|
|
arealloc(void *ptr, int size)
|
|
{
|
|
struct alist *p2 = ((struct alist*)ptr)-1;
|
|
struct alist save;
|
|
|
|
if ( p2->magic == MAGIC ) {
|
|
save.next = p2->next;
|
|
save.last = p2->last;
|
|
p2 = realloc(p2, sizeof(*p2) + size);
|
|
|
|
if ( p2 ) {
|
|
p2->size = size;
|
|
p2->next->last = p2;
|
|
p2->last->next = p2;
|
|
++reallocs;
|
|
return p2+1;
|
|
}
|
|
else {
|
|
save.next->last = save.last;
|
|
save.last->next = save.next;
|
|
return 0;
|
|
}
|
|
}
|
|
return realloc(ptr, size);
|
|
}
|
|
|
|
|
|
void
|
|
adump()
|
|
{
|
|
struct alist *p;
|
|
|
|
|
|
for ( p = list.next; p && (p != &list); p = p->next ) {
|
|
fprintf(stderr, "allocated: %d byte%s\n", p->size, (p->size==1) ? "" : "s");
|
|
fprintf(stderr, " [%.*s]\n", p->size, p+1);
|
|
}
|
|
|
|
if ( getenv("AMALLOC_STATISTICS") ) {
|
|
fprintf(stderr, "%d malloc%s\n", mallocs, (mallocs==1)?"":"s");
|
|
fprintf(stderr, "%d realloc%s\n", reallocs, (reallocs==1)?"":"s");
|
|
fprintf(stderr, "%d free%s\n", frees, (frees==1)?"":"s");
|
|
}
|
|
}
|