| 1 |
/***************************************************************************
|
| 2 |
str_process.c - description
|
| 3 |
-------------------
|
| 4 |
Copyright : (C) 2004-2025 by Leaflet
|
| 5 |
Email : leaflet@leafok.com
|
| 6 |
***************************************************************************/
|
| 7 |
|
| 8 |
/***************************************************************************
|
| 9 |
* *
|
| 10 |
* This program is free software; you can redistribute it and/or modify *
|
| 11 |
* it under the terms of the GNU General Public License as published by *
|
| 12 |
* the Free Software Foundation; either version 2 of the License, or *
|
| 13 |
* (at your option) any later version. *
|
| 14 |
* *
|
| 15 |
***************************************************************************/
|
| 16 |
|
| 17 |
#include "str_process.h"
|
| 18 |
#include "common.h"
|
| 19 |
#include "log.h"
|
| 20 |
#include <stdio.h>
|
| 21 |
#include <string.h>
|
| 22 |
|
| 23 |
int split_line(const char *buffer, int max_len, int *p_eol)
|
| 24 |
{
|
| 25 |
int len = strnlen(buffer, LINE_BUFFER_LEN);
|
| 26 |
int display_len = 0;
|
| 27 |
int i = 0;
|
| 28 |
*p_eol = 0;
|
| 29 |
|
| 30 |
if (len == 0)
|
| 31 |
{
|
| 32 |
return 0;
|
| 33 |
}
|
| 34 |
|
| 35 |
for (; i < len; i++)
|
| 36 |
{
|
| 37 |
char c = buffer[i];
|
| 38 |
|
| 39 |
if (c == '\r' || c == '\7') // skip
|
| 40 |
{
|
| 41 |
continue;
|
| 42 |
}
|
| 43 |
|
| 44 |
if (c == '\n')
|
| 45 |
{
|
| 46 |
i++;
|
| 47 |
*p_eol = 1;
|
| 48 |
break;
|
| 49 |
}
|
| 50 |
|
| 51 |
if (c == '\033' && buffer[i + 1] == '[') // Skip control sequence
|
| 52 |
{
|
| 53 |
i += 2;
|
| 54 |
while(i < len && buffer[i] != 'm')
|
| 55 |
{
|
| 56 |
i++;
|
| 57 |
}
|
| 58 |
continue;
|
| 59 |
}
|
| 60 |
|
| 61 |
if (c > 127 && c <= 255) // GBK chinese character
|
| 62 |
{
|
| 63 |
if (display_len + 2 > max_len)
|
| 64 |
{
|
| 65 |
*p_eol = 1;
|
| 66 |
break;
|
| 67 |
}
|
| 68 |
i++;
|
| 69 |
display_len += 2;
|
| 70 |
}
|
| 71 |
else
|
| 72 |
{
|
| 73 |
if (display_len >= max_len)
|
| 74 |
{
|
| 75 |
*p_eol = 1;
|
| 76 |
break;
|
| 77 |
}
|
| 78 |
display_len++;
|
| 79 |
}
|
| 80 |
}
|
| 81 |
|
| 82 |
return i;
|
| 83 |
}
|
| 84 |
|
| 85 |
int split_file_lines(FILE *fin, int max_len, long *p_line_offsets, int max_line_cnt)
|
| 86 |
{
|
| 87 |
char buffer[LINE_BUFFER_LEN];
|
| 88 |
char *p_buf = buffer;
|
| 89 |
int line_cnt = 0;
|
| 90 |
int len = 0;
|
| 91 |
int end_of_line = 0;
|
| 92 |
p_line_offsets[line_cnt] = 0L;
|
| 93 |
|
| 94 |
while (fgets(p_buf, sizeof(buffer) - len, fin))
|
| 95 |
{
|
| 96 |
p_buf = buffer;
|
| 97 |
while (1)
|
| 98 |
{
|
| 99 |
len = split_line(p_buf, max_len, &end_of_line);
|
| 100 |
|
| 101 |
if (len == 0 || !end_of_line)
|
| 102 |
{
|
| 103 |
break;
|
| 104 |
}
|
| 105 |
|
| 106 |
// Exceed max_line_cnt
|
| 107 |
if (line_cnt + 1 >= max_line_cnt)
|
| 108 |
{
|
| 109 |
log_error("File line count %d reaches limit\n", line_cnt + 1);
|
| 110 |
return line_cnt;
|
| 111 |
}
|
| 112 |
|
| 113 |
p_line_offsets[line_cnt + 1] = p_line_offsets[line_cnt] + len;
|
| 114 |
line_cnt++;
|
| 115 |
p_buf += len;
|
| 116 |
}
|
| 117 |
|
| 118 |
// Move p_buf[0 .. len - 1] to head of buffer
|
| 119 |
for (int i = 0; i < len; i++)
|
| 120 |
{
|
| 121 |
buffer[i] = p_buf[i];
|
| 122 |
}
|
| 123 |
p_buf = buffer + len;
|
| 124 |
}
|
| 125 |
|
| 126 |
if (len > 0 && line_cnt + 1 < max_line_cnt)
|
| 127 |
{
|
| 128 |
p_line_offsets[line_cnt + 1] = p_line_offsets[line_cnt] + len;
|
| 129 |
line_cnt++;
|
| 130 |
}
|
| 131 |
|
| 132 |
return line_cnt;
|
| 133 |
}
|
Parent Directory
| 
Revision Log