Searched refs:avail (Results 1 - 25 of 114) sorted by relevance

12345

/macosx-10.10/objc4-646/test/
H A Dverify-exports.pl134 my $avail = undef;
136 ($cdecl2, $avail) = ($cdecl =~ /^(.*)\s+(__OSX_AVAILABLE_\w+\([a-zA-Z0-9_, ]+\))\s*$/) if (!defined $avail);
137 ($cdecl2, $avail) = ($cdecl =~ /^(.*)\s+(AVAILABLE_MAC_OS_X_VERSION_\w+)\s*$/) if (!defined $avail);
138 ($cdecl2, $avail) = ($cdecl =~ /^(.*)\s+(OBJC2_UNAVAILABLE)\s*$/) if (!defined $avail);
139 ($cdecl2, $avail) = ($cdecl =~ /^(.*)\s+(OBJC_GC_UNAVAILABLE)\s*$/) if (!defined $avail);
140 ($cdecl2, $avail)
[all...]
/macosx-10.10/postfix-255/postfix/src/master/
H A Dmaster_proto.h28 int avail; /* availability */ member in struct:MASTER_STATUS
H A Dmaster_proto.c78 stat.avail = status;
H A Dmaster_status.c99 msg_info("%s: pid %d gen %u avail %d",
100 myname, stat.pid, stat.gen, stat.avail);
131 if (proc->avail == stat.avail)
133 switch (stat.avail) {
143 myname, stat.pid, stat.avail);
H A Dmaster_avail.c143 msg_info("%s: %s avail %d total %d max %d", myname, serv->name,
221 if (proc->avail == MASTER_STAT_AVAIL)
224 proc->avail = MASTER_STAT_AVAIL;
246 if (proc->avail != MASTER_STAT_AVAIL)
249 proc->avail = MASTER_STAT_TAKEN;
/macosx-10.10/libarchive-30/libarchive/libarchive/
H A Darchive_read_support_format_empty.c62 ssize_t avail; local
64 (void)__archive_read_ahead(a, 1, &avail);
65 if (avail != 0)
H A Darchive_read_support_compression_uu.c162 get_line(const unsigned char *b, ssize_t avail, ssize_t *nlsize) argument
167 while (len < avail) {
174 if (avail-len > 1 && b[1] == '\n') {
192 return (avail);
197 const unsigned char **b, ssize_t *avail, ssize_t *ravail, ssize_t *nl)
203 if (*avail == 0) {
207 len = get_line(*b, *avail, nl);
211 while (*nl == 0 && len == *avail && !quit) {
212 ssize_t diff = *ravail - *avail;
214 *b = __archive_read_filter_ahead(filter, 160 + *ravail, avail);
196 bid_get_line(struct archive_read_filter *filter, const unsigned char **b, ssize_t *avail, ssize_t *ravail, ssize_t *nl) argument
237 ssize_t avail, ravail; local
[all...]
H A Darchive_read_support_format_raw.c124 ssize_t avail; local
131 *buff = __archive_read_ahead(a, 1, &avail);
132 if (avail > 0) {
134 __archive_read_consume(a, avail);
135 *size = avail;
139 } else if (0 == avail) {
149 return (avail);
H A Darchive_read_support_compression_gzip.c116 ssize_t avail, len; local
123 p = __archive_read_filter_ahead(filter, len, &avail);
124 if (p == NULL || avail == 0)
147 p = __archive_read_filter_ahead(filter, len + 2, &avail);
158 if (avail < len)
160 len, &avail);
170 if (avail < len)
172 len, &avail);
180 p = __archive_read_filter_ahead(filter, len + 2, &avail);
277 ssize_t avail; local
336 ssize_t avail; local
[all...]
H A Darchive_read.c358 ssize_t avail; local
399 __archive_read_filter_ahead(filter, 1, &avail);
400 if (avail < 0) {
923 * * If 'avail' pointer is provided, that returns number of bytes available
925 * * If end-of-file, *avail gets set to zero.
926 * * If error, *avail gets error code.
931 * to *avail, which will have the actual amount available. If you
950 __archive_read_ahead(struct archive_read *a, size_t min, ssize_t *avail) argument
952 return (__archive_read_filter_ahead(a->filter, min, avail));
957 size_t min, ssize_t *avail)
956 __archive_read_filter_ahead(struct archive_read_filter *filter, size_t min, ssize_t *avail) argument
[all...]
H A Darchive_write_set_compression_none.c52 ssize_t avail; /* Free space left in buffer */ member in struct:archive_none
103 state->avail = state->buffer_size;
155 if (state->avail < state->buffer_size) {
158 to_copy = (remaining > state->avail) ?
159 state->avail : remaining;
162 state->avail -= to_copy;
166 if (state->avail == 0) {
174 state->avail = state->buffer_size;
193 state->avail -= remaining;
224 block_length = state->buffer_size - state->avail;
[all...]
/macosx-10.10/BerkeleyDB-21/db/java/src/com/sleepycat/util/
H A DFastInputStream.java146 int avail = len - off;
147 if (avail <= 0) {
150 if (length > avail) {
151 length = avail;
/macosx-10.10/postfix-255/postfix/src/global/
H A Drecipient_list.c131 list->avail = 1;
145 if (list->len >= list->avail) {
146 new_avail = list->avail * 2;
149 list->avail = new_avail;
176 SWAP(int, avail);
/macosx-10.10/Security-57031.1.35/Security/include/security_asn1/
H A Dplarena.h55 PRUword avail; /* points to next available byte */ member in struct:PLArena
108 PRUword _p = _a->avail; \
113 _a->avail = _q; \
121 PRUword _p = _a->avail; \
125 _a->avail = PL_ARENA_ALIGN(pool, _q); \
133 #define PL_ARENA_MARK(pool) ((void *) (pool)->current->avail)
138 #define PL_CLEAR_UNUSED(a) (PR_ASSERT((a)->avail <= (a)->limit), \
139 memset((void*)(a)->avail, PL_FREE_PATTERN, \
140 (a)->limit - (a)->avail))
154 if (PR_UPTRDIFF(_m, _a->base) <= PR_UPTRDIFF(_a->avail, _
[all...]
H A Dplarena.c90 pool->first.base = pool->first.avail = pool->first.limit =
135 if ( a->avail +nb <= a->limit ) {
137 rp = (char *)a->avail;
138 a->avail += nb;
151 a->base = a->avail = (PRUword)PL_ARENA_ALIGN(pool, a + 1);
152 rp = (char *)a->avail;
153 a->avail += nb;
201 PR_ASSERT(pool->current->avail == ((PRUword)newp + newSize));
202 pool->current->avail = (PRUword)newp + newAlignSize;
203 PR_ASSERT(pool->current->avail <
[all...]
/macosx-10.10/Security-57031.1.35/Security/libsecurity_asn1/Security/
H A Dplarena.h55 PRUword avail; /* points to next available byte */ member in struct:PLArena
108 PRUword _p = _a->avail; \
113 _a->avail = _q; \
121 PRUword _p = _a->avail; \
125 _a->avail = PL_ARENA_ALIGN(pool, _q); \
133 #define PL_ARENA_MARK(pool) ((void *) (pool)->current->avail)
138 #define PL_CLEAR_UNUSED(a) (PR_ASSERT((a)->avail <= (a)->limit), \
139 memset((void*)(a)->avail, PL_FREE_PATTERN, \
140 (a)->limit - (a)->avail))
154 if (PR_UPTRDIFF(_m, _a->base) <= PR_UPTRDIFF(_a->avail, _
[all...]
H A Dplarena.c90 pool->first.base = pool->first.avail = pool->first.limit =
135 if ( a->avail +nb <= a->limit ) {
137 rp = (char *)a->avail;
138 a->avail += nb;
151 a->base = a->avail = (PRUword)PL_ARENA_ALIGN(pool, a + 1);
152 rp = (char *)a->avail;
153 a->avail += nb;
201 PR_ASSERT(pool->current->avail == ((PRUword)newp + newSize));
202 pool->current->avail = (PRUword)newp + newAlignSize;
203 PR_ASSERT(pool->current->avail <
[all...]
/macosx-10.10/Security-57031.1.35/Security/libsecurity_asn1/lib/
H A Dplarena.h55 PRUword avail; /* points to next available byte */ member in struct:PLArena
108 PRUword _p = _a->avail; \
113 _a->avail = _q; \
121 PRUword _p = _a->avail; \
125 _a->avail = PL_ARENA_ALIGN(pool, _q); \
133 #define PL_ARENA_MARK(pool) ((void *) (pool)->current->avail)
138 #define PL_CLEAR_UNUSED(a) (PR_ASSERT((a)->avail <= (a)->limit), \
139 memset((void*)(a)->avail, PL_FREE_PATTERN, \
140 (a)->limit - (a)->avail))
154 if (PR_UPTRDIFF(_m, _a->base) <= PR_UPTRDIFF(_a->avail, _
[all...]
H A Dplarena.c90 pool->first.base = pool->first.avail = pool->first.limit =
135 if ( a->avail +nb <= a->limit ) {
137 rp = (char *)a->avail;
138 a->avail += nb;
151 a->base = a->avail = (PRUword)PL_ARENA_ALIGN(pool, a + 1);
152 rp = (char *)a->avail;
153 a->avail += nb;
201 PR_ASSERT(pool->current->avail == ((PRUword)newp + newSize));
202 pool->current->avail = (PRUword)newp + newAlignSize;
203 PR_ASSERT(pool->current->avail <
[all...]
/macosx-10.10/Security-57031.1.35/Security/libsecurity_asn1/security_asn1/
H A Dplarena.h55 PRUword avail; /* points to next available byte */ member in struct:PLArena
108 PRUword _p = _a->avail; \
113 _a->avail = _q; \
121 PRUword _p = _a->avail; \
125 _a->avail = PL_ARENA_ALIGN(pool, _q); \
133 #define PL_ARENA_MARK(pool) ((void *) (pool)->current->avail)
138 #define PL_CLEAR_UNUSED(a) (PR_ASSERT((a)->avail <= (a)->limit), \
139 memset((void*)(a)->avail, PL_FREE_PATTERN, \
140 (a)->limit - (a)->avail))
154 if (PR_UPTRDIFF(_m, _a->base) <= PR_UPTRDIFF(_a->avail, _
[all...]
H A Dplarena.c90 pool->first.base = pool->first.avail = pool->first.limit =
135 if ( a->avail +nb <= a->limit ) {
137 rp = (char *)a->avail;
138 a->avail += nb;
151 a->base = a->avail = (PRUword)PL_ARENA_ALIGN(pool, a + 1);
152 rp = (char *)a->avail;
153 a->avail += nb;
201 PR_ASSERT(pool->current->avail == ((PRUword)newp + newSize));
202 pool->current->avail = (PRUword)newp + newAlignSize;
203 PR_ASSERT(pool->current->avail <
[all...]
/macosx-10.10/tcl-105/tcl_ext/snack/snack/unix/
H A DjkAudIO_alsa.c242 int avail; local
246 avail = snd_pcm_avail_update(A->handle);
248 if (A->debug > 1) Snack_WriteLogInt(" Exit SnackAudioReadable",avail);
250 if (avail < 0)
251 avail = 0;
253 return (avail);
259 int avail = snd_pcm_avail_update(A->handle); local
261 if (avail < 0)
262 avail = 0;
264 return (avail);
270 long avail = _snd_pcm_mmap_hw_ptr(A->handle); local
[all...]
/macosx-10.10/tcl-105/tcl_ext/tkimg/tkimg/compat/libtiff/tools/
H A Dgif2tiff.c104 int avail, oldcode; variable
334 avail = clear + 2;
391 avail = clear + 2;
401 if (code > avail) {
402 fprintf(stderr, "code %d too large for %d\n", code, avail);
407 if (code == avail) { /* the first code is always < avail */
417 prefix[avail] = oldcode;
418 suffix[avail] = firstchar;
419 avail
[all...]
/macosx-10.10/Security-57031.1.35/Security/tlsnke/tlsnketest/
H A Dtlssocket.c52 int avail; local
78 avail_size = sizeof(avail);
79 rc = getsockopt(socket, SOL_SOCKET, SO_NREAD, &avail, &avail_size);
82 check(avail_size==sizeof(avail));
84 if(rc || (avail_size !=sizeof(avail)))
87 // printf("%s: Available = %d\n", __FUNCTION__, avail);
89 if(avail==0)
94 rec->contents.data = malloc(avail);
95 rec->contents.length = avail;
108 check(sz==avail);
[all...]
/macosx-10.10/ICU-531.30/icuSources/i18n/
H A Dbasictz.cpp145 UBool avail; local
148 avail = getNextTransition(date, FALSE, tr);
149 if (avail) {
183 avail = getNextTransition(nextTransitionTime, FALSE, tr);
184 if (avail) {
202 avail = ar2->getPreviousStart(date, tr.getFrom()->getRawOffset(), tr.getFrom()->getDSTSavings(), TRUE, d);
203 if (!avail || d > date
215 avail = getPreviousTransition(date, TRUE, tr);
216 if (avail) {
235 avail
296 UBool avail; local
[all...]

Completed in 401 milliseconds

12345