Re: sched_find_first_bit()

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

 



>> It seems that b[0] has the most highest priority bit since it comes
>> first. The priority 0 you said refers to the most highest?
>> But I've understood the task which is not real-time task has priority 0
>> at the "rt_priority" member.
>> Is this priority different from what rt_priority refers to?
>
>The priorities are mapped kind of backward.
>
>Priority 0 through MAX_RT_PRIO (100) map to 0..MAX_RT_PRIO (100 total
>priorities).

What do you mean? You mean Priority 0 would map to MAX_RT_PRIO?
I guess NICE_TO_PRIO macro does that.

Regards,
Shinpei Kato
--
Kernelnewbies: Help each other learn about the Linux kernel.
Archive:       http://mail.nl.linux.org/kernelnewbies/
FAQ:           http://kernelnewbies.org/faq/


[Index of Archives]     [Newbies FAQ]     [Linux Kernel Mentors]     [Linux Kernel Development]     [IETF Annouce]     [Git]     [Networking]     [Security]     [Bugtraq]     [Yosemite]     [MIPS Linux]     [ARM Linux]     [Linux RAID]     [Linux SCSI]     [Linux ACPI]
  Powered by Linux