icon Top 9 categories map      RocketAware > man pages >

getpriority(2)

Tips: Browse or Search all pages for efficient awareness of more than 6000 of the most popular reusable and open source applications, functions, libraries, and FAQs.


The "RKT couplings" below include links to source code, updates, additional information, advice, FAQs, and overviews.


Home

Search all pages


Subjects

By activity
Professions, Sciences, Humanities, Business, ...

User Interface
Text-based, GUI, Audio, Video, Keyboards, Mouse, Images,...

Text Strings
Conversions, tests, processing, manipulation,...

Math
Integer, Floating point, Matrix, Statistics, Boolean, ...

Processing
Algorithms, Memory, Process control, Debugging, ...

Stored Data
Data storage, Integrity, Encryption, Compression, ...

Communications
Networks, protocols, Interprocess, Remote, Client Server, ...

Hard World
Timing, Calendar and Clock, Audio, Video, Printer, Controls...

File System
Management, Filtering, File & Directory access, Viewers, ...

    

RocketLink!--> Man page versions: OpenBSD FreeBSD NetBSD RedHat Others



GETPRIORITY(2)            OpenBSD Programmer's Manual           GETPRIORITY(2)

NAME
     getpriority, setpriority - get/set program scheduling priority



SYNOPSIS
     #include <sys/time.h>
     #include <sys/resource.h>

     int
     getpriority(int which, int who);

     int
     setpriority(int which, int who, int prio);

DESCRIPTION
     The scheduling priority of the process, process group, or user, as indi-
     cated by which and who is obtained with the getpriority() call and set
     with the setpriority() call.  which is one of PRIO_PROCESS, PRIO_PGRP, or
     PRIO_USER, and who is interpreted relative to which (a process identifier
     for PRIO_PROCESS, process group identifier for PRIO_PGRP, and a user ID
     for PRIO_USER). A zero value of who denotes the current process, process
     group, or user.  prio is a value in the range -20 to 20.  The default
     priority is 0; lower priorities cause more favorable scheduling.

     The getpriority() call returns the highest priority (lowest numerical
     value) enjoyed by any of the specified processes.  The setpriority() call
     sets the priorities of all of the specified processes to the specified
     value.  Only the super-user may lower priorities.

RETURN VALUES
     Since getpriority() can legitimately return the value -1, it is necessary
     to clear the external variable errno prior to the call, then check it af-
     terward to determine if a -1 is an error or a legitimate value.  The
     setpriority() call returns 0 if there is no error, or -1 if there is.

ERRORS
     getpriority() and setpriority() will fail if:

     [ESRCH]       No process was located using the which and who values spec-
                   ified.

     [EINVAL]      which was not one of PRIO_PROCESS, PRIO_PGRP, or PRIO_USER.

     In addition to the errors indicated above, setpriority() will fail if:

     [EPERM]       A process was located, but neither its effective nor real
                   user ID matched the effective user ID of the caller.

     [EACCES]      A non super-user attempted to lower a process priority.

SEE ALSO
     nice(1),  fork(2),  renice(8)

HISTORY
     The getpriority() function call appeared in 4.2BSD.

OpenBSD 2.6                      June 4, 1993                                1

Source: OpenBSD 2.6 man pages. Copyright: Portions are copyrighted by BERKELEY
SOFTWARE DESIGN, INC., The Regents of the University of California, Massachusetts
Institute of Technology, Free Software Foundation, FreeBSD Inc., and others.



(Corrections, notes, and links courtesy of RocketAware.com)


[Detailed Topics]


[Overview Topics]

Up to: Process Limits: Resources - Process Limits on resource usage (disk, CPU, memory, et al)


RocketLink!--> Man page versions: OpenBSD FreeBSD NetBSD RedHat Others






Rapid-Links: Search | About | Comments | Submit Path: RocketAware > man pages > getpriority.2/
RocketAware.com is a service of Mib Software
Copyright 1999, Forrest J. Cavalier III. All Rights Reserved.
We welcome submissions and comments