protection with bisection\\n IF(INDEIG.LE.NEGCNT) THEN\\n* The wanted eigenvalue lies to the left\\n SGNDEF = -ONE\\n ELSE\\n* The wanted eigenvalue lies to the right\\n SGNDEF = ONE\\n ENDIF\\n* We only use the RQCORR if it improves the\\n* the iterate reasonably.\\n IF( ( RQCORR*SGNDEF.GE.ZERO )\\n $ .AND.( LAMBDA + RQCORR.LE. RIGHT)\\n $ .AND.( LAMBDA + RQCORR.GE. LEFT)\\n $ ) THEN\\n USEDRQ = .TRUE.\\n* Store new midpoint of bisection interval in WORK\\n IF(SGNDEF.EQ.ONE) THEN\\n* The current LAMBDA is on the left of the true\\n* eigenvalue\\n LEFT = LAMBDA\\n* We prefer to assume that the error estimate\\n* is correct. We could make the interval not\\n* as a bracket but to be modified if the RQCORR\\n* chooses to. In this case, the RIGHT side should\\n* be modified as follows:\\n* RIGHT = MAX(RIGHT, LAMBDA + RQCORR)\\n ELSE\\n* The current LAMBDA is on the right of the true\\n* eigenvalue\\n RIGHT = LAMBDA\\n* See comment about assuming the error estimate is\\n* correct above.\\n* LEFT = MIN(LEFT, LAMBDA + RQCORR)\\n ENDIF\\n WORK( WINDEX ) =\\n $ HALF * (RIGHT + LEFT)\\n* Take RQCORR since it has the correct sign and\\n* improves the iterate reasonably\\n LAMBDA = LAMBDA + RQCORR\\n* Update width of error interval\\n WERR( WINDEX ) =\\n $ HALF * (RIGHT-LEFT)\\n ELSE\\n NEEDBS = .TRUE.\\n ENDIF\\n IF(RIGHT-LEFT.LT.RQTOL*ABS(LAMBDA)) THEN\\n* The eigenvalue is computed to bisection accuracy\\n* compute eigenvector and stop\\n USEDBS = .TRUE.\\n GOTO 120\\n ELSEIF( ITER.LT.MAXITR ) THEN\\n GOTO 120\\n ELSEIF( ITER.EQ.MAXITR ) THEN\\n NEEDBS = .TRUE.\\n GOTO 120\\n ELSE\\n INFO = 5\\n RETURN\\n END IF\\n ELSE\\n STP2II = .FALSE.\\n IF(USEDRQ .AND. USEDBS .AND.\\n $ BSTRES.LE.RESID) THEN\\n LAMBDA = BSTW\\n STP2II = .TRUE.\\n ENDIF\\n IF (STP2II) THEN\\n* improve error angle by second step\\n CALL SLAR1V( IN, 1, IN, LAMBDA,\\n $ D( IBEGIN ), L( IBEGIN ),\\n $ WORK(INDLD+IBEGIN-1),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\\n $ IWORK( IINDR+WINDEX ),\\n $ ISUPPZ( 2*WINDEX-1 ),\\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\\n ENDIF\\n WORK( WINDEX ) = LAMBDA\\n END IF\\n*\\n* Compute FP-vector support w.r.t. whole matrix\\n*\\n ISUPPZ( 2*WINDEX-1 ) = ISUPPZ( 2*WINDEX-1 )+OLDIEN\\n ISUPPZ( 2*WINDEX ) = ISUPPZ( 2*WINDEX )+OLDIEN\\n ZFROM = ISUPPZ( 2*WINDEX-1 )\\n ZTO = ISUPPZ( 2*WINDEX )\\n ISUPMN = ISUPMN + OLDIEN\\n ISUPMX = ISUPMX + OLDIEN\\n* Ensure vector is ok if support in the RQI has changed\\n IF(ISUPMN.LT.ZFROM) THEN\\n DO 122 II = ISUPMN,ZFROM-1\\n Z( II, WINDEX ) = ZERO\\n 122 CONTINUE\\n ENDIF\\n IF(ISUPMX.GT.ZTO) THEN\\n DO 123 II = ZTO+1,ISUPMX\\n Z( II, WINDEX ) = ZERO\\n 123 CONTINUE\\n ENDIF\\n CALL SSCAL( ZTO-ZFROM+1, NRMINV,\\n $ Z( ZFROM, WINDEX ), 1 )\\n 125 CONTINUE\\n* Update W\\n W( WINDEX ) = LAMBDA+SIGMA\\n* Recompute the gaps on the left and right\\n* But only allow them to become larger and not\\n* smaller (which can only happen through \\\"bad\\\"\\n* cancellation and doesn't reflect the theory\\n* where the initial gaps are underestimated due\\n* to WERR being too crude.)\\n IF(.NOT.ESKIP) THEN\\n IF( K.GT.1) THEN\\n WGAP( WINDMN ) = MAX( WGAP(WINDMN),\\n $ W(WINDEX)-WERR(WINDEX)\\n $ - W(WINDMN)-WERR(WINDMN) )\\n ENDIF\\n IF( WINDEX.LT.WEND ) THEN\\n WGAP( WINDEX ) = MAX( SAVGAP,\\n $ W( WINDPL )-WERR( WINDPL )\\n $ - W( WINDEX )-WERR( WINDEX) )\\n ENDIF\\n ENDIF\\n IDONE = IDONE + 1\\n ENDIF\\n* here ends the code for the current child\\n*\\n 139 CONTINUE\\n* Proceed to any remaining child nodes\\n NEWFST = J + 1\\n 140 CONTINUE\\n 150 CONTINUE\\n NDEPTH = NDEPTH + 1\\n GO TO 40\\n END IF\\n IBEGIN = IEND + 1\\n WBEGIN = WEND + 1\\n 170 CONTINUE\\n*\",\n \" RETURN\\n*\\n* End of SLARRV\\n*\\n END\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [352, 354, 354, 352], \"buggy_code_start_loc\": [351, 353, 353, 351], \"filenames\": [\"SRC/clarrv.f\", \"SRC/dlarrv.f\", \"SRC/slarrv.f\", \"SRC/zlarrv.f\"], \"fixing_code_end_loc\": [352, 354, 354, 352], \"fixing_code_start_loc\": [351, 353, 353, 351], \"message\": \"An out-of-bounds read flaw was found in the CLARRV, DLARRV, SLARRV, and ZLARRV functions in lapack through version 3.10.0, as also used in OpenBLAS before version 0.3.18. Specially crafted inputs passed to these functions could cause an application using lapack to crash or possibly disclose portions of its memory.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:lapack_project:lapack:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"860F1070-052A-491D-AF07-7179ABFF53DA\", \"versionEndExcluding\": null, \"versionEndIncluding\": \"3.10.0\", \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:openblas_project:openblas:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"8C8DAA17-150E-4182-ADD1-4317FD35ED9D\", \"versionEndExcluding\": \"0.3.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:julialang:julia:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"50A99E6E-EE4D-443C-AEB3-C141F6CF2266\", \"versionEndExcluding\": null, \"versionEndIncluding\": \"1.6.3\", \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta1:*:*:*:*:*:*\", \"matchCriteriaId\": \"24F54DC9-8AC4-4578-B9B2-ECED81AA515B\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta2:*:*:*:*:*:*\", \"matchCriteriaId\": \"FA4C5004-D212-444C-82B5-2A4B013E0442\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta3:*:*:*:*:*:*\", \"matchCriteriaId\": \"C3B59E6B-37B8-461B-9701-1FD3CCC15014\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta4:*:*:*:*:*:*\", \"matchCriteriaId\": \"DF1A3614-9C2C-4604-BC11-046866C656EA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:rc1:*:*:*:*:*:*\", \"matchCriteriaId\": \"2AD33935-9843-4F09-B5D9-A6C3D86E1022\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:2.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"D07DF15E-FE6B-4DAF-99BB-2147CF7D7EEA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:3.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"516F4E8E-ED2F-4282-9DAB-D8B378F61258\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"D6E54096-5D45-4CB2-AC9A-DDB55BF2B94C\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:5.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"4E37E1B3-6F68-4502-85D6-68333643BDFF\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:openshift_container_storage:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"6FB187A4-F3A6-4993-AEF2-7808F1485EE2\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:openshift_data_foundation:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"0E2C021C-A9F0-4EB4-ADED-81D8B57B4563\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"An out-of-bounds read flaw was found in the CLARRV, DLARRV, SLARRV, and ZLARRV functions in lapack through version 3.10.0, as also used in OpenBLAS before version 0.3.18. Specially crafted inputs passed to these functions could cause an application using lapack to crash or possibly disclose portions of its memory.\"}, {\"lang\": \"es\", \"value\": \"Se ha encontrado un fallo de lectura fuera de l\\u00edmites en las funciones CLARRV, DLARRV, SLARRV y ZLARRV de lapack versiones hasta 3.10.0, usadas tambi\\u00e9n en OpenBLAS versiones anteriores a 0.3.18. Las entradas especialmente dise\\u00f1adas que se pasan a estas funciones podr\\u00edan causar que una aplicaci\\u00f3n que use lapack se bloquee o posiblemente revele partes de su memoria\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-4048\", \"lastModified\": \"2022-01-04T16:09:22.500\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"LOW\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.4, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"NONE\", \"vectorString\": \"AV:N/AC:L/Au:N/C:P/I:N/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 10.0, \"impactScore\": 4.9, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": false}], \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 9.1, \"baseSeverity\": \"CRITICAL\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 3.9, \"impactScore\": 5.2, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2021-12-08T22:15:10.220\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Issue Tracking\", \"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/JuliaLang/julia/issues/42415\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/Reference-LAPACK/lapack/commit/38f3eeee3108b18158409ca2a100e6fe03754781\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Issue Tracking\", \"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/Reference-LAPACK/lapack/pull/625\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/2be5ee3cca97a597f2ee2118808a2d5eacea050c\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/337b65133df174796794871b3988cd03426e6d41\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/ddb0ff5353637bb5f5ad060c9620e334c143e3d7\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/fe497efa0510466fd93578aaf9da1ad8ed4edbe7\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/6QFEVOCUG2UXMVMFMTU4ONJVDEHY2LW2/\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/DROZM4M2QRKSD6FBO4BHSV2QMIRJQPHT/\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-125\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}]}, \"github_commit_url\": \"https://github.com/Reference-LAPACK/lapack/commit/38f3eeee3108b18158409ca2a100e6fe03754781\"}, \"type\": \"CWE-125\"}"},"index":{"kind":"number","value":882,"string":"882"}}},{"rowIdx":5194,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["*> \\brief \\b ZLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download ZLARRV + dependencies\n*> <a href=\"http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlarrv.f\">\n*> [TGZ]</a>\n*> <a href=\"http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlarrv.f\">\n*> [ZIP]</a>\n*> <a href=\"http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlarrv.f\">\n*> [TXT]</a>\n*> \\endhtmlonly\n*\n* Definition:\n* ===========\n*\n* SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\n* ISPLIT, M, DOL, DOU, MINRGP,\n* RTOL1, RTOL2, W, WERR, WGAP,\n* IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\n* WORK, IWORK, INFO )\n*\n* .. Scalar Arguments ..\n* INTEGER DOL, DOU, INFO, LDZ, M, N\n* DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\n* ..\n* .. Array Arguments ..\n* INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\n* $ ISUPPZ( * ), IWORK( * )\n* DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\n* $ WGAP( * ), WORK( * )\n* COMPLEX*16 Z( LDZ, * )\n* ..\n*\n*\n*> \\par Purpose:\n* =============\n*>\n*> \\verbatim\n*>\n*> ZLARRV computes the eigenvectors of the tridiagonal matrix\n*> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.\n*> The input eigenvalues should have been computed by DLARRE.\n*> \\endverbatim\n*\n* Arguments:\n* ==========\n*\n*> \\param[in] N\n*> \\verbatim\n*> N is INTEGER\n*> The order of the matrix. N >= 0.\n*> \\endverbatim\n*>\n*> \\param[in] VL\n*> \\verbatim\n*> VL is DOUBLE PRECISION\n*> Lower bound of the interval that contains the desired\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\n*> end of the extremal eigenvalues in the desired RANGE.\n*> \\endverbatim\n*>\n*> \\param[in] VU\n*> \\verbatim\n*> VU is DOUBLE PRECISION\n*> Upper bound of the interval that contains the desired\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\n*> end of the extremal eigenvalues in the desired RANGE.\n*> \\endverbatim\n*>\n*> \\param[in,out] D\n*> \\verbatim\n*> D is DOUBLE PRECISION array, dimension (N)\n*> On entry, the N diagonal elements of the diagonal matrix D.\n*> On exit, D may be overwritten.\n*> \\endverbatim\n*>\n*> \\param[in,out] L\n*> \\verbatim\n*> L is DOUBLE PRECISION array, dimension (N)\n*> On entry, the (N-1) subdiagonal elements of the unit\n*> bidiagonal matrix L are in elements 1 to N-1 of L\n*> (if the matrix is not split.) At the end of each block\n*> is stored the corresponding shift as given by DLARRE.\n*> On exit, L is overwritten.\n*> \\endverbatim\n*>\n*> \\param[in] PIVMIN\n*> \\verbatim\n*> PIVMIN is DOUBLE PRECISION\n*> The minimum pivot allowed in the Sturm sequence.\n*> \\endverbatim\n*>\n*> \\param[in] ISPLIT\n*> \\verbatim\n*> ISPLIT is INTEGER array, dimension (N)\n*> The splitting points, at which T breaks up into blocks.\n*> The first block consists of rows/columns 1 to\n*> ISPLIT( 1 ), the second of rows/columns ISPLIT( 1 )+1\n*> through ISPLIT( 2 ), etc.\n*> \\endverbatim\n*>\n*> \\param[in] M\n*> \\verbatim\n*> M is INTEGER\n*> The total number of input eigenvalues. 0 <= M <= N.\n*> \\endverbatim\n*>\n*> \\param[in] DOL\n*> \\verbatim\n*> DOL is INTEGER\n*> \\endverbatim\n*>\n*> \\param[in] DOU\n*> \\verbatim\n*> DOU is INTEGER\n*> If the user wants to compute only selected eigenvectors from all\n*> the eigenvalues supplied, he can specify an index range DOL:DOU.\n*> Or else the setting DOL=1, DOU=M should be applied.\n*> Note that DOL and DOU refer to the order in which the eigenvalues\n*> are stored in W.\n*> If the user wants to compute only selected eigenpairs, then\n*> the columns DOL-1 to DOU+1 of the eigenvector space Z contain the\n*> computed eigenvectors. All other columns of Z are set to zero.\n*> \\endverbatim\n*>\n*> \\param[in] MINRGP\n*> \\verbatim\n*> MINRGP is DOUBLE PRECISION\n*> \\endverbatim\n*>\n*> \\param[in] RTOL1\n*> \\verbatim\n*> RTOL1 is DOUBLE PRECISION\n*> \\endverbatim\n*>\n*> \\param[in] RTOL2\n*> \\verbatim\n*> RTOL2 is DOUBLE PRECISION\n*> Parameters for bisection.\n*> An interval [LEFT,RIGHT] has converged if\n*> RIGHT-LEFT < MAX( RTOL1*GAP, RTOL2*MAX(|LEFT|,|RIGHT|) )\n*> \\endverbatim\n*>\n*> \\param[in,out] W\n*> \\verbatim\n*> W is DOUBLE PRECISION array, dimension (N)\n*> The first M elements of W contain the APPROXIMATE eigenvalues for\n*> which eigenvectors are to be computed. The eigenvalues\n*> should be grouped by split-off block and ordered from\n*> smallest to largest within the block ( The output array\n*> W from DLARRE is expected here ). Furthermore, they are with\n*> respect to the shift of the corresponding root representation\n*> for their block. On exit, W holds the eigenvalues of the\n*> UNshifted matrix.\n*> \\endverbatim\n*>\n*> \\param[in,out] WERR\n*> \\verbatim\n*> WERR is DOUBLE PRECISION array, dimension (N)\n*> The first M elements contain the semiwidth of the uncertainty\n*> interval of the corresponding eigenvalue in W\n*> \\endverbatim\n*>\n*> \\param[in,out] WGAP\n*> \\verbatim\n*> WGAP is DOUBLE PRECISION array, dimension (N)\n*> The separation from the right neighbor eigenvalue in W.\n*> \\endverbatim\n*>\n*> \\param[in] IBLOCK\n*> \\verbatim\n*> IBLOCK is INTEGER array, dimension (N)\n*> The indices of the blocks (submatrices) associated with the\n*> corresponding eigenvalues in W; IBLOCK(i)=1 if eigenvalue\n*> W(i) belongs to the first block from the top, =2 if W(i)\n*> belongs to the second block, etc.\n*> \\endverbatim\n*>\n*> \\param[in] INDEXW\n*> \\verbatim\n*> INDEXW is INTEGER array, dimension (N)\n*> The indices of the eigenvalues within each block (submatrix);\n*> for example, INDEXW(i)= 10 and IBLOCK(i)=2 imply that the\n*> i-th eigenvalue W(i) is the 10-th eigenvalue in the second block.\n*> \\endverbatim\n*>\n*> \\param[in] GERS\n*> \\verbatim\n*> GERS is DOUBLE PRECISION array, dimension (2*N)\n*> The N Gerschgorin intervals (the i-th Gerschgorin interval\n*> is (GERS(2*i-1), GERS(2*i)). The Gerschgorin intervals should\n*> be computed from the original UNshifted matrix.\n*> \\endverbatim\n*>\n*> \\param[out] Z\n*> \\verbatim\n*> Z is COMPLEX*16 array, dimension (LDZ, max(1,M) )\n*> If INFO = 0, the first M columns of Z contain the\n*> orthonormal eigenvectors of the matrix T\n*> corresponding to the input eigenvalues, with the i-th\n*> column of Z holding the eigenvector associated with W(i).\n*> Note: the user must ensure that at least max(1,M) columns are\n*> supplied in the array Z.\n*> \\endverbatim\n*>\n*> \\param[in] LDZ\n*> \\verbatim\n*> LDZ is INTEGER\n*> The leading dimension of the array Z. LDZ >= 1, and if\n*> JOBZ = 'V', LDZ >= max(1,N).\n*> \\endverbatim\n*>\n*> \\param[out] ISUPPZ\n*> \\verbatim\n*> ISUPPZ is INTEGER array, dimension ( 2*max(1,M) )\n*> The support of the eigenvectors in Z, i.e., the indices\n*> indicating the nonzero elements in Z. The I-th eigenvector\n*> is nonzero only in elements ISUPPZ( 2*I-1 ) through\n*> ISUPPZ( 2*I ).\n*> \\endverbatim\n*>\n*> \\param[out] WORK\n*> \\verbatim\n*> WORK is DOUBLE PRECISION array, dimension (12*N)\n*> \\endverbatim\n*>\n*> \\param[out] IWORK\n*> \\verbatim\n*> IWORK is INTEGER array, dimension (7*N)\n*> \\endverbatim\n*>\n*> \\param[out] INFO\n*> \\verbatim\n*> INFO is INTEGER\n*> = 0: successful exit\n*>\n*> > 0: A problem occurred in ZLARRV.\n*> < 0: One of the called subroutines signaled an internal problem.\n*> Needs inspection of the corresponding parameter IINFO\n*> for further information.\n*>\n*> =-1: Problem in DLARRB when refining a child's eigenvalues.\n*> =-2: Problem in DLARRF when computing the RRR of a child.\n*> When a child is inside a tight cluster, it can be difficult\n*> to find an RRR. A partial remedy from the user's point of\n*> view is to make the parameter MINRGP smaller and recompile.\n*> However, as the orthogonality of the computed vectors is\n*> proportional to 1/MINRGP, the user should be aware that\n*> he might be trading in precision when he decreases MINRGP.\n*> =-3: Problem in DLARRB when refining a single eigenvalue\n*> after the Rayleigh correction was rejected.\n*> = 5: The Rayleigh Quotient Iteration failed to converge to\n*> full accuracy in MAXITR steps.\n*> \\endverbatim\n*\n* Authors:\n* ========\n*\n*> \\author Univ. of Tennessee\n*> \\author Univ. of California Berkeley\n*> \\author Univ. of Colorado Denver\n*> \\author NAG Ltd.\n*\n*> \\ingroup complex16OTHERauxiliary\n*\n*> \\par Contributors:\n* ==================\n*>\n*> Beresford Parlett, University of California, Berkeley, USA \\n\n*> Jim Demmel, University of California, Berkeley, USA \\n\n*> Inderjit Dhillon, University of Texas, Austin, USA \\n\n*> Osni Marques, LBNL/NERSC, USA \\n\n*> Christof Voemel, University of California, Berkeley, USA\n*\n* =====================================================================\n SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\n $ ISPLIT, M, DOL, DOU, MINRGP,\n $ RTOL1, RTOL2, W, WERR, WGAP,\n $ IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\n $ WORK, IWORK, INFO )\n*\n* -- LAPACK auxiliary routine --\n* -- LAPACK is a software package provided by Univ. of Tennessee, --\n* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--\n*\n* .. Scalar Arguments ..\n INTEGER DOL, DOU, INFO, LDZ, M, N\n DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\n* ..\n* .. Array Arguments ..\n INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\n $ ISUPPZ( * ), IWORK( * )\n DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\n $ WGAP( * ), WORK( * )\n COMPLEX*16 Z( LDZ, * )\n* ..\n*\n* =====================================================================\n*\n* .. Parameters ..\n INTEGER MAXITR\n PARAMETER ( MAXITR = 10 )\n COMPLEX*16 CZERO\n PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ) )\n DOUBLE PRECISION ZERO, ONE, TWO, THREE, FOUR, HALF\n PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0,\n $ TWO = 2.0D0, THREE = 3.0D0,\n $ FOUR = 4.0D0, HALF = 0.5D0)\n* ..\n* .. Local Scalars ..\n LOGICAL ESKIP, NEEDBS, STP2II, TRYRQC, USEDBS, USEDRQ\n INTEGER DONE, I, IBEGIN, IDONE, IEND, II, IINDC1,\n $ IINDC2, IINDR, IINDWK, IINFO, IM, IN, INDEIG,\n $ INDLD, INDLLD, INDWRK, ISUPMN, ISUPMX, ITER,\n $ ITMP1, J, JBLK, K, MINIWSIZE, MINWSIZE, NCLUS,\n $ NDEPTH, NEGCNT, NEWCLS, NEWFST, NEWFTT, NEWLST,\n $ NEWSIZ, OFFSET, OLDCLS, OLDFST, OLDIEN, OLDLST,\n $ OLDNCL, P, PARITY, Q, WBEGIN, WEND, WINDEX,\n $ WINDMN, WINDPL, ZFROM, ZTO, ZUSEDL, ZUSEDU,\n $ ZUSEDW\n INTEGER INDIN1, INDIN2\n DOUBLE PRECISION BSTRES, BSTW, EPS, FUDGE, GAP, GAPTOL, GL, GU,\n $ LAMBDA, LEFT, LGAP, MINGMA, NRMINV, RESID,\n $ RGAP, RIGHT, RQCORR, RQTOL, SAVGAP, SGNDEF,\n $ SIGMA, SPDIAM, SSIGMA, TAU, TMP, TOL, ZTZ\n* ..\n* .. External Functions ..\n DOUBLE PRECISION DLAMCH\n EXTERNAL DLAMCH\n* ..\n* .. External Subroutines ..\n EXTERNAL DCOPY, DLARRB, DLARRF, ZDSCAL, ZLAR1V,\n $ ZLASET\n* ..\n* .. Intrinsic Functions ..\n INTRINSIC ABS, DBLE, MAX, MIN\n INTRINSIC DCMPLX\n* ..\n* .. Executable Statements ..\n* .."," INFO = 0\n*\n* Quick return if possible\n*"," IF( N.LE.0 ) THEN"," RETURN\n END IF\n*\n* The first N entries of WORK are reserved for the eigenvalues\n INDLD = N+1\n INDLLD= 2*N+1\n INDIN1 = 3*N + 1\n INDIN2 = 4*N + 1\n INDWRK = 5*N + 1\n MINWSIZE = 12 * N"," DO 5 I= 1,MINWSIZE\n WORK( I ) = ZERO\n 5 CONTINUE","* IWORK(IINDR+1:IINDR+N) hold the twist indices R for the\n* factorization used to compute the FP vector\n IINDR = 0\n* IWORK(IINDC1+1:IINC2+N) are used to store the clusters of the current\n* layer and the one above.\n IINDC1 = N\n IINDC2 = 2*N\n IINDWK = 3*N + 1"," MINIWSIZE = 7 * N\n DO 10 I= 1,MINIWSIZE\n IWORK( I ) = 0\n 10 CONTINUE"," ZUSEDL = 1\n IF(DOL.GT.1) THEN\n* Set lower bound for use of Z\n ZUSEDL = DOL-1\n ENDIF\n ZUSEDU = M\n IF(DOU.LT.M) THEN\n* Set lower bound for use of Z\n ZUSEDU = DOU+1\n ENDIF\n* The width of the part of Z that is used\n ZUSEDW = ZUSEDU - ZUSEDL + 1","\n CALL ZLASET( 'Full', N, ZUSEDW, CZERO, CZERO,\n $ Z(1,ZUSEDL), LDZ )"," EPS = DLAMCH( 'Precision' )\n RQTOL = TWO * EPS\n*\n* Set expert flags for standard code.\n TRYRQC = .TRUE."," IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\n ELSE\n* Only selected eigenpairs are computed. Since the other evalues\n* are not refined by RQ iteration, bisection has to compute to full\n* accuracy.\n RTOL1 = FOUR * EPS\n RTOL2 = FOUR * EPS\n ENDIF","* The entries WBEGIN:WEND in W, WERR, WGAP correspond to the\n* desired eigenvalues. The support of the nonzero eigenvector\n* entries is contained in the interval IBEGIN:IEND.\n* Remark that if k eigenpairs are desired, then the eigenvectors\n* are stored in k contiguous columns of Z.","* DONE is the number of eigenvectors already computed\n DONE = 0\n IBEGIN = 1\n WBEGIN = 1\n DO 170 JBLK = 1, IBLOCK( M )\n IEND = ISPLIT( JBLK )\n SIGMA = L( IEND )\n* Find the eigenvectors of the submatrix indexed IBEGIN\n* through IEND.\n WEND = WBEGIN - 1\n 15 CONTINUE\n IF( WEND.LT.M ) THEN\n IF( IBLOCK( WEND+1 ).EQ.JBLK ) THEN\n WEND = WEND + 1\n GO TO 15\n END IF\n END IF\n IF( WEND.LT.WBEGIN ) THEN\n IBEGIN = IEND + 1\n GO TO 170\n ELSEIF( (WEND.LT.DOL).OR.(WBEGIN.GT.DOU) ) THEN\n IBEGIN = IEND + 1\n WBEGIN = WEND + 1\n GO TO 170\n END IF","* Find local spectral diameter of the block\n GL = GERS( 2*IBEGIN-1 )\n GU = GERS( 2*IBEGIN )\n DO 20 I = IBEGIN+1 , IEND\n GL = MIN( GERS( 2*I-1 ), GL )\n GU = MAX( GERS( 2*I ), GU )\n 20 CONTINUE\n SPDIAM = GU - GL","* OLDIEN is the last index of the previous block\n OLDIEN = IBEGIN - 1\n* Calculate the size of the current block\n IN = IEND - IBEGIN + 1\n* The number of eigenvalues in the current block\n IM = WEND - WBEGIN + 1","* This is for a 1x1 block\n IF( IBEGIN.EQ.IEND ) THEN\n DONE = DONE+1\n Z( IBEGIN, WBEGIN ) = DCMPLX( ONE, ZERO )\n ISUPPZ( 2*WBEGIN-1 ) = IBEGIN\n ISUPPZ( 2*WBEGIN ) = IBEGIN\n W( WBEGIN ) = W( WBEGIN ) + SIGMA\n WORK( WBEGIN ) = W( WBEGIN )\n IBEGIN = IEND + 1\n WBEGIN = WBEGIN + 1\n GO TO 170\n END IF","* The desired (shifted) eigenvalues are stored in W(WBEGIN:WEND)\n* Note that these can be approximations, in this case, the corresp.\n* entries of WERR give the size of the uncertainty interval.\n* The eigenvalue approximations will be refined when necessary as\n* high relative accuracy is required for the computation of the\n* corresponding eigenvectors.\n CALL DCOPY( IM, W( WBEGIN ), 1,\n $ WORK( WBEGIN ), 1 )","* We store in W the eigenvalue approximations w.r.t. the original\n* matrix T.\n DO 30 I=1,IM\n W(WBEGIN+I-1) = W(WBEGIN+I-1)+SIGMA\n 30 CONTINUE","\n* NDEPTH is the current depth of the representation tree\n NDEPTH = 0\n* PARITY is either 1 or 0\n PARITY = 1\n* NCLUS is the number of clusters for the next level of the\n* representation tree, we start with NCLUS = 1 for the root\n NCLUS = 1\n IWORK( IINDC1+1 ) = 1\n IWORK( IINDC1+2 ) = IM","* IDONE is the number of eigenvectors already computed in the current\n* block\n IDONE = 0\n* loop while( IDONE.LT.IM )\n* generate the representation tree for the current block and\n* compute the eigenvectors\n 40 CONTINUE\n IF( IDONE.LT.IM ) THEN\n* This is a crude protection against infinitely deep trees\n IF( NDEPTH.GT.M ) THEN\n INFO = -2\n RETURN\n ENDIF\n* breadth first processing of the current level of the representation\n* tree: OLDNCL = number of clusters on current level\n OLDNCL = NCLUS\n* reset NCLUS to count the number of child clusters\n NCLUS = 0\n*\n PARITY = 1 - PARITY\n IF( PARITY.EQ.0 ) THEN\n OLDCLS = IINDC1\n NEWCLS = IINDC2\n ELSE\n OLDCLS = IINDC2\n NEWCLS = IINDC1\n END IF\n* Process the clusters on the current level\n DO 150 I = 1, OLDNCL\n J = OLDCLS + 2*I\n* OLDFST, OLDLST = first, last index of current cluster.\n* cluster indices start with 1 and are relative\n* to WBEGIN when accessing W, WGAP, WERR, Z\n OLDFST = IWORK( J-1 )\n OLDLST = IWORK( J )\n IF( NDEPTH.GT.0 ) THEN\n* Retrieve relatively robust representation (RRR) of cluster\n* that has been computed at the previous level\n* The RRR is stored in Z and overwritten once the eigenvectors\n* have been computed or when the cluster is refined"," IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\n* Get representation from location of the leftmost evalue\n* of the cluster\n J = WBEGIN + OLDFST - 1\n ELSE\n IF(WBEGIN+OLDFST-1.LT.DOL) THEN\n* Get representation from the left end of Z array\n J = DOL - 1\n ELSEIF(WBEGIN+OLDFST-1.GT.DOU) THEN\n* Get representation from the right end of Z array\n J = DOU\n ELSE\n J = WBEGIN + OLDFST - 1\n ENDIF\n ENDIF\n DO 45 K = 1, IN - 1\n D( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\n $ J ) )\n L( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\n $ J+1 ) )\n 45 CONTINUE\n D( IEND ) = DBLE( Z( IEND, J ) )\n SIGMA = DBLE( Z( IEND, J+1 ) )","* Set the corresponding entries in Z to zero\n CALL ZLASET( 'Full', IN, 2, CZERO, CZERO,\n $ Z( IBEGIN, J), LDZ )\n END IF","* Compute DL and DLL of current RRR\n DO 50 J = IBEGIN, IEND-1\n TMP = D( J )*L( J )\n WORK( INDLD-1+J ) = TMP\n WORK( INDLLD-1+J ) = TMP*L( J )\n 50 CONTINUE"," IF( NDEPTH.GT.0 ) THEN\n* P and Q are index of the first and last eigenvalue to compute\n* within the current block\n P = INDEXW( WBEGIN-1+OLDFST )\n Q = INDEXW( WBEGIN-1+OLDLST )\n* Offset for the arrays WORK, WGAP and WERR, i.e., the P-OFFSET\n* through the Q-OFFSET elements of these arrays are to be used.\n* OFFSET = P-OLDFST\n OFFSET = INDEXW( WBEGIN ) - 1\n* perform limited bisection (if necessary) to get approximate\n* eigenvalues to the precision needed.\n CALL DLARRB( IN, D( IBEGIN ),\n $ WORK(INDLLD+IBEGIN-1),\n $ P, Q, RTOL1, RTOL2, OFFSET,\n $ WORK(WBEGIN),WGAP(WBEGIN),WERR(WBEGIN),\n $ WORK( INDWRK ), IWORK( IINDWK ),\n $ PIVMIN, SPDIAM, IN, IINFO )\n IF( IINFO.NE.0 ) THEN\n INFO = -1\n RETURN\n ENDIF\n* We also recompute the extremal gaps. W holds all eigenvalues\n* of the unshifted matrix and must be used for computation\n* of WGAP, the entries of WORK might stem from RRRs with\n* different shifts. The gaps from WBEGIN-1+OLDFST to\n* WBEGIN-1+OLDLST are correctly computed in DLARRB.\n* However, we only allow the gaps to become greater since\n* this is what should happen when we decrease WERR\n IF( OLDFST.GT.1) THEN\n WGAP( WBEGIN+OLDFST-2 ) =\n $ MAX(WGAP(WBEGIN+OLDFST-2),\n $ W(WBEGIN+OLDFST-1)-WERR(WBEGIN+OLDFST-1)\n $ - W(WBEGIN+OLDFST-2)-WERR(WBEGIN+OLDFST-2) )\n ENDIF\n IF( WBEGIN + OLDLST -1 .LT. WEND ) THEN\n WGAP( WBEGIN+OLDLST-1 ) =\n $ MAX(WGAP(WBEGIN+OLDLST-1),\n $ W(WBEGIN+OLDLST)-WERR(WBEGIN+OLDLST)\n $ - W(WBEGIN+OLDLST-1)-WERR(WBEGIN+OLDLST-1) )\n ENDIF\n* Each time the eigenvalues in WORK get refined, we store\n* the newly found approximation with all shifts applied in W\n DO 53 J=OLDFST,OLDLST\n W(WBEGIN+J-1) = WORK(WBEGIN+J-1)+SIGMA\n 53 CONTINUE\n END IF","* Process the current node.\n NEWFST = OLDFST\n DO 140 J = OLDFST, OLDLST\n IF( J.EQ.OLDLST ) THEN\n* we are at the right end of the cluster, this is also the\n* boundary of the child cluster\n NEWLST = J\n ELSE IF ( WGAP( WBEGIN + J -1).GE.\n $ MINRGP* ABS( WORK(WBEGIN + J -1) ) ) THEN\n* the right relative gap is big enough, the child cluster\n* (NEWFST,..,NEWLST) is well separated from the following\n NEWLST = J\n ELSE\n* inside a child cluster, the relative gap is not\n* big enough.\n GOTO 140\n END IF","* Compute size of child cluster found\n NEWSIZ = NEWLST - NEWFST + 1","* NEWFTT is the place in Z where the new RRR or the computed\n* eigenvector is to be stored\n IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\n* Store representation at location of the leftmost evalue\n* of the cluster\n NEWFTT = WBEGIN + NEWFST - 1\n ELSE\n IF(WBEGIN+NEWFST-1.LT.DOL) THEN\n* Store representation at the left end of Z array\n NEWFTT = DOL - 1\n ELSEIF(WBEGIN+NEWFST-1.GT.DOU) THEN\n* Store representation at the right end of Z array\n NEWFTT = DOU\n ELSE\n NEWFTT = WBEGIN + NEWFST - 1\n ENDIF\n ENDIF"," IF( NEWSIZ.GT.1) THEN\n*\n* Current child is not a singleton but a cluster.\n* Compute and store new representation of child.\n*\n*\n* Compute left and right cluster gap.\n*\n* LGAP and RGAP are not computed from WORK because\n* the eigenvalue approximations may stem from RRRs\n* different shifts. However, W hold all eigenvalues\n* of the unshifted matrix. Still, the entries in WGAP\n* have to be computed from WORK since the entries\n* in W might be of the same order so that gaps are not\n* exhibited correctly for very close eigenvalues.\n IF( NEWFST.EQ.1 ) THEN\n LGAP = MAX( ZERO,\n $ W(WBEGIN)-WERR(WBEGIN) - VL )\n ELSE\n LGAP = WGAP( WBEGIN+NEWFST-2 )\n ENDIF\n RGAP = WGAP( WBEGIN+NEWLST-1 )\n*\n* Compute left- and rightmost eigenvalue of child\n* to high precision in order to shift as close\n* as possible and obtain as large relative gaps\n* as possible\n*\n DO 55 K =1,2\n IF(K.EQ.1) THEN\n P = INDEXW( WBEGIN-1+NEWFST )\n ELSE\n P = INDEXW( WBEGIN-1+NEWLST )\n ENDIF\n OFFSET = INDEXW( WBEGIN ) - 1\n CALL DLARRB( IN, D(IBEGIN),\n $ WORK( INDLLD+IBEGIN-1 ),P,P,\n $ RQTOL, RQTOL, OFFSET,\n $ WORK(WBEGIN),WGAP(WBEGIN),\n $ WERR(WBEGIN),WORK( INDWRK ),\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\n $ IN, IINFO )\n 55 CONTINUE\n*\n IF((WBEGIN+NEWLST-1.LT.DOL).OR.\n $ (WBEGIN+NEWFST-1.GT.DOU)) THEN\n* if the cluster contains no desired eigenvalues\n* skip the computation of that branch of the rep. tree\n*\n* We could skip before the refinement of the extremal\n* eigenvalues of the child, but then the representation\n* tree could be different from the one when nothing is\n* skipped. For this reason we skip at this place.\n IDONE = IDONE + NEWLST - NEWFST + 1\n GOTO 139\n ENDIF\n*\n* Compute RRR of child cluster.\n* Note that the new RRR is stored in Z\n*\n* DLARRF needs LWORK = 2*N\n CALL DLARRF( IN, D( IBEGIN ), L( IBEGIN ),\n $ WORK(INDLD+IBEGIN-1),\n $ NEWFST, NEWLST, WORK(WBEGIN),\n $ WGAP(WBEGIN), WERR(WBEGIN),\n $ SPDIAM, LGAP, RGAP, PIVMIN, TAU,\n $ WORK( INDIN1 ), WORK( INDIN2 ),\n $ WORK( INDWRK ), IINFO )\n* In the complex case, DLARRF cannot write\n* the new RRR directly into Z and needs an intermediate\n* workspace\n DO 56 K = 1, IN-1\n Z( IBEGIN+K-1, NEWFTT ) =\n $ DCMPLX( WORK( INDIN1+K-1 ), ZERO )\n Z( IBEGIN+K-1, NEWFTT+1 ) =\n $ DCMPLX( WORK( INDIN2+K-1 ), ZERO )\n 56 CONTINUE\n Z( IEND, NEWFTT ) =\n $ DCMPLX( WORK( INDIN1+IN-1 ), ZERO )\n IF( IINFO.EQ.0 ) THEN\n* a new RRR for the cluster was found by DLARRF\n* update shift and store it\n SSIGMA = SIGMA + TAU\n Z( IEND, NEWFTT+1 ) = DCMPLX( SSIGMA, ZERO )\n* WORK() are the midpoints and WERR() the semi-width\n* Note that the entries in W are unchanged.\n DO 116 K = NEWFST, NEWLST\n FUDGE =\n $ THREE*EPS*ABS(WORK(WBEGIN+K-1))\n WORK( WBEGIN + K - 1 ) =\n $ WORK( WBEGIN + K - 1) - TAU\n FUDGE = FUDGE +\n $ FOUR*EPS*ABS(WORK(WBEGIN+K-1))\n* Fudge errors\n WERR( WBEGIN + K - 1 ) =\n $ WERR( WBEGIN + K - 1 ) + FUDGE\n* Gaps are not fudged. Provided that WERR is small\n* when eigenvalues are close, a zero gap indicates\n* that a new representation is needed for resolving\n* the cluster. A fudge could lead to a wrong decision\n* of judging eigenvalues 'separated' which in\n* reality are not. This could have a negative impact\n* on the orthogonality of the computed eigenvectors.\n 116 CONTINUE"," NCLUS = NCLUS + 1\n K = NEWCLS + 2*NCLUS\n IWORK( K-1 ) = NEWFST\n IWORK( K ) = NEWLST\n ELSE\n INFO = -2\n RETURN\n ENDIF\n ELSE\n*\n* Compute eigenvector of singleton\n*\n ITER = 0\n*\n TOL = FOUR * LOG(DBLE(IN)) * EPS\n*\n K = NEWFST\n WINDEX = WBEGIN + K - 1\n WINDMN = MAX(WINDEX - 1,1)\n WINDPL = MIN(WINDEX + 1,M)\n LAMBDA = WORK( WINDEX )\n DONE = DONE + 1\n* Check if eigenvector computation is to be skipped\n IF((WINDEX.LT.DOL).OR.\n $ (WINDEX.GT.DOU)) THEN\n ESKIP = .TRUE.\n GOTO 125\n ELSE\n ESKIP = .FALSE.\n ENDIF\n LEFT = WORK( WINDEX ) - WERR( WINDEX )\n RIGHT = WORK( WINDEX ) + WERR( WINDEX )\n INDEIG = INDEXW( WINDEX )\n* Note that since we compute the eigenpairs for a child,\n* all eigenvalue approximations are w.r.t the same shift.\n* In this case, the entries in WORK should be used for\n* computing the gaps since they exhibit even very small\n* differences in the eigenvalues, as opposed to the\n* entries in W which might \"look\" the same."," IF( K .EQ. 1) THEN\n* In the case RANGE='I' and with not much initial\n* accuracy in LAMBDA and VL, the formula\n* LGAP = MAX( ZERO, (SIGMA - VL) + LAMBDA )\n* can lead to an overestimation of the left gap and\n* thus to inadequately early RQI 'convergence'.\n* Prevent this by forcing a small left gap.\n LGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\n ELSE\n LGAP = WGAP(WINDMN)\n ENDIF\n IF( K .EQ. IM) THEN\n* In the case RANGE='I' and with not much initial\n* accuracy in LAMBDA and VU, the formula\n* can lead to an overestimation of the right gap and\n* thus to inadequately early RQI 'convergence'.\n* Prevent this by forcing a small right gap.\n RGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\n ELSE\n RGAP = WGAP(WINDEX)\n ENDIF\n GAP = MIN( LGAP, RGAP )\n IF(( K .EQ. 1).OR.(K .EQ. IM)) THEN\n* The eigenvector support can become wrong\n* because significant entries could be cut off due to a\n* large GAPTOL parameter in LAR1V. Prevent this.\n GAPTOL = ZERO\n ELSE\n GAPTOL = GAP * EPS\n ENDIF\n ISUPMN = IN\n ISUPMX = 1\n* Update WGAP so that it holds the minimum gap\n* to the left or the right. This is crucial in the\n* case where bisection is used to ensure that the\n* eigenvalue is refined up to the required precision.\n* The correct value is restored afterwards.\n SAVGAP = WGAP(WINDEX)\n WGAP(WINDEX) = GAP\n* We want to use the Rayleigh Quotient Correction\n* as often as possible since it converges quadratically\n* when we are close enough to the desired eigenvalue.\n* However, the Rayleigh Quotient can have the wrong sign\n* and lead us away from the desired eigenvalue. In this\n* case, the best we can do is to use bisection.\n USEDBS = .FALSE.\n USEDRQ = .FALSE.\n* Bisection is initially turned off unless it is forced\n NEEDBS = .NOT.TRYRQC\n 120 CONTINUE\n* Check if bisection should be used to refine eigenvalue\n IF(NEEDBS) THEN\n* Take the bisection as new iterate\n USEDBS = .TRUE.\n ITMP1 = IWORK( IINDR+WINDEX )\n OFFSET = INDEXW( WBEGIN ) - 1\n CALL DLARRB( IN, D(IBEGIN),\n $ WORK(INDLLD+IBEGIN-1),INDEIG,INDEIG,\n $ ZERO, TWO*EPS, OFFSET,\n $ WORK(WBEGIN),WGAP(WBEGIN),\n $ WERR(WBEGIN),WORK( INDWRK ),\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\n $ ITMP1, IINFO )\n IF( IINFO.NE.0 ) THEN\n INFO = -3\n RETURN\n ENDIF\n LAMBDA = WORK( WINDEX )\n* Reset twist index from inaccurate LAMBDA to\n* force computation of true MINGMA\n IWORK( IINDR+WINDEX ) = 0\n ENDIF\n* Given LAMBDA, compute the eigenvector.\n CALL ZLAR1V( IN, 1, IN, LAMBDA, D( IBEGIN ),\n $ L( IBEGIN ), WORK(INDLD+IBEGIN-1),\n $ WORK(INDLLD+IBEGIN-1),\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\n $ IWORK( IINDR+WINDEX ), ISUPPZ( 2*WINDEX-1 ),\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\n IF(ITER .EQ. 0) THEN\n BSTRES = RESID\n BSTW = LAMBDA\n ELSEIF(RESID.LT.BSTRES) THEN\n BSTRES = RESID\n BSTW = LAMBDA\n ENDIF\n ISUPMN = MIN(ISUPMN,ISUPPZ( 2*WINDEX-1 ))\n ISUPMX = MAX(ISUPMX,ISUPPZ( 2*WINDEX ))\n ITER = ITER + 1","* sin alpha <= |resid|/gap\n* Note that both the residual and the gap are\n* proportional to the matrix, so ||T|| doesn't play\n* a role in the quotient","*\n* Convergence test for Rayleigh-Quotient iteration\n* (omitted when Bisection has been used)\n*\n IF( RESID.GT.TOL*GAP .AND. ABS( RQCORR ).GT.\n $ RQTOL*ABS( LAMBDA ) .AND. .NOT. USEDBS)\n $ THEN\n* We need to check that the RQCORR update doesn't\n* move the eigenvalue away from the desired one and\n* towards a neighbor. -> protection with bisection\n IF(INDEIG.LE.NEGCNT) THEN\n* The wanted eigenvalue lies to the left\n SGNDEF = -ONE\n ELSE\n* The wanted eigenvalue lies to the right\n SGNDEF = ONE\n ENDIF\n* We only use the RQCORR if it improves the\n* the iterate reasonably.\n IF( ( RQCORR*SGNDEF.GE.ZERO )\n $ .AND.( LAMBDA + RQCORR.LE. RIGHT)\n $ .AND.( LAMBDA + RQCORR.GE. LEFT)\n $ ) THEN\n USEDRQ = .TRUE.\n* Store new midpoint of bisection interval in WORK\n IF(SGNDEF.EQ.ONE) THEN\n* The current LAMBDA is on the left of the true\n* eigenvalue\n LEFT = LAMBDA\n* We prefer to assume that the error estimate\n* is correct. We could make the interval not\n* as a bracket but to be modified if the RQCORR\n* chooses to. In this case, the RIGHT side should\n* be modified as follows:\n* RIGHT = MAX(RIGHT, LAMBDA + RQCORR)\n ELSE\n* The current LAMBDA is on the right of the true\n* eigenvalue\n RIGHT = LAMBDA\n* See comment about assuming the error estimate is\n* correct above.\n* LEFT = MIN(LEFT, LAMBDA + RQCORR)\n ENDIF\n WORK( WINDEX ) =\n $ HALF * (RIGHT + LEFT)\n* Take RQCORR since it has the correct sign and\n* improves the iterate reasonably\n LAMBDA = LAMBDA + RQCORR\n* Update width of error interval\n WERR( WINDEX ) =\n $ HALF * (RIGHT-LEFT)\n ELSE\n NEEDBS = .TRUE.\n ENDIF\n IF(RIGHT-LEFT.LT.RQTOL*ABS(LAMBDA)) THEN\n* The eigenvalue is computed to bisection accuracy\n* compute eigenvector and stop\n USEDBS = .TRUE.\n GOTO 120\n ELSEIF( ITER.LT.MAXITR ) THEN\n GOTO 120\n ELSEIF( ITER.EQ.MAXITR ) THEN\n NEEDBS = .TRUE.\n GOTO 120\n ELSE\n INFO = 5\n RETURN\n END IF\n ELSE\n STP2II = .FALSE.\n IF(USEDRQ .AND. USEDBS .AND.\n $ BSTRES.LE.RESID) THEN\n LAMBDA = BSTW\n STP2II = .TRUE.\n ENDIF\n IF (STP2II) THEN\n* improve error angle by second step\n CALL ZLAR1V( IN, 1, IN, LAMBDA,\n $ D( IBEGIN ), L( IBEGIN ),\n $ WORK(INDLD+IBEGIN-1),\n $ WORK(INDLLD+IBEGIN-1),\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\n $ IWORK( IINDR+WINDEX ),\n $ ISUPPZ( 2*WINDEX-1 ),\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\n ENDIF\n WORK( WINDEX ) = LAMBDA\n END IF\n*\n* Compute FP-vector support w.r.t. whole matrix\n*\n ISUPPZ( 2*WINDEX-1 ) = ISUPPZ( 2*WINDEX-1 )+OLDIEN\n ISUPPZ( 2*WINDEX ) = ISUPPZ( 2*WINDEX )+OLDIEN\n ZFROM = ISUPPZ( 2*WINDEX-1 )\n ZTO = ISUPPZ( 2*WINDEX )\n ISUPMN = ISUPMN + OLDIEN\n ISUPMX = ISUPMX + OLDIEN\n* Ensure vector is ok if support in the RQI has changed\n IF(ISUPMN.LT.ZFROM) THEN\n DO 122 II = ISUPMN,ZFROM-1\n Z( II, WINDEX ) = ZERO\n 122 CONTINUE\n ENDIF\n IF(ISUPMX.GT.ZTO) THEN\n DO 123 II = ZTO+1,ISUPMX\n Z( II, WINDEX ) = ZERO\n 123 CONTINUE\n ENDIF\n CALL ZDSCAL( ZTO-ZFROM+1, NRMINV,\n $ Z( ZFROM, WINDEX ), 1 )\n 125 CONTINUE\n* Update W\n W( WINDEX ) = LAMBDA+SIGMA\n* Recompute the gaps on the left and right\n* But only allow them to become larger and not\n* smaller (which can only happen through \"bad\"\n* cancellation and doesn't reflect the theory\n* where the initial gaps are underestimated due\n* to WERR being too crude.)\n IF(.NOT.ESKIP) THEN\n IF( K.GT.1) THEN\n WGAP( WINDMN ) = MAX( WGAP(WINDMN),\n $ W(WINDEX)-WERR(WINDEX)\n $ - W(WINDMN)-WERR(WINDMN) )\n ENDIF\n IF( WINDEX.LT.WEND ) THEN\n WGAP( WINDEX ) = MAX( SAVGAP,\n $ W( WINDPL )-WERR( WINDPL )\n $ - W( WINDEX )-WERR( WINDEX) )\n ENDIF\n ENDIF\n IDONE = IDONE + 1\n ENDIF\n* here ends the code for the current child\n*\n 139 CONTINUE\n* Proceed to any remaining child nodes\n NEWFST = J + 1\n 140 CONTINUE\n 150 CONTINUE\n NDEPTH = NDEPTH + 1\n GO TO 40\n END IF\n IBEGIN = IEND + 1\n WBEGIN = WEND + 1\n 170 CONTINUE\n*"," RETURN\n*\n* End of ZLARRV\n*\n END"],"string":"[\n \"*> \\\\brief \\\\b ZLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\\n*\\n* =========== DOCUMENTATION ===========\\n*\\n* Online html documentation available at\\n* http://www.netlib.org/lapack/explore-html/\\n*\\n*> \\\\htmlonly\\n*> Download ZLARRV + dependencies\\n*> <a href=\\\"http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlarrv.f\\\">\\n*> [TGZ]</a>\\n*> <a href=\\\"http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlarrv.f\\\">\\n*> [ZIP]</a>\\n*> <a href=\\\"http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlarrv.f\\\">\\n*> [TXT]</a>\\n*> \\\\endhtmlonly\\n*\\n* Definition:\\n* ===========\\n*\\n* SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\\n* ISPLIT, M, DOL, DOU, MINRGP,\\n* RTOL1, RTOL2, W, WERR, WGAP,\\n* IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\\n* WORK, IWORK, INFO )\\n*\\n* .. Scalar Arguments ..\\n* INTEGER DOL, DOU, INFO, LDZ, M, N\\n* DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\\n* ..\\n* .. Array Arguments ..\\n* INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\\n* $ ISUPPZ( * ), IWORK( * )\\n* DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\\n* $ WGAP( * ), WORK( * )\\n* COMPLEX*16 Z( LDZ, * )\\n* ..\\n*\\n*\\n*> \\\\par Purpose:\\n* =============\\n*>\\n*> \\\\verbatim\\n*>\\n*> ZLARRV computes the eigenvectors of the tridiagonal matrix\\n*> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.\\n*> The input eigenvalues should have been computed by DLARRE.\\n*> \\\\endverbatim\\n*\\n* Arguments:\\n* ==========\\n*\\n*> \\\\param[in] N\\n*> \\\\verbatim\\n*> N is INTEGER\\n*> The order of the matrix. N >= 0.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] VL\\n*> \\\\verbatim\\n*> VL is DOUBLE PRECISION\\n*> Lower bound of the interval that contains the desired\\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\\n*> end of the extremal eigenvalues in the desired RANGE.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] VU\\n*> \\\\verbatim\\n*> VU is DOUBLE PRECISION\\n*> Upper bound of the interval that contains the desired\\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\\n*> end of the extremal eigenvalues in the desired RANGE.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] D\\n*> \\\\verbatim\\n*> D is DOUBLE PRECISION array, dimension (N)\\n*> On entry, the N diagonal elements of the diagonal matrix D.\\n*> On exit, D may be overwritten.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] L\\n*> \\\\verbatim\\n*> L is DOUBLE PRECISION array, dimension (N)\\n*> On entry, the (N-1) subdiagonal elements of the unit\\n*> bidiagonal matrix L are in elements 1 to N-1 of L\\n*> (if the matrix is not split.) At the end of each block\\n*> is stored the corresponding shift as given by DLARRE.\\n*> On exit, L is overwritten.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] PIVMIN\\n*> \\\\verbatim\\n*> PIVMIN is DOUBLE PRECISION\\n*> The minimum pivot allowed in the Sturm sequence.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] ISPLIT\\n*> \\\\verbatim\\n*> ISPLIT is INTEGER array, dimension (N)\\n*> The splitting points, at which T breaks up into blocks.\\n*> The first block consists of rows/columns 1 to\\n*> ISPLIT( 1 ), the second of rows/columns ISPLIT( 1 )+1\\n*> through ISPLIT( 2 ), etc.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] M\\n*> \\\\verbatim\\n*> M is INTEGER\\n*> The total number of input eigenvalues. 0 <= M <= N.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] DOL\\n*> \\\\verbatim\\n*> DOL is INTEGER\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] DOU\\n*> \\\\verbatim\\n*> DOU is INTEGER\\n*> If the user wants to compute only selected eigenvectors from all\\n*> the eigenvalues supplied, he can specify an index range DOL:DOU.\\n*> Or else the setting DOL=1, DOU=M should be applied.\\n*> Note that DOL and DOU refer to the order in which the eigenvalues\\n*> are stored in W.\\n*> If the user wants to compute only selected eigenpairs, then\\n*> the columns DOL-1 to DOU+1 of the eigenvector space Z contain the\\n*> computed eigenvectors. All other columns of Z are set to zero.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] MINRGP\\n*> \\\\verbatim\\n*> MINRGP is DOUBLE PRECISION\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] RTOL1\\n*> \\\\verbatim\\n*> RTOL1 is DOUBLE PRECISION\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] RTOL2\\n*> \\\\verbatim\\n*> RTOL2 is DOUBLE PRECISION\\n*> Parameters for bisection.\\n*> An interval [LEFT,RIGHT] has converged if\\n*> RIGHT-LEFT < MAX( RTOL1*GAP, RTOL2*MAX(|LEFT|,|RIGHT|) )\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] W\\n*> \\\\verbatim\\n*> W is DOUBLE PRECISION array, dimension (N)\\n*> The first M elements of W contain the APPROXIMATE eigenvalues for\\n*> which eigenvectors are to be computed. The eigenvalues\\n*> should be grouped by split-off block and ordered from\\n*> smallest to largest within the block ( The output array\\n*> W from DLARRE is expected here ). Furthermore, they are with\\n*> respect to the shift of the corresponding root representation\\n*> for their block. On exit, W holds the eigenvalues of the\\n*> UNshifted matrix.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] WERR\\n*> \\\\verbatim\\n*> WERR is DOUBLE PRECISION array, dimension (N)\\n*> The first M elements contain the semiwidth of the uncertainty\\n*> interval of the corresponding eigenvalue in W\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] WGAP\\n*> \\\\verbatim\\n*> WGAP is DOUBLE PRECISION array, dimension (N)\\n*> The separation from the right neighbor eigenvalue in W.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] IBLOCK\\n*> \\\\verbatim\\n*> IBLOCK is INTEGER array, dimension (N)\\n*> The indices of the blocks (submatrices) associated with the\\n*> corresponding eigenvalues in W; IBLOCK(i)=1 if eigenvalue\\n*> W(i) belongs to the first block from the top, =2 if W(i)\\n*> belongs to the second block, etc.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] INDEXW\\n*> \\\\verbatim\\n*> INDEXW is INTEGER array, dimension (N)\\n*> The indices of the eigenvalues within each block (submatrix);\\n*> for example, INDEXW(i)= 10 and IBLOCK(i)=2 imply that the\\n*> i-th eigenvalue W(i) is the 10-th eigenvalue in the second block.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] GERS\\n*> \\\\verbatim\\n*> GERS is DOUBLE PRECISION array, dimension (2*N)\\n*> The N Gerschgorin intervals (the i-th Gerschgorin interval\\n*> is (GERS(2*i-1), GERS(2*i)). The Gerschgorin intervals should\\n*> be computed from the original UNshifted matrix.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] Z\\n*> \\\\verbatim\\n*> Z is COMPLEX*16 array, dimension (LDZ, max(1,M) )\\n*> If INFO = 0, the first M columns of Z contain the\\n*> orthonormal eigenvectors of the matrix T\\n*> corresponding to the input eigenvalues, with the i-th\\n*> column of Z holding the eigenvector associated with W(i).\\n*> Note: the user must ensure that at least max(1,M) columns are\\n*> supplied in the array Z.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] LDZ\\n*> \\\\verbatim\\n*> LDZ is INTEGER\\n*> The leading dimension of the array Z. LDZ >= 1, and if\\n*> JOBZ = 'V', LDZ >= max(1,N).\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] ISUPPZ\\n*> \\\\verbatim\\n*> ISUPPZ is INTEGER array, dimension ( 2*max(1,M) )\\n*> The support of the eigenvectors in Z, i.e., the indices\\n*> indicating the nonzero elements in Z. The I-th eigenvector\\n*> is nonzero only in elements ISUPPZ( 2*I-1 ) through\\n*> ISUPPZ( 2*I ).\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] WORK\\n*> \\\\verbatim\\n*> WORK is DOUBLE PRECISION array, dimension (12*N)\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] IWORK\\n*> \\\\verbatim\\n*> IWORK is INTEGER array, dimension (7*N)\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] INFO\\n*> \\\\verbatim\\n*> INFO is INTEGER\\n*> = 0: successful exit\\n*>\\n*> > 0: A problem occurred in ZLARRV.\\n*> < 0: One of the called subroutines signaled an internal problem.\\n*> Needs inspection of the corresponding parameter IINFO\\n*> for further information.\\n*>\\n*> =-1: Problem in DLARRB when refining a child's eigenvalues.\\n*> =-2: Problem in DLARRF when computing the RRR of a child.\\n*> When a child is inside a tight cluster, it can be difficult\\n*> to find an RRR. A partial remedy from the user's point of\\n*> view is to make the parameter MINRGP smaller and recompile.\\n*> However, as the orthogonality of the computed vectors is\\n*> proportional to 1/MINRGP, the user should be aware that\\n*> he might be trading in precision when he decreases MINRGP.\\n*> =-3: Problem in DLARRB when refining a single eigenvalue\\n*> after the Rayleigh correction was rejected.\\n*> = 5: The Rayleigh Quotient Iteration failed to converge to\\n*> full accuracy in MAXITR steps.\\n*> \\\\endverbatim\\n*\\n* Authors:\\n* ========\\n*\\n*> \\\\author Univ. of Tennessee\\n*> \\\\author Univ. of California Berkeley\\n*> \\\\author Univ. of Colorado Denver\\n*> \\\\author NAG Ltd.\\n*\\n*> \\\\ingroup complex16OTHERauxiliary\\n*\\n*> \\\\par Contributors:\\n* ==================\\n*>\\n*> Beresford Parlett, University of California, Berkeley, USA \\\\n\\n*> Jim Demmel, University of California, Berkeley, USA \\\\n\\n*> Inderjit Dhillon, University of Texas, Austin, USA \\\\n\\n*> Osni Marques, LBNL/NERSC, USA \\\\n\\n*> Christof Voemel, University of California, Berkeley, USA\\n*\\n* =====================================================================\\n SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\\n $ ISPLIT, M, DOL, DOU, MINRGP,\\n $ RTOL1, RTOL2, W, WERR, WGAP,\\n $ IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\\n $ WORK, IWORK, INFO )\\n*\\n* -- LAPACK auxiliary routine --\\n* -- LAPACK is a software package provided by Univ. of Tennessee, --\\n* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--\\n*\\n* .. Scalar Arguments ..\\n INTEGER DOL, DOU, INFO, LDZ, M, N\\n DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\\n* ..\\n* .. Array Arguments ..\\n INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\\n $ ISUPPZ( * ), IWORK( * )\\n DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\\n $ WGAP( * ), WORK( * )\\n COMPLEX*16 Z( LDZ, * )\\n* ..\\n*\\n* =====================================================================\\n*\\n* .. Parameters ..\\n INTEGER MAXITR\\n PARAMETER ( MAXITR = 10 )\\n COMPLEX*16 CZERO\\n PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ) )\\n DOUBLE PRECISION ZERO, ONE, TWO, THREE, FOUR, HALF\\n PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0,\\n $ TWO = 2.0D0, THREE = 3.0D0,\\n $ FOUR = 4.0D0, HALF = 0.5D0)\\n* ..\\n* .. Local Scalars ..\\n LOGICAL ESKIP, NEEDBS, STP2II, TRYRQC, USEDBS, USEDRQ\\n INTEGER DONE, I, IBEGIN, IDONE, IEND, II, IINDC1,\\n $ IINDC2, IINDR, IINDWK, IINFO, IM, IN, INDEIG,\\n $ INDLD, INDLLD, INDWRK, ISUPMN, ISUPMX, ITER,\\n $ ITMP1, J, JBLK, K, MINIWSIZE, MINWSIZE, NCLUS,\\n $ NDEPTH, NEGCNT, NEWCLS, NEWFST, NEWFTT, NEWLST,\\n $ NEWSIZ, OFFSET, OLDCLS, OLDFST, OLDIEN, OLDLST,\\n $ OLDNCL, P, PARITY, Q, WBEGIN, WEND, WINDEX,\\n $ WINDMN, WINDPL, ZFROM, ZTO, ZUSEDL, ZUSEDU,\\n $ ZUSEDW\\n INTEGER INDIN1, INDIN2\\n DOUBLE PRECISION BSTRES, BSTW, EPS, FUDGE, GAP, GAPTOL, GL, GU,\\n $ LAMBDA, LEFT, LGAP, MINGMA, NRMINV, RESID,\\n $ RGAP, RIGHT, RQCORR, RQTOL, SAVGAP, SGNDEF,\\n $ SIGMA, SPDIAM, SSIGMA, TAU, TMP, TOL, ZTZ\\n* ..\\n* .. External Functions ..\\n DOUBLE PRECISION DLAMCH\\n EXTERNAL DLAMCH\\n* ..\\n* .. External Subroutines ..\\n EXTERNAL DCOPY, DLARRB, DLARRF, ZDSCAL, ZLAR1V,\\n $ ZLASET\\n* ..\\n* .. Intrinsic Functions ..\\n INTRINSIC ABS, DBLE, MAX, MIN\\n INTRINSIC DCMPLX\\n* ..\\n* .. Executable Statements ..\\n* ..\",\n \" INFO = 0\\n*\\n* Quick return if possible\\n*\",\n \" IF( N.LE.0 ) THEN\",\n \" RETURN\\n END IF\\n*\\n* The first N entries of WORK are reserved for the eigenvalues\\n INDLD = N+1\\n INDLLD= 2*N+1\\n INDIN1 = 3*N + 1\\n INDIN2 = 4*N + 1\\n INDWRK = 5*N + 1\\n MINWSIZE = 12 * N\",\n \" DO 5 I= 1,MINWSIZE\\n WORK( I ) = ZERO\\n 5 CONTINUE\",\n \"* IWORK(IINDR+1:IINDR+N) hold the twist indices R for the\\n* factorization used to compute the FP vector\\n IINDR = 0\\n* IWORK(IINDC1+1:IINC2+N) are used to store the clusters of the current\\n* layer and the one above.\\n IINDC1 = N\\n IINDC2 = 2*N\\n IINDWK = 3*N + 1\",\n \" MINIWSIZE = 7 * N\\n DO 10 I= 1,MINIWSIZE\\n IWORK( I ) = 0\\n 10 CONTINUE\",\n \" ZUSEDL = 1\\n IF(DOL.GT.1) THEN\\n* Set lower bound for use of Z\\n ZUSEDL = DOL-1\\n ENDIF\\n ZUSEDU = M\\n IF(DOU.LT.M) THEN\\n* Set lower bound for use of Z\\n ZUSEDU = DOU+1\\n ENDIF\\n* The width of the part of Z that is used\\n ZUSEDW = ZUSEDU - ZUSEDL + 1\",\n \"\\n CALL ZLASET( 'Full', N, ZUSEDW, CZERO, CZERO,\\n $ Z(1,ZUSEDL), LDZ )\",\n \" EPS = DLAMCH( 'Precision' )\\n RQTOL = TWO * EPS\\n*\\n* Set expert flags for standard code.\\n TRYRQC = .TRUE.\",\n \" IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\\n ELSE\\n* Only selected eigenpairs are computed. Since the other evalues\\n* are not refined by RQ iteration, bisection has to compute to full\\n* accuracy.\\n RTOL1 = FOUR * EPS\\n RTOL2 = FOUR * EPS\\n ENDIF\",\n \"* The entries WBEGIN:WEND in W, WERR, WGAP correspond to the\\n* desired eigenvalues. The support of the nonzero eigenvector\\n* entries is contained in the interval IBEGIN:IEND.\\n* Remark that if k eigenpairs are desired, then the eigenvectors\\n* are stored in k contiguous columns of Z.\",\n \"* DONE is the number of eigenvectors already computed\\n DONE = 0\\n IBEGIN = 1\\n WBEGIN = 1\\n DO 170 JBLK = 1, IBLOCK( M )\\n IEND = ISPLIT( JBLK )\\n SIGMA = L( IEND )\\n* Find the eigenvectors of the submatrix indexed IBEGIN\\n* through IEND.\\n WEND = WBEGIN - 1\\n 15 CONTINUE\\n IF( WEND.LT.M ) THEN\\n IF( IBLOCK( WEND+1 ).EQ.JBLK ) THEN\\n WEND = WEND + 1\\n GO TO 15\\n END IF\\n END IF\\n IF( WEND.LT.WBEGIN ) THEN\\n IBEGIN = IEND + 1\\n GO TO 170\\n ELSEIF( (WEND.LT.DOL).OR.(WBEGIN.GT.DOU) ) THEN\\n IBEGIN = IEND + 1\\n WBEGIN = WEND + 1\\n GO TO 170\\n END IF\",\n \"* Find local spectral diameter of the block\\n GL = GERS( 2*IBEGIN-1 )\\n GU = GERS( 2*IBEGIN )\\n DO 20 I = IBEGIN+1 , IEND\\n GL = MIN( GERS( 2*I-1 ), GL )\\n GU = MAX( GERS( 2*I ), GU )\\n 20 CONTINUE\\n SPDIAM = GU - GL\",\n \"* OLDIEN is the last index of the previous block\\n OLDIEN = IBEGIN - 1\\n* Calculate the size of the current block\\n IN = IEND - IBEGIN + 1\\n* The number of eigenvalues in the current block\\n IM = WEND - WBEGIN + 1\",\n \"* This is for a 1x1 block\\n IF( IBEGIN.EQ.IEND ) THEN\\n DONE = DONE+1\\n Z( IBEGIN, WBEGIN ) = DCMPLX( ONE, ZERO )\\n ISUPPZ( 2*WBEGIN-1 ) = IBEGIN\\n ISUPPZ( 2*WBEGIN ) = IBEGIN\\n W( WBEGIN ) = W( WBEGIN ) + SIGMA\\n WORK( WBEGIN ) = W( WBEGIN )\\n IBEGIN = IEND + 1\\n WBEGIN = WBEGIN + 1\\n GO TO 170\\n END IF\",\n \"* The desired (shifted) eigenvalues are stored in W(WBEGIN:WEND)\\n* Note that these can be approximations, in this case, the corresp.\\n* entries of WERR give the size of the uncertainty interval.\\n* The eigenvalue approximations will be refined when necessary as\\n* high relative accuracy is required for the computation of the\\n* corresponding eigenvectors.\\n CALL DCOPY( IM, W( WBEGIN ), 1,\\n $ WORK( WBEGIN ), 1 )\",\n \"* We store in W the eigenvalue approximations w.r.t. the original\\n* matrix T.\\n DO 30 I=1,IM\\n W(WBEGIN+I-1) = W(WBEGIN+I-1)+SIGMA\\n 30 CONTINUE\",\n \"\\n* NDEPTH is the current depth of the representation tree\\n NDEPTH = 0\\n* PARITY is either 1 or 0\\n PARITY = 1\\n* NCLUS is the number of clusters for the next level of the\\n* representation tree, we start with NCLUS = 1 for the root\\n NCLUS = 1\\n IWORK( IINDC1+1 ) = 1\\n IWORK( IINDC1+2 ) = IM\",\n \"* IDONE is the number of eigenvectors already computed in the current\\n* block\\n IDONE = 0\\n* loop while( IDONE.LT.IM )\\n* generate the representation tree for the current block and\\n* compute the eigenvectors\\n 40 CONTINUE\\n IF( IDONE.LT.IM ) THEN\\n* This is a crude protection against infinitely deep trees\\n IF( NDEPTH.GT.M ) THEN\\n INFO = -2\\n RETURN\\n ENDIF\\n* breadth first processing of the current level of the representation\\n* tree: OLDNCL = number of clusters on current level\\n OLDNCL = NCLUS\\n* reset NCLUS to count the number of child clusters\\n NCLUS = 0\\n*\\n PARITY = 1 - PARITY\\n IF( PARITY.EQ.0 ) THEN\\n OLDCLS = IINDC1\\n NEWCLS = IINDC2\\n ELSE\\n OLDCLS = IINDC2\\n NEWCLS = IINDC1\\n END IF\\n* Process the clusters on the current level\\n DO 150 I = 1, OLDNCL\\n J = OLDCLS + 2*I\\n* OLDFST, OLDLST = first, last index of current cluster.\\n* cluster indices start with 1 and are relative\\n* to WBEGIN when accessing W, WGAP, WERR, Z\\n OLDFST = IWORK( J-1 )\\n OLDLST = IWORK( J )\\n IF( NDEPTH.GT.0 ) THEN\\n* Retrieve relatively robust representation (RRR) of cluster\\n* that has been computed at the previous level\\n* The RRR is stored in Z and overwritten once the eigenvectors\\n* have been computed or when the cluster is refined\",\n \" IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\\n* Get representation from location of the leftmost evalue\\n* of the cluster\\n J = WBEGIN + OLDFST - 1\\n ELSE\\n IF(WBEGIN+OLDFST-1.LT.DOL) THEN\\n* Get representation from the left end of Z array\\n J = DOL - 1\\n ELSEIF(WBEGIN+OLDFST-1.GT.DOU) THEN\\n* Get representation from the right end of Z array\\n J = DOU\\n ELSE\\n J = WBEGIN + OLDFST - 1\\n ENDIF\\n ENDIF\\n DO 45 K = 1, IN - 1\\n D( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\\n $ J ) )\\n L( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\\n $ J+1 ) )\\n 45 CONTINUE\\n D( IEND ) = DBLE( Z( IEND, J ) )\\n SIGMA = DBLE( Z( IEND, J+1 ) )\",\n \"* Set the corresponding entries in Z to zero\\n CALL ZLASET( 'Full', IN, 2, CZERO, CZERO,\\n $ Z( IBEGIN, J), LDZ )\\n END IF\",\n \"* Compute DL and DLL of current RRR\\n DO 50 J = IBEGIN, IEND-1\\n TMP = D( J )*L( J )\\n WORK( INDLD-1+J ) = TMP\\n WORK( INDLLD-1+J ) = TMP*L( J )\\n 50 CONTINUE\",\n \" IF( NDEPTH.GT.0 ) THEN\\n* P and Q are index of the first and last eigenvalue to compute\\n* within the current block\\n P = INDEXW( WBEGIN-1+OLDFST )\\n Q = INDEXW( WBEGIN-1+OLDLST )\\n* Offset for the arrays WORK, WGAP and WERR, i.e., the P-OFFSET\\n* through the Q-OFFSET elements of these arrays are to be used.\\n* OFFSET = P-OLDFST\\n OFFSET = INDEXW( WBEGIN ) - 1\\n* perform limited bisection (if necessary) to get approximate\\n* eigenvalues to the precision needed.\\n CALL DLARRB( IN, D( IBEGIN ),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ P, Q, RTOL1, RTOL2, OFFSET,\\n $ WORK(WBEGIN),WGAP(WBEGIN),WERR(WBEGIN),\\n $ WORK( INDWRK ), IWORK( IINDWK ),\\n $ PIVMIN, SPDIAM, IN, IINFO )\\n IF( IINFO.NE.0 ) THEN\\n INFO = -1\\n RETURN\\n ENDIF\\n* We also recompute the extremal gaps. W holds all eigenvalues\\n* of the unshifted matrix and must be used for computation\\n* of WGAP, the entries of WORK might stem from RRRs with\\n* different shifts. The gaps from WBEGIN-1+OLDFST to\\n* WBEGIN-1+OLDLST are correctly computed in DLARRB.\\n* However, we only allow the gaps to become greater since\\n* this is what should happen when we decrease WERR\\n IF( OLDFST.GT.1) THEN\\n WGAP( WBEGIN+OLDFST-2 ) =\\n $ MAX(WGAP(WBEGIN+OLDFST-2),\\n $ W(WBEGIN+OLDFST-1)-WERR(WBEGIN+OLDFST-1)\\n $ - W(WBEGIN+OLDFST-2)-WERR(WBEGIN+OLDFST-2) )\\n ENDIF\\n IF( WBEGIN + OLDLST -1 .LT. WEND ) THEN\\n WGAP( WBEGIN+OLDLST-1 ) =\\n $ MAX(WGAP(WBEGIN+OLDLST-1),\\n $ W(WBEGIN+OLDLST)-WERR(WBEGIN+OLDLST)\\n $ - W(WBEGIN+OLDLST-1)-WERR(WBEGIN+OLDLST-1) )\\n ENDIF\\n* Each time the eigenvalues in WORK get refined, we store\\n* the newly found approximation with all shifts applied in W\\n DO 53 J=OLDFST,OLDLST\\n W(WBEGIN+J-1) = WORK(WBEGIN+J-1)+SIGMA\\n 53 CONTINUE\\n END IF\",\n \"* Process the current node.\\n NEWFST = OLDFST\\n DO 140 J = OLDFST, OLDLST\\n IF( J.EQ.OLDLST ) THEN\\n* we are at the right end of the cluster, this is also the\\n* boundary of the child cluster\\n NEWLST = J\\n ELSE IF ( WGAP( WBEGIN + J -1).GE.\\n $ MINRGP* ABS( WORK(WBEGIN + J -1) ) ) THEN\\n* the right relative gap is big enough, the child cluster\\n* (NEWFST,..,NEWLST) is well separated from the following\\n NEWLST = J\\n ELSE\\n* inside a child cluster, the relative gap is not\\n* big enough.\\n GOTO 140\\n END IF\",\n \"* Compute size of child cluster found\\n NEWSIZ = NEWLST - NEWFST + 1\",\n \"* NEWFTT is the place in Z where the new RRR or the computed\\n* eigenvector is to be stored\\n IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\\n* Store representation at location of the leftmost evalue\\n* of the cluster\\n NEWFTT = WBEGIN + NEWFST - 1\\n ELSE\\n IF(WBEGIN+NEWFST-1.LT.DOL) THEN\\n* Store representation at the left end of Z array\\n NEWFTT = DOL - 1\\n ELSEIF(WBEGIN+NEWFST-1.GT.DOU) THEN\\n* Store representation at the right end of Z array\\n NEWFTT = DOU\\n ELSE\\n NEWFTT = WBEGIN + NEWFST - 1\\n ENDIF\\n ENDIF\",\n \" IF( NEWSIZ.GT.1) THEN\\n*\\n* Current child is not a singleton but a cluster.\\n* Compute and store new representation of child.\\n*\\n*\\n* Compute left and right cluster gap.\\n*\\n* LGAP and RGAP are not computed from WORK because\\n* the eigenvalue approximations may stem from RRRs\\n* different shifts. However, W hold all eigenvalues\\n* of the unshifted matrix. Still, the entries in WGAP\\n* have to be computed from WORK since the entries\\n* in W might be of the same order so that gaps are not\\n* exhibited correctly for very close eigenvalues.\\n IF( NEWFST.EQ.1 ) THEN\\n LGAP = MAX( ZERO,\\n $ W(WBEGIN)-WERR(WBEGIN) - VL )\\n ELSE\\n LGAP = WGAP( WBEGIN+NEWFST-2 )\\n ENDIF\\n RGAP = WGAP( WBEGIN+NEWLST-1 )\\n*\\n* Compute left- and rightmost eigenvalue of child\\n* to high precision in order to shift as close\\n* as possible and obtain as large relative gaps\\n* as possible\\n*\\n DO 55 K =1,2\\n IF(K.EQ.1) THEN\\n P = INDEXW( WBEGIN-1+NEWFST )\\n ELSE\\n P = INDEXW( WBEGIN-1+NEWLST )\\n ENDIF\\n OFFSET = INDEXW( WBEGIN ) - 1\\n CALL DLARRB( IN, D(IBEGIN),\\n $ WORK( INDLLD+IBEGIN-1 ),P,P,\\n $ RQTOL, RQTOL, OFFSET,\\n $ WORK(WBEGIN),WGAP(WBEGIN),\\n $ WERR(WBEGIN),WORK( INDWRK ),\\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\\n $ IN, IINFO )\\n 55 CONTINUE\\n*\\n IF((WBEGIN+NEWLST-1.LT.DOL).OR.\\n $ (WBEGIN+NEWFST-1.GT.DOU)) THEN\\n* if the cluster contains no desired eigenvalues\\n* skip the computation of that branch of the rep. tree\\n*\\n* We could skip before the refinement of the extremal\\n* eigenvalues of the child, but then the representation\\n* tree could be different from the one when nothing is\\n* skipped. For this reason we skip at this place.\\n IDONE = IDONE + NEWLST - NEWFST + 1\\n GOTO 139\\n ENDIF\\n*\\n* Compute RRR of child cluster.\\n* Note that the new RRR is stored in Z\\n*\\n* DLARRF needs LWORK = 2*N\\n CALL DLARRF( IN, D( IBEGIN ), L( IBEGIN ),\\n $ WORK(INDLD+IBEGIN-1),\\n $ NEWFST, NEWLST, WORK(WBEGIN),\\n $ WGAP(WBEGIN), WERR(WBEGIN),\\n $ SPDIAM, LGAP, RGAP, PIVMIN, TAU,\\n $ WORK( INDIN1 ), WORK( INDIN2 ),\\n $ WORK( INDWRK ), IINFO )\\n* In the complex case, DLARRF cannot write\\n* the new RRR directly into Z and needs an intermediate\\n* workspace\\n DO 56 K = 1, IN-1\\n Z( IBEGIN+K-1, NEWFTT ) =\\n $ DCMPLX( WORK( INDIN1+K-1 ), ZERO )\\n Z( IBEGIN+K-1, NEWFTT+1 ) =\\n $ DCMPLX( WORK( INDIN2+K-1 ), ZERO )\\n 56 CONTINUE\\n Z( IEND, NEWFTT ) =\\n $ DCMPLX( WORK( INDIN1+IN-1 ), ZERO )\\n IF( IINFO.EQ.0 ) THEN\\n* a new RRR for the cluster was found by DLARRF\\n* update shift and store it\\n SSIGMA = SIGMA + TAU\\n Z( IEND, NEWFTT+1 ) = DCMPLX( SSIGMA, ZERO )\\n* WORK() are the midpoints and WERR() the semi-width\\n* Note that the entries in W are unchanged.\\n DO 116 K = NEWFST, NEWLST\\n FUDGE =\\n $ THREE*EPS*ABS(WORK(WBEGIN+K-1))\\n WORK( WBEGIN + K - 1 ) =\\n $ WORK( WBEGIN + K - 1) - TAU\\n FUDGE = FUDGE +\\n $ FOUR*EPS*ABS(WORK(WBEGIN+K-1))\\n* Fudge errors\\n WERR( WBEGIN + K - 1 ) =\\n $ WERR( WBEGIN + K - 1 ) + FUDGE\\n* Gaps are not fudged. Provided that WERR is small\\n* when eigenvalues are close, a zero gap indicates\\n* that a new representation is needed for resolving\\n* the cluster. A fudge could lead to a wrong decision\\n* of judging eigenvalues 'separated' which in\\n* reality are not. This could have a negative impact\\n* on the orthogonality of the computed eigenvectors.\\n 116 CONTINUE\",\n \" NCLUS = NCLUS + 1\\n K = NEWCLS + 2*NCLUS\\n IWORK( K-1 ) = NEWFST\\n IWORK( K ) = NEWLST\\n ELSE\\n INFO = -2\\n RETURN\\n ENDIF\\n ELSE\\n*\\n* Compute eigenvector of singleton\\n*\\n ITER = 0\\n*\\n TOL = FOUR * LOG(DBLE(IN)) * EPS\\n*\\n K = NEWFST\\n WINDEX = WBEGIN + K - 1\\n WINDMN = MAX(WINDEX - 1,1)\\n WINDPL = MIN(WINDEX + 1,M)\\n LAMBDA = WORK( WINDEX )\\n DONE = DONE + 1\\n* Check if eigenvector computation is to be skipped\\n IF((WINDEX.LT.DOL).OR.\\n $ (WINDEX.GT.DOU)) THEN\\n ESKIP = .TRUE.\\n GOTO 125\\n ELSE\\n ESKIP = .FALSE.\\n ENDIF\\n LEFT = WORK( WINDEX ) - WERR( WINDEX )\\n RIGHT = WORK( WINDEX ) + WERR( WINDEX )\\n INDEIG = INDEXW( WINDEX )\\n* Note that since we compute the eigenpairs for a child,\\n* all eigenvalue approximations are w.r.t the same shift.\\n* In this case, the entries in WORK should be used for\\n* computing the gaps since they exhibit even very small\\n* differences in the eigenvalues, as opposed to the\\n* entries in W which might \\\"look\\\" the same.\",\n \" IF( K .EQ. 1) THEN\\n* In the case RANGE='I' and with not much initial\\n* accuracy in LAMBDA and VL, the formula\\n* LGAP = MAX( ZERO, (SIGMA - VL) + LAMBDA )\\n* can lead to an overestimation of the left gap and\\n* thus to inadequately early RQI 'convergence'.\\n* Prevent this by forcing a small left gap.\\n LGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\\n ELSE\\n LGAP = WGAP(WINDMN)\\n ENDIF\\n IF( K .EQ. IM) THEN\\n* In the case RANGE='I' and with not much initial\\n* accuracy in LAMBDA and VU, the formula\\n* can lead to an overestimation of the right gap and\\n* thus to inadequately early RQI 'convergence'.\\n* Prevent this by forcing a small right gap.\\n RGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\\n ELSE\\n RGAP = WGAP(WINDEX)\\n ENDIF\\n GAP = MIN( LGAP, RGAP )\\n IF(( K .EQ. 1).OR.(K .EQ. IM)) THEN\\n* The eigenvector support can become wrong\\n* because significant entries could be cut off due to a\\n* large GAPTOL parameter in LAR1V. Prevent this.\\n GAPTOL = ZERO\\n ELSE\\n GAPTOL = GAP * EPS\\n ENDIF\\n ISUPMN = IN\\n ISUPMX = 1\\n* Update WGAP so that it holds the minimum gap\\n* to the left or the right. This is crucial in the\\n* case where bisection is used to ensure that the\\n* eigenvalue is refined up to the required precision.\\n* The correct value is restored afterwards.\\n SAVGAP = WGAP(WINDEX)\\n WGAP(WINDEX) = GAP\\n* We want to use the Rayleigh Quotient Correction\\n* as often as possible since it converges quadratically\\n* when we are close enough to the desired eigenvalue.\\n* However, the Rayleigh Quotient can have the wrong sign\\n* and lead us away from the desired eigenvalue. In this\\n* case, the best we can do is to use bisection.\\n USEDBS = .FALSE.\\n USEDRQ = .FALSE.\\n* Bisection is initially turned off unless it is forced\\n NEEDBS = .NOT.TRYRQC\\n 120 CONTINUE\\n* Check if bisection should be used to refine eigenvalue\\n IF(NEEDBS) THEN\\n* Take the bisection as new iterate\\n USEDBS = .TRUE.\\n ITMP1 = IWORK( IINDR+WINDEX )\\n OFFSET = INDEXW( WBEGIN ) - 1\\n CALL DLARRB( IN, D(IBEGIN),\\n $ WORK(INDLLD+IBEGIN-1),INDEIG,INDEIG,\\n $ ZERO, TWO*EPS, OFFSET,\\n $ WORK(WBEGIN),WGAP(WBEGIN),\\n $ WERR(WBEGIN),WORK( INDWRK ),\\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\\n $ ITMP1, IINFO )\\n IF( IINFO.NE.0 ) THEN\\n INFO = -3\\n RETURN\\n ENDIF\\n LAMBDA = WORK( WINDEX )\\n* Reset twist index from inaccurate LAMBDA to\\n* force computation of true MINGMA\\n IWORK( IINDR+WINDEX ) = 0\\n ENDIF\\n* Given LAMBDA, compute the eigenvector.\\n CALL ZLAR1V( IN, 1, IN, LAMBDA, D( IBEGIN ),\\n $ L( IBEGIN ), WORK(INDLD+IBEGIN-1),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\\n $ IWORK( IINDR+WINDEX ), ISUPPZ( 2*WINDEX-1 ),\\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\\n IF(ITER .EQ. 0) THEN\\n BSTRES = RESID\\n BSTW = LAMBDA\\n ELSEIF(RESID.LT.BSTRES) THEN\\n BSTRES = RESID\\n BSTW = LAMBDA\\n ENDIF\\n ISUPMN = MIN(ISUPMN,ISUPPZ( 2*WINDEX-1 ))\\n ISUPMX = MAX(ISUPMX,ISUPPZ( 2*WINDEX ))\\n ITER = ITER + 1\",\n \"* sin alpha <= |resid|/gap\\n* Note that both the residual and the gap are\\n* proportional to the matrix, so ||T|| doesn't play\\n* a role in the quotient\",\n \"*\\n* Convergence test for Rayleigh-Quotient iteration\\n* (omitted when Bisection has been used)\\n*\\n IF( RESID.GT.TOL*GAP .AND. ABS( RQCORR ).GT.\\n $ RQTOL*ABS( LAMBDA ) .AND. .NOT. USEDBS)\\n $ THEN\\n* We need to check that the RQCORR update doesn't\\n* move the eigenvalue away from the desired one and\\n* towards a neighbor. -> protection with bisection\\n IF(INDEIG.LE.NEGCNT) THEN\\n* The wanted eigenvalue lies to the left\\n SGNDEF = -ONE\\n ELSE\\n* The wanted eigenvalue lies to the right\\n SGNDEF = ONE\\n ENDIF\\n* We only use the RQCORR if it improves the\\n* the iterate reasonably.\\n IF( ( RQCORR*SGNDEF.GE.ZERO )\\n $ .AND.( LAMBDA + RQCORR.LE. RIGHT)\\n $ .AND.( LAMBDA + RQCORR.GE. LEFT)\\n $ ) THEN\\n USEDRQ = .TRUE.\\n* Store new midpoint of bisection interval in WORK\\n IF(SGNDEF.EQ.ONE) THEN\\n* The current LAMBDA is on the left of the true\\n* eigenvalue\\n LEFT = LAMBDA\\n* We prefer to assume that the error estimate\\n* is correct. We could make the interval not\\n* as a bracket but to be modified if the RQCORR\\n* chooses to. In this case, the RIGHT side should\\n* be modified as follows:\\n* RIGHT = MAX(RIGHT, LAMBDA + RQCORR)\\n ELSE\\n* The current LAMBDA is on the right of the true\\n* eigenvalue\\n RIGHT = LAMBDA\\n* See comment about assuming the error estimate is\\n* correct above.\\n* LEFT = MIN(LEFT, LAMBDA + RQCORR)\\n ENDIF\\n WORK( WINDEX ) =\\n $ HALF * (RIGHT + LEFT)\\n* Take RQCORR since it has the correct sign and\\n* improves the iterate reasonably\\n LAMBDA = LAMBDA + RQCORR\\n* Update width of error interval\\n WERR( WINDEX ) =\\n $ HALF * (RIGHT-LEFT)\\n ELSE\\n NEEDBS = .TRUE.\\n ENDIF\\n IF(RIGHT-LEFT.LT.RQTOL*ABS(LAMBDA)) THEN\\n* The eigenvalue is computed to bisection accuracy\\n* compute eigenvector and stop\\n USEDBS = .TRUE.\\n GOTO 120\\n ELSEIF( ITER.LT.MAXITR ) THEN\\n GOTO 120\\n ELSEIF( ITER.EQ.MAXITR ) THEN\\n NEEDBS = .TRUE.\\n GOTO 120\\n ELSE\\n INFO = 5\\n RETURN\\n END IF\\n ELSE\\n STP2II = .FALSE.\\n IF(USEDRQ .AND. USEDBS .AND.\\n $ BSTRES.LE.RESID) THEN\\n LAMBDA = BSTW\\n STP2II = .TRUE.\\n ENDIF\\n IF (STP2II) THEN\\n* improve error angle by second step\\n CALL ZLAR1V( IN, 1, IN, LAMBDA,\\n $ D( IBEGIN ), L( IBEGIN ),\\n $ WORK(INDLD+IBEGIN-1),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\\n $ IWORK( IINDR+WINDEX ),\\n $ ISUPPZ( 2*WINDEX-1 ),\\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\\n ENDIF\\n WORK( WINDEX ) = LAMBDA\\n END IF\\n*\\n* Compute FP-vector support w.r.t. whole matrix\\n*\\n ISUPPZ( 2*WINDEX-1 ) = ISUPPZ( 2*WINDEX-1 )+OLDIEN\\n ISUPPZ( 2*WINDEX ) = ISUPPZ( 2*WINDEX )+OLDIEN\\n ZFROM = ISUPPZ( 2*WINDEX-1 )\\n ZTO = ISUPPZ( 2*WINDEX )\\n ISUPMN = ISUPMN + OLDIEN\\n ISUPMX = ISUPMX + OLDIEN\\n* Ensure vector is ok if support in the RQI has changed\\n IF(ISUPMN.LT.ZFROM) THEN\\n DO 122 II = ISUPMN,ZFROM-1\\n Z( II, WINDEX ) = ZERO\\n 122 CONTINUE\\n ENDIF\\n IF(ISUPMX.GT.ZTO) THEN\\n DO 123 II = ZTO+1,ISUPMX\\n Z( II, WINDEX ) = ZERO\\n 123 CONTINUE\\n ENDIF\\n CALL ZDSCAL( ZTO-ZFROM+1, NRMINV,\\n $ Z( ZFROM, WINDEX ), 1 )\\n 125 CONTINUE\\n* Update W\\n W( WINDEX ) = LAMBDA+SIGMA\\n* Recompute the gaps on the left and right\\n* But only allow them to become larger and not\\n* smaller (which can only happen through \\\"bad\\\"\\n* cancellation and doesn't reflect the theory\\n* where the initial gaps are underestimated due\\n* to WERR being too crude.)\\n IF(.NOT.ESKIP) THEN\\n IF( K.GT.1) THEN\\n WGAP( WINDMN ) = MAX( WGAP(WINDMN),\\n $ W(WINDEX)-WERR(WINDEX)\\n $ - W(WINDMN)-WERR(WINDMN) )\\n ENDIF\\n IF( WINDEX.LT.WEND ) THEN\\n WGAP( WINDEX ) = MAX( SAVGAP,\\n $ W( WINDPL )-WERR( WINDPL )\\n $ - W( WINDEX )-WERR( WINDEX) )\\n ENDIF\\n ENDIF\\n IDONE = IDONE + 1\\n ENDIF\\n* here ends the code for the current child\\n*\\n 139 CONTINUE\\n* Proceed to any remaining child nodes\\n NEWFST = J + 1\\n 140 CONTINUE\\n 150 CONTINUE\\n NDEPTH = NDEPTH + 1\\n GO TO 40\\n END IF\\n IBEGIN = IEND + 1\\n WBEGIN = WEND + 1\\n 170 CONTINUE\\n*\",\n \" RETURN\\n*\\n* End of ZLARRV\\n*\\n END\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 0,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [352, 354, 354, 352], \"buggy_code_start_loc\": [351, 353, 353, 351], \"filenames\": [\"SRC/clarrv.f\", \"SRC/dlarrv.f\", \"SRC/slarrv.f\", \"SRC/zlarrv.f\"], \"fixing_code_end_loc\": [352, 354, 354, 352], \"fixing_code_start_loc\": [351, 353, 353, 351], \"message\": \"An out-of-bounds read flaw was found in the CLARRV, DLARRV, SLARRV, and ZLARRV functions in lapack through version 3.10.0, as also used in OpenBLAS before version 0.3.18. Specially crafted inputs passed to these functions could cause an application using lapack to crash or possibly disclose portions of its memory.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:lapack_project:lapack:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"860F1070-052A-491D-AF07-7179ABFF53DA\", \"versionEndExcluding\": null, \"versionEndIncluding\": \"3.10.0\", \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:openblas_project:openblas:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"8C8DAA17-150E-4182-ADD1-4317FD35ED9D\", \"versionEndExcluding\": \"0.3.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:julialang:julia:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"50A99E6E-EE4D-443C-AEB3-C141F6CF2266\", \"versionEndExcluding\": null, \"versionEndIncluding\": \"1.6.3\", \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta1:*:*:*:*:*:*\", \"matchCriteriaId\": \"24F54DC9-8AC4-4578-B9B2-ECED81AA515B\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta2:*:*:*:*:*:*\", \"matchCriteriaId\": \"FA4C5004-D212-444C-82B5-2A4B013E0442\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta3:*:*:*:*:*:*\", \"matchCriteriaId\": \"C3B59E6B-37B8-461B-9701-1FD3CCC15014\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta4:*:*:*:*:*:*\", \"matchCriteriaId\": \"DF1A3614-9C2C-4604-BC11-046866C656EA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:rc1:*:*:*:*:*:*\", \"matchCriteriaId\": \"2AD33935-9843-4F09-B5D9-A6C3D86E1022\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:2.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"D07DF15E-FE6B-4DAF-99BB-2147CF7D7EEA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:3.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"516F4E8E-ED2F-4282-9DAB-D8B378F61258\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"D6E54096-5D45-4CB2-AC9A-DDB55BF2B94C\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:5.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"4E37E1B3-6F68-4502-85D6-68333643BDFF\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:openshift_container_storage:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"6FB187A4-F3A6-4993-AEF2-7808F1485EE2\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:openshift_data_foundation:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"0E2C021C-A9F0-4EB4-ADED-81D8B57B4563\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"An out-of-bounds read flaw was found in the CLARRV, DLARRV, SLARRV, and ZLARRV functions in lapack through version 3.10.0, as also used in OpenBLAS before version 0.3.18. Specially crafted inputs passed to these functions could cause an application using lapack to crash or possibly disclose portions of its memory.\"}, {\"lang\": \"es\", \"value\": \"Se ha encontrado un fallo de lectura fuera de l\\u00edmites en las funciones CLARRV, DLARRV, SLARRV y ZLARRV de lapack versiones hasta 3.10.0, usadas tambi\\u00e9n en OpenBLAS versiones anteriores a 0.3.18. Las entradas especialmente dise\\u00f1adas que se pasan a estas funciones podr\\u00edan causar que una aplicaci\\u00f3n que use lapack se bloquee o posiblemente revele partes de su memoria\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-4048\", \"lastModified\": \"2022-01-04T16:09:22.500\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"LOW\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.4, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"NONE\", \"vectorString\": \"AV:N/AC:L/Au:N/C:P/I:N/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 10.0, \"impactScore\": 4.9, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": false}], \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 9.1, \"baseSeverity\": \"CRITICAL\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 3.9, \"impactScore\": 5.2, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2021-12-08T22:15:10.220\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Issue Tracking\", \"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/JuliaLang/julia/issues/42415\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/Reference-LAPACK/lapack/commit/38f3eeee3108b18158409ca2a100e6fe03754781\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Issue Tracking\", \"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/Reference-LAPACK/lapack/pull/625\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/2be5ee3cca97a597f2ee2118808a2d5eacea050c\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/337b65133df174796794871b3988cd03426e6d41\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/ddb0ff5353637bb5f5ad060c9620e334c143e3d7\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/fe497efa0510466fd93578aaf9da1ad8ed4edbe7\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/6QFEVOCUG2UXMVMFMTU4ONJVDEHY2LW2/\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/DROZM4M2QRKSD6FBO4BHSV2QMIRJQPHT/\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-125\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}]}, \"github_commit_url\": \"https://github.com/Reference-LAPACK/lapack/commit/38f3eeee3108b18158409ca2a100e6fe03754781\"}, \"type\": \"CWE-125\"}"},"index":{"kind":"number","value":882,"string":"882"}}},{"rowIdx":5195,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["*> \\brief \\b ZLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download ZLARRV + dependencies\n*> <a href=\"http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlarrv.f\">\n*> [TGZ]</a>\n*> <a href=\"http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlarrv.f\">\n*> [ZIP]</a>\n*> <a href=\"http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlarrv.f\">\n*> [TXT]</a>\n*> \\endhtmlonly\n*\n* Definition:\n* ===========\n*\n* SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\n* ISPLIT, M, DOL, DOU, MINRGP,\n* RTOL1, RTOL2, W, WERR, WGAP,\n* IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\n* WORK, IWORK, INFO )\n*\n* .. Scalar Arguments ..\n* INTEGER DOL, DOU, INFO, LDZ, M, N\n* DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\n* ..\n* .. Array Arguments ..\n* INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\n* $ ISUPPZ( * ), IWORK( * )\n* DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\n* $ WGAP( * ), WORK( * )\n* COMPLEX*16 Z( LDZ, * )\n* ..\n*\n*\n*> \\par Purpose:\n* =============\n*>\n*> \\verbatim\n*>\n*> ZLARRV computes the eigenvectors of the tridiagonal matrix\n*> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.\n*> The input eigenvalues should have been computed by DLARRE.\n*> \\endverbatim\n*\n* Arguments:\n* ==========\n*\n*> \\param[in] N\n*> \\verbatim\n*> N is INTEGER\n*> The order of the matrix. N >= 0.\n*> \\endverbatim\n*>\n*> \\param[in] VL\n*> \\verbatim\n*> VL is DOUBLE PRECISION\n*> Lower bound of the interval that contains the desired\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\n*> end of the extremal eigenvalues in the desired RANGE.\n*> \\endverbatim\n*>\n*> \\param[in] VU\n*> \\verbatim\n*> VU is DOUBLE PRECISION\n*> Upper bound of the interval that contains the desired\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\n*> end of the extremal eigenvalues in the desired RANGE.\n*> \\endverbatim\n*>\n*> \\param[in,out] D\n*> \\verbatim\n*> D is DOUBLE PRECISION array, dimension (N)\n*> On entry, the N diagonal elements of the diagonal matrix D.\n*> On exit, D may be overwritten.\n*> \\endverbatim\n*>\n*> \\param[in,out] L\n*> \\verbatim\n*> L is DOUBLE PRECISION array, dimension (N)\n*> On entry, the (N-1) subdiagonal elements of the unit\n*> bidiagonal matrix L are in elements 1 to N-1 of L\n*> (if the matrix is not split.) At the end of each block\n*> is stored the corresponding shift as given by DLARRE.\n*> On exit, L is overwritten.\n*> \\endverbatim\n*>\n*> \\param[in] PIVMIN\n*> \\verbatim\n*> PIVMIN is DOUBLE PRECISION\n*> The minimum pivot allowed in the Sturm sequence.\n*> \\endverbatim\n*>\n*> \\param[in] ISPLIT\n*> \\verbatim\n*> ISPLIT is INTEGER array, dimension (N)\n*> The splitting points, at which T breaks up into blocks.\n*> The first block consists of rows/columns 1 to\n*> ISPLIT( 1 ), the second of rows/columns ISPLIT( 1 )+1\n*> through ISPLIT( 2 ), etc.\n*> \\endverbatim\n*>\n*> \\param[in] M\n*> \\verbatim\n*> M is INTEGER\n*> The total number of input eigenvalues. 0 <= M <= N.\n*> \\endverbatim\n*>\n*> \\param[in] DOL\n*> \\verbatim\n*> DOL is INTEGER\n*> \\endverbatim\n*>\n*> \\param[in] DOU\n*> \\verbatim\n*> DOU is INTEGER\n*> If the user wants to compute only selected eigenvectors from all\n*> the eigenvalues supplied, he can specify an index range DOL:DOU.\n*> Or else the setting DOL=1, DOU=M should be applied.\n*> Note that DOL and DOU refer to the order in which the eigenvalues\n*> are stored in W.\n*> If the user wants to compute only selected eigenpairs, then\n*> the columns DOL-1 to DOU+1 of the eigenvector space Z contain the\n*> computed eigenvectors. All other columns of Z are set to zero.\n*> \\endverbatim\n*>\n*> \\param[in] MINRGP\n*> \\verbatim\n*> MINRGP is DOUBLE PRECISION\n*> \\endverbatim\n*>\n*> \\param[in] RTOL1\n*> \\verbatim\n*> RTOL1 is DOUBLE PRECISION\n*> \\endverbatim\n*>\n*> \\param[in] RTOL2\n*> \\verbatim\n*> RTOL2 is DOUBLE PRECISION\n*> Parameters for bisection.\n*> An interval [LEFT,RIGHT] has converged if\n*> RIGHT-LEFT < MAX( RTOL1*GAP, RTOL2*MAX(|LEFT|,|RIGHT|) )\n*> \\endverbatim\n*>\n*> \\param[in,out] W\n*> \\verbatim\n*> W is DOUBLE PRECISION array, dimension (N)\n*> The first M elements of W contain the APPROXIMATE eigenvalues for\n*> which eigenvectors are to be computed. The eigenvalues\n*> should be grouped by split-off block and ordered from\n*> smallest to largest within the block ( The output array\n*> W from DLARRE is expected here ). Furthermore, they are with\n*> respect to the shift of the corresponding root representation\n*> for their block. On exit, W holds the eigenvalues of the\n*> UNshifted matrix.\n*> \\endverbatim\n*>\n*> \\param[in,out] WERR\n*> \\verbatim\n*> WERR is DOUBLE PRECISION array, dimension (N)\n*> The first M elements contain the semiwidth of the uncertainty\n*> interval of the corresponding eigenvalue in W\n*> \\endverbatim\n*>\n*> \\param[in,out] WGAP\n*> \\verbatim\n*> WGAP is DOUBLE PRECISION array, dimension (N)\n*> The separation from the right neighbor eigenvalue in W.\n*> \\endverbatim\n*>\n*> \\param[in] IBLOCK\n*> \\verbatim\n*> IBLOCK is INTEGER array, dimension (N)\n*> The indices of the blocks (submatrices) associated with the\n*> corresponding eigenvalues in W; IBLOCK(i)=1 if eigenvalue\n*> W(i) belongs to the first block from the top, =2 if W(i)\n*> belongs to the second block, etc.\n*> \\endverbatim\n*>\n*> \\param[in] INDEXW\n*> \\verbatim\n*> INDEXW is INTEGER array, dimension (N)\n*> The indices of the eigenvalues within each block (submatrix);\n*> for example, INDEXW(i)= 10 and IBLOCK(i)=2 imply that the\n*> i-th eigenvalue W(i) is the 10-th eigenvalue in the second block.\n*> \\endverbatim\n*>\n*> \\param[in] GERS\n*> \\verbatim\n*> GERS is DOUBLE PRECISION array, dimension (2*N)\n*> The N Gerschgorin intervals (the i-th Gerschgorin interval\n*> is (GERS(2*i-1), GERS(2*i)). The Gerschgorin intervals should\n*> be computed from the original UNshifted matrix.\n*> \\endverbatim\n*>\n*> \\param[out] Z\n*> \\verbatim\n*> Z is COMPLEX*16 array, dimension (LDZ, max(1,M) )\n*> If INFO = 0, the first M columns of Z contain the\n*> orthonormal eigenvectors of the matrix T\n*> corresponding to the input eigenvalues, with the i-th\n*> column of Z holding the eigenvector associated with W(i).\n*> Note: the user must ensure that at least max(1,M) columns are\n*> supplied in the array Z.\n*> \\endverbatim\n*>\n*> \\param[in] LDZ\n*> \\verbatim\n*> LDZ is INTEGER\n*> The leading dimension of the array Z. LDZ >= 1, and if\n*> JOBZ = 'V', LDZ >= max(1,N).\n*> \\endverbatim\n*>\n*> \\param[out] ISUPPZ\n*> \\verbatim\n*> ISUPPZ is INTEGER array, dimension ( 2*max(1,M) )\n*> The support of the eigenvectors in Z, i.e., the indices\n*> indicating the nonzero elements in Z. The I-th eigenvector\n*> is nonzero only in elements ISUPPZ( 2*I-1 ) through\n*> ISUPPZ( 2*I ).\n*> \\endverbatim\n*>\n*> \\param[out] WORK\n*> \\verbatim\n*> WORK is DOUBLE PRECISION array, dimension (12*N)\n*> \\endverbatim\n*>\n*> \\param[out] IWORK\n*> \\verbatim\n*> IWORK is INTEGER array, dimension (7*N)\n*> \\endverbatim\n*>\n*> \\param[out] INFO\n*> \\verbatim\n*> INFO is INTEGER\n*> = 0: successful exit\n*>\n*> > 0: A problem occurred in ZLARRV.\n*> < 0: One of the called subroutines signaled an internal problem.\n*> Needs inspection of the corresponding parameter IINFO\n*> for further information.\n*>\n*> =-1: Problem in DLARRB when refining a child's eigenvalues.\n*> =-2: Problem in DLARRF when computing the RRR of a child.\n*> When a child is inside a tight cluster, it can be difficult\n*> to find an RRR. A partial remedy from the user's point of\n*> view is to make the parameter MINRGP smaller and recompile.\n*> However, as the orthogonality of the computed vectors is\n*> proportional to 1/MINRGP, the user should be aware that\n*> he might be trading in precision when he decreases MINRGP.\n*> =-3: Problem in DLARRB when refining a single eigenvalue\n*> after the Rayleigh correction was rejected.\n*> = 5: The Rayleigh Quotient Iteration failed to converge to\n*> full accuracy in MAXITR steps.\n*> \\endverbatim\n*\n* Authors:\n* ========\n*\n*> \\author Univ. of Tennessee\n*> \\author Univ. of California Berkeley\n*> \\author Univ. of Colorado Denver\n*> \\author NAG Ltd.\n*\n*> \\ingroup complex16OTHERauxiliary\n*\n*> \\par Contributors:\n* ==================\n*>\n*> Beresford Parlett, University of California, Berkeley, USA \\n\n*> Jim Demmel, University of California, Berkeley, USA \\n\n*> Inderjit Dhillon, University of Texas, Austin, USA \\n\n*> Osni Marques, LBNL/NERSC, USA \\n\n*> Christof Voemel, University of California, Berkeley, USA\n*\n* =====================================================================\n SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\n $ ISPLIT, M, DOL, DOU, MINRGP,\n $ RTOL1, RTOL2, W, WERR, WGAP,\n $ IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\n $ WORK, IWORK, INFO )\n*\n* -- LAPACK auxiliary routine --\n* -- LAPACK is a software package provided by Univ. of Tennessee, --\n* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--\n*\n* .. Scalar Arguments ..\n INTEGER DOL, DOU, INFO, LDZ, M, N\n DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\n* ..\n* .. Array Arguments ..\n INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\n $ ISUPPZ( * ), IWORK( * )\n DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\n $ WGAP( * ), WORK( * )\n COMPLEX*16 Z( LDZ, * )\n* ..\n*\n* =====================================================================\n*\n* .. Parameters ..\n INTEGER MAXITR\n PARAMETER ( MAXITR = 10 )\n COMPLEX*16 CZERO\n PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ) )\n DOUBLE PRECISION ZERO, ONE, TWO, THREE, FOUR, HALF\n PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0,\n $ TWO = 2.0D0, THREE = 3.0D0,\n $ FOUR = 4.0D0, HALF = 0.5D0)\n* ..\n* .. Local Scalars ..\n LOGICAL ESKIP, NEEDBS, STP2II, TRYRQC, USEDBS, USEDRQ\n INTEGER DONE, I, IBEGIN, IDONE, IEND, II, IINDC1,\n $ IINDC2, IINDR, IINDWK, IINFO, IM, IN, INDEIG,\n $ INDLD, INDLLD, INDWRK, ISUPMN, ISUPMX, ITER,\n $ ITMP1, J, JBLK, K, MINIWSIZE, MINWSIZE, NCLUS,\n $ NDEPTH, NEGCNT, NEWCLS, NEWFST, NEWFTT, NEWLST,\n $ NEWSIZ, OFFSET, OLDCLS, OLDFST, OLDIEN, OLDLST,\n $ OLDNCL, P, PARITY, Q, WBEGIN, WEND, WINDEX,\n $ WINDMN, WINDPL, ZFROM, ZTO, ZUSEDL, ZUSEDU,\n $ ZUSEDW\n INTEGER INDIN1, INDIN2\n DOUBLE PRECISION BSTRES, BSTW, EPS, FUDGE, GAP, GAPTOL, GL, GU,\n $ LAMBDA, LEFT, LGAP, MINGMA, NRMINV, RESID,\n $ RGAP, RIGHT, RQCORR, RQTOL, SAVGAP, SGNDEF,\n $ SIGMA, SPDIAM, SSIGMA, TAU, TMP, TOL, ZTZ\n* ..\n* .. External Functions ..\n DOUBLE PRECISION DLAMCH\n EXTERNAL DLAMCH\n* ..\n* .. External Subroutines ..\n EXTERNAL DCOPY, DLARRB, DLARRF, ZDSCAL, ZLAR1V,\n $ ZLASET\n* ..\n* .. Intrinsic Functions ..\n INTRINSIC ABS, DBLE, MAX, MIN\n INTRINSIC DCMPLX\n* ..\n* .. Executable Statements ..\n* .."," INFO = 0\n*\n* Quick return if possible\n*"," IF( (N.LE.0).OR.(M.LE.0) ) THEN"," RETURN\n END IF\n*\n* The first N entries of WORK are reserved for the eigenvalues\n INDLD = N+1\n INDLLD= 2*N+1\n INDIN1 = 3*N + 1\n INDIN2 = 4*N + 1\n INDWRK = 5*N + 1\n MINWSIZE = 12 * N"," DO 5 I= 1,MINWSIZE\n WORK( I ) = ZERO\n 5 CONTINUE","* IWORK(IINDR+1:IINDR+N) hold the twist indices R for the\n* factorization used to compute the FP vector\n IINDR = 0\n* IWORK(IINDC1+1:IINC2+N) are used to store the clusters of the current\n* layer and the one above.\n IINDC1 = N\n IINDC2 = 2*N\n IINDWK = 3*N + 1"," MINIWSIZE = 7 * N\n DO 10 I= 1,MINIWSIZE\n IWORK( I ) = 0\n 10 CONTINUE"," ZUSEDL = 1\n IF(DOL.GT.1) THEN\n* Set lower bound for use of Z\n ZUSEDL = DOL-1\n ENDIF\n ZUSEDU = M\n IF(DOU.LT.M) THEN\n* Set lower bound for use of Z\n ZUSEDU = DOU+1\n ENDIF\n* The width of the part of Z that is used\n ZUSEDW = ZUSEDU - ZUSEDL + 1","\n CALL ZLASET( 'Full', N, ZUSEDW, CZERO, CZERO,\n $ Z(1,ZUSEDL), LDZ )"," EPS = DLAMCH( 'Precision' )\n RQTOL = TWO * EPS\n*\n* Set expert flags for standard code.\n TRYRQC = .TRUE."," IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\n ELSE\n* Only selected eigenpairs are computed. Since the other evalues\n* are not refined by RQ iteration, bisection has to compute to full\n* accuracy.\n RTOL1 = FOUR * EPS\n RTOL2 = FOUR * EPS\n ENDIF","* The entries WBEGIN:WEND in W, WERR, WGAP correspond to the\n* desired eigenvalues. The support of the nonzero eigenvector\n* entries is contained in the interval IBEGIN:IEND.\n* Remark that if k eigenpairs are desired, then the eigenvectors\n* are stored in k contiguous columns of Z.","* DONE is the number of eigenvectors already computed\n DONE = 0\n IBEGIN = 1\n WBEGIN = 1\n DO 170 JBLK = 1, IBLOCK( M )\n IEND = ISPLIT( JBLK )\n SIGMA = L( IEND )\n* Find the eigenvectors of the submatrix indexed IBEGIN\n* through IEND.\n WEND = WBEGIN - 1\n 15 CONTINUE\n IF( WEND.LT.M ) THEN\n IF( IBLOCK( WEND+1 ).EQ.JBLK ) THEN\n WEND = WEND + 1\n GO TO 15\n END IF\n END IF\n IF( WEND.LT.WBEGIN ) THEN\n IBEGIN = IEND + 1\n GO TO 170\n ELSEIF( (WEND.LT.DOL).OR.(WBEGIN.GT.DOU) ) THEN\n IBEGIN = IEND + 1\n WBEGIN = WEND + 1\n GO TO 170\n END IF","* Find local spectral diameter of the block\n GL = GERS( 2*IBEGIN-1 )\n GU = GERS( 2*IBEGIN )\n DO 20 I = IBEGIN+1 , IEND\n GL = MIN( GERS( 2*I-1 ), GL )\n GU = MAX( GERS( 2*I ), GU )\n 20 CONTINUE\n SPDIAM = GU - GL","* OLDIEN is the last index of the previous block\n OLDIEN = IBEGIN - 1\n* Calculate the size of the current block\n IN = IEND - IBEGIN + 1\n* The number of eigenvalues in the current block\n IM = WEND - WBEGIN + 1","* This is for a 1x1 block\n IF( IBEGIN.EQ.IEND ) THEN\n DONE = DONE+1\n Z( IBEGIN, WBEGIN ) = DCMPLX( ONE, ZERO )\n ISUPPZ( 2*WBEGIN-1 ) = IBEGIN\n ISUPPZ( 2*WBEGIN ) = IBEGIN\n W( WBEGIN ) = W( WBEGIN ) + SIGMA\n WORK( WBEGIN ) = W( WBEGIN )\n IBEGIN = IEND + 1\n WBEGIN = WBEGIN + 1\n GO TO 170\n END IF","* The desired (shifted) eigenvalues are stored in W(WBEGIN:WEND)\n* Note that these can be approximations, in this case, the corresp.\n* entries of WERR give the size of the uncertainty interval.\n* The eigenvalue approximations will be refined when necessary as\n* high relative accuracy is required for the computation of the\n* corresponding eigenvectors.\n CALL DCOPY( IM, W( WBEGIN ), 1,\n $ WORK( WBEGIN ), 1 )","* We store in W the eigenvalue approximations w.r.t. the original\n* matrix T.\n DO 30 I=1,IM\n W(WBEGIN+I-1) = W(WBEGIN+I-1)+SIGMA\n 30 CONTINUE","\n* NDEPTH is the current depth of the representation tree\n NDEPTH = 0\n* PARITY is either 1 or 0\n PARITY = 1\n* NCLUS is the number of clusters for the next level of the\n* representation tree, we start with NCLUS = 1 for the root\n NCLUS = 1\n IWORK( IINDC1+1 ) = 1\n IWORK( IINDC1+2 ) = IM","* IDONE is the number of eigenvectors already computed in the current\n* block\n IDONE = 0\n* loop while( IDONE.LT.IM )\n* generate the representation tree for the current block and\n* compute the eigenvectors\n 40 CONTINUE\n IF( IDONE.LT.IM ) THEN\n* This is a crude protection against infinitely deep trees\n IF( NDEPTH.GT.M ) THEN\n INFO = -2\n RETURN\n ENDIF\n* breadth first processing of the current level of the representation\n* tree: OLDNCL = number of clusters on current level\n OLDNCL = NCLUS\n* reset NCLUS to count the number of child clusters\n NCLUS = 0\n*\n PARITY = 1 - PARITY\n IF( PARITY.EQ.0 ) THEN\n OLDCLS = IINDC1\n NEWCLS = IINDC2\n ELSE\n OLDCLS = IINDC2\n NEWCLS = IINDC1\n END IF\n* Process the clusters on the current level\n DO 150 I = 1, OLDNCL\n J = OLDCLS + 2*I\n* OLDFST, OLDLST = first, last index of current cluster.\n* cluster indices start with 1 and are relative\n* to WBEGIN when accessing W, WGAP, WERR, Z\n OLDFST = IWORK( J-1 )\n OLDLST = IWORK( J )\n IF( NDEPTH.GT.0 ) THEN\n* Retrieve relatively robust representation (RRR) of cluster\n* that has been computed at the previous level\n* The RRR is stored in Z and overwritten once the eigenvectors\n* have been computed or when the cluster is refined"," IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\n* Get representation from location of the leftmost evalue\n* of the cluster\n J = WBEGIN + OLDFST - 1\n ELSE\n IF(WBEGIN+OLDFST-1.LT.DOL) THEN\n* Get representation from the left end of Z array\n J = DOL - 1\n ELSEIF(WBEGIN+OLDFST-1.GT.DOU) THEN\n* Get representation from the right end of Z array\n J = DOU\n ELSE\n J = WBEGIN + OLDFST - 1\n ENDIF\n ENDIF\n DO 45 K = 1, IN - 1\n D( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\n $ J ) )\n L( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\n $ J+1 ) )\n 45 CONTINUE\n D( IEND ) = DBLE( Z( IEND, J ) )\n SIGMA = DBLE( Z( IEND, J+1 ) )","* Set the corresponding entries in Z to zero\n CALL ZLASET( 'Full', IN, 2, CZERO, CZERO,\n $ Z( IBEGIN, J), LDZ )\n END IF","* Compute DL and DLL of current RRR\n DO 50 J = IBEGIN, IEND-1\n TMP = D( J )*L( J )\n WORK( INDLD-1+J ) = TMP\n WORK( INDLLD-1+J ) = TMP*L( J )\n 50 CONTINUE"," IF( NDEPTH.GT.0 ) THEN\n* P and Q are index of the first and last eigenvalue to compute\n* within the current block\n P = INDEXW( WBEGIN-1+OLDFST )\n Q = INDEXW( WBEGIN-1+OLDLST )\n* Offset for the arrays WORK, WGAP and WERR, i.e., the P-OFFSET\n* through the Q-OFFSET elements of these arrays are to be used.\n* OFFSET = P-OLDFST\n OFFSET = INDEXW( WBEGIN ) - 1\n* perform limited bisection (if necessary) to get approximate\n* eigenvalues to the precision needed.\n CALL DLARRB( IN, D( IBEGIN ),\n $ WORK(INDLLD+IBEGIN-1),\n $ P, Q, RTOL1, RTOL2, OFFSET,\n $ WORK(WBEGIN),WGAP(WBEGIN),WERR(WBEGIN),\n $ WORK( INDWRK ), IWORK( IINDWK ),\n $ PIVMIN, SPDIAM, IN, IINFO )\n IF( IINFO.NE.0 ) THEN\n INFO = -1\n RETURN\n ENDIF\n* We also recompute the extremal gaps. W holds all eigenvalues\n* of the unshifted matrix and must be used for computation\n* of WGAP, the entries of WORK might stem from RRRs with\n* different shifts. The gaps from WBEGIN-1+OLDFST to\n* WBEGIN-1+OLDLST are correctly computed in DLARRB.\n* However, we only allow the gaps to become greater since\n* this is what should happen when we decrease WERR\n IF( OLDFST.GT.1) THEN\n WGAP( WBEGIN+OLDFST-2 ) =\n $ MAX(WGAP(WBEGIN+OLDFST-2),\n $ W(WBEGIN+OLDFST-1)-WERR(WBEGIN+OLDFST-1)\n $ - W(WBEGIN+OLDFST-2)-WERR(WBEGIN+OLDFST-2) )\n ENDIF\n IF( WBEGIN + OLDLST -1 .LT. WEND ) THEN\n WGAP( WBEGIN+OLDLST-1 ) =\n $ MAX(WGAP(WBEGIN+OLDLST-1),\n $ W(WBEGIN+OLDLST)-WERR(WBEGIN+OLDLST)\n $ - W(WBEGIN+OLDLST-1)-WERR(WBEGIN+OLDLST-1) )\n ENDIF\n* Each time the eigenvalues in WORK get refined, we store\n* the newly found approximation with all shifts applied in W\n DO 53 J=OLDFST,OLDLST\n W(WBEGIN+J-1) = WORK(WBEGIN+J-1)+SIGMA\n 53 CONTINUE\n END IF","* Process the current node.\n NEWFST = OLDFST\n DO 140 J = OLDFST, OLDLST\n IF( J.EQ.OLDLST ) THEN\n* we are at the right end of the cluster, this is also the\n* boundary of the child cluster\n NEWLST = J\n ELSE IF ( WGAP( WBEGIN + J -1).GE.\n $ MINRGP* ABS( WORK(WBEGIN + J -1) ) ) THEN\n* the right relative gap is big enough, the child cluster\n* (NEWFST,..,NEWLST) is well separated from the following\n NEWLST = J\n ELSE\n* inside a child cluster, the relative gap is not\n* big enough.\n GOTO 140\n END IF","* Compute size of child cluster found\n NEWSIZ = NEWLST - NEWFST + 1","* NEWFTT is the place in Z where the new RRR or the computed\n* eigenvector is to be stored\n IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\n* Store representation at location of the leftmost evalue\n* of the cluster\n NEWFTT = WBEGIN + NEWFST - 1\n ELSE\n IF(WBEGIN+NEWFST-1.LT.DOL) THEN\n* Store representation at the left end of Z array\n NEWFTT = DOL - 1\n ELSEIF(WBEGIN+NEWFST-1.GT.DOU) THEN\n* Store representation at the right end of Z array\n NEWFTT = DOU\n ELSE\n NEWFTT = WBEGIN + NEWFST - 1\n ENDIF\n ENDIF"," IF( NEWSIZ.GT.1) THEN\n*\n* Current child is not a singleton but a cluster.\n* Compute and store new representation of child.\n*\n*\n* Compute left and right cluster gap.\n*\n* LGAP and RGAP are not computed from WORK because\n* the eigenvalue approximations may stem from RRRs\n* different shifts. However, W hold all eigenvalues\n* of the unshifted matrix. Still, the entries in WGAP\n* have to be computed from WORK since the entries\n* in W might be of the same order so that gaps are not\n* exhibited correctly for very close eigenvalues.\n IF( NEWFST.EQ.1 ) THEN\n LGAP = MAX( ZERO,\n $ W(WBEGIN)-WERR(WBEGIN) - VL )\n ELSE\n LGAP = WGAP( WBEGIN+NEWFST-2 )\n ENDIF\n RGAP = WGAP( WBEGIN+NEWLST-1 )\n*\n* Compute left- and rightmost eigenvalue of child\n* to high precision in order to shift as close\n* as possible and obtain as large relative gaps\n* as possible\n*\n DO 55 K =1,2\n IF(K.EQ.1) THEN\n P = INDEXW( WBEGIN-1+NEWFST )\n ELSE\n P = INDEXW( WBEGIN-1+NEWLST )\n ENDIF\n OFFSET = INDEXW( WBEGIN ) - 1\n CALL DLARRB( IN, D(IBEGIN),\n $ WORK( INDLLD+IBEGIN-1 ),P,P,\n $ RQTOL, RQTOL, OFFSET,\n $ WORK(WBEGIN),WGAP(WBEGIN),\n $ WERR(WBEGIN),WORK( INDWRK ),\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\n $ IN, IINFO )\n 55 CONTINUE\n*\n IF((WBEGIN+NEWLST-1.LT.DOL).OR.\n $ (WBEGIN+NEWFST-1.GT.DOU)) THEN\n* if the cluster contains no desired eigenvalues\n* skip the computation of that branch of the rep. tree\n*\n* We could skip before the refinement of the extremal\n* eigenvalues of the child, but then the representation\n* tree could be different from the one when nothing is\n* skipped. For this reason we skip at this place.\n IDONE = IDONE + NEWLST - NEWFST + 1\n GOTO 139\n ENDIF\n*\n* Compute RRR of child cluster.\n* Note that the new RRR is stored in Z\n*\n* DLARRF needs LWORK = 2*N\n CALL DLARRF( IN, D( IBEGIN ), L( IBEGIN ),\n $ WORK(INDLD+IBEGIN-1),\n $ NEWFST, NEWLST, WORK(WBEGIN),\n $ WGAP(WBEGIN), WERR(WBEGIN),\n $ SPDIAM, LGAP, RGAP, PIVMIN, TAU,\n $ WORK( INDIN1 ), WORK( INDIN2 ),\n $ WORK( INDWRK ), IINFO )\n* In the complex case, DLARRF cannot write\n* the new RRR directly into Z and needs an intermediate\n* workspace\n DO 56 K = 1, IN-1\n Z( IBEGIN+K-1, NEWFTT ) =\n $ DCMPLX( WORK( INDIN1+K-1 ), ZERO )\n Z( IBEGIN+K-1, NEWFTT+1 ) =\n $ DCMPLX( WORK( INDIN2+K-1 ), ZERO )\n 56 CONTINUE\n Z( IEND, NEWFTT ) =\n $ DCMPLX( WORK( INDIN1+IN-1 ), ZERO )\n IF( IINFO.EQ.0 ) THEN\n* a new RRR for the cluster was found by DLARRF\n* update shift and store it\n SSIGMA = SIGMA + TAU\n Z( IEND, NEWFTT+1 ) = DCMPLX( SSIGMA, ZERO )\n* WORK() are the midpoints and WERR() the semi-width\n* Note that the entries in W are unchanged.\n DO 116 K = NEWFST, NEWLST\n FUDGE =\n $ THREE*EPS*ABS(WORK(WBEGIN+K-1))\n WORK( WBEGIN + K - 1 ) =\n $ WORK( WBEGIN + K - 1) - TAU\n FUDGE = FUDGE +\n $ FOUR*EPS*ABS(WORK(WBEGIN+K-1))\n* Fudge errors\n WERR( WBEGIN + K - 1 ) =\n $ WERR( WBEGIN + K - 1 ) + FUDGE\n* Gaps are not fudged. Provided that WERR is small\n* when eigenvalues are close, a zero gap indicates\n* that a new representation is needed for resolving\n* the cluster. A fudge could lead to a wrong decision\n* of judging eigenvalues 'separated' which in\n* reality are not. This could have a negative impact\n* on the orthogonality of the computed eigenvectors.\n 116 CONTINUE"," NCLUS = NCLUS + 1\n K = NEWCLS + 2*NCLUS\n IWORK( K-1 ) = NEWFST\n IWORK( K ) = NEWLST\n ELSE\n INFO = -2\n RETURN\n ENDIF\n ELSE\n*\n* Compute eigenvector of singleton\n*\n ITER = 0\n*\n TOL = FOUR * LOG(DBLE(IN)) * EPS\n*\n K = NEWFST\n WINDEX = WBEGIN + K - 1\n WINDMN = MAX(WINDEX - 1,1)\n WINDPL = MIN(WINDEX + 1,M)\n LAMBDA = WORK( WINDEX )\n DONE = DONE + 1\n* Check if eigenvector computation is to be skipped\n IF((WINDEX.LT.DOL).OR.\n $ (WINDEX.GT.DOU)) THEN\n ESKIP = .TRUE.\n GOTO 125\n ELSE\n ESKIP = .FALSE.\n ENDIF\n LEFT = WORK( WINDEX ) - WERR( WINDEX )\n RIGHT = WORK( WINDEX ) + WERR( WINDEX )\n INDEIG = INDEXW( WINDEX )\n* Note that since we compute the eigenpairs for a child,\n* all eigenvalue approximations are w.r.t the same shift.\n* In this case, the entries in WORK should be used for\n* computing the gaps since they exhibit even very small\n* differences in the eigenvalues, as opposed to the\n* entries in W which might \"look\" the same."," IF( K .EQ. 1) THEN\n* In the case RANGE='I' and with not much initial\n* accuracy in LAMBDA and VL, the formula\n* LGAP = MAX( ZERO, (SIGMA - VL) + LAMBDA )\n* can lead to an overestimation of the left gap and\n* thus to inadequately early RQI 'convergence'.\n* Prevent this by forcing a small left gap.\n LGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\n ELSE\n LGAP = WGAP(WINDMN)\n ENDIF\n IF( K .EQ. IM) THEN\n* In the case RANGE='I' and with not much initial\n* accuracy in LAMBDA and VU, the formula\n* can lead to an overestimation of the right gap and\n* thus to inadequately early RQI 'convergence'.\n* Prevent this by forcing a small right gap.\n RGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\n ELSE\n RGAP = WGAP(WINDEX)\n ENDIF\n GAP = MIN( LGAP, RGAP )\n IF(( K .EQ. 1).OR.(K .EQ. IM)) THEN\n* The eigenvector support can become wrong\n* because significant entries could be cut off due to a\n* large GAPTOL parameter in LAR1V. Prevent this.\n GAPTOL = ZERO\n ELSE\n GAPTOL = GAP * EPS\n ENDIF\n ISUPMN = IN\n ISUPMX = 1\n* Update WGAP so that it holds the minimum gap\n* to the left or the right. This is crucial in the\n* case where bisection is used to ensure that the\n* eigenvalue is refined up to the required precision.\n* The correct value is restored afterwards.\n SAVGAP = WGAP(WINDEX)\n WGAP(WINDEX) = GAP\n* We want to use the Rayleigh Quotient Correction\n* as often as possible since it converges quadratically\n* when we are close enough to the desired eigenvalue.\n* However, the Rayleigh Quotient can have the wrong sign\n* and lead us away from the desired eigenvalue. In this\n* case, the best we can do is to use bisection.\n USEDBS = .FALSE.\n USEDRQ = .FALSE.\n* Bisection is initially turned off unless it is forced\n NEEDBS = .NOT.TRYRQC\n 120 CONTINUE\n* Check if bisection should be used to refine eigenvalue\n IF(NEEDBS) THEN\n* Take the bisection as new iterate\n USEDBS = .TRUE.\n ITMP1 = IWORK( IINDR+WINDEX )\n OFFSET = INDEXW( WBEGIN ) - 1\n CALL DLARRB( IN, D(IBEGIN),\n $ WORK(INDLLD+IBEGIN-1),INDEIG,INDEIG,\n $ ZERO, TWO*EPS, OFFSET,\n $ WORK(WBEGIN),WGAP(WBEGIN),\n $ WERR(WBEGIN),WORK( INDWRK ),\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\n $ ITMP1, IINFO )\n IF( IINFO.NE.0 ) THEN\n INFO = -3\n RETURN\n ENDIF\n LAMBDA = WORK( WINDEX )\n* Reset twist index from inaccurate LAMBDA to\n* force computation of true MINGMA\n IWORK( IINDR+WINDEX ) = 0\n ENDIF\n* Given LAMBDA, compute the eigenvector.\n CALL ZLAR1V( IN, 1, IN, LAMBDA, D( IBEGIN ),\n $ L( IBEGIN ), WORK(INDLD+IBEGIN-1),\n $ WORK(INDLLD+IBEGIN-1),\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\n $ IWORK( IINDR+WINDEX ), ISUPPZ( 2*WINDEX-1 ),\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\n IF(ITER .EQ. 0) THEN\n BSTRES = RESID\n BSTW = LAMBDA\n ELSEIF(RESID.LT.BSTRES) THEN\n BSTRES = RESID\n BSTW = LAMBDA\n ENDIF\n ISUPMN = MIN(ISUPMN,ISUPPZ( 2*WINDEX-1 ))\n ISUPMX = MAX(ISUPMX,ISUPPZ( 2*WINDEX ))\n ITER = ITER + 1","* sin alpha <= |resid|/gap\n* Note that both the residual and the gap are\n* proportional to the matrix, so ||T|| doesn't play\n* a role in the quotient","*\n* Convergence test for Rayleigh-Quotient iteration\n* (omitted when Bisection has been used)\n*\n IF( RESID.GT.TOL*GAP .AND. ABS( RQCORR ).GT.\n $ RQTOL*ABS( LAMBDA ) .AND. .NOT. USEDBS)\n $ THEN\n* We need to check that the RQCORR update doesn't\n* move the eigenvalue away from the desired one and\n* towards a neighbor. -> protection with bisection\n IF(INDEIG.LE.NEGCNT) THEN\n* The wanted eigenvalue lies to the left\n SGNDEF = -ONE\n ELSE\n* The wanted eigenvalue lies to the right\n SGNDEF = ONE\n ENDIF\n* We only use the RQCORR if it improves the\n* the iterate reasonably.\n IF( ( RQCORR*SGNDEF.GE.ZERO )\n $ .AND.( LAMBDA + RQCORR.LE. RIGHT)\n $ .AND.( LAMBDA + RQCORR.GE. LEFT)\n $ ) THEN\n USEDRQ = .TRUE.\n* Store new midpoint of bisection interval in WORK\n IF(SGNDEF.EQ.ONE) THEN\n* The current LAMBDA is on the left of the true\n* eigenvalue\n LEFT = LAMBDA\n* We prefer to assume that the error estimate\n* is correct. We could make the interval not\n* as a bracket but to be modified if the RQCORR\n* chooses to. In this case, the RIGHT side should\n* be modified as follows:\n* RIGHT = MAX(RIGHT, LAMBDA + RQCORR)\n ELSE\n* The current LAMBDA is on the right of the true\n* eigenvalue\n RIGHT = LAMBDA\n* See comment about assuming the error estimate is\n* correct above.\n* LEFT = MIN(LEFT, LAMBDA + RQCORR)\n ENDIF\n WORK( WINDEX ) =\n $ HALF * (RIGHT + LEFT)\n* Take RQCORR since it has the correct sign and\n* improves the iterate reasonably\n LAMBDA = LAMBDA + RQCORR\n* Update width of error interval\n WERR( WINDEX ) =\n $ HALF * (RIGHT-LEFT)\n ELSE\n NEEDBS = .TRUE.\n ENDIF\n IF(RIGHT-LEFT.LT.RQTOL*ABS(LAMBDA)) THEN\n* The eigenvalue is computed to bisection accuracy\n* compute eigenvector and stop\n USEDBS = .TRUE.\n GOTO 120\n ELSEIF( ITER.LT.MAXITR ) THEN\n GOTO 120\n ELSEIF( ITER.EQ.MAXITR ) THEN\n NEEDBS = .TRUE.\n GOTO 120\n ELSE\n INFO = 5\n RETURN\n END IF\n ELSE\n STP2II = .FALSE.\n IF(USEDRQ .AND. USEDBS .AND.\n $ BSTRES.LE.RESID) THEN\n LAMBDA = BSTW\n STP2II = .TRUE.\n ENDIF\n IF (STP2II) THEN\n* improve error angle by second step\n CALL ZLAR1V( IN, 1, IN, LAMBDA,\n $ D( IBEGIN ), L( IBEGIN ),\n $ WORK(INDLD+IBEGIN-1),\n $ WORK(INDLLD+IBEGIN-1),\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\n $ IWORK( IINDR+WINDEX ),\n $ ISUPPZ( 2*WINDEX-1 ),\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\n ENDIF\n WORK( WINDEX ) = LAMBDA\n END IF\n*\n* Compute FP-vector support w.r.t. whole matrix\n*\n ISUPPZ( 2*WINDEX-1 ) = ISUPPZ( 2*WINDEX-1 )+OLDIEN\n ISUPPZ( 2*WINDEX ) = ISUPPZ( 2*WINDEX )+OLDIEN\n ZFROM = ISUPPZ( 2*WINDEX-1 )\n ZTO = ISUPPZ( 2*WINDEX )\n ISUPMN = ISUPMN + OLDIEN\n ISUPMX = ISUPMX + OLDIEN\n* Ensure vector is ok if support in the RQI has changed\n IF(ISUPMN.LT.ZFROM) THEN\n DO 122 II = ISUPMN,ZFROM-1\n Z( II, WINDEX ) = ZERO\n 122 CONTINUE\n ENDIF\n IF(ISUPMX.GT.ZTO) THEN\n DO 123 II = ZTO+1,ISUPMX\n Z( II, WINDEX ) = ZERO\n 123 CONTINUE\n ENDIF\n CALL ZDSCAL( ZTO-ZFROM+1, NRMINV,\n $ Z( ZFROM, WINDEX ), 1 )\n 125 CONTINUE\n* Update W\n W( WINDEX ) = LAMBDA+SIGMA\n* Recompute the gaps on the left and right\n* But only allow them to become larger and not\n* smaller (which can only happen through \"bad\"\n* cancellation and doesn't reflect the theory\n* where the initial gaps are underestimated due\n* to WERR being too crude.)\n IF(.NOT.ESKIP) THEN\n IF( K.GT.1) THEN\n WGAP( WINDMN ) = MAX( WGAP(WINDMN),\n $ W(WINDEX)-WERR(WINDEX)\n $ - W(WINDMN)-WERR(WINDMN) )\n ENDIF\n IF( WINDEX.LT.WEND ) THEN\n WGAP( WINDEX ) = MAX( SAVGAP,\n $ W( WINDPL )-WERR( WINDPL )\n $ - W( WINDEX )-WERR( WINDEX) )\n ENDIF\n ENDIF\n IDONE = IDONE + 1\n ENDIF\n* here ends the code for the current child\n*\n 139 CONTINUE\n* Proceed to any remaining child nodes\n NEWFST = J + 1\n 140 CONTINUE\n 150 CONTINUE\n NDEPTH = NDEPTH + 1\n GO TO 40\n END IF\n IBEGIN = IEND + 1\n WBEGIN = WEND + 1\n 170 CONTINUE\n*"," RETURN\n*\n* End of ZLARRV\n*\n END"],"string":"[\n \"*> \\\\brief \\\\b ZLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\\n*\\n* =========== DOCUMENTATION ===========\\n*\\n* Online html documentation available at\\n* http://www.netlib.org/lapack/explore-html/\\n*\\n*> \\\\htmlonly\\n*> Download ZLARRV + dependencies\\n*> <a href=\\\"http://www.netlib.org/cgi-bin/netlibfiles.tgz?format=tgz&filename=/lapack/lapack_routine/zlarrv.f\\\">\\n*> [TGZ]</a>\\n*> <a href=\\\"http://www.netlib.org/cgi-bin/netlibfiles.zip?format=zip&filename=/lapack/lapack_routine/zlarrv.f\\\">\\n*> [ZIP]</a>\\n*> <a href=\\\"http://www.netlib.org/cgi-bin/netlibfiles.txt?format=txt&filename=/lapack/lapack_routine/zlarrv.f\\\">\\n*> [TXT]</a>\\n*> \\\\endhtmlonly\\n*\\n* Definition:\\n* ===========\\n*\\n* SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\\n* ISPLIT, M, DOL, DOU, MINRGP,\\n* RTOL1, RTOL2, W, WERR, WGAP,\\n* IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\\n* WORK, IWORK, INFO )\\n*\\n* .. Scalar Arguments ..\\n* INTEGER DOL, DOU, INFO, LDZ, M, N\\n* DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\\n* ..\\n* .. Array Arguments ..\\n* INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\\n* $ ISUPPZ( * ), IWORK( * )\\n* DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\\n* $ WGAP( * ), WORK( * )\\n* COMPLEX*16 Z( LDZ, * )\\n* ..\\n*\\n*\\n*> \\\\par Purpose:\\n* =============\\n*>\\n*> \\\\verbatim\\n*>\\n*> ZLARRV computes the eigenvectors of the tridiagonal matrix\\n*> T = L D L**T given L, D and APPROXIMATIONS to the eigenvalues of L D L**T.\\n*> The input eigenvalues should have been computed by DLARRE.\\n*> \\\\endverbatim\\n*\\n* Arguments:\\n* ==========\\n*\\n*> \\\\param[in] N\\n*> \\\\verbatim\\n*> N is INTEGER\\n*> The order of the matrix. N >= 0.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] VL\\n*> \\\\verbatim\\n*> VL is DOUBLE PRECISION\\n*> Lower bound of the interval that contains the desired\\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\\n*> end of the extremal eigenvalues in the desired RANGE.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] VU\\n*> \\\\verbatim\\n*> VU is DOUBLE PRECISION\\n*> Upper bound of the interval that contains the desired\\n*> eigenvalues. VL < VU. Needed to compute gaps on the left or right\\n*> end of the extremal eigenvalues in the desired RANGE.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] D\\n*> \\\\verbatim\\n*> D is DOUBLE PRECISION array, dimension (N)\\n*> On entry, the N diagonal elements of the diagonal matrix D.\\n*> On exit, D may be overwritten.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] L\\n*> \\\\verbatim\\n*> L is DOUBLE PRECISION array, dimension (N)\\n*> On entry, the (N-1) subdiagonal elements of the unit\\n*> bidiagonal matrix L are in elements 1 to N-1 of L\\n*> (if the matrix is not split.) At the end of each block\\n*> is stored the corresponding shift as given by DLARRE.\\n*> On exit, L is overwritten.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] PIVMIN\\n*> \\\\verbatim\\n*> PIVMIN is DOUBLE PRECISION\\n*> The minimum pivot allowed in the Sturm sequence.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] ISPLIT\\n*> \\\\verbatim\\n*> ISPLIT is INTEGER array, dimension (N)\\n*> The splitting points, at which T breaks up into blocks.\\n*> The first block consists of rows/columns 1 to\\n*> ISPLIT( 1 ), the second of rows/columns ISPLIT( 1 )+1\\n*> through ISPLIT( 2 ), etc.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] M\\n*> \\\\verbatim\\n*> M is INTEGER\\n*> The total number of input eigenvalues. 0 <= M <= N.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] DOL\\n*> \\\\verbatim\\n*> DOL is INTEGER\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] DOU\\n*> \\\\verbatim\\n*> DOU is INTEGER\\n*> If the user wants to compute only selected eigenvectors from all\\n*> the eigenvalues supplied, he can specify an index range DOL:DOU.\\n*> Or else the setting DOL=1, DOU=M should be applied.\\n*> Note that DOL and DOU refer to the order in which the eigenvalues\\n*> are stored in W.\\n*> If the user wants to compute only selected eigenpairs, then\\n*> the columns DOL-1 to DOU+1 of the eigenvector space Z contain the\\n*> computed eigenvectors. All other columns of Z are set to zero.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] MINRGP\\n*> \\\\verbatim\\n*> MINRGP is DOUBLE PRECISION\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] RTOL1\\n*> \\\\verbatim\\n*> RTOL1 is DOUBLE PRECISION\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] RTOL2\\n*> \\\\verbatim\\n*> RTOL2 is DOUBLE PRECISION\\n*> Parameters for bisection.\\n*> An interval [LEFT,RIGHT] has converged if\\n*> RIGHT-LEFT < MAX( RTOL1*GAP, RTOL2*MAX(|LEFT|,|RIGHT|) )\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] W\\n*> \\\\verbatim\\n*> W is DOUBLE PRECISION array, dimension (N)\\n*> The first M elements of W contain the APPROXIMATE eigenvalues for\\n*> which eigenvectors are to be computed. The eigenvalues\\n*> should be grouped by split-off block and ordered from\\n*> smallest to largest within the block ( The output array\\n*> W from DLARRE is expected here ). Furthermore, they are with\\n*> respect to the shift of the corresponding root representation\\n*> for their block. On exit, W holds the eigenvalues of the\\n*> UNshifted matrix.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] WERR\\n*> \\\\verbatim\\n*> WERR is DOUBLE PRECISION array, dimension (N)\\n*> The first M elements contain the semiwidth of the uncertainty\\n*> interval of the corresponding eigenvalue in W\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in,out] WGAP\\n*> \\\\verbatim\\n*> WGAP is DOUBLE PRECISION array, dimension (N)\\n*> The separation from the right neighbor eigenvalue in W.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] IBLOCK\\n*> \\\\verbatim\\n*> IBLOCK is INTEGER array, dimension (N)\\n*> The indices of the blocks (submatrices) associated with the\\n*> corresponding eigenvalues in W; IBLOCK(i)=1 if eigenvalue\\n*> W(i) belongs to the first block from the top, =2 if W(i)\\n*> belongs to the second block, etc.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] INDEXW\\n*> \\\\verbatim\\n*> INDEXW is INTEGER array, dimension (N)\\n*> The indices of the eigenvalues within each block (submatrix);\\n*> for example, INDEXW(i)= 10 and IBLOCK(i)=2 imply that the\\n*> i-th eigenvalue W(i) is the 10-th eigenvalue in the second block.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] GERS\\n*> \\\\verbatim\\n*> GERS is DOUBLE PRECISION array, dimension (2*N)\\n*> The N Gerschgorin intervals (the i-th Gerschgorin interval\\n*> is (GERS(2*i-1), GERS(2*i)). The Gerschgorin intervals should\\n*> be computed from the original UNshifted matrix.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] Z\\n*> \\\\verbatim\\n*> Z is COMPLEX*16 array, dimension (LDZ, max(1,M) )\\n*> If INFO = 0, the first M columns of Z contain the\\n*> orthonormal eigenvectors of the matrix T\\n*> corresponding to the input eigenvalues, with the i-th\\n*> column of Z holding the eigenvector associated with W(i).\\n*> Note: the user must ensure that at least max(1,M) columns are\\n*> supplied in the array Z.\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[in] LDZ\\n*> \\\\verbatim\\n*> LDZ is INTEGER\\n*> The leading dimension of the array Z. LDZ >= 1, and if\\n*> JOBZ = 'V', LDZ >= max(1,N).\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] ISUPPZ\\n*> \\\\verbatim\\n*> ISUPPZ is INTEGER array, dimension ( 2*max(1,M) )\\n*> The support of the eigenvectors in Z, i.e., the indices\\n*> indicating the nonzero elements in Z. The I-th eigenvector\\n*> is nonzero only in elements ISUPPZ( 2*I-1 ) through\\n*> ISUPPZ( 2*I ).\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] WORK\\n*> \\\\verbatim\\n*> WORK is DOUBLE PRECISION array, dimension (12*N)\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] IWORK\\n*> \\\\verbatim\\n*> IWORK is INTEGER array, dimension (7*N)\\n*> \\\\endverbatim\\n*>\\n*> \\\\param[out] INFO\\n*> \\\\verbatim\\n*> INFO is INTEGER\\n*> = 0: successful exit\\n*>\\n*> > 0: A problem occurred in ZLARRV.\\n*> < 0: One of the called subroutines signaled an internal problem.\\n*> Needs inspection of the corresponding parameter IINFO\\n*> for further information.\\n*>\\n*> =-1: Problem in DLARRB when refining a child's eigenvalues.\\n*> =-2: Problem in DLARRF when computing the RRR of a child.\\n*> When a child is inside a tight cluster, it can be difficult\\n*> to find an RRR. A partial remedy from the user's point of\\n*> view is to make the parameter MINRGP smaller and recompile.\\n*> However, as the orthogonality of the computed vectors is\\n*> proportional to 1/MINRGP, the user should be aware that\\n*> he might be trading in precision when he decreases MINRGP.\\n*> =-3: Problem in DLARRB when refining a single eigenvalue\\n*> after the Rayleigh correction was rejected.\\n*> = 5: The Rayleigh Quotient Iteration failed to converge to\\n*> full accuracy in MAXITR steps.\\n*> \\\\endverbatim\\n*\\n* Authors:\\n* ========\\n*\\n*> \\\\author Univ. of Tennessee\\n*> \\\\author Univ. of California Berkeley\\n*> \\\\author Univ. of Colorado Denver\\n*> \\\\author NAG Ltd.\\n*\\n*> \\\\ingroup complex16OTHERauxiliary\\n*\\n*> \\\\par Contributors:\\n* ==================\\n*>\\n*> Beresford Parlett, University of California, Berkeley, USA \\\\n\\n*> Jim Demmel, University of California, Berkeley, USA \\\\n\\n*> Inderjit Dhillon, University of Texas, Austin, USA \\\\n\\n*> Osni Marques, LBNL/NERSC, USA \\\\n\\n*> Christof Voemel, University of California, Berkeley, USA\\n*\\n* =====================================================================\\n SUBROUTINE ZLARRV( N, VL, VU, D, L, PIVMIN,\\n $ ISPLIT, M, DOL, DOU, MINRGP,\\n $ RTOL1, RTOL2, W, WERR, WGAP,\\n $ IBLOCK, INDEXW, GERS, Z, LDZ, ISUPPZ,\\n $ WORK, IWORK, INFO )\\n*\\n* -- LAPACK auxiliary routine --\\n* -- LAPACK is a software package provided by Univ. of Tennessee, --\\n* -- Univ. of California Berkeley, Univ. of Colorado Denver and NAG Ltd..--\\n*\\n* .. Scalar Arguments ..\\n INTEGER DOL, DOU, INFO, LDZ, M, N\\n DOUBLE PRECISION MINRGP, PIVMIN, RTOL1, RTOL2, VL, VU\\n* ..\\n* .. Array Arguments ..\\n INTEGER IBLOCK( * ), INDEXW( * ), ISPLIT( * ),\\n $ ISUPPZ( * ), IWORK( * )\\n DOUBLE PRECISION D( * ), GERS( * ), L( * ), W( * ), WERR( * ),\\n $ WGAP( * ), WORK( * )\\n COMPLEX*16 Z( LDZ, * )\\n* ..\\n*\\n* =====================================================================\\n*\\n* .. Parameters ..\\n INTEGER MAXITR\\n PARAMETER ( MAXITR = 10 )\\n COMPLEX*16 CZERO\\n PARAMETER ( CZERO = ( 0.0D0, 0.0D0 ) )\\n DOUBLE PRECISION ZERO, ONE, TWO, THREE, FOUR, HALF\\n PARAMETER ( ZERO = 0.0D0, ONE = 1.0D0,\\n $ TWO = 2.0D0, THREE = 3.0D0,\\n $ FOUR = 4.0D0, HALF = 0.5D0)\\n* ..\\n* .. Local Scalars ..\\n LOGICAL ESKIP, NEEDBS, STP2II, TRYRQC, USEDBS, USEDRQ\\n INTEGER DONE, I, IBEGIN, IDONE, IEND, II, IINDC1,\\n $ IINDC2, IINDR, IINDWK, IINFO, IM, IN, INDEIG,\\n $ INDLD, INDLLD, INDWRK, ISUPMN, ISUPMX, ITER,\\n $ ITMP1, J, JBLK, K, MINIWSIZE, MINWSIZE, NCLUS,\\n $ NDEPTH, NEGCNT, NEWCLS, NEWFST, NEWFTT, NEWLST,\\n $ NEWSIZ, OFFSET, OLDCLS, OLDFST, OLDIEN, OLDLST,\\n $ OLDNCL, P, PARITY, Q, WBEGIN, WEND, WINDEX,\\n $ WINDMN, WINDPL, ZFROM, ZTO, ZUSEDL, ZUSEDU,\\n $ ZUSEDW\\n INTEGER INDIN1, INDIN2\\n DOUBLE PRECISION BSTRES, BSTW, EPS, FUDGE, GAP, GAPTOL, GL, GU,\\n $ LAMBDA, LEFT, LGAP, MINGMA, NRMINV, RESID,\\n $ RGAP, RIGHT, RQCORR, RQTOL, SAVGAP, SGNDEF,\\n $ SIGMA, SPDIAM, SSIGMA, TAU, TMP, TOL, ZTZ\\n* ..\\n* .. External Functions ..\\n DOUBLE PRECISION DLAMCH\\n EXTERNAL DLAMCH\\n* ..\\n* .. External Subroutines ..\\n EXTERNAL DCOPY, DLARRB, DLARRF, ZDSCAL, ZLAR1V,\\n $ ZLASET\\n* ..\\n* .. Intrinsic Functions ..\\n INTRINSIC ABS, DBLE, MAX, MIN\\n INTRINSIC DCMPLX\\n* ..\\n* .. Executable Statements ..\\n* ..\",\n \" INFO = 0\\n*\\n* Quick return if possible\\n*\",\n \" IF( (N.LE.0).OR.(M.LE.0) ) THEN\",\n \" RETURN\\n END IF\\n*\\n* The first N entries of WORK are reserved for the eigenvalues\\n INDLD = N+1\\n INDLLD= 2*N+1\\n INDIN1 = 3*N + 1\\n INDIN2 = 4*N + 1\\n INDWRK = 5*N + 1\\n MINWSIZE = 12 * N\",\n \" DO 5 I= 1,MINWSIZE\\n WORK( I ) = ZERO\\n 5 CONTINUE\",\n \"* IWORK(IINDR+1:IINDR+N) hold the twist indices R for the\\n* factorization used to compute the FP vector\\n IINDR = 0\\n* IWORK(IINDC1+1:IINC2+N) are used to store the clusters of the current\\n* layer and the one above.\\n IINDC1 = N\\n IINDC2 = 2*N\\n IINDWK = 3*N + 1\",\n \" MINIWSIZE = 7 * N\\n DO 10 I= 1,MINIWSIZE\\n IWORK( I ) = 0\\n 10 CONTINUE\",\n \" ZUSEDL = 1\\n IF(DOL.GT.1) THEN\\n* Set lower bound for use of Z\\n ZUSEDL = DOL-1\\n ENDIF\\n ZUSEDU = M\\n IF(DOU.LT.M) THEN\\n* Set lower bound for use of Z\\n ZUSEDU = DOU+1\\n ENDIF\\n* The width of the part of Z that is used\\n ZUSEDW = ZUSEDU - ZUSEDL + 1\",\n \"\\n CALL ZLASET( 'Full', N, ZUSEDW, CZERO, CZERO,\\n $ Z(1,ZUSEDL), LDZ )\",\n \" EPS = DLAMCH( 'Precision' )\\n RQTOL = TWO * EPS\\n*\\n* Set expert flags for standard code.\\n TRYRQC = .TRUE.\",\n \" IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\\n ELSE\\n* Only selected eigenpairs are computed. Since the other evalues\\n* are not refined by RQ iteration, bisection has to compute to full\\n* accuracy.\\n RTOL1 = FOUR * EPS\\n RTOL2 = FOUR * EPS\\n ENDIF\",\n \"* The entries WBEGIN:WEND in W, WERR, WGAP correspond to the\\n* desired eigenvalues. The support of the nonzero eigenvector\\n* entries is contained in the interval IBEGIN:IEND.\\n* Remark that if k eigenpairs are desired, then the eigenvectors\\n* are stored in k contiguous columns of Z.\",\n \"* DONE is the number of eigenvectors already computed\\n DONE = 0\\n IBEGIN = 1\\n WBEGIN = 1\\n DO 170 JBLK = 1, IBLOCK( M )\\n IEND = ISPLIT( JBLK )\\n SIGMA = L( IEND )\\n* Find the eigenvectors of the submatrix indexed IBEGIN\\n* through IEND.\\n WEND = WBEGIN - 1\\n 15 CONTINUE\\n IF( WEND.LT.M ) THEN\\n IF( IBLOCK( WEND+1 ).EQ.JBLK ) THEN\\n WEND = WEND + 1\\n GO TO 15\\n END IF\\n END IF\\n IF( WEND.LT.WBEGIN ) THEN\\n IBEGIN = IEND + 1\\n GO TO 170\\n ELSEIF( (WEND.LT.DOL).OR.(WBEGIN.GT.DOU) ) THEN\\n IBEGIN = IEND + 1\\n WBEGIN = WEND + 1\\n GO TO 170\\n END IF\",\n \"* Find local spectral diameter of the block\\n GL = GERS( 2*IBEGIN-1 )\\n GU = GERS( 2*IBEGIN )\\n DO 20 I = IBEGIN+1 , IEND\\n GL = MIN( GERS( 2*I-1 ), GL )\\n GU = MAX( GERS( 2*I ), GU )\\n 20 CONTINUE\\n SPDIAM = GU - GL\",\n \"* OLDIEN is the last index of the previous block\\n OLDIEN = IBEGIN - 1\\n* Calculate the size of the current block\\n IN = IEND - IBEGIN + 1\\n* The number of eigenvalues in the current block\\n IM = WEND - WBEGIN + 1\",\n \"* This is for a 1x1 block\\n IF( IBEGIN.EQ.IEND ) THEN\\n DONE = DONE+1\\n Z( IBEGIN, WBEGIN ) = DCMPLX( ONE, ZERO )\\n ISUPPZ( 2*WBEGIN-1 ) = IBEGIN\\n ISUPPZ( 2*WBEGIN ) = IBEGIN\\n W( WBEGIN ) = W( WBEGIN ) + SIGMA\\n WORK( WBEGIN ) = W( WBEGIN )\\n IBEGIN = IEND + 1\\n WBEGIN = WBEGIN + 1\\n GO TO 170\\n END IF\",\n \"* The desired (shifted) eigenvalues are stored in W(WBEGIN:WEND)\\n* Note that these can be approximations, in this case, the corresp.\\n* entries of WERR give the size of the uncertainty interval.\\n* The eigenvalue approximations will be refined when necessary as\\n* high relative accuracy is required for the computation of the\\n* corresponding eigenvectors.\\n CALL DCOPY( IM, W( WBEGIN ), 1,\\n $ WORK( WBEGIN ), 1 )\",\n \"* We store in W the eigenvalue approximations w.r.t. the original\\n* matrix T.\\n DO 30 I=1,IM\\n W(WBEGIN+I-1) = W(WBEGIN+I-1)+SIGMA\\n 30 CONTINUE\",\n \"\\n* NDEPTH is the current depth of the representation tree\\n NDEPTH = 0\\n* PARITY is either 1 or 0\\n PARITY = 1\\n* NCLUS is the number of clusters for the next level of the\\n* representation tree, we start with NCLUS = 1 for the root\\n NCLUS = 1\\n IWORK( IINDC1+1 ) = 1\\n IWORK( IINDC1+2 ) = IM\",\n \"* IDONE is the number of eigenvectors already computed in the current\\n* block\\n IDONE = 0\\n* loop while( IDONE.LT.IM )\\n* generate the representation tree for the current block and\\n* compute the eigenvectors\\n 40 CONTINUE\\n IF( IDONE.LT.IM ) THEN\\n* This is a crude protection against infinitely deep trees\\n IF( NDEPTH.GT.M ) THEN\\n INFO = -2\\n RETURN\\n ENDIF\\n* breadth first processing of the current level of the representation\\n* tree: OLDNCL = number of clusters on current level\\n OLDNCL = NCLUS\\n* reset NCLUS to count the number of child clusters\\n NCLUS = 0\\n*\\n PARITY = 1 - PARITY\\n IF( PARITY.EQ.0 ) THEN\\n OLDCLS = IINDC1\\n NEWCLS = IINDC2\\n ELSE\\n OLDCLS = IINDC2\\n NEWCLS = IINDC1\\n END IF\\n* Process the clusters on the current level\\n DO 150 I = 1, OLDNCL\\n J = OLDCLS + 2*I\\n* OLDFST, OLDLST = first, last index of current cluster.\\n* cluster indices start with 1 and are relative\\n* to WBEGIN when accessing W, WGAP, WERR, Z\\n OLDFST = IWORK( J-1 )\\n OLDLST = IWORK( J )\\n IF( NDEPTH.GT.0 ) THEN\\n* Retrieve relatively robust representation (RRR) of cluster\\n* that has been computed at the previous level\\n* The RRR is stored in Z and overwritten once the eigenvectors\\n* have been computed or when the cluster is refined\",\n \" IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\\n* Get representation from location of the leftmost evalue\\n* of the cluster\\n J = WBEGIN + OLDFST - 1\\n ELSE\\n IF(WBEGIN+OLDFST-1.LT.DOL) THEN\\n* Get representation from the left end of Z array\\n J = DOL - 1\\n ELSEIF(WBEGIN+OLDFST-1.GT.DOU) THEN\\n* Get representation from the right end of Z array\\n J = DOU\\n ELSE\\n J = WBEGIN + OLDFST - 1\\n ENDIF\\n ENDIF\\n DO 45 K = 1, IN - 1\\n D( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\\n $ J ) )\\n L( IBEGIN+K-1 ) = DBLE( Z( IBEGIN+K-1,\\n $ J+1 ) )\\n 45 CONTINUE\\n D( IEND ) = DBLE( Z( IEND, J ) )\\n SIGMA = DBLE( Z( IEND, J+1 ) )\",\n \"* Set the corresponding entries in Z to zero\\n CALL ZLASET( 'Full', IN, 2, CZERO, CZERO,\\n $ Z( IBEGIN, J), LDZ )\\n END IF\",\n \"* Compute DL and DLL of current RRR\\n DO 50 J = IBEGIN, IEND-1\\n TMP = D( J )*L( J )\\n WORK( INDLD-1+J ) = TMP\\n WORK( INDLLD-1+J ) = TMP*L( J )\\n 50 CONTINUE\",\n \" IF( NDEPTH.GT.0 ) THEN\\n* P and Q are index of the first and last eigenvalue to compute\\n* within the current block\\n P = INDEXW( WBEGIN-1+OLDFST )\\n Q = INDEXW( WBEGIN-1+OLDLST )\\n* Offset for the arrays WORK, WGAP and WERR, i.e., the P-OFFSET\\n* through the Q-OFFSET elements of these arrays are to be used.\\n* OFFSET = P-OLDFST\\n OFFSET = INDEXW( WBEGIN ) - 1\\n* perform limited bisection (if necessary) to get approximate\\n* eigenvalues to the precision needed.\\n CALL DLARRB( IN, D( IBEGIN ),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ P, Q, RTOL1, RTOL2, OFFSET,\\n $ WORK(WBEGIN),WGAP(WBEGIN),WERR(WBEGIN),\\n $ WORK( INDWRK ), IWORK( IINDWK ),\\n $ PIVMIN, SPDIAM, IN, IINFO )\\n IF( IINFO.NE.0 ) THEN\\n INFO = -1\\n RETURN\\n ENDIF\\n* We also recompute the extremal gaps. W holds all eigenvalues\\n* of the unshifted matrix and must be used for computation\\n* of WGAP, the entries of WORK might stem from RRRs with\\n* different shifts. The gaps from WBEGIN-1+OLDFST to\\n* WBEGIN-1+OLDLST are correctly computed in DLARRB.\\n* However, we only allow the gaps to become greater since\\n* this is what should happen when we decrease WERR\\n IF( OLDFST.GT.1) THEN\\n WGAP( WBEGIN+OLDFST-2 ) =\\n $ MAX(WGAP(WBEGIN+OLDFST-2),\\n $ W(WBEGIN+OLDFST-1)-WERR(WBEGIN+OLDFST-1)\\n $ - W(WBEGIN+OLDFST-2)-WERR(WBEGIN+OLDFST-2) )\\n ENDIF\\n IF( WBEGIN + OLDLST -1 .LT. WEND ) THEN\\n WGAP( WBEGIN+OLDLST-1 ) =\\n $ MAX(WGAP(WBEGIN+OLDLST-1),\\n $ W(WBEGIN+OLDLST)-WERR(WBEGIN+OLDLST)\\n $ - W(WBEGIN+OLDLST-1)-WERR(WBEGIN+OLDLST-1) )\\n ENDIF\\n* Each time the eigenvalues in WORK get refined, we store\\n* the newly found approximation with all shifts applied in W\\n DO 53 J=OLDFST,OLDLST\\n W(WBEGIN+J-1) = WORK(WBEGIN+J-1)+SIGMA\\n 53 CONTINUE\\n END IF\",\n \"* Process the current node.\\n NEWFST = OLDFST\\n DO 140 J = OLDFST, OLDLST\\n IF( J.EQ.OLDLST ) THEN\\n* we are at the right end of the cluster, this is also the\\n* boundary of the child cluster\\n NEWLST = J\\n ELSE IF ( WGAP( WBEGIN + J -1).GE.\\n $ MINRGP* ABS( WORK(WBEGIN + J -1) ) ) THEN\\n* the right relative gap is big enough, the child cluster\\n* (NEWFST,..,NEWLST) is well separated from the following\\n NEWLST = J\\n ELSE\\n* inside a child cluster, the relative gap is not\\n* big enough.\\n GOTO 140\\n END IF\",\n \"* Compute size of child cluster found\\n NEWSIZ = NEWLST - NEWFST + 1\",\n \"* NEWFTT is the place in Z where the new RRR or the computed\\n* eigenvector is to be stored\\n IF((DOL.EQ.1).AND.(DOU.EQ.M)) THEN\\n* Store representation at location of the leftmost evalue\\n* of the cluster\\n NEWFTT = WBEGIN + NEWFST - 1\\n ELSE\\n IF(WBEGIN+NEWFST-1.LT.DOL) THEN\\n* Store representation at the left end of Z array\\n NEWFTT = DOL - 1\\n ELSEIF(WBEGIN+NEWFST-1.GT.DOU) THEN\\n* Store representation at the right end of Z array\\n NEWFTT = DOU\\n ELSE\\n NEWFTT = WBEGIN + NEWFST - 1\\n ENDIF\\n ENDIF\",\n \" IF( NEWSIZ.GT.1) THEN\\n*\\n* Current child is not a singleton but a cluster.\\n* Compute and store new representation of child.\\n*\\n*\\n* Compute left and right cluster gap.\\n*\\n* LGAP and RGAP are not computed from WORK because\\n* the eigenvalue approximations may stem from RRRs\\n* different shifts. However, W hold all eigenvalues\\n* of the unshifted matrix. Still, the entries in WGAP\\n* have to be computed from WORK since the entries\\n* in W might be of the same order so that gaps are not\\n* exhibited correctly for very close eigenvalues.\\n IF( NEWFST.EQ.1 ) THEN\\n LGAP = MAX( ZERO,\\n $ W(WBEGIN)-WERR(WBEGIN) - VL )\\n ELSE\\n LGAP = WGAP( WBEGIN+NEWFST-2 )\\n ENDIF\\n RGAP = WGAP( WBEGIN+NEWLST-1 )\\n*\\n* Compute left- and rightmost eigenvalue of child\\n* to high precision in order to shift as close\\n* as possible and obtain as large relative gaps\\n* as possible\\n*\\n DO 55 K =1,2\\n IF(K.EQ.1) THEN\\n P = INDEXW( WBEGIN-1+NEWFST )\\n ELSE\\n P = INDEXW( WBEGIN-1+NEWLST )\\n ENDIF\\n OFFSET = INDEXW( WBEGIN ) - 1\\n CALL DLARRB( IN, D(IBEGIN),\\n $ WORK( INDLLD+IBEGIN-1 ),P,P,\\n $ RQTOL, RQTOL, OFFSET,\\n $ WORK(WBEGIN),WGAP(WBEGIN),\\n $ WERR(WBEGIN),WORK( INDWRK ),\\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\\n $ IN, IINFO )\\n 55 CONTINUE\\n*\\n IF((WBEGIN+NEWLST-1.LT.DOL).OR.\\n $ (WBEGIN+NEWFST-1.GT.DOU)) THEN\\n* if the cluster contains no desired eigenvalues\\n* skip the computation of that branch of the rep. tree\\n*\\n* We could skip before the refinement of the extremal\\n* eigenvalues of the child, but then the representation\\n* tree could be different from the one when nothing is\\n* skipped. For this reason we skip at this place.\\n IDONE = IDONE + NEWLST - NEWFST + 1\\n GOTO 139\\n ENDIF\\n*\\n* Compute RRR of child cluster.\\n* Note that the new RRR is stored in Z\\n*\\n* DLARRF needs LWORK = 2*N\\n CALL DLARRF( IN, D( IBEGIN ), L( IBEGIN ),\\n $ WORK(INDLD+IBEGIN-1),\\n $ NEWFST, NEWLST, WORK(WBEGIN),\\n $ WGAP(WBEGIN), WERR(WBEGIN),\\n $ SPDIAM, LGAP, RGAP, PIVMIN, TAU,\\n $ WORK( INDIN1 ), WORK( INDIN2 ),\\n $ WORK( INDWRK ), IINFO )\\n* In the complex case, DLARRF cannot write\\n* the new RRR directly into Z and needs an intermediate\\n* workspace\\n DO 56 K = 1, IN-1\\n Z( IBEGIN+K-1, NEWFTT ) =\\n $ DCMPLX( WORK( INDIN1+K-1 ), ZERO )\\n Z( IBEGIN+K-1, NEWFTT+1 ) =\\n $ DCMPLX( WORK( INDIN2+K-1 ), ZERO )\\n 56 CONTINUE\\n Z( IEND, NEWFTT ) =\\n $ DCMPLX( WORK( INDIN1+IN-1 ), ZERO )\\n IF( IINFO.EQ.0 ) THEN\\n* a new RRR for the cluster was found by DLARRF\\n* update shift and store it\\n SSIGMA = SIGMA + TAU\\n Z( IEND, NEWFTT+1 ) = DCMPLX( SSIGMA, ZERO )\\n* WORK() are the midpoints and WERR() the semi-width\\n* Note that the entries in W are unchanged.\\n DO 116 K = NEWFST, NEWLST\\n FUDGE =\\n $ THREE*EPS*ABS(WORK(WBEGIN+K-1))\\n WORK( WBEGIN + K - 1 ) =\\n $ WORK( WBEGIN + K - 1) - TAU\\n FUDGE = FUDGE +\\n $ FOUR*EPS*ABS(WORK(WBEGIN+K-1))\\n* Fudge errors\\n WERR( WBEGIN + K - 1 ) =\\n $ WERR( WBEGIN + K - 1 ) + FUDGE\\n* Gaps are not fudged. Provided that WERR is small\\n* when eigenvalues are close, a zero gap indicates\\n* that a new representation is needed for resolving\\n* the cluster. A fudge could lead to a wrong decision\\n* of judging eigenvalues 'separated' which in\\n* reality are not. This could have a negative impact\\n* on the orthogonality of the computed eigenvectors.\\n 116 CONTINUE\",\n \" NCLUS = NCLUS + 1\\n K = NEWCLS + 2*NCLUS\\n IWORK( K-1 ) = NEWFST\\n IWORK( K ) = NEWLST\\n ELSE\\n INFO = -2\\n RETURN\\n ENDIF\\n ELSE\\n*\\n* Compute eigenvector of singleton\\n*\\n ITER = 0\\n*\\n TOL = FOUR * LOG(DBLE(IN)) * EPS\\n*\\n K = NEWFST\\n WINDEX = WBEGIN + K - 1\\n WINDMN = MAX(WINDEX - 1,1)\\n WINDPL = MIN(WINDEX + 1,M)\\n LAMBDA = WORK( WINDEX )\\n DONE = DONE + 1\\n* Check if eigenvector computation is to be skipped\\n IF((WINDEX.LT.DOL).OR.\\n $ (WINDEX.GT.DOU)) THEN\\n ESKIP = .TRUE.\\n GOTO 125\\n ELSE\\n ESKIP = .FALSE.\\n ENDIF\\n LEFT = WORK( WINDEX ) - WERR( WINDEX )\\n RIGHT = WORK( WINDEX ) + WERR( WINDEX )\\n INDEIG = INDEXW( WINDEX )\\n* Note that since we compute the eigenpairs for a child,\\n* all eigenvalue approximations are w.r.t the same shift.\\n* In this case, the entries in WORK should be used for\\n* computing the gaps since they exhibit even very small\\n* differences in the eigenvalues, as opposed to the\\n* entries in W which might \\\"look\\\" the same.\",\n \" IF( K .EQ. 1) THEN\\n* In the case RANGE='I' and with not much initial\\n* accuracy in LAMBDA and VL, the formula\\n* LGAP = MAX( ZERO, (SIGMA - VL) + LAMBDA )\\n* can lead to an overestimation of the left gap and\\n* thus to inadequately early RQI 'convergence'.\\n* Prevent this by forcing a small left gap.\\n LGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\\n ELSE\\n LGAP = WGAP(WINDMN)\\n ENDIF\\n IF( K .EQ. IM) THEN\\n* In the case RANGE='I' and with not much initial\\n* accuracy in LAMBDA and VU, the formula\\n* can lead to an overestimation of the right gap and\\n* thus to inadequately early RQI 'convergence'.\\n* Prevent this by forcing a small right gap.\\n RGAP = EPS*MAX(ABS(LEFT),ABS(RIGHT))\\n ELSE\\n RGAP = WGAP(WINDEX)\\n ENDIF\\n GAP = MIN( LGAP, RGAP )\\n IF(( K .EQ. 1).OR.(K .EQ. IM)) THEN\\n* The eigenvector support can become wrong\\n* because significant entries could be cut off due to a\\n* large GAPTOL parameter in LAR1V. Prevent this.\\n GAPTOL = ZERO\\n ELSE\\n GAPTOL = GAP * EPS\\n ENDIF\\n ISUPMN = IN\\n ISUPMX = 1\\n* Update WGAP so that it holds the minimum gap\\n* to the left or the right. This is crucial in the\\n* case where bisection is used to ensure that the\\n* eigenvalue is refined up to the required precision.\\n* The correct value is restored afterwards.\\n SAVGAP = WGAP(WINDEX)\\n WGAP(WINDEX) = GAP\\n* We want to use the Rayleigh Quotient Correction\\n* as often as possible since it converges quadratically\\n* when we are close enough to the desired eigenvalue.\\n* However, the Rayleigh Quotient can have the wrong sign\\n* and lead us away from the desired eigenvalue. In this\\n* case, the best we can do is to use bisection.\\n USEDBS = .FALSE.\\n USEDRQ = .FALSE.\\n* Bisection is initially turned off unless it is forced\\n NEEDBS = .NOT.TRYRQC\\n 120 CONTINUE\\n* Check if bisection should be used to refine eigenvalue\\n IF(NEEDBS) THEN\\n* Take the bisection as new iterate\\n USEDBS = .TRUE.\\n ITMP1 = IWORK( IINDR+WINDEX )\\n OFFSET = INDEXW( WBEGIN ) - 1\\n CALL DLARRB( IN, D(IBEGIN),\\n $ WORK(INDLLD+IBEGIN-1),INDEIG,INDEIG,\\n $ ZERO, TWO*EPS, OFFSET,\\n $ WORK(WBEGIN),WGAP(WBEGIN),\\n $ WERR(WBEGIN),WORK( INDWRK ),\\n $ IWORK( IINDWK ), PIVMIN, SPDIAM,\\n $ ITMP1, IINFO )\\n IF( IINFO.NE.0 ) THEN\\n INFO = -3\\n RETURN\\n ENDIF\\n LAMBDA = WORK( WINDEX )\\n* Reset twist index from inaccurate LAMBDA to\\n* force computation of true MINGMA\\n IWORK( IINDR+WINDEX ) = 0\\n ENDIF\\n* Given LAMBDA, compute the eigenvector.\\n CALL ZLAR1V( IN, 1, IN, LAMBDA, D( IBEGIN ),\\n $ L( IBEGIN ), WORK(INDLD+IBEGIN-1),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\\n $ IWORK( IINDR+WINDEX ), ISUPPZ( 2*WINDEX-1 ),\\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\\n IF(ITER .EQ. 0) THEN\\n BSTRES = RESID\\n BSTW = LAMBDA\\n ELSEIF(RESID.LT.BSTRES) THEN\\n BSTRES = RESID\\n BSTW = LAMBDA\\n ENDIF\\n ISUPMN = MIN(ISUPMN,ISUPPZ( 2*WINDEX-1 ))\\n ISUPMX = MAX(ISUPMX,ISUPPZ( 2*WINDEX ))\\n ITER = ITER + 1\",\n \"* sin alpha <= |resid|/gap\\n* Note that both the residual and the gap are\\n* proportional to the matrix, so ||T|| doesn't play\\n* a role in the quotient\",\n \"*\\n* Convergence test for Rayleigh-Quotient iteration\\n* (omitted when Bisection has been used)\\n*\\n IF( RESID.GT.TOL*GAP .AND. ABS( RQCORR ).GT.\\n $ RQTOL*ABS( LAMBDA ) .AND. .NOT. USEDBS)\\n $ THEN\\n* We need to check that the RQCORR update doesn't\\n* move the eigenvalue away from the desired one and\\n* towards a neighbor. -> protection with bisection\\n IF(INDEIG.LE.NEGCNT) THEN\\n* The wanted eigenvalue lies to the left\\n SGNDEF = -ONE\\n ELSE\\n* The wanted eigenvalue lies to the right\\n SGNDEF = ONE\\n ENDIF\\n* We only use the RQCORR if it improves the\\n* the iterate reasonably.\\n IF( ( RQCORR*SGNDEF.GE.ZERO )\\n $ .AND.( LAMBDA + RQCORR.LE. RIGHT)\\n $ .AND.( LAMBDA + RQCORR.GE. LEFT)\\n $ ) THEN\\n USEDRQ = .TRUE.\\n* Store new midpoint of bisection interval in WORK\\n IF(SGNDEF.EQ.ONE) THEN\\n* The current LAMBDA is on the left of the true\\n* eigenvalue\\n LEFT = LAMBDA\\n* We prefer to assume that the error estimate\\n* is correct. We could make the interval not\\n* as a bracket but to be modified if the RQCORR\\n* chooses to. In this case, the RIGHT side should\\n* be modified as follows:\\n* RIGHT = MAX(RIGHT, LAMBDA + RQCORR)\\n ELSE\\n* The current LAMBDA is on the right of the true\\n* eigenvalue\\n RIGHT = LAMBDA\\n* See comment about assuming the error estimate is\\n* correct above.\\n* LEFT = MIN(LEFT, LAMBDA + RQCORR)\\n ENDIF\\n WORK( WINDEX ) =\\n $ HALF * (RIGHT + LEFT)\\n* Take RQCORR since it has the correct sign and\\n* improves the iterate reasonably\\n LAMBDA = LAMBDA + RQCORR\\n* Update width of error interval\\n WERR( WINDEX ) =\\n $ HALF * (RIGHT-LEFT)\\n ELSE\\n NEEDBS = .TRUE.\\n ENDIF\\n IF(RIGHT-LEFT.LT.RQTOL*ABS(LAMBDA)) THEN\\n* The eigenvalue is computed to bisection accuracy\\n* compute eigenvector and stop\\n USEDBS = .TRUE.\\n GOTO 120\\n ELSEIF( ITER.LT.MAXITR ) THEN\\n GOTO 120\\n ELSEIF( ITER.EQ.MAXITR ) THEN\\n NEEDBS = .TRUE.\\n GOTO 120\\n ELSE\\n INFO = 5\\n RETURN\\n END IF\\n ELSE\\n STP2II = .FALSE.\\n IF(USEDRQ .AND. USEDBS .AND.\\n $ BSTRES.LE.RESID) THEN\\n LAMBDA = BSTW\\n STP2II = .TRUE.\\n ENDIF\\n IF (STP2II) THEN\\n* improve error angle by second step\\n CALL ZLAR1V( IN, 1, IN, LAMBDA,\\n $ D( IBEGIN ), L( IBEGIN ),\\n $ WORK(INDLD+IBEGIN-1),\\n $ WORK(INDLLD+IBEGIN-1),\\n $ PIVMIN, GAPTOL, Z( IBEGIN, WINDEX ),\\n $ .NOT.USEDBS, NEGCNT, ZTZ, MINGMA,\\n $ IWORK( IINDR+WINDEX ),\\n $ ISUPPZ( 2*WINDEX-1 ),\\n $ NRMINV, RESID, RQCORR, WORK( INDWRK ) )\\n ENDIF\\n WORK( WINDEX ) = LAMBDA\\n END IF\\n*\\n* Compute FP-vector support w.r.t. whole matrix\\n*\\n ISUPPZ( 2*WINDEX-1 ) = ISUPPZ( 2*WINDEX-1 )+OLDIEN\\n ISUPPZ( 2*WINDEX ) = ISUPPZ( 2*WINDEX )+OLDIEN\\n ZFROM = ISUPPZ( 2*WINDEX-1 )\\n ZTO = ISUPPZ( 2*WINDEX )\\n ISUPMN = ISUPMN + OLDIEN\\n ISUPMX = ISUPMX + OLDIEN\\n* Ensure vector is ok if support in the RQI has changed\\n IF(ISUPMN.LT.ZFROM) THEN\\n DO 122 II = ISUPMN,ZFROM-1\\n Z( II, WINDEX ) = ZERO\\n 122 CONTINUE\\n ENDIF\\n IF(ISUPMX.GT.ZTO) THEN\\n DO 123 II = ZTO+1,ISUPMX\\n Z( II, WINDEX ) = ZERO\\n 123 CONTINUE\\n ENDIF\\n CALL ZDSCAL( ZTO-ZFROM+1, NRMINV,\\n $ Z( ZFROM, WINDEX ), 1 )\\n 125 CONTINUE\\n* Update W\\n W( WINDEX ) = LAMBDA+SIGMA\\n* Recompute the gaps on the left and right\\n* But only allow them to become larger and not\\n* smaller (which can only happen through \\\"bad\\\"\\n* cancellation and doesn't reflect the theory\\n* where the initial gaps are underestimated due\\n* to WERR being too crude.)\\n IF(.NOT.ESKIP) THEN\\n IF( K.GT.1) THEN\\n WGAP( WINDMN ) = MAX( WGAP(WINDMN),\\n $ W(WINDEX)-WERR(WINDEX)\\n $ - W(WINDMN)-WERR(WINDMN) )\\n ENDIF\\n IF( WINDEX.LT.WEND ) THEN\\n WGAP( WINDEX ) = MAX( SAVGAP,\\n $ W( WINDPL )-WERR( WINDPL )\\n $ - W( WINDEX )-WERR( WINDEX) )\\n ENDIF\\n ENDIF\\n IDONE = IDONE + 1\\n ENDIF\\n* here ends the code for the current child\\n*\\n 139 CONTINUE\\n* Proceed to any remaining child nodes\\n NEWFST = J + 1\\n 140 CONTINUE\\n 150 CONTINUE\\n NDEPTH = NDEPTH + 1\\n GO TO 40\\n END IF\\n IBEGIN = IEND + 1\\n WBEGIN = WEND + 1\\n 170 CONTINUE\\n*\",\n \" RETURN\\n*\\n* End of ZLARRV\\n*\\n END\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [352, 354, 354, 352], \"buggy_code_start_loc\": [351, 353, 353, 351], \"filenames\": [\"SRC/clarrv.f\", \"SRC/dlarrv.f\", \"SRC/slarrv.f\", \"SRC/zlarrv.f\"], \"fixing_code_end_loc\": [352, 354, 354, 352], \"fixing_code_start_loc\": [351, 353, 353, 351], \"message\": \"An out-of-bounds read flaw was found in the CLARRV, DLARRV, SLARRV, and ZLARRV functions in lapack through version 3.10.0, as also used in OpenBLAS before version 0.3.18. Specially crafted inputs passed to these functions could cause an application using lapack to crash or possibly disclose portions of its memory.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:lapack_project:lapack:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"860F1070-052A-491D-AF07-7179ABFF53DA\", \"versionEndExcluding\": null, \"versionEndIncluding\": \"3.10.0\", \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:openblas_project:openblas:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"8C8DAA17-150E-4182-ADD1-4317FD35ED9D\", \"versionEndExcluding\": \"0.3.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:julialang:julia:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"50A99E6E-EE4D-443C-AEB3-C141F6CF2266\", \"versionEndExcluding\": null, \"versionEndIncluding\": \"1.6.3\", \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta1:*:*:*:*:*:*\", \"matchCriteriaId\": \"24F54DC9-8AC4-4578-B9B2-ECED81AA515B\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta2:*:*:*:*:*:*\", \"matchCriteriaId\": \"FA4C5004-D212-444C-82B5-2A4B013E0442\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta3:*:*:*:*:*:*\", \"matchCriteriaId\": \"C3B59E6B-37B8-461B-9701-1FD3CCC15014\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:beta4:*:*:*:*:*:*\", \"matchCriteriaId\": \"DF1A3614-9C2C-4604-BC11-046866C656EA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:julialang:julia:1.7.0:rc1:*:*:*:*:*:*\", \"matchCriteriaId\": \"2AD33935-9843-4F09-B5D9-A6C3D86E1022\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:2.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"D07DF15E-FE6B-4DAF-99BB-2147CF7D7EEA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:3.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"516F4E8E-ED2F-4282-9DAB-D8B378F61258\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"D6E54096-5D45-4CB2-AC9A-DDB55BF2B94C\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:ceph_storage:5.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"4E37E1B3-6F68-4502-85D6-68333643BDFF\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:openshift_container_storage:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"6FB187A4-F3A6-4993-AEF2-7808F1485EE2\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:a:redhat:openshift_data_foundation:4.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"0E2C021C-A9F0-4EB4-ADED-81D8B57B4563\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:34:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"A930E247-0B43-43CB-98FF-6CE7B8189835\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}, {\"criteria\": \"cpe:2.3:o:fedoraproject:fedora:35:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"80E516C0-98A4-4ADE-B69F-66A772E2BAAA\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"An out-of-bounds read flaw was found in the CLARRV, DLARRV, SLARRV, and ZLARRV functions in lapack through version 3.10.0, as also used in OpenBLAS before version 0.3.18. Specially crafted inputs passed to these functions could cause an application using lapack to crash or possibly disclose portions of its memory.\"}, {\"lang\": \"es\", \"value\": \"Se ha encontrado un fallo de lectura fuera de l\\u00edmites en las funciones CLARRV, DLARRV, SLARRV y ZLARRV de lapack versiones hasta 3.10.0, usadas tambi\\u00e9n en OpenBLAS versiones anteriores a 0.3.18. Las entradas especialmente dise\\u00f1adas que se pasan a estas funciones podr\\u00edan causar que una aplicaci\\u00f3n que use lapack se bloquee o posiblemente revele partes de su memoria\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-4048\", \"lastModified\": \"2022-01-04T16:09:22.500\", \"metrics\": {\"cvssMetricV2\": [{\"acInsufInfo\": false, \"baseSeverity\": \"MEDIUM\", \"cvssData\": {\"accessComplexity\": \"LOW\", \"accessVector\": \"NETWORK\", \"authentication\": \"NONE\", \"availabilityImpact\": \"PARTIAL\", \"baseScore\": 6.4, \"confidentialityImpact\": \"PARTIAL\", \"integrityImpact\": \"NONE\", \"vectorString\": \"AV:N/AC:L/Au:N/C:P/I:N/A:P\", \"version\": \"2.0\"}, \"exploitabilityScore\": 10.0, \"impactScore\": 4.9, \"obtainAllPrivilege\": false, \"obtainOtherPrivilege\": false, \"obtainUserPrivilege\": false, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\", \"userInteractionRequired\": false}], \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"NETWORK\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 9.1, \"baseSeverity\": \"CRITICAL\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"NONE\", \"privilegesRequired\": \"NONE\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:N/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 3.9, \"impactScore\": 5.2, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2021-12-08T22:15:10.220\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Issue Tracking\", \"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/JuliaLang/julia/issues/42415\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/Reference-LAPACK/lapack/commit/38f3eeee3108b18158409ca2a100e6fe03754781\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Issue Tracking\", \"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/Reference-LAPACK/lapack/pull/625\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/2be5ee3cca97a597f2ee2118808a2d5eacea050c\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/337b65133df174796794871b3988cd03426e6d41\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/ddb0ff5353637bb5f5ad060c9620e334c143e3d7\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/xianyi/OpenBLAS/commit/fe497efa0510466fd93578aaf9da1ad8ed4edbe7\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/6QFEVOCUG2UXMVMFMTU4ONJVDEHY2LW2/\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Mailing List\", \"Third Party Advisory\"], \"url\": \"https://lists.fedoraproject.org/archives/list/package-announce@lists.fedoraproject.org/message/DROZM4M2QRKSD6FBO4BHSV2QMIRJQPHT/\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-125\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}]}, \"github_commit_url\": \"https://github.com/Reference-LAPACK/lapack/commit/38f3eeee3108b18158409ca2a100e6fe03754781\"}, \"type\": \"CWE-125\"}"},"index":{"kind":"number","value":882,"string":"882"}}},{"rowIdx":5196,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["To build RPM you will need several other packages:\n--------------------------------------------------","The popt library for option parsing, must be version 1.13 or later.\nIt is available from\n http://ftp.rpm.org/popt/","The debugedit >= 0.3 tools for producing debuginfo sub-packages.\nIt is available from\n https://sourceware.org/debugedit/","Lua >= 5.2 library + development environment.\nNote that only the library is needed at runtime, RPM never calls external\nLua interpreter for anything. Lua is available from\n http://www.lua.org","The zlib library for compression support. You might also need/want\nthe unzip executable for java jar dependency analysis. All available from\n http://www.gzip.org/zlib/","The libmagic (aka file) library for file type detection (used by rpmbuild). \nThe source for the file utility + library is available from\n ftp://ftp.astron.com/pub/file/","You will need a cryptographic library to support digests and signatures.\nThis library may be libgcrypt or OpenSSL, and can be specified with the\n--with-crypto=[libgcrypt|openssl] argument to configure.\nlibgcrypt is the default.","libgcrypt library is available from https://www.gnupg.org/software/libgcrypt/","If using the OpenSSL library for encryption, it must be version 1.0.2 or\nlater. Note: when compiling against OpenSSL, there is a possible license\nincompatibility. For more details on this, see\nhttps://people.gnome.org/~markmc/openssl-and-the-gpl.html\nSome Linux distributions have different legal interpretations of this\npossible incompatibility. It is recommended to consult with a lawyer before\nbuilding RPM against OpenSSL.\nFedora: https://fedoraproject.org/wiki/Licensing:FAQ#What.27s_the_deal_with_the_OpenSSL_license.3F\nDebian: https://lists.debian.org/debian-legal/2002/10/msg00113.html","The OpenSSL crypto library is available from https://www.openssl.org/","RPM needs a database engine for normal operation. The main options are\n\"ndb\" (--enable-ndb) and \"sqlite\" (--enable-sqlite).\nAdditionally standalone support for read-only BDB databases is available as\n\"bdb_ro\" (--enable-bdb-ro) to aid with migration from BDB.","The ndb and bdb_ro backends have no external dependencies.\nSQLite >= 3.22.0 is required for the sqlite database backend.\nSQLite is available from https://www.sqlite.org/","If SELinux support is desired, it can be enabled with --with-selinux option\nto configure and libselinux development environment installed. SELinux\nis available from\n http://www.nsa.gov/selinux/","It may be desired to install bzip2, gzip, and xz/lzma so that RPM can use these\nformats. Gzip is necessary to build packages that contain compressed\ntar balls, these are quite common on the Internet.\nThese are available from\n http://www.gzip.org\n http://www.bzip.org\n http://tukaani.org/xz/","If you want to build the Python bindings to RPM library, it can be enabled\nwith --enable-python option to configure. You'll need to have Python >= 3.1\nruntime and C API development environment installed.\nPython is available from:\n http://www.python.org/","To enable POSIX.1e draft 15 file capabilities support, configure with\n--with-cap. You'll also need recent libcap, available from:\n http://ftp.kernel.org/pub/linux/libs/security/linux-privs/libcap2/","To enable POSIX 1003.1e draft 17 ACL verification support, configure with\n--with-acl. You'll also need the ACL library, available from:\n ftp://oss.sgi.com/projects/xfs/cmd_tars/","For best results you should compile with GCC and GNU Make. Users have\nreported difficulty with other build tools (any patches to lift these\ndependencies are welcome). Both GCC and GNU Make available from \n http://www.gnu.org/","If National Language Support (NLS) is desired you will need gnu\ngettext (currently this is required to build rpm but we hope to \nlift this requirement soon), available from \n http://www.gnu.org/","If you are going to hack the sources (or compile from source repository)\nyou will need most of the GNU development tools including:\nautoconf, automake, gettext, libtool, makeinfo, perl, GNU m4, GNU tar\navailable from \n http://www.gnu.org/","If you plan on using cryptographic signatures you will need a version\nof GPG, available from\n http://www.gnupg.org/","OpenMP multithreading support is automatically enabled if your C compiler has\nsupport for OpenMP version 4.5 or higher (to disable, pass the --disable-openmp\noption to configure). For GCC, OpenMP 4.5 is fully supported since GCC 6.1,\nwhich is available from\n http://www.gnu.org/","","\nTo compile RPM:\n--------------","RPM uses a small shell script to run: libtool, autoconf,\nautomake. This step should not be necessary if you are running a\nreleased version of rpm, however if you have gotten the rpm sources\ndirectly from the source code repository, you need to generate\nintermediate files by running the autogen.sh script.","The autogen.sh script checks that the required tools are installed.\nThe autogen.sh script also runs configure for you and passes the command line\narguments to configure. To run it without configure type:"," ./autogen.sh --noconfigure","If your libraries are not in a standard place you will need to change\nconfigures environment. These options can be passed directly to\nconfigure or to autogen.sh which will pass them through to configure.","Here is an example:\n LIBS='-L/opt/libz/ -L/opt/BerkeleyDB/lib/' \\\n CPPFLAGS='-I/opt/libz/ -I/opt/BerkeleyDB/include' \\\n ./configure","If you have build tools stored in non standard places you should check\nthe resulting Makefile to be sure that the tools you wish to use have\nbeen correctly identified. The configure script will modify your path\nbefore looking for the build tools and it may find versions of these\ntools that you do not want. It uses the following search path"," MYPATH=\"/bin:/usr/bin:/usr/local/bin:$PATH:/opt/gnu/bin\"","now build the system with:"," make","and then install with:"," make install","Rpm comes with an automated self-test suite. The test-suite relies heavily\non fakechroot (https://github.com/dex4er/fakechroot/) and cannot be executed\nwithout it. Provided that fakechroot was found during configure,\nit can be executed after a successful build with:"," make check","Finally, if you wish to prepare an rpm source tar ball, you should do"," make dist","To package RPM:\n--------------","After RPM has been installed you can run rpm to build an rpm package.\nEdit the rpm.spec file to mirror any special steps you needed to\nfollow to make rpm compile and change the specfile to match your\ntaste. You will need to put the rpm source tar file into the\nSOURCES directory and we suggest putting the specfile in the\nSPECS directory, then run rpmbuild -ba rpm.spec. You will end up\nwith two rpms which can be found in RPMS and SRPMS.","If you are going to install rpm on machines with OS package managers\nother then rpm, you may choose to install the base rpm package via a\ncpio instead of a tar file. Instead of running \"make tar\" during the\nbuild process, as described above, use the base rpm packages to create\na cpio. After the rpms have been created run rpm2cpio on the base rpm\npackage, this will give you a cpio package which can then use to\ninstall rpm on a new system."," rpm2cpio rpm-4.0-1.solaris2.6-sparc.rpm > rpm-4.0-1.solaris2.6-sparc.cpio","\nNon Linux Configuration Issues:\n------------------------------","\nOS dependencies:\n----------------","Under RPM based Linux distributions all libraries (in fact all files \ndistributed with the OS) are under RPM control and this section is not \nan issue.","RPM will need to be informed of all the dependencies which were\nsatisfied before RPM was installed. Typically this only refers to\nlibraries that are installed by the OS, but may include other\nlibraries and packages which are available at the time RPM is\ninstalled and will not under RPM control. Another common example of\nlibraries which may need dependency provisions are precompiled\nlibraries which are installed by the OS package manager during system\nbuild time. The list of dependencies you will wish to load into RPM\nwill depend on exactly how you bootstrap RPM onto your system and what\nparts of the system you put into packages as well as on the specific OS\nyou are using.","The script vpkg-provides.sh can be used to generate a package which\nwill satisfy the dependencies on your system. To run it you will need\nto create a specfile header for this empty package and run the progam\nwith:"," --spec_header '/path/to/os-base-header.spec","and if you wish to ensure that some directories are not traversed you\ncan use the option: "," --ignore_dirs 'grep-E|pattern|of|paths|to|ignore","By default the generated rpm will include a %verifyscript to verify\nchecksum of all files traversed has not changed. This additional\ncheck can be suppressed with:"," --no_verify","The result of running the script will be a specfile which will create\na package continging all the dependencies found on the system. There\nwill be one provides line for each depednecy. The package will contain\nnone of the actual OS library files as it is assumed they are already\non your system and managed by other means. Here is a example\n(truncated) of the provides lines used by one user of Digital Unix. (I\nhave put several provides on the same line for brevity)","provides: /bin/sh /usr/bin/ksh /usr/bin/csh \nprovides: libc.so.osf.1 libm.so.osf.1 libcurses.so.xpg4 libdb.so.osf.1\nprovides: libX11.so libXaw.so.6.0 libXext.so libXm.so.motif1.2 libXmu.so\nprovides: libdnet_stub.so.osf.1 libsecurity.so.osf.1 libpthread.so.osf.1\nprovides: libexc.so.osf.1 libmach.so.osf.1 libdps.so libdpstk.so ","\nThe script vpkg-provides2.sh is underdevelopment as a more advanced\nversion of vpkg-provides.sh which is aware of many different unix\nvendor packaging schemes. It will create one \"dependency package\" for\neach unix package your OS vendor installed.","\nrpmfilename:\n-----------","If you plan on packaging for more then one OS you may want to edit\n/etc/macros or /usr/lib/rpm/macros and change the line which has\nrpmfilename to something which include both the %{_target_os} and\n%{_target_cpu}. This will cause the name of the generated rpm files\nto the operating system name as well as the architecture which the rpm\nruns under. The line to change looks like:","%_rpmfilename %%{ARCH}/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{ARCH}.rpm","you may wish to include both the %{_target_os} and %{_target_cpu} in\nthe final base name, so that it's easier to distinguish between what\npackage is appropriate for a particular arch-os-version combo. We\nsuggest:","%_rpmfilename %%{_target_platform/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{_target_platform}.rpm","There is no %{_target_os_version} tag, so if you need to also\ndistinguish between RPMs for certain versions of the OS, you can\nhard-code the version in the rpmrc on the build machine, so that .rpm\nfiles are generated with the version as part of the filename.","For example when one user builds RPMs for Digital Unix 4.0b and 4.0d,\noptimization is important and he will build one set of RPMs for the\nEV4 processor and another set for the EV56 processor. He specifies\nboth the OS version (if it's important, as it is for a few packages)\nand the processor version by default by setting a special rpmfilename:\non the particular build machine.","The \"rpmfilename: \"tag on one machine (Digital Unix 4.0d, EV56 PWS 433)\nlooks like:","rpmfilename: %{_target_os}/4.0d/%{_target_cpu}/%{name}-%{version}-%{release}.%{_target_os}-%{_target_cpu}ev56.rpm","For package `foo-1.1', at build time that would translate into:"," osf1/4.0d/alpha/foo-1.1-1.osf1-alphaev56.rpm","The hyphen between the %{_target_cpu} and ev56 is left out for compatibility\nwith GNU Config.guess and because `alphaev56' looks more \"normal\" to\npeople with an alpha than alpha-ev56 for someone on an Intel Pentium\nPro would want `i586pro' over `i586-pro', but it does make parsing\nthis filename by other programs a bit more difficult.","\nGPG\n---","To use the signing features of rpm, you will need to configure certain\nrpm macros in ~/.rpmmacros:","\t%_gpg_name <GPG UID>\n\t%_gpg_path %(echo $HOME)/.gnupg"],"string":"[\n \"To build RPM you will need several other packages:\\n--------------------------------------------------\",\n \"The popt library for option parsing, must be version 1.13 or later.\\nIt is available from\\n http://ftp.rpm.org/popt/\",\n \"The debugedit >= 0.3 tools for producing debuginfo sub-packages.\\nIt is available from\\n https://sourceware.org/debugedit/\",\n \"Lua >= 5.2 library + development environment.\\nNote that only the library is needed at runtime, RPM never calls external\\nLua interpreter for anything. Lua is available from\\n http://www.lua.org\",\n \"The zlib library for compression support. You might also need/want\\nthe unzip executable for java jar dependency analysis. All available from\\n http://www.gzip.org/zlib/\",\n \"The libmagic (aka file) library for file type detection (used by rpmbuild). \\nThe source for the file utility + library is available from\\n ftp://ftp.astron.com/pub/file/\",\n \"You will need a cryptographic library to support digests and signatures.\\nThis library may be libgcrypt or OpenSSL, and can be specified with the\\n--with-crypto=[libgcrypt|openssl] argument to configure.\\nlibgcrypt is the default.\",\n \"libgcrypt library is available from https://www.gnupg.org/software/libgcrypt/\",\n \"If using the OpenSSL library for encryption, it must be version 1.0.2 or\\nlater. Note: when compiling against OpenSSL, there is a possible license\\nincompatibility. For more details on this, see\\nhttps://people.gnome.org/~markmc/openssl-and-the-gpl.html\\nSome Linux distributions have different legal interpretations of this\\npossible incompatibility. It is recommended to consult with a lawyer before\\nbuilding RPM against OpenSSL.\\nFedora: https://fedoraproject.org/wiki/Licensing:FAQ#What.27s_the_deal_with_the_OpenSSL_license.3F\\nDebian: https://lists.debian.org/debian-legal/2002/10/msg00113.html\",\n \"The OpenSSL crypto library is available from https://www.openssl.org/\",\n \"RPM needs a database engine for normal operation. The main options are\\n\\\"ndb\\\" (--enable-ndb) and \\\"sqlite\\\" (--enable-sqlite).\\nAdditionally standalone support for read-only BDB databases is available as\\n\\\"bdb_ro\\\" (--enable-bdb-ro) to aid with migration from BDB.\",\n \"The ndb and bdb_ro backends have no external dependencies.\\nSQLite >= 3.22.0 is required for the sqlite database backend.\\nSQLite is available from https://www.sqlite.org/\",\n \"If SELinux support is desired, it can be enabled with --with-selinux option\\nto configure and libselinux development environment installed. SELinux\\nis available from\\n http://www.nsa.gov/selinux/\",\n \"It may be desired to install bzip2, gzip, and xz/lzma so that RPM can use these\\nformats. Gzip is necessary to build packages that contain compressed\\ntar balls, these are quite common on the Internet.\\nThese are available from\\n http://www.gzip.org\\n http://www.bzip.org\\n http://tukaani.org/xz/\",\n \"If you want to build the Python bindings to RPM library, it can be enabled\\nwith --enable-python option to configure. You'll need to have Python >= 3.1\\nruntime and C API development environment installed.\\nPython is available from:\\n http://www.python.org/\",\n \"To enable POSIX.1e draft 15 file capabilities support, configure with\\n--with-cap. You'll also need recent libcap, available from:\\n http://ftp.kernel.org/pub/linux/libs/security/linux-privs/libcap2/\",\n \"To enable POSIX 1003.1e draft 17 ACL verification support, configure with\\n--with-acl. You'll also need the ACL library, available from:\\n ftp://oss.sgi.com/projects/xfs/cmd_tars/\",\n \"For best results you should compile with GCC and GNU Make. Users have\\nreported difficulty with other build tools (any patches to lift these\\ndependencies are welcome). Both GCC and GNU Make available from \\n http://www.gnu.org/\",\n \"If National Language Support (NLS) is desired you will need gnu\\ngettext (currently this is required to build rpm but we hope to \\nlift this requirement soon), available from \\n http://www.gnu.org/\",\n \"If you are going to hack the sources (or compile from source repository)\\nyou will need most of the GNU development tools including:\\nautoconf, automake, gettext, libtool, makeinfo, perl, GNU m4, GNU tar\\navailable from \\n http://www.gnu.org/\",\n \"If you plan on using cryptographic signatures you will need a version\\nof GPG, available from\\n http://www.gnupg.org/\",\n \"OpenMP multithreading support is automatically enabled if your C compiler has\\nsupport for OpenMP version 4.5 or higher (to disable, pass the --disable-openmp\\noption to configure). For GCC, OpenMP 4.5 is fully supported since GCC 6.1,\\nwhich is available from\\n http://www.gnu.org/\",\n \"\",\n \"\\nTo compile RPM:\\n--------------\",\n \"RPM uses a small shell script to run: libtool, autoconf,\\nautomake. This step should not be necessary if you are running a\\nreleased version of rpm, however if you have gotten the rpm sources\\ndirectly from the source code repository, you need to generate\\nintermediate files by running the autogen.sh script.\",\n \"The autogen.sh script checks that the required tools are installed.\\nThe autogen.sh script also runs configure for you and passes the command line\\narguments to configure. To run it without configure type:\",\n \" ./autogen.sh --noconfigure\",\n \"If your libraries are not in a standard place you will need to change\\nconfigures environment. These options can be passed directly to\\nconfigure or to autogen.sh which will pass them through to configure.\",\n \"Here is an example:\\n LIBS='-L/opt/libz/ -L/opt/BerkeleyDB/lib/' \\\\\\n CPPFLAGS='-I/opt/libz/ -I/opt/BerkeleyDB/include' \\\\\\n ./configure\",\n \"If you have build tools stored in non standard places you should check\\nthe resulting Makefile to be sure that the tools you wish to use have\\nbeen correctly identified. The configure script will modify your path\\nbefore looking for the build tools and it may find versions of these\\ntools that you do not want. It uses the following search path\",\n \" MYPATH=\\\"/bin:/usr/bin:/usr/local/bin:$PATH:/opt/gnu/bin\\\"\",\n \"now build the system with:\",\n \" make\",\n \"and then install with:\",\n \" make install\",\n \"Rpm comes with an automated self-test suite. The test-suite relies heavily\\non fakechroot (https://github.com/dex4er/fakechroot/) and cannot be executed\\nwithout it. Provided that fakechroot was found during configure,\\nit can be executed after a successful build with:\",\n \" make check\",\n \"Finally, if you wish to prepare an rpm source tar ball, you should do\",\n \" make dist\",\n \"To package RPM:\\n--------------\",\n \"After RPM has been installed you can run rpm to build an rpm package.\\nEdit the rpm.spec file to mirror any special steps you needed to\\nfollow to make rpm compile and change the specfile to match your\\ntaste. You will need to put the rpm source tar file into the\\nSOURCES directory and we suggest putting the specfile in the\\nSPECS directory, then run rpmbuild -ba rpm.spec. You will end up\\nwith two rpms which can be found in RPMS and SRPMS.\",\n \"If you are going to install rpm on machines with OS package managers\\nother then rpm, you may choose to install the base rpm package via a\\ncpio instead of a tar file. Instead of running \\\"make tar\\\" during the\\nbuild process, as described above, use the base rpm packages to create\\na cpio. After the rpms have been created run rpm2cpio on the base rpm\\npackage, this will give you a cpio package which can then use to\\ninstall rpm on a new system.\",\n \" rpm2cpio rpm-4.0-1.solaris2.6-sparc.rpm > rpm-4.0-1.solaris2.6-sparc.cpio\",\n \"\\nNon Linux Configuration Issues:\\n------------------------------\",\n \"\\nOS dependencies:\\n----------------\",\n \"Under RPM based Linux distributions all libraries (in fact all files \\ndistributed with the OS) are under RPM control and this section is not \\nan issue.\",\n \"RPM will need to be informed of all the dependencies which were\\nsatisfied before RPM was installed. Typically this only refers to\\nlibraries that are installed by the OS, but may include other\\nlibraries and packages which are available at the time RPM is\\ninstalled and will not under RPM control. Another common example of\\nlibraries which may need dependency provisions are precompiled\\nlibraries which are installed by the OS package manager during system\\nbuild time. The list of dependencies you will wish to load into RPM\\nwill depend on exactly how you bootstrap RPM onto your system and what\\nparts of the system you put into packages as well as on the specific OS\\nyou are using.\",\n \"The script vpkg-provides.sh can be used to generate a package which\\nwill satisfy the dependencies on your system. To run it you will need\\nto create a specfile header for this empty package and run the progam\\nwith:\",\n \" --spec_header '/path/to/os-base-header.spec\",\n \"and if you wish to ensure that some directories are not traversed you\\ncan use the option: \",\n \" --ignore_dirs 'grep-E|pattern|of|paths|to|ignore\",\n \"By default the generated rpm will include a %verifyscript to verify\\nchecksum of all files traversed has not changed. This additional\\ncheck can be suppressed with:\",\n \" --no_verify\",\n \"The result of running the script will be a specfile which will create\\na package continging all the dependencies found on the system. There\\nwill be one provides line for each depednecy. The package will contain\\nnone of the actual OS library files as it is assumed they are already\\non your system and managed by other means. Here is a example\\n(truncated) of the provides lines used by one user of Digital Unix. (I\\nhave put several provides on the same line for brevity)\",\n \"provides: /bin/sh /usr/bin/ksh /usr/bin/csh \\nprovides: libc.so.osf.1 libm.so.osf.1 libcurses.so.xpg4 libdb.so.osf.1\\nprovides: libX11.so libXaw.so.6.0 libXext.so libXm.so.motif1.2 libXmu.so\\nprovides: libdnet_stub.so.osf.1 libsecurity.so.osf.1 libpthread.so.osf.1\\nprovides: libexc.so.osf.1 libmach.so.osf.1 libdps.so libdpstk.so \",\n \"\\nThe script vpkg-provides2.sh is underdevelopment as a more advanced\\nversion of vpkg-provides.sh which is aware of many different unix\\nvendor packaging schemes. It will create one \\\"dependency package\\\" for\\neach unix package your OS vendor installed.\",\n \"\\nrpmfilename:\\n-----------\",\n \"If you plan on packaging for more then one OS you may want to edit\\n/etc/macros or /usr/lib/rpm/macros and change the line which has\\nrpmfilename to something which include both the %{_target_os} and\\n%{_target_cpu}. This will cause the name of the generated rpm files\\nto the operating system name as well as the architecture which the rpm\\nruns under. The line to change looks like:\",\n \"%_rpmfilename %%{ARCH}/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{ARCH}.rpm\",\n \"you may wish to include both the %{_target_os} and %{_target_cpu} in\\nthe final base name, so that it's easier to distinguish between what\\npackage is appropriate for a particular arch-os-version combo. We\\nsuggest:\",\n \"%_rpmfilename %%{_target_platform/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{_target_platform}.rpm\",\n \"There is no %{_target_os_version} tag, so if you need to also\\ndistinguish between RPMs for certain versions of the OS, you can\\nhard-code the version in the rpmrc on the build machine, so that .rpm\\nfiles are generated with the version as part of the filename.\",\n \"For example when one user builds RPMs for Digital Unix 4.0b and 4.0d,\\noptimization is important and he will build one set of RPMs for the\\nEV4 processor and another set for the EV56 processor. He specifies\\nboth the OS version (if it's important, as it is for a few packages)\\nand the processor version by default by setting a special rpmfilename:\\non the particular build machine.\",\n \"The \\\"rpmfilename: \\\"tag on one machine (Digital Unix 4.0d, EV56 PWS 433)\\nlooks like:\",\n \"rpmfilename: %{_target_os}/4.0d/%{_target_cpu}/%{name}-%{version}-%{release}.%{_target_os}-%{_target_cpu}ev56.rpm\",\n \"For package `foo-1.1', at build time that would translate into:\",\n \" osf1/4.0d/alpha/foo-1.1-1.osf1-alphaev56.rpm\",\n \"The hyphen between the %{_target_cpu} and ev56 is left out for compatibility\\nwith GNU Config.guess and because `alphaev56' looks more \\\"normal\\\" to\\npeople with an alpha than alpha-ev56 for someone on an Intel Pentium\\nPro would want `i586pro' over `i586-pro', but it does make parsing\\nthis filename by other programs a bit more difficult.\",\n \"\\nGPG\\n---\",\n \"To use the signing features of rpm, you will need to configure certain\\nrpm macros in ~/.rpmmacros:\",\n \"\\t%_gpg_name <GPG UID>\\n\\t%_gpg_path %(echo $HOME)/.gnupg\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 0,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [104, 584, 1024], \"buggy_code_start_loc\": [104, 583, 10], \"filenames\": [\"INSTALL\", \"configure.ac\", \"lib/fsm.c\"], \"fixing_code_end_loc\": [107, 585, 1157], \"fixing_code_start_loc\": [105, 583, 11], \"message\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:rpm:rpm:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"582D14B9-3812-42FD-9FA3-2BDEAA02DD6C\", \"versionEndExcluding\": \"4.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\"}, {\"lang\": \"es\", \"value\": \"Se ha detectado que la correcci\\u00f3n de CVE-2017-7500 y CVE-2017-7501 era incompleta: la comprobaci\\u00f3n s\\u00f3lo es implementada para el directorio padre del archivo que iba a crearse. Un usuario local no privilegiado que posea otro directorio antecesor podr\\u00eda usar este fallo para conseguir privilegios de root. La mayor amenaza de esta vulnerabilidad es para la confidencialidad e integridad de los datos, as\\u00ed como para la disponibilidad del sistema.\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-35939\", \"lastModified\": \"2023-02-04T01:16:51.737\", \"metrics\": {\"cvssMetricV2\": null, \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 6.7, \"baseSeverity\": \"MEDIUM\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"HIGH\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:H/UI:N/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 0.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-08-26T16:15:08.683\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://access.redhat.com/security/cve/CVE-2021-35939\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Exploit\", \"Issue Tracking\", \"Third Party Advisory\"], \"url\": \"https://bugzilla.redhat.com/show_bug.cgi?id=1964129\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/pull/1919\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Release Notes\", \"Vendor Advisory\"], \"url\": \"https://rpm.org/wiki/Releases/4.18.0\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202210-22\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, \"type\": \"CWE-59\"}"},"index":{"kind":"number","value":883,"string":"883"}}},{"rowIdx":5197,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["To build RPM you will need several other packages:\n--------------------------------------------------","The popt library for option parsing, must be version 1.13 or later.\nIt is available from\n http://ftp.rpm.org/popt/","The debugedit >= 0.3 tools for producing debuginfo sub-packages.\nIt is available from\n https://sourceware.org/debugedit/","Lua >= 5.2 library + development environment.\nNote that only the library is needed at runtime, RPM never calls external\nLua interpreter for anything. Lua is available from\n http://www.lua.org","The zlib library for compression support. You might also need/want\nthe unzip executable for java jar dependency analysis. All available from\n http://www.gzip.org/zlib/","The libmagic (aka file) library for file type detection (used by rpmbuild). \nThe source for the file utility + library is available from\n ftp://ftp.astron.com/pub/file/","You will need a cryptographic library to support digests and signatures.\nThis library may be libgcrypt or OpenSSL, and can be specified with the\n--with-crypto=[libgcrypt|openssl] argument to configure.\nlibgcrypt is the default.","libgcrypt library is available from https://www.gnupg.org/software/libgcrypt/","If using the OpenSSL library for encryption, it must be version 1.0.2 or\nlater. Note: when compiling against OpenSSL, there is a possible license\nincompatibility. For more details on this, see\nhttps://people.gnome.org/~markmc/openssl-and-the-gpl.html\nSome Linux distributions have different legal interpretations of this\npossible incompatibility. It is recommended to consult with a lawyer before\nbuilding RPM against OpenSSL.\nFedora: https://fedoraproject.org/wiki/Licensing:FAQ#What.27s_the_deal_with_the_OpenSSL_license.3F\nDebian: https://lists.debian.org/debian-legal/2002/10/msg00113.html","The OpenSSL crypto library is available from https://www.openssl.org/","RPM needs a database engine for normal operation. The main options are\n\"ndb\" (--enable-ndb) and \"sqlite\" (--enable-sqlite).\nAdditionally standalone support for read-only BDB databases is available as\n\"bdb_ro\" (--enable-bdb-ro) to aid with migration from BDB.","The ndb and bdb_ro backends have no external dependencies.\nSQLite >= 3.22.0 is required for the sqlite database backend.\nSQLite is available from https://www.sqlite.org/","If SELinux support is desired, it can be enabled with --with-selinux option\nto configure and libselinux development environment installed. SELinux\nis available from\n http://www.nsa.gov/selinux/","It may be desired to install bzip2, gzip, and xz/lzma so that RPM can use these\nformats. Gzip is necessary to build packages that contain compressed\ntar balls, these are quite common on the Internet.\nThese are available from\n http://www.gzip.org\n http://www.bzip.org\n http://tukaani.org/xz/","If you want to build the Python bindings to RPM library, it can be enabled\nwith --enable-python option to configure. You'll need to have Python >= 3.1\nruntime and C API development environment installed.\nPython is available from:\n http://www.python.org/","To enable POSIX.1e draft 15 file capabilities support, configure with\n--with-cap. You'll also need recent libcap, available from:\n http://ftp.kernel.org/pub/linux/libs/security/linux-privs/libcap2/","To enable POSIX 1003.1e draft 17 ACL verification support, configure with\n--with-acl. You'll also need the ACL library, available from:\n ftp://oss.sgi.com/projects/xfs/cmd_tars/","For best results you should compile with GCC and GNU Make. Users have\nreported difficulty with other build tools (any patches to lift these\ndependencies are welcome). Both GCC and GNU Make available from \n http://www.gnu.org/","If National Language Support (NLS) is desired you will need gnu\ngettext (currently this is required to build rpm but we hope to \nlift this requirement soon), available from \n http://www.gnu.org/","If you are going to hack the sources (or compile from source repository)\nyou will need most of the GNU development tools including:\nautoconf, automake, gettext, libtool, makeinfo, perl, GNU m4, GNU tar\navailable from \n http://www.gnu.org/","If you plan on using cryptographic signatures you will need a version\nof GPG, available from\n http://www.gnupg.org/","OpenMP multithreading support is automatically enabled if your C compiler has\nsupport for OpenMP version 4.5 or higher (to disable, pass the --disable-openmp\noption to configure). For GCC, OpenMP 4.5 is fully supported since GCC 6.1,\nwhich is available from\n http://www.gnu.org/","\nRpm requires a POSIX.1-2008 level operating system.","\nTo compile RPM:\n--------------","RPM uses a small shell script to run: libtool, autoconf,\nautomake. This step should not be necessary if you are running a\nreleased version of rpm, however if you have gotten the rpm sources\ndirectly from the source code repository, you need to generate\nintermediate files by running the autogen.sh script.","The autogen.sh script checks that the required tools are installed.\nThe autogen.sh script also runs configure for you and passes the command line\narguments to configure. To run it without configure type:"," ./autogen.sh --noconfigure","If your libraries are not in a standard place you will need to change\nconfigures environment. These options can be passed directly to\nconfigure or to autogen.sh which will pass them through to configure.","Here is an example:\n LIBS='-L/opt/libz/ -L/opt/BerkeleyDB/lib/' \\\n CPPFLAGS='-I/opt/libz/ -I/opt/BerkeleyDB/include' \\\n ./configure","If you have build tools stored in non standard places you should check\nthe resulting Makefile to be sure that the tools you wish to use have\nbeen correctly identified. The configure script will modify your path\nbefore looking for the build tools and it may find versions of these\ntools that you do not want. It uses the following search path"," MYPATH=\"/bin:/usr/bin:/usr/local/bin:$PATH:/opt/gnu/bin\"","now build the system with:"," make","and then install with:"," make install","Rpm comes with an automated self-test suite. The test-suite relies heavily\non fakechroot (https://github.com/dex4er/fakechroot/) and cannot be executed\nwithout it. Provided that fakechroot was found during configure,\nit can be executed after a successful build with:"," make check","Finally, if you wish to prepare an rpm source tar ball, you should do"," make dist","To package RPM:\n--------------","After RPM has been installed you can run rpm to build an rpm package.\nEdit the rpm.spec file to mirror any special steps you needed to\nfollow to make rpm compile and change the specfile to match your\ntaste. You will need to put the rpm source tar file into the\nSOURCES directory and we suggest putting the specfile in the\nSPECS directory, then run rpmbuild -ba rpm.spec. You will end up\nwith two rpms which can be found in RPMS and SRPMS.","If you are going to install rpm on machines with OS package managers\nother then rpm, you may choose to install the base rpm package via a\ncpio instead of a tar file. Instead of running \"make tar\" during the\nbuild process, as described above, use the base rpm packages to create\na cpio. After the rpms have been created run rpm2cpio on the base rpm\npackage, this will give you a cpio package which can then use to\ninstall rpm on a new system."," rpm2cpio rpm-4.0-1.solaris2.6-sparc.rpm > rpm-4.0-1.solaris2.6-sparc.cpio","\nNon Linux Configuration Issues:\n------------------------------","\nOS dependencies:\n----------------","Under RPM based Linux distributions all libraries (in fact all files \ndistributed with the OS) are under RPM control and this section is not \nan issue.","RPM will need to be informed of all the dependencies which were\nsatisfied before RPM was installed. Typically this only refers to\nlibraries that are installed by the OS, but may include other\nlibraries and packages which are available at the time RPM is\ninstalled and will not under RPM control. Another common example of\nlibraries which may need dependency provisions are precompiled\nlibraries which are installed by the OS package manager during system\nbuild time. The list of dependencies you will wish to load into RPM\nwill depend on exactly how you bootstrap RPM onto your system and what\nparts of the system you put into packages as well as on the specific OS\nyou are using.","The script vpkg-provides.sh can be used to generate a package which\nwill satisfy the dependencies on your system. To run it you will need\nto create a specfile header for this empty package and run the progam\nwith:"," --spec_header '/path/to/os-base-header.spec","and if you wish to ensure that some directories are not traversed you\ncan use the option: "," --ignore_dirs 'grep-E|pattern|of|paths|to|ignore","By default the generated rpm will include a %verifyscript to verify\nchecksum of all files traversed has not changed. This additional\ncheck can be suppressed with:"," --no_verify","The result of running the script will be a specfile which will create\na package continging all the dependencies found on the system. There\nwill be one provides line for each depednecy. The package will contain\nnone of the actual OS library files as it is assumed they are already\non your system and managed by other means. Here is a example\n(truncated) of the provides lines used by one user of Digital Unix. (I\nhave put several provides on the same line for brevity)","provides: /bin/sh /usr/bin/ksh /usr/bin/csh \nprovides: libc.so.osf.1 libm.so.osf.1 libcurses.so.xpg4 libdb.so.osf.1\nprovides: libX11.so libXaw.so.6.0 libXext.so libXm.so.motif1.2 libXmu.so\nprovides: libdnet_stub.so.osf.1 libsecurity.so.osf.1 libpthread.so.osf.1\nprovides: libexc.so.osf.1 libmach.so.osf.1 libdps.so libdpstk.so ","\nThe script vpkg-provides2.sh is underdevelopment as a more advanced\nversion of vpkg-provides.sh which is aware of many different unix\nvendor packaging schemes. It will create one \"dependency package\" for\neach unix package your OS vendor installed.","\nrpmfilename:\n-----------","If you plan on packaging for more then one OS you may want to edit\n/etc/macros or /usr/lib/rpm/macros and change the line which has\nrpmfilename to something which include both the %{_target_os} and\n%{_target_cpu}. This will cause the name of the generated rpm files\nto the operating system name as well as the architecture which the rpm\nruns under. The line to change looks like:","%_rpmfilename %%{ARCH}/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{ARCH}.rpm","you may wish to include both the %{_target_os} and %{_target_cpu} in\nthe final base name, so that it's easier to distinguish between what\npackage is appropriate for a particular arch-os-version combo. We\nsuggest:","%_rpmfilename %%{_target_platform/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{_target_platform}.rpm","There is no %{_target_os_version} tag, so if you need to also\ndistinguish between RPMs for certain versions of the OS, you can\nhard-code the version in the rpmrc on the build machine, so that .rpm\nfiles are generated with the version as part of the filename.","For example when one user builds RPMs for Digital Unix 4.0b and 4.0d,\noptimization is important and he will build one set of RPMs for the\nEV4 processor and another set for the EV56 processor. He specifies\nboth the OS version (if it's important, as it is for a few packages)\nand the processor version by default by setting a special rpmfilename:\non the particular build machine.","The \"rpmfilename: \"tag on one machine (Digital Unix 4.0d, EV56 PWS 433)\nlooks like:","rpmfilename: %{_target_os}/4.0d/%{_target_cpu}/%{name}-%{version}-%{release}.%{_target_os}-%{_target_cpu}ev56.rpm","For package `foo-1.1', at build time that would translate into:"," osf1/4.0d/alpha/foo-1.1-1.osf1-alphaev56.rpm","The hyphen between the %{_target_cpu} and ev56 is left out for compatibility\nwith GNU Config.guess and because `alphaev56' looks more \"normal\" to\npeople with an alpha than alpha-ev56 for someone on an Intel Pentium\nPro would want `i586pro' over `i586-pro', but it does make parsing\nthis filename by other programs a bit more difficult.","\nGPG\n---","To use the signing features of rpm, you will need to configure certain\nrpm macros in ~/.rpmmacros:","\t%_gpg_name <GPG UID>\n\t%_gpg_path %(echo $HOME)/.gnupg"],"string":"[\n \"To build RPM you will need several other packages:\\n--------------------------------------------------\",\n \"The popt library for option parsing, must be version 1.13 or later.\\nIt is available from\\n http://ftp.rpm.org/popt/\",\n \"The debugedit >= 0.3 tools for producing debuginfo sub-packages.\\nIt is available from\\n https://sourceware.org/debugedit/\",\n \"Lua >= 5.2 library + development environment.\\nNote that only the library is needed at runtime, RPM never calls external\\nLua interpreter for anything. Lua is available from\\n http://www.lua.org\",\n \"The zlib library for compression support. You might also need/want\\nthe unzip executable for java jar dependency analysis. All available from\\n http://www.gzip.org/zlib/\",\n \"The libmagic (aka file) library for file type detection (used by rpmbuild). \\nThe source for the file utility + library is available from\\n ftp://ftp.astron.com/pub/file/\",\n \"You will need a cryptographic library to support digests and signatures.\\nThis library may be libgcrypt or OpenSSL, and can be specified with the\\n--with-crypto=[libgcrypt|openssl] argument to configure.\\nlibgcrypt is the default.\",\n \"libgcrypt library is available from https://www.gnupg.org/software/libgcrypt/\",\n \"If using the OpenSSL library for encryption, it must be version 1.0.2 or\\nlater. Note: when compiling against OpenSSL, there is a possible license\\nincompatibility. For more details on this, see\\nhttps://people.gnome.org/~markmc/openssl-and-the-gpl.html\\nSome Linux distributions have different legal interpretations of this\\npossible incompatibility. It is recommended to consult with a lawyer before\\nbuilding RPM against OpenSSL.\\nFedora: https://fedoraproject.org/wiki/Licensing:FAQ#What.27s_the_deal_with_the_OpenSSL_license.3F\\nDebian: https://lists.debian.org/debian-legal/2002/10/msg00113.html\",\n \"The OpenSSL crypto library is available from https://www.openssl.org/\",\n \"RPM needs a database engine for normal operation. The main options are\\n\\\"ndb\\\" (--enable-ndb) and \\\"sqlite\\\" (--enable-sqlite).\\nAdditionally standalone support for read-only BDB databases is available as\\n\\\"bdb_ro\\\" (--enable-bdb-ro) to aid with migration from BDB.\",\n \"The ndb and bdb_ro backends have no external dependencies.\\nSQLite >= 3.22.0 is required for the sqlite database backend.\\nSQLite is available from https://www.sqlite.org/\",\n \"If SELinux support is desired, it can be enabled with --with-selinux option\\nto configure and libselinux development environment installed. SELinux\\nis available from\\n http://www.nsa.gov/selinux/\",\n \"It may be desired to install bzip2, gzip, and xz/lzma so that RPM can use these\\nformats. Gzip is necessary to build packages that contain compressed\\ntar balls, these are quite common on the Internet.\\nThese are available from\\n http://www.gzip.org\\n http://www.bzip.org\\n http://tukaani.org/xz/\",\n \"If you want to build the Python bindings to RPM library, it can be enabled\\nwith --enable-python option to configure. You'll need to have Python >= 3.1\\nruntime and C API development environment installed.\\nPython is available from:\\n http://www.python.org/\",\n \"To enable POSIX.1e draft 15 file capabilities support, configure with\\n--with-cap. You'll also need recent libcap, available from:\\n http://ftp.kernel.org/pub/linux/libs/security/linux-privs/libcap2/\",\n \"To enable POSIX 1003.1e draft 17 ACL verification support, configure with\\n--with-acl. You'll also need the ACL library, available from:\\n ftp://oss.sgi.com/projects/xfs/cmd_tars/\",\n \"For best results you should compile with GCC and GNU Make. Users have\\nreported difficulty with other build tools (any patches to lift these\\ndependencies are welcome). Both GCC and GNU Make available from \\n http://www.gnu.org/\",\n \"If National Language Support (NLS) is desired you will need gnu\\ngettext (currently this is required to build rpm but we hope to \\nlift this requirement soon), available from \\n http://www.gnu.org/\",\n \"If you are going to hack the sources (or compile from source repository)\\nyou will need most of the GNU development tools including:\\nautoconf, automake, gettext, libtool, makeinfo, perl, GNU m4, GNU tar\\navailable from \\n http://www.gnu.org/\",\n \"If you plan on using cryptographic signatures you will need a version\\nof GPG, available from\\n http://www.gnupg.org/\",\n \"OpenMP multithreading support is automatically enabled if your C compiler has\\nsupport for OpenMP version 4.5 or higher (to disable, pass the --disable-openmp\\noption to configure). For GCC, OpenMP 4.5 is fully supported since GCC 6.1,\\nwhich is available from\\n http://www.gnu.org/\",\n \"\\nRpm requires a POSIX.1-2008 level operating system.\",\n \"\\nTo compile RPM:\\n--------------\",\n \"RPM uses a small shell script to run: libtool, autoconf,\\nautomake. This step should not be necessary if you are running a\\nreleased version of rpm, however if you have gotten the rpm sources\\ndirectly from the source code repository, you need to generate\\nintermediate files by running the autogen.sh script.\",\n \"The autogen.sh script checks that the required tools are installed.\\nThe autogen.sh script also runs configure for you and passes the command line\\narguments to configure. To run it without configure type:\",\n \" ./autogen.sh --noconfigure\",\n \"If your libraries are not in a standard place you will need to change\\nconfigures environment. These options can be passed directly to\\nconfigure or to autogen.sh which will pass them through to configure.\",\n \"Here is an example:\\n LIBS='-L/opt/libz/ -L/opt/BerkeleyDB/lib/' \\\\\\n CPPFLAGS='-I/opt/libz/ -I/opt/BerkeleyDB/include' \\\\\\n ./configure\",\n \"If you have build tools stored in non standard places you should check\\nthe resulting Makefile to be sure that the tools you wish to use have\\nbeen correctly identified. The configure script will modify your path\\nbefore looking for the build tools and it may find versions of these\\ntools that you do not want. It uses the following search path\",\n \" MYPATH=\\\"/bin:/usr/bin:/usr/local/bin:$PATH:/opt/gnu/bin\\\"\",\n \"now build the system with:\",\n \" make\",\n \"and then install with:\",\n \" make install\",\n \"Rpm comes with an automated self-test suite. The test-suite relies heavily\\non fakechroot (https://github.com/dex4er/fakechroot/) and cannot be executed\\nwithout it. Provided that fakechroot was found during configure,\\nit can be executed after a successful build with:\",\n \" make check\",\n \"Finally, if you wish to prepare an rpm source tar ball, you should do\",\n \" make dist\",\n \"To package RPM:\\n--------------\",\n \"After RPM has been installed you can run rpm to build an rpm package.\\nEdit the rpm.spec file to mirror any special steps you needed to\\nfollow to make rpm compile and change the specfile to match your\\ntaste. You will need to put the rpm source tar file into the\\nSOURCES directory and we suggest putting the specfile in the\\nSPECS directory, then run rpmbuild -ba rpm.spec. You will end up\\nwith two rpms which can be found in RPMS and SRPMS.\",\n \"If you are going to install rpm on machines with OS package managers\\nother then rpm, you may choose to install the base rpm package via a\\ncpio instead of a tar file. Instead of running \\\"make tar\\\" during the\\nbuild process, as described above, use the base rpm packages to create\\na cpio. After the rpms have been created run rpm2cpio on the base rpm\\npackage, this will give you a cpio package which can then use to\\ninstall rpm on a new system.\",\n \" rpm2cpio rpm-4.0-1.solaris2.6-sparc.rpm > rpm-4.0-1.solaris2.6-sparc.cpio\",\n \"\\nNon Linux Configuration Issues:\\n------------------------------\",\n \"\\nOS dependencies:\\n----------------\",\n \"Under RPM based Linux distributions all libraries (in fact all files \\ndistributed with the OS) are under RPM control and this section is not \\nan issue.\",\n \"RPM will need to be informed of all the dependencies which were\\nsatisfied before RPM was installed. Typically this only refers to\\nlibraries that are installed by the OS, but may include other\\nlibraries and packages which are available at the time RPM is\\ninstalled and will not under RPM control. Another common example of\\nlibraries which may need dependency provisions are precompiled\\nlibraries which are installed by the OS package manager during system\\nbuild time. The list of dependencies you will wish to load into RPM\\nwill depend on exactly how you bootstrap RPM onto your system and what\\nparts of the system you put into packages as well as on the specific OS\\nyou are using.\",\n \"The script vpkg-provides.sh can be used to generate a package which\\nwill satisfy the dependencies on your system. To run it you will need\\nto create a specfile header for this empty package and run the progam\\nwith:\",\n \" --spec_header '/path/to/os-base-header.spec\",\n \"and if you wish to ensure that some directories are not traversed you\\ncan use the option: \",\n \" --ignore_dirs 'grep-E|pattern|of|paths|to|ignore\",\n \"By default the generated rpm will include a %verifyscript to verify\\nchecksum of all files traversed has not changed. This additional\\ncheck can be suppressed with:\",\n \" --no_verify\",\n \"The result of running the script will be a specfile which will create\\na package continging all the dependencies found on the system. There\\nwill be one provides line for each depednecy. The package will contain\\nnone of the actual OS library files as it is assumed they are already\\non your system and managed by other means. Here is a example\\n(truncated) of the provides lines used by one user of Digital Unix. (I\\nhave put several provides on the same line for brevity)\",\n \"provides: /bin/sh /usr/bin/ksh /usr/bin/csh \\nprovides: libc.so.osf.1 libm.so.osf.1 libcurses.so.xpg4 libdb.so.osf.1\\nprovides: libX11.so libXaw.so.6.0 libXext.so libXm.so.motif1.2 libXmu.so\\nprovides: libdnet_stub.so.osf.1 libsecurity.so.osf.1 libpthread.so.osf.1\\nprovides: libexc.so.osf.1 libmach.so.osf.1 libdps.so libdpstk.so \",\n \"\\nThe script vpkg-provides2.sh is underdevelopment as a more advanced\\nversion of vpkg-provides.sh which is aware of many different unix\\nvendor packaging schemes. It will create one \\\"dependency package\\\" for\\neach unix package your OS vendor installed.\",\n \"\\nrpmfilename:\\n-----------\",\n \"If you plan on packaging for more then one OS you may want to edit\\n/etc/macros or /usr/lib/rpm/macros and change the line which has\\nrpmfilename to something which include both the %{_target_os} and\\n%{_target_cpu}. This will cause the name of the generated rpm files\\nto the operating system name as well as the architecture which the rpm\\nruns under. The line to change looks like:\",\n \"%_rpmfilename %%{ARCH}/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{ARCH}.rpm\",\n \"you may wish to include both the %{_target_os} and %{_target_cpu} in\\nthe final base name, so that it's easier to distinguish between what\\npackage is appropriate for a particular arch-os-version combo. We\\nsuggest:\",\n \"%_rpmfilename %%{_target_platform/%%{NAME}-%%{VERSION}-%%{RELEASE}.%%{_target_platform}.rpm\",\n \"There is no %{_target_os_version} tag, so if you need to also\\ndistinguish between RPMs for certain versions of the OS, you can\\nhard-code the version in the rpmrc on the build machine, so that .rpm\\nfiles are generated with the version as part of the filename.\",\n \"For example when one user builds RPMs for Digital Unix 4.0b and 4.0d,\\noptimization is important and he will build one set of RPMs for the\\nEV4 processor and another set for the EV56 processor. He specifies\\nboth the OS version (if it's important, as it is for a few packages)\\nand the processor version by default by setting a special rpmfilename:\\non the particular build machine.\",\n \"The \\\"rpmfilename: \\\"tag on one machine (Digital Unix 4.0d, EV56 PWS 433)\\nlooks like:\",\n \"rpmfilename: %{_target_os}/4.0d/%{_target_cpu}/%{name}-%{version}-%{release}.%{_target_os}-%{_target_cpu}ev56.rpm\",\n \"For package `foo-1.1', at build time that would translate into:\",\n \" osf1/4.0d/alpha/foo-1.1-1.osf1-alphaev56.rpm\",\n \"The hyphen between the %{_target_cpu} and ev56 is left out for compatibility\\nwith GNU Config.guess and because `alphaev56' looks more \\\"normal\\\" to\\npeople with an alpha than alpha-ev56 for someone on an Intel Pentium\\nPro would want `i586pro' over `i586-pro', but it does make parsing\\nthis filename by other programs a bit more difficult.\",\n \"\\nGPG\\n---\",\n \"To use the signing features of rpm, you will need to configure certain\\nrpm macros in ~/.rpmmacros:\",\n \"\\t%_gpg_name <GPG UID>\\n\\t%_gpg_path %(echo $HOME)/.gnupg\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [104, 584, 1024], \"buggy_code_start_loc\": [104, 583, 10], \"filenames\": [\"INSTALL\", \"configure.ac\", \"lib/fsm.c\"], \"fixing_code_end_loc\": [107, 585, 1157], \"fixing_code_start_loc\": [105, 583, 11], \"message\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:rpm:rpm:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"582D14B9-3812-42FD-9FA3-2BDEAA02DD6C\", \"versionEndExcluding\": \"4.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\"}, {\"lang\": \"es\", \"value\": \"Se ha detectado que la correcci\\u00f3n de CVE-2017-7500 y CVE-2017-7501 era incompleta: la comprobaci\\u00f3n s\\u00f3lo es implementada para el directorio padre del archivo que iba a crearse. Un usuario local no privilegiado que posea otro directorio antecesor podr\\u00eda usar este fallo para conseguir privilegios de root. La mayor amenaza de esta vulnerabilidad es para la confidencialidad e integridad de los datos, as\\u00ed como para la disponibilidad del sistema.\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-35939\", \"lastModified\": \"2023-02-04T01:16:51.737\", \"metrics\": {\"cvssMetricV2\": null, \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 6.7, \"baseSeverity\": \"MEDIUM\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"HIGH\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:H/UI:N/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 0.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-08-26T16:15:08.683\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://access.redhat.com/security/cve/CVE-2021-35939\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Exploit\", \"Issue Tracking\", \"Third Party Advisory\"], \"url\": \"https://bugzilla.redhat.com/show_bug.cgi?id=1964129\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/pull/1919\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Release Notes\", \"Vendor Advisory\"], \"url\": \"https://rpm.org/wiki/Releases/4.18.0\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202210-22\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, \"type\": \"CWE-59\"}"},"index":{"kind":"number","value":883,"string":"883"}}},{"rowIdx":5198,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["AC_PREREQ(2.61)\nAC_INIT(rpm, 4.17.90, rpm-maint@lists.rpm.org)","AC_CONFIG_SRCDIR([rpm.c])\nAC_CONFIG_HEADERS([config.h])\nAC_CONFIG_MACRO_DIR([m4])\nAC_CONFIG_AUX_DIR([build-aux])","AM_INIT_AUTOMAKE([1.10 foreign tar-pax dist-bzip2 subdir-objects nostdinc])\ndnl Allow silent build on automake versions that support it\nm4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES])","AC_CONFIG_TESTDIR(tests)","AC_USE_SYSTEM_EXTENSIONS","AC_DISABLE_STATIC","PKG_PROG_PKG_CONFIG","dnl Checks for programs.\nAC_PROG_CXX\nAC_PROG_AWK\nAC_PROG_CC\nAC_PROG_CPP\nAC_PROG_INSTALL\nAC_PROG_LN_S\nAC_PROG_MAKE_SET\nAC_PROG_LIBTOOL","AC_SUBST(__CC, $CC)\nAC_PROG_CC_C99\nif test \"$ac_cv_prog_cc_c99\" = no; then\n AC_MSG_ERROR([ISO C99 capable compiler required])\nfi","AS=${AS-as}\nAC_SUBST(AS)\nif test \"$GCC\" = yes; then\n cflags_to_try=\"-fno-strict-aliasing -fno-strict-overflow -fno-delete-null-pointer-checks -Wempty-body\"\n AC_MSG_CHECKING([supported compiler flags])\n old_cflags=$CFLAGS\n echo\n for flag in $cflags_to_try; do\n CFLAGS=\"$CFLAGS $flag -Werror\"\n AC_LINK_IFELSE([AC_LANG_PROGRAM([[]], [[#include <alloca.h>\n\t\t\t\t\t\talloca(100);]])],[\n echo \" $flag\"\n RPMCFLAGS=\"$RPMCFLAGS $flag\"\n ],[])\n CFLAGS=$old_cflags\n done\n RPMCFLAGS=\"-Wall -Wpointer-arith -Wmissing-prototypes -Wstrict-prototypes $RPMCFLAGS\"\nfi\nAC_ARG_ENABLE(werror, [AS_HELP_STRING([--enable-werror], [build with -Werror])],\n\t\t[RPMCFLAGS=\"$RPMCFLAGS -Werror\"], [])\nAC_SUBST(RPMCFLAGS)","AC_SYS_LARGEFILE","dnl AM_DISABLE_SHARED\nAM_PROG_LIBTOOL","AC_CHECK_TOOL(AR, ar, :)","dnl\ndnl use defaults if cross-compiling, otherwise use the default path.\ndnl\nif test \"$cross_compiling\" = \"yes\"; then\n MYPATH=\":\"\nelse\n MYPATH=$PATH\nfi","dnl\ndnl Find some common programs\ndnl\nAC_PATH_PROGS(__7ZIP, [7zip 7za 7z], /usr/bin/7za, $MYPATH)\nAC_PATH_PROG(__BZIP2, bzip2, /usr/bin/bzip2, $MYPATH)\nAC_PATH_PROG(__CAT, cat, /bin/cat, $MYPATH)\nAC_PATH_PROG(__CHMOD, chmod, /bin/chmod, $MYPATH)\nAC_PATH_PROG(__CHOWN, chown, /bin/chown, $MYPATH)\nAC_PATH_PROG(__CP, cp, /bin/cp, $MYPATH)\nAC_PATH_PROG(__CURL, curl, /usr/bin/curl, $MYPATH)\nAC_PATH_PROG(__FILE, file, /usr/bin/file, $MYPATH)\nAC_PATH_PROGS(__GPG, gpg2 gpg, /usr/bin/gpg2, $MYPATH)\nAC_PATH_PROG(__GREP, grep, /bin/grep, $MYPATH)\nAC_PATH_PROG(__GZIP, gzip, /bin/gzip, $MYPATH)\nAC_PATH_PROG(__UNZIP, unzip, /usr/bin/unzip, $MYPATH)\nAC_PATH_PROG(__ID, id, /usr/bin/id, $MYPATH)\nAC_PATH_PROG(__INSTALL, install, /usr/bin/install, $MYPATH)\nAC_PATH_PROG(__LRZIP, lrzip, /usr/bin/lrzip, $MYPATH)\nAC_PATH_PROG(__LZIP, lzip, /usr/bin/lzip, $MYPATH)\nAC_PATH_PROG(__XZ, xz, /usr/bin/xz, $MYPATH)\nAC_PATH_PROG(__GEM, gem, /usr/bin/gem, $MYPATH)\nAC_PATH_PROG(__MAKE, make, /usr/bin/make, $MYPATH)\nAC_PATH_PROG(__MKDIR, mkdir, /bin/mkdir, $MYPATH)\nAC_PATH_PROG(__MV, mv, /bin/mv, $MYPATH)\nAC_PATH_PROG(__PATCH, patch, /usr/bin/patch, $MYPATH)\nAC_PATH_PROG(__RM, rm, /bin/rm, $MYPATH)\nAC_PATH_PROG(__SED, sed, /bin/sed, $MYPATH)\nAC_PATH_PROG(__TAR, tar, /bin/tar, $MYPATH)\nAC_PATH_PROG(__ZSTD, zstd, /usr/bin/zstd, $MYPATH)","AC_PATH_PROG(__LD, ld, /usr/bin/ld, $MYPATH)\nAC_PATH_PROG(__OBJDUMP, objdump, /usr/bin/objdump, $MYPATH)\nAC_PATH_PROG(__STRIP, strip, /usr/bin/strip, $MYPATH)\nAC_PATH_PROG(__FIND_DEBUGINFO, find-debuginfo, /usr/bin/find-debuginfo, $MYPATH)","AC_PATH_PROG(__GIT, git, /usr/bin/git, $MYPATH)\nAC_PATH_PROG(__HG, hg, /usr/bin/hg, $MYPATH)\nAC_PATH_PROG(__BZR, bzr, /usr/bin/bzr, $MYPATH)\nAC_PATH_PROG(__QUILT, quilt, /usr/bin/quilt, $MYPATH)","AC_PATH_PROG(__FAKECHROOT, fakechroot, no, $MYPATH)\nAM_CONDITIONAL(HAVE_FAKECHROOT, [test \"$__FAKECHROOT\" != \"no\"])","dnl see if we have a mkdir that supports `-p' for rpmbuild's purposes\nAC_PROG_MKDIR_P\nif ! echo $MKDIR_P | grep -q mkdir; then \n __MKDIR_P=\"`echo ${prefix}/lib/rpm/mkinstalldirs`\"\nelse\n __MKDIR_P=$MKDIR_P\nfi\nAC_DEFINE_UNQUOTED(__MKDIR_P, \"${__MKDIR_P}\",\n[A full path to a program, possibly with arguments, that will create a\n directory and all necessary parent directories, ala 'mkdir -p'])\nAC_SUBST(__MKDIR_P)","#=================\n# Check for zlib library. ","WITH_ZLIB_INCLUDE=\nWITH_ZLIB_LIB=","AC_CHECK_HEADERS([zlib.h],[\n AS_IF([test -z \"${WITH_ZLIB_LIB}\"],[\n for zlib in z gz ; do\n AC_CHECK_LIB(${zlib}, gzread, \n\t[WITH_ZLIB_LIB=\"-l${zlib}\"; break])\n done","dnl zlib-1.0.4 has not gzseek\n AC_CHECK_LIB(${zlib}, gzseek, [AC_DEFINE(HAVE_GZSEEK, 1, [Define as 1 if your zlib has gzseek()])])\n ])\n],[\n AC_MSG_ERROR([missing required header zlib.h])\n])","AC_SUBST(WITH_ZLIB_INCLUDE)\nAC_SUBST(WITH_ZLIB_LIB)","#=================\n# Check for bzip2 library.","AC_CHECK_HEADERS([bzlib.h],[\n AC_CHECK_LIB(bz2, BZ2_bzread, [WITH_BZ2_LIB=-lbz2])\n])\nAC_SUBST(WITH_BZ2_LIB)","#=================\n# Check for lzma library.","AC_CHECK_HEADERS([lzma.h],[\n AC_CHECK_LIB(lzma, lzma_easy_encoder, [WITH_LZMA_LIB=-llzma])\n])\nAC_SUBST(WITH_LZMA_LIB)","# AC_OPENMP supports --enable/disable-openmp out of the box, but it doesn't\n# actually give us a way to conditionalize the build based on that. Argh.\n# Version 4.5 (201511) introduced \"priority\" clause for tasks.\nOPENMP_CFLAGS=\nAC_OPENMP\nAS_IF([test \"x$ac_cv_prog_c_openmp\" != x &&\n test \"x$ac_cv_prog_c_openmp\" != xunsupported],[\n old_CFLAGS=$CFLAGS\n CFLAGS=\"$CFLAGS $OPENMP_CFLAGS\"\n AC_MSG_CHECKING([OpenMP is at least version 4.5])\n AC_COMPILE_IFELSE(\n [AC_LANG_PROGRAM(\n [#include <omp.h>],\n [#if _OPENMP < 201511\n #error\n #endif\n ]\n )],\n [AC_MSG_RESULT([yes])\n AC_DEFINE(ENABLE_OPENMP, 1, [Enable multithreading support?])\n ],\n [AC_MSG_RESULT([no])\n OPENMP_CFLAGS=\n if test \"$enable_openmp\" = \"yes\"; then\n AC_MSG_ERROR([OpenMP too old])\n fi\n ]\n )\n CFLAGS=$old_CFLAGS\n])\nAC_SUBST(OPENMP_CFLAGS)","#=================\n# Check for zstd.","AC_ARG_ENABLE([zstd],\n [AS_HELP_STRING([--enable-zstd=@<:@yes/no/auto@:>@],\n [build without zstd support (default=auto)])],\n [enable_zstd=\"$enableval\"],\n [enable_zstd=auto])","AS_IF([test \"x$enable_zstd\" != \"xno\"], [\n PKG_CHECK_MODULES([ZSTD], [libzstd >= 1.3.8], [have_zstd=yes], [have_zstd=no])\n AS_IF([test \"$enable_zstd\" = \"yes\"], [\n if test \"$have_zstd\" = \"no\"; then\n AC_MSG_ERROR([--enable-zstd specified, but not available])\n fi\n ])\n])","if test \"x$have_zstd\" = \"xyes\"; then\n AC_DEFINE([HAVE_ZSTD], [1], [Define if libzstd is available])\n ZSTD_REQUIRES=libzstd\n AC_SUBST(ZSTD_REQUIRES)\nfi\nAM_CONDITIONAL([HAVE_ZSTD], [test \"x$have_zstd\" = \"xyes\"])","#=================","dnl\ndnl Check for features\ndnl","dnl Checks for libraries.","AC_CHECK_FUNC(gethostname, [], [\n AC_CHECK_LIB(nsl, gethostname)\n])","AC_CHECK_HEADERS(pthread.h)","AC_CHECK_LIB(pthread, pthread_mutex_trylock, [], [\n dnl OSF 5.0 has the the symbols prefixed with __ in libpthread.\n AC_CHECK_LIB(pthread, __pthread_mutex_trylock, [], [\n AC_CHECK_LIB(thread, mutex_lock)\n ])\n])","AC_SEARCH_LIBS(dlopen, [dl])","#=================\n# Check for libelf library. Prefer external, otherwise none.\nAC_ARG_ENABLE([libelf],\n\t\t[AS_HELP_STRING([--enable-libelf=@<:@yes/no/auto@:>@],\n\t\t\t\t[build with libelf support (default=yes)])],\n\t\t[enable_libelf=\"$enableval\"],\n\t\t[enable_libelf=yes])","AS_IF([test \"x$enable_libelf\" != \"xno\"], [\n WITH_LIBELF_LIB=\n AC_CHECK_HEADER([libelf.h])\n AC_CHECK_HEADERS([gelf.h], [\n AC_CHECK_LIB(elf, gelf_getvernaux, [\n AC_DEFINE(HAVE_LIBELF, 1, [Define to 1 if you have the 'elf' library (-lelf).])\n WITH_LIBELF_LIB=\"-lelf\"\n WITH_LIBELF=yes\n ])\n ])\n])\nAC_SUBST(WITH_LIBELF_LIB)\nAM_CONDITIONAL(LIBELF,[test \"$WITH_LIBELF\" = yes])","#=================\n# Select crypto library\nAC_ARG_WITH(crypto,\n [AC_HELP_STRING([--with-crypto=CRYPTO_LIB],\n [The cryptographic library to use (openssl|libgcrypt). The default is libgcrypt.])\n ],[],\n [with_crypto=libgcrypt])","#=================\n# Check for OpenSSL library.\n# We need evp.h from OpenSSL.","WITH_OPENSSL_INCLUDE=\nWITH_OPENSSL_LIB=\nif test \"$with_crypto\" = openssl; then\n# If we have pkgconfig make sure CPPFLAGS are setup correctly for the OpenSSL\n# -I include path.\nAC_PATH_TOOL([PKGCONFIG], [pkg-config], [no], [$PATH:/usr/bin:/usr/local/bin])\nif test \"x$PKGCONFIG\" != \"xno\"; then\n CPPFLAGS=\"$CPPFLAGS $($PKGCONFIG --cflags libcrypto)\"\n WITH_OPENSSL_LIB=$($PKGCONFIG --libs libcrypto)\nelse\n WITH_OPENSSL_LIB=-lcrypto\nfi","AC_CHECK_HEADERS([openssl/evp.h], [], [\n AC_MSG_ERROR([missing required OpenSSL header])\n])\nAC_CHECK_HEADERS([openssl/rsa.h], [], [\n AC_MSG_ERROR([missing required OpenSSL header])\n])\nAC_CHECK_HEADERS([openssl/dsa.h], [], [\n AC_MSG_ERROR([missing required OpenSSL header])\n])","AC_CHECK_LIB(crypto, EVP_DigestInit_ex, [], [\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\n])","AC_CHECK_LIB(crypto, EVP_MD_CTX_new, [\n AC_DEFINE(HAVE_EVP_MD_CTX_NEW, 1, [Define to 1 if OpenSSL has EVP_MD_CTX_new])\n AC_SUBST(HAVE_EVP_MD_CTX_NEW, [1])\n ], [\n AC_CHECK_LIB(crypto, EVP_MD_CTX_create, [], [\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\n ])\n])","AC_CHECK_LIB(crypto, EVP_PKEY_CTX_new, [], [\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\n])","AC_CHECK_LIB(crypto, DSA_set0_key, [\n AC_DEFINE(HAVE_DSA_SET0_KEY, 1, [Define to 1 if OpenSSL has DSA_set0_key])\n AC_SUBST(HAVE_DSA_SET0_KEY, [1])\n ], []\n)","AC_CHECK_LIB(crypto, DSA_set0_pqg, [\n AC_DEFINE(HAVE_DSA_SET0_PQG, 1, [Define to 1 if OpenSSL has DSA_set0_pqg])\n AC_SUBST(HAVE_DSA_SET0_PQG, [1])\n ], []\n)","AC_CHECK_LIB(crypto, DSA_SIG_set0, [\n AC_DEFINE(HAVE_DSA_SIG_SET0, 1, [Define to 1 if OpenSSL has DSA_SIG_set0])\n AC_SUBST(HAVE_DSA_SIG_SET0, [1])\n ], []\n)","AC_CHECK_LIB(crypto, RSA_set0_key, [\n AC_DEFINE(HAVE_RSA_SET0_KEY, 1, [Define to 1 if OpenSSL has RSA_set0_key])\n AC_SUBST(HAVE_RSA_SET0_KEY, [1])\n ], []\n)","AC_CHECK_LIB(crypto, BN_bn2binpad, [\n AC_DEFINE(HAVE_BN2BINPAD, 1, [Define to 1 if OpenSSL has BN_bn2binpad])\n AC_SUBST(HAVE_BN2BINPAD, [1])\n ], []\n)","fi","AM_CONDITIONAL([WITH_OPENSSL],[test \"$with_crypto\" = openssl])\nAC_SUBST(WITH_OPENSSL_INCLUDE)\nAC_SUBST(WITH_OPENSSL_LIB)","#=================\n# Check for libgcrypt library.\nWITH_LIBGCRYPT_INCLUDE=\nWITH_LIBGCRYPT_LIB=\nif test \"$with_crypto\" = libgcrypt ; then\n # libgcrypt 1.8.5 onwards ships a pkg-config file so prefer that\n PKG_CHECK_MODULES([LIBGCRYPT], [libgcrypt], [have_libgcrypt=yes], [have_libgcrypt=no])\n if test \"$have_libgcrypt\" = \"yes\"; then\n WITH_LIBGCRYPT_INCLUDE=\"$LIBGCRYPT_CFLAGS\"\n WITH_LIBGCRYPT_LIB=\"$LIBGCRYPT_LIBS\"\n else\n AC_PATH_TOOL(LIBGCRYPT_CONFIG, libgcrypt-config, notfound)\n if test notfound != \"$LIBGCRYPT_CONFIG\" ; then\n WITH_LIBGCRYPT_INCLUDE=`$LIBGCRYPT_CONFIG --cflags`\n WITH_LIBGCRYPT_LIB=`$LIBGCRYPT_CONFIG --libs`\n fi\n if test -z \"$WITH_LIBGCRYPT_LIB\" ; then\n AC_MSG_ERROR([libgcrypt not found])\n fi\n fi\nfi","AM_CONDITIONAL([WITH_LIBGCRYPT],[test \"$with_crypto\" = libgcrypt])\nAC_SUBST(WITH_LIBGCRYPT_INCLUDE)\nAC_SUBST(WITH_LIBGCRYPT_LIB)","#=================\n# Check for magic library.\nWITH_MAGIC_INCLUDE=\nWITH_MAGIC_LIB=","AC_CHECK_HEADER([magic.h], [\n AC_CHECK_LIB(magic, magic_open, [\n WITH_MAGIC_INCLUDE=\n WITH_MAGIC_LIB=\"-lmagic\"\n ],[\n AC_MSG_ERROR([missing required library 'libmagic']) \n ])\n],[\n AC_MSG_ERROR([missing required header magic.h]) \n])","AC_SUBST(WITH_MAGIC_INCLUDE)\nAC_SUBST(WITH_MAGIC_LIB)","#=================\n# Check for popt library.\nWITH_POPT_INCLUDE=\nWITH_POPT_LIB=","AC_CHECK_HEADER([popt.h], [\n AC_CHECK_LIB(popt, poptGetContext, [\n WITH_POPT_INCLUDE=\n WITH_POPT_LIB=\"-lpopt\"\n ],[\n AC_MSG_ERROR([missing required library popt])\n ])\n],[\n AC_MSG_ERROR([missing required header popt.h])\n])","AC_SUBST(WITH_POPT_INCLUDE)\nAC_SUBST(WITH_POPT_LIB)","#=================\n# Check for libarchive library.\nAC_ARG_WITH([archive], [AS_HELP_STRING([--with-archive], [build rpm2archive - requires libarchive])],\n [],\n [with_archive=yes])","WITH_ARCHIVE_INCLUDE=\nWITH_ARCHIVE_LIB=\nAS_IF([test \"$with_archive\" != no],[\n AC_CHECK_HEADER([archive.h], [\n AC_CHECK_LIB(archive, archive_write_open_filename, [\n WITH_ARCHIVE_INCLUDE=\n WITH_ARCHIVE_LIB=\"-larchive\"\n ],[\n AC_MSG_ERROR([missing required library 'libarchive'])\n ])\n],[\n AC_MSG_ERROR([missing required header archive.h])\n ])\n])","AC_SUBST(WITH_ARCHIVE_INCLUDE)\nAC_SUBST(WITH_ARCHIVE_LIB)\nAM_CONDITIONAL(WITH_ARCHIVE,[test \"$with_archive\" = yes])","#=================\n# Check for elfutils libdw library with dwelf_elf_gnu_build_id.\nAS_IF([test \"x$enable_libelf\" != \"xno\"], [\n WITH_LIBDW_LIB=\n AS_IF([test \"$WITH_LIBELF\" = yes],[\n AC_CHECK_HEADERS([elfutils/libdwelf.h],[\n # dwelf_elf_gnu_build_id was introduced in elfutils 0.159\n AC_CHECK_LIB(dw, dwelf_elf_gnu_build_id, [\n AC_DEFINE(HAVE_LIBDW, 1,\n [Define to 1 if you have elfutils libdw library])\n WITH_LIBDW_LIB=\"-ldw\"\n WITH_LIBDW=yes\n # whether libdw supports compressed ELF objects\n AC_CHECK_LIB(dw, dwelf_elf_begin, [\n AC_DEFINE(HAVE_DWELF_ELF_BEGIN, 1, [Have dwelf_elf_begin?])\n ])\n ])\n ])\n ])\n])\nAC_SUBST(WITH_LIBDW_LIB)\nAM_CONDITIONAL(LIBDW,[test \"$WITH_LIBDW\" = yes])","#=================\n# Process --enable-ndb\nAC_ARG_ENABLE([ndb], [AS_HELP_STRING([--enable-ndb],[enable the new rpm database format])],\n[case \"$enable_ndb\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --enable-ndb])\n ;;\nesac],\n[enable_ndb=no])\nAS_IF([test \"$enable_ndb\" = yes],[\n AC_DEFINE(ENABLE_NDB, 1, [Enable new rpm database format?])\n AC_CHECK_FUNCS(mremap, [], [], [#include <sys/mman.h>])\n])\nAM_CONDITIONAL([NDB], [test \"$enable_ndb\" = yes])","#=================\n# Process --enable-bdb-ro\nAC_ARG_ENABLE([bdb-ro], [AS_HELP_STRING([--enable-bdb-ro (EXPERIMENTAL)],[enable the read-only Berkeley DB code])],\n[case \"$enable_bdb_ro\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --enable-bdb-ro])\n ;;\nesac],\n[enable_bdb_ro=no])\nAS_IF([test \"$enable_bdb_ro\" = yes],[\n AC_DEFINE(WITH_BDB_RO, 1, [Build with read-only Berkeley DB])\n])\nAM_CONDITIONAL([BDB_RO], [test \"$enable_bdb_ro\" = yes])","# Check for SQLITE support\nAC_ARG_ENABLE([sqlite],\n [AS_HELP_STRING([--enable-sqlite=@<:@yes/no/auto@:>@)],\n [build with sqlite rpm database format support (default=yes)])],\n [enable_sqlite=\"$enableval\"],\n [enable_sqlite=yes])","AS_IF([test \"x$enable_sqlite\" != \"xno\"], [\n PKG_CHECK_MODULES([SQLITE], [sqlite3 >= 3.22.0], [have_sqlite=yes], [have_sqlite=no])\n AS_IF([test \"$enable_sqlite\" = \"yes\"], [\n if test \"$have_sqlite\" = \"no\"; then\n AC_MSG_ERROR([--enable-sqlite specified, but not available])\n fi\n ])\n])","if test \"x$have_sqlite\" = \"xyes\"; then\n AC_DEFINE([WITH_SQLITE], [1], [Define if SQLITE is available])\n SQLITE_REQUIRES=sqlite\n AC_SUBST(SQLITE_REQUIRES)\nfi\nAM_CONDITIONAL([SQLITE], [test \"x$have_sqlite\" = \"xyes\"])","AM_GNU_GETTEXT_VERSION([0.18.2])\nAM_GNU_GETTEXT([external])\nAM_ICONV","dnl Checks for header files we can live without.\nAC_HEADER_STDC\ndnl glibc and autoconf don't really play well together.\ndnl glibc will produce a warning when including the wrong header.\ndnl but still define major and minor. Causing us to include the header\ndnl that produces a giant warning for each major/minor use.\ndnl Use -Werror to work around that.\nold_CFLAGS=$CFLAGS\nCFLAGS=\"$CFLAGS -Werror\"\nAC_HEADER_MAJOR\nCFLAGS=$old_CFLAGS\nAC_STRUCT_DIRENT_D_TYPE","AC_CHECK_HEADERS(limits.h)\nAC_CHECK_HEADERS(getopt.h)","AC_CHECK_HEADERS(sys/utsname.h)","AC_CHECK_HEADERS(sys/systemcfg.h)\nAC_CHECK_HEADERS(sys/param.h)\nAC_CHECK_HEADERS(sys/auxv.h)","dnl look for libc features","dnl Check for missing typedefs\nAC_TYPE_MODE_T\nAC_TYPE_OFF_T\nAC_TYPE_PID_T\nAC_TYPE_SIZE_T","dnl Checks for library functions.\nAC_CHECK_FUNCS(putenv)\nAC_CHECK_FUNCS(mempcpy)\nAC_CHECK_FUNCS(fdatasync)\nAC_CHECK_DECLS(fdatasync, [], [], [#include <unistd.h>])\nAC_CHECK_FUNCS(lutimes)\nAC_CHECK_FUNCS(mergesort)\nAC_CHECK_FUNCS(getauxval)\nAC_CHECK_FUNCS(setprogname, [], [], [#include <stdlib.h>])\nAC_CHECK_FUNCS(syncfs)\nAC_CHECK_FUNCS(sched_getaffinity, [], [], [#include <sched.h>])\nAC_CHECK_FUNCS(unshare, [], [], [#include <sched.h>])","AC_MSG_CHECKING([whether __progname is defined])\nAC_LINK_IFELSE([AC_LANG_PROGRAM([extern const char *__progname;],\n\t [if (*__progname == 0) return 0;])],\n\t AC_DEFINE([HAVE___PROGNAME], [1], [Define if __progname is defined])\n\t AC_MSG_RESULT([yes]),\n\t AC_MSG_RESULT([no]))","AC_REPLACE_FUNCS(stpcpy stpncpy)","AC_CHECK_FUNCS([secure_getenv __secure_getenv])","AC_CHECK_FUNCS(\n [mkstemp getcwd basename dirname realpath setenv unsetenv regcomp lchown \\"," utimes getline localtime_r statvfs getaddrinfo ],"," [], [AC_MSG_ERROR([function required by rpm])])","AC_LIBOBJ(fnmatch)","dnl check if python is requested\nAC_ARG_ENABLE(python, [AS_HELP_STRING([--enable-python],[build rpm python bindings])],\n[case \"$enable_python\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --enable-python])\n ;;\nesac],\n[enable_python=no])","WITH_PYTHON_SUBPACKAGE=0\nAS_IF([test \"$enable_python\" = yes],[\n PYTHON=\"${PYTHON:-python3}\"\n AM_PATH_PYTHON([3.1],[\n PKG_CHECK_MODULES([PYTHON], [python-${PYTHON_VERSION}], [WITH_PYTHON_SUBPACKAGE=1])\n AC_SUBST(PYTHON_CFLAGS)\n AC_SUBST(PYTHON_LIB)\n ])\n])","AM_CONDITIONAL(ENABLE_PYTHON,[test \"$WITH_PYTHON_SUBPACKAGE\" = 1])","AC_PATH_PROG(DOXYGEN, doxygen, no)\nAC_CHECK_PROG(HAVE_DOT,[dot],[YES],[NO])\nAC_PATH_PROG(PANDOC, pandoc, no)","WITH_SELINUX_LIB=\nAC_ARG_WITH(selinux, [AS_HELP_STRING([--with-selinux],[build with selinux support])],\n[case \"$with_selinux\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --with-selinux])\n ;;\nesac],\n[with_selinux=no])","AS_IF([test \"$with_selinux\" = yes],[\n AC_CHECK_HEADER([selinux/selinux.h],[\n save_LIBS=\"$LIBS\"\n AC_CHECK_LIB([selinux],[is_selinux_enabled],[],[\n AC_MSG_ERROR([--with-selinux given, but is_selinux_enabled not found in libselinux])])\n AC_CHECK_LIB([selinux],[selinux_getpolicytype],[],[\n AC_MSG_ERROR([--with-selinux given, but selinux_getpolicytype not found in libselinux])])\n AC_CHECK_LIB([selinux],[selinux_reset_config],[],[\n AC_MSG_ERROR([--with-selinux given, but selinux_reset_config not found in libselinux])])\n AC_CHECK_LIB([selinux],[setexecfilecon],[\n AC_DEFINE([HAVE_SETEXECFILECON],[1],[Define to 1 if SELinux setexecfilecon is present])])\n LIBS=\"$save_LIBS\"\n ],[\n AC_MSG_ERROR([--with-selinux given, but selinux/selinux.h not found])\n ])"," AC_CHECK_HEADER([selinux/label.h],[\n save_LIBS=\"$LIBS\"\n AC_CHECK_LIB([selinux],[selabel_close],[],[\n AC_MSG_ERROR([--with-selinux given, but selabel_close not found in libselinux])])\n AC_CHECK_LIB([selinux],[selabel_lookup_raw],[],[\n AC_MSG_ERROR([--with-selinux given, but selabel_lookup_raw not found in libselinux])])\n AC_CHECK_LIB([selinux],[selabel_open],[],[\n AC_MSG_ERROR([--with-selinux given, but selabel_open not found in libselinux])])\n LIBS=\"$save_LIBS\"\n ],[\n AC_MSG_ERROR([--with-selinux given, but selinux/label.h not found])\n ])\n])","AS_IF([test \"$with_selinux\" = yes],[\n AC_DEFINE(WITH_SELINUX, 1, [Build with selinux support?])\n WITH_SELINUX_LIB=\"-lselinux\"\n])\nAC_SUBST(WITH_SELINUX_LIB)\nAC_SUBST(WITH_SEMANAGE_LIB)\nAM_CONDITIONAL(SELINUX,[test \"$with_selinux\" = yes])","# libimaevm\nwith_iamevm=no\nAC_ARG_WITH(imaevm, [AS_HELP_STRING([--with-imaevm],[build with imaevm support])])\nif test \"$with_imaevm\" = yes ; then\n AC_MSG_CHECKING([libimaevm >= 1.0])\n AC_COMPILE_IFELSE(\n [AC_LANG_PROGRAM(\n [[#include <imaevm.h>]],\n [[return sign_hash(NULL, NULL, 0, NULL, NULL, NULL);]]\n )],\n [AC_MSG_RESULT(yes)\n AC_DEFINE(WITH_IMAEVM, 1, [Build with imaevm support?])\n WITH_IMAEVM_LIB=\"-limaevm\"\n ],\n [AC_MSG_ERROR([libimaevm not present or too old (< 1.0)])]\n )\nfi\nAM_CONDITIONAL(WITH_IMAEVM,[test \"$with_imaevm\" = yes])\nAC_SUBST(WITH_IMAEVM_LIB)","# fsverity\nAC_ARG_WITH([fsverity], [AS_HELP_STRING([--with-fsverity],[build with fsverity support])],[],[with_fsverity=no])\nif test \"$with_fsverity\" = yes ; then\n AC_MSG_CHECKING([libfsverity])\n AC_COMPILE_IFELSE(\n [AC_LANG_PROGRAM(\n [[#include <libfsverity.h>]],\n [[return libfsverity_sign_digest(NULL, NULL, NULL, NULL);]]\n )],\n [AC_MSG_RESULT(yes)\n AC_DEFINE(WITH_FSVERITY, 1, [Build with fsverity support?])\n WITH_FSVERITY_LIB=\"-lfsverity\"\n ],\n [AC_MSG_ERROR([--with-fsverity given, libfsverity or libfsverity.h missing])]\n )\nfi\nAM_CONDITIONAL(WITH_FSVERITY,[test \"$with_fsverity\" = yes])\nAC_SUBST(WITH_FSVERITY_LIB)","# libcap\nWITH_CAP_LIB=\nAC_ARG_WITH(cap, [AS_HELP_STRING([--with-cap],[build with capability support])],\n[case \"$with_cap\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --with-cap])\n ;;\nesac],\n[with_cap=no])","AS_IF([test \"$with_cap\" = yes],[\n AC_CHECK_HEADER([sys/capability.h],[\n AC_CHECK_LIB(cap,[cap_get_file], [\n with_cap=yes\n save_LIBS=\"$LIBS\"\n AC_CHECK_LIB(cap,[cap_compare], [\n AC_DEFINE(HAVE_CAP_COMPARE, 1, [Have cap_compare function?])\n ])\n LIBS=\"$save_LIBS\"\n ],[\n AC_MSG_ERROR([--with-cap given, but libcap not found])])\n ],[\n AC_MSG_ERROR([--with-cap given, but sys/capability.h not found])\n ])\n])","AS_IF([test \"$with_cap\" = yes],[\n AC_DEFINE(WITH_CAP, 1, [Build with capability support?])\n WITH_CAP_LIB=\"-lcap\"\n])\nAC_SUBST(WITH_CAP_LIB)\nAM_CONDITIONAL(CAP,[test \"$with_cap\" = yes])","WITH_ACL_LIB=\nAC_ARG_WITH(acl, [AS_HELP_STRING([--with-acl],[build with acl support])],\n[case \"$with_acl\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --with-acl])\n ;;\nesac],\n[with_acl=no])","AS_IF([test \"$with_acl\" = yes],[\n dnl verification uses non-portable acl_equiv_mode() \n AC_CHECK_HEADER([acl/libacl.h],[\n AC_CHECK_LIB(acl,[acl_equiv_mode],[with_acl=yes],[\n AC_MSG_ERROR([--with-acl given, but libacl not found or not suitable])])\n ],[\n AC_MSG_ERROR([--with-acl given, but acl/libacl.h not found])\n ])\n])","AS_IF([test \"$with_acl\" = yes],[\n AC_DEFINE(WITH_ACL, 1, [Build with acl support?])\n WITH_ACL_LIB=\"-lacl\"\n])\nAC_SUBST(WITH_ACL_LIB)\nAM_CONDITIONAL(ACL,[test \"$with_acl\" = yes])","PKG_CHECK_MODULES([LUA],\n [lua >= 5.2],\n [],\n [AC_MSG_ERROR([lua not present or too old)])])\nAC_SUBST(LUA_CFLAGS)\nAC_SUBST(LUA_LIBS)","AC_ARG_WITH([readline],[AS_HELP_STRING([--with-readline=@<:@yes/no/auto@:>@], [build with readline support])], [with_readline=\"$withval\"], [with_readline=\"auto\"])\nAS_IF([test \"$with_readline\" != \"no\"],[\n PKG_CHECK_MODULES([READLINE], [readline], [have_readline=yes], [have_readline=no])\n AS_IF([test \"$with_readline\" = \"yes\"],[\n if test \"$have_readline\" = \"no\"; then\n AC_MSG_ERROR([readline support requested but not present])\n fi\n ])\n])\nif test \"$have_readline\" = \"yes\"; then\n AC_DEFINE([HAVE_READLINE], [1], [Define if readline is available])\n AC_SUBST(READLINE_CFLAGS)\n AC_SUBST(READLINE_LIBS)\nfi\nAM_CONDITIONAL(WITH_READLINE, [test \"$have_readline\" = yes])","\nAC_ARG_ENABLE(plugins, [AS_HELP_STRING([--disable-plugins],[build without plugin support])],,[enable_plugins=yes])\nAS_IF([test \"$enable_plugins\" = yes],[\n AC_DEFINE(ENABLE_PLUGINS, 1, [Build with plugin support?])\n])\nAM_CONDITIONAL(ENABLE_PLUGINS,[test \"$enable_plugins\" = yes])","AC_ARG_ENABLE(inhibit_plugin, [AS_HELP_STRING([--disable-inhibit-plugin],[build without systemd inhibit plugin])],,[enable_inhibit_plugin=yes])\nAS_IF([test \"$enable_inhibit_plugin\" = yes],[\n AC_DEFINE(ENABLE_INHIBIT_PLUGIN, 1, [Build with systemd inhibit plugin?])\n])\nAM_CONDITIONAL(ENABLE_INHIBIT_PLUGIN,[test \"$enable_inhibit_plugin\" = yes])","with_dbus=no\nAS_IF([test \"$enable_plugins\" != no],[\n AS_IF([test \"$enable_inhibit_plugin\" != no],[\n PKG_CHECK_MODULES([DBUS],\n [dbus-1 >= 1.3],\n [AC_DEFINE(DBUS, 1, [Build with dbus support?]) with_dbus=yes],\n [with_dbus=no])\n AC_SUBST(DBUS_CFLAGS)\n AC_SUBST(DBUS_LIBS)\n ])\n])\nAM_CONDITIONAL(DBUS, [test \"$with_dbus\" = yes])","AS_IF([test \"$enable_plugins\" != no],[\n AC_CHECK_FUNCS(lsetxattr, [], [], [#include <sys/xattr.h>])\n])\nAM_CONDITIONAL(IMA, [test \"x$ac_cv_func_lsetxattr\" = xyes])","AS_IF([test \"$enable_plugins\" != no],[\nAC_CHECK_HEADERS([linux/fsverity.h],[FSVERITY_IOCTL=\"yes\"])\n])\nAM_CONDITIONAL(FSVERITY_IOCTL,[test \"x$FSVERITY_IOCTL\" = xyes])","#=================\n# Check for fapolicyd support\nAC_ARG_WITH(fapolicyd,\nAS_HELP_STRING([--with-fapolicyd],[build with File Access Policy Daemon support]),\nwith_fapolicyd=$withval,\nwith_fapolicyd=auto)\nAM_CONDITIONAL(FAPOLICYD,[test \"$with_fapolicyd\" = yes])","#=================\n# Check for audit library.\nAC_ARG_WITH(audit,\nAS_HELP_STRING([--with-audit],[Linux audit plugin]),\nwith_audit=$withval,\nwith_audit=auto)","WITH_AUDIT_LIB=\nAS_IF([test \"$enable_plugins\" != no],[\n AS_IF([test \"x$with_audit\" != xno],[\n AC_SEARCH_LIBS([audit_open],[audit],[\n WITH_AUDIT_LIB=\"$ac_res\"\n AC_DEFINE(WITH_AUDIT, 1, [libaudit support])\n with_audit=yes\n ],[\n if test \"x$with_audit\" != xauto; then\n AC_MSG_ERROR([missing audit library])\n fi\n ])\n ])\n])\nAC_SUBST(WITH_AUDIT_LIB)\nAM_CONDITIONAL(AUDIT,[test \"$with_audit\" = yes])","user_with_uid0=$(awk -F: '$3==0 {print $1;exit}' /etc/passwd)\ngroup_with_gid0=$(awk -F: '$3==0 {print $1;exit}' /etc/group)\nif test -z \"$user_with_uid0\" ; then user_with_uid0=root ; fi\nif test -z \"$group_with_gid0\" ; then group_with_gid0=root ; fi\nAC_DEFINE_UNQUOTED([UID_0_USER],[\"$user_with_uid0\"],[Get the user name having userid 0])\nAC_DEFINE_UNQUOTED([GID_0_GROUP],[\"$group_with_gid0\"],[Get the group name having groupid 0])","#\n# get rid of the 4-th tuple, if config.guess returned \"linux-gnu\" for host_os\n#\nhost_os_gnu=-gnu\nif echo \"$host_os\" | grep '.*-gnulibc1$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnulibc1$//'`\nfi\nif echo \"$host_os\" | grep '.*-gnueabihf$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnueabihf$//'`\n\thost_os_gnu=-gnueabihf\nfi\nif echo \"$host_os\" | grep '.*-gnueabi$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnueabi$//'`\n\thost_os_gnu=-gnueabi\nfi\nif echo \"$host_os\" | grep '.*-gnuabi64$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnuabi64$//'`\n\thost_os_gnu=-gnuabi64\nfi\nif echo \"$host_os\" | grep '.*-gnu$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnu$//'`\nfi\nif echo \"$host_os\" | grep '.*-gnu[[^-]]*$' > /dev/null ; then\n\tAC_MSG_ERROR([unrecognized GNU build triplet $host_os])\nfi","changequote(<, >)\nhost_os_exact=\"${host_os}\"\nhost_os_major=`echo \"${host_os}\" | sed 's/\\..*$//'`\nhost_os_noversion=`echo \"${host_os}\" | sed 's/[0-9]*\\..*$//'`\nchangequote([, ])","dnl permit overriding build_vendor for \"canonical rpm vendor\"\nRPMCANONVENDOR=\"$build_vendor\"\nAC_ARG_WITH([vendor], \n AS_HELP_STRING([--with-vendor=VENDOR], [specify rpm vendor name]),\n [RPMCANONVENDOR=$withval])\nAC_DEFINE_UNQUOTED([RPMCANONVENDOR],[\"${RPMCANONVENDOR}\"],[canonical vendor])\n\t \nRPMCANONOS=\"$host_os_noversion\"\nRPMCANONGNU=\"$host_os_gnu\"\nAC_SUBST(RPMCANONVENDOR)\nAC_SUBST(RPMCANONOS)\nAC_SUBST(RPMCANONGNU)","RUNDIR=\"/run\"\nAC_ARG_WITH([rundir], \n AS_HELP_STRING([--with-rundir=RUNDIR], [specify run-time variable directory]),\n [RUNDIR=$withval])\nAC_DEFINE_UNQUOTED([RUNDIR],[\"${RUNDIR}\"],[run-time variable directory])\nAC_SUBST(RUNDIR)","if test X\"$prefix\" = XNONE ; then\n usrprefix=\"$ac_default_prefix\"\nelse\n usrprefix=$prefix\nfi","RPMCONFIGDIR=\"`echo ${usrprefix}/lib/rpm`\"\nAC_SUBST(RPMCONFIGDIR)","AC_SUBST(OBJDUMP)","AM_CONDITIONAL([DOXYGEN],[test \"$DOXYGEN\" != no])\nAM_CONDITIONAL([PANDOC],[test \"$PANDOC\" != no])","AC_PATH_PROG(AUTOM4TE,autom4te,:)","AC_SUBST([dirstamp],[\\${am__leading_dot}dirstamp])","AC_CONFIG_FILES([Makefile\n\trpmio/Makefile lib/Makefile build/Makefile sign/Makefile\n\tpo/Makefile.in scripts/Makefile fileattrs/Makefile\n\tmisc/Makefile \n\tdocs/Makefile\n\tdocs/man/Makefile\n\tpython/Makefile\n \tluaext/Makefile\n \ttests/Makefile\n \tplugins/Makefile\n\tpython/setup.py\n ])\nAC_OUTPUT"],"string":"[\n \"AC_PREREQ(2.61)\\nAC_INIT(rpm, 4.17.90, rpm-maint@lists.rpm.org)\",\n \"AC_CONFIG_SRCDIR([rpm.c])\\nAC_CONFIG_HEADERS([config.h])\\nAC_CONFIG_MACRO_DIR([m4])\\nAC_CONFIG_AUX_DIR([build-aux])\",\n \"AM_INIT_AUTOMAKE([1.10 foreign tar-pax dist-bzip2 subdir-objects nostdinc])\\ndnl Allow silent build on automake versions that support it\\nm4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES])\",\n \"AC_CONFIG_TESTDIR(tests)\",\n \"AC_USE_SYSTEM_EXTENSIONS\",\n \"AC_DISABLE_STATIC\",\n \"PKG_PROG_PKG_CONFIG\",\n \"dnl Checks for programs.\\nAC_PROG_CXX\\nAC_PROG_AWK\\nAC_PROG_CC\\nAC_PROG_CPP\\nAC_PROG_INSTALL\\nAC_PROG_LN_S\\nAC_PROG_MAKE_SET\\nAC_PROG_LIBTOOL\",\n \"AC_SUBST(__CC, $CC)\\nAC_PROG_CC_C99\\nif test \\\"$ac_cv_prog_cc_c99\\\" = no; then\\n AC_MSG_ERROR([ISO C99 capable compiler required])\\nfi\",\n \"AS=${AS-as}\\nAC_SUBST(AS)\\nif test \\\"$GCC\\\" = yes; then\\n cflags_to_try=\\\"-fno-strict-aliasing -fno-strict-overflow -fno-delete-null-pointer-checks -Wempty-body\\\"\\n AC_MSG_CHECKING([supported compiler flags])\\n old_cflags=$CFLAGS\\n echo\\n for flag in $cflags_to_try; do\\n CFLAGS=\\\"$CFLAGS $flag -Werror\\\"\\n AC_LINK_IFELSE([AC_LANG_PROGRAM([[]], [[#include <alloca.h>\\n\\t\\t\\t\\t\\t\\talloca(100);]])],[\\n echo \\\" $flag\\\"\\n RPMCFLAGS=\\\"$RPMCFLAGS $flag\\\"\\n ],[])\\n CFLAGS=$old_cflags\\n done\\n RPMCFLAGS=\\\"-Wall -Wpointer-arith -Wmissing-prototypes -Wstrict-prototypes $RPMCFLAGS\\\"\\nfi\\nAC_ARG_ENABLE(werror, [AS_HELP_STRING([--enable-werror], [build with -Werror])],\\n\\t\\t[RPMCFLAGS=\\\"$RPMCFLAGS -Werror\\\"], [])\\nAC_SUBST(RPMCFLAGS)\",\n \"AC_SYS_LARGEFILE\",\n \"dnl AM_DISABLE_SHARED\\nAM_PROG_LIBTOOL\",\n \"AC_CHECK_TOOL(AR, ar, :)\",\n \"dnl\\ndnl use defaults if cross-compiling, otherwise use the default path.\\ndnl\\nif test \\\"$cross_compiling\\\" = \\\"yes\\\"; then\\n MYPATH=\\\":\\\"\\nelse\\n MYPATH=$PATH\\nfi\",\n \"dnl\\ndnl Find some common programs\\ndnl\\nAC_PATH_PROGS(__7ZIP, [7zip 7za 7z], /usr/bin/7za, $MYPATH)\\nAC_PATH_PROG(__BZIP2, bzip2, /usr/bin/bzip2, $MYPATH)\\nAC_PATH_PROG(__CAT, cat, /bin/cat, $MYPATH)\\nAC_PATH_PROG(__CHMOD, chmod, /bin/chmod, $MYPATH)\\nAC_PATH_PROG(__CHOWN, chown, /bin/chown, $MYPATH)\\nAC_PATH_PROG(__CP, cp, /bin/cp, $MYPATH)\\nAC_PATH_PROG(__CURL, curl, /usr/bin/curl, $MYPATH)\\nAC_PATH_PROG(__FILE, file, /usr/bin/file, $MYPATH)\\nAC_PATH_PROGS(__GPG, gpg2 gpg, /usr/bin/gpg2, $MYPATH)\\nAC_PATH_PROG(__GREP, grep, /bin/grep, $MYPATH)\\nAC_PATH_PROG(__GZIP, gzip, /bin/gzip, $MYPATH)\\nAC_PATH_PROG(__UNZIP, unzip, /usr/bin/unzip, $MYPATH)\\nAC_PATH_PROG(__ID, id, /usr/bin/id, $MYPATH)\\nAC_PATH_PROG(__INSTALL, install, /usr/bin/install, $MYPATH)\\nAC_PATH_PROG(__LRZIP, lrzip, /usr/bin/lrzip, $MYPATH)\\nAC_PATH_PROG(__LZIP, lzip, /usr/bin/lzip, $MYPATH)\\nAC_PATH_PROG(__XZ, xz, /usr/bin/xz, $MYPATH)\\nAC_PATH_PROG(__GEM, gem, /usr/bin/gem, $MYPATH)\\nAC_PATH_PROG(__MAKE, make, /usr/bin/make, $MYPATH)\\nAC_PATH_PROG(__MKDIR, mkdir, /bin/mkdir, $MYPATH)\\nAC_PATH_PROG(__MV, mv, /bin/mv, $MYPATH)\\nAC_PATH_PROG(__PATCH, patch, /usr/bin/patch, $MYPATH)\\nAC_PATH_PROG(__RM, rm, /bin/rm, $MYPATH)\\nAC_PATH_PROG(__SED, sed, /bin/sed, $MYPATH)\\nAC_PATH_PROG(__TAR, tar, /bin/tar, $MYPATH)\\nAC_PATH_PROG(__ZSTD, zstd, /usr/bin/zstd, $MYPATH)\",\n \"AC_PATH_PROG(__LD, ld, /usr/bin/ld, $MYPATH)\\nAC_PATH_PROG(__OBJDUMP, objdump, /usr/bin/objdump, $MYPATH)\\nAC_PATH_PROG(__STRIP, strip, /usr/bin/strip, $MYPATH)\\nAC_PATH_PROG(__FIND_DEBUGINFO, find-debuginfo, /usr/bin/find-debuginfo, $MYPATH)\",\n \"AC_PATH_PROG(__GIT, git, /usr/bin/git, $MYPATH)\\nAC_PATH_PROG(__HG, hg, /usr/bin/hg, $MYPATH)\\nAC_PATH_PROG(__BZR, bzr, /usr/bin/bzr, $MYPATH)\\nAC_PATH_PROG(__QUILT, quilt, /usr/bin/quilt, $MYPATH)\",\n \"AC_PATH_PROG(__FAKECHROOT, fakechroot, no, $MYPATH)\\nAM_CONDITIONAL(HAVE_FAKECHROOT, [test \\\"$__FAKECHROOT\\\" != \\\"no\\\"])\",\n \"dnl see if we have a mkdir that supports `-p' for rpmbuild's purposes\\nAC_PROG_MKDIR_P\\nif ! echo $MKDIR_P | grep -q mkdir; then \\n __MKDIR_P=\\\"`echo ${prefix}/lib/rpm/mkinstalldirs`\\\"\\nelse\\n __MKDIR_P=$MKDIR_P\\nfi\\nAC_DEFINE_UNQUOTED(__MKDIR_P, \\\"${__MKDIR_P}\\\",\\n[A full path to a program, possibly with arguments, that will create a\\n directory and all necessary parent directories, ala 'mkdir -p'])\\nAC_SUBST(__MKDIR_P)\",\n \"#=================\\n# Check for zlib library. \",\n \"WITH_ZLIB_INCLUDE=\\nWITH_ZLIB_LIB=\",\n \"AC_CHECK_HEADERS([zlib.h],[\\n AS_IF([test -z \\\"${WITH_ZLIB_LIB}\\\"],[\\n for zlib in z gz ; do\\n AC_CHECK_LIB(${zlib}, gzread, \\n\\t[WITH_ZLIB_LIB=\\\"-l${zlib}\\\"; break])\\n done\",\n \"dnl zlib-1.0.4 has not gzseek\\n AC_CHECK_LIB(${zlib}, gzseek, [AC_DEFINE(HAVE_GZSEEK, 1, [Define as 1 if your zlib has gzseek()])])\\n ])\\n],[\\n AC_MSG_ERROR([missing required header zlib.h])\\n])\",\n \"AC_SUBST(WITH_ZLIB_INCLUDE)\\nAC_SUBST(WITH_ZLIB_LIB)\",\n \"#=================\\n# Check for bzip2 library.\",\n \"AC_CHECK_HEADERS([bzlib.h],[\\n AC_CHECK_LIB(bz2, BZ2_bzread, [WITH_BZ2_LIB=-lbz2])\\n])\\nAC_SUBST(WITH_BZ2_LIB)\",\n \"#=================\\n# Check for lzma library.\",\n \"AC_CHECK_HEADERS([lzma.h],[\\n AC_CHECK_LIB(lzma, lzma_easy_encoder, [WITH_LZMA_LIB=-llzma])\\n])\\nAC_SUBST(WITH_LZMA_LIB)\",\n \"# AC_OPENMP supports --enable/disable-openmp out of the box, but it doesn't\\n# actually give us a way to conditionalize the build based on that. Argh.\\n# Version 4.5 (201511) introduced \\\"priority\\\" clause for tasks.\\nOPENMP_CFLAGS=\\nAC_OPENMP\\nAS_IF([test \\\"x$ac_cv_prog_c_openmp\\\" != x &&\\n test \\\"x$ac_cv_prog_c_openmp\\\" != xunsupported],[\\n old_CFLAGS=$CFLAGS\\n CFLAGS=\\\"$CFLAGS $OPENMP_CFLAGS\\\"\\n AC_MSG_CHECKING([OpenMP is at least version 4.5])\\n AC_COMPILE_IFELSE(\\n [AC_LANG_PROGRAM(\\n [#include <omp.h>],\\n [#if _OPENMP < 201511\\n #error\\n #endif\\n ]\\n )],\\n [AC_MSG_RESULT([yes])\\n AC_DEFINE(ENABLE_OPENMP, 1, [Enable multithreading support?])\\n ],\\n [AC_MSG_RESULT([no])\\n OPENMP_CFLAGS=\\n if test \\\"$enable_openmp\\\" = \\\"yes\\\"; then\\n AC_MSG_ERROR([OpenMP too old])\\n fi\\n ]\\n )\\n CFLAGS=$old_CFLAGS\\n])\\nAC_SUBST(OPENMP_CFLAGS)\",\n \"#=================\\n# Check for zstd.\",\n \"AC_ARG_ENABLE([zstd],\\n [AS_HELP_STRING([--enable-zstd=@<:@yes/no/auto@:>@],\\n [build without zstd support (default=auto)])],\\n [enable_zstd=\\\"$enableval\\\"],\\n [enable_zstd=auto])\",\n \"AS_IF([test \\\"x$enable_zstd\\\" != \\\"xno\\\"], [\\n PKG_CHECK_MODULES([ZSTD], [libzstd >= 1.3.8], [have_zstd=yes], [have_zstd=no])\\n AS_IF([test \\\"$enable_zstd\\\" = \\\"yes\\\"], [\\n if test \\\"$have_zstd\\\" = \\\"no\\\"; then\\n AC_MSG_ERROR([--enable-zstd specified, but not available])\\n fi\\n ])\\n])\",\n \"if test \\\"x$have_zstd\\\" = \\\"xyes\\\"; then\\n AC_DEFINE([HAVE_ZSTD], [1], [Define if libzstd is available])\\n ZSTD_REQUIRES=libzstd\\n AC_SUBST(ZSTD_REQUIRES)\\nfi\\nAM_CONDITIONAL([HAVE_ZSTD], [test \\\"x$have_zstd\\\" = \\\"xyes\\\"])\",\n \"#=================\",\n \"dnl\\ndnl Check for features\\ndnl\",\n \"dnl Checks for libraries.\",\n \"AC_CHECK_FUNC(gethostname, [], [\\n AC_CHECK_LIB(nsl, gethostname)\\n])\",\n \"AC_CHECK_HEADERS(pthread.h)\",\n \"AC_CHECK_LIB(pthread, pthread_mutex_trylock, [], [\\n dnl OSF 5.0 has the the symbols prefixed with __ in libpthread.\\n AC_CHECK_LIB(pthread, __pthread_mutex_trylock, [], [\\n AC_CHECK_LIB(thread, mutex_lock)\\n ])\\n])\",\n \"AC_SEARCH_LIBS(dlopen, [dl])\",\n \"#=================\\n# Check for libelf library. Prefer external, otherwise none.\\nAC_ARG_ENABLE([libelf],\\n\\t\\t[AS_HELP_STRING([--enable-libelf=@<:@yes/no/auto@:>@],\\n\\t\\t\\t\\t[build with libelf support (default=yes)])],\\n\\t\\t[enable_libelf=\\\"$enableval\\\"],\\n\\t\\t[enable_libelf=yes])\",\n \"AS_IF([test \\\"x$enable_libelf\\\" != \\\"xno\\\"], [\\n WITH_LIBELF_LIB=\\n AC_CHECK_HEADER([libelf.h])\\n AC_CHECK_HEADERS([gelf.h], [\\n AC_CHECK_LIB(elf, gelf_getvernaux, [\\n AC_DEFINE(HAVE_LIBELF, 1, [Define to 1 if you have the 'elf' library (-lelf).])\\n WITH_LIBELF_LIB=\\\"-lelf\\\"\\n WITH_LIBELF=yes\\n ])\\n ])\\n])\\nAC_SUBST(WITH_LIBELF_LIB)\\nAM_CONDITIONAL(LIBELF,[test \\\"$WITH_LIBELF\\\" = yes])\",\n \"#=================\\n# Select crypto library\\nAC_ARG_WITH(crypto,\\n [AC_HELP_STRING([--with-crypto=CRYPTO_LIB],\\n [The cryptographic library to use (openssl|libgcrypt). The default is libgcrypt.])\\n ],[],\\n [with_crypto=libgcrypt])\",\n \"#=================\\n# Check for OpenSSL library.\\n# We need evp.h from OpenSSL.\",\n \"WITH_OPENSSL_INCLUDE=\\nWITH_OPENSSL_LIB=\\nif test \\\"$with_crypto\\\" = openssl; then\\n# If we have pkgconfig make sure CPPFLAGS are setup correctly for the OpenSSL\\n# -I include path.\\nAC_PATH_TOOL([PKGCONFIG], [pkg-config], [no], [$PATH:/usr/bin:/usr/local/bin])\\nif test \\\"x$PKGCONFIG\\\" != \\\"xno\\\"; then\\n CPPFLAGS=\\\"$CPPFLAGS $($PKGCONFIG --cflags libcrypto)\\\"\\n WITH_OPENSSL_LIB=$($PKGCONFIG --libs libcrypto)\\nelse\\n WITH_OPENSSL_LIB=-lcrypto\\nfi\",\n \"AC_CHECK_HEADERS([openssl/evp.h], [], [\\n AC_MSG_ERROR([missing required OpenSSL header])\\n])\\nAC_CHECK_HEADERS([openssl/rsa.h], [], [\\n AC_MSG_ERROR([missing required OpenSSL header])\\n])\\nAC_CHECK_HEADERS([openssl/dsa.h], [], [\\n AC_MSG_ERROR([missing required OpenSSL header])\\n])\",\n \"AC_CHECK_LIB(crypto, EVP_DigestInit_ex, [], [\\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\\n])\",\n \"AC_CHECK_LIB(crypto, EVP_MD_CTX_new, [\\n AC_DEFINE(HAVE_EVP_MD_CTX_NEW, 1, [Define to 1 if OpenSSL has EVP_MD_CTX_new])\\n AC_SUBST(HAVE_EVP_MD_CTX_NEW, [1])\\n ], [\\n AC_CHECK_LIB(crypto, EVP_MD_CTX_create, [], [\\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\\n ])\\n])\",\n \"AC_CHECK_LIB(crypto, EVP_PKEY_CTX_new, [], [\\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\\n])\",\n \"AC_CHECK_LIB(crypto, DSA_set0_key, [\\n AC_DEFINE(HAVE_DSA_SET0_KEY, 1, [Define to 1 if OpenSSL has DSA_set0_key])\\n AC_SUBST(HAVE_DSA_SET0_KEY, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, DSA_set0_pqg, [\\n AC_DEFINE(HAVE_DSA_SET0_PQG, 1, [Define to 1 if OpenSSL has DSA_set0_pqg])\\n AC_SUBST(HAVE_DSA_SET0_PQG, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, DSA_SIG_set0, [\\n AC_DEFINE(HAVE_DSA_SIG_SET0, 1, [Define to 1 if OpenSSL has DSA_SIG_set0])\\n AC_SUBST(HAVE_DSA_SIG_SET0, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, RSA_set0_key, [\\n AC_DEFINE(HAVE_RSA_SET0_KEY, 1, [Define to 1 if OpenSSL has RSA_set0_key])\\n AC_SUBST(HAVE_RSA_SET0_KEY, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, BN_bn2binpad, [\\n AC_DEFINE(HAVE_BN2BINPAD, 1, [Define to 1 if OpenSSL has BN_bn2binpad])\\n AC_SUBST(HAVE_BN2BINPAD, [1])\\n ], []\\n)\",\n \"fi\",\n \"AM_CONDITIONAL([WITH_OPENSSL],[test \\\"$with_crypto\\\" = openssl])\\nAC_SUBST(WITH_OPENSSL_INCLUDE)\\nAC_SUBST(WITH_OPENSSL_LIB)\",\n \"#=================\\n# Check for libgcrypt library.\\nWITH_LIBGCRYPT_INCLUDE=\\nWITH_LIBGCRYPT_LIB=\\nif test \\\"$with_crypto\\\" = libgcrypt ; then\\n # libgcrypt 1.8.5 onwards ships a pkg-config file so prefer that\\n PKG_CHECK_MODULES([LIBGCRYPT], [libgcrypt], [have_libgcrypt=yes], [have_libgcrypt=no])\\n if test \\\"$have_libgcrypt\\\" = \\\"yes\\\"; then\\n WITH_LIBGCRYPT_INCLUDE=\\\"$LIBGCRYPT_CFLAGS\\\"\\n WITH_LIBGCRYPT_LIB=\\\"$LIBGCRYPT_LIBS\\\"\\n else\\n AC_PATH_TOOL(LIBGCRYPT_CONFIG, libgcrypt-config, notfound)\\n if test notfound != \\\"$LIBGCRYPT_CONFIG\\\" ; then\\n WITH_LIBGCRYPT_INCLUDE=`$LIBGCRYPT_CONFIG --cflags`\\n WITH_LIBGCRYPT_LIB=`$LIBGCRYPT_CONFIG --libs`\\n fi\\n if test -z \\\"$WITH_LIBGCRYPT_LIB\\\" ; then\\n AC_MSG_ERROR([libgcrypt not found])\\n fi\\n fi\\nfi\",\n \"AM_CONDITIONAL([WITH_LIBGCRYPT],[test \\\"$with_crypto\\\" = libgcrypt])\\nAC_SUBST(WITH_LIBGCRYPT_INCLUDE)\\nAC_SUBST(WITH_LIBGCRYPT_LIB)\",\n \"#=================\\n# Check for magic library.\\nWITH_MAGIC_INCLUDE=\\nWITH_MAGIC_LIB=\",\n \"AC_CHECK_HEADER([magic.h], [\\n AC_CHECK_LIB(magic, magic_open, [\\n WITH_MAGIC_INCLUDE=\\n WITH_MAGIC_LIB=\\\"-lmagic\\\"\\n ],[\\n AC_MSG_ERROR([missing required library 'libmagic']) \\n ])\\n],[\\n AC_MSG_ERROR([missing required header magic.h]) \\n])\",\n \"AC_SUBST(WITH_MAGIC_INCLUDE)\\nAC_SUBST(WITH_MAGIC_LIB)\",\n \"#=================\\n# Check for popt library.\\nWITH_POPT_INCLUDE=\\nWITH_POPT_LIB=\",\n \"AC_CHECK_HEADER([popt.h], [\\n AC_CHECK_LIB(popt, poptGetContext, [\\n WITH_POPT_INCLUDE=\\n WITH_POPT_LIB=\\\"-lpopt\\\"\\n ],[\\n AC_MSG_ERROR([missing required library popt])\\n ])\\n],[\\n AC_MSG_ERROR([missing required header popt.h])\\n])\",\n \"AC_SUBST(WITH_POPT_INCLUDE)\\nAC_SUBST(WITH_POPT_LIB)\",\n \"#=================\\n# Check for libarchive library.\\nAC_ARG_WITH([archive], [AS_HELP_STRING([--with-archive], [build rpm2archive - requires libarchive])],\\n [],\\n [with_archive=yes])\",\n \"WITH_ARCHIVE_INCLUDE=\\nWITH_ARCHIVE_LIB=\\nAS_IF([test \\\"$with_archive\\\" != no],[\\n AC_CHECK_HEADER([archive.h], [\\n AC_CHECK_LIB(archive, archive_write_open_filename, [\\n WITH_ARCHIVE_INCLUDE=\\n WITH_ARCHIVE_LIB=\\\"-larchive\\\"\\n ],[\\n AC_MSG_ERROR([missing required library 'libarchive'])\\n ])\\n],[\\n AC_MSG_ERROR([missing required header archive.h])\\n ])\\n])\",\n \"AC_SUBST(WITH_ARCHIVE_INCLUDE)\\nAC_SUBST(WITH_ARCHIVE_LIB)\\nAM_CONDITIONAL(WITH_ARCHIVE,[test \\\"$with_archive\\\" = yes])\",\n \"#=================\\n# Check for elfutils libdw library with dwelf_elf_gnu_build_id.\\nAS_IF([test \\\"x$enable_libelf\\\" != \\\"xno\\\"], [\\n WITH_LIBDW_LIB=\\n AS_IF([test \\\"$WITH_LIBELF\\\" = yes],[\\n AC_CHECK_HEADERS([elfutils/libdwelf.h],[\\n # dwelf_elf_gnu_build_id was introduced in elfutils 0.159\\n AC_CHECK_LIB(dw, dwelf_elf_gnu_build_id, [\\n AC_DEFINE(HAVE_LIBDW, 1,\\n [Define to 1 if you have elfutils libdw library])\\n WITH_LIBDW_LIB=\\\"-ldw\\\"\\n WITH_LIBDW=yes\\n # whether libdw supports compressed ELF objects\\n AC_CHECK_LIB(dw, dwelf_elf_begin, [\\n AC_DEFINE(HAVE_DWELF_ELF_BEGIN, 1, [Have dwelf_elf_begin?])\\n ])\\n ])\\n ])\\n ])\\n])\\nAC_SUBST(WITH_LIBDW_LIB)\\nAM_CONDITIONAL(LIBDW,[test \\\"$WITH_LIBDW\\\" = yes])\",\n \"#=================\\n# Process --enable-ndb\\nAC_ARG_ENABLE([ndb], [AS_HELP_STRING([--enable-ndb],[enable the new rpm database format])],\\n[case \\\"$enable_ndb\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --enable-ndb])\\n ;;\\nesac],\\n[enable_ndb=no])\\nAS_IF([test \\\"$enable_ndb\\\" = yes],[\\n AC_DEFINE(ENABLE_NDB, 1, [Enable new rpm database format?])\\n AC_CHECK_FUNCS(mremap, [], [], [#include <sys/mman.h>])\\n])\\nAM_CONDITIONAL([NDB], [test \\\"$enable_ndb\\\" = yes])\",\n \"#=================\\n# Process --enable-bdb-ro\\nAC_ARG_ENABLE([bdb-ro], [AS_HELP_STRING([--enable-bdb-ro (EXPERIMENTAL)],[enable the read-only Berkeley DB code])],\\n[case \\\"$enable_bdb_ro\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --enable-bdb-ro])\\n ;;\\nesac],\\n[enable_bdb_ro=no])\\nAS_IF([test \\\"$enable_bdb_ro\\\" = yes],[\\n AC_DEFINE(WITH_BDB_RO, 1, [Build with read-only Berkeley DB])\\n])\\nAM_CONDITIONAL([BDB_RO], [test \\\"$enable_bdb_ro\\\" = yes])\",\n \"# Check for SQLITE support\\nAC_ARG_ENABLE([sqlite],\\n [AS_HELP_STRING([--enable-sqlite=@<:@yes/no/auto@:>@)],\\n [build with sqlite rpm database format support (default=yes)])],\\n [enable_sqlite=\\\"$enableval\\\"],\\n [enable_sqlite=yes])\",\n \"AS_IF([test \\\"x$enable_sqlite\\\" != \\\"xno\\\"], [\\n PKG_CHECK_MODULES([SQLITE], [sqlite3 >= 3.22.0], [have_sqlite=yes], [have_sqlite=no])\\n AS_IF([test \\\"$enable_sqlite\\\" = \\\"yes\\\"], [\\n if test \\\"$have_sqlite\\\" = \\\"no\\\"; then\\n AC_MSG_ERROR([--enable-sqlite specified, but not available])\\n fi\\n ])\\n])\",\n \"if test \\\"x$have_sqlite\\\" = \\\"xyes\\\"; then\\n AC_DEFINE([WITH_SQLITE], [1], [Define if SQLITE is available])\\n SQLITE_REQUIRES=sqlite\\n AC_SUBST(SQLITE_REQUIRES)\\nfi\\nAM_CONDITIONAL([SQLITE], [test \\\"x$have_sqlite\\\" = \\\"xyes\\\"])\",\n \"AM_GNU_GETTEXT_VERSION([0.18.2])\\nAM_GNU_GETTEXT([external])\\nAM_ICONV\",\n \"dnl Checks for header files we can live without.\\nAC_HEADER_STDC\\ndnl glibc and autoconf don't really play well together.\\ndnl glibc will produce a warning when including the wrong header.\\ndnl but still define major and minor. Causing us to include the header\\ndnl that produces a giant warning for each major/minor use.\\ndnl Use -Werror to work around that.\\nold_CFLAGS=$CFLAGS\\nCFLAGS=\\\"$CFLAGS -Werror\\\"\\nAC_HEADER_MAJOR\\nCFLAGS=$old_CFLAGS\\nAC_STRUCT_DIRENT_D_TYPE\",\n \"AC_CHECK_HEADERS(limits.h)\\nAC_CHECK_HEADERS(getopt.h)\",\n \"AC_CHECK_HEADERS(sys/utsname.h)\",\n \"AC_CHECK_HEADERS(sys/systemcfg.h)\\nAC_CHECK_HEADERS(sys/param.h)\\nAC_CHECK_HEADERS(sys/auxv.h)\",\n \"dnl look for libc features\",\n \"dnl Check for missing typedefs\\nAC_TYPE_MODE_T\\nAC_TYPE_OFF_T\\nAC_TYPE_PID_T\\nAC_TYPE_SIZE_T\",\n \"dnl Checks for library functions.\\nAC_CHECK_FUNCS(putenv)\\nAC_CHECK_FUNCS(mempcpy)\\nAC_CHECK_FUNCS(fdatasync)\\nAC_CHECK_DECLS(fdatasync, [], [], [#include <unistd.h>])\\nAC_CHECK_FUNCS(lutimes)\\nAC_CHECK_FUNCS(mergesort)\\nAC_CHECK_FUNCS(getauxval)\\nAC_CHECK_FUNCS(setprogname, [], [], [#include <stdlib.h>])\\nAC_CHECK_FUNCS(syncfs)\\nAC_CHECK_FUNCS(sched_getaffinity, [], [], [#include <sched.h>])\\nAC_CHECK_FUNCS(unshare, [], [], [#include <sched.h>])\",\n \"AC_MSG_CHECKING([whether __progname is defined])\\nAC_LINK_IFELSE([AC_LANG_PROGRAM([extern const char *__progname;],\\n\\t [if (*__progname == 0) return 0;])],\\n\\t AC_DEFINE([HAVE___PROGNAME], [1], [Define if __progname is defined])\\n\\t AC_MSG_RESULT([yes]),\\n\\t AC_MSG_RESULT([no]))\",\n \"AC_REPLACE_FUNCS(stpcpy stpncpy)\",\n \"AC_CHECK_FUNCS([secure_getenv __secure_getenv])\",\n \"AC_CHECK_FUNCS(\\n [mkstemp getcwd basename dirname realpath setenv unsetenv regcomp lchown \\\\\",\n \" utimes getline localtime_r statvfs getaddrinfo ],\",\n \" [], [AC_MSG_ERROR([function required by rpm])])\",\n \"AC_LIBOBJ(fnmatch)\",\n \"dnl check if python is requested\\nAC_ARG_ENABLE(python, [AS_HELP_STRING([--enable-python],[build rpm python bindings])],\\n[case \\\"$enable_python\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --enable-python])\\n ;;\\nesac],\\n[enable_python=no])\",\n \"WITH_PYTHON_SUBPACKAGE=0\\nAS_IF([test \\\"$enable_python\\\" = yes],[\\n PYTHON=\\\"${PYTHON:-python3}\\\"\\n AM_PATH_PYTHON([3.1],[\\n PKG_CHECK_MODULES([PYTHON], [python-${PYTHON_VERSION}], [WITH_PYTHON_SUBPACKAGE=1])\\n AC_SUBST(PYTHON_CFLAGS)\\n AC_SUBST(PYTHON_LIB)\\n ])\\n])\",\n \"AM_CONDITIONAL(ENABLE_PYTHON,[test \\\"$WITH_PYTHON_SUBPACKAGE\\\" = 1])\",\n \"AC_PATH_PROG(DOXYGEN, doxygen, no)\\nAC_CHECK_PROG(HAVE_DOT,[dot],[YES],[NO])\\nAC_PATH_PROG(PANDOC, pandoc, no)\",\n \"WITH_SELINUX_LIB=\\nAC_ARG_WITH(selinux, [AS_HELP_STRING([--with-selinux],[build with selinux support])],\\n[case \\\"$with_selinux\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --with-selinux])\\n ;;\\nesac],\\n[with_selinux=no])\",\n \"AS_IF([test \\\"$with_selinux\\\" = yes],[\\n AC_CHECK_HEADER([selinux/selinux.h],[\\n save_LIBS=\\\"$LIBS\\\"\\n AC_CHECK_LIB([selinux],[is_selinux_enabled],[],[\\n AC_MSG_ERROR([--with-selinux given, but is_selinux_enabled not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selinux_getpolicytype],[],[\\n AC_MSG_ERROR([--with-selinux given, but selinux_getpolicytype not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selinux_reset_config],[],[\\n AC_MSG_ERROR([--with-selinux given, but selinux_reset_config not found in libselinux])])\\n AC_CHECK_LIB([selinux],[setexecfilecon],[\\n AC_DEFINE([HAVE_SETEXECFILECON],[1],[Define to 1 if SELinux setexecfilecon is present])])\\n LIBS=\\\"$save_LIBS\\\"\\n ],[\\n AC_MSG_ERROR([--with-selinux given, but selinux/selinux.h not found])\\n ])\",\n \" AC_CHECK_HEADER([selinux/label.h],[\\n save_LIBS=\\\"$LIBS\\\"\\n AC_CHECK_LIB([selinux],[selabel_close],[],[\\n AC_MSG_ERROR([--with-selinux given, but selabel_close not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selabel_lookup_raw],[],[\\n AC_MSG_ERROR([--with-selinux given, but selabel_lookup_raw not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selabel_open],[],[\\n AC_MSG_ERROR([--with-selinux given, but selabel_open not found in libselinux])])\\n LIBS=\\\"$save_LIBS\\\"\\n ],[\\n AC_MSG_ERROR([--with-selinux given, but selinux/label.h not found])\\n ])\\n])\",\n \"AS_IF([test \\\"$with_selinux\\\" = yes],[\\n AC_DEFINE(WITH_SELINUX, 1, [Build with selinux support?])\\n WITH_SELINUX_LIB=\\\"-lselinux\\\"\\n])\\nAC_SUBST(WITH_SELINUX_LIB)\\nAC_SUBST(WITH_SEMANAGE_LIB)\\nAM_CONDITIONAL(SELINUX,[test \\\"$with_selinux\\\" = yes])\",\n \"# libimaevm\\nwith_iamevm=no\\nAC_ARG_WITH(imaevm, [AS_HELP_STRING([--with-imaevm],[build with imaevm support])])\\nif test \\\"$with_imaevm\\\" = yes ; then\\n AC_MSG_CHECKING([libimaevm >= 1.0])\\n AC_COMPILE_IFELSE(\\n [AC_LANG_PROGRAM(\\n [[#include <imaevm.h>]],\\n [[return sign_hash(NULL, NULL, 0, NULL, NULL, NULL);]]\\n )],\\n [AC_MSG_RESULT(yes)\\n AC_DEFINE(WITH_IMAEVM, 1, [Build with imaevm support?])\\n WITH_IMAEVM_LIB=\\\"-limaevm\\\"\\n ],\\n [AC_MSG_ERROR([libimaevm not present or too old (< 1.0)])]\\n )\\nfi\\nAM_CONDITIONAL(WITH_IMAEVM,[test \\\"$with_imaevm\\\" = yes])\\nAC_SUBST(WITH_IMAEVM_LIB)\",\n \"# fsverity\\nAC_ARG_WITH([fsverity], [AS_HELP_STRING([--with-fsverity],[build with fsverity support])],[],[with_fsverity=no])\\nif test \\\"$with_fsverity\\\" = yes ; then\\n AC_MSG_CHECKING([libfsverity])\\n AC_COMPILE_IFELSE(\\n [AC_LANG_PROGRAM(\\n [[#include <libfsverity.h>]],\\n [[return libfsverity_sign_digest(NULL, NULL, NULL, NULL);]]\\n )],\\n [AC_MSG_RESULT(yes)\\n AC_DEFINE(WITH_FSVERITY, 1, [Build with fsverity support?])\\n WITH_FSVERITY_LIB=\\\"-lfsverity\\\"\\n ],\\n [AC_MSG_ERROR([--with-fsverity given, libfsverity or libfsverity.h missing])]\\n )\\nfi\\nAM_CONDITIONAL(WITH_FSVERITY,[test \\\"$with_fsverity\\\" = yes])\\nAC_SUBST(WITH_FSVERITY_LIB)\",\n \"# libcap\\nWITH_CAP_LIB=\\nAC_ARG_WITH(cap, [AS_HELP_STRING([--with-cap],[build with capability support])],\\n[case \\\"$with_cap\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --with-cap])\\n ;;\\nesac],\\n[with_cap=no])\",\n \"AS_IF([test \\\"$with_cap\\\" = yes],[\\n AC_CHECK_HEADER([sys/capability.h],[\\n AC_CHECK_LIB(cap,[cap_get_file], [\\n with_cap=yes\\n save_LIBS=\\\"$LIBS\\\"\\n AC_CHECK_LIB(cap,[cap_compare], [\\n AC_DEFINE(HAVE_CAP_COMPARE, 1, [Have cap_compare function?])\\n ])\\n LIBS=\\\"$save_LIBS\\\"\\n ],[\\n AC_MSG_ERROR([--with-cap given, but libcap not found])])\\n ],[\\n AC_MSG_ERROR([--with-cap given, but sys/capability.h not found])\\n ])\\n])\",\n \"AS_IF([test \\\"$with_cap\\\" = yes],[\\n AC_DEFINE(WITH_CAP, 1, [Build with capability support?])\\n WITH_CAP_LIB=\\\"-lcap\\\"\\n])\\nAC_SUBST(WITH_CAP_LIB)\\nAM_CONDITIONAL(CAP,[test \\\"$with_cap\\\" = yes])\",\n \"WITH_ACL_LIB=\\nAC_ARG_WITH(acl, [AS_HELP_STRING([--with-acl],[build with acl support])],\\n[case \\\"$with_acl\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --with-acl])\\n ;;\\nesac],\\n[with_acl=no])\",\n \"AS_IF([test \\\"$with_acl\\\" = yes],[\\n dnl verification uses non-portable acl_equiv_mode() \\n AC_CHECK_HEADER([acl/libacl.h],[\\n AC_CHECK_LIB(acl,[acl_equiv_mode],[with_acl=yes],[\\n AC_MSG_ERROR([--with-acl given, but libacl not found or not suitable])])\\n ],[\\n AC_MSG_ERROR([--with-acl given, but acl/libacl.h not found])\\n ])\\n])\",\n \"AS_IF([test \\\"$with_acl\\\" = yes],[\\n AC_DEFINE(WITH_ACL, 1, [Build with acl support?])\\n WITH_ACL_LIB=\\\"-lacl\\\"\\n])\\nAC_SUBST(WITH_ACL_LIB)\\nAM_CONDITIONAL(ACL,[test \\\"$with_acl\\\" = yes])\",\n \"PKG_CHECK_MODULES([LUA],\\n [lua >= 5.2],\\n [],\\n [AC_MSG_ERROR([lua not present or too old)])])\\nAC_SUBST(LUA_CFLAGS)\\nAC_SUBST(LUA_LIBS)\",\n \"AC_ARG_WITH([readline],[AS_HELP_STRING([--with-readline=@<:@yes/no/auto@:>@], [build with readline support])], [with_readline=\\\"$withval\\\"], [with_readline=\\\"auto\\\"])\\nAS_IF([test \\\"$with_readline\\\" != \\\"no\\\"],[\\n PKG_CHECK_MODULES([READLINE], [readline], [have_readline=yes], [have_readline=no])\\n AS_IF([test \\\"$with_readline\\\" = \\\"yes\\\"],[\\n if test \\\"$have_readline\\\" = \\\"no\\\"; then\\n AC_MSG_ERROR([readline support requested but not present])\\n fi\\n ])\\n])\\nif test \\\"$have_readline\\\" = \\\"yes\\\"; then\\n AC_DEFINE([HAVE_READLINE], [1], [Define if readline is available])\\n AC_SUBST(READLINE_CFLAGS)\\n AC_SUBST(READLINE_LIBS)\\nfi\\nAM_CONDITIONAL(WITH_READLINE, [test \\\"$have_readline\\\" = yes])\",\n \"\\nAC_ARG_ENABLE(plugins, [AS_HELP_STRING([--disable-plugins],[build without plugin support])],,[enable_plugins=yes])\\nAS_IF([test \\\"$enable_plugins\\\" = yes],[\\n AC_DEFINE(ENABLE_PLUGINS, 1, [Build with plugin support?])\\n])\\nAM_CONDITIONAL(ENABLE_PLUGINS,[test \\\"$enable_plugins\\\" = yes])\",\n \"AC_ARG_ENABLE(inhibit_plugin, [AS_HELP_STRING([--disable-inhibit-plugin],[build without systemd inhibit plugin])],,[enable_inhibit_plugin=yes])\\nAS_IF([test \\\"$enable_inhibit_plugin\\\" = yes],[\\n AC_DEFINE(ENABLE_INHIBIT_PLUGIN, 1, [Build with systemd inhibit plugin?])\\n])\\nAM_CONDITIONAL(ENABLE_INHIBIT_PLUGIN,[test \\\"$enable_inhibit_plugin\\\" = yes])\",\n \"with_dbus=no\\nAS_IF([test \\\"$enable_plugins\\\" != no],[\\n AS_IF([test \\\"$enable_inhibit_plugin\\\" != no],[\\n PKG_CHECK_MODULES([DBUS],\\n [dbus-1 >= 1.3],\\n [AC_DEFINE(DBUS, 1, [Build with dbus support?]) with_dbus=yes],\\n [with_dbus=no])\\n AC_SUBST(DBUS_CFLAGS)\\n AC_SUBST(DBUS_LIBS)\\n ])\\n])\\nAM_CONDITIONAL(DBUS, [test \\\"$with_dbus\\\" = yes])\",\n \"AS_IF([test \\\"$enable_plugins\\\" != no],[\\n AC_CHECK_FUNCS(lsetxattr, [], [], [#include <sys/xattr.h>])\\n])\\nAM_CONDITIONAL(IMA, [test \\\"x$ac_cv_func_lsetxattr\\\" = xyes])\",\n \"AS_IF([test \\\"$enable_plugins\\\" != no],[\\nAC_CHECK_HEADERS([linux/fsverity.h],[FSVERITY_IOCTL=\\\"yes\\\"])\\n])\\nAM_CONDITIONAL(FSVERITY_IOCTL,[test \\\"x$FSVERITY_IOCTL\\\" = xyes])\",\n \"#=================\\n# Check for fapolicyd support\\nAC_ARG_WITH(fapolicyd,\\nAS_HELP_STRING([--with-fapolicyd],[build with File Access Policy Daemon support]),\\nwith_fapolicyd=$withval,\\nwith_fapolicyd=auto)\\nAM_CONDITIONAL(FAPOLICYD,[test \\\"$with_fapolicyd\\\" = yes])\",\n \"#=================\\n# Check for audit library.\\nAC_ARG_WITH(audit,\\nAS_HELP_STRING([--with-audit],[Linux audit plugin]),\\nwith_audit=$withval,\\nwith_audit=auto)\",\n \"WITH_AUDIT_LIB=\\nAS_IF([test \\\"$enable_plugins\\\" != no],[\\n AS_IF([test \\\"x$with_audit\\\" != xno],[\\n AC_SEARCH_LIBS([audit_open],[audit],[\\n WITH_AUDIT_LIB=\\\"$ac_res\\\"\\n AC_DEFINE(WITH_AUDIT, 1, [libaudit support])\\n with_audit=yes\\n ],[\\n if test \\\"x$with_audit\\\" != xauto; then\\n AC_MSG_ERROR([missing audit library])\\n fi\\n ])\\n ])\\n])\\nAC_SUBST(WITH_AUDIT_LIB)\\nAM_CONDITIONAL(AUDIT,[test \\\"$with_audit\\\" = yes])\",\n \"user_with_uid0=$(awk -F: '$3==0 {print $1;exit}' /etc/passwd)\\ngroup_with_gid0=$(awk -F: '$3==0 {print $1;exit}' /etc/group)\\nif test -z \\\"$user_with_uid0\\\" ; then user_with_uid0=root ; fi\\nif test -z \\\"$group_with_gid0\\\" ; then group_with_gid0=root ; fi\\nAC_DEFINE_UNQUOTED([UID_0_USER],[\\\"$user_with_uid0\\\"],[Get the user name having userid 0])\\nAC_DEFINE_UNQUOTED([GID_0_GROUP],[\\\"$group_with_gid0\\\"],[Get the group name having groupid 0])\",\n \"#\\n# get rid of the 4-th tuple, if config.guess returned \\\"linux-gnu\\\" for host_os\\n#\\nhost_os_gnu=-gnu\\nif echo \\\"$host_os\\\" | grep '.*-gnulibc1$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnulibc1$//'`\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnueabihf$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnueabihf$//'`\\n\\thost_os_gnu=-gnueabihf\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnueabi$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnueabi$//'`\\n\\thost_os_gnu=-gnueabi\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnuabi64$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnuabi64$//'`\\n\\thost_os_gnu=-gnuabi64\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnu$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnu$//'`\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnu[[^-]]*$' > /dev/null ; then\\n\\tAC_MSG_ERROR([unrecognized GNU build triplet $host_os])\\nfi\",\n \"changequote(<, >)\\nhost_os_exact=\\\"${host_os}\\\"\\nhost_os_major=`echo \\\"${host_os}\\\" | sed 's/\\\\..*$//'`\\nhost_os_noversion=`echo \\\"${host_os}\\\" | sed 's/[0-9]*\\\\..*$//'`\\nchangequote([, ])\",\n \"dnl permit overriding build_vendor for \\\"canonical rpm vendor\\\"\\nRPMCANONVENDOR=\\\"$build_vendor\\\"\\nAC_ARG_WITH([vendor], \\n AS_HELP_STRING([--with-vendor=VENDOR], [specify rpm vendor name]),\\n [RPMCANONVENDOR=$withval])\\nAC_DEFINE_UNQUOTED([RPMCANONVENDOR],[\\\"${RPMCANONVENDOR}\\\"],[canonical vendor])\\n\\t \\nRPMCANONOS=\\\"$host_os_noversion\\\"\\nRPMCANONGNU=\\\"$host_os_gnu\\\"\\nAC_SUBST(RPMCANONVENDOR)\\nAC_SUBST(RPMCANONOS)\\nAC_SUBST(RPMCANONGNU)\",\n \"RUNDIR=\\\"/run\\\"\\nAC_ARG_WITH([rundir], \\n AS_HELP_STRING([--with-rundir=RUNDIR], [specify run-time variable directory]),\\n [RUNDIR=$withval])\\nAC_DEFINE_UNQUOTED([RUNDIR],[\\\"${RUNDIR}\\\"],[run-time variable directory])\\nAC_SUBST(RUNDIR)\",\n \"if test X\\\"$prefix\\\" = XNONE ; then\\n usrprefix=\\\"$ac_default_prefix\\\"\\nelse\\n usrprefix=$prefix\\nfi\",\n \"RPMCONFIGDIR=\\\"`echo ${usrprefix}/lib/rpm`\\\"\\nAC_SUBST(RPMCONFIGDIR)\",\n \"AC_SUBST(OBJDUMP)\",\n \"AM_CONDITIONAL([DOXYGEN],[test \\\"$DOXYGEN\\\" != no])\\nAM_CONDITIONAL([PANDOC],[test \\\"$PANDOC\\\" != no])\",\n \"AC_PATH_PROG(AUTOM4TE,autom4te,:)\",\n \"AC_SUBST([dirstamp],[\\\\${am__leading_dot}dirstamp])\",\n \"AC_CONFIG_FILES([Makefile\\n\\trpmio/Makefile lib/Makefile build/Makefile sign/Makefile\\n\\tpo/Makefile.in scripts/Makefile fileattrs/Makefile\\n\\tmisc/Makefile \\n\\tdocs/Makefile\\n\\tdocs/man/Makefile\\n\\tpython/Makefile\\n \\tluaext/Makefile\\n \\ttests/Makefile\\n \\tplugins/Makefile\\n\\tpython/setup.py\\n ])\\nAC_OUTPUT\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 0,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [104, 584, 1024], \"buggy_code_start_loc\": [104, 583, 10], \"filenames\": [\"INSTALL\", \"configure.ac\", \"lib/fsm.c\"], \"fixing_code_end_loc\": [107, 585, 1157], \"fixing_code_start_loc\": [105, 583, 11], \"message\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:rpm:rpm:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"582D14B9-3812-42FD-9FA3-2BDEAA02DD6C\", \"versionEndExcluding\": \"4.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\"}, {\"lang\": \"es\", \"value\": \"Se ha detectado que la correcci\\u00f3n de CVE-2017-7500 y CVE-2017-7501 era incompleta: la comprobaci\\u00f3n s\\u00f3lo es implementada para el directorio padre del archivo que iba a crearse. Un usuario local no privilegiado que posea otro directorio antecesor podr\\u00eda usar este fallo para conseguir privilegios de root. La mayor amenaza de esta vulnerabilidad es para la confidencialidad e integridad de los datos, as\\u00ed como para la disponibilidad del sistema.\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-35939\", \"lastModified\": \"2023-02-04T01:16:51.737\", \"metrics\": {\"cvssMetricV2\": null, \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 6.7, \"baseSeverity\": \"MEDIUM\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"HIGH\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:H/UI:N/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 0.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-08-26T16:15:08.683\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://access.redhat.com/security/cve/CVE-2021-35939\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Exploit\", \"Issue Tracking\", \"Third Party Advisory\"], \"url\": \"https://bugzilla.redhat.com/show_bug.cgi?id=1964129\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/pull/1919\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Release Notes\", \"Vendor Advisory\"], \"url\": \"https://rpm.org/wiki/Releases/4.18.0\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202210-22\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, \"type\": \"CWE-59\"}"},"index":{"kind":"number","value":883,"string":"883"}}},{"rowIdx":5199,"cells":{"prompt":{"kind":"string","value":"Determine whether the {function_name} code is vulnerable or not."},"completions":{"kind":"list like","value":["AC_PREREQ(2.61)\nAC_INIT(rpm, 4.17.90, rpm-maint@lists.rpm.org)","AC_CONFIG_SRCDIR([rpm.c])\nAC_CONFIG_HEADERS([config.h])\nAC_CONFIG_MACRO_DIR([m4])\nAC_CONFIG_AUX_DIR([build-aux])","AM_INIT_AUTOMAKE([1.10 foreign tar-pax dist-bzip2 subdir-objects nostdinc])\ndnl Allow silent build on automake versions that support it\nm4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES])","AC_CONFIG_TESTDIR(tests)","AC_USE_SYSTEM_EXTENSIONS","AC_DISABLE_STATIC","PKG_PROG_PKG_CONFIG","dnl Checks for programs.\nAC_PROG_CXX\nAC_PROG_AWK\nAC_PROG_CC\nAC_PROG_CPP\nAC_PROG_INSTALL\nAC_PROG_LN_S\nAC_PROG_MAKE_SET\nAC_PROG_LIBTOOL","AC_SUBST(__CC, $CC)\nAC_PROG_CC_C99\nif test \"$ac_cv_prog_cc_c99\" = no; then\n AC_MSG_ERROR([ISO C99 capable compiler required])\nfi","AS=${AS-as}\nAC_SUBST(AS)\nif test \"$GCC\" = yes; then\n cflags_to_try=\"-fno-strict-aliasing -fno-strict-overflow -fno-delete-null-pointer-checks -Wempty-body\"\n AC_MSG_CHECKING([supported compiler flags])\n old_cflags=$CFLAGS\n echo\n for flag in $cflags_to_try; do\n CFLAGS=\"$CFLAGS $flag -Werror\"\n AC_LINK_IFELSE([AC_LANG_PROGRAM([[]], [[#include <alloca.h>\n\t\t\t\t\t\talloca(100);]])],[\n echo \" $flag\"\n RPMCFLAGS=\"$RPMCFLAGS $flag\"\n ],[])\n CFLAGS=$old_cflags\n done\n RPMCFLAGS=\"-Wall -Wpointer-arith -Wmissing-prototypes -Wstrict-prototypes $RPMCFLAGS\"\nfi\nAC_ARG_ENABLE(werror, [AS_HELP_STRING([--enable-werror], [build with -Werror])],\n\t\t[RPMCFLAGS=\"$RPMCFLAGS -Werror\"], [])\nAC_SUBST(RPMCFLAGS)","AC_SYS_LARGEFILE","dnl AM_DISABLE_SHARED\nAM_PROG_LIBTOOL","AC_CHECK_TOOL(AR, ar, :)","dnl\ndnl use defaults if cross-compiling, otherwise use the default path.\ndnl\nif test \"$cross_compiling\" = \"yes\"; then\n MYPATH=\":\"\nelse\n MYPATH=$PATH\nfi","dnl\ndnl Find some common programs\ndnl\nAC_PATH_PROGS(__7ZIP, [7zip 7za 7z], /usr/bin/7za, $MYPATH)\nAC_PATH_PROG(__BZIP2, bzip2, /usr/bin/bzip2, $MYPATH)\nAC_PATH_PROG(__CAT, cat, /bin/cat, $MYPATH)\nAC_PATH_PROG(__CHMOD, chmod, /bin/chmod, $MYPATH)\nAC_PATH_PROG(__CHOWN, chown, /bin/chown, $MYPATH)\nAC_PATH_PROG(__CP, cp, /bin/cp, $MYPATH)\nAC_PATH_PROG(__CURL, curl, /usr/bin/curl, $MYPATH)\nAC_PATH_PROG(__FILE, file, /usr/bin/file, $MYPATH)\nAC_PATH_PROGS(__GPG, gpg2 gpg, /usr/bin/gpg2, $MYPATH)\nAC_PATH_PROG(__GREP, grep, /bin/grep, $MYPATH)\nAC_PATH_PROG(__GZIP, gzip, /bin/gzip, $MYPATH)\nAC_PATH_PROG(__UNZIP, unzip, /usr/bin/unzip, $MYPATH)\nAC_PATH_PROG(__ID, id, /usr/bin/id, $MYPATH)\nAC_PATH_PROG(__INSTALL, install, /usr/bin/install, $MYPATH)\nAC_PATH_PROG(__LRZIP, lrzip, /usr/bin/lrzip, $MYPATH)\nAC_PATH_PROG(__LZIP, lzip, /usr/bin/lzip, $MYPATH)\nAC_PATH_PROG(__XZ, xz, /usr/bin/xz, $MYPATH)\nAC_PATH_PROG(__GEM, gem, /usr/bin/gem, $MYPATH)\nAC_PATH_PROG(__MAKE, make, /usr/bin/make, $MYPATH)\nAC_PATH_PROG(__MKDIR, mkdir, /bin/mkdir, $MYPATH)\nAC_PATH_PROG(__MV, mv, /bin/mv, $MYPATH)\nAC_PATH_PROG(__PATCH, patch, /usr/bin/patch, $MYPATH)\nAC_PATH_PROG(__RM, rm, /bin/rm, $MYPATH)\nAC_PATH_PROG(__SED, sed, /bin/sed, $MYPATH)\nAC_PATH_PROG(__TAR, tar, /bin/tar, $MYPATH)\nAC_PATH_PROG(__ZSTD, zstd, /usr/bin/zstd, $MYPATH)","AC_PATH_PROG(__LD, ld, /usr/bin/ld, $MYPATH)\nAC_PATH_PROG(__OBJDUMP, objdump, /usr/bin/objdump, $MYPATH)\nAC_PATH_PROG(__STRIP, strip, /usr/bin/strip, $MYPATH)\nAC_PATH_PROG(__FIND_DEBUGINFO, find-debuginfo, /usr/bin/find-debuginfo, $MYPATH)","AC_PATH_PROG(__GIT, git, /usr/bin/git, $MYPATH)\nAC_PATH_PROG(__HG, hg, /usr/bin/hg, $MYPATH)\nAC_PATH_PROG(__BZR, bzr, /usr/bin/bzr, $MYPATH)\nAC_PATH_PROG(__QUILT, quilt, /usr/bin/quilt, $MYPATH)","AC_PATH_PROG(__FAKECHROOT, fakechroot, no, $MYPATH)\nAM_CONDITIONAL(HAVE_FAKECHROOT, [test \"$__FAKECHROOT\" != \"no\"])","dnl see if we have a mkdir that supports `-p' for rpmbuild's purposes\nAC_PROG_MKDIR_P\nif ! echo $MKDIR_P | grep -q mkdir; then \n __MKDIR_P=\"`echo ${prefix}/lib/rpm/mkinstalldirs`\"\nelse\n __MKDIR_P=$MKDIR_P\nfi\nAC_DEFINE_UNQUOTED(__MKDIR_P, \"${__MKDIR_P}\",\n[A full path to a program, possibly with arguments, that will create a\n directory and all necessary parent directories, ala 'mkdir -p'])\nAC_SUBST(__MKDIR_P)","#=================\n# Check for zlib library. ","WITH_ZLIB_INCLUDE=\nWITH_ZLIB_LIB=","AC_CHECK_HEADERS([zlib.h],[\n AS_IF([test -z \"${WITH_ZLIB_LIB}\"],[\n for zlib in z gz ; do\n AC_CHECK_LIB(${zlib}, gzread, \n\t[WITH_ZLIB_LIB=\"-l${zlib}\"; break])\n done","dnl zlib-1.0.4 has not gzseek\n AC_CHECK_LIB(${zlib}, gzseek, [AC_DEFINE(HAVE_GZSEEK, 1, [Define as 1 if your zlib has gzseek()])])\n ])\n],[\n AC_MSG_ERROR([missing required header zlib.h])\n])","AC_SUBST(WITH_ZLIB_INCLUDE)\nAC_SUBST(WITH_ZLIB_LIB)","#=================\n# Check for bzip2 library.","AC_CHECK_HEADERS([bzlib.h],[\n AC_CHECK_LIB(bz2, BZ2_bzread, [WITH_BZ2_LIB=-lbz2])\n])\nAC_SUBST(WITH_BZ2_LIB)","#=================\n# Check for lzma library.","AC_CHECK_HEADERS([lzma.h],[\n AC_CHECK_LIB(lzma, lzma_easy_encoder, [WITH_LZMA_LIB=-llzma])\n])\nAC_SUBST(WITH_LZMA_LIB)","# AC_OPENMP supports --enable/disable-openmp out of the box, but it doesn't\n# actually give us a way to conditionalize the build based on that. Argh.\n# Version 4.5 (201511) introduced \"priority\" clause for tasks.\nOPENMP_CFLAGS=\nAC_OPENMP\nAS_IF([test \"x$ac_cv_prog_c_openmp\" != x &&\n test \"x$ac_cv_prog_c_openmp\" != xunsupported],[\n old_CFLAGS=$CFLAGS\n CFLAGS=\"$CFLAGS $OPENMP_CFLAGS\"\n AC_MSG_CHECKING([OpenMP is at least version 4.5])\n AC_COMPILE_IFELSE(\n [AC_LANG_PROGRAM(\n [#include <omp.h>],\n [#if _OPENMP < 201511\n #error\n #endif\n ]\n )],\n [AC_MSG_RESULT([yes])\n AC_DEFINE(ENABLE_OPENMP, 1, [Enable multithreading support?])\n ],\n [AC_MSG_RESULT([no])\n OPENMP_CFLAGS=\n if test \"$enable_openmp\" = \"yes\"; then\n AC_MSG_ERROR([OpenMP too old])\n fi\n ]\n )\n CFLAGS=$old_CFLAGS\n])\nAC_SUBST(OPENMP_CFLAGS)","#=================\n# Check for zstd.","AC_ARG_ENABLE([zstd],\n [AS_HELP_STRING([--enable-zstd=@<:@yes/no/auto@:>@],\n [build without zstd support (default=auto)])],\n [enable_zstd=\"$enableval\"],\n [enable_zstd=auto])","AS_IF([test \"x$enable_zstd\" != \"xno\"], [\n PKG_CHECK_MODULES([ZSTD], [libzstd >= 1.3.8], [have_zstd=yes], [have_zstd=no])\n AS_IF([test \"$enable_zstd\" = \"yes\"], [\n if test \"$have_zstd\" = \"no\"; then\n AC_MSG_ERROR([--enable-zstd specified, but not available])\n fi\n ])\n])","if test \"x$have_zstd\" = \"xyes\"; then\n AC_DEFINE([HAVE_ZSTD], [1], [Define if libzstd is available])\n ZSTD_REQUIRES=libzstd\n AC_SUBST(ZSTD_REQUIRES)\nfi\nAM_CONDITIONAL([HAVE_ZSTD], [test \"x$have_zstd\" = \"xyes\"])","#=================","dnl\ndnl Check for features\ndnl","dnl Checks for libraries.","AC_CHECK_FUNC(gethostname, [], [\n AC_CHECK_LIB(nsl, gethostname)\n])","AC_CHECK_HEADERS(pthread.h)","AC_CHECK_LIB(pthread, pthread_mutex_trylock, [], [\n dnl OSF 5.0 has the the symbols prefixed with __ in libpthread.\n AC_CHECK_LIB(pthread, __pthread_mutex_trylock, [], [\n AC_CHECK_LIB(thread, mutex_lock)\n ])\n])","AC_SEARCH_LIBS(dlopen, [dl])","#=================\n# Check for libelf library. Prefer external, otherwise none.\nAC_ARG_ENABLE([libelf],\n\t\t[AS_HELP_STRING([--enable-libelf=@<:@yes/no/auto@:>@],\n\t\t\t\t[build with libelf support (default=yes)])],\n\t\t[enable_libelf=\"$enableval\"],\n\t\t[enable_libelf=yes])","AS_IF([test \"x$enable_libelf\" != \"xno\"], [\n WITH_LIBELF_LIB=\n AC_CHECK_HEADER([libelf.h])\n AC_CHECK_HEADERS([gelf.h], [\n AC_CHECK_LIB(elf, gelf_getvernaux, [\n AC_DEFINE(HAVE_LIBELF, 1, [Define to 1 if you have the 'elf' library (-lelf).])\n WITH_LIBELF_LIB=\"-lelf\"\n WITH_LIBELF=yes\n ])\n ])\n])\nAC_SUBST(WITH_LIBELF_LIB)\nAM_CONDITIONAL(LIBELF,[test \"$WITH_LIBELF\" = yes])","#=================\n# Select crypto library\nAC_ARG_WITH(crypto,\n [AC_HELP_STRING([--with-crypto=CRYPTO_LIB],\n [The cryptographic library to use (openssl|libgcrypt). The default is libgcrypt.])\n ],[],\n [with_crypto=libgcrypt])","#=================\n# Check for OpenSSL library.\n# We need evp.h from OpenSSL.","WITH_OPENSSL_INCLUDE=\nWITH_OPENSSL_LIB=\nif test \"$with_crypto\" = openssl; then\n# If we have pkgconfig make sure CPPFLAGS are setup correctly for the OpenSSL\n# -I include path.\nAC_PATH_TOOL([PKGCONFIG], [pkg-config], [no], [$PATH:/usr/bin:/usr/local/bin])\nif test \"x$PKGCONFIG\" != \"xno\"; then\n CPPFLAGS=\"$CPPFLAGS $($PKGCONFIG --cflags libcrypto)\"\n WITH_OPENSSL_LIB=$($PKGCONFIG --libs libcrypto)\nelse\n WITH_OPENSSL_LIB=-lcrypto\nfi","AC_CHECK_HEADERS([openssl/evp.h], [], [\n AC_MSG_ERROR([missing required OpenSSL header])\n])\nAC_CHECK_HEADERS([openssl/rsa.h], [], [\n AC_MSG_ERROR([missing required OpenSSL header])\n])\nAC_CHECK_HEADERS([openssl/dsa.h], [], [\n AC_MSG_ERROR([missing required OpenSSL header])\n])","AC_CHECK_LIB(crypto, EVP_DigestInit_ex, [], [\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\n])","AC_CHECK_LIB(crypto, EVP_MD_CTX_new, [\n AC_DEFINE(HAVE_EVP_MD_CTX_NEW, 1, [Define to 1 if OpenSSL has EVP_MD_CTX_new])\n AC_SUBST(HAVE_EVP_MD_CTX_NEW, [1])\n ], [\n AC_CHECK_LIB(crypto, EVP_MD_CTX_create, [], [\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\n ])\n])","AC_CHECK_LIB(crypto, EVP_PKEY_CTX_new, [], [\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\n])","AC_CHECK_LIB(crypto, DSA_set0_key, [\n AC_DEFINE(HAVE_DSA_SET0_KEY, 1, [Define to 1 if OpenSSL has DSA_set0_key])\n AC_SUBST(HAVE_DSA_SET0_KEY, [1])\n ], []\n)","AC_CHECK_LIB(crypto, DSA_set0_pqg, [\n AC_DEFINE(HAVE_DSA_SET0_PQG, 1, [Define to 1 if OpenSSL has DSA_set0_pqg])\n AC_SUBST(HAVE_DSA_SET0_PQG, [1])\n ], []\n)","AC_CHECK_LIB(crypto, DSA_SIG_set0, [\n AC_DEFINE(HAVE_DSA_SIG_SET0, 1, [Define to 1 if OpenSSL has DSA_SIG_set0])\n AC_SUBST(HAVE_DSA_SIG_SET0, [1])\n ], []\n)","AC_CHECK_LIB(crypto, RSA_set0_key, [\n AC_DEFINE(HAVE_RSA_SET0_KEY, 1, [Define to 1 if OpenSSL has RSA_set0_key])\n AC_SUBST(HAVE_RSA_SET0_KEY, [1])\n ], []\n)","AC_CHECK_LIB(crypto, BN_bn2binpad, [\n AC_DEFINE(HAVE_BN2BINPAD, 1, [Define to 1 if OpenSSL has BN_bn2binpad])\n AC_SUBST(HAVE_BN2BINPAD, [1])\n ], []\n)","fi","AM_CONDITIONAL([WITH_OPENSSL],[test \"$with_crypto\" = openssl])\nAC_SUBST(WITH_OPENSSL_INCLUDE)\nAC_SUBST(WITH_OPENSSL_LIB)","#=================\n# Check for libgcrypt library.\nWITH_LIBGCRYPT_INCLUDE=\nWITH_LIBGCRYPT_LIB=\nif test \"$with_crypto\" = libgcrypt ; then\n # libgcrypt 1.8.5 onwards ships a pkg-config file so prefer that\n PKG_CHECK_MODULES([LIBGCRYPT], [libgcrypt], [have_libgcrypt=yes], [have_libgcrypt=no])\n if test \"$have_libgcrypt\" = \"yes\"; then\n WITH_LIBGCRYPT_INCLUDE=\"$LIBGCRYPT_CFLAGS\"\n WITH_LIBGCRYPT_LIB=\"$LIBGCRYPT_LIBS\"\n else\n AC_PATH_TOOL(LIBGCRYPT_CONFIG, libgcrypt-config, notfound)\n if test notfound != \"$LIBGCRYPT_CONFIG\" ; then\n WITH_LIBGCRYPT_INCLUDE=`$LIBGCRYPT_CONFIG --cflags`\n WITH_LIBGCRYPT_LIB=`$LIBGCRYPT_CONFIG --libs`\n fi\n if test -z \"$WITH_LIBGCRYPT_LIB\" ; then\n AC_MSG_ERROR([libgcrypt not found])\n fi\n fi\nfi","AM_CONDITIONAL([WITH_LIBGCRYPT],[test \"$with_crypto\" = libgcrypt])\nAC_SUBST(WITH_LIBGCRYPT_INCLUDE)\nAC_SUBST(WITH_LIBGCRYPT_LIB)","#=================\n# Check for magic library.\nWITH_MAGIC_INCLUDE=\nWITH_MAGIC_LIB=","AC_CHECK_HEADER([magic.h], [\n AC_CHECK_LIB(magic, magic_open, [\n WITH_MAGIC_INCLUDE=\n WITH_MAGIC_LIB=\"-lmagic\"\n ],[\n AC_MSG_ERROR([missing required library 'libmagic']) \n ])\n],[\n AC_MSG_ERROR([missing required header magic.h]) \n])","AC_SUBST(WITH_MAGIC_INCLUDE)\nAC_SUBST(WITH_MAGIC_LIB)","#=================\n# Check for popt library.\nWITH_POPT_INCLUDE=\nWITH_POPT_LIB=","AC_CHECK_HEADER([popt.h], [\n AC_CHECK_LIB(popt, poptGetContext, [\n WITH_POPT_INCLUDE=\n WITH_POPT_LIB=\"-lpopt\"\n ],[\n AC_MSG_ERROR([missing required library popt])\n ])\n],[\n AC_MSG_ERROR([missing required header popt.h])\n])","AC_SUBST(WITH_POPT_INCLUDE)\nAC_SUBST(WITH_POPT_LIB)","#=================\n# Check for libarchive library.\nAC_ARG_WITH([archive], [AS_HELP_STRING([--with-archive], [build rpm2archive - requires libarchive])],\n [],\n [with_archive=yes])","WITH_ARCHIVE_INCLUDE=\nWITH_ARCHIVE_LIB=\nAS_IF([test \"$with_archive\" != no],[\n AC_CHECK_HEADER([archive.h], [\n AC_CHECK_LIB(archive, archive_write_open_filename, [\n WITH_ARCHIVE_INCLUDE=\n WITH_ARCHIVE_LIB=\"-larchive\"\n ],[\n AC_MSG_ERROR([missing required library 'libarchive'])\n ])\n],[\n AC_MSG_ERROR([missing required header archive.h])\n ])\n])","AC_SUBST(WITH_ARCHIVE_INCLUDE)\nAC_SUBST(WITH_ARCHIVE_LIB)\nAM_CONDITIONAL(WITH_ARCHIVE,[test \"$with_archive\" = yes])","#=================\n# Check for elfutils libdw library with dwelf_elf_gnu_build_id.\nAS_IF([test \"x$enable_libelf\" != \"xno\"], [\n WITH_LIBDW_LIB=\n AS_IF([test \"$WITH_LIBELF\" = yes],[\n AC_CHECK_HEADERS([elfutils/libdwelf.h],[\n # dwelf_elf_gnu_build_id was introduced in elfutils 0.159\n AC_CHECK_LIB(dw, dwelf_elf_gnu_build_id, [\n AC_DEFINE(HAVE_LIBDW, 1,\n [Define to 1 if you have elfutils libdw library])\n WITH_LIBDW_LIB=\"-ldw\"\n WITH_LIBDW=yes\n # whether libdw supports compressed ELF objects\n AC_CHECK_LIB(dw, dwelf_elf_begin, [\n AC_DEFINE(HAVE_DWELF_ELF_BEGIN, 1, [Have dwelf_elf_begin?])\n ])\n ])\n ])\n ])\n])\nAC_SUBST(WITH_LIBDW_LIB)\nAM_CONDITIONAL(LIBDW,[test \"$WITH_LIBDW\" = yes])","#=================\n# Process --enable-ndb\nAC_ARG_ENABLE([ndb], [AS_HELP_STRING([--enable-ndb],[enable the new rpm database format])],\n[case \"$enable_ndb\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --enable-ndb])\n ;;\nesac],\n[enable_ndb=no])\nAS_IF([test \"$enable_ndb\" = yes],[\n AC_DEFINE(ENABLE_NDB, 1, [Enable new rpm database format?])\n AC_CHECK_FUNCS(mremap, [], [], [#include <sys/mman.h>])\n])\nAM_CONDITIONAL([NDB], [test \"$enable_ndb\" = yes])","#=================\n# Process --enable-bdb-ro\nAC_ARG_ENABLE([bdb-ro], [AS_HELP_STRING([--enable-bdb-ro (EXPERIMENTAL)],[enable the read-only Berkeley DB code])],\n[case \"$enable_bdb_ro\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --enable-bdb-ro])\n ;;\nesac],\n[enable_bdb_ro=no])\nAS_IF([test \"$enable_bdb_ro\" = yes],[\n AC_DEFINE(WITH_BDB_RO, 1, [Build with read-only Berkeley DB])\n])\nAM_CONDITIONAL([BDB_RO], [test \"$enable_bdb_ro\" = yes])","# Check for SQLITE support\nAC_ARG_ENABLE([sqlite],\n [AS_HELP_STRING([--enable-sqlite=@<:@yes/no/auto@:>@)],\n [build with sqlite rpm database format support (default=yes)])],\n [enable_sqlite=\"$enableval\"],\n [enable_sqlite=yes])","AS_IF([test \"x$enable_sqlite\" != \"xno\"], [\n PKG_CHECK_MODULES([SQLITE], [sqlite3 >= 3.22.0], [have_sqlite=yes], [have_sqlite=no])\n AS_IF([test \"$enable_sqlite\" = \"yes\"], [\n if test \"$have_sqlite\" = \"no\"; then\n AC_MSG_ERROR([--enable-sqlite specified, but not available])\n fi\n ])\n])","if test \"x$have_sqlite\" = \"xyes\"; then\n AC_DEFINE([WITH_SQLITE], [1], [Define if SQLITE is available])\n SQLITE_REQUIRES=sqlite\n AC_SUBST(SQLITE_REQUIRES)\nfi\nAM_CONDITIONAL([SQLITE], [test \"x$have_sqlite\" = \"xyes\"])","AM_GNU_GETTEXT_VERSION([0.18.2])\nAM_GNU_GETTEXT([external])\nAM_ICONV","dnl Checks for header files we can live without.\nAC_HEADER_STDC\ndnl glibc and autoconf don't really play well together.\ndnl glibc will produce a warning when including the wrong header.\ndnl but still define major and minor. Causing us to include the header\ndnl that produces a giant warning for each major/minor use.\ndnl Use -Werror to work around that.\nold_CFLAGS=$CFLAGS\nCFLAGS=\"$CFLAGS -Werror\"\nAC_HEADER_MAJOR\nCFLAGS=$old_CFLAGS\nAC_STRUCT_DIRENT_D_TYPE","AC_CHECK_HEADERS(limits.h)\nAC_CHECK_HEADERS(getopt.h)","AC_CHECK_HEADERS(sys/utsname.h)","AC_CHECK_HEADERS(sys/systemcfg.h)\nAC_CHECK_HEADERS(sys/param.h)\nAC_CHECK_HEADERS(sys/auxv.h)","dnl look for libc features","dnl Check for missing typedefs\nAC_TYPE_MODE_T\nAC_TYPE_OFF_T\nAC_TYPE_PID_T\nAC_TYPE_SIZE_T","dnl Checks for library functions.\nAC_CHECK_FUNCS(putenv)\nAC_CHECK_FUNCS(mempcpy)\nAC_CHECK_FUNCS(fdatasync)\nAC_CHECK_DECLS(fdatasync, [], [], [#include <unistd.h>])\nAC_CHECK_FUNCS(lutimes)\nAC_CHECK_FUNCS(mergesort)\nAC_CHECK_FUNCS(getauxval)\nAC_CHECK_FUNCS(setprogname, [], [], [#include <stdlib.h>])\nAC_CHECK_FUNCS(syncfs)\nAC_CHECK_FUNCS(sched_getaffinity, [], [], [#include <sched.h>])\nAC_CHECK_FUNCS(unshare, [], [], [#include <sched.h>])","AC_MSG_CHECKING([whether __progname is defined])\nAC_LINK_IFELSE([AC_LANG_PROGRAM([extern const char *__progname;],\n\t [if (*__progname == 0) return 0;])],\n\t AC_DEFINE([HAVE___PROGNAME], [1], [Define if __progname is defined])\n\t AC_MSG_RESULT([yes]),\n\t AC_MSG_RESULT([no]))","AC_REPLACE_FUNCS(stpcpy stpncpy)","AC_CHECK_FUNCS([secure_getenv __secure_getenv])","AC_CHECK_FUNCS(\n [mkstemp getcwd basename dirname realpath setenv unsetenv regcomp lchown \\"," utimes getline localtime_r statvfs getaddrinfo \\\n openat mkdirat fstatat ],"," [], [AC_MSG_ERROR([function required by rpm])])","AC_LIBOBJ(fnmatch)","dnl check if python is requested\nAC_ARG_ENABLE(python, [AS_HELP_STRING([--enable-python],[build rpm python bindings])],\n[case \"$enable_python\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --enable-python])\n ;;\nesac],\n[enable_python=no])","WITH_PYTHON_SUBPACKAGE=0\nAS_IF([test \"$enable_python\" = yes],[\n PYTHON=\"${PYTHON:-python3}\"\n AM_PATH_PYTHON([3.1],[\n PKG_CHECK_MODULES([PYTHON], [python-${PYTHON_VERSION}], [WITH_PYTHON_SUBPACKAGE=1])\n AC_SUBST(PYTHON_CFLAGS)\n AC_SUBST(PYTHON_LIB)\n ])\n])","AM_CONDITIONAL(ENABLE_PYTHON,[test \"$WITH_PYTHON_SUBPACKAGE\" = 1])","AC_PATH_PROG(DOXYGEN, doxygen, no)\nAC_CHECK_PROG(HAVE_DOT,[dot],[YES],[NO])\nAC_PATH_PROG(PANDOC, pandoc, no)","WITH_SELINUX_LIB=\nAC_ARG_WITH(selinux, [AS_HELP_STRING([--with-selinux],[build with selinux support])],\n[case \"$with_selinux\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --with-selinux])\n ;;\nesac],\n[with_selinux=no])","AS_IF([test \"$with_selinux\" = yes],[\n AC_CHECK_HEADER([selinux/selinux.h],[\n save_LIBS=\"$LIBS\"\n AC_CHECK_LIB([selinux],[is_selinux_enabled],[],[\n AC_MSG_ERROR([--with-selinux given, but is_selinux_enabled not found in libselinux])])\n AC_CHECK_LIB([selinux],[selinux_getpolicytype],[],[\n AC_MSG_ERROR([--with-selinux given, but selinux_getpolicytype not found in libselinux])])\n AC_CHECK_LIB([selinux],[selinux_reset_config],[],[\n AC_MSG_ERROR([--with-selinux given, but selinux_reset_config not found in libselinux])])\n AC_CHECK_LIB([selinux],[setexecfilecon],[\n AC_DEFINE([HAVE_SETEXECFILECON],[1],[Define to 1 if SELinux setexecfilecon is present])])\n LIBS=\"$save_LIBS\"\n ],[\n AC_MSG_ERROR([--with-selinux given, but selinux/selinux.h not found])\n ])"," AC_CHECK_HEADER([selinux/label.h],[\n save_LIBS=\"$LIBS\"\n AC_CHECK_LIB([selinux],[selabel_close],[],[\n AC_MSG_ERROR([--with-selinux given, but selabel_close not found in libselinux])])\n AC_CHECK_LIB([selinux],[selabel_lookup_raw],[],[\n AC_MSG_ERROR([--with-selinux given, but selabel_lookup_raw not found in libselinux])])\n AC_CHECK_LIB([selinux],[selabel_open],[],[\n AC_MSG_ERROR([--with-selinux given, but selabel_open not found in libselinux])])\n LIBS=\"$save_LIBS\"\n ],[\n AC_MSG_ERROR([--with-selinux given, but selinux/label.h not found])\n ])\n])","AS_IF([test \"$with_selinux\" = yes],[\n AC_DEFINE(WITH_SELINUX, 1, [Build with selinux support?])\n WITH_SELINUX_LIB=\"-lselinux\"\n])\nAC_SUBST(WITH_SELINUX_LIB)\nAC_SUBST(WITH_SEMANAGE_LIB)\nAM_CONDITIONAL(SELINUX,[test \"$with_selinux\" = yes])","# libimaevm\nwith_iamevm=no\nAC_ARG_WITH(imaevm, [AS_HELP_STRING([--with-imaevm],[build with imaevm support])])\nif test \"$with_imaevm\" = yes ; then\n AC_MSG_CHECKING([libimaevm >= 1.0])\n AC_COMPILE_IFELSE(\n [AC_LANG_PROGRAM(\n [[#include <imaevm.h>]],\n [[return sign_hash(NULL, NULL, 0, NULL, NULL, NULL);]]\n )],\n [AC_MSG_RESULT(yes)\n AC_DEFINE(WITH_IMAEVM, 1, [Build with imaevm support?])\n WITH_IMAEVM_LIB=\"-limaevm\"\n ],\n [AC_MSG_ERROR([libimaevm not present or too old (< 1.0)])]\n )\nfi\nAM_CONDITIONAL(WITH_IMAEVM,[test \"$with_imaevm\" = yes])\nAC_SUBST(WITH_IMAEVM_LIB)","# fsverity\nAC_ARG_WITH([fsverity], [AS_HELP_STRING([--with-fsverity],[build with fsverity support])],[],[with_fsverity=no])\nif test \"$with_fsverity\" = yes ; then\n AC_MSG_CHECKING([libfsverity])\n AC_COMPILE_IFELSE(\n [AC_LANG_PROGRAM(\n [[#include <libfsverity.h>]],\n [[return libfsverity_sign_digest(NULL, NULL, NULL, NULL);]]\n )],\n [AC_MSG_RESULT(yes)\n AC_DEFINE(WITH_FSVERITY, 1, [Build with fsverity support?])\n WITH_FSVERITY_LIB=\"-lfsverity\"\n ],\n [AC_MSG_ERROR([--with-fsverity given, libfsverity or libfsverity.h missing])]\n )\nfi\nAM_CONDITIONAL(WITH_FSVERITY,[test \"$with_fsverity\" = yes])\nAC_SUBST(WITH_FSVERITY_LIB)","# libcap\nWITH_CAP_LIB=\nAC_ARG_WITH(cap, [AS_HELP_STRING([--with-cap],[build with capability support])],\n[case \"$with_cap\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --with-cap])\n ;;\nesac],\n[with_cap=no])","AS_IF([test \"$with_cap\" = yes],[\n AC_CHECK_HEADER([sys/capability.h],[\n AC_CHECK_LIB(cap,[cap_get_file], [\n with_cap=yes\n save_LIBS=\"$LIBS\"\n AC_CHECK_LIB(cap,[cap_compare], [\n AC_DEFINE(HAVE_CAP_COMPARE, 1, [Have cap_compare function?])\n ])\n LIBS=\"$save_LIBS\"\n ],[\n AC_MSG_ERROR([--with-cap given, but libcap not found])])\n ],[\n AC_MSG_ERROR([--with-cap given, but sys/capability.h not found])\n ])\n])","AS_IF([test \"$with_cap\" = yes],[\n AC_DEFINE(WITH_CAP, 1, [Build with capability support?])\n WITH_CAP_LIB=\"-lcap\"\n])\nAC_SUBST(WITH_CAP_LIB)\nAM_CONDITIONAL(CAP,[test \"$with_cap\" = yes])","WITH_ACL_LIB=\nAC_ARG_WITH(acl, [AS_HELP_STRING([--with-acl],[build with acl support])],\n[case \"$with_acl\" in\nyes|no) ;;\n*) AC_MSG_ERROR([invalid argument to --with-acl])\n ;;\nesac],\n[with_acl=no])","AS_IF([test \"$with_acl\" = yes],[\n dnl verification uses non-portable acl_equiv_mode() \n AC_CHECK_HEADER([acl/libacl.h],[\n AC_CHECK_LIB(acl,[acl_equiv_mode],[with_acl=yes],[\n AC_MSG_ERROR([--with-acl given, but libacl not found or not suitable])])\n ],[\n AC_MSG_ERROR([--with-acl given, but acl/libacl.h not found])\n ])\n])","AS_IF([test \"$with_acl\" = yes],[\n AC_DEFINE(WITH_ACL, 1, [Build with acl support?])\n WITH_ACL_LIB=\"-lacl\"\n])\nAC_SUBST(WITH_ACL_LIB)\nAM_CONDITIONAL(ACL,[test \"$with_acl\" = yes])","PKG_CHECK_MODULES([LUA],\n [lua >= 5.2],\n [],\n [AC_MSG_ERROR([lua not present or too old)])])\nAC_SUBST(LUA_CFLAGS)\nAC_SUBST(LUA_LIBS)","AC_ARG_WITH([readline],[AS_HELP_STRING([--with-readline=@<:@yes/no/auto@:>@], [build with readline support])], [with_readline=\"$withval\"], [with_readline=\"auto\"])\nAS_IF([test \"$with_readline\" != \"no\"],[\n PKG_CHECK_MODULES([READLINE], [readline], [have_readline=yes], [have_readline=no])\n AS_IF([test \"$with_readline\" = \"yes\"],[\n if test \"$have_readline\" = \"no\"; then\n AC_MSG_ERROR([readline support requested but not present])\n fi\n ])\n])\nif test \"$have_readline\" = \"yes\"; then\n AC_DEFINE([HAVE_READLINE], [1], [Define if readline is available])\n AC_SUBST(READLINE_CFLAGS)\n AC_SUBST(READLINE_LIBS)\nfi\nAM_CONDITIONAL(WITH_READLINE, [test \"$have_readline\" = yes])","\nAC_ARG_ENABLE(plugins, [AS_HELP_STRING([--disable-plugins],[build without plugin support])],,[enable_plugins=yes])\nAS_IF([test \"$enable_plugins\" = yes],[\n AC_DEFINE(ENABLE_PLUGINS, 1, [Build with plugin support?])\n])\nAM_CONDITIONAL(ENABLE_PLUGINS,[test \"$enable_plugins\" = yes])","AC_ARG_ENABLE(inhibit_plugin, [AS_HELP_STRING([--disable-inhibit-plugin],[build without systemd inhibit plugin])],,[enable_inhibit_plugin=yes])\nAS_IF([test \"$enable_inhibit_plugin\" = yes],[\n AC_DEFINE(ENABLE_INHIBIT_PLUGIN, 1, [Build with systemd inhibit plugin?])\n])\nAM_CONDITIONAL(ENABLE_INHIBIT_PLUGIN,[test \"$enable_inhibit_plugin\" = yes])","with_dbus=no\nAS_IF([test \"$enable_plugins\" != no],[\n AS_IF([test \"$enable_inhibit_plugin\" != no],[\n PKG_CHECK_MODULES([DBUS],\n [dbus-1 >= 1.3],\n [AC_DEFINE(DBUS, 1, [Build with dbus support?]) with_dbus=yes],\n [with_dbus=no])\n AC_SUBST(DBUS_CFLAGS)\n AC_SUBST(DBUS_LIBS)\n ])\n])\nAM_CONDITIONAL(DBUS, [test \"$with_dbus\" = yes])","AS_IF([test \"$enable_plugins\" != no],[\n AC_CHECK_FUNCS(lsetxattr, [], [], [#include <sys/xattr.h>])\n])\nAM_CONDITIONAL(IMA, [test \"x$ac_cv_func_lsetxattr\" = xyes])","AS_IF([test \"$enable_plugins\" != no],[\nAC_CHECK_HEADERS([linux/fsverity.h],[FSVERITY_IOCTL=\"yes\"])\n])\nAM_CONDITIONAL(FSVERITY_IOCTL,[test \"x$FSVERITY_IOCTL\" = xyes])","#=================\n# Check for fapolicyd support\nAC_ARG_WITH(fapolicyd,\nAS_HELP_STRING([--with-fapolicyd],[build with File Access Policy Daemon support]),\nwith_fapolicyd=$withval,\nwith_fapolicyd=auto)\nAM_CONDITIONAL(FAPOLICYD,[test \"$with_fapolicyd\" = yes])","#=================\n# Check for audit library.\nAC_ARG_WITH(audit,\nAS_HELP_STRING([--with-audit],[Linux audit plugin]),\nwith_audit=$withval,\nwith_audit=auto)","WITH_AUDIT_LIB=\nAS_IF([test \"$enable_plugins\" != no],[\n AS_IF([test \"x$with_audit\" != xno],[\n AC_SEARCH_LIBS([audit_open],[audit],[\n WITH_AUDIT_LIB=\"$ac_res\"\n AC_DEFINE(WITH_AUDIT, 1, [libaudit support])\n with_audit=yes\n ],[\n if test \"x$with_audit\" != xauto; then\n AC_MSG_ERROR([missing audit library])\n fi\n ])\n ])\n])\nAC_SUBST(WITH_AUDIT_LIB)\nAM_CONDITIONAL(AUDIT,[test \"$with_audit\" = yes])","user_with_uid0=$(awk -F: '$3==0 {print $1;exit}' /etc/passwd)\ngroup_with_gid0=$(awk -F: '$3==0 {print $1;exit}' /etc/group)\nif test -z \"$user_with_uid0\" ; then user_with_uid0=root ; fi\nif test -z \"$group_with_gid0\" ; then group_with_gid0=root ; fi\nAC_DEFINE_UNQUOTED([UID_0_USER],[\"$user_with_uid0\"],[Get the user name having userid 0])\nAC_DEFINE_UNQUOTED([GID_0_GROUP],[\"$group_with_gid0\"],[Get the group name having groupid 0])","#\n# get rid of the 4-th tuple, if config.guess returned \"linux-gnu\" for host_os\n#\nhost_os_gnu=-gnu\nif echo \"$host_os\" | grep '.*-gnulibc1$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnulibc1$//'`\nfi\nif echo \"$host_os\" | grep '.*-gnueabihf$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnueabihf$//'`\n\thost_os_gnu=-gnueabihf\nfi\nif echo \"$host_os\" | grep '.*-gnueabi$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnueabi$//'`\n\thost_os_gnu=-gnueabi\nfi\nif echo \"$host_os\" | grep '.*-gnuabi64$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnuabi64$//'`\n\thost_os_gnu=-gnuabi64\nfi\nif echo \"$host_os\" | grep '.*-gnu$' > /dev/null ; then\n\thost_os=`echo \"${host_os}\" | sed 's/-gnu$//'`\nfi\nif echo \"$host_os\" | grep '.*-gnu[[^-]]*$' > /dev/null ; then\n\tAC_MSG_ERROR([unrecognized GNU build triplet $host_os])\nfi","changequote(<, >)\nhost_os_exact=\"${host_os}\"\nhost_os_major=`echo \"${host_os}\" | sed 's/\\..*$//'`\nhost_os_noversion=`echo \"${host_os}\" | sed 's/[0-9]*\\..*$//'`\nchangequote([, ])","dnl permit overriding build_vendor for \"canonical rpm vendor\"\nRPMCANONVENDOR=\"$build_vendor\"\nAC_ARG_WITH([vendor], \n AS_HELP_STRING([--with-vendor=VENDOR], [specify rpm vendor name]),\n [RPMCANONVENDOR=$withval])\nAC_DEFINE_UNQUOTED([RPMCANONVENDOR],[\"${RPMCANONVENDOR}\"],[canonical vendor])\n\t \nRPMCANONOS=\"$host_os_noversion\"\nRPMCANONGNU=\"$host_os_gnu\"\nAC_SUBST(RPMCANONVENDOR)\nAC_SUBST(RPMCANONOS)\nAC_SUBST(RPMCANONGNU)","RUNDIR=\"/run\"\nAC_ARG_WITH([rundir], \n AS_HELP_STRING([--with-rundir=RUNDIR], [specify run-time variable directory]),\n [RUNDIR=$withval])\nAC_DEFINE_UNQUOTED([RUNDIR],[\"${RUNDIR}\"],[run-time variable directory])\nAC_SUBST(RUNDIR)","if test X\"$prefix\" = XNONE ; then\n usrprefix=\"$ac_default_prefix\"\nelse\n usrprefix=$prefix\nfi","RPMCONFIGDIR=\"`echo ${usrprefix}/lib/rpm`\"\nAC_SUBST(RPMCONFIGDIR)","AC_SUBST(OBJDUMP)","AM_CONDITIONAL([DOXYGEN],[test \"$DOXYGEN\" != no])\nAM_CONDITIONAL([PANDOC],[test \"$PANDOC\" != no])","AC_PATH_PROG(AUTOM4TE,autom4te,:)","AC_SUBST([dirstamp],[\\${am__leading_dot}dirstamp])","AC_CONFIG_FILES([Makefile\n\trpmio/Makefile lib/Makefile build/Makefile sign/Makefile\n\tpo/Makefile.in scripts/Makefile fileattrs/Makefile\n\tmisc/Makefile \n\tdocs/Makefile\n\tdocs/man/Makefile\n\tpython/Makefile\n \tluaext/Makefile\n \ttests/Makefile\n \tplugins/Makefile\n\tpython/setup.py\n ])\nAC_OUTPUT"],"string":"[\n \"AC_PREREQ(2.61)\\nAC_INIT(rpm, 4.17.90, rpm-maint@lists.rpm.org)\",\n \"AC_CONFIG_SRCDIR([rpm.c])\\nAC_CONFIG_HEADERS([config.h])\\nAC_CONFIG_MACRO_DIR([m4])\\nAC_CONFIG_AUX_DIR([build-aux])\",\n \"AM_INIT_AUTOMAKE([1.10 foreign tar-pax dist-bzip2 subdir-objects nostdinc])\\ndnl Allow silent build on automake versions that support it\\nm4_ifdef([AM_SILENT_RULES], [AM_SILENT_RULES])\",\n \"AC_CONFIG_TESTDIR(tests)\",\n \"AC_USE_SYSTEM_EXTENSIONS\",\n \"AC_DISABLE_STATIC\",\n \"PKG_PROG_PKG_CONFIG\",\n \"dnl Checks for programs.\\nAC_PROG_CXX\\nAC_PROG_AWK\\nAC_PROG_CC\\nAC_PROG_CPP\\nAC_PROG_INSTALL\\nAC_PROG_LN_S\\nAC_PROG_MAKE_SET\\nAC_PROG_LIBTOOL\",\n \"AC_SUBST(__CC, $CC)\\nAC_PROG_CC_C99\\nif test \\\"$ac_cv_prog_cc_c99\\\" = no; then\\n AC_MSG_ERROR([ISO C99 capable compiler required])\\nfi\",\n \"AS=${AS-as}\\nAC_SUBST(AS)\\nif test \\\"$GCC\\\" = yes; then\\n cflags_to_try=\\\"-fno-strict-aliasing -fno-strict-overflow -fno-delete-null-pointer-checks -Wempty-body\\\"\\n AC_MSG_CHECKING([supported compiler flags])\\n old_cflags=$CFLAGS\\n echo\\n for flag in $cflags_to_try; do\\n CFLAGS=\\\"$CFLAGS $flag -Werror\\\"\\n AC_LINK_IFELSE([AC_LANG_PROGRAM([[]], [[#include <alloca.h>\\n\\t\\t\\t\\t\\t\\talloca(100);]])],[\\n echo \\\" $flag\\\"\\n RPMCFLAGS=\\\"$RPMCFLAGS $flag\\\"\\n ],[])\\n CFLAGS=$old_cflags\\n done\\n RPMCFLAGS=\\\"-Wall -Wpointer-arith -Wmissing-prototypes -Wstrict-prototypes $RPMCFLAGS\\\"\\nfi\\nAC_ARG_ENABLE(werror, [AS_HELP_STRING([--enable-werror], [build with -Werror])],\\n\\t\\t[RPMCFLAGS=\\\"$RPMCFLAGS -Werror\\\"], [])\\nAC_SUBST(RPMCFLAGS)\",\n \"AC_SYS_LARGEFILE\",\n \"dnl AM_DISABLE_SHARED\\nAM_PROG_LIBTOOL\",\n \"AC_CHECK_TOOL(AR, ar, :)\",\n \"dnl\\ndnl use defaults if cross-compiling, otherwise use the default path.\\ndnl\\nif test \\\"$cross_compiling\\\" = \\\"yes\\\"; then\\n MYPATH=\\\":\\\"\\nelse\\n MYPATH=$PATH\\nfi\",\n \"dnl\\ndnl Find some common programs\\ndnl\\nAC_PATH_PROGS(__7ZIP, [7zip 7za 7z], /usr/bin/7za, $MYPATH)\\nAC_PATH_PROG(__BZIP2, bzip2, /usr/bin/bzip2, $MYPATH)\\nAC_PATH_PROG(__CAT, cat, /bin/cat, $MYPATH)\\nAC_PATH_PROG(__CHMOD, chmod, /bin/chmod, $MYPATH)\\nAC_PATH_PROG(__CHOWN, chown, /bin/chown, $MYPATH)\\nAC_PATH_PROG(__CP, cp, /bin/cp, $MYPATH)\\nAC_PATH_PROG(__CURL, curl, /usr/bin/curl, $MYPATH)\\nAC_PATH_PROG(__FILE, file, /usr/bin/file, $MYPATH)\\nAC_PATH_PROGS(__GPG, gpg2 gpg, /usr/bin/gpg2, $MYPATH)\\nAC_PATH_PROG(__GREP, grep, /bin/grep, $MYPATH)\\nAC_PATH_PROG(__GZIP, gzip, /bin/gzip, $MYPATH)\\nAC_PATH_PROG(__UNZIP, unzip, /usr/bin/unzip, $MYPATH)\\nAC_PATH_PROG(__ID, id, /usr/bin/id, $MYPATH)\\nAC_PATH_PROG(__INSTALL, install, /usr/bin/install, $MYPATH)\\nAC_PATH_PROG(__LRZIP, lrzip, /usr/bin/lrzip, $MYPATH)\\nAC_PATH_PROG(__LZIP, lzip, /usr/bin/lzip, $MYPATH)\\nAC_PATH_PROG(__XZ, xz, /usr/bin/xz, $MYPATH)\\nAC_PATH_PROG(__GEM, gem, /usr/bin/gem, $MYPATH)\\nAC_PATH_PROG(__MAKE, make, /usr/bin/make, $MYPATH)\\nAC_PATH_PROG(__MKDIR, mkdir, /bin/mkdir, $MYPATH)\\nAC_PATH_PROG(__MV, mv, /bin/mv, $MYPATH)\\nAC_PATH_PROG(__PATCH, patch, /usr/bin/patch, $MYPATH)\\nAC_PATH_PROG(__RM, rm, /bin/rm, $MYPATH)\\nAC_PATH_PROG(__SED, sed, /bin/sed, $MYPATH)\\nAC_PATH_PROG(__TAR, tar, /bin/tar, $MYPATH)\\nAC_PATH_PROG(__ZSTD, zstd, /usr/bin/zstd, $MYPATH)\",\n \"AC_PATH_PROG(__LD, ld, /usr/bin/ld, $MYPATH)\\nAC_PATH_PROG(__OBJDUMP, objdump, /usr/bin/objdump, $MYPATH)\\nAC_PATH_PROG(__STRIP, strip, /usr/bin/strip, $MYPATH)\\nAC_PATH_PROG(__FIND_DEBUGINFO, find-debuginfo, /usr/bin/find-debuginfo, $MYPATH)\",\n \"AC_PATH_PROG(__GIT, git, /usr/bin/git, $MYPATH)\\nAC_PATH_PROG(__HG, hg, /usr/bin/hg, $MYPATH)\\nAC_PATH_PROG(__BZR, bzr, /usr/bin/bzr, $MYPATH)\\nAC_PATH_PROG(__QUILT, quilt, /usr/bin/quilt, $MYPATH)\",\n \"AC_PATH_PROG(__FAKECHROOT, fakechroot, no, $MYPATH)\\nAM_CONDITIONAL(HAVE_FAKECHROOT, [test \\\"$__FAKECHROOT\\\" != \\\"no\\\"])\",\n \"dnl see if we have a mkdir that supports `-p' for rpmbuild's purposes\\nAC_PROG_MKDIR_P\\nif ! echo $MKDIR_P | grep -q mkdir; then \\n __MKDIR_P=\\\"`echo ${prefix}/lib/rpm/mkinstalldirs`\\\"\\nelse\\n __MKDIR_P=$MKDIR_P\\nfi\\nAC_DEFINE_UNQUOTED(__MKDIR_P, \\\"${__MKDIR_P}\\\",\\n[A full path to a program, possibly with arguments, that will create a\\n directory and all necessary parent directories, ala 'mkdir -p'])\\nAC_SUBST(__MKDIR_P)\",\n \"#=================\\n# Check for zlib library. \",\n \"WITH_ZLIB_INCLUDE=\\nWITH_ZLIB_LIB=\",\n \"AC_CHECK_HEADERS([zlib.h],[\\n AS_IF([test -z \\\"${WITH_ZLIB_LIB}\\\"],[\\n for zlib in z gz ; do\\n AC_CHECK_LIB(${zlib}, gzread, \\n\\t[WITH_ZLIB_LIB=\\\"-l${zlib}\\\"; break])\\n done\",\n \"dnl zlib-1.0.4 has not gzseek\\n AC_CHECK_LIB(${zlib}, gzseek, [AC_DEFINE(HAVE_GZSEEK, 1, [Define as 1 if your zlib has gzseek()])])\\n ])\\n],[\\n AC_MSG_ERROR([missing required header zlib.h])\\n])\",\n \"AC_SUBST(WITH_ZLIB_INCLUDE)\\nAC_SUBST(WITH_ZLIB_LIB)\",\n \"#=================\\n# Check for bzip2 library.\",\n \"AC_CHECK_HEADERS([bzlib.h],[\\n AC_CHECK_LIB(bz2, BZ2_bzread, [WITH_BZ2_LIB=-lbz2])\\n])\\nAC_SUBST(WITH_BZ2_LIB)\",\n \"#=================\\n# Check for lzma library.\",\n \"AC_CHECK_HEADERS([lzma.h],[\\n AC_CHECK_LIB(lzma, lzma_easy_encoder, [WITH_LZMA_LIB=-llzma])\\n])\\nAC_SUBST(WITH_LZMA_LIB)\",\n \"# AC_OPENMP supports --enable/disable-openmp out of the box, but it doesn't\\n# actually give us a way to conditionalize the build based on that. Argh.\\n# Version 4.5 (201511) introduced \\\"priority\\\" clause for tasks.\\nOPENMP_CFLAGS=\\nAC_OPENMP\\nAS_IF([test \\\"x$ac_cv_prog_c_openmp\\\" != x &&\\n test \\\"x$ac_cv_prog_c_openmp\\\" != xunsupported],[\\n old_CFLAGS=$CFLAGS\\n CFLAGS=\\\"$CFLAGS $OPENMP_CFLAGS\\\"\\n AC_MSG_CHECKING([OpenMP is at least version 4.5])\\n AC_COMPILE_IFELSE(\\n [AC_LANG_PROGRAM(\\n [#include <omp.h>],\\n [#if _OPENMP < 201511\\n #error\\n #endif\\n ]\\n )],\\n [AC_MSG_RESULT([yes])\\n AC_DEFINE(ENABLE_OPENMP, 1, [Enable multithreading support?])\\n ],\\n [AC_MSG_RESULT([no])\\n OPENMP_CFLAGS=\\n if test \\\"$enable_openmp\\\" = \\\"yes\\\"; then\\n AC_MSG_ERROR([OpenMP too old])\\n fi\\n ]\\n )\\n CFLAGS=$old_CFLAGS\\n])\\nAC_SUBST(OPENMP_CFLAGS)\",\n \"#=================\\n# Check for zstd.\",\n \"AC_ARG_ENABLE([zstd],\\n [AS_HELP_STRING([--enable-zstd=@<:@yes/no/auto@:>@],\\n [build without zstd support (default=auto)])],\\n [enable_zstd=\\\"$enableval\\\"],\\n [enable_zstd=auto])\",\n \"AS_IF([test \\\"x$enable_zstd\\\" != \\\"xno\\\"], [\\n PKG_CHECK_MODULES([ZSTD], [libzstd >= 1.3.8], [have_zstd=yes], [have_zstd=no])\\n AS_IF([test \\\"$enable_zstd\\\" = \\\"yes\\\"], [\\n if test \\\"$have_zstd\\\" = \\\"no\\\"; then\\n AC_MSG_ERROR([--enable-zstd specified, but not available])\\n fi\\n ])\\n])\",\n \"if test \\\"x$have_zstd\\\" = \\\"xyes\\\"; then\\n AC_DEFINE([HAVE_ZSTD], [1], [Define if libzstd is available])\\n ZSTD_REQUIRES=libzstd\\n AC_SUBST(ZSTD_REQUIRES)\\nfi\\nAM_CONDITIONAL([HAVE_ZSTD], [test \\\"x$have_zstd\\\" = \\\"xyes\\\"])\",\n \"#=================\",\n \"dnl\\ndnl Check for features\\ndnl\",\n \"dnl Checks for libraries.\",\n \"AC_CHECK_FUNC(gethostname, [], [\\n AC_CHECK_LIB(nsl, gethostname)\\n])\",\n \"AC_CHECK_HEADERS(pthread.h)\",\n \"AC_CHECK_LIB(pthread, pthread_mutex_trylock, [], [\\n dnl OSF 5.0 has the the symbols prefixed with __ in libpthread.\\n AC_CHECK_LIB(pthread, __pthread_mutex_trylock, [], [\\n AC_CHECK_LIB(thread, mutex_lock)\\n ])\\n])\",\n \"AC_SEARCH_LIBS(dlopen, [dl])\",\n \"#=================\\n# Check for libelf library. Prefer external, otherwise none.\\nAC_ARG_ENABLE([libelf],\\n\\t\\t[AS_HELP_STRING([--enable-libelf=@<:@yes/no/auto@:>@],\\n\\t\\t\\t\\t[build with libelf support (default=yes)])],\\n\\t\\t[enable_libelf=\\\"$enableval\\\"],\\n\\t\\t[enable_libelf=yes])\",\n \"AS_IF([test \\\"x$enable_libelf\\\" != \\\"xno\\\"], [\\n WITH_LIBELF_LIB=\\n AC_CHECK_HEADER([libelf.h])\\n AC_CHECK_HEADERS([gelf.h], [\\n AC_CHECK_LIB(elf, gelf_getvernaux, [\\n AC_DEFINE(HAVE_LIBELF, 1, [Define to 1 if you have the 'elf' library (-lelf).])\\n WITH_LIBELF_LIB=\\\"-lelf\\\"\\n WITH_LIBELF=yes\\n ])\\n ])\\n])\\nAC_SUBST(WITH_LIBELF_LIB)\\nAM_CONDITIONAL(LIBELF,[test \\\"$WITH_LIBELF\\\" = yes])\",\n \"#=================\\n# Select crypto library\\nAC_ARG_WITH(crypto,\\n [AC_HELP_STRING([--with-crypto=CRYPTO_LIB],\\n [The cryptographic library to use (openssl|libgcrypt). The default is libgcrypt.])\\n ],[],\\n [with_crypto=libgcrypt])\",\n \"#=================\\n# Check for OpenSSL library.\\n# We need evp.h from OpenSSL.\",\n \"WITH_OPENSSL_INCLUDE=\\nWITH_OPENSSL_LIB=\\nif test \\\"$with_crypto\\\" = openssl; then\\n# If we have pkgconfig make sure CPPFLAGS are setup correctly for the OpenSSL\\n# -I include path.\\nAC_PATH_TOOL([PKGCONFIG], [pkg-config], [no], [$PATH:/usr/bin:/usr/local/bin])\\nif test \\\"x$PKGCONFIG\\\" != \\\"xno\\\"; then\\n CPPFLAGS=\\\"$CPPFLAGS $($PKGCONFIG --cflags libcrypto)\\\"\\n WITH_OPENSSL_LIB=$($PKGCONFIG --libs libcrypto)\\nelse\\n WITH_OPENSSL_LIB=-lcrypto\\nfi\",\n \"AC_CHECK_HEADERS([openssl/evp.h], [], [\\n AC_MSG_ERROR([missing required OpenSSL header])\\n])\\nAC_CHECK_HEADERS([openssl/rsa.h], [], [\\n AC_MSG_ERROR([missing required OpenSSL header])\\n])\\nAC_CHECK_HEADERS([openssl/dsa.h], [], [\\n AC_MSG_ERROR([missing required OpenSSL header])\\n])\",\n \"AC_CHECK_LIB(crypto, EVP_DigestInit_ex, [], [\\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\\n])\",\n \"AC_CHECK_LIB(crypto, EVP_MD_CTX_new, [\\n AC_DEFINE(HAVE_EVP_MD_CTX_NEW, 1, [Define to 1 if OpenSSL has EVP_MD_CTX_new])\\n AC_SUBST(HAVE_EVP_MD_CTX_NEW, [1])\\n ], [\\n AC_CHECK_LIB(crypto, EVP_MD_CTX_create, [], [\\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\\n ])\\n])\",\n \"AC_CHECK_LIB(crypto, EVP_PKEY_CTX_new, [], [\\n AC_MSG_ERROR([required OpenSSL library 'libcrypto' missing or too old])\\n])\",\n \"AC_CHECK_LIB(crypto, DSA_set0_key, [\\n AC_DEFINE(HAVE_DSA_SET0_KEY, 1, [Define to 1 if OpenSSL has DSA_set0_key])\\n AC_SUBST(HAVE_DSA_SET0_KEY, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, DSA_set0_pqg, [\\n AC_DEFINE(HAVE_DSA_SET0_PQG, 1, [Define to 1 if OpenSSL has DSA_set0_pqg])\\n AC_SUBST(HAVE_DSA_SET0_PQG, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, DSA_SIG_set0, [\\n AC_DEFINE(HAVE_DSA_SIG_SET0, 1, [Define to 1 if OpenSSL has DSA_SIG_set0])\\n AC_SUBST(HAVE_DSA_SIG_SET0, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, RSA_set0_key, [\\n AC_DEFINE(HAVE_RSA_SET0_KEY, 1, [Define to 1 if OpenSSL has RSA_set0_key])\\n AC_SUBST(HAVE_RSA_SET0_KEY, [1])\\n ], []\\n)\",\n \"AC_CHECK_LIB(crypto, BN_bn2binpad, [\\n AC_DEFINE(HAVE_BN2BINPAD, 1, [Define to 1 if OpenSSL has BN_bn2binpad])\\n AC_SUBST(HAVE_BN2BINPAD, [1])\\n ], []\\n)\",\n \"fi\",\n \"AM_CONDITIONAL([WITH_OPENSSL],[test \\\"$with_crypto\\\" = openssl])\\nAC_SUBST(WITH_OPENSSL_INCLUDE)\\nAC_SUBST(WITH_OPENSSL_LIB)\",\n \"#=================\\n# Check for libgcrypt library.\\nWITH_LIBGCRYPT_INCLUDE=\\nWITH_LIBGCRYPT_LIB=\\nif test \\\"$with_crypto\\\" = libgcrypt ; then\\n # libgcrypt 1.8.5 onwards ships a pkg-config file so prefer that\\n PKG_CHECK_MODULES([LIBGCRYPT], [libgcrypt], [have_libgcrypt=yes], [have_libgcrypt=no])\\n if test \\\"$have_libgcrypt\\\" = \\\"yes\\\"; then\\n WITH_LIBGCRYPT_INCLUDE=\\\"$LIBGCRYPT_CFLAGS\\\"\\n WITH_LIBGCRYPT_LIB=\\\"$LIBGCRYPT_LIBS\\\"\\n else\\n AC_PATH_TOOL(LIBGCRYPT_CONFIG, libgcrypt-config, notfound)\\n if test notfound != \\\"$LIBGCRYPT_CONFIG\\\" ; then\\n WITH_LIBGCRYPT_INCLUDE=`$LIBGCRYPT_CONFIG --cflags`\\n WITH_LIBGCRYPT_LIB=`$LIBGCRYPT_CONFIG --libs`\\n fi\\n if test -z \\\"$WITH_LIBGCRYPT_LIB\\\" ; then\\n AC_MSG_ERROR([libgcrypt not found])\\n fi\\n fi\\nfi\",\n \"AM_CONDITIONAL([WITH_LIBGCRYPT],[test \\\"$with_crypto\\\" = libgcrypt])\\nAC_SUBST(WITH_LIBGCRYPT_INCLUDE)\\nAC_SUBST(WITH_LIBGCRYPT_LIB)\",\n \"#=================\\n# Check for magic library.\\nWITH_MAGIC_INCLUDE=\\nWITH_MAGIC_LIB=\",\n \"AC_CHECK_HEADER([magic.h], [\\n AC_CHECK_LIB(magic, magic_open, [\\n WITH_MAGIC_INCLUDE=\\n WITH_MAGIC_LIB=\\\"-lmagic\\\"\\n ],[\\n AC_MSG_ERROR([missing required library 'libmagic']) \\n ])\\n],[\\n AC_MSG_ERROR([missing required header magic.h]) \\n])\",\n \"AC_SUBST(WITH_MAGIC_INCLUDE)\\nAC_SUBST(WITH_MAGIC_LIB)\",\n \"#=================\\n# Check for popt library.\\nWITH_POPT_INCLUDE=\\nWITH_POPT_LIB=\",\n \"AC_CHECK_HEADER([popt.h], [\\n AC_CHECK_LIB(popt, poptGetContext, [\\n WITH_POPT_INCLUDE=\\n WITH_POPT_LIB=\\\"-lpopt\\\"\\n ],[\\n AC_MSG_ERROR([missing required library popt])\\n ])\\n],[\\n AC_MSG_ERROR([missing required header popt.h])\\n])\",\n \"AC_SUBST(WITH_POPT_INCLUDE)\\nAC_SUBST(WITH_POPT_LIB)\",\n \"#=================\\n# Check for libarchive library.\\nAC_ARG_WITH([archive], [AS_HELP_STRING([--with-archive], [build rpm2archive - requires libarchive])],\\n [],\\n [with_archive=yes])\",\n \"WITH_ARCHIVE_INCLUDE=\\nWITH_ARCHIVE_LIB=\\nAS_IF([test \\\"$with_archive\\\" != no],[\\n AC_CHECK_HEADER([archive.h], [\\n AC_CHECK_LIB(archive, archive_write_open_filename, [\\n WITH_ARCHIVE_INCLUDE=\\n WITH_ARCHIVE_LIB=\\\"-larchive\\\"\\n ],[\\n AC_MSG_ERROR([missing required library 'libarchive'])\\n ])\\n],[\\n AC_MSG_ERROR([missing required header archive.h])\\n ])\\n])\",\n \"AC_SUBST(WITH_ARCHIVE_INCLUDE)\\nAC_SUBST(WITH_ARCHIVE_LIB)\\nAM_CONDITIONAL(WITH_ARCHIVE,[test \\\"$with_archive\\\" = yes])\",\n \"#=================\\n# Check for elfutils libdw library with dwelf_elf_gnu_build_id.\\nAS_IF([test \\\"x$enable_libelf\\\" != \\\"xno\\\"], [\\n WITH_LIBDW_LIB=\\n AS_IF([test \\\"$WITH_LIBELF\\\" = yes],[\\n AC_CHECK_HEADERS([elfutils/libdwelf.h],[\\n # dwelf_elf_gnu_build_id was introduced in elfutils 0.159\\n AC_CHECK_LIB(dw, dwelf_elf_gnu_build_id, [\\n AC_DEFINE(HAVE_LIBDW, 1,\\n [Define to 1 if you have elfutils libdw library])\\n WITH_LIBDW_LIB=\\\"-ldw\\\"\\n WITH_LIBDW=yes\\n # whether libdw supports compressed ELF objects\\n AC_CHECK_LIB(dw, dwelf_elf_begin, [\\n AC_DEFINE(HAVE_DWELF_ELF_BEGIN, 1, [Have dwelf_elf_begin?])\\n ])\\n ])\\n ])\\n ])\\n])\\nAC_SUBST(WITH_LIBDW_LIB)\\nAM_CONDITIONAL(LIBDW,[test \\\"$WITH_LIBDW\\\" = yes])\",\n \"#=================\\n# Process --enable-ndb\\nAC_ARG_ENABLE([ndb], [AS_HELP_STRING([--enable-ndb],[enable the new rpm database format])],\\n[case \\\"$enable_ndb\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --enable-ndb])\\n ;;\\nesac],\\n[enable_ndb=no])\\nAS_IF([test \\\"$enable_ndb\\\" = yes],[\\n AC_DEFINE(ENABLE_NDB, 1, [Enable new rpm database format?])\\n AC_CHECK_FUNCS(mremap, [], [], [#include <sys/mman.h>])\\n])\\nAM_CONDITIONAL([NDB], [test \\\"$enable_ndb\\\" = yes])\",\n \"#=================\\n# Process --enable-bdb-ro\\nAC_ARG_ENABLE([bdb-ro], [AS_HELP_STRING([--enable-bdb-ro (EXPERIMENTAL)],[enable the read-only Berkeley DB code])],\\n[case \\\"$enable_bdb_ro\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --enable-bdb-ro])\\n ;;\\nesac],\\n[enable_bdb_ro=no])\\nAS_IF([test \\\"$enable_bdb_ro\\\" = yes],[\\n AC_DEFINE(WITH_BDB_RO, 1, [Build with read-only Berkeley DB])\\n])\\nAM_CONDITIONAL([BDB_RO], [test \\\"$enable_bdb_ro\\\" = yes])\",\n \"# Check for SQLITE support\\nAC_ARG_ENABLE([sqlite],\\n [AS_HELP_STRING([--enable-sqlite=@<:@yes/no/auto@:>@)],\\n [build with sqlite rpm database format support (default=yes)])],\\n [enable_sqlite=\\\"$enableval\\\"],\\n [enable_sqlite=yes])\",\n \"AS_IF([test \\\"x$enable_sqlite\\\" != \\\"xno\\\"], [\\n PKG_CHECK_MODULES([SQLITE], [sqlite3 >= 3.22.0], [have_sqlite=yes], [have_sqlite=no])\\n AS_IF([test \\\"$enable_sqlite\\\" = \\\"yes\\\"], [\\n if test \\\"$have_sqlite\\\" = \\\"no\\\"; then\\n AC_MSG_ERROR([--enable-sqlite specified, but not available])\\n fi\\n ])\\n])\",\n \"if test \\\"x$have_sqlite\\\" = \\\"xyes\\\"; then\\n AC_DEFINE([WITH_SQLITE], [1], [Define if SQLITE is available])\\n SQLITE_REQUIRES=sqlite\\n AC_SUBST(SQLITE_REQUIRES)\\nfi\\nAM_CONDITIONAL([SQLITE], [test \\\"x$have_sqlite\\\" = \\\"xyes\\\"])\",\n \"AM_GNU_GETTEXT_VERSION([0.18.2])\\nAM_GNU_GETTEXT([external])\\nAM_ICONV\",\n \"dnl Checks for header files we can live without.\\nAC_HEADER_STDC\\ndnl glibc and autoconf don't really play well together.\\ndnl glibc will produce a warning when including the wrong header.\\ndnl but still define major and minor. Causing us to include the header\\ndnl that produces a giant warning for each major/minor use.\\ndnl Use -Werror to work around that.\\nold_CFLAGS=$CFLAGS\\nCFLAGS=\\\"$CFLAGS -Werror\\\"\\nAC_HEADER_MAJOR\\nCFLAGS=$old_CFLAGS\\nAC_STRUCT_DIRENT_D_TYPE\",\n \"AC_CHECK_HEADERS(limits.h)\\nAC_CHECK_HEADERS(getopt.h)\",\n \"AC_CHECK_HEADERS(sys/utsname.h)\",\n \"AC_CHECK_HEADERS(sys/systemcfg.h)\\nAC_CHECK_HEADERS(sys/param.h)\\nAC_CHECK_HEADERS(sys/auxv.h)\",\n \"dnl look for libc features\",\n \"dnl Check for missing typedefs\\nAC_TYPE_MODE_T\\nAC_TYPE_OFF_T\\nAC_TYPE_PID_T\\nAC_TYPE_SIZE_T\",\n \"dnl Checks for library functions.\\nAC_CHECK_FUNCS(putenv)\\nAC_CHECK_FUNCS(mempcpy)\\nAC_CHECK_FUNCS(fdatasync)\\nAC_CHECK_DECLS(fdatasync, [], [], [#include <unistd.h>])\\nAC_CHECK_FUNCS(lutimes)\\nAC_CHECK_FUNCS(mergesort)\\nAC_CHECK_FUNCS(getauxval)\\nAC_CHECK_FUNCS(setprogname, [], [], [#include <stdlib.h>])\\nAC_CHECK_FUNCS(syncfs)\\nAC_CHECK_FUNCS(sched_getaffinity, [], [], [#include <sched.h>])\\nAC_CHECK_FUNCS(unshare, [], [], [#include <sched.h>])\",\n \"AC_MSG_CHECKING([whether __progname is defined])\\nAC_LINK_IFELSE([AC_LANG_PROGRAM([extern const char *__progname;],\\n\\t [if (*__progname == 0) return 0;])],\\n\\t AC_DEFINE([HAVE___PROGNAME], [1], [Define if __progname is defined])\\n\\t AC_MSG_RESULT([yes]),\\n\\t AC_MSG_RESULT([no]))\",\n \"AC_REPLACE_FUNCS(stpcpy stpncpy)\",\n \"AC_CHECK_FUNCS([secure_getenv __secure_getenv])\",\n \"AC_CHECK_FUNCS(\\n [mkstemp getcwd basename dirname realpath setenv unsetenv regcomp lchown \\\\\",\n \" utimes getline localtime_r statvfs getaddrinfo \\\\\\n openat mkdirat fstatat ],\",\n \" [], [AC_MSG_ERROR([function required by rpm])])\",\n \"AC_LIBOBJ(fnmatch)\",\n \"dnl check if python is requested\\nAC_ARG_ENABLE(python, [AS_HELP_STRING([--enable-python],[build rpm python bindings])],\\n[case \\\"$enable_python\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --enable-python])\\n ;;\\nesac],\\n[enable_python=no])\",\n \"WITH_PYTHON_SUBPACKAGE=0\\nAS_IF([test \\\"$enable_python\\\" = yes],[\\n PYTHON=\\\"${PYTHON:-python3}\\\"\\n AM_PATH_PYTHON([3.1],[\\n PKG_CHECK_MODULES([PYTHON], [python-${PYTHON_VERSION}], [WITH_PYTHON_SUBPACKAGE=1])\\n AC_SUBST(PYTHON_CFLAGS)\\n AC_SUBST(PYTHON_LIB)\\n ])\\n])\",\n \"AM_CONDITIONAL(ENABLE_PYTHON,[test \\\"$WITH_PYTHON_SUBPACKAGE\\\" = 1])\",\n \"AC_PATH_PROG(DOXYGEN, doxygen, no)\\nAC_CHECK_PROG(HAVE_DOT,[dot],[YES],[NO])\\nAC_PATH_PROG(PANDOC, pandoc, no)\",\n \"WITH_SELINUX_LIB=\\nAC_ARG_WITH(selinux, [AS_HELP_STRING([--with-selinux],[build with selinux support])],\\n[case \\\"$with_selinux\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --with-selinux])\\n ;;\\nesac],\\n[with_selinux=no])\",\n \"AS_IF([test \\\"$with_selinux\\\" = yes],[\\n AC_CHECK_HEADER([selinux/selinux.h],[\\n save_LIBS=\\\"$LIBS\\\"\\n AC_CHECK_LIB([selinux],[is_selinux_enabled],[],[\\n AC_MSG_ERROR([--with-selinux given, but is_selinux_enabled not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selinux_getpolicytype],[],[\\n AC_MSG_ERROR([--with-selinux given, but selinux_getpolicytype not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selinux_reset_config],[],[\\n AC_MSG_ERROR([--with-selinux given, but selinux_reset_config not found in libselinux])])\\n AC_CHECK_LIB([selinux],[setexecfilecon],[\\n AC_DEFINE([HAVE_SETEXECFILECON],[1],[Define to 1 if SELinux setexecfilecon is present])])\\n LIBS=\\\"$save_LIBS\\\"\\n ],[\\n AC_MSG_ERROR([--with-selinux given, but selinux/selinux.h not found])\\n ])\",\n \" AC_CHECK_HEADER([selinux/label.h],[\\n save_LIBS=\\\"$LIBS\\\"\\n AC_CHECK_LIB([selinux],[selabel_close],[],[\\n AC_MSG_ERROR([--with-selinux given, but selabel_close not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selabel_lookup_raw],[],[\\n AC_MSG_ERROR([--with-selinux given, but selabel_lookup_raw not found in libselinux])])\\n AC_CHECK_LIB([selinux],[selabel_open],[],[\\n AC_MSG_ERROR([--with-selinux given, but selabel_open not found in libselinux])])\\n LIBS=\\\"$save_LIBS\\\"\\n ],[\\n AC_MSG_ERROR([--with-selinux given, but selinux/label.h not found])\\n ])\\n])\",\n \"AS_IF([test \\\"$with_selinux\\\" = yes],[\\n AC_DEFINE(WITH_SELINUX, 1, [Build with selinux support?])\\n WITH_SELINUX_LIB=\\\"-lselinux\\\"\\n])\\nAC_SUBST(WITH_SELINUX_LIB)\\nAC_SUBST(WITH_SEMANAGE_LIB)\\nAM_CONDITIONAL(SELINUX,[test \\\"$with_selinux\\\" = yes])\",\n \"# libimaevm\\nwith_iamevm=no\\nAC_ARG_WITH(imaevm, [AS_HELP_STRING([--with-imaevm],[build with imaevm support])])\\nif test \\\"$with_imaevm\\\" = yes ; then\\n AC_MSG_CHECKING([libimaevm >= 1.0])\\n AC_COMPILE_IFELSE(\\n [AC_LANG_PROGRAM(\\n [[#include <imaevm.h>]],\\n [[return sign_hash(NULL, NULL, 0, NULL, NULL, NULL);]]\\n )],\\n [AC_MSG_RESULT(yes)\\n AC_DEFINE(WITH_IMAEVM, 1, [Build with imaevm support?])\\n WITH_IMAEVM_LIB=\\\"-limaevm\\\"\\n ],\\n [AC_MSG_ERROR([libimaevm not present or too old (< 1.0)])]\\n )\\nfi\\nAM_CONDITIONAL(WITH_IMAEVM,[test \\\"$with_imaevm\\\" = yes])\\nAC_SUBST(WITH_IMAEVM_LIB)\",\n \"# fsverity\\nAC_ARG_WITH([fsverity], [AS_HELP_STRING([--with-fsverity],[build with fsverity support])],[],[with_fsverity=no])\\nif test \\\"$with_fsverity\\\" = yes ; then\\n AC_MSG_CHECKING([libfsverity])\\n AC_COMPILE_IFELSE(\\n [AC_LANG_PROGRAM(\\n [[#include <libfsverity.h>]],\\n [[return libfsverity_sign_digest(NULL, NULL, NULL, NULL);]]\\n )],\\n [AC_MSG_RESULT(yes)\\n AC_DEFINE(WITH_FSVERITY, 1, [Build with fsverity support?])\\n WITH_FSVERITY_LIB=\\\"-lfsverity\\\"\\n ],\\n [AC_MSG_ERROR([--with-fsverity given, libfsverity or libfsverity.h missing])]\\n )\\nfi\\nAM_CONDITIONAL(WITH_FSVERITY,[test \\\"$with_fsverity\\\" = yes])\\nAC_SUBST(WITH_FSVERITY_LIB)\",\n \"# libcap\\nWITH_CAP_LIB=\\nAC_ARG_WITH(cap, [AS_HELP_STRING([--with-cap],[build with capability support])],\\n[case \\\"$with_cap\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --with-cap])\\n ;;\\nesac],\\n[with_cap=no])\",\n \"AS_IF([test \\\"$with_cap\\\" = yes],[\\n AC_CHECK_HEADER([sys/capability.h],[\\n AC_CHECK_LIB(cap,[cap_get_file], [\\n with_cap=yes\\n save_LIBS=\\\"$LIBS\\\"\\n AC_CHECK_LIB(cap,[cap_compare], [\\n AC_DEFINE(HAVE_CAP_COMPARE, 1, [Have cap_compare function?])\\n ])\\n LIBS=\\\"$save_LIBS\\\"\\n ],[\\n AC_MSG_ERROR([--with-cap given, but libcap not found])])\\n ],[\\n AC_MSG_ERROR([--with-cap given, but sys/capability.h not found])\\n ])\\n])\",\n \"AS_IF([test \\\"$with_cap\\\" = yes],[\\n AC_DEFINE(WITH_CAP, 1, [Build with capability support?])\\n WITH_CAP_LIB=\\\"-lcap\\\"\\n])\\nAC_SUBST(WITH_CAP_LIB)\\nAM_CONDITIONAL(CAP,[test \\\"$with_cap\\\" = yes])\",\n \"WITH_ACL_LIB=\\nAC_ARG_WITH(acl, [AS_HELP_STRING([--with-acl],[build with acl support])],\\n[case \\\"$with_acl\\\" in\\nyes|no) ;;\\n*) AC_MSG_ERROR([invalid argument to --with-acl])\\n ;;\\nesac],\\n[with_acl=no])\",\n \"AS_IF([test \\\"$with_acl\\\" = yes],[\\n dnl verification uses non-portable acl_equiv_mode() \\n AC_CHECK_HEADER([acl/libacl.h],[\\n AC_CHECK_LIB(acl,[acl_equiv_mode],[with_acl=yes],[\\n AC_MSG_ERROR([--with-acl given, but libacl not found or not suitable])])\\n ],[\\n AC_MSG_ERROR([--with-acl given, but acl/libacl.h not found])\\n ])\\n])\",\n \"AS_IF([test \\\"$with_acl\\\" = yes],[\\n AC_DEFINE(WITH_ACL, 1, [Build with acl support?])\\n WITH_ACL_LIB=\\\"-lacl\\\"\\n])\\nAC_SUBST(WITH_ACL_LIB)\\nAM_CONDITIONAL(ACL,[test \\\"$with_acl\\\" = yes])\",\n \"PKG_CHECK_MODULES([LUA],\\n [lua >= 5.2],\\n [],\\n [AC_MSG_ERROR([lua not present or too old)])])\\nAC_SUBST(LUA_CFLAGS)\\nAC_SUBST(LUA_LIBS)\",\n \"AC_ARG_WITH([readline],[AS_HELP_STRING([--with-readline=@<:@yes/no/auto@:>@], [build with readline support])], [with_readline=\\\"$withval\\\"], [with_readline=\\\"auto\\\"])\\nAS_IF([test \\\"$with_readline\\\" != \\\"no\\\"],[\\n PKG_CHECK_MODULES([READLINE], [readline], [have_readline=yes], [have_readline=no])\\n AS_IF([test \\\"$with_readline\\\" = \\\"yes\\\"],[\\n if test \\\"$have_readline\\\" = \\\"no\\\"; then\\n AC_MSG_ERROR([readline support requested but not present])\\n fi\\n ])\\n])\\nif test \\\"$have_readline\\\" = \\\"yes\\\"; then\\n AC_DEFINE([HAVE_READLINE], [1], [Define if readline is available])\\n AC_SUBST(READLINE_CFLAGS)\\n AC_SUBST(READLINE_LIBS)\\nfi\\nAM_CONDITIONAL(WITH_READLINE, [test \\\"$have_readline\\\" = yes])\",\n \"\\nAC_ARG_ENABLE(plugins, [AS_HELP_STRING([--disable-plugins],[build without plugin support])],,[enable_plugins=yes])\\nAS_IF([test \\\"$enable_plugins\\\" = yes],[\\n AC_DEFINE(ENABLE_PLUGINS, 1, [Build with plugin support?])\\n])\\nAM_CONDITIONAL(ENABLE_PLUGINS,[test \\\"$enable_plugins\\\" = yes])\",\n \"AC_ARG_ENABLE(inhibit_plugin, [AS_HELP_STRING([--disable-inhibit-plugin],[build without systemd inhibit plugin])],,[enable_inhibit_plugin=yes])\\nAS_IF([test \\\"$enable_inhibit_plugin\\\" = yes],[\\n AC_DEFINE(ENABLE_INHIBIT_PLUGIN, 1, [Build with systemd inhibit plugin?])\\n])\\nAM_CONDITIONAL(ENABLE_INHIBIT_PLUGIN,[test \\\"$enable_inhibit_plugin\\\" = yes])\",\n \"with_dbus=no\\nAS_IF([test \\\"$enable_plugins\\\" != no],[\\n AS_IF([test \\\"$enable_inhibit_plugin\\\" != no],[\\n PKG_CHECK_MODULES([DBUS],\\n [dbus-1 >= 1.3],\\n [AC_DEFINE(DBUS, 1, [Build with dbus support?]) with_dbus=yes],\\n [with_dbus=no])\\n AC_SUBST(DBUS_CFLAGS)\\n AC_SUBST(DBUS_LIBS)\\n ])\\n])\\nAM_CONDITIONAL(DBUS, [test \\\"$with_dbus\\\" = yes])\",\n \"AS_IF([test \\\"$enable_plugins\\\" != no],[\\n AC_CHECK_FUNCS(lsetxattr, [], [], [#include <sys/xattr.h>])\\n])\\nAM_CONDITIONAL(IMA, [test \\\"x$ac_cv_func_lsetxattr\\\" = xyes])\",\n \"AS_IF([test \\\"$enable_plugins\\\" != no],[\\nAC_CHECK_HEADERS([linux/fsverity.h],[FSVERITY_IOCTL=\\\"yes\\\"])\\n])\\nAM_CONDITIONAL(FSVERITY_IOCTL,[test \\\"x$FSVERITY_IOCTL\\\" = xyes])\",\n \"#=================\\n# Check for fapolicyd support\\nAC_ARG_WITH(fapolicyd,\\nAS_HELP_STRING([--with-fapolicyd],[build with File Access Policy Daemon support]),\\nwith_fapolicyd=$withval,\\nwith_fapolicyd=auto)\\nAM_CONDITIONAL(FAPOLICYD,[test \\\"$with_fapolicyd\\\" = yes])\",\n \"#=================\\n# Check for audit library.\\nAC_ARG_WITH(audit,\\nAS_HELP_STRING([--with-audit],[Linux audit plugin]),\\nwith_audit=$withval,\\nwith_audit=auto)\",\n \"WITH_AUDIT_LIB=\\nAS_IF([test \\\"$enable_plugins\\\" != no],[\\n AS_IF([test \\\"x$with_audit\\\" != xno],[\\n AC_SEARCH_LIBS([audit_open],[audit],[\\n WITH_AUDIT_LIB=\\\"$ac_res\\\"\\n AC_DEFINE(WITH_AUDIT, 1, [libaudit support])\\n with_audit=yes\\n ],[\\n if test \\\"x$with_audit\\\" != xauto; then\\n AC_MSG_ERROR([missing audit library])\\n fi\\n ])\\n ])\\n])\\nAC_SUBST(WITH_AUDIT_LIB)\\nAM_CONDITIONAL(AUDIT,[test \\\"$with_audit\\\" = yes])\",\n \"user_with_uid0=$(awk -F: '$3==0 {print $1;exit}' /etc/passwd)\\ngroup_with_gid0=$(awk -F: '$3==0 {print $1;exit}' /etc/group)\\nif test -z \\\"$user_with_uid0\\\" ; then user_with_uid0=root ; fi\\nif test -z \\\"$group_with_gid0\\\" ; then group_with_gid0=root ; fi\\nAC_DEFINE_UNQUOTED([UID_0_USER],[\\\"$user_with_uid0\\\"],[Get the user name having userid 0])\\nAC_DEFINE_UNQUOTED([GID_0_GROUP],[\\\"$group_with_gid0\\\"],[Get the group name having groupid 0])\",\n \"#\\n# get rid of the 4-th tuple, if config.guess returned \\\"linux-gnu\\\" for host_os\\n#\\nhost_os_gnu=-gnu\\nif echo \\\"$host_os\\\" | grep '.*-gnulibc1$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnulibc1$//'`\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnueabihf$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnueabihf$//'`\\n\\thost_os_gnu=-gnueabihf\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnueabi$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnueabi$//'`\\n\\thost_os_gnu=-gnueabi\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnuabi64$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnuabi64$//'`\\n\\thost_os_gnu=-gnuabi64\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnu$' > /dev/null ; then\\n\\thost_os=`echo \\\"${host_os}\\\" | sed 's/-gnu$//'`\\nfi\\nif echo \\\"$host_os\\\" | grep '.*-gnu[[^-]]*$' > /dev/null ; then\\n\\tAC_MSG_ERROR([unrecognized GNU build triplet $host_os])\\nfi\",\n \"changequote(<, >)\\nhost_os_exact=\\\"${host_os}\\\"\\nhost_os_major=`echo \\\"${host_os}\\\" | sed 's/\\\\..*$//'`\\nhost_os_noversion=`echo \\\"${host_os}\\\" | sed 's/[0-9]*\\\\..*$//'`\\nchangequote([, ])\",\n \"dnl permit overriding build_vendor for \\\"canonical rpm vendor\\\"\\nRPMCANONVENDOR=\\\"$build_vendor\\\"\\nAC_ARG_WITH([vendor], \\n AS_HELP_STRING([--with-vendor=VENDOR], [specify rpm vendor name]),\\n [RPMCANONVENDOR=$withval])\\nAC_DEFINE_UNQUOTED([RPMCANONVENDOR],[\\\"${RPMCANONVENDOR}\\\"],[canonical vendor])\\n\\t \\nRPMCANONOS=\\\"$host_os_noversion\\\"\\nRPMCANONGNU=\\\"$host_os_gnu\\\"\\nAC_SUBST(RPMCANONVENDOR)\\nAC_SUBST(RPMCANONOS)\\nAC_SUBST(RPMCANONGNU)\",\n \"RUNDIR=\\\"/run\\\"\\nAC_ARG_WITH([rundir], \\n AS_HELP_STRING([--with-rundir=RUNDIR], [specify run-time variable directory]),\\n [RUNDIR=$withval])\\nAC_DEFINE_UNQUOTED([RUNDIR],[\\\"${RUNDIR}\\\"],[run-time variable directory])\\nAC_SUBST(RUNDIR)\",\n \"if test X\\\"$prefix\\\" = XNONE ; then\\n usrprefix=\\\"$ac_default_prefix\\\"\\nelse\\n usrprefix=$prefix\\nfi\",\n \"RPMCONFIGDIR=\\\"`echo ${usrprefix}/lib/rpm`\\\"\\nAC_SUBST(RPMCONFIGDIR)\",\n \"AC_SUBST(OBJDUMP)\",\n \"AM_CONDITIONAL([DOXYGEN],[test \\\"$DOXYGEN\\\" != no])\\nAM_CONDITIONAL([PANDOC],[test \\\"$PANDOC\\\" != no])\",\n \"AC_PATH_PROG(AUTOM4TE,autom4te,:)\",\n \"AC_SUBST([dirstamp],[\\\\${am__leading_dot}dirstamp])\",\n \"AC_CONFIG_FILES([Makefile\\n\\trpmio/Makefile lib/Makefile build/Makefile sign/Makefile\\n\\tpo/Makefile.in scripts/Makefile fileattrs/Makefile\\n\\tmisc/Makefile \\n\\tdocs/Makefile\\n\\tdocs/man/Makefile\\n\\tpython/Makefile\\n \\tluaext/Makefile\\n \\ttests/Makefile\\n \\tplugins/Makefile\\n\\tpython/setup.py\\n ])\\nAC_OUTPUT\"\n]","isConversational":false},"labels":{"kind":"list like","value":[1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1],"string":"[\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1,\n 1\n]","isConversational":false},"source":{"kind":"string","value":"PreciseBugs"},"other_info":{"kind":"string","value":"{\"buggy_code_end_loc\": [104, 584, 1024], \"buggy_code_start_loc\": [104, 583, 10], \"filenames\": [\"INSTALL\", \"configure.ac\", \"lib/fsm.c\"], \"fixing_code_end_loc\": [107, 585, 1157], \"fixing_code_start_loc\": [105, 583, 11], \"message\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\", \"other\": {\"cve\": {\"cisaActionDue\": null, \"cisaExploitAdd\": null, \"cisaRequiredAction\": null, \"cisaVulnerabilityName\": null, \"configurations\": [{\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:a:rpm:rpm:*:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"582D14B9-3812-42FD-9FA3-2BDEAA02DD6C\", \"versionEndExcluding\": \"4.18\", \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}, {\"nodes\": [{\"cpeMatch\": [{\"criteria\": \"cpe:2.3:o:redhat:enterprise_linux:8.0:*:*:*:*:*:*:*\", \"matchCriteriaId\": \"F4CFF558-3C47-480D-A2F0-BABF26042943\", \"versionEndExcluding\": null, \"versionEndIncluding\": null, \"versionStartExcluding\": null, \"versionStartIncluding\": null, \"vulnerable\": true}], \"negate\": false, \"operator\": \"OR\"}], \"operator\": null}], \"descriptions\": [{\"lang\": \"en\", \"value\": \"It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check was only implemented for the parent directory of the file to be created. A local unprivileged user who owns another ancestor directory could potentially use this flaw to gain root privileges. The highest threat from this vulnerability is to data confidentiality and integrity as well as system availability.\"}, {\"lang\": \"es\", \"value\": \"Se ha detectado que la correcci\\u00f3n de CVE-2017-7500 y CVE-2017-7501 era incompleta: la comprobaci\\u00f3n s\\u00f3lo es implementada para el directorio padre del archivo que iba a crearse. Un usuario local no privilegiado que posea otro directorio antecesor podr\\u00eda usar este fallo para conseguir privilegios de root. La mayor amenaza de esta vulnerabilidad es para la confidencialidad e integridad de los datos, as\\u00ed como para la disponibilidad del sistema.\"}], \"evaluatorComment\": null, \"id\": \"CVE-2021-35939\", \"lastModified\": \"2023-02-04T01:16:51.737\", \"metrics\": {\"cvssMetricV2\": null, \"cvssMetricV30\": null, \"cvssMetricV31\": [{\"cvssData\": {\"attackComplexity\": \"LOW\", \"attackVector\": \"LOCAL\", \"availabilityImpact\": \"HIGH\", \"baseScore\": 6.7, \"baseSeverity\": \"MEDIUM\", \"confidentialityImpact\": \"HIGH\", \"integrityImpact\": \"HIGH\", \"privilegesRequired\": \"HIGH\", \"scope\": \"UNCHANGED\", \"userInteraction\": \"NONE\", \"vectorString\": \"CVSS:3.1/AV:L/AC:L/PR:H/UI:N/S:U/C:H/I:H/A:H\", \"version\": \"3.1\"}, \"exploitabilityScore\": 0.8, \"impactScore\": 5.9, \"source\": \"nvd@nist.gov\", \"type\": \"Primary\"}]}, \"published\": \"2022-08-26T16:15:08.683\", \"references\": [{\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://access.redhat.com/security/cve/CVE-2021-35939\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Exploit\", \"Issue Tracking\", \"Third Party Advisory\"], \"url\": \"https://bugzilla.redhat.com/show_bug.cgi?id=1964129\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Patch\", \"Third Party Advisory\"], \"url\": \"https://github.com/rpm-software-management/rpm/pull/1919\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Release Notes\", \"Vendor Advisory\"], \"url\": \"https://rpm.org/wiki/Releases/4.18.0\"}, {\"source\": \"secalert@redhat.com\", \"tags\": [\"Third Party Advisory\"], \"url\": \"https://security.gentoo.org/glsa/202210-22\"}], \"sourceIdentifier\": \"secalert@redhat.com\", \"vendorComments\": null, \"vulnStatus\": \"Analyzed\", \"weaknesses\": [{\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"secalert@redhat.com\", \"type\": \"Primary\"}, {\"description\": [{\"lang\": \"en\", \"value\": \"CWE-59\"}], \"source\": \"nvd@nist.gov\", \"type\": \"Secondary\"}]}, \"github_commit_url\": \"https://github.com/rpm-software-management/rpm/commit/96ec957e281220f8e137a2d5eb23b83a6377d556\"}, \"type\": \"CWE-59\"}"},"index":{"kind":"number","value":883,"string":"883"}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":51,"numItemsPerPage":100,"numTotalItems":39158,"offset":5100,"length":100}},"jwt":"eyJhbGciOiJFZERTQSIsImtpZCI6IjVHZDBvd0g5MTM2eDZjc1FvbE1zcktNWUZoRVFoUm5PVVVybEpjOUhaUEEifQ.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sInJlcG9JZHMiOlsiNjhjYjEzMDg5YzBmNGRjMTA1NzJhNjNlIl0sImlhdCI6MTc5MzIwNjc4NSwianRpIjoiNTg1YTRhZDEtNzQ2MC00YjkyLWFkM2EtMGIwNjJmYmJjZmRmIiwic3ViIjoiL2RhdGFzZXRzL3ZpdmkteXUvdnVsX2NvZGVfcHJlY2lzZSIsImV4cCI6MTc5MzIxMDM4NSwiaXNzIjoiaHR0cHM6Ly9odWdnaW5nZmFjZS5jbyJ9.QRnyzRtItBxbjgHkZkInkxEyb_8R_G-TT74YpZdQE5XO816DYJJCORK3aTowlFLXinmqPE390kc3ZZh77zGPDQ","displayUrls":true,"splitSizeSummaries":[{"config":"default","split":"train","numRows":39158,"numBytesParquet":815091704},{"config":"default","split":"val","numRows":4895,"numBytesParquet":90417334},{"config":"default","split":"test","numRows":4895,"numBytesParquet":58600329}]},"discussionsStats":{"closed":0,"open":1,"total":1},"fullWidth":true,"hasGatedAccess":true,"hasFullAccess":true,"isEmbedded":false,"savedQueries":{"community":[],"user":[]}}">
prompt stringclasses 1
value | completions listlengths 1 63.8k | labels listlengths 1 63.8k | source stringclasses 1
value | other_info stringlengths 2.06k 101k | index int64 0 6.83k |
|---|---|---|---|---|---|
Determine whether the {function_name} code is vulnerable or not. | [
"# -*- coding: utf-8 -*-\n# rdiffweb, A web interface to rdiff-backup repositories\n# Copyright (C) 2012-2021 rdiffweb contributors\n#\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, eith... | [
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [117, 54, 113], "buggy_code_start_loc": [110, 53, 113], "filenames": ["README.md", "rdiffweb/controller/pref_sshkeys.py", "rdiffweb/controller/tests/test_page_prefs_ssh.py"], "fixing_code_end_loc": [119, 60, 131], "fixing_code_start_loc": [110, 53, 114], "message": "Allocation of Resources Withou... | 862 |
Determine whether the {function_name} code is vulnerable or not. | [
"# -*- coding: utf-8 -*-\n# rdiffweb, A web interface to rdiff-backup repositories\n# Copyright (C) 2012-2021 rdiffweb contributors\n#\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, eith... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [117, 54, 113], "buggy_code_start_loc": [110, 53, 113], "filenames": ["README.md", "rdiffweb/controller/pref_sshkeys.py", "rdiffweb/controller/tests/test_page_prefs_ssh.py"], "fixing_code_end_loc": [119, 60, 131], "fixing_code_start_loc": [110, 53, 114], "message": "Allocation of Resources Withou... | 862 |
Determine whether the {function_name} code is vulnerable or not. | [
"# -*- coding: utf-8 -*-\n# rdiffweb, A web interface to rdiff-backup repositories\n# Copyright (C) 2012-2021 rdiffweb contributors\n#\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, eith... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [117, 54, 113], "buggy_code_start_loc": [110, 53, 113], "filenames": ["README.md", "rdiffweb/controller/pref_sshkeys.py", "rdiffweb/controller/tests/test_page_prefs_ssh.py"], "fixing_code_end_loc": [119, 60, 131], "fixing_code_start_loc": [110, 53, 114], "message": "Allocation of Resources Withou... | 862 |
Determine whether the {function_name} code is vulnerable or not. | [
"# -*- coding: utf-8 -*-\n# rdiffweb, A web interface to rdiff-backup repositories\n# Copyright (C) 2012-2021 rdiffweb contributors\n#\n# This program is free software: you can redistribute it and/or modify\n# it under the terms of the GNU General Public License as published by\n# the Free Software Foundation, eith... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [117, 54, 113], "buggy_code_start_loc": [110, 53, 113], "filenames": ["README.md", "rdiffweb/controller/pref_sshkeys.py", "rdiffweb/controller/tests/test_page_prefs_ssh.py"], "fixing_code_end_loc": [119, 60, 131], "fixing_code_start_loc": [110, 53, 114], "message": "Allocation of Resources Withou... | 862 |
Determine whether the {function_name} code is vulnerable or not. | [
"// SPDX-License-Identifier: GPL-2.0-or-later\n/*\n * Copyright (C) 2016 Namjae Jeon <linkinjeon@kernel.org>\n * Copyright (C) 2018 Samsung Electronics Co., Ltd.\n */",
"#include <linux/inetdevice.h>\n#include <net/addrconf.h>\n#include <linux/syscalls.h>\n#include <linux/namei.h>\n#include <linux/statfs.h>\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [1150], "buggy_code_start_loc": [1144], "filenames": ["fs/ksmbd/smb2pdu.c"], "fixing_code_end_loc": [1155], "fixing_code_start_loc": [1145], "message": "An issue was discovered in ksmbd in the Linux kernel 5.15 through 5.19 before 5.19.2. fs/ksmbd/smb2pdu.c omits a kfree call in certain smb2_hand... | 863 |
Determine whether the {function_name} code is vulnerable or not. | [
"// SPDX-License-Identifier: GPL-2.0-or-later\n/*\n * Copyright (C) 2016 Namjae Jeon <linkinjeon@kernel.org>\n * Copyright (C) 2018 Samsung Electronics Co., Ltd.\n */",
"#include <linux/inetdevice.h>\n#include <net/addrconf.h>\n#include <linux/syscalls.h>\n#include <linux/namei.h>\n#include <linux/statfs.h>\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [1150], "buggy_code_start_loc": [1144], "filenames": ["fs/ksmbd/smb2pdu.c"], "fixing_code_end_loc": [1155], "fixing_code_start_loc": [1145], "message": "An issue was discovered in ksmbd in the Linux kernel 5.15 through 5.19 before 5.19.2. fs/ksmbd/smb2pdu.c omits a kfree call in certain smb2_hand... | 863 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.",
"Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at",
" http://www.apache.org/licenses/LICENSE-2.0",
"Unless required b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 112], "buggy_code_start_loc": [37, 112], "filenames": ["tensorflow/lite/kernels/segment_sum.cc", "tensorflow/lite/kernels/segment_sum_test.cc"], "fixing_code_end_loc": [55, 145], "fixing_code_start_loc": [37, 113], "message": "In TensorFlow Lite before versions 2.2.1 and 2.3.1, models using ... | 864 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.",
"Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at",
" http://www.apache.org/licenses/LICENSE-2.0",
"Unless required b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 112], "buggy_code_start_loc": [37, 112], "filenames": ["tensorflow/lite/kernels/segment_sum.cc", "tensorflow/lite/kernels/segment_sum_test.cc"], "fixing_code_end_loc": [55, 145], "fixing_code_start_loc": [37, 113], "message": "In TensorFlow Lite before versions 2.2.1 and 2.3.1, models using ... | 864 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.",
"Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at",
" http://www.apache.org/licenses/LICENSE-2.0",
"Unless required b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 112], "buggy_code_start_loc": [37, 112], "filenames": ["tensorflow/lite/kernels/segment_sum.cc", "tensorflow/lite/kernels/segment_sum_test.cc"], "fixing_code_end_loc": [55, 145], "fixing_code_start_loc": [37, 113], "message": "In TensorFlow Lite before versions 2.2.1 and 2.3.1, models using ... | 864 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Copyright 2020 The TensorFlow Authors. All Rights Reserved.",
"Licensed under the Apache License, Version 2.0 (the \"License\");\nyou may not use this file except in compliance with the License.\nYou may obtain a copy of the License at",
" http://www.apache.org/licenses/LICENSE-2.0",
"Unless required b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 112], "buggy_code_start_loc": [37, 112], "filenames": ["tensorflow/lite/kernels/segment_sum.cc", "tensorflow/lite/kernels/segment_sum_test.cc"], "fixing_code_end_loc": [55, 145], "fixing_code_start_loc": [37, 113], "message": "In TensorFlow Lite before versions 2.2.1 and 2.3.1, models using ... | 864 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * CurrencyController.php\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0,
0,
0,
0,
0,
0,
0,
0,
0,
1,
0,
0,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
0... | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * CurrencyController.php\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * CreateController.php\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published b... | [
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
1,
0,
1,
0,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * CreateController.php\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published b... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * index.js\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software ... | [
1,
1,
0,
1,
1,
1,
0,
1,
0
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * index.js\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * groups.js\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software... | [
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * groups.js\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * show.js\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software F... | [
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
0
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * show.js\n * Copyright (c) 2019 james@firefly-iii.org\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free Software F... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"{% extends './v1/layout/default' %}",
"{% block breadcrumbs %}\n {{ Breadcrumbs.render(Route.getCurrentRoute.getName) }}\n{% endblock %}",
"{% block content %}\n <div class=\"row\">\n <div class=\"col-lg-12 col-sm-12 col-md-12\">\n <div class=\"box\">\n <div class=\"box-h... | [
1,
1,
1,
1,
0,
1,
0,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"{% extends './v1/layout/default' %}",
"{% block breadcrumbs %}\n {{ Breadcrumbs.render(Route.getCurrentRoute.getName) }}\n{% endblock %}",
"{% block content %}\n <div class=\"row\">\n <div class=\"col-lg-12 col-sm-12 col-md-12\">\n <div class=\"box\">\n <div class=\"box-h... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<table class=\"table table-condensed table-hover table-responsive table-sortable\">\n <thead>\n <tr>\n {% if showCategory or showBudget %}\n <td colspan=\"7\" class=\"no-margin-pagination\">{{ groups.links('v1.pagination.bootstrap-4')|raw }}</td>\n {% else %}\n <td colspan... | [
1,
0,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
0
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<table class=\"table table-condensed table-hover table-responsive table-sortable\">\n <thead>\n <tr>\n {% if showCategory or showBudget %}\n <td colspan=\"7\" class=\"no-margin-pagination\">{{ groups.links('v1.pagination.bootstrap-4')|raw }}</td>\n {% else %}\n <td colspan... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"{% extends './v1/layout/default' %}",
"{% block breadcrumbs %}\n {{ Breadcrumbs.render(Route.getCurrentRoute.getName, transactionGroup) }}\n{% endblock %}",
"{% block content %}\n <div class=\"row\">\n <div class=\"col-lg-6\">\n <div class=\"box box-primary\">\n <div clas... | [
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"{% extends './v1/layout/default' %}",
"{% block breadcrumbs %}\n {{ Breadcrumbs.render(Route.getCurrentRoute.getName, transactionGroup) }}\n{% endblock %}",
"{% block content %}\n <div class=\"row\">\n <div class=\"col-lg-6\">\n <div class=\"box box-primary\">\n <div clas... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * web.php\n * Copyright (c) 2019 james@firefly-iii.org.\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free S... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * web.php\n * Copyright (c) 2019 james@firefly-iii.org.\n *\n * This file is part of Firefly III (https://github.com/firefly-iii).\n *\n * This program is free software: you can redistribute it and/or modify\n * it under the terms of the GNU Affero General Public License as\n * published by the Free S... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [321, 84, 43, 210, 82, 103, 311, 427, 1016], "buggy_code_start_loc": [216, 30, 27, 25, 25, 72, 88, 38, 341], "filenames": ["app/Http/Controllers/CurrencyController.php", "app/Http/Controllers/Transaction/CreateController.php", "public/v1/js/ff/currencies/index.js", "public/v1/js/ff/list/groups.js... | 865 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/* Icinga Web 2 | (c) 2020 Icinga GmbH | GPLv2+ */",
"namespace Icinga\\Web\\Controller;",
"use Icinga\\Application\\Icinga;\nuse Icinga\\Web\\Request;",
"class StaticController\n{\n /**\n * Handle incoming request\n *\n * @param Request $request\n *\n * @returns void\n */\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [46], "buggy_code_start_loc": [41], "filenames": ["library/Icinga/Web/Controller/StaticController.php"], "fixing_code_end_loc": [57], "fixing_code_start_loc": [42], "message": "Icinga Web 2 is an open source monitoring web interface, framework and command-line interface. Unauthenticated users can... | 866 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/* Icinga Web 2 | (c) 2020 Icinga GmbH | GPLv2+ */",
"namespace Icinga\\Web\\Controller;",
"use Icinga\\Application\\Icinga;\nuse Icinga\\Web\\Request;",
"class StaticController\n{\n /**\n * Handle incoming request\n *\n * @param Request $request\n *\n * @returns void\n */\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [46], "buggy_code_start_loc": [41], "filenames": ["library/Icinga/Web/Controller/StaticController.php"], "fixing_code_end_loc": [57], "fixing_code_start_loc": [42], "message": "Icinga Web 2 is an open source monitoring web interface, framework and command-line interface. Unauthenticated users can... | 866 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict';",
"/*!\n * Module dependencies.\n */",
"const StrictModeError = require('./error/strict');\nconst Types = require('./schema/index');\nconst castTextSearch = require('./schema/operators/text');\nconst get = require('./helpers/get');\nconst util = require('util');\nconst utils = require('./utils');... | [
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [27], "buggy_code_start_loc": [27], "filenames": ["lib/cast.js"], "fixing_code_end_loc": [34], "fixing_code_start_loc": [28], "message": "Automattic Mongoose through 5.7.4 allows attackers to bypass access control (in some applications) because any query object with a _bsontype attribute is ignor... | 867 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict';",
"/*!\n * Module dependencies.\n */",
"const StrictModeError = require('./error/strict');\nconst Types = require('./schema/index');\nconst castTextSearch = require('./schema/operators/text');\nconst get = require('./helpers/get');\nconst util = require('util');\nconst utils = require('./utils');... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [27], "buggy_code_start_loc": [27], "filenames": ["lib/cast.js"], "fixing_code_end_loc": [34], "fixing_code_start_loc": [28], "message": "Automattic Mongoose through 5.7.4 allows attackers to bypass access control (in some applications) because any query object with a _bsontype attribute is ignor... | 867 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * Omeka\n * \n * @copyright Copyright 2007-2012 Roy Rosenzweig Center for History and New Media\n * @license http://www.gnu.org/licenses/gpl-3.0.txt GNU GPLv3\n */",
"/**\n * This ZF controller plugin allows the HtmlPurifier to filter the existing \n * forms (items, collections, users, etc.) so that... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [97], "buggy_code_start_loc": [97], "filenames": ["application/libraries/Omeka/Controller/Plugin/HtmlPurifier.php"], "fixing_code_end_loc": [116], "fixing_code_start_loc": [98], "message": "Cross Site Scripting (XSS) vulnerability in admin/files/edit in Omeka Classic <=2.7 allows remote attackers... | 868 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * Omeka\n * \n * @copyright Copyright 2007-2012 Roy Rosenzweig Center for History and New Media\n * @license http://www.gnu.org/licenses/gpl-3.0.txt GNU GPLv3\n */",
"/**\n * This ZF controller plugin allows the HtmlPurifier to filter the existing \n * forms (items, collections, users, etc.) so that... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [97], "buggy_code_start_loc": [97], "filenames": ["application/libraries/Omeka/Controller/Plugin/HtmlPurifier.php"], "fixing_code_end_loc": [116], "fixing_code_start_loc": [98], "message": "Cross Site Scripting (XSS) vulnerability in admin/files/edit in Omeka Classic <=2.7 allows remote attackers... | 868 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict';",
"// Load modules",
"const Boom = require('boom');\nconst Cryptiles = require('cryptiles');\nconst Hoek = require('hoek');\nconst Iron = require('iron');\nconst Items = require('items');",
"\n// Declare internals",
"const internals = {\n version: '2'\n};",
"\nexports = module.exports = ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [541, 35, 389], "buggy_code_start_loc": [540, 4, 389], "filenames": ["lib/socket.js", "package.json", "test/auth.js"], "fixing_code_end_loc": [546, 35, 425], "fixing_code_start_loc": [540, 4, 390], "message": "Nes is a websocket extension library for hapi. Hapi is a webserver framework. Versions ... | 869 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict';",
"// Load modules",
"const Boom = require('boom');\nconst Cryptiles = require('cryptiles');\nconst Hoek = require('hoek');\nconst Iron = require('iron');\nconst Items = require('items');",
"\n// Declare internals",
"const internals = {\n version: '2'\n};",
"\nexports = module.exports = ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [541, 35, 389], "buggy_code_start_loc": [540, 4, 389], "filenames": ["lib/socket.js", "package.json", "test/auth.js"], "fixing_code_end_loc": [546, 35, 425], "fixing_code_start_loc": [540, 4, 390], "message": "Nes is a websocket extension library for hapi. Hapi is a webserver framework. Versions ... | 869 |
Determine whether the {function_name} code is vulnerable or not. | [
"{\n \"name\": \"nes\",\n \"description\": \"WebSocket adapter plugin for hapi routes\",",
" \"version\": \"6.4.0\",",
" \"repository\": \"git://github.com/hapijs/nes\",\n \"main\": \"lib/index.js\",\n \"browser\": \"dist/client.js\",\n \"keywords\": [\n \"hapi\",\n \"plugin\",\n \"websocket\"\n... | [
1,
0,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [541, 35, 389], "buggy_code_start_loc": [540, 4, 389], "filenames": ["lib/socket.js", "package.json", "test/auth.js"], "fixing_code_end_loc": [546, 35, 425], "fixing_code_start_loc": [540, 4, 390], "message": "Nes is a websocket extension library for hapi. Hapi is a webserver framework. Versions ... | 869 |
Determine whether the {function_name} code is vulnerable or not. | [
"{\n \"name\": \"nes\",\n \"description\": \"WebSocket adapter plugin for hapi routes\",",
" \"version\": \"6.4.1\",",
" \"repository\": \"git://github.com/hapijs/nes\",\n \"main\": \"lib/index.js\",\n \"browser\": \"dist/client.js\",\n \"keywords\": [\n \"hapi\",\n \"plugin\",\n \"websocket\"\n... | [
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [541, 35, 389], "buggy_code_start_loc": [540, 4, 389], "filenames": ["lib/socket.js", "package.json", "test/auth.js"], "fixing_code_end_loc": [546, 35, 425], "fixing_code_start_loc": [540, 4, 390], "message": "Nes is a websocket extension library for hapi. Hapi is a webserver framework. Versions ... | 869 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict';",
"// Load modules",
"const Boom = require('boom');\nconst Code = require('code');\nconst Hapi = require('hapi');\nconst Hoek = require('hoek');\nconst Iron = require('iron');\nconst Lab = require('lab');\nconst Nes = require('../');",
"\n// Declare internals",
"const internals = {};",
"\n/... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [541, 35, 389], "buggy_code_start_loc": [540, 4, 389], "filenames": ["lib/socket.js", "package.json", "test/auth.js"], "fixing_code_end_loc": [546, 35, 425], "fixing_code_start_loc": [540, 4, 390], "message": "Nes is a websocket extension library for hapi. Hapi is a webserver framework. Versions ... | 869 |
Determine whether the {function_name} code is vulnerable or not. | [
"'use strict';",
"// Load modules",
"const Boom = require('boom');\nconst Code = require('code');\nconst Hapi = require('hapi');\nconst Hoek = require('hoek');\nconst Iron = require('iron');\nconst Lab = require('lab');\nconst Nes = require('../');",
"\n// Declare internals",
"const internals = {};",
"\n/... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [541, 35, 389], "buggy_code_start_loc": [540, 4, 389], "filenames": ["lib/socket.js", "package.json", "test/auth.js"], "fixing_code_end_loc": [546, 35, 425], "fixing_code_start_loc": [540, 4, 390], "message": "Nes is a websocket extension library for hapi. Hapi is a webserver framework. Versions ... | 869 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Copyright (c) 2011-2015 The original author or authors\n * ------------------------------------------------------\n * All rights reserved. This program and the accompanying materials\n * are made available under the terms of the Eclipse Public License v1.0\n * and Apache License v2.0 which accompanies ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [41, 98, 127, 236, 171], "buggy_code_start_loc": [41, 98, 73, 29, 18], "filenames": ["src/main/java/io/vertx/ext/stomp/DefaultConnectHandler.java", "src/main/java/io/vertx/ext/stomp/StompServerConnection.java", "src/main/java/io/vertx/ext/stomp/impl/DefaultStompHandler.java", "src/main/java/io/ve... | 870 |
Determine whether the {function_name} code is vulnerable or not. | [
"// SPDX-License-Identifier: GPL-2.0-or-later\n/*\n * Copyright (c) 2015 Tim Theede <pez2001@voyagerproject.de>\n * 2015 Terry Cain <terry@terrys-home.co.uk>\n */",
"#include <linux/kernel.h>\n#include <linux/slab.h>\n#include <linux/module.h>\n#include <linux/init.h>\n#include <linux/hid.h>",
"\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [107], "buggy_code_start_loc": [107], "filenames": ["driver/razercommon.c"], "fixing_code_end_loc": [116], "fixing_code_start_loc": [108], "message": "OpenRazer is an open source driver and user-space daemon to control Razer device lighting and other features on GNU/Linux. Using a modified USB de... | 871 |
Determine whether the {function_name} code is vulnerable or not. | [
"// SPDX-License-Identifier: GPL-2.0-or-later\n/*\n * Copyright (c) 2015 Tim Theede <pez2001@voyagerproject.de>\n * 2015 Terry Cain <terry@terrys-home.co.uk>\n */",
"#include <linux/kernel.h>\n#include <linux/slab.h>\n#include <linux/module.h>\n#include <linux/init.h>\n#include <linux/hid.h>",
"\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [107], "buggy_code_start_loc": [107], "filenames": ["driver/razercommon.c"], "fixing_code_end_loc": [116], "fixing_code_start_loc": [108], "message": "OpenRazer is an open source driver and user-space daemon to control Razer device lighting and other features on GNU/Linux. Using a modified USB de... | 871 |
Determine whether the {function_name} code is vulnerable or not. | [
"#include <linux/fs.h>",
"#include \"headers.h\"\n/***************************************************************\n* Function\t - bcm_char_open()\n*\n* Description - This is the \"open\" entry point for the character\n*\t\t\t\tdriver.\n*\n* Parameters - inode: Pointer to the Inode structure of char device\n*\t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [1962], "buggy_code_start_loc": [1962], "filenames": ["drivers/staging/bcm/Bcmchar.c"], "fixing_code_end_loc": [1964], "fixing_code_start_loc": [1963], "message": "The bcm_char_ioctl function in drivers/staging/bcm/Bcmchar.c in the Linux kernel before 3.12 does not initialize a certain data struc... | 872 |
Determine whether the {function_name} code is vulnerable or not. | [
"#include <linux/fs.h>",
"#include \"headers.h\"\n/***************************************************************\n* Function\t - bcm_char_open()\n*\n* Description - This is the \"open\" entry point for the character\n*\t\t\t\tdriver.\n*\n* Parameters - inode: Pointer to the Inode structure of char device\n*\t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [1962], "buggy_code_start_loc": [1962], "filenames": ["drivers/staging/bcm/Bcmchar.c"], "fixing_code_end_loc": [1964], "fixing_code_start_loc": [1963], "message": "The bcm_char_ioctl function in drivers/staging/bcm/Bcmchar.c in the Linux kernel before 3.12 does not initialize a certain data struc... | 872 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Kernel-based Virtual Machine driver for Linux\n *\n * This module enables machines with Intel VT-x extensions to run virtual\n * machines without emulation or binary translation.\n *\n * Copyright (C) 2006 Qumranet, Inc.\n * Copyright 2010 Red Hat, Inc. and/or its affiliates.\n *\n * Authors:\n * Avi Kivi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [2895], "buggy_code_start_loc": [2892], "filenames": ["virt/kvm/kvm_main.c"], "fixing_code_end_loc": [2896], "fixing_code_start_loc": [2891], "message": "Use-after-free vulnerability in the kvm_ioctl_create_device function in virt/kvm/kvm_main.c in the Linux kernel before 4.8.13 allows host OS us... | 873 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * Kernel-based Virtual Machine driver for Linux\n *\n * This module enables machines with Intel VT-x extensions to run virtual\n * machines without emulation or binary translation.\n *\n * Copyright (C) 2006 Qumranet, Inc.\n * Copyright 2010 Red Hat, Inc. and/or its affiliates.\n *\n * Authors:\n * Avi Kivi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [2895], "buggy_code_start_loc": [2892], "filenames": ["virt/kvm/kvm_main.c"], "fixing_code_end_loc": [2896], "fixing_code_start_loc": [2891], "message": "Use-after-free vulnerability in the kvm_ioctl_create_device function in virt/kvm/kvm_main.c in the Linux kernel before 4.8.13 allows host OS us... | 873 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"/**\n * AJAX: handles an attachment with the given id.\n *\n * PHP Version 5.5\n *\n * This Source Code Form is subject to the terms of the Mozilla Public License,\n * v. 2.0. If a copy of the MPL was not distributed with this file, You can\n * obtain one at http://mozilla.org/MPL/2.0/.\n *\n * @categor... | [
1,
1,
0,
1,
0,
1,
1,
0,
1,
1,
0,
1,
0,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [42, 104], "buggy_code_start_loc": [13, 73], "filenames": ["phpmyfaq/admin/ajax.attachment.php", "phpmyfaq/admin/att.main.php"], "fixing_code_end_loc": [47, 105], "fixing_code_start_loc": [12, 73], "message": "In phpMyFAQ before 2.9.9, there is Cross-Site Request Forgery (CSRF) in admin/ajax.atta... | 874 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"/**\n * AJAX: handles an attachment with the given id.\n *\n * PHP Version 5.5\n *\n * This Source Code Form is subject to the terms of the Mozilla Public License,\n * v. 2.0. If a copy of the MPL was not distributed with this file, You can\n * obtain one at http://mozilla.org/MPL/2.0/.\n *\n * @categor... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [42, 104], "buggy_code_start_loc": [13, 73], "filenames": ["phpmyfaq/admin/ajax.attachment.php", "phpmyfaq/admin/att.main.php"], "fixing_code_end_loc": [47, 105], "fixing_code_start_loc": [12, 73], "message": "In phpMyFAQ before 2.9.9, there is Cross-Site Request Forgery (CSRF) in admin/ajax.atta... | 874 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * Ajax interface for attachments.\n *\n * PHP Version 5.5\n *\n * This Source Code Form is subject to the terms of the Mozilla Public License,\n * v. 2.0. If a copy of the MPL was not distributed with this file, You can\n * obtain one at http://mozilla.org/MPL/2.0/.\n *\n * @category phpMyFAQ\n * @au... | [
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1
] | PreciseBugs | {"buggy_code_end_loc": [42, 104], "buggy_code_start_loc": [13, 73], "filenames": ["phpmyfaq/admin/ajax.attachment.php", "phpmyfaq/admin/att.main.php"], "fixing_code_end_loc": [47, 105], "fixing_code_start_loc": [12, 73], "message": "In phpMyFAQ before 2.9.9, there is Cross-Site Request Forgery (CSRF) in admin/ajax.atta... | 874 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * Ajax interface for attachments.\n *\n * PHP Version 5.5\n *\n * This Source Code Form is subject to the terms of the Mozilla Public License,\n * v. 2.0. If a copy of the MPL was not distributed with this file, You can\n * obtain one at http://mozilla.org/MPL/2.0/.\n *\n * @category phpMyFAQ\n * @au... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [42, 104], "buggy_code_start_loc": [13, 73], "filenames": ["phpmyfaq/admin/ajax.attachment.php", "phpmyfaq/admin/att.main.php"], "fixing_code_end_loc": [47, 105], "fixing_code_start_loc": [12, 73], "message": "In phpMyFAQ before 2.9.9, there is Cross-Site Request Forgery (CSRF) in admin/ajax.atta... | 874 |
Determine whether the {function_name} code is vulnerable or not. | [
"# Changelog\nAll notable changes to this project will be documented in this file.",
"The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),\nand this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).",
"## [Unreleased]",
"",
"\n## [4.0.2] - 2022-01-10"... | [
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"# Changelog\nAll notable changes to this project will be documented in this file.",
"The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),\nand this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).",
"## [Unreleased]",
"\n### Security\n- Prevent evasio... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * This file is part of Smarty.\n *\n * (c) 2015 Uwe Tews\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.\n */\n%stack_size 500\n%name TP_\n%declare_class {\n/**\n* Smarty Template Parser Class\n*\n* This is the template parse... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * This file is part of Smarty.\n *\n * (c) 2015 Uwe Tews\n *\n * For the full copyright and license information, please view the LICENSE\n * file that was distributed with this source code.\n */\n%stack_size 500\n%name TP_\n%declare_class {\n/**\n* Smarty Template Parser Class\n*\n* This is the template parse... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"class TP_yyStackEntry\n{\n public $stateno; /* The state-number */\n public $major; /* The major token value. This is the code\n ** number for the token at this stack level */\n public $minor; /* The user-supplied minor token value. This\n ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"class TP_yyStackEntry\n{\n public $stateno; /* The state-number */\n public $major; /* The major token value. This is the code\n ** number for the token at this stack level */\n public $minor; /* The user-supplied minor token value. This\n ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * Smarty PHPunit tests for security\n *\n * @package PHPunit\n * @author Uwe Tews\n */",
"/**\n * class for security test\n *\n * @runTestsInSeparateProcess\n * @preserveGlobalState disabled\n * @backupStaticAttributes enabled\n */\nclass SecurityTest extends PHPUnit_Smarty\n{\n public function ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n/**\n * Smarty PHPunit tests for security\n *\n * @package PHPunit\n * @author Uwe Tews\n */",
"/**\n * class for security test\n *\n * @runTestsInSeparateProcess\n * @preserveGlobalState disabled\n * @backupStaticAttributes enabled\n */\nclass SecurityTest extends PHPUnit_Smarty\n{\n public function ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [7, 749, 2399, 271], "buggy_code_start_loc": [7, 749, 2399, 260], "filenames": ["CHANGELOG.md", "lexer/smarty_internal_templateparser.y", "libs/sysplugins/smarty_internal_templateparser.php", "tests/UnitTests/SecurityTests/SecurityTest.php"], "fixing_code_end_loc": [11, 753, 2403, 294], "fixing_c... | 875 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* radare - LGPL - Copyright 2009-2016 - earada, pancake */",
"#include <stdio.h>\n#include <string.h>",
"#include <r_types.h>\n#include <r_lib.h>\n#include <r_asm.h>",
"#include <dalvik/opcode.h>",
"static int dalvik_disassemble (RAsm *a, RAsmOp *op, const ut8 *buf, int len) {\n\tint vA, vB, vC, payload =... | [
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1,
0,
1... | PreciseBugs | {"buggy_code_end_loc": [408], "buggy_code_start_loc": [29], "filenames": ["libr/asm/p/asm_dalvik.c"], "fixing_code_end_loc": [408], "fixing_code_start_loc": [29], "message": "The dalvik_disassemble function in libr/asm/p/asm_dalvik.c in radare2 1.2.1 allows remote attackers to cause a denial of service (stack-based buf... | 876 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* radare - LGPL - Copyright 2009-2016 - earada, pancake */",
"#include <stdio.h>\n#include <string.h>",
"#include <r_types.h>\n#include <r_lib.h>\n#include <r_asm.h>",
"#include <dalvik/opcode.h>",
"static int dalvik_disassemble (RAsm *a, RAsmOp *op, const ut8 *buf, int len) {\n\tint vA, vB, vC, payload =... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [408], "buggy_code_start_loc": [29], "filenames": ["libr/asm/p/asm_dalvik.c"], "fixing_code_end_loc": [408], "fixing_code_start_loc": [29], "message": "The dalvik_disassemble function in libr/asm/p/asm_dalvik.c in radare2 1.2.1 allows remote attackers to cause a denial of service (stack-based buf... | 876 |
Determine whether the {function_name} code is vulnerable or not. | [
"# -*- coding: utf-8 -*-\n#\n# Copyright (C) 2020-2021 CERN.\n# Copyright (C) 2020 Northwestern University.\n#\n# Invenio-Drafts-Resources is free software; you can redistribute it and/or\n# modify it under the terms of the MIT License; see LICENSE file for more\n# details.",
"\"\"\"Primary service for working wi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [273], "buggy_code_start_loc": [270], "filenames": ["invenio_drafts_resources/services/records/service.py"], "fixing_code_end_loc": [273], "fixing_code_start_loc": [269], "message": "Invenio-Drafts-Resources is a submission/deposit module for Invenio, a software framework for research data manage... | 877 |
Determine whether the {function_name} code is vulnerable or not. | [
"# -*- coding: utf-8 -*-\n#\n# Copyright (C) 2020-2021 CERN.\n# Copyright (C) 2020 Northwestern University.\n#\n# Invenio-Drafts-Resources is free software; you can redistribute it and/or\n# modify it under the terms of the MIT License; see LICENSE file for more\n# details.",
"\"\"\"Primary service for working wi... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [273], "buggy_code_start_loc": [270], "filenames": ["invenio_drafts_resources/services/records/service.py"], "fixing_code_end_loc": [273], "fixing_code_start_loc": [269], "message": "Invenio-Drafts-Resources is a submission/deposit module for Invenio, a software framework for research data manage... | 877 |
Determine whether the {function_name} code is vulnerable or not. | [
"-*- coding: utf-8 -*-\nChanges with Apache 2.5.0",
"",
"\n *) mod_md: v0.9.1:\n - various fixes in MDRenewWindow handling when specifying percent. Serialization changed. If \n someone already used percent configurations, it is advised to change these to a new value,\n reload and change back to... | [
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [2, 2333], "buggy_code_start_loc": [2, 2333], "filenames": ["CHANGES", "server/core.c"], "fixing_code_end_loc": [6, 2340], "fixing_code_start_loc": [3, 2334], "message": "Apache httpd allows remote attackers to read secret data from process memory if the Limit directive can be set in a user's .ht... | 878 |
Determine whether the {function_name} code is vulnerable or not. | [
"-*- coding: utf-8 -*-\nChanges with Apache 2.5.0",
"\n *) core: Disallow Methods' registration at runtime (.htaccess), they may be\n used only if registered at init time (httpd.conf). [Yann Ylavic]",
"\n *) mod_md: v0.9.1:\n - various fixes in MDRenewWindow handling when specifying percent. Serializ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [2, 2333], "buggy_code_start_loc": [2, 2333], "filenames": ["CHANGES", "server/core.c"], "fixing_code_end_loc": [6, 2340], "fixing_code_start_loc": [3, 2334], "message": "Apache httpd allows remote attackers to read secret data from process memory if the Limit directive can be set in a user's .ht... | 878 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [2, 2333], "buggy_code_start_loc": [2, 2333], "filenames": ["CHANGES", "server/core.c"], "fixing_code_end_loc": [6, 2340], "fixing_code_start_loc": [3, 2334], "message": "Apache httpd allows remote attackers to read secret data from process memory if the Limit directive can be set in a user's .ht... | 878 |
Determine whether the {function_name} code is vulnerable or not. | [
"/* Licensed to the Apache Software Foundation (ASF) under one or more\n * contributor license agreements. See the NOTICE file distributed with\n * this work for additional information regarding copyright ownership.\n * The ASF licenses this file to You under the Apache License, Version 2.0\n * (the \"License\"); ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [2, 2333], "buggy_code_start_loc": [2, 2333], "filenames": ["CHANGES", "server/core.c"], "fixing_code_end_loc": [6, 2340], "fixing_code_start_loc": [3, 2334], "message": "Apache httpd allows remote attackers to read secret data from process memory if the Limit directive can be set in a user's .ht... | 878 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"use Dibi\\Connection;",
"class Organizr\n{\n\t// Use Custom Functions From Traits;\n\tuse TwoFAFunctions;\n\tuse ApiFunctions;\n\tuse AuthFunctions;\n\tuse BackupFunctions;\n\tuse ConfigFunctions;\n\tuse DemoFunctions;\n\tuse HomepageConnectFunctions;\n\tuse HomepageFunctions;\n\tuse LogFunctions;\n\t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"use Dibi\\Connection;",
"class Organizr\n{\n\t// Use Custom Functions From Traits;\n\tuse TwoFAFunctions;\n\tuse ApiFunctions;\n\tuse AuthFunctions;\n\tuse BackupFunctions;\n\tuse ConfigFunctions;\n\tuse DemoFunctions;\n\tuse HomepageConnectFunctions;\n\tuse HomepageFunctions;\n\tuse LogFunctions;\n\t... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"trait LogFunctions\n{\n\tpublic function logLocation()\n\t{\n\t\treturn isset($this->config['logLocation']) && $this->config['logLocation'] !== '' ? $this->config['logLocation'] : $this->config['dbLocation'] . 'logs' . DIRECTORY_SEPARATOR;\n\t}",
"\tpublic function debug($msg, $context = [])\n\t{\n\t\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"trait LogFunctions\n{\n\tpublic function logLocation()\n\t{\n\t\treturn isset($this->config['logLocation']) && $this->config['logLocation'] !== '' ? $this->config['logLocation'] : $this->config['dbLocation'] . 'logs' . DIRECTORY_SEPARATOR;\n\t}",
"\tpublic function debug($msg, $context = [])\n\t{\n\t\... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"trait OrganizrFunctions\n{\n\tpublic function docs($path): string\n\t{\n\t\treturn 'https://organizr.gitbook.io/organizr/' . $path;\n\t}",
"\tpublic function loadResources($files = [], $rootPath = '')\n\t{\n\t\t$scripts = '';\n\t\tif (count($files) > 0) {\n\t\t\tforeach ($files as $file) {\n\t\t\t\tif... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php",
"trait OrganizrFunctions\n{\n\tpublic function docs($path): string\n\t{\n\t\treturn 'https://organizr.gitbook.io/organizr/' . $path;\n\t}",
"\tpublic function loadResources($files = [], $rootPath = '')\n\t{\n\t\t$scripts = '';\n\t\tif (count($files) > 0) {\n\t\t\tforeach ($files as $file) {\n\t\t\t\tif... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n// PLUGIN INFORMATION\n$GLOBALS['plugins']['Bookmark'] = array( // Plugin Name\n\t'name' => 'Bookmark', // Plugin Name\n\t'author' => 'leet1994', // Who wrote the plugin\n\t'category' => 'Utilities', // One to Two Word Description\n\t'link' => '', // Link to plugin info\n\t'license' => 'personal,business', ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1,
1,
0,
1,
0,
1,
0,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"<?php\n// PLUGIN INFORMATION\n$GLOBALS['plugins']['Bookmark'] = array( // Plugin Name\n\t'name' => 'Bookmark', // Plugin Name\n\t'author' => 'leet1994', // Who wrote the plugin\n\t'category' => 'Utilities', // One to Two Word Description\n\t'link' => '', // Link to plugin info\n\t'license' => 'personal,business', ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [6478, 216, 220, 915], "buggy_code_start_loc": [1898, 215, 219, 572], "filenames": ["api/classes/organizr.class.php", "api/functions/log-functions.php", "api/functions/organizr-functions.php", "api/plugins/bookmark/plugin.php"], "fixing_code_end_loc": [6545, 216, 218, 929], "fixing_code_start_loc... | 879 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * MOV, 3GP, MP4 muxer\n * Copyright (c) 2003 Thomas Raivio\n * Copyright (c) 2004 Gildas Bazin <gbazin at videolan dot org>\n * Copyright (c) 2009 Baptiste Coudurier <baptiste dot coudurier at gmail dot com>\n *\n * This file is part of FFmpeg.\n *\n * FFmpeg is free software; you can redistribute it and/or\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [433], "buggy_code_start_loc": [432], "filenames": ["libavformat/movenc.c"], "fixing_code_end_loc": [433], "fixing_code_start_loc": [432], "message": "In FFmpeg 3.2 and 4.0.1, an improper argument (AVCodecParameters) passed to the avpriv_request_sample function in the handle_eac3 function in liba... | 880 |
Determine whether the {function_name} code is vulnerable or not. | [
"/*\n * MOV, 3GP, MP4 muxer\n * Copyright (c) 2003 Thomas Raivio\n * Copyright (c) 2004 Gildas Bazin <gbazin at videolan dot org>\n * Copyright (c) 2009 Baptiste Coudurier <baptiste dot coudurier at gmail dot com>\n *\n * This file is part of FFmpeg.\n *\n * FFmpeg is free software; you can redistribute it and/or\n... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [433], "buggy_code_start_loc": [432], "filenames": ["libavformat/movenc.c"], "fixing_code_end_loc": [433], "fixing_code_start_loc": [432], "message": "In FFmpeg 3.2 and 4.0.1, an improper argument (AVCodecParameters) passed to the avpriv_request_sample function in the handle_eac3 function in liba... | 880 |
Determine whether the {function_name} code is vulnerable or not. | [
"package com.fit2cloud.provider.impl.huawei.api;",
"import com.aliyun.tea.TeaException;\nimport com.fit2cloud.common.exception.Fit2cloudException;\nimport com.fit2cloud.common.log.utils.LogUtil;\nimport com.fit2cloud.common.provider.entity.F2CEntityType;\nimport com.fit2cloud.common.provider.entity.F2CPerfMetricM... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [702], "buggy_code_start_loc": [702], "filenames": ["services/vm-service/backend/src/main/java/com/fit2cloud/provider/impl/huawei/api/HuaweiSyncCloudApi.java"], "fixing_code_end_loc": [704], "fixing_code_start_loc": [703], "message": "Missing Authorization in GitHub repository cloudexplorer-dev/c... | 881 |
Determine whether the {function_name} code is vulnerable or not. | [
"package com.fit2cloud.provider.impl.huawei.api;",
"import com.aliyun.tea.TeaException;\nimport com.fit2cloud.common.exception.Fit2cloudException;\nimport com.fit2cloud.common.log.utils.LogUtil;\nimport com.fit2cloud.common.provider.entity.F2CEntityType;\nimport com.fit2cloud.common.provider.entity.F2CPerfMetricM... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [702], "buggy_code_start_loc": [702], "filenames": ["services/vm-service/backend/src/main/java/com/fit2cloud/provider/impl/huawei/api/HuaweiSyncCloudApi.java"], "fixing_code_end_loc": [704], "fixing_code_start_loc": [703], "message": "Missing Authorization in GitHub repository cloudexplorer-dev/c... | 881 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b CLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download CLARRV + d... | [
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b CLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download CLARRV + d... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b DLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download DLARRV + d... | [
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b DLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download DLARRV + d... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b SLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download SLARRV + d... | [
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b SLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download SLARRV + d... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b ZLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download ZLARRV + d... | [
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"*> \\brief \\b ZLARRV computes the eigenvectors of the tridiagonal matrix T = L D LT given L, D and the eigenvalues of L D LT.\n*\n* =========== DOCUMENTATION ===========\n*\n* Online html documentation available at\n* http://www.netlib.org/lapack/explore-html/\n*\n*> \\htmlonly\n*> Download ZLARRV + d... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1
] | PreciseBugs | {"buggy_code_end_loc": [352, 354, 354, 352], "buggy_code_start_loc": [351, 353, 353, 351], "filenames": ["SRC/clarrv.f", "SRC/dlarrv.f", "SRC/slarrv.f", "SRC/zlarrv.f"], "fixing_code_end_loc": [352, 354, 354, 352], "fixing_code_start_loc": [351, 353, 353, 351], "message": "An out-of-bounds read flaw was found in the CL... | 882 |
Determine whether the {function_name} code is vulnerable or not. | [
"To build RPM you will need several other packages:\n--------------------------------------------------",
"The popt library for option parsing, must be version 1.13 or later.\nIt is available from\n http://ftp.rpm.org/popt/",
"The debugedit >= 0.3 tools for producing debuginfo sub-packages.\nIt is available ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
0,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [104, 584, 1024], "buggy_code_start_loc": [104, 583, 10], "filenames": ["INSTALL", "configure.ac", "lib/fsm.c"], "fixing_code_end_loc": [107, 585, 1157], "fixing_code_start_loc": [105, 583, 11], "message": "It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check wa... | 883 |
Determine whether the {function_name} code is vulnerable or not. | [
"To build RPM you will need several other packages:\n--------------------------------------------------",
"The popt library for option parsing, must be version 1.13 or later.\nIt is available from\n http://ftp.rpm.org/popt/",
"The debugedit >= 0.3 tools for producing debuginfo sub-packages.\nIt is available ... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [104, 584, 1024], "buggy_code_start_loc": [104, 583, 10], "filenames": ["INSTALL", "configure.ac", "lib/fsm.c"], "fixing_code_end_loc": [107, 585, 1157], "fixing_code_start_loc": [105, 583, 11], "message": "It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check wa... | 883 |
Determine whether the {function_name} code is vulnerable or not. | [
"AC_PREREQ(2.61)\nAC_INIT(rpm, 4.17.90, rpm-maint@lists.rpm.org)",
"AC_CONFIG_SRCDIR([rpm.c])\nAC_CONFIG_HEADERS([config.h])\nAC_CONFIG_MACRO_DIR([m4])\nAC_CONFIG_AUX_DIR([build-aux])",
"AM_INIT_AUTOMAKE([1.10 foreign tar-pax dist-bzip2 subdir-objects nostdinc])\ndnl Allow silent build on automake versions that... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [104, 584, 1024], "buggy_code_start_loc": [104, 583, 10], "filenames": ["INSTALL", "configure.ac", "lib/fsm.c"], "fixing_code_end_loc": [107, 585, 1157], "fixing_code_start_loc": [105, 583, 11], "message": "It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check wa... | 883 |
Determine whether the {function_name} code is vulnerable or not. | [
"AC_PREREQ(2.61)\nAC_INIT(rpm, 4.17.90, rpm-maint@lists.rpm.org)",
"AC_CONFIG_SRCDIR([rpm.c])\nAC_CONFIG_HEADERS([config.h])\nAC_CONFIG_MACRO_DIR([m4])\nAC_CONFIG_AUX_DIR([build-aux])",
"AM_INIT_AUTOMAKE([1.10 foreign tar-pax dist-bzip2 subdir-objects nostdinc])\ndnl Allow silent build on automake versions that... | [
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1,
1... | PreciseBugs | {"buggy_code_end_loc": [104, 584, 1024], "buggy_code_start_loc": [104, 583, 10], "filenames": ["INSTALL", "configure.ac", "lib/fsm.c"], "fixing_code_end_loc": [107, 585, 1157], "fixing_code_start_loc": [105, 583, 11], "message": "It was found that the fix for CVE-2017-7500 and CVE-2017-7501 was incomplete: the check wa... | 883 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.