Coverage Report

Created: 2025-10-10 06:41

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/yara/libyara/simple_str.c
Line
Count
Source
1
/*
2
Copyright (c) 2022. The YARA Authors. All Rights Reserved.
3
4
Redistribution and use in source and binary forms, with or without modification,
5
are permitted provided that the following conditions are met:
6
7
1. Redistributions of source code must retain the above copyright notice, this
8
list of conditions and the following disclaimer.
9
10
2. Redistributions in binary form must reproduce the above copyright notice,
11
this list of conditions and the following disclaimer in the documentation and/or
12
other materials provided with the distribution.
13
14
3. Neither the name of the copyright holder nor the names of its contributors
15
may be used to endorse or promote products derived from this software without
16
specific prior written permission.
17
18
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
19
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
20
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
21
DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
22
ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
23
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
24
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON
25
ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
27
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28
*/
29
30
#include <stdarg.h>
31
#include <string.h>
32
#include <yara/mem.h>
33
#include <yara/simple_str.h>
34
#include <yara/types.h>
35
36
static bool sstr_vappendf(SIMPLE_STR* ss, const char* fmt, va_list va)
37
13.5M
{
38
  // Create copy because list will get consumed when getting the final length
39
13.5M
  va_list va2;
40
13.5M
  va_copy(va2, va);
41
42
13.5M
  int size = vsnprintf(NULL, 0, fmt, va2);
43
44
13.5M
  va_end(va2);
45
46
13.5M
  if (size < 0)
47
0
    return false;
48
49
13.5M
  if (ss->cap < ss->len + size + 1)
50
1.30M
  {
51
1.30M
    uint32_t new_size = (ss->len + size) * 2 + 64;
52
1.30M
    char* tmp = yr_realloc(ss->str, new_size);
53
54
1.30M
    if (!tmp)
55
0
      return false;
56
57
1.30M
    ss->str = tmp;
58
1.30M
    ss->cap = new_size;
59
1.30M
  }
60
61
13.5M
  ss->len += vsnprintf(ss->str + ss->len, ss->cap, fmt, va);
62
63
13.5M
  return true;
64
13.5M
}
65
66
SIMPLE_STR* sstr_new(const char* s)
67
824k
{
68
824k
  SIMPLE_STR* ss = yr_calloc(1, sizeof(SIMPLE_STR));
69
824k
  if (!ss)
70
0
    return NULL;
71
72
824k
  if (s)
73
0
  {
74
0
    uint32_t slen = strlen(s);
75
0
    ss->str = yr_malloc(slen + 1);
76
0
    if (!ss->str)
77
0
    {
78
0
      yr_free(ss);
79
0
      return NULL;
80
0
    }
81
0
    ss->len = slen;
82
0
    ss->cap = slen;
83
0
    memcpy(ss->str, s, slen + 1);
84
0
  }
85
86
824k
  return ss;
87
824k
}
88
89
SIMPLE_STR* sstr_newf(const char* fmt, ...)
90
236k
{
91
236k
  SIMPLE_STR* ss = sstr_new(NULL);
92
236k
  if (!ss)
93
0
    return NULL;
94
95
236k
  va_list va;
96
236k
  va_start(va, fmt);
97
236k
  bool ret = sstr_vappendf(ss, fmt, va);
98
236k
  va_end(va);
99
100
236k
  if (ret)
101
236k
    return ss;
102
103
0
  sstr_free(ss);
104
105
0
  return NULL;
106
236k
}
107
108
void sstr_free(SIMPLE_STR* ss)
109
824k
{
110
824k
  if (ss)
111
824k
  {
112
824k
    yr_free(ss->str);
113
824k
    yr_free(ss);
114
824k
  }
115
824k
}
116
117
bool sstr_appendf(SIMPLE_STR* ss, const char* fmt, ...)
118
13.3M
{
119
13.3M
  va_list vlist;
120
13.3M
  va_start(vlist, fmt);
121
13.3M
  bool ret = sstr_vappendf(ss, fmt, vlist);
122
13.3M
  va_end(vlist);
123
124
13.3M
  return ret;
125
13.3M
}
126
127
char* sstr_move(SIMPLE_STR* ss)
128
824k
{
129
824k
  char* ret = ss->str;
130
824k
  ss->str = NULL;
131
824k
  ss->len = 0;
132
824k
  ss->cap = 0;
133
134
824k
  return ret;
135
824k
}