Flawfinder version 2.0.10, (C) 2001-2019 David A. Wheeler.
Number of rules (primarily dangerous function names) in C/C++ ruleset: 223
Examining data/cln-1.3.6/autoconf/floatparam.c
Examining data/cln-1.3.6/autoconf/intparam.c
Examining data/cln-1.3.6/include/cln/SV_real.h
Examining data/cln-1.3.6/include/cln/GV_integer.h
Examining data/cln-1.3.6/include/cln/floatformat.h
Examining data/cln-1.3.6/include/cln/lfloat.h
Examining data/cln-1.3.6/include/cln/null_ring.h
Examining data/cln-1.3.6/include/cln/io.h
Examining data/cln-1.3.6/include/cln/ring.h
Examining data/cln-1.3.6/include/cln/V.h
Examining data/cln-1.3.6/include/cln/GV.h
Examining data/cln-1.3.6/include/cln/GV_number.h
Examining data/cln-1.3.6/include/cln/complex_io.h
Examining data/cln-1.3.6/include/cln/condition.h
Examining data/cln-1.3.6/include/cln/integer_ring.h
Examining data/cln-1.3.6/include/cln/dfloat_io.h
Examining data/cln-1.3.6/include/cln/random.h
Examining data/cln-1.3.6/include/cln/SV_ringelt.h
Examining data/cln-1.3.6/include/cln/ffloat_io.h
Examining data/cln-1.3.6/include/cln/float_class.h
Examining data/cln-1.3.6/include/cln/cln.h
Examining data/cln-1.3.6/include/cln/ffloat_class.h
Examining data/cln-1.3.6/include/cln/float.h
Examining data/cln-1.3.6/include/cln/string.h
Examining data/cln-1.3.6/include/cln/lfloat_io.h
Examining data/cln-1.3.6/include/cln/malloc.h
Examining data/cln-1.3.6/include/cln/lfloat_class.h
Examining data/cln-1.3.6/include/cln/number_io.h
Examining data/cln-1.3.6/include/cln/numtheory.h
Examining data/cln-1.3.6/include/cln/object.h
Examining data/cln-1.3.6/include/cln/proplist.h
Examining data/cln-1.3.6/include/cln/univpoly_rational.h
Examining data/cln-1.3.6/include/cln/univpoly_real.h
Examining data/cln-1.3.6/include/cln/output.h
Examining data/cln-1.3.6/include/cln/real_io.h
Examining data/cln-1.3.6/include/cln/ffloat.h
Examining data/cln-1.3.6/include/cln/sfloat_io.h
Examining data/cln-1.3.6/include/cln/timing.h
Examining data/cln-1.3.6/include/cln/SV_number.h
Examining data/cln-1.3.6/include/cln/complex_ring.h
Examining data/cln-1.3.6/include/cln/univpoly_complex.h
Examining data/cln-1.3.6/include/cln/version.h
Examining data/cln-1.3.6/include/cln/rational.h
Examining data/cln-1.3.6/include/cln/rational_class.h
Examining data/cln-1.3.6/include/cln/rational_io.h
Examining data/cln-1.3.6/include/cln/types.h
Examining data/cln-1.3.6/include/cln/univpoly_modint.h
Examining data/cln-1.3.6/include/cln/modinteger.h
Examining data/cln-1.3.6/include/cln/rational_ring.h
Examining data/cln-1.3.6/include/cln/univpoly_integer.h
Examining data/cln-1.3.6/include/cln/number.h
Examining data/cln-1.3.6/include/cln/GV_complex.h
Examining data/cln-1.3.6/include/cln/GV_modinteger.h
Examining data/cln-1.3.6/include/cln/GV_real.h
Examining data/cln-1.3.6/include/cln/SV_complex.h
Examining data/cln-1.3.6/include/cln/SV_integer.h
Examining data/cln-1.3.6/include/cln/complex.h
Examining data/cln-1.3.6/include/cln/exception.h
Examining data/cln-1.3.6/include/cln/univpoly.h
Examining data/cln-1.3.6/include/cln/SV_rational.h
Examining data/cln-1.3.6/include/cln/complex_class.h
Examining data/cln-1.3.6/include/cln/real.h
Examining data/cln-1.3.6/include/cln/symbol.h
Examining data/cln-1.3.6/include/cln/dfloat_class.h
Examining data/cln-1.3.6/include/cln/modules.h
Examining data/cln-1.3.6/include/cln/real_ring.h
Examining data/cln-1.3.6/include/cln/float_io.h
Examining data/cln-1.3.6/include/cln/GV_rational.h
Examining data/cln-1.3.6/include/cln/input.h
Examining data/cln-1.3.6/include/cln/integer_class.h
Examining data/cln-1.3.6/include/cln/integer_io.h
Examining data/cln-1.3.6/include/cln/real_class.h
Examining data/cln-1.3.6/include/cln/sfloat.h
Examining data/cln-1.3.6/include/cln/sfloat_class.h
Examining data/cln-1.3.6/include/cln/dfloat.h
Examining data/cln-1.3.6/include/cln/SV.h
Examining data/cln-1.3.6/include/cln/integer.h
Examining data/cln-1.3.6/src/base/digit/cl_2D.h
Examining data/cln-1.3.6/src/base/digit/cl_2D_div.cc
Examining data/cln-1.3.6/src/base/digit/cl_2D_exptpos.cc
Examining data/cln-1.3.6/src/base/digit/cl_D.h
Examining data/cln-1.3.6/src/base/digitseq/cl_2DS.h
Examining data/cln-1.3.6/src/base/digitseq/cl_2DS_div.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_2DS_recip.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_div.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_endian.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftc.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftcs.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftm.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftp.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftp3.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftp3m.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_fftr.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_kara.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_kara_sqr.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_mul_nuss.h
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_random.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_recip.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_recipsqrt.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_sqrt.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_DS_trandom.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_arm.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_arm_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_hppa.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_hppa_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_i386.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_i386_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_m68k.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_m68k_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_mips.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_mips_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_mipsel_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_sparc.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_sparc64.h
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_sparc64_.cc
Examining data/cln-1.3.6/src/base/digitseq/cl_asm_sparc_.cc
Examining data/cln-1.3.6/src/base/hash/cl_hash.h
Examining data/cln-1.3.6/src/base/hash/cl_hash1.h
Examining data/cln-1.3.6/src/base/hash/cl_hash1weak.h
Examining data/cln-1.3.6/src/base/hash/cl_hash2.h
Examining data/cln-1.3.6/src/base/hash/cl_hash2weak.h
Examining data/cln-1.3.6/src/base/hash/cl_hashset.h
Examining data/cln-1.3.6/src/base/hash/cl_hashuniq.h
Examining data/cln-1.3.6/src/base/hash/cl_hashuniqweak.h
Examining data/cln-1.3.6/src/base/hash/cl_rcpointer2_hashweak_rcpointer.cc
Examining data/cln-1.3.6/src/base/hash/cl_rcpointer2_hashweak_rcpointer.h
Examining data/cln-1.3.6/src/base/hash/cl_rcpointer_hashweak_rcpointer.cc
Examining data/cln-1.3.6/src/base/hash/cl_rcpointer_hashweak_rcpointer.h
Examining data/cln-1.3.6/src/base/input/cl_read_bad_syntax_exception.cc
Examining data/cln-1.3.6/src/base/input/cl_read_eof_exception.cc
Examining data/cln-1.3.6/src/base/input/cl_read_junk_exception.cc
Examining data/cln-1.3.6/src/base/low/cl_low_div.cc
Examining data/cln-1.3.6/src/base/low/cl_low_isqrt.cc
Examining data/cln-1.3.6/src/base/low/cl_low_isqrt2.cc
Examining data/cln-1.3.6/src/base/low/cl_low_mul.cc
Examining data/cln-1.3.6/src/base/output/cl_output_dec.cc
Examining data/cln-1.3.6/src/base/output/cl_output_hex.cc
Examining data/cln-1.3.6/src/base/output/cl_prin_globals.cc
Examining data/cln-1.3.6/src/base/proplist/cl_pl_add.cc
Examining data/cln-1.3.6/src/base/proplist/cl_pl_d.cc
Examining data/cln-1.3.6/src/base/proplist/cl_pl_get.cc
Examining data/cln-1.3.6/src/base/random/cl_UL_random.cc
Examining data/cln-1.3.6/src/base/random/cl_random_def.cc
Examining data/cln-1.3.6/src/base/random/cl_random_from.cc
Examining data/cln-1.3.6/src/base/random/cl_random_impl.h
Examining data/cln-1.3.6/src/base/ring/cl_no_ring.cc
Examining data/cln-1.3.6/src/base/ring/cl_ring_debug.cc
Examining data/cln-1.3.6/src/base/string/input/cl_st_get1.cc
Examining data/cln-1.3.6/src/base/string/input/cl_st_get2.cc
Examining data/cln-1.3.6/src/base/string/input/cl_st_getline1.cc
Examining data/cln-1.3.6/src/base/string/input/cl_st_getline2.cc
Examining data/cln-1.3.6/src/base/string/input/cl_st_gettoken.cc
Examining data/cln-1.3.6/src/base/string/misc/cl_st_class.cc
Examining data/cln-1.3.6/src/base/string/output/cl_st_print.cc
Examining data/cln-1.3.6/src/base/string/cl_spushstring.h
Examining data/cln-1.3.6/src/base/string/cl_spushstring_append.cc
Examining data/cln-1.3.6/src/base/string/cl_spushstring_push.cc
Examining data/cln-1.3.6/src/base/string/cl_sstring.cc
Examining data/cln-1.3.6/src/base/string/cl_sstring.h
Examining data/cln-1.3.6/src/base/string/cl_st_c2.cc
Examining data/cln-1.3.6/src/base/string/cl_st_concat1.cc
Examining data/cln-1.3.6/src/base/string/cl_st_concat2.cc
Examining data/cln-1.3.6/src/base/string/cl_st_concat3.cc
Examining data/cln-1.3.6/src/base/string/cl_st_debug.cc
Examining data/cln-1.3.6/src/base/string/cl_st_hashcode.cc
Examining data/cln-1.3.6/src/base/string/cl_st_make0.cc
Examining data/cln-1.3.6/src/base/string/cl_st_make0.h
Examining data/cln-1.3.6/src/base/string/cl_st_make1.cc
Examining data/cln-1.3.6/src/base/string/cl_st_make2.cc
Examining data/cln-1.3.6/src/base/symbol/cl_sy_hashcode.cc
Examining data/cln-1.3.6/src/base/symbol/cl_symbol.cc
Examining data/cln-1.3.6/src/base/cl_N.h
Examining data/cln-1.3.6/src/base/cl_alloca.cc
Examining data/cln-1.3.6/src/base/cl_alloca.h
Examining data/cln-1.3.6/src/base/cl_as_exception.cc
Examining data/cln-1.3.6/src/base/cl_condition.cc
Examining data/cln-1.3.6/src/base/cl_d0_exception.cc
Examining data/cln-1.3.6/src/base/cl_debug.cc
Examining data/cln-1.3.6/src/base/cl_debugout.cc
Examining data/cln-1.3.6/src/base/cl_free.cc
Examining data/cln-1.3.6/src/base/cl_immclasses.cc
Examining data/cln-1.3.6/src/base/cl_inline.h
Examining data/cln-1.3.6/src/base/cl_inline2.h
Examining data/cln-1.3.6/src/base/cl_iterator.h
Examining data/cln-1.3.6/src/base/cl_low.h
Examining data/cln-1.3.6/src/base/cl_macros.h
Examining data/cln-1.3.6/src/base/cl_malloc.cc
Examining data/cln-1.3.6/src/base/cl_maybe_inline.h
Examining data/cln-1.3.6/src/base/cl_notreached_exception.cc
Examining data/cln-1.3.6/src/base/cl_offsetof.h
Examining data/cln-1.3.6/src/base/cl_sysdep.h
Examining data/cln-1.3.6/src/base/cl_version.cc
Examining data/cln-1.3.6/src/base/cl_xmacros.h
Examining data/cln-1.3.6/src/timing/cl_t_c1.cc
Examining data/cln-1.3.6/src/timing/cl_t_c2.cc
Examining data/cln-1.3.6/src/timing/cl_t_current.cc
Examining data/cln-1.3.6/src/timing/cl_t_current2.cc
Examining data/cln-1.3.6/src/timing/cl_t_d.cc
Examining data/cln-1.3.6/src/timing/cl_t_dec.cc
Examining data/cln-1.3.6/src/timing/cl_t_inc.cc
Examining data/cln-1.3.6/src/timing/cl_t_minus.cc
Examining data/cln-1.3.6/src/timing/cl_t_report.cc
Examining data/cln-1.3.6/src/timing/cl_t_td_minus.cc
Examining data/cln-1.3.6/src/timing/cl_t_td_plus.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_C_abs.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_C_abs_aux.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_C_signum.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_C_sqrt.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_DF_hypot.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_FF_hypot.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_LF_hypot.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_R_hypot.cc
Examining data/cln-1.3.6/src/complex/algebraic/cl_SF_hypot.cc
Examining data/cln-1.3.6/src/complex/elem/division/cl_C_DF_recip.cc
Examining data/cln-1.3.6/src/complex/elem/division/cl_C_FF_recip.cc
Examining data/cln-1.3.6/src/complex/elem/division/cl_C_LF_recip.cc
Examining data/cln-1.3.6/src/complex/elem/division/cl_C_SF_recip.cc
Examining data/cln-1.3.6/src/complex/elem/division/cl_C_div.cc
Examining data/cln-1.3.6/src/complex/elem/division/cl_C_recip.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_equal.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_from_R_R_complex.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_from_R_R_complex1.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_imagpart.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_minus.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_minus1.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_mul.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_plus.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_plus1.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_realpart.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_square.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_uminus.cc
Examining data/cln-1.3.6/src/complex/elem/cl_C_zerop.cc
Examining data/cln-1.3.6/src/complex/input/cl_N_from_string.cc
Examining data/cln-1.3.6/src/complex/input/cl_N_read.cc
Examining data/cln-1.3.6/src/complex/input/cl_N_read_stream.cc
Examining data/cln-1.3.6/src/complex/misc/cl_C_class.cc
Examining data/cln-1.3.6/src/complex/misc/cl_C_conjugate.cc
Examining data/cln-1.3.6/src/complex/misc/cl_C_debug.cc
Examining data/cln-1.3.6/src/complex/misc/cl_C_eqhashcode.cc
Examining data/cln-1.3.6/src/complex/misc/cl_C_expt.cc
Examining data/cln-1.3.6/src/complex/misc/cl_C_expt_I.cc
Examining data/cln-1.3.6/src/complex/misc/cl_N_as.cc
Examining data/cln-1.3.6/src/complex/output/cl_N_aprint.cc
Examining data/cln-1.3.6/src/complex/output/cl_N_bprint.cc
Examining data/cln-1.3.6/src/complex/ring/cl_C_ring.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_acos.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_acosh.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_asin.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_asinh.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_asinh_aux.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_atan.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_atanh.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_atanh_aux.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_cis.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_cos.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_cosh.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_exp.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_expt_C.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_log.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_log2.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_phase.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_sin.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_sinh.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_tan.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_C_tanh.cc
Examining data/cln-1.3.6/src/complex/transcendental/cl_R_cis.cc
Examining data/cln-1.3.6/src/complex/cl_C.h
Examining data/cln-1.3.6/src/float/algebraic/cl_F_sqrt.cc
Examining data/cln-1.3.6/src/float/base/cl_F_globals.cc
Examining data/cln-1.3.6/src/float/base/cl_F_nan_exception.cc
Examining data/cln-1.3.6/src/float/base/cl_F_overflow_exception.cc
Examining data/cln-1.3.6/src/float/base/cl_F_underflow_exception.cc
Examining data/cln-1.3.6/src/float/conv/cl_DF_to_FF.cc
Examining data/cln-1.3.6/src/float/conv/cl_DF_to_LF.cc
Examining data/cln-1.3.6/src/float/conv/cl_DF_to_SF.cc
Examining data/cln-1.3.6/src/float/conv/cl_DF_to_double.cc
Examining data/cln-1.3.6/src/float/conv/cl_DF_to_float.cc
Examining data/cln-1.3.6/src/float/conv/cl_FF_to_DF.cc
Examining data/cln-1.3.6/src/float/conv/cl_FF_to_LF.cc
Examining data/cln-1.3.6/src/float/conv/cl_FF_to_SF.cc
Examining data/cln-1.3.6/src/float/conv/cl_FF_to_double.cc
Examining data/cln-1.3.6/src/float/conv/cl_FF_to_float.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_F.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_F_f.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_I.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_I_def.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_I_f.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_RA.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_RA_def.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_from_RA_f.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_to_DF.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_to_FF.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_to_LF.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_to_SF.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_to_double.cc
Examining data/cln-1.3.6/src/float/conv/cl_F_to_float.cc
Examining data/cln-1.3.6/src/float/conv/cl_LF_to_DF.cc
Examining data/cln-1.3.6/src/float/conv/cl_LF_to_FF.cc
Examining data/cln-1.3.6/src/float/conv/cl_LF_to_SF.cc
Examining data/cln-1.3.6/src/float/conv/cl_LF_to_double.cc
Examining data/cln-1.3.6/src/float/conv/cl_LF_to_float.cc
Examining data/cln-1.3.6/src/float/conv/cl_SF_to_DF.cc
Examining data/cln-1.3.6/src/float/conv/cl_SF_to_FF.cc
Examining data/cln-1.3.6/src/float/conv/cl_SF_to_LF.cc
Examining data/cln-1.3.6/src/float/conv/cl_SF_to_double.cc
Examining data/cln-1.3.6/src/float/conv/cl_SF_to_float.cc
Examining data/cln-1.3.6/src/float/dfloat/algebraic/cl_DF_sqrt.cc
Examining data/cln-1.3.6/src/float/dfloat/conv/cl_DF_from_double.cc
Examining data/cln-1.3.6/src/float/dfloat/conv/cl_DF_to_doublej.cc
Examining data/cln-1.3.6/src/float/dfloat/conv/cl_I_to_double.cc
Examining data/cln-1.3.6/src/float/dfloat/conv/cl_RA_to_double.cc
Examining data/cln-1.3.6/src/float/dfloat/division/cl_DF_ceil22.cc
Examining data/cln-1.3.6/src/float/dfloat/division/cl_DF_fceil.cc
Examining data/cln-1.3.6/src/float/dfloat/division/cl_DF_floor22.cc
Examining data/cln-1.3.6/src/float/dfloat/division/cl_DF_recip.cc
Examining data/cln-1.3.6/src/float/dfloat/division/cl_DF_round22.cc
Examining data/cln-1.3.6/src/float/dfloat/division/cl_DF_trunc22.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_compare.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_div.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_ffloor.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_from_I.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_from_RA.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_fround.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_ftrunc.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_futrunc.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_globals.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_minus.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_minusp.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_mul.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_plus.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_plusp.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_scale.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_scale_I.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_to_I.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_uminus.cc
Examining data/cln-1.3.6/src/float/dfloat/elem/cl_DF_zerop.cc
Examining data/cln-1.3.6/src/float/dfloat/input/cl_DF_from_string.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_abs.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_as.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_class.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_debug.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_decode.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_digits.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_eqhashcode.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_exponent.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_idecode.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_max.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_min.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_precision.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_sign.cc
Examining data/cln-1.3.6/src/float/dfloat/misc/cl_DF_signum.cc
Examining data/cln-1.3.6/src/float/dfloat/cl_DF.h
Examining data/cln-1.3.6/src/float/division/cl_F_ceil1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_ceil2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_ceil22.cc
Examining data/cln-1.3.6/src/float/division/cl_F_fceil1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_fceil2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_ffloor1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_ffloor2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_floor1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_floor2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_floor22.cc
Examining data/cln-1.3.6/src/float/division/cl_F_fround1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_fround2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_ftrunc1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_ftrunc2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_round1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_round2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_round22.cc
Examining data/cln-1.3.6/src/float/division/cl_F_trunc1.cc
Examining data/cln-1.3.6/src/float/division/cl_F_trunc2.cc
Examining data/cln-1.3.6/src/float/division/cl_F_trunc22.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_I_div.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_I_mul.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_RA_div.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_RA_mul.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_compare.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_div.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_minus.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_minusp.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_mul.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_plus.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_plusp.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_recip.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_scale.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_scale_I.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_square.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_uminus.cc
Examining data/cln-1.3.6/src/float/elem/cl_F_zerop.cc
Examining data/cln-1.3.6/src/float/elem/cl_I_F_div.cc
Examining data/cln-1.3.6/src/float/elem/cl_RA_F_div.cc
Examining data/cln-1.3.6/src/float/ffloat/algebraic/cl_FF_sqrt.cc
Examining data/cln-1.3.6/src/float/ffloat/conv/cl_FF_from_float.cc
Examining data/cln-1.3.6/src/float/ffloat/conv/cl_FF_to_floatj.cc
Examining data/cln-1.3.6/src/float/ffloat/conv/cl_I_to_float.cc
Examining data/cln-1.3.6/src/float/ffloat/conv/cl_RA_to_float.cc
Examining data/cln-1.3.6/src/float/ffloat/division/cl_FF_ceil22.cc
Examining data/cln-1.3.6/src/float/ffloat/division/cl_FF_fceil.cc
Examining data/cln-1.3.6/src/float/ffloat/division/cl_FF_floor22.cc
Examining data/cln-1.3.6/src/float/ffloat/division/cl_FF_recip.cc
Examining data/cln-1.3.6/src/float/ffloat/division/cl_FF_round22.cc
Examining data/cln-1.3.6/src/float/ffloat/division/cl_FF_trunc22.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_compare.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_div.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_ffloor.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_from_I.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_from_RA.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_fround.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_ftrunc.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_futrunc.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_globals.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_minus.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_minusp.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_mul.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_plus.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_plusp.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_scale.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_scale_I.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_to_I.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_uminus.cc
Examining data/cln-1.3.6/src/float/ffloat/elem/cl_FF_zerop.cc
Examining data/cln-1.3.6/src/float/ffloat/input/cl_FF_from_string.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_abs.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_as.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_class.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_debug.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_decode.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_digits.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_eqhashcode.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_exponent.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_idecode.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_max.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_min.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_precision.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_sign.cc
Examining data/cln-1.3.6/src/float/ffloat/misc/cl_FF_signum.cc
Examining data/cln-1.3.6/src/float/ffloat/cl_FF.h
Examining data/cln-1.3.6/src/float/input/cl_F_from_string.cc
Examining data/cln-1.3.6/src/float/input/cl_F_read.cc
Examining data/cln-1.3.6/src/float/input/cl_F_read_stream.cc
Examining data/cln-1.3.6/src/float/input/cl_F_readparsed.cc
Examining data/cln-1.3.6/src/float/lfloat/algebraic/cl_LF_sqrt.cc
Examining data/cln-1.3.6/src/float/lfloat/division/cl_LF_ceil22.cc
Examining data/cln-1.3.6/src/float/lfloat/division/cl_LF_fceil.cc
Examining data/cln-1.3.6/src/float/lfloat/division/cl_LF_floor22.cc
Examining data/cln-1.3.6/src/float/lfloat/division/cl_LF_recip.cc
Examining data/cln-1.3.6/src/float/lfloat/division/cl_LF_round22.cc
Examining data/cln-1.3.6/src/float/lfloat/division/cl_LF_trunc22.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_I_LF_div.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_1minus.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_1plus.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_2minus.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_2plus.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_I_div.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_I_mul.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_RA_div.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_RA_mul.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_compare.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_div.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_ffloor.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_from_I.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_from_RA.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_fround.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_ftrunc.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_futrunc.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_globals.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_minus1.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_minusp.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_mul.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_plus1.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_plusp.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_scale.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_scale_I.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_square.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_to_I.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_uminus.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_LF_zerop.cc
Examining data/cln-1.3.6/src/float/lfloat/elem/cl_RA_LF_div.cc
Examining data/cln-1.3.6/src/float/lfloat/input/cl_LF_from_string.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_abs.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_as.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_class.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_debug.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_decode.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_digits.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_eqhashcode.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_exponent.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_extend.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_idecode.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_leninc.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_lenincx.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_max.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_min.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_precision.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_shorten.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_shortenrel.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_shortenwith.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_sign.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_signum.cc
Examining data/cln-1.3.6/src/float/lfloat/misc/cl_LF_to_LF.cc
Examining data/cln-1.3.6/src/float/lfloat/cl_LF.h
Examining data/cln-1.3.6/src/float/lfloat/cl_LF_impl.h
Examining data/cln-1.3.6/src/float/misc/cl_F_abs.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_as.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_decode.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_digits.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_epsneg.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_epspos.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_eqhashcode.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_exponent.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_extendsqrt.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_extendsqrtx.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_idecode.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_leastneg.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_leastpos.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_max.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_min.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_mostneg.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_mostpos.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_precision.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_rational.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_shortenrel.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_sign.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_sign2.cc
Examining data/cln-1.3.6/src/float/misc/cl_F_signum.cc
Examining data/cln-1.3.6/src/float/misc/cl_float_format.cc
Examining data/cln-1.3.6/src/float/output/cl_F_aprint.cc
Examining data/cln-1.3.6/src/float/output/cl_F_bprint.cc
Examining data/cln-1.3.6/src/float/output/cl_F_cprint.cc
Examining data/cln-1.3.6/src/float/output/cl_F_dprint.cc
Examining data/cln-1.3.6/src/float/output/cl_F_printb.cc
Examining data/cln-1.3.6/src/float/random/cl_F_random.cc
Examining data/cln-1.3.6/src/float/sfloat/algebraic/cl_SF_sqrt.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_ceil22.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_fceil.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_ffloor.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_floor22.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_recip.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_round22.cc
Examining data/cln-1.3.6/src/float/sfloat/division/cl_SF_trunc22.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_compare.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_div.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_from_I.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_from_RA.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_fround.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_ftrunc.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_futrunc.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_minus.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_minusp.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_mul.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_plus.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_plusp.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_scale.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_scale_I.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_to_I.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_uminus.cc
Examining data/cln-1.3.6/src/float/sfloat/elem/cl_SF_zerop.cc
Examining data/cln-1.3.6/src/float/sfloat/input/cl_SF_from_string.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_abs.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_as.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_class.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_debug.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_decode.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_digits.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_eqhashcode.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_exponent.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_idecode.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_max.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_min.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_precision.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_sign.cc
Examining data/cln-1.3.6/src/float/sfloat/misc/cl_SF_signum.cc
Examining data/cln-1.3.6/src/float/sfloat/cl_SF.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_atanhx.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_atanx.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_catalanconst.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_catalanconst_def.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_catalanconst_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_catalanconst_var.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_catalanconst_var.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_cos.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_cosh.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_coshsinh.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_cossin.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_eulerconst.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_eulerconst_def.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_eulerconst_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_eulerconst_var.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_eulerconst_var.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_exp.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_exp1.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_exp1_def.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_exp1_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_exp1_var.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_exp1_var.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_expx.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln10.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln10_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln10_var.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln10_var.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln2.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln2_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln2_var.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_ln2_var.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_lnx.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_pi.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_pi_def.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_pi_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_pi_var.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_pi_var.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_roundpi.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_roundpi2.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_sin.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_sinh.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_sinhx.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_sinx.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_tan.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_tanh.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_tran.h
Examining data/cln-1.3.6/src/float/transcendental/cl_F_zeta_int.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_zeta_int_def.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_F_zeta_int_f.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_atan_recip.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_atanh_recip.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_catalanconst.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_coshsinh.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_coshsinh_aux.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_cossin.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_cossin_aux.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_eulerconst.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_exp1.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_exp_aux.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ln10.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ln2.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_pi.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_a.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_ab.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_b.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_p.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pa.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pab.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pb.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pq.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pqa.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pqab.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_pqb.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_q.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_qa.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_qab.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratseries_qb.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratsumseries_pqcd.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratsumseries_pqcd_aux.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratsumseries_pqd.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_ratsumseries_pqd_aux.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_tran.h
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_zeta3.cc
Examining data/cln-1.3.6/src/float/transcendental/cl_LF_zeta_int.cc
Examining data/cln-1.3.6/src/float/cl_F.h
Examining data/cln-1.3.6/src/integer/2adic/cl_I_2adic_div.cc
Examining data/cln-1.3.6/src/integer/2adic/cl_I_2adic_recip.cc
Examining data/cln-1.3.6/src/integer/algebraic/cl_I_rootp.cc
Examining data/cln-1.3.6/src/integer/algebraic/cl_I_rootp_I.cc
Examining data/cln-1.3.6/src/integer/algebraic/cl_I_rootp_aux.cc
Examining data/cln-1.3.6/src/integer/algebraic/cl_I_sqrt.cc
Examining data/cln-1.3.6/src/integer/algebraic/cl_I_sqrtp.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ash.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ash_I.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ash_exception.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_boole.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_byte.h
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_dpb.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_dpf.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_fullbyte.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ilength.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ldb.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ldbtest.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ldbx.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_ldbxtest.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_log.h
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_log_aux.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logand.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logandc2.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logbitp.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logbitp_I.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logcount.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logeqv.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logior.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_lognand.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_lognor.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_lognot.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logorc2.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logtest.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_logxor.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_mkf.cc
Examining data/cln-1.3.6/src/integer/bitwise/cl_I_mkfx.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_cached_power.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_cached_power.h
Examining data/cln-1.3.6/src/integer/conv/cl_I_digits_need.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_DS.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_L.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_L2.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_NDS.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_NUDS.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_Q.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_Q2.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_UDS.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_UL.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_UL2.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_UQ.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_from_digits.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_mul10plus.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_to_L.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_to_Q.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_to_UL.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_to_UQ.cc
Examining data/cln-1.3.6/src/integer/conv/cl_I_to_digits.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_ceil1.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_ceil2.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_exquo.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_exquo_exception.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_exquopos.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_floor1.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_floor2.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_mod.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_rem.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_round1.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_round2.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_trunc1.cc
Examining data/cln-1.3.6/src/integer/division/cl_I_trunc2.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_compare.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_div.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_equal.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_minus.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_minus1.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_minusp.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_mul.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_plus.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_plus1.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_plusp.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_square.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_uminus.cc
Examining data/cln-1.3.6/src/integer/elem/cl_I_zerop.cc
Examining data/cln-1.3.6/src/integer/gcd/cl_I_gcd.cc
Examining data/cln-1.3.6/src/integer/gcd/cl_I_gcd_aux.cc
Examining data/cln-1.3.6/src/integer/gcd/cl_I_gcd_aux2.cc
Examining data/cln-1.3.6/src/integer/gcd/cl_I_lcm.cc
Examining data/cln-1.3.6/src/integer/gcd/cl_I_xgcd.cc
Examining data/cln-1.3.6/src/integer/gcd/cl_low_gcd.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_gcobject.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_gcobject.h
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_gcpointer.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_gcpointer.h
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_pointer.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_pointer.h
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_rcobject.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_rcobject.h
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_rcpointer.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hash_rcpointer.h
Examining data/cln-1.3.6/src/integer/hash/cl_I_hashcode.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hashweak_rcpointer.cc
Examining data/cln-1.3.6/src/integer/hash/cl_I_hashweak_rcpointer.h
Examining data/cln-1.3.6/src/integer/input/cl_I_from_string.cc
Examining data/cln-1.3.6/src/integer/input/cl_I_read.cc
Examining data/cln-1.3.6/src/integer/input/cl_I_read_stream.cc
Examining data/cln-1.3.6/src/integer/input/cl_I_readparsed.cc
Examining data/cln-1.3.6/src/integer/misc/combin/cl_I_binomial.cc
Examining data/cln-1.3.6/src/integer/misc/combin/cl_I_combin.h
Examining data/cln-1.3.6/src/integer/misc/combin/cl_I_doublefactorial.cc
Examining data/cln-1.3.6/src/integer/misc/combin/cl_I_factorial.cc
Examining data/cln-1.3.6/src/integer/misc/combin/cl_I_factorial_aux.cc
Examining data/cln-1.3.6/src/integer/misc/cl_BN_class.cc
Examining data/cln-1.3.6/src/integer/misc/cl_FN_class.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_abs.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_as.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_debug.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_eqhashcode.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_exptpos.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_exptpos_I.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_max.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_min.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_oddp.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_ord2.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_power2p.cc
Examining data/cln-1.3.6/src/integer/misc/cl_I_signum.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_aprint.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_bprint.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_cprint.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_decstring.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_dprint.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_print.cc
Examining data/cln-1.3.6/src/integer/output/cl_I_print_string.cc
Examining data/cln-1.3.6/src/integer/random/cl_I_random.cc
Examining data/cln-1.3.6/src/integer/random/cl_I_trandom.cc
Examining data/cln-1.3.6/src/integer/ring/cl_0_ring.cc
Examining data/cln-1.3.6/src/integer/ring/cl_I_ring.cc
Examining data/cln-1.3.6/src/integer/cl_I.h
Examining data/cln-1.3.6/src/modinteger/cl_MI.cc
Examining data/cln-1.3.6/src/modinteger/cl_MI.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_cond_composite.cc
Examining data/cln-1.3.6/src/modinteger/cl_MI_debug.cc
Examining data/cln-1.3.6/src/modinteger/cl_MI_err_comp.cc
Examining data/cln-1.3.6/src/modinteger/cl_MI_fix16.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_fix29.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_fix32.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_int.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_int32.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_lshift.cc
Examining data/cln-1.3.6/src/modinteger/cl_MI_montgom.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_pow2.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_pow2m1.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_pow2p1.h
Examining data/cln-1.3.6/src/modinteger/cl_MI_rshift.cc
Examining data/cln-1.3.6/src/modinteger/cl_MI_std.h
Examining data/cln-1.3.6/src/numtheory/cl_IF.h
Examining data/cln-1.3.6/src/numtheory/cl_IF_millerrabin.cc
Examining data/cln-1.3.6/src/numtheory/cl_IF_smallprimes.cc
Examining data/cln-1.3.6/src/numtheory/cl_IF_trialdiv.cc
Examining data/cln-1.3.6/src/numtheory/cl_IF_trialdiv1.cc
Examining data/cln-1.3.6/src/numtheory/cl_IF_trialdiv2.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_cornacchia1.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_cornacchia4.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_isprobprime.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_jacobi.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_jacobi_low.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_nextprobprime.cc
Examining data/cln-1.3.6/src/numtheory/cl_nt_sqrtmodp.cc
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP.cc
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_GF2.h
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_MI.h
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_gen.h
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_named.cc
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_no_ring.cc
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_number.h
Examining data/cln-1.3.6/src/polynomial/elem/cl_UP_unnamed.cc
Examining data/cln-1.3.6/src/polynomial/elem/cl_asm_GF2.cc
Examining data/cln-1.3.6/src/polynomial/elem/cl_asm_sparc_GF2.cc
Examining data/cln-1.3.6/src/polynomial/misc/cl_UP_I_hermite.cc
Examining data/cln-1.3.6/src/polynomial/misc/cl_UP_I_laguerre.cc
Examining data/cln-1.3.6/src/polynomial/misc/cl_UP_I_tchebychev.cc
Examining data/cln-1.3.6/src/polynomial/misc/cl_UP_RA_legendre.cc
Examining data/cln-1.3.6/src/polynomial/misc/cl_UP_debug.cc
Examining data/cln-1.3.6/src/polynomial/misc/cl_UP_deriv.cc
Examining data/cln-1.3.6/src/polynomial/cl_UP.h
Examining data/cln-1.3.6/src/rational/algebraic/cl_RA_rootp.cc
Examining data/cln-1.3.6/src/rational/algebraic/cl_RA_rootp_I.cc
Examining data/cln-1.3.6/src/rational/algebraic/cl_RA_sqrtp.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_ceil1.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_ceil12.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_ceil2.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_ceil22.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_floor1.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_floor12.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_floor2.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_floor22.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_round1.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_round12.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_round2.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_round22.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_trunc1.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_trunc12.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_trunc2.cc
Examining data/cln-1.3.6/src/rational/division/cl_RA_trunc22.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_compare.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_denominator.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_div.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_equal.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_from_I_I_div.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_from_I_posI.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_from_I_posI1.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_from_I_posI_div.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_minus.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_minus1.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_minusp.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_mul.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_numerator.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_plus.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_plus1.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_plusp.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_recip.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_square.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_uminus.cc
Examining data/cln-1.3.6/src/rational/elem/cl_RA_zerop.cc
Examining data/cln-1.3.6/src/rational/input/cl_RA_from_string.cc
Examining data/cln-1.3.6/src/rational/input/cl_RA_read.cc
Examining data/cln-1.3.6/src/rational/input/cl_RA_read_stream.cc
Examining data/cln-1.3.6/src/rational/input/cl_RA_readparsed.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_abs.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_as.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_class.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_debug.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_eqhashcode.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_expt.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_expt_I.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_exptpos.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_exptpos_I.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_max.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_min.cc
Examining data/cln-1.3.6/src/rational/misc/cl_RA_signum.cc
Examining data/cln-1.3.6/src/rational/output/cl_RA_aprint.cc
Examining data/cln-1.3.6/src/rational/output/cl_RA_bprint.cc
Examining data/cln-1.3.6/src/rational/output/cl_RA_cprint.cc
Examining data/cln-1.3.6/src/rational/output/cl_RA_dprint.cc
Examining data/cln-1.3.6/src/rational/output/cl_RA_print.cc
Examining data/cln-1.3.6/src/rational/ring/cl_RA_ring.cc
Examining data/cln-1.3.6/src/rational/transcendental/cl_I_logp.cc
Examining data/cln-1.3.6/src/rational/transcendental/cl_RA_logp.cc
Examining data/cln-1.3.6/src/rational/cl_RA.h
Examining data/cln-1.3.6/src/real/algebraic/cl_RA_sqrt.cc
Examining data/cln-1.3.6/src/real/algebraic/cl_R_sqrt.cc
Examining data/cln-1.3.6/src/real/conv/cl_F_from_R.cc
Examining data/cln-1.3.6/src/real/conv/cl_F_from_R_def.cc
Examining data/cln-1.3.6/src/real/conv/cl_F_from_R_f.cc
Examining data/cln-1.3.6/src/real/conv/cl_R_to_DF.cc
Examining data/cln-1.3.6/src/real/conv/cl_R_to_FF.cc
Examining data/cln-1.3.6/src/real/conv/cl_R_to_LF.cc
Examining data/cln-1.3.6/src/real/conv/cl_R_to_SF.cc
Examining data/cln-1.3.6/src/real/conv/cl_R_to_double.cc
Examining data/cln-1.3.6/src/real/conv/cl_R_to_float.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ceil1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ceil12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ceil2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ceil22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_div_t.h
Examining data/cln-1.3.6/src/real/division/cl_R_fceil1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fceil12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fceil2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fceil22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ffloor1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ffloor12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ffloor2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ffloor22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_floor1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_floor12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_floor2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_floor22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fround1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fround12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fround2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_fround22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ftrunc1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ftrunc12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ftrunc2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_ftrunc22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_mod.cc
Examining data/cln-1.3.6/src/real/division/cl_R_rem.cc
Examining data/cln-1.3.6/src/real/division/cl_R_round1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_round12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_round2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_round22.cc
Examining data/cln-1.3.6/src/real/division/cl_R_trunc1.cc
Examining data/cln-1.3.6/src/real/division/cl_R_trunc12.cc
Examining data/cln-1.3.6/src/real/division/cl_R_trunc2.cc
Examining data/cln-1.3.6/src/real/division/cl_R_trunc22.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_compare.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_div.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_equal.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_minus.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_minus1.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_minusp.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_mul.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_plus.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_plus1.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_plusp.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_recip.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_square.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_uminus.cc
Examining data/cln-1.3.6/src/real/elem/cl_R_zerop.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_cardinal.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_floatstring.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_integer.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_newroman.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_oldroman.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_ordinal.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_paddedstring.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_scaleexp.cc
Examining data/cln-1.3.6/src/real/format-output/cl_fmt_tens.cc
Examining data/cln-1.3.6/src/real/format-output/cl_format.h
Examining data/cln-1.3.6/src/real/input/cl_R_from_string.cc
Examining data/cln-1.3.6/src/real/input/cl_R_read.cc
Examining data/cln-1.3.6/src/real/input/cl_R_read_stream.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_abs.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_as.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_contagion.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_debug.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_eqhashcode.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_expt.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_expt_I.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_max.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_min.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_rational.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_rationalize.cc
Examining data/cln-1.3.6/src/real/misc/cl_R_signum.cc
Examining data/cln-1.3.6/src/real/output/cl_R_aprint.cc
Examining data/cln-1.3.6/src/real/output/cl_R_bprint.cc
Examining data/cln-1.3.6/src/real/output/cl_R_cprint.cc
Examining data/cln-1.3.6/src/real/random/cl_R_random.cc
Examining data/cln-1.3.6/src/real/ring/cl_R_ring.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_atan.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_atan2.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_cos.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_cosh.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_coshsinh.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_cossin.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_exp.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_ln.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_log.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_sin.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_sinh.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_tan.cc
Examining data/cln-1.3.6/src/real/transcendental/cl_R_tanh.cc
Examining data/cln-1.3.6/src/real/cl_R.h
Examining data/cln-1.3.6/src/vector/output/cl_GV_number_aprint.cc
Examining data/cln-1.3.6/src/vector/output/cl_SV_aprint.cc
Examining data/cln-1.3.6/src/vector/output/cl_SV_number_aprint.cc
Examining data/cln-1.3.6/src/vector/cl_GV_I.cc
Examining data/cln-1.3.6/src/vector/cl_GV_I_copy.cc
Examining data/cln-1.3.6/src/vector/cl_GV_I_debug.cc
Examining data/cln-1.3.6/src/vector/cl_GV_io.h
Examining data/cln-1.3.6/src/vector/cl_GV_number.cc
Examining data/cln-1.3.6/src/vector/cl_GV_number_copy.cc
Examining data/cln-1.3.6/src/vector/cl_GV_number_debug.cc
Examining data/cln-1.3.6/src/vector/cl_SV_copy.cc
Examining data/cln-1.3.6/src/vector/cl_SV_io.h
Examining data/cln-1.3.6/src/vector/cl_SV_number.cc
Examining data/cln-1.3.6/src/vector/cl_SV_number_debug.cc
Examining data/cln-1.3.6/src/vector/cl_SV_ringelt.cc
Examining data/cln-1.3.6/src/vector/cl_SV_ringelt_debug.cc
Examining data/cln-1.3.6/tests/exam.h
Examining data/cln-1.3.6/tests/exam.cc
Examining data/cln-1.3.6/tests/exam_I.cc
Examining data/cln-1.3.6/tests/exam_I_plus.cc
Examining data/cln-1.3.6/tests/exam_I_minus.cc
Examining data/cln-1.3.6/tests/exam_I_mul.cc
Examining data/cln-1.3.6/tests/exam_I_div.cc
Examining data/cln-1.3.6/tests/exam_I_floor.cc
Examining data/cln-1.3.6/tests/exam_RA.cc
Examining data/cln-1.3.6/tests/exam_RA_plus.cc
Examining data/cln-1.3.6/tests/exam_RA_minus.cc
Examining data/cln-1.3.6/tests/exam_RA_mul.cc
Examining data/cln-1.3.6/tests/exam_RA_div.cc
Examining data/cln-1.3.6/tests/exam_RA_floor.cc
Examining data/cln-1.3.6/tests/exam_SF.cc
Examining data/cln-1.3.6/tests/exam_SF_plus.cc
Examining data/cln-1.3.6/tests/exam_SF_minus.cc
Examining data/cln-1.3.6/tests/exam_SF_mul.cc
Examining data/cln-1.3.6/tests/exam_SF_div.cc
Examining data/cln-1.3.6/tests/exam_SF_floor.cc
Examining data/cln-1.3.6/tests/exam_FF.cc
Examining data/cln-1.3.6/tests/exam_FF_plus.cc
Examining data/cln-1.3.6/tests/exam_FF_minus.cc
Examining data/cln-1.3.6/tests/exam_FF_mul.cc
Examining data/cln-1.3.6/tests/exam_FF_div.cc
Examining data/cln-1.3.6/tests/exam_FF_floor.cc
Examining data/cln-1.3.6/tests/exam_DF.cc
Examining data/cln-1.3.6/tests/exam_DF_plus.cc
Examining data/cln-1.3.6/tests/exam_DF_minus.cc
Examining data/cln-1.3.6/tests/exam_DF_mul.cc
Examining data/cln-1.3.6/tests/exam_DF_div.cc
Examining data/cln-1.3.6/tests/exam_DF_floor.cc
Examining data/cln-1.3.6/tests/exam_LF.cc
Examining data/cln-1.3.6/tests/exam_LF_plus.cc
Examining data/cln-1.3.6/tests/exam_LF_minus.cc
Examining data/cln-1.3.6/tests/exam_LF_mul.cc
Examining data/cln-1.3.6/tests/exam_LF_div.cc
Examining data/cln-1.3.6/tests/exam_LF_floor.cc
Examining data/cln-1.3.6/tests/exam_I_gcd.cc
Examining data/cln-1.3.6/tests/exam_I_sqrtp.cc
Examining data/cln-1.3.6/tests/test_MI.h
Examining data/cln-1.3.6/tests/test.h
Examining data/cln-1.3.6/tests/main.cc
Examining data/cln-1.3.6/tests/tests.cc
Examining data/cln-1.3.6/tests/test_I.cc
Examining data/cln-1.3.6/tests/test_I.h
Examining data/cln-1.3.6/tests/test_I_abs.cc
Examining data/cln-1.3.6/tests/test_I_compare.cc
Examining data/cln-1.3.6/tests/test_I_plus.cc
Examining data/cln-1.3.6/tests/test_I_minus.cc
Examining data/cln-1.3.6/tests/test_I_plus1.cc
Examining data/cln-1.3.6/tests/test_I_minus1.cc
Examining data/cln-1.3.6/tests/test_I_mul.cc
Examining data/cln-1.3.6/tests/test_I_div.cc
Examining data/cln-1.3.6/tests/test_I_gcd.cc
Examining data/cln-1.3.6/tests/test_I_xgcd.cc
Examining data/cln-1.3.6/tests/test_I_ash.cc
Examining data/cln-1.3.6/tests/test_I_evenp.cc
Examining data/cln-1.3.6/tests/test_I_oddp.cc
Examining data/cln-1.3.6/tests/test_I_lognot.cc
Examining data/cln-1.3.6/tests/test_I_logand.cc
Examining data/cln-1.3.6/tests/test_I_logandc1.cc
Examining data/cln-1.3.6/tests/test_I_logandc2.cc
Examining data/cln-1.3.6/tests/test_I_logior.cc
Examining data/cln-1.3.6/tests/test_I_logorc1.cc
Examining data/cln-1.3.6/tests/test_I_logorc2.cc
Examining data/cln-1.3.6/tests/test_I_logxor.cc
Examining data/cln-1.3.6/tests/test_I_lognand.cc
Examining data/cln-1.3.6/tests/test_I_lognor.cc
Examining data/cln-1.3.6/tests/test_I_logeqv.cc
Examining data/cln-1.3.6/tests/test_I_boole.cc
Examining data/cln-1.3.6/tests/test_I_logbitp.cc
Examining data/cln-1.3.6/tests/test_I_logtest.cc
Examining data/cln-1.3.6/tests/test_I_ldb.cc
Examining data/cln-1.3.6/tests/test_I_ldbtest.cc
Examining data/cln-1.3.6/tests/test_I_mkf.cc
Examining data/cln-1.3.6/tests/test_I_dpb.cc
Examining data/cln-1.3.6/tests/test_I_dpf.cc
Examining data/cln-1.3.6/tests/test_I_logcount.cc
Examining data/cln-1.3.6/tests/test_I_ilength.cc
Examining data/cln-1.3.6/tests/test_I_ord2.cc
Examining data/cln-1.3.6/tests/test_I_power2p.cc
Examining data/cln-1.3.6/tests/test_I_isqrt.cc
Examining data/cln-1.3.6/tests/test_I_sqrtp.cc
Examining data/cln-1.3.6/tests/test_I_io.cc
Examining data/cln-1.3.6/tests/test_I_GV.cc
Examining data/cln-1.3.6/tests/test_MI.cc
Examining data/cln-1.3.6/tests/test_MI_canonhom.cc
Examining data/cln-1.3.6/tests/test_MI_plus.cc
Examining data/cln-1.3.6/tests/test_MI_minus.cc
Examining data/cln-1.3.6/tests/test_MI_mul.cc
Examining data/cln-1.3.6/tests/test_MI_recip.cc
Examining data/cln-1.3.6/tests/test_MI_div.cc
Examining data/cln-1.3.6/tests/test_MI_expt.cc
Examining data/cln-1.3.6/tests/test_nt.h
Examining data/cln-1.3.6/tests/test_nt.cc
Examining data/cln-1.3.6/tests/test_nt_jacobi.cc
Examining data/cln-1.3.6/tests/timeLFRAmul.cc
Examining data/cln-1.3.6/tests/timeLFatan.cc
Examining data/cln-1.3.6/tests/timeLFatanh.cc
Examining data/cln-1.3.6/tests/timeLFcos.cc
Examining data/cln-1.3.6/tests/timeLFcosh.cc
Examining data/cln-1.3.6/tests/timeLFexp.cc
Examining data/cln-1.3.6/tests/timeLFln.cc
Examining data/cln-1.3.6/tests/timeLFsin.cc
Examining data/cln-1.3.6/tests/timeLFsinh.cc
Examining data/cln-1.3.6/tests/timeLFsqrt.cc
Examining data/cln-1.3.6/tests/timeMImisc5.cc
Examining data/cln-1.3.6/tests/timeMIpow2div.cc
Examining data/cln-1.3.6/tests/timeMIpow2recip.cc
Examining data/cln-1.3.6/tests/timeRALFdiv.cc
Examining data/cln-1.3.6/tests/timeRAtoLF.cc
Examining data/cln-1.3.6/tests/timeUPMImul.cc
Examining data/cln-1.3.6/tests/timecatalan.cc
Examining data/cln-1.3.6/tests/timediv.cc
Examining data/cln-1.3.6/tests/timediv2adic.cc
Examining data/cln-1.3.6/tests/timeeuler.cc
Examining data/cln-1.3.6/tests/timeexp1.cc
Examining data/cln-1.3.6/tests/timefact.cc
Examining data/cln-1.3.6/tests/timegcd.cc
Examining data/cln-1.3.6/tests/timemul.cc
Examining data/cln-1.3.6/tests/timepi.cc
Examining data/cln-1.3.6/tests/timeprint.cc
Examining data/cln-1.3.6/tests/timerecip2adic.cc
Examining data/cln-1.3.6/tests/timesqrt.cc
Examining data/cln-1.3.6/tests/timesqrtmodp.cc
Examining data/cln-1.3.6/tests/timesquare.cc
Examining data/cln-1.3.6/tests/timezeta3.cc
Examining data/cln-1.3.6/examples/contfrac.cc
Examining data/cln-1.3.6/examples/e.cc
Examining data/cln-1.3.6/examples/fibonacci.cc
Examining data/cln-1.3.6/examples/legendre.cc
Examining data/cln-1.3.6/examples/lucaslehmer.cc
Examining data/cln-1.3.6/examples/nextprime.cc
Examining data/cln-1.3.6/examples/perfnum.cc
Examining data/cln-1.3.6/examples/pi.cc
Examining data/cln-1.3.6/benchmarks/timebench1.cc
Examining data/cln-1.3.6/benchmarks/timebench2a.cc
Examining data/cln-1.3.6/benchmarks/timebench2ap.cc
Examining data/cln-1.3.6/benchmarks/timebench2b.cc

FINAL RESULTS:

data/cln-1.3.6/include/cln/modinteger.h:15:8:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
#undef random // Linux defines random() as a macro!
data/cln-1.3.6/include/cln/modinteger.h:167:18:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
	const _cl_MI (* random) (cl_heap_modint_ring* R, random_state& randomstate);
data/cln-1.3.6/include/cln/modinteger.h:231:20:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
		{ return setops->random(this,randomstate); }
data/cln-1.3.6/include/cln/modinteger.h:274:14:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
	const cl_MI random (random_state& randomstate = default_random_state)
data/cln-1.3.6/src/base/string/input/cl_st_get2.cc:31:11:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
			stream.setstate(std::ios::failbit);
data/cln-1.3.6/src/base/string/input/cl_st_getline2.cc:29:11:  [3] (random) setstate:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
			stream.setstate(std::ios::failbit);
data/cln-1.3.6/src/numtheory/cl_nt_sqrtmodp.cc:99:14:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
		const pol2 random ()
data/cln-1.3.6/src/numtheory/cl_nt_sqrtmodp.cc:101:19:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
			return pol2(R->random(),R->random());
data/cln-1.3.6/src/numtheory/cl_nt_sqrtmodp.cc:101:31:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
			return pol2(R->random(),R->random());
data/cln-1.3.6/src/numtheory/cl_nt_sqrtmodp.cc:150:19:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
		var pol2 u = PR.random();
data/cln-1.3.6/src/numtheory/cl_nt_sqrtmodp.cc:231:16:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
			do { h = R->random(); }
data/cln-1.3.6/src/timing/cl_t_current.cc:59:22:  [3] (misc) LoadLibrary:
  Ensure that the full path to the library is specified, or current directory
  may be used (CWE-829, CWE-20). Use registry entry or GetWindowsDirectory to
  find library path, if you aren't already.
		HMODULE kernel32 = LoadLibrary ("kernel32.dll");
data/cln-1.3.6/tests/timeMIpow2div.cc:21:15:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
	cl_MI a = R->random();
data/cln-1.3.6/tests/timeMIpow2div.cc:23:14:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
	do { b = R->random(); } while (!oddp(R->retract(b)));
data/cln-1.3.6/tests/timeMIpow2recip.cc:22:14:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
	do { a = R->random(); } while (!oddp(R->retract(a)));
data/cln-1.3.6/tests/timesqrtmodp.cc:35:15:  [3] (random) random:
  This function is not sufficiently random for security-related functions
  such as key and nonce creation (CWE-327). Use a more secure technique for
  acquiring random values.
	cl_MI x = R->random();
data/cln-1.3.6/benchmarks/timebench1.cc:61:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/benchmarks/timebench2a.cc:20:18:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			repetitions = atoi(argv[2]);
data/cln-1.3.6/benchmarks/timebench2a.cc:25:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			digits = atoi(argv[2]);
data/cln-1.3.6/benchmarks/timebench2ap.cc:17:18:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			repetitions = atoi(argv[2]);
data/cln-1.3.6/benchmarks/timebench2ap.cc:22:12:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			limit = atoi(argv[2]);
data/cln-1.3.6/benchmarks/timebench2b.cc:23:18:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			repetitions = atoi(argv[2]);
data/cln-1.3.6/benchmarks/timebench2b.cc:28:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			digits = atoi(argv[2]);
data/cln-1.3.6/examples/e.cc:106:22:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
            digits = atol(argv[2]);
data/cln-1.3.6/examples/fibonacci.cc:131:10:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int n = atoi(argv[1]);
data/cln-1.3.6/examples/fibonacci.cc:142:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/examples/fibonacci.cc:149:10:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int n = atoi(argv[1]);
data/cln-1.3.6/examples/legendre.cc:61:10:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int n = atoi(argv[1]);
data/cln-1.3.6/examples/lucaslehmer.cc:63:10:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int q = atoi(argv[1]);
data/cln-1.3.6/examples/pi.cc:53:13:  [2] (integer) atol:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
			digits = atol(argv[1]);
data/cln-1.3.6/include/cln/string.h:19:2:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
	char data[1];		// the characters, plus a '\0' at the end
data/cln-1.3.6/src/base/output/cl_output_dec.cc:20:6:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
	var char buf[bufsize+1];
data/cln-1.3.6/src/base/output/cl_output_dec.cc:69:6:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
	var char buf[bufsize+1];
data/cln-1.3.6/src/base/output/cl_output_hex.cc:17:6:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
	var char buf[bufsize+1];
data/cln-1.3.6/src/base/output/cl_output_hex.cc:66:6:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
	var char buf[bufsize+1];
data/cln-1.3.6/src/base/string/cl_spushstring_append.cc:22:3:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
		memcpy(newbuffer,buffer,alloc);
data/cln-1.3.6/src/base/string/cl_spushstring_push.cc:21:3:  [2] (buffer) memcpy:
  Does not check for buffer overflows when copying to destination (CWE-120).
  Make sure destination can always hold the source data.
		memcpy(newbuffer,buffer,alloc);
data/cln-1.3.6/src/integer/algebraic/cl_I_sqrtp.cc:28:11:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
   static char squares_mod_11 [11] =
data/cln-1.3.6/src/integer/algebraic/cl_I_sqrtp.cc:31:11:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
   static char squares_mod_63 [63] =
data/cln-1.3.6/src/integer/algebraic/cl_I_sqrtp.cc:38:12:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    static char squares_mod_64 [64] =
data/cln-1.3.6/src/integer/algebraic/cl_I_sqrtp.cc:45:12:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
    static char squares_mod_65 [65] =
data/cln-1.3.6/src/real/format-output/cl_fmt_cardinal.cc:19:14:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
static const char * const cl_format_ones [20] = {
data/cln-1.3.6/src/real/format-output/cl_fmt_ordinal.cc:16:14:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
static const char * const cl_format_ordinal_ones [20] = {
data/cln-1.3.6/src/real/format-output/cl_fmt_ordinal.cc:39:14:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
static const char * const cl_format_ordinal_tens [10] = {
data/cln-1.3.6/src/real/format-output/cl_fmt_tens.cc:14:7:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
const char * const cl_format_tens [10] = {
data/cln-1.3.6/src/real/format-output/cl_format.h:18:14:  [2] (buffer) char:
  Statically-sized arrays can be improperly restricted, leading to potential
  overflows or other issues (CWE-119!/CWE-120). Perform bounds checking, use
  functions that limit length, or ensure that the size is larger than the
  maximum possible length.
extern const char * const cl_format_tens [10];
data/cln-1.3.6/tests/main.cc:86:34:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	float_format_t f = float_format(atoi(argv[1]));
data/cln-1.3.6/tests/tests.cc:25:16:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		iterations = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFRAmul.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFRAmul.cc:25:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL m1 = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFatan.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFatan.cc:26:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFatanh.cc:21:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFatanh.cc:26:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFcos.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFcos.cc:26:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFcosh.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFcosh.cc:26:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFexp.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFexp.cc:25:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFln.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFln.cc:25:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFsin.cc:21:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFsin.cc:27:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFsinh.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFsinh.cc:26:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeLFsqrt.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeLFsqrt.cc:25:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeMImisc5.cc:16:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeMIpow2div.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeMIpow2div.cc:19:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeMIpow2recip.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeMIpow2recip.cc:19:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeRALFdiv.cc:20:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeRALFdiv.cc:29:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL m3 = atoi(argv[1]);
data/cln-1.3.6/tests/timeRAtoLF.cc:19:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeRAtoLF.cc:24:13:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL m1 = atoi(argv[1]);
data/cln-1.3.6/tests/timeUPMImul.cc:17:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeUPMImul.cc:23:10:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int n = atoi(argv[1]);
data/cln-1.3.6/tests/timecatalan.cc:30:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timecatalan.cc:35:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timediv.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timediv2adic.cc:17:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timediv2adic.cc:22:16:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL a_len = atoi(argv[1]);
data/cln-1.3.6/tests/timediv2adic.cc:23:16:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL b_len = atoi(argv[2]);
data/cln-1.3.6/tests/timeeuler.cc:29:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeeuler.cc:34:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timeexp1.cc:21:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timeexp1.cc:26:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timefact.cc:15:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timegcd.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timemul.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timepi.cc:18:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timepi.cc:24:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timepi.cc:52:10:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int n = atoi(argv[1]);
data/cln-1.3.6/tests/timeprint.cc:16:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timerecip2adic.cc:17:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timerecip2adic.cc:22:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/tests/timesqrt.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timesqrtmodp.cc:18:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timesqrtmodp.cc:24:22:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	int e = (argc > 2 ? atoi(argv[2]) : 0);
data/cln-1.3.6/tests/timesquare.cc:14:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timezeta3.cc:26:17:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
		repetitions = atoi(argv[2]);
data/cln-1.3.6/tests/timezeta3.cc:31:14:  [2] (integer) atoi:
  Unless checked, the resulting number can exceed the expected range
  (CWE-190). If source untrusted, check both minimum and maximum, even if the
  input had no minus sign (large numbers can roll over into negative number;
  consider saving to an unsigned value if that is intended).
	uintL len = atoi(argv[1]);
data/cln-1.3.6/examples/lucaslehmer.cc:50:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	return R->equal(L_i,R->zero());
data/cln-1.3.6/include/cln/complex.h:71:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
extern bool equal (const cl_N& x, const cl_N& y);
data/cln-1.3.6/include/cln/complex.h:76:18:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        { return equal(x,y); }
data/cln-1.3.6/include/cln/complex.h:78:19:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
        { return !equal(x,y); }
data/cln-1.3.6/include/cln/integer.h:294:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
extern bool equal (const cl_I& x, const cl_I& y);
data/cln-1.3.6/include/cln/integer.h:303:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return equal(x,y); }
data/cln-1.3.6/include/cln/integer.h:305:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !equal(x,y); }
data/cln-1.3.6/include/cln/modinteger.h:165:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool (* equal) (cl_heap_modint_ring* R, const _cl_MI& x, const _cl_MI& y);
data/cln-1.3.6/include/cln/modinteger.h:229:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		{ return setops->equal(this,x,y); }
data/cln-1.3.6/include/cln/modinteger.h:268:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_MI& x, const cl_MI& y)
data/cln-1.3.6/include/cln/modinteger.h:405:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return x.ring()->equal(x,y); }
data/cln-1.3.6/include/cln/modinteger.h:407:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !x.ring()->equal(x,y); }
data/cln-1.3.6/include/cln/modinteger.h:409:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return x.ring()->equal(x,x.ring()->canonhom(y)); }
data/cln-1.3.6/include/cln/modinteger.h:411:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !x.ring()->equal(x,x.ring()->canonhom(y)); }
data/cln-1.3.6/include/cln/modinteger.h:413:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return y.ring()->equal(y.ring()->canonhom(x),y); }
data/cln-1.3.6/include/cln/modinteger.h:415:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !y.ring()->equal(y.ring()->canonhom(x),y); }
data/cln-1.3.6/include/cln/rational.h:100:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
extern bool equal (const cl_RA& r, const cl_RA& s);
data/cln-1.3.6/include/cln/rational.h:109:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return equal(x,y); }
data/cln-1.3.6/include/cln/rational.h:111:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !equal(x,y); }
data/cln-1.3.6/include/cln/real.h:364:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
extern bool equal (const cl_R& x, const cl_R& y);
data/cln-1.3.6/include/cln/real.h:373:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return equal(x,y); }
data/cln-1.3.6/include/cln/real.h:375:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !equal(x,y); }
data/cln-1.3.6/include/cln/ring.h:161:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool (* equal) (cl_heap_ring* R, const _cl_ring_element& x, const _cl_ring_element& y);
data/cln-1.3.6/include/cln/ring.h:215:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		{ return setops->equal(this,x,y); }
data/cln-1.3.6/include/cln/ring.h:242:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_ring_element& x, const cl_ring_element& y)
data/cln-1.3.6/include/cln/ring.h:336:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return x.ring()->equal(x,y); }
data/cln-1.3.6/include/cln/ring.h:338:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !x.ring()->equal(x,y); }
data/cln-1.3.6/include/cln/ring.h:408:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool (* equal) (const T&, const T&);
data/cln-1.3.6/include/cln/string.h:95:22:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
inline unsigned long strlen (const cl_string& str)
data/cln-1.3.6/include/cln/string.h:104:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
inline bool equal (const cl_string& str1, const cl_string& str2)
data/cln-1.3.6/include/cln/string.h:109:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
inline bool equal (const char * str1, const cl_string& str2)
data/cln-1.3.6/include/cln/string.h:113:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
inline bool equal (const cl_string& str1, const char * str2)
data/cln-1.3.6/include/cln/symbol.h:38:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
inline bool equal (const cl_symbol& s1, const cl_symbol& s2)
data/cln-1.3.6/include/cln/univpoly.h:118:10:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool (* equal) (cl_heap_univpoly_ring* R, const _cl_UP& x, const _cl_UP& y);
data/cln-1.3.6/include/cln/univpoly.h:192:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		{ return setops->equal(this,x,y); }
data/cln-1.3.6/include/cln/univpoly.h:237:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP& x, const cl_UP& y)
data/cln-1.3.6/include/cln/univpoly.h:386:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return x.ring()->equal(x,y); }
data/cln-1.3.6/include/cln/univpoly.h:388:22:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	{ return !x.ring()->equal(x,y); }
data/cln-1.3.6/include/cln/univpoly.h:556:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP_specialized<T>& x, const cl_UP_specialized<T>& y)
data/cln-1.3.6/include/cln/univpoly.h:558:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		return cl_heap_univpoly_ring::equal(x,y);
data/cln-1.3.6/include/cln/univpoly_complex.h:67:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP_N& x, const cl_UP_N& y)
data/cln-1.3.6/include/cln/univpoly_complex.h:69:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		return cl_heap_univpoly_ring::equal(x,y);
data/cln-1.3.6/include/cln/univpoly_integer.h:66:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP_I& x, const cl_UP_I& y)
data/cln-1.3.6/include/cln/univpoly_integer.h:68:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		return cl_heap_univpoly_ring::equal(x,y);
data/cln-1.3.6/include/cln/univpoly_modint.h:58:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP_MI& x, const cl_UP_MI& y)
data/cln-1.3.6/include/cln/univpoly_modint.h:60:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		return cl_heap_univpoly_ring::equal(x,y);
data/cln-1.3.6/include/cln/univpoly_rational.h:67:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP_RA& x, const cl_UP_RA& y)
data/cln-1.3.6/include/cln/univpoly_rational.h:69:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		return cl_heap_univpoly_ring::equal(x,y);
data/cln-1.3.6/include/cln/univpoly_real.h:67:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	bool equal (const cl_UP_R& x, const cl_UP_R& y)
data/cln-1.3.6/include/cln/univpoly_real.h:69:33:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		return cl_heap_univpoly_ring::equal(x,y);
data/cln-1.3.6/src/base/hash/cl_hash1.h:46:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key,this->_entries[index].entry.key))
data/cln-1.3.6/src/base/hash/cl_hash1.h:62:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                if (equal(key,this->_entries[index].entry.key)) {
data/cln-1.3.6/src/base/hash/cl_hash1.h:86:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key,this->_entries[index].entry.key)) {
data/cln-1.3.6/src/base/hash/cl_hash2.h:48:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key1,this->_entries[index].entry.key1)
data/cln-1.3.6/src/base/hash/cl_hash2.h:49:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                && equal(key2,this->_entries[index].entry.key2))
data/cln-1.3.6/src/base/hash/cl_hash2.h:65:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                if (equal(key1,this->_entries[index].entry.key1)
data/cln-1.3.6/src/base/hash/cl_hash2.h:66:24:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                    && equal(key2,this->_entries[index].entry.key2)) {
data/cln-1.3.6/src/base/hash/cl_hash2.h:90:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key1,this->_entries[index].entry.key1)
data/cln-1.3.6/src/base/hash/cl_hash2.h:91:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                && equal(key2,this->_entries[index].entry.key2)) {
data/cln-1.3.6/src/base/hash/cl_hashset.h:42:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key,this->_entries[index].entry.key))
data/cln-1.3.6/src/base/hash/cl_hashset.h:58:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                if (equal(key,this->_entries[index].entry.key))
data/cln-1.3.6/src/base/hash/cl_hashset.h:80:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key,this->_entries[index].entry.key)) {
data/cln-1.3.6/src/base/hash/cl_hashuniq.h:50:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key,hashkey(this->_entries[index].entry.val)))
data/cln-1.3.6/src/base/hash/cl_hashuniq.h:66:21:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
                if (equal(key,hashkey(this->_entries[index].entry.val)))
data/cln-1.3.6/src/base/hash/cl_hashuniq.h:88:17:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
            if (equal(key,hashkey(this->_entries[index].entry.val))) {
data/cln-1.3.6/src/base/hash/cl_rcpointer2_hashweak_rcpointer.h:13:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
static inline bool equal (const cl_rcpointer& x, const cl_rcpointer& y)
data/cln-1.3.6/src/base/hash/cl_rcpointer_hashweak_rcpointer.h:13:20:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
static inline bool equal (const cl_rcpointer& x, const cl_rcpointer& y)
data/cln-1.3.6/src/base/proplist/cl_pl_get.cc:18:7:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		if (equal(l->key,key))
data/cln-1.3.6/src/base/string/cl_st_concat1.cc:17:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    unsigned long len1 = strlen(str1);
data/cln-1.3.6/src/base/string/cl_st_concat1.cc:18:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    unsigned long len2 = strlen(str2);
data/cln-1.3.6/src/base/string/cl_st_concat2.cc:17:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    unsigned long len1 = ::strlen(str1);
data/cln-1.3.6/src/base/string/cl_st_concat2.cc:18:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    unsigned long len2 = strlen(str2);
data/cln-1.3.6/src/base/string/cl_st_concat3.cc:17:26:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    unsigned long len1 = strlen(str1);
data/cln-1.3.6/src/base/string/cl_st_concat3.cc:18:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    unsigned long len2 = ::strlen(str2);
data/cln-1.3.6/src/base/string/cl_st_make1.cc:19:28:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
	var unsigned long len = ::strlen(s);
data/cln-1.3.6/src/complex/elem/cl_C_equal.cc:17:6:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
bool equal (const cl_N& x, const cl_N& y)
data/cln-1.3.6/src/complex/elem/cl_C_equal.cc:29:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(x,y);
data/cln-1.3.6/src/complex/elem/cl_C_equal.cc:35:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(x,realpart(y));
data/cln-1.3.6/src/complex/elem/cl_C_equal.cc:44:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(realpart(x),y);
data/cln-1.3.6/src/complex/elem/cl_C_equal.cc:48:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			if (!equal(realpart(x),realpart(y)))
data/cln-1.3.6/src/complex/elem/cl_C_equal.cc:50:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			if (!equal(imagpart(x),imagpart(y)))
data/cln-1.3.6/src/complex/input/cl_N_read.cc:69:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
		string_limit = string + ::strlen(string);
data/cln-1.3.6/src/complex/ring/cl_C_ring.cc:27:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	return equal(The(cl_N)(x),The(cl_N)(y));
data/cln-1.3.6/src/complex/ring/cl_C_ring.cc:112:2:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	equal,
data/cln-1.3.6/src/float/input/cl_F_read.cc:61:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
		string_limit = string + ::strlen(string);
data/cln-1.3.6/src/float/output/cl_F_dprint.cc:355:23:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
    var uintC las = ::strlen(as); // Länge der Ziffernfolge
data/cln-1.3.6/src/float/output/cl_F_dprint.cc:393:19:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
  var uintC k = ::strlen(as);
data/cln-1.3.6/src/integer/elem/cl_I_equal.cc:17:6:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
bool equal (const cl_I& x, const cl_I& y)
data/cln-1.3.6/src/integer/input/cl_I_read.cc:57:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
		string_limit = string + ::strlen(string);
data/cln-1.3.6/src/integer/ring/cl_I_ring.cc:29:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	return equal(The(cl_I)(x),The(cl_I)(y));
data/cln-1.3.6/src/integer/ring/cl_I_ring.cc:111:2:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	equal,
data/cln-1.3.6/src/modinteger/cl_MI.cc:61:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	return equal(x.rep,y.rep);
data/cln-1.3.6/src/polynomial/elem/cl_UP_number.h:69:12:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
		if (!ops.equal(x[i],y[i]))
data/cln-1.3.6/src/rational/elem/cl_RA_equal.cc:17:6:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
bool equal (const cl_RA& r, const cl_RA& s)
data/cln-1.3.6/src/rational/elem/cl_RA_equal.cc:29:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(r,s);
data/cln-1.3.6/src/rational/elem/cl_RA_equal.cc:41:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			if (!equal(numerator(r),numerator(s)))
data/cln-1.3.6/src/rational/elem/cl_RA_equal.cc:43:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			if (!equal(denominator(r),denominator(s)))
data/cln-1.3.6/src/rational/input/cl_RA_read.cc:60:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
		string_limit = string + ::strlen(string);
data/cln-1.3.6/src/rational/ring/cl_RA_ring.cc:29:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	return equal(The(cl_RA)(x),The(cl_RA)(y));
data/cln-1.3.6/src/rational/ring/cl_RA_ring.cc:111:2:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	equal,
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:18:13:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
inline bool equal (const cl_F& x, const cl_F& y)
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:23:6:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
bool equal (const cl_R& x, const cl_R& y)
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:35:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(x,y);
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:39:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			if (!equal(cl_float(x,y),y))
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:41:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(x,rational(y));
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:47:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			if (!equal(x,cl_float(y,x)))
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:49:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(rational(x),y);
data/cln-1.3.6/src/real/elem/cl_R_equal.cc:51:11:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
			return equal(x,y);
data/cln-1.3.6/src/real/format-output/cl_fmt_integer.cc:29:33:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
	var uintL oldstring_length = ::strlen(oldstring);
data/cln-1.3.6/src/real/format-output/cl_fmt_paddedstring.cc:18:21:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
	var sintL need = ::strlen(str) + minpad; // so viele Zeichen mindestens
data/cln-1.3.6/src/real/input/cl_R_read.cc:67:29:  [1] (buffer) strlen:
  Does not handle strings that are not \0-terminated; if given one it may
  perform an over-read (it could cause a crash if unprotected) (CWE-126).
		string_limit = string + ::strlen(string);
data/cln-1.3.6/src/real/ring/cl_R_ring.cc:28:9:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	return equal(The(cl_R)(x),The(cl_R)(y));
data/cln-1.3.6/src/real/ring/cl_R_ring.cc:113:2:  [1] (buffer) equal:
  Function does not check the second iterator for over-read conditions
  (CWE-126). This function is often discouraged by most C++ coding standards
  in favor of its safer alternatives provided since C++14. Consider using a
  form of this function that checks the second iterator before potentially
  overflowing it.
	equal,

ANALYSIS SUMMARY:

Hits = 217
Lines analyzed = 120615 in approximately 4.16 seconds (29009 lines/second)
Physical Source Lines of Code (SLOC) = 84519
Hits@level = [0]  75 [1] 113 [2]  88 [3]  16 [4]   0 [5]   0
Hits@level+ = [0+] 292 [1+] 217 [2+] 104 [3+]  16 [4+]   0 [5+]   0
Hits/KSLOC@level+ = [0+] 3.45484 [1+] 2.56747 [2+] 1.23049 [3+] 0.189307 [4+]   0 [5+]   0
Dot directories skipped = 1 (--followdotdir overrides)
Minimum risk level = 1
Not every hit is necessarily a security vulnerability.
There may be other security vulnerabilities; review your code!
See 'Secure Programming HOWTO'
(https://dwheeler.com/secure-programs) for more information.