section 3 · Library functions 📚

C (continued)

• CiderWebmail::DB::Result::DbVersion(3pm)✨
• CiderWebmail::DB::Result::RecentContacts(3pm)✨
• CiderWebmail::DB::Result::Settings(3pm)✨
• CiderWebmail::Error(3pm)Error Handling in CiderWebmail✨
• CiderWebmail::Header(3pm)✨
• CiderWebmail::Mailbox(3pm)✨
• CiderWebmail::Message(3pm)✨
• CiderWebmail::Message::Forwarded(3pm)represents a message/rfc822 body part✨
• CiderWebmail::Model::DB(3pm)Catalyst DBIC Schema Model =head1 SYNOPSIS See CiderWebmail✨
• CiderWebmail::Model::IMAPClient(3pm)Catalyst Model✨
• CiderWebmail::Model::Managesieve(3pm)✨
• CiderWebmail::Part(3pm)✨
• CiderWebmail::Part::Attachment(3pm)✨
• CiderWebmail::Part::Dummy(3pm)✨
• CiderWebmail::Part::ImageJpeg(3pm)✨
• CiderWebmail::Part::MessageDeliveryStatus(3pm)✨
• CiderWebmail::Part::RFC822(3pm)✨
• CiderWebmail::Part::Root(3pm)✨
• CiderWebmail::Part::TextCalendar(3pm)✨
• CiderWebmail::Part::TextHtml(3pm)✨
• CiderWebmail::Part::TextPlain(3pm)✨
• CiderWebmail::Util(3pm)✨
• CiderWebmail::View::Petal(3pm)Catalyst View✨
• CiderWebmail::View::RFC822(3pm)Catalyst View for sending e-Mail✨
• cidr(3bobcat)Compares IP4 addresses to CIDR specifications✨
• CIL::Mixed(3pm)[OBSOLETE] getopt processing with both long and short options✨
• cimag(3)get imaginary part of a complex number✨
• cimag(3p)complex imaginary functions✨
• cimag(3posix)complex imaginary functions✨
• cimagf(3)get imaginary part of a complex number✨
• cimagl(3)get imaginary part of a complex number✨
• cininserter(3bobcat)Runs external programs reading standard input✨
• cinttypes(3)✨
• cipher(3)✨
• cipher_iv(3)✨
• cipher_iv_update(3)✨
• cipher_key(3)✨
• cipher_off(3)✨
• cir(3)✨
• circle(3)Draws a circle. Allegro game programming library.✨
• circle(3alleg4)Draws a circle. Allegro game programming library.✨
• Circle(3pm)server backend for the "Circle" application host✨
• Circle::FE::Term(3pm)Terminal frontend for the "Circle" application host✨
• circlefill(3)Draws a filled circle. Allegro game programming library.✨
• circlefill(3alleg4)Draws a filled circle. Allegro game programming library.✨
• circleq(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_EMPTY(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_ENTRY(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_FIRST(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_FOREACH(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_FOREACH_REVERSE(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_HEAD(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_HEAD_INITIALIZER(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_INIT(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_INSERT_AFTER(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_INSERT_BEFORE(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_INSERT_HEAD(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_INSERT_TAIL(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_LAST(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_LOOP_NEXT(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_LOOP_PREV(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_NEXT(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_PREV(3)implementation of a doubly linked circular queue✨
• CIRCLEQ_REMOVE(3)implementation of a doubly linked circular queue✨
• Cisco::CopyConfig(3pm)IOS running-config manipulation✨
• ciso646(3)✨
• citelist(3)Bibliography✨
• ck_array_buffer(3)return length and pointer to array of reader-visible pointers✨
• ck_array_commit(3)linearization point for mutations before commit call✨
• ck_array_deinit(3)destroy and deinitialize a pointer array✨
• CK_ARRAY_FOREACH(3)iterate through an array✨
• ck_array_init(3)initialize a pointer array✨
• ck_array_initialized(3)indicates whether an array was recently initialized or deinitialized✨
• ck_array_length(3)returns the number of pointers committed to an array✨
• ck_array_put(3)attempt immediate or deferred insertion of a pointer into array✨
• ck_array_put_unique(3)attempt immediate or deferred insertion of a unique pointer into array✨
• ck_array_remove(3)attempt immediate or deferred removal of a pointer from an array✨
• ck_bitmap_base(3)determine the size of a bit array in bytes✨
• ck_bitmap_bits(3)return number of addressable bits in bitmap✨
• ck_bitmap_bts(3)set the bit at the specified index and fetch its original value✨
• ck_bitmap_buffer(3)returns pointer to bit array✨
• ck_bitmap_clear(3)reset all bits✨
• ck_bitmap_init(3)initialize a bitmap✨
• ck_bitmap_iterator_init(3)initialize bitmap iterator✨
• ck_bitmap_next(3)iterate to the next set bit in bitmap✨
• ck_bitmap_reset(3)resets the bit at the specified index✨
• ck_bitmap_set(3)set the bit at the specified index✨
• ck_bitmap_size(3)returns necessary number of bytes for bitmap✨
• ck_bitmap_test(3)determine if the bit at the specified index is set✨
• ck_bitmap_union(3)generates union of two bitmaps✨
• ck_brlock(3)big-reader locks✨
• ck_cohort(3)generalized interface for lock cohorts✨
• CK_COHORT_INIT(3)initialize instance of a cohort type✨
• CK_COHORT_INSTANCE(3)declare an instance of a cohort type✨
• CK_COHORT_LOCK(3)acquire cohort lock✨
• CK_COHORT_PROTOTYPE(3)define cohort type with specified lock types✨
• CK_COHORT_TRYLOCK(3)try to acquire cohort lock✨
• CK_COHORT_TRYLOCK_PROTOTYPE(3)define cohort type with specified lock types✨
• CK_COHORT_UNLOCK(3)release cohort lock✨
• ck_elide(3)lock elision wrappers✨
• ck_epoch_barrier(3)block until a grace period and all callbacks have been dispatched✨
• ck_epoch_begin(3)begin epoch-protected segment of execution✨
• ck_epoch_call(3)defer function execution until a grace period✨
• ck_epoch_end(3)end epoch-protected segment of execution✨
• ck_epoch_init(3)initialize epoch reclamation object✨
• ck_epoch_poll(3)non-blocking poll of epoch object for dispatch cycles✨
• ck_epoch_reclaim(3)immediately execute all deferred callbacks✨
• ck_epoch_recycle(3)return an epoch record that may be used by caller✨
• ck_epoch_register(3)register a thread for epoch reclamation✨
• ck_epoch_synchronize(3)block until a grace period has been detected✨
• ck_epoch_unregister(3)unregister a thread for epoch reclamation✨
• ck_hs_apply(3)apply a function to hash set value✨
• ck_hs_count(3)returns number of entries in hash set✨
• ck_hs_destroy(3)destroy hash set✨
• ck_hs_fas(3)fetch and store key in hash set✨
• ck_hs_gc(3)perform maintenance on a hash set✨
• ck_hs_get(3)load a key from a hash set✨
• ck_hs_grow(3)enlarge hash set capacity✨
• CK_HS_HASH(3)invoke hash function with hash set seed✨
• ck_hs_init(3)initialize a hash set✨
• ck_hs_iterator_init(3)initialize hash set iterator✨
• ck_hs_move(3)move one from hash set to another✨
• ck_hs_next(3)iterate to next entry in hash set✨
• ck_hs_put(3)store unique key into a hash set✨
• ck_hs_put_unique(3)unconditionally store unique key into a hash set✨
• ck_hs_rebuild(3)rebuild a hash set✨
• ck_hs_remove(3)remove key from a hash set✨
• ck_hs_reset(3)remove all keys from a hash set✨
• ck_hs_reset_size(3)remove all keys from a hash set✨
• ck_hs_set(3)store key into a hash set✨
• ck_hs_stat(3)get hash set status✨
• ck_ht_count(3)return count of key-value pairs in hash table✨
• ck_ht_destroy(3)immediately destroy a hash table✨
• ck_ht_entry_empty(3)determine whether entry contains a key-value pair✨
• ck_ht_entry_key(3)return pointer to key as specified in hash table entry✨
• ck_ht_entry_key_direct(3)return key value as specified in hash table entry✨
• ck_ht_entry_key_length(3)returns the length of the key specified in the argument✨
• ck_ht_entry_key_set(3)initialize pointer to key in hash table entry✨
• ck_ht_entry_key_set_direct(3)initialize key value in hash table entry✨
• ck_ht_entry_set(3)initialize a key-value pair✨
• ck_ht_entry_set_direct(3)initialize a key-value pair✨
• ck_ht_entry_value(3)return pointer to value as specified in hash table entry✨
• ck_ht_entry_value_direct(3)return value as specified in hash table entry✨
• ck_ht_gc(3)perform maintenance on a hash table✨
• ck_ht_get_spmc(3)load a key-value pair from a hash table✨
• ck_ht_grow_spmc(3)resize a hash table if necessary✨
• ck_ht_hash(3)generate a hash value for a hash table✨
• ck_ht_hash_direct(3)generate a hash value for a hash table✨
• ck_ht_init(3)initialize a hash table✨
• ck_ht_iterator_init(3)initialize hash table iterator✨
• ck_ht_next(3)iterate to next entry in hash table✨
• ck_ht_put_spmc(3)store unique key-value pair into hash table✨
• ck_ht_remove_spmc(3)resize a hash table if necessary✨
• ck_ht_reset_size_spmc(3)remove all entries from a hash table and reset size✨
• ck_ht_reset_spmc(3)remove all entries from a hash table✨
• ck_ht_set_spmc(3)store key-value pair into hash table✨
• ck_ht_stat(3)get hash table status✨
• ck_pflock(3)centralized phase-fair reader-writer locks✨
• ck_pr(3)concurrency primitives interface✨
• ck_pr_add(3)atomic addition operations✨
• ck_pr_and(3)atomic bitwise- and operations✨
• ck_pr_barrier(3)compiler optimization barrier✨
• ck_pr_btc(3)atomic bit test-and-complement operations✨
• ck_pr_btr(3)atomic bit test-and-reset operations✨
• ck_pr_bts(3)atomic bit test-and-set operations✨
• ck_pr_cas(3)atomic compare-and-swap operations✨
• ck_pr_dec(3)atomic decrement operations✨
• ck_pr_faa(3)atomic fetch-and-add operations✨
• ck_pr_fas(3)atomic swap operations✨
• ck_pr_fence_acquire(3)enforce acquire semantics✨
• ck_pr_fence_atomic(3)enforce partial ordering of atomic read-modify- write operations✨
• ck_pr_fence_atomic_load(3)enforce ordering of atomic read-modify-write operations to load operations✨
• ck_pr_fence_atomic_store(3)enforce ordering of atomic read-modify-write operations to store operations✨
• ck_pr_fence_load(3)enforce partial ordering of load operations✨
• ck_pr_fence_load_atomic(3)enforce ordering of load operations to atomic read-modify-write operations✨
• ck_pr_fence_load_depends(3)data dependency barrier✨
• ck_pr_fence_load_store(3)enforce ordering of load operations to store operations✨
• ck_pr_fence_memory(3)enforce partial ordering of all memory operations✨
• ck_pr_fence_release(3)enforce release semantics✨
• ck_pr_fence_store(3)enforce partial ordering of store operations✨
• ck_pr_fence_store_atomic(3)enforce ordering of store operations to load operations✨
• ck_pr_fence_store_load(3)enforce ordering of store operations to load operations✨
• ck_pr_inc(3)atomic increment operations✨
• ck_pr_load(3)atomic volatile load operations✨
• ck_pr_neg(3)atomic negation operations✨
• ck_pr_not(3)atomic complement operations✨
• ck_pr_or(3)atomic bitwise-or operations✨
• ck_pr_rtm(3)restricted transactional memory✨
• ck_pr_stall(3)busy-wait primitive✨
• ck_pr_store(3)atomic volatile store operations✨
• ck_pr_sub(3)atomic subtraction operations✨
• ck_pr_xor(3)atomic bitwise- xor operations✨
• ck_queue(3)multi- reader single-writer singly-linked lists, singly-linked tail queues and lists✨
• ck_rhs_apply(3)apply a function to hash set value✨
• ck_rhs_count(3)returns number of entries in hash set✨
• ck_rhs_destroy(3)destroy hash set✨
• ck_rhs_fas(3)fetch and store key in hash set✨
• ck_rhs_gc(3)perform maintenance on a hash set✨
• ck_rhs_get(3)load a key from a hash set✨
• ck_rhs_grow(3)enlarge hash set capacity✨