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/maude-3.1/src/Main/main.cc
Examining data/maude-3.1/src/Higher/sortTestConditionFragment.cc
Examining data/maude-3.1/src/Higher/modelCheckerSymbol.cc
Examining data/maude-3.1/src/Higher/rewriteSearchState.cc
Examining data/maude-3.1/src/Higher/variantUnifierFilter.cc
Examining data/maude-3.1/src/Higher/assignmentConditionState.cc
Examining data/maude-3.1/src/Higher/matchSearchState.cc
Examining data/maude-3.1/src/Higher/variantSearch.cc
Examining data/maude-3.1/src/Higher/assignmentConditionFragment.cc
Examining data/maude-3.1/src/Higher/narrowingSequenceSearch.cc
Examining data/maude-3.1/src/Higher/pattern.cc
Examining data/maude-3.1/src/Higher/stateTransitionGraph.cc
Examining data/maude-3.1/src/Higher/rewriteSequenceSearch.cc
Examining data/maude-3.1/src/Higher/satSolverSymbol.cc
Examining data/maude-3.1/src/Higher/narrowingSequenceSearch3.cc
Examining data/maude-3.1/src/Higher/variantMatchingProblem.cc
Examining data/maude-3.1/src/Higher/positionState.cc
Examining data/maude-3.1/src/Higher/searchState.cc
Examining data/maude-3.1/src/Higher/narrowingSearchState2.cc
Examining data/maude-3.1/src/Higher/narrowingSearchState3.cc
Examining data/maude-3.1/src/Higher/irredundantUnificationProblem.cc
Examining data/maude-3.1/src/Higher/narrowingUnificationProblem.cc
Examining data/maude-3.1/src/Higher/equalityConditionFragment.cc
Examining data/maude-3.1/src/Higher/rewriteConditionState.cc
Examining data/maude-3.1/src/Higher/narrowingFolder.cc
Examining data/maude-3.1/src/Higher/filteredVariantUnifierSearch.cc
Examining data/maude-3.1/src/Higher/unifierFilter.cc
Examining data/maude-3.1/src/Higher/unificationProblem.cc
Examining data/maude-3.1/src/Higher/narrowingSearchState.cc
Examining data/maude-3.1/src/Higher/variantUnificationProblem.cc
Examining data/maude-3.1/src/Higher/temporalSymbol.cc
Examining data/maude-3.1/src/Higher/variantNarrowingSearchState.cc
Examining data/maude-3.1/src/Higher/variantFolder.cc
Examining data/maude-3.1/src/Higher/rewriteConditionFragment.cc
Examining data/maude-3.1/src/AU_Theory/AU_LhsCompiler.cc
Examining data/maude-3.1/src/AU_Theory/AU_ExtensionInfo.cc
Examining data/maude-3.1/src/AU_Theory/AU_RhsAutomaton.cc
Examining data/maude-3.1/src/AU_Theory/AU_Layer.cc
Examining data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc
Examining data/maude-3.1/src/AU_Theory/AU_Term.cc
Examining data/maude-3.1/src/AU_Theory/AU_DequeDagArgumentIterator.cc
Examining data/maude-3.1/src/AU_Theory/AU_Symbol.cc
Examining data/maude-3.1/src/AU_Theory/AU_FullMatcher.cc
Examining data/maude-3.1/src/AU_Theory/AU_DagNode.cc
Examining data/maude-3.1/src/AU_Theory/AU_ArgumentIterator.cc
Examining data/maude-3.1/src/AU_Theory/AU_Normalize.cc
Examining data/maude-3.1/src/AU_Theory/AU_DagOperations.cc
Examining data/maude-3.1/src/AU_Theory/AU_Subproblem.cc
Examining data/maude-3.1/src/AU_Theory/AU_LhsAutomaton.cc
Examining data/maude-3.1/src/AU_Theory/AU_UnificationSubproblem2.cc
Examining data/maude-3.1/src/AU_Theory/AU_Matcher.cc
Examining data/maude-3.1/src/AU_Theory/AU_DagArgumentIterator.cc
Examining data/maude-3.1/src/AU_Theory/AU_DequeDagNode.cc
Examining data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc
Examining data/maude-3.1/src/AU_Theory/AU_GreedyMatcher.cc
Examining data/maude-3.1/src/BuiltIn/stringDagNode.cc
Examining data/maude-3.1/src/BuiltIn/divisionSymbol.cc
Examining data/maude-3.1/src/BuiltIn/CUI_NumberOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/floatDagNode.cc
Examining data/maude-3.1/src/BuiltIn/stringTerm.cc
Examining data/maude-3.1/src/BuiltIn/counterSymbol.cc
Examining data/maude-3.1/src/BuiltIn/matrixOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/equalitySymbol.cc
Examining data/maude-3.1/src/BuiltIn/matrixOpSignature.cc
Examining data/maude-3.1/src/BuiltIn/minusSymbol.cc
Examining data/maude-3.1/src/BuiltIn/randomOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/numberOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/floatOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/succSymbol.cc
Examining data/maude-3.1/src/BuiltIn/equalityExtor.cc
Examining data/maude-3.1/src/BuiltIn/equalityExtorFinal.cc
Examining data/maude-3.1/src/BuiltIn/stringSymbol.cc
Examining data/maude-3.1/src/BuiltIn/branchSymbol.cc
Examining data/maude-3.1/src/BuiltIn/floatSymbol.cc
Examining data/maude-3.1/src/BuiltIn/sortTestSymbol.cc
Examining data/maude-3.1/src/BuiltIn/ACU_NumberOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/stringOpSymbol.cc
Examining data/maude-3.1/src/BuiltIn/floatTerm.cc
Examining data/maude-3.1/src/IO_Stuff/directoryManager.cc
Examining data/maude-3.1/src/IO_Stuff/IO_Manager.cc
Examining data/maude-3.1/src/IO_Stuff/autoWrapBuffer.cc
Examining data/maude-3.1/src/Variable/variableLhsAutomaton.cc
Examining data/maude-3.1/src/Variable/variableSymbol.cc
Examining data/maude-3.1/src/Variable/variableDagNode.cc
Examining data/maude-3.1/src/Variable/variableTerm.cc
Examining data/maude-3.1/src/AU_Persistent/AU_StackSort.cc
Examining data/maude-3.1/src/AU_Persistent/AU_Deque.cc
Examining data/maude-3.1/src/AU_Persistent/AU_StackArgVec.cc
Examining data/maude-3.1/src/AU_Persistent/AU_StackNode.cc
Examining data/maude-3.1/src/AU_Persistent/AU_DequeIter.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_Symbol.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_LhsAutomaton.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_Matcher.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_RhsAutomaton.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_DagArgumentIterator.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_LhsCompiler.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem2.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_Term.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem.cc
Examining data/maude-3.1/src/CUI_Theory/CUI_ArgumentIterator.cc
Examining data/maude-3.1/src/Parser/compile2.cc
Examining data/maude-3.1/src/Parser/compile.cc
Examining data/maude-3.1/src/Parser/pass1.cc
Examining data/maude-3.1/src/Parser/drp.cc
Examining data/maude-3.1/src/Parser/bubble.cc
Examining data/maude-3.1/src/Parser/parser.cc
Examining data/maude-3.1/src/Parser/pass2.cc
Examining data/maude-3.1/src/Mixfix/viewCache.cc
Examining data/maude-3.1/src/Mixfix/moduleDatabase.cc
Examining data/maude-3.1/src/Mixfix/doParse.cc
Examining data/maude-3.1/src/Mixfix/xmlBuffer.cc
Examining data/maude-3.1/src/Mixfix/interpreter.cc
Examining data/maude-3.1/src/Mixfix/execute.cc
Examining data/maude-3.1/src/Mixfix/prettyPrint.cc
Examining data/maude-3.1/src/Mixfix/unify.cc
Examining data/maude-3.1/src/Mixfix/importTranslation.cc
Examining data/maude-3.1/src/Mixfix/enclosingObject.cc
Examining data/maude-3.1/src/Mixfix/fixUp.cc
Examining data/maude-3.1/src/Mixfix/auxProperty.cc
Examining data/maude-3.1/src/Mixfix/narrowing.cc
Examining data/maude-3.1/src/Mixfix/viewDatabase.cc
Examining data/maude-3.1/src/Mixfix/smtSearch.cc
Examining data/maude-3.1/src/Mixfix/metadataStore.cc
Examining data/maude-3.1/src/Mixfix/moduleCache.cc
Examining data/maude-3.1/src/Mixfix/ops.cc
Examining data/maude-3.1/src/Mixfix/userLevelRewritingContext.cc
Examining data/maude-3.1/src/Mixfix/instantiateModuleWithBoundParameters.cc
Examining data/maude-3.1/src/Mixfix/graphPrint.cc
Examining data/maude-3.1/src/Mixfix/printAttribute.cc
Examining data/maude-3.1/src/Mixfix/strategyTranslation.cc
Examining data/maude-3.1/src/Mixfix/command.cc
Examining data/maude-3.1/src/Mixfix/instantiateViewWithBoundParameters.cc
Examining data/maude-3.1/src/Mixfix/quotedIdentifierDagNode.cc
Examining data/maude-3.1/src/Mixfix/instantiateViewWithFreeParameters.cc
Examining data/maude-3.1/src/Mixfix/search.cc
Examining data/maude-3.1/src/Mixfix/moduleExpression.cc
Examining data/maude-3.1/src/Mixfix/loopSymbol.cc
Examining data/maude-3.1/src/Mixfix/entity.cc
Examining data/maude-3.1/src/Mixfix/specialTokens.cc
Examining data/maude-3.1/src/Mixfix/match.cc
Examining data/maude-3.1/src/Mixfix/makeGrammar.cc
Examining data/maude-3.1/src/Mixfix/token.cc
Examining data/maude-3.1/src/Mixfix/lexer.cc
Examining data/maude-3.1/src/Mixfix/termPrint.cc
Examining data/maude-3.1/src/Mixfix/parameterDatabase.cc
Examining data/maude-3.1/src/Mixfix/interact.cc
Examining data/maude-3.1/src/Mixfix/mixfixParser.cc
Examining data/maude-3.1/src/Mixfix/trial.cc
Examining data/maude-3.1/src/Mixfix/preModule.cc
Examining data/maude-3.1/src/Mixfix/renaming.cc
Examining data/maude-3.1/src/Mixfix/instantiateModuleWithFreeParameters.cc
Examining data/maude-3.1/src/Mixfix/entry.cc
Examining data/maude-3.1/src/Mixfix/quotedIdentifierOpSignature.cc
Examining data/maude-3.1/src/Mixfix/variantUnify.cc
Examining data/maude-3.1/src/Mixfix/variableGenerator.cc
Examining data/maude-3.1/src/Mixfix/profileModule.cc
Examining data/maude-3.1/src/Mixfix/quotedIdentifierOpSymbol.cc
Examining data/maude-3.1/src/Mixfix/view.cc
Examining data/maude-3.1/src/Mixfix/quotedIdentifierTerm.cc
Examining data/maude-3.1/src/Mixfix/maudemlBuffer.cc
Examining data/maude-3.1/src/Mixfix/erewrite.cc
Examining data/maude-3.1/src/Mixfix/specialSymbolTypes.cc
Examining data/maude-3.1/src/Mixfix/dagNodePrint.cc
Examining data/maude-3.1/src/Mixfix/sharedTokens.cc
Examining data/maude-3.1/src/Mixfix/freshVariableSource.cc
Examining data/maude-3.1/src/Mixfix/importModule.cc
Examining data/maude-3.1/src/Mixfix/renameModule.cc
Examining data/maude-3.1/src/Mixfix/syntacticView.cc
Examining data/maude-3.1/src/Mixfix/compiler.cc
Examining data/maude-3.1/src/Mixfix/srewrite.cc
Examining data/maude-3.1/src/Mixfix/syntacticPreModule.cc
Examining data/maude-3.1/src/Mixfix/variantMatch.cc
Examining data/maude-3.1/src/Mixfix/cvc4_Bindings.cc
Examining data/maude-3.1/src/Mixfix/bufferPrint.cc
Examining data/maude-3.1/src/Mixfix/ansiEscapeSequences.cc
Examining data/maude-3.1/src/Mixfix/quotedIdentifierSymbol.cc
Examining data/maude-3.1/src/Mixfix/tokenizer.cc
Examining data/maude-3.1/src/Mixfix/surface.cc
Examining data/maude-3.1/src/Mixfix/strategyPrint.cc
Examining data/maude-3.1/src/Mixfix/yices2_Bindings.cc
Examining data/maude-3.1/src/Mixfix/fileTable.cc
Examining data/maude-3.1/src/Mixfix/getVariants.cc
Examining data/maude-3.1/src/Mixfix/mixfixModule.cc
Examining data/maude-3.1/src/Mixfix/sharedPrint.cc
Examining data/maude-3.1/src/Mixfix/syntaxContainer.cc
Examining data/maude-3.1/src/Mixfix/visibleModule.cc
Examining data/maude-3.1/src/Mixfix/loopMode.cc
Examining data/maude-3.1/src/Mixfix/parameterization.cc
Examining data/maude-3.1/src/Mixfix/process.cc
Examining data/maude-3.1/src/Mixfix/symbolType.cc
Examining data/maude-3.1/src/Mixfix/viewExpression.cc
Examining data/maude-3.1/src/Mixfix/global.cc
Examining data/maude-3.1/src/Mixfix/lexerAux.cc
Examining data/maude-3.1/src/Mixfix/banner.cc
Examining data/maude-3.1/src/ObjectSystem/pseudoThreadSignal.cc
Examining data/maude-3.1/src/ObjectSystem/configSymbol.cc
Examining data/maude-3.1/src/ObjectSystem/processActions.cc
Examining data/maude-3.1/src/ObjectSystem/externalObjectManagerSymbol.cc
Examining data/maude-3.1/src/ObjectSystem/processSignature.cc
Examining data/maude-3.1/src/ObjectSystem/fileSignature.cc
Examining data/maude-3.1/src/ObjectSystem/streamSignature.cc
Examining data/maude-3.1/src/ObjectSystem/fileOutcomes.cc
Examining data/maude-3.1/src/ObjectSystem/pseudoThread-pselect.cc
Examining data/maude-3.1/src/ObjectSystem/objectMap.cc
Examining data/maude-3.1/src/ObjectSystem/socketManagerSymbol.cc
Examining data/maude-3.1/src/ObjectSystem/remainder.cc
Examining data/maude-3.1/src/ObjectSystem/socketStuff.cc
Examining data/maude-3.1/src/ObjectSystem/fileManagerSymbol.cc
Examining data/maude-3.1/src/ObjectSystem/supportedSignals.cc
Examining data/maude-3.1/src/ObjectSystem/pseudoThread.cc
Examining data/maude-3.1/src/ObjectSystem/socketAsync.cc
Examining data/maude-3.1/src/ObjectSystem/streamManagerSymbol.cc
Examining data/maude-3.1/src/ObjectSystem/processStuff.cc
Examining data/maude-3.1/src/ObjectSystem/pseudoThread-ppoll.cc
Examining data/maude-3.1/src/ObjectSystem/fileActions.cc
Examining data/maude-3.1/src/ObjectSystem/socketOutcomes.cc
Examining data/maude-3.1/src/ObjectSystem/processOutcomes.cc
Examining data/maude-3.1/src/ObjectSystem/processManagerSymbol.cc
Examining data/maude-3.1/src/ObjectSystem/objectSystemRewritingContext.cc
Examining data/maude-3.1/src/ObjectSystem/socketSignature.cc
Examining data/maude-3.1/src/FreeTheory/freeRhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeTerm.cc
Examining data/maude-3.1/src/FreeTheory/freeGeneralCtor.cc
Examining data/maude-3.1/src/FreeTheory/freePositionTable.cc
Examining data/maude-3.1/src/FreeTheory/freeNullaryRhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeArgumentIterator.cc
Examining data/maude-3.1/src/FreeTheory/freePreNetSemiCompiler.cc
Examining data/maude-3.1/src/FreeTheory/freeNullarySymbol.cc
Examining data/maude-3.1/src/FreeTheory/freeGeneralCtorFinal.cc
Examining data/maude-3.1/src/FreeTheory/freeFast3RhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeBinarySymbol.cc
Examining data/maude-3.1/src/FreeTheory/freeFast2RhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freePreNetFullCompiler.cc
Examining data/maude-3.1/src/FreeTheory/freePreNetSubsumption.cc
Examining data/maude-3.1/src/FreeTheory/freeLhsCompiler.cc
Examining data/maude-3.1/src/FreeTheory/freePreNet.cc
Examining data/maude-3.1/src/FreeTheory/freeInstruction.cc
Examining data/maude-3.1/src/FreeTheory/freeTernaryRhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeNetExec.cc
Examining data/maude-3.1/src/FreeTheory/freeTermFullCompiler.cc
Examining data/maude-3.1/src/FreeTheory/freeGeneralExtorFinal.cc
Examining data/maude-3.1/src/FreeTheory/freeRemainder.cc
Examining data/maude-3.1/src/FreeTheory/freeLhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeTernarySymbol.cc
Examining data/maude-3.1/src/FreeTheory/freeFastInstruction.cc
Examining data/maude-3.1/src/FreeTheory/freeBinaryRhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeNet.cc
Examining data/maude-3.1/src/FreeTheory/freeGeneralExtor.cc
Examining data/maude-3.1/src/FreeTheory/freeDagArgumentIterator.cc
Examining data/maude-3.1/src/FreeTheory/freeUnarySymbol.cc
Examining data/maude-3.1/src/FreeTheory/freeSymbol.cc
Examining data/maude-3.1/src/FreeTheory/freeUnaryRhsAutomaton.cc
Examining data/maude-3.1/src/FreeTheory/freeDagNode.cc
Examining data/maude-3.1/src/Temporal/genBuchiAutomaton.cc
Examining data/maude-3.1/src/Temporal/collapseStates.cc
Examining data/maude-3.1/src/Temporal/buchiAutomaton2.cc
Examining data/maude-3.1/src/Temporal/veryWeakAlternatingAutomaton.cc
Examining data/maude-3.1/src/Temporal/rawTransitionSet.cc
Examining data/maude-3.1/src/Temporal/sccAnalysis.cc
Examining data/maude-3.1/src/Temporal/logicFormula.cc
Examining data/maude-3.1/src/Temporal/satSolve.cc
Examining data/maude-3.1/src/Temporal/transitionSet.cc
Examining data/maude-3.1/src/Temporal/sccOptimizations.cc
Examining data/maude-3.1/src/Temporal/modelChecker2.cc
Examining data/maude-3.1/src/S_Theory/S_Subproblem.cc
Examining data/maude-3.1/src/S_Theory/S_ArgumentIterator.cc
Examining data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc
Examining data/maude-3.1/src/S_Theory/S_RhsAutomaton.cc
Examining data/maude-3.1/src/S_Theory/S_ExtensionInfo.cc
Examining data/maude-3.1/src/S_Theory/S_DagArgumentIterator.cc
Examining data/maude-3.1/src/S_Theory/S_Symbol.cc
Examining data/maude-3.1/src/S_Theory/S_DagNode.cc
Examining data/maude-3.1/src/S_Theory/S_Term.cc
Examining data/maude-3.1/src/Utility/unionFind.cc
Examining data/maude-3.1/src/Utility/binBuf.cc
Examining data/maude-3.1/src/Utility/indent.cc
Examining data/maude-3.1/src/Utility/digraph.cc
Examining data/maude-3.1/src/Utility/wordLevel-simplifyEquations.cc
Examining data/maude-3.1/src/Utility/pigPug-checks.cc
Examining data/maude-3.1/src/Utility/stringTable.cc
Examining data/maude-3.1/src/Utility/wordLevel-feasible.cc
Examining data/maude-3.1/src/Utility/bdd.cc
Examining data/maude-3.1/src/Utility/bddUser.cc
Examining data/maude-3.1/src/Utility/macros.cc
Examining data/maude-3.1/src/Utility/intSet.cc
Examining data/maude-3.1/src/Utility/sequencePartition.cc
Examining data/maude-3.1/src/Utility/mpzContejeanDevie.cc
Examining data/maude-3.1/src/Utility/mpzSystem.cc
Examining data/maude-3.1/src/Utility/intSystem.cc
Examining data/maude-3.1/src/Utility/mpzGcdTrivial.cc
Examining data/maude-3.1/src/Utility/rope.cc
Examining data/maude-3.1/src/Utility/wordLevel-simplifyAssignments.cc
Examining data/maude-3.1/src/Utility/wordLevel-null.cc
Examining data/maude-3.1/src/Utility/pointerMap.cc
Examining data/maude-3.1/src/Utility/pigPug.cc
Examining data/maude-3.1/src/Utility/pointerSet.cc
Examining data/maude-3.1/src/Utility/intContejeanDevie.cc
Examining data/maude-3.1/src/Utility/sequenceAssignment.cc
Examining data/maude-3.1/src/Utility/tty.cc
Examining data/maude-3.1/src/Utility/decBuf.cc
Examining data/maude-3.1/src/Utility/mpzGcdInit.cc
Examining data/maude-3.1/src/Utility/diophantineSystem.cc
Examining data/maude-3.1/src/Utility/wordLevel.cc
Examining data/maude-3.1/src/Utility/allSat.cc
Examining data/maude-3.1/src/Utility/natSet.cc
Examining data/maude-3.1/src/Utility/pigPug-stack.cc
Examining data/maude-3.1/src/Utility/pigPug-extract.cc
Examining data/maude-3.1/src/Utility/variableConstraint.cc
Examining data/maude-3.1/src/Utility/wordLevel-selections.cc
Examining data/maude-3.1/src/Utility/preVector.cc
Examining data/maude-3.1/src/Utility/timer.cc
Examining data/maude-3.1/src/Utility/wordSystem.cc
Examining data/maude-3.1/src/Utility/pigPug-search.cc
Examining data/maude-3.1/src/Utility/mpzGcdBasedSolver.cc
Examining data/maude-3.1/src/Utility/pigPug-cycleDetection.cc
Examining data/maude-3.1/src/Utility/graph.cc
Examining data/maude-3.1/src/SMT/SMT_Info.cc
Examining data/maude-3.1/src/SMT/SMT_RewriteSearchState.cc
Examining data/maude-3.1/src/SMT/SMT_NumberSymbol.cc
Examining data/maude-3.1/src/SMT/SMT_Symbol.cc
Examining data/maude-3.1/src/SMT/SMT_RewriteSequenceSearch.cc
Examining data/maude-3.1/src/SMT/SMT_NumberTerm.cc
Examining data/maude-3.1/src/SMT/SMT_NumberDagNode.cc
Examining data/maude-3.1/src/FullCompiler/compilationContext.cc
Examining data/maude-3.1/src/FullCompiler/runtime.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_Delete.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_Insert.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_Rebalance.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_RedBlackNode.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_Tree.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_Find.cc
Examining data/maude-3.1/src/ACU_Persistent/ACU_Copy.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_Symbol.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_CollectorLhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_FastMerge.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_NonLinearLhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_NGA_LhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_LhsCompiler1.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_TreeMatcher.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_LhsCompiler3.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_GndLhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_VarLhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_BndVarLhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_ArgumentIterator.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_MergeSort.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_TreeDagNode.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_LhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_TreeDagArgumentIterator.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_LhsCompiler2.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_LhsCompiler0.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_RhsAutomaton.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_DagArgumentIterator.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_ExtensionInfo.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_DagNode.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_Matcher.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_Subproblem.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_LazySubproblem.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_BaseDagNode.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_DagOperations.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_CollapseMatcher.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_GreedyMatcher.cc
Examining data/maude-3.1/src/ACU_Theory/ACU_Term.cc
Examining data/maude-3.1/src/3rdParty/MersenneTwister.h
Examining data/maude-3.1/src/StrategyLanguage/iterationStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/subtermProcess.cc
Examining data/maude-3.1/src/StrategyLanguage/trivialStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/strategyStackManager.cc
Examining data/maude-3.1/src/StrategyLanguage/concatenationStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/oneStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/strategyExpression.cc
Examining data/maude-3.1/src/StrategyLanguage/depthFirstStrategicSearch.cc
Examining data/maude-3.1/src/StrategyLanguage/rewriteTask.cc
Examining data/maude-3.1/src/StrategyLanguage/strategicExecution.cc
Examining data/maude-3.1/src/StrategyLanguage/callProcess.cc
Examining data/maude-3.1/src/StrategyLanguage/testStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/callStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/branchTask.cc
Examining data/maude-3.1/src/StrategyLanguage/matchProcess.cc
Examining data/maude-3.1/src/StrategyLanguage/decompositionProcess.cc
Examining data/maude-3.1/src/StrategyLanguage/callTask.cc
Examining data/maude-3.1/src/StrategyLanguage/unionStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/subtermTask.cc
Examining data/maude-3.1/src/StrategyLanguage/strategicTask.cc
Examining data/maude-3.1/src/StrategyLanguage/variableBindingsManager.cc
Examining data/maude-3.1/src/StrategyLanguage/applicationProcess.cc
Examining data/maude-3.1/src/StrategyLanguage/strategicSearch.cc
Examining data/maude-3.1/src/StrategyLanguage/subtermStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/oneTask.cc
Examining data/maude-3.1/src/StrategyLanguage/branchStrategy.cc
Examining data/maude-3.1/src/StrategyLanguage/fairStrategicSearch.cc
Examining data/maude-3.1/src/StrategyLanguage/strategicProcess.cc
Examining data/maude-3.1/src/StrategyLanguage/applicationStrategy.cc
Examining data/maude-3.1/src/NA_Theory/NA_Term.cc
Examining data/maude-3.1/src/NA_Theory/NA_LhsAutomaton.cc
Examining data/maude-3.1/src/NA_Theory/NA_RhsAutomaton.cc
Examining data/maude-3.1/src/NA_Theory/NA_DagNode.cc
Examining data/maude-3.1/src/NA_Theory/NA_Symbol.cc
Examining data/maude-3.1/src/Interface/dagNode.cc
Examining data/maude-3.1/src/Interface/binarySymbol.cc
Examining data/maude-3.1/src/Interface/nonFinalExtor.cc
Examining data/maude-3.1/src/Interface/nonFinalInstruction.cc
Examining data/maude-3.1/src/Interface/symbol.cc
Examining data/maude-3.1/src/Interface/regularInstruction.cc
Examining data/maude-3.1/src/Interface/associativeSymbol.cc
Examining data/maude-3.1/src/Interface/term.cc
Examining data/maude-3.1/src/Meta/metaVariant.cc
Examining data/maude-3.1/src/Meta/interpreterVariant.cc
Examining data/maude-3.1/src/Meta/metaNarrow.cc
Examining data/maude-3.1/src/Meta/metaNewNarrow.cc
Examining data/maude-3.1/src/Meta/interpreterVariantUnify.cc
Examining data/maude-3.1/src/Meta/metaUp.cc
Examining data/maude-3.1/src/Meta/metaPreModule.cc
Examining data/maude-3.1/src/Meta/interpreterSignature.cc
Examining data/maude-3.1/src/Meta/metaDownFixUps.cc
Examining data/maude-3.1/src/Meta/metaLevelSignature.cc
Examining data/maude-3.1/src/Meta/metaVariantUnify.cc
Examining data/maude-3.1/src/Meta/interpreterSort.cc
Examining data/maude-3.1/src/Meta/descentSignature.cc
Examining data/maude-3.1/src/Meta/interpreterManagerSymbol.cc
Examining data/maude-3.1/src/Meta/metaDownView.cc
Examining data/maude-3.1/src/Meta/metaUpModule.cc
Examining data/maude-3.1/src/Meta/interpreterRewrite.cc
Examining data/maude-3.1/src/Meta/legacyMetaVariantUnify.cc
Examining data/maude-3.1/src/Meta/metaApply.cc
Examining data/maude-3.1/src/Meta/interpreterVariantMatch.cc
Examining data/maude-3.1/src/Meta/metaUpView.cc
Examining data/maude-3.1/src/Meta/descentFunctions.cc
Examining data/maude-3.1/src/Meta/metaModule.cc
Examining data/maude-3.1/src/Meta/metaUnify.cc
Examining data/maude-3.1/src/Meta/interpreterUnify.cc
Examining data/maude-3.1/src/Meta/metaLevelOpSymbol.cc
Examining data/maude-3.1/src/Meta/legacyMetaVariant.cc
Examining data/maude-3.1/src/Meta/metaSrewrite.cc
Examining data/maude-3.1/src/Meta/interpreterNewNarrow.cc
Examining data/maude-3.1/src/Meta/metaDownRenamings.cc
Examining data/maude-3.1/src/Meta/metaView.cc
Examining data/maude-3.1/src/Meta/metaNewNarrow2.cc
Examining data/maude-3.1/src/Meta/metaMatch.cc
Examining data/maude-3.1/src/Meta/metaDown.cc
Examining data/maude-3.1/src/Meta/interpreterSearch.cc
Examining data/maude-3.1/src/Meta/metaVariantMatch.cc
Examining data/maude-3.1/src/Meta/metaDownStrats.cc
Examining data/maude-3.1/src/Meta/interpreterPrint.cc
Examining data/maude-3.1/src/Meta/metaOpCache.cc
Examining data/maude-3.1/src/Meta/ascentFunctions.cc
Examining data/maude-3.1/src/Meta/interpreterApply.cc
Examining data/maude-3.1/src/Meta/metaLevel.cc
Examining data/maude-3.1/src/Meta/interpreterNewNarrowSearch.cc
Examining data/maude-3.1/src/Meta/legacyMetaUnify.cc
Examining data/maude-3.1/src/Meta/metaDownSignature.cc
Examining data/maude-3.1/src/Meta/legacyMetaUp.cc
Examining data/maude-3.1/src/Meta/metaDownOps.cc
Examining data/maude-3.1/src/Meta/interpreterMatch.cc
Examining data/maude-3.1/src/Meta/metaSearch.cc
Examining data/maude-3.1/src/Meta/metaModuleCache.cc
Examining data/maude-3.1/src/Core/rootContainer.cc
Examining data/maude-3.1/src/Core/sortConstraint.cc
Examining data/maude-3.1/src/Core/variableInfo.cc
Examining data/maude-3.1/src/Core/rewritingContext.cc
Examining data/maude-3.1/src/Core/equationTable.cc
Examining data/maude-3.1/src/Core/connectedComponent.cc
Examining data/maude-3.1/src/Core/sortConstraintTable.cc
Examining data/maude-3.1/src/Core/extensionMatchSubproblem.cc
Examining data/maude-3.1/src/Core/equation.cc
Examining data/maude-3.1/src/Core/strategyDefinition.cc
Examining data/maude-3.1/src/Core/dagRoot.cc
Examining data/maude-3.1/src/Core/module.cc
Examining data/maude-3.1/src/Core/protectedDagNodeSet.cc
Examining data/maude-3.1/src/Core/copyRhsAutomaton.cc
Examining data/maude-3.1/src/Core/strategy.cc
Examining data/maude-3.1/src/Core/stackMachineRhsCompiler.cc
Examining data/maude-3.1/src/Core/variableAbstractionSubproblem.cc
Examining data/maude-3.1/src/Core/substitution.cc
Examining data/maude-3.1/src/Core/cachedDag.cc
Examining data/maude-3.1/src/Core/localBinding.cc
Examining data/maude-3.1/src/Core/run.cc
Examining data/maude-3.1/src/Core/bindingLhsAutomaton.cc
Examining data/maude-3.1/src/Core/memoTable.cc
Examining data/maude-3.1/src/Core/rule.cc
Examining data/maude-3.1/src/Core/ruleTable.cc
Examining data/maude-3.1/src/Core/dagNodeSet.cc
Examining data/maude-3.1/src/Core/narrowingVariableInfo.cc
Examining data/maude-3.1/src/Core/unificationSubproblemDisjunction.cc
Examining data/maude-3.1/src/Core/sortErrorAnalysis.cc
Examining data/maude-3.1/src/Core/ctorDiagram.cc
Examining data/maude-3.1/src/Core/unificationContext.cc
Examining data/maude-3.1/src/Core/sortCheckSubproblem.cc
Examining data/maude-3.1/src/Core/memoMap.cc
Examining data/maude-3.1/src/Core/subproblemDisjunction.cc
Examining data/maude-3.1/src/Core/compoundCycleSubproblem.cc
Examining data/maude-3.1/src/Core/memoryCell.cc
Examining data/maude-3.1/src/Core/preEquation.cc
Examining data/maude-3.1/src/Core/trivialRhsAutomaton.cc
Examining data/maude-3.1/src/Core/termBag.cc
Examining data/maude-3.1/src/Core/returnInstruction.cc
Examining data/maude-3.1/src/Core/rewriteStrategy.cc
Examining data/maude-3.1/src/Core/sortTable.cc
Examining data/maude-3.1/src/Core/hashConsSet.cc
Examining data/maude-3.1/src/Core/termSet.cc
Examining data/maude-3.1/src/Core/nullInstruction.cc
Examining data/maude-3.1/src/Core/sort.cc
Examining data/maude-3.1/src/Core/subproblemSequence.cc
Examining data/maude-3.1/src/Core/disjunctiveSubproblemAccumulator.cc
Examining data/maude-3.1/src/Core/pendingUnificationStack.cc
Examining data/maude-3.1/src/Core/rhsBuilder.cc
Examining data/maude-3.1/src/Core/sortBdds.cc
Examining data/maude-3.1/src/Core/stackMachine.cc
Examining data/maude-3.1/src/Core/equalitySubproblem.cc
FINAL RESULTS:
data/maude-3.1/src/ACU_Theory/ACU_Subproblem.cc:83:10: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
delete system;
data/maude-3.1/src/ACU_Theory/ACU_Subproblem.cc:376:10: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
delete system;
data/maude-3.1/src/ACU_Theory/ACU_Subproblem.cc:432:11: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
delete system;
data/maude-3.1/src/ACU_Theory/ACU_Subproblem.cc:439:14: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
delete system;
data/maude-3.1/src/ACU_Theory/ACU_Subproblem.cc:464:14: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
delete system;
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:530:13: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
IntSystem system(nrDioVars);
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:532:5: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
system.insertEqn(*i);
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:552:3: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
system.setUpperBounds(upperBnds);
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:557:23: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
for (int index = 0; system.findNextMinimalSolution(dioSol);)
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:253:19: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
SystemAutomaton system;
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:255:28: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
int top = build(formula, system.propositions, newContext->root());
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:270:3: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
system.satisfiesSymbol = satisfiesSymbol;
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:271:3: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
system.parentContext = &context;
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:272:3: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
system.trueTerm = trueTerm.getDag();
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:274:3: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
system.systemStates = new StateTransitionGraph(sysContext);
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:275:20: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
ModelChecker2 mc(system, formula, top);
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:277:24: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
int nrSystemStates = system.systemStates->getNrStates();
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:283:14: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
dump(*(system.systemStates), mc.getLeadIn());
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:284:14: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
dump(*(system.systemStates), mc.getCycle());
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:288:54: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
DagNode* resultDag = result ? makeCounterexample(*(system.systemStates), mc)
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:291:10: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
delete system.systemStates; // deletes sysContext via ~StateTransitionGraph()
data/maude-3.1/src/IO_Stuff/directoryManager.cc:49:7: [4] (race) access:
This usually indicates a security flaw. If an attacker can change anything
along the path between the call to access() and the file's actual use
(e.g., by moving files), the attacker can exploit the race condition
(CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
and try to open the file directly.
if (access(full.c_str(), mode) == 0)
data/maude-3.1/src/IO_Stuff/directoryManager.cc:65:8: [4] (race) access:
This usually indicates a security flaw. If an attacker can change anything
along the path between the call to access() and the file's actual use
(e.g., by moving files), the attacker can exploit the race condition
(CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
and try to open the file directly.
if (access((full + *p).c_str(), mode) == 0)
data/maude-3.1/src/Mixfix/auxProperty.cc:231:13: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
char* p = strcpy(t, name);
data/maude-3.1/src/Mixfix/auxProperty.cc:296:13: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
char* p = strcpy(t, n);
data/maude-3.1/src/Mixfix/compiler.cc:76:12: [4] (race) access:
This usually indicates a security flaw. If an attacker can change anything
along the path between the call to access() and the file's actual use
(e.g., by moving files), the attacker can exploit the race condition
(CWE-362/CWE-367!). Set up the correct permissions (e.g., using setuid())
and try to open the file directly.
tmpDir = (access("/usr/tmp", W_OK) == 0) ? "/usr/tmp" : "/tmp";
data/maude-3.1/src/Mixfix/compiler.cc:190:16: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
int status = system(cmd.c_str());
data/maude-3.1/src/Mixfix/compiler.cc:291:21: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
returnValueDump = system(makeBaseName().c_str());
data/maude-3.1/src/Mixfix/mixfixParser.cc:749:2: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
strcpy(s, name);
data/maude-3.1/src/Mixfix/surface.cc:2016:21: [4] (format) fprintf:
If format strings can be influenced by an attacker, they can be exploited
(CWE-134). Use a constant for the format specification.
# define YYFPRINTF fprintf
data/maude-3.1/src/Mixfix/surface.cc:2864:24: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
returnValueDump = system((string("ls") + (yyvsp[0].yyString)).c_str());
data/maude-3.1/src/Mixfix/surface.cc:2878:24: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
returnValueDump = system((string("ls -l") + (yyvsp[0].yyString)).c_str());
data/maude-3.1/src/Mixfix/token.cc:487:3: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
strcpy(t, p);
data/maude-3.1/src/Mixfix/token.cc:510:3: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
strcpy(t, p);
data/maude-3.1/src/Mixfix/token.cc:538:7: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
p = strcpy(t, p);
data/maude-3.1/src/Mixfix/token.cc:888:3: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
strcpy(s, name);
data/maude-3.1/src/ObjectSystem/processActions.cc:246:14: [4] (shell) execvp:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
(void) execvp(file, argv);
data/maude-3.1/src/Temporal/modelChecker2.cc:37:38: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
ModelChecker2::ModelChecker2(System& system, LogicFormula& property, int top)
data/maude-3.1/src/Temporal/modelChecker2.cc:38:5: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
: system(system),
data/maude-3.1/src/Temporal/modelChecker2.cc:38:12: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
: system(system),
data/maude-3.1/src/Temporal/modelChecker2.cc:70:15: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
int n = system.getNextState(systemStateNr, i);
data/maude-3.1/src/Temporal/modelChecker2.cc:156:15: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
int n = system.getNextState(systemStateNr, i);
data/maude-3.1/src/Temporal/modelChecker2.cc:184:8: [4] (shell) system:
This causes a new program to execute and is difficult to use safely
(CWE-78). try using a library call that implements the same functionality
if available.
if (system.checkProposition(systemStateNr, propIndex))
data/maude-3.1/src/Utility/macros.cc:211:7: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
strcpy(buffer + next, int64ToString(exponent, 10));
data/maude-3.1/src/Utility/macros.cc:264:7: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
strcpy(buffer, (mantissa == 0) ? "Infinity" : "NaN");
data/maude-3.1/src/Utility/stringTable.cc:83:23: [4] (buffer) strcpy:
Does not check for buffer overflows when copying to destination [MS-banned]
(CWE-120). Consider using snprintf, strcpy_s, or strlcpy (warning: strncpy
easily misused).
stringTable.append(strcpy(new char[strlen(name) + 1], name));
data/maude-3.1/src/IO_Stuff/directoryManager.cc:82:17: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
if (char* p = getenv(pathVar))
data/maude-3.1/src/IO_Stuff/directoryManager.cc:133:16: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
dirPath = getenv("HOME");
data/maude-3.1/src/IO_Stuff/directoryManager.cc:202:21: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
const char* cwd = getenv("PWD");
data/maude-3.1/src/Main/main.cc:176:26: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
const char* term = getenv("TERM");
data/maude-3.1/src/Main/main.cc:192:26: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
const char* term = getenv("TERM");
data/maude-3.1/src/Meta/metaModuleCache.cc:56:31: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
if (const char* value = getenv("MAUDE_META_MODULE_CACHE_SIZE"))
data/maude-3.1/src/Mixfix/compiler.cc:74:28: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
const char* tmpDir = getenv("TMPDIR");
data/maude-3.1/src/Mixfix/compiler.cc:165:26: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
const char* optFlags = getenv("MAUDE_GCC_FLAGS");
data/maude-3.1/src/Mixfix/compiler.cc:170:28: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
if (const char* incDir = getenv("MAUDE_INCLUDE"))
data/maude-3.1/src/Mixfix/compiler.cc:178:28: [3] (buffer) getenv:
Environment variables are untrustable input if they can be set by an
attacker. They can have any content and length, and the same variable can
be set more than once (CWE-807, CWE-20). Check environment variables
carefully before using them.
if (const char* libDir = getenv("MAUDE_RUNTIME"))
data/maude-3.1/src/3rdParty/MersenneTwister.h:265:18: [2] (misc) fopen:
Check when opening files - can an attacker redirect it (via symlinks),
force the opening of special file type (e.g., device files), move things
around to create a race condition, control its ancestors, or change its
contents? (CWE-362).
FILE* urandom = fopen( "/dev/urandom", "rb" );
data/maude-3.1/src/BuiltIn/branchSymbol.cc:76:15: [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 index = atoi(purpose);
data/maude-3.1/src/BuiltIn/stringOpSymbol.cc:406:8: [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 buffer[MAX_FLOAT_DIGITS + 1];
data/maude-3.1/src/IO_Stuff/IO_Manager.cc:254: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.
char buf[BUFFER_SIZE];
data/maude-3.1/src/IO_Stuff/directoryManager.cc:201:3: [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 buffer[MAXPATHLEN];
data/maude-3.1/src/Meta/metaDownOps.cc:214: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).
min = atoi(Token::name(args[0]));
data/maude-3.1/src/Meta/metaDownOps.cc:217: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).
max = atoi(Token::name(args[1]));
data/maude-3.1/src/Meta/metaModuleCache.cc:58:15: [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 size = atoi(value);
data/maude-3.1/src/Meta/metaUpModule.cc:1070:16: [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 emptyString[1] = {'\0'};
data/maude-3.1/src/Mixfix/bufferPrint.cc:595:13: [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 strg[3] = "\\!"; // HACK
data/maude-3.1/src/Mixfix/interact.cc:105:10: [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 altStack[SIGSTKSZ];
data/maude-3.1/src/Mixfix/lexerAux.cc:209:14: [2] (misc) fopen:
Check when opening files - can an attacker redirect it (via symlinks),
force the opening of special file type (e.g., device files), move things
around to create a race condition, control its ancestors, or change its
contents? (CWE-362).
FILE* fp = fopen(fileName.c_str(), "r");
data/maude-3.1/src/Mixfix/process.cc:383:11: [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).
min = atoi(details[0].name());
data/maude-3.1/src/Mixfix/process.cc:386:15: [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).
max = atoi(details[1].name());
data/maude-3.1/src/Mixfix/surface.cc:2266:3: [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 const *yyarg[YYERROR_VERBOSE_ARGS_MAXIMUM];
data/maude-3.1/src/Mixfix/surface.cc:2518:3: [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 yymsgbuf[128];
data/maude-3.1/src/Mixfix/token.cc:119:10: [2] (buffer) memcpy:
Does not check for buffer overflows when copying to destination (CWE-120).
Make sure destination can always hold the source data.
(void) memcpy(newBuffer, buffer, bufferLength);
data/maude-3.1/src/Mixfix/token.cc:907:27: [2] (misc) open:
Check when opening files - can an attacker redirect it (via symlinks),
force the opening of special file type (e.g., device files), move things
around to create a race condition, control its ancestors, or change its
contents? (CWE-362).
if (tokens[0].codeNr != open && tokens[len - 1].codeNr != close)
data/maude-3.1/src/Mixfix/token.cc:913:21: [2] (misc) open:
Check when opening files - can an attacker redirect it (via symlinks),
force the opening of special file type (e.g., device files), move things
around to create a race condition, control its ancestors, or change its
contents? (CWE-362).
if (codeNr == open)
data/maude-3.1/src/ObjectSystem/fileActions.cc:137:15: [2] (misc) fopen:
Check when opening files - can an attacker redirect it (via symlinks),
force the opening of special file type (e.g., device files), move things
around to create a race condition, control its ancestors, or change its
contents? (CWE-362).
FILE* fp = fopen(pathStr, modeStr);
data/maude-3.1/src/ObjectSystem/fileActions.cc:297:8: [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 buffer[BUFFER_SIZE];
data/maude-3.1/src/ObjectSystem/processActions.cc:275:3: [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 buffer[ERROR_BUFFER_SIZE];
data/maude-3.1/src/ObjectSystem/socketAsync.cc:39: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.
char buffer[READ_BUFFER_SIZE];
data/maude-3.1/src/ObjectSystem/socketStuff.cc:448:4: [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 buffer[READ_BUFFER_SIZE];
data/maude-3.1/src/Utility/macros.cc:49:10: [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 text[MAX_STRING_SIZE + 1];
data/maude-3.1/src/Utility/macros.cc:183:10: [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 buffer[DOUBLE_TEXT_SIZE + 1] = "-";
data/maude-3.1/src/ACU_Theory/ACU_BndVarLhsAutomaton.cc:160:23: [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 (!(stripperDag->equal(subject)))
data/maude-3.1/src/ACU_Theory/ACU_CollapseMatcher.cc:52:39: [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(!(topSymbol->getIdentity()->equal(d)))
data/maude-3.1/src/ACU_Theory/ACU_CollapseMatcher.cc:110: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.
if (!(identity->equal(d)))
data/maude-3.1/src/ACU_Theory/ACU_CollapseMatcher.cc:148: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 (identity->equal(subject))
data/maude-3.1/src/ACU_Theory/ACU_CollapseMatcher.cc:172: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.
Assert(identity->equal(solution.value(tv.index)), "should be identity");
data/maude-3.1/src/ACU_Theory/ACU_DagOperations.cc:150:34: [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 (identity != 0 && identity->equal(target))
data/maude-3.1/src/ACU_Theory/ACU_GndLhsAutomaton.cc:139: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.
if (!(stripperTerm->equal(subject)))
data/maude-3.1/src/ACU_Theory/ACU_LazySubproblem.cc:225: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.
return c->equal(d);
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:171:23: [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 (identity->equal(d0))
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:173:23: [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 (identity->equal(d1))
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:184:23: [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 (identity->equal(d0))
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:198:28: [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.
else if (identity->equal(d1))
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:222:36: [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 (identity != 0 && identity->equal(d0))
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:239:39: [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 (identity != 0 && identity->equal(d0))
data/maude-3.1/src/ACU_Theory/ACU_Normalize.cc:263:39: [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 (identity != 0 && identity->equal(d1))
data/maude-3.1/src/ACU_Theory/ACU_Term.cc:317:29: [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 (argArray[i].term->equal(argArray[d].term))
data/maude-3.1/src/ACU_Theory/ACU_Term.cc:335: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 (id->equal(argArray[i].term))
data/maude-3.1/src/ACU_Theory/ACU_TreeMatcher.cc:39:37: [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 (identity == 0 || !(identity->equal(d)))
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:136:38: [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 (identity != 0 && identity->equal(rhs))
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:212: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.
if (identity->equal(subject))
data/maude-3.1/src/ACU_Theory/ACU_UnificationSubproblem2.cc:227: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.
if (dagNode->equal(subterms[i]))
data/maude-3.1/src/ACU_Theory/ACU_VarLhsAutomaton.cc:185: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 (!(d->equal(subject)))
data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc:63:23: [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(!(identity->equal(d)))
data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc:91:23: [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(!(identity->equal(d)))
data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc:145:23: [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 (!(identity->equal(d)))
data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc:164: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.
if (!(identity->equal(d)))
data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc:207: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 (identity->equal(subject))
data/maude-3.1/src/AU_Theory/AU_CollapseMatcher.cc:231: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.
Assert(identity->equal(solution.value(tv.index)), "should be identity");
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:49:40: [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 (!leftId && pos > 0 && identity->equal(args2[start]))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:54:52: [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 (leftId && pos + finish <= last && identity->equal(args2[finish]))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:62: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.
if (!(args2[i]->equal(argArray[pos])))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:70:74: [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 (((pos > 0 && rightId) || (pos <= last && leftId)) && identity->equal(target))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:72:35: [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 (pos <= limit && target->equal(argArray[pos]))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:102:50: [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 (!leftId && pos - finish >= 0 && identity->equal(args2[start]))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:107:42: [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 (leftId && pos < last && identity->equal(args2[finish]))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:115: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.
if (!(args2[i]->equal(argArray[pos])))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:123:74: [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 (((pos >= 0 && rightId) || (pos < last && leftId)) && identity->equal(target))
data/maude-3.1/src/AU_Theory/AU_DagOperations.cc:125:35: [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 (pos >= limit && target->equal(argArray[pos]))
data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc:63:36: [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 (identity == 0 || !(identity->equal(b)))
data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc:77: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.
if (b->equal(remainder.topLeft()))
data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc:84: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.
if (b->equal(remainder.topRight()))
data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc:123:23: [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 (i->groundAlien->equal(remainder.topLeft()))
data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc:130:23: [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 (i->groundAlien->equal(remainder.topRight()))
data/maude-3.1/src/AU_Theory/AU_DequeMatcher.cc:208:16: [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 (!(b->equal(d)))
data/maude-3.1/src/AU_Theory/AU_FullMatcher.cc:208:26: [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 (!(v->equal(d)))
data/maude-3.1/src/AU_Theory/AU_FullMatcher.cc:215:34: [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 (!(f.groundAlien->equal(d)))
data/maude-3.1/src/AU_Theory/AU_GreedyMatcher.cc:180:26: [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 (!(v->equal(d)))
data/maude-3.1/src/AU_Theory/AU_GreedyMatcher.cc:187:34: [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 (!(f.groundAlien->equal(d)))
data/maude-3.1/src/AU_Theory/AU_Matcher.cc:167: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.
!(i->groundAlien->equal(args[i->leftEnd ? leftPos++ : rightPos--])))
data/maude-3.1/src/AU_Theory/AU_Matcher.cc:270: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.
f.groundAlien->equal(subject->argArray[leftPos++]);
data/maude-3.1/src/AU_Theory/AU_Matcher.cc:321: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.
f.groundAlien->equal(subject->argArray[rightPos--]);
data/maude-3.1/src/AU_Theory/AU_Normalize.cc:70:38: [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.
else if (identity != 0 && identity->equal(d) && disappear(s, i))
data/maude-3.1/src/AU_Theory/AU_Normalize.cc:102:47: [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.
else if (!(nrIdentities > 0 && identity->equal(d)))
data/maude-3.1/src/AU_Theory/AU_Normalize.cc:121:47: [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.
else if (!(nrIdentities > 0 && identity->equal(d)))
data/maude-3.1/src/AU_Theory/AU_Normalize.cc:144: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.
if (!(identity->equal(d) && disappear(s, i)))
data/maude-3.1/src/AU_Theory/AU_Normalize.cc:205:25: [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.
else if (!(identity->equal(d) && disappear(s, i)))
data/maude-3.1/src/AU_Theory/AU_Symbol.cc:417: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.
if (identity->equal(args[0]))
data/maude-3.1/src/AU_Theory/AU_Symbol.cc:427: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.
if (identity->equal(args[nrArgs - 1]))
data/maude-3.1/src/AU_Theory/AU_Symbol.cc:438:34: [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 (identity != 0 && identity->equal(d))
data/maude-3.1/src/AU_Theory/AU_Term.cc:208: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.
if (identity->equal(t) && idPossible(i))
data/maude-3.1/src/AU_Theory/AU_UnificationSubproblem2.cc:140:50: [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.
int rhsIndex = (identity != 0 && identity->equal(rhs)) ? NONE : dagToAbstract(rhs, solution);
data/maude-3.1/src/AU_Theory/AU_UnificationSubproblem2.cc:204: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.
if (identity->equal(subject))
data/maude-3.1/src/AU_Theory/AU_UnificationSubproblem2.cc:219: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.
if (dagNode->equal(subterms[i]))
data/maude-3.1/src/BuiltIn/branchSymbol.cc:167: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.
if(testTerms[i]->equal(e))
data/maude-3.1/src/BuiltIn/equalityExtor.cc:74:43: [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 = frame->getSlot(argIndex0)->equal(frame->getSlot(argIndex1));
data/maude-3.1/src/BuiltIn/equalityExtor.cc:78: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.
Instruction* ni = equal ? symbol->getEqualInstructionSequence() : symbol->getNotEqualInstructionSequence();
data/maude-3.1/src/BuiltIn/equalityExtorFinal.cc:47:43: [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 = frame->getSlot(argIndex0)->equal(frame->getSlot(argIndex1));
data/maude-3.1/src/BuiltIn/equalityExtorFinal.cc:51: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.
Instruction* ni = equal ? symbol->getEqualInstructionSequence() : symbol->getNotEqualInstructionSequence();
data/maude-3.1/src/BuiltIn/equalitySymbol.cc:150:45: [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 context.builtInReplace(subject, l->equal(r) ?
data/maude-3.1/src/BuiltIn/succSymbol.cc:134:5: [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((s != this) ? term :
data/maude-3.1/src/BuiltIn/succSymbol.cc:143:5: [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((s != this) ? dagNode :
data/maude-3.1/src/BuiltIn/succSymbol.cc:155:34: [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.
Assert(zeroTerm.getTerm()->equal(term), "not a nat");
data/maude-3.1/src/BuiltIn/succSymbol.cc:159:30: [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.
Assert(zeroTerm.getTerm()->equal(st->getArgument()), "arg not zero");
data/maude-3.1/src/BuiltIn/succSymbol.cc:171:34: [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.
Assert(zeroTerm.getTerm()->equal(dagNode), "not a nat");
data/maude-3.1/src/BuiltIn/succSymbol.cc:175:30: [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.
Assert(zeroTerm.getTerm()->equal(sd->getArgument()), "arg not zero");
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:191:36: [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 (s->leftId() && identity->equal(argArray[0]))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:196:37: [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 (s->rightId() && identity->equal(argArray[1]))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:296: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 (!(l0->equal(l1) || r0->equal(r1)))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:296:34: [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 (!(l0->equal(l1) || r0->equal(r1)))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:330:15: [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 (!(r0->equal(r1)))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:444: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.
if (l1->equal(argArray[0]))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:509: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 (r->equal(repVar))
data/maude-3.1/src/CUI_Theory/CUI_DagNode.cc:531: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 (r->equal(repVar))
data/maude-3.1/src/CUI_Theory/CUI_LhsCompiler.cc:60:68: [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 (t0->ground() || t0->willGroundOutMatch(boundUniquely) || t0->equal(t1))
data/maude-3.1/src/CUI_Theory/CUI_LhsCompiler.cc:84:28: [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 subtermsEqual = t0->equal(t1);
data/maude-3.1/src/CUI_Theory/CUI_Matcher.cc:58:64: [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 ((f & REVERSE) || ((f & CONDITIONAL_REVERSE) && !(s0->equal(s1))))
data/maude-3.1/src/CUI_Theory/CUI_Matcher.cc:182:43: [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 ((flags & ID0_COLLAPSE) && identity->equal(subject))
data/maude-3.1/src/CUI_Theory/CUI_Matcher.cc:210:34: [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 (identity != 0 && identity->equal(subject))
data/maude-3.1/src/CUI_Theory/CUI_Term.cc:137:36: [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 (s->leftId() && identity->equal(argArray[0]))
data/maude-3.1/src/CUI_Theory/CUI_Term.cc:142:37: [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 (s->rightId() && identity->equal(argArray[1]))
data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem2.cc:90: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.
if (binding != 0 && binding->equal(topSymbol->getIdentityDag()))
data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem2.cc:97:25: [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.
Assert(!(leftArg->equal(topSymbol->getIdentityDag())),"left arg is identity!");
data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem2.cc:114: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.
if (binding != 0 && binding->equal(topSymbol->getIdentityDag()))
data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem2.cc:121:26: [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.
Assert(!(rightArg->equal(topSymbol->getIdentityDag())),"right arg is identity!");
data/maude-3.1/src/CUI_Theory/CUI_UnificationSubproblem2.cc:143: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.
return first->equal(second);
data/maude-3.1/src/Core/dagNodeSet.cc:72:14: [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 d1->equal(d2);
data/maude-3.1/src/Core/equalitySubproblem.cc:53:42: [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 = (lhsTerm != 0) ? lhsTerm->equal(rhs) :
data/maude-3.1/src/Core/equalitySubproblem.cc:54:34: [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.
solution.value(lhsVariable)->equal(rhs);
data/maude-3.1/src/Core/hashConsSet.cc:93:14: [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 d1->equal(d2);
data/maude-3.1/src/Core/localBinding.cc:70:26: [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 (d != 0 && !(d->equal(i->value)))
data/maude-3.1/src/Core/narrowingVariableInfo.cc:50: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 (variable->equal(variables[i]))
data/maude-3.1/src/Core/narrowingVariableInfo.cc: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 (variable->equal(variables[i]))
data/maude-3.1/src/Core/termSet.cc:65:64: [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 t1->hasEagerContext() == t2->hasEagerContext() && t1->equal(t2);
data/maude-3.1/src/Core/unificationContext.cc:136:71: [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.
Assert(variableDagNodes[index] == 0 || variableDagNodes[index]->equal(variable),
data/maude-3.1/src/Core/variableInfo.cc:59: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 (variable->equal(variables[i]))
data/maude-3.1/src/Core/variableInfo.cc:74:25: [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 (variables[i]->equal(variable))
data/maude-3.1/src/FreeTheory/freeDagNode.cc:377:42: [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 (v->lastVariableInChain(solution)->equal(repVar))
data/maude-3.1/src/FreeTheory/freeDagNode.cc:441:41: [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 (v->lastVariableInChain(solution)->equal(repVar))
data/maude-3.1/src/FreeTheory/freeLhsAutomaton.cc:231: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 (!(d->equal(b)))
data/maude-3.1/src/FreeTheory/freeLhsAutomaton.cc:247:47: [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 (!(stackBase[i->position][i->argIndex]->equal(solution.value(i->varIndex))))
data/maude-3.1/src/FreeTheory/freeLhsAutomaton.cc:262: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.
if (!(i->alien->equal(stackBase[i->position][i->argIndex])))
data/maude-3.1/src/FreeTheory/freeNet.cc:284:23: [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 " << net[i].equal <<
data/maude-3.1/src/FreeTheory/freeNetExec.cc:71:15: [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.
i = n->equal;
data/maude-3.1/src/FreeTheory/freeNetExec.cc:143:15: [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.
i = n->equal;
data/maude-3.1/src/FreeTheory/freeNetExec.cc:212:15: [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.
i = n->equal;
data/maude-3.1/src/FreeTheory/freeRemainder.cc:253:51: [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 (!(stackBase[i->position][i->argIndex]->equal(context.value(i->varIndex))))
data/maude-3.1/src/FreeTheory/freeRemainder.cc:267: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.
if (!(i->alien->equal(stackBase[i->position][i->argIndex])))
data/maude-3.1/src/FreeTheory/freeRemainder.cc:389:47: [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 (!(stackBase[i->position][i->argIndex]->equal(binding[i->varIndex])))
data/maude-3.1/src/FreeTheory/freeRemainder.cc:403: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.
if (!(i->alien->equal(stackBase[i->position][i->argIndex])))
data/maude-3.1/src/Higher/equalityConditionFragment.cc:131:38: [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 success = lhsContext->root()->equal(rhsContext->root());
data/maude-3.1/src/Higher/modelCheckerSymbol.cc:313:27: [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 result = trueTerm->equal(testContext->root());
data/maude-3.1/src/Higher/searchState.cc:156: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 (userVar->equal(varInfo.index2Variable(j)))
data/maude-3.1/src/Higher/variantSearch.cc:255:16: [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 (lhs->equal(a.argument()))
data/maude-3.1/src/IO_Stuff/IO_Manager.cc:105:14: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
return read(fileno(stream), buf, maxSize);
data/maude-3.1/src/IO_Stuff/IO_Manager.cc:200:19: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
bufferEnd = read(STDIN_FILENO, buffer, maxSize);
data/maude-3.1/src/Interface/binarySymbol.cc:188: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.
if (id->equal(subterm))
data/maude-3.1/src/Interface/dagNode.cc:225: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.
return equal(rhs);
data/maude-3.1/src/Meta/metaDown.cc:119:27: [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 (trueTerm.getTerm()->equal(metaBool))
data/maude-3.1/src/Meta/metaDown.cc:124: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.
else if (falseTerm.getTerm()->equal(metaBool))
data/maude-3.1/src/Meta/metaDown.cc:1454: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 (variable->equal(*i))
data/maude-3.1/src/Meta/metaDownFixUps.cc:97: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.
result = id->equal(oldId);
data/maude-3.1/src/Meta/metaDownFixUps.cc:124: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.
result = id->equal(oldId);
data/maude-3.1/src/Meta/metaModuleCache.cc:95:16: [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 (dag->equal(cache[i].dag->getNode()))
data/maude-3.1/src/Meta/metaOpCache.cc:96:30: [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 (!(m1->getArgument(i)->equal(m3->getArgument(i))))
data/maude-3.1/src/Mixfix/auxProperty.cc:167:15: [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).
int len = strlen(tokenString);
data/maude-3.1/src/Mixfix/auxProperty.cc:230: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).
char* t = new char[strlen(name) + 1];
data/maude-3.1/src/Mixfix/auxProperty.cc:294:13: [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).
int len = strlen(n);
data/maude-3.1/src/Mixfix/fixUp.cc:201: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.
WarningCheck(id->equal(oldId), *id <<
data/maude-3.1/src/Mixfix/fixUp.cc:226:26: [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.
WarningCheck(id->equal(oldId), *id <<
data/maude-3.1/src/Mixfix/lexer.cc:3107:14: [1] (buffer) getc:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
data/maude-3.1/src/Mixfix/lexer.cc:5446:37: [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).
return yy_scan_bytes( yystr, (int) strlen(yystr) );
data/maude-3.1/src/Mixfix/mixfixParser.cc:748: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).
char* s = new char[strlen(name) + 1];
data/maude-3.1/src/Mixfix/surface.cc:2163: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).
# define yystrlen strlen
data/maude-3.1/src/Mixfix/token.cc:392:18: [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).
size_t len = strlen(tokenString);
data/maude-3.1/src/Mixfix/token.cc:485:16: [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).
size_t len = strlen(p);
data/maude-3.1/src/Mixfix/token.cc:508:16: [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).
size_t len = strlen(p);
data/maude-3.1/src/Mixfix/token.cc:536:16: [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).
size_t len = strlen(p);
data/maude-3.1/src/Mixfix/token.cc:887: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).
char* s = new char[strlen(name) + 1];
data/maude-3.1/src/Mixfix/tokenizer.cc:881:14: [1] (buffer) getc:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
data/maude-3.1/src/Mixfix/tokenizer.cc:1836:37: [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).
return yy_scan_bytes( yystr, (int) strlen(yystr) );
data/maude-3.1/src/Mixfix/view.cc:1065: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.
if (var->equal(vars[j]))
data/maude-3.1/src/NA_Theory/NA_LhsAutomaton.cc:54:16: [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 term->equal(subject);
data/maude-3.1/src/ObjectSystem/configSymbol.cc:157:16: [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 (!(name->equal(n.argument())))
data/maude-3.1/src/ObjectSystem/configSymbol.cc:541:36: [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 (j.valid() && j.argument()->equal(name))
data/maude-3.1/src/ObjectSystem/configSymbol.cc:570:35: [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 (j.valid() && j.argument()->equal(name))
data/maude-3.1/src/ObjectSystem/processActions.cc:252: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).
size_t length = strlen(errText);
data/maude-3.1/src/ObjectSystem/processActions.cc:278:20: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
int nrChar = read(failureReturnPipe[0], buffer, ERROR_BUFFER_SIZE);
data/maude-3.1/src/ObjectSystem/socketAsync.cc:42:6: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
n = read(fd, buffer, READ_BUFFER_SIZE);
data/maude-3.1/src/ObjectSystem/socketStuff.cc:451:10: [1] (buffer) read:
Check buffer boundaries if used in a loop including recursive loops
(CWE-120, CWE-20).
n = read(socketId, buffer, READ_BUFFER_SIZE);
data/maude-3.1/src/Parser/drp.cc:236:15: [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.
r = rule2->equal;
data/maude-3.1/src/Parser/pass1.cc:213: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.
r = rule2->equal;
data/maude-3.1/src/Parser/pass1.cc:250:15: [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.
r = rule2->equal;
data/maude-3.1/src/Parser/pass1.cc:455: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.
r = rule->equal;
data/maude-3.1/src/SMT/SMT_RewriteSearchState.cc:320:16: [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 (lhs->equal(rhs))
data/maude-3.1/src/SMT/SMT_RewriteSequenceSearch.cc:174:16: [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 (lhs->equal(rhs))
data/maude-3.1/src/S_Theory/S_DagNode.cc:264:42: [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 (a->lastVariableInChain(solution)->equal(r))
data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc:112: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 groundTerm->equal(arg);
data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc:119:16: [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 d->equal(arg);
data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc:159:28: [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.
value->getArgument()->equal(arg);
data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc:187: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.
if (groundTerm->equal(arg))
data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc:205:46: [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 (leftOver >= 0 && value->getArgument()->equal(arg))
data/maude-3.1/src/S_Theory/S_LhsAutomaton.cc:221: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.
if (d->equal(arg))
data/maude-3.1/src/S_Theory/S_Symbol.cc:401: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.
equal = bdd_and(equal, (inIndex & 1) ? argGenSort[j] : negArgGenSort[j]);
data/maude-3.1/src/S_Theory/S_Symbol.cc:410:54: [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.
generalizedSort[j] = bdd_or(generalizedSort[j], equal);
data/maude-3.1/src/StrategyLanguage/callStrategy.cc:196:15: [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.
CallStrategy::equal(const StrategyExpression& other) const
data/maude-3.1/src/StrategyLanguage/strategyExpression.cc:39: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.
StrategyExpression::equal(const StrategyExpression& strategy) const
data/maude-3.1/src/StrategyLanguage/strategyStackManager.cc:63:35: [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 (stackTable[i].strategy->equal(*strategy))
data/maude-3.1/src/Utility/rope.cc:65:17: [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).
size_type n = strlen(cString);
data/maude-3.1/src/Utility/stringTable.cc:83:39: [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).
stringTable.append(strcpy(new char[strlen(name) + 1], name));
data/maude-3.1/src/Variable/variableDagNode.cc:149:15: [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 (lv->equal(rv))
data/maude-3.1/src/Variable/variableDagNode.cc:219:42: [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 (v->lastVariableInChain(solution)->equal(newVar))
ANALYSIS SUMMARY:
Hits = 263
Lines analyzed = 143449 in approximately 3.03 seconds (47270 lines/second)
Physical Source Lines of Code (SLOC) = 103265
Hits@level = [0] 6 [1] 181 [2] 26 [3] 10 [4] 46 [5] 0
Hits@level+ = [0+] 269 [1+] 263 [2+] 82 [3+] 56 [4+] 46 [5+] 0
Hits/KSLOC@level+ = [0+] 2.60495 [1+] 2.54685 [2+] 0.794074 [3+] 0.542294 [4+] 0.445456 [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.