Coverage Report

Created: 2025-07-11 06:34

/src/aspell/common/posib_err.cpp
Line
Count
Source (jump to first uncovered line)
1
// This file is part of The New Aspell
2
// Copyright (C) 2001 by Kevin Atkinson under the GNU LGPL license
3
// version 2.0 or 2.1.  You should have received a copy of the LGPL
4
// license along with this library if you did not you can find
5
// it at http://www.gnu.org/.
6
7
#include <stdlib.h>
8
#include <stdio.h>
9
#include <assert.h>
10
11
//#include "iostream.hpp"
12
13
#include "posib_err.hpp"
14
15
#include "gettext.h"
16
17
18
namespace acommon {
19
20
  String & String::operator= (const PosibErr<String> & s)
21
9.25k
  {
22
9.25k
    operator=(s.data);
23
9.25k
    return *this;
24
9.25k
  }
25
26
  struct StrSize {
27
    const char * str; 
28
    unsigned int size; 
29
391k
    StrSize() : str(0), size(0) {}
30
73.5k
    void operator= (ParmString s) {str = s; size = s.size();}
31
  };
32
33
  PosibErrBase & PosibErrBase::set(const ErrorInfo * inf,
34
           ParmString p1, ParmString p2, 
35
           ParmString p3, ParmString p4)
36
39.1k
  {
37
39.1k
    const char * s0 = inf->mesg ? _(inf->mesg) : "";
38
39.1k
    const char * s;
39
39.1k
    ParmString p[4] = {p1,p2,p3,p4};
40
39.1k
    StrSize m[10];
41
39.1k
    unsigned int i = 0;
42
95.7k
    while (i != 4 && p[i] != 0) 
43
56.6k
      ++i;
44
39.1k
    assert(i == inf->num_parms || i == inf->num_parms + 1);
45
39.1k
    i = 0;
46
78.8k
    while (true) {
47
78.8k
      s = s0 + strcspn(s0, "%");
48
78.8k
      m[i].str = s0;
49
78.8k
      m[i].size = s - s0;
50
78.8k
      if (*s == '\0') break;
51
39.7k
      ++i;
52
39.7k
      s = strchr(s, ':') + 1;
53
39.7k
      unsigned int ip = *s - '0' - 1;
54
39.7k
      assert(0 <= ip && ip < inf->num_parms);
55
39.7k
      m[i] = p[ip];
56
39.7k
          ++i;
57
39.7k
      s0 = s+1;
58
39.7k
    }
59
39.1k
    if (!p[inf->num_parms].empty()) {
60
16.9k
      m[++i] = " ";
61
16.9k
      m[++i] = p[inf->num_parms];
62
16.9k
    }
63
39.1k
    unsigned int size = 0;
64
191k
    for (i = 0; m[i].str != 0; ++i)
65
152k
      size += m[i].size;
66
39.1k
    char * str = (char *)malloc(size + 1);
67
39.1k
    s0 = str;
68
191k
    for (i = 0; m[i].str != 0; str+=m[i].size, ++i)
69
152k
      strncpy(str, m[i].str, m[i].size);
70
39.1k
    *str = '\0';
71
39.1k
    Error * e = new Error;
72
39.1k
    e->err = inf;
73
39.1k
    e->mesg = s0;
74
39.1k
    err_ = new ErrPtr(e);
75
    
76
39.1k
    return *this;
77
39.1k
  }
78
79
  PosibErrBase & PosibErrBase::with_file(ParmString fn, int line_num)
80
0
  {
81
0
    assert(err_ != 0);
82
0
    assert(err_->refcount == 1);
83
0
    char * m = const_cast<char *>(err_->err->mesg);
84
0
    unsigned int orig_len = strlen(m);
85
0
    unsigned int new_len = fn.size() + (line_num ? 10 : 0) + 2 + orig_len + 1;
86
0
    char * s = (char *)malloc(new_len);
87
0
    if (line_num)
88
0
      snprintf(s, new_len, "%s:%d: %s", fn.str(), line_num, m);
89
0
    else
90
0
      snprintf(s, new_len, "%s: %s", fn.str(), m);
91
0
    free(m);
92
0
    const_cast<Error *>(err_->err)->mesg = s;
93
0
    return *this;
94
0
  }
95
96
  PosibErrBase & PosibErrBase::with_key(ParmString prefix, ParmString key)
97
2
  {
98
2
    assert(err_ != 0);
99
2
    assert(err_->refcount == 1);
100
2
    char * m = const_cast<char *>(err_->err->mesg);
101
2
    unsigned int orig_len = strlen(m);
102
2
    unsigned int new_len = orig_len +  prefix.size() + key.size() + 3;
103
2
    char * s = (char *)malloc(new_len);
104
2
    snprintf(s, new_len, "%s%s: %s", prefix.str(), key.str(), m);
105
2
    free(m);
106
2
    const_cast<Error *>(err_->err)->mesg = s;
107
2
    return *this;
108
2
  }
109
  
110
#ifndef NDEBUG
111
0
  void PosibErrBase::handle_err() const {
112
0
    assert (err_);
113
0
    assert (!err_->handled);
114
0
    fputs(_("Unhandled Error: "), stderr);
115
0
    fputs(err_->err->mesg, stderr);
116
0
    fputs("\n", stderr);
117
0
    abort();
118
0
  }
119
#endif
120
121
12.4k
  Error * PosibErrBase::release() {
122
12.4k
    assert (err_);
123
12.4k
    assert (err_->refcount <= 1);
124
12.4k
    --err_->refcount;
125
12.4k
    Error * tmp;
126
12.4k
    if (err_->refcount == 0) {
127
12.4k
      tmp = const_cast<Error *>(err_->err);
128
12.4k
      delete err_;
129
12.4k
    } else {
130
0
      tmp = new Error(*err_->err);
131
0
    }
132
12.4k
    err_ = 0;
133
12.4k
    return tmp;
134
12.4k
  }
135
136
26.6k
  void PosibErrBase::del() {
137
26.6k
    if (!err_) return;
138
26.6k
    delete const_cast<Error *>(err_->err);
139
26.6k
    delete err_;
140
26.6k
  }
141
142
}