-
Notifications
You must be signed in to change notification settings - Fork 0
/
InputParser_C.c
815 lines (648 loc) · 25 KB
/
InputParser_C.c
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
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
#include "InputParser_C.h"
#include <math.h>
/* InputParser..
A small generic library for parsing a string and tokenizing it!
GITHUB Repo : http://github.com/AmmarkoV/InputParser
my URLs: http://ammar.gr
Written by Ammar Qammaz a.k.a. AmmarkoV 2006-2010
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 3 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, see <http://www.gnu.org/licenses/>.
*/
#define WARN_ABOUT_INCORRECTLY_ALLOCATED_STACK_STRINGS 1
int warningsAboutIncorrectlyAllocatedStackIssued = 0;
char _ipc_ver[]=" 0.361\0"; //2/10/2018
/*
TODO
void stringToFloatArray(char * str , char delimiter , float * floatArr , int elements)
{
unsigned int strLength = strlen(str);
char * strPtr=str;
char * strStart=str;
char * strEnd=str+strLength;
int curElement = 0;
while ( (curElement<elements) && (strPtr<strEnd) )
{
while ( (strPtr<strEnd) && (*strPtr!=delimiter) )
{
++strPtr; //Seeking next delimiter
}
if (*strPtr==delimiter)
{
*strPtr=0; //Null terminate
floatArr[curElement]=atof(strStart);
++curElement;
*strPtr=delimiter;
strStart=strPtr+1;
}
}
}
*/
char * InputParserC_Version()
{
return (char *) _ipc_ver;
}
int InputParser_ClearNonCharacters(char * inpt , unsigned int length)
{
unsigned int skip_chars=0;
unsigned int i=0;
while (i<length)
{
if (inpt[i]<' ') /*The characters before space should be filtered*/
{
++skip_chars;
}
if (skip_chars>0)
{
if (i+skip_chars>=length)
{
inpt[i]=0;
} else
{
inpt[i]=inpt[i+skip_chars];
}
}
++i;
}
return 1;
}
int InputParser_TrimCharactersStart(char * inpt , unsigned int length,char what2trim)
{
if ( ( inpt==0 ) || (length==0) ) { return 0; }
unsigned int skip_chars=0;
unsigned int i=0;
while ((skip_chars<length)&&(inpt[skip_chars]==what2trim)) { ++skip_chars; }
while (i<length)
{
if (skip_chars>0)
{
if (i+skip_chars>=length)
{
inpt[i]=0;
} else
{
inpt[i]=inpt[i+skip_chars];
}
}
++i;
}
return 1;
}
int InputParser_TrimCharactersEnd(char * inpt , unsigned int length,char what2trim)
{
if ( strlen(inpt)!=length ) { length=strlen(inpt); }
if ( length==0 ) { return 1;}
if ( (length==1) && (inpt[0]==what2trim) ) { inpt[0]=0; return 1; } else
if ( length==1 ) { return 1; }
unsigned int i;
i=length-1;
while ((inpt[i]==what2trim)&&(i>0)) { --i; }
if ( i==length-1 ) { /*No chars found*/ return 1; }
if ((i==0) && (inpt[0]==what2trim) ) { inpt[0]=0; } else
{
inpt[i+1]=0;
}
return 1;
}
int InputParser_TrimCharacters(char * inpt , unsigned int length,char what2trim)
{
int i=0;
i=InputParser_TrimCharactersStart(inpt,length,what2trim);
if (i==0) { return 0; }
return InputParser_TrimCharactersEnd(inpt,length,what2trim);
}
static inline signed int Str2Int_internal(char * inpt,unsigned int start_from,unsigned int length)
{
if ( inpt == 0 ) { fprintf(stderr,"Null string to Str2IntInternal!\n"); return 0;}
int intresult;
int multiplier;
int curnum;
unsigned char trailing_sign_seek;
unsigned char positive_number;
signed int i;
intresult=0,multiplier=1,curnum=0;
trailing_sign_seek=1 , positive_number=1;
/*fprintf(stderr,"Converting to int string (%p) begining from %u and ending at %u ",inpt,start_from,start_from+length);*/
for (i=(signed int) start_from+length-1; i>=(signed int) start_from; i--)
{
if ( i < 0 ) { /*fprintf("Gone negative! %u \n",i);*/ break; }
curnum=(char) (inpt[i])-'0';
if ((curnum>=0)&(curnum<=9))
{
intresult=intresult+(multiplier*curnum);
multiplier=multiplier*10;
}
if (trailing_sign_seek)
{
/*fprintf(stderr,"Run to %c while searching for sign \n",inpt[i]);*/
if (inpt[i]=='+') { trailing_sign_seek=0; } else
if (inpt[i]=='-') { trailing_sign_seek=0; positive_number=0; }
}
}
if (!positive_number) { intresult = intresult * (-1); }
return intresult;
}
static inline unsigned char CheckIPCOk(struct InputParserC * ipc)
{
/*
if ( ipc->guardbyte1.checksum != ipc->guardbyte2.checksum ) { fprintf(stderr,"Input Parser - Wrong GuardChecksums #1\n"); return 0; }
if ( ipc->guardbyte3.checksum != ipc->guardbyte4.checksum ) { fprintf(stderr,"Input Parser - Wrong GuardChecksums #2\n"); return 0; }
if ( ipc->guardbyte1.checksum != ipc->guardbyte4.checksum ) { fprintf(stderr,"Input Parser - Wrong GuardChecksums #3\n"); return 0; }
if ( (ipc->tokenlist==0) || (ipc->tokens_max<ipc->tokens_count) ) { fprintf(stderr,"Input Parser - Tokenlist error\n"); return 0; }
if ( (ipc->delimeters==0) || (ipc->max_delimeter_count<ipc->cur_delimeter_count) ) { fprintf(stderr,"Input Parser - Delimeter error\n"); return 0; }
*/
if (
(ipc->guardbyte1.checksum==ipc->guardbyte2.checksum) &&
(ipc->guardbyte3.checksum==ipc->guardbyte4.checksum) &&
(ipc->guardbyte1.checksum==ipc->guardbyte4.checksum)
)
{
if ( (ipc->tokenlist!=0) && (ipc->tokens_max>=ipc->tokens_count) )
{
if ( (ipc->delimeters!=0) && (ipc->max_delimeter_count>=ipc->cur_delimeter_count) )
{
return 1;
} else
{ fprintf(stderr,"Input Parser - Delimeter error\n"); }
} else
{ fprintf(stderr,"Input Parser - Tokenlist error\n"); }
} else
{ fprintf(stderr,"Input Parser - Wrong GuardChecksums\n"); }
return 0;
}
void InputParser_DefaultDelimeters(struct InputParserC * ipc)
{
if ( CheckIPCOk(ipc) == 0 ) { return; }
if ( ipc->delimeters == 0 ) { return; }
int i;
/*fprintf(stderr,"Default Delimters ( %u ) ",ipc->max_delimeter_count);*/
for ( i=0; i<ipc->max_delimeter_count; i++)
{
switch (i)
{
case 0 : ipc->delimeters[0]='\n'; break;
case 1 : ipc->delimeters[1]=','; break;
case 2 : ipc->delimeters[2]='='; break;
case 3 : ipc->delimeters[3]='('; break;
case 4 : ipc->delimeters[4]=')'; break;
default : ipc->delimeters[i]='\n'; break;
};
/*fprintf(stderr," %u - %c ",i,ipc->delimeters[i]);*/
}
ipc->cur_delimeter_count = ipc->max_delimeter_count;
/*fprintf(stderr,"\n");*/
return;
}
/*
InitInputParser..
Allocates an ipc structure and with memory to it according to options for future use!
for example InitInputParser( 256 , 5 ) will allocate an InputParser Instance capeable of tokenizing up to 256 different words
from 5 delimeters
*/
struct InputParserC * InputParser_Create(unsigned int max_string_count,unsigned int max_delimiter_count)
{
struct InputParserC * ipc=0;
ipc = ( struct InputParserC * ) malloc ( sizeof ( struct InputParserC ) );
if ( ipc == 0 ) { fprintf(stderr,"InputParserC unable to commit memory for a new instance\n"); return 0; }
ipc->tokenlist = (struct tokens *) malloc( sizeof(struct tokens) * (max_string_count+1) );
if ( ipc->tokenlist == 0 ) { fprintf(stderr,"InputParserC unable to commit memory for a new Token List\n"); free(ipc); return 0; }
ipc->tokens_count=0;
ipc->tokens_max = max_string_count;
ipc->delimeters = (char *) malloc( sizeof(char) * (max_delimiter_count+1) );
if ( ipc->delimeters == 0 ) { fprintf(stderr,"InputParserC unable to commit memory for a new Delimeter List\n"); free(ipc->tokenlist); free(ipc); return 0; }
ipc->max_delimeter_count=max_delimiter_count;
ipc->cur_delimeter_count=max_delimiter_count;
ipc->container_start=0;
ipc->container_end=0;
ipc->guardbyte1.checksum=66666;
ipc->guardbyte2.checksum=66666;
ipc->guardbyte3.checksum=66666;
ipc->guardbyte4.checksum=66666;
ipc->local_allocation = 0; /* No allocation by default! :)*/
ipc->str_length=0;
ipc->str=0;
InputParser_DefaultDelimeters(ipc);
return ipc;
}
/*
InputParser_Destroy..
Safely destroys a non null ipc structure and deallocates all commited memory
*/
void InputParser_Destroy(struct InputParserC * ipc)
{
if ( ipc == 0 ) { return; }
/*fprintf(stderr,"InputParserC freeing delimeters\n");*/
if ( ipc->delimeters != 0 )
{
free(ipc->delimeters);
ipc->delimeters=0;
}
ipc->cur_delimeter_count=0;
ipc->max_delimeter_count=0;
/*
if ( ipc->container_start != 0 )
{
free(ipc->container_start);
ipc->container_start=0;
}
if ( ipc->container_end != 0 )
{
free(ipc->container_end);
ipc->container_end=0;
}
*/
ipc->cur_container_count = 0;
ipc->max_container_count = 0;
/*fprintf(stderr,"InputParserC freeing tokenlist\n");*/
if ( ipc->tokenlist != 0 )
{
free(ipc->tokenlist);
ipc->tokenlist=0;
}
ipc->tokens_max=0;
ipc->tokens_count=0;
/*fprintf(stderr,"InputParserC freeing local allocation\n");*/
if ( ipc->local_allocation == 1 ) { if ( ipc->str!=0 ) free(ipc->str); }
/*ipc->local_allocation=0;*/
ipc->str_length=0;
/* RESULT */
ipc->guardbyte1.checksum = 0;
ipc->guardbyte2.checksum = 0;
ipc->guardbyte3.checksum = 0;
ipc->guardbyte4.checksum = 0;
/*fprintf(stderr,"InputParserC freeing ipc\n");*/
free(ipc);
}
/* ........................................................
Delimeters ........................................................
........................................................*/
/*
CheckDelimeterNumOk..
Checks if delimeter with number num has allocated space in memory
*/
static inline unsigned char CheckDelimeterNumOk(struct InputParserC * ipc,int num)
{
if ( ipc->max_delimeter_count <= num ) return 0;
return 1;
}
/*
SetDelimeter..
Sets Delimeter number num with value tmp
*/
void InputParser_SetDelimeter(struct InputParserC * ipc,int num,char tmp)
{
if (CheckDelimeterNumOk(ipc,num)==0) { return;}
ipc->delimeters[num]=tmp;
}
/*
GetDelimeter..
Returns value of Delimeter with number num
*/
char InputParser_GetDelimeter(struct InputParserC * ipc,int num)
{
if (CheckDelimeterNumOk(ipc,num)==0) { return 0;}
return ipc->delimeters[num];
}
/* .......................................................................
.......................................................................
.......................................................................*/
/*
Selfchecks IPC instance and returns 1 if everything is ok , 0 if error..
*/
unsigned char InputParser_SelfCheck(struct InputParserC * ipc)
{
if (CheckIPCOk(ipc)==0) { fprintf(stderr,"\n\n!!!!\nThis instance of InputParser is broken\n!!!!\n\n");
return 0; }
return 1;
}
/*
CheckWordNumOk..
Checks if word with number num has allocated space in memory
*/
unsigned char CheckWordNumOk(struct InputParserC * ipc,unsigned int num)
{
if ( CheckIPCOk(ipc)==0) { return 0; }
if ( (ipc->tokenlist==0) || ( ipc->tokens_count <= num ) ) { return 0; }
return 1;
}
unsigned int InputParser_GetNumberOfArguments(struct InputParserC * ipc)
{
if ( CheckIPCOk(ipc)==0) { return 0; }
return ipc->tokens_count;
}
/*
InputParser_GetWord..
Copies token with number (num) to c string (wheretostore) , variable storagesize contains the total size of wheretostore..!
*/
unsigned int InputParser_IsEmptyWord(struct InputParserC * ipc,unsigned int num)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 1; }
if ( ipc->tokenlist[num].length == 0 ) { return 1; }
unsigned int i=0;
for ( i = ipc->tokenlist[num].token_start; i<ipc->tokenlist[num].token_start+ipc->tokenlist[num].length; i++ )
{
switch (ipc->str[i])
{
case 10 : break;
case 13 : break;
case ' ' : break;
default :
return 0;
};
}
return 1;
}
/*
InputParser_GetWord..
Copies token with number (num) to c string (wheretostore) , variable storagesize contains the total size of wheretostore..!
*/
unsigned int InputParser_GetWord(struct InputParserC * ipc,unsigned int num,char * wheretostore,unsigned int storagesize)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0; }
if ( storagesize < ipc->tokenlist[num].length+1 ) /* +1 gia to \0 */ return 0;
unsigned int i=0;
for ( i = ipc->tokenlist[num].token_start; i<ipc->tokenlist[num].token_start+ipc->tokenlist[num].length; i++ )
wheretostore[i-ipc->tokenlist[num].token_start] = ipc->str[i];
wheretostore[ipc->tokenlist[num].length] = 0;
return ipc->tokenlist[num].length;
}
/*
InputParser_WordCompareNoCase..
Compares word (word) with token with number (num) , null terminating character is not required , NO CASE SENSITIVITY..!
*/
unsigned char InputParser_WordCompareNoCase(struct InputParserC * ipc,unsigned int num,const char * word,unsigned int wordsize)
{
/*fprintf(stderr,"InputParser_WordCompareNoCase( %u , %s , %u )",num,word,wordsize);*/
if ( wordsize != InputParser_GetWordLength(ipc,num) ) { return 0; }
/*if ( ipc->str_length <= ipc->tokenlist[num].token_start+wordsize ) { fprintf(stderr,"Erroneous input on InputParser_WordCompareNoCase leads out of array \n"); return 0; }*/
unsigned int i=0;
for ( i=0; i<wordsize; i++ )
{
if (toupper(ipc->str[ipc->tokenlist[num].token_start+i])!=toupper(word[i])) { /*fprintf(stderr," returning fail ");*/ return 0; }
}
/*fprintf(stderr," returning success ");*/
return 1;
}
/*
InputParser_WordCompareNoCase..
Compares word (word) with token with number (num) , null terminating character is required , NO CASE SENSITIVITY..!
*/
unsigned char InputParser_WordCompareNoCaseAuto(struct InputParserC * ipc,unsigned int num,const char * word)
{
if (word==0) { return 0; }
unsigned int wordsize=strlen(word);
return InputParser_WordCompareNoCase(ipc,num,word,wordsize);
}
/*
InputParser_WordCompare..
Compares word (word) with token with number (num) , null terminating character is not required..!
*/
unsigned char InputParser_WordCompare(struct InputParserC * ipc,unsigned int num,const char * word,unsigned int wordsize)
{
if ( wordsize != InputParser_GetWordLength(ipc,num) ) { return 0; }
/*if ( ipc->str_length <= ipc->tokenlist[num].token_start+wordsize ) { fprintf(stderr,"Erroneous input on InputParser_WordCompareNoCase leads out of array \n"); return 0; }*/
unsigned int i=0;
for ( i=0; i<wordsize; i++ )
{
if (ipc->str[ipc->tokenlist[num].token_start+i]!=word[i]) { return 0; }
}
return 1;
}
/*
InputParser_WordCompareNoCase..
Compares word (word) with token with number (num) , null terminating character is required , NO CASE SENSITIVITY..!
*/
unsigned char InputParser_WordCompareAuto(struct InputParserC * ipc,unsigned int num,const char * word)
{
if (word==0) { return 0; }
unsigned int wordsize=strlen(word);
return InputParser_WordCompare(ipc,num,word,wordsize);
}
/*
InputParser_GetUpcaseWord..
Same with InputParser_GetWord , the result is converted to upcase..!
*/
unsigned int InputParser_GetUpcaseWord(struct InputParserC * ipc,unsigned int num,char * wheretostore,unsigned int storagesize)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0; }
if ( storagesize < ipc->tokenlist[num].length+1 ) /* +1 gia to \0 */ return 0;
unsigned int i=0;
for ( i = ipc->tokenlist[num].token_start; i<ipc->tokenlist[num].token_start+ipc->tokenlist[num].length; i++ )
wheretostore[i-ipc->tokenlist[num].token_start] = toupper(ipc->str[i]);
wheretostore[ipc->tokenlist[num].length] = 0;
return ipc->tokenlist[num].length;
}
/*
InputParser_GetUpcaseWord..
Same with InputParser_GetWord , the result is converted to lowercase..!
*/
unsigned int InputParser_GetLowercaseWord(struct InputParserC * ipc,unsigned int num,char * wheretostore,unsigned int storagesize)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0; }
if ( storagesize < ipc->tokenlist[num].length+1 ) /* +1 gia to \0 */ return 0;
unsigned int i=0;
for ( i = ipc->tokenlist[num].token_start; i<ipc->tokenlist[num].token_start+ipc->tokenlist[num].length; i++ )
wheretostore[i-ipc->tokenlist[num].token_start] = tolower(ipc->str[i]);
wheretostore[ipc->tokenlist[num].length] = 0;
return ipc->tokenlist[num].length;
}
/*
InputParser_GetChar..
Returns character (pos) from token (num)..!
*/
char InputParser_GetWordChar(struct InputParserC * ipc,unsigned int num,unsigned int pos)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0; }
if ( pos>=ipc->tokenlist[num].token_start+ipc->tokenlist[num].length ) { return 0; }
return ipc->str[ipc->tokenlist[num].token_start + pos ];
}
/*
InputParser_GetWordInt..
Same with InputParser_GetWord , if the result can be converted to a number , it returns this number
else 0 is returned
*/
signed int InputParser_GetWordInt(struct InputParserC * ipc,unsigned int num)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0; }
return Str2Int_internal(ipc->str,ipc->tokenlist[num].token_start,ipc->tokenlist[num].length);
}
/*
InputParser_GetWordFloat..
Same with InputParser_GetWord , if the result can be converted to a float number , it returns this number
else 0.0 is returned
*/
float InputParser_GetWordFloat(struct InputParserC * ipc,unsigned int num)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0.0; }
if (ipc->tokenlist[num].length == 0 ) { return 0.0; }
char remember = 0;
char * string_segment = 0;
char * last_char_of_string_segment = 0;
unsigned char isLocallyAllocated = ipc->local_allocation;
unsigned int tokenStart = ipc->tokenlist[num].token_start;
unsigned int tokenLength = ipc->tokenlist[num].length;
unsigned int stringLength = ipc->str_length;
float return_value=0.0;
//Our string is a "string_segment" , and its last character ( which will be temporary become null ) is last_char_of_string_segment
if (!isLocallyAllocated)
{
string_segment = (char*) malloc( (tokenLength+1) * sizeof(char) );
//memset(string_segment,0,(tokenLength+1) * sizeof(char));
if (string_segment==0)
{
fprintf(stderr,"InputParser_GetWordFloat could not allocate memory to return float value , returning NaN \n");
return NAN;
}
strncpy(string_segment,ipc->str+tokenStart,tokenLength);
last_char_of_string_segment = string_segment + ipc->tokenlist[num].length;
} else
{
string_segment = ipc->str+tokenStart;
last_char_of_string_segment = string_segment + ipc->tokenlist[num].length;
}
if (tokenStart + tokenLength < stringLength)
{
remember = *last_char_of_string_segment;
*last_char_of_string_segment = (char) 0; //Temporarily convert the string segment to a null terminated string
}
//else we are on the last part of the string so no reason to do the whole 0 remember thing..
#if USE_SCANF
//fprintf(stderr,"Using sscanf to parse %s \n",string_segment);
#warning "scanf without field width limits can crash with huge input data on libc versions older than 2.13-25. Add a field width specifier to fix this problem"
/*
Sample program that can crash:
#include <stdio.h>
int main()
{ int a; scanf("%i", &a); return 0; }
To make it crash:
perl -e 'print "5"x2100000' | ./a.out|
*/
sscanf(string_segment,"%f",&return_value);
#else
//fprintf(stderr,"Using atof to parse `%s` \n",string_segment);
return_value=atof(string_segment);
//fprintf(stderr,"Returns `%0.6f` \n",return_value);
#endif // USE_SCANF
if ( tokenStart + tokenLength < stringLength)
{
*last_char_of_string_segment = remember; //Restore string..
}
if (!isLocallyAllocated)
{
free(string_segment);
}
return return_value;
}
/*
InputParser_GetChar..
Returns total length of token (num)..!
*/
unsigned int InputParser_GetWordLength(struct InputParserC * ipc,unsigned int num)
{
if ( CheckWordNumOk(ipc,num) == 0 ) { return 0; }
return ipc->tokenlist[num].length;
}
/*
InputParser_SeperateWords..
Seperates words in c string (inpt) to tokens using delimiters set-up at structure ipc and keeps result at structure ipc
if the c string will be erased before getting back the tokens you can set the keepcopy byte to 1 , this will allocate memory to
keep a copy of the string..!
the number returned is the total of tokens extracted!
*/
int InputParser_SeperateWords(struct InputParserC * ipc,char * inpt,char keepcopy)
{
if (keepcopy==0)
{
#if WARN_ABOUT_INCORRECTLY_ALLOCATED_STACK_STRINGS
if (warningsAboutIncorrectlyAllocatedStackIssued==0)
{
fprintf(stderr,"Please note that feeding input parser with strings allocated on the stack it is generally a good idea to enable keepcopy\n");
fprintf(stderr,"For example passing here a string allocated as char* hello = \"hello!\"; might lead to a segFault ( i.e. when calling InputParser_GetWordFloat ) \n");
fprintf(stderr,"The correct way for allocating a string with in place processing is char hello[] = \"hello!\"; \n");
fprintf(stderr,"Valgrind classifies these errors as \"Bad permissions for mapped region at address\" \n");
++warningsAboutIncorrectlyAllocatedStackIssued ;
}
#endif
}
if (CheckIPCOk(ipc)==0) { return 0; }
if ( inpt == 0 ) return 0; /* NULL INPUT -> NULL OUTPUT*/
unsigned int STRING_END = strlen(inpt) ;
int WORDS_SEPERATED = 0 , NEXT_SHOULD_NOT_BE_A_DELIMITER=1; /* Ignores starting ,,,,,string,etc*/
if ( STRING_END == 0 ) { return 0; } /* NULL INPUT -> NULL OUTPUT pt 2*/
/* >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
COPY STRING ( OR POINTER ) TO IPC STRUCTURE*/
if ( keepcopy == 1 ) { /* IF WE HAVE ALREADY ALLOCATED A STRING TO ipc->str , we should free it to prevent memory leaks!*/
if (ipc->local_allocation == 1)
{
if (ipc->str!=0)
{ /* ipc->str contains a previous value!*/
free(ipc->str);
ipc->local_allocation = 0;
}
}
ipc->str = (char * ) malloc( sizeof(char) * (STRING_END+1) );
memset(ipc->str,0,sizeof(char) * (STRING_END+1));
ipc->local_allocation = 1;
strncpy( ipc->str , inpt , STRING_END ) ;
} else
{ ipc->str = inpt; }
ipc->str_length = STRING_END;
/* COPY STRING ( OR POINTER ) TO IPC STRUCTURE
>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>*/
register unsigned int i,z;
ipc->tokens_count = 0 , ipc->tokenlist[0].token_start=0;
for (i=0; i<STRING_END; i++)
{
unsigned int FOUND_DELIMETER = 0;
for (z=0; z<ipc->cur_delimeter_count; z++)
{
if ( inpt[i] == ipc->delimeters[z] )
{
FOUND_DELIMETER = 1;
if (NEXT_SHOULD_NOT_BE_A_DELIMITER==0)
{
ipc->tokenlist[ipc->tokens_count].length = i - ipc->tokenlist[ipc->tokens_count].token_start;
ipc->tokens_count+=1;
ipc->tokenlist[ipc->tokens_count].token_start = i+1;
WORDS_SEPERATED+=1;
break;
} else
{
ipc->tokenlist[ipc->tokens_count].token_start=i+1;
}
}
}
if (FOUND_DELIMETER == 0 ) NEXT_SHOULD_NOT_BE_A_DELIMITER=0; else
if (FOUND_DELIMETER == 1 ) NEXT_SHOULD_NOT_BE_A_DELIMITER=1;
}
if (NEXT_SHOULD_NOT_BE_A_DELIMITER==0)
{
ipc->tokenlist[ipc->tokens_count].length = i - ipc->tokenlist[ipc->tokens_count].token_start;
ipc->tokens_count+=1;
ipc->tokenlist[ipc->tokens_count].token_start = i+1;
WORDS_SEPERATED+=1;
} else
ipc->tokenlist[ipc->tokens_count].length = i - ipc->tokenlist[ipc->tokens_count].token_start;
return WORDS_SEPERATED;
}
/*
Same with InputParser_SeperateWords it does the (char *) type cast
*/
int InputParser_SeperateWordsCC(struct InputParserC * ipc,const char * inpt,char keepcopy)
{
return InputParser_SeperateWords(ipc,(char * )inpt,keepcopy);
}
/*
Same with InputParser_SeperateWords it does the (char *) type cast
*/
int InputParser_SeperateWordsUC(struct InputParserC * ipc,unsigned char * inpt,char keepcopy)
{
return InputParser_SeperateWords(ipc,(char * )inpt,keepcopy);
}