Unified · Split
| @@ -58,7 +58,6 @@ static const int *unget_saved_macro_ptr; · 57 unmodified lines | ||
| 58 | 58 | static int unget_saved_buffer[TOK_MAX_SIZE + 1]; |
| 59 | 59 | static int unget_buffer_enabled; |
| 60 | 60 | static TokenSym *hash_ident[TOK_HASH_SIZE]; |
| 61 | −static char token_buf[STRING_MAX_SIZE + 1]; | |
| 62 | 61 | /* true if isid(c) || isnum(c) */ |
| 63 | 62 | static unsigned char isidnum_table[256-CH_EOF]; |
| 64 | 63 | |
| @@ -1790,29 +1789,6 @@ static void parse_escape_string(CString *outstr, const uint8_t *buf, int is_long · 1725 unmodified lines | ||
| 1790 | 1789 | cstr_wccat(outstr, '\0'); |
| 1791 | 1790 | } |
| 1792 | 1791 | |
| 1793 | −/* we use 64 bit numbers */ | |
| 1794 | −#define BN_SIZE 2 | |
| 1795 | − | |
| 1796 | −/* bn = (bn << shift) | or_val */ | |
| 1797 | −static void bn_lshift(unsigned int *bn, int shift, int or_val) | |
| 1798 | −{ | |
| 1799 | − int i; | |
| 1800 | − unsigned int v; | |
| 1801 | − for(i=0;i<BN_SIZE;i++) { | |
| 1802 | − v = bn[i]; | |
| 1803 | − bn[i] = (v << shift) | or_val; | |
| 1804 | − or_val = v >> (32 - shift); | |
| 1805 | − } | |
| 1806 | −} | |
| 1807 | − | |
| 1808 | −static void bn_zero(unsigned int *bn) | |
| 1809 | −{ | |
| 1810 | − int i; | |
| 1811 | − for(i=0;i<BN_SIZE;i++) { | |
| 1812 | − bn[i] = 0; | |
| 1813 | − } | |
| 1814 | −} | |
| 1815 | − | |
| 1816 | 1792 | /* parse number in null terminated string 'p' and return it in the |
| 1817 | 1793 | current token */ |
| 1818 | 1794 | static void parse_number(const char *p) |