Prefetch second child to improve scan performance
This commit is contained in:
@@ -1415,9 +1415,11 @@ TaggedNodePointer getChildGeq(Node *self, int child) {
|
|||||||
|
|
||||||
Node *getFirstChild(Node0 *) { return nullptr; }
|
Node *getFirstChild(Node0 *) { return nullptr; }
|
||||||
Node *getFirstChild(Node3 *self) {
|
Node *getFirstChild(Node3 *self) {
|
||||||
|
__builtin_prefetch(self->children[1]);
|
||||||
return self->numChildren == 0 ? nullptr : self->children[0];
|
return self->numChildren == 0 ? nullptr : self->children[0];
|
||||||
}
|
}
|
||||||
Node *getFirstChild(Node16 *self) {
|
Node *getFirstChild(Node16 *self) {
|
||||||
|
__builtin_prefetch(self->children[1]);
|
||||||
return self->numChildren == 0 ? nullptr : self->children[0];
|
return self->numChildren == 0 ? nullptr : self->children[0];
|
||||||
}
|
}
|
||||||
Node *getFirstChild(Node48 *self) {
|
Node *getFirstChild(Node48 *self) {
|
||||||
|
Reference in New Issue
Block a user