Skip to content

Fix: Properly handle node ownership when using appendChild and insertBefore #920

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

Merged
merged 4 commits into from
Aug 5, 2025
Merged

Fix: Properly handle node ownership when using appendChild and insertBefore #920

Changes from 2 commits
Commits
Show all changes
4 commits
Select commit Hold shift + click to select a range
b4014e8
Fix: Properly handle node ownership when using appendChild and insert…
SrikanthKumarC Aug 3, 2025
c533b10
fix: traverse all children correctly
SrikanthKumarC Aug 4, 2025
f1e5134
refactor: use walker to traverse the nodes
SrikanthKumarC Aug 4, 2025
0a5f060
add tests and simplify walker traversal
SrikanthKumarC Aug 4, 2025
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
47 changes: 47 additions & 0 deletions src/browser/dom/node.zig
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -198,6 +198,30 @@ pub const Node = struct {
// Methods

pub fn _appendChild(self: *parser.Node, child: *parser.Node) !Union {
const self_owner = try parser.nodeOwnerDocument(self);
const new_node_owner = try parser.nodeOwnerDocument(child);

if (new_node_owner == null or (new_node_owner.? != self_owner.?)) {
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
defer arena.deinit();

const allocator = arena.allocator();
var worklist = std.ArrayList(*parser.Node).init(allocator);

child.owner = self_owner;
try worklist.append(child);

// change ownerDocument of all children of a given node
while (worklist.pop()) |current_node| {
var maybe_child: ?*parser.Node = try parser.nodeFirstChild(current_node);
while (maybe_child) |child_node| {
child_node.owner = self_owner;
try worklist.append(child_node);
maybe_child = try parser.nodeNextSibling(child_node);
}
}
}

// TODO: DocumentFragment special case
const res = try parser.nodeAppendChild(self, child);
return try Node.toInterface(res);
Expand Down Expand Up @@ -290,6 +314,29 @@ pub const Node = struct {
}

pub fn _insertBefore(self: *parser.Node, new_node: *parser.Node, ref_node_: ?*parser.Node) !Union {
const self_owner = try parser.nodeOwnerDocument(self);
const new_node_owner = try parser.nodeOwnerDocument(new_node);

if (new_node_owner == null or (new_node_owner.? != self_owner.?)) {

var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
defer arena.deinit();
const allocator = arena.allocator();

var worklist = std.ArrayList(*parser.Node).init(allocator);
new_node.owner = self_owner;
try worklist.append(new_node);

while (worklist.pop()) |current_node| {
var maybe_child: ?*parser.Node = try parser.nodeFirstChild(current_node);
while (maybe_child) |child| {
child.owner = self_owner;
try worklist.append(child);
maybe_child = try parser.nodeNextSibling(child);
}
}

}
if (ref_node_) |ref_node| {
return Node.toInterface(try parser.nodeInsertBefore(self, new_node, ref_node));
}
Expand Down