Coverage Report

Created: 2025-12-14 06:05

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/php-src/ext/uri/uriparser/src/UriCompare.c
Line
Count
Source
1
/*
2
 * uriparser - RFC 3986 URI parsing library
3
 *
4
 * Copyright (C) 2007, Weijia Song <songweijia@gmail.com>
5
 * Copyright (C) 2007, Sebastian Pipping <sebastian@pipping.org>
6
 * All rights reserved.
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
 *
12
 *     1. Redistributions  of  source  code   must  retain  the  above
13
 *        copyright notice, this list  of conditions and the following
14
 *        disclaimer.
15
 *
16
 *     2. Redistributions  in binary  form  must  reproduce the  above
17
 *        copyright notice, this list  of conditions and the following
18
 *        disclaimer  in  the  documentation  and/or  other  materials
19
 *        provided with the distribution.
20
 *
21
 *     3. Neither the  name of the  copyright holder nor the  names of
22
 *        its contributors may be used  to endorse or promote products
23
 *        derived from  this software  without specific  prior written
24
 *        permission.
25
 *
26
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
27
 * "AS IS" AND  ANY EXPRESS OR IMPLIED WARRANTIES,  INCLUDING, BUT NOT
28
 * LIMITED TO,  THE IMPLIED WARRANTIES OF  MERCHANTABILITY AND FITNESS
29
 * FOR  A  PARTICULAR  PURPOSE  ARE  DISCLAIMED.  IN  NO  EVENT  SHALL
30
 * THE  COPYRIGHT HOLDER  OR CONTRIBUTORS  BE LIABLE  FOR ANY  DIRECT,
31
 * INDIRECT, INCIDENTAL, SPECIAL,  EXEMPLARY, OR CONSEQUENTIAL DAMAGES
32
 * (INCLUDING, BUT NOT LIMITED TO,  PROCUREMENT OF SUBSTITUTE GOODS OR
33
 * SERVICES; LOSS OF USE, DATA,  OR PROFITS; OR BUSINESS INTERRUPTION)
34
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
35
 * STRICT  LIABILITY,  OR  TORT (INCLUDING  NEGLIGENCE  OR  OTHERWISE)
36
 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
37
 * OF THE POSSIBILITY OF SUCH DAMAGE.
38
 */
39
40
/* What encodings are enabled? */
41
#include <uriparser/UriDefsConfig.h>
42
#if (!defined(URI_PASS_ANSI) && !defined(URI_PASS_UNICODE))
43
/* Include SELF twice */
44
#  ifdef URI_ENABLE_ANSI
45
#    define URI_PASS_ANSI 1
46
#    include "UriCompare.c"
47
#    undef URI_PASS_ANSI
48
#  endif
49
#  ifdef URI_ENABLE_UNICODE
50
#    define URI_PASS_UNICODE 1
51
#    include "UriCompare.c"
52
#    undef URI_PASS_UNICODE
53
#  endif
54
#else
55
#  ifdef URI_PASS_ANSI
56
#    include <uriparser/UriDefsAnsi.h>
57
#  else
58
#    include <uriparser/UriDefsUnicode.h>
59
#    include <wchar.h>
60
#  endif
61
62
#  ifndef URI_DOXYGEN
63
#    include <uriparser/Uri.h>
64
#    include <uriparser/UriIp4.h>
65
#    include "UriCommon.h"
66
#  endif
67
68
0
UriBool URI_FUNC(EqualsUri)(const URI_TYPE(Uri) * a, const URI_TYPE(Uri) * b) {
69
    /* NOTE: Both NULL means equal! */
70
0
    if ((a == NULL) || (b == NULL)) {
71
0
        return ((a == NULL) && (b == NULL)) ? URI_TRUE : URI_FALSE;
72
0
    }
73
74
    /* scheme */
75
0
    if (URI_FUNC(CompareRange)(&(a->scheme), &(b->scheme))) {
76
0
        return URI_FALSE;
77
0
    }
78
79
    /* absolutePath */
80
0
    if ((a->scheme.first == NULL) && (a->absolutePath != b->absolutePath)) {
81
0
        return URI_FALSE;
82
0
    }
83
84
    /* userInfo */
85
0
    if (URI_FUNC(CompareRange)(&(a->userInfo), &(b->userInfo))) {
86
0
        return URI_FALSE;
87
0
    }
88
89
    /* Host */
90
0
    if (((a->hostData.ip4 == NULL) != (b->hostData.ip4 == NULL))
91
0
        || ((a->hostData.ip6 == NULL) != (b->hostData.ip6 == NULL))
92
0
        || ((a->hostData.ipFuture.first == NULL)
93
0
            != (b->hostData.ipFuture.first == NULL))) {
94
0
        return URI_FALSE;
95
0
    }
96
97
0
    if (a->hostData.ip4 != NULL) {
98
0
        if (memcmp(a->hostData.ip4->data, b->hostData.ip4->data, 4)) {
99
0
            return URI_FALSE;
100
0
        }
101
0
    }
102
103
0
    if (a->hostData.ip6 != NULL) {
104
0
        if (memcmp(a->hostData.ip6->data, b->hostData.ip6->data, 16)) {
105
0
            return URI_FALSE;
106
0
        }
107
0
    }
108
109
0
    if (a->hostData.ipFuture.first != NULL) {
110
0
        if (URI_FUNC(CompareRange)(&(a->hostData.ipFuture), &(b->hostData.ipFuture))) {
111
0
            return URI_FALSE;
112
0
        }
113
0
    }
114
115
0
    if ((a->hostData.ip4 == NULL) && (a->hostData.ip6 == NULL)
116
0
        && (a->hostData.ipFuture.first == NULL)) {
117
0
        if (URI_FUNC(CompareRange)(&(a->hostText), &(b->hostText))) {
118
0
            return URI_FALSE;
119
0
        }
120
0
    }
121
122
    /* portText */
123
0
    if (URI_FUNC(CompareRange)(&(a->portText), &(b->portText))) {
124
0
        return URI_FALSE;
125
0
    }
126
127
    /* Path */
128
0
    if ((a->pathHead == NULL) != (b->pathHead == NULL)) {
129
0
        return URI_FALSE;
130
0
    }
131
132
0
    if (a->pathHead != NULL) {
133
0
        URI_TYPE(PathSegment) * walkA = a->pathHead;
134
0
        URI_TYPE(PathSegment) * walkB = b->pathHead;
135
0
        do {
136
0
            if (URI_FUNC(CompareRange)(&(walkA->text), &(walkB->text))) {
137
0
                return URI_FALSE;
138
0
            }
139
0
            if ((walkA->next == NULL) != (walkB->next == NULL)) {
140
0
                return URI_FALSE;
141
0
            }
142
0
            walkA = walkA->next;
143
0
            walkB = walkB->next;
144
0
        } while (walkA != NULL);
145
0
    }
146
147
    /* query */
148
0
    if (URI_FUNC(CompareRange)(&(a->query), &(b->query))) {
149
0
        return URI_FALSE;
150
0
    }
151
152
    /* fragment */
153
0
    if (URI_FUNC(CompareRange)(&(a->fragment), &(b->fragment))) {
154
0
        return URI_FALSE;
155
0
    }
156
157
0
    return URI_TRUE; /* Equal*/
158
0
}
Unexecuted instantiation: uriEqualsUriA
Unexecuted instantiation: uriEqualsUriW
159
160
#endif