/ast/src/lib/libast/string/ |
H A D | strsearch.c | 33 * size siz where the first member of each 40 strsearch(const void* tab, size_t num, size_t siz, Strcmp_f comparf, const char* name, void* context) argument 43 register char* hi = lo + (num - 1) * siz; 49 mid = lo + (((hi - lo) / siz) / 2) * siz; 53 lo = mid + siz; 54 else hi = mid - siz;
|
H A D | strlook.c | 31 * return pointer to name in tab with element size siz 40 strlook(const void* tab, size_t siz, register const char* name) argument 46 for (; s = *((char**)t); t += siz)
|
H A D | strpsearch.c | 41 * size siz where the first member of each 53 strpsearch(const void* tab, size_t num, size_t siz, const char* name, char** next) argument 56 register char* hi = lo + (num - 1) * siz; 73 mid = lo + (sequential ? 0 : (((hi - lo) / siz) / 2) * siz); 99 while ((mid -= siz) >= lo && (s = *((unsigned char**)mid)) && ((c == MAP(m, *s)) || *s == '[' && c == MAP(m, *(s + 1)))); 120 lo = mid + siz; 122 hi = mid - siz;
|
H A D | stropt.c | 32 * parse option expression in s using options in tab with element size siz 56 stropt(const char* as, const void* tab, int siz, int(*f)(void*, const void*, int, const char*), void* a) argument 91 for (p = (char**)tab; t = *p; p = (char**)((char*)p + siz))
|
/ast/src/lib/libast/path/ |
H A D | pathnative.c | 27 * convert path to native fs representation in <buf,siz> 29 * if return length >= siz then buf is indeterminate, but another call 30 * with siz=length+1 would work 41 pathnative(const char* path, char* buf, size_t siz) argument 43 return uwin_path(path, buf, siz); 53 pathnative(const char* path, char* buf, size_t siz) argument 57 if (!buf || siz < PATH_MAX) 62 if ((n = strlen(tmp)) < siz && buf) 75 pathnative(const char* path, char* buf, size_t siz) argument 80 if (!_fullpath(buf, path, siz)) 98 pathnative(const char* path, char* buf, size_t siz) argument 111 pathnative(const char* path, char* buf, size_t siz) argument [all...] |
H A D | pathposix.c | 27 * convert native path to posix fs representation in <buf,siz> 29 * if return length >= siz then buf is indeterminate, but another call 30 * with siz=length+1 would work 41 pathposix(const char* path, char* buf, size_t siz) argument 43 return uwin_unpath(path, buf, siz); 53 pathposix(const char* path, char* buf, size_t siz) argument 57 if (!buf || siz < PATH_MAX) 62 if ((n = strlen(tmp)) < siz && buf) 75 pathposix(const char* path, char* buf, size_t siz) argument 80 if (!_posixpath(buf, path, siz)) 98 pathposix(const char* path, char *buf, size_t siz) argument 113 pathposix(const char* path, char* buf, size_t siz) argument [all...] |
H A D | pathgetlink.c | 42 pathgetlink(const char* name, char* buf, int siz) argument 46 if ((n = readlink(name, buf, siz)) < 0) return(-1); 47 if (n >= siz)
|
/ast/src/lib/libast/astsa/ |
H A D | ast.c | 50 static unsigned long siz; local 54 siz = CHUNK; 55 if (!(buf = newof(0, char, siz, 0))) 61 e = s + siz; 66 siz += CHUNK; 67 if (!(buf = newof(buf, char, siz, 0))) 69 s = buf + (siz - CHUNK); 70 e = s + siz;
|
/ast/src/cmd/3d/ |
H A D | peek.c | 29 * peek siz chars from fd into buf 34 peek(int fd, void* buf, size_t siz) argument 38 n = cspeek(&cs, fd, buf, siz); 42 if (!FSTAT(fd, &state.path.st) && state.path.st.st_size <= siz) 44 while ((n = read(fd, buf, siz)) != state.path.st.st_size && lseek(fd, 0L, 1) > 0 && lseek(fd, 0L, 0) == 0);
|
H A D | lib.c | 49 * keep 3d tables from buf,siz in state.table.fd 55 keep(const char* buf, size_t siz, int force) argument 59 if (force && state.in_2d || siz > sizeof(state.table.buf)) 69 if (peek(state.table.fd, tmp, sizeof(tmp) - 1) == siz && !memcmp(tmp, buf, siz)) 106 n = WRITE(fds[1], buf, siz) == siz; 110 state.table.size = siz; 128 if (WRITE(state.table.fd, buf, siz) == siz [all...] |
/ast/src/lib/libpz/ |
H A D | pzfixed.c | 59 Sfoff_t siz; local 63 siz = pz && (pz->flags & PZ_POP) ? (Sfoff_t)0 : sfsize(io); 71 (*trace)(pz, pz->disc, -2, "pzfixed: siz=%I*d buf=%p z=%I*u", sizeof(siz), siz, buf, sizeof(z), z); 79 if (siz > 0 && siz % n) 115 if ((siz <= 0 || !(siz % i)) && xp->rep[i] > xp->rep[n]) 133 if (m <= 1 && n <= 2 && siz > [all...] |
/ast/src/lib/libast/comp/ |
H A D | readlink.c | 41 readlink(const char* path, char* buf, int siz) 46 if (siz > sizeof(FAKELINK_MAGIC)) 50 if (read(fd, buf, sizeof(FAKELINK_MAGIC)) == sizeof(FAKELINK_MAGIC) && !strcmp(buf, FAKELINK_MAGIC) && (n = read(fd, buf, siz)) > 0 && !buf[n - 1])
|
/ast/src/lib/libast/disc/ |
H A D | sfstrtmp.c | 48 sfstrtmp(register Sfio_t* f, int mode, void* buf, size_t siz) 57 f->_endw = f->_endr = f->_endb = f->_data + siz; 58 f->_size = siz;
|
/ast/src/lib/libast/dir/ |
H A D | getdents.c | 52 getdents(int fd, void* buf, size_t siz) 56 if (siz < DIRBLKSIZ) 74 return(getdirentries(fd, buf, siz, &off)); 86 m = (siz * 6) / 10; 88 sp = (char*)buf + siz - m - 1; 94 while (sp < (char*)buf + siz - m + n) 116 return(read(fd, buf, siz)); 135 n = (siz / MAXREC) * sizeof(struct direct); 139 if ((n = read(fd, (char*)buf + siz - m, m)) <= 0) break; 140 sp = (struct direct*)((char*)buf + siz [all...] |
/ast/src/lib/libcs/ |
H A D | csfrom.c | 31 csfrom(register Cs_t* state, int fd, void* buf, size_t siz, Csaddr_t* addr) argument 50 if ((n = read(fd, buf, siz)) < 0) messagef((state->id, NiL, -1, "from: %d: udp data read error", fd)); 51 else messagef((state->id, NiL, -8, "from(%d,*,%d) = %d, data = `%-.*s', addr = %s, port = %u", fd, siz, n, n, buf, csntoa(state, udp.host), udp.port)); 63 if ((n = recvfrom(fd, buf, siz, 0, (struct sockaddr*)&nam, &len)) < 0) 73 messagef((state->id, NiL, -8, "from(%d,*,%d) = %d, data = `%-.*s', addr = %s, port = %u", fd, siz, n, n, buf, csntoa(state, (unsigned long)nam.sin_addr.s_addr), (unsigned long)nam.sin_port)); 89 _cs_from(int fd, void* buf, size_t siz, Csaddr_t* addr) argument 91 return csfrom(&cs, fd, buf, siz, addr);
|
H A D | cspeek.c | 33 * peek up to siz chars from fd into buf 41 cspeek(register Cs_t* state, int fd, void* buf, size_t siz) argument 65 pk.databuf.maxlen = siz; 81 if ((n = recv(fd, (char*)buf, siz, MSG_PEEK)) >= 0) 95 _cs_peek(int fd, void* buf, size_t siz) argument 97 return cspeek(&cs, fd, buf, siz);
|
H A D | csto.c | 31 csto(register Cs_t* state, int fd, const void* buf, size_t siz, Csaddr_t* addr) argument 45 return cswrite(state, fd, buf, siz); 57 return sendto(fd, buf, siz, 0, (struct sockaddr*)&nam, sizeof(nam)); 72 _cs_to(int fd, const void* buf, size_t siz, Csaddr_t* addr) argument 74 return csto(&cs, fd, buf, siz, addr);
|
H A D | msgread.c | 31 * read a message from fd into buf,siz 33 * siz must be > MSG_SIZE_SIZE 37 msgread(int fd, char* buf, size_t siz) argument 50 if (n <= MSG_SIZE_SIZE || n > siz || csread(&cs, fd, buf + o, n - o, CS_EXACT) != n - o) return -1;
|
/ast/src/cmd/tests/sfio/ |
H A D | ttmp.c | 48 ssize_t siz; local 60 if((siz = sfwrite(f,buf,TEST_BUFSIZE)) != TEST_BUFSIZE) 61 terror("sfwrite failed with siz=%ld",siz); 68 if ((siz = sfputr(f, Rec, 0)) != sizeof(Rec)) 70 sizeof(siz), siz, sizeof(Rec)); 71 if ((nxt = sfseek(f, (Sfoff_t)0, SEEK_CUR)) != (pos + siz)) 73 sizeof(siz), siz, sizeo [all...] |
/ast/src/lib/libvcodex/Vcdelta/ |
H A D | vcdtblinit.c | 46 static void vcdtblmake(Vcdtable_t* tbl, Vcdsize_t* siz, Vcdindex_t* idx) argument 48 static void vcdtblmake(tbl, siz, idx) 50 Vcdsize_t* siz; 68 for(s = 0; s <= siz->add; ++s) 85 for(s = 0, maxs = siz->copy[m]; s <= maxs; s = s == 0 ? COPYMIN : s+1) 99 for(s = 1, maxs = siz->add1[m]; s <= maxs; ++s) 100 for(t = COPYMIN, maxt = siz->copy2[m]; t <= maxt; ++t) 114 for(s = COPYMIN, maxs = siz->copy1[m]; s <= maxs; ++s) 115 for(t = 1, maxt = siz->add2[m]; t <= maxt; ++t)
|
H A D | vcdelta.c | 49 Vcdsize_t* siz = vcd->size; local 52 cd = idx->add[az <= siz->add ? az : 0]; 89 Vcdsize_t* siz = vcd->size; local 92 cd = idx->copy[md][cz <= siz->copy[md] ? cz : 0]; 114 Vcdsize_t* siz = vcd->size; local 125 { if(cz <= 0 || sav->dtsz > siz->add1[md] || cz > siz->copy2[md]) 160 Vcdsize_t* siz = vcd->size; local 168 if(sav->dtsz <= siz->copy1[sav->mode] && az <= siz [all...] |
/ast/src/cmd/mailx/ |
H A D | local.c | 719 * size siz where the first member of each 730 strpsearch(const void* tab, size_t num, size_t siz, const char* name, char** next) argument 733 register char* hi = lo + (num - 1) * siz; 743 mid = lo + (sequential ? 0 : (((hi - lo) / siz) / 2) * siz); 762 while ((mid -= siz) >= lo && (c == *(s = *((unsigned char**)mid)) || *s == '[' && c == *(s + 1))); 781 lo = mid + siz; 783 hi = mid - siz; 794 * size siz where the first member of each 801 strsearch(const void* tab, size_t num, size_t siz, Compare_ argument [all...] |
/ast/src/cmd/INIT/ |
H A D | release.c | 114 string(register char* s, char* tab, int num, int siz, char** e) argument 122 for (i = 0; i < siz; i++) 124 for (i = 0; i < num; i += siz) 125 for (j = 0; j < siz && buf[j] == tab[j+i]; j++) 126 if (j == (siz - 1)) 128 *e = s + siz; 129 return i / siz + 1;
|
/ast/src/cmd/pzip/ |
H A D | pin.c | 478 merge(unsigned char* t, unsigned char* s, int i, Part_t* pp, register Part_t* np, size_t** siz, size_t row, size_t tot) argument 492 x = siz[i][i] + pp->size; 825 size_t** siz; local 828 siz = matrix(row); 868 siz[ii][jj] = z; 874 cp->size = siz[ii][jj]; 904 siz[i][i] = field(buf, dat, i, i, row, tot); 907 sfprintf(sp, "p %d %d %I*u\n", state.map[i], state.map[i], sizeof(siz[i][i]), siz[i][i]); 927 if (z < (siz[ [all...] |
/ast/src/lib/libsum/ |
H A D | sumlib.c | 308 sumblock(Sum_t* p, const void* buf, size_t siz) argument 310 p->size += siz; 311 return (*p->method->block)(p, buf, siz);
|