Re: [PATCH v2 03/11] bdrv_change_aio_context: use hash table instead of list of visited nodes

Am 25.07.2022 um 14:21 hat Emanuele Giuseppe Esposito geschrieben: > Minor performance improvement, but given that we have hash tables > available, avoid iterating in the visited nodes list every time just > to check if a node has been already visited. > > The data structure is not actually a prop

[PATCH v2 03/11] bdrv_change_aio_context: use hash table instead of list of visited nodes

Minor performance improvement, but given that we have hash tables available, avoid iterating in the visited nodes list every time just to check if a node has been already visited. The data structure is not actually a proper hash map, but an hash set, as we are just adding nodes and not key,value p