Coverage Report

Created: 2026-03-31 07:05

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/libzip/lib/zip_add_entry.c
Line
Count
Source
1
/*
2
  zip_add_entry.c -- create and init struct zip_entry
3
  Copyright (C) 1999-2025 Dieter Baron and Thomas Klausner
4
5
  This file is part of libzip, a library to manipulate ZIP archives.
6
  The authors can be contacted at <info@libzip.org>
7
8
  Redistribution and use in source and binary forms, with or without
9
  modification, are permitted provided that the following conditions
10
  are met:
11
  1. Redistributions of source code must retain the above copyright
12
     notice, this list of conditions and the following disclaimer.
13
  2. Redistributions in binary form must reproduce the above copyright
14
     notice, this list of conditions and the following disclaimer in
15
     the documentation and/or other materials provided with the
16
     distribution.
17
  3. The names of the authors may not be used to endorse or promote
18
     products derived from this software without specific prior
19
     written permission.
20
21
  THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS
22
  OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
23
  WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24
  ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
25
  DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26
  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
27
  GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
28
  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER
29
  IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
30
  OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
31
  IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32
*/
33
34
35
#include <stdlib.h>
36
37
#include "zipint.h"
38
39
40
/* NOTE: Signed due to -1 on error.  See zip_add.c for more details. */
41
42
1.03k
zip_int64_t _zip_add_entry(zip_t *za) {
43
1.03k
    zip_uint64_t idx;
44
45
1.03k
    if (za->nentry + 1 >= za->nentry_alloc) {
46
1.03k
        zip_uint64_t additional_entries = 2 * za->nentry_alloc;
47
48
1.03k
        if (additional_entries < 16) {
49
1.03k
            additional_entries = 16;
50
1.03k
        }
51
0
        else if (additional_entries > 1024) {
52
0
            additional_entries = 1024;
53
0
        }
54
55
1.03k
        if (!ZIP_REALLOC(za->entry, za->nentry_alloc, additional_entries, &za->error)) {
56
0
            return -1;
57
0
        }
58
1.03k
    }
59
60
1.03k
    idx = za->nentry++;
61
62
1.03k
    _zip_entry_init(za->entry + idx);
63
64
1.03k
    return (zip_int64_t)idx;
65
1.03k
}