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 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
|
/* ====================================================================
* The Kannel Software License, Version 1.0
*
* Copyright (c) 2001-2018 Kannel Group
* Copyright (c) 1998-2001 WapIT Ltd.
* All rights reserved.
*
* 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. The end-user documentation included with the redistribution,
* if any, must include the following acknowledgment:
* "This product includes software developed by the
* Kannel Group (http://www.kannel.org/)."
* Alternately, this acknowledgment may appear in the software itself,
* if and wherever such third-party acknowledgments normally appear.
*
* 4. The names "Kannel" and "Kannel Group" must not be used to
* endorse or promote products derived from this software without
* prior written permission. For written permission, please
* contact org@kannel.org.
*
* 5. Products derived from this software may not be called "Kannel",
* nor may "Kannel" appear in their name, without prior written
* permission of the Kannel Group.
*
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED 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 KANNEL GROUP OR ITS 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.
* ====================================================================
*
* This software consists of voluntary contributions made by many
* individuals on behalf of the Kannel Group. For more information on
* the Kannel Group, please see <http://www.kannel.org/>.
*
* Portions of this software are based upon software originally written at
* WapIT Ltd., Helsinki, Finland for the Kannel project.
*/
/*
* parse.c - implement parse.h interface
*
* Richard Braakman
*/
#include "gwlib/gwlib.h"
struct context
{
Octstr *data;
long pos;
long limit;
List *limit_stack;
int error;
};
ParseContext *parse_context_create(Octstr *str)
{
ParseContext *result;
result = gw_malloc(sizeof(*result));
result->data = str;
result->pos = 0;
result->limit = octstr_len(str);
result->limit_stack = NULL;
result->error = 0;
return result;
}
void parse_context_destroy(ParseContext *context)
{
gw_assert(context != NULL);
if (context->limit_stack) {
while (gwlist_len(context->limit_stack) > 0)
gw_free(gwlist_extract_first(context->limit_stack));
gwlist_destroy(context->limit_stack, NULL);
}
gw_free(context);
}
int parse_error(ParseContext *context)
{
gw_assert(context != NULL);
return context->error;
}
void parse_clear_error(ParseContext *context)
{
gw_assert(context != NULL);
context->error = 0;
}
void parse_set_error(ParseContext *context)
{
gw_assert(context != NULL);
context->error = 1;
}
int parse_limit(ParseContext *context, long length)
{
long *elem;
gw_assert(context != NULL);
if (context->pos + length > context->limit) {
context->error = 1;
return -1;
}
if (context->limit_stack == NULL)
context->limit_stack = gwlist_create();
elem = gw_malloc(sizeof(*elem));
*elem = context->limit;
gwlist_insert(context->limit_stack, 0, elem);
context->limit = context->pos + length;
return 0;
}
int parse_pop_limit(ParseContext *context)
{
long *elem;
gw_assert(context != NULL);
if (context->limit_stack == NULL || gwlist_len(context->limit_stack) == 0) {
context->error = 1;
return -1;
}
elem = gwlist_extract_first(context->limit_stack);
context->limit = *elem;
gw_free(elem);
return 0;
}
long parse_octets_left(ParseContext *context)
{
gw_assert(context != NULL);
return context->limit - context->pos;
}
int parse_skip(ParseContext *context, long count)
{
gw_assert(context != NULL);
if (context->pos + count > context->limit) {
context->pos = context->limit;
context->error = 1;
return -1;
}
context->pos += count;
return 0;
}
void parse_skip_to_limit(ParseContext *context)
{
gw_assert(context != NULL);
context->pos = context->limit;
}
int parse_skip_to(ParseContext *context, long pos)
{
gw_assert(context != NULL);
if (pos < 0) {
context->error = 1;
return -1;
}
if (pos > context->limit) {
context->pos = context->limit;
context->error = 1;
return -1;
}
context->pos = pos;
return 0;
}
int parse_peek_char(ParseContext *context)
{
gw_assert(context != NULL);
if (context->pos == context->limit) {
context->error = 1;
return -1;
}
return octstr_get_char(context->data, context->pos);
}
int parse_get_char(ParseContext *context)
{
gw_assert(context != NULL);
if (context->pos == context->limit) {
context->error = 1;
return -1;
}
return octstr_get_char(context->data, context->pos++);
}
Octstr *parse_get_octets(ParseContext *context, long length)
{
Octstr *result;
gw_assert(context != NULL);
if (context->pos + length > context->limit) {
context->error = 1;
return NULL;
}
result = octstr_copy(context->data, context->pos, length);
context->pos += length;
return result;
}
unsigned long parse_get_uintvar(ParseContext *context)
{
long pos;
unsigned long value;
gw_assert(context != NULL);
pos = octstr_extract_uintvar(context->data, &value, context->pos);
if (pos < 0 || pos > context->limit) {
context->error = 1;
return 0;
}
context->pos = pos;
return value;
}
Octstr *parse_get_nul_string(ParseContext *context)
{
Octstr *result;
long pos;
gw_assert(context != NULL);
pos = octstr_search_char(context->data, 0, context->pos);
if (pos < 0 || pos >= context->limit) {
context->error = 1;
return NULL;
}
result = octstr_copy(context->data, context->pos, pos - context->pos);
context->pos = pos + 1;
return result;
}
Octstr *parse_get_line(ParseContext *context)
{
Octstr *result;
long pos;
gw_assert(context != NULL);
pos = octstr_search_char(context->data, '\n', context->pos);
if (pos < 0 || pos >= context->limit) {
context->error = 1;
return NULL;
}
result = octstr_copy(context->data, context->pos, pos - context->pos);
context->pos = pos + 1;
octstr_strip_crlfs(result);
return result;
}
Octstr *parse_get_seperated_block(ParseContext *context, Octstr *seperator)
{
Octstr *result;
long spos, epos;
gw_assert(context != NULL);
gw_assert(seperator != NULL);
spos = octstr_search(context->data, seperator, context->pos);
if (spos < 0 || spos >= context->limit) {
context->error = 1;
return NULL;
}
epos = octstr_search(context->data, seperator, spos + octstr_len(seperator));
if (epos < 0 || epos >= context->limit) {
context->error = 1;
return NULL;
}
spos = spos + octstr_len(seperator);
result = octstr_copy(context->data, spos, epos - spos);
context->pos = epos;
return result;
}
Octstr *parse_get_rest(ParseContext *context)
{
Octstr *rest;
gw_assert(context != NULL);
octstr_delete(context->data, 0, context->pos);
rest = octstr_duplicate(context->data);
return rest;
}
|