Hi,
Please find the latest report on new defect(s) introduced to LibreOffice found with Coverity Scan.
8 new defect(s) introduced to LibreOffice found with Coverity Scan.
43 defect(s), reported by Coverity Scan earlier, were marked fixed in the recent build analyzed by Coverity Scan.
New defect(s) Reported-by: Coverity Scan
Showing 8 of 8 defect(s)
** CID 1509397: Uninitialized members (UNINIT_CTOR)
/chart2/source/view/axes/VAxisProperties.cxx: 180 in chart::AxisProperties::AxisProperties(rtl::Reference<chart::Axis>, chart::ExplicitCategoriesProvider *, const rtl::Reference<chart::DataTable> &)()
________________________________________________________________________________________________________
*** CID 1509397: Uninitialized members (UNINIT_CTOR)
/chart2/source/view/axes/VAxisProperties.cxx: 180 in chart::AxisProperties::AxisProperties(rtl::Reference<chart::Axis>, chart::ExplicitCategoriesProvider *, const rtl::Reference<chart::DataTable> &)()
174 , m_nAxisType(AxisType::REALNUMBER)
175 , m_bComplexCategories(false)
176 , m_pExplicitCategoriesProvider(pExplicitCategoriesProvider)
177 , m_bLimitSpaceForLabels(false)
178 , m_xDataTableModel(xDataTableModel)
179 {
>>> CID 1509397: Uninitialized members (UNINIT_CTOR)
>>> Non-static class member "m_bDataTableAlignAxisValuesWithColumns" is not initialized in this constructor nor in any functions that it calls.
180 }
181
182 static LabelAlignment lcl_getLabelAlignmentForZAxis( const AxisProperties& rAxisProperties )
183 {
184 LabelAlignment aRet( LABEL_ALIGN_RIGHT );
185 if (rAxisProperties.maLabelAlignment.mfLabelDirection < 0)
** CID 1509396: Null pointer dereferences (FORWARD_NULL)
/qadevOOo/tests/java/ifc/view/_XMultiSelectionSupplier.java: 393 in ifc.view._XMultiSelectionSupplier._createReverseSelectionEnumeration()()
________________________________________________________________________________________________________
*** CID 1509396: Null pointer dereferences (FORWARD_NULL)
/qadevOOo/tests/java/ifc/view/_XMultiSelectionSupplier.java: 393 in ifc.view._XMultiSelectionSupplier._createReverseSelectionEnumeration()()
387 bOK = false;
388 }
389 Object shouldElement = selections[i];
390 i--;
391
392 if (ObjCompare != null) {
>>> CID 1509396: Null pointer dereferences (FORWARD_NULL)
>>> Passing null pointer "nextElement" to "compare", which dereferences it. (The virtual call resolves to "bsh.Reflect.1.compare".)
393 compRes = ObjCompare.compare(shouldElement, nextElement) == 0;
394 } else {
395 compRes = util.ValueComparer.equalValue(shouldElement, nextElement);
396 }
397
398 log.println("nextElement()-object and expected object 'selections["+i+"]' are equal: "+compRes);
** CID 1509395: Null pointer dereferences (FORWARD_NULL)
/qadevOOo/tests/java/ifc/view/_XMultiSelectionSupplier.java: 322 in ifc.view._XMultiSelectionSupplier._createSelectionEnumeration()()
________________________________________________________________________________________________________
*** CID 1509395: Null pointer dereferences (FORWARD_NULL)
/qadevOOo/tests/java/ifc/view/_XMultiSelectionSupplier.java: 322 in ifc.view._XMultiSelectionSupplier._createSelectionEnumeration()()
316 bOK = false;
317 }
318 Object shouldElement = selections[i];
319 i++;
320
321 if (ObjCompare != null) {
>>> CID 1509395: Null pointer dereferences (FORWARD_NULL)
>>> Passing null pointer "nextElement" to "compare", which dereferences it. (The virtual call resolves to "bsh.Reflect.1.compare".)
322 compRes = ObjCompare.compare(shouldElement, nextElement) == 0;
323 } else {
324 compRes = util.ValueComparer.equalValue(shouldElement, nextElement);
325 }
326
327 log.println("nextElement()-object and expected object 'selections["+i+"]' are equal: "+compRes);
** CID 1509394: (USE_AFTER_MOVE)
/usr/include/c++/11/bits/unordered_map.h: 659 in std::unordered_map<rtl::OUString, NameSpaceEntry, std::hash<rtl::OUString>, std::equal_to<rtl::OUString>, std::allocator<std::pair<const rtl::OUString, NameSpaceEntry>>>::insert_or_assign<NameSpaceEntry>(const rtl::OUString &, T1 &&)()
/usr/include/c++/11/bits/unordered_map.h: 659 in std::unordered_map<unsigned short, KeyToNameSpaceMapEntry, std::hash<unsigned short>, std::equal_to<unsigned short>, std::allocator<std::pair<const unsigned short, KeyToNameSpaceMapEntry>>>::insert_or_assign<KeyToNameSpaceMapEntry>(const unsigned short &, T1 &&)()
________________________________________________________________________________________________________
*** CID 1509394: (USE_AFTER_MOVE)
/usr/include/c++/11/bits/unordered_map.h: 659 in std::unordered_map<rtl::OUString, NameSpaceEntry, std::hash<rtl::OUString>, std::equal_to<rtl::OUString>, std::allocator<std::pair<const rtl::OUString, NameSpaceEntry>>>::insert_or_assign<NameSpaceEntry>(const rtl::OUString &, T1 &&)()
653 pair<iterator, bool>
654 insert_or_assign(const key_type& __k, _Obj&& __obj)
655 {
656 auto __ret = _M_h.try_emplace(cend(), __k,
657 std::forward<_Obj>(__obj));
658 if (!__ret.second)
>>> CID 1509394: (USE_AFTER_MOVE)
>>> "__obj" is used after it has been already moved.
659 __ret.first->second = std::forward<_Obj>(__obj);
660 return __ret;
661 }
662
663 // move-capable overload
664 template <typename _Obj>
/usr/include/c++/11/bits/unordered_map.h: 659 in std::unordered_map<unsigned short, KeyToNameSpaceMapEntry, std::hash<unsigned short>, std::equal_to<unsigned short>, std::allocator<std::pair<const unsigned short, KeyToNameSpaceMapEntry>>>::insert_or_assign<KeyToNameSpaceMapEntry>(const unsigned short &, T1 &&)()
653 pair<iterator, bool>
654 insert_or_assign(const key_type& __k, _Obj&& __obj)
655 {
656 auto __ret = _M_h.try_emplace(cend(), __k,
657 std::forward<_Obj>(__obj));
658 if (!__ret.second)
>>> CID 1509394: (USE_AFTER_MOVE)
>>> "__obj" is used after it has been already moved.
659 __ret.first->second = std::forward<_Obj>(__obj);
660 return __ret;
661 }
662
663 // move-capable overload
664 template <typename _Obj>
** CID 1509393: Uninitialized variables (UNINIT)
/workdir/YaccTarget/unoidl/source/sourceprovider-parser.cxx: 2410 in yyparse(void *)()
________________________________________________________________________________________________________
*** CID 1509393: Uninitialized variables (UNINIT)
/workdir/YaccTarget/unoidl/source/sourceprovider-parser.cxx: 2410 in yyparse(void *)()
2404
2405 Otherwise, the following line sets YYVAL to garbage.
2406 This behavior is undocumented and Bison
2407 users should not rely upon it. Assigning to YYVAL
2408 unconditionally makes the parser a bit smaller, and it avoids a
2409 GCC warning that YYVAL may be used uninitialized. */
>>> CID 1509393: Uninitialized variables (UNINIT)
>>> Using uninitialized value "yyvsp[1 - yylen]".
2410 yyval = yyvsp[1-yylen];
2411
2412 /* Default location. */
2413 YYLLOC_DEFAULT (yyloc, (yylsp - yylen), yylen);
2414 yyerror_range[1] = yyloc;
2415 YY_REDUCE_PRINT (yyn);
** CID 1498454: (CTOR_DTOR_LEAK)
________________________________________________________________________________________________________
*** CID 1498454: (CTOR_DTOR_LEAK)
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OString, std::pair<const rtl::OString, short>, std::allocator<std::pair<const rtl::OString, short>>, std::__detail::_Select1st, std::equal_to<rtl::OString>, std::hash<rtl::OString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OString, short> *>(T1, T1, unsigned long, const std::hash<rtl::OString> &, const std::equal_to<rtl::OString> &, const std::allocator<std::pair<const rtl::OString, short>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OUString, std::pair<const rtl::OUString, writerfilter::dmapper::<unnamed>::FieldConversion>, std::allocator<std::pair<const rtl::OUString, writerfilter::dmapper::<unnamed>::FieldConversion>>, std::__detail::_Select1st, std::equal_to<rtl::OUString>, std::hash<rtl::OUString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OUString, writerfilter::dmapper::<unnamed>::FieldConversion> *>(T1, T1, unsigned long, const std::hash<rtl::OUString> &, const std::equal_to<rtl::OUString> &, const std::allocator<std::pair<const rtl::OUString, writerfilter::dmapper::<unnamed>::FieldConversion>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<const char *, std::pair<const char *const , oox::drawingml::ShapeExport &(oox::drawingml::ShapeExport::*)(const com::sun::star::uno::Reference<com::sun::star::drawing::XShape> &)>, std::allocator<std::pair<const char *const , oox::drawingml::ShapeExport &(oox::drawingml::ShapeExport::*)(const com::sun::star::uno::Reference<com::sun::star::drawing::XShape> &)>>, std::__detail::_Select1st, rtl::CStringEqual, rtl::CStringHash, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const char *const , oox::drawingml::ShapeExport &(oox::drawingml::ShapeExport::*)(const com::sun::star::uno::Reference<com::sun::star::drawing::XShape> &)> *>(T1, T1, unsigned long, const rtl::CStringHash &, const rtl::CStringEqual &, const std::allocator<std::pair<const char *const , oox::drawingml::ShapeExport &(oox::drawingml::ShapeExport::*)(const com::sun::star::uno::Reference<com::sun::star::drawing::XShape> &)>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OUString, std::pair<const rtl::OUString, ww::eField>, std::allocator<std::pair<const rtl::OUString, ww::eField>>, std::__detail::_Select1st, std::equal_to<rtl::OUString>, std::hash<rtl::OUString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OUString, ww::eField> *>(T1, T1, unsigned long, const std::hash<rtl::OUString> &, const std::equal_to<rtl::OUString> &, const std::allocator<std::pair<const rtl::OUString, ww::eField>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<std::basic_string_view<char16_t, std::char_traits<char16_t>>, std::pair<const std::basic_string_view<char16_t, std::char_traits<char16_t>>, rtl::OString>, std::allocator<std::pair<const std::basic_string_view<char16_t, std::char_traits<char16_t>>, rtl::OString>>, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char16_t, std::char_traits<char16_t>>>, std::hash<std::basic_string_view<char16_t, std::char_traits<char16_t>>>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const std::basic_string_view<char16_t, std::char_traits<char16_t>>, rtl::OString> *>(T1, T1, unsigned long, const std::hash<std::basic_string_view<char16_t, std::char_traits<char16_t>>> &, const std::equal_to<std::basic_string_view<char16_t, std::char_traits<char16_t>>> &, const std::allocator<std::pair<const std::basic_string_view<char16_t, std::char_traits<char16_t>>, rtl::OString>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OUString, std::pair<const rtl::OUString, Color>, std::allocator<std::pair<const rtl::OUString, Color>>, std::__detail::_Select1st, std::equal_to<rtl::OUString>, std::hash<rtl::OUString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OUString, Color> *>(T1, T1, unsigned long, const std::hash<rtl::OUString> &, const std::equal_to<rtl::OUString> &, const std::allocator<std::pair<const rtl::OUString, Color>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OUString, std::pair<const rtl::OUString, SdrObjKind>, std::allocator<std::pair<const rtl::OUString, SdrObjKind>>, std::__detail::_Select1st, std::equal_to<rtl::OUString>, std::hash<rtl::OUString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OUString, SdrObjKind> *>(T1, T1, unsigned long, const std::hash<rtl::OUString> &, const std::equal_to<rtl::OUString> &, const std::allocator<std::pair<const rtl::OUString, SdrObjKind>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OUString, std::pair<const rtl::OUString, svgio::svgreader::SVGToken>, std::allocator<std::pair<const rtl::OUString, svgio::svgreader::SVGToken>>, std::__detail::_Select1st, std::equal_to<rtl::OUString>, std::hash<rtl::OUString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OUString, svgio::svgreader::SVGToken> *>(T1, T1, unsigned long, const std::hash<rtl::OUString> &, const std::equal_to<rtl::OUString> &, const std::allocator<std::pair<const rtl::OUString, svgio::svgreader::SVGToken>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OString, std::pair<const rtl::OString, ControlType>, std::allocator<std::pair<const rtl::OString, ControlType>>, std::__detail::_Select1st, std::equal_to<rtl::OString>, std::hash<rtl::OString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OString, ControlType> *>(T1, T1, unsigned long, const std::hash<rtl::OString> &, const std::equal_to<rtl::OString> &, const std::allocator<std::pair<const rtl::OString, ControlType>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OUString, std::pair<const rtl::OUString, MathMLMathvariantValue>, std::allocator<std::pair<const rtl::OUString, MathMLMathvariantValue>>, std::__detail::_Select1st, std::equal_to<rtl::OUString>, std::hash<rtl::OUString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OUString, MathMLMathvariantValue> *>(T1, T1, unsigned long, const std::hash<rtl::OUString> &, const std::equal_to<rtl::OUString> &, const std::allocator<std::pair<const rtl::OUString, MathMLMathvariantValue>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OString, std::pair<const rtl::OString, Color *>, std::allocator<std::pair<const rtl::OString, Color *>>, std::__detail::_Select1st, std::equal_to<rtl::OString>, std::hash<rtl::OString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OString, Color *> *>(T1, T1, unsigned long, const std::hash<rtl::OString> &, const std::equal_to<rtl::OString> &, const std::allocator<std::pair<const rtl::OString, Color *>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<std::basic_string_view<char, std::char_traits<char>>, std::pair<const std::basic_string_view<char, std::char_traits<char>>, MSO_SPT>, std::allocator<std::pair<const std::basic_string_view<char, std::char_traits<char>>, MSO_SPT>>, std::__detail::_Select1st, std::equal_to<std::basic_string_view<char, std::char_traits<char>>>, std::hash<std::basic_string_view<char, std::char_traits<char>>>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const std::basic_string_view<char, std::char_traits<char>>, MSO_SPT> *>(T1, T1, unsigned long, const std::hash<std::basic_string_view<char, std::char_traits<char>>> &, const std::equal_to<std::basic_string_view<char, std::char_traits<char>>> &, const std::allocator<std::pair<const std::basic_string_view<char, std::char_traits<char>>, MSO_SPT>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<SfxGroupId, std::pair<const SfxGroupId, short>, std::allocator<std::pair<const SfxGroupId, short>>, std::__detail::_Select1st, std::equal_to<SfxGroupId>, std::hash<SfxGroupId>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const SfxGroupId, short> *>(T1, T1, unsigned long, const std::hash<SfxGroupId> &, const std::equal_to<SfxGroupId> &, const std::allocator<std::pair<const SfxGroupId, short>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
/usr/include/c++/11/bits/hashtable.h: 1145 in std::_Hashtable<rtl::OString, std::pair<const rtl::OString, rtl::OString *>, std::allocator<std::pair<const rtl::OString, rtl::OString *>>, std::__detail::_Select1st, std::equal_to<rtl::OString>, std::hash<rtl::OString>, std::__detail::_Mod_range_hashing, std::__detail::_Default_ranged_hash, std::__detail::_Prime_rehash_policy, std::__detail::_Hashtable_traits<(bool)1, (bool)0, (bool)1>>::_Hashtable<const std::pair<const rtl::OString, rtl::OString *> *>(T1, T1, unsigned long, const std::hash<rtl::OString> &, const std::equal_to<rtl::OString> &, const std::allocator<std::pair<const rtl::OString, rtl::OString *>>&, std::integral_constant<bool, (bool)1>)()
1139 _Hashtable<_Key, _Value, _Alloc, _ExtractKey, _Equal,
1140 _Hash, _RangeHash, _Unused, _RehashPolicy, _Traits>::
1141 _Hashtable(_InputIterator __f, _InputIterator __l,
1142 size_type __bkt_count_hint,
1143 const _Hash& __h, const _Equal& __eq,
1144 const allocator_type& __a, true_type /* __uks */)
>>> CID 1498454: (CTOR_DTOR_LEAK)
>>> Calling allocation function "_Hashtable".
1145 : _Hashtable(__bkt_count_hint, __h, __eq, __a)
1146 {
1147 for (; __f != __l; ++__f)
1148 this->insert(*__f);
1149 }
1150
** CID 1485150: Error handling issues (UNCAUGHT_EXCEPT)
/usr/include/c++/11/optional: 257 in std::_Optional_payload_base<SwCalc>::_M_destroy()()
________________________________________________________________________________________________________
*** CID 1485150: Error handling issues (UNCAUGHT_EXCEPT)
/usr/include/c++/11/optional: 257 in std::_Optional_payload_base<SwCalc>::_M_destroy()()
251 std::_Construct(std::__addressof(this->_M_payload._M_value),
252 std::forward<_Args>(__args)...);
253 this->_M_engaged = true;
254 }
255
256 constexpr void
>>> CID 1485150: Error handling issues (UNCAUGHT_EXCEPT)
>>> An exception of type "com::sun::star::uno::RuntimeException" is thrown but the exception specification "noexcept" doesn't allow it to be thrown. This will result in a call to terminate().
257 _M_destroy() noexcept
258 {
259 _M_engaged = false;
260 _M_payload._M_value.~_Stored_type();
261 }
262
** CID 256964: Uninitialized members (UNINIT_CTOR)
/usr/include/box2d/b2_math.h: 44 in b2Vec2::b2Vec2()()
________________________________________________________________________________________________________
*** CID 256964: Uninitialized members (UNINIT_CTOR)
/usr/include/box2d/b2_math.h: 44 in b2Vec2::b2Vec2()()
38 #define b2Atan2(y, x) atan2f(y, x)
39
40 /// A 2D column vector.
41 struct B2_API b2Vec2
42 {
43 /// Default constructor does nothing (for performance).
>>> CID 256964: Uninitialized members (UNINIT_CTOR)
>>> Non-static class member "y" is not initialized in this constructor nor in any functions that it calls.
44 b2Vec2() {}
45
46 /// Construct using coordinates.
47 b2Vec2(float xIn, float yIn) : x(xIn), y(yIn) {}
48
49 /// Set this vector to all zeros.
________________________________________________________________________________________________________
To view the defects in Coverity Scan visit, https://u15810271.ct.sendgrid.net/ls/click?upn=HRESupC-2F2Czv4BOaCWWCy7my0P0qcxCbhZ31OYv50ypSs1kiFPuCn2xFdlMIFBirii0zZ9j2-2F9F2XPBcBm2BNgi9duPy3v-2FzgFDd2LJ-2BDKI-3D4W5J_OTq2XUZbbipYjyLSo6GRo-2FpVxQ9OzkDINu9UTS-2FQhSdO0F0jQniitrGlNxDIzPJiq-2Fre6FrJ79sZRe-2B0-2FEm-2FbE37QIa-2F2RHM3gpFX9iYvW70LZj9ZkFpuRecrPL4cuZsCBLyOLkTFDcmwQpUS-2B16W4e5lWWEFdUwM-2FoHy3ffkacdWYWhO6YZFEuzJ7iY-2BJB2-2BW1fMKYFOuHkE2rY1iXeFOYojl7-2BBnz9jSCwBE3U4-2Bs-3D
New Defects reported by Coverity Scan for LibreOffice
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
- Subject: New Defects reported by Coverity Scan for LibreOffice
- From: scan-admin@xxxxxxxxxxxx
- Date: Thu, 18 Aug 2022 00:34:51 +0000 (UTC)
- Prev by Date: Minutes from the UX/design meeting 2022-Aug-17
- Next by Date: Re: Fields for Zotero
- Previous by thread: Re: New Defects reported by Coverity Scan for LibreOffice
- Next by thread: New Defects reported by Coverity Scan for LibreOffice
- Index(es):
 |