mirror of
https://git.rtems.org/rtems-libbsd/
synced 2025-05-13 14:59:45 +08:00
99 lines
2.9 KiB
C
99 lines
2.9 KiB
C
/**
|
|
* @file
|
|
*
|
|
* @ingroup rtems_bsd_rtems
|
|
*
|
|
* @brief TODO.
|
|
*/
|
|
|
|
/*
|
|
* Copyright (c) 2014 embedded brains GmbH. All rights reserved.
|
|
*
|
|
* embedded brains GmbH
|
|
* Dornierstr. 4
|
|
* 82178 Puchheim
|
|
* Germany
|
|
* <rtems@embedded-brains.de>
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <machine/rtems-bsd-kernel-space.h>
|
|
#include <machine/rtems-bsd-muteximpl.h>
|
|
|
|
#include <rtems/score/schedulerimpl.h>
|
|
#include <rtems/score/threaddispatch.h>
|
|
|
|
void
|
|
rtems_bsd_mutex_lock_more(struct lock_object *lock, rtems_bsd_mutex *m,
|
|
Thread_Control *owner, Thread_Control *executing, ISR_Level level)
|
|
{
|
|
if (owner == executing) {
|
|
BSD_ASSERT(lock->lo_flags & LO_RECURSABLE);
|
|
++m->nest_level;
|
|
|
|
_ISR_Enable(level);
|
|
} else {
|
|
_RBTree_Insert(&m->rivals, &executing->RBNode,
|
|
_Thread_queue_Compare_priority, false);
|
|
++executing->resource_count;
|
|
|
|
_Thread_Disable_dispatch();
|
|
_ISR_Enable(level);
|
|
|
|
_Scheduler_Change_priority_if_higher(_Scheduler_Get(owner),
|
|
owner, executing->current_priority, false);
|
|
_Thread_Set_state(executing, STATES_WAITING_FOR_MUTEX);
|
|
|
|
_Thread_Enable_dispatch();
|
|
}
|
|
}
|
|
|
|
void
|
|
rtems_bsd_mutex_unlock_more(rtems_bsd_mutex *m, Thread_Control *owner,
|
|
int keep_priority, RBTree_Node *first, ISR_Level level)
|
|
{
|
|
BSD_ASSERT(owner == _Thread_Executing);
|
|
|
|
if (first != NULL) {
|
|
Thread_Control *new_owner;
|
|
|
|
_RBTree_Extract(&m->rivals, first);
|
|
|
|
new_owner = THREAD_RBTREE_NODE_TO_THREAD(first);
|
|
m->owner = new_owner;
|
|
|
|
_Thread_Disable_dispatch();
|
|
_ISR_Enable(level);
|
|
|
|
_Thread_Clear_state(new_owner, STATES_WAITING_FOR_MUTEX);
|
|
|
|
_Thread_Enable_dispatch();
|
|
}
|
|
|
|
if (!keep_priority) {
|
|
_Thread_Disable_dispatch();
|
|
_Thread_Change_priority(owner, owner->real_priority, true);
|
|
_Thread_Enable_dispatch();
|
|
}
|
|
}
|