1
0
mirror of https://github.com/danog/blackfriday.git synced 2024-11-30 04:29:13 +01:00
blackfriday/markdown.go

539 lines
13 KiB
Go
Raw Normal View History

//
2011-06-28 04:11:32 +02:00
// Blackfriday Markdown Processor
// Available at http://github.com/russross/blackfriday
//
// Copyright © 2011 Russ Ross <russ@russross.com>.
// Distributed under the Simplified BSD License.
2011-06-28 04:11:32 +02:00
// See README.md for details.
//
2011-05-29 05:17:53 +02:00
//
//
// Markdown parsing and processing
//
//
package blackfriday
2011-05-25 00:14:35 +02:00
import (
"bytes"
"utf8"
2011-05-25 00:14:35 +02:00
)
2011-06-29 19:22:20 +02:00
const VERSION = "0.6"
2011-05-29 05:17:53 +02:00
// These are the supported markdown parsing extensions.
// OR these values together to select multiple extensions.
2011-05-25 00:14:35 +02:00
const (
2011-05-29 05:17:53 +02:00
EXTENSION_NO_INTRA_EMPHASIS = 1 << iota
EXTENSION_TABLES
EXTENSION_FENCED_CODE
EXTENSION_AUTOLINK
EXTENSION_STRIKETHROUGH
EXTENSION_LAX_HTML_BLOCKS
EXTENSION_SPACE_HEADERS
EXTENSION_HARD_LINE_BREAK
EXTENSION_NO_EXPAND_TABS
EXTENSION_TAB_SIZE_EIGHT
2011-05-25 00:14:35 +02:00
)
2011-05-29 05:17:53 +02:00
// These are the possible flag values for the link renderer.
// Only a single one of these values will be used; they are not ORed together.
// These are mostly of interest if you are writing a new output format.
2011-05-25 00:14:35 +02:00
const (
2011-05-29 05:17:53 +02:00
LINK_TYPE_NOT_AUTOLINK = iota
LINK_TYPE_NORMAL
LINK_TYPE_EMAIL
2011-05-25 00:14:35 +02:00
)
2011-05-29 05:17:53 +02:00
// These are the possible flag values for the listitem renderer.
// Multiple flag values may be ORed together.
// These are mostly of interest if you are writing a new output format.
2011-05-25 21:59:30 +02:00
const (
2011-05-29 05:17:53 +02:00
LIST_TYPE_ORDERED = 1 << iota
LIST_ITEM_CONTAINS_BLOCK
LIST_ITEM_END_OF_LIST
2011-05-25 21:59:30 +02:00
)
2011-05-29 05:17:53 +02:00
// These are the possible flag values for the table cell renderer.
// Only a single one of these values will be used; they are not ORed together.
// These are mostly of interest if you are writing a new output format.
2011-05-25 21:59:30 +02:00
const (
2011-05-29 05:17:53 +02:00
TABLE_ALIGNMENT_LEFT = 1 << iota
TABLE_ALIGNMENT_RIGHT
TABLE_ALIGNMENT_CENTER = (TABLE_ALIGNMENT_LEFT | TABLE_ALIGNMENT_RIGHT)
2011-05-25 21:59:30 +02:00
)
2011-05-29 05:17:53 +02:00
// The size of a tab stop.
const (
TAB_SIZE_DEFAULT = 4
TAB_SIZE_EIGHT = 8
)
2011-05-29 05:17:53 +02:00
// These are the tags that are recognized as HTML block tags.
// Any of these can be included in markdown text without special escaping.
2011-06-29 00:02:12 +02:00
var blockTags = map[string]bool{
2011-05-28 17:49:21 +02:00
"p": true,
"dl": true,
"h1": true,
"h2": true,
"h3": true,
"h4": true,
"h5": true,
"h6": true,
"ol": true,
"ul": true,
"del": true,
"div": true,
"ins": true,
"pre": true,
"form": true,
"math": true,
"table": true,
"iframe": true,
"script": true,
"fieldset": true,
"noscript": true,
"blockquote": true,
2011-05-25 00:14:35 +02:00
}
2011-06-29 19:21:46 +02:00
// This interface defines the rendering interface.
2011-05-29 05:17:53 +02:00
// This is mostly of interest if you are implementing a new rendering format.
2011-06-29 19:21:46 +02:00
// Currently Html and Latex implementations are provided
2011-06-29 19:13:17 +02:00
type Renderer interface {
// block-level callbacks
BlockCode(out *bytes.Buffer, text []byte, lang string)
BlockQuote(out *bytes.Buffer, text []byte)
BlockHtml(out *bytes.Buffer, text []byte)
Header(out *bytes.Buffer, text func() bool, level int)
HRule(out *bytes.Buffer)
List(out *bytes.Buffer, text func() bool, flags int)
ListItem(out *bytes.Buffer, text []byte, flags int)
Paragraph(out *bytes.Buffer, text func() bool)
Table(out *bytes.Buffer, header []byte, body []byte, columnData []int)
TableRow(out *bytes.Buffer, text []byte)
TableCell(out *bytes.Buffer, text []byte, flags int)
// Span-level callbacks---return false prints the span verbatim
AutoLink(out *bytes.Buffer, link []byte, kind int) bool
CodeSpan(out *bytes.Buffer, text []byte) bool
DoubleEmphasis(out *bytes.Buffer, text []byte) bool
Emphasis(out *bytes.Buffer, text []byte) bool
Image(out *bytes.Buffer, link []byte, title []byte, alt []byte) bool
LineBreak(out *bytes.Buffer) bool
Link(out *bytes.Buffer, link []byte, title []byte, content []byte) bool
RawHtmlTag(out *bytes.Buffer, tag []byte) bool
TripleEmphasis(out *bytes.Buffer, text []byte) bool
StrikeThrough(out *bytes.Buffer, text []byte) bool
// Low-level callbacks
Entity(out *bytes.Buffer, entity []byte)
NormalText(out *bytes.Buffer, text []byte)
// Header and footer
2011-06-29 19:13:17 +02:00
DocumentHeader(out *bytes.Buffer)
DocumentFooter(out *bytes.Buffer)
2011-05-25 00:14:35 +02:00
}
2011-06-29 19:21:46 +02:00
// Callback functions for inline parsing. One such function is defined
// for each character that triggers a response when parsing inline data.
type inlineParser func(parser *Parser, out *bytes.Buffer, data []byte, offset int) int
2011-05-26 04:46:16 +02:00
2011-06-29 19:21:46 +02:00
// The main parser object.
// This is constructed by the Markdown function and
// contains state used during the parsing process.
type Parser struct {
2011-06-29 19:13:17 +02:00
r Renderer
refs map[string]*reference
inline [256]inlineParser
flags int
nesting int
maxNesting int
insideLink bool
2011-05-25 00:14:35 +02:00
}
2011-05-29 05:17:53 +02:00
//
//
// Public interface
//
2011-05-26 17:47:41 +02:00
//
2011-05-25 00:14:35 +02:00
// Call Markdown with no extensions
func MarkdownBasic(input []byte) []byte {
// set up the HTML renderer
htmlFlags := HTML_USE_XHTML
renderer := HtmlRenderer(htmlFlags, "", "")
// set up the parser
extensions := 0
return Markdown(input, renderer, extensions)
}
// Call Markdown with most useful extensions enabled
func MarkdownCommon(input []byte) []byte {
// set up the HTML renderer
htmlFlags := 0
htmlFlags |= HTML_USE_XHTML
htmlFlags |= HTML_USE_SMARTYPANTS
htmlFlags |= HTML_SMARTYPANTS_FRACTIONS
htmlFlags |= HTML_SMARTYPANTS_LATEX_DASHES
renderer := HtmlRenderer(htmlFlags, "", "")
// set up the parser
extensions := 0
extensions |= EXTENSION_NO_INTRA_EMPHASIS
extensions |= EXTENSION_TABLES
extensions |= EXTENSION_FENCED_CODE
extensions |= EXTENSION_AUTOLINK
extensions |= EXTENSION_STRIKETHROUGH
extensions |= EXTENSION_SPACE_HEADERS
return Markdown(input, renderer, extensions)
}
2011-05-29 05:17:53 +02:00
// Parse and render a block of markdown-encoded text.
// The renderer is used to format the output, and extensions dictates which
// non-standard extensions are enabled.
2011-06-29 19:13:17 +02:00
func Markdown(input []byte, renderer Renderer, extensions int) []byte {
2011-05-29 05:17:53 +02:00
// no point in parsing if we can't render
if renderer == nil {
return nil
2011-05-26 04:46:16 +02:00
}
2011-05-29 05:17:53 +02:00
// fill in the render structure
parser := new(Parser)
parser.r = renderer
parser.flags = extensions
parser.refs = make(map[string]*reference)
parser.maxNesting = 16
parser.insideLink = false
// register inline parsers
2011-06-29 19:13:17 +02:00
parser.inline['*'] = inlineEmphasis
parser.inline['_'] = inlineEmphasis
if extensions&EXTENSION_STRIKETHROUGH != 0 {
parser.inline['~'] = inlineEmphasis
2011-05-29 05:17:53 +02:00
}
2011-06-29 19:13:17 +02:00
parser.inline['`'] = inlineCodeSpan
parser.inline['\n'] = inlineLineBreak
parser.inline['['] = inlineLink
parser.inline['<'] = inlineLAngle
parser.inline['\\'] = inlineEscape
parser.inline['&'] = inlineEntity
2011-05-26 04:46:16 +02:00
2011-05-29 05:17:53 +02:00
if extensions&EXTENSION_AUTOLINK != 0 {
parser.inline[':'] = inlineAutoLink
2011-05-29 05:17:53 +02:00
}
first := firstPass(parser, input)
second := secondPass(parser, first)
return second
}
// first pass:
// - extract references
// - expand tabs
// - normalize newlines
// - copy everything else
func firstPass(parser *Parser, input []byte) []byte {
var out bytes.Buffer
2011-06-29 00:02:12 +02:00
tabSize := TAB_SIZE_DEFAULT
if parser.flags&EXTENSION_TAB_SIZE_EIGHT != 0 {
2011-06-29 00:02:12 +02:00
tabSize = TAB_SIZE_EIGHT
}
2011-05-29 05:17:53 +02:00
beg, end := 0, 0
for beg < len(input) { // iterate over lines
if end = isReference(parser, input[beg:]); end > 0 {
2011-05-29 05:17:53 +02:00
beg += end
} else { // skip to the next line
end = beg
for end < len(input) && input[end] != '\n' && input[end] != '\r' {
end++
}
// add the line body if present
if end > beg {
if parser.flags&EXTENSION_NO_EXPAND_TABS == 0 {
2011-06-29 00:02:12 +02:00
expandTabs(&out, input[beg:end], tabSize)
} else {
out.Write(input[beg:end])
}
2011-05-29 05:17:53 +02:00
}
out.WriteByte('\n')
2011-05-29 05:17:53 +02:00
if end < len(input) && input[end] == '\r' {
end++
}
if end < len(input) && input[end] == '\n' {
2011-05-29 05:17:53 +02:00
end++
}
beg = end
}
}
return out.Bytes()
}
2011-05-29 05:17:53 +02:00
// second pass: actual rendering
func secondPass(parser *Parser, input []byte) []byte {
var output bytes.Buffer
2011-05-29 05:17:53 +02:00
2011-06-29 19:13:17 +02:00
parser.r.DocumentHeader(&output)
parser.parseBlock(&output, input)
2011-06-29 19:13:17 +02:00
parser.r.DocumentFooter(&output)
2011-05-29 05:17:53 +02:00
if parser.nesting != 0 {
2011-05-29 05:17:53 +02:00
panic("Nesting level did not end at zero")
}
return output.Bytes()
2011-05-29 05:17:53 +02:00
}
2011-05-25 21:59:30 +02:00
//
2011-05-29 05:17:53 +02:00
// Link references
2011-05-25 21:59:30 +02:00
//
2011-05-29 05:17:53 +02:00
// This section implements support for references that (usually) appear
// as footnotes in a document, and can be referenced anywhere in the document.
// The basic format is:
2011-05-25 21:59:30 +02:00
//
2011-05-29 05:17:53 +02:00
// [1]: http://www.google.com/ "Google"
// [2]: http://www.github.com/ "Github"
2011-05-25 21:59:30 +02:00
//
2011-05-29 05:17:53 +02:00
// Anywhere in the document, the reference can be linked by referring to its
// label, i.e., 1 and 2 in this example, as in:
//
// This library is hosted on [Github][2], a git hosting site.
2011-05-25 21:59:30 +02:00
2011-05-29 05:17:53 +02:00
// References are parsed and stored in this struct.
type reference struct {
2011-05-29 05:17:53 +02:00
link []byte
title []byte
2011-05-25 00:14:35 +02:00
}
2011-05-29 05:17:53 +02:00
// Check whether or not data starts with a reference link.
// If so, it is parsed and stored in the list of references
// (in the render struct).
// Returns the number of bytes to skip to move past it,
// or zero if the first line is not a reference.
func isReference(parser *Parser, data []byte) int {
2011-05-29 05:17:53 +02:00
// up to 3 optional leading spaces
if len(data) < 4 {
return 0
2011-05-25 00:14:35 +02:00
}
2011-05-29 05:17:53 +02:00
i := 0
for i < 3 && data[i] == ' ' {
i++
2011-05-25 00:14:35 +02:00
}
2011-05-29 05:17:53 +02:00
// id part: anything but a newline between brackets
if data[i] != '[' {
return 0
2011-05-25 00:14:35 +02:00
}
2011-05-29 05:17:53 +02:00
i++
2011-06-29 00:02:12 +02:00
idOffset := i
2011-05-29 05:17:53 +02:00
for i < len(data) && data[i] != '\n' && data[i] != '\r' && data[i] != ']' {
i++
2011-05-25 00:14:35 +02:00
}
2011-05-29 05:17:53 +02:00
if i >= len(data) || data[i] != ']' {
return 0
2011-05-25 00:14:35 +02:00
}
2011-06-29 00:02:12 +02:00
idEnd := i
2011-05-25 00:14:35 +02:00
2011-05-29 05:17:53 +02:00
// spacer: colon (space | tab)* newline? (space | tab)*
i++
if i >= len(data) || data[i] != ':' {
return 0
2011-05-25 21:59:30 +02:00
}
2011-05-29 05:17:53 +02:00
i++
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
i++
2011-05-25 21:59:30 +02:00
}
2011-05-29 05:17:53 +02:00
if i < len(data) && (data[i] == '\n' || data[i] == '\r') {
i++
if i < len(data) && data[i] == '\n' && data[i-1] == '\r' {
i++
2011-05-25 21:59:30 +02:00
}
}
2011-05-29 05:17:53 +02:00
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
i++
}
if i >= len(data) {
return 0
2011-05-25 21:59:30 +02:00
}
2011-05-29 05:17:53 +02:00
// link: whitespace-free sequence, optionally between angle brackets
if data[i] == '<' {
2011-05-26 00:00:01 +02:00
i++
}
2011-06-29 00:02:12 +02:00
linkOffset := i
2011-05-29 05:17:53 +02:00
for i < len(data) && data[i] != ' ' && data[i] != '\t' && data[i] != '\n' && data[i] != '\r' {
i++
2011-05-27 21:38:10 +02:00
}
2011-06-29 00:02:12 +02:00
linkEnd := i
if data[linkOffset] == '<' && data[linkEnd-1] == '>' {
linkOffset++
linkEnd--
2011-05-27 21:38:10 +02:00
}
2011-05-29 05:17:53 +02:00
// optional spacer: (space | tab)* (newline | '\'' | '"' | '(' )
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
i++
}
2011-05-29 05:17:53 +02:00
if i < len(data) && data[i] != '\n' && data[i] != '\r' && data[i] != '\'' && data[i] != '"' && data[i] != '(' {
return 0
}
2011-05-29 05:17:53 +02:00
// compute end-of-line
2011-06-29 00:02:12 +02:00
lineEnd := 0
2011-05-29 05:17:53 +02:00
if i >= len(data) || data[i] == '\r' || data[i] == '\n' {
2011-06-29 00:02:12 +02:00
lineEnd = i
}
2011-05-29 05:17:53 +02:00
if i+1 < len(data) && data[i] == '\r' && data[i+1] == '\n' {
2011-06-29 00:02:12 +02:00
lineEnd++
2011-05-29 01:37:18 +02:00
}
2011-05-29 05:17:53 +02:00
// optional (space|tab)* spacer after a newline
2011-06-29 00:02:12 +02:00
if lineEnd > 0 {
i = lineEnd + 1
2011-05-29 05:17:53 +02:00
for i < len(data) && (data[i] == ' ' || data[i] == '\t') {
i++
2011-05-29 01:37:18 +02:00
}
}
2011-05-29 05:17:53 +02:00
// optional title: any non-newline sequence enclosed in '"() alone on its line
2011-06-29 00:02:12 +02:00
titleOffset, titleEnd := 0, 0
2011-05-29 05:17:53 +02:00
if i+1 < len(data) && (data[i] == '\'' || data[i] == '"' || data[i] == '(') {
i++
2011-06-29 00:02:12 +02:00
titleOffset = i
2011-05-29 05:17:53 +02:00
// look for EOL
for i < len(data) && data[i] != '\n' && data[i] != '\r' {
i++
}
2011-05-29 05:17:53 +02:00
if i+1 < len(data) && data[i] == '\n' && data[i+1] == '\r' {
2011-06-29 00:02:12 +02:00
titleEnd = i + 1
2011-05-29 05:17:53 +02:00
} else {
2011-06-29 00:02:12 +02:00
titleEnd = i
2011-05-29 01:37:18 +02:00
}
2011-05-29 05:17:53 +02:00
// step back
i--
2011-06-29 00:02:12 +02:00
for i > titleOffset && (data[i] == ' ' || data[i] == '\t') {
2011-05-29 05:17:53 +02:00
i--
2011-05-29 01:37:18 +02:00
}
2011-06-29 00:02:12 +02:00
if i > titleOffset && (data[i] == '\'' || data[i] == '"' || data[i] == ')') {
lineEnd = titleEnd
titleEnd = i
2011-05-29 01:37:18 +02:00
}
}
2011-06-29 00:02:12 +02:00
if lineEnd == 0 { // garbage after the link
2011-05-29 01:37:18 +02:00
return 0
}
2011-05-29 05:17:53 +02:00
// a valid ref has been found
if parser == nil {
2011-06-29 00:02:12 +02:00
return lineEnd
2011-05-29 01:37:18 +02:00
}
// id matches are case-insensitive
2011-06-29 00:02:12 +02:00
id := string(bytes.ToLower(data[idOffset:idEnd]))
parser.refs[id] = &reference{
2011-06-29 00:02:12 +02:00
link: data[linkOffset:linkEnd],
title: data[titleOffset:titleEnd],
}
2011-05-29 01:37:18 +02:00
2011-06-29 00:02:12 +02:00
return lineEnd
2011-05-29 01:37:18 +02:00
}
2011-05-29 05:17:53 +02:00
//
//
// Miscellaneous helper functions
//
//
2011-05-29 01:37:18 +02:00
2011-05-29 05:17:53 +02:00
// Test if a character is a punctuation symbol.
// Taken from a private function in regexp in the stdlib.
func ispunct(c byte) bool {
for _, r := range []byte("!\"#$%&'()*+,-./:;<=>?@[\\]^_`{|}~") {
if c == r {
return true
2011-05-29 01:37:18 +02:00
}
}
2011-05-29 05:17:53 +02:00
return false
2011-05-29 01:37:18 +02:00
}
2011-05-29 05:17:53 +02:00
// Test if a character is a whitespace character.
func isspace(c byte) bool {
return c == ' ' || c == '\t' || c == '\n' || c == '\r' || c == '\f' || c == '\v'
2011-05-29 01:37:18 +02:00
}
2011-05-29 05:17:53 +02:00
// Test if a character is a letter or a digit.
// TODO: check when this is looking for ASCII alnum and when it should use unicode
2011-05-29 05:17:53 +02:00
func isalnum(c byte) bool {
return (c >= '0' && c <= '9') || (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')
2011-05-29 01:37:18 +02:00
}
2011-05-29 05:17:53 +02:00
// Replace tab characters with spaces, aligning to the next TAB_SIZE column.
// always ends output with a newline
2011-06-29 00:02:12 +02:00
func expandTabs(out *bytes.Buffer, line []byte, tabSize int) {
// first, check for common cases: no tabs, or only tabs at beginning of line
i, prefix := 0, 0
slowcase := false
for i = 0; i < len(line); i++ {
if line[i] == '\t' {
if prefix == i {
prefix++
} else {
slowcase = true
break
}
}
}
2011-05-26 04:46:16 +02:00
// no need to decode runes if all tabs are at the beginning of the line
if !slowcase {
2011-06-29 00:02:12 +02:00
for i = 0; i < prefix*tabSize; i++ {
out.WriteByte(' ')
}
out.Write(line[prefix:])
return
}
// the slow case: we need to count runes to figure out how
// many spaces to insert for each tab
column := 0
i = 0
2011-05-26 04:46:16 +02:00
for i < len(line) {
start := i
2011-05-26 04:46:16 +02:00
for i < len(line) && line[i] != '\t' {
_, size := utf8.DecodeRune(line[i:])
i += size
column++
2011-05-26 04:46:16 +02:00
}
if i > start {
out.Write(line[start:i])
2011-05-26 04:46:16 +02:00
}
if i >= len(line) {
break
}
for {
out.WriteByte(' ')
column++
2011-06-29 00:02:12 +02:00
if column%tabSize == 0 {
2011-05-26 04:46:16 +02:00
break
}
}
i++
}
}