04 Sun ProgGuide IPC
04 Sun ProgGuide IPC
4 Programming
®
Interfaces Guide
Oracle customers that have purchased support have access to electronic support through My Oracle Support. For information, visit [Link]
ctx=acc&id=info or visit [Link] if you are hearing impaired.
Référence: E61059
Copyright © 2001, 2018, Oracle et/ou ses affiliés. Tous droits réservés.
Ce logiciel et la documentation qui l'accompagne sont protégés par les lois sur la propriété intellectuelle. Ils sont concédés sous licence et soumis à des restrictions d'utilisation et
de divulgation. Sauf stipulation expresse de votre contrat de licence ou de la loi, vous ne pouvez pas copier, reproduire, traduire, diffuser, modifier, accorder de licence, transmettre,
distribuer, exposer, exécuter, publier ou afficher le logiciel, même partiellement, sous quelque forme et par quelque procédé que ce soit. Par ailleurs, il est interdit de procéder à toute
ingénierie inverse du logiciel, de le désassembler ou de le décompiler, excepté à des fins d'interopérabilité avec des logiciels tiers ou tel que prescrit par la loi.
Les informations fournies dans ce document sont susceptibles de modification sans préavis. Par ailleurs, Oracle Corporation ne garantit pas qu'elles soient exemptes d'erreurs et vous
invite, le cas échéant, à lui en faire part par écrit.
Si ce logiciel, ou la documentation qui l'accompagne, est livré sous licence au Gouvernement des Etats-Unis, ou à quiconque qui aurait souscrit la licence de ce logiciel pour le
compte du Gouvernement des Etats-Unis, la notice suivante s'applique :
U.S. GOVERNMENT END USERS: Oracle programs, including any operating system, integrated software, any programs installed on the hardware, and/or documentation,
delivered to U.S. Government end users are "commercial computer software" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental
regulations. As such, use, duplication, disclosure, modification, and adaptation of the programs, including any operating system, integrated software, any programs installed on the
hardware, and/or documentation, shall be subject to license terms and license restrictions applicable to the programs. No other rights are granted to the U.S. Government.
Ce logiciel ou matériel a été développé pour un usage général dans le cadre d'applications de gestion des informations. Ce logiciel ou matériel n'est pas conçu ni n'est destiné à être
utilisé dans des applications à risque, notamment dans des applications pouvant causer un risque de dommages corporels. Si vous utilisez ce logiciel ou ce matériel dans le cadre
d'applications dangereuses, il est de votre responsabilité de prendre toutes les mesures de secours, de sauvegarde, de redondance et autres mesures nécessaires à son utilisation dans
des conditions optimales de sécurité. Oracle Corporation et ses affiliés déclinent toute responsabilité quant aux dommages causés par l'utilisation de ce logiciel ou matériel pour des
applications dangereuses.
Oracle et Java sont des marques déposées d'Oracle Corporation et/ou de ses affiliés. Tout autre nom mentionné peut correspondre à des marques appartenant à d'autres propriétaires
qu'Oracle.
Intel et Intel Xeon sont des marques ou des marques déposées d'Intel Corporation. Toutes les marques SPARC sont utilisées sous licence et sont des marques ou des marques
déposées de SPARC International, Inc. AMD, Opteron, le logo AMD et le logo AMD Opteron sont des marques ou des marques déposées d'Advanced Micro Devices. UNIX est une
marque déposée de The Open Group.
Ce logiciel ou matériel et la documentation qui l'accompagne peuvent fournir des informations ou des liens donnant accès à des contenus, des produits et des services émanant de
tiers. Oracle Corporation et ses affiliés déclinent toute responsabilité ou garantie expresse quant aux contenus, produits ou services émanant de tiers, sauf mention contraire stipulée
dans un contrat entre vous et Oracle. En aucun cas, Oracle Corporation et ses affiliés ne sauraient être tenus pour responsables des pertes subies, des coûts occasionnés ou des
dommages causés par l'accès à des contenus, produits ou services tiers, ou à leur utilisation, sauf mention contraire stipulée dans un contrat entre vous et Oracle.
Accès aux services de support Oracle
Les clients Oracle qui ont souscrit un contrat de support ont accès au support électronique via My Oracle Support. Pour plus d'informations, visitez le site [Link]
pls/topic/lookup?ctx=acc&id=info ou le site [Link] si vous êtes malentendant.
Contents
5
Contents
7
Contents
9
Contents
11
12 Oracle Solaris 11.4 Programming Interfaces Guide • August 2018
Using This Documentation
■ Overview – Describes network and system interfaces used by application developers. It also
provides information on interfaces in areas such as shared memory, transport selection, and
real-time administration.
SunOS 5.11 is the core of the Oracle Solaris 11 Operating System (Oracle Solaris OS),
and conforms to the third edition of the System V Interface Description (SVID) and to the
Single UNIX Specification, version 3 (SUSv3). SunOS 5.11 is fully compatible with UNIX
System V, Release 4 (SVR4), and supports all System V network services.
Note - This Oracle Solaris release supports the systems that use the SPARC and x86
families of processor architectures. The supported systems appear in the Oracle Solaris OS:
Hardware Compatibility Lists [Link]
[Link]. This document cites any implementation differences between the platform
types.
■ Audience – This book is intended for programmers who are new to the Oracle Solaris
platform or want more familiarity with some portion of the provided interfaces. Additional
interfaces and facilities for networked applications are described in the ONC+ RPC
Developer’s Guide.
■ Required knowledge – This guide assumes a familiarity with secure programming
techniques, as communication with other systems or processes provides avenues for hackers
to launch attacks. Appendix A, Secure Coding Guidelines for Developers, in Developer's
Guide to Oracle Solaris 11.4 Security contains information about issues that programmers
should pay attention to when coding a network application. The chapter also contains
information on the interfaces provided by the Oracle Solaris operating system to make your
application more resilient and secure.
This guide also assumes basic competence in programming, a working familiarity with the
C programming language, and familiarity with the UNIX operating system, particularly
networking concepts. For more information on UNIX networking basics, see the following
books:
■ UNIX Network Programming, Volume 1: The Sockets Networking API (3rd Edition) By
W. Richard Stevens, Bill Fenner, & Andrew M. Rudoff.
Feedback
Provide feedback about this documentation at [Link]
This chapter describes a view of an application developer about virtual memory and CPU
management in the Oracle Solaris operating system (OS). This chapter contains the following
topics:
■ “Memory Management Interfaces” on page 15 describes interfaces and cache control.
■ “Library-Level Dynamic Memory” on page 18 describes library level dynamic memory
allocation and debugging.
■ “Other Memory Control Interfaces” on page 20 describes other memory control
interfaces.
■ “CPU Performance Counters” on page 21 describes the use of CPU Performance
Counters (CPC).
Applications use the virtual memory facilities through several sets of memory management
interfaces. This section summarizes memory management interfaces and provides examples of
the usage of the interfaces.
The mapping established by the mmap() function replaces any previous mappings for the
specified address range.
The flags MAP_SHARED and MAP_PRIVATE, specifies the type of mapping. You must specify the
mapping type. If the MAP_SHARED flag is set, write operations modify the mapped object. No
further operations on the object are needed to make the change. If the MAP_PRIVATE flag is
set, the first write operation to the mapped area creates a copy of the page. All further write
operations reference the copy. Only modified pages are copied.
You can use the MAP_ADI flag on platforms that support Application Data Integrity (ADI). When
the MAP_ADI flag is set, ADI is enabled on the mapped region. When a region of memory is
mapped for ADI, the ADI versions for the region are undefined until they are explicitly set by
the application. The mapping type is retained across a fork() function.
After you have established the mapping through the mmap() function, the file descriptor used
in the call is no longer used. If you close the file, the mapping remains until the munmap()
function removes the mapping. Creating a new mapping replaces an existing mapping. For
more information, see the munmap(2) man page.
A mapped file can be shortened by a call to truncate. An attempt to access the area of the file
that no longer exists causes a SIGBUS signal.
Mapping /dev/zero gives the calling program a block of zero-filled virtual memory. This can
also be done by setting the MAP_ANON flag and the file descriptor variable, filedes to -1. The size
of the block is specified in the call to mmap() function.
Some devices or files are useful only when accessed by a mapping. Frame buffer devices used
to support bit-mapped displays are an example of this phenomenon. Display management
algorithms are imple to implement when the algorithms operate directly on the addresses of the
display.
For more information, see the mmap(2), munmap(2), open(2), fork(2), adi(2), and adi(3C) man
pages.
Removing Mappings
The munmap() function removes all mappings of pages in the specified address range of the
calling process and has no affect on the objects that were mapped.
Cache Control
The virtual memory system in Oracle Solaris OS is a cache system, in which processor memory
buffers data from file system objects. Interfaces are provided to control or interrogate the status
of the cache.
Using mincore
The mincore interface determines the residency of the memory pages in the address space
covered by mappings in the specified range. Because the status of a page can change after
mincore checks the page but before mincore returns the data, returned information can be
outdated. Only locked pages are guaranteed to remain in the memory. For more information, see
the mincore(2) man page.
The mlock interface causes the pages in the specified address range to be locked in a physical
memory. References to locked pages in a process do not result in page faults that require an I/
O operation. Because an I/O operation interferes with normal operation of virtual memory, and
slowsother processes, the use of mlock is limited to the superuser. The limit of number of pages
that can be locked in a memory is dependent on the system configuration. The call to mlock
fails if this limit is exceeded. For more information, see the mlock(3C) man page.
The munlock interface releases the locks on physical pages. If multiple mlock calls are made
on an address range of a single mapping, a single munlock call releases the locks. However, if
different mappings to the same pages are locked by mlock, the pages are not unlocked until the
locks on all the mappings are released.
Removing a mapping also releases locks, either through being replaced with the mmap()
operation or removed with the munmap() operation.
The copy-on-write event that is associated with a MAP_PRIVATE mapping transfers a lock
on the source page to the destination page. Thus locks on an address range that includes
MAP_PRIVATE mappings are retained transparently along with the copy-on-write redirection.
For more information about creating and using mappings, see “Creating and Using
Mappings” on page 15.
For more information, see the mlock(3C) and munlock(3C) man pages.
The mlockall and mlockall interfaces are similar to mlock and munlock, but mlockall and
munlockall operate on an entire address space. The mlockall interface sets locks on all the
pages in the address space. The munlockall interface removes all the locks on all the pages in
the address space, whether established by mlock or mlockall.
For more information, see the mlockall(3C) and munlockall(3C) man pages.
Using msync
The msync interface causes all modified pages in the specified address range to be flushed to the
objects mapped by those addresses. This command is similar to the fsync() function, which
operates on files.
For more information, see the fsync(3C) and msync(3C) man pages.
■ malloc – Returns a pointer to a block of memory at least as large as the amount of memory
that is requested. The block is aligned to store any type of data. For more information, see
the malloc(3C) man page.
■ free – Returns the memory that is obtained from malloc, calloc, realloc, memalign,
or valloc to system memory. Trying to free a block that was not reserved by a dynamic
memory allocation interface is an error and causes a process to crash. For more information,
see the free(3C) man page.
■ calloc – Returns a pointer to a block of memory that is initialized to zeros. Memory
reserved by calloc can be returned to the system through either watchmalloc or free. The
memory is allocated and aligned to contain an array of a specified number of elements of a
specified size. For more information, see the calloc(3C) man page.
■ watchmalloc – Acts as a debugging memory allocator. For more information, see the
watchmalloc(3MALLOC) man page.
The Oracle Solaris Studio software contains tools that are useful in finding and eliminating
errors in dynamic memory use.
dbx is an interactive, source-level, command-line debugging tool. You can use it to run a
program in a controlled manner and to inspect the state of a stopped program. dbx gives
you complete control of the dynamic execution of a program, which includes collecting
performance and memory usage data, monitoring memory access, and detecting memory leaks.
dbxtool provides a graphical user interface for dbx. For more information, see Oracle Solaris
Studio 12.4: Debugging a Program With dbx.
The Run Time Checking (RTC) tool in the Oracle Solaris Studio software allows you to
automatically detect runtime errors, such as memory access errors and memory leak, in a native
code application during the development phase. It also allows you to monitor memory usage.
You cannot use runtime checking on a Java code. For more information about using RTC
facility, see Chapter 9, Using Runtime Checking, in Oracle Solaris Studio 12.4: Debugging a
Program With dbx.
libumem is a memory management library. You can use libumem to detect memory management
bugs. libumem is a user space slab allocation library, which performs object caching that results
in caching the frequently allocated and freed memory. Object caching reduces the overhead
of creating and releasing the memory. You can view the information about memory cache,
memory allocation, and memory corruption using Modular Debugger (MDB). For information
about modular debugger, see Oracle Solaris Modular Debugger Guide.
You can also use the libadimalloc library on platforms that support ADI. The functions in the
libadimalloc library provides scalable object-caching memory allocation with multithreaded
application support. Also, this library uses ADI to detect buffer overrun errors, out-of-bounds
pointer errors, stale pointer errors, and use-after-free errors. For more information, see the
libadimalloc(3LIB) man page.
You can also use the advanced development tool Memory Error Discovery Tool (Discover)
for detecting memory access error. For more information, see the Oracle Solaris Studio 12.4
Discover and Uncover User's Guide.
Oracle Solaris Studio is available on as a package to download and install on the Oracle Solaris
OS. For more information, see the Oracle Solaris Studio website.
Using sysconf
The sysconf interface returns system dependent sizes of memory pages and applications should
use the getpagesizes() function to find out which memory pages are available to a running
process. For portability, applications should not embed any constants that specify the size of a
page. Note that varying page sizes are not unusual, even among implementations of the same
instruction set. For more information, see the sysconf(3C) and getpagesizes(3C) man pages.
Using mprotect
The mprotect interface assigns the specified protection to all pages in the specified address
range. The protection cannot exceed the permissions that are allowed on the underlying object.
For more information, see the mprotect(2) man page.
A break is the greatest valid data address in the process image that is not in the stack. When
a program starts executing, the break value is normally set by the execve() function to the
greatest address defined by the program and its data storage.
Use the brk() function to set the break to a greater address. You can also use the sbrk()
function to add an increment of storage to the data segment of a process. You can get the
maximum possible size of the data segment by a call to the getrlimit() function.
caddr_t
brk(caddr_t addr);
caddr_t
sbrk(intptr_t incr);
brk identifies the lowest data segment location not used by the caller as addr. This location is
rounded up to the next multiple of the system page size.
sbrk, the alternate interface, adds incr bytes to the caller data space and returns a pointer to the
start of the new data area.
For more information, see the brk(2), sbrk(2), execve(2), and getrlimit(2) man pages.
Initialization Interfaces
An application preparing to use the CPC facility initializes the library with a call to the
cpc_open() function. This function returns a cpc_t * parameter that is used by the other
interfaces. The syntax for the cpc_open() function is as follows:
cpc_t*cpc_open()(ver);
int ver;
The value of the ver parameter identifies the version of the interface that the application is
using. The cpc_open() function fails if the underlying counters are inaccessible or unavailable.
The hardware query interfaces allow you to access process details such as counter information
and events supported by the processor. The following are the hardware query interfaces:
■ cpc_npic()
■ cpc_caps()
■ cpc_walk_events_all()
■ cpc_walk_events_pic()
■ cpc_walk_attrs()
The cpc_npic() function returns the number of physical counters on the underlying processor.
The cpc_caps() function returns a uint_t parameter whose value is the result of the bitwise
inclusive-OR operation performed on the capabilities that the underlying processor supports.
There are two capabilities. The CPC_CAP_OVERFLOW_INTERRUPT capability enables the processor
to generate an interrupt when a counter overflows. The CPC_CAP_OVERFLOW_PRECISE capability
enables the processor to determine which counter generates an overflow interrupt.
The kernel maintains a list of the events that the underlying processor supports. Different
physical counters on a single chip do not have to use the same list of events. The
cpc_walk_events_all() function calls the action() routine for each processor-supported
event without regard to physical counter. The cpc_walk_events_pic() function calls the
action() routine for each processor-supported event on a specific physical counter. Both of
these functions pass the arg parameter uninterpreted from the caller to each invocation of the
action() function.
The platform maintains a list of attributes that the underlying processor supports. These
attributes enable access to advanced processor-specific features of the performance counters.
The cpc_walk_attrs() function calls the action routine on each attribute name.
Configuration Interfaces
The configuration interfaces allow you to perform tasks such as create an empty set, add
requests to a set, and change the preset value of a request. The following are the configuration
interfaces:
■ cpc_set_create()
■ cpc_set_destroy()
■ cpc_set_add_request()
■ cpc_set_request_preset()
cpc_set_t *cpc_set_create(cpc_t *cpc);
int cpc_set_destroy(cpc_t *cpc, cpc_set_t *set);
int cpc_set_add_request(cpc_t *cpc, cpc_set_t *set, const char *event,
uint64_t preset, uint_t flags, uint_t nattrs,
const cpc_attr_t *attrs);
int cpc_set_request_preset(cpc_t *cpc, cpc_set_t *set, int index,
uint64_t preset);
The opaque data type cpc_set_t represents collections of requests. The collections are called
sets. The cpc_set_create() function creates an empty set. The cpc_set_destroy() function
destroys a set and frees all the memory used by the set. Destroying a set releases the hardware
resources the set uses.
The cpc_set_add_request() function adds requests to a set. A request has the following
parameters:
nattrs The number of attributes in the array that attrs points to.
preset A 64-bit unsigned integer that is used as the initial value of the counter.
CPC_COUNT_USER This flag enables counting of events that occur while the CPU is
executing in user mode.
CPC_COUNT_SYSTEM This flag enables counting of events that occur while the CPU is
executing in privileged mode.
When the cpc_set_add_request() function returns successfully, it returns an index. The index
references the data generated by the request added by the call to the cpc_set_add_request()
function.
The cpc_set_request_preset() function changes the preset value of a request. This enables
the re-binding of an overflowed set with new presets.
The cpc_bind_curlwp() function binds the set to the calling light-weight process (LWP). The
counters of the set are virtualized to this LWP and count the events that occur on the CPU
while the calling LWP runs. The only flag that is valid for the cpc_bind_curlwp() routine is
CPC_BIND_LWP_INHERIT.
The cpc_bind_pctx() function binds the set to a LWP in a process that is captured with
libpctx. This function has no valid flags. For more information, see the libpctx(3LIB) man
page.
The cpc_bind_cpu() function binds the set to the processor specified in the id parameter.
Binding a set to a CPU invalidates existing performance counter contexts on the system. This
function has no valid flags.
The cpc_unbind() function stops the performance counters and releases the hardware that is
associated with the bound set. If a set is bound to a CPU, the cpc_unbind() function unbinds
the LWP from the CPU and releases the CPC pseudo-device.
The cpc_buf_create() function creates a buffer that stores data from the set specified in
cpc_set_t. The cpc_buf_destroy() function frees the memory that is associated with the
given cpc_buf_t. The cpc_buf_sample() function takes a snapshot of the counters that are
counting on behalf of the specified set. The specified set must already be bound and have a
buffer created before calling the cpc_buf_sample() function.
Sampling into a buffer does not update the preset of the requests associated with that set. When
a buffer is sampled with the cpc_buf_sample() function, then unbound and bound again,
counts start from the preset of the request as in the original call to the cpc_set_add_request()
function.
Buffer Operations
cpc_buf_t *right);
int cpc_buf_copy(cpc_t *cpc, cpc_buf_t *dest, cpc_buf_t *src);
void cpc_buf_zero(cpc_t *cpc, cpc_buf_t *buf);
The cpc_buf_get() function retrieves the value of the counter that is identified by the index
parameter. The index parameter is a value that is returned by the cpc_set_add_request()
function before the set is bound. The cpc_buf_get() function stores the value of the counter at
the location indicated by the val parameter.
The cpc_buf_set() function sets the value of the counter that is identified by the index
parameter. The index parameter is a value that is returned by the cpc_set_add_request()
function before the set is bound. The cpc_buf_set() function sets the counter's value to the
value at the location indicated by the val parameter. Neither the cpc_buf_get() function nor
the cpc_buf_set() function change the preset of the corresponding CPC request.
The cpc_buf_hrtime() function returns the high resolution timestamp that indicates when the
hardware was sampled. The cpc_buf_tick() function returns the number of CPU clock cycles
that have elapsed while the LWP is running.
The cpc_buf_sub() function computes the difference between the counters and tick values that
are specified in the left and right parameters. The cpc_buf_sub() function stores the results
in result. A given invocation of the cpc_buf_sub() function must have all cpc_buf_t values
originate from the same cpc_set_t structure. The result index contains the result of the left -
right computation for each request index in the buffers. The result index also contains the tick
difference. The cpc_buf_sub() function sets the high-resolution timestamp of the destination
buffer to the most recent time of the left or right buffers.
The cpc_buf_add() function computes the total of the counters and tick values that are
specified in the left and right parameters. The cpc_buf_add() function stores the results in
result. A given invocation of the cpc_buf_add() function must have all cpc_buf_t values
originate from the same cpc_set_t structure. The result index contains the result of the left
+ right computation for each request index in the buffers. The result index also contains the
tick total. The cpc_buf_add() function sets the high-resolution timestamp of the destination
buffer to the most recent time of the left or right buffers.
Activation Interfaces
This section describes activation interfaces for CPC.
These two interfaces respectively enable and disable counters of any set that is bound to the
executing LWP. Use of these interfaces enables an application to designate code of interest
while deferring the counter configuration to a controlling process by using libpctx.
typedef void (cpc_errhndlr_t)(const char *fn, int subcode, const char *fmt,
va_list ap);
void cpc_seterrhndlr(cpc_t *cpc, cpc_errhndlr_t *errhndlr);
These two interfaces allow the passage of a cpc_t handle. The cpc_errhndlr_t handle takes an
integer subcode in addition to a string. The integer subcode describes the specific error that was
encountered by the function that the fn argument refers to. The integer subcode simplifies an
application's recognition of error conditions. The string value of the fmt argument contains an
internationalized description of the error subcode and is suitable for printing.
The interfaces that you use to develop applications have been modified to support ADI. The
following is a list of all the interfaces that support ADI.
copyin Returns an error value when there is a version mismatch. For more
information, see the copyin(9F) man page.
copyout Returns an error value when there is a version mismatch. For more
information, see the copyout(9F) man page.
ddi_copyin Returns an error value when there is a version mismatch. For more
information, see the ddi_copyin(9F) man page.
ddi_copyout Returns an error value when there is a version mismatch. For more
information, see the ddi_copyout(9F) man page.
getmsg Returns an error value if a version mismatch is detected while the system
is writing data to the buffer. For more information, see the getmsg(2) man
page.
memcntl Allows ADI to be enabled or disabled for specified memory pages. For
more information, see the memcntl(2) man page.
meminfo Provides the status of ADI for a specified virtual address. For more
information, see the meminfo(2) man page.
mmap Enables ADI for mapped pages. For more information, see the mmap(2)
man page.
pmap Reports which process mappings have ADI enabled. For more
information, see the pmap(1) man page.
proc Provides information about the state of a ADI process. For more
information, see the proc(5) man page.
putmsg Returns an error value if there is a version mismatch while the system
is reading data from the buffer. For more information, see the putmsg(2)
man page.
read Returns an error value if there is a version mismatch while the system
is writing data to the buffer. For more information, see the read(2) man
page.
siginfo Defines signal values for signals raised for ADI exceptions. For more
information, see the siginfo(3HEAD) man page.
uiomove Returns an error value if a version mismatch is detected while the system
is transferring data to or from the buffer. For more information, see the
uiomove(9F) man page.
write Returns an error value if a version mismatch is detected while the system
is reading data from the buffer. For more information, see the write(2)
man page.
The Session Description Protocol (SDP) describes multimedia sessions. The SDP API
discussed in this chapter contains function calls you can use to add SDP functionality to your
applications. This chapter contains the following topics:
■ “Session Description API Overview” on page 29 provides an overview of Session
Description APIs
■ “SDP Library Functions” on page 32 describes all the operations related to SDP library
functions
The function calls that make up the SDP API are provided by the shared object libcommputil.
so.1. The functions in this shared object parse the SDP description and check the syntax of the
description.
The sdp.h header file defines the sdp_session_t structure and has the following members:
The sdp_session_version member tracks the version of the structure. The initial value of the
sdp_session_version member is SDP_SESSION_VERSION_1.
The sdp_list_t structure is a linked list of void pointers. This structure holds SDP fields. In
the case of SDP structure fields such as email and phone, the void pointers point to character
buffers. Use this structure to hold information in cases where the number of elements is not
predefined, as in the case of repeated offset fields, where the void pointer holds integer values.
The sdp_repeat_t structure is a part of the time structure sdp_time_t. The repeat field does
not appear alone in SDP descriptions and is always associated with the time field.
■ Utility functions
The first step in creating a new SDP session structure is allocating memory for the new
structure by calling the sdp_new_session() function. This function returns a pointer to the
new session structure. The other functions in this section use that pointer to construct the new
session structure. Once you are done constructing the new session structure, convert it to a
string representation with the sdp_session_to_str() function.
sdp_session_t *sdp_new_session()();
The sdp_new_session() function allocates memory for a new SDP session structure that is
specified by the session parameter and assigns a version number to that new structure. You can
free the memory that is allocated to the session structure by calling the sdp_free_session()
function.
Return Values: The sdp_new_session() function returns the newly allocated SDP session
structure when the function completes successfully. The function returns NULL in the case of
failure.
int sdp_add_origin()(*session*nameidver*nettype*addrtype*address);
sdp_session_t *session, const char *name, uint64_t id, uint64_t ver, const char
*nettype, const char *addrtype, const char *address;
The sdp_add_origin() function adds the ORIGIN (o=) SDP field to the session structure that
is specified by the value of the session parameter (sdp_session_t) using the name, id, ver,
nettype, addrtype, and address parameters.
Return Values: The sdp_add_origin() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_name()(*session*name);
The sdp_add_name() function adds the NAME (s=) SDP field to the session structure that is
specified by the value of the session parameter (sdp_session_t) using the name parameter.
Return Values: The sdp_add_name() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_information()(**information*value);
The sdp_add_information() function adds the INFO (i=) SDP field to the session structure
(sdp_session_t) or the media structure (sdp_media_t) using the value parameter. This field
can go into the media or the session section of an SDP description. You must pass either
&session->s_info or &media->m_info as the first argument to specify the section.
Return Values: The sdp_add_information() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_uri()(*session*uri);
The sdp_add_uri() function adds the URI (u=) SDP field to the session structure that is
specified by the value of the session parameter (sdp_session_t) using the uri parameter.
Return Values: The sdp_add_uri() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_email()(*session*email);
The sdp_add_email() function adds the EMAIL (e=) SDP field to the session structure that is
specified by the value of the session parameter (sdp_session_t) using the email parameter.
Return Values: The sdp_add_email() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_phone()(*session*email);
The sdp_add_phone() function adds the PHONE (p=) SDP field to the session structure that is
specified by the value of the session parameter (sdp_session_t) using the phone parameter.
Return Values: The sdp_add_phone() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_connection()(**conn*nettype*addrtype*addressttladdrcount);
sdp_conn_t **conn, const char *nettype, const char *addrtype, const char
*address, uint8_t ttl, int addrcount;
The sdp_add_connection() function adds the CONNECTION (c=) SDP field to either the session
structure (sdp_session_t) or the media structure (sdp_media_t) using the nettype, addrtype,
address, ttl, and addrcount parameters. For IPv4 or IPv6 unicast addresses, set the values
of the ttl and addrcount parameters to zero. For multicast addresses, set the value of the ttl
parameter between zero and 255. A multicast address cannot have an addrcount parameter with
a value of zero.
This field can go into the media or the session section of an SDP description. You must pass
either &session->s_info or &media->m_info as the first argument to specify the section.
Return Values: The sdp_add_connection() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_bandwidth()(**bw*typevalue);
The sdp_add_bandwidth() function adds the BANDWIDTH (b=) SDP field to either the session
structure (sdp_session_t) or the media structure (sdp_media_t) using the type and value
parameters.
This field can go into the media or the session section of an SDP description. You must pass
either &session->s_info or &media->m_info as the first argument to specify the section.
Return Values: The sdp_add_bandwidth() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_time()(*sessionstarttimestoptime**time);
The sdp_add_time() function adds the TIME (t=) SDP field to the session structure using the
values of the starttime and stoptime parameters. This function creates a new time structure
and returns the pointer to that structure in the time parameter.
Return Values: The sdp_add_time() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_repeat()(*timeintervalduration*offset);
The sdp_add_repeat() function adds the REPEAT (r=) SDP field to the session structure
using the values of the interval, duration, and offset parameters. The value of the offset
parameter is a string that holds one or more offset values, such as 60 or 60 1d 3h. The value of
the time parameter is the pointer to the time structure that the sdp_add_time() function creates.
Return Values: The sdp_add_repeat() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_zone()(*sessiontime*offset);
The sdp_add_zone() function adds the ZONE (z=) SDP field to the session structure that is
specified by the value of the session parameter (sdp_session_t) using the time and offset
parameters. You can add multiple time and offset values for a single zone field by calling this
function for each time/offset value pair.
Return Values: The sdp_add_zone() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_key()(**key*method*enckey);
The sdp_add_key() function adds the KEY (k=) SDP field to the session structure
(sdp_session_t) or the media structure (sdp_media_t) using the method and enckey
parameters. This field can go into the media or the session section of an SDP description. You
must pass either &session->s_info or &media->m_info as the first argument to specify the
section.
Return Values: The sdp_add_key() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_attribute()(**attr*name*value);
The sdp_add_attribute() function adds the ATTRIBUTE (a=) SDP field to the session structure
(sdp_session_t) or the media structure (sdp_media_t) using the name and value parameters.
This field can go into the media or the session section of an SDP description. You must pass
either &session->s_info or &media->m_info as the first argument to specify the section.
Return Values: The sdp_add_attribute() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
int sdp_add_media()(*session*nameportportcount*protocol*format**media);
sdp_session_t *session, const char *name, uint_t port, int portcount, const char
*protocol, const char *format, sdp_media_t **media;
The sdp_add_media() function adds the MEDIA (m=) SDP field to the session structure that is
specified by the value of the session parameter (sdp_session_t) using the values of the name,
port, portcount, protocol, and format parameters. The format parameter is a string that
holds one or more values, such as the string 0 32 97.
This function creates a new media structure and returns a pointer to that structure in the media
parameter. Functions that add SDP fields to the media structure use this pointer.
Return Values: The sdp_add_media() function returns 0 when the function completes
successfully. When mandatory parameters are not present, the function returns EINVAL. When
memory allocation fails, the function returns ENOMEM. The value of errno does not change in the
event of an error.
#include stdio.h>
#include string.h>
#include errno.h>
#include sdp.h>
int main ()
{
sdp_session_t *my_sess;
sdp_media_t *my_media;
sdp_time_t *my_time;
char *b_sdp;
my_sess = sdp_new_session();
if (my_sess == NULL) {
return (ENOMEM);
}
my_sess->version = 0;
if (sdp_add_name(my_sess, "-") != 0)
goto err_ret;
if (sdp_add_origin(my_sess, "Alice", 2890844526ULL, 2890842807ULL,
"IN", "IP4", "[Link]") != 0)
goto err_ret;
if (sdp_add_information(&my_sess->s_info, "A Seminar on the session"
"description protocol") != 0)
goto err_ret;
if (sdp_add_uri (my_sess, "[Link]
!= 0)
goto err_ret;
if (sdp_add_email(my_sess, "alice@[Link] (Alice smith)") != 0)
goto err_ret;
if (sdp_add_phone(my_sess, "+1 911-345-1160") != 0)
goto err_ret;
if (sdp_add_connection(&my_sess->s_conn, "IN", "IP4", "[Link]",
0, 0) != 0)
goto err_ret;
if (sdp_add_bandwidth(&my_sess->s_bw, "CT", 1024) != 0)
goto err_ret;
if (sdp_add_time(my_sess, 2854678930ULL, 2854679000ULL, &my_time)
!= 0)
goto err_ret;
if (sdp_add_repeat(my_time, 604800ULL, 3600ULL, "0 90000") != 0)
goto err_ret;
if (sdp_add_zone(my_sess, 2882844526ULL, "-1h") != 0)
goto err_ret;
if (sdp_add_zone(my_sess, 2898848070ULL, "0h") != 0)
goto err_ret;
if (sdp_add_attribute(&my_sess->s_attr, "sendrecv", NULL) != 0)
goto err_ret;
if (sdp_add_media(my_sess, "audio", 49170, 1, "RTP/AVP",
"0", &my_media) != 0)
goto err_ret;
if (sdp_add_information(&my_media->m_info, "audio media") != 0)
goto err_ret;
/*
* b_sdp is the string representation of my_sess structure
*/
free(b_sdp);
sdp_free_session(my_sess);
return (0);
err_ret:
free(b_sdp);
sdp_free_session(my_sess);
return (1);
}
The functions in this section search the SDP session structure for specific values and return
pointers to those values.
sdp_attr_t *sdp_find_attribute()(*attr*name);
The sdp_find_attribute() function searches the attribute list that is specified by the attr
parameter for the attribute name that is specified by the name parameter.
/*
* Assuming that above description is parsed using sdp_parse and that
* the parsed structure is in "session" sdp_session_t structure.
*/
sdp_attr_t *ptime;
sdp_attr_t *max_ptime;
sdp_media_t *media = session->s_media;
sdp_media_t *sdp_find_media()(*media*name);
The sdp_find_media() function searches the media list that is specified by the media parameter
for the media entry that is specified by the name parameter.
Return Values: The sdp_find_media() function returns a pointer to the media list entry
(sdp_media_t *) that is specified by the name parameter when the function completes
successfully. In all other cases, the sdp_find_media() function returns a value of NULL.
The incomplete SDP description in this example has two sections, an audio section and a video
section.
m=audio 49170 RTP/AVP 0 8
a=rtpmap:0 PCMU/8000
a=rtpmap:8 PCMA/8000
m=video 51372 RTP/AVP 31 32
a=rtpmap:31 H261/90000
a=rtpmap:32 MPV/90000
/*
* Assuming that above description is parsed using sdp_parse() and that
* the parsed structure is in "session" sdp_session_t structure.
*/
sdp_media_t *my_media;
my_media = sdp_find_media(session->s_media, "video");
/*
* my_media now points to the structure containg video media section
* information
*/
sdp_attr_t *sdp_find_media_rtpmap()(*media*format);
The sdp_find_media_rtpmap() function searches the attribute list of the media structure that is
specified by the media parameter for the format entry that is specified by the format parameter.
The incomplete SDP description in this example has two sections, an audio section and a video
section.
m=audio 49170 RTP/AVP 0 8
a=rtpmap:0 PCMU/8000
a=rtpmap:8 PCMA/8000
m=video 51372 RTP/AVP 31 32
a=rtpmap:31 H261/90000
a=rtpmap:32 MPV/90000
/*
* Assuming that above description is parsed using sdp_parse() and that
* the parsed structure is in "session" sdp_session_t structure.
*/
sdp_media_t *video;
sdp_attr_t *mpv;
/*
* Now the attribute structure sdp_attr_t, mpv will be having
* values from the attribute field "a=rtpmap:32 MPV/90000"
*/
int sdp_delete_all_field()(*sessionfield);
The sdp_delete_all_field() function deletes all occurrences of the SDP field that is specified
by the field parameter from the SDP structure. For example, if an SDP structure has three
BANDWIDTH (b=) fields, calling this function with a value of SDP_BANDWIDTH_FIELD in the field
parameter deletes all three BANDWIDTH fields from the session structure.
Return Values: The sdp_delete_all_field() function returns 0 when the function completes
successfully. When the session argument is NULL or the field type is unknown, the function
returns EINVAL. The value of errno does not change in the event of an error.
int sdp_delete_all_media_field()(*mediafield);
The sdp_delete_all_media_field() function deletes all occurrences of the SDP field that is
specified by the field parameter from the SDP media structure.
int sdp_delete_media()(**l_media*media);
The sdp_delete_media() function deletes the media entry specified by the media
parameter from the media list. This function finds the specified media entry by calling the
sdp_find_media() function. This function frees the memory that is allocated to the media
structure after deleting the media entry.
Return Values: The sdp_delete_media() function returns 0 when the function completes
successfully. When the session argument is NULL or mandatory arguments do not exist, the
function returns EINVAL. The value of errno does not change in the event of an error.
int sdp_delete_attribute()(**l_attr*attr);
The sdp_delete_attribute() function deletes the attribute specified by the attr parameter
from the media list. This function finds the specified attribute by calling either the
sdp_find_media_rtpmap() function or the sdp_find_attribute() function. This function
frees the memory that is allocated to the attribute structure after deleting the attribute.
Return Values: The sdp_delete_attribute() function returns 0 when the function completes
successfully. When the session argument is NULL or mandatory arguments do not exist, the
function returns EINVAL. The value of errno does not change in the event of an error.
void sdp_free_session()(*session);
sdp_session_t *session;
The sdp_free_session() function destroys the session specified by the session parameter and
frees the resources that are associated with that structure.
The functions in this section parse and populate the SDP session structure, clone an existing
session, and convert an existing session to a string representation.
int sdp_parse()(*sdp_infolenflags**session*p_error);
const char *sdp_info, int len, int flags, sdp_session_t **session, uint_t
*p_error;
The sdp_parse() function parses the SDP description in the sdp_info parameter and populates
the sdp_session_t structure. The len parameter specifies the length of the character buffer
sdp_info. The function allocates the memory required for the sdp_session_t structure. To free
that memory, call the sdp_free_session() function.
The value of the flags parameter must be set to zero. When the flags parameter has a nonzero
value, the sdp_parse() function fails with a return value of EINVAL and sets the value of
*session to NULL.
The p_error parameter takes on the values of any fields that have parsing errors. This
parameter cannot have a value of NULL. Possible values for the p_error parameter are in the
following list:
SDP_VERSION_ERROR 0x00000001
SDP_ORIGIN_ERROR 0x00000002
SDP_NAME_ERROR 0x00000004
SDP_INFO_ERROR 0x00000008
SDP_URI_ERROR 0x00000010
SDP_EMAIL_ERROR 0x00000020
SDP_PHONE_ERROR 0x00000040
SDP_CONNECTION_ERROR 0x00000080
SDP_BANDWIDTH_ERROR 0x00000100
SDP_TIME_ERROR 0x00000200
SDP_REPEAT_TIME_ERROR 0x00000400
SDP_ZONE_ERROR 0x00000800
SDP_KEY_ERROR 0x00001000
SDP_ATTRIBUTE_ERROR 0x00002000
SDP_MEDIA_ERROR 0x00004000
SDP_FIELDS_ORDER_ERROR 0x00008000
SDP_MISSING_FIELDS 0x00010000
When the SDP structure violates RFC 4566 by having fields out of order, the sdp_parse()
function sets the value of the p_error parameter to SDP_FIELDS_ORDER_ERROR. When the SDP
structure violates RFC 4566 by lacking mandatory fields, the sdp_parse() function sets the
value of the p_error parameter to SDP_MISSING_FIELDS. For more information, see RFC 4566.
The sdp_parse() function continues to parse after processing a field with a parsing error, but
the field with the parsing error will not be present in the resulting sdp_session_t structure.
Return Values: The sdp_parse() function returns 0 when the function completes successfully.
When the session arguments are invalid, the sdp_parse() function returns EINVAL. When
memory allocation fails while the sdp_parse() function is parsing sdp_info, the function
returns ENOMEM. The value of errno does not change in the event of an error.
After calling the sdp_parse_t() function, the resulting sdp_session_t structure is as follows:
session {
sdp_session_version = 1
s_version = 0
s_origin {
o_username = "jdoe"
o_id = 23423423ULL
o_version = 234234234ULL
o_nettype = "IN"
o_addrtype = "IP4"
o_address = "[Link]"
}
s_name = "SDP seminar"
s_info = "A seminar on the session description protocol"
s_uri = (nil)
s_email {
value = "test@[Link]"
next = (nil)
}
s_phone = (nil)
s_conn {
c_nettype = "IN"
c_addrtype = "IP4"
c_address = "[Link]"
c_addrcount = 0
c_ttl = 0
c_next = (nil)
}
s_bw = (nil)
s_time {
t_start = 2873397496ULL
t_stop = 2873404696ULL
t_repeat = (nil)
t_next = (nil)
}
s_zone = (nil)
s_key = (nil)
s_attr = (nil)
s_media = (nil)
}
sdp_session_t sdp_clone_session()(*session);
char *sdp_session_to_str()(*session*error);
The sdp_session_to_str() function returns the string representation of the SDP session
structure that is specified by the session parameter. The sdp_session_to_str() function
appends a carriage return/line feed to the end of each SDP field before appending the field to
the string.
Return Values: The sdp_session_to_str() function returns the string representation of the
SDP session structure upon completing successfully. The sdp_session_to_str() function
returns NULL in all other cases. The sdp_session_to_str() function returns an error pointer
to EINVAL when the input is null. The sdp_session_to_str() function returns an error pointer
to ENOMEM when a memory allocation failure occurs. The value of errno does not change in the
event of an error.
Process Scheduler
This chapter describes the scheduling of processes and how to modify scheduling. This chapter
contains the following topics:
■ “Overview of the Scheduler” on page 51 contains an overview of the scheduler and the
time-sharing scheduling class. Other scheduling classes are briefly described.
■ “Commands and Interfaces” on page 55 describes the commands and interfaces that
modify scheduling.
■ “Interactions With Other Interfaces” on page 59 describes the effects of scheduling
changes on kernel processes and certain interfaces.
■ Performance issues to consider when using these commands or interfaces are covered in
“Scheduling and System Performance” on page 60.
The chapter is for developers who need more control over the order of process execution
than default scheduling provides. For more information about multithreaded scheduling, see
Multithreaded Programming Guide.
When a process is created, the system assigns a lightweight process (LWP) to the process. If the
process is multithreaded, more LWPs might be assigned to the process. An LWP is the object
that is scheduled by the UNIX system scheduler, which determines when a process can run.
The scheduler maintains process priorities that are based on configuration parameters, process
behavior, and user requests. The scheduler uses these priorities to determine which process runs
next. The six priority classes are real-time, system, interactive (IA), fixed-priority (FX), fair-
share (FSS), and time-sharing (TS).
The default scheduling is a time-sharing policy. This policy dynamically adjusts process
priorities to balance the response time of an interactive process. The policy also dynamically
adjusts priorities to balance the throughput of a process that uses a lot of CPU time. The time-
sharing class has the lowest priority.
The Oracle Solaris operating system (OS) scheduler also provides a real-time scheduling policy.
Real-time scheduling enables users to assign fixed priorities to specific processes. The highest-
priority real-time user process always gets the CPU as soon as the process is runnable.
The Oracle Solaris OS scheduler also provides a policy for fixed-priority scheduling. Fixed-
priority scheduling enables users to assign fixed priorities to specific processes. Fixed-priority
scheduling uses the same priority range as the time-sharing scheduling class by default.
A program can be written so that its real-time processes have a guaranteed response time
from the system. For more information, see Chapter 11, “Real-time Programming and
Administration”.
The control of process scheduling provided by real-time scheduling is rarely needed. However,
when the requirements for a program include strict timing constraints, real-time processes might
be the only way to satisfy those constraints.
Caution - Careless use of real-time processes can have a dramatic negative effect on the
performance of time-sharing processes.
Because changes in scheduler administration can affect scheduler behavior, programmers might
also need to know something about scheduler administration. The following interfaces affect
scheduler administration:
■ dispadmin – Displays or changes scheduler configuration in a running system. For more
information, see the dispadmin(1M) man page.
■ ts_dptbl and rt_dptbl – Tables that contain the time-sharing and real-time parameters
that are used to configure the scheduler. For more information, see the ts_dptbl(5) and
rt_dptbl(5) man pages.
A process inherits its scheduling parameters, including scheduling class and priority within
that class, when the process is created. A process changes class only by a user request. The
system adjusts the priority of a process based on user requests and the policy associated with the
scheduler class of the process.
In a default configuration, the initialization process belongs to the time-sharing class. Therefore,
all user login shells begin as time-sharing processes.
The scheduler converts class-specific priorities into global priorities. The global priority of a
process determines when can a process run. The scheduler always runs the runnable process
with the highest global priority. A process assigned to the CPU runs until the process sleeps,
uses its time slice, or is preempted by a higher-priority process. Processes with the same priority
run in sequence, around a circle.
All real-time processes have higher priorities than any kernel process, and all kernel processes
have higher priorities than any time-sharing process.
Note - In a single processor system, no kernel process and no time-sharing process runs while a
runnable real-time process exists.
Administrators specify default time slices in the configuration tables. Users can assign per-
process time slices to real-time processes.
You can display the global priority of a process with -cl options of the ps command. You
can display configuration information about class-specific priorities using the priocntl
command and the dispadmin command. For more information, see ps(1), priocntl(1), and
dispadmin(1M) man pages.
The following sections describe the scheduling policies of the six scheduling classes.
Time-Sharing Class
The goal of the time-sharing policy is to provide good response time to interactive processes
and good throughput to CPU-bound processes. The scheduler switches CPU allocation often
enough to provide good response time, but not so often that the system spends too much time
on switching. Time slices are typically a few hundred milliseconds.
The time-sharing policy changes priorities dynamically and assigns time slices of different
lengths. The scheduler raises the priority of a process that sleeps after only a little CPU use. For
example, a process sleeps when the process starts an I/O operation such as a terminal read or
a disk read. Frequent sleeps are characteristic of interactive tasks such as editing and running
simple shell commands. The time-sharing policy lowers the priority of a process that uses the
CPU for long periods without sleeping.
The time-sharing policy that is the default gives larger time slices to processes with lower
priorities. A process with a low priority is likely to be CPU-bound. Other processes get the CPU
first, but when a low-priority process finally gets the CPU, that process gets a larger time slice.
If a higher-priority process becomes runnable during a time slice, however, the higher-priority
process preempts the running process.
Global process priorities and user-supplied priorities are in ascending order: higher priorities
run first. The user priority runs from the negative of a configuration-dependent maximum to
the positive of that maximum. A process inherits its user priority. Zero is the default initial user
priority.
The user priority limit is the configuration-dependent maximum value of the user priority.
You can set a user priority to any value lower than the user priority limit. With appropriate
permission, you can raise the user priority limit. Zero is the user priority limit by default.
You can lower the user priority of a process to reduce the CPU access of a process. Alternately,
with the appropriate permission, you can raise the user priority to get faster service. The user
priority cannot be set to a value that is higher than the user priority limit. Therefore, you must
raise the user priority limit before raising the user priority if both have their default values at
zero.
The scheduler manages time-sharing processes by using configurable parameters in the time-
sharing parameter table, ts_dptbl. This table contains information specific to the time-sharing
class. For more information, see the ts_dptbl(5) man page.
System Class
The system class uses a fixed-priority policy to run kernel processes such as servers and
housekeeping processes like the paging daemon. The system class is reserved to the kernel.
Users cannot add a process to the system class. Users cannot remove a process from the system
class. Priorities for system class processes are set up in the kernel code. The priorities of system
processes do not change once established. User processes that run in kernel mode are not in the
system class.
Real-time Class
The real-time class uses a scheduling policy with fixed priorities so that critical processes
run in predetermined order. Real-time priorities never change except when a user requests a
change. Privileged users can use the priocntl(1) and priocntl(2) interfaces to assign real-
time priorities. For more information, see the priocntl(1) or the priocntl(2) man pages.
The scheduler manages real-time processes by using configurable parameters in the real-time
parameter table, rt_dptbl. This table contains information specific to the real-time class. For
more information, see the rt_dptbl(5) man page.
Interactive Class
The IA class is very similar to the TS class. When used in conjunction with a windowing
system, processes have a higher priority while running in a window with the input focus.
The IA class is the default class while the system runs a windowing system. The IA class is
otherwise identical to the TS class, and the two classes share the same ts_dptbl dispatch
parameter table.
Fair-Share Class
The FSS class is used by the Fair-Share Scheduler (FSS) to manage application performance
by explicitly allocating shares of CPU resources to projects. A share indicates the allocation
of CPU resources for a specific project. The system tracks resource usage over time. The
system reduces the allocation when the usage of resources is heavy. The system increases
allocation when the usage of resources is light. The FSS schedules CPU time among the
processes according to their owners' entitlements, independent of the number of processes each
project owns. The FSS class uses the same priority range as the TS and IA classes. For more
information, see the FSS(4) man page.
Fixed-Priority Class
The FX class provides a fixed-priority preemptive scheduling policy. This policy is used
by processes that require user or application control of scheduling priorities but are not
dynamically adjusted by the system. By default, the FX class has the same priority range as the
TS, IA, and FSS classes. The FX class allows user or application control of scheduling priorities
through user priority values assigned to processes within the class. These user priority values
determine the scheduling priority of a fixed-priority process relative to other processes within
its class.
The scheduler manages fixed-priority processes by using configurable parameters in the fixed-
priority dispatch parameter table, fx_dptbl. This table contains information specific to the
fixed-priority class. For more information, see the fx_dptbl(5) man page.
A process priority has meaning only in the context of a scheduler class. You specify a process
priority by specifying a class and a class-specific priority value. The class and class-specific
value are mapped by the system into a global priority that the system uses to schedule
processes.
A system administrator's view of priorities is different from the view of a user or programmer.
When configuring scheduler classes, an administrator deals directly with global priorities. The
system maps priorities supplied by users into these global priorities. For more information
about priorities, see “Displaying and Managing Process Class Information” in Managing System
Information, Processes, and Performance in Oracle Solaris 11.4.
The ps command with -cel options reports global priorities for all active processes. The
priocntl command reports the class-specific priorities that users and programmers use. For
more information, see the ps(1) and priocntl(1) man pages.
The priocntl(1) command and the priocntl(2) and priocntlset(2) interfaces are used to
set or retrieve scheduler parameters for processes. Setting priorities generally follows the same
sequence for the command and both interfaces:
1. Specify the target processes.
2. Specify the scheduler parameters that you want for those processes.
3. Execute the command or interface to set the parameters for the processes.
Process IDs are basic properties of UNIX processes. For more information, see the Intro(2)
man page. The class ID is the scheduler class of the process. priocntl(2) works only for the
time-sharing and the real-time classes, not for the system class. For more information, see the
priocntl(1), priocntl(2), and priocntlset(2) man pages.
priocntl Usage
The priocntl(1) utility performs four different control interfaces on the scheduling of a
process:
TS (Time Sharing)
Configured TS User Priority Range -60 through 60
RT (Real Time)
Maximum Configured RT Priority: 59
■ Display information on all processes, by using the following:
$ priocntl -d -i all
■ Display information on all time-sharing processes, by using the following:
$ priocntl -d -i class TS
■ Display information on all processes with user ID 103 or 6626, by using the following:
$ priocntl -s -c TS -i all
■ Reduce TS user priority and user priority limit to -10 for uid 1122, by using the following:
$ priocntl -e -c RT /bin/sh
■ Run make with a time-sharing user priority of -10, by using the following:
priocntl(1) includes the interface of the nice utility. nice works only on time-sharing
processes and uses higher numbers to assign lower priorities. The previous example is
equivalent to using nice to set an increment of 10:
$ nice -10 make bigprog
For more information, see the priocntl(1) and nice(1) man pages.
priocntl Interface
priocntl(2) manages the scheduling parameters of a process or set of processes. An
invocation of priocntl(2) can act on a LWP, on a single process, or on a group of processes.
A group of processes can be identified by parent process, process group, session, user, group,
class, or all active processes.
The PC_GETCLINFO command gets a scheduler class name and parameters when the class ID
is given. This command enables you to write programs that make no assumptions about what
classes are configured.
The PC_SETXPARMS command sets the scheduler class and parameters for a set of processes. The
idtype and id input arguments specify the processes to be changed.
Kernel Processes
The kernel's daemon and housekeeping processes are members of the system scheduler class.
You can neither add processes to nor remove processes from this class. Also, you cannot
change the priorities of these processes. The ps -cel command lists the scheduler class of all
processes. A SYS entry in the CLS column identifies processes in the system class when you run
the ps command with the -f option. For more information, see the ps(1) man page.
Using nice
The nice command and the nice(2) interface work as in previous versions of the UNIX
system. These commands enable you to change the priority of a time-sharing process. You can
use lower numeric values to assign higher time-sharing priorities with these interfaces.
You can change the scheduler class of a process or to specify a real-time priority by using the
priocntl(2) interface. You can use higher numeric values to assign higher priorities.
For more information, see the nice(1), priocntl(2), and nice(2) man pages.
Using init
The init process is a special case to the scheduler. To change the scheduling properties of init,
it must be the only process specified by idtype and id or by the procset structure. For more
information, see the init(1M) man page.
By default, all user processes are time-sharing processes. A process changes class only by a
priocntl(2) call.
All real-time process priorities have a higher priority than any time-sharing process. Time-
sharing processes or system processes cannot run while any real-time process is runnable. A
real-time application that occasionally fails to relinquish control of the CPU can completely
lock out other users and essential kernel housekeeping.
Besides controlling process class and priorities, a real-time application must also control other
factors that affect its performance. The most important factors in performance are CPU power,
amount of primary memory, and I/O throughput. These factors interact in complex ways. The
sar command has options for reporting on all performance factors. For information about sar
command, see the sar(1) man page and for information about priocntl command, see the
priocntl(2) man page.
An active process is can be one of the five states in the diagram. The arrows show how the
process changes states.
■ A process is running if the process is assigned to a CPU. A process is removed from the
running state by a scheduler if a process with a higher priority becomes runnable. A process
is also preempted if a process of equal priority is runnable when the original process
consumes its entire time slice.
■ A process is runnable in memory if the process is in primary memory and ready to run, but
is not assigned to a CPU.
■ A process is sleeping in memory if the process is in primary memory but is waiting for a
specific event before continuing execution. For example, a process sleeps while waiting
for an I/O operation to complete, for a locked resource to be unlocked, or for a timer to
expire. When the event occurs, a wakeup call is sent to the process and the process becomes
runnable.
■ When an address space of a process has been written to the secondary memory, and that
process is not waiting for a specific event, the process is runnable and swapped.
■ If a process is waiting for a specific event and has its whole address space written to the
secondary memory, the process is sleeping and swapped.
If a system does not have enough primary memory to hold all its active processes, that
system must page or swap some address space to the secondary memory.
■ When the system is short of primary memory, the system writes individual pages of some
processes to the secondary memory but leaves those processes runnable. When a running
process, accesses those pages, the process sleeps while the pages are read back into primary
memory.
■ When the system encounters a more serious shortage of primary memory, the system writes
all the pages of some processes to secondary memory. The system marks the pages that have
been written to the secondary memory as swapped. Such processes can only be scheduled
when the system scheduler daemon selects these processes to be read back into memory.
Both paging and swapping cause delay when a process is ready to run again. For processes that
have strict timing requirements, this delay can be unacceptable.
To avoid swapping delays, real-time processes are never swapped, though parts of such
processes can be paged. A program can prevent paging and swapping by locking its text and
data into primary memory. For more information, see the memcntl(2) man page. How much
memory can be locked is limited by how much memory is configured. Also, locking too
much can cause intolerable delays to processes that do not have their text and data locked into
memory.
Trade-offs between the performance of real-time processes and the performance of other
processes depend on local needs. On some systems, process locking might be required to
guarantee the necessary real-time response.
This chapter describes the APIs that the applications use to interact with the locality groups.
This chapter contains the following topics:
When a system with such a memory architecture runs the Oracle Solaris software, providing
information to the kernel about the shortest access time between a given CPU and a given
area of memory can improve the system performance. The locality group (lgroup) abstraction
handles this information. The lgroup abstraction is part of the Memory Placement Optimization
(MPO) feature. For more information, see Memory and Thread Placement Optimization
Developer’s Guide.
An lgroup is a set of CPU–like and memory–like device in which each CPU in the set can
access any memory in that set within a bounded latency interval. The value of the latency
interval represents the least common latency between all the CPUs and all the memory in
that lgroup. The latency bound that defines an lgroup does not restrict the maximum latency
between members of that lgroup.
Lgroups are hierarchical. The lgroup hierarchy is a Directed Acyclic Graph (DAG) and is
similar to a tree, except that an lgroup might have more than one parent. The root lgroup
contains all the resources in the system and can include child lgroups. The root lgroup have the
highest latency value of all the lgroups in the system. All of its child lgroups have lower latency
values. The lgroups closer to the root have a higher latency while lgroups closer to leaves have
lower latency.
A system in which all the CPUs can access all the memory with same latency can be
represented with a single lgroup (see Figure 3, “Single Locality Group Schematic,” on page
64). A system in which some of the CPUs can access some areas of memory in a shorter
time than other areas can be represented by using multiple lgroups (see Figure 4, “Multiple
Locality Groups Schematic,” on page 65).
The lgroup hierarchy helps to find the nearest resources in the system. Each thread is assigned
a home lgroup upon creation. The operating system allocates resources for the thread from the
thread's home lgroup by default. For example, the Oracle Solaris kernel schedules a thread to
run on the CPUs in the thread's home lgroup and allocates the thread's memory in the thread's
home lgroup by default. If the desired resources are not available from the thread's home
lgroup, the kernel can traverse the lgroup hierarchy to find the nearest resources from the
home lgroup's parents. If the desired resources are not available in the home lgroup's parents,
the kernel continues to traverse the lgroup hierarchy to the next ancestor lgroups of the home
lgroup. The root lgroup is the ancestor of all other lgroups in a system and contains all the
resources of the system.
The lgroup APIs export the lgroup abstraction for applications to use for observability and
performance tuning. A library, called liblgrp, contains the lgroup APIs.
Applications can use the APIs to perform the following tasks:
#include <sys/lgrp_user.h>
int lgrp_version(const int version);
The lgrp_version() function takes an interface version number as an argument and returns
the lgroup interface version that the system supports. The lgrp_version() function returns
the version number if the lgroup API supports the version number in the version argument.
Otherwise, the lgrp_version() function returns LGRP_VER_NONE. For more information, see the
lgrp_version(3LGRP) man page.
#include <sys/lgrp_user.h>
if (lgrp_version(LGRP_VER_CURRENT) != LGRP_VER_CURRENT) {
fprintf(stderr, "Built with unsupported lgroup interface %d\n",
LGRP_VER_CURRENT);
exit (1);
}
Using lgrp_init()
The lgrp_init() function initializes the lgroup interface and takes a snapshot of the lgroup
hierarchy.
#include <sys/lgrp_user.h>
lgrp_cookie_t lgrp_init(lgrp_view_t view);
When the lgrp_init() function is called with LGRP_VIEW_CALLER as the view, the function
returns a snapshot with the resources available only to the calling thread. When the
lgrp_init() function is called with LGRP_VIEW_OS as the view, the function returns a snapshot
with the resources available to the operating system. When a thread successfully calls the
lgrp_init() function, the function returns a cookie that is used by any function interacting
with the lgroup hierarchy. When a thread no longer needs the lgroup hierarchy, call the
lgrp_fini() function with the cookie as the argument.
The lgroup hierarchy consists of a root lgroup that contains all of the system's CPU and
memory resources. The root lgroup might contain other locality groups bounded by smaller
latencies.
The lgrp_init() function can return two errors. When a view is invalid, the function returns
EINVAL. When there is insufficient memory to allocate the snapshot of the lgroup hierarchy, the
function returns ENOMEM.
Using lgrp_fini()
The lgrp_fini() function invalidates the given cookie frees the corresponding lgroup
hierarchy snapshot.
#include <sys/lgrp_user.h>
int lgrp_fini(lgrp_cookie_t cookie);
The lgrp_fini() function takes a cookie that represents an lgroup hierarchy snapshot created
by a previous call to lgrp_init(). The lgrp_fini() function frees the memory that is
allocated to that snapshot. After the call to lgrp_fini(), the cookie is invalid and cannot be
used again.
When the cookie passed to the lgrp_fini() function is invalid, lgrp_fini() returns EINVAL.
For more information about lgrp_fini() function, see the lgrp_fini(3LGRP) man page.
Locality groups that are closer to the root have more resources and a higher latency. Locality
groups that are closer to the leaves have fewer resources and a lower latency. An lgroup can
contain resources directly within its latency boundary. An lgroup can contain leaf lgroups that
contain their own sets of resources. The resources of leaf lgroups are available to the lgroup that
encapsulates those leaf lgroups.
Using lgrp_cookie_stale()
The lgrp_cookie_stale() function determines whether the snapshot of the lgroup hierarchy
represented by the given cookie is current.
#include <sys/lgrp_user.h>
int lgrp_cookie_stale(lgrp_cookie_t cookie);
The cookie returned by the lgrp_init() function can become stale depending on the view
that the snapshot represents. A cookie returned by the lgrp_init() function with the view set
to LGRP_VIEW_OS can become stale due to changes in the lgroup hierarchy such as dynamic
reconfiguration or a change in a CPU's online status. A cookie returned by the lgrp_init()
function with the view set to LGRP_VIEW_CALLER can become stale due to changes in the calling
thread's processor set or changes in the lgroup hierarchy. A stale cookie is refreshed by calling
the lgrp_fini() function with the old cookie, followed by calling lgrp_init() to generate a
new cookie.
The lgrp_cookie_stale() function returns EINVAL when the given cookie is invalid. For more
information, see the lgrp_cookie_stale(3LGRP) man page.
Using lgrp_view()
The lgrp_view() function determines the view of the given lgroup hierarchy snapshot.
#include <sys/lgrp_user.h>
lgrp_view_t lgrp_view(lgrp_cookie_t cookie);
The lgrp_view() function takes a cookie that represents a snapshot of the lgroup hierarchy
and returns the snapshot's view of the lgroup hierarchy. Snapshots taken with the view
LGRP_VIEW_CALLER contain only the resources that are available to the calling thread. Snapshots
taken with the view LGRP_VIEW_OS contain all the resources that are available to the operating
system.
The lgrp_view() function returns EINVAL when the given cookie is invalid. For more
information, see the lgrp_view(3LGRP) man page.
Using lgrp_nlgrps()
The lgrp_nlgrps() function returns the number of lgroups in the system. If a system has only
one locality group, memory placement optimizations have no effect.
#include <sys/lgrp_user.h>
int lgrp_nlgrps(lgrp_cookie_t cookie);
The lgrp_nlgrps() function takes a cookie that represents a snapshot of the lgroup hierarchy
and returns the number of lgroups available in the hierarchy.
The lgrp_nlgrps() function returns EINVAL when the cookie is invalid. For more information,
see the lgrp_nlgrps(3LGRP) man page.
Using lgrp_root()
The lgrp_root() function returns the root lgroup ID.
#include <sys/lgrp_user.h>
lgrp_id_t lgrp_root(lgrp_cookie_t cookie);
The lgrp_root() function takes a cookie that represents a snapshot of the lgroup hierarchy and
returns the root lgroup ID. For more information, see the lgrp_root(3LGRP) man page.
Using lgrp_parents()
The lgrp_parents() function takes a cookie that represents a snapshot of the lgroup hierarchy
and returns the number of parent lgroups for the specified lgroup.
#include <sys/lgrp_user.h>
int lgrp_parents(lgrp_cookie_t cookie, lgrp_id_t child,
If lgrp_array is not NULL and the value of lgrp_array_size is not zero, the lgrp_parents()
function fills the array with parent lgroup IDs until the array is full or all parent lgroup IDs are
in the array. The root lgroup has zero parents. When the lgrp_parents() function is called for
the root lgroup, lgrp_array is not filled in.
The lgrp_parents() function returns EINVAL when the cookie is invalid. The lgrp_parents()
function returns ESRCH when the specified lgroup ID is not found. For more information, see the
lgrp_parents(3LGRP) man page.
Using lgrp_children()
The lgrp_children() function takes a cookie that represents the calling thread's snapshot of
the lgroup hierarchy and returns the number of child lgroups for the specified lgroup.
#include <sys/lgrp_user.h>
int lgrp_children(lgrp_cookie_t cookie, lgrp_id_t parent,
lgrp_id_t *lgrp_array, uint_t lgrp_array_size);
If lgrp_array is not NULL and the value of lgrp_array_size is not zero, the lgrp_children()
function fills the array with child lgroup IDs until the array is full or all child lgroup IDs are in
the array.
The lgrp_children() function returns EINVAL when the cookie is invalid. The
lgrp_children() function returns ESRCH when the specified lgroup ID is not found. For more
information, see the lgrp_children(3LGRP) man page.
The resources of a given lgroup are contained directly within that lgroup or indirectly within the
leaf lgroups that the given lgroup encapsulates. Leaf lgroups directly contain their resources and
do not encapsulate any other lgroups.
The following APIs retrieve information about the contents of a given lgroup.
Using lgrp_resources()
The lgrp_resources() function returns the number of resources contained in the specified
lgroup.
#include <sys/lgrp_user.h>
int lgrp_resources(lgrp_cookie_t cookie, lgrp_id_t lgrp, lgrp_id_t *lgrpids,
uint_t count, lgrp_rsrc_t type);
The lgrp_resources() function takes a cookie that represents a snapshot of the lgroup
hierarchy. This cookie is obtained from the lgrp_init() function. The lgrp_resources()
function returns the number of resources that are in the lgroup with the ID that is specified by
the value of the lgrp argument. The lgrp_resources() function represents the resources with a
set of lgroups that directly contain CPU or memory resources. The lgrp_rsrc_t argument can
have one of the following values:
When the value passed in the lgrpids[] argument is not null and the count argument is not
zero, the lgrp_resources() function stores lgroup IDs in the lgrpids[] array. The number of
lgroup IDs stored in the array can be up to the value of the count argument.
The lgrp_resources() function returns EINVAL when the specified cookie, lgroup ID, or type
are not valid. The lgrp_resources() function returns ESRCH when the function does not find
the specified lgroup ID.
Using lgrp_cpus()
The lgrp_cpus() function takes a cookie that represents a snapshot of the lgroup hierarchy and
returns the number of CPUs in a given lgroup.
#include <sys/lgrp_user.h>
int lgrp_cpus(lgrp_cookie_t cookie, lgrp_id_t lgrp, processorid_t *cpuids,
uint_t count, int content);
If the cpuid[] argument is not NULL and the CPU count is not zero, the lgrp_cpus() function
fills the array with CPU IDs until the array is full or all the CPU IDs are in the array.
LGRP_CONTENT_ALL The lgrp_cpus() function returns IDs for the CPUs in this lgroup and its
child lgroups.
LGRP_CONTENT_DIRECT The lgrp_cpus() function returns IDs for the CPUs in this lgroup only.
The lgrp_cpus() function returns EINVAL when the cookie, lgroup ID, or one of the flag is not
valid. The lgrp_cpus() function returns ESRCH when the specified lgroup ID is not found. For
more information, see the lgrp_cpus(3LGRP) man page.
Using lgrp_mem_size()
The lgrp_mem_size() function takes a cookie that represents a snapshot of the lgroup hierarchy
and returns the size of installed or free memory in the given lgroup. The lgrp_mem_size()
function reports memory sizes in bytes.
#include <sys/lgrp_user.h>
lgrp_mem_size_t lgrp_mem_size(lgrp_cookie_t cookie, lgrp_id_t lgrp,
int type, int content)
The lgrp_mem_size() function returns EINVAL when the cookie, lgroup ID, or one of the flag
is not valid. The lgrp_mem_size() function returns ESRCH when the specified lgroup ID is not
found. For more information, see the lgrp_mem_size(3LGRP) man page.
Using lgrp_latency_cookie()
The lgrp_latency() function returns the latency between a CPU in one lgroup to the memory
in another lgroup.
#include <sys/lgrp_user.h>
int lgrp_latency_cookie(lgrp_cookie_t cookie, lgrp_id_t from, lgrp_id_t to.
lat_between_t between);
The lgrp_latency_cookie() function takes a cookie that represents a snapshot of the lgroup
hierarchy. The lgrp_init() function creates this cookie. The lgrp_latency_cookie() function
returns a value that represents the latency between a hardware resource in the lgroup given by
the value of the from argument and a hardware resource in the lgroup given by the value of the
to argument. If both arguments point to the same lgroup, the lgrp_latency_cookie() function
returns the latency value within that lgroup.
Note - The latency value returned by the lgrp_latency_cookie() function is defined by the
operating system and is platform-specific. This value does not necessarily represent the actual
latency between hardware devices. Use this value only for comparison within one domain.
The lgrp_latency_cookie() function returns EINVAL when the lgroup ID is not valid.
When the lgrp_latency_cookie() function does not find the specified lgroup ID, the
from lgroup does not contain any CPUs, or the to lgroup does not have any memory,
the lgrp_latency_cookie() function returns ESRCH. For more information, see the
lgrp_latency(3LGRP) man page.
Using lgrp_home()
The lgrp_home() function returns the home lgroup for the specified process or thread.
#include <sys/lgrp_user.h>
lgrp_id_t lgrp_home(idtype_t idtype, id_t id);
The lgrp_home() function returns EINVAL when the ID type is not valid. The lgrp_home()
function returns EPERM when the user of the calling process is not the superuser and the user
ID of the calling process does not match the user ID of one of the threads. The lgrp_home()
function returns ESRCH when the specified process or thread is not found.
Using madvise()
The madvise() function advises the kernel that a region of user virtual memory in the range
starting at the address specified in addr and with length equal to the value of the len parameter
is expected to follow a particular pattern of use. The kernel uses this information to optimize the
procedure for manipulating and maintaining the resources associated with the specified range.
Use of the madvise() function can increase system performance when used by programs that
have specific knowledge of their access patterns over memory.
#include <sys/types.h>
#include <sys/mman.h>
int madvise(caddr_t addr, size_t len, int advice);
The madvise() function provides the following flags to affect how a thread's memory is
allocated among lgroups:
MADV_ACCESS_DEFAULT This flag resets the kernel's expected access pattern for the specified
range to the default.
MADV_ACCESS_LWP This flag advises the kernel that the next LWP to touch the specified
address range is the LWP that accesses the range the most. The kernel
allocates the memory and other resources for this range and the LWP
accordingly.
MADV_ACCESS_MANY This flag advises the kernel that many processes or LWPs will access the
specified address range randomly across the system. The kernel allocates
the memory and other resources for this range accordingly.
EAGAIN Some or all of the mappings in the specified address range, from addr to
addr+len, are locked for I/O.
EINVAL The value of the addr parameter is not a multiple of the page size as
returned by sysconf() function, the length of the specified address
range is less than or equal to zero, or the advice is invalid. For more
information, see the sysconf(3C) man page.
EIO An I/O error occurs while reading from or writing to the file system.
ENOMEM Addresses in the specified range are outside the valid range for the
address space of a process or the addresses in the specified range specify
one or more pages that are not mapped.
Using [Link].1
The [Link].1 shared object enables the selective configuration of virtual memory advice for
launched processes and their descendants. To use the shared object, the following string must be
present in the environment:
LD_PRELOAD=$LD_PRELOAD:[Link].1
The [Link].1 shared object applies memory advice as specified by the value of the MADV
environment variable. The MADV environment variable specifies the virtual memory advice to
use for all heap, shared memory, and mmap regions in the process address space. This advice is
applied to all created processes. The following values of the MADV environment variable affect
resource allocation among lgroups:
access_default This value resets the kernel's expected access pattern to the default.
access_lwp This value advises the kernel that the next LWP to touch an address range
is the LWP that accesses that range the most. The kernel allocates the
memory and other resources for this range and the LWP accordingly.
access_many This value advises the kernel that many processes or LWPs will access
memory randomly across the system. The kernel allocates the memory
and other resources accordingly.
The value of the MADVCFGFILE environment variable is the name of a text file that contains one
or more memory advice configuration entries in the form exec-name:advice-opts.
The value of exec-name is the name of an application or executable. The value of exec-name
can be a full pathname, a base name, or a pattern string.
The value of advice-opts is of the form region=advice. The values of advice are the same as
the values for the MADV environment variable. Replace region with any of the following legal
values:
madv Advice applies to all heap, shared memory, and mmap regions in the
process address space.
heap The heap is defined to be the brk area. Advice applies to the existing
heap and to any additional heap memory allocated in the future.
shm Advice applies to shared memory segments. For more information about
shared memory operations, see the shmat(2) man page.
ism Advice applies to shared memory segments that are using the
SHM_SHARE_MMU flag. The ism option takes precedence over shm.
dsm Advice applies to shared memory segments that are using the
SHM_PAGEABLE flag. The dsm option takes precedence over shm.
The value of the MADVERRFILE environment variable is the path where error messages are
logged. In the absence of a MADVERRFILE location, the [Link].1 shared object log errors
by using syslog() function with LOG_ERR as the severity level and LOG_USER as the facility
descriptor. For more information, see the syslog(3C) man page,
Memory advice is inherited. A child process has the same advice as its parent. The advice is
set back to the system default advice after a call to exec() function, unless a different level
of advice is configured using the [Link].1 shared object. Advice is only applied to mmap()
regions explicitly created by the user program. Regions established by the run-time linker or by
system libraries that make direct system calls are not affected. For more information, see the
exec(2) man page.
This configuration applies advice to all ISM segments for applications with exec names that
begin with foo.
$ LD_PRELOAD=$LD_PRELOAD:[Link].1
$ MADVCFGFILE=madvcfg
$ export LD_PRELOAD MADVCFGFILE
$ cat $MADVCFGFILE
foo*:ism=access_lwp
This configuration sets advice for all applications with the exception of ls.
$ LD_PRELOAD=$LD_PRELOAD:[Link].1
$ MADV=access_many
$ MADVCFGFILE=madvcfg
$ export LD_PRELOAD MADV MADVCFGFILE
$ cat $MADVCFGFILE
ls:
Configuration specified in MADVCFGFILE takes precedence over the value set in MADV, specifying
* as the exec-name of the last configuration entry is equivalent to setting MADV. This example is
equivalent to the previous example.
$ LD_PRELOAD=$LD_PRELOAD:[Link].1
$ MADVCFGFILE=madvcfg
$ export LD_PRELOAD MADVCFGFILE
$ cat $MADVCFGFILE
ls:
*:madv=access_many
This configuration applies one type of advice for mmap() regions and different advice for heap
and shared memory regions for applications whose exec() names begin with foo.
$ LD_PRELOAD=$LD_PRELOAD:[Link].1
$ MADVCFGFILE=madvcfg
$ export LD_PRELOAD MADVCFGFILE
$ cat $MADVCFGFILE
foo*:madv=access_many,heap=sequential,shm=access_lwp
Using meminfo()
The meminfo() function gives the calling process information about the virtual memory and
physical memory that the system has allocated to that process.
#include <sys/types.h>
#include <sys/mman.h>
int meminfo(const uint64_t inaddr[], int addr_count,
const uint_t info_req[], int info_count, uint64_t outdata[],
uint_t validity[]);
MEMINFO_VPHYSICAL The physical memory address corresponding to the given virtual address
MEMINFO_VLGRP The lgroup to which the physical page corresponding to the given virtual
address belongs
MEMINFO_VPAGESIZE The size of the physical page corresponding to the given virtual address
MEMINFO_VREPLCNT The number of replicated physical pages that correspond to the given
virtual address
MEMINFO_VREPL_LGRP| The lgroup to which the nth physical replica of the given virtual address
n belongs
MEMINFO_VADI Application Data Integrity (ADI) status for the specified virtual address.
If the status is 0, ADI is disabled. If the status is 1, ADI is enabled.
info_req An array that lists the types of information that are being requested.
info_count The number of pieces of information that are requested for each address
in the inaddr array.
outdata An array where the meminfo() function places the results. The array's
size is equal to the product of the values of the info_req and addr_count
parameters.
validity An array of size equal to the value of the addr_count parameter. The
validity array contains bitwise result codes. The 0th bit of the result
code evaluates the validity of the corresponding input address. Each
successive bit in the result code evaluates the validity of the response to
the members of the info_req array in turn.
For all types of information except MEMINFO_VADI, any addresses in the inaddr array that have
never been referenced will not have any information about them returned by the meminfo()
function. This can also occur if an address has not been referenced recently and the physical
page that had been backing that address has been paged out. Information for MEMINFO_VADI is
always returned.
The meminfo() function returns EFAULT when the area of memory to which the outdata or
validity arrays point cannot be written to. The meminfo() function returns EFAULT when
the area of memory to which the info_req or inaddr arrays point cannot be read from. The
meminfo() function returns EINVAL when the value of info_count exceeds 31 or is less than 1.
The meminfo() function returns EINVAL when the value of addr_count is less than zero.
EXAMPLE 11 Use of meminfo() to Print Out Physical Pages and Page Sizes Corresponding to a Set
of Virtual Addresses
void
print_info(void **addrvec, int how_many)
{
static const int info[] = {
MEMINFO_VPHYSICAL,
MEMINFO_VPAGESIZE};
uint64_t * inaddr = alloca(sizeof(uint64_t) * how_many);
uint64_t * outdata = alloca(sizeof(uint64_t) * how_many * 2;
uint_t * validity = alloca(sizeof(uint_t) * how_many);
int i;
if ((validity[i] & 2) == 0)
printf("address 0x%llx has no physical page
associated with it\n",
inaddr[i]);
else {
char buff[80];
if (validity[i] & 4 == 0)
strlcpy(buff, "<Unknown>", sizeof(buff));
else
snprintf(buff, sizeof(buff), "%lld", outdata[i * 2 +
1]);
printf("address 0x%llx is backed by physical
page 0x%llx of size %s\n",
inaddr[i], outdata[i * 2], buff);
}
}
}
on the CPUs in the thread's home lgroup and allocates memory from that lgroup whenever
possible. If resources from the home lgroup are unavailable, the kernel allocates resources
from other lgroups. When a thread has affinity for more than one lgroup, the operating system
allocates resources from lgroups chosen in order of affinity strength. Lgroups can have one of
three distinct affinity levels:
1. LGRP_AFF_STRONG – Indicates strong affinity. If this lgroup is the thread's home lgroup, the
operating system avoids rehoming the thread to another lgroup if possible. Events such as
dynamic reconfiguration, processor, offlining, processor binding, and processor set binding
and manipulation might still result in thread rehoming.
2. LGRP_AFF_WEAK – Indicates weak affinity. If this lgroup is the thread's home lgroup, the
operating system rehomes the thread if necessary for load balancing purposes.
3. LGRP_AFF_NONE– Indicates no affinity. If a thread has no affinity to any lgroup, the operating
system assigns a home lgroup to the thread .
The operating system uses lgroup affinities as advice when allocating resources for a given
thread. The advice is factored in with the other system constraints. Processor binding and
processor sets do not change lgroup affinities, but might restrict the lgroups on which a thread
can run.
Using lgrp_affinity_get()
The lgrp_affinity_get() function returns the affinity that a LWP has for a given lgroup.
#include <sys/lgrp_user.h>
lgrp_affinity_t lgrp_affinity_get(idtype_t idtype, id_t id, lgrp_id_t lgrp);
The idtype and id arguments specify the LWP that the lgrp_affinity_get() function
examines. If the value of idtype is P_PID, the lgrp_affinity_get() function gets the lgroup
affinity for one of the LWPs in the process whose process ID matches the value of the id
argument. If the value of idtype is P_LWPID, the lgrp_affinity_get() function gets the
lgroup affinity for the LWP of the current process whose LWP ID matches the value of the id
argument. If the value of idtype is P_MYID, the lgrp_affinity_get() function gets the lgroup
affinity for the current LWP.
The lgrp_affinity_get() function returns EINVAL when the given lgroup or ID type is
not valid. The lgrp_affinity_get() function returns EPERM when the effective user of the
calling process is not the superuser and the ID of the calling process does not match the real or
effective user ID of one of the LWPs. The lgrp_affinity_get() function returns ESRCH when a
given lgroup or LWP is not found. For more information, see the lgrp_affinity_get(3LGRP)
man page.
Using lgrp_affinity_set()
The lgrp_affinity_set() function sets the affinity that a LWP or set of LWPs have for a
given lgroup.
#include <sys/lgrp_user.h>
int lgrp_affinity_set(idtype_t idtype, id_t id, lgrp_id_t lgrp,
lgrp_affinity_t affinity);
The idtype and id arguments specify the LWP or set of LWPs the lgrp_affinity_set()
function examines. If the value of idtype is P_PID, the lgrp_affinity_set() function sets the
lgroup affinity for all of the LWPs in the process whose process ID matches the value of the
id argument to the affinity level specified in the affinity argument. If the value of idtype is
P_LWPID, the lgrp_affinity_set() function sets the lgroup affinity for the LWP of the current
process whose LWP ID matches the value of the id argument to the affinity level specified in
the affinity argument. If the value of idtype is P_MYID, the lgrp_affinity_set() function
sets the lgroup affinity for the current LWP or process to the affinity level specified in the
affinity argument. For more information, see the lgrp_affinity_set(3LGRP) man page.
The lgrp_affinity_set() function returns EINVAL when the given lgroup, affinity, or ID type
is not valid. The lgrp_affinity_set() function returns EPERM when the effective user of the
calling process is not the superuser and the ID of the calling process does not match the real or
effective user ID of one of the LWPs. The lgrp_affinity_set() function returns ESRCH when a
given lgroup or LWP is not found.
The following code sample moves the memory in the address range between addr and
addr+len near the next thread to touch that range.
#include <stdio.h>
#include <sys/mman.h>
#include <sys/types.h>
/*
* Move memory to thread
*/
void
This sample code uses the meminfo() function to determine the lgroup of the physical memory
backing the virtual page at the given address. The sample code then sets a strong affinity for
that lgroup in an attempt to move the current thread near that memory.
#include <stdio.h>
#include <sys/lgrp_user.h>
#include <sys/mman.h>
#include <sys/types.h>
/*
* Move a thread to memory
*/
int
thread_to_memory(caddr_t va)
{
uint64_t addr;
ulong_t count;
lgrp_id_t home;
uint64_t lgrp;
uint_t request;
uint_t valid;
addr = (uint64_t)va;
count = 1;
request = MEMINFO_VLGRP;
if (meminfo(&addr, 1, &request, 1, &lgrp, &valid) != 0) {
perror("meminfo");
return (1);
}
if (home != lgrp)
return (-1);
return (0);
}
The following sample code walks through and prints out the lgroup hierarchy.
#include <stdio.h>
#include <stdlib.h>
#include <sys/lgrp_user.h>
#include <sys/types.h>
/*
* Walk and print lgroup hierarchy from given lgroup
* through all its descendants
*/
int
lgrp_walk(lgrp_cookie_t cookie, lgrp_id_t lgrp, lgrp_content_t content)
{
lgrp_affinity_t aff;
lgrp_id_t *children;
processorid_t *cpuids;
int i;
int ncpus;
int nchildren;
int nparents;
lgrp_id_t *parents;
lgrp_mem_size_t size;
/*
* Print given lgroup, caller's affinity for lgroup,
* and desired content specified
*/
printf("LGROUP #%d:\n", lgrp);
/*
* Get CPUs
*/
ncpus = lgrp_cpus(cookie, lgrp, NULL, 0, content);
printf("\t%d CPUS: ", ncpus);
if (ncpus == -1) {
perror("lgrp_cpus");
return (-1);
} else if (ncpus > 0) {
cpuids = malloc(ncpus * sizeof (processorid_t));
ncpus = lgrp_cpus(cookie, lgrp, cpuids, ncpus, content);
if (ncpus == -1) {
free(cpuids);
perror("lgrp_cpus");
return (-1);
}
for (i = 0; i < ncpus; i++)
printf("%d ", cpuids[i]);
free(cpuids);
}
printf("\n");
/*
* Get memory size
*/
printf("\tMEMORY: ");
size = lgrp_mem_size(cookie, lgrp, LGRP_MEM_SZ_INSTALLED, content);
if (size == -1) {
perror("lgrp_mem_size");
return (-1);
}
printf("installed bytes 0x%llx, ", size);
size = lgrp_mem_size(cookie, lgrp, LGRP_MEM_SZ_FREE, content);
if (size == -1) {
perror("lgrp_mem_size");
return (-1);
}
printf("free bytes 0x%llx\n", size);
/*
* Get parents
*/
nparents = lgrp_parents(cookie, lgrp, NULL, 0);
printf("\t%d PARENTS: ", nparents);
if (nparents == -1) {
perror("lgrp_parents");
return (-1);
} else if (nparents > 0) {
parents = malloc(nparents * sizeof (lgrp_id_t));
/*
* Get children
*/
nchildren = lgrp_children(cookie, lgrp, NULL, 0);
printf("\t%d CHILDREN: ", nchildren);
if (nchildren == -1) {
perror("lgrp_children");
return (-1);
} else if (nchildren > 0) {
children = malloc(nchildren * sizeof (lgrp_id_t));
nchildren = lgrp_children(cookie, lgrp, children, nchildren);
if (nchildren == -1) {
free(children);
perror("lgrp_children");
return (-1);
}
printf("Children: ");
for (i = 0; i < nchildren; i++)
printf("%d ", children[i]);
printf("\n");
free(children);
}
printf("\n");
return (0);
}
EXAMPLE 15 Find The Closest lgroup With Available Memory Outside a Given lgroup
#include <stdio.h>
#include <stdlib.h>
#include <sys/lgrp_user.h>
#include <sys/types.h>
/*
* Find next closest lgroup outside given one with available memory
*/
lgrp_id_t
lgrp_next_nearest(lgrp_cookie_t cookie, lgrp_id_t from)
{
lgrp_id_t closest;
int i;
int latency;
int lowest;
int nparents;
lgrp_id_t *parents;
lgrp_mem_size_t size;
/*
* Get number of parents
*/
nparents = lgrp_parents(cookie, from, NULL, 0);
if (nparents == -1) {
perror("lgrp_parents");
return (LGRP_NONE);
}
/*
* No parents, so current lgroup is next nearest
*/
if (nparents == 0) {
return (from);
}
/*
* Get parents
*/
parents = malloc(nparents * sizeof (lgrp_id_t));
nparents = lgrp_parents(cookie, from, parents, nparents);
if (nparents == -1) {
perror("lgrp_parents");
free(parents);
return (LGRP_NONE);
}
/*
* Find closest parent (ie. the one with lowest latency)
*/
closest = LGRP_NONE;
lowest = INT_MAX;
for (i = 0; i < nparents; i++) {
lgrp_id_t lgrp;
/*
* See whether parent has any free memory
*/
size = lgrp_mem_size(cookie, parents[i], LGRP_MEM_SZ_FREE,
LGRP_CONTENT_ALL);
if (size > 0)
lgrp = parents[i];
else {
if (size == -1)
perror("lgrp_mem_size");
/*
* Find nearest ancestor if parent doesn't
* have any memory
*/
lgrp = lgrp_next_nearest(cookie, parents[i]);
if (lgrp == LGRP_NONE)
continue;
}
/*
* Get latency within parent lgroup
*/
latency = lgrp_latency_cookie(lgrp, lgrp);
if (latency == -1) {
perror("lgrp_latency_cookie");
continue;
}
/*
* Remember lgroup with lowest latency
*/
if (latency < lowest) {
closest = lgrp;
lowest = latency;
}
}
free(parents);
return (closest);
}
/*
* Find lgroup with memory nearest home lgroup of current thread
*/
lgrp_id_t
lgrp_nearest(lgrp_cookie_t cookie)
{
lgrp_id_t home;
longlong_t size;
/*
* Get home lgroup
*/
home = lgrp_home(P_LWPID, P_MYID);
/*
* See whether home lgroup has any memory available in its hierarchy
*/
size = lgrp_mem_size(cookie, home, LGRP_MEM_SZ_FREE,
LGRP_CONTENT_ALL);
if (size == -1)
perror("lgrp_mem_size");
/*
* It does, so return the home lgroup.
*/
if (size > 0)
return (home);
/*
* Otherwise, find next nearest lgroup outside of the home.
*/
return (lgrp_next_nearest(cookie, home));
}
This example code finds the nearest lgroup with free memory to a given thread's home lgroup.
lgrp_id_t
lgrp_nearest(lgrp_cookie_t cookie)
{
lgrp_id_t home;
longlong_t size;
/*
* Get home lgroup
*/
home = lgrp_home();
/*
* See whether home lgroup has any memory available in its hierarchy
*/
/*
* It does, so return the home lgroup.
*/
if (size > 0)
return (home);
/*
* Otherwise, find next nearest lgroup outside of the home.
*/
Input/Output Interfaces
This chapter introduces file input/output operations, as provided on systems that do not provide
virtual memory services. The chapter discusses the improved input/output method provided
by the virtual memory facilities. The chapter describes the older method of locking files and
records in “Using File and Record Locking” on page 95.
The Oracle Solaris operating system provides the following basic forms of file I/O interfaces:
■ The basic file I/O interfaces are described in “Basic File I/O” on page 91.
■ The standard I/O buffering provides an easier interface and improved efficiency to run
an application on a system without virtual memory. In an application running in a virtual
memory environment, such as SunOS operating system, standard file I/O is outdated.
■ The memory mapping interface is described in “Memory Management
Interfaces” on page 15. Mapping files is the efficient form of the file I/O for applications
running in the Oracle Solaris platform.
open Open a file for reading or writing. For more information, see the open(2) man page.
close Close a file descriptor. For more information, see the close(2) man page.
read Read from a file. For more information, see the read(2) man page.
write Write to a file. For more information, see the write(2) man page.
creat Create a new file or rewrite an existing one. For more information, see the creat(2)
man page.
unlink Remove a directory entry. For more information, see the unlink(2) man page.
lseek Move read/write file pointer. For more information, see the lseek(2) man page.
The following code sample demonstrates the use of the basic file I/O interface.
#include <fcntl.h>
#define MAXSIZE 256
main()
{
int fd;
ssize_t n;
char array[MAXSIZE];
In this example, the read and the write interfaces both transfer the specified number of bytes,
starting at the current offset into the file. The number of bytes transferred is returned. The end
of a file is indicated on a read by a return value of zero. For more information, see the read(2)
and write(2) man pages.
When you are done reading or writing a file, call the close interface. Do not call close for a
file descriptor that was not returned from a call to open. For more information, see the close(2),
and open(2) man pages.
File pointer offsets into an open file are changed by using read , write, or by calls to lseek.
For more information, see the read(2), write(2) and lseek(2) man pages.
off_t start, n;
struct record rec;
/* go back to start */
n = lseek (fd, -start, SEEK_SET);
read (fd, &rec, sizeof (rec));
link, linkat Link to a file. For more information, see the link(2) and
linkat(2) man pages.
access, faccessat Determine accessibility of a file. For more information,
see the access(2) and faccessat(2) man pages.
mknod Make a special or ordinary file. For more information, see
the mknod(2) man page.
chmod, fchmodat Change mode of file. For more information, see the
chmod(2) and fchmodat(2)
chown, lchown, fchown, fchownat Change owner and group of a file. For more information,
see the chown(2), lchown(2), fchown(2), and fchownat(2)
man pages.
utime Set file access and modification times. For more
information, see the utime(2) man page.
stat, lstat, fstat, fstatat Get file status. For more information, see the stat(2),
lstat(2), fstat(2), and fstatat(2) man pages.
fcntl Perform file control functions. For more information, see
the fcntl(2) man page.
ioctl Control device. For more information, see the ioctl(2)
man page.
fpathconf Get configurable path name variables. For more
information, see the fpathconf(2) man page.
opendir, readdir, closedir Perform directory operations. For more information, see
the opendir(3C), readdir(3C), and closedir(3C) man
pages.
mkdir, mkdirat Make a directory. For more information, see the mkdir(2)
and mkdirat(2) man pages.
readlink, readlinkat Read the value of a symbolic link. For more information,
see the readlink(2) and readlinkat(2) man pages.
rename, renameat Change the name of a file. For more information, see the
rename(2) and renameat(2) man pages.
rmdir, unlinkat Remove a directory. For more information, see the
rmdir(2) and unlinkat(2) man pages.
symlink, symlinkat Make a symbolic link to a file. For more information, see
the symlink(2) and symlinkat(2) man pages.
fgetattr, fsetattr, getattrat, setattrat Get and set system attributes. For more information, see
the fgetattr(3C), fsetattr(3C), getattrat(3C), and
setattrat(3C) man pages.
For more information, see “syscall Provider” in Oracle Solaris 11.4 DTrace (Dynamic Tracing)
Guide.
ustat Get file system statistics. For more information, see the ustat(2) man
page.
sync Update super block. For more information, see the sync(2) man page.
mount Mount a file system. For more information, see the mount(2) man
page.
statvfs, fstatvfs Get file system information. For more information, see the statvfs(2)
and fstatvfs(2) man pages.
sysfs Get file system type information. For more information, see the
sysfs(2) man page.
Locking files prevents errors that can occur when several users try to update a file at the same
time. You can lock a portion of a file.
File locking blocks access to an entire file. Record locking blocks access to a specified segment
of the file. In Oracle Solaris OS, all files are a sequence of bytes of data: a record is a concept of
the programs that use the file.
The fcntl locking call is more portable, powerful, and less easy to use than lockf locking call.
fcntl is specified in POSIX 1003.1 standard. lockf is compatible with older applications. For
more information, see the fcntl(2), lockf(3C), fcntl(2), and lockf(3C) man pages.
#include <sys/types.h>
#include <sys/stat.h>
int mode;
struct stat buf;
...
if (stat(filename, &buf) < 0) {
perror("program");
exit (2);
}
/* get currently set mode */
mode = buf.st_mode;
/* remove group execute permission from mode */
mode &= ~(S_IEXEC>>3);
/* set 'set group id bit' in mode */
mode |= S_ISGID;
if (chmod(filename, mode) < 0) {
perror("program");
exit(2);
}
...
The operating system ignores record locks when the system is executing a file. Any files with
record locks should not have execute permissions set.
The chmod command can also be used to set a file to permit mandatory locking. For more
information, see the chmod(1) man page.
$ chmod +l file
This command sets the O20n0 permission bit in the file mode, which indicates mandatory
locking on the file. If n is even, the bit is interpreted as enabling mandatory locking. If n is odd,
the bit is interpreted as set group ID on execution".
The ls command shows this setting when you ask for the long listing format with the -l option:
$ ls -l file
The letter "l" in the permissions indicates that the set-group-ID bit is on. Since the set-group-ID
bit is on, mandatory locking is enabled. Normal semantics of set group ID are also enabled.
■ Mandatory locking works only for local files. Mandatory locking is not supported when
accessing files through NFS.
■ Mandatory locking protects only the segments of a file that are locked. The remainder of the
file can be accessed according to normal file permissions.
■ If multiple reads or writes are needed for an atomic transaction, the process should
explicitly lock all such segments before any I/O begins. Advisory locks are sufficient for all
programs that perform in this way.
■ Arbitrary programs should not have unrestricted access permission to files on which record
locks are used.
■ Advisory locking is more efficient because a record lock check does not have to be
performed for every I/O request.
Both advisory and mandatory locking are supported on the file systems listed in the following
table.
Only advisory file locking is supported on NFS. File locking is not supported for the proc and
fd file systems.
You can only request a lock for a file with a valid open descriptor. For read locks, the file must
be open with at least read access. For write locks, the file must also be open with write access.
In the following example, a file is opened for both read and write access.
...
filename = argv[1];
fd = open (filename, O_RDWR);
if (fd < 0) {
perror(filename);
exit(2);
}
...
To lock an entire file, set the offset to zero and set the size to zero.
You can set a lock on a file in several ways. The choice of method depends on how the lock
interacts with the rest of the program, performance, and portability. This example uses the
POSIX standard-compatible fcntl interface. The interface tries to lock a file until one of the
following events happen:
#include <fcntl.h>
...
struct flock lck;
...
lck.l_type = F_WRLCK; /* setting a write lock */
lck.l_whence = 0; /* offset l_start from beginning of file */
lck.l_start = (off_t)0;
lck.l_len = (off_t)0; /* until the end of the file */
if (fcntl(fd, F_SETLK, &lck) <0) {
if (errno == EAGAIN || errno == EACCES) {
(void) fprintf(stderr, "File busy try again later!\n");
return;
}
perror("fcntl");
exit (2);
}
...
Using fcntl, you can set the type and start of the lock request by setting structure variables.
For more information, see the fcntl(2) man page.
Note - You cannot lock mapped files with flock. However, you can use the multithread-
oriented synchronization mechanisms with mapped files. These synchronization
mechanisms can be used in POSIX styles and in Oracle Solaris styles.
When locking a record, do not set the starting point and length of the lock segment to zero. The
locking procedure is otherwise identical to file locking.
Contention for data is why you use record locking. Therefore, you must have a failure response
for when you cannot obtain all the required locks:
{
struct flock lck;
...
lck.l_type = F_WRLCK; /* setting a write lock */
lck.l_whence = 0; /* offset l_start from beginning of file */
lck.l_start = here;
lck.l_len = sizeof(struct record);
...
}
#include <unistd.h>
{
...
/* lock "this" */
(void) lseek(fd, this, SEEK_SET);
if (lockf(fd, F_LOCK, sizeof(struct record)) < 0) {
/* Lock on "this" failed. Clear lock on "here". */
(void) lseek(fd, here, 0);
(void) lockf(fd, F_ULOCK, sizeof(struct record));
return (-1);
}
You remove locks in the same way the locks were set. Only the lock type is different (F_ULOCK).
An unlock cannot be blocked by another process and affects only locks placed by the calling
process. The unlock affects only the segment of the file specified in the preceding locking call.
The next example finds and prints identifying data on all the locked segments of a file.
lck.l_whence = 0;
lck.l_start = 0L;
lck.l_len = 0L;
do {
lck.l_type = F_WRLCK;
(void) fcntl(fd, F_GETLK, &lck);
if (lck.l_type != F_UNLCK) {
(void) printf("%d %d %c %8ld %8ld\n", lck.l_sysid, lck.l_pid,
(lck.l_type == F_WRLCK) ? 'W' : 'R', lck.l_start, lck.l_len);
/* If this lock goes to the end of the address space, no
* need to look further, so break out. */
if (lck.l_len == 0) {
/* else, look for new lock after the one just found. */
lck.l_start += lck.l_len;
}
}
} while (lck.l_type != F_UNLCK);
fcntl with the F_GETLK command can sleep while waiting for a server to respond. The
command can fail, returning ENOLCK, if either the client or the server have a resource shortage.
Use lockf with the F_TEST command to test if a process is holding a lock. This interface does
not return information about the lock's location or ownership. For more information, see the
lockf(3C) man page.
When a process forks, the child receives a copy of the file descriptors that the parent opened.
Locks are not inherited by the child because the locks are owned by a specific process. The
parent and child share a common file pointer for each file. Both processes can try to set locks
on the same location in the same file. This problem occurs with both lockf and fcntl. If a
program holding a record lock forks, the child process should close the file. After closing
the file, the child process should reopen the file to set a new, separate file pointer. For more
information, see the lockf(3C) and fcntl(2) man pages.
Deadlock Handling
The UNIX locking facilities provide deadlock detection and avoidance. Deadlocks can occur
only when the system is ready to put a record-locking interface to sleep. A search is made to
determine whether two processes are in a deadlock. If a potential deadlock is detected, the
locking interface fails and sets errno to indicate deadlock. Processes setting locks that use
F_SETLK do not cause a deadlock because these processes do not wait when the lock cannot be
granted immediately.
Terminal I/O interfaces deal with a general terminal interface for controlling asynchronous
communications ports, as shown in the following table.
The following example shows how the server dissociates from the controlling terminal of its
invoker in the non-DEBUG mode of operation.
(void) close(0);
(void) close(1);
(void) close(2);
(void) open("/", O_RDONLY);
(void) dup2(0, 1);
(void) dup2(0, 2);
setsid();
This operation mode prevents the server from receiving signals from the process group of the
controlling terminal. A server cannot send reports of errors to a terminal after the server has
dissociated. The dissociated server must log errors with syslog. For more information, see the
syslog(3C) man page.
Interprocess Communication
SunOS 5.11 and compatible operating systems support different mechanisms for concurrent
processes to exchange data and synchronize execution. All of these mechanisms, except
mapped memory, are introduced in this chapter.
■ Pipes (anonymous data queues) are described in “Pipes Between Processes” on page 105.
■ Named pipes (data queues with file names.) are described in “Named Pipes” on page 107
.
■ System V message queues, semaphores, and shared memory are described in “System V
IPC” on page 110.
■ POSIX message queues, semaphores, and shared memory are described in “POSIX
Interprocess Communication” on page 108.
■ Interprocess communication using sockets are described in “Sockets
Overview” on page 107.
■ Mapped memory and files are described in “Memory Management Interfaces” on page 15.
■ Doors (a mechanism for secure control transfer) are described in “Doors
Overview” on page 107.
A pipe is created in the process that becomes the parent by a call to pipe. The call returns two
file descriptors in the array passed to it. After forking, both processes read from p[0] and write
to p[1]. The processes read from and write to a circular buffer that is managed for them. For
more information, see the pipe(2) man page.
Calling fork duplicates the per-process open file table. Each process has two readers and two
writers. Closing the extra readers and writers enables the proper functioning of the pipe. For
example, if the end of a reader is left open by the same process for writing, no end-of-file
indication is returned. For more information, see the fork(2) man pages.
The following code shows pipe creation, a fork, and clearing the duplicate pipe ends.
#include <stdio.h>
#include <unistd.h>
...
int p[2];
...
if (pipe(p) == -1) exit(1);
switch( fork() )
{
case 0: /* in child */
close( p[0] );
dup2( p[1], 1);
close P[1] );
exec( ... );
exit(1);
default: /* in parent */
close( p[1] );
dup2( P[0], 0 );
close( p[0] );
break;
}
...
The following table shows the results of reads from a pipe and writes to a pipe, under certain
conditions.
Blocking can be prevented by calling fcntl on the descriptor to set FNDELAY. This causes an
error return (-1) from the I/O call with errno set to EWOULDBLOCK. For more information, see the
fcntl(2) man page.
Named Pipes
Named pipes function much like pipes, but are created as named entities in a file system. This
enables the pipe to be opened by all processes with no requirement that they be related by
forking. A named pipe is created by a call to mknod. Any process with appropriate permission
can then read or write to a named pipe. For more information, see the mknod(2) man page.
In the open call, the process opening the pipe blocks until another process also opens the pipe.
To open a named pipe without blocking, the open call joins the O_NDELAY mask (found in sys/
fcntl.h) with the selected file mode mask using the Boolean or operation on the call to open.
If no other process is connected to the pipe when open is called, -1 is returned with errno set to
EWOULDBLOCK. For more information, see the open(2) man page.
Sockets Overview
Sockets provide point-to-point, two-way communication between two processes. Sockets are
a basic component of interprocess and inter-system communication. A socket is an endpoint
of communication to which a name can be bound. It has a type and one or more associated
processes.
You can use sockets to communicate between processes on a single system, like other forms of
IPC. The UNIX domain (AF_UNIX) provides a socket address space on a single system. UNIX
domain sockets are named with UNIX paths. UNIX domain sockets are further described in
Appendix A, “UNIX Domain Sockets”. Sockets can also be used to communicate between
processes on different systems. The socket address space between connected systems is called
the Internet domain (AF_INET). Internet domain communication uses the TCP/IP internet
protocol suite. Internet domain sockets are described in Chapter 7, “Socket Interfaces”.
Doors Overview
Doors are a fast light-weight RPC mechanism for secure control transfer between processes
on the same machine. A door is created when a process known as the door server calls
door_create(3DOOR) with a server function and receives a file descriptor. The file descriptor
can be passed to other processes or attached to the file system using fattach(3C). A
client process, which has the file descriptor, can then invoke the door process by calling
door_call(3DOOR). The client can also pass data and descriptors including other door
descriptors. As a result of the call to door_call(), the client thread blocks and a thread in
the door server wakes up and starts running the server function. When the server function is
completed, the function calls door_return(3DOOR) to pass optional data and descriptors back
to the client. door_return() also switches control back to the client; the server thread gets
blocked in the kernel and does not return from the door_return call.
Unlike the System V IPC interfaces, the POSIX IPC interfaces are all multithread safe.
POSIX Messages
The POSIX message queue interfaces are listed in the following table.
mq_receive Receives (removes) the oldest, highest priority message from the
queue
mq_notify Notifies a process or thread that a message is available in the queue
mq_setattr Set or get message queue attributes
POSIX Semaphores
POSIX semaphores are much lighter weight than are System V semaphores. A POSIX
semaphore structure defines a single semaphore, not an array of up to 25 semaphores.
sem_unlink Ends the connection to an open semaphore and causes the semaphore to
be removed when the last process closes it
sem_getvalue Copies the value of the semaphore into the specified integer
sem_wait Blocks while the semaphore is held by other processes or returns an error
if the semaphore is held by another process
The options in shm_open substantially fewer than the number of options provided in open.
System V IPC
SunOS 5.11 and compatible operating systems also provide the System V inter process
communication (IPC) package. System V IPC has effectively been replaced by POSIX IPC, but
is maintained to support older applications.
For more information about the Sysytem V IPC, see the ipcrm(1), ipcs(1), Intro(2),
msgctl(2), msgget(2), msgrcv(2), msgsnd(2), semget(2), semctl(2), semop(2), shmget(2),
shmctl(2), shmop(2), and ftok(3C) man pages.
Interfaces that initialize or get access to messages, semaphores, or shared memory return an ID
number of type int. IPC Interfaces that perform read, write, and control operations use this ID.
If the key argument is specified as IPC_PRIVATE, the call initializes a new instance of an IPC
facility that is private to the creating process.
When the IPC_CREAT flag is supplied in the flags argument appropriate to the call, the interface
tries to create the facility if it does not exist already.
When called with both theIPC_CREAT and IPC_EXCL flags, the interface fails if the facility
already exists. This behavior can be useful when more than one process might attempt to
initialize the facility. One such case might involve several server processes having access to
the same facility. If they all attempt to create the facility with IPC_EXCL in effect, only the first
attempt succeeds.
If neither of these flags is given and the facility already exists, the interfaces return the ID of the
facility to get access. If IPC_CREAT is omitted and the facility is not already initialized, the calls
fail.
Using logical (bitwise) OR, IPC_CREAT and IPC_EXCL are combined with the octal permission
modes to form the flags argument. For example, the statement below initializes a new message
queue if the queue does not exist:
The first argument evaluates to a key ('A') based on the string ("/tmp"). The second argument
evaluates to the combined permissions and control flags.
System V Messages
Before a process can send or receive a message, you must initialize the queue through msgget
. The owner or creator of a queue can change its ownership or permissions using msgctl. Any
process with permission can use msgctl for control operations. For more information, see the
msgget(2) and msgctl(2) man pages.
IPC messaging enables processes to send and receive messages and queue messages for
processing in an arbitrary order. Unlike the file byte-stream data flow of pipes, each IPC
message has an explicit length.
Messages can be assigned a specific type. A server process can direct message traffic between
clients on its queue by using the client process PID as the message type. For single-message
transactions, multiple server processes can work in parallel on transactions sent to a shared
message queue.
Operations to send and receive messages are performed by msgsnd and msgrcv, respectively.
When a message is sent, its text is copied to the message queue. msgsnd and msgrcv can
be performed as either blocking or non-blocking operations. For more information, see the
msgsnd(2) and msgrcv(2) man pages.
A blocked message operation remains suspended until one of the following three conditions
occurs:
The MSGMNI kernel configuration option determines the maximum number of unique message
queues that the kernel supports. msgget fails when this limit is exceeded. For more information,
see the msgget(2) man page.
#include <sys/ipc.h>
#include <sys/msg.h>
...
key_t key; /* key to be passed to msgget() */
int msgflg, /* msgflg to be passed to msgget() */
msqid; /* return value from msgget() */
...
key = ...
msgflg = ...
if ((msqid = msgget(key, msgflg)) == -1)
{
perror("msgget: msgget failed");
exit(1);
} else
(void) fprintf(stderr, "msgget succeeded");
...
IPC_STAT Place information about the status of the queue in the data structure
pointed to by buf. The process must have read permission for this call to
succeed.
IPC_SET Set the owner's user and group ID, the permissions, and the size (in
number of bytes) of the message queue. A process must have the
System V Semaphores
Semaphores enable processes to query or alter status information. They are used to monitor and
control the availability of system resources such as shared memory segments. Semaphores can
be operated on as individual units or as elements in a set.
Because System V IPC semaphores can be in a large array, they are extremely heavy
weight. Much lighter-weight semaphores are available in the threads library. Also, POSIX
semaphores are the most current implementation of System V semaphores (see “POSIX
Semaphores” on page 109). Threads library semaphores must be used with mapped memory.
For more information, see “Memory Management Interfaces” on page 15.
A semaphore set consists of a control structure and an array of individual semaphores. A set
of semaphores can contain up to 25 elements. The semaphore set must be initialized using
semget. The semaphore creator can change its ownership or permissions using semctl. Any
process with permission can use semctl to do control operations. For more information, see the
semget(2) and semctl(2) man pages.
Semaphore operations are performed by semop. This interface takes a pointer to an array of
semaphore operation structures. Each structure in the array contains data about an operation to
perform on a semaphore. Any process with read permission can test whether a semaphore has
a zero value. Operations to increment or decrement a semaphore require write permission. For
more information, see the semop(2) man page.
When an operation fails, none of the semaphores are altered. The process blocks unless the
IPC_NOWAIT flag is set, and remains blocked until:
■ The semaphore operations can all finish, so the call succeeds.
Only one process at a time can update a semaphore. Simultaneous requests by different
processes are performed in an arbitrary order. When an array of operations is given by a semop
call, no updates are done until all operations on the array can finish successfully.
If a process with exclusive use of a semaphore terminates abnormally and fails to undo the
operation or free the semaphore, the semaphore stays locked in memory in the state the process
left it. To prevent this occurrence, the SEM_UNDO control flag makes semop allocate an undo
structure for each semaphore operation, which contains the operation that returns the semaphore
to its previous state. If the process dies, the system applies the operations in the undo structures.
This prevents an aborted process from leaving a semaphore set in an inconsistent state. For
more information, see the semop(2) man page.
When performing a semaphore operation with SEM_UNDO in effect, you must also have SEM_UNDO
in effect for the call that performs the reversing operation. When the process runs normally,
the reversing operation updates the undo structure with a complementary value. This ensures
that, unless the process is aborted, the values applied to the undo structure are canceled to zero.
When the undo structure reaches zero, it is removed.
Using SEM_UNDO inconsistently can lead to memory leaks because allocated undo structures
might not be freed until the system is rebooted.
The SEMMNI system configuration option determines the maximum number of semaphore
arrays allowed. The SEMMNS option determines the maximum possible number of individual
semaphores across all semaphore sets. Because of fragmentation between semaphore sets,
allocating all available semaphores might not be possible.
Controlling Semaphores
semctl changes permissions and other characteristics of a semaphore set. It must be called with
a valid semaphore ID. The semnum value selects a semaphore within an array by its index. The
cmd argument is one of the following control flags.
SETVAL Set the value of a single semaphore. In this case, arg is taken
as [Link], an int.
GETPID Return the PID of the process that performed the last
operation on the semaphore or array.
GETALL Return the values for all semaphores in a set. In this case,
arg is taken as [Link], a pointer to an array of unsigned
short values.
SETALL Set values for all semaphores in a set. In this case, arg is
taken as [Link], a pointer to an array of unsigned short
values.
IPC_STAT Return the status information from the control structure for
the semaphore set and place it in the data structure pointed to
by [Link], a pointer to a buffer of type semid_ds.
A process must have a user identification of the owner, the creator, or the superuser to perform
an IPC_SET or IPC_RMID command. For other control commands read and write permission is
required.
Semaphore Operations
semop performs operations on a semaphore set. The semid argument is the semaphore ID
returned by a previous semget(2) call. The sops argument is a pointer to an array of structures,
each containing the following information about a semaphore operation:
■ The semaphore number
■ The operation to be performed
■ Control flags, if any
The sembuf structure specifies a semaphore operation, as defined in sys/sem.h. The nsops
argument specifies the length of the array, the maximum size of which is determined by the
SEMOPM configuration option. This option determines the maximum number of operations
allowed by a single semop call, and is set to 10 by default.
The two control flags that can be used with semop are IPC_NOWAIT and SEM_UNDO.
IPC_NOWAIT Can be set for any operations in the array. Makes the interface return
without changing any semaphore value if it cannot perform any of the
operations for which IPC_NOWAIT is set. The interface fails if it tries to
decrement a semaphore more than its current value, or tests a nonzero
semaphore to be equal to zero.
SEM_UNDO Allows individual operations in the array to be undone when the process
exits.
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/sem.h>
...
int i; /* work area */
int nsops; /* number of operations to do */
int semid; /* semid of semaphore set */
struct sembuf *sops; /* ptr to operations to perform */
...
if ((i = semop(semid, sops, nsops)) == –1) {
perror("semop: semop failed");
} else
(void) fprintf(stderr, "semop: returned %d\n", i);
...
In the SunOS 5.11 operating system, the efficient way to implement shared memory
applications is to rely on mmap and on the system's native virtual memory facility. For more
information, see Chapter 1, “Memory and CPU Management” and the mmap(2) man page.
The SunOS 5.11 platform also supports System V shared memory, which is a less efficient
way to enable the attachment of a segment of physical memory to the virtual address spaces of
multiple processes. When write access is allowed for more than one process, an outside protocol
or mechanism, such as a semaphore, can be used to prevent inconsistencies and collisions.
A process creates a shared memory segment using shmget. This call is also used to get the ID of
an existing shared segment. The creating process sets the permissions and the size in bytes for
the segment.
The original owner of a shared memory segment can assign ownership to another user with
shmctl. The owner can also revoke this assignment. Other processes with proper permission
can perform various control functions on the shared memory segment using shmctl.
Once created, you can attach a shared segment to a process address space using shmat. You can
detach it using shmdt. The attaching process must have the appropriate permissions for shmat.
Once attached, the process can read or write to the segment, as allowed by the permission
requested in the attach operation. A shared segment can be attached multiple times by the same
process.
A shared memory segment is described by a control structure with a unique ID that points to
an area of physical memory. The identifier of the segment is called the shmid. You can find the
structure definition for the shared memory segment control in sys/shm.h.
For more information, see the shmget(2), shmctl(2), shmat(2), and shmdt(2) man pages.
shmget is used to obtain access to a shared memory segment. When the call succeeds, it returns
the shared memory segment ID (shmid). The following code illustrates shmget.
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/shm.h>
...
key_t key; /* key to be passed to shmget() */
int shmflg; /* shmflg to be passed to shmget() */
int shmid; /* return value from shmget() */
size_t size; /* size to be passed to shmget() */
...
key = ...
size = ...
shmflg) = ...
if ((shmid = shmget (key, size, shmflg)) == –1) {
perror("shmget: shmget failed");
exit(1);
} else {
(void) fprintf(stderr,
"shmget: shmget returned %d\n", shmid);
exit(0);
}
...
shmctl is used to alter the permissions and other characteristics of a shared memory segment.
The cmd argument is one of following control commands.
SHM_UNLOCK Unlock the shared memory segment. The process must have
the effective ID of superuser to perform this command.
IPC_SET Set the effective user and group identification and access
permissions. The process must have an effective ID of owner,
creator or superuser to perform this command.
IPC_RMID Remove the shared memory segment. The process must have
an effective ID of owner, creator, or superuser to perform this
command.
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/shm.h>
...
int cmd; /* command code for shmctl() */
int shmid; /* segment ID */
struct shmid_ds shmid_ds; /* shared memory data structure to hold results */
...
shmid = ...
cmd = ...
if ((rtrn = shmctl(shmid, cmd, shmid_ds)) == –1) {
perror("shmctl: shmctl failed");
exit(1);
...
shmat() and shmdt() functions are used to attach and detach shared memory segments. shmat
returns a pointer to the head of the shared segment. shmdt() detaches the shared memory
segment located at the address indicated by shmaddr. For more information, see the shmop(2),
shmat(2), and shmdt(2) man pages.
#include <sys/types.h>
#include <sys/ipc.h>
#include <sys/shm.h>
Socket Interfaces
This chapter describes the socket interface. Sample programs are included to illustrate key
points. The following topics are discussed in this chapter:
■ Socket creation, connection, and closure are discussed in “Socket Basics” on page 127.
■ Client-Server architecture is discussed in “Client-Server Programs” on page 148.
■ Advanced topics such as multicast and asynchronous sockets are discussed in “Advanced
Socket Topics” on page 153.
■ Interfaces used to implement the Stream Control Transmission Protocol (SCTP) are
discussed in “Stream Control Transmission Protocol” on page 174.
Note - The interface that is described in this chapter is multithread safe. You can call
applications that contain socket interface calls freely in a multithreaded application. The degree
of concurrency that is available to applications is not specified.
Overview of Sockets
Sockets have been an integral part of SunOS releases since 1981. A socket is an endpoint of
communication to which a name can be bound. A socket has a type and an associated process.
Sockets were designed to implement the client-server model for interprocess communication
where:
Sockets provide network protocols while behaving like UNIX files. Applications create sockets
as needed. Sockets work with the close, read, write, ioctl, and fcntl interfaces. The
operating system differentiates between the file descriptors for files and the file descriptors for
sockets. For more information, see the close(2), read(2), write(2), ioctl(2), and fcntl(2)
man pages.
Socket Libraries
The socket interface routines are in a library that must be linked with the application. The
library [Link] is contained in /usr/lib with the rest of the system service libraries. Use
[Link] for dynamic linking.
Socket Types
Socket types define the communication properties that are visible to a user. The Internet family
sockets provide access to the TCP/IP transport protocols. The Internet family is identified by
the value AF_INET6, for sockets that can communicate over both IPv6 and IPv4. The value
AF_INET is also supported for source compatibility with old applications and for raw access to
IPv4.
Interface Sets
Two sets of socket interfaces are available in Oracle Solaris. The BSD socket interfaces
are provided and since SunOS version 5.7, the XNS 5 (UNIX03) socket interfaces are also
provided. The XNS 5 interfaces differ from the BSD interfaces.
The XNS 5 socket interfaces are documented in the following man pages:
■ accept(3C)
■ bind(3C)
■ connect(3C)
■ endhostent(3C)
■ endnetent(3C)
■ endprotoent(3C)
■ endservent(3C)
■ gethostbyaddr(3C)
■ gethostbyname(3C)
■ gethostent(3C)
■ gethostname(3C)
■ getnetbyaddr(3C)
■ getnetbyname(3C)
■ getnetent(3C)
■ getpeername(3C)
■ getprotobyname(3C)
■ getprotobynumber(3C)
■ getprotoent(3C)
■ getservbyname(3C)
■ getservbyport(3C)
■ getservent(3C)
■ getsockname(3C)
■ getsockopt(3C)
■ htonl(3C)
■ htons(3C)
■ inet_addr(3C)
■ inet_lnaof(3C)
■ inet_makeaddr(3C)
■ inet_netof(3C)
■ inet_network(3C)
■ inet_ntoa(3C)
■ listen(3C)
■ ntohl(3C)
■ ntohs(3C)
■ recv(3C)
■ recvfrom(3C)
■ recvmsg(3C)
■ send(3C)
■ sendmsg(3C)
■ sendto(3C)
■ sethostent(3C)
■ setnetent(3C)
■ setprotoent(3C)
■ setservent(3C)
■ setsockopt(3C)
■ shutdown(3C)
■ socket(3C)
■ socketpair(3C)
The BSD Socket behavior is documented in the corresponding 3N man pages. In addition, the
following interfaces have been added to section 3N:
■ freeaddrinfo(3C)
■ freehostent(3C)
■ getaddrinfo(3C)
■ getipnodebyaddr(3C)
■ getipnodebyname(3C)
■ getnameinfo(3C)
■ inet_ntop(3C)
■ inet_pton(3C)
See the standards(7) man page for information on building applications that use the XNS 5
(UNIX03) socket interface.
Socket Basics
This section describes the use of the basic socket interfaces.
Socket Creation
The socket call creates a socket in the specified family and of the specified type.
If the protocol is unspecified, the system selects a protocol that supports the requested socket
type. The socket handle is returned. The socket handle is a file descriptor.
The family is specified by one of the constants that are defined in sys/socket.h. Constants that
are named AF_suite specify the address format to use in interpreting names:
This call results in a stream socket. The TCP protocol provides the underlying communication.
Set the protocol argument to 0, the default, in most situations. You can specify a protocol other
than the default, as described in “Advanced Socket Topics” on page 153.
The bind interface enables a process to specify the local address of the socket. This interface
forms the local address, local port set. connect and accept complete a socket's association
by fixing the remote half of the address tuple. For more information, see the bind(3C),
connect(3C), and accept(3C) man pages.
The socket handle is s. The bound name is a byte string that is interpreted by the supporting
protocols. Internet family names contain an Internet address and port number.
#include <sys/types.h>
#include <netinet/in.h>
...
struct sockaddr_in6 sin6;
...
s = socket(AF_INET6, SOCK_STREAM, 0);
bzero (&sin6, sizeof (sin6));
sin6.sin6_family = AF_INET6;
sin6.sin6_addr.s6_addr = in6addr_arg;
sin6.sin6_port = htons(MYPORT);
bind(s, (struct sockaddr *) &sin6, sizeof sin6);
The content of the address sin6 is described in “Address Binding” on page 159, where
Internet address bindings are discussed.
Connection Establishment
Connection establishment is asymmetric, with one process acting as the client and the other as
the server. The server binds a socket to a well-known address associated with the service and
blocks on its socket for a connect request. An unrelated process can then connect to the server.
The client request services from the server by initiating a connection to the server's socket. On
the client side, the connect call initiates a connection. In the Internet family, this connection
might appear as:
If the client's socket is unbound at the time of the connect call, the system automatically selects
and binds a name to the socket. For more information, see “Address Binding” on page 159.
This automatic selection is the usual way to bind local addresses to a socket on the client side.
To receive a client's connection, a server must perform two steps after binding its socket. The
first step is to indicate how many connection requests can be queued. The second step is to
accept a connection.
The socket handle s is the socket bound to the address to which the connection request is sent.
The second parameter of listen specifies the maximum number of outstanding connections
that might be queued. The from structure is filled with the address of the client. A NULL
pointer might be passed. fromlen is the length of the structure. For more information, see the
listen(3C) man page.
The accept routine normally blocks processes. accept returns a new socket descriptor that
is connected to the requesting client. The value of fromlen is changed to the actual size of the
address. For more information, see the accept(3C) man page.
A server cannot indicate that the server accepts connections from only specific addresses.
The server can check the from address returned by accept and close a connection with
an unacceptable client. A server can accept connections on more than one socket, or
avoid blocking on the accept call. These techniques are presented in “Advanced Socket
Topics” on page 153.
Connection Errors
An error is returned if the connection is unsuccessful, but an address bound by the system
remains. If the connection is successful, the socket is associated with the server and data
transfer can begin.
The following table lists some of the more common errors returned when a connection attempt
fails.
Data Transfer
This section describes the interfaces to send and receive data. You can send or receive a
message with the read and write interfaces as follows:
send and recv are similar to read and write, but the flags argument is required. The flags
argument, which is defined in sys/socket.h, can be specified as a nonzero value if one or more
of the following is required:
Out-of-band data is specific to stream sockets. When MSG_PEEK is specified with a recv call,
any data present is returned to the user, but treated as still unread. The next read or recv call on
the socket returns the same data. The option to send data without routing packets applied to the
outgoing packets is currently used only by the routing table management process.
For more information, see the read(2), write(2), send(3C), and recv(3C) man pages.
Closing Sockets
A SOCK_STREAM socket can be discarded by a close interface call. If data is queued to a socket
that delivers after a close, the protocol continues to transfer the data. The data is discarded if it
remains undelivered after an arbitrary period. For more information, see the close(2) man page.
A shutdown closes SOCK_STREAM sockets. Both processes can acknowledge that they are no
longer sending. This call has the form:
shutdown(s, how);
For more information on closing SOCK_STREAM sockets, see the shutdown(3C) man page.
The following two examples illustrate initiating and accepting an Internet family stream
connection.
The following example program is a server. The server creates a socket and binds a name to the
socket, then displays the port number. The program calls listen to mark the socket as ready to
accept connection requests and to initialize a queue for the requests. The rest of the program is
an infinite loop. Each pass of the loop accepts a new connection and removes it from the queue,
creating a new socket. The server reads and displays the messages from the socket and closes
the socket. The use of in6addr_any is explained in “Address Binding” on page 159.
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <stdio.h>
#define TRUE 1
/*
* This program creates a socket and then begins an infinite loop.
* Each time through the loop it accepts a connection and prints
* data from it. When the connection breaks, or the client closes
* the connection, the program accepts a new connection.
*/
main() {
int sock, length;
struct sockaddr_in6 server;
int msgsock;
char buf[1024];
int rval;
/* Create socket. */
sock = socket(AF_INET6, SOCK_STREAM, 0);
if (sock == -1) {
perror("opening stream socket");
exit(1);
}
/* Bind socket using wildcards.*/
bzero (&server, sizeof(server));
server.sin6_family = AF_INET6;
server.sin6_addr = in6addr_any;
server.sin6_port = 0;
if (bind(sock, (struct sockaddr *) &server, sizeof server)
== -1) {
perror("binding stream socket");
exit(1);
}
/* Find out assigned port number and print it out. */
length = sizeof server;
if (getsockname(sock,(struct sockaddr *) &server, &length)
== -1) {
perror("getting socket name");
exit(1);
}
printf("Socket port #%d\n", ntohs(server.sin6_port));
/* Start accepting connections. */
listen(sock, 5);
do {
msgsock = accept(sock,(struct sockaddr *) 0,(int *) 0);
if (msgsock == -1)
perror("accept");
else do {
memset(buf, 0, sizeof buf);
if ((rval = read(msgsock,buf, sizeof(buf))) == -1)
perror("reading stream message");
if (rval == 0)
printf("Ending connection\n");
else
/* assumes the data is printable */
printf("-->%s\n", buf);
} while (rval > 0);
close(msgsock);
} while(TRUE);
/*
* Since this program has an infinite loop, the socket "sock" is
* never explicitly closed. However, all sockets are closed
* automatically when a process is killed or terminates normally.
*/
exit(0);
}
To initiate a connection, the client program in Example 22, “Internet Family Stream Connection
(Client),” on page 134 creates a stream socket, then calls connect, specifying the address
of the socket for connection. If the target socket exists, and the request is accepted, the
connection is complete. The program can now send data. Data is delivered in sequence with
no message boundaries. The connection is destroyed when either socket is closed. For more
information about data representation routines such as ntohl, ntohs, htons, and htonl, see the
byteorder(3C) man page.
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <stdio.h>
#define DATA "Half a league, half a league . . ."
/*
* This program creates a socket and initiates a connection with
* the socket given in the command line. Some data are sent over the
* connection and then the socket is closed, ending the connection.
* The form of the command line is: streamwrite hostname portnumber
* Usage: pgm host port
*/
main(int argc, char *argv[])
{
You can add support for one-to-one SCTP connections to stream sockets. The following
example code adds the -p to an existing program, enabling the program to specify the protocol
to use.
#include <stdio.h>
#include <netdb.h>
#include <string.h>
#include <errno.h>
int
main(int argc, char *argv[])
{
struct protoent *proto = NULL;
int c;
int s;
int protocol;
}
printf("Success\n");
return (0);
}
Input/Output Multiplexing
Requests can be multiplexed among multiple sockets or multiple files. Use select to multiplex:
#include <sys/time.h>
#include <sys/types.h>
#include <sys/select.h>
...
fd_set readmask, writemask, exceptmask;
struct timeval timeout;
...
select(nfds, &readmask, &writemask, &exceptmask, &timeout);
The first argument of select is the number of file descriptors in the lists pointed to by the next
three arguments.
The second, third, and fourth arguments of select point to three sets of file descriptors: a set of
descriptors to read on, a set to write on, and a set on which exception conditions are accepted.
Out-of-band data is the only exceptional condition. You can designate any of these pointers as
a properly cast null. Each set is a structure that contains an array of long integer bit masks. Set
the size of the array with FD_SETSIZE, which is defined in select.h. The array is long enough
to hold one bit for each FD_SETSIZE file descriptor.
The macros FD_SET (fd, &mask) and FD_CLR (fd, &mask) add and delete, respectively, the
file descriptor fd in the set mask. The set should be zeroed before use and the macro FD_ZERO
(&mask) clears the set mask.
The fifth argument of select enables the specification of a timeout value. If the timeout
pointer is NULL, select blocks until a descriptor is selectable, or until a signal is received. If the
fields in timeout are set to 0, select polls and returns immediately.
The select routine returns the number of file descriptors that are selected, or a zero if the
timeout has expired. The select routine returns -1 for an error or interrupt, with the error
number in errno and the file descriptor masks unchanged. For a successful return, the three
sets indicate which file descriptors are ready to be read from, written to, or have exceptional
conditions pending.
Test the status of a file descriptor in a select mask with the FD_ISSET (fd, &mask) macro. The
macro returns a nonzero value if fd is in the set mask. Otherwise, the macro returns zero. Use
select followed by a FD_ISSET (fd, &mask) macro on the read set to check for queued connect
requests on a socket. For more information, see the select(3C) man page.
The following example shows how to select on a listening socket for readability to determine
when a new connection can be picked up with a call to accept. The program accepts connection
requests, reads data, and disconnects on a single socket.
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/time/h>
#include <netinet/in.h>
#include <netdb.h>
#include <stdio.h>
#define TRUE 1
/*
* This program uses select to check that someone is
* trying to connect before calling accept.
*/
main() {
int sock, length;
struct sockaddr_in6 server;
int msgsock;
char buf[1024];
int rval;
fd_set ready;
struct timeval to;
/* Open a socket and bind it as in previous examples. */
/* Start accepting connections. */
listen(sock, 5);
do {
FD_ZERO(&ready);
FD_SET(sock, &ready);
to.tv_sec = 5;
to.tv_usec = 0;
if (select(sock + 1, &ready, (fd_set *)0,
(fd_set *)0, &to) == -1) {
perror("select");
continue;
}
if (FD_ISSET(sock, &ready)) {
msgsock = accept(sock, (struct sockaddr *)0, (int *)0);
if (msgsock == -1)
perror("accept");
else do {
memset(buf, 0, sizeof buf);
In previous versions of the select routine, its arguments were pointers to integers instead of
pointers to fd_sets. This style of call still works if the number of file descriptors is smaller than
the number of bits in an integer.
The select routine provides a synchronous multiplexing scheme. The SIGIO and SIGURG
signals, which is described in “Advanced Socket Topics” on page 153, provide asynchronous
notification of output completion, input availability, and exceptional conditions.
Datagram Sockets
A datagram socket provides a symmetric data exchange interface without requiring connection
establishment. Each message carries the destination address. The following figure shows the
flow of communication between server and client.
Create datagram sockets as described in “Socket Creation” on page 127. If a particular local
address is needed, the bind operation must precede the first data transmission. Otherwise, the
system sets the local address or port when data is first sent. Use sendto to send data. For more
information, see the bind(3C) and sendto(3C) man pages.
The s, buf, buflen, and flags parameters are the same as in connection-oriented sockets. The
to and tolen values indicate the address of the intended recipient of the message. A locally
detected error condition, such as an unreachable network, causes a return of -1 and errno to be
set to the error number.
To receive messages on a datagram socket, recvfrom is used. Before the call, fromlen is set to
the size of the from buffer. On return, fromlen is set to the size of the address from which the
datagram was received. For more information, see the recvfrom(3C) man page.
Datagram sockets can also use the connect call to associate a socket with a specific destination
address. The socket can then use the send call. Any data that is sent on the socket that does not
explicitly specify a destination address is addressed to the connected peer. Only the data that is
received from that peer is delivered. A socket can have only one connected address at a time.
A second connect call changes the destination address. Connect requests on datagram sockets
return immediately. The system records the peer's address. Neither accept nor listen are used
with datagram sockets. For more information, see the send(3C), connect(3C), accept(3C), and
listen(3C) man pages.
A datagram socket can return errors from previous send calls asynchronously while the socket
is connected. The socket can report these errors on subsequent socket operations. Alternately,
the socket can use an option of getsockopt, SO_ERROR to interrogate the error status. For more
information, see the getsockopt(3C) man page.
The following example code shows how to send an Internet call by creating a socket, binding a
name to the socket, and sending the message to the socket.
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
#include <stdio.h>
#define DATA "The sea is calm, the tide is full . . ."
/*
* Here I send a datagram to a receiver whose name I get from
* the command line arguments. The form of the command line is:
* dgramsend hostname portnumber
*/
main(int argc, char *argv[])
{
int sock, errnum;
struct sockaddr_in6 name;
The following sample code shows how to read an Internet call by creating a socket, binding a
name to the socket, and then reading from the socket.
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <stdio.h>
/*
* This program creates a datagram socket, binds a name to it, then
* reads from the socket.
*/
main()
{
int sock, length;
Standard Routines
This section describes the routines that you can use to locate and construct network addresses.
Unless otherwise stated, interfaces presented in this section apply only to the Internet family.
Locating a service on a remote host requires many levels of mapping before the client and
server communicate. A service has a name for human use. The service and host names must
translate to network addresses. Finally, the network address must be usable to locate and route
to the host. The specifics of the mappings can vary between network architectures.
Standard routines map host names to network addresses, network names to network numbers,
protocol names to protocol numbers, and service names to port numbers. The standard routines
also indicate the appropriate protocol to use in communicating with the server process. The file
netdb.h must be included when using any of these routines.
The getaddrinfo routine returns the combined address and port number of the specified host
and service names. Because the information returned by getaddrinfo is dynamically allocated,
the information must be freed by freeaddrinfo to prevent memory leaks. getnameinfo
returns the host and services names associated with a specified address and port number. Call
gai_strerror to print error messages based on the EAI_xxx codes returned by getaddrinfo
and getnameinfo.
After processing the information returned by getaddrinfo in the structure pointed to by res,
the storage should be released by freeaddrinfo(res).
The getnameinfo routine is particularly useful in identifying the cause of an error, as in the
following example:
struct hostent {
char *h_name; /* official name of host */
char **h_aliases; /* alias list */
int h_addrtype; /* hostaddrtype(e.g.,AF_INET6) */
int h_length; /* length of address */
char **h_addr_list; /* list of addrs, null terminated */
};
/*1st addr, net byte order*/
#define h_addr h_addr_list[0]
The routines return a hostent structure that contains the name of the host, its aliases, the
address type, and a NULL-terminated list of variable length addresses. The list of addresses
is required because a host can have many addresses. The h_addr definition is for backward
compatibility, and is the first address in the list of addresses in the hostent structure.
/*
* Assumes that a network number fits in 32 bits.
*/
struct netent {
char *n_name; /* official name of net */
char **n_aliases; /* alias list */
int n_addrtype; /* net address type */
int n_net; /* net number, host byte order */
};
struct protoent {
char *p_name; /* official protocol name */
char **p_aliases /* alias list */
int p_proto; /* protocol number */
};
struct servent {
char *s_name; /* official service name */
char **s_aliases; /* alias list */
int s_port; /* port number, network byte order */
char *s_proto; /* protocol to use */
};
The following call returns the telnet server that uses the TCP protocol.
sp = getservbyname("telnet", "tcp");
getservbyport and getservent are also provided. getservbyport has an interface that is
similar to the interface used by getservbyname. You can specify an optional protocol name to
qualify lookups For more information, see the getservbyname(3C), getservbyport(3C), and
getservent(3C) man pages.
Other Routines
Several other routines that simplify manipulating names and addresses are available. The
following table summarizes the routines for manipulating variable-length byte strings and byte-
swapping network addresses and values.
Interface Synopsis
memcmp Compares byte-strings; 0 if same, not 0 otherwise. For more information, see
the memcmp(3C) man page.
memcpy Copies n bytes from s2 to s1. For more information, see the memcpy(3C) man
page.
Interface Synopsis
memset Sets n bytes to value starting at base. For more information, see the
memset(3C) man page.
htonl 32-bit quantity from host into network byte order. For more information, see
the htonl(3C) man page.
htons 16-bit quantity from host into network byte order. For more information, see
the htons(3C) man pages.
ntohl 32-bit quantity from network into host byte order. For more information, see
the ntohl(3C) man page.
ntohs 16-bit quantity from network into host byte order. For more information, see
the ntohs(3C) man page.
The byte-swapping routines are provided because the operating system expects addresses
to be supplied in network order. On some architectures, the host byte ordering is different
from network byte order, so programs must sometimes byte-swap values. Routines that
return network addresses do so in network order. Byte-swapping problems occur only when
interpreting network addresses. For example, the following code formats a TCP or UDP port:
On systems that do not need these routines, the routines are defined as null macros.
Client-Server Programs
The most common form of distributed application is the client-server model. In this scheme,
client processes request services from a server process.
An alternate scheme is a service server that can eliminate dormant server processes. An
example is inetd, the Internet service daemon. inetd listens at a variety of ports, determined
at startup by reading a configuration file. When a connection is requested on an inetd
serviced port, inetd spawns the appropriate server to serve the client. Clients are unaware
that an intermediary has played any part in the connection. For more information, see “inetd
Daemon” on page 164.
The server dissociates from the controlling terminal of its invoker unless the server is operating
in DEBUG mode.
(void) close(0);
(void) close(1);
(void) close(2);
(void) open("/", O_RDONLY);
(void) dup2(0, 1);
(void) dup2(0, 2);
setsid();
Dissociating prevents the server from receiving signals from the process group of the
controlling terminal. After a server has dissociated from the controlling terminal, the server
cannot send reports of errors to the terminal. The dissociated server must log errors with
syslog. For more information, see the syslog(3C) man page.
The server gets its service definition by calling getaddrinfo. For more information, see the
getaddrinfo(3C) man page.
The result, which is returned in api, contains the Internet port at which the program listens for
service requests. Some standard port numbers are defined in /usr/include/netinet/in.h.
The server then creates a socket, and listens for service requests. The bind routine ensures that
the server listens at the expected location. Because the remote login server listens at a restricted
port number, the server runs as superuser. The main body of the server is the following loop.
accept blocks messages until a client requests service. accept also returns a failure indication
if accept is interrupted by a signal, such as SIGCHLD. The return value from accept is
checked, and an error is logged with syslog, if an error occurs. For more information, see the
accept(3C) and syslog(3C) man pages.
The server then forks a child process, and invokes the main body of the remote login protocol
processing. The socket used by the parent to queue connection requests is closed in the child.
The socket created by accept is closed in the parent. The address of the client is passed to the
server application's doit() routine, which authenticates the client.
getaddrinfo returns the head of a list of addresses in res. The desired address is found by
creating a socket and trying to connect to each address returned in the list until one works.
freeaddrinfo(res);
return (-1);
}
The socket has been created and has been connected to the desired service. The connect routine
implicitly binds sock, because sock is unbound.
Connectionless Servers
Some services use datagram sockets. The rwho service provides status information on hosts that
are connected to a local area network. Avoid running [Link] because [Link] causes heavy
network traffic. The rwho service broadcasts information to all hosts connected to a particular
network. The rwho service is an example of datagram socket use.
A user on a host that is running the rwho server can get the current status of another host with
ruptime. For more information, see the rwho(1), [Link](1M), and ruptime(1) man pages.
Status information is periodically broadcast by the rwho server processes on each host. The
server process also receives the status information. The server also updates a database. This
database is interpreted for the status of each host. Servers operate autonomously, coupled only
by the local network and its broadcast capabilities.
Use of broadcast is fairly inefficient because broadcast generates a lot of net traffic. Unless
the service is used widely and frequently, the expense of periodic broadcasts outweighs the
simplicity.
The following example shows a simplified version of the rwho server. The sample code receives
status information broadcast by other hosts on the network and supplies the status of the host
on which the sample code is running. The first task is done in the main loop of the program:
Packets received at the rwho port are checked to be sure they were sent by another rwho server
process and are stamped with the arrival time. The packets then update a file with the status
of the host. When a host has not been heard from for an extended time, the database routines
assume the host is down and logs this information. Because a server might be down while a host
is up, this application is prone to error.
main()
{
...
sp = getservbyname("who", "udp");
net = getnetbyname("localnet");
sin.sin6_addr = inet_makeaddr(net->n_net, in6addr_any);
sin.sin6_port = sp->s_port;
...
s = socket(AF_INET6, SOCK_DGRAM, 0);
...
on = 1;
if (setsockopt(s, SOL_SOCKET, SO_BROADCAST, &on, sizeof on)
== -1) {
syslog(LOG_ERR, "setsockopt SO_BROADCAST: %m");
exit(1);
}
bind(s, (struct sockaddr *) &sin, sizeof sin);
...
signal(SIGALRM, onalrm);
onalrm();
while(1) {
struct whod wd;
int cc, whod, len = sizeof from;
cc = recvfrom(s, (char *) &wd, sizeof(struct whod), 0,
(struct sockaddr *) &from, &len);
if (cc <= 0) {
if (cc == -1 && errno != EINTR)
syslog(LOG_ERR, "rwhod: recv: %m");
continue;
}
if (from.sin6_port != sp->s_port) {
syslog(LOG_ERR, "rwhod: %d: bad from port",
ntohs(from.sin6_port));
continue;
}
...
if (!verify( wd.wd_hostname)) {
syslog(LOG_ERR, "rwhod: bad host name from %x",
ntohl(from.sin6_addr.s6_addr));
continue;
}
(void) sn
printf(path, sizeof(PATH),
|O_NOFOLLOW, 0666);
...
(void) time(&wd.wd_recvtime);
(void) write(whod, (char *) &wd, cc);
(void) close(whod);
}
exit(0);
}
The second server task is to supply the status of its host. This requires periodically acquiring
system status information, packaging it in a message, and broadcasting it on the local network
for other rwho servers to hear. This task is run by a timer. This task is triggered by a signal.
Status information is broadcast on the local network. For networks that do not support
broadcast, use multicast.
Out-of-Band Data
The stream socket abstraction includes out-of-band data. Out-of-band data is a logically
independent transmission channel between a pair of connected stream sockets. Out-of-band
data is delivered independent of normal data. The out-of-band data facilities must support the
reliable delivery of at least one out-of-band message at a time. This message can contain at least
one byte of data. At least one message can be pending delivery at any time.
With in-band signaling, urgent data is delivered in sequence with normal data, and the message
is extracted from the normal data stream. The extracted message is stored separately. Users
can choose between receiving the urgent data in order and receiving the data out of sequence,
without having to buffer the intervening data.
Using MSG_PEEK, you can peek at out-of-band data. If the socket has a process group, a SIGURG
signal is generated when the protocol is notified of its existence. A process can set the process
group or process ID to deliver SIGURG to with the appropriate fcntl call, as described in
“Interrupt-Driven Socket I/O” on page 157 for SIGIO. If multiple sockets have out-of-band
data waiting for delivery, a select call for exceptional conditions can determine which sockets
have such data pending. For more information, see the fcntl(2) and select(3C) man pages.
A logical mark is placed in the data stream at the point at which the out-of-band data was sent.
The remote login and remote shell applications use this facility to propagate signals between
client and server processes. When a signal is received, all data up to the mark in the data stream
is discarded.
To send an out-of-band message, apply the MSG_OOB flag to send or sendto. To receive out-of-
band data, specify MSG_OOB to recvfrom or recv. If out-of-band data is taken in line the MSG_OOB
flag is not needed. For more information, see the send(3C), sendto(3C), recvfrom(3C), and
recv(3C) man pages.
The SIOCATMARK ioctl(2) indicates whether the read pointer currently points at the mark in the
data stream.
int yes;
ioctl(s, SIOCATMARK, &yes);
If yes is 1 on return, the next read returns data after the mark. Otherwise, assuming out-of-band
data has arrived, the next read provides data sent by the client before sending the out-of-band
signal. The routine in the remote login process that flushes output on receipt of an interrupt or
quit signal is shown in the following example. This code reads the normal data up to the mark
to discard the normal data, then reads the out-of-band byte.
A process can also read or peek at the out-of-band data without first reading up to the mark.
Accessing this data when the underlying protocol delivers the urgent data in-band with the
normal data, and sends notification of its presence only ahead of time, is more difficult. An
example of this type of protocol is TCP, the protocol used to provide socket streams in the
Internet family. With such protocols, the out-of-band byte might not yet have arrived when recv
is called with the MSG_OOB flag. In that case, the call returns the error of EWOULDBLOCK. Also, the
amount of in-band data in the input buffer might cause normal flow control to prevent the peer
from sending the urgent data until the buffer is cleared. The process must then read enough of
the queued data to clear the input buffer before the peer can send the urgent data.
#include <sys/ioctl.h>
#include <sys/file.h>
...
oob()
{
int out = FWRITE;
char waste[BUFSIZ];
int mark = 0;
A facility to retain the position of urgent in-line data in the socket stream is available as a
socket-level option, SO_OOBINLINE. For more information, see the getsockopt(3C) man page.
With this socket-level option, the position of urgent data remains. However, the urgent data
immediately following the mark in the normal data stream is returned without the MSG_OOB flag.
Reception of multiple urgent indications moves the mark, but does not lose any out-of-band
data.
Nonblocking Sockets
Some applications require sockets that do not block. For example, a server would return an
error code, not executing a request that cannot complete immediately. This error could cause the
process to be suspended, awaiting completion. After creating and connecting a socket, issuing a
fcntl(2) call, as shown in the following example, makes the socket nonblocking.
#include <fcntl.h>
#include <sys/file.h>
...
int fileflags;
int s;
...
s = socket(AF_INET6, SOCK_STREAM, 0);
...
if (fileflags = fcntl(s, F_GETFL, 0) == -1) {
perror("fcntl F_GETFL");
exit(1);
}
if (fcntl(s, F_SETFL, fileflags | FNDELAY) == -1) {
perror("fcntl F_SETFL, FNDELAY");
exit(1);
}
When performing I/O on a nonblocking socket, check for the error EWOULDBLOCK in errno.h,
which occurs when an operation would normally block. accept, connect, send, recv, read,
and write can all return EWOULDBLOCK. If an operation such as a send cannot be done in its
entirety but partial writes work, as when using a stream socket, all available data is processed.
The return value is the amount of data actually sent. For more information, see the accept(3C),
connect(3C), send(3C), read(2), write(2), and recv(3C) man pages.
#include <fcntl.h>
#include <sys/file.h>
...
int fileflags;
int s;
...
s = socket(AF_INET6, SOCK_STREAM, 0);
...
if (fileflags = fcntl(s, F_GETFL ) == -1) {
perror("fcntl F_GETFL");
exit(1);
}
if (fcntl(s, F_SETFL, fileflags | FNDELAY | FASYNC) == -1) {
perror("fcntl F_SETFL, FNDELAY | FASYNC");
exit(1);
}
After sockets are initialized, connected, and configured as nonblocking and asynchronous,
communication is similar to reading and writing a file asynchronously. Initiate a data transfer by
using send, write, recv, or read. For more information, see the send(3C), write(2), recv(3C),
and read(2) man pages. A signal-driven I/O routine completes a data transfer, as described in
the next section.
1. Set up a SIGIO signal handler with the signal or sigvec calls. For more information, see
the signal(3C) man page.
2. Use fcntl to set the process ID or process group ID to route the signal to its own process
ID or process group ID. The default process group of a socket is group 0. For more
information, see the fcntl(2) man page.
3. Convert the socket to asynchronous, as shown in “Asynchronous Socket I/
O” on page 156.
The following sample code enables receipt of information on pending requests as the requests
occur for a socket by a given process. With the addition of a handler for SIGURG, this code can
also be used to prepare for receipt of SIGURG signals.
#include <fcntl.h>
#include <sys/file.h>
...
signal(SIGIO, io_handler);
/* Set the process receiving SIGIO/SIGURG signals to us. */
if (fcntl(s, F_SETOWN, getpid()) < 0) {
perror("fcntl F_SETOWN");
exit(1);
}
You can also enable reception of SIGURG and SIGIO by using ioctl to assign the socket to the
user's process group. For more information, see the ioctl(2) man page.
If the third argument of the socket call is 0, socket selects a default protocol to use with the
returned socket of the type requested. The default protocol is usually correct, and alternate
choices are not usually available. When using raw sockets to communicate directly with lower-
level protocols or lower-level hardware interfaces, set up de-multiplexing with the protocol
argument. For more information, see the socket(3C) man page.
Using raw sockets in the Internet family to implement a new protocol on IP ensures that
the socket only receives packets for the specified protocol. To obtain a particular protocol,
determine the protocol number as defined in the protocol family. For the Internet family, use
one of the library routines that are discussed in “Standard Routines” on page 143, such as
getprotobyname.
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <netdb.h>
...
pp = getprotobyname("newtcp");
s = socket(AF_INET6, SOCK_STREAM, pp->p_proto);
Address Binding
TCP requires these 4-tuples to be unique. UDP does not. User programs do not always know
proper values to use for the local address and local port, because a host can reside on multiple
networks. The set of allocated port numbers is not directly accessible to a user. To avoid
these problems, leave parts of the address unspecified and let the system assign the parts
appropriately when needed. Various portions of these tuples can be specified by various parts of
the sockets API:
bind Local address or local port or both. For more information, see
the bind(3C) man page.
connect Foreign address and foreign port. For more information, see
the connect(3C) man page.
A call to accept retrieves connection information from a foreign client. This causes the local
address and port to be specified to the system even though the caller of accept did not specify
anything. The foreign address and foreign port are returned.
A call to listen can cause a local port to be chosen. If no explicit bind has been done to assign
local information, listen assigns an ephemeral port number.
A service that resides at a particular port can bind to that port. Such a service can leave the
local address unspecified if the service does not require local address information. The local
address is set to in6addr_any, a variable with a constant value in <netinet/in.h>. If the
local port does not need to be fixed, a call to listen causes a port to be chosen. Specifying
an address of in6addr_any or a port number of 0 is known as wildcarding. For AF_INET,
INADDR_ANY is used in place of in6addr_any. For more information, see the bind(3C) and
listen(3C) man pages.
The wildcard address simplifies local address binding in the Internet family. The following
sample code binds a specific port number that was returned by a call to getaddrinfo to a socket
and leaves the local address unspecified:
#include <sys/types.h>
#include <netinet/in.h>
...
struct addrinfo *aip;
...
if (bind(sock, aip->ai_addr, aip->ai_addrlen) == -1) {
perror("bind");
(void) close(sock);
return (-1);
}
Each network interface on a host typically has a unique IP address. Sockets with wildcard local
addresses can receive messages that are directed to the specified port number. Messages that are
sent to any of the possible addresses that are assigned to a host are also received by sockets with
wildcard local addresses. To allow only hosts on a specific network to connect to the server, a
server binds the address of the interface on the appropriate network.
Similarly, a local port number can be left unspecified, in which case the system selects a port
number. For example, to bind a specific local address to a socket, but to leave the local port
number unspecified, you could use bind as follows:
The system uses two criteria to select the local port number:
■ Internet port numbers less than 1024 (IPPORT_RESERVED) are reserved for privileged users.
Nonprivileged users can use any Internet port number that is greater than 1024. The largest
Internet port number is 65535.
■ The port number is not currently bound to some other socket.
The port number and IP address of the client are found through accept or getpeername. For
more information, see the accept(3C) and getpeername(3C) man pages.
In certain cases, the algorithm used by the system to select port numbers is unsuitable for an
application due to the two-step creation process for associations. For example, the Internet file
transfer protocol specifies that data connections must always originate from the same local port.
Duplicate associations are avoided by connecting to different foreign ports. In this situation, the
system would disallow binding the same local address and local port number to a socket if a
previous data connection's socket still existed.
To override the default port selection algorithm, you must perform an option call before address
binding:
int on = 1;
...
setsockopt(s, SOL_SOCKET, SO_REUSEADDR, &on, sizeof on);
bind(s, (struct sockaddr *) &sin, sizeof sin);
With this call, local addresses already in use can be bound. This binding does not violate the
uniqueness requirement. The system still verifies at connect time that any other sockets with the
same local address and local port do not have the same foreign address and foreign port. If the
association already exists, the error EADDRINUSE is returned.
Socket Options
You can set and get several options on sockets through setsockopt and getsockopt. For
example, you can change the send or receive buffer space. For more information, see the
setsockopt(3C) and getsockopt(3C) man pages.
The operating system can adjust the values appropriately at any time.
The arguments of setsockopt and getsockopt calls are in the following list:
For getsockopt, optlen is a value-result argument. This argument is initially set to the size
of the storage area pointed to by optval. On return, the argument's value is set to the length of
storage used.
When a program needs to determine an existing socket's type, the program should invoke inetd
by using the SO_TYPE socket option and the getsockopt call:
#include <sys/types.h>
#include <sys/socket.h>
After getsockopt, type is set to the value of the socket type, as defined in sys/socket.h. For a
datagram socket, type would be SOCK_DGRAM.
Starting with the Oracle Solaris 11.2 release, you can use the SO_FLOW_SLA option to set the
service-level properties for the socket. A socket application using the SO_FLOW_SLA socket
option causes the system to create a system flow, which is an enforcement mechanism
for the service-level properties. You can use flowadm to observe the system flows. For
more information, see the flowadm(1M) man page. These system flows have the prefix
<id>.[Link].
The pfiles prints the SO_FLOW_SLA socket option with other socket options. For more
information, see the pfiles(1) man page.
Note - You can set the socket level properties only for TCP and UDP sockets.
#include <sys/types.h>
#include <sys/socket.h>
int fd;
mac_flow_props_t mprop;
mac_flow_props_t mprop_result;
mprop.mfp_version = MAC_FLOW_PROP_VERSION1;
mprop.mfp_mask = MFP_MAXBW | MFP_PRIORITY;
mprop.mfp_priority = MFP_PRIO_HIGH;
mprop.mfp_maxbw = 100000000; /* in bits per second */
setsockopt(fd, SOL_SOCKET, SO_FLOW_SLA, &mprop, sizeof (mprop));
In the example, the TCP client socket is created along with the system flow. The flow is set to a
high priority and the maximum bandwidth is set to 100Mbps.
The system flow is created for the socket by calling connect() or accept() functions
after setsockopt. If either accept() or connect() function is already called, setting
SO_FLOW_SLA will create a flow. Properties of the flow are set according to the values specified
in mac_flow_props_t structure. This structure is passed as a pointer to setsockopt as an
optval argument. You can know the status of the flow creation by using getsockopt. The
status is stored in the mprop_result.mfp_status field. The mac_flow_props_t structure is
defined as follows.
#define MAC_FLOW_PROP_VERSION1
mfp_mask Denotes the bit mask values. The following bit mask values are valid.
■ MRP_MAXBW
■ MRP_PRIORITY
mfp_priority Denotes the priority of processing the packets that belong to the socket.
The following priority values are valid.
■ MFP_PRIO_NORMAL
■ MFP_PRIO_HIGH
mfp_maxbw Denotes the maximum bandwidth allotted to the socket in bits per
second. Value of 0 means all the packets of socket must be dropped.
mfp_status Denotes the status of the flow creation. You can obtain the status of flow
creation by calling getsockopt. getsockopt sets the mfp_status field. A
value of 0 means a flow is successfully created. In case of an error, this
field is set to one of the following error codes.
■ EPERM: No Privilege.
inetd Daemon
The inetd daemon is invoked at startup time and is now configured by using smf. The
configuration was previously performed by /etc/inet/[Link] file. For more information,
see the inetd(1M), and smf(7) man pages.
Use inetconv to convert the configuration file content into SMF format services, and
then manage these services using inetadm and svcadm. For more information, see the
inetconv(1M), inetadm(1M) and svcadm(1M) man pages.
The inetd daemon polls each socket, waiting for a connection request to the service
corresponding to that socket. For SOCK_STREAM type sockets, inetd accepts using accept on
the listening socket, forks using fork, duplicates using dup the new socket to file descriptors
0 and 1 (stdin and stdout), closes other open file descriptors, and executes using exec the
appropriate server. For more information, see the accept(3C), fork(2), dup(2), and exec(2) man
page.
The primary benefit of using inetd is that services not in use do not consume system resources.
A secondary benefit is that inetd does most of the work to establish a connection. The server
started by inetd has the socket connected to its client on file descriptors 0 and 1. The server can
immediately read, write, send, or receive. Servers can use buffered I/O as provided by the stdio
conventions, as long as the servers use fflush when appropriate. For more information, see the
fflush(3C) man page.
The getpeername routine returns the address of the peer (process) connected to a socket.
This routine is useful in servers started by inetd. For example, you could use this routine to
log the Internet address such as fec0::56:a00:20ff:fe7d:3dd2, which is conventional for
representing the IPv6 address of a client. An inetd server could use the following sample code:
}
syslog("Connection from %s\n", abuf);
}
Messages sent by datagram sockets can be broadcast to reach all of the hosts on an attached
network. The network must support broadcast because the system provides no simulation
of broadcast in software. Broadcast messages can place a high load on a network because
broadcast messages force every host on the network to service the broadcast messages.
Broadcasting is usually used for either of two reasons:
■ To find a resource on a local network without having its address
■ For functions that require information to be sent to all accessible neighbors
sin.sin_family = AF_INET;
sin.sin_addr.s_addr = htonl(INADDR_ANY);
sin.sin_port = htons(MYPORT);
bind(s, (struct sockaddr *) &sin, sizeof sin);
The datagram can be broadcast on only one network by sending to the network's broadcast
address. A datagram can also be broadcast on all attached networks by sending to the special
address INADDR_BROADCAST, which is defined in netinet/in.h.
The system provides a mechanism to determine a number of pieces of information about the
network interfaces on the system. This information includes the IP address and broadcast
address. The SIOCGIFCONF ioctl call returns the interface configuration of a host in a single
ifconf structure. This structure contains an array of ifreq structures. Every address family
supported by every network interface to which the host is connected has its own ifreq
structure. For more information, see the ioctl(2) man page.
struct ifreq {
#define IFNAMSIZ 16
char ifr_name[IFNAMSIZ]; /* if name, e.g., "en0" */
union {
After this call, buf contains an array of ifreq structures. Every network to which the host
connects has an associated ifreq structure. The sort order these structures appear in is:
■ Alphabetical by interface name
The value of ifc.ifc_len is set to the number of bytes used by the ifreq structures.
Each structure has a set of interface flags that indicate whether the corresponding network is up
or down, point-to-point or broadcast, and so on. The following example shows ioctl returning
the SIOCGIFFLAGS flags for an interface specified by an ifreq structure.
The following example uses the SIOGGIFBRDADDR ioctl command to obtain the broadcast
address of an interface.
You can also use SIOGGIFBRDADDR ioctl to get the destination address of a point-to-point
interface. For more information, see the ioctl(2) man page.
After the interface broadcast address is obtained, transmit the broadcast datagram with sendto:
Use one sendto for each interface to which the host is connected, if that interface supports the
broadcast or point-to-point addressing. For more information, see the sendto(3C) man page.
Using Multicast
IP multicasting is supported only on AF_INET6 and AF_INET sockets of type SOCK_DGRAM and
SOCK_RAW. IP multicasting is only supported on subnetworks for which the interface driver
supports multicasting.
By default, IP multicast datagrams are sent with a time-to-live (TTL) of 1. This value
prevents the datagrams from being forwarded beyond a single subnetwork. The socket option
IP_MULTICAST_TTL allows the TTL for subsequent multicast datagrams to be set to any value
from 0 to 255. This ability is used to control the scope of the multicasts.
u_char ttl;
setsockopt(sock, IPPROTO_IP, IP_MULTICAST_TTL, &ttl,sizeof(ttl))
Multicast datagrams with a TTL of 0 are not transmitted on any subnet, but can be delivered
locally if the sending host belongs to the destination group and if multicast loopback has not
been disabled on the sending socket. Multicast datagrams with a TTL greater than one can be
delivered to more than one subnet if one or more multicast routers are attached to the first-hop
subnet. To provide meaningful scope control, the multicast routers support the notion of TTL
thresholds. These thresholds prevent datagrams with less than a certain TTL from traversing
certain subnets. The thresholds enforce the conventions for multicast datagrams with initial
TTL values as follows:
Sites and regions are not strictly defined and sites can be subdivided into smaller administrative
units as a local matter.
An application can choose an initial TTL other than the ones previously listed. For example,
an application might perform an expanding-ring search for a network resource by sending
a multicast query, first with a TTL of 0 and then with larger and larger TTLs until a reply is
received.
The multicast router does not forward any multicast datagram with a destination address
between [Link] and [Link] inclusive, regardless of its TTL. This range of addresses is
reserved for the use of routing protocols and other low-level topology discovery or maintenance
protocols, such as gateway discovery and group membership reporting.
Each multicast transmission is sent from a single network interface, even if the host has more
than one multicast-capable interface. If the host is also a multicast router and the TTL is greater
than 1, a multicast can be forwarded to interfaces other than the originating interface. A socket
option is available to override the default for subsequent transmissions from a given socket:
where addr is the local IP address of the desired outgoing interface. Revert to the default
interface by specifying the address INADDR_ANY. The local IP address of an interface is obtained
with the SIOCGIFCONF ioctl. To determine if an interface supports multicasting, fetch the
interface flags with the SIOCGIFFLAGS ioctl and test if the IFF_MULTICAST flag is set. This
option is intended primarily for multicast routers and other system services specifically
concerned with Internet topology.
If a multicast datagram is sent to a group to which the sending host itself belongs, a copy of the
datagram is, by default, looped back by the IP layer for local delivery. Another socket option
gives the sender explicit control over whether subsequent datagrams are looped back:
u_char loop;
setsockopt(sock, IPPROTO_IP, IP_MULTICAST_LOOP, &loop, sizeof(loop))
where loop is 0 to disable loopback and 1 to enable loopback. This option provides a
performance benefit for applications that have only one instance on a single host by eliminating
the overhead of receiving their own transmissions. Applications that can have more than one
instance on a single host, or for which the sender does not belong to the destination group,
should not use this option.
If the sending host belongs to the destination group on another interface, a multicast datagram
sent with an initial TTL greater than 1 can be delivered to the sending host on the other
interface. The loopback control option has no effect on such delivery.
Each membership is associated with a single interface. You can join the same group on more
than one interface. Specify the imr_interface address as INADDR_ANY to choose the default
multicast interface. You can also specify one of the host's local addresses to choose a particular
multicast-capable interface.
where mreq contains the same values used to add the membership. Closing a socket or killing
the process that holds the socket drops the memberships associated with that socket. More than
one socket can claim a membership in a particular group, and the host remains a member of that
group until the last claim is dropped.
If any socket claims membership in the destination group of the datagram, the kernel IP layer
accepts incoming multicast packets. A given socket's receipt of a multicast datagram depends
on the socket's associated destination port and memberships, or the protocol type for raw
sockets. To receive multicast datagrams sent to a particular port, bind to the local port, leaving
the local address unspecified, such as INADDR_ANY.
More than one process can bind to the same SOCK_DGRAM UDP port if the bind is preceded by:
int one = 1;
setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &one, sizeof(one))
In this case, every incoming multicast or broadcast UDP datagram destined for the shared port
is delivered to all sockets bound to the port. For backwards compatibility reasons, this delivery
does not apply to incoming unicast datagrams. Unicast datagrams are never delivered to more
than one socket, regardless of how many sockets are bound to the datagram's destination port.
SOCK_RAW sockets do not require the SO_REUSEADDR option to share a single IP protocol type.
The definitions required for the new, multicast-related socket options are found in <netinet/
in.h>. All IP addresses are passed in network byte-order.
By default, IP multicast datagrams are sent with a hop limit of one, which prevents
the datagrams from being forwarded beyond a single subnetwork. The socket option
IPV6_MULTICAST_HOPS allows the hop limit for subsequent multicast datagrams to be set to any
value from 0 to 255. This ability is used to control the scope of the multicasts:
uint_l;
setsockopt(sock, IPPROTO_IPV6, IPV6_MULTICAST_HOPS, &hops,sizeof(hops))
You cannot transmit multicast datagrams with a hop limit of zero on any subnet, but you can
deliver the datagrams locally if:
■ The sending host belongs to the destination group
■ Multicast loopback on the sending socket is enabled
You can deliver multicast datagrams with a hop limit that is greater than one to more than one
subnet if the first-hop subnet attaches to one or more multicast routers. The IPv6 multicast
addresses, unlike their IPv4 counterparts, contain explicit scope information that is encoded in
the first part of the address. The defined scopes are, where X is unspecified:
An application can, separately from the scope of the multicast address, use different hop limit
values. For example, an application might perform an expanding-ring search for a network
resource by sending a multicast query, first with a hop limit of 0, and then with larger and larger
hop limits, until a reply is received.
Each multicast transmission is sent from a single network interface, even if the host has more
than one multicast-capable interface. If the host is also a multicast router, and the hop limit is
greater than 1, a multicast can be forwarded to interfaces other than the originating interface.
A socket option is available to override the default for subsequent transmissions from a given
socket:
uint_t ifindex;
ifindex = if_nametoindex ("hme3");
setsockopt(sock, IPPROTO_IPV6, IPV6_MULTICAST_IF, &ifindex, sizeof(ifindex))
where ifindex is the interface index for the desired outgoing interface. Revert to the default
interface by specifying the value 0.
If a multicast datagram is sent to a group to which the sending host itself belongs, a copy of the
datagram is, by default, looped back by the IP layer for local delivery. Another socket option
gives the sender explicit control over whether to loop back subsequent datagrams:
uint_t loop;
setsockopt(sock, IPPROTO_IPV6, IPV6_MULTICAST_LOOP, &loop, sizeof(loop))
where loop is zero to disable loopback and one to enable loopback. This option provides a
performance benefit for applications that have only one instance on a single host (such as a
router or a mail demon), by eliminating the overhead of receiving their own transmissions.
Applications that can have more than one instance on a single host (such as a conferencing
program) or for which the sender does not belong to the destination group (such as a time
querying program) should not use this option.
If the sending host belongs to the destination group on another interface, a multicast datagram
sent with an initial hop limit greater than 1 can be delivered to the sending host on the other
interface. The loopback control option has no effect on such delivery.
struct ipv6_mreq {
struct in6_addr ipv6mr_multiaddr; /* IPv6 multicast addr */
unsigned int ipv6mr_interface; /* interface index */
}
Each membership is associated with a single interface. You can join the same group on more
than one interface. Specify ipv6_interface to be 0 to choose the default multicast interface.
Specify an interface index for one of the host's interfaces to choose that multicast-capable
interface.
where mreq contains the same values used to add the membership. The socket drops associated
memberships when the socket is closed, or when the process that holds the socket is killed.
More than one socket can claim a membership in a particular group. The host remains a
member of that group until the last claim is dropped.
The kernel IP layer accepts incoming multicast packets if any socket has claimed a membership
in the destination group of the datagram. Delivery of a multicast datagram to a particular socket
is determined by the destination port and the memberships associated with the socket, or by the
protocol type for raw sockets. To receive multicast datagrams sent to a particular port, bind to
the local port, leaving the local address unspecified, such as INADDR_ANY.
More than one process can bind to the same SOCK_DGRAM UDP port if the bind is preceded by:
int one = 1;
setsockopt(sock, SOL_SOCKET, SO_REUSEADDR, &one, sizeof(one))
In this case, all sockets that are bound to the port receive every incoming multicast UDP
datagram destined to the shared port. For backward compatibility reasons, this delivery does not
apply to incoming unicast datagrams. Unicast datagrams are never delivered to more than one
socket, regardless of how many sockets are bound to the datagram's destination port. SOCK_RAW
sockets do not require the SO_REUSEADDR option to share a single IP protocol type.
The definitions required for the new, multicast-related socket options are found in <netinet/
in.h>. All IP addresses are passed in network byte-order.
An SCTP association is set up between two endpoints. The endpoints use a four-way handshake
mechanism that uses a cookie to guard against some types of denial-of-service (DoS) attacks.
The endpoints can be represented by multiple IP addresses.
Note - The Oracle Solaris 11 implementation of the TSVWG SCTP socket API is based on a
version of the API draft that was published at the time when Oracle Solaris 11 was first shipped.
socket()();
In a one-to-many socket model, each socket handles multiple SCTP associations. Each
association has an association identifier called sctp_assoc_t. Create a one-to-many socket by
calling this function:
socket()();
sctp_bindx() Function
int sctp_bindx()(sock*addrsaddrcntflags);
The sctp_bindx() function manages addresses on an SCTP socket. If the sock parameter is an
IPv4 socket, the addresses passed to the sctp_bindx() function must be IPv4 addresses.
If the sock parameter is an IPv6 socket, the addresses passed to the sctp_bindx() function can
be either IPv4 (in IPv4–mapped address format) or IPv6 addresses. When the address that is
passed to the sctp_bindx() function is INADDR_ANY or IN6ADDR_ANY, the socket binds to all
available addresses. Bind the SCTP endpoint with the bind.
If the addresses are IPv6 addresses, they are contained in sockaddr_in6 structures. The address
type's family distinguishes the address length. The caller specifies the number of addresses in
the array with the addrcnt parameter.
If the same port is not given for each socket address, the sctp_bindx() function fails and sets
the value of errno to EINVAL.
The flags parameter is formed from performing the bitwise OR operation on zero or more of
the following currently defined flags:
■ SCTP_BINDX_ADD_ADDR
■ SCTP_BINDX_REM_ADDR
The caller should add or remove addresses one at a time. If an error occurs, and a list of
addresses has been used, it is not possible for the caller to find the address that caused the error.
Adding or removing addresses one at a time helps the caller resolve this issue.
A caller may not remove all addresses from an association. The sctp_bindx() function
rejects such an attempt by failing and setting the value of errno to EINVAL. An application
can use sctp_bindx(SCTP_BINDX_ADD_ADDR) to associate additional addresses with
an endpoint after calling the bind() function. An application can use sctp_bindx
(SCTP_BINDX_REM_ADDR) to remove addresses associated with a listening socket. After
using sctp_bindx(SCTP_BINDX_REM_ADDR) to remove addresses, accepting new associations
will not reassociate the removed address. If the endpoint supports dynamic address, using
SCTP_BINDX_REM_ADDR or SCTP_BINDX_ADD_ADDR sends a message to the peer to change the
peer's address lists. Adding and removing addresses from a connected association is optional
functionality. Implementations that do not support this functionality return EOPNOTSUPP.
If the address family is not AF_INET or AF_INET6, the sctp_bindx() function fails and returns
EAFNOSUPPORT. If the file descriptor passed to the sctp_bindx() in the sock parameter is
invalid, the sctp_bindx() function fails and returns EBADF.
sctp_opt_info() Function
int sctp_opt_info()(sockidopt*arg*len);
int sock, sctp_assoc_id_t id, int opt, void *arg, socklen_t *len;
The sctp_opt_info() function returns the SCTP level options that are associated with the
socket described in the sock parameter. If the socket is a one-to-many SCTP socket model the
value of the id parameter refers to a specific association. The id parameter is ignored for one-
to-one SCTP sockets. The value of the opt parameter specifies the SCTP socket option to get.
The value of the arg parameter is an option-specific structure buffer that is allocated by the
calling program. The value of the *len parameter is the length of the option.
■ SCTP_PEER_ADDR_PARAMS
■ SCTP_STATUS
■ SCTP_INITMSG
■ SCTP_NODELAY
■ SCTP_AUTOCLOSE
■ SCTP_PRIMARY_ADDR
■ SCTP_GET_PEER_ADDR_INFO
■ SCTP_EVENT
■ SCTP_DELAYED_SACK
■ SCTP_PARTIAL_DELIVERY_POINT
■ SCTP_FRAGMENT_INTERLEAVE
■ SCTP_MAX_BURST
■ SCTP_CONTEXT
■ SCTP_EXPLICIT_EOR
■ SCTP_REUSE_PORT
■ SCTP_RECVRVCINFO
■ SCTP_RECVNXTINFO
■ SCTP_DEFAULT_SNDINFO
■ SCTP_GETASSOC_NUMBER
■ SCTP_GET_ASSOC_ID_LIST
SCTP_RTOINFO Returns the protocol parameters that are used to initialize and bind the
retransmission timeout (RTO) tunable. The protocol parameters use the
following structure:
struct sctp_rtoinfo {
sctp_assoc_t srto_assoc_id;
uint32_t srto_initial;
uint32_t srto_max;
uint32_t srto_min;
};
sasoc_assoc_id
The calling program provides this value, which specifies the
association of interest.
sasoc_assocmaxrxt
This value specifies the maximum retransmission count for the
association.
sasoc_number_peer_destinations
This value specifies the number of addresses that the peer has.
sasoc_peer_rwnd
This value specifies the current value of the peer's receive window.
sasoc_local_rwnd
This value specifies the last reported receive window that the peer
transmitted to.
sasoc_cookie_life
The value specifies the lifetime of the association's cookie. The
value is used when issuing cookies.
All parameters that use time values are measured in milliseconds.
Returns the default set of parameters that a call to the sendto function
SCTP_DEFAULT_SEND_PARAM
uses on this association. For more information, see the sendto(3C) man
page. The parameters use the following structure:
struct sctp_sndrcvinfo {
uint16_t sinfo_stream;
uint16_t sinfo_ssn;
uint16_t sinfo_flags;
uint32_t sinfo_ppid;
uint32_t sinfo_context;
uint32_t sinfo_timetolive;
uint32_t sinfo_tsn;
uint32_t sinfo_cumtsn;
sctp_assoc_t sinfo_assoc_id;
};
sinfo_stream
This value specifies the default stream for the sendmsg() call.
sinfo_ssn
This value is always zero.
sinfo_flags This value contains the default flags for the sendmsg() call. This flag can
take on the following values:
■ MSG_UNORDERED
■ MSG_ADDR_OVER
■ MSG_ABORT
■ MSG_EOF
■ MSG_PR_SCTP
sinfo_ppid This value is the default payload protocol identifier for the sendmsg()
call.
sinfo_context This value is the default context for the sendmsg() call.
sinfo_timetolive This value specifies a time period in milliseconds. After this time
period has passed, the message expires if its transmission has not
begun. A value of zero indicates that the message does not expire. If
the MSG_PR_SCTP flag is set, the message expires when its transmission
has not successfully completed within the time period specified in
sinfo_timetolive.
sinfo_assoc_id This value is filled in by the calling application. This value specifies the
association of interest.
SCTP_PEER_ADDR_PARAMSReturns the parameters for a specified peer address. The parameters use
the following structure:
struct sctp_paddrparams {
sctp_assoc_t spp_assoc_id;
struct sockaddr_storage spp_address;
uint32_t spp_hbinterval;
uint16_t spp_pathmaxrxt;
uint32_t spp_pathmtu;
uint32_t spp_flags;
uint32_t spp_ipv6_flowlabel;
uint8_t spp_ipv4_tos;
};
spp_assoc_id
The calling program provides this value, which specifies the
association of interest.
spp_address
This value specifies the peer's address of interest.
spp_hbinterval
This value specifies the heartbeat interval in milliseconds.
spp_pathmaxrxt
This value specifies the maximum number of retransmissions to
attempt on an address before considering the address unreachable.
spp_pathmtu
The current path MTU of the peer address. It is the number of bytes
available in an SCTP packet for chunks. Providing a value of 0 does
not change the current setting. If a positive value is provided and
SPP_PMTUD_DISABLE is set in the spp_flags, the given value is used
as the path MTU. If SPP_PMTUD_ENABLE is set in the spp_flags, then
the spp_pathmtu field is ignored.
spp_ipv6_flowlabel
This field is used in conjunction with the SPP_IPV6_FLOWLABEL flag.
This setting has precedence over any other IPv6 layer setting.
spp_flags
The spp_flags flags are used to control various features on an
association. The flag field is a bit mask which may contain one of
the following options:
■ SPP_HB_ENABLE – Enable heartbeats on the specified address.
■ SPP_HB_DISABLE – Disable heartbeats on the specified address.
SPP_HB_ENABLE and SPP_HB_DISABLE are mutually exclusive,
only one of the two should be specified. Enabling both fields will
result in undetermined results.
■ SPP_HB_DEMAND – Request a user initiated heartbeat to be made
immediately. This option should not be used in conjunction with
a wildcard address.
■ SPP_HB_TIME_IS_ZERO – Specifies that the time for heartbeat
delay is to be set to the value of 0 milliseconds.
■ SPP_PMTUD_ENABLE – Enable PMTU discovery on the specified
address.
■ SPP_PMTUD_DISABLE – Disable PMTU discovery on the
specified address. If the address field is empty then all addresses
on the association are affected. SPP_PMTUD_ENABLE and
SPP_PMTUD_DISABLE options are mutually exclusive. Enabling
both options will result in undetermined results.
■ SPP_IPV6_FLOWLABEL – Enables the setting of the IPV6 flowlabel
value. The value is obtained from the spp_ipv6_flowlabel
field. Upon retrieval, this flag will be set to indicate that the
ipv6_flowlabel field has a valid value returned. If a specific
destination address is set in the spp_address field, then the value
of the address is returned. If only an association is specified and
no address is specified, then the association's default flowlabel is
returned. If neither an association nor a destination is specified,
then the socket's default flowlabel is returned. For non– IPv6
sockets, this flag is left empty.
■ SPP_IPV4_TOS – Setting this flag enables the setting of the
IPV4 TOS value associated with either the association or a
specific address. The value is obtained from the spp_ipv4_tos
field. Upon retrieval, this flag will be set to indicate that the
spp_ipv4_tos field has a valid value returned. If a specific
destination address in the spp_address field is set when called,
then the TOS value of the specific destination address returned.
If only an association is specified then the default TOS of the
SCTP_STATUS Returns the current status information about the association. The
parameters use the following structure:
struct sctp_status {
sctp_assoc_t sstat_assoc_id;
int32_t sstat_state;
uint32_t sstat_rwnd;
uint16_t sstat_unackdata;
uint16_t sstat_penddata;
uint16_t sstat_instrms;
uint16_t sstat_outstrms;
uint32_t sstat_fragmentation_point;
struct sctp_paddrinfo sstat_primary;
};
sstat_assoc_id
The calling program provides this value, which specifies the
association of interest.
sstat_state
This value is the association's current state. The association can take
on the following states:
sstat_rwnd
This value is the association peer's current receive window.
sstat_unackdata
This value is the number of unacknowledged DATA chunks.
sstat_penddata
This value is the number of DATA chunks that are awaiting receipt.
sstat_instrms
This value is the number of inbound streams.
sstat_outstrms
This value is the number of outbound streams.
sstat_fragmentation_point
If the combined size of the message, the SCTP headers, and the
IP headers exceeds the value of sstat_fragmentation_point,
the message fragments. This value is equal to the Path Maximum
Transmission Unit (P-MTU) for the packet's destination address
sstat_primary
This value contains information about the primary peer address. This
information uses the following structure:
struct sctp_paddrinfo {
sctp_assoc_t spinfo_assoc_id;
struct sockaddr_storage spinfo_address;
int32_t spinfo_state;
uint32_t spinfo_cwnd;
uint32_t spinfo_srtt;
uint32_t spinfo_rto;
uint32_t spinfo_mtu;
};
sctp_recvmsg() Function
ssize_t sctp_recvmsg()(s*msglen*from*fromlen*sinfo*msg_flags);
int s, void *msg, size_t len, struct sockaddr *from, socklen_t *fromlen, struct
sctp_sndrcvinfo *sinfo, int *msg_flags;
The sctp_recvmsg() function enables receipt of a message from the SCTP endpoint specified
by the s parameter. The calling program can specify the following attributes:
msg
This parameter is the address of the message buffer.
len
This parameter is the length of the message buffer.
from
This parameter is a pointer to an address that contains the sender's address.
fromlen
This parameter is the size of the buffer associated with the address in the from parameter.
sinfo
This parameter is only active if the calling program enables sctp_data_io_events. To
enable sctp_data_io_events, call the setsockopt() function with the socket option
SCTP_EVENTS. When sctp_data_io_events is enabled, the application receives the
contents of the sctp_sndrcvinfo structure for each incoming message. This parameter is
a pointer to a sctp_sndrcvinfo structure. The structure is populated upon receipt of the
message.
msg_flags
This parameter contains any message flags that are present.
The sctp_recvmsg() function returns the number of bytes it receives. The sctp_recvmsg()
function returns -1 when an error occurs.
If the file descriptor passed in the s parameter is not valid, the sctp_recvmsg() function
fails and sets the value of errno to EBADF. If the file descriptor passed in the s parameter
does not describe a socket, the sctp_recvmsg() function fails and sets the value of errno
to ENOTSOCK. If the msg_flags parameter includes the value MSG_OOB, the sctp_recvmsg()
function fails and sets the value of errno to EOPNOTSUPP. If there is no established association,
the sctp_recvmsg() function fails and sets the value of errno to ENOTCONN.
sctp_sendmsg() Function
ssize_t sctp_sendmsg()(s*msglen*totolenppidflagsstream_notimetolivecontext);
int s, const void *msg, size_t len, const struct sockaddr *to, socklen_t tolen,
uint32_t ppid, uint32_t flags, uint16_t stream_no, uint32_t timetolive, uint32_t
context;
The sctp_sendmsg() function enables advanced SCTP features while sending a message from
an SCTP endpoint.
s This value specifies the SCTP endpoint that is sending the message.
msg This value contains the message sent by the sctp_sendmsg() function.
len This value is the length of the message. This value is expressed in bytes.
timetolive This value is the time period after which the message expires if it
has not been successfully sent to the peer. This value is expressed in
milliseconds.
context This value is returned if an error occurs during the sending of the
message.
flags This value is formed from applying the logical operation OR in bitwise
fashion on zero or more of the following flag bits:
MSG_UNORDERED
When this flag is set, the sctp_sendmsg() function delivers the
message unordered.
MSG_ADDR_OVER
When this flag is set, the sctp_sendmsg() function uses the address
in the to parameter instead of the association's primary destination
address. This flag is only used with one-to-many SCTP sockets
model.
MSG_ABORT
When this flag is set, the specified association aborts by sending an
ABORT signal to its peer. This flag is only used with one-to-many
SCTP sockets model.
MSG_EOF
When this flag is set, the specified association enters graceful
shutdown. This flag is only used with one-to-many SCTP sockets
model.
MSG_PR_SCTP
When this flag is set, the message expires when its transmission has
not successfully completed within the time period specified in the
timetolive parameter.
The sctp_sendmsg() function returns the number of bytes it sent. The sctp_sendmsg()
function returns -1 when an error occurs.
If the file descriptor passed in the s parameter is not valid, the sctp_sendmsg() function fails
and sets the value of errno to EBADF. If the file descriptor passed in the s parameter does not
describe a socket, the sctp_sendmsg() function fails and sets the value of errno to ENOTSOCK.
If the flags parameter includes the value MSG_OOB, the sctp_sendmsg() function fails and sets
the value of errno to EOPNOTSUPP. If the flags parameter includes the values MSG_ABORT or
MSG_EOF for a one-to-one socket model, the sctp_sendmsg() function fails and sets the value
of errno to EOPNOTSUPP. If there is no established association, the sctp_sendmsg() function
fails and sets the value of errno to ENOTCONN. If the socket is shutting down, disallowing further
writes, the sctp_sendmsg() function fails and sets the value of errno to EPIPE. If the socket is
nonblocking and the transmit queue is full, the sctp_sendmsg() function fails and sets the value
of errno to EAGAIN.
If the control message length is incorrect, the sctp_sendmsg() function fails and sets the value
of errno to EINVAL. If the specified destination address does not belong to the association, the
sctp_sendmsg() function fails and sets the value of errno to EINVAL. If the value of stream_no
is outside the number of outbound streams that the association supports, the sctp_sendmsg()
function fails and sets the value of errno to EINVAL. If the address family of the specified
destination address is not AF_INET or AF_INET6, the sctp_sendmsg() function fails and sets the
value of errno to EINVAL.
sctp_send() Function
ssize_t sctp_send()(s*msglen*sinfoflags);
int s, const void *msg, size_t len, const struct sctp_sndrcvinfo *sinfo, int
flags;
The sctp_send() function is usable by one-to-one and one-to-many sockets model. The
sctp_send() function enables advanced SCTP features while sending a message from an SCTP
endpoint.
s
This value specifies the socket created by the socket() function.
msg
This value contains the message sent by the sctp_send() function.
len
This value is the length of the message. This value is expressed in bytes.
sinfo
This value contains the parameters used to send the message. For a one-to-many sockets
model, this value can contain the association ID to which the message is being sent.
flags
This value is identical to the flags parameter in the sendmsg() function.
The sctp_send() function returns the number of bytes it sent. The sctp_send() function
returns -1 when an error occurs.
If the file descriptor passed in the s parameter is not valid, the sctp_send() function fails
and sets the value of errno to EBADF. If the file descriptor passed in the s parameter does not
describe a socket, the sctp_send() function fails and sets the value of errno to ENOTSOCK. If
the sinfo_flags field of the sinfo parameter includes the value MSG_OOB, the sctp_send()
function fails and sets the value of errno to EOPNOTSUPP. If the sinfo_flags field of the
sinfo parameter includes the values MSG_ABORT or MSG_EOF for a one-to-one socket model, the
sctp_send() function fails and sets the value of errno to EOPNOTSUPP. If there is no established
association, the sctp_send() function fails and sets the value of errno to ENOTCONN. If the
socket is shutting down, disallowing further writes, the sctp_send() function fails and sets
the value of errno to EPIPE. If the socket is nonblocking and the transmit queue is full, the
sctp_send() function fails and sets the value of errno to EAGAIN.
If the control message length is incorrect, the sctp_send() function fails and sets the value
of errno to EINVAL. If the specified destination address does not belong to the association, the
sctp_send() function fails and sets the value of errno to EINVAL. If the value of stream_no is
outside the number of outbound streams that the association supports, the sctp_send() function
fails and sets the value of errno to EINVAL. If the address family of the specified destination
address is not AF_INET or AF_INET6, the sctp_send() function fails and sets the value of errno
to EINVAL.
sctp_sendv() Function
ssize_t sctp_sendv(int sd, const struct iovec *iov, int iovcnt, struct sockaddr
*addrs, int addrcnt, void *info,socklen_t infolen, unsigned int infotype,int flags);
The sctp_sendv() sends a message to an SCTP socket. The following attributes are specified:
iov The message to be sent. The data in the buffer are treated as one single
user message.
info A pointer to the buffer containing the attribute associated with the
message to be sent. The type is indicated by info_type parameter.
infotype The type of the info buffer. The following values are defined:
There are three types of attributes which can be used to describe a message to be sent. They are
represented by struct sctp_sndinfo, struct sctp_prinfo, and struct sctp_authinfo which is
currently not supported.
The following structure sctp_sendv_spa is defined to be used when more than one of the above
attributes are needed to describe a message to be sent.
struct sctp_sendv_spa {
uint32_t sendv_flags;
struct sctp_sndinfo sendv_sndinfo;
struct sctp_prinfo sendv_prinfo;
struct sctp_authinfo sendv_authinfo;
};
where:
snd_sid This value holds the stream number to send the message to. If a sender
specifies an invalid stream number, an error value is returned and the call
fails.
snd_ppid An unsigned integer that is passed to the remote end in each user
message (SCTP DATA chunk). The SCTP stack performs no byte order
modification of this field. For example, if the DATA chunk has to contain
a given value in network byte order, the SCTP user has to perform the
htonl computation. For more information, see the htonl(3C) man page.
snd_context This value is an opaque 32 bit context datum. It is passed back to the
caller if an error occurs on the transmission of the message and is
retrieved with each undelivered message.
snd_assoc_id When sending a message, this field holds the identifier for the association
which the message is sent to. When this call is used to set up an
association, the association identifier of the newly created association
is returned in this field. This field is applicable to one-to-many sockets
model only.
where:
pr_policy This field specifies the partial reliability (PR-SCTP) policy that is used
to send the message. If it is SCTP_PR_SCTP_NONE, the message is sent
reliably (the default is normal send). If it is SCTP_PR_SCTP_TTL, timed
reliability as defined in RFC 3758 is used. In this case, the lifetime is
provided in pr_value.
pr_value The meaning of this field depends on the PR-SCTP policy specified
by the pr_policy field. It is ignored when SCTP_PR_SCTP_NONE is
specified. In case of SCTP_PR_SCTP_TTL, this field specifies the lifetime
in milliseconds of the message.
When new send attributes are needed, new structures can be defined. Those new structures do
not need to be based on any of the above defined structures.
The struct sctp_sndinfo attribute for one-to-many sockets model must always be used in order
to specify the association the message is to be sent to. The only case where it is not needed is
when this call is used to set up a new association.
The caller provides a list of addresses in the addrs parameter to set up an association. This
function will behave like calling sctp_connectx(), first using the list of addresses, and
then calling sendmsg() with the given message and attributes. For an one-to-many sockets
model, if a struct sctp_sndinfo attribute is provided, the snd_assoc_id field must be 0. When
this function returns, the snd_assoc_id field will contain the association identifier of the
newly established association. The struct sctp_sndinfo attribute is not required to set up an
association for one-to-many sockets model. If this attribute is not provided, the caller can
enable the SCTP_ASSOC_CHANGE notification and use the SCTP_COMM_UP message to find out the
association identifier.
If the caller wants to send the message to a specific peer address (overriding the primary
address), the caller can provide the specific address in the addrs parameter and provide a
struct sctp_sndinfo attribute with the snd_flags field set to SCTP_ADDR_OVER.
This function can also be used to terminate an association. The caller provides an sctp_sndinfo
attribute with the snd_flags set to SCTP_EOF. In this case, the length of the message would be
zero. Sending a message using sctp_sendv() is atomic unless explicit EOR marking is enabled
on the socket specified by sd.
Upon successful completion, the number of bytes sent is returned. Otherwise, -1 is returned and
errno is set to indicate the error.
EAFNOSUPPORT Addresses in the specified address family cannot be used with this
socket.
ECONNREFUSED The attempt to connect was forcefully rejected. The calling program
should close the socket descriptor using close and issue another socket
call to obtain a new descriptor before making another attempt. For more
information, see the close(2) and socket(3C) man pages.
EINTR The operation was interrupted by delivery of a signal before any data
could be buffered to be sent.
EWOULDBLOCK The socket is marked as non-blocking, and the requested operation would
block.
sctp_recvv() Function
ssize_t sctp_recvv(int sd, const struct iovec *iov, int iovlen, struct sockaddr
*from,int fromlen, void *info,socklen_t infolen, unsigned int infotype,int flags);
The sctp_recvv() function provides an extensible way for the SCTP stack to pass up different
SCTP attributes associated with a received message to an application. The following attributes
are specified:
from A pointer to a buffer to be filled with the sender address of the received
message.
fromlen The size of the from buffer. Upon return, it is set to the actual size of the
sender's address.
info A pointer to the buffer containing the attributes of the received message.
The type of structure is indicated by info_type parameter.
infolen The length in bytes of info buffer. Upon return, it is set to the actual size
of the returned info buffer.
infotype The type of the info buffer. The following values are defined:
flags Flag for receive as in recvmsg. On return, its value will be different from
what was set in to the call. It has the same value as rcv_flags. For more
information, see the recvmsg(3C) man page.
There are two types of attributes which can be returned by the call to sctp_recvv():
■ The attribute of the received message and the attribute of the next message in receive buffer.
The caller enables the SCTP_RECVRCVINFO and SCTP_RECVNXTINFO socket option to receive
these attributes respectively.
Attributes of the received message are returned in struct sctp_rcvinfo and attributes of the
next message are returned in the structure sctp_nxtinfo. If both options are enabled, both
attributes are returned using the following structure.
struct sctp_recvv_rn {
struct sctp_rcvinfo recvv_rcvinfo;
struct sctp_nxtinfo recvv_nxtinfo;
};
struct sctp_rcvinfo {
uint16_t rcv_sid;
uint16_t rcv_ssn;
uint16_t rcv_flags;
uint32_t rcv_ppid;
uint32_t rcv_tsn;
uint32_t rcv_cumtsn;
uint32_t rcv_context;
sctp_assoc_t rcv_assoc_id;
};
where:
rcv_ssn The stream sequence number that the peer endpoint assigned to the
DATA chunk of this message. For fragmented messages, this is the same
number for all deliveries of the message (if more than one sctp_recvv()
is needed to read the message).
rcv_flags May be set to SCTP_UNORDERED when the message was sent unordered.
rcv_ppid This value is the same information that is passed by the peer socket to its
SCTP stack. The SCTP stack performs no byte order modification of this
field.
rcv_tsn The transmission sequence number that the peer endpoint assigned to the
received message.
rcv_assoc_id The association identifier of the association of the received message. This
field applies only to a one-to-many sockets model.
rcv_context This value is an opaque 32 bit context datum that was set by the caller
with the SCTP_CONTEXT socket option. This value is passed back to the
upper layer if an error occurs on the transmission of a message and is
retrieved with each undelivered message.
struct sctp_nxtinfo {
uint16_t nxt_sid;
uint16_t nxt_flags;
uint32_t nxt_ppid;
size_t nxt_length;
sctp_assoc_t nxt_assoc_id;
};
where:
flags This field can contain any of the following flags and is composed of a
bitwise– OR of the following values:
ppid This value is the same information that was passed by the peer socket
to its SCTP stack when sending the next message. The SCTP stack
performs no byte order modification of this field.
length The length of the message currently received in the socket buffer. This
might not be the entire length of the next message since a partial delivery
may be in progress. This field represents the entire next message size
only if the flag SCTP_COMPLETE is set in the nxt_flags field.
assoc_id The association identifier of the association of the next message. This
field applies only to a one-to-many sockets model.
EINTR The operation was interrupted by delivery of a signal before any data
could be buffered to be sent or the operation was interrupted by delivery
of a signal before any data is available to be received.
EWOULDBLOCK The socket is marked as non-blocking and the requested operation would
get blocked.
sctp_connectx() Function
int sctp_connectx(int sd, struct sockaddr *addrs, int addrcnt, sctp_assoc_t
*aid);
Similar to sctp_bindx, this function allows a caller to specify multiple addresses at which
a peer can be reached. The SCTP stack tries each addresses in the array in a round robin
fashion to set up the association. Note that the list of addresses passed in is only used for
setting up the association. It does not necessarily equal the set of addresses the peer uses for the
resulting association. If the caller wants to find out the set of peer addresses, the caller must use
sctp_getpaddrs to retrieve them after the association has been set up. For more information,
see the sctp_bindx(3C) and sctp_getpaddrs(3C) man pages.
EAFNOSUPPORT Addresses in the specified address family cannot be used with this
socket.
EALREADY The socket is non-blocking and a previous connection attempt has not yet
been completed.
ECONNREFUSED The attempt to connect was forcefully rejected. The calling program
should use connect to close the socket descriptor, and issue another
socket call to obtain a new descriptor before making another attempt.
EINTR The connect attempt was interrupted before it is completed. The attempt
will be established asynchronously.
EWOULDBLOCK The socket is marked as non-blocking and the requested operation would
get blocked.
sctp_getladdrs() Function
The sctp_getladdrs() function returns all locally bound addresses on a socket. The syntax for
the sctp_getladdrs() function is as follows:
int sctp_getladdrs()(sockid**addrs);
When the sctp_getladdrs() function returns successfully, the value of addrs points to a
dynamically allocated packed array of sockaddr structures. The sockaddr structures are of the
appropriate type for each local address. The calling application uses the sctp_freeladdrs()
function to free the memory. The value of the addrs parameter must not be NULL.
If the socket referenced by the sd parameter is an IPv4 socket, the sctp_getladdrs() function
returns IPv4 addresses. If the socket referenced by the sd parameter is an IPv6 socket, the
sctp_getladdrs() function returns a mix of IPv4 or IPv6 addresses as appropriate.
When the sctp_getladdrs() function is invoked for a one-to-many sockets model, the value of
the id parameter specifies the association to query. The sctp_getladdrs() function ignores the
id parameter when the function is operating on a one-to-one socket.
When the value of the id parameter is zero, the sctp_getladdrs() function returns locally
bound addresses without regard to any particular association. When the sctp_getladdrs()
function returns successfully, it reports the number of local addresses bound to the socket.
If the socket is unbound, the sctp_getladdrs() function returns 0 and the value of *addrs
is undefined. If an error occurs, the sctp_getladdrs() function returns -1 and the value of
*addrs is undefined.
sctp_freeladdrs() Function
The sctp_freeladdrs() function frees all of the resources that were allocated by a previous
call to the sctp_getladdrs(). The syntax for the sctp_freeladdrs() function is as follows:
void sctp_freeladdrs()(*addrs);
void *addrs;
The *addrs parameter is an array that contains the peer addresses that are returned by the
sctp_getladdrs() function.
sctp_getpaddrs() Function
int sctp_getpaddrs()(sockid**addrs);
When the sctp_getpaddrs() function returns successfully, the value of the **addrs parameter
points to a dynamically allocated packed array of sockaddr structures of the appropriate type
for each address. The calling thread frees the memory with the sctp_freepaddrs() function.
The **addrs parameter cannot have a value of NULL. If the socket descriptor given in sock is for
an IPv4 socket, the sctp_getpaddrs() function returns IPv4 addresses. If the socket descriptor
given in sock is for an IPv6 socket, the sctp_getpaddrs() function returns a mix of IPv4 and
IPv6 addresses. For one-to-many sockets model, the id parameter specifies the association
to query. The sctp_getpaddrs() function ignores the id parameter for one-to-one socket
model. When the sctp_getpaddrs() function returns successfully, it returns the number of peer
addresses in the association. If there is no association on this socket, the sctp_getpaddrs()
function returns 0 and the value of the **addrs parameter is undefined. If an error occurs, the
sctp_getpaddrs() function returns -1 and the value of the **addrs parameter is undefined.
If the file descriptor passed to the sctp_getpaddrs() function in the sock parameter is
invalid, the sctp_getpaddrs() function fails and returns EBADF. If the file descriptor passed
to the sctp_getpaddrs() function in the sock parameter does not describe a socket, the
sctp_getpaddrs() function fails and returns ENOTSOCK. If the file descriptor passed to the
sctp_getpaddrs() function in the sock parameter describes a socket that is not connected, the
sctp_getpaddrs() function fails and returns ENOTCONN.
sctp_freepaddrs() Function
The sctp_freepaddrs() function frees all of the resources that were allocated by a previous
call to the sctp_getpaddrs(). The syntax for the sctp_freepaddrs() function is as follows:
void sctp_freepaddrs()(*addrs);
void *addrs;
The *addrs parameter is an array that contains the peer addresses that are returned by the
sctp_getpaddrs() function.
Branched-off Association
Applications can branch an established association on a one-to-many sockets model into
a separate socket and file descriptor. A separate socket and file descriptor is useful for
applications that have a number of sporadic message senders or receivers that need to remain
under the original one-to-many sockets model. The application branches off associations
that carry high volume data traffic into separate socket descriptors. The application uses the
sctp_peeloff() call to branch off an association into a separate socket. The new socket is a
one-to-one socket model. The syntax for the sctp_peeloff() function is as follows:
int sctp_peeloff()(sockid);
sock
The original one-to-many sockets model descriptor returned from the socket() system
call.
id
The identifier of the association to branch off to a separate file descriptor.
The sctp_peeloff() function fails and returns EOPTNOTSUPP if the socket descriptor passed in
the sock parameter is not a one-to-many SCTP sockets model. The sctp_peeloff() function
fails and returns EINVAL if the value of id is zero or if the value of id is greater than the
maximum number of associations for the socket descriptor passed in the sock parameter. The
sctp_peeloff() function fails and returns EMFILE if the function fails to create a new user file
descriptor or file structure.
/*
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
*/
/*
* IPv4 echo client.
*/
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <unistd.h>
#include <netinet/sctp.h>
#include <errno.h>
#define BUFLEN 2048
#define SERVER_PORT 5000
#define MAX_STREAM 64
static void
usagBe(char *a0)
{
fprintf(stderr, "Usage: %s <server address>\n", a0);
}
static void
print_notif(char *buf)
{
union sctp_notification *snp;
struct sctp_assoc_change *sac;
/*
* Read from the network.
*/
static void
readit(void *vfdp)
{
int fd;
ssize_t n;
char buf[BUFLEN];
struct iovec iov[1];
int flags;
socklen_t info_len;
uint_t info_type;
struct sctp_rcvinfo info;
union sctp_notification *snp;
pthread_setcanceltype(PTHREAD_CANCEL_ASYNCHRONOUS, NULL);
fd = *(int *)vfdp;
static void
echo(struct sockaddr_in *addrs, int addrcnt)
{
int fd;
uchar_t buf[BUFLEN];
ssize_t n;
int perr;
pthread_t tid;
struct iovec iov[1];
int ret, on;
struct sctp_sndinfo info;
struct sctp_initmsg initmsg;
struct sctp_event event;
exit(1);
}
on = 1;
ret = setsockopt(fd, IPPROTO_SCTP, SCTP_RECVRCVINFO, &on, sizeof (on));
if (ret < 0) {
perror("setsockopt SCTP_RECVRCVINFO");
exit(1);
}
/*
* Set the SCTP stream parameters to tell the other side when
* setting up the association.
*/
memset(&initmsg, 0, sizeof (struct sctp_initmsg));
initmsg.sinit_num_ostreams = MAX_STREAM;
initmsg.sinit_max_instreams = MAX_STREAM;
initmsg.sinit_max_attempts = MAX_STREAM;
ret = setsockopt(fd, IPPROTO_SCTP, SCTP_INITMSG, &initmsg,sizeof (struct
sctp_initmsg));
if (ret < 0) {
perror("setsockopt SCTP_INITMSG");
exit(1);
}
iov->iov_base = buf;
/* Read from stdin and then send to the echo server. */
while ((n = read(fileno(stdin), buf, BUFLEN)) > 0) {
iov->iov_len = n;
if (sctp_sendv(fd, iov, 1, NULL, 0, &info, sizeof (info),
SCTP_SENDV_SNDINFO, 0) < 0) {
perror("sctp_sendv");
exit(1);
}
/* Send the next message to a different stream. */
info.snd_sid = (info.snd_sid + 1) % MAX_STREAM;
info.snd_ppid++;
}
pthread_cancel(tid);
close(fd);
}
int
main(int argc, char **argv)
{
struct sockaddr_in *addrs;
int addrcnt;
if (argc < 2) {
usage(*argv);
exit(1);
}
/*
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
*/
/*
* IPv4 echo server
*/
/* To enable socket features used for SCTP socket. */
#define _XPG4_2
#define __EXTENSIONS__
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <unistd.h>
#include <netinet/sctp.h>
#include <netdb.h>
static void
handle_event(void *buf)
{
struct sctp_assoc_change *sac;
struct sctp_send_failed_event *ssfe;
struct sctp_paddr_change *spc;
struct sctp_remote_error *sre;
union sctp_notification *snp;
char addrbuf[INET6_ADDRSTRLEN];
const char *ap;
struct sockaddr_in *sin;
snp = buf;
switch (snp->sn_header.sn_type) {
case SCTP_ASSOC_CHANGE:
sac = &snp->sn_assoc_change;
printf(">>> assoc_change: state=%hu, error=%hu, instr=%hu "
"outstr=%hu\n", sac->sac_state, sac->sac_error,
sac->sac_inbound_streams, sac->sac_outbound_streams);
break;
case SCTP_SEND_FAILED_EVENT:
ssfe = &snp->sn_send_failed_event;
printf(">>> sendfailed: len=%hu err=%d\n", ssfe->ssfe_length,
ssfe->ssfe_error);
break;
case SCTP_PEER_ADDR_CHANGE:
spc = &snp->sn_paddr_change;
if (spc->spc_aaddr.ss_family != AF_INET) {
fprintf(stderr, "getmsg: unexpected family %d\n",spc->spc_aaddr.ss_family);
exit(1);
} else {
sin = (struct sockaddr_in *)&spc->spc_aaddr;
ap = inet_ntop(AF_INET, &sin->sin_addr, addrbuf,INET6_ADDRSTRLEN);
}
printf(">>> intf_change: %s state=%d, error=%d\n", ap,
spc->spc_state, spc->spc_error);
break;
case SCTP_REMOTE_ERROR:
sre = &snp->sn_remote_error;
printf(">>> remote_error: err=%hu len=%hu\n",
ntohs(sre->sre_error), ntohs(sre->sre_length));
break;
case SCTP_SHUTDOWN_EVENT:
printf(">>> shutdown event\n");
break;
default:
printf(">>> unexpected type: %hu\n", snp->sn_header.sn_type);
break;
}
}
/*
* Receive a message from the network.
*/
static ssize_t
getmsg(int fd, struct iovec *iov, struct sctp_rcvinfo *info, int *flags)
{
ssize_t tot = 0, nr;
size_t buflen;
socklen_t info_len;
uint_t info_type;
char *buf;
buf = iov->iov_base;
buflen = iov->iov_len;
/*
* The echo server.
*/
static void
echo(int fd)
{
ssize_t nr;
size_t buflen;
int flags;
struct iovec iov[1];
struct sctp_rcvinfo rinfo;
struct sctp_sndinfo sinfo;
/*
* Echo the message back using the incoming info.
*
* Note that rcv_sid is in host byte order. But rcv_ppid is
* what is stored by the peer. If both sides wnat to use this
* value for communication (interpreting it on both sides),
* the sender needs to do htonl() when setting snd_ppid. And
* the receiver side needs to do ntohl() to convert rcv_ppid
* back to the host byte order.
*/
sinfo.snd_sid = rinfo.rcv_sid;
sinfo.snd_ppid = rinfo.rcv_ppid;
iov->iov_len = nr;
static void
subscribe_event(int fd, uint16_t event)
{
struct sctp_event ev;
int ret;
int main(void)
{
int lfd;
int cfd;
int onoff;
int i;
struct sockaddr_in sin[1];
struct sctp_initmsg initmsg;
/* Subscribe to events. */
for (i = 0; i < sizeof (event_interested) / sizeof (uint16_t); i++)
subscribe_event(lfd, event_interested[i]);
for (;;) {
if ((cfd = accept(lfd, NULL, 0)) == -1) {
perror("accept");
exit(1);
}
/* Subcribe to interesting events for the new association. */
for (i = 0; i < sizeof (event_interested) / sizeof (int); i++)
subscribe_event(cfd, event_interested[i]);
/*
* Copyright (c) 2015, Oracle and/or its affiliates. All rights reserved.
*/
/*
* IPv4 echo server.
*/
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <netinet/in.h>
#include <arpa/inet.h>
#include <stdlib.h>
#include <unistd.h>
#include <netinet/sctp.h>
#include <errno.h>
/*
* Given an event notification, print out what it is.
*/
static void
handle_event(void *buf)
{
struct sctp_assoc_change *sac;
struct sctp_send_failed_event *ssfe;
struct sctp_paddr_change *spc;
struct sctp_remote_error *sre;
struct sctp_shutdown_event *sse;
union sctp_notification *snp;
char addrbuf[INET6_ADDRSTRLEN];
const char *ap;
struct sockaddr_in *sin;
snp = buf;
switch (snp->sn_header.sn_type) {
case SCTP_ASSOC_CHANGE:
sac = &snp->sn_assoc_change;
switch (sac->sac_state) {
case SCTP_COMM_UP:
/* A new association comes in. */
printf(">>> assoc_change COMM_UP: aid=%d instr=%hu "
"outstr=%hu\n", sac->sac_assoc_id,
sac->sac_inbound_streams,
sac->sac_outbound_streams);
break;
case SCTP_SHUTDOWN_COMP:
/* An association goes away. */
printf(">>> assoc_change SHUTDOWN_COMPLETE: aid=%d\n",
sac->sac_assoc_id);
break;
defaul:
printf(">>> assoc_change: aid=%d state=%hu error=%hu\n",
sac->sac_assoc_id, sac->sac_state, sac->sac_error);
break;
}
break;
case SCTP_SEND_FAILED_EVENT:
ssfe = &snp->sn_send_failed_event;
/*
* Receive a message from the network.
*/
static ssize_t
getmsg(int fd, struct iovec *iov, struct sctp_rcvinfo *info, int *flags)
{
ssize_t tot = 0, nr;
size_t buflen;
socklen_t info_len;
uint_t info_type;
char *buf;
struct sockaddr_in addr;
socklen_t addrlen;
buf = iov->iov_base;
buflen = iov->iov_len;
/*
* The echo server.
*/
static void
echo(int fd)
{
ssize_t nr;
size_t buflen;
int flags;
struct iovec iov[1];
struct sctp_rcvinfo rinfo;
struct sctp_sndinfo sinfo;
printf(">>> got %u bytes from aid %d on stream %hu (ssn %hu): ",
nr, rinfo.rcv_assoc_id, rinfo.rcv_sid, rinfo.rcv_ssn);
fflush(stdout);
write(fileno(stdout), iov->iov_base, nr);
fflush(stdout);
printf("\n");
/*
* Echo the message back using the incoming info.
*
* Note that rcv_sid is in host byte order. But rcv_ppid is
* what is stored by the peer. If both sides wnat to use this
* value for communication (interpreting it on both sides),
* the sender needs to do htonl() when setting snd_ppid. And
* the receiver side needs to do ntohl() to convert rcv_ppid
static void
subscribe_event(int fd, uint16_t event)
{
struct sctp_event ev;
int ret;
ev.se_assoc_id = 0;
ev.se_type = event;
ev.se_on = 1;
ret = setsockopt(fd, IPPROTO_SCTP, SCTP_EVENT, &ev, sizeof (ev));
if (ret < 0) {
fprintf(stderr, "%s: setsockopt SCTP_EVENT: %d\n",
strerror(errno), event);
exit(1);
}
}
int
main(void)
{
int fd;
int onoff;
int i;
struct sockaddr_in sin[1];
struct sctp_initmsg initmsg;
/* Subscribe to events. */
for (i = 0; i < sizeof (event_interested) / sizeof (uint16_t); i++)
subscribe_event(fd, event_interested[i]);
return (0);
}
This chapter describes the Transport Layer Interface (TLI) and the X/Open Transport Interface
(XTI). Advanced topics such as asynchronous execution mode are discussed in “Advanced
XTI/TLI Topics” on page 227.
Additions to XTI, such as scatter or gather data transfer, are discussed in “Additions to the XTI
Interface” on page 248.
The transport layer of the OSI model (layer 4) is the lowest layer that provides applications and
higher layers with end-to-end service. This layer hides the topology and characteristics of the
underlying network from users. The transport layer also defines a set of services common to
many contemporary protocol suites including the OSI protocols, Transmission Control Protocol
and Internet Protocol Suite (TCP/IP) , Xerox Network Systems (XNS), and Systems Network
Architecture (SNA).
TLI is modeled on the industry standard Transport Service Definition (ISO 8072). It can be
used to access both TCP and UDP. XTI and TLI are a set of interfaces that constitute a network
programming interface. The Oracle Solaris operating system supports both interfaces, although
XTI represents the future direction of this set of interfaces. The Oracle Solaris software
implements XTI and TLI as a user library using the STREAMS I/O mechanism.
Note - The interfaces described in this chapter are multithread safe. This means that
applications containing the XTI/TLI interface calls can be used in a multithreaded application.
Because these interface calls are not re-entrant, they do not provide linear scalability.
Caution - The XTI/TLI interface behavior has not been well specified in an asynchronous
environment. Do not use these interfaces from signal handler routines.
XTI interfaces are an evolution of TLI interfaces and represent the future direction of this
family of interfaces. Compatibility for applications using TLI interfaces is available. New
applications can use the XTI interfaces and you can port older applications to XTI when
necessary.
TLI is implemented as a set of interface calls in a library libnsl, to which the applications link.
XTI applications are compiled using the c89 front end and must be linked with the xnet library
libxnet. For additional information on compiling with XTI, see the standards(7) man page.
Note - An application using the XTI interface includes the xti.h header file, whereas an
application using the TLI interface includes the tiuser.h header file.
The XTI/TLI code can be independent of current transport providers when used in conjunction
with some additional interfaces and mechanisms described in Chapter 4, “Locality Group
APIs”. The SunOS 5 product includes some transport providers such as TCP, as part of the base
operating system. A transport provider performs services and the transport user requests the
services. The transport user issue service requests to the transport provider. An example is a
request to transfer data over a TCP and UDP connection.
XTI/TLI can also be used for transport-independent programming by taking advantage of two
components:
■ Library routines that perform the transport services such as transport selection and name-to-
address translation. The network services library includes a set of interfaces that implement
XTI/TLI for user processes. See Chapter 10, “Transport Selection and Name-to-Address
Mapping”.
Programs using TLI should be linked with the libnsl network services library by
specifying the -l nsl option at compile time.
Programs using XTI should be linked with the xnet library by specifying the -l xnet
option at compile time.
■ State transition rules that define the sequence in which the transport routines
can be invoked. For more information on state transition rules, see “State
Transitions” on page 239. The state tables define the legal sequence of library calls based
on the state and the handling of events. These events include user-generated library calls
and provider-generated event indications. XTI/TLI programmers should understand all state
transitions before using the interface.
To process the data as it arrives over the connection, a user can establish a transport connection
using exec on an existing program such as /usr/bin/cat. Existing programs use read and
write. XTI/TLI does not directly support a read/write interface to a transport provider, but
one may be provided by using the tirdwr module. For more information, see the exec(2),
read(2), and write(2) man pages. The interface enables you to issue read and write calls
over a transport connection in the data transfer phase. This section describes the read/write
interface with the XTI/TLI connection mode service. This interface is not available with the
connectionless mode service.
#include <stropts.h>
The client invokes the read/write interface by pushing the tirdwr module onto the stream
associated with the transport endpoint. For more information about I_PUSH, see the
streamio(4I) man page. The tirdwr module converts XTI/TLI above the transport provider
into a read/write interface. Once the the tirdwr module is pushed, the client calls close and
dup to establish the transport endpoint as its standard input file, and uses /usr/bin/cat to
process the input. For more information, see the close(2) and dup(2).
Pushing the tirdwr module onto the transport provider forces XTI/TLI to use read and
write semantics. XTI/TLI does not preserve message boundaries when using read and write
semantics. Pop tirdwr from the transport provider to restore the XTI/TLI semantics. For more
information about I_POP, see the streamio(4I) man page.
Caution - Push the tirdwr module onto a stream only when the transport endpoint is in the
data transfer phase. After pushing the module, the user cannot call any XTI/TLI routines. If
the user invokes an XTI/TLI routine, tirdwr generates a fatal protocol error, EPROTO, on the
stream, rendering it unusable. If you then pop the tirdwr module off the stream, the transport
connection aborts.
Write Data
After you send data over the transport connection with write, tirdwr passes data through the
transport provider. If you send a zero-length data packet, tirdwr discards the message. If the
transport connection is aborted, a hang-up condition is generated on the stream and the write
calls fail, and errno is set to ENXIO. This problem might occur when the remote user aborts the
connection using t_snddis. You can still retrieve any available data after a hang-up. For more
information, see the write(2) an t_snddis(3C) man pages.
Read Data
Receive data arrives at the transport connection with read. The tirdwr module passes data from
the transport provider. The tirdwr module processes any other event or request passed to the
user from the provider as follows:
■ read cannot identify expedited data to the user. If read receives an expedited data request,
tirdwr generates a fatal protocol error, EPROTO, on the stream. The error causes further
system calls to fail. Do not use read to receive expedited data.
■ tirdwr discards an abortive disconnect request and generates a hang-up condition on the
stream. Subsequent read calls retrieve any remaining data, then return zero for all further
calls, indicating end of file.
■ tirdwr discards an orderly release request and delivers a zero-length message to the user.
As described in the read man page, this notifies the user of end of file by returning 0.
■ If read receives any other XTI/TLI request, tirdwr generates a fatal protocol error, EPROTO,
on the stream. This causes further system calls to fail. If a user pushes tirdwr onto a stream
after establishing the connection, tirdwr generates no request. For more information, see
the read(2) man page.
Close Connection
With tirdwr on a stream, you can send and receive data over a transport connection for
the duration of the connection. Either user can terminate the connection by closing the file
descriptor associated with the transport endpoint or by popping the tirdwr module off the
stream. In either case, tirdwr does the following:
■ If tirdwr receives an orderly release request, it passes the request to the transport provider
to complete the orderly release of the connection. The remote user who initiated the orderly
release procedure receives the expected request when data transfer completes.
■ If tirdwr receives a disconnect request, it takes no special action.
■ If tirdwr receives neither an orderly release nor a disconnect request, it passes a disconnect
request to the transport provider to abort the connection.
■ If an error occurs on the stream and tirdwr does not receive a disconnect request, it passes a
disconnect request to the transport provider.
A process cannot initiate an orderly release after pushing tirdwr onto a stream. tirdwr handles
an orderly release if the user on the other side of a transport connection initiates the release.
If the client in this section is communicating with a server program, the server terminates the
transfer of data with an orderly release request. The server then waits for the corresponding
request from the client. At that point, the client exits and closes the transport endpoint. After
closing the file descriptor, tirdwr initiates the orderly release request from the client's side of
the connection. This release generates the request on which the server blocks.
Some protocols, like TCP, require this orderly release to ensure intact delivery of the data.
Many XTI/TLI library routines block to wait for an incoming event. However, some time-
critical applications should not block for any reason. An application can do local processing
while waiting for some asynchronous XTI/TLI event.
Applications can access asynchronous processing of XTI/TLI events through the combination
of asynchronous features and the non-blocking mode of XTI/TLI library routines. See the ONC
+ RPC Developer’s Guide for information on use of the poll system call and the I_SETSIG
ioctl ioctl(2) command to process events asynchronously.
You can run each XTI/TLI routine that blocks for an event in a special non-blocking mode.
For example, t_listen normally blocks for a connect request. A server can periodically poll
a transport endpoint for queued connect requests by calling t_listen in the non-blocking (or
asynchronous) mode. For more information, see the t_listen(3C) ma page. You enable the
asynchronous mode by setting O_NDELAY or O_NONBLOCK in the file descriptor. Set these modes
as a flag through t_open, or by calling fcntl before calling the XTI/TLI routine. Use fcntl to
enable or disable this mode at any time. All program examples in this chapter use the default
synchronous processing mode. For more information, see the t_open(3C) and fcntl(2) man
pages.
Use of O_NDELAY or O_NONBLOCK affects each XTI/TLI routine differently. You need to
determine the exact semantics of O_NDELAY or O_NONBLOCK for a particular routine.
By using XTI/TLI, a server can manage multiple outstanding connect requests. One reason to
receive several simultaneous connect requests is to prioritize the clients. A server can receive
several connect requests, and accept them in an order based on the priority of each client.
The second reason for handling several outstanding connect requests is to overcome the limits
of single-threaded processing. Depending on the transport provider, while a server is processing
one connect request, other clients see the server as busy. If multiple connect requests are
processed simultaneously, the server is busy only if more than the maximum number of clients
try to call the server simultaneously.
The server example is event-driven: the process polls a transport endpoint for incoming XTI/
TLI events and takes the appropriate actions for the event received. The example following
demonstrates the ability to poll multiple transport endpoints for incoming events.
#include <tiuser.h>
#include <fcntl.h>
#include <stdio.h>
#include <poll.h>
#include <stropts.h>
#include <signal.h>
#define NUM_FDS 1
#define MAX_CONN_IND 4
#define SRV_ADDR 1 /* server's well known address */
main()
{
struct pollfd pollfds[NUM_FDS];
struct t_bind *bind;
int i;
/*
* Only opening and binding one transport endpoint, but more can
* be supported
*/
if ((pollfds[0].fd = t_open("/dev/tivc", O_RDWR,
(struct t_info *) NULL)) == -1) {
t_error("t_open failed");
exit(1);
}
if ((bind = (struct t_bind *) t_alloc(pollfds[0].fd, T_BIND,
T_ALL)) == (struct t_bind *) NULL) {
t_error("t_alloc of t_bind structure failed");
exit(2);
}
bind->qlen = MAX_CONN_IND;
bind->[Link] = sizeof(int);
*(int *) bind->[Link] = SRV_ADDR;
if (t_bind(pollfds[0].fd, bind, bind) == -1) {
t_error("t_bind failed");
exit(3);
}
/* Was the correct address bound? */
if (bind->[Link] != sizeof(int) ||
*(int *)bind->[Link] != SRV_ADDR) {
fprintf(stderr, "t_bind bound wrong address\n");
exit(4);
}
}
The file descriptor returned by t_open is stored in a pollfd structure that controls polling of the
transport endpoints for incoming data. For more information, see the poll(2) and t_open(3C)
man pages. Only one transport endpoint is established in this example. However, the remainder
of the example is written to manage multiple transport endpoints. Several endpoints could
be supported with minor changes to Example 41, “Endpoint Establishment (Convertible to
Multiple Connections),” on page 229.
This server sets qlen to a value greater than 1 for t_bind. This value specifies that the
server should queue multiple outstanding connect requests. The server accepts the current
connect request before accepting additional connect requests. This example can queue up to
MAX_CONN_IND connect requests. The transport provider can negotiate the value of qlen to be
smaller if the provider cannot support MAX_CONN_IND outstanding connect requests.
After the server binds its address and is ready to process connect requests, it behaves as shown
in the following example.
pollfds[0].events = POLLIN;
while (TRUE) {
if (poll(pollfds, NUM_FDS, -1) == -1) {
perror("poll failed");
exit(5);
}
for (i = 0; i < NUM_FDS; i++) {
switch (pollfds[i].revents) {
default:
perror("poll returned error event");
exit(6);
case 0:
continue;
case POLLIN:
do_event(i, pollfds[i].fd);
service_conn_ind(i, pollfds[i].fd);
}
}
}
In the pollfd structure, the events field is set to POLLIN, which notifies the server of any
incoming XTI/TLI events. The server then enters an infinite loop in which it polls the transport
endpoints for events and processes the events as they occur.
The poll call blocks indefinitely for an incoming event. On return, the server checks the value
of revents for each entry, one per transport endpoint, for new events. If revents is 0, the
endpoint has generated no events and the server continues to the next endpoint. If revents is
POLLIN, there is an event on the endpoint. The server calls do_event to process the event. Any
other value in revents indicates an error on the endpoint, and the server exits. With multiple
endpoints, the server should close this descriptor and continue.
Each time the server iterates the loop, it calls service_conn_ind to process any outstanding
connect requests. If another connect request is pending, service_conn_ind saves the new
connect request and responds to it later.
The server calls do_event in the following example to process an incoming event.
switch (t_look(fd)) {
default:
fprintf(stderr, "t_look: unexpected event\n");
exit(7);
case T_ERROR:
fprintf(stderr, "t_look returned T_ERROR event\n");
exit(8);
case -1:
t_error("t_look failed");
exit(9);
case 0:
/* since POLLIN returned, this should not happen */
fprintf(stderr,"t_look returned no event\n");
exit(10);
case T_LISTEN:
/* find free element in calls array */
for (i = 0; i < MAX_CONN_IND; i++) {
The arguments in Example 43, “Event Processing Routine,” on page 231 are a number (slot)
and a file descriptor (fd). A slot is the index into the global array calls, which has an entry for
each transport endpoint. Each entry is an array of t_call structures that hold incoming connect
requests for the endpoint.
The do_event module calls t_look to identify the XTI/TLI event on the endpoint specified
by fd. If the event is a connect request (T_LISTEN event) or disconnect request (T_DISCONNECT
event), the event is processed. Otherwise, the server prints an error message and exits. For more
information, see the t_look(3C) man page.
For connect requests, do_event scans the array of outstanding connect requests for the first
free entry. A t_call structure is allocated for the entry, and the connect request is received
by t_listen. The array is large enough to hold the maximum number of outstanding connect
requests. The processing of the connect request is deferred. For more information, see the
t_listen(3C) man page.
A disconnect request must correspond to an earlier connect request. The do_event module
allocates a t_discon structure to receive the request. This structure has the following fields:
struct t_discon {
struct netbuf udata;
int reason;
int sequence;
}
The udata structure contains any user data sent with the disconnect request. The value of
reason contains a protocol-specific disconnect reason code. The value of sequence identifies
the connect request that matches the disconnect request.
The server calls t_rcvdis to receive the disconnect request. The array of connect requests is
scanned for one that contains the sequence number that matches the sequence number in the
disconnect request. When the connect request is found, its structure is freed and the entry is set
to NULL. For more information, see the t_rcvdis(3C) man page.
service_conn_ind(slot, fd)
{
int i;
t_close(conn_fd);
return;
}
t_error("t_accept failed");
exit(167);
}
t_free(calls[slot][i], T_CALL);
calls[slot][i] = (struct t_call *) NULL;
run_server(fd);
}
}
For each transport endpoint, the array of outstanding connect requests is scanned. For each
request, the server opens a responding transport endpoint, binds an address to the endpoint, and
accepts the connection on the endpoint. If another connect or disconnect request arrives before
the current request is accepted, t_accept fails and sets t_errno to TLOOK. You cannot accept an
outstanding connect request if any pending connect request events or disconnect request events
exist on the transport endpoint.
If this error occurs, the responding transport endpoint is closed and service_conn_ind returns
immediately, saving the current connect request for later processing. This activity causes the
server's main processing loop to be entered, and the new event is discovered by the next call to
poll. In this way, the user can queue multiple connect requests.
Eventually, all events are processed, and service_conn_ind is able to accept each connect
request in turn.
Asynchronous Networking
This section discusses the techniques of asynchronous network communication using XTI/TLI
for real-time applications. Oracle Solaris provides support for asynchronous network processing
of XTI/TLI events using a combination of STREAMS asynchronous features and the non-
blocking mode of the XTI/TLI library routines.
Like file and device I/O, network transfers can be done synchronously or asynchronously with
process service requests.
Synchronous networking proceeds similar to synchronous file and device I/O. Like the write
interface, the send request returns after buffering the message, but might suspend the calling
process if buffer space is not immediately available. Like the read interface, a receive request
suspends execution of the calling process until data arrives to satisfy the request. Because there
are no guaranteed bounds for transport services, synchronous networking is inappropriate for
processes that must have real-time behavior with respect to other devices.
After the endpoint has been established using t_open, and its identity established using t_bind,
the endpoint can be configured for asynchronous service. For more information, see the
t_open(3C) and t_bind(3C) man pages. Use the fcntl interface to set the O_NONBLOCK flag on
the endpoint. Thereafter, calls to t_sndudata for which no buffer space is immediately available
return -1 with t_errno set to TFLOW. Similarly, calls to t_rcvudata for which no data are
available return -1 with t_errno set to TNODATA. For more information, see the t_sndudata(3C)
and t_rcvudata(3C) man pages.
Although an application can use poll to check periodically for the arrival of data or to wait for
the receipt of data on an endpoint, receiving asynchronous notification when data arrives might
be necessary. Use ioctl with the I_SETSIG command to request that a SIGPOLL signal be sent to
the process upon receipt of data at the endpoint. Applications should check for the possibility of
multiple messages causing a single signal.
In the following example, protocol is the name of the application-chosen transport protocol.
#include <sys/types.h>
#include <tiuser.h>
#include <signal.h>
#include <stropts.h>
int fd;
struct t_bind *bind;
void sigpoll(int);
...
for (;;) {
... /* initialize ud */
if (t_rcvudata(fd, &ud, &flags) < 0) {
if (t_errno == TNODATA)
break; /* no more messages */
... /* process other error conditions */
}
... /* process message in ud */
}
For connection-mode service, an application can arrange not only for the data transfer, but
also for the establishment of the connection itself to be done asynchronously. The sequence
of operations depends on whether the process is attempting to connect to another process or is
awaiting connection attempts.
A process can attempt a connection and asynchronously complete the connection. The process
first creates the connecting endpoint and, using fcntl, configures the endpoint for non-
blocking operation. As with connectionless data transfers, the endpoint can also be configured
for asynchronous notification upon completion of the connection and subsequent data
transfers. The connecting process then uses t_connect to initiate setting up the transfer. Then
t_rcvconnect is used to confirm the establishment of the connection. For more information,
see the t_connect(3C) and t_rcvconnect(3C) man pages.
Asynchronous Open
The STREAMS interface provided by the SunOS platform provides a mechanism for passing an
open file descriptor from one process to another. The process with the open file descriptor uses
ioctl with a command argument of I_SENDFD. The second process obtains the file descriptor by
calling ioctl with a command argument of I_RECVFD. For more information, see the ioctl(2)
man page.
In the following example, the parent process prints out information about the test file, and
creates a pipe. Next, the parent creates a child process that opens the test file and passes the
open file descriptor back to the parent through the pipe. The parent process then displays the
status information on the new file descriptor.
#include <sys/types.h>
#include <sys/stat.h>
#include <fcntl.h>
#include <stropts.h>
#include <stdio.h>
int fd;
int pipefd[2];
struct stat statbuf;
stat(TESTFILE, &statbuf);
statout(TESTFILE, &statbuf);
pipe(pipefd);
if (fork() == 0) {
close(pipefd[0]);
sendfd(pipefd[1]);
} else {
close(pipefd[1])
recvfd(pipefd[0]);
}
}
sendfd(int p)
{
int tfd;
recvfd(int p)
{
struct strrecvfd rfdbuf;
struct stat statbuf;
char fdbuf[32];
State Transitions
The tables in the following sections describe all state transitions associated with XTI/TLI.
XTI/TLI States
The following table defines the states used in XTI/TLI state transitions, along with the service
types.
Outgoing Events
The outgoing events described in the following table correspond to the status returned from the
specified transport routines, where these routines send a request or response to the transport
provider. In the table, some events, such as "accept", are distinguished by the context in which
they occur. The context is based on the values of the following variables:
■ ocnt – Count of outstanding connect requests
■ fd – File descriptor of the current transport endpoint
■ resfd – File descriptor of the transport endpoint where a connection is accepted
Incoming Events
The incoming events correspond to the successful return of the specified routines. These
routines return data or event information from the transport provider. The only incoming
event not associated directly with the return of a routine is pass_conn, which occurs when a
connection is transferred to another endpoint. The event occurs on the endpoint that is being
passed the connection, although no XTI/TLI routine is called on the endpoint.
In the following table, the rcvdis events are distinguished by the value of ocnt, the count of
outstanding connect requests on the endpoint.
State Tables
The state tables describe the XTI/TLI state transitions. Each box contains the next state, given
the current state (column) and the current event (row). An empty box is an invalid state/event
combination. Each box can also have an action list. Actions must be done in the order specified
in the box.
You should understand the following when studying the state tables:
■ t_close terminates an established connection for a connection-oriented transport provider.
The connection termination will be either orderly or abortive, depending on the service
type supported by the transport provider. For more information, see the t_getinfo(3C) and
t_close(3C) man pages.
■ If a transport user issues a interface call out of sequence, the interface fails and t_errno is
set to TOUTSTATE. The state does not change.
■ The error codes TLOOK or TNODATA after t_connect can result in state changes. The state
tables assume correct use of XTI/TLI.
■ Any other transport error does not change the state, unless the man page for the interface
says otherwise.
■ The support interfaces t_getinfo, t_getstate, t_alloc, t_free, t_sync, t_look, and
t_error are excluded from the state tables because they do not affect the state.
Some of the state transitions listed in the tables below offer actions the transport user must take.
Each action is represented by a digit derived from the list below:
■ Set the count of outstanding connect requests to zero
opened T_UNBND
bind T_IDLE[1]
optmgmt (TLI only) T_IDLE
unbind T_UNBND
closed T_UNINIT
connect1 T_DATAXFER
connect2 T_OUTCON
rcvconnect T_DATAXFER
listen T_INCON [2] T_INCON [2]
accept1 T_DATAXFER [3]
accept2 T_IDLE [3] [4]
accept3 T_INCON [3] [4]
snd T_DATAXFER
rcv T_DATAXFER
snddis1 T_IDLE T_IDLE [3] T_IDLE
snddis2 T_INCON [3]
rcvdis1 T_IDLE T_IDLE
rcvdis2 T_IDLE [3]
rcvdis3 T_INCON [3]
sndrel T_OUTREL
rcvrel T_INREL
pass_conn T_DATAXFER
optmgmt T_IDLE T_OUTCON T_INCON T_DATAXFER
connect1
connect2
rcvconnect
listen
accept1
accept2
accept3
snd T_INREL
rcv T_OUTREL
snddis1 T_IDLE T_IDLE
snddis2
rcvdis1 T_IDLE T_IDLE
rcvdis2
rcvdis3
sndrel T_IDLE
rcvrel T_IDLE
pass_conn T_DATAXFER
optmgmt T_OUTREL T_INREL T_UNBND
closed T_UNINIT T_UNINIT
snudata T_IDLE
rcvdata T_IDLE
rcvuderr T_IDLE
The set of XTI/TLI services, common to many transport protocols, offers protocol
independence to applications. Not all transport protocols support all XTI/TLI services. If
software must run in a variety of protocol environments, use only the common services.
The following is a list of services that might not be common to all transport protocols.
■ In connection mode service, a transport service data unit (TSDU) might not be supported
by all transport providers. Make no assumptions about preserving logical data boundaries
across a connection.
■ Protocol and implementation-specific service limits are returned by the t_open(3C) and
t_getinfo(3C) routines. Use these limits to allocate buffers to store protocol-specific
transport addresses and options.
■ Do not send user data with connect requests or disconnect requests, such as t_connect(3C)
and t_snddis(3C). Not all transport protocols can use this method.
■ The buffers in the t_call structure used for t_listen(3C) must be large enough to hold
any data sent by the client during connection establishment. Use the T_ALL argument to
t_alloc(3C) to set maximum buffer sizes to store the address, options, and user data for the
current transport provider.
■ Do not specify a protocol address on t_bind(3C) on a client-side endpoint. The transport
provider should assign an appropriate address to the transport endpoint. A server should
retrieve its address for t_bind(3C) in a way that does not require knowledge of the transport
provider's name space.
■ Do not make assumptions about formats of transport addresses. Transport addresses should
not be constants in a program. For more information on transport selection, see Chapter 10,
“Transport Selection and Name-to-Address Mapping”.
■ The reason codes associated with t_rcvdis(3C) are protocol-dependent. Do not interpret
these reason codes if protocol independence is important.
■ The t_rcvuderr(3C) error codes are protocol dependent. Do not interpret these error codes
if protocol independence is a concern.
■ Do not code the names of devices into programs. The device node identifies a particular
transport provider and is not protocol independent. For more information on transport
selection, see Chapter 10, “Transport Selection and Name-to-Address Mapping”.
■ Do not use the optional orderly release facility of the connection mode service, provided
by t_sndrel and t_rcvrel, in programs targeted for multiple protocol environments. This
facility is not supported by all connection-based transport protocols. Using the facility
can prevent programs from successfully communicating with open systems. For more
information, see the t_sndrel(3C) and t_rcvrel(3C) man pages.
The following issues are related to transport independence, and can have some bearing on RPC
applications:
■ Privileged ports – Privileged ports are an artifact of the Berkeley Software Distribution
(BSD) implementation of the TCP/IP Internet Protocols. These ports are not portable. The
notion of privileged ports is not supported in the transport-independent environment.
■ Opaque addresses – Separating the portion of an address that names a host from the portion
of an address that names the service at that host cannot be done in a transport-independent
method. Be sure to change any code that assumes it can discern the host address of a
network service.
■ Broadcast – No transport-independent form of broadcast address exists.
Socket-to-XTI/TLI Equivalents
The following table shows approximate equivalents between XTI/TLI interfaces and socket
interfaces. The comment field describes the differences. If the comment column is blank, either
the interfaces are similar or no equivalent interface exists in either interface.
t_open(3C) socket(3C)
– socketpair(3C)
t_bind(3C) bind(3C) t_bind(3C) sets the queue depth for passive
sockets, but bind(3C) does not. For sockets,
the queue length is specified in the call to
listen(3C).
t_optmgmt(3C) getsockopt(3C) t_optmgmt(3C) manages only transport options.
getsockopt(3C) and setsockopt(3C) can
setsockopt(3C) manage options at the transport layer, but also
at the socket layer and at the arbitrary protocol
layer.
t_unbind(3C) –
t_close(3C) close(2)
t_sndvudata Send a data unit from one or more non-contiguous buffers. For more
information, see the t_sndvudata(3C) man page.
t_rcvvudata Receive a data unit into one or more non-contiguous buffers. For more
information, see the t_rcvvudata(3C) man page.
t_sndv Send data or expedited data from one or more non-contiguous buffers on
a connection. For more information, see the t_sndv(3C) man page.
t_rcvv Receive data or expedited data sent over a connection and put the data
into one or more non-contiguous buffers. For more information, see the
t_rcvv(3C) man pagees.
The XTI utility interface t_sysconf gets configurable XTI variables. The t_sndreldata
interface initiates and responds to an orderly release with user data. The t_rcvreldata receives
an orderly release indication or confirmation containing user data. For more information, see
the t_sysconf(3C), t_sndreldata(3C), and t_rcvreldata(3C) man pages.
Note - The additional interfaces t_sndreldata and t_rcvreldata are used only with a specific
transport called minimal OSI, which is not available on the Oracle Solaris platform. These
interfaces are not available for use in conjunction with Internet Transports (TCP or UDP).
The packet filtering hooks interface help develop value added network solutions at the kernel
level such as security solutions including packet filtering and firewall and network address
translation (NAT) solutions.
The packet filtering hooks interfaces provide the following capabilities:
■ Notification each time a packet appears at one of the hook points
■ Notification each time a new instance of IP is created to support a new zone booting that
requires an exclusive instance of IP
■ Kernel access to other basic network interface information such as interface names and
addresses
■ Interception of packets on the loopback interface
hook_alloc Allocate a hook_t data structure. For more information, see the
hook_alloc(9F) man page.
hook_free Free a hook_t structure that was allocated by hook_alloc(). For more
information, see the hook_free(9F) man page.
net_getifname Retrieve the name given to the specified network interface. For more
information, see the net_getifname(9F) man page.
net_getlifaddr Retrieve the network address information for each specified logical
interface. For more information, see the net_getlifaddr(9F) man page.
net_getmtu Retrieve information about the current MTU of the specified network
interface. For more information, see the net_getmtu(9F) man page.
net_hook_register(9F) Add a hook that allows callbacks to be registered with events that
belong to the specified network protocol. For more information, see the
net_hook_register(9F) man page.
net_inject Deliver network layer packets either into the kernel or onto the network.
For more information, see the net_inject(9F) man page.
net_isvalidchecksum Verify the layer 3 checksum and, in some cases, the layer 4
checksum in the specified packet. For more information, see the
net_isvalidchecksum(9F) man page.
net_kstat_create Allocate and initialize a new kstat(9S) structure for the specified
instance of IP. For more information, see the net_kstat_create(9F) man
page.
net_kstat_delete Remove a kstat for the specified instance of IP from the system. For
more information, see the net_kstat_delete(9F) man page.
net_lifgetnext Search all of the logical interfaces that are associated with a physical
network interface. For more information, see the net_lifgetnext(9F)
man page.
net_phygetnext Search all of the network interfaces that a network protocol owns. For
more information, see the net_phygetnext(9F) man page.
net_phylookup Attempt to retrieve the specified interface name for a network protocol.
For more information, see the net_phylookup(9F) man page.
net_routeto Indicate which network interface packets are sent. For more information,
see the net_routeto(9F) man page.
This section demonstrates the use of packet filtering hooks API to receive inbound IPv4
packets.
IP Instances
When using packet filtering hooks API, decide whether to accommodate multiple instances of
IP running in the kernel or to only interact with the global zone.
To know if the IP instances are present, register callback functions that are activated when
an instance is created, destroyed, and shut down. Use the net_instance_alloc() function
to allocate a net_instance_t packet event structure to store the function pointers. Use
net_instance_free() to free resources when you no longer need the callbacks and the
structure. Specify nin_name to give the structure instance a name. The nin_create() function
is called when a new instance of IP is created, and the nin_destroy() function is called when
an instance of IP is destroyed. Specify at least the nin_create() and nin_destroy() callbacks.
Specifying nin_shutdown() is optional unless the code will be exporting information to kstats.
To use kstats on a per-instance basis, use net_kstat_create() during the create callback. The
kstat information should cleaned up during the shutdown callback and not the destroy callback.
Use net_kstat_delete() to clean up kstat information.
extern void *mycreate(const netid_t);
net_instance_t *n;
n = net_instance_alloc(NETINFO_VERSION);
if (n != NULL) {
n->nin_create = mycreate;
n->nin_destroy = mydestroy;
n->nin_name = "my module";
if (net_instance_register(n) != 0)
net_instance_free(n);
}
If one or more instances of IP are present when net_instance_alloc() is called, the create
callback will be called for each currently active instance. The framework that supports the
callbacks ensures that only one of the create, destroy, or shutdown functions is active at any
one time for a given instance. The framework also ensures that once the create callback has
been called, the shutdown callback will only be called after create has completed. Similarly, the
destroy callback does not start until the shutdown callback is complete.
The mycreate() function in the following example shows how to a create callback. The
mycreate() function records the network instance identifier in its own private context structure
and registers a new callback to be called when a new protocol such as IPv4 or IPv6 is registered
with the framework.
If no zones are running (and therefore no instances other than the global zone), calling
net_instance_register() runs the create callback for the global zone. You must supply the
destroy callback so that net_instance_unregister() can be called later. Attempts to call
net_instance_register() with either the nin_create or nin_destroy fields set to NULL will
fail.
void *
mycreate(const netid_t id)
{
mytype_t *ctx;
The function mynewproto() will be called each time a network protocol is either added to or
removed from a networking instance. If registered network protocols are already operating
within the given instance, then the create callback will be called for each protocol that exists.
Protocol Registration
For the mynewproto() callback, the caller fills in only the proto argument. Neither an event nor
a hook name can be provided at this point. The following example looks for only the events that
announce the registration of the IPv4 protocol.
The next step in this function is to discover when events are added to the IPv4 protocol by using
the net_protocol_notify_register() interface to register the mynewevent() function.
static int
mynewproto(hook_notify_cmd_t cmd, void *arg, const char *proto,
const char *event, const char *hook)
{
mytype_t *ctx = arg;
if (strcmp(proto, NHF_INET) != 0)
return (0);
switch (cmd) {
case HN_REGISTER :
ctx->inet = net_protocol_lookup(s->id, proto);
net_protocol_notify_register(s->inet, mynewevent, ctx);
break;
case HN_UNREGISTER :
case HN_NONE :
break;
}
return (0);
}
The table below lists all three protocols that could be expected to be seen with the
mynewproto() callback. New protocols could be added in the future, so you must safely fail
(return the value 0) any unknown protocols.
Event Registration
Just as the handling of instances and protocols is dynamic, the handling of the events that live
under each protocol also is dynamic. Two types of events are supported by this API: network
interface events and packet events.
In the function below, the announcement for the presence of the event for inbound packets for
IPv4 is being checked for. When that announcement is seen, a hook_t structure is allocated,
describing the function to be called for each inbound IPv4 packet.
static int
mynewevent(hook_notify_cmd_t cmd, void *arg, const char *parent,
const char *event, const char *hook)
{
mytype_t *ctx = arg;
char buffer[32];
hook_t *h;
The function mynewevent() will be called for each event that is added and removed. The
following events are available.
For packet events, there is one specific event for each particular point in the IP stack. This is to
enable you to be selective about exactly where in the flow of the packets you wish to intercept
packets, without being overburdened by examining every packet event that happens inside the
kernel. For network interface events the model is different, in part because the events are much
lower in volume and because it is more likely that the developer will be interested in several of
them, not just one.
The network interface event announces one of the following events:
■ An interface is created (NE_PLUMB) or destroyed (NE_UNPLUMB).
■ An interface changes state to up (NE_UP) or down (NE_DOWN).
■ An interface has an address change (NE_ADDRESS_CHANGE).
New network interface events could be added in the future, so you must always return 0 for any
unknown or unrecognized event that the callback function receives.
To illustrate the difference between accepting a packet and allowing the function to return
normally with what is required to drop a packet, the code below prints out the source and
destination address of every 100th packet and then drops the packet, introducing a packet loss
of 1%.
static int
mypkthook(hook_event_token_t tok, hook_data_t data, void *arg)
{
static int counter = 0;
mytupe_t *ctx = arg;
hook_pkt_event_t *pkt = (hook_pkt_event_t)data;
struct ip *ip;
size_t bytes;
bytes = msgdsize(pkt->hpe_mb);
ip = (struct ip *)pkt->hpe_hdr;
counter++;
if (counter == 100) {
printf("drop %d bytes received from %x to %x\n", bytes,
ntohl(ip->ip_src.s_addr), ntohl(ip->ip_dst.s_addr));
counter = 0;
freemsg(*pkt->hpe_mp);
*pkt->hpe_mp = NULL;
pkt->hpe_mb = NULL;
pkt->hpe_hdr = NULL;
return (1);
}
return (0);
}
Packets received by this function, and all others that are called as a callback from a packet
event, are received one at a time. There is no chaining together of packets with this interface,
so you should expect only one packet per call and expect b_next to always be NULL. While
there is no other packet, a single packet may be comprised of several mblk_t structures chained
together with b_cont.
Use the following commands to compile this code into a working kernel module on a 64-bit
system:
* Copyright (c) 2012, Oracle and/or its affiliates. All rights reserved.
*/
/*
* This file is a test module written to test the netinfo APIs in
/*
* Module linkage information for the kernel.
*/
static struct modldrv modlmisc = {
&mod_miscops, /* drv_modops */
"neti test module", /* drv_linkinfo */
};
hook_t *v4_h_in;
int sentinel_10;
hook_t *v6_h_in;
int sentinel_11;
hook_t *arp_h_in;
int sentinel_12;
net_handle_t v4;
int sentinel_13;
net_handle_t v6;
int sentinel_14;
net_handle_t arp;
int sentinel_15;
} scratch_t;
static void
recall_add_do(int mydo)
{
mutex_enter(&recall_lock);
recall_doing[recall_doidx] = mydo;
recall_doidx++;
recall_steps++;
if ((recall_steps % 1000000) == 0)
printf("stamp %d %d\n", recall_steps, recall_doidx);
if (recall_doidx == MAX_RECALL_DOLOG)
recall_doidx = 0;
mutex_exit(&recall_lock);
}
mutex_enter(&recall_lock);
i = recall_alloced++;
if (recall_alloced == MAX_RECALL_DOLOG)
recall_alloced = 0;
mutex_exit(&recall_lock);
mutex_enter(&recall_lock);
i = recall_freed++;
if (recall_freed == MAX_RECALL_DOLOG)
recall_freed = 0;
mutex_exit(&recall_lock);
recall_freelog[i] = ptr;
kmem_free(ptr, len);
}
ASSERT(s->sentinel_8 == 0);
ASSERT(s->sentinel_9 == 0);
ASSERT(s->sentinel_10 == 0);
ASSERT(s->sentinel_11 == 0);
ASSERT(s->sentinel_12 == 0);
ASSERT(s->sentinel_13 == 0);
ASSERT(s->sentinel_14 == 0);
ASSERT(s->sentinel_15 == 0);
}
int
_init(void)
{
int error;
bzero(recall_doing, sizeof(recall_doing));
mutex_init(&recall_lock, NULL, MUTEX_DRIVER, NULL);
error = recall_init();
if (error == DDI_SUCCESS) {
error = mod_install(&modlinkage);
if (error != 0)
recall_fini();
}
return (error);
}
int
_fini(void)
{
int error;
recall_continue = 0;
if (recall_timeout != NULL) {
untimeout(recall_timeout);
recall_timeout = NULL;
}
error = mod_remove(&modlinkage);
if (error == 0) {
recall_fini();
delay(drv_usectohz(500000)); /* .5 seconds */
mutex_destroy(&recall_lock);
ASSERT(recall_inited == 0);
return (error);
}
int
_info(struct modinfo *info)
{
return(0);
}
static int
recall_init()
{
recall_global = net_instance_alloc(NETINFO_VERSION);
strcpy(recall_myname, "full_");
bcopy(((char *)&recall_global) + 4, recall_myname + 5, 4);
recall_myname[5] = (recall_myname[5] & 0x7f) | 0x20;
recall_myname[6] = (recall_myname[6] & 0x7f) | 0x20;
recall_myname[7] = (recall_myname[7] & 0x7f) | 0x20;
recall_myname[8] = (recall_myname[8] & 0x7f) | 0x20;
recall_myname[9] = '\0';
recall_global->nin_create = recall_create;
recall_global->nin_shutdown = recall_shutdown;
recall_global->nin_destroy = recall_destroy;
recall_global->nin_name = recall_myname;
if (net_instance_register(recall_global) != 0)
return (DDI_FAILURE);
return (DDI_SUCCESS);
}
static void
recall_fini()
{
if (recall_global != NULL) {
net_instance_unregister(recall_global);
net_instance_free(recall_global);
recall_global = NULL;
}
}
static void
recall_expire(void *arg)
if (!recall_continue)
return;
recall_fini();
if (!recall_continue)
return;
if (!recall_continue)
return;
if (recall_init() == DDI_SUCCESS)
recall_timeout = timeout(recall_expire, NULL,
drv_usectohz(5000)); /* .005 seconds */
}
static void *
recall_create(const netid_t id)
{
scratch_t *s = kmem_zalloc(sizeof(*s), KM_SLEEP);
if (s == NULL)
return (NULL);
recall_inited++;
s->id = id;
return s;
}
static void
recall_shutdown(const netid_t id, void *arg)
{
scratch_t *s = arg;
ASSERT(s != NULL);
recall_add_do(__LINE__);
net_instance_notify_unregister(id, recall_newproto);
if (s->v4 != NULL) {
if (s->v4_h_in != NULL) {
net_hook_unregister(s->v4, NH_PHYSICAL_IN,
s->v4_h_in);
recall_strfree(s->v4_h_in->h_name);
hook_free(s->v4_h_in);
s->v4_h_in = NULL;
}
if (net_protocol_notify_unregister(s->v4, recall_newevent))
cmn_err(CE_WARN,
"v4:net_protocol_notify_unregister(%p) failed",
s->v4);
net_protocol_release(s->v4);
s->v4 = NULL;
}
if (s->v6 != NULL) {
if (s->v6_h_in != NULL) {
net_hook_unregister(s->v6, NH_PHYSICAL_IN,
s->v6_h_in);
recall_strfree(s->v6_h_in->h_name);
hook_free(s->v6_h_in);
s->v6_h_in = NULL;
}
if (net_protocol_notify_unregister(s->v6, recall_newevent))
cmn_err(CE_WARN,
"v6:net_protocol_notify_unregister(%p) failed",
s->v6);
net_protocol_release(s->v6);
s->v6 = NULL;
}
if (s->arp != NULL) {
if (s->arp_h_in != NULL) {
net_hook_unregister(s->arp, NH_PHYSICAL_IN,
s->arp_h_in);
recall_strfree(s->arp_h_in->h_name);
hook_free(s->arp_h_in);
s->arp_h_in = NULL;
}
if (net_protocol_notify_unregister(s->arp, recall_newevent))
cmn_err(CE_WARN,
"arp:net_protocol_notify_unregister(%p) failed",
s->arp);
net_protocol_release(s->arp);
s->arp = NULL;
}
}
static void
ASSERT(s != NULL);
recall_assert(s);
ASSERT(s->v4 == NULL);
ASSERT(s->v6 == NULL);
ASSERT(s->arp == NULL);
ASSERT(s->v4_h_in == NULL);
ASSERT(s->v6_h_in == NULL);
ASSERT(s->arp_h_in == NULL);
kmem_free(s, sizeof(*s));
static int
recall_newproto(hook_notify_cmd_t cmd, void *arg, const char *parent,
const char *event, const char *hook)
{
scratch_t *s = arg;
s->event_notify++;
recall_assert(s);
switch (cmd) {
case HN_REGISTER :
if (strcmp(parent, NHF_INET) == 0) {
s->v4 = net_protocol_lookup(s->id, parent);
net_protocol_notify_register(s->v4, recall_newevent, s);
} else if (strcmp(parent, NHF_INET6) == 0) {
s->v6 = net_protocol_lookup(s->id, parent);
net_protocol_notify_register(s->v6, recall_newevent, s);
} else if (strcmp(parent, NHF_ARP) == 0) {
s->arp = net_protocol_lookup(s->id, parent);
net_protocol_notify_register(s->arp,recall_newevent, s);
}
break;
case HN_UNREGISTER :
case HN_NONE :
break;
}
return 0;
}
static int
recall_do_event(hook_event_token_t tok, hook_data_t data, void *ctx)
{
scratch_t *s = ctx;
recall_assert(s);
return (0);
}
static int
recall_newevent(hook_notify_cmd_t cmd, void *arg, const char *parent,
const char *event, const char *hook)
{
scratch_t *s = arg;
char buffer[32];
hook_t *h;
recall_assert(s);
if (strcmp(event, NH_PHYSICAL_IN) == 0) {
sn
printf(buffer, sizeof(buffer),
if (strcmp(parent, NHF_INET) == 0) {
s->v4_event_notify++;
if (h != NULL) {
s->v4_h_in = h;
net_hook_register(s->v4, (char *)event, h);
}
net_event_notify_register(s->v4, (char *)event,
recall_newhook, s);
return (0);
}
static int
recall_newhook(hook_notify_cmd_t cmd, void *arg, const char *parent,
const char *event, const char *hook)
{
scratch_t *s = arg;
recall_assert(s);
if (strcmp(parent, NHF_INET) == 0) {
s->v4_hook_notify++;
return (0);
}
int len;
if (str != NULL) {
len = strlen(str);
recall_free(str, len + 1);
}
}
len = strlen(str);
newstr = recall_alloc(len, wait);
if (newstr != NULL)
strcpy(newstr, str);
return (newstr);
}
* PAMP driver - Ping Amplifier enables Solaris to send two ICMP echo
* responses for every ICMP request.
* This example provides a test module of the Oracle Solaris PF-hooks
* (netinfo(9f)) [Link] example discovers ICMP echo
* implementation by intercepting inbound packets using
* physical-in` event hook.
* If the intercepted packet happens to be a ICMPv4 echo request,
* the module will generate a corresponding ICMP echo response
* which will then be sent to the network interface card using
* the net_inject(9f) function. The original ICMPv4 echo request will be
* allowed to enter the the IP stack so that the request can be
* processed by the destination IP stack.
* The destination stack in turn will send its own ICMPv4 echo response.
* Therefore there will be two ICMPv4 echo responses for a single
* ICMPv4 echo request.
*
* The following example code demonstrates two key functions of netinfo(9f) API:
*
* Packet Interception
*
* Packet Injection
*
* In order to be able to talk to netinfo(9f), the driver must allocate and
* register its own net_instance_t - `pamp_ninst`. This happens in the
* pamp_attach() function, which imlements `ddi_attach` driver [Link]
* net_instance_t registers three callbacks with netinfo(9f) module:
* _create
* _shutdown
* _destroy
* The netinfo(9f) command uses these functions to request the driver to
* create, shutdown, or destroy the driver context bound to a particular IP instance.
* This will enable the driver to handle packets for every IP stack found in
* the Oracle Solaris kernel. For purposes of this example, the driver is always
* implicitly bound to every IP instance.
*/
pamp_drv = pamp_drv.o
pamp_drv.conf: pamp_drv
echo 'name="pamp_drv" parent="pseudo" instance=0;' > pamp_drv.conf
pamp_drv: pamp_drv.o
ld -dy -r -Ndrv/ip -Nmisc/neti -Nmsic/hook -o pamp_drv pamp_drv.o
pamp_drv.o: pamp_drv.c
cc -m64 -xmodel=kernel -D_KERNEL -c -o $@ $<
install:
cp pamp_drv /usr/kernel/drv/`isainfo -k`/pamp_drv
cp pamp_drv.conf /usr/kernel/drv/pamp_drv.conf
uninstall:
rm -rf /usr/kernel/drv/`isainfo -k`/pamp_drv
rm -rf /usr/kernel/drv/pamp_drv.conf
clean:
rm -f pamp_drv.o pamp_drv pamp_drv.conf
*End Makefile */
*
* The Makefile shown above will build a pamp_drv driver binary
* and pamp_drv.conf file for driver configuration. If you are
* building on a test machine, use `make install` to place
add_drv pam_drv
* Run the following command to unload the driver to kernel:
rem_drv pamp_drv
*
* To check if your driver is working you need to use a snoop
* and `ping` which will be running
* on a remote host. Start snoop on your network interface:
*
* The snoop should show there are two ICMP echo replies for every ICMP echo
* request. The expected output should be similar to the snoop output shown below:
* [Link] -> [Link] ICMP Echo request (ID: 16652 Sequence number: 0)
* [Link] -> [Link] ICMP Echo reply (ID: 16652 Sequence number: 0)
* [Link] -> [Link] ICMP Echo reply (ID: 16652 Sequence number: 0)
* [Link] -> [Link] ICMP Echo request (ID: 16652 Sequence number: 1)
* [Link] -> [Link] ICMP Echo reply (ID: 16652 Sequence number: 1)
* [Link] -> [Link] ICMP Echo reply (ID: 16652 Sequence number: 1)
* [Link] -> [Link] ICMP Echo request (ID: 16652 Sequence number: 2)
* [Link] -> [Link] ICMP Echo reply (ID: 16652 Sequence number: 2)
* [Link] -> [Link] ICMP Echo reply (ID: 16652 Sequence number: 2)
*/
#include <sys/atomic.h>
#include <sys/ksynch.h>
#include <sys/ddi.h>
#include <sys/modctl.h>
#include <sys/random.h>
#include <sys/sunddi.h>
#include <sys/stream.h>
#include <sys/devops.h>
#include <sys/stat.h>
#include <sys/modctl.h>
#include <sys/neti.h>
#include <sys/hook.h>
#include <sys/hook_event.h>
#include <sys/synch.h>
#include <inet/ip.h>
#include <netinet/in_systm.h>
#include <netinet/in.h>
#include <netinet/ip.h
#include <netinet/ip_icmp.h>
/*
* This is a context for the driver. The context is allocated by
* pamp_nin_create() callback for every IP instance found in kernel.
*/
typedef struct pamp_ipstack
{
hook_t *pamp_phyin;
int pamp_hook_ok;
net_handle_t pamp_ipv4;
} pamp_ipstack_t;
static kmutex_t pamp_stcksmx;
/*
* The netinstance, which passes driver callbacks to netinfo module.
*/
static net_instance_t *pamp_ninst = NULL;
/*
* Solaris kernel driver APIs.
*/
static int pamp_getinfo(dev_info_t *, ddi_info_cmd_t, void *, void **);
static int pamp_attach(dev_info_t *, ddi_attach_cmd_t);
static int pamp_detach(dev_info_t *, ddi_detach_cmd_t);static dev_info_t *pamp_dev_info
= NULL;
/*
* Driver does not support any device operations.
*/
ddi_quiesce_not_needed, /* quiesce */
};
/*
* Netinfo stack instance create/destroy/shutdown routines.
*/
static void *pamp_nin_create(const netid_t);
static void pamp_nin_destroy(const netid_t, void *);
static void pamp_nin_shutdown(const netid_t, void *);
/*
* Callback to process intercepted packets delivered by hook event
*/
static int pamp_pkt_in(hook_event_token_t, hook_data_t, void *);
/*
* Kernel driver getinfo operation
*/
static int
pamp_getinfo(dev_info_t *dip, ddi_info_cmd_t cmd, void * arg, void **resultp)
{
int e;
switch (cmd) {
case DDI_INFO_DEVT2DEVINFO:
*resultp = pamp_dev_info;
e = DDI_SUCCESS;
break;
case DDI_INFO_DEVT2INSTANCE:
*resultp = NULL;
e = DDI_SUCCESS;
break;
default:
e = DDI_FAILURE;
}
return (e);
}
/*
* Kernel driver attach operation. The job of the driver is to create a net
* instance for our driver and register it with netinfo(9f)
*/
static int pamp_attach(dev_info_t *dip, ddi_attach_cmd_t cmd)
{
int rc;
#define RETURN(_x_)
do {
mutex_exit(&pamp_stcksmx);
return (_x_);
} while (0)
/*
* Fail for all commands except DDI_ATTACH.
*/
if (cmd != DDI_ATTACH) {
return (DDI_FAILURE);
}
mutex_enter(&pamp_stcksmx);
/*
* It is an error to apply attach operation on a driver which is already
* attached.
*/
if (pamp_ninst != NULL) {
RETURN(DDI_FAILURE);
}
/*
* At most one driver instance is allowed (instance 0).
*/
if (ddi_get_instance(dip) != 0) {
RETURN(DDI_FAILURE);
}
/*
* Create and register pamp net instance. Note we are assigning
* callbacks _create, _destroy, _shutdown. These callbacks will ask
* our driver to create/destroy/shutdown our IP driver instances.
*/
pamp_ninst = net_instance_alloc(NETINFO_VERSION);
if (pamp_ninst == NULL) {
ddi_remove_minor_node(dip, NULL);
RETURN(DDI_FAILURE);
}
pamp_ninst->nin_name = "pamp";
pamp_ninst->nin_create = pamp_nin_create;
pamp_ninst->nin_destroy = pamp_nin_destroy;
pamp_ninst->nin_shutdown = pamp_nin_shutdown;
pamp_dev_info = dip;
mutex_exit(&pamp_stcksmx);
/*
* Although it is not shown in the following example, it is
* recommended that all mutexes/exclusive locks be released before *
* calling net_instance_register(9F) to avoid a recursive lock
* entry. As soon as pamp_ninst is registered, the
* net_instance_register(9f) will call pamp_nin_create() callback.
* The callback will run in the same context as the one in which
* pamp_attach() is running. If pamp_nin_create() grabs the same
* lock held already by pamp_attach(), then such a lock is being
* operated on recursively.
*/
(void) net_instance_register(pamp_ninst);
return (DDI_SUCCESS);
#undef RETURN
}
/*
* The detach function will unregister and destroy our driver netinstance. The same
rules
* for exclusive locks/mutexes introduced for attach operation apply to detach.
* The netinfo will take care to call the shutdown()/destroy() callbacks for
* every IP stack instance.
*/
static int
pamp_detach(dev_info_t *dip, ddi_detach_cmd_t cmd)
{
pamp_ipstack_t *pamp_ipstack;
net_instance_t *ninst = NULL;
/*
* It is an error to apply detach operation on driver, when another
* detach operation is running (in progress), or when detach operation
* is complete (pamp_ninst).
*/
mutex_enter(&pamp_stcksmx);
if (pamp_ninst == NULL) {
mutex_exit(&pamp_stcksmx);
return (DDI_FAILURE);
}
ninst = pamp_ninst;
pamp_ninst = NULL;
mutex_exit(&pamp_stcksmx);
/*
* Calling net_instance_unregister(9f) will invoke pamp_nin_destroy()
* for every pamp_ipstack instance created so far. Therefore it is advisable
* to not hold any mutexes, because it might get grabbed by pamp_nin_destroy()
function.
*/
net_instance_unregister(ninst);
net_instance_free(ninst);
(void) ddi_get_instance(dip);
ddi_remove_minor_node(dip, NULL);
return (DDI_SUCCESS);
}
/*
* Netinfo callback, which is supposed to create an IP stack context for our
* ICMP echo server.
*
* NOTE: NULL return value is not interpreted as a failure here. The
* pamp_nin_shutdown()/pamp_nin_destroy() will receive NULL pointer for IP stack
* instance with given `netid` id.
*
*/
static void *
pamp_nin_create(const netid_t netid)
{
pamp_ipstack_t *pamp_ipstack;
if (pamp_ipstack == NULL) {
return (NULL);
}
pamp_ipstack->pamp_hook_ok = net_hook_register(
pamp_ipstack->pamp_ipv4, NH_PHYSICAL_IN, pamp_ipstack->pamp_phyin);
if (pamp_ipstack->pamp_hook_ok != 0) {
net_protocol_release(pamp_ipstack->pamp_ipv4);
hook_free(pamp_ipstack->pamp_phyin);
kmem_free(pamp_ipstack, sizeof (pamp_ipstack_t));
return (NULL);
}
return (pamp_ipstack);
}
/*
* This event is delivered right before the particular stack instance is
* destroyed.
*/
static void
pamp_nin_shutdown(const netid_t netid, void *stack)
{
return;
}
/*
* Important to note here that the netinfo(9f) module ensures that no
* no pamp_pkt_in() is "running" when the stack it is bound to is being destroyed.
*/
static void
pamp_nin_destroy(const netid_t netid, void *stack)
{
pamp_ipstack_t *pamp_ipstack = (pamp_ipstack_t *)stack;
/*
* Remember stack can be NULL! The pamp_nin_create() function returns
* NULL on failure. The return value of pamp_nin_create() function will
* be `kept` in netinfo module as a driver context for particular IP
* instance. As soon as the instance is destroyed the NULL value
* will appear here in pamp_nin_destroy(). Same applies to
* pamp_nin_shutdown(). Therefore our driver must be able to handle
* NULL here.
*/
if (pamp_ipstack == NULL)
return;
/*
* If driver has managed to initialize packet hook, then it has to be
* unhooked here.
*/
if (pamp_ipstack->pamp_hook_ok != -1) {
(void) net_hook_unregister(pamp_ipstack->pamp_ipv4,
NH_PHYSICAL_IN, pamp_ipstack->pamp_phyin);
hook_free(pamp_ipstack->pamp_phyin);
(void) net_protocol_release(pamp_ipstack->pamp_ipv4);
}
/*
* Packet hook handler
*
* Function receives intercepted IPv4 packets coming from NIC to IP stack. If
* inbound packet is ICMP ehco request, then function will generate ICMP echo
* response and use net_inject() to send it to network. Function will also let
* ICMP echo request in, so it will be still processed by destination IP stack,
* which should also generate its own ICMP echo response. The snoop should show
* you there will be two ICMP echo responses leaving the system where the pamp
* driver is installed
*/
static int
pamp_pkt_in(hook_event_token_t ev, hook_data_t info, void *arg)
{
hook_pkt_event_t *hpe = (hook_pkt_event_t *)info;
phy_if_t phyif;
struct ip *ip;
/*
* Since our pamp_pkt_in callback is hooked to PHYSICAL_IN hook pkt.
* event only, the physical interface index will always be passed as
* hpe_ifp member.
*
* If our hook processes PHYSICAL_OUT hook pkt event, then
* the physical interface index will be passed as hpe_ofp member.
*/
phyif = hpe->hpe_ifp;
ip = hpe->hpe_hdr;
if (ip->ip_p == IPPROTO_ICMP) {
mblk_t *mb;
/*
* All packets are copied/placed into a continuous buffer to make
* parsing easier.
*/
if ((mb = msgpullup(hpe->hpe_mb, -1)) != NULL) {
struct icmp *icmp;
pamp_ipstack_t *pamp_ipstack = (pamp_ipstack_t *)arg;
ip = (struct ip *)mb->b_rptr;
icmp = (struct icmp *)(mb->b_rptr + IPH_HDR_LENGTH(ip));
if (icmp->icmp_type == ICMP_ECHO) {
struct in_addr addr;
uint32_t sum;
mblk_t *echo_resp = copymsg(mb);
net_inject_t ninj;
/*
* We need to make copy of packet, since we are
* going to turn it into ICMP echo response.
*/
if (echo_resp == NULL) {
return (0);
}
ip = (struct ip *)echo_resp->b_rptr;
addr = ip->ip_src;
ip->ip_src = ip->ip_dst;
ip->ip_dst = addr;
icmp = (struct icmp *) (echo_resp->b_rptr + IPH_HDR_LENGTH(ip));
icmp->icmp_type = ICMP_ECHO_REPLY;
sum = ~ntohs(icmp->icmp_cksum) & 0xffff;
sum += (ICMP_ECHO_REQUEST - ICMP_ECHO_REPLY);
icmp->icmp_cksum =
htons(~((sum >> 16) + (sum & 0xffff)));
/*
* Now we have assembled an ICMP response with
* correct chksum. It's time to send it out.
* We have to initialize command for
* net_inject(9f) -- ninj.
*/
ninj.ni_packet = echo_resp;
ninj.ni_physical = phyif;
/*
* As we are going use NI_QUEUE_OUT to send
* our ICMP response, we don't need to set up
/*
* 0 as return value will let packet in.
*/
return (0);
}
/*
* Kernel module handling.
*/
int init()
{
mutex_init(&pamp_stcksmx, "pamp_mutex", MUTEX_DRIVER, NULL);
return (mod_install(&pamp_modlink));
}
int fini()
{
int rv;
rv = mod_remove(&pamp_modlink);
return (rv);
}
This chapter describes selecting transports and resolving network addresses. This chapter
further describes interfaces that enable you to specify the available communication protocols
for an application and explains additional interfaces that provide direct mapping of names to
network addresses.
Note - In this chapter, the terms network and transport are used interchangeably. The terms
refer to the programmable interface that conforms to the transport layer of the OSI Reference
Mode. The term network is also used to refer to the physical collection of computers that are
connected through some electronic medium.
Transport Selection
Caution - The interfaces that are described in this chapter are multithread safe. "Multithread
safe" means that you can use applications that contain transport selection interface calls freely
in a multithreaded application. These interface calls do not provide linear scalability because the
calls are not re-entrant.
A distributed application must use a standard interface to the transport services to be portable to
different protocols. Transport selection services provide an interface that allows an application
to select which protocols to use. This interface makes an application independent of protocol
and medium.
Transport selection allows a client application to try each available transport until the client
establishes communication with a server. Transport selection enables request acceptance on
multiple transports by server applications. The applications can then communicate over a
number of protocols. Transports can be tried in either the order specified by the local default
sequence or in an order specified by the user.
Choosing from the available transports is the responsibility of the application. The transport
selection mechanism makes that selection uniform and simple.
Name-to-Address Mapping
Name-to-address mapping enables an application to obtain the address of a service on a
specified host independent of the transport used. Name-to-address mapping consists of the
following interfaces:
netdir_getbyname Maps the host and service name to a set of addresses. For more
information, see the netdir_getbyname(3C) man page.
netdir_getbyaddr Maps addresses into host and service names. For more information, see
the netdir_getbyaddr(3C) man page.
uaddr2taddr The universal address is translated into a netbuf structure. For more
information, see the uaddr2taddr(3C) man page.
netdir_perror Displays a message stating why one of the routines that map
name-to-address failed on stderr. For more information, see the
netdir_perror(3C) man page.
netdir_sperror Returns a string containing the error message stating why one of the
routines that map name-to-address failed. For more information, see the
netdir_sperror(3C) man page.
The first argument of each routine points to a netconfig structure that describes a transport.
The routine uses the array of directory-lookup library paths in the netconfig structure to call
each path until the translation succeeds. For more information, see the netconfig(5) man page.
Note - The following libraries no longer exist in the Oracle Solaris environment: [Link],
[Link], and [Link]. For more information on this change, see the [Link](5) man
page and the NOTES section of the gethostbyname(3C) man page.
[Link] Library
Name–to–address translation files for the [Link] library are created by the system
administrator. The system administrator also maintains these translation files. The [Link]
files are /etc/net/transport-name/hosts and /etc/net/transport-name/services. transport-
name is the local name of the transport that accepts string addresses, which is specified in
the network ID field of the /etc/netconfig file. For example, the host file for ticlts would
be /etc/net/ticlts/hosts, and the service file for ticlts would be /etc/net/ticlts/
services.
Most string addresses do not distinguish between host and service. However, separating
the string into a host part and a service part is consistent with other transports. The /etc/
net/transport-name/hosts file contains a text string that is assumed to be the host address,
followed by the host name:
joyluckaddr joyluck
carpediemaddr carpediem
thehopaddr thehop
pongoaddr pongo
rpcbind rpc
listen serve
The routines create the full-string address by concatenating the host address, a period (.), and
the service address. For example, the address of the listen service on pongo is pongoaddr.
serve.
When an application requests the address of a service on a particular host on a transport that
uses this library, the host name must be in /etc/net/transport/hosts. The service name must
be in /etc/net/transport/services. If either name is missing, the name-to-address translation
fails.
netdir_getbyname maps the host and service name specified in service to a set of addresses
that are consistent with the transport identified in nconf. For more information on the
nd_hostserv and nd_addrlist structures, see the netdir(3C) man page. A pointer to the
addresses is returned in addrs.
To find all addresses of a host and service on all available transports, call netdir_getbyname
with each netconfig structure returned by either getnetpath or getnetconfig. For
more information, see the netdir_getbyname(3C), netconfig(5), getnetpath(3C), and
getnetconfig(3C) man pages.
int netdir_getbyaddr(struct netconfig *nconf,
struct nd_hostservlist **service, struct netbuf *netaddr);
netdir_getbyaddr maps addresses into host and service names. The interface is called with
an address in netaddr and returns a list of host-name and service-name pairs in service. For
information about the nd_hostservlist structure, see the netdir(3C) man page.
void netdir_free(void *ptr, int struct_type);
The netdir_free routine frees structures allocated by the name-to-address translation routines.
For more information, see the netdir_free(3C) man page. The parameters can take the values
that are shown in the following table.
struct_type ptr
The universal address pointed to by uaddr is translated into a netbuf structure. nconf specifies
the transport for which the address is valid.
Option Description
ND_SET_BROADCAST Sets the transport for broadcast if the transport supports broadcast
ND_SET_RESERVEDPORT Enables application binding to reserved ports if allowed by the
transport
ND_CHECK_RESERVEDPORT Verifies that an address corresponds to a reserved port if the transport
supports reserved ports
ND_MERGEADDR Transforms a locally meaningful address into an address to which
client hosts can connect
The netdir_perror routine displays a message stating why one of the routines that map name-
to-address failed on stderr. For more information, see the netdir_perror(3C) man page.
The netdir_sperror routine returns a string containing the error message stating why
one of the routines that map name-to-address failed. For more information, see the
netdir_sperror(3C) man page.
char *netdir_sperror(void);
#include <netconfig.h>
#include <netdir.h>
#include <sys/tiuser.h>
* structure.
*/
printf("Transport provider name: %s\n", nconf->nc_netid);
printf("Transport protocol family: %s\n", nconf->nc_protofmly);
printf("The transport device file: %s\n", nconf->nc_device);
printf("Transport provider semantics: ");
switch (nconf->nc_semantics) {
case NC_TPI_COTS:
printf("virtual circuit\n");
break;
case NC_TPI_COTS_ORD:
printf("virtual circuit with orderly release\n");
break;
case NC_TPI_CLTS:
printf("datagram\n");
break;
}
/*
* Get the address for service "date" on the host
* named "gandalf" over the transport provider
* specified in the netconfig structure.
*/
if (netdir_getbyname(nconf, &nd_hostserv, &nd_addrlistp) != ND_OK) {
printf("Cannot determine address for service\n");
netdir_perror(argv[0]);
continue;
}
printf("<%d> addresses of date service on gandalf:\n",
nd_addrlistp->n_cnt);
/*
* Print out all addresses for service "date" on
* host "gandalf" on current transport provider.
*/
netbufp = nd_addrlistp->n_addrs;
for (i = 0; i < nd_addrlistp->n_cnt; i++, netbufp++) {
uaddr = taddr2uaddr(nconf,netbufp);
printf("%s\n",uaddr);
free(uaddr);
}
netdir_free( nd_addrlistp, ND_ADDRLIST );
}
endnetconfig(handlep);
This chapter describes writing and porting real-time applications to run on Oracle Solaris OS.
This chapter is intended for programmers experienced in writing real-time applications and for
administrators familiar with real-time processing and the Oracle Solaris system.
You can get real-time response when certain conditions are met. This section identifies these
conditions and some of the more significant design errors.
Most of the potential problems described here can degrade the response time of the system. One
of the potential problems can freeze a workstation. Other, more subtle, mistakes are priority
inversion and system overload.
scheduling of a thread, the thread must be created as a bound thread. The thread's LWP must be
run in the RT scheduling class. The locking of memory and early dynamic binding is effective
for all threads in a process.
When a real-time process has the highest priority, the process acquires the processor within the
specified dispatch latency period of becoming runnable. For more information, see “Dispatch
Latency” on page 294. The process continues to run as long as it is the highest priority
runnable process.
A real-time process can lose control and can also be unable to gain control of the processor
because of other system events. These events include external events, such as interrupts,
resource starvation, waiting on external events such as synchronous I/O, and preemption by a
higher priority process.
Real-time scheduling does not apply to system initialization and termination services such as
open and close. For more information, see the open(2) and close(2) man pages.
The problems described in this section increase the response time of the system to varying
extents. The degradation can be serious enough to cause an application to miss a critical
deadline.
Real-time processing can also impair the operation of aspects of other applications that are
active on a system that is running a real-time application. Because real-time processes have
higher priority, time-sharing processes can be prevented from running for significant amounts
of time. This phenomenon can cause interactive activities, such as displays and keyboard
response time, to slow noticeably.
System response running Oracle Solaris OS provides no bounds to the timing of I/O events.
This means that synchronous I/O calls should never be included in any program segment whose
execution is time critical. Even program segments that permit very large time bounds must
not perform synchronous I/O. Mass storage I/O is such a case, where causing a read or write
operation hangs the system while the operation takes place.
A common application mistake is to perform I/O to get error message text from disk.
Performing I/O in this fashion should be done from an independent process or independent
thread. This independent process or independent thread should not run in real time.
Interrupt Servicing
Interrupt priorities are independent of process priorities. The priorities that are set for a group
of processes are not inherited by the services of hardware interrupts that result from those
processes' actions. As a consequence, devices controlled by high-priority real-time processes do
not necessarily have high-priority interrupt processing.
Shared Libraries
Real-time programs can set the environment variable LD_BIND_NOW to a non-NULL value when
the program is invoked. Setting the value of this environment value allows the use of shared
libraries while avoiding dynamic binding. This procedure also forces all dynamic linking to
be bound before the program begins execution. For more information, see Oracle Solaris 11.4
Linkers and Libraries Guide.
Priority Inversion
A time-sharing process can block a real-time process by acquiring a resource that is required
by a real-time process. Priority inversion occurs when a higher priority process is blocked by a
lower priority process. The term blocking describes a situation in which a process must wait for
one or more processes to relinquish control of resources. Real-time processes might miss their
deadlines if this blocking is prolonged.
Consider the case that is depicted in the following figure, where a high-priority process
requires a shared resource. A lower priority process holds the resource and is preempted by an
intermediate priority process, blocking the high-priority process. Any number of intermediate
processes can be involved. All intermediate processes must finish executing, as well as the
lower-priority process' critical section. This series of executions can take an arbitrarily long
time.
This issue and the methods of dealing with this issue are described in “Mutual Exclusion Lock
Attributes” in Multithreaded Programming Guide.
Sticky Locks
A page is permanently locked into memory when its lock count reaches 65535 (0xFFFF). The
value 0xFFFF is defined by the implementation and might change in future releases. Pages that
are locked this way cannot be unlocked.
Runaway real-time processes can cause the system to halt. Such runaway processes can also
slow the system response so much that the system appears to halt.
Note - If you have a runaway process on a SPARC system, press Stop-A. You might have to do
press Stop-A more than one time. If pressing Stop-A does not work, turn the power off, wait a
moment, then turn the power back on. If you have a runaway process on a non-SPARC system,
turn the power off, wait a moment, then turn the power back on.
When a high priority real-time process does not relinquish control of the CPU, you must break
the infinite loop in order to regain control of the system. Such a runaway process does not
respond to Control-C. Attempts to use a shell set at a higher priority than the priority of the
runaway process do not work.
Asynchronous I/O operations do not always execute in the sequence in which the operations
are queued to the kernel. Asynchronous operations do not necessarily return to the caller in the
sequence in which the operations were performed.
If a single buffer is specified for a rapid sequence of calls to aioread, the buffer's state is
uncertain. The uncertainty of the buffer's state is from the time the first call is made to the time
the last result is signaled to the caller.
An individual aio_result_t structure can be used for only one asynchronous operation. The
operation can be a read or a write operation.
Real-time Files
Oracle Solaris OS provides no facilities to ensure that files are allocated as physically
contiguous.
For regular files, the read and write operations are always buffered. An application can use
mmap and msync to effect direct I/O transfers between secondary storage and process memory.
For more information, see the read(2), write(2), mmap(2), and msync(3C) man pages.
This section describes the Oracle Solaris real-time scheduler, its priority queue, and how to use
system calls and utilities that control scheduling.
Dispatch Latency
The most significant element in scheduling behavior for real-time applications is the provision
of a real-time scheduling class. The standard time-sharing scheduling class is not suitable for
real-time applications because this scheduling class treats every process equally. The standard
time-sharing scheduling class has a limited notion of priority. Real-time applications require a
scheduling class in which process priorities are taken as absolute. Real-time applications also
require a scheduling class in which process priorities are changed only by explicit application
operations.
The term dispatch latency describes the amount of time a system takes to respond to a
request for a process to begin operation. With a scheduler that is written specifically to honor
application priorities, real-time applications can be developed with a bounded dispatch latency.
The following figure illustrates the amount of time an application takes to respond to a request
from an external event.
FIGURE 8 Application Response Time
The overall application response time consists of the interrupt response time, the dispatch
latency, and the application's response time.
The interrupt response time for an application includes both the interrupt latency of the system
and the device driver's own interrupt processing time. The interrupt latency is determined by
the longest interval that the system must run with interrupts disabled. This time is minimized
in Oracle Solaris OS using synchronization primitives that do not commonly require a raised
processor interrupt level.
During interrupt processing, the driver's interrupt routine wakes the high-priority process
and returns when finished. The system detects that a process with higher priority than the
interrupted process is now ready to dispatch and dispatches the process. The time to switch
context from a lower-priority process to a higher-priority process is included in the dispatch
latency time.
Figure 9, “Internal Dispatch Latency,” on page 295 illustrates the internal dispatch latency
and application response time of a system. The response time is defined in terms of the amount
of time a system takes to respond to an internal event. The dispatch latency of an internal event
represents the amount of time that a process needs to wake up a higher priority process. The
dispatch latency also includes the time that the system takes to dispatch the higher priority
process.
The application response time is the amount of time that a driver takes to: wake up a higher-
priority process, release resources from a low-priority process, reschedule the higher-priority
task, calculate the response, and dispatch the task.
Interrupts can arrive and be processed during the dispatch latency interval. This processing
increases the application response time, but is not attributed to the dispatch latency
measurement. Therefore, this processing is not bounded by the dispatch latency guarantee.
FIGURE 9 Internal Dispatch Latency
With the new scheduling techniques provided with real-time Oracle Solaris OS, the system
dispatch latency time is within specified bounds.
Scheduling Classes
The Oracle Solaris kernel dispatches processes by priority. The scheduler or dispatcher supports
the concept of scheduling classes. Classes are defined as real-time (RT), system (SYS), and time-
sharing (TS). Each class has a unique scheduling policy for dispatching processes within its
class.
The kernel dispatches highest priority processes first. By default, real-time processes have
precedence over sys and TS processes. Administrators can configure systems so that the
priorities for TS processes and RT processes overlap.
The following figure illustrates the concept of classes as viewed by the Oracle Solaris OS
kernel.
Hardware interrupts, which cannot be controlled by software, have the highest priority. The
routines that process interrupts are dispatched directly and immediately from interrupts, without
regard to the priority of the current process.
Real-time processes have the highest default software priority. Processes in the RT class have
a priority and time quantum value. RT processes are scheduled strictly on the basis of these
parameters. As long as an RT process is ready to run, no SYS or TS process can run. Fixed-
priority scheduling enables critical processes to run in a predetermined order until completion.
These priorities never change unless they are changed by an application.
An RT class process inherits the parent's time quantum, whether finite or infinite. A process
with a finite time quantum runs until the time quantum expires. A process with a finite time
quantum also stops running if the process blocks while waiting for an I/O event or is preempted
by a higher-priority runnable real-time process. A process with an infinite time quantum ceases
execution only when the process terminates, blocks, or is preempted.
The SYS class exists to schedule the execution of special system processes, such as paging,
STREAMS, and the swapper. You cannot change the class of a process to the SYS class. The SYS
class of processes has fixed priorities established by the kernel when the processes are started.
The time-sharing (TS) processes have the lowest priority. TS class processes are scheduled
dynamically, with a few hundred milliseconds for each time slice. The TS scheduler switches
context in round-robin fashion often enough to give every process an equal opportunity to run,
depending upon:
Default time-sharing policy gives larger time slices to processes with lower priority.
A child process inherits the scheduling class and attributes of the parent process through fork.
A process's scheduling class and attributes are unchanged by exec. For more information, see
the fork(2) and exec(2) man pages.
Different algorithms dispatch each scheduling class. Class-dependent routines are called by
the kernel to make decisions about CPU process scheduling. The kernel is class-independent,
and takes the highest priority process off its queue. Each class is responsible for calculating a
process's priority value for its class. This value is placed into the dispatch priority variable of
that process.
As the following figure illustrates, each class algorithm has its own method of nominating the
highest priority process to place on the global run queue.
Each class has a set of priority levels that apply to processes in that class. A class-specific
mapping maps these priorities into a set of global priorities. A set of global scheduling priority
maps is not required to start with zero or be contiguous.
By default, the global priority values for time-sharing (TS) processes range from -20 to +20.
These global priority values are mapped into the kernel from 0-40, with temporary assignments
as high as 99. The default priorities for real-time (RT) processes range from 0-59, and are
mapped into the kernel from 100 to 159. The kernel's class-independent code runs the process
with the highest global priority on the queue.
Dispatch Queue
The dispatch queue is a linear-linked list of processes with the same global priority. Each
process has class-specific information attached to the process upon invocation. A process
is dispatched from the kernel dispatch table in an order that is based on the process' global
priority.
Dispatching Processes
When a process is dispatched, the context of the process is mapped into memory along with its
memory management information, its registers, and its stack. Execution begins after the context
mapping is done. Memory management information is in the form of hardware registers that
contain the data that is needed to perform virtual memory translations for the currently running
process.
Process Preemption
When a higher priority process becomes dispatchable, the kernel interrupts its computation
and forces the context switch, preempting the currently running process. A process can be
preempted at any time if the kernel finds that a higher-priority process is now dispatchable.
For example, suppose that process A performs a read from a peripheral device. Process A is
put into the sleep state by the kernel. The kernel then finds that a lower-priority process B is
runnable. Process B is dispatched and begins execution. Eventually, the peripheral device sends
an interrupt, and the driver of the device is entered. The device driver makes process A runnable
and returns. Rather than returning to the interrupted process B, the kernel now preempts B from
processing, resuming execution of the awakened process A.
Another interesting situation occurs when several processes contend for kernel resources. A
high-priority real-time process might be waiting for a resource held by a low-priority process.
When the low-priority process releases the resource, the kernel preempts that process to resume
execution of the higher-priority process.
Priority inversion occurs when a higher-priority process is blocked by one or more lower-
priority processes for a long time. The use of synchronization primitives such as mutual-
exclusion locks in the Oracle Solaris kernel can lead to priority inversion.
A process is blocked when the process must wait for one or more processes to relinquish
resources. Prolonged blocking can lead to missed deadlines, even for low levels of utilization.
The problem of priority inversion has been addressed for mutual-exclusion locks for the Oracle
Solaris kernel by implementing a basic priority inheritance policy. The policy states that a
lower-priority process inherits the priority of a higher-priority process when the lower-priority
process blocks the execution of the higher-priority process. This inheritance places an upper
bound on the amount of time a process can remain blocked. The policy is a property of the
kernel's behavior, not a solution that a programmer institutes through system calls or interface
execution. User-level processes can still exhibit priority inversion, however.
Using priocntl
priocntl controls the schedule of the active class. Class attributes are inherited through fork
and exec, along with scheduling parameters and permissions required for priority control.
This inheritance happens with both the RT and the TS classes. For more information, see the
priocntl(2), fork(2), and exec(2) man pages.
priocntl is the interface for specifying a real-time process, a set of processes, or a class
to which the system call applies. priocntlset also provides the more general interface for
specifying an entire set of processes to which the system call applies. For more information, see
the priocntlset(2) man page.
The command arguments of priocntl can be one of: PC_GETCID, PC_GETCLINFO, PC_GETPARMS,
or PC_SETPARMS. The real or effective ID of the calling process must match the real or effective
ID of the affected processes, or must have superuser privilege.
PC_GETCID This command takes the name field of a structure that contains a
recognizable class name. The class ID and an array of class attribute data
are returned.
PC_GETPARMS This command returns the scheduling class identifier or the class
specific scheduling parameters of one of the specified processes. Even
though idtype and id might specify a big set, PC_GETPARMS returns the
parameter of only one process. The class selects the process.
PC_SETPARMS This command sets the scheduling class or the class-specific scheduling
parameters of the specified process or processes.
Returns the minimum values for the specified policy. For more
sched_get_priority_min
information, see the sched_get_priority_max(3R) man page.
sched_yield Blocks the calling process until the calling process returns to the head of
the process list.
The administrative utilities that control process scheduling are dispadmin and priocntl.
Both of these utilities support the priocntl system call with compatible options and loadable
modules. These utilities provide system administration functions that control real-time process
scheduling during runtime. For more information, see the dispadmin(1M) and priocntl(1) man
pages.
priocntl(1) Command
The priocntl command sets and retrieves scheduler parameters for processes.
dispadmin(1M) Command
The dispadmin utility displays all current process scheduling classes by including the -l
command line option during runtime. Process scheduling can also be changed for the class
specified after the -c option, using RT as the argument for the real-time class.
A class-specific file that contains the dispatch parameters can also be loaded during runtime.
Use this file to establish a new set of priorities that replace the default values that were
established during boot time. This class-specific file must assert the arguments in the format
used by the -g option. Parameters for the RT class are found in the rt_dptbl, and are listed in
Example 49, “RT Class Dispatch Parameters,” on page 304. For more information, see the
rt_dptbl(5) man page.
To add an RT class file to the system, the following modules must be present:
■ An rt_init() routine in the class module that loads the rt_dptbl.
■ An rt_dptbl module that provides the dispatch parameters and a routine to return pointers
to config_rt_dptbl.
■ The dispadmin executable.
1. Load the class-specific module with the following command, where module_name is the
class-specific module.
# modload /kernel/sched/module_name
2. Invoke the dispadmin command.
# dispadmin -c RT -s file_name
The file must describe a table with the same number of entries as the table that is being
overwritten.
Configuring Scheduling
Associated with both scheduling classes is a parameter table, rt_dptbl, and ts_dptbl. These
tables are configurable by using a loadable module at boot time, or with dispadmin during
runtime. For more information, see the rt_dptbl(5), ts_dptbl(5), and dispadmin(1M) man
pages.
The in-core table for real-time establishes the properties for RT scheduling. The rt_dptbl
structure consists of an array of parameters, struct rt_dpent_t. Each of the n priority levels
has one parameter. The properties of a given priority level are specified by the ith parameter
structure in the array, rt_dptbl[i].
A parameter structure consists of the following members, which are also described in the /usr/
include/sys/rt.h header file.
rt_globpri The global scheduling priority associated with this priority level. The
rt_globpri values cannot be changed with dispadmin.
rt_quantum The length of the time quantum allocated to processes at this level in
ticks. For more information, see “Timestamp Interfaces” on page 314.
The time quantum value is only a default or starting value for processes
at a particular level. The time quantum of a real-time process can be
changed by using the priocntl command or the priocntl system call.
For more information, see the priocntl(1) and priocntl(2) man pages.
Reconfiguring config_rt_dptbl
A real-time administrator can change the behavior of the real-time portion of the scheduler
by reconfiguring the config_rt_dptbl at any time. For more information, see the section
"Replacing the rt_dptbl Loadable Module" in the rt_dptbl(5) man page.
A second method for examining or modifying the real-time parameter table on a running
system is through the dispadmin command. Invoking dispadmin for the real-time class enables
retrieval of the current rt_quantum values in the current config_rt_dptbl configuration from
the kernel's in-core table. For more information, see the dispadmin(1M) man page. When
overwriting the current in-core table, the configuration file used for input to dispadmin must
conform to the specific format described in the rt_dptbl(5) man page.
Following is an example of prioritized processes rtdpent_t with their associated time quantum
config_rt_dptbl[] value as the processes might appear in config_rt_dptbl[].
Memory Locking
Locking memory is one of the most important issues for real-time applications. In a real-time
environment, a process must be able to guarantee continuous memory residence to reduce
latency and to prevent paging and swapping.
This section describes the memory locking mechanisms that are available to real-time
applications in Oracle Solaris OS.
In Oracle Solaris OS, the memory residency of a process is determined by its current state, the
total available physical memory, the number of active processes, and the processes' demand
for memory. This residency is appropriate in a time-share environment. This residency is often
unacceptable for a real-time process. In a real-time environment, a process must guarantee a
memory residence to reduce the process' memory access and dispatch latency.
Real-time memory locking in Oracle Solaris OS is provided by a set of library routines. These
routines allow a process running with superuser privileges to lock specified portions of its
virtual address space into physical memory. Pages locked in this manner are exempt from
paging until the pages are unlocked or the process exits.
The operating system has a system-wide limit on the number of pages that can be locked at
any time. This limit is a tunable parameter whose default value is calculated at boot time. The
default value is based on the number of page frames minus another percentage, currently set at
ten percent.
Locking a Page
A call to mlock requests that one segment of memory be locked into the system's physical
memory. The pages that make up the specified segment are faulted in. The lock count of each
page is incremented. Any page whose lock count value is greater than zero is exempt from
paging activity. For more information, see the mlock(3C) man page.
A particular page can be locked multiple times by multiple processes through different
mappings. If two different processes lock the same page, the page remains locked until both
processes remove their locks. However, within a given mapping, page locks do not nest.
Multiple calls of locking interfaces on the same address by the same process are removed by a
single unlock request.
If the mapping through which a lock has been performed is removed, the memory segment is
implicitly unlocked. When a page is deleted through closing or truncating the file, the page is
also implicitly unlocked.
Locks are not inherited by a child process after a fork call. If a process that has some memory
locked forks a child, the child must perform a memory locking operation on its own behalf to
lock its own pages. Otherwise, the child process incurs copy-on-write page faults, which are the
usual penalties that are associated with forking a process. For more information, see the fork(2)
man page.
Unlocking a Page
To unlock a page of memory, a process requests the release of a segment of locked virtual pages
by a calling munlock. munlock decrements the lock counts of the specified physical pages. After
decrementing a page's lock count to 0, the page swaps normally. For more information, see the
munlock(3C) man page.
A superuser process can request that all mappings within its address space be locked by a call
to mlockall. If the flag MCL_CURRENT is set, all the existing memory mappings are locked. If
the flag MCL_FUTURE is set, every mapping that is added to an existing mapping or that replaces
an existing mapping is locked into memory. For more information, see the mlockall(3C) man
page.
A page is permanently locked into memory when its lock count reaches 65535 (0xFFFF). The
value 0xFFFF is defined by implementation. This value might change in future releases. Pages
that are locked in this manner cannot be unlocked. Reboot the system to recover.
Standard UNIX I/O is synchronous to the application programmer. An application that calls
read(2) or write(2) usually waits until the system call has finished. For more information, see
the read(2) and write(2) man pages.
Real-time applications need asynchronous, bounded I/O behavior. A process that issues an
asynchronous I/O call proceeds without waiting for the I/O operation to complete. The caller is
notified when the I/O operation has finished.
Asynchronous I/O can be used with any Oracle Solaris file. Files are opened synchronously and
no special flagging is required. An asynchronous I/O transfer has three elements: call, request,
and operation. The application calls an asynchronous I/O interface, the request for the I/O is
placed on a queue, and the call returns immediately. At some point, the system dequeues the
request and initiates the I/O operation.
Asynchronous and standard I/O requests can be intermingled on any file descriptor. The system
maintains no particular sequence of read and write requests. The system arbitrarily resequences
all pending read and write requests. If a specific sequence is required for the application,
the application must insure the completion of prior operations before issuing the dependent
requests.
aio_return, Are called to obtain return and error values, respectively, after an
aio_error operation is known to have completed.
aio_suspend Suspends the caller as though one or more of the preceding asynchronous
I/O requests had been made synchronously.
Notification (SIGIO)
When an asynchronous I/O call returns successfully, the I/O operation has only been queued
and waits to be done. The actual operation has a return value and a potential error identifier.
This return value and potential error identifier would have been returned to the caller if the call
had been synchronous. When the I/O is finished, both the return and error values are stored
at a location given by the user at the time of the request as a pointer to an aio_result_t. The
structure of the aio_result_t is defined in <sys/asynch.h>:
When the aio_result_t has been updated, a SIGIO signal is delivered to the process that made
the I/O request.
Note that a process with two or more asynchronous I/O operations pending has no certain way
to determine the cause of the SIGIO signal. A process that receives a SIGIO should check all its
conditions that could be generating the SIGIO signal.
Using aioread
This command routine is the asynchronous version of read. In addition to the normal read
arguments, aioread takes the arguments that specify a file position and the address of an
aio_result_t structure. The resulting information about the operation is stored in the
aio_result_t structure. The file position specifies a seek to be performed within the file before
the operation. Whether the aioread command call succeeds or fails, the file pointer is updated.
Using aiowrite
The aiowrite command routine is the asynchronous version of write. In addition to the normal
write arguments, aiowrite command takes arguments that specify a file position and the
address of an aio_result_t structure. The resulting information about the operation is stored in
the aio_result_t structure.
The file position specifies that a seek operation is to be performed within the file before the
operation. If the command call succeeds, the file pointer is updated to the position that would
have resulted in a successful seek and write. The file pointer is also updated when a write fails
to allow for subsequent write requests.
Using aiocancel
This command routine attempts to cancel the asynchronous request whose aio_result_t
structure is given as an argument. An aiocancel call succeeds only if the request is still queued.
If the operation is in progress, aiocancel fails.
Using aiowait
A call to aiowait blocks the calling process until at least one outstanding asynchronous I/O
operation is completed. The timeout parameter points to a maximum interval to wait for I/O
completion. A timeout value of zero specifies that no wait is wanted. The aiowait command
returns a pointer to the aio_result_t structure for the completed operation.
Using poll()
To determine the completion of an asynchronous I/O event synchronously rather than depend
on a SIGIO interrupt, use poll. You can also poll to determine the origin of a SIGIO interrupt.
For more information, see the poll(2) man page.
poll is slow when used on very large numbers of files. This problem is resolved by poll(4D).
better than poll(2). This API is especially suited for applications that satisfy the following
criteria:
■ Applications that repeatedly poll a large number of file descriptors
■ Polled file descriptors that are relatively stable, meaning that the descriptors are not
constantly closed and reopened
■ The set of file descriptors that actually have polled events pending is small, comparing to
the total number of file descriptors that are being polled
Using close
Files are closed by calling close. The call to close cancels any outstanding asynchronous I/
O request that can be closed. close waits for an operation that cannot be cancelled. For more
information, see “Using aiocancel” on page 309. When close returns, no asynchronous
I/O is pending for the file descriptor. Only asynchronous I/O requests queued to the specified
file descriptor are cancelled when a file is closed. Any I/O pending requests for other file
descriptors are not cancelled. For more information, see the close(2) man page.
Synchronized I/O
Applications might need to guarantee that information has been written to stable storage, or that
file updates are performed in a particular order. Synchronized I/O provides for these needs.
Synchronization Modes
In Oracle Solaris, a write operation succeeds when the system ensures that all written data is
readable after any subsequent open of the file. This check assumes no failure of the physical
storage medium. Data is successfully transferred for a read operation when an image of the
data on the physical storage medium is available to the requesting process. An I/O operation is
complete when the associated data has been successfully transferred, or when the operation has
been diagnosed as unsuccessful.
An I/O operation has reached synchronized I/O data integrity completion when:
■ For reads, the operation has been completed, or diagnosed if unsuccessful. The read is
complete only when an image of the data has been successfully transferred to the requesting
process. If the synchronized read operation is requested when pending write requests affect
the data to be read, these write requests are successfully completed before the data is read.
■ For writes, the operation has been completed, or diagnosed if unsuccessful. The write
operation succeeds when the data specified in the write request is successfully transferred.
Furthermore, all file system information required to retrieve the data must be successfully
transferred.
■ File attributes that are not necessary for data retrieval are not transferred prior to returning
to the calling process.
■ Synchronized I/O file integrity completion requires that all file attributes relative to the I/O
operation be successfully transferred before returning to the calling process. Synchronized
I/O file integrity completion is otherwise identical to synchronized I/O data integrity
completion.
Synchronizing a File
fsync and fdatasync explicitly synchronize a file to secondary storage.
The fsync routine guarantees that the interface is synchronized at the I/O file integrity
completion level. fdatasync guarantees that the interface is synchronized at level of I/O data
integrity completion. For more information, see the fsync(3C) man page.
Applications can synchronize each I/O operation before the operation completes. Setting
the O_DSYNC flag on the file description by using open or fcntl ensures that all I/O writes
reach I/O data completion before the operation completes. Setting the O_SYNC flag on the file
description ensures that all I/O writes have reached completion before the operation is indicated
as completed. Setting the O_RSYNC flag on the file description ensures that all I/O reads read
and aio_read reach the same level of completion that is requested by the descriptor setting.
The descriptor setting can be either O_DSYNC or O_SYNC. For more information, see the open(2),
fcntl(2), and read(2) man pages.
Interprocess Communication
This section describes the interprocess communication (IPC) interfaces of Oracle Solaris as
the interfaces relate to real-time processing. Signals, pipes, FIFOs, message queues, shared
memory, file mapping, and semaphores are described here. For more information about the
libraries, interfaces, and routines that are useful for interprocess communication, see Chapter 6,
“Interprocess Communication”.
Processing Signals
The sender can use sigqueue to send a signal together with a small amount of information to a
target process.
To queue subsequent occurrences of a pending signal, the target process must have the
SA_SIGINFO bit set for the specified signal. For more information,see the sigaction(2) man
page.
The target process normally receive signals asynchronously. To receive signals synchronously,
block the signal and call either sigwaitinfo or sigtimedwait. For more information, see the
sigprocmask(2) man page. This procedure causes the signal to be received synchronously.
The value sent by the caller of sigqueue is stored in the si_value member of the siginfo_t
argument. Leaving the signal unblocked causes the signal to be delivered to the signal handler
specified by sigaction, with the value appearing in the si_value of the siginfo_t argument
to the handler.
A specified number of signals with associated values can be sent by a process and remain
undelivered. Storage for {SIGQUEUE_MAX} signals is allocated at the first call to sigqueue.
Thereafter, a call to the command either successfully enqueues at the target process or fails
within a bounded amount of time.
Pipes, named pipes, and message queues behave similarly to character I/O devices. These
interfaces have different methods of connecting. For more information about pipes,
named pipes, and message queues, see “Pipes Between Processes” on page 105, “Named
Pipes” on page 107, “System V Messages” on page 111, and “POSIX Messages” on page 108.
Using Semaphores
Semaphores are also provided in both System V and POSIX styles. For more information, see
“System V Semaphores” on page 114 and “POSIX Semaphores” on page 109.
Note that using semaphores can cause priority inversions unless priority inversions are
explicitly avoided by the techniques mentioned earlier in this chapter.
Shared Memory
The fastest way for processes to communicate is directly, through a shared segment of memory.
When more than two processes attempt to read and write shared memory simultaneously, the
memory contents can become inaccurate. This potential inaccuracy is the major difficulty with
using shared memory.
To avoid such inaccuracy, you can use the APIs of the libmemcontext library. The APIs of
the libmemcontext library allows you to control access to a shared memory. Using this library
prevents a thread from accessing memory that is not relevant to its current operation. If memory
context is enabled, before accessing the memory segment, a process locks the memory for its
use on entry and releases the lock on exit. This process ensures that multiple processes will not
be able to modify the memory segment at the same time. This feature is useful when you are
working with in-memory databases.
Note - Support of the shared memory context is available only for 64-bit applications that use
OSM segments on M8 systems.
For more information on the Transport-Level Interface, see Chapter 8, “Programming With XTI
and TLI”.
Modes of Networking
Both sockets and transport-level interface provide two modes of service: connection-mode and
connectionless-mode.
Timing Facilities
This section describes the timing facilities that are available for real-time applications in Oracle
Solaris. Real-time applications that use these mechanisms require detailed information from the
man pages of the routines that are listed in this section.
The timing interfaces of Oracle Solaris fall into two separate areas: timestamps and interval
timers. The timestamp interfaces provide a measure of elapsed time. The timestamp interfaces
also enable the application to measure the duration of a state or the time between events.
Interval timers allow an application to wake up at specified times and to schedule activities
based on the passage of time.
Timestamp Interfaces
Two interfaces provide timestamps. gettimeofday provides the current time in a timeval
structure, representing the time in seconds and microseconds since midnight, Greenwich Mean
Time, on January 1, 1970. clock_gettime, with a clockid of CLOCK_REALTIME, provides the
current time in a timespec structure, representing in seconds and nanoseconds the same time
interval returned by gettimeofday. For more information, see the gettimeofday(3C) man page.
Oracle Solaris uses a hardware periodic timer. For some workstations, the hardware periodic
timer is the sole source of timing information. If the hardware periodic timer is the sole source
of timing information, the accuracy of timestamps is limited to the timer's resolution. For other
platforms, a timer register with a resolution of one microsecond means that timestamps are
accurate to one microsecond.
A one-shot is an armed timer that is set to an expiration time relative to either a current time
or an absolute time. The timer expires once and is disarmed. This type of a timer is useful for
clearing buffers after the data has been transferred to storage, or to time-out an operation.
A periodic timer is armed with an initial expiration time, either absolute or relative, and
a repetition interval. Every time the interval timer expires, the timer is reloaded with the
repetition interval. The timer is then rearmed. This timer is useful for data logging or for
servo-control. In calls to interval timer interfaces, time values that are smaller than the timer's
resolution are rounded up to the next multiple of the hardware timer interval. This interval is
typically 10ms.
Oracle Solaris has two sets of timer interfaces. The setitimer and getitimer interfaces
operate fixed set timers, which are called the BSD timers, using the timeval structure to specify
time intervals. The POSIX timers, which are created with the timer-create command, operate
the POSIX clock, CLOCK_REALTIME. POSIX timer operations are expressed in terms of the
timespec structure.
The getitimer and setitimer functions retrieve and establish, respectively, the value of the
specified BSD interval timer. The three BSD interval timers that are available to a process
include a real-time timer designated ITIMER_REAL. If a BSD timer is armed and allowed to
expire, the system sends an appropriate signal to the process that set the timer. For more
information, see the getitimer(2) and setitimer(2) man pages.
The timer_create command routine can create up to TIMER_MAX POSIX timers. The caller can
specify what signal and what associated value are sent to the process when the timer expires.
The timer_settime and timer_gettime routines retrieve and establish respectively the value
of the specified POSIX interval timer. POSIX timers can expire while the required signal is
pending delivery. The timer expirations are counted, and timer_getoverrun retrieves the count.
The timer_delete command deallocates a POSIX timer.
The following example illustrates how to use setitimer to generate a periodic interrupt, and
how to control the arrival of timer interrupts.
#include <unistd.h>
#include <signal.h>
#include <sys/time.h>
#define TIMERCNT 8
void timerhandler();
int timercnt;
struct timeval alarmtimes[TIMERCNT];
main()
{
struct itimerval times;
sigset_t sigset;
int i, ret;
struct sigaction act;
siginfo_t si;
/* block SIGALRM */
sigemptyset (&sigset);
sigaddset (&sigset, SIGALRM);
sigprocmask (SIG_BLOCK, &sigset, NULL);
printtimes ()
{
int i;
The Oracle Solaris Application Binary Interface (ABI) defines the interfaces available
application developers. Conforming to the ABI enhances an application's binary stability.
This chapter discusses the Oracle Solaris ABI and the tools provided to verify an application's
compliance with the ABI, including:
■ The definition and purpose of the Oracle Solaris ABI, discussed in “Defining the Oracle
Solaris ABI” on page 320.
■ The usage of the two ABI tools, Preflight Checker and apptrace, discussed in “Oracle
Solaris ABI Tools” on page 322.
The Oracle Solaris ABI is the set of supported run-time interfaces that are available for an
application to use with the Oracle Solaris operating system. The most important components of
the ABI are in the following list:
■ The interfaces provided by the Oracle Solaris system libraries, which are documented in
section 3 of the man pages
■ The interfaces provided by the Oracle Solaris kernel system calls, which are documented in
section 2 of the man pages
■ The locations and formats of various system files and directories, which are documented in
section 4 of the man pages
■ The input and output syntax and semantics of Oracle Solaris utilities, which are documented
in section 1 of the man pages
The main component of the Oracle Solaris ABI is the set of system library interfaces. The
term ABI in this chapter refers only to the set of system library interfaces. The ABI contains C
language interfaces, as Oracle Solaris operating system provides interfaces only for C language.
C source code that is written to the Oracle Solaris API (Application Programming Interface) is
transformed by the C compiler into a binary for one of four ABI versions. The versions are:
■ 32-bit SPARC
■ 64-bit SPARC
■ 32-bit x86
■ x64
While the ABI is very similar to the API, the source compilation process introduces several
important differences:
■ Compiler directives such as #define can alter or replace source-level constructs. The
resulting binary might lack a symbol present in the source or include a symbol not present in
the source.
■ The compiler might generate processor-specific symbols, such as arithmetic instructions,
which augment or replace source constructs.
■ The compiler's binary layout might be specific to that compiler and the versions of the
source language which the compiler accepts. In such cases, identical code compiled with
different compilers might produce incompatible binaries.
For these reasons, source-level (API) compatibility does not provide a sufficient expectation of
binary compatibility across Oracle Solaris releases.
The Oracle Solaris ABI is made up of the supported interfaces provided by the operating
system. Some of the interfaces that are available in the system are intended for the exclusive use
of the operating system. These exclusive interfaces are not available for use by an application.
Prior to the SunOS 5.6 release, all of the interfaces in Oracle Solaris libraries were available
for application developers to use. With the library symbol scoping technology available in the
Oracle Solaris link editor, interfaces not intended for use outside of a library have their scope
reduced to be purely local to the library. For more information, see Oracle Solaris 11.4 Linkers
and Libraries Guide. Due to system requirements, not all private interfaces can have a reduced
scope. These interfaces are labeled private, and are not included in the Oracle Solaris ABI.
The Oracle Solaris ABI is defined in the Oracle Solaris libraries. These definitions are provided
by means of the library versioning technology and policies used in the link editor and run-time
linker.
version number, such as [Link].1. In a few cases, when an incompatible change is made to
one or more public interfaces in that library, the version number is incremented. For example,
[Link].2.
Library symbol versioning associates a set of symbols with a symbol version name. The
following is an example mapfile for a hypothetical Solaris library, [Link].1.
$mapfile_version 2
SYMBOL_VERSION SUNWpublic
{
global:
symbolA;
symbolB;
symbolC;
};
SYMBOL_VERSION
SUNWprivate {
global:
__fooimpl;
local:
*;
};
This mapfile indicates that symbolA, symbolB, and symbolC are associated with version
SUNWpublic. The symbol __fooimpl is associated with SUNWprivate.
Note - The local: * directive in the mapfile causes any symbol in the library that is not
explicitly associated with a named version, to be scoped locally to the library. Such locally
scoped symbols are not visible outside the library. This convention ensures that symbols are
only visible when associated with a symbol versioning name.
with a version name beginning with SUNWprivate. Public interfaces begin with other names,
specifically:
The definition of the Oracle Solaris library ABI is therefore contained in the libraries, and
consists of the set of symbols that are associated with symbol version names that do not begin
with SUNWprivate. The pvs command lists the symbols in a library.
The Oracle Solaris operating system provides two tools, the Preflight Checker tool and the
apptrace tool to verify that an application's use of Oracle Solaris interfaces conforms to the
Oracle Solaris ABI. The ABI tools enable easy, rapid identification of binaries that might have
binary compatibility problems with a given Oracle Solaris release.
You can use the Preflight Checker tool to check the readiness of an application on Oracle
Solaris 10. The Preflight Checker tool checks the application source code and application
process running on Oracle Solaris 10 to determine if the application can run unmodified on
Oracle Solaris 11. This tool also statically examines the Oracle Solaris library interfaces used
by ELF binaries for instances of private interface usage. The Preflight Checker tool produces
summary and detailed reports of any potential binary stability problems it finds. It identifies
which binaries use problematic interfaces and which do not. For more information about
Preflight Checker Tool, see Oracle Solaris Preflight Applications Checker 11.3.
You can use the apptrace tool on the target Oracle Solaris release for verification. This verifies
whether interface compatibility problems exist by enabling dynamic observation of those
interfaces as they are used. The apptrace tool uses the link-auditing capability of the run-time
linker to dynamically trace Oracle Solaris library routine calls as the application runs. This
capability enables developers to examine an application's use of the Oracle Solaris system
interfaces.
The apptrace utility is a C program which dynamically traces calls to Oracle Solaris library
routines as an application runs. apptrace works on either SPARC or x86 platforms. apptrace
can trace interface calls for both SPARC and x86 32-bit interfaces, as well as the 64-bit
interfaces on SPARC. The apptrace only examines C language interfaces.
Application Verification
To determine an application's binary compatibility with a given release, verify the successful
use of each interface used by the application with apptrace.
The apptrace utility can verify that an application is using public interfaces correctly. For
example, an application that is using the open() to open the administrative file /etc/passwd
directly should instead use the appropriate programmatic interfaces. This ability to inspect the
usage of the Oracle Solaris ABI enables easy and rapid identification of potential interface
problems.
Running apptrace
The apptrace utility does not require any modification of the application being traced. To use
apptrace, type apptrace, followed by any desired options along with the command line used to
run the application of interest. The apptrace utility works by using the link-auditing capability
of the runtime linker to intercept the application's calls to Oracle Solaris library interfaces. The
apptrace utility then traces the calls by printing the names and values of the call's arguments
and return value. The tracing output can be on a single line or arranged across multiple lines for
readability. Public interfaces are printed in human-readable form. Private interfaces are printed
in hexadecimal.
The apptrace utility enables selective tracing of calls, both at the level of individual interfaces
and the level of libraries. For example, apptrace can trace calls to printf() coming from
libnsl, or a range of calls within a specific library. The apptrace utility can also verbosely
trace user-specified calls. The specifications that dictate apptrace behavior are governed by
a syntax that is consistent with the usage of truss. The -f option directs apptrace to follow
forked child processes. The -o option specifies an output file for apptrace results. For more
information, see the truss(1) man page.
The apptrace utility traces only library-level calls and is loaded into the running application
process, gaining a performance increase over truss. With the exception of printf, apptrace
cannot trace calls to functions that accept variable argument lists or examine the stack or other
caller information, for example, setcontext, getcontext, setjmp, longjmp, and vfork.
The following examples contain sample apptrace output from tracing a simple one-binary
application, ls.
% apptrace ls /etc/passwd
ls -> [Link].1:atexit(func = 0xff3cb8f0) = 0x0
ls -> [Link].1:atexit(func = 0x129a4) = 0x0
ls -> [Link].1:getuid() = 0x32c3
ls -> [Link].1:time(tloc = 0x23918) = 0x3b2fe4ef
ls -> [Link].1:isatty(fildes = 0x1) = 0x1
ls -> [Link].1:ioctl(0x1, 0x540d, 0xffbff7ac)
ls -> [Link].1:ioctl(0x1, 0x5468, 0x23908)
ls -> [Link].1:setlocale(category = 0x6, locale = "") = "C"
ls -> [Link].1:calloc(nelem = 0x1, elsize = 0x40) = 0x23cd0
ls -> [Link].1:lstat64(path = "/etc/passwd", buf = 0xffbff6b0) = 0x0
ls -> [Link].1:acl(pathp = "/etc/passwd", cmd = 0x3, nentries = 0x0,
aclbufp = 0x0) = 0x4
ls -> [Link].1:qsort(base = 0x23cd0, nel = 0x1, width = 0x40,
compar = 0x12038)
ls -> [Link].1:sprintf(buf = 0x233d0, format = 0x12af8, ...) = 0
ls -> [Link].1:strlen(s = "") = 0x0
ls -> [Link].1:strlen(s = "/etc/passwd") = 0xb
ls -> [Link].1:sprintf(buf = 0x233d0, format = 0x12af8, ...) = 0
ls -> [Link].1:strlen(s = "") = 0x0
ls -> [Link].1:printf(format = 0x12ab8, ...) = 11
ls -> [Link].1:printf(/etc/passwd
format = 0x12abc, ...) = 1
ls -> [Link].1:exit(status = 0)
The previous example shows the default tracing behavior, tracing every library call on the
command ls /etc/passwd. The apptrace utility prints a line of output for every system call,
indicating:
The previous example shows how apptrace can selectively trace calls with regular-expression
syntax. In the example, calls to interfaces ending in printf, which include sprintf, are
traced in the same ls command as before. Consequently, apptrace only traces the printf and
sprintf calls.
The previous example shows the verbose tracing mode, where the arguments to sprintf are
printed on multiple output lines for readability. At the end, apptrace displays the output of the
ls command.
UNIX domain sockets are named with UNIX paths. For example, a socket might be named
/tmp/foo. UNIX domain sockets communicate only between processes on a single host.
Sockets in the UNIX domain are not considered part of the network protocols because they can
be used to communicate only between processes on a single host.
Socket types define the communication properties visible to a user. The Internet domain sockets
provide access to the TCP/IP transport protocols. The Internet domain is identified by the value
AF_INET. Sockets exchange data only with sockets in the same domain.
Creating Sockets
The socket call creates a socket in the specified family and of the specified type.
If the protocol is unspecified (a value of 0), the system selects a protocol that supports the
requested socket type. The socket handle (a file descriptor) is returned.
The family is specified by one of the constants defined in sys/socket.h. Constants named
AF_suite specify the address format to use in interpreting names. For more information, see the
socket(3C) man page.
The bind call enables a process to specify the local address of the socket. This creates the local
pathname ordered set, while connect and accept complete a socket's association by fixing
the remote half of the address. For more information, see the bind(3C), connect(3C), and
accept(3C) man pages.
The socket handle is s. The bound name is a byte string that is interpreted by the supporting
protocols. UNIX family names contain a path name and a family. The example shows binding
the name /tmp/foo to a UNIX family socket.
#include <sys/un.h>
...
struct sockaddr_un addr;
...
strlcpy(addr.sun_path, "/tmp/foo"
, sizeof(addr.sun_path)
);
addr.sun_family = AF_UNIX;
bind (s, (struct sockaddr *) &addr,
strlen(addr.sun_path) + sizeof (addr.sun_family));
When determining the size of an AF_UNIX socket address, null bytes are not counted, which is
why you can use strlen(3C).
The file name referred to in addr.sun_path is created as a socket in the system file name space.
The caller must have write permission in the directory where addr.sun_path is created. The
file should be deleted by the caller when it is no longer needed. Delete AF_UNIX sockets with
unlink. For more information, see the unlink(1M) man page.
Establishing a Connection
Connection establishment is usually asymmetric. One process acts as the client and the other as
the server. The server binds a socket to a well-known address associated with the service and
blocks on its socket for a connect request. An unrelated process can then connect to the server.
The client requests services from the server by initiating a connection to the server's socket. On
the client side, the connect call initiates a connection. In the UNIX family, this might appear as:
For more information on connection errors, see “Connection Errors” on page 129. “Data
Transfer” on page 130 tells you how to transfer data. “Closing Sockets” on page 131 tells you
how to close a socket.
A broadcast
ABI See application binary interface sending message, 166
ABI differences from API, 320
accept, 128, 328
API differences from ABI, 320
C
application binary interface (ABI), 319
calloc, 18
defined, 320
chmod(1), 96
tools, 322
class
Preflight checker, 322, 322
definition, 296
apptrace, 323
priority queue, 298
asynchronous I/O
scheduling algorithm, 297
behavior, 293
scheduling priorities, 296
endpoint service, 235
Client-server model, 148
guaranteeing buffer state, 293
close, 131
listen for network connection, 237
connect, 128, 128, 141, 328
making connection request, 237
connection-mode
notification of data arrival, 235
asynchronous network service, 236
opening a file, 238
asynchronously connecting, 237
using structure, 293
definition, 313
Asynchronous Safe, 224
using asynchronous connection, 237
asynchronous socket, 156, 157
connectionless mode
atomic updates to semaphores, 115
asynchronous network service, 235
attribute
connectionless-mode
finding in an SDP session structure, 41
definition, 313
context switch
preempting a process, 299
B creation flags, IPC, 110
bind, 128, 328
blocking mode
defined, 299
finite time quantum, 297 D
priority inversion, 299 /dev/zero, mapping, 16
time-sharing process, 291 daemon
brk(2), 21 inetd, 164
331
Index
M
malloc, 18 N
mapped files, 15, 16 name-to-address translation
media inet, 283
finding in an SDP session structure, 42 [Link], 283
media format [Link], 283
finding in an SDP session structure, 43 [Link], 283
memalign, 19 [Link], 283
memory named pipe
locking, 304 FIFO, 311
locking a page, 305 netdir_free, 284, 284
333
Index
335
Index
337
Index
Z
zero, 16