I'm not sure what I can do more clearly. The data structure is a linked list of linked lists. The outer list is accessed via the nextBin pointer and the inner list is accessed via the nextInBin pointer.
Nate On Wed, Sep 28, 2011 at 6:25 AM, 敏超陈 <[email protected]> wrote: > hi, > recently when I read the source code, and I don't understand the two > variables nextInBin and nextBin clearly. The note is as follows: > // The event queue is now a linked list of linked lists. The > // 'nextBin' pointer is to find the bin, where a bin is defined as > // when+priority. All events in the same bin will be stored in a > // second linked list (a stack) maintained by the 'nextInBin' > // pointer. The list will be accessed in LIFO order. The end > // result is that the insert/removal in 'nextBin' is > // linear/constant, and the lookup/removal in 'nextInBin' is > // constant/constant. Hopefully this is a significant improvement > // over the current fully linear insertion. > Could anyone explain it more clearly?? > Thank you!! > _______________________________________________ > gem5-users mailing list > [email protected] > http://m5sim.org/cgi-bin/mailman/listinfo/gem5-users > _______________________________________________ gem5-users mailing list [email protected] http://m5sim.org/cgi-bin/mailman/listinfo/gem5-users
