| /haiku-fatelf/src/bin/network/atftpd/ |
| H A D | argz.c | 62 size_t nlen = strlen (string) + 1; local
64 if (nlen > 1)
69 *argz = (char *) malloc (nlen);
81 --nlen;
87 if (nlen == 0)
94 *len = nlen;
|
| /haiku-fatelf/src/documentation/docbook-xsl/extensions/saxon643/com/nwalsh/saxon/ |
| H A D | Text.java | 168 int nlen = 0;
176 nchars[nlen] = '\n';
177 nlen++;
182 nchars[nlen] = '\n';
183 nlen++;
190 nchars[nlen] = chars[i];
191 nlen++;
193 out.writeContent(nchars, 0, nlen);
|
| /haiku-fatelf/src/documentation/docbook-xsl/extensions/xalan27/src/com/nwalsh/xalan/ |
| H A D | Text.java | 127 int nlen = 0;
135 nchars[nlen] = '\n';
136 nlen++;
141 nchars[nlen] = '\n';
142 nlen++;
149 nchars[nlen] = chars[i];
150 nlen++;
153 text += String.valueOf(nchars, 0, nlen);
|
| /haiku-fatelf/headers/libs/agg/ |
| H A D | agg_span_gouraud_rgba.h | 166 int nlen = abs(pc2->m_x - pc1->m_x);
167 if(nlen <= 0) nlen = 1;
169 dda_line_interpolator<14> r(pc1->m_r, pc2->m_r, nlen);
170 dda_line_interpolator<14> g(pc1->m_g, pc2->m_g, nlen);
171 dda_line_interpolator<14> b(pc1->m_b, pc2->m_b, nlen);
172 dda_line_interpolator<14> a(pc1->m_a, pc2->m_a, nlen);
184 nlen += start;
213 nlen -= subpixel_scale;
222 // overflow. But while "nlen" i
[all...] |
| H A D | agg_span_gouraud_gray.h | 154 int nlen = abs(pc2->m_x - pc1->m_x);
155 if(nlen <= 0) nlen = 1;
157 dda_line_interpolator<14> v(pc1->m_v, pc2->m_v, nlen);
158 dda_line_interpolator<14> a(pc1->m_a, pc2->m_a, nlen);
168 nlen += start;
189 nlen -= subpixel_scale;
198 // overflow. But while "nlen" is positive we are safe.
200 while(len && nlen > 0)
206 nlen
[all...] |
| /haiku-fatelf/src/documentation/docbook-xsl/extensions/xalan2/com/nwalsh/xalan/ |
| H A D | Text.java | 131 int nlen = 0;
139 nchars[nlen] = '\n';
140 nlen++;
145 nchars[nlen] = '\n';
146 nlen++;
153 nchars[nlen] = chars[i];
154 nlen++;
157 text += String.valueOf(nchars, 0, nlen);
|
| /haiku-fatelf/src/libs/zlib/ |
| H A D | inflate.h | 112 unsigned nlen; /* number of length code lengths */ member in struct:inflate_state
|
| H A D | infback.c | 352 state->nlen = BITS(5) + 257;
359 if (state->nlen > 286 || state->ndist > 30) {
390 while (state->have < state->nlen + state->ndist) {
428 if (state->have + copy > state->nlen + state->ndist) {
454 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
463 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
|
| H A D | inflate.c | 883 state->nlen = BITS(5) + 257;
890 if (state->nlen > 286 || state->ndist > 30) {
921 while (state->have < state->nlen + state->ndist) {
959 if (state->have + copy > state->nlen + state->ndist) {
985 ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
994 ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
|
| /haiku-fatelf/src/libs/util/ |
| H A D | login_class.c | 132 substvar(const char * var, const struct passwd * pwd, int hlen, int pch, int nlen) argument
150 np = malloc(strlen(var) + (dollas * nlen)
176 memmove(p + nlen, p + 1, l); /* Subst username */
177 memmove(p, pwd->pw_name, nlen);
178 p += nlen;
194 int nlen = pwd ? strlen(pwd->pw_name) : 0; local
204 char * np = substvar(var, pwd, hlen, pch, nlen);
230 if ((np = substvar(p, pwd, hlen, pch, nlen)) != NULL) {
|
| /haiku-fatelf/src/bin/network/tcpdump/ |
| H A D | addrtoname.c | 350 * with length 'nlen'
354 lookup_bytestring(register const u_char *bs, const unsigned int nlen) argument
359 if (nlen >= 6) {
363 } else if (nlen >= 4) {
375 memcmp((const char *)bs, (const char *)(tp->e_bs), nlen) == 0)
384 tp->e_bs = (u_char *) calloc(1, nlen + 1);
385 memcpy(tp->e_bs, bs, nlen);
399 unsigned int nlen = *nsap; local
401 const u_char *ensap = nsap + nlen - 6;
403 if (nlen >
[all...] |
| /haiku-fatelf/src/bin/bash/ |
| H A D | general.c | 691 int nlen, ndirs; local
695 if (name == 0 || (nlen = strlen (name)) == 0)
697 nend = name + nlen;
734 nlen = ntail - nbeg;
735 if (nlen <= 3)
742 nlen = nend - ntail;
743 memcpy (nbeg, ntail, nlen);
744 nbeg[nlen] = '\0';
|
| H A D | bashline.c | 2520 int nlen; local
2522 for (nlen = strlen (name), p = fignore.ignores; p->val; p++)
2524 if (nlen > p->len && p->len > 0 && STREQ (p->val, &name[nlen - p->len]))
|
| /haiku-fatelf/src/bin/findutils/lib/ |
| H A D | buildcmd.c | 310 size_t nlen = strlen (needle); local
315 while (hlen >= nlen)
317 if (memcmp (haystack, needle, nlen) == 0)
|
| /haiku-fatelf/src/bin/network/wget/src/ |
| H A D | mswindows.c | 603 WRAP (getsockname, (int s, struct sockaddr *n, int *nlen), (s, n, nlen))
604 WRAP (getpeername, (int s, struct sockaddr *n, int *nlen), (s, n, nlen))
|
| /haiku-fatelf/src/add-ons/input_server/methods/canna/rk/ |
| H A D | bun.c | 446 RkwStoreYomi(int cx_num, WCHAR_T *yomi, int nlen) argument
461 if (!yomi || nlen < 0 || uslen(yomi) < nlen) {
465 nmax = store->nyomi + (diff = nlen - (olen = bun->nb_curlen));
468 if (nlen > olen) {
481 } else if (nlen < olen) { /* chizimu */
483 d = store->yomi + bun->nb_yoff + nlen;
493 if (!nlen) {
502 usncopy((store->yomi + bun->nb_yoff), yomi, (unsigned)nlen);
|
| H A D | tempdic.c | 44 static TN *defineTD(struct DM *dm, struct TD *tab, int n, struct TW *newTW, int nlen);
165 * nlen ��������
169 defineTD(struct DM *dm, struct TD *tab, int n, struct TW *newTW, int nlen) argument
212 return defineTD(dm, tn->tn_tree, n, newTW, nlen);
|
| /haiku-fatelf/src/bin/gzip/ |
| H A D | gzip.c | 951 int nlen, slen; local
970 nlen = strlen(name);
971 if (nlen <= MAX_SUFFIX+2) {
974 strcpy(suffix, name+nlen-MAX_SUFFIX-2);
982 return name+nlen-s;
|
| /haiku-fatelf/src/bin/gdb/bfd/ |
| H A D | elf64-hppa.c | 459 size_t nlen, tlen;
467 nlen = strlen (h->root.root.string);
469 nlen = 8 + 1 + sizeof (rel->r_info) * 2 - 8;
470 tlen = nlen + 1 + sizeof (rel->r_addend) * 2 + 1;
486 memcpy (buf, h->root.root.string, nlen);
487 buf[nlen++] = '+';
488 sprintf_vma (buf + nlen, rel->r_addend);
492 nlen = sprintf (buf, "%x:%lx",
497 buf[nlen++] = '+';
498 sprintf_vma (buf + nlen, re
458 size_t nlen, tlen; local
[all...] |
| /haiku-fatelf/src/bin/gawk/ |
| H A D | awkgram.y | 2596 size_t nlen;
2611 if (f1->nlen > f2->nlen)
2612 minlen = f2->nlen;
2614 minlen = f1->nlen;
2652 tab[j].nlen = p->hlength;
2664 pp_func(tab[i].name, tab[i].nlen, tab[i].func);
2692 tab[j].nlen = p->hlength;
|
| H A D | awkgram.c | 4435 size_t nlen;
4450 if (f1->nlen > f2->nlen)
4451 minlen = f2->nlen;
4453 minlen = f1->nlen;
4491 tab[j].nlen = p->hlength;
4503 pp_func(tab[i].name, tab[i].nlen, tab[i].func);
4531 tab[j].nlen = p->hlength;
4431 size_t nlen; member in struct:finfo
|
| /haiku-fatelf/src/bin/network/tcpdump/libpcap/ |
| H A D | gencode.c | 5038 register int nlen, mlen; local
5041 nlen = __pcap_atoin(s1, &n);
5043 n <<= 32 - nlen;
|