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
|
/* vi: set sw=4 ts=4: */
/*
* Utility routines.
*
* Copyright (C) Manuel Novoa III <mjn3@codepoet.org>
* and Vladimir Oleynik <dzo@simtreas.ru>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
*
*/
#include <stdio.h>
#include <limits.h>
#include "libbb.h"
char bb_process_escape_sequence(const char **ptr)
{
static const char charmap[] = {
'a', 'b', 'f', 'n', 'r', 't', 'v', '\\', 0,
'\a', '\b', '\f', '\n', '\r', '\t', '\v', '\\', '\\' };
const char *p;
const char *q;
unsigned int num_digits;
unsigned int r;
unsigned int n;
n = 0;
q = *ptr;
num_digits = 0;
do {
if (((unsigned int)(*q - '0')) <= 7) {
r = n * 8 + (*q - '0');
if (r <= UCHAR_MAX) {
n = r;
++q;
if (++num_digits < 3) {
continue;
}
}
}
break;
} while (1);
if (num_digits == 0) { /* mnemonic escape sequence? */
p = charmap;
do {
if (*p == *q) {
q++;
break;
}
} while (*++p);
n = *(p+(sizeof(charmap)/2));
}
*ptr = q;
return (char) n;
}
/* END CODE */
/*
Local Variables:
c-file-style: "linux"
c-basic-offset: 4
tab-width: 4
End:
*/
|
