You cannot select more than 25 topics
			Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
		
		
		
		
		
			
		
			
				
	
	
		
			199 lines
		
	
	
		
			6.0 KiB
		
	
	
	
		
			Go
		
	
			
		
		
	
	
			199 lines
		
	
	
		
			6.0 KiB
		
	
	
	
		
			Go
		
	
| // 
 | |
| // Copyright (c) 2011-2019 Canonical Ltd
 | |
| // Copyright (c) 2006-2010 Kirill Simonov
 | |
| // 
 | |
| // Permission is hereby granted, free of charge, to any person obtaining a copy of
 | |
| // this software and associated documentation files (the "Software"), to deal in
 | |
| // the Software without restriction, including without limitation the rights to
 | |
| // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
 | |
| // of the Software, and to permit persons to whom the Software is furnished to do
 | |
| // so, subject to the following conditions:
 | |
| // 
 | |
| // The above copyright notice and this permission notice shall be included in all
 | |
| // copies or substantial portions of the Software.
 | |
| // 
 | |
| // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 | |
| // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 | |
| // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 | |
| // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 | |
| // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 | |
| // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 | |
| // SOFTWARE.
 | |
| 
 | |
| package yaml
 | |
| 
 | |
| const (
 | |
| 	// The size of the input raw buffer.
 | |
| 	input_raw_buffer_size = 512
 | |
| 
 | |
| 	// The size of the input buffer.
 | |
| 	// It should be possible to decode the whole raw buffer.
 | |
| 	input_buffer_size = input_raw_buffer_size * 3
 | |
| 
 | |
| 	// The size of the output buffer.
 | |
| 	output_buffer_size = 128
 | |
| 
 | |
| 	// The size of the output raw buffer.
 | |
| 	// It should be possible to encode the whole output buffer.
 | |
| 	output_raw_buffer_size = (output_buffer_size*2 + 2)
 | |
| 
 | |
| 	// The size of other stacks and queues.
 | |
| 	initial_stack_size  = 16
 | |
| 	initial_queue_size  = 16
 | |
| 	initial_string_size = 16
 | |
| )
 | |
| 
 | |
| // Check if the character at the specified position is an alphabetical
 | |
| // character, a digit, '_', or '-'.
 | |
| func is_alpha(b []byte, i int) bool {
 | |
| 	return b[i] >= '0' && b[i] <= '9' || b[i] >= 'A' && b[i] <= 'Z' || b[i] >= 'a' && b[i] <= 'z' || b[i] == '_' || b[i] == '-'
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is a digit.
 | |
| func is_digit(b []byte, i int) bool {
 | |
| 	return b[i] >= '0' && b[i] <= '9'
 | |
| }
 | |
| 
 | |
| // Get the value of a digit.
 | |
| func as_digit(b []byte, i int) int {
 | |
| 	return int(b[i]) - '0'
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is a hex-digit.
 | |
| func is_hex(b []byte, i int) bool {
 | |
| 	return b[i] >= '0' && b[i] <= '9' || b[i] >= 'A' && b[i] <= 'F' || b[i] >= 'a' && b[i] <= 'f'
 | |
| }
 | |
| 
 | |
| // Get the value of a hex-digit.
 | |
| func as_hex(b []byte, i int) int {
 | |
| 	bi := b[i]
 | |
| 	if bi >= 'A' && bi <= 'F' {
 | |
| 		return int(bi) - 'A' + 10
 | |
| 	}
 | |
| 	if bi >= 'a' && bi <= 'f' {
 | |
| 		return int(bi) - 'a' + 10
 | |
| 	}
 | |
| 	return int(bi) - '0'
 | |
| }
 | |
| 
 | |
| // Check if the character is ASCII.
 | |
| func is_ascii(b []byte, i int) bool {
 | |
| 	return b[i] <= 0x7F
 | |
| }
 | |
| 
 | |
| // Check if the character at the start of the buffer can be printed unescaped.
 | |
| func is_printable(b []byte, i int) bool {
 | |
| 	return ((b[i] == 0x0A) || // . == #x0A
 | |
| 		(b[i] >= 0x20 && b[i] <= 0x7E) || // #x20 <= . <= #x7E
 | |
| 		(b[i] == 0xC2 && b[i+1] >= 0xA0) || // #0xA0 <= . <= #xD7FF
 | |
| 		(b[i] > 0xC2 && b[i] < 0xED) ||
 | |
| 		(b[i] == 0xED && b[i+1] < 0xA0) ||
 | |
| 		(b[i] == 0xEE) ||
 | |
| 		(b[i] == 0xEF && // #xE000 <= . <= #xFFFD
 | |
| 			!(b[i+1] == 0xBB && b[i+2] == 0xBF) && // && . != #xFEFF
 | |
| 			!(b[i+1] == 0xBF && (b[i+2] == 0xBE || b[i+2] == 0xBF))))
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is NUL.
 | |
| func is_z(b []byte, i int) bool {
 | |
| 	return b[i] == 0x00
 | |
| }
 | |
| 
 | |
| // Check if the beginning of the buffer is a BOM.
 | |
| func is_bom(b []byte, i int) bool {
 | |
| 	return b[0] == 0xEF && b[1] == 0xBB && b[2] == 0xBF
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is space.
 | |
| func is_space(b []byte, i int) bool {
 | |
| 	return b[i] == ' '
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is tab.
 | |
| func is_tab(b []byte, i int) bool {
 | |
| 	return b[i] == '\t'
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is blank (space or tab).
 | |
| func is_blank(b []byte, i int) bool {
 | |
| 	//return is_space(b, i) || is_tab(b, i)
 | |
| 	return b[i] == ' ' || b[i] == '\t'
 | |
| }
 | |
| 
 | |
| // Check if the character at the specified position is a line break.
 | |
| func is_break(b []byte, i int) bool {
 | |
| 	return (b[i] == '\r' || // CR (#xD)
 | |
| 		b[i] == '\n' || // LF (#xA)
 | |
| 		b[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9) // PS (#x2029)
 | |
| }
 | |
| 
 | |
| func is_crlf(b []byte, i int) bool {
 | |
| 	return b[i] == '\r' && b[i+1] == '\n'
 | |
| }
 | |
| 
 | |
| // Check if the character is a line break or NUL.
 | |
| func is_breakz(b []byte, i int) bool {
 | |
| 	//return is_break(b, i) || is_z(b, i)
 | |
| 	return (
 | |
| 		// is_break:
 | |
| 		b[i] == '\r' || // CR (#xD)
 | |
| 		b[i] == '\n' || // LF (#xA)
 | |
| 		b[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9 || // PS (#x2029)
 | |
| 		// is_z:
 | |
| 		b[i] == 0)
 | |
| }
 | |
| 
 | |
| // Check if the character is a line break, space, or NUL.
 | |
| func is_spacez(b []byte, i int) bool {
 | |
| 	//return is_space(b, i) || is_breakz(b, i)
 | |
| 	return (
 | |
| 		// is_space:
 | |
| 		b[i] == ' ' ||
 | |
| 		// is_breakz:
 | |
| 		b[i] == '\r' || // CR (#xD)
 | |
| 		b[i] == '\n' || // LF (#xA)
 | |
| 		b[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9 || // PS (#x2029)
 | |
| 		b[i] == 0)
 | |
| }
 | |
| 
 | |
| // Check if the character is a line break, space, tab, or NUL.
 | |
| func is_blankz(b []byte, i int) bool {
 | |
| 	//return is_blank(b, i) || is_breakz(b, i)
 | |
| 	return (
 | |
| 		// is_blank:
 | |
| 		b[i] == ' ' || b[i] == '\t' ||
 | |
| 		// is_breakz:
 | |
| 		b[i] == '\r' || // CR (#xD)
 | |
| 		b[i] == '\n' || // LF (#xA)
 | |
| 		b[i] == 0xC2 && b[i+1] == 0x85 || // NEL (#x85)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA8 || // LS (#x2028)
 | |
| 		b[i] == 0xE2 && b[i+1] == 0x80 && b[i+2] == 0xA9 || // PS (#x2029)
 | |
| 		b[i] == 0)
 | |
| }
 | |
| 
 | |
| // Determine the width of the character.
 | |
| func width(b byte) int {
 | |
| 	// Don't replace these by a switch without first
 | |
| 	// confirming that it is being inlined.
 | |
| 	if b&0x80 == 0x00 {
 | |
| 		return 1
 | |
| 	}
 | |
| 	if b&0xE0 == 0xC0 {
 | |
| 		return 2
 | |
| 	}
 | |
| 	if b&0xF0 == 0xE0 {
 | |
| 		return 3
 | |
| 	}
 | |
| 	if b&0xF8 == 0xF0 {
 | |
| 		return 4
 | |
| 	}
 | |
| 	return 0
 | |
| 
 | |
| }
 |