warp_inst_t::m_accessq is used like a LIFO

[FJShen]

warp_inst_t::m_accessq is a std::list container. Doing a global search on m_accessq suggests that memory_access_t objects are all inserted to the back of the list, and they are all accessed and popped from the back of the list. This resembles the behavior of a stack or LIFO. Then why is this container called a "queue"? Is it supposed to work like a stack or a FIFO?

[JRPan]

I think the assumption was the order does not matter. the accessq contains all the memory accesses for this warp. All accesses need to be processed within the warp at the same time. It doesn't matter which one comes first.