Searched refs:sz (Results 1 - 25 of 490) sorted by path

1234567891011>>

/macosx-10.9.5/AppleUSBIrDA-145.2.4/AppleUSBIrDA/
H A DAppleUSBIrDA.cpp789 int i, sz; local
802 sz = sizeof(counts) / sizeof(counts[0]);
807 for (i = 0 ; i < sz; i++)
/macosx-10.9.5/AppleUSBIrDA-145.2.4/DumpLog/
H A Ddumplog.cpp296 socklen_t sz = sizeof(buffer); local
297 rc = getsockname(f, &buffer, &sz); // udp returns length, family, port high, port low
/macosx-10.9.5/BerkeleyDB-21/db/btree/
H A Dbt_put.c701 __bam_dup_check(dbc, op, h, indx, sz, cntp)
705 u_int32_t indx, sz;
724 sz += B_TYPE(bk->type) == B_KEYDATA ?
742 sz += B_TYPE(bk->type) == B_KEYDATA ?
762 if (sz < dbp->pgsize / 4)
/macosx-10.9.5/BerkeleyDB-21/db/db/
H A Ddb_overflow.c203 u_int32_t sz; local
219 sz = dbt->size; sz > 0; p += pagespace, sz -= pagespace) {
224 if (sz < pagespace)
225 pagespace = sz;
229 * the item onto the page. If sz is less than pagespace, we
/macosx-10.9.5/BerkeleyDB-21/db/dbinc/
H A Dmp.h585 #define MVCC_BHSIZE(mfp, sz) do { \
586 sz += VM_PAGESIZE + sizeof(BH); \
588 sz += VM_PAGESIZE - mfp->stat.st_pagesize; \
619 #define MVCC_MPROTECT(buf, sz, mode) do { \
620 int __ret = mprotect((buf), (sz), (mode)); \
624 #define MVCC_MPROTECT(buf, sz, mode) do { \
626 int __ret = mprotect((buf), (sz), (mode)); \
633 #define MVCC_BHSIZE(mfp, sz) do {} while (0)
/macosx-10.9.5/BerkeleyDB-21/db/examples_c/ex_rep/base/
H A Drep_base.h90 #define readsocket(s, buf, sz) recv((s), (buf), (int)(sz), 0)
91 #define writesocket(s, buf, sz) send((s), (const char *)(buf), (int)(sz), 0)
118 #define readsocket(s, buf, sz) read((s), (buf), (sz))
119 #define writesocket(s, buf, sz) write((s), (buf), (sz))
/macosx-10.9.5/BootCache-106/
H A Dlibrary.c816 size_t sz = getxattr(fname, XATTR_RESOURCEFORK_NAME, NULL, 0, 0, local
818 if (sz > 0){
819 filesize = sz;
/macosx-10.9.5/CF-855.17/
H A DCFPlatform.c1129 size_t sz = 1024; local
1130 *ret = (char *) malloc(sz * sizeof(char));
1133 int cnt = vsnprintf(*ret, sz, format, args);
1135 if (cnt < sz - 1) return cnt;
1136 sz = cnt + 8;
1138 *ret = (char *) realloc(*ret, sz * sizeof(char));
1142 cnt = vsnprintf(*ret, sz, format, args);
1144 if (cnt < sz - 1) return cnt;
H A DCFSortFunctions.c206 INDEX_TYPE sz = ((((count + ncores - 1) / ncores) + 15) / 16) * 16; local
207 INDEX_TYPE num_sect = (count + sz - 1) / sz;
208 INDEX_TYPE last_sect_len = count + sz - sz * num_sect;
212 stack_tmps[idx] = (VALUE_TYPE *)malloc(sz * sizeof(VALUE_TYPE));
218 INDEX_TYPE sect_len = (sect < num_sect - 1) ? sz : last_sect_len;
219 __CFSimpleMergeSort(listp + sect * sz, sect_len, tmps[sect], cmp); // naturally stable
227 VALUE_TYPE *left_base = listp + sect * sz - (right ? sz
279 CFIndex sz = ((((size_t)count + 15) / 16) * 16) / 8; local
[all...]
/macosx-10.9.5/CPANInternal-140/DateTime-Locale/lib/DateTime/Locale/
H A Dhu.pm75 my $era_abbreviated = [ "i\.\ e\.", "i\.\ sz\." ];
82 my $era_wide = [ "id��sz��m��t��sunk\ el��tt", "id��sz��m��t��sunk\ szerint" ];
469 id��sz��m��t��sunk el��tt
470 id��sz��m��t��sunk szerint
475 i. sz.
480 i. sz.
H A Dhu_HU.pm291 id��sz��m��t��sunk el��tt
292 id��sz��m��t��sunk szerint
297 i. sz.
302 i. sz.
/macosx-10.9.5/Chess-310.5/Sources/
H A DMBCEngine.mm589 ssize_t sz = read([f fileDescriptor], buf, max_size);
590 if (sz > 0)
591 [e logFromEngine: [NSString stringWithFormat:@"%.*s", sz, buf]];
592 return sz;
H A DMBCInteractivePlayer.mm88 Size sz = sizeof(refcon);
89 status = SRGetProperty(recognizer, kSRRefCon, &refcon, &sz);
/macosx-10.9.5/Heimdal-323.92.1/appl/ftp/common/
H A Dbuffer.c47 alloc_buffer (void *oldbuf, size_t *sz, struct stat *st) argument
56 if(new_sz > *sz) {
62 *sz = 0;
65 *sz = new_sz;
H A Dcommon.h58 void *alloc_buffer (void *oldbuf, size_t *sz, struct stat *st);
/macosx-10.9.5/Heimdal-323.92.1/appl/ftp/ftp/
H A Druserpass.c67 * Write a copy of the hostname into `hostname, sz' and return a guess
72 guess_domain (char *hostname_str, size_t sz) argument
79 if (gethostname (hostname_str, sz) < 0) {
80 strlcpy (hostname_str, "", sz);
96 strlcpy (hostname_str, ai->ai_canonname, sz);
/macosx-10.9.5/Heimdal-323.92.1/appl/kx/
H A Dkx.h161 size_t sz);
/macosx-10.9.5/Heimdal-323.92.1/appl/rsh/
H A Dcommon.c74 do_read (int fd, void *buf, size_t sz, void *ivec) argument
89 if (len > sz)
127 return read (fd, buf, sz);
131 do_write (int fd, void *buf, size_t sz, void *ivec) argument
141 _krb5_put_int(len, sz, 4);
143 unsigned char *tmp = malloc(sz + 4);
146 _krb5_put_int(tmp, sz, 4);
147 memcpy(tmp + 4, buf, sz);
149 tmp, sz + 4, &data, ivec);
153 buf, sz,
[all...]
H A Drshd.c118 read_str (int s, size_t sz, char *expl) argument
120 char *str = malloc(sz);
124 while(p < str + sz) {
/macosx-10.9.5/Heimdal-323.92.1/lib/akadmin/
H A DHeimODAdmin.c1370 size_t sz; local
1377 ret = decode_hdb_keyset_aapl(CFDataGetBytePtr(el), CFDataGetLength(el), &key, &sz);
1405 ASN1_MALLOC_ENCODE(hdb_keyset_aapl, data, length, &key, &sz, ret);
1410 if (length != sz)
1547 size_t sz; local
1557 &key, &sz);
/macosx-10.9.5/Heimdal-323.92.1/lib/asn1/
H A Dasn1_gen.c76 size_t sz; local
118 &sz);
122 if (fwrite(p + sizeof(p) - sz , sz, 1, fout) != 1)
124 offset += sz;
130 pdata = emalloc(sz);
H A Dasn1_print.c60 size_t sz; local
66 ret = der_get_tag (buf, len, &class, &type, &tag, &sz);
69 if (sz > len)
71 (unsigned)sz, (unsigned)len);
72 buf += sz;
73 len -= sz;
85 ret = der_get_length (buf, len, &length, &sz);
88 if (sz > len)
90 (unsigned)sz, (unsigned)len);
91 buf += sz;
[all...]
H A Dcheck-common.c214 size_t sz, consumed_sz, length_sz, buf_sz; local
238 tests[i].val, &sz);
244 if (sz != tests[i].byte_len) {
247 (unsigned long)sz, (unsigned long)tests[i].byte_len);
254 if (sz != length_sz) {
256 tests[i].name, (unsigned long)length_sz, (unsigned long)sz);
267 print_bytes (buf, sz);
271 rk_dumpdata("actual", buf, sz);
278 buf2 = map_alloc(OVERRUN, buf, sz, &buf2_map);
281 ret = (*decode) (buf2, sz, dat
367 size_t sz; local
[all...]
H A Dcheck-gen.c812 size_t sz; local
824 ret = decode_TESTuint32(buf, td[i].len, &u, &sz);
835 if (td[i].expected_len != sz) {
H A Dhash.c46 hashtabnew(int sz, argument
53 assert(sz > 0);
55 htab = (Hashtab *) malloc(sizeof(Hashtab) + (sz - 1) * sizeof(Hashentry *));
59 for (i = 0; i < sz; ++i)
64 htab->sz = sz;
77 for (hptr = htab->tab[(*htab->hash) (ptr) % htab->sz];
115 tabptr = &htab->tab[(*htab->hash) (ptr) % htab->sz];
157 for (h = htab->tab; h < &htab->tab[htab->sz]; ++h)

Completed in 414 milliseconds

1234567891011>>