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
|
/* Chrysalide - Outil d'analyse de fichiers binaires
* szstr.h - prototypes pour une manipulation de chaînes issues de Flex/Bison
*
* Copyright (C) 2023 Cyrille Bagard
*
* This file is part of Chrysalide.
*
* Chrysalide 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 3 of the License, or
* (at your option) any later version.
*
* Chrysalide 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 Chrysalide. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _COMMON_SZSTR_H
#define _COMMON_SZSTR_H
#include <string.h>
#include <sys/types.h>
#include "sort.h"
#include "../arch/archbase.h"
/* Structure associant une chaîne et sa taille */
typedef struct _sized_string_t
{
union {
const char *static_data; /* Données non modifiées */
char *data; /* Chaîne de caractères */
};
size_t len; /* Taille correspondante */
} sized_string_t;
typedef sized_string_t sized_binary_t;
#define init_szstr(s) \
do \
{ \
(s)->data = NULL; \
(s)->len = 0; \
} \
while (0)
#define szstrdup(dst, src) \
do \
{ \
(dst)->data = malloc((src)->len); \
memcpy((dst)->data, (src)->data, (src)->len); \
(dst)->len = (src)->len; \
} \
while (0)
#define copy_szstr(d, s) (d) = (s);
#define exit_szstr(s) \
do \
{ \
if ((s)->data != NULL) \
{ \
free((s)->data); \
init_szstr(s); \
} \
} \
while (0)
#define szstrcmp(s1, s2) \
({ \
int __ret; \
size_t __n; \
__n = (s1)->len < (s2)->len ? (s1)->len : (s2)->len; \
__ret = strncmp((s1)->data, (s2)->data, __n); \
if (__ret == 0) \
__ret = sort_unsigned_long_long((s1)->len, (s2)->len); \
__ret; \
})
#define szmemcmp(s1, s2) \
({ \
int __ret; \
size_t __n; \
__n = (s1)->len < (s2)->len ? (s1)->len : (s2)->len; \
__ret = memcmp((s1)->data, (s2)->data, __n); \
if (__ret == 0) \
__ret = sort_unsigned_long_long((s1)->len, (s2)->len); \
__ret; \
})
#endif /* _COMMON_SZSTR_H */
|
