logo
Free, unlimited AI code reviews that run on commit
git-lrc git-lrc GitHub Install Now We'd appreciate a star git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt git-lrc - Free, unlimited AI code reviews that run on commit | Product Hunt

This manual page is part of the POSIX Programmer's Manual. The Linux implementation of this interface

Application Usage

       The  conceptual model for scheduling semantics in POSIX.1‐2008 defines a set of thread lists. This set of
       thread lists is always present regardless of the scheduling options supported by the system. On a  system
       where  the  Process  Scheduling  option  is  not  supported,  portable  applications  should not make any
       assumptions regarding whether threads from other processes will be on the same thread list.

Description

       The  sched_yield()  function  shall  force  the running thread to relinquish the processor until it again
       becomes the head of its thread list. It takes no arguments.

Errors

       No errors are defined.

       Thefollowingsectionsareinformative.

Examples

       None.

Future Directions

       None.

Name

       sched_yield — yield the processor

Prolog

       This  manual  page  is part of the POSIX Programmer's Manual.  The Linux implementation of this interface
       may differ (consult the corresponding Linux manual page for details of Linux behavior), or the  interface
       may not be implemented on Linux.

Rationale

       None.

Return Value

       The sched_yield() function shall return 0 if it completes successfully;  otherwise,  it  shall  return  a
       value of -1 and set errno to indicate the error.

See Also

       The Base Definitions volume of POSIX.1‐2017, <sched.h>

Synopsis

       #include <sched.h>

       int sched_yield(void);

See Also