Количество 22
Количество 22
CVE-2025-38614
In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges exist. However...
CVE-2025-38614
In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges exist. However...
CVE-2025-38614
In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges exi
CVE-2025-38614
eventpoll: Fix semi-unbounded recursion
CVE-2025-38614
In the Linux kernel, the following vulnerability has been resolved: e ...
GHSA-grcg-mgx8-mfvf
In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges ...
RLSA-2025:17760
Moderate: kernel security update
ELSA-2025-21463
ELSA-2025-21463: kernel security update (MODERATE)
ELSA-2025-17760
ELSA-2025-17760: kernel security update (MODERATE)
RLSA-2025:18318
Moderate: kernel security update
ELSA-2025-18318
ELSA-2025-18318: kernel security update (MODERATE)
SUSE-SU-2025:3725-1
Security update for the Linux Kernel
SUSE-SU-2025:03601-1
Security update for the Linux Kernel
ELSA-2025-20662
ELSA-2025-20662: Unbreakable Enterprise kernel security update (IMPORTANT)
ELSA-2025-25757
ELSA-2025-25757: Unbreakable Enterprise kernel security update (IMPORTANT)
SUSE-SU-2025:03602-1
Security update for the Linux Kernel
SUSE-SU-2025:03633-1
Security update for the Linux Kernel
SUSE-SU-2025:3751-1
Security update for the Linux Kernel
SUSE-SU-2025:03600-1
Security update for the Linux Kernel
SUSE-SU-2025:03634-1
Security update for the Linux Kernel
Уязвимостей на страницу
Уязвимость | CVSS | EPSS | Опубликовано | |
|---|---|---|---|---|
CVE-2025-38614 In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges exist. However... | 0% Низкий | 4 месяца назад | ||
CVE-2025-38614 In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges exist. However... | CVSS3: 6.2 | 0% Низкий | 4 месяца назад | |
CVE-2025-38614 In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges exi | 0% Низкий | 4 месяца назад | ||
CVE-2025-38614 eventpoll: Fix semi-unbounded recursion | CVSS3: 5.5 | 0% Низкий | 4 месяца назад | |
CVE-2025-38614 In the Linux kernel, the following vulnerability has been resolved: e ... | 0% Низкий | 4 месяца назад | ||
GHSA-grcg-mgx8-mfvf In the Linux kernel, the following vulnerability has been resolved: eventpoll: Fix semi-unbounded recursion Ensure that epoll instances can never form a graph deeper than EP_MAX_NESTS+1 links. Currently, ep_loop_check_proc() ensures that the graph is loop-free and does some recursion depth checks, but those recursion depth checks don't limit the depth of the resulting tree for two reasons: - They don't look upwards in the tree. - If there are multiple downwards paths of different lengths, only one of the paths is actually considered for the depth check since commit 28d82dc1c4ed ("epoll: limit paths"). Essentially, the current recursion depth check in ep_loop_check_proc() just serves to prevent it from recursing too deeply while checking for loops. A more thorough check is done in reverse_path_check() after the new graph edge has already been created; this checks, among other things, that no paths going upwards from any non-epoll file with a length of more than 5 edges ... | 0% Низкий | 4 месяца назад | ||
RLSA-2025:17760 Moderate: kernel security update | 2 месяца назад | |||
ELSA-2025-21463 ELSA-2025-21463: kernel security update (MODERATE) | 16 дней назад | |||
ELSA-2025-17760 ELSA-2025-17760: kernel security update (MODERATE) | 2 месяца назад | |||
RLSA-2025:18318 Moderate: kernel security update | около 2 месяцев назад | |||
ELSA-2025-18318 ELSA-2025-18318: kernel security update (MODERATE) | 2 месяца назад | |||
SUSE-SU-2025:3725-1 Security update for the Linux Kernel | около 2 месяцев назад | |||
SUSE-SU-2025:03601-1 Security update for the Linux Kernel | 2 месяца назад | |||
ELSA-2025-20662 ELSA-2025-20662: Unbreakable Enterprise kernel security update (IMPORTANT) | 2 месяца назад | |||
ELSA-2025-25757 ELSA-2025-25757: Unbreakable Enterprise kernel security update (IMPORTANT) | около 1 месяца назад | |||
SUSE-SU-2025:03602-1 Security update for the Linux Kernel | 2 месяца назад | |||
SUSE-SU-2025:03633-1 Security update for the Linux Kernel | 2 месяца назад | |||
SUSE-SU-2025:3751-1 Security update for the Linux Kernel | около 2 месяцев назад | |||
SUSE-SU-2025:03600-1 Security update for the Linux Kernel | 2 месяца назад | |||
SUSE-SU-2025:03634-1 Security update for the Linux Kernel | 2 месяца назад |
Уязвимостей на страницу