Linux Manuals

The Linux Manuals (man pages) document is an important part of Linux documents. Linux Manuals are organized as several sections. Each section has a group of commands for a specific area in Linux usage, administration or development.

  • |

    STAILQ_INSERT_TAIL (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_INSERT_HEAD (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_INSERT_AFTER (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_INIT (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_HEAD_INITIALIZER (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_HEAD (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_FOREACH (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_FIRST (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_ENTRY (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_EMPTY (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    STAILQ_CONCAT (3) Linux Manual Page

    ByLinux Manual

    STAILQ_CONCAT, STAILQ_EMPTY, STAILQ_ENTRY, STAILQ_FIRST, STAILQ_FOREACH, STAILQ_HEAD, STAILQ_HEAD_INITIALIZER, STAILQ_INIT, STAILQ_INSERT_AFTER, STAILQ_INSERT_HEAD, STAILQ_INSERT_TAIL, STAILQ_NEXT, STAILQ_REMOVE, STAILQ_REMOVE_HEAD, – implementation of a singly linked tail queue Synopsis#include <sys/queue.h> void STAILQ_CONCAT(STAILQ_HEAD *head1, STAILQ_HEAD *head2); int STAILQ_EMPTY(STAILQ_HEAD *head); STAILQ_ENTRY(TYPE); struct TYPE *STAILQ_FIRST(STAILQ_HEAD *head); STAILQ_FOREACH(struct TYPE *var, STAILQ_HEAD *head, STAILQ_ENTRY NAME); STAILQ_HEAD(HEADNAME, TYPE); STAILQ_HEAD STAILQ_HEAD_INITIALIZER(STAILQ_HEAD head); void STAILQ_INIT(STAILQ_HEAD *head); void STAILQ_INSERT_AFTER(STAILQ_HEAD *head,…

  • |

    SSYTRS2 (3) Linux Manual Page

    ByLinux Manual

    ssytrs2.f – Synopsis Functions/Subroutines subroutine ssytrs2 (UPLO, N, NRHS, A, LDA, IPIV, B, LDB, WORK, INFO) SSYTRS2 Function/Subroutine Documentation subroutine ssytrs2 (characterUPLO, integerN, integerNRHS, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, real, dimension( ldb, * )B, integerLDB, real, dimension( * )WORK, integerINFO) SSYTRS2 Purpose: SSYTRS2 solves a system of linear equations A*X…

  • |

    SSYTRS (3) Linux Manual Page

    ByLinux Manual

    ssytrs.f – Synopsis Functions/Subroutines subroutine ssytrs (UPLO, N, NRHS, A, LDA, IPIV, B, LDB, INFO) SSYTRS Function/Subroutine Documentation subroutine ssytrs (characterUPLO, integerN, integerNRHS, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, real, dimension( ldb, * )B, integerLDB, integerINFO) SSYTRS Purpose: SSYTRS solves a system of linear equations A*X = B with a real…

  • |

    SSYTRI2X (3) Linux Manual Page

    ByLinux Manual

    ssytri2x.f – Synopsis Functions/Subroutines subroutine ssytri2x (UPLO, N, A, LDA, IPIV, WORK, NB, INFO) SSYTRI2X Function/Subroutine Documentation subroutine ssytri2x (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, real, dimension( n+nb+1,* )WORK, integerNB, integerINFO) SSYTRI2X Purpose: SSYTRI2X computes the inverse of a real symmetric indefinite matrix A using the factorization A =…

  • |

    SSYTRI2 (3) Linux Manual Page

    ByLinux Manual

    ssytri2.f – Synopsis Functions/Subroutines subroutine ssytri2 (UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO) SSYTRI2 Function/Subroutine Documentation subroutine ssytri2 (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, real, dimension( * )WORK, integerLWORK, integerINFO) SSYTRI2 Purpose: SSYTRI2 computes the inverse of a REAL symmetric indefinite matrix A using the factorization A =…

  • |

    SSYTRI (3) Linux Manual Page

    ByLinux Manual

    ssytri.f – Synopsis Functions/Subroutines subroutine ssytri (UPLO, N, A, LDA, IPIV, WORK, INFO) SSYTRI Function/Subroutine Documentation subroutine ssytri (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, real, dimension( * )WORK, integerINFO) SSYTRI Purpose: SSYTRI computes the inverse of a real symmetric indefinite matrix A using the factorization A = U*D*U**T or…

  • |

    SSYTRF (3) Linux Manual Page

    ByLinux Manual

    ssytrf.f – Synopsis Functions/Subroutines subroutine ssytrf (UPLO, N, A, LDA, IPIV, WORK, LWORK, INFO) SSYTRF Function/Subroutine Documentation subroutine ssytrf (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, real, dimension( * )WORK, integerLWORK, integerINFO) SSYTRF Purpose: SSYTRF computes the factorization of a real symmetric matrix A using the Bunch-Kaufman diagonal pivoting method….

  • |

    SSYTRD (3) Linux Manual Page

    ByLinux Manual

    ssytrd.f – Synopsis Functions/Subroutines subroutine ssytrd (UPLO, N, A, LDA, D, E, TAU, WORK, LWORK, INFO) SSYTRD Function/Subroutine Documentation subroutine ssytrd (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, real, dimension( * )D, real, dimension( * )E, real, dimension( * )TAU, real, dimension( * )WORK, integerLWORK, integerINFO) SSYTRD Purpose: SSYTRD reduces a real symmetric matrix…

  • |

    SSYTF2 (3) Linux Manual Page

    ByLinux Manual

    ssytf2.f – Synopsis Functions/Subroutines subroutine ssytf2 (UPLO, N, A, LDA, IPIV, INFO) SSYTF2 computes the factorization of a real symmetric indefinite matrix, using the diagonal pivoting method (unblocked algorithm). Function/Subroutine Documentation subroutine ssytf2 (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, integer, dimension( * )IPIV, integerINFO) SSYTF2 computes the factorization of a real symmetric indefinite…

  • |

    SSYTD2 (3) Linux Manual Page

    ByLinux Manual

    ssytd2.f – Synopsis Functions/Subroutines subroutine ssytd2 (UPLO, N, A, LDA, D, E, TAU, INFO) SSYTD2 reduces a symmetric matrix to real symmetric tridiagonal form by an orthogonal similarity transformation (unblocked algorithm). Function/Subroutine Documentation subroutine ssytd2 (characterUPLO, integerN, real, dimension( lda, * )A, integerLDA, real, dimension( * )D, real, dimension( * )E, real, dimension( * )TAU,…