Sign in
Sign up
Explore
Enterprise
Education
Search
Help
Terms of use
About Us
Explore
Enterprise
Education
Gitee Premium
Gitee AI
Sign in
Sign up
Fetch the repository succeeded.
Donate
Please sign in before you donate.
Cancel
Sign in
Scan WeChat QR to Pay
Cancel
Complete
Prompt
Switch to Alipay.
OK
Cancel
Watch
Unwatch
Watching
Releases Only
Ignoring
11
Star
1
Fork
14
src-openEuler
/
coredns
Code
Issues
7
Pull Requests
3
Wiki
Insights
Pipelines
Service
JavaDoc
PHPDoc
Quality Analysis
Jenkins for Gitee
Tencent CloudBase
Tencent Cloud Serverless
悬镜安全
Aliyun SAE
Codeblitz
SBOM
Don’t show this again
Update failed. Please try again later!
Remove this flag
Content Risk Flag
This task is identified by
as the content contains sensitive information such as code security bugs, privacy leaks, etc., so it is only accessible to contributors of this repository.
CVE-2025-29786
Backlog
#ICBCOI
CVE和安全问题
openeuler-ci-bot
owner
Opened this issue
2025-05-29 11:39
一、漏洞信息 漏洞编号:[CVE-2025-29786](https://nvd.nist.gov/vuln/detail/CVE-2025-29786) 漏洞归属组件:[coredns](https://gitee.com/src-openeuler/coredns) 漏洞归属的版本:1.11.3,1.7.0 CVSS V3.0分值: BaseScore:7.5 High Vector:CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H 漏洞简述: Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr expression parser is given an unbounded input string, it will attempt to compile the entire string and generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size isn’t limited, a malicious or inadvertent extremely large expression can consume excessive memory as the parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM) crash of the process. This issue is relatively uncommon and will only manifest when there are no restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In typical use cases where inputs are bounded or validated, this problem would not occur. The problem has been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the number of AST nodes and memory usage during parsing, preventing any single expression from exhausting resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In practice, this means validating or limiting the length of expression strings that your application will accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch. 漏洞公开时间:2025-03-17 22:15:22 漏洞创建时间:2025-05-29 11:39:06 漏洞详情参考链接: https://nvd.nist.gov/vuln/detail/CVE-2025-29786 <details> <summary>更多参考(点击展开)</summary> 无 </details> 漏洞分析指导链接: https://gitee.com/openeuler/cve-manager/blob/master/cve-vulner-manager/doc/md/manual.md 漏洞数据来源: 七彩瞬析开源风险感知平台 漏洞补丁信息: <details> <summary>详情(点击展开)</summary> | 影响的包 | 修复版本 | 修复补丁 | 问题引入补丁 | 来源 | | ------- | -------- | ------- | -------- | --------- | | expr-lang/expr | | https://github.com/expr-lang/expr/commit/0d19441454426d2f58edb22c31f3ba5f99c7a26e.patch | | ljqc | </details> 二、漏洞分析结构反馈 影响性分析说明: openEuler评分: 受影响版本排查(受影响/不受影响): 1.master(1.11.3): 2.openEuler-20.03-LTS-SP4(1.7.0): 3.openEuler-22.03-LTS-SP3(1.7.0): 4.openEuler-22.03-LTS-SP4(1.7.0): 5.openEuler-24.03-LTS(1.7.0): 6.openEuler-24.03-LTS-Next(1.7.0): 7.openEuler-24.03-LTS-SP1(1.7.0): 8.openEuler-24.03-LTS-SP2(1.7.0): 修复是否涉及abi变化(是/否): 1.master(1.11.3): 2.openEuler-20.03-LTS-SP4(1.7.0): 3.openEuler-22.03-LTS-SP3(1.7.0): 4.openEuler-22.03-LTS-SP4(1.7.0): 5.openEuler-24.03-LTS(1.7.0): 6.openEuler-24.03-LTS-Next(1.7.0): 7.openEuler-24.03-LTS-SP1(1.7.0): 8.openEuler-24.03-LTS-SP2(1.7.0): 原因说明: 1.master(1.11.3): 2.openEuler-20.03-LTS-SP4(1.7.0): 3.openEuler-22.03-LTS-SP3(1.7.0): 4.openEuler-22.03-LTS-SP4(1.7.0): 5.openEuler-24.03-LTS(1.7.0): 6.openEuler-24.03-LTS-Next(1.7.0): 7.openEuler-24.03-LTS-SP1(1.7.0): 8.openEuler-24.03-LTS-SP2(1.7.0):
一、漏洞信息 漏洞编号:[CVE-2025-29786](https://nvd.nist.gov/vuln/detail/CVE-2025-29786) 漏洞归属组件:[coredns](https://gitee.com/src-openeuler/coredns) 漏洞归属的版本:1.11.3,1.7.0 CVSS V3.0分值: BaseScore:7.5 High Vector:CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H 漏洞简述: Expr is an expression language and expression evaluation for Go. Prior to version 1.17.0, if the Expr expression parser is given an unbounded input string, it will attempt to compile the entire string and generate an Abstract Syntax Tree (AST) node for each part of the expression. In scenarios where input size isn’t limited, a malicious or inadvertent extremely large expression can consume excessive memory as the parser builds a huge AST. This can ultimately lead to*excessive memory usage and an Out-Of-Memory (OOM) crash of the process. This issue is relatively uncommon and will only manifest when there are no restrictions on the input size, i.e. the expression length is allowed to grow arbitrarily large. In typical use cases where inputs are bounded or validated, this problem would not occur. The problem has been patched in the latest versions of the Expr library. The fix introduces compile-time limits on the number of AST nodes and memory usage during parsing, preventing any single expression from exhausting resources. Users should upgrade to Expr version 1.17.0 or later, as this release includes the new node budget and memory limit safeguards. Upgrading to v1.17.0 ensures that extremely deep or large expressions are detected and safely aborted during compilation, avoiding the OOM condition. For users who cannot immediately upgrade, the recommended workaround is to impose an input size restriction before parsing. In practice, this means validating or limiting the length of expression strings that your application will accept. For example, set a maximum allowable number of characters (or nodes) for any expression and reject or truncate inputs that exceed this limit. By ensuring no unbounded-length expression is ever fed into the parser, one can prevent the parser from constructing a pathologically large AST and avoid potential memory exhaustion. In short, pre-validate and cap input size as a safeguard in the absence of the patch. 漏洞公开时间:2025-03-17 22:15:22 漏洞创建时间:2025-05-29 11:39:06 漏洞详情参考链接: https://nvd.nist.gov/vuln/detail/CVE-2025-29786 <details> <summary>更多参考(点击展开)</summary> 无 </details> 漏洞分析指导链接: https://gitee.com/openeuler/cve-manager/blob/master/cve-vulner-manager/doc/md/manual.md 漏洞数据来源: 七彩瞬析开源风险感知平台 漏洞补丁信息: <details> <summary>详情(点击展开)</summary> | 影响的包 | 修复版本 | 修复补丁 | 问题引入补丁 | 来源 | | ------- | -------- | ------- | -------- | --------- | | expr-lang/expr | | https://github.com/expr-lang/expr/commit/0d19441454426d2f58edb22c31f3ba5f99c7a26e.patch | | ljqc | </details> 二、漏洞分析结构反馈 影响性分析说明: openEuler评分: 受影响版本排查(受影响/不受影响): 1.master(1.11.3): 2.openEuler-20.03-LTS-SP4(1.7.0): 3.openEuler-22.03-LTS-SP3(1.7.0): 4.openEuler-22.03-LTS-SP4(1.7.0): 5.openEuler-24.03-LTS(1.7.0): 6.openEuler-24.03-LTS-Next(1.7.0): 7.openEuler-24.03-LTS-SP1(1.7.0): 8.openEuler-24.03-LTS-SP2(1.7.0): 修复是否涉及abi变化(是/否): 1.master(1.11.3): 2.openEuler-20.03-LTS-SP4(1.7.0): 3.openEuler-22.03-LTS-SP3(1.7.0): 4.openEuler-22.03-LTS-SP4(1.7.0): 5.openEuler-24.03-LTS(1.7.0): 6.openEuler-24.03-LTS-Next(1.7.0): 7.openEuler-24.03-LTS-SP1(1.7.0): 8.openEuler-24.03-LTS-SP2(1.7.0): 原因说明: 1.master(1.11.3): 2.openEuler-20.03-LTS-SP4(1.7.0): 3.openEuler-22.03-LTS-SP3(1.7.0): 4.openEuler-22.03-LTS-SP4(1.7.0): 5.openEuler-24.03-LTS(1.7.0): 6.openEuler-24.03-LTS-Next(1.7.0): 7.openEuler-24.03-LTS-SP1(1.7.0): 8.openEuler-24.03-LTS-SP2(1.7.0):
Comments (
4
)
Sign in
to comment
Status
Backlog
Backlog
已挂起
Doing
Done
Declined
Assignees
Not set
yangzhao_kl
yangzhao_kl
Assignee
Collaborator
+Assign
+Mention
Labels
CVE/UNFIXED
sig/sig-CloudNative
Not set
Projects
Unprojected
Unprojected
Milestones
No related milestones
No related milestones
Pull Requests
None yet
None yet
Successfully merging a pull request will close this issue.
Branches
No related branch
Branches (24)
Tags (19)
master
openEuler-25.03
openEuler-25.09
openEuler-24.03-LTS-Next
openEuler-24.03-LTS-SP1
openEuler-24.03-LTS-SP2
openEuler-24.03-LTS-SP3
openEuler-24.09
openEuler-24.03-LTS
openEuler-22.03-LTS-Next
openEuler-22.03-LTS-SP3
openEuler-22.03-LTS-SP4
openEuler-22.03-LTS-SP2
openEuler-22.03-LTS-SP1
openEuler-22.03-LTS
openEuler-21.09
openEuler-20.03-LTS-Next
openEuler-20.03-LTS-SP3
openEuler-20.03-LTS-SP4
openEuler-20.03-LTS-SP2
openEuler-21.03
openEuler-22.09
openEuler-23.03
openEuler-23.09
openEuler-25.09-release
openEuler-24.03-LTS-SP2-release
openEuler-25.03-release
openEuler-24.03-LTS-SP1-release
openEuler-22.03-LTS-SP4-release
openEuler-24.09-release
openEuler-24.03-LTS-release
openEuler-22.03-LTS-SP3-release
openEuler-23.09-rc5
openEuler-22.03-LTS-SP1-release
openEuler-22.09-release
openEuler-22.09-rc5
openEuler-22.09-20220829
openEuler-22.03-LTS-20220331
openEuler-22.03-LTS-round5
openEuler-22.03-LTS-round3
openEuler-22.03-LTS-round2
openEuler-22.03-LTS-round1
openEuler-20.03-LTS-SP2-20210624
Planed to start   -   Planed to end
-
Top level
Not Top
Top Level: High
Top Level: Medium
Top Level: Low
Priority
Not specified
Serious
Main
Secondary
Unimportant
Duration
(hours)
参与者(1)
1
https://gitee.com/src-openeuler/coredns.git
git@gitee.com:src-openeuler/coredns.git
src-openeuler
coredns
coredns
Going to Help Center
Search
Git 命令在线学习
如何在 Gitee 导入 GitHub 仓库
Git 仓库基础操作
企业版和社区版功能对比
SSH 公钥设置
如何处理代码冲突
仓库体积过大,如何减小?
如何找回被删除的仓库数据
Gitee 产品配额说明
GitHub仓库快速导入Gitee及同步更新
什么是 Release(发行版)
将 PHP 项目自动发布到 packagist.org
Repository Report
Back to the top
Login prompt
This operation requires login to the code cloud account. Please log in before operating.
Go to login
No account. Register