-
Notifications
You must be signed in to change notification settings - Fork 0
/
buffer_processing.cpp
932 lines (854 loc) · 29 KB
/
buffer_processing.cpp
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
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
/**
* @file buffer_processing.cpp
* @brief: <description>
* @verbatim
*******************************************************************************
* Author: Douglas L. Potts
*
* Date: 06/12/2015, <SCR #>
*
*==============================================================================
*==============================================================================
* Copyright (c) 2015 Douglas Lee Potts
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*==============================================================================
*==============================================================================
*
* History:
* Date SCR # Name Description
* -----------------------------------------------------------------------------
*
*******************************************************************************
* @endverbatim
*/
/*******************************************************************************
* System Includes
*******************************************************************************
*/
#include <stdio.h> /* for printf() */
#include <stdlib.h> /* for malloc() */
#include <string.h> /* for strncpy() */
#include <list> /* for std::list */
#include <vector>
#include <sys/types.h>
#include <fcntl.h>
#include <errno.h> /* for errno */
#include <algorithm> /* for std::sort */
/*******************************************************************************
* Project Includes
*******************************************************************************
*/
#if defined(TEST)
#include "unity.h"
#endif /* defined(TEST) */
#include "buffer_processing.hpp"
#include "common_types.h"
using namespace std;
/*******************************************************************************
* External Variables
*******************************************************************************
*/
#if defined(TEST)
/*
* Need this for Unit Test code, no main
*/
Bool_t g_debug_output = FALSE;
#else
extern Bool_t g_debug_output;
#endif
/*******************************************************************************
* Local Function Prototypes
*******************************************************************************
*/
static void print_read_performance (vector < int >&read_counts);
static bool int_compare (int i, int j);
static void _lock_printing (void);
static void _unlock_printing (void);
/*******************************************************************************
* Local Constants
*******************************************************************************
*/
/** @def Used to turn on and off debug print statements. */
#define DBG(X)
/*******************************************************************************
* File Scoped Variables
*******************************************************************************
*/
/**
* File scoped mutex, to keep multi-threaded printing from interleaving and
* becoming unreadable.
*/
static pthread_mutex_t g_printMutex = PTHREAD_MUTEX_INITIALIZER;
/*******************************************************************************
********************* E X T E R N A L F U N C T I O N S **********************
*******************************************************************************
*/
/*******************************************************************************
************************ L O C A L F U N C T I O N S *************************
*******************************************************************************
*/
#if defined(TEST)
/** File scope, pointer to mocked file data, loaded by mock_set_file_data */
static char *g_mock_file_data = NULL;
/**
* File scope, pointer to where in the mocked file data we currently are, meant
* to mimic file pointer.
*/
static char *g_mock_file_ptr = NULL;
/** File scope, pointer to the end of the mock file data (EOF) */
static char *g_mock_file_end = NULL;
/**
*******************************************************************************
* @brief mock_set_file_data - Load the mock file data into the file buffer.
*
* <!-- Parameters -->
* @param[in] data_buff Pointer to character buffer to copy into
* the file buffer.
* @param[in] count Count of the number of bytes pointed to
* by data_buff.
*
* <!-- Returns -->
* None (if return type is void)
*
* @par Pre/Post Conditions:
* @post Allocates a buffer on the heap containing a copy of the data
* from data_buff.
*
* @par Global Data:
* @li g_mock_file_data
* @li g_mock_file_ptr
* @li g_mock_file_end
*
* @par Description:
* NOT thread safe, mean to only be called by the single threaded unit
* tests, to provide for a way to process "files" without having to read
* from the file system.
*******************************************************************************
*/
void mock_set_file_data (char *data_buff, ssize_t count)
{
/*
* Create buffer to hold file data
*/
g_mock_file_data = (char *) malloc (count * sizeof (char));
/*
* Copy in from source
*/
memcpy (g_mock_file_data, data_buff, count);
/*
* Set file ptr. to the beginning of the buffer
*/
g_mock_file_ptr = g_mock_file_data;
g_mock_file_end = g_mock_file_data + count;
}
/**
*******************************************************************************
* @brief mock_open - Essentially a no-operation function.
*
* <!-- Parameters -->
* @param[in] pathname String path name to "open" (not used)
* @param[in] flags Integer bitmask (not used)
*
* <!-- Returns -->
* @return 0 - ALWAYS
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* None (if no global data)
*
* @par Description:
* Has the same signature as the system open() call. Doesn't actually do
* anything, as the buffer gets loaded elsewhere, and pointers, etc. are
* set there.
*******************************************************************************
*/
int mock_open (const char *pathname, int flags)
{
return 0;
}
/**
*******************************************************************************
* @brief mock_read - Read a certain number of characters out of the mock file.
*
* <!-- Parameters -->
* @param[in] fd File descriptor (not used)
* @param[in,out] buf Pointer to a character buffer to put the
* read "file data" into.
* @paran[in] count Number of bytes to read from the buffer,
* should be <= size of 'buf'
*
* <!-- Returns -->
* @return number of bytes actually copied into 'buf'
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* @li g_mock_file_data
* @li g_mock_file_ptr
* @li g_mock_file_end
*
* @par Description:
* Has the same signature as the system read() call. Reads data from our
* "mocked file", keeping track of the number of bytes copied into the
* buffer and moving the virtual file pointer accordingly. If the end of
* the "file data" is reached, then actual bytes read is truncated to that.
*******************************************************************************
*/
ssize_t mock_read (int fd, void *buf, size_t count)
{
ssize_t bytes_used = 0;
if ((g_mock_file_ptr + count) >= g_mock_file_end)
{
bytes_used = g_mock_file_end - g_mock_file_ptr;
}
else
{
bytes_used = count;
}
if (bytes_used > 0)
{
/*
* copy from current file ptr. for 'count' bytes
*/
memcpy (buf, g_mock_file_ptr, bytes_used);
/*
* Now update the file pointer
*/
g_mock_file_ptr += bytes_used;
}
return (bytes_used);
}
/**
*******************************************************************************
* @brief mock_close - Close the mock file.
*
* <!-- Parameters -->
* @param[in] fd File descriptor (not used)
*
* <!-- Returns -->
* @return 0 - ALWAYS
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* @li g_mock_file_data
* @li g_mock_file_ptr
* @li g_mock_file_end
*
* @par Description:
* Has the same signature as the system close() call. Cleans up usage of
* the mock file buffer, resetting the pointers and freeing the mock data
* buffer.
*******************************************************************************
*/
int mock_close (int fd)
{
/*
* Free up the bufrer
*/
free (g_mock_file_data);
/*
* Reset file-globals to NULL
*/
g_mock_file_data = NULL;
g_mock_file_ptr = g_mock_file_data;
g_mock_file_end = g_mock_file_data;
return (0);
}
/**
*******************************************************************************
* @brief mock_lseek - Seek in the mock file.
*
* <!-- Parameters -->
* @param[in] fd File descriptor (not used)
* @param[in] offset Byte count to seek into the file.
* @param[in] whence Code indicating how 'offset' applies
* (not used).
*
* <!-- Returns -->
* @return 0 - ALWAYS
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* @li g_mock_file_data
* @li g_mock_file_ptr
* @li g_mock_file_end
*
* @par Description:
* Has the same signature as the system close() call. Cleans up usage of
* the mock file buffer, resetting the pointers and freeing the mock data
* buffer.
*******************************************************************************
*/
off_t mock_lseek (int fd, off_t offset, int whence)
{
g_mock_file_ptr = g_mock_file_data + offset;
return ((off_t) g_mock_file_ptr);
}
/*
* When we are in #if defined(TEST), these will replace the system calls in this
* file
*/
#define close mock_close
#define open mock_open
#define read mock_read
#define close mock_close
#define lseek mock_lseek
extern "C"
{
void bufferProcFourWordsAtBegin (void)
{
char mybuf[] = "zzz=abc!!!555++++Doug!!!";
int buflen = strlen (mybuf);
list < char *>word_list;
int ret = -1;
int idx = 0;
ret = processWholeBuffer (mybuf, buflen, word_list);
printf (" Processed: %d characters\n", ret);
TEST_ASSERT_EQUAL (word_list.size (), 4);
for (list < char *>::iterator it = word_list.begin ();
it != word_list.end (); ++it, ++idx)
{
printf ("Found word: %s\n", *it);
switch (idx)
{
case 0:
TEST_ASSERT_EQUAL_STRING (*it, "zzz");
break;
case 1:TEST_ASSERT_EQUAL_STRING (*it, "abc");
break;
case 2:TEST_ASSERT_EQUAL_STRING (*it, "555");
break;
case 3:TEST_ASSERT_EQUAL_STRING (*it, "Doug");
break;
}
} /* end for */
}
void bufferProcOneWordAtBegin (void)
{
char mybuf[] = "zzz=!!!++++";
int buflen = strlen (mybuf);
list < char *>word_list;
int ret = -1;
ret = processWholeBuffer (mybuf, buflen, word_list);
printf (" Processed: %d characters\n", ret);
TEST_ASSERT_EQUAL (word_list.size (), 1);
TEST_ASSERT_EQUAL_STRING (word_list.front (), "zzz");
}
void bufferProcFullBuffer (void)
{
#define MYBUF_LEN 512
char mybuf[MYBUF_LEN] = { 0 };
int buflen = MYBUF_LEN;
list < char *>word_list;
int ret = -1;
int idx = 0;
static const char *const BEG_STRING = "ginning"; /* +------ ... -----+ */
/*
* Be|ginning!!!!!!fin|ish
*/
static const char *const END_STRING = "fin"; /* +------ ... -----+ */
memset (mybuf, ':', (MYBUF_LEN - 1) * sizeof (*mybuf));
strncpy (mybuf, BEG_STRING, strlen (BEG_STRING));
strncpy (&mybuf[MYBUF_LEN - strlen (END_STRING)], END_STRING,
strlen (END_STRING));
ret = processWholeBuffer (mybuf, buflen, word_list);
printf (" Processed: %d characters\n", ret);
TEST_ASSERT_EQUAL (word_list.size (), 1);
for (list < char *>::iterator it = word_list.begin ();
it != word_list.end (); ++it, ++idx)
{
switch (idx)
{
case 0:
TEST_ASSERT_EQUAL_STRING (*it, "ginning");
break;
default:
TEST_FAIL_MESSAGE ("Unexpected Word FOUND");
break;
}
}
}
void fileProcess (void)
{
static const int my_buf_len = 520;
int tid = 1; /* Fake thread id */
string fakeFilePath = "/usr/local";
Word_Dict *testDict = new Word_Dict ();
char fileData[my_buf_len];
/*
* Init fake file data to ALL non-word char's
*/
memset (fileData, ':', sizeof (fileData));
strncpy (fileData, "abc", strlen ("abc"));
strncpy (&fileData[MYBUF_LEN - strlen ("xyz")], "xyz", strlen ("xyz"));
mock_set_file_data (fileData, my_buf_len);
processFile (tid, fakeFilePath, testDict);
testDict->print ();
int dict_entry_count = 0;
string word;
int wordCount;
testDict->begin ();
do
{
testDict->getNextWord (word, &wordCount);
if (word != "")
{
switch (dict_entry_count)
{
case 0:
TEST_ASSERT_EQUAL_STRING (word.c_str (), "abc");
break;
case 1:
TEST_ASSERT_EQUAL_STRING (word.c_str (), "xyz");
break;
}
dict_entry_count++;
}
}
while (word != "");
TEST_ASSERT_EQUAL (dict_entry_count, 2);
}
}
#endif /* defined(TEST) */
/**
*******************************************************************************
* @brief isWordChar - Check if the given character is considered a "word" char.
*
* <!-- Parameters -->
* @param[in] thisOne Character code to check if it is a "word"
* char.
*
* <!-- Returns -->
* @return TRUE If thisOne is a "word" character
* @return FALSE If thisOne is NOT a "word" character
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* None (if no global data)
*
* @par Description:
* Check if the character falls between a-z, A-Z, or 0-9.
*******************************************************************************
*/
Bool_t isWordChar (const char thisOne)
{
if ((thisOne >= 'A' && thisOne <= 'Z') ||
(thisOne >= 'a' && thisOne <= 'z') ||
(thisOne >= '0' && thisOne <= '9'))
{
return TRUE;
}
else
{
return FALSE;
}
}
/**
*******************************************************************************
* @brief processFile - Take a file path, and parse the file for words putting
* them in the dictionary.
*
* <!-- Parameters -->
* @param[in] tid Integer thread index, only used in debug
* output to track which thread is
* performing what operation.
* @param[in] filePath String file path to a ".txt" file
* @param[in] dict Pointer to a Word_Dict which any words
* processed will be kept.
*
* <!-- Returns -->
* None (if return type is void)
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* None (if no global data)
*
* @par Description:
* Open the file specified by filePath, and read through it, searching for
* words (based on "word char" qualification), and updating the dictionary
* for each. Updating consists of inserting if the word doesn't already
* exist, and updating the count for that word if it does.
*******************************************************************************
*/
void processFile (int tid, string filePath, Word_Dict * dict)
{
static const int INITIAL_COUNT = 1;
char buffer[512] = { 0 };
int fIn;
ssize_t bytes = 0;
ssize_t total_bytes = 0;
list < char *>word_list;
vector < int >read_counts;
int processed_bytes = 0;
int leftover_bytes = 0;
fIn = open (filePath.c_str (), O_RDONLY);
if (fIn == -1)
{
fprintf (stderr, "Failed to open file: %s, errno=%d,%s",
filePath.c_str (), errno, strerror (errno));
return;
}
DBG (printf ("Processing file: %s\n", filePath.c_str ()));
Bool_t already_rewound = FALSE;
while ((bytes = read (fIn, buffer, sizeof (buffer))) > 0)
{
read_counts.push_back (bytes);
word_list.clear ();
processed_bytes = processWholeBuffer (buffer, bytes, word_list);
DBG (printWordList (word_list));
/*
* Foreach word:
* - Try and find it in the list
* - if in the list, increment count
* - otherwise add to the list with a count of 1
*/
for (list < char *>::iterator it = word_list.begin ();
it != word_list.end (); ++it)
{
string word;
word = *it;
DBG (printf ("Finding word: %s\n", word.c_str ()));
/*
* Convert word to lowercase before searching or inserting it
*/
transform (word.begin (), word.end (), word.begin (),::tolower);
if (dict->hasWord (word) == FALSE)
{
DBG (printf ("[%d] Word(%s) is not in dict. adding it\n",
tid, *it));
dict->insertWord (word, INITIAL_COUNT);
}
else
{
DBG (printf ("[%d] Word(%s) IS in dict. incrementing it\n",
tid, *it));
dict->incrementWordCount (word);
}
free (*it);
} /* end for */
DBG (printf
("[%d] Processed %d bytes this loop\n", tid, processed_bytes));
/*
* If we didn't process all of it, then only count what we did process
*/
if (processed_bytes < bytes)
{
total_bytes += processed_bytes;
leftover_bytes = bytes - processed_bytes;
if (already_rewound == FALSE)
{
lseek (fIn, total_bytes, SEEK_SET);
already_rewound = TRUE;
}
}
else
{
total_bytes += bytes;
}
}
/*
* Process anything left in the buffer, at end of file
*/
if ((bytes == 0) && (leftover_bytes > 0))
{
int chars_processed = 0;
char *buffer_start = buffer;
int buffer_sz_to_process = leftover_bytes;
char *word_found = NULL;
int processed_this_round = 0;
while (chars_processed < buffer_sz_to_process)
{
processed_this_round = processBufferForWords (buffer_start,
buffer_sz_to_process,
&word_found);
buffer_start += processed_this_round;
chars_processed += processed_this_round;
DBG (printf
(" %d: bytes proceesed this loop\n", processed_this_round));
DBG (printf (" %d: total bytes processed\n", chars_processed));
if (word_found != NULL)
{
DBG (printf ("---->Found word: %s\n", word_found));
word_list.push_back (word_found);
}
DBG (printf ("\n\n"));
}
}
if (g_debug_output == TRUE)
{
print_read_performance (read_counts);
}
close (fIn);
DBG (printf ("[%d] Finished processing file: %s, %lu bytes\n",
tid, filePath.c_str (), total_bytes));
return;
}
/**
*******************************************************************************
* @brief processBufferForWords - Take a buffer of data read from the file and
* parse for words.
*
* <!-- Parameters -->
* @param[in] buffer Pointer to the buffer read from file to
* process.
* @param[in] buffer_sz Size of 'buffer' in characters
* @param[in] word Pointer to location in which to put the
* word found.
*
* <!-- Returns -->
* @return number of bytes processed.
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* None (if no global data)
*
* @par Description:
* Search through the buffer character by character to find "runs" of "word
* characters. Once a run/word is found it, it is returned to the caller
* by setting 'word' to point to it.
*******************************************************************************
*/
int processBufferForWords (char *buffer, int buffer_sz, char **word)
{
int char_index;
int begin_last_word = -1;
int num_processed = 0;
if (word == NULL)
{
goto cleanup;
}
*word = NULL;
for (char_index = 0; char_index < buffer_sz; char_index++)
{
/*
* If a word character we'll want to keep going
*/
if (isWordChar (buffer[char_index]))
{
if (begin_last_word == -1)
{
begin_last_word = char_index;
}
}
else
{
if (begin_last_word != -1)
{
int length = char_index - begin_last_word;
char *tmp_word = (char *) calloc (length, sizeof (char));
if (tmp_word != NULL)
{
strncpy (tmp_word, &buffer[begin_last_word], length);
*word = tmp_word;
goto cleanup;
}
}
}
num_processed++;
}
if (begin_last_word != -1)
{
/*
* Buffer size minus where we started should be the length
*/
int length = buffer_sz - begin_last_word;
char *tmp_word = (char *) calloc (length, sizeof (char));
if (tmp_word != NULL)
{
strncpy (tmp_word, &buffer[begin_last_word], length);
*word = tmp_word;
}
}
cleanup:
return (num_processed);
}
/**
*******************************************************************************
* @brief processWholeBuffer - Process a whole buffer's worth of data for all of
* the words contained therein.
*
* <!-- Parameters -->
* @param[in] buffer Pointer to the buffer read from file to
* process.
* @param[in] buffer_sz Size of 'buffer' in characters
* @param[in] word_list Reference to a stl::list in which to
* insert all words found in the buffer.
*
* <!-- Returns -->
* @return count of bytes processed from the buffer.
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* None (if no global data)
*
* @par Description:
* Takes a file read buffer's worth of data, passes it off to
* processBufferForWords() to get individual words from the buffer, and add
* them to the word_list vector (they will get coallated with the other
* words in the caller.
*******************************************************************************
*/
int processWholeBuffer (char *buffer, int buffer_sz, list < char *>&word_list)
{
int chars_processed = 0;
char *buffer_start = buffer;
char *word_found = NULL;
int processed_this_round = 0;
int buffer_sz_to_process = buffer_sz;
int idx = 0;
DBG (printf ("Buffer size: %d\n", buffer_sz));
/*
* If very last of buffer looks like a word, back off until we are at the
* beginning of it, and then only process up until that point
*/
if (isWordChar (buffer[buffer_sz - 1]))
{
for (idx = buffer_sz - 1; idx >= 0; idx--)
{
if (isWordChar (buffer[idx]) == FALSE)
{
buffer_sz_to_process = idx;
break;
}
} /* end for */
}
while (chars_processed < buffer_sz_to_process)
{
processed_this_round = processBufferForWords (buffer_start,
(buffer_sz_to_process -
chars_processed),
&word_found);
buffer_start += processed_this_round;
chars_processed += processed_this_round;
DBG (printf
(" %d: bytes proceesed this loop\n", processed_this_round));
DBG (printf (" %d: total bytes processed\n", chars_processed));
if (word_found != NULL)
{
DBG (printf ("---->Found word: %s\n", word_found));
word_list.push_back (word_found);
}
DBG (printf ("\n\n"));
}
return (chars_processed);
}
/**
*******************************************************************************
* @brief int_compare - comparitor used by vector sort operation.
*******************************************************************************
*/
static bool int_compare (int i, int j)
{
return (i < j);
}
/**
*******************************************************************************
* @brief print_read_performance - Function to go through the file read byte
* counts and plot the histogram.
*
* <!-- Parameters -->
* @param[in] read_counts Vector of all of the read operations on a
* particular file thread.
*
* <!-- Returns -->
* None (if return type is void)
*
* @par Pre/Post Conditions:
* None (if entry/exit conditions do not apply)
*
* @par Global Data:
* None (if no global data)
*
* @par Description:
* For each file read operation, the size of the buffer returned is stored
* in a vector, and then at file close, this function is called to plot the
* read peformance.
*
*******************************************************************************
*/
static void print_read_performance (vector < int >&read_counts)
{
sort (read_counts.begin (), read_counts.end (), int_compare);
printf ("Summarizing file read counts:\n");
for (vector < int >::iterator v_it = read_counts.begin ();
v_it != read_counts.end (); ++v_it)
{
printf (" %d,", *v_it);
}
printf ("\n");
/*
* Histogram
*/
/*
* if count == last_count
* print *
* else
* print \ncount
*
*/
_lock_printing ();
int last_count = -1;
printf (" Read Counts Histogram\n");
printf (" +-----------------------------------------------------");
for (vector < int >::iterator v_it = read_counts.begin ();
v_it != read_counts.end (); ++v_it)
{
// printf ("---->v_it=%d, last_count=%d\n", *v_it, last_count);
if (*v_it == last_count)
{
printf ("*");
}
else
{
printf ("\n%4d | *", *v_it);
last_count = *v_it;
}
}
printf ("\n +-----------------------------------------------------\n");
_unlock_printing ();
}
/**
*******************************************************************************
* @brief _lock_printing - Grab the local file mutex for printing debug output.
*******************************************************************************
*/
static void _lock_printing (void)
{
(void) pthread_mutex_lock (&g_printMutex);
}
/**
*******************************************************************************
* @brief _unlock_printing - Release the local file mutex for printing debug
* output.
*******************************************************************************
*/
static void _unlock_printing (void)
{
(void) pthread_mutex_unlock (&g_printMutex);
}