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
|
/*
* Copyright (c) 2003-2023, John Wiegley. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - 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.
*
* - Neither the name of New Artisans LLC 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
* OWNER 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.
*/
#include <ledger.hh>
#include "times.h"
/**********************************************************************
*
* Assertions
*/
#if !NO_ASSERTS
namespace ledger {
DECLARE_EXCEPTION(assertion_failed, std::logic_error);
void debug_assert(const string& reason,
const string& func,
const string& file,
std::size_t line)
{
std::ostringstream buf;
buf << "Assertion failed in " << file_context(file, line)
<< func << ": " << reason;
throw assertion_failed(buf.str());
}
} // namespace ledger
#endif
/**********************************************************************
*
* Verification (basically, very slow asserts)
*/
#if VERIFY_ON
namespace ledger {
bool verify_enabled = false;
typedef std::pair<std::string, std::size_t> allocation_pair;
typedef std::map<void *, allocation_pair> memory_map;
typedef std::multimap<void *, allocation_pair> objects_map;
typedef std::pair<std::size_t, std::size_t> count_size_pair;
typedef std::map<std::string, count_size_pair> object_count_map;
namespace {
bool memory_tracing_active = false;
memory_map * live_memory = NULL;
memory_map * freed_memory = NULL;
object_count_map * live_memory_count = NULL;
object_count_map * total_memory_count = NULL;
objects_map * live_objects = NULL;
object_count_map * live_object_count = NULL;
object_count_map * total_object_count = NULL;
object_count_map * total_ctor_count = NULL;
}
void initialize_memory_tracing()
{
memory_tracing_active = false;
live_memory = new memory_map;
freed_memory = new memory_map;
live_memory_count = new object_count_map;
total_memory_count = new object_count_map;
live_objects = new objects_map;
live_object_count = new object_count_map;
total_object_count = new object_count_map;
total_ctor_count = new object_count_map;
memory_tracing_active = true;
}
void shutdown_memory_tracing()
{
memory_tracing_active = false;
if (live_objects) {
IF_DEBUG("memory.counts")
report_memory(std::cerr, true);
else IF_DEBUG("memory.counts.live")
report_memory(std::cerr);
else if (live_objects->size() > 0)
report_memory(std::cerr);
}
checked_delete(live_memory); live_memory = NULL;
checked_delete(freed_memory); freed_memory = NULL;
checked_delete(live_memory_count); live_memory_count = NULL;
checked_delete(total_memory_count); total_memory_count = NULL;
checked_delete(live_objects); live_objects = NULL;
checked_delete(live_object_count); live_object_count = NULL;
checked_delete(total_object_count); total_object_count = NULL;
checked_delete(total_ctor_count); total_ctor_count = NULL;
}
inline void add_to_count_map(object_count_map& the_map,
const char * name, std::size_t size)
{
object_count_map::iterator k = the_map.find(name);
if (k != the_map.end()) {
(*k).second.first++;
(*k).second.second += size;
} else {
std::pair<object_count_map::iterator, bool> result =
the_map.insert(object_count_map::value_type(name, count_size_pair(1, size)));
VERIFY(result.second);
}
}
std::size_t current_memory_size()
{
std::size_t memory_size = 0;
foreach (const object_count_map::value_type& pair, *live_memory_count)
memory_size += pair.second.second;
return memory_size;
}
//#if !defined(__has_feature) || !__has_feature(address_sanitizer)
static void trace_new_func(void * ptr, const char * which, std::size_t size)
{
if (! live_memory || ! memory_tracing_active) return;
memory_tracing_active = false;
memory_map::iterator i = freed_memory->find(ptr);
if (i != freed_memory->end())
freed_memory->erase(i);
live_memory->insert
(memory_map::value_type(ptr, allocation_pair(which, size)));
add_to_count_map(*live_memory_count, which, size);
add_to_count_map(*total_memory_count, which, size);
add_to_count_map(*total_memory_count, "__ALL__", size);
memory_tracing_active = true;
}
static void trace_delete_func(void * ptr, const char * which)
{
if (! live_memory || ! memory_tracing_active) return;
memory_tracing_active = false;
// Ignore deletions of memory not tracked, since it's possible that
// a user (like boost) allocated a block of memory before memory
// tracking began, and then deleted it before memory tracking ended.
// If it really is a double-delete, the malloc library on OS/X will
// notify me.
memory_map::iterator i = live_memory->find(ptr);
if (i == live_memory->end()) {
i = freed_memory->find(ptr);
if (i != freed_memory->end())
VERIFY("Freeing a block of memory twice" == NULL);
#if 0
// There can be memory allocated by Boost or the standard library, which
// was allocated before memory tracing got turned on, that the system
// might free for some coincidental reason. As such, we can't rely on
// this check being valid. I've seen cases where processes ran to
// completion with it on, and then others where valid processes failed.
else
VERIFY(! "Freeing an unknown block of memory");
#endif
memory_tracing_active = true;
return;
}
std::size_t size = (*i).second.second;
VERIFY((*i).second.first == which);
live_memory->erase(i);
freed_memory->insert
(memory_map::value_type(ptr, allocation_pair(which, size)));
object_count_map::iterator j = live_memory_count->find(which);
VERIFY(j != live_memory_count->end());
(*j).second.second -= size;
if (--(*j).second.first == 0)
live_memory_count->erase(j);
memory_tracing_active = true;
}
//#endif // !defined(__has_feature) || !__has_feature(address_sanitizer)
} // namespace ledger
//#if !defined(__has_feature) || !__has_feature(address_sanitizer)
#ifdef _GLIBCXX_THROW
void * operator new(std::size_t size) _GLIBCXX_THROW(std::bad_alloc) {
#else
void * operator new(std::size_t size) throw (std::bad_alloc) {
#endif
void * ptr = std::malloc(size);
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_new_func(ptr, "new", size);
return ptr;
}
void * operator new(std::size_t size, const std::nothrow_t&) throw() {
void * ptr = std::malloc(size);
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_new_func(ptr, "new", size);
return ptr;
}
#ifdef _GLIBCXX_THROW
void * operator new[](std::size_t size) _GLIBCXX_THROW(std::bad_alloc) {
#else
void * operator new[](std::size_t size) throw (std::bad_alloc) {
#endif
void * ptr = std::malloc(size);
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_new_func(ptr, "new[]", size);
return ptr;
}
void * operator new[](std::size_t size, const std::nothrow_t&) throw() {
void * ptr = std::malloc(size);
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_new_func(ptr, "new[]", size);
return ptr;
}
void operator delete(void * ptr) throw() {
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_delete_func(ptr, "new");
std::free(ptr);
}
void operator delete(void * ptr, const std::nothrow_t&) throw() {
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_delete_func(ptr, "new");
std::free(ptr);
}
void operator delete[](void * ptr) throw() {
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_delete_func(ptr, "new[]");
std::free(ptr);
}
void operator delete[](void * ptr, const std::nothrow_t&) throw() {
if (DO_VERIFY() && ledger::memory_tracing_active)
ledger::trace_delete_func(ptr, "new[]");
std::free(ptr);
}
//#endif // !defined(__has_feature) || !__has_feature(address_sanitizer)
namespace ledger {
namespace {
void stream_commified_number(std::ostream& out, std::size_t num)
{
std::ostringstream buf;
std::ostringstream obuf;
buf << num;
string number(buf.str());
int integer_digits = 0;
// Count the number of integer digits
for (const char * p = number.c_str(); *p; p++) {
if (*p == '.')
break;
else if (*p != '-')
integer_digits++;
}
for (const char * p = number.c_str(); *p; p++) {
if (*p == '.') {
obuf << *p;
assert(integer_digits <= 3);
}
else if (*p == '-') {
obuf << *p;
}
else {
obuf << *p;
if (integer_digits > 3 && --integer_digits % 3 == 0)
obuf << ',';
}
}
out << obuf.str();
}
void stream_memory_size(std::ostream& out, std::size_t size)
{
std::ostringstream obuf;
if (size > 10 * 1024 * 1024)
obuf << "\033[1m";
if (size > 100 * 1024 * 1024)
obuf << "\033[31m";
obuf << std::setw(7);
if (size < 1024)
obuf << size << 'b';
else if (size < (1024 * 1024))
obuf << int(double(size) / 1024.0) << 'K';
else if (size < (1024 * 1024 * 1024))
obuf << int(double(size) / (1024.0 * 1024.0)) << 'M';
else
obuf << int(double(size) / (1024.0 * 1024.0 * 1024.0)) << 'G';
if (size > 10 * 1024 * 1024)
obuf << "\033[0m";
out << obuf.str();
}
void report_count_map(std::ostream& out, object_count_map& the_map)
{
foreach (object_count_map::value_type& pair, the_map) {
out << " " << std::right << std::setw(18);
stream_commified_number(out, pair.second.first);
out << " " << std::right << std::setw(7);
stream_memory_size(out, pair.second.second);
out << " " << std::left << pair.first
<< std::endl;
}
}
}
std::size_t current_objects_size()
{
std::size_t objects_size = 0;
foreach (const object_count_map::value_type& pair, *live_object_count)
objects_size += pair.second.second;
return objects_size;
}
void trace_ctor_func(void * ptr, const char * cls_name, const char * args,
std::size_t cls_size)
{
if (! live_objects || ! memory_tracing_active) return;
memory_tracing_active = false;
static char name[1024];
std::strcpy(name, cls_name);
std::strcat(name, "(");
std::strcat(name, args);
std::strcat(name, ")");
DEBUG("memory.debug", "TRACE_CTOR " << ptr << " " << name);
live_objects->insert
(objects_map::value_type(ptr, allocation_pair(cls_name, cls_size)));
add_to_count_map(*live_object_count, cls_name, cls_size);
add_to_count_map(*total_object_count, cls_name, cls_size);
add_to_count_map(*total_object_count, "__ALL__", cls_size);
add_to_count_map(*total_ctor_count, name, cls_size);
memory_tracing_active = true;
}
void trace_dtor_func(void * ptr, const char * cls_name, std::size_t cls_size)
{
if (! live_objects || ! memory_tracing_active) return;
memory_tracing_active = false;
DEBUG("memory.debug", "TRACE_DTOR " << ptr << " " << cls_name);
objects_map::iterator i = live_objects->find(ptr);
if (i == live_objects->end()) {
warning_(_f("Attempting to delete %1% a non-living %2%") % ptr % cls_name);
memory_tracing_active = true;
return;
}
std::size_t ptr_count = live_objects->count(ptr);
for (std::size_t x = 0; x < ptr_count; x++, i++) {
if ((*i).second.first == cls_name) {
live_objects->erase(i);
break;
}
}
object_count_map::iterator k = live_object_count->find(cls_name);
if (k == live_object_count->end()) {
warning_(_f("Failed to find %1% in live object counts") % cls_name);
memory_tracing_active = true;
return;
}
(*k).second.second -= cls_size;
if (--(*k).second.first == 0)
live_object_count->erase(k);
memory_tracing_active = true;
}
void report_memory(std::ostream& out, bool report_all)
{
if (! live_memory) return;
if (live_memory_count->size() > 0) {
out << "NOTE: There may be memory held by Boost "
<< "and libstdc++ after ledger::shutdown()" << std::endl;
out << "Live memory count:" << std::endl;
report_count_map(out, *live_memory_count);
}
if (live_memory->size() > 0) {
out << "Live memory:" << std::endl;
foreach (const memory_map::value_type& pair, *live_memory) {
out << " " << std::right << std::setw(18) << pair.first
<< " " << std::right << std::setw(7);
stream_memory_size(out, pair.second.second);
out << " " << std::left << pair.second.first
<< std::endl;
}
}
if (report_all && total_memory_count->size() > 0) {
out << "Total memory counts:" << std::endl;
report_count_map(out, *total_memory_count);
}
if (live_object_count->size() > 0) {
out << "Live object count:" << std::endl;
report_count_map(out, *live_object_count);
}
if (live_objects->size() > 0) {
out << "Live objects:" << std::endl;
foreach (const objects_map::value_type& pair, *live_objects) {
out << " " << std::right << std::setw(18) << pair.first
<< " " << std::right << std::setw(7);
stream_memory_size(out, pair.second.second);
out << " " << std::left << pair.second.first
<< std::endl;
}
}
if (report_all) {
if (total_object_count->size() > 0) {
out << "Total object counts:" << std::endl;
report_count_map(out, *total_object_count);
}
if (total_ctor_count->size() > 0) {
out << "Total constructor counts:" << std::endl;
report_count_map(out, *total_ctor_count);
}
}
}
} // namespace ledger
#endif // VERIFY_ON
/**********************************************************************
*
* String wrapper
*/
namespace ledger {
string empty_string("");
strings_list split_arguments(const char * line)
{
strings_list args;
char buf[4096];
char * q = buf;
char in_quoted_string = '\0';
for (const char * p = line; *p; p++) {
if (! in_quoted_string && std::isspace(static_cast<unsigned char>(*p))) {
if (q != buf) {
*q = '\0';
args.push_back(buf);
q = buf;
}
}
else if (in_quoted_string != '\'' && *p == '\\') {
p++;
if (! *p)
throw_(std::logic_error, _("Invalid use of backslash"));
*q++ = *p;
}
else if (in_quoted_string != '"' && *p == '\'') {
if (in_quoted_string == '\'')
in_quoted_string = '\0';
else
in_quoted_string = '\'';
}
else if (in_quoted_string != '\'' && *p == '"') {
if (in_quoted_string == '"')
in_quoted_string = '\0';
else
in_quoted_string = '"';
}
else {
*q++ = *p;
}
}
if (in_quoted_string)
throw_(std::logic_error,
_f("Unterminated string, expected '%1%'") % in_quoted_string);
if (q != buf) {
*q = '\0';
args.push_back(buf);
}
return args;
}
} // namespace ledger
/**********************************************************************
*
* Logging
*/
#if LOGGING_ON
namespace ledger {
log_level_t _log_level = LOG_WARN;
std::ostream * _log_stream = &std::cerr;
std::ostringstream _log_buffer;
#if TRACING_ON
uint16_t _trace_level;
#endif
static bool logger_has_run = false;
static ptime logger_start;
void logger_func(log_level_t level)
{
if (! logger_has_run) {
logger_has_run = true;
logger_start = TRUE_CURRENT_TIME();
#if VERIFY_ON
IF_VERIFY()
*_log_stream << " TIME OBJSZ MEMSZ" << std::endl;
#endif
}
*_log_stream << std::right << std::setw(5)
<< (TRUE_CURRENT_TIME() -
logger_start).total_milliseconds() << "ms";
#if VERIFY_ON
IF_VERIFY() {
*_log_stream << std::right << std::setw(6) << std::setprecision(3);
stream_memory_size(*_log_stream, current_objects_size());
*_log_stream << std::right << std::setw(6) << std::setprecision(3);
stream_memory_size(*_log_stream, current_memory_size());
}
#endif
*_log_stream << " " << std::left << std::setw(7);
switch (level) {
case LOG_CRIT: *_log_stream << "[CRIT]"; break;
case LOG_FATAL: *_log_stream << "[FATAL]"; break;
case LOG_ASSERT: *_log_stream << "[ASSRT]"; break;
case LOG_ERROR: *_log_stream << "[ERROR]"; break;
case LOG_VERIFY: *_log_stream << "[VERFY]"; break;
case LOG_WARN: *_log_stream << "[WARN]"; break;
case LOG_INFO: *_log_stream << "[INFO]"; break;
case LOG_EXCEPT: *_log_stream << "[EXCPT]"; break;
case LOG_DEBUG: *_log_stream << "[DEBUG]"; break;
case LOG_TRACE: *_log_stream << "[TRACE]"; break;
case LOG_OFF:
case LOG_ALL:
assert(false);
break;
}
*_log_stream << ' ' << _log_buffer.str() << std::endl;
_log_buffer.clear();
_log_buffer.str("");
}
} // namespace ledger
#if DEBUG_ON
namespace ledger {
optional<std::string> _log_category;
#if HAVE_BOOST_REGEX_UNICODE
optional<boost::u32regex> _log_category_re;
#else
optional<boost::regex> _log_category_re;
#endif
static struct __maybe_enable_debugging {
__maybe_enable_debugging() {
if (const char * p = std::getenv("LEDGER_DEBUG")) {
_log_level = LOG_DEBUG;
_log_category = p;
}
}
} __maybe_enable_debugging_obj;
} // namespace ledger
#endif // DEBUG_ON
#endif // LOGGING_ON
/**********************************************************************
*
* Timers (allows log xacts to specify cumulative time spent)
*/
#if LOGGING_ON && TIMERS_ON
namespace ledger {
struct timer_t
{
log_level_t level;
ptime begin;
time_duration spent;
std::string description;
bool active;
timer_t(log_level_t _level, std::string _description)
: level(_level), begin(TRUE_CURRENT_TIME()),
spent(time_duration(0, 0, 0, 0)),
description(_description), active(true) {}
};
typedef std::map<std::string, timer_t> timer_map;
static timer_map timers;
void start_timer(const char * name, log_level_t lvl)
{
#if VERIFY_ON
bool tracing_active = memory_tracing_active;
memory_tracing_active = false;
#endif
timer_map::iterator i = timers.find(name);
if (i == timers.end()) {
timers.insert(timer_map::value_type(name, timer_t(lvl, _log_buffer.str())));
} else {
assert((*i).second.description == _log_buffer.str());
(*i).second.begin = TRUE_CURRENT_TIME();
(*i).second.active = true;
}
_log_buffer.clear();
_log_buffer.str("");
#if VERIFY_ON
memory_tracing_active = tracing_active;
#endif
}
void stop_timer(const char * name)
{
#if VERIFY_ON
bool tracing_active = memory_tracing_active;
memory_tracing_active = false;
#endif
timer_map::iterator i = timers.find(name);
assert(i != timers.end());
(*i).second.spent += TRUE_CURRENT_TIME() - (*i).second.begin;
(*i).second.active = false;
#if VERIFY_ON
memory_tracing_active = tracing_active;
#endif
}
void finish_timer(const char * name)
{
#if VERIFY_ON
bool tracing_active = memory_tracing_active;
memory_tracing_active = false;
#endif
timer_map::iterator i = timers.find(name);
if (i == timers.end()) {
#if VERIFY_ON
memory_tracing_active = tracing_active;
#endif
return;
}
time_duration spent = (*i).second.spent;
if ((*i).second.active) {
spent = TRUE_CURRENT_TIME() - (*i).second.begin;
(*i).second.active = false;
}
_log_buffer << (*i).second.description << ' ';
bool need_paren =
(*i).second.description[(*i).second.description.size() - 1] != ':';
if (need_paren)
_log_buffer << '(';
_log_buffer << spent.total_milliseconds() << "ms";
if (need_paren)
_log_buffer << ')';
logger_func((*i).second.level);
timers.erase(i);
#if VERIFY_ON
memory_tracing_active = tracing_active;
#endif
}
} // namespace ledger
#endif // LOGGING_ON && TIMERS_ON
/**********************************************************************
*
* Signal handlers
*/
caught_signal_t caught_signal = NONE_CAUGHT;
void sigint_handler(int)
{
caught_signal = INTERRUPTED;
}
void sigpipe_handler(int)
{
caught_signal = PIPE_CLOSED;
}
/**********************************************************************
*
* General utility functions
*/
namespace ledger {
path expand_path(const path& pathname)
{
if (pathname.empty())
return pathname;
std::string path_string = pathname.string();
const char * pfx = NULL;
string::size_type pos = path_string.find_first_of('/');
if (path_string.length() == 1 || pos == 1) {
pfx = std::getenv("HOME");
#if HAVE_GETPWUID
if (! pfx) {
// Punt. We're trying to expand ~/, but HOME isn't set
struct passwd * pw = getpwuid(getuid());
if (pw)
pfx = pw->pw_dir;
}
#endif
}
#if HAVE_GETPWNAM
else {
string user(path_string, 1, pos == string::npos ?
string::npos : pos - 1);
struct passwd * pw = getpwnam(user.c_str());
if (pw)
pfx = pw->pw_dir;
}
#endif
// if we failed to find an expansion, return the path unchanged.
if (! pfx)
return pathname;
string result(pfx);
if (pos == string::npos)
return result;
if (result.length() == 0 || result[result.length() - 1] != '/')
result += '/';
result += path_string.substr(pos + 1);
return result;
}
path resolve_path(const path& pathname)
{
path temp = pathname;
if (temp.string()[0] == '~')
temp = expand_path(temp);
temp.lexically_normal();
return temp;
}
} // namespace ledger
|