Coverage Report

Created: 2025-07-23 08:18

/src/jasper/src/libjasper/jpc/jpc_util.c
Line
Count
Source (jump to first uncovered line)
1
/*
2
 * Copyright (c) 1999-2000 Image Power, Inc. and the University of
3
 *   British Columbia.
4
 * Copyright (c) 2001-2003 Michael David Adams.
5
 * All rights reserved.
6
 */
7
8
/* __START_OF_JASPER_LICENSE__
9
 * 
10
 * JasPer License Version 2.0
11
 * 
12
 * Copyright (c) 2001-2006 Michael David Adams
13
 * Copyright (c) 1999-2000 Image Power, Inc.
14
 * Copyright (c) 1999-2000 The University of British Columbia
15
 * 
16
 * All rights reserved.
17
 * 
18
 * Permission is hereby granted, free of charge, to any person (the
19
 * "User") obtaining a copy of this software and associated documentation
20
 * files (the "Software"), to deal in the Software without restriction,
21
 * including without limitation the rights to use, copy, modify, merge,
22
 * publish, distribute, and/or sell copies of the Software, and to permit
23
 * persons to whom the Software is furnished to do so, subject to the
24
 * following conditions:
25
 * 
26
 * 1.  The above copyright notices and this permission notice (which
27
 * includes the disclaimer below) shall be included in all copies or
28
 * substantial portions of the Software.
29
 * 
30
 * 2.  The name of a copyright holder shall not be used to endorse or
31
 * promote products derived from the Software without specific prior
32
 * written permission.
33
 * 
34
 * THIS DISCLAIMER OF WARRANTY CONSTITUTES AN ESSENTIAL PART OF THIS
35
 * LICENSE.  NO USE OF THE SOFTWARE IS AUTHORIZED HEREUNDER EXCEPT UNDER
36
 * THIS DISCLAIMER.  THE SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS
37
 * "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
38
 * BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
39
 * PARTICULAR PURPOSE AND NONINFRINGEMENT OF THIRD PARTY RIGHTS.  IN NO
40
 * EVENT SHALL THE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, OR ANY SPECIAL
41
 * INDIRECT OR CONSEQUENTIAL DAMAGES, OR ANY DAMAGES WHATSOEVER RESULTING
42
 * FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT,
43
 * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
44
 * WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.  NO ASSURANCES ARE
45
 * PROVIDED BY THE COPYRIGHT HOLDERS THAT THE SOFTWARE DOES NOT INFRINGE
46
 * THE PATENT OR OTHER INTELLECTUAL PROPERTY RIGHTS OF ANY OTHER ENTITY.
47
 * EACH COPYRIGHT HOLDER DISCLAIMS ANY LIABILITY TO THE USER FOR CLAIMS
48
 * BROUGHT BY ANY OTHER ENTITY BASED ON INFRINGEMENT OF INTELLECTUAL
49
 * PROPERTY RIGHTS OR OTHERWISE.  AS A CONDITION TO EXERCISING THE RIGHTS
50
 * GRANTED HEREUNDER, EACH USER HEREBY ASSUMES SOLE RESPONSIBILITY TO SECURE
51
 * ANY OTHER INTELLECTUAL PROPERTY RIGHTS NEEDED, IF ANY.  THE SOFTWARE
52
 * IS NOT FAULT-TOLERANT AND IS NOT INTENDED FOR USE IN MISSION-CRITICAL
53
 * SYSTEMS, SUCH AS THOSE USED IN THE OPERATION OF NUCLEAR FACILITIES,
54
 * AIRCRAFT NAVIGATION OR COMMUNICATION SYSTEMS, AIR TRAFFIC CONTROL
55
 * SYSTEMS, DIRECT LIFE SUPPORT MACHINES, OR WEAPONS SYSTEMS, IN WHICH
56
 * THE FAILURE OF THE SOFTWARE OR SYSTEM COULD LEAD DIRECTLY TO DEATH,
57
 * PERSONAL INJURY, OR SEVERE PHYSICAL OR ENVIRONMENTAL DAMAGE ("HIGH
58
 * RISK ACTIVITIES").  THE COPYRIGHT HOLDERS SPECIFICALLY DISCLAIM ANY
59
 * EXPRESS OR IMPLIED WARRANTY OF FITNESS FOR HIGH RISK ACTIVITIES.
60
 * 
61
 * __END_OF_JASPER_LICENSE__
62
 */
63
64
/*
65
 * $Id$
66
 */
67
68
/******************************************************************************\
69
* Includes
70
\******************************************************************************/
71
72
#include "jpc_util.h"
73
#include "jpc_fix.h"
74
75
#include "jasper/jas_math.h"
76
#include "jasper/jas_malloc.h"
77
#include "jasper/jas_string.h"
78
79
#include <assert.h>
80
#include <string.h>
81
#include <math.h>
82
#include <stdlib.h>
83
84
/******************************************************************************\
85
* Miscellaneous Functions
86
\******************************************************************************/
87
88
int jpc_atoaf(const char *s, int *numvalues, double **values)
89
0
{
90
0
  static const char delim[] = ", \t\n";
91
0
  char buf[4096];
92
0
  int n;
93
0
  double *vs;
94
0
  char *cp;
95
96
0
  strncpy(buf, s, sizeof(buf));
97
0
  buf[sizeof(buf) - 1] = '\0';
98
0
  n = 0;
99
0
  char* saveptr = 0;
100
0
  if ((cp = jas_strtok(buf, delim, &saveptr))) {
101
0
    ++n;
102
0
    while ((cp = jas_strtok(0, delim, &saveptr))) {
103
0
      if (*cp != '\0') {
104
0
        ++n;
105
0
      }
106
0
    }
107
0
  }
108
109
0
  if (n) {
110
0
    if (!(vs = jas_alloc2(n, sizeof(double)))) {
111
0
      return -1;
112
0
    }
113
114
0
    strncpy(buf, s, sizeof(buf));
115
0
    buf[sizeof(buf) - 1] = '\0';
116
0
    n = 0;
117
0
    saveptr = 0;
118
0
    if ((cp = jas_strtok(buf, delim, &saveptr))) {
119
0
      vs[n] = atof(cp);
120
0
      ++n;
121
0
      while ((cp = jas_strtok(0, delim, &saveptr))) {
122
0
        if (*cp != '\0') {
123
0
          vs[n] = atof(cp);
124
0
          ++n;
125
0
        }
126
0
      }
127
0
    }
128
0
  } else {
129
0
    vs = 0;
130
0
  }
131
132
0
  *numvalues = n;
133
0
  *values = vs;
134
135
0
  return 0;
136
0
}
137
138
jas_seq_t *jpc_seq_upsample(const jas_seq_t *x, int m)
139
0
{
140
0
  jas_seq_t *z;
141
0
  int i;
142
143
0
  if (!(z = jas_seq_create(jas_seq_start(x) * m, (jas_seq_end(x) - 1) * m + 1)))
144
0
    return 0;
145
0
  for (i = jas_seq_start(z); i < jas_seq_end(z); i++) {
146
0
    *jas_seq_getref(z, i) = (!JAS_MOD(i, m)) ? jas_seq_get(x, i / m) :
147
0
      jpc_inttofix(0);
148
0
  }
149
150
0
  return z;
151
0
}
152
153
jpc_fix_t jpc_seq_norm(const jas_seq_t *x)
154
0
{
155
0
  jpc_fix_t s;
156
0
  int i;
157
158
0
  s = jpc_inttofix(0);
159
0
  for (i = jas_seq_start(x); i < jas_seq_end(x); i++) {
160
0
    s = jpc_fix_add(s, jpc_fix_mul(jas_seq_get(x, i), jas_seq_get(x, i)));
161
0
  }
162
163
0
  return jpc_dbltofix(sqrt(jpc_fixtodbl(s)));
164
0
}
165
166
jas_seq_t *jpc_seq_conv(const jas_seq_t *x, const jas_seq_t *y)
167
0
{
168
0
  int i;
169
0
  int j;
170
0
  int k;
171
0
  jas_seq_t *z;
172
0
  jpc_fix_t s;
173
0
  jpc_fix_t v;
174
175
0
  z = jas_seq_create(jas_seq_start(x) + jas_seq_start(y),
176
0
         jas_seq_end(x) + jas_seq_end(y) - 1);
177
0
  if (!z)
178
0
    return NULL;
179
0
  for (i = jas_seq_start(z); i < jas_seq_end(z); i++) {
180
0
    s = jpc_inttofix(0);
181
0
    for (j = jas_seq_start(y); j < jas_seq_end(y); j++) {
182
0
      k = i - j;
183
0
      if (k < jas_seq_start(x) || k >= jas_seq_end(x)) {
184
0
        v = JPC_FIX_ZERO;
185
0
      } else {
186
0
        v = jas_seq_get(x, k);
187
0
      }
188
0
      s = jpc_fix_add(s, jpc_fix_mul(jas_seq_get(y, j), v));
189
0
    }
190
0
    *jas_seq_getref(z, i) = s;
191
0
  }
192
193
0
  return z;
194
0
}