Section 3: library functions
ck_array_remove – attempt immediate or deferred removal of a pointer from an array LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft bool Fn ck_array_remove ck_array_t *array void *pointer DescriptionThe Fn ck_array_remove 3 function will attempt to remove the value of Fa pointer into the array pointed to by Fa array . The operation is also free…
ck_array_put_unique – attempt immediate or deferred insertion of a unique pointer into array LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft int Fn ck_array_put_unique ck_array_t *array void *pointer DescriptionThe Fn ck_array_put_unique 3 function will attempt to insert the value of Fa pointer into the array pointed to by Fa array . This function may incur additional…
ck_array_put – attempt immediate or deferred insertion of a pointer into array LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft bool Fn ck_array_put ck_array_t *array void *pointer DescriptionThe Fn ck_array_put 3 function will attempt to insert the value of Fa pointer into the array pointed to by Fa array . This function may incur additional memory…
ck_array_length – returns the number of pointers committed to an array LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft unsigned int Fn ck_array_length ck_array_t *array DescriptionThe Fn ck_array_length 3 function returns the number of items a concurrent traversal operation would encounter at completion time. Return ValuesThe number of traversal-visible pointers is returned. See Alsock_array_commit3, ck_array_put3, ck_array_put_unique3,…
ck_array_initialized – indicates whether an array was recently initialized or deinitialized LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft bool Fn ck_array_initialized ck_array_t *array DescriptionThe Fn ck_array_initialized 3 can be used to determine whether an array was recently initialized with Fn ck_array_init 3 or deinitialized with Fn ck_array_deinit 3 . Behavior is undefined if a user…
ck_array_init – initialize a pointer array LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft bool Fn ck_array_init ck_array_t *array unsigned int mode struct ck_malloc *allocator unsigned int initial_length DescriptionThe Fn ck_array_init 3 function initializes the array pointed to by the argument Fa array . The mode value must be CK_ARRAY_MODE_SPMC The Fa allocator argument must point…
ck_array_deinit – destroy and deinitialize a pointer array LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft void Fn ck_array_deinit ck_array_t *array bool defer DescriptionThe Fn ck_array_deinit 3 destroys the memory associated with the array pointed to by Fa array . The Fa defer argument is true if the allocator must destroy the memory using safe memory…
ck_array_commit – linearization point for mutations before commit call LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft bool Fn ck_array_commit ck_array_t *array DescriptionThe Fn ck_array_commit 3 function will commit any pending put or remove operations associated with the array. The function may end up requesting the safe reclamation of memory actively being iterated upon by other…
ck_array_buffer – return length and pointer to array of reader-visible pointers LibraryConcurrency Kit (libck, -lck) SynopsisIn ck_array.h Ft void * Fn ck_array_buffer ck_array_t *array unsigned int *length DescriptionThe Fn ck_array_buffer 3 returns a pointer to the array of pointers currently visible to readers after the last commit operation in Fa array . The unsigned integer…
CIRCLEQ_EMPTY, CIRCLEQ_ENTRY, CIRCLEQ_FIRST, CIRCLEQ_FOREACH, CIRCLEQ_FOREACH_REVERSE, CIRCLEQ_HEAD, CIRCLEQ_HEAD_INITIALIZER, CIRCLEQ_INIT, CIRCLEQ_INSERT_AFTER, CIRCLEQ_INSERT_BEFORE, CIRCLEQ_INSERT_HEAD, CIRCLEQ_INSERT_TAIL, CIRCLEQ_LAST, CIRCLEQ_LOOP_NEXT, CIRCLEQ_LOOP_PREV, CIRCLEQ_NEXT, CIRCLEQ_PREV, CIRCLEQ_REMOVE – implementation of a doubly linked circular queue Synopsis#include <sys/queue.h> int CIRCLEQ_EMPTY(CIRCLEQ_HEAD *head); CIRCLEQ_ENTRY(TYPE); struct TYPE *CIRCLEQ_FIRST(CIRCLEQ_HEAD *head); CIRCLEQ_FOREACH(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_FOREACH_REVERSE(struct TYPE *var, CIRCLEQ_HEAD *head, CIRCLEQ_ENTRY NAME); CIRCLEQ_HEAD(HEADNAME, TYPE); CIRCLEQ_HEAD CIRCLEQ_HEAD_INITIALIZER(CIRCLEQ_HEAD head);…
circlefill – Draws a filled circle. Allegro game programming library. Synopsis#include <allegro.h> void circlefill(BITMAP *bmp, int x, int y, int radius, int color); DescriptionDraws a filled circle with the specified centre and radius. See Alsoellipsefill(3), circle(3), do_circle(3), drawing_mode(3), makecol(3), excolmap(3), excustom(3), exdbuf(3), exflip(3), exlights(3), expal(3), exspline(3), extrans(3)
circle – Draws a circle. Allegro game programming library. Synopsis#include <allegro.h> void circle(BITMAP *bmp, int x, int y, int radius, int color); DescriptionDraws a circle with the specified centre and radius. See Alsoellipse(3), arc(3), circlefill(3), do_circle(3), drawing_mode(3), makecol(3), ex12bit(3), exblend(3), excustom(3), exjoy(3), exmem(3), exmouse(3), exquat(3), exsprite(3)
cimag, cimagf, cimagl – get imaginary part of a complex number Synopsis#include <complex.h> double cimag(double complex z); float cimagf(float complex z); long double cimagl(long double complex z); Link with -lm. DescriptionThese functions return the imaginary part of the complex number z. One has: z = creal(z) + I * cimag(z)VersionsThese functions first appeared in glibc…
cimag, cimagf, cimagl – get imaginary part of a complex number Synopsis#include <complex.h> double cimag(double complex z); float cimagf(float complex z); long double cimagl(long double complex z); Link with -lm. DescriptionThese functions return the imaginary part of the complex number z. One has: z = creal(z) + I * cimag(z)VersionsThese functions first appeared in glibc…
cimag, cimagf, cimagl – get imaginary part of a complex number Synopsis#include <complex.h> double cimag(double complex z); float cimagf(float complex z); long double cimagl(long double complex z); Link with -lm. DescriptionThese functions return the imaginary part of the complex number z. One has: z = creal(z) + I * cimag(z)VersionsThese functions first appeared in glibc…
chseqr.f – SynopsisFunctions/Subroutinessubroutine chseqr (JOB, COMPZ, N, ILO, IHI, H, LDH, W, Z, LDZ, WORK, LWORK, INFO) CHSEQR Function/Subroutine Documentationsubroutine chseqr (characterJOB, characterCOMPZ, integerN, integerILO, integerIHI, complex, dimension( ldh, * )H, integerLDH, complex, dimension( * )W, complex, dimension( ldz, * )Z, integerLDZ, complex, dimension( * )WORK, integerLWORK, integerINFO)CHSEQR Purpose: CHSEQR computes the eigenvalues of a…
chsein.f – SynopsisFunctions/Subroutinessubroutine chsein (SIDE, EIGSRC, INITV, SELECT, N, H, LDH, W, VL, LDVL, VR, LDVR, MM, M, WORK, RWORK, IFAILL, IFAILR, INFO) CHSEIN Function/Subroutine Documentationsubroutine chsein (characterSIDE, characterEIGSRC, characterINITV, logical, dimension( * )SELECT, integerN, complex, dimension( ldh, * )H, integerLDH, complex, dimension( * )W, complex, dimension( ldvl, * )VL, integerLDVL, complex, dimension( ldvr, *…
chptrs.f – SynopsisFunctions/Subroutinessubroutine chptrs (UPLO, N, NRHS, AP, IPIV, B, LDB, INFO) CHPTRS Function/Subroutine Documentationsubroutine chptrs (characterUPLO, integerN, integerNRHS, complex, dimension( * )AP, integer, dimension( * )IPIV, complex, dimension( ldb, * )B, integerLDB, integerINFO)CHPTRS Purpose: CHPTRS solves a system of linear equations A*X = B with a complex Hermitian matrix A stored in packed format…
chptri.f – SynopsisFunctions/Subroutinessubroutine chptri (UPLO, N, AP, IPIV, WORK, INFO) CHPTRI Function/Subroutine Documentationsubroutine chptri (characterUPLO, integerN, complex, dimension( * )AP, integer, dimension( * )IPIV, complex, dimension( * )WORK, integerINFO)CHPTRI Purpose: CHPTRI computes the inverse of a complex Hermitian indefinite matrix A in packed storage using the factorization A = U*D*U**H or A = L*D*L**H computed…
chptrf.f – SynopsisFunctions/Subroutinessubroutine chptrf (UPLO, N, AP, IPIV, INFO) CHPTRF Function/Subroutine Documentationsubroutine chptrf (characterUPLO, integerN, complex, dimension( * )AP, integer, dimension( * )IPIV, integerINFO)CHPTRF Purpose: CHPTRF computes the factorization of a complex Hermitian packed matrix A using the Bunch-Kaufman diagonal pivoting method: A = U*D*U**H or A = L*D*L**H where U (or L) is a…