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
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
|
/*
* LDAP Utilities
* Copyright (C) 2012, 2019 David M. Syzdek <david@syzdek.net>.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* 3. Neither the name of the copyright holder nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
* LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
* NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* @file src/ldapschema/lerror.c contains error functions and variables
*/
#define _LIB_LIBLDAPSCHEMA_LERROR_C 1
#include "lerror.h"
///////////////
// //
// Headers //
// //
///////////////
#pragma mark - Headers
#include <errno.h>
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <strings.h>
#include <stdlib.h>
#include "llexer.h"
//////////////
// //
// Macros //
// //
//////////////
#pragma mark - Macros
#define IS_SPACE( c ) ( (c == ' ') || (c == '\t') || (c == '\n') )
#define IS_UPPER( c ) ( (c >= 'A') && (c <= 'Z') )
#define IS_LOWER( c ) ( (c >= 'a') && (c <= 'z') )
#define IS_DIGIT( c ) ( (c >= '0') && (c <= '9') )
#define IS_KEYWORD( c ) ( IS_UPPER(c) || (c == '-') )
#define IS_STRNG( c ) ( IS_UPPER(c) || IS_LOWER(c) || IS_DIGIT(c) || (c=='_') || (c=='.') || (c=='{') || (c=='}') || (c == '-') )
//////////////////
// //
// Prototypes //
// //
//////////////////
#pragma mark - Prototypes
/////////////////
// //
// Functions //
// //
/////////////////
#pragma mark - Functions
/// initializes LDAP schema
/// @param[out] str Numeric error code
/// @param[in] size Numeric error code
/// @param[in] def Numeric error code
///
/// @return Returns a string representation of the error code.
/// @see ldapschema_free, ldapschema_initialize, ldapschema_errno
#define APPEND( c ) { last = c; if (strpos<size) str[strpos] = last; strpos++; }
#define INDENT() { if ((!IS_SPACE(last))&&((strpos))) { APPEND('\n'); for(x=0; (x<(indent*3));x++) APPEND(' '); bol=strpos; }; }
int ldapschema_fmt_definition( char * restrict str, size_t size, const char * restrict def, size_t width )
{
size_t defpos;
size_t strpos;
size_t tmppos;
size_t bol;
size_t deflen;
size_t indent;
size_t x;
char last;
assert(def != NULL);
// strips leading white space
for (defpos = 0; ((def[defpos] != '\0') && ((def[defpos] == ' ') || (def[defpos] == '\t'))); defpos++);
if (!(str))
size = 0;
deflen = strlen(def);
strpos = 0;
bol = 0;
last = 0;
// copies formatted definition
for(indent = 0; (defpos < deflen); defpos++)
{
switch(def[defpos])
{
// process start of groupings
case '(':
INDENT( );
indent++;
APPEND( '(' );
APPEND( ' ' );
break;
// process end of groupings
case ')':
indent--;
INDENT( );
APPEND( ')' );
break;
// process quoted strings
case '\'':
APPEND( ' ' );
APPEND( def[defpos++] );
while ((def[defpos] != '\'') && ((defpos+1) < deflen)) // find closing quote
{
APPEND( def[defpos++] );
};
APPEND( def[defpos] );
break;
// process whitespace
case ' ':
case '\t':
case '\n':
break;
default:
for(tmppos = defpos; IS_KEYWORD( def[tmppos] ); tmppos++);
if ( (tmppos != defpos) && (IS_SPACE(def[tmppos]) || (def[tmppos] == '\0')) )
{
// styling for upper case keywords
INDENT( );
} else if (def[defpos] == '$')
{
// styling for delimiters
APPEND( ' ' );
} else
{
// styling for unquoted strings
if ((strpos - bol) < width)
{
APPEND( ' ' );
} else
{
INDENT( );
};
};
for(; (IS_STRNG(def[defpos+1])); defpos++)
APPEND( def[defpos] );
APPEND( def[defpos] );
break;
};
};
// terminate string
if ((str))
{
if (strpos < size)
str[strpos] = '\0';
else
str[size-1] = '\0';
};
return((int)(strpos));
}
#undef APPEND
#undef INDENT
/* end of source file */
|
