Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

debug radixcache stack_overflow #1499

Merged
merged 4 commits into from
Sep 24, 2024
Merged

debug radixcache stack_overflow #1499

Changes from 3 commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
e7bdeb5
debug_radixcache_stack_overflow
Sep 24, 2024
342f9d3
Merge branch 'main' into debug_radixcache_stack_overflow
merrymercy Sep 24, 2024
498d7f6
Apply suggestions from code review
merrymercy Sep 24, 2024
c212ae2
Update python/sglang/srt/mem_cache/radix_cache.py
merrymercy Sep 24, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
11 changes: 5 additions & 6 deletions python/sglang/srt/mem_cache/radix_cache.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -288,18 +288,17 @@ def _total_size_helper(self, node: TreeNode):
for child in node.children.values():
x += self._total_size_helper(child)
return x

def _collect_leaves(self):
merrymercy marked this conversation as resolved.
Show resolved Hide resolved
ret_list = []
stack = [self.root_node]

def dfs_(cur_node):
while stack:
cur_node = stack.pop()
if len(cur_node.children) == 0:
ret_list.append(cur_node)
else:
stack.extend(cur_node.children.values())

for x in cur_node.children.values():
dfs_(x)

dfs_(self.root_node)
return ret_list


Expand Down
Loading