1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296
|
"""
Character categories and charsets.
"""
import sys
from rpython.rlib.rlocale import tolower, toupper, isalnum
from rpython.rlib.unroll import unrolling_iterable
from rpython.rlib import jit
from rpython.rlib.rarithmetic import int_between
# Note: the unicode parts of this module require you to call
# rsre_char.set_unicode_db() first, to select one of the modules
# pypy.module.unicodedata.unicodedb_x_y_z. This allows PyPy to use sre
# with the same version of the unicodedb as it uses for
# unicodeobject.py. If unset, the RPython program cannot use unicode
# matching.
unicodedb = None # possibly patched by set_unicode_db()
def set_unicode_db(newunicodedb):
global unicodedb
unicodedb = newunicodedb
#### Constants
if sys.maxint > 2**32:
MAXREPEAT = int(2**32 - 1)
MAXGROUPS = int(2**31 - 1)
else:
MAXREPEAT = int(2**31 - 1)
MAXGROUPS = int((2**31 / sys.maxint / 2) - 1)
# In _sre.c this is bytesize of the code word type of the C implementation.
# There it's 2 for normal Python builds and more for wide unicode builds (large
# enough to hold a 32-bit UCS-4 encoded character). Since here in pure Python
# we only see re bytecodes as Python longs, we shouldn't have to care about the
# codesize. But sre_compile will compile some stuff differently depending on the
# codesize (e.g., charsets).
from rpython.rlib.runicode import MAXUNICODE
if MAXUNICODE == 65535:
CODESIZE = 2
else:
CODESIZE = 4
copyright = "_sre.py 2.4 Copyright 2005 by Nik Haldimann"
BIG_ENDIAN = sys.byteorder == "big"
# XXX can we import those safely from sre_constants?
SRE_INFO_PREFIX = 1
SRE_INFO_LITERAL = 2
SRE_INFO_CHARSET = 4
SRE_FLAG_LOCALE = 4 # honour system locale
SRE_FLAG_UNICODE = 32 # use unicode locale
def getlower(char_ord, flags):
if flags & SRE_FLAG_LOCALE:
if char_ord < 256: # cheating! Well, CPython does too.
char_ord = tolower(char_ord)
return char_ord
elif flags & SRE_FLAG_UNICODE:
assert unicodedb is not None
char_ord = unicodedb.tolower(char_ord)
else:
if int_between(ord('A'), char_ord, ord('Z') + 1): # ASCII lower
char_ord += ord('a') - ord('A')
return char_ord
def getupper(char_ord, flags):
if flags & SRE_FLAG_LOCALE:
if char_ord < 256: # cheating! Well, CPython does too.
char_ord = toupper(char_ord)
return char_ord
elif flags & SRE_FLAG_UNICODE:
assert unicodedb is not None
char_ord = unicodedb.toupper(char_ord)
else:
if int_between(ord('a'), char_ord, ord('z') + 1): # ASCII upper
char_ord += ord('A') - ord('a')
return char_ord
#### Category helpers
is_a_word = [(chr(i).isalnum() or chr(i) == '_') for i in range(256)]
linebreak = ord("\n")
underline = ord("_")
def is_digit(code):
return int_between(48, code, 58)
def is_uni_digit(code):
assert unicodedb is not None
return unicodedb.isdecimal(code)
def is_space(code):
return (code == 32) | int_between(9, code, 14)
def is_uni_space(code):
assert unicodedb is not None
return unicodedb.isspace(code)
def is_word(code):
assert code >= 0
return code < 256 and is_a_word[code]
def is_uni_word(code):
assert unicodedb is not None
return unicodedb.isalnum(code) or code == underline
def is_loc_alnum(code):
return code < 256 and isalnum(code)
def is_loc_word(code):
return code == underline or is_loc_alnum(code)
def is_linebreak(code):
return code == linebreak
def is_uni_linebreak(code):
assert unicodedb is not None
return unicodedb.islinebreak(code)
#### Category dispatch
def category_dispatch(category_code, char_code):
i = 0
for function, negate in category_dispatch_unroll:
if category_code == i:
result = function(char_code)
if negate:
return not result # XXX this might lead to a guard
else:
return result
i = i + 1
else:
return False
# Maps opcodes by indices to (function, negate) tuples.
category_dispatch_table = [
(is_digit, False), (is_digit, True), (is_space, False),
(is_space, True), (is_word, False), (is_word, True),
(is_linebreak, False), (is_linebreak, True), (is_loc_word, False),
(is_loc_word, True), (is_uni_digit, False), (is_uni_digit, True),
(is_uni_space, False), (is_uni_space, True), (is_uni_word, False),
(is_uni_word, True), (is_uni_linebreak, False),
(is_uni_linebreak, True)
]
category_dispatch_unroll = unrolling_iterable(category_dispatch_table)
##### Charset evaluation
@jit.unroll_safe
def check_charset(ctx, ppos, char_code):
"""Checks whether a character matches set of arbitrary length.
The set starts at pattern[ppos]."""
negated = False
result = False
pattern = ctx.pattern
while True:
opcode = pattern[ppos]
for i, function in set_dispatch_unroll:
if opcode == i:
newresult, ppos = function(ctx, ppos, char_code)
result |= newresult
break
else:
if opcode == 0: # FAILURE
break
elif opcode == 26: # NEGATE
negated ^= True
ppos += 1
else:
return False
if negated:
return not result
return result
def set_literal(ctx, index, char_code):
# <LITERAL> <code>
pat = ctx.pattern
match = pat[index+1] == char_code
return match, index + 2
def set_category(ctx, index, char_code):
# <CATEGORY> <code>
pat = ctx.pattern
match = category_dispatch(pat[index+1], char_code)
return match, index + 2
def set_charset(ctx, index, char_code):
# <CHARSET> <bitmap> (16 bits per code word)
pat = ctx.pattern
if CODESIZE == 2:
match = char_code < 256 and \
(pat[index+1+(char_code >> 4)] & (1 << (char_code & 15)))
return match, index + 17 # skip bitmap
else:
match = char_code < 256 and \
(pat[index+1+(char_code >> 5)] & (1 << (char_code & 31)))
return match, index + 9 # skip bitmap
def set_range(ctx, index, char_code):
# <RANGE> <lower> <upper>
pat = ctx.pattern
match = int_between(pat[index+1], char_code, pat[index+2] + 1)
return match, index + 3
def set_range_ignore(ctx, index, char_code):
# <RANGE_IGNORE> <lower> <upper>
# the char_code is already lower cased
pat = ctx.pattern
lower = pat[index + 1]
upper = pat[index + 2]
match1 = int_between(lower, char_code, upper + 1)
match2 = int_between(lower, getupper(char_code, ctx.flags), upper + 1)
return match1 | match2, index + 3
def set_bigcharset(ctx, index, char_code):
# <BIGCHARSET> <blockcount> <256 blockindices> <blocks>
pat = ctx.pattern
count = pat[index+1]
index += 2
if CODESIZE == 2:
# One bytecode is 2 bytes, so contains 2 of the blockindices.
# So the 256 blockindices are packed in 128 bytecodes, but
# we need to unpack it as a byte.
assert char_code < 65536
shift = 4
else:
# One bytecode is 4 bytes, so contains 4 of the blockindices.
# So the 256 blockindices are packed in 64 bytecodes, but
# we need to unpack it as a byte.
if char_code >= 65536:
index += 256 / CODESIZE + count * (32 / CODESIZE)
return False, index
shift = 5
block = pat[index + (char_code >> (shift + 5))]
block_shift = char_code >> 5
if BIG_ENDIAN:
block_shift = ~block_shift
block_shift &= (CODESIZE - 1) * 8
block = (block >> block_shift) & 0xFF
index += 256 / CODESIZE
block_value = pat[index+(block * (32 / CODESIZE)
+ ((char_code & 255) >> shift))]
match = (block_value & (1 << (char_code & ((8 * CODESIZE) - 1))))
index += count * (32 / CODESIZE) # skip blocks
return match, index
def set_unicode_general_category(ctx, index, char_code):
# Unicode "General category property code" (not used by Python).
# A general category is two letters. 'pat[index+1]' contains both
# the first character, and the second character shifted by 8.
# http://en.wikipedia.org/wiki/Unicode_character_property#General_Category
# Also supports single-character categories, if the second character is 0.
# Negative matches are triggered by bit number 7.
assert unicodedb is not None
cat = unicodedb.category(char_code)
pat = ctx.pattern
category_code = pat[index + 1]
first_character = category_code & 0x7F
second_character = (category_code >> 8) & 0x7F
negative_match = category_code & 0x80
#
if second_character == 0:
# single-character match
check = ord(cat[0])
expected = first_character
else:
# two-characters match
check = ord(cat[0]) | (ord(cat[1]) << 8)
expected = first_character | (second_character << 8)
#
if negative_match:
result = check != expected
else:
result = check == expected
#
return result, index + 2
set_dispatch_table = {
9: set_category,
10: set_charset,
11: set_bigcharset,
19: set_literal,
27: set_range,
32: set_range_ignore,
70: set_unicode_general_category,
}
set_dispatch_unroll = unrolling_iterable(sorted(set_dispatch_table.items()))
|