// IBM_PROLOG_BEGIN_TAG // This is an automatically generated prolog. // // $Source: src/kernel/futexmgr.C $ // // IBM CONFIDENTIAL // // COPYRIGHT International Business Machines Corp. 2011 // // p1 // // Object Code Only (OCO) source materials // Licensed Internal Code Source Materials // IBM HostBoot Licensed Internal Code // // The source code for this program is not published or other- // wise divested of its trade secrets, irrespective of what has // been deposited with the U.S. Copyright Office. // // Origin: 30 // // IBM_PROLOG_END /** * @file futexmgr.C * @brief Definition for kernel side futex management */ #include #include #include #include #include #include #include //----------------------------------------------------------------------------- uint64_t FutexManager::wait(task_t* i_task, uint64_t * i_addr, uint64_t i_val) { return Singleton::instance()._wait(i_task, i_addr, i_val); } //----------------------------------------------------------------------------- uint64_t FutexManager::wake(uint64_t * i_futex1, uint64_t i_count1, uint64_t * i_futex2, uint64_t i_count2) { return Singleton::instance()._wake(i_futex1, i_count1, i_futex2, i_count2); } //----------------------------------------------------------------------------- uint64_t FutexManager::_wait(task_t* i_task, uint64_t * i_addr, uint64_t i_val) { uint64_t rc = 0; iv_lock.lock(); if(unlikely(*i_addr != i_val)) { // some other task has modified the futex // bail-out retry required. iv_lock.unlock(); rc = EWOULDBLOCK; } else { _FutexWait_t * waiter = new _FutexWait_t(); waiter->key = i_addr; waiter->task = i_task; // Set blocked state. i_task->state = TASK_STATE_BLOCK_FUTEX; i_task->state_info = i_addr; // Now add the futex/task it to the wait queue iv_list.insert(waiter); iv_lock.unlock(); CpuManager::getCurrentCPU()->scheduler->setNextRunnable(); } return rc; } // Wake processes. Any number of processes in excess of count1 are not // woken up but moved to futex2. the number of processes to move // is capped by count2. uint64_t FutexManager::_wake(uint64_t * i_futex1, uint64_t i_count1, uint64_t * i_futex2, uint64_t i_count2 ) { uint64_t started = 0; iv_lock.lock(); // First start up to i_count1 task(s) while(started < i_count1) { _FutexWait_t * waiter = iv_list.find(i_futex1); if(waiter == NULL) { break; } task_t * wait_task = waiter->task; iv_list.erase(waiter); delete waiter; // This means we had a waiter in the queue, but that waiter had // a Null task assigned to it. This should NEVER happen kassert(wait_task != NULL); wait_task->cpu->scheduler->addTask(wait_task); ++started; } if(i_futex2 && i_count2) { uint64_t moved = 0; // Move up to i_count2 tasks to futex2 while(moved < i_count2) { // What if *i_futex2 got modified !!!! TODO // Do we need a safety check here (another val param) ???? _FutexWait_t * waiter = iv_list.find(i_futex1); if(waiter == NULL) { break; } task_t * wait_task = waiter->task; iv_list.erase(waiter); kassert(wait_task != NULL); // should never happen, but... waiter->key = i_futex2; wait_task->state_info = i_futex2; iv_list.insert(waiter); ++moved; } } iv_lock.unlock(); return started; }