|
|
daemonize(3) -- make a process into a daemon
|
|
The _daemonize function does the common work needed ``to put a function into the background,'' or to make it into a ``daemon.'' That generally includes forking a new process, closing most files, and releasing the controlling tty. If flags & _DF_NOFORK is 0, then a new process in a new session is started. Debugging is often easier with flags set to contain _DF_NOFORK. If flags & _DF_NOCHDIR is 0, then the current working directory is changed to /. Otherwise, the current working directory is u... |
|
datapipe(3x) -- 0datapipe: dpipeCreate, dpipeDestroy, dpipeTransfer, dpipeReset, dpipeFlush- data pipe operations.
|
|
Data pipes are dynamic connections between two hardware devices that support peer-to-peer data transfers. These connections are created by an application to process a data stream from a source device to a sink device. The purpose is to have minimum system impact during I/O operations. dpipeCreate creates a data pipe between two file descriptors: src_fd is the source file descriptor, and sink_fd is the sink file descriptor. Either file descriptor can refer to a regular file, a special device file... |
|
f90/date(3) -- Returns the current date
|
|
UNICOS, UNICOS/mk, and IRIX systems |
|
f90/date_and_time(3) -- Returns data on the real-time clock and date
|
|
UNICOS, UNICOS/mk, and IRIX systems |
|
complib/dbdsqr(3) -- compute the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B
|
|
DBDSQR computes the singular value decomposition (SVD) of a real N-by-N (upper or lower) bidiagonal matrix B: B = Q * S * P' (P' denotes the transpose of P), where S is a diagonal matrix with non-negative diagonal elements (the singular values of B), and Q and P are orthogonal matrices. The routine computes S, and optionally computes U * Q, P' * VT, or Q' * C, for given real input matrices U, VT, and C. See "Computing Small Singular Values of Bidiagonal Matrices With Guaranteed High Relativ... |
|
f90/dble(3) -- explicit FORTRAN type conversion
|
|
These functions perform conversion from one data type to another. The function int converts to integer from its integer, real*4, double precision, real*16, complex, double complex, or complex*32 argument. If the argument is real, integer, real*4, double precision, or real*16 int returns the integer whose magnitude is the largest integer that does not exceed the magnitude of the argument and whose sign is the same as the sign of the argument (i.e. truncation). For complex the above rule is applie... |
|
dbm(3c) -- data base subroutines
|
|
Note: the dbm library has been superseded by ndbm(3B), and is now implemented using ndbm. These functions maintain key/content pairs in a data base. The dbm functions will handle very large (a billion blocks) databases and will access a keyed item in one or two file system accesses. The dbm64 routines are identical to their dbm counterparts except that they can be used to operate on data bases larger than 2 Gigabytes. Page 1 DBM(3B) DBM(3B) Keys and contents are described by the datum typedef. A... |
|
dbopen(3) -- database access methods
|
|
Dbopen is the library interface to database files. The supported file formats are btree, hashed and UNIX file oriented. The btree format is a representation of a sorted, balanced tree structure. The hashed format is an extensible, dynamic hashing scheme. The flat-file format is a byte stream file with fixed or variable length records. The formats and file format specific information are described in detail in their respective manual pages btree(3), hash(3) and recno(3). Dbopen opens file for rea... |
|
standard/dbtext(3) -- sets the dial and button box text display
|
|
str expects a pointer to a text string of no more than eight characters: digits, spaces, and uppercase letters only. |
|
perl5/DB_File(3) -- Perl5 access to Berkeley DB version 1.x
|
|
DB_File is a module which allows Perl programs to make use of the facilities provided by Berkeley DB version 1.x (if you have a newer version of DB, see the section on Using DB_File with Berkeley DB version 2). It is assumed that you have a copy of the Berkeley DB manual pages at hand when reading this documentation. The interface defined here mirrors the Berkeley DB interface closely. Berkeley DB is a C library which provides a consistent interface to a number of database formats. DB_File provi... |
|
complib/DCHDC(3) -- DCHDC computes the Cholesky decomposition of a positive definite matrix. A pivoting option allows the user to
|
|
On Entry A DOUBLE PRECISION(LDA,P). A contains the matrix whose decomposition is to be computed. Only the upper half of A need be stored. The lower part of the array A is not referenced. LDA INTEGER. LDA is the leading dimension of the array A. P INTEGER. P is the order of the matrix. WORK DOUBLE PRECISION. WORK is a work array. JPVT INTEGER(P). JPVT contains integers that control the selection of the pivot elements, if pivoting has been requested. Each diagonal element A(K,K) is placed in one o... |
|
complib/DCHDD(3) -- DCHDD downdates an augmented Cholesky decomposition or the triangular factor of an augmented QR decomposition.
|
|
On Entry R DOUBLE PRECISION(LDR,P), where LDR .GE. P. R contains the upper triangular matrix that is to be downdated. The part of R below the diagonal is not referenced. LDR INTEGER. LDR is the leading dimension of the array R. P INTEGER. P is the order of the matrix R. Page 1 DCHDD(3F) DCHDD(3F) X DOUBLE PRECISION(P). X contains the row vector that is to be removed from R. X is not altered by DCHDD. Z DOUBLE PRECISION(LDZ,N)Z), where LDZ .GE. P. Z is an array of NZ P-vectors which are to be dow... |
|
complib/DCHEX(3) -- DCHEX updates the Cholesky factorization A = TRANS(R)*R of a positive definite matrix A of order P under diago
|
|
On Entry R DOUBLE PRECISION(LDR,P), where LDR .GE. P. R contains the upper triangular factor that is to be updated. Elements of R below the diagonal are not referenced. LDR INTEGER. LDR is the leading dimension of the array R. P INTEGER. P is the order of the matrix R. K INTEGER. K is the first column to be permuted. L INTEGER. L is the last column to be permuted. L must be strictly greater than K. Z DOUBLE PRECISION(LDZ,N)Z), where LDZ .GE. P. Z is an array of NZ P-vectors into which the transf... |
