1/*
2 * Copyright (c) 2000-2005 The Regents of The University of Michigan
3 * Copyright (c) 2008 The Hewlett-Packard Development Company
4 * Copyright (c) 2013 Advanced Micro Devices, Inc.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions are

--- 189 unchanged lines hidden (view full) ---

198 // we remove an item, it returns the new top item (which may be
199 // unchanged)
200 prev->nextBin = Event::removeItem(event, curr);
201}
202
203Event *
204EventQueue::serviceOne()
205{
206 std::lock_guard<EventQueue> lock(*this);
207 Event *event = head;
208 Event *next = head->nextInBin;
209 event->flags.clear(Event::Scheduled);
210
211 if (next) {
212 // update the next bin pointer since it could be stale
213 next->nextBin = head->nextBin;
214

--- 274 unchanged lines hidden ---