procyberian/emacs
2
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Add recursion limit to treesit--children-covering-range-recurse

Browse source 
* lisp/treesit.el (treesit--children-covering-range-recurse): Add
limit.
This commit is contained in:
Yuan Fu 2022-12-07 16:36:07 -08:00
parent b429e52428
commit 670daa8b62
No known key found for this signature in database
GPG key ID: 56E19BC57664A442
1 changed files with 11 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

15
lisp/treesit.el
View file

@ -833,21 +833,28 @@ The range is between START and END."
(nreverse result))
(list node)))
(defun treesit--children-covering-range-recurse (node start end threshold)
(defun treesit--children-covering-range-recurse
(node start end threshold &optional limit)
"Return a list of children of NODE covering a range.
Recursively go down the parse tree and collect children, until
all nodes in the returned list are smaller than THRESHOLD. The
range is between START and END."
range is between START and END.
LIMIT is the recursion limit, which defaults to 100."
(let* ((child (treesit-node-first-child-for-pos node start))
(limit (or limit 100))
result)
(while (and child (<= (treesit-node-start child) end))
;; If LIMIT is exceeded, we are probably seeing the erroneously
;; tall tree, in that case, just give up.
(while (and (> limit 0) child (<= (treesit-node-start child) end))
;; If child still too large, recurse down. Otherwise collect
;; child.
(if (> (- (treesit-node-end child)
(treesit-node-start child))
threshold)
(dolist (r (treesit--children-covering-range-recurse
child start end threshold))
child start end threshold (1- limit)))
(push r result))
(push child result))
(setq child (treesit-node-next-sibling child)))