gh-144888: Replace bloom filter linked lists with continuous arrays to optimize executor invalidating performance

[cocolato]

During JIT compilation, when function objects are destroyed or code objects are modified, all executors must be traversed to inspect their dependencies, followed by invalidating the relevant executors. The original implementation stored executors using singly linked lists, resulting in numerous pointer jumps during traversal and consequently poor CPU cache efficiency.

This PR changes the executor storage structure from a linked list to a contiguous array, reducing pointer jumps during traversal to improve CPU cache efficiency. It also implements O(1) deletion using swap-remove, thereby accelerating dependency invalidation operations.

• Issue: JIT executor invalidation appears to be slow #144888

[markshannon]

Thanks for doing this.
I've only had time to do a quick scan, but this looks like it should speed up the scan considerably.

[markshannon]

Is this necessary now? We can traverse all executors using the executor_ptrs array.

[cocolato]

I think we need it to save deletion list:

cpython/Python/optimizer.c

Lines 332 to 338 in 08a018e

	static void
	uop_dealloc(PyObject *op) {
	_PyExecutorObject *self = _PyExecutorObject_CAST(op);
	executor_invalidate(op);
	assert(self->vm_data.code == NULL);
	add_to_pending_deletion_list(self);
	}

[cocolato]

@Fidget-Spinner gentle ping, if you have time ,please take a look at this, thanks!