| 180 |
} |
} |
| 181 |
|
|
| 182 |
#define CHECK_AND_APPEND_OUTPUT(out_buf, out_buf_len, out_buf_offset, tag_out, tag_out_len, line_width) \ |
#define CHECK_AND_APPEND_OUTPUT(out_buf, out_buf_len, out_buf_offset, tag_out, tag_out_len, line_width) \ |
| 183 |
|
if ((tag_out_len) > 0) \ |
| 184 |
{ \ |
{ \ |
| 185 |
if ((out_buf_offset) + (tag_out_len) >= (out_buf_len)) \ |
if ((out_buf_offset) + (tag_out_len) >= (out_buf_len)) \ |
| 186 |
{ \ |
{ \ |
| 187 |
log_error("Buffer is not longer enough for output string %d >= %d\n", (out_buf_offset) + (tag_out_len), (out_buf_len)); \ |
log_error("Buffer is not longer enough for output string %d >= %d", (out_buf_offset) + (tag_out_len), (out_buf_len)); \ |
| 188 |
out_buf[out_buf_offset] = '\0'; \ |
out_buf[out_buf_offset] = '\0'; \ |
| 189 |
return (out_buf_offset); \ |
return (out_buf_offset); \ |
| 190 |
} \ |
} \ |
| 219 |
|
|
| 220 |
clock_begin = clock(); |
clock_begin = clock(); |
| 221 |
|
|
| 222 |
|
#ifdef _DEBUG |
| 223 |
|
size_t str_in_len = strlen(str_in); |
| 224 |
|
#endif |
| 225 |
|
|
| 226 |
lml_init(); |
lml_init(); |
| 227 |
|
|
| 228 |
lml_tag_disabled = 0; |
lml_tag_disabled = 0; |
| 235 |
|
|
| 236 |
for (i = 0; str_in[i] != '\0'; i++) |
for (i = 0; str_in[i] != '\0'; i++) |
| 237 |
{ |
{ |
| 238 |
|
#ifdef _DEBUG |
| 239 |
|
if (i >= str_in_len) |
| 240 |
|
{ |
| 241 |
|
log_error("Bug: i(%d) >= str_in_len(%d)", i, str_in_len); |
| 242 |
|
break; |
| 243 |
|
} |
| 244 |
|
#endif |
| 245 |
|
|
| 246 |
if (!lml_tag_disabled && new_line) |
if (!lml_tag_disabled && new_line) |
| 247 |
{ |
{ |
| 248 |
while (str_in[i] == ':' && str_in[i + 1] == ' ') // FB2000 quote leading str |
while (str_in[i] == ':' && str_in[i + 1] == ' ') // FB2000 quote leading str |
| 269 |
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, tag_output_buf, tag_output_len, line_width); |
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, tag_output_buf, tag_output_len, line_width); |
| 270 |
|
|
| 271 |
new_line = 0; |
new_line = 0; |
| 272 |
|
i--; // redo at current i |
| 273 |
|
continue; |
| 274 |
} |
} |
| 275 |
|
|
| 276 |
if (lml_tag_disabled && new_line) |
if (lml_tag_disabled && new_line) |
| 280 |
|
|
| 281 |
if (!quote_mode && !lml_tag_disabled && str_in[i] == '\033' && str_in[i + 1] == '[') // Escape sequence |
if (!quote_mode && !lml_tag_disabled && str_in[i] == '\033' && str_in[i + 1] == '[') // Escape sequence |
| 282 |
{ |
{ |
| 283 |
for (k = i + 2; isdigit(str_in[k]) || str_in[k] == ';' || str_in[k] == '?'; k++) |
for (k = i + 2; isdigit((int)str_in[k]) || str_in[k] == ';' || str_in[k] == '?'; k++) |
| 284 |
; |
; |
| 285 |
|
|
| 286 |
if (str_in[k] == 'm') // valid -- copy directly |
if (str_in[k] == 'm') // valid -- copy directly |
| 287 |
{ |
{ |
| 288 |
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, str_in + i, k - i + 1, line_width); |
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, str_in + i, k - i + 1, line_width); |
| 289 |
} |
} |
| 290 |
else if (isalpha(str_in[k])) |
else if (isalpha((int)str_in[k])) |
| 291 |
{ |
{ |
| 292 |
// unsupported ANSI CSI command |
// unsupported ANSI CSI command |
| 293 |
} |
} |
| 446 |
lml_tag_def[k].tag_name, tag_param_buf, tag_output_buf, LML_TAG_OUTPUT_BUF_LEN, 1); |
lml_tag_def[k].tag_name, tag_param_buf, tag_output_buf, LML_TAG_OUTPUT_BUF_LEN, 1); |
| 447 |
} |
} |
| 448 |
} |
} |
| 449 |
|
|
| 450 |
|
if (line_width + tag_output_len > width) |
| 451 |
|
{ |
| 452 |
|
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, "\n", 1, line_width); |
| 453 |
|
new_line = 1; |
| 454 |
|
line_width = 0; |
| 455 |
|
i--; // redo at current i |
| 456 |
|
continue; |
| 457 |
|
} |
| 458 |
|
|
| 459 |
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, tag_output_buf, tag_output_len, line_width); |
CHECK_AND_APPEND_OUTPUT(str_out, buf_len, j, tag_output_buf, tag_output_len, line_width); |
| 460 |
break; |
break; |
| 461 |
default: // tag_name not match |
default: // tag_name not match |