section 3 · Library functions 📚

P (continued)

• pcap_snapshot(3)get the snapshot length✨
• pcap_stats(3)get capture statistics✨
• pcap_statustostr(3)convert a PCAP_ERROR_ or PCAP_WARNING_ value to a string✨
• pcap_strerror(3)convert an errno value to a string✨
• pcap_tstamp_type_name_to_val(3)get the time stamp type value corresponding to a time stamp type name✨
• pcap_tstamp_type_val_to_name(3)get a name or description for a time stamp type value✨
• pcdbsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcdbtrf(3)compute a LU factorization of an N-by-N complex banded diagonally dominant-like distributed matrix with bandwidth BWL, BWU✨
• pcdbtrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcdbtrsv(3)solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcdtsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcdttrf(3)compute a LU factorization of an N-by-N complex tridiagonal diagonally dominant-like distributed matrix A(1:N, JA:JA+N-1)✨
• pcdttrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcdttrsv(3)solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcgbsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcgbtrf(3)compute a LU factorization of an N-by-N complex banded distributed matrix with bandwidth BWL, BWU✨
• pcgbtrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcgebd2(3)reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form B by an unitary transformation✨
• pcgebrd(3)reduce a complex general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form B by an unitary transformation✨
• pcgecon(3)estimate the reciprocal of the condition number of a general distributed complex matrix A(IA:IA+N-1,JA:JA+N-1), in either the 1-norm or the infinity-norm, using the LU factorization computed by…✨
• pcgeequ(3)compute row and column scalings intended to equilibrate an M- by-N distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA:JA+N-1) and reduce its condition number✨
• pcgehd2(3)reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary similarity transformation✨
• pcgehrd(3)reduce a complex general distributed matrix sub( A ) to upper Hessenberg form H by an unitary similarity transformation✨
• pcgelq2(3)compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q✨
• pcgelqf(3)compute a LQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = L * Q✨
• pcgels(3)solve overdetermined or underdetermined complex linear systems involving an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1),✨
• pcgeql2(3)compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L✨
• pcgeqlf(3)compute a QL factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * L✨
• pcgeqpf(3)compute a QR factorization with column pivoting of a M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)✨
• pcgeqr2(3)compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R✨
• pcgeqrf(3)compute a QR factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = Q * R✨
• pcgerfs(3)improve the computed solution to a system of linear equations and provides error bounds and backward error estimates for the solutions✨
• pcgerq2(3)compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q✨
• pcgerqf(3)compute a RQ factorization of a complex distributed M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) = R * Q✨
• pcgesv(3)compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),✨
• pcgesvx(3)use the LU factorization to compute the solution to a complex system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),✨
• pcgetf2(3)compute an LU factorization of a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges✨
• pcgetrf(3)compute an LU factorization of a general M-by-N distributed matrix sub( A ) = (IA:IA+M-1,JA:JA+N-1) using partial pivoting with row interchanges✨
• pcgetri(3)compute the inverse of a distributed matrix using the LU factorization computed by PCGETRF✨
• pcgetrs(3)solve a system of distributed linear equations op( sub( A ) ) * X = sub( B ) with a general N-by-N distributed matrix sub( A ) using the LU factorization computed by PCGETRF✨
• pcggqrf(3)compute a generalized QR factorization of an N-by-M matrix sub( A ) = A(IA:IA+N-1,JA:JA+M-1) and an N-by-P matrix sub( B ) = B(IB:IB+N-1,JB:JB+P-1)✨
• pcggrqf(3)compute a generalized RQ factorization of an M-by-N matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)✨
• pcheevx(3)compute selected eigenvalues and, optionally, eigenvectors of a complex hermitian matrix A by calling the recommended sequence of ScaLAPACK routines✨
• pchegs2(3)reduce a complex Hermitian-definite generalized eigenproblem to standard form✨
• pchegst(3)reduce a complex Hermitian-definite generalized eigenproblem to standard form✨
• pchegvx(3)compute all the eigenvalues, and optionally, the eigenvectors of a complex generalized Hermitian-definite eigenproblem✨
• pchetd2(3)reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation✨
• pchetrd(3)reduce a complex Hermitian matrix sub( A ) to Hermitian tridiagonal form T by an unitary similarity transformation✨
• PCI_ANY_ID(3)✨
• PCI_FMT_NVAL(3)✨
• PCI_MAX_RESOURCE(3)✨
• PCI_PRI_FMT(3)✨
• PCI_RESOURCE_FMT_NVAL(3)✨
• PCI_SHORT_PRI_FMT(3)✨
• pcie(3)✨
• pcl(3)C coroutine management✨
• pclabrd(3)reduce the first NB rows and columns of a complex general M- by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) to upper or lower bidiagonal form by an unitary transformation Q' * A * P, and…✨
• pclacgv(3)conjugate a complex vector of length N, sub( X ), where sub( X ) denotes X(IX,JX:JX+N-1) if INCX = DESCX( M_ ) and X(IX:IX+N-1,JX) if INCX = 1, and Notes ===== Each global data object is described by…✨
• pclacon(3)estimate the 1-norm of a square, complex distributed matrix A✨
• pclacp2(3)copie all or part of a distributed matrix A to another distributed matrix B✨
• pclacpy(3)copie all or part of a distributed matrix A to another distributed matrix B✨
• pclaevswp(3)move the eigenvectors (potentially unsorted) from where they are computed, to a ScaLAPACK standard block cyclic array, sorted so that the corresponding eigenvalues are sorted✨
• pclahrd(3)reduce the first NB columns of a complex general N-by-(N-K+1) distributed matrix A(IA:IA+N-1,JA:JA+N-K) so that elements below the k- th subdiagonal are zero✨
• pclange(3)return the value of the one norm, or the Frobenius norm,✨
• pclanhe(3)return the value of the one norm, or the Frobenius norm,✨
• pclanhs(3)return the value of the one norm, or the Frobenius norm,✨
• pclansy(3)return the value of the one norm, or the Frobenius norm,✨
• pclantr(3)return the value of the one norm, or the Frobenius norm,✨
• pclapiv(3)applie either P (permutation matrix indicated by IPIV) or inv( P ) to a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting✨
• pclapv2(3)applie either P (permutation matrix indicated by IPIV) or inv( P ) to a M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1), resulting in row or column pivoting✨
• pclaqge(3)equilibrate a general M-by-N distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1) using the row and scaling factors in the vectors R and C✨
• pclaqsy(3)equilibrate a symmetric distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the scaling factors in the vectors SR and SC✨
• pclarf(3)applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right✨
• pclarfb(3)applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right✨
• pclarfc(3)applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),✨
• pclarfg(3)generate a complex elementary reflector H of order n, such that H * sub( X ) = H * ( x(iax,jax) ) = ( alpha ), H' * H = I✨
• pclarft(3)form the triangular factor T of a complex block reflector H of order n, which is defined as a product of k elementary reflectors✨
• pclarz(3)applie a complex elementary reflector Q to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1), from either the left or the right✨
• pclarzb(3)applie a complex block reflector Q or its conjugate transpose Q**H to a complex M-by-N distributed matrix sub( C ) denoting C(IC:IC+M-1,JC:JC+N-1), from the left or the right✨
• pclarzc(3)applie a complex elementary reflector Q**H to a complex M-by-N distributed matrix sub( C ) = C(IC:IC+M-1,JC:JC+N-1),✨
• pclarzt(3)form the triangular factor T of a complex block reflector H of order > n, which is defined as a product of k elementary reflectors as returned by PCTZRZF✨
• pclascl(3)multiplie the M-by-N complex distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) by the real scalar CTO/CFROM✨
• pclase2(3)initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals✨
• pclaset(3)initialize an M-by-N distributed matrix sub( A ) denoting A(IA:IA+M-1,JA:JA+N-1) to BETA on the diagonal and ALPHA on the offdiagonals✨
• pclassq(3)return the values scl and smsq such that ( scl**2 )*smsq = x( 1 )**2 +...+ x( n )**2 + ( scale**2 )*sumsq,✨
• pclaswp(3)perform a series of row or column interchanges on the distributed matrix sub( A ) = A(IA:IA+M-1,JA:JA+N-1)✨
• pclatra(3)compute the trace of an N-by-N distributed matrix sub( A ) denoting A( IA:IA+N-1, JA:JA+N-1 )✨
• pclatrd(3)reduce NB rows and columns of a complex Hermitian distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) to complex tridiagonal form by an unitary similarity transformation Q' * sub( A ) * Q, and…✨
• pclatrs(3)solve a triangular system✨
• pclatrz(3)reduce the M-by-N ( M<=N ) complex upper trapezoidal matrix sub( A ) = [A(IA:IA+M-1,JA:JA+M-1) A(IA:IA+M-1,JA+N-L:JA+N-1)]✨
• pclauu2(3)compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)✨
• pclauum(3)compute the product U * U' or L' * L, where the triangular factor U or L is stored in the upper or lower triangular part of the distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1)✨
• pclose(3)pipe stream to or from a process✨
• pclose_execs(3)pipe stream to or from a process without using a shell✨
• pclose_execsp(3)pipe stream to or from a process without using a shell✨
• pclose_nosh(3)pipe stream to or from a process without using a shell✨
• pcmax1(3)compute the global index of the maximum element in absolute value of a distributed vector sub( X )✨
• pcp(3)✨
• pcpbsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcpbtrf(3)compute a Cholesky factorization of an N-by-N complex banded symmetric positive definite distributed matrix with bandwidth BW✨
• pcpbtrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcpbtrsv(3)solve a banded triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• PCPIntro(3)introduction to the Performance Co-Pilot (PCP) libraries✨
• pcpocon(3)estimate the reciprocal of the condition number (in the 1-norm) of a complex Hermitian positive definite distributed matrix using the Cholesky factorization A = U**H*U or A = L*L**H computed by…✨
• pcpoequ(3)compute row and column scalings intended to equilibrate a distributed Hermitian positive definite matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) and reduce its condition number (with respect to the…✨
• pcporfs(3)improve the computed solution to a system of linear equations when the coefficient matrix is Hermitian positive definite and provides error bounds and backward error estimates for the solutions✨
• pcposv(3)compute the solution to a complex system of linear equations sub( A ) * X = sub( B ),✨
• pcposvx(3)use the Cholesky factorization A = U**H*U or A = L*L**H to compute the solution to a complex system of linear equations A(IA:IA+N-1,JA:JA+N-1) * X = B(IB:IB+N-1,JB:JB+NRHS-1),✨
• pcpotf2(3)compute the Cholesky factorization of a complex hermitian positive definite distributed matrix sub( A )=A(IA:IA+N-1,JA:JA+N-1)✨
• pcpotrf(3)compute the Cholesky factorization of an N-by-N complex hermitian positive definite distributed matrix sub( A ) denoting A(IA:IA+N-1, JA:JA+N-1)✨
• pcpotri(3)compute the inverse of a complex Hermitian positive definite distributed matrix sub( A ) = A(IA:IA+N-1,JA:JA+N-1) using the Cholesky factorization sub( A ) = U**H*U or L*L**H computed by PCPOTRF✨
• pcpotrs(3)solve a system of linear equations sub( A ) * X = sub( B ) A(IA:IA+N-1,JA:JA+N-1)*X = B(IB:IB+N-1,JB:JB+NRHS-1)✨
• pcptsv(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcpttrf(3)compute a Cholesky factorization of an N-by-N complex tridiagonal symmetric positive definite distributed matrix A(1:N, JA:JA+N-1)✨
• pcpttrs(3)solve a system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• pcpttrsv(3)solve a tridiagonal triangular system of linear equations A(1:N, JA:JA+N-1) * X = B(IB:IB+N-1, 1:NRHS)✨
• Pcre(3)✨
• pcre(3)Perl-compatible regular expressions (original API)✨
• pcre16(3)Perl-compatible regular expressions #include <pcre.h>✨
• pcre16_assign_jit_stack(3)Perl-compatible regular expressions✨
• pcre16_compile(3)Perl-compatible regular expressions✨
• pcre16_compile2(3)Perl-compatible regular expressions✨
• pcre16_config(3)Perl-compatible regular expressions✨
• pcre16_copy_named_substring(3)Perl-compatible regular expressions✨
• pcre16_copy_substring(3)Perl-compatible regular expressions✨
• pcre16_dfa_exec(3)Perl-compatible regular expressions✨
• pcre16_exec(3)Perl-compatible regular expressions✨
• pcre16_free_study(3)Perl-compatible regular expressions✨
• pcre16_free_substring(3)Perl-compatible regular expressions✨
• pcre16_free_substring_list(3)Perl-compatible regular expressions✨
• pcre16_fullinfo(3)Perl-compatible regular expressions✨
• pcre16_get_named_substring(3)Perl-compatible regular expressions✨
• pcre16_get_stringnumber(3)Perl-compatible regular expressions✨
• pcre16_get_stringtable_entries(3)Perl-compatible regular expressions✨
• pcre16_get_substring(3)Perl-compatible regular expressions✨
• pcre16_get_substring_list(3)Perl-compatible regular expressions✨
• pcre16_jit_exec(3)Perl-compatible regular expressions✨
• pcre16_jit_stack_alloc(3)Perl-compatible regular expressions✨
• pcre16_jit_stack_free(3)Perl-compatible regular expressions✨
• pcre16_maketables(3)Perl-compatible regular expressions✨
• pcre16_pattern_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre16_refcount(3)Perl-compatible regular expressions✨
• pcre16_study(3)Perl-compatible regular expressions✨
• pcre16_utf16_to_host_byte_order(3)Perl-compatible regular expressions✨
• pcre16_version(3)Perl-compatible regular expressions✨
• pcre2(3)Perl-compatible regular expressions (revised API)✨
• pcre2_callout_enumerate(3)Perl-compatible regular expressions (revised API)✨
• pcre2_code_copy(3)Perl-compatible regular expressions (revised API)✨
• pcre2_code_copy_with_tables(3)Perl-compatible regular expressions (revised API)✨
• pcre2_code_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_compile(3)Perl-compatible regular expressions (revised API)✨
• pcre2_compile_context_copy(3)Perl-compatible regular expressions (revised API)✨
• pcre2_compile_context_create(3)Perl-compatible regular expressions (revised API)✨
• pcre2_compile_context_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_config(3)Perl-compatible regular expressions (revised API)✨
• pcre2_convert_context_copy(3)Perl-compatible regular expressions (revised API)✨
• pcre2_convert_context_create(3)Perl-compatible regular expressions (revised API)✨
• pcre2_convert_context_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_converted_pattern_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_dfa_match(3)Perl-compatible regular expressions (revised API)✨
• pcre2_general_context_copy(3)Perl-compatible regular expressions (revised API)✨
• pcre2_general_context_create(3)Perl-compatible regular expressions (revised API)✨
• pcre2_general_context_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_error_message(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_mark(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_match_data_heapframes_size(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_match_data_size(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_ovector_count(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_ovector_pointer(3)Perl-compatible regular expressions (revised API)✨
• pcre2_get_startchar(3)Perl-compatible regular expressions (revised API)✨
• pcre2_jit_compile(3)Perl-compatible regular expressions (revised API)✨
• pcre2_jit_free_unused_memory(3)Perl-compatible regular expressions (revised API)✨
• pcre2_jit_match(3)Perl-compatible regular expressions (revised API)✨
• pcre2_jit_stack_assign(3)Perl-compatible regular expressions (revised API)✨
• pcre2_jit_stack_create(3)Perl-compatible regular expressions (revised API)✨
• pcre2_jit_stack_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_maketables(3)Perl-compatible regular expressions (revised API)✨
• pcre2_maketables_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match_context_copy(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match_context_create(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match_context_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match_data_create(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match_data_create_from_pattern(3)Perl-compatible regular expressions (revised API)✨
• pcre2_match_data_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_next_match(3)Perl-compatible regular expressions (revised API)✨
• pcre2_pattern_convert(3)Perl-compatible regular expressions (revised API)✨
• pcre2_pattern_info(3)Perl-compatible regular expressions (revised API)✨
• pcre2_serialize_decode(3)Perl-compatible regular expressions (revised API)✨
• pcre2_serialize_encode(3)Perl-compatible regular expressions (revised API)✨
• pcre2_serialize_free(3)Perl-compatible regular expressions (revised API)✨
• pcre2_serialize_get_number_of_codes(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_bsr(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_callout(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_character_tables(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_compile_extra_options(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_compile_recursion_guard(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_depth_limit(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_glob_escape(3)Perl-compatible regular expressions (revised API)✨
• pcre2_set_glob_separator(3)Perl-compatible regular expressions (revised API)✨