This file is indexed.

/usr/include/KF5/kjs/operations.h is in libkf5kjs-dev 5.18.0-0ubuntu1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
/*
 *  This file is part of the KDE libraries
 *  Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
 *
 *  This library is free software; you can redistribute it and/or
 *  modify it under the terms of the GNU Library General Public
 *  License as published by the Free Software Foundation; either
 *  version 2 of the License, or (at your option) any later version.
 *
 *  This library is distributed in the hope that it will be useful,
 *  but WITHOUT ANY WARRANTY; without even the implied warranty of
 *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 *  Library General Public License for more details.
 *
 *  You should have received a copy of the GNU Library General Public License
 *  along with this library; see the file COPYING.LIB.  If not, write to
 *  the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
 *  Boston, MA 02110-1301, USA.
 *
 */

#ifndef _KJS_OPERATIONS_H_
#define _KJS_OPERATIONS_H_

#include "global.h"
#include <math.h>
#include <cmath>
#include <stdio.h>
#include <wtf/MathExtras.h>

#if HAVE(IEEEFP_H)
#   if HAVE(FUNC_ISINF) || HAVE(FUNC_FINITE)
#       include <ieeefp.h>
#   endif
#endif

#if HAVE(FLOAT_H)
#   include <float.h>
#endif

namespace KJS
{

class ExecState;
class JSValue;

enum Operator { OpEqual,
                OpEqEq,
                OpPlus,
                OpMinus,
                OpMult,
                OpDiv,
                OpMod,
                OpNotEq,
                OpStrEq,
                OpStrNEq,
                OpPlusEq,
                OpMinusEq,
                OpMultEq,
                OpDivEq,
                OpPlusPlus,
                OpMinusMinus,
                OpLess,
                OpLessEq,
                OpGreater,
                OpGreaterEq,
                OpAndEq,
                OpXOrEq,
                OpOrEq,
                OpModEq,
                OpAnd,
                OpOr,
                OpBitAnd,
                OpBitXOr,
                OpBitOr,
                OpLShift,
                OpRShift,
                OpURShift,
                OpIn,
                OpInstanceOf
              };

inline bool isNaN(double d);
inline bool isFinite(double d);
inline bool isInf(double d);
inline double signBit(double d);
inline bool isPosInf(double d);
inline bool isNegInf(double d);

inline int clz32(unsigned int d)
{
#if HAVE(FUNC_BUILTIN_CLZ)
    //NOTE: __builtin_clz(0); is undefined
    //buschinski: and returns 1 for me, for whatever reason
    if (d == 0)
        return 32;
    return __builtin_clz(d);
#else
    int count = 0;
    while (d != 0)
    {
        ++count;
        d >>= 1;
    }
    return 32 - count;
#endif
}

inline bool isNaN(double d)
{
#if HAVE(FUNC_STD_ISNAN)
    return std::isnan(d);
#elif HAVE(FUNC_ISNAN)
    return isnan(d) != 0;
#elif HAVE(FLOAT_H)
    return _isnan(d) != 0;
#else
    return !(d == d);
#endif
}

inline bool isFinite(double d)
{
#if HAVE(FUNC_STD_ISFINITE)
    return std::isfinite(d) != 0;
#elif HAVE(FUNC_FINITE)
    return finite(d) != 0;
#elif HAVE(FUNC__FINITE)
    return _finite(d) != 0;
#else
    return !isNaN(d) && !isInf(d);
#endif
}

inline bool isInf(double d)
{
#if HAVE(FUNC_STD_ISINF)
    return std::isinf(d);
#elif HAVE(FUNC_ISINF)
    return isinf(d);
#elif HAVE(FUNC_FINITE)
    return finite(d) == 0 && d == d;
#elif HAVE(FUNC__FINITE)
    return _finite(d) == 0 && d == d;
#elif HAVE(FUNC__FPCLASS)
    int fpClass = _fpclass(d);
    return _FPCLASS_PINF == fpClass || _FPCLASS_NINF == fpClass;
#else
# error "Your platform does not provide a Infinity checking function."
    return false;
#endif
}

inline double signBit(double d)
{
#if HAVE(FUNC_STD_SIGNBIT)
    return std::signbit(d);
#elif HAVE(FUNC_SIGNBIT)
    return signbit(d);
#elif HAVE(FUNC___SIGNBIT)
    return __signbit(d);
#elif HAVE(FUNC__COPYSIGN)
    return _copysign(1.0, d) < 0 ? 1.0 : 0.0;
#elif HAVE(FUNC_COPYSIGN)
    return copysign(1.0, d) < 0 ? 1.0 : 0.0;
#else
# error "Your platform does not provide a signbit/copysign function."
    return false;
#endif
}

inline bool isPosInf(double d)
{
#if HAVE(FPCLASS)
    return _FPCLASS_PINF == _fpclass(d);
#else
    return isInf(d) && !signBit(d);
#endif
}

inline bool isNegInf(double d)
{
#if HAVE(FUNC_FPCLASS)
    return _FPCLASS_PINF == _fpclass(d);
#else
    return isInf(d) && signBit(d);
#endif
}

bool equal(ExecState *exec, JSValue *v1, JSValue *v2);
bool strictEqual(ExecState *exec, JSValue *v1, JSValue *v2);
// Same as strictEqual, except for "-0" and "0" difference.
// Used in PropertyDescriptor::equalTo and Object::defineOwnProperty to check
// if the value changed and we need to update.
bool sameValue(ExecState *exec, JSValue *v1, JSValue *v2);
/**
 * This operator performs an abstract relational comparison of the two
 * arguments that can be of arbitrary type. If possible, conversions to the
 * string or number type will take place before the comparison.
 *
 * @return 1 if v1 is "less-than" v2, 0 if the relation is "greater-than-or-
 * equal". -1 if the result is undefined.
 */
int relation(ExecState *exec, JSValue *v1, JSValue *v2, bool leftFirst = true);
int relation(ExecState *exec, JSValue *v1, double n2);
int maxInt(int d1, int d2);
int minInt(int d1, int d2);

}

#endif