1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
local helpers = require('test.functional.helpers')(after_each)
local clear = helpers.clear
local eq = helpers.eq
local exec_lua = helpers.exec_lua
local insert = helpers.insert
local assert_alive = helpers.assert_alive
before_each(clear)
local function lua_eval(lua_expr)
return exec_lua("return " .. lua_expr)
end
describe('treesitter node API', function()
clear()
it('double free tree', function()
insert('F')
exec_lua([[
vim.treesitter.start(0, 'lua')
vim.treesitter.get_node():tree()
vim.treesitter.get_node():tree()
collectgarbage()
]])
assert_alive()
end)
it('double free tree 2', function()
exec_lua([[
parser = vim.treesitter.get_parser(0, "c")
local x = parser:parse()[1]:root():tree()
vim.api.nvim_buf_set_text(0, 0,0, 0,0, {'y'})
parser:parse()
vim.api.nvim_buf_set_text(0, 0,0, 0,1, {'z'})
parser:parse()
collectgarbage()
x:root()
]])
assert_alive()
end)
it('can move between siblings', function()
insert([[
int main(int x, int y, int z) {
return x + y * z
}
]])
exec_lua([[
query = require"vim.treesitter.query"
parser = vim.treesitter.get_parser(0, "c")
tree = parser:parse()[1]
root = tree:root()
lang = vim.treesitter.language.inspect('c')
function node_text(node)
return query.get_node_text(node, 0)
end
]])
exec_lua 'node = root:descendant_for_range(0, 11, 0, 16)'
eq('int x', lua_eval('node_text(node)'))
exec_lua 'node = node:next_sibling()'
eq(',', lua_eval('node_text(node)'))
exec_lua 'node = node:next_sibling()'
eq('int y', lua_eval('node_text(node)'))
exec_lua 'node = node:prev_sibling()'
eq(',', lua_eval('node_text(node)'))
exec_lua 'node = node:prev_sibling()'
eq('int x', lua_eval('node_text(node)'))
exec_lua 'node = node:next_named_sibling()'
eq('int y', lua_eval('node_text(node)'))
exec_lua 'node = node:prev_named_sibling()'
eq('int x', lua_eval('node_text(node)'))
end)
it('can retrieve the children of a node', function()
insert([[
int main() {
int x = 3;
}]])
local len = exec_lua([[
tree = vim.treesitter.get_parser(0, "c"):parse()[1]
node = tree:root():child(0)
children = node:named_children()
return #children
]])
eq(3, len)
eq('<node compound_statement>', lua_eval('tostring(children[3])'))
end)
it('can retrieve the tree root given a node', function()
insert([[
int main() {
int x = 3;
}]])
exec_lua([[
tree = vim.treesitter.get_parser(0, "c"):parse()[1]
root = tree:root()
node = root:child(0):child(2)
]])
eq(lua_eval('tostring(root)'), lua_eval('tostring(node:root())'))
end)
it('can compute the byte length of a node', function()
insert([[
int main() {
int x = 3;
}]])
exec_lua([[
tree = vim.treesitter.get_parser(0, "c"):parse()[1]
root = tree:root()
child = root:child(0):child(0)
]])
eq(28, lua_eval('root:byte_length()'))
eq(3, lua_eval('child:byte_length()'))
end)
end)
|
