lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <1512523423.9445.7.camel@sdl.usu.edu>
Date:   Wed, 6 Dec 2017 01:23:44 +0000
From:   Jonathan Haws <jhaws@....usu.edu>
To:     "linux-kernel@...r.kernel.org" <linux-kernel@...r.kernel.org>
Subject: Re: [RFC][PATCHv2] Fixing POSIX wait queue to insert in task priority
 order for real-time, including normal tasks

Sorry for the initial email - forgot the signed-off-by in my commit.
 Still new to this...

I'd like feedback from the community on this patch.  I've tested this
against my applications that were exhibiting problematic behavior when
tasks would wake up in FIFO order instead of priority order when trying
to write to a POSIX message queue.  Without the patch, multiple RT
tasks waiting to write to a queue wake up in FIFO order (assuming nice
value untouched); with the patch they wake up in priority order (based
on RT priority setting via sched_setparam.

Is this the correct way to remedy this issue?  Using prio here pulls in
the current priority of the task, including boosts from priority
inheritance.  In that case, would normal_prio be more appropriate?

Anyway, if this patch is acceptable then I'd also love some feedback to
know what steps need to be taken from here to push it along.

Thanks!
Jon

> Signed-off-by: Jonathan Haws <jhaws@....usu.edu>
> ---
>  ipc/mqueue.c | 2 +-
>  1 file changed, 1 insertion(+), 1 deletion(-)
> 
> diff --git a/ipc/mqueue.c b/ipc/mqueue.c
> index 9649ecd..cb96db9 100644
> --- a/ipc/mqueue.c
> +++ b/ipc/mqueue.c
> @@ -546,7 +546,7 @@ static void wq_add(struct mqueue_inode_info
> *info, int sr,
>  	ewp->task = current;
>  
>  	list_for_each_entry(walk, &info->e_wait_q[sr].list, list) {
> -		if (walk->task->static_prio <= current->static_prio) 
> {
> +		if (walk->task->prio <= current->prio) {
>  			list_add_tail(&ewp->list, &walk->list);
>  			return;
>  		}

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ