n 135 examples/VFS/skel_opaque.c static ssize_t skel_read(vfs_handle_struct *handle, files_struct *fsp, void *data, size_t n)
n 137 examples/VFS/skel_opaque.c return vfswrap_read(NULL, fsp, data, n);
n 140 examples/VFS/skel_opaque.c static ssize_t skel_pread(vfs_handle_struct *handle, struct files_struct *fsp, void *data, size_t n, SMB_OFF_T offset)
n 142 examples/VFS/skel_opaque.c return vfswrap_pread(NULL, fsp, data, n, offset);
n 145 examples/VFS/skel_opaque.c static ssize_t skel_write(vfs_handle_struct *handle, files_struct *fsp, const void *data, size_t n)
n 147 examples/VFS/skel_opaque.c return vfswrap_write(NULL, fsp, data, n);
n 150 examples/VFS/skel_opaque.c ssize_t skel_pwrite(vfs_handle_struct *handle, struct files_struct *fsp, const void *data, size_t n, SMB_OFF_T offset)
n 152 examples/VFS/skel_opaque.c return vfswrap_pwrite(NULL, fsp, data, n, offset);
n 161 examples/VFS/skel_opaque.c SMB_OFF_T offset, size_t n)
n 163 examples/VFS/skel_opaque.c return vfswrap_sendfile(NULL, tofd, fromfsp, hdr, offset, n);
n 166 examples/VFS/skel_opaque.c static ssize_t skel_recvfile(vfs_handle_struct *handle, int fromfd, files_struct *tofsp, SMB_OFF_T offset, size_t n)
n 168 examples/VFS/skel_opaque.c return vfswrap_recvfile(NULL, fromfd, tofsp, offset, n);
n 573 examples/VFS/skel_opaque.c static int skel_aio_suspend(struct vfs_handle_struct *handle, struct files_struct *fsp, const SMB_STRUCT_AIOCB * const aiocb[], int n, const struct timespec *ts)
n 575 examples/VFS/skel_opaque.c return vfswrap_aio_suspend(NULL, fsp, aiocb, n, ts);
n 129 examples/VFS/skel_transparent.c static ssize_t skel_read(vfs_handle_struct *handle, files_struct *fsp, void *data, size_t n)
n 131 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_READ(handle, fsp, data, n);
n 134 examples/VFS/skel_transparent.c static ssize_t skel_pread(vfs_handle_struct *handle, files_struct *fsp, void *data, size_t n, SMB_OFF_T offset)
n 136 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_PREAD(handle, fsp, data, n, offset);
n 139 examples/VFS/skel_transparent.c static ssize_t skel_write(vfs_handle_struct *handle, files_struct *fsp, const void *data, size_t n)
n 141 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_WRITE(handle, fsp, data, n);
n 144 examples/VFS/skel_transparent.c static ssize_t skel_pwrite(vfs_handle_struct *handle, files_struct *fsp, const void *data, size_t n, SMB_OFF_T offset)
n 146 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, offset);
n 154 examples/VFS/skel_transparent.c static ssize_t skel_sendfile(vfs_handle_struct *handle, int tofd, files_struct *fromfsp, const DATA_BLOB *hdr, SMB_OFF_T offset, size_t n)
n 156 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_SENDFILE(handle, tofd, fromfsp, hdr, offset, n);
n 159 examples/VFS/skel_transparent.c static ssize_t skel_recvfile(vfs_handle_struct *handle, int fromfd, files_struct *tofsp, SMB_OFF_T offset, size_t n)
n 161 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_RECVFILE(handle, fromfd, tofsp, offset, n);
n 533 examples/VFS/skel_transparent.c static int skel_aio_suspend(struct vfs_handle_struct *handle, struct files_struct *fsp, const SMB_STRUCT_AIOCB * const aiocb[], int n, const struct timespec *ts)
n 535 examples/VFS/skel_transparent.c return SMB_VFS_NEXT_AIO_SUSPEND(handle, fsp, aiocb, n, ts);
n 50 examples/libsmbclient/smbwrapper/bsd-strlcat.c size_t n = siz;
n 54 examples/libsmbclient/smbwrapper/bsd-strlcat.c while (n-- != 0 && *d != '\0')
n 57 examples/libsmbclient/smbwrapper/bsd-strlcat.c n = siz - dlen;
n 59 examples/libsmbclient/smbwrapper/bsd-strlcat.c if (n == 0)
n 62 examples/libsmbclient/smbwrapper/bsd-strlcat.c if (n != 1) {
n 64 examples/libsmbclient/smbwrapper/bsd-strlcat.c n--;
n 48 examples/libsmbclient/smbwrapper/bsd-strlcpy.c size_t n = siz;
n 51 examples/libsmbclient/smbwrapper/bsd-strlcpy.c if (n != 0 && --n != 0) {
n 55 examples/libsmbclient/smbwrapper/bsd-strlcpy.c } while (--n != 0);
n 59 examples/libsmbclient/smbwrapper/bsd-strlcpy.c if (n == 0) {
n 448 examples/libsmbclient/smbwrapper/wrapper.c int n;
n 455 examples/libsmbclient/smbwrapper/wrapper.c n = (count / sizeof(struct dirent));
n 457 examples/libsmbclient/smbwrapper/wrapper.c internal_count = sizeof(struct SMBW_dirent) * n;
n 467 examples/libsmbclient/smbwrapper/wrapper.c ret = sizeof(struct dirent) * n;
n 469 examples/libsmbclient/smbwrapper/wrapper.c for (i = 0; i < n; i++)
n 775 examples/libsmbclient/smbwrapper/wrapper.c int n;
n 782 examples/libsmbclient/smbwrapper/wrapper.c n = (count / sizeof(struct dirent64));
n 784 examples/libsmbclient/smbwrapper/wrapper.c internal = malloc(sizeof(struct SMBW_dirent) * n);
n 1645 examples/libsmbclient/smbwrapper/wrapper.c do_select(int n,
n 1650 examples/libsmbclient/smbwrapper/wrapper.c int (* select_fn)(int n,
n 1677 examples/libsmbclient/smbwrapper/wrapper.c ret = (* select_fn)(n, readfds, writefds, exceptfds, timeout);
n 1689 examples/libsmbclient/smbwrapper/wrapper.c select(int n,
n 1697 examples/libsmbclient/smbwrapper/wrapper.c return do_select(n, readfds, writefds, exceptfds,
n 1702 examples/libsmbclient/smbwrapper/wrapper.c _select(int n,
n 1710 examples/libsmbclient/smbwrapper/wrapper.c return do_select(n, readfds, writefds, exceptfds,
n 1715 examples/libsmbclient/smbwrapper/wrapper.c __select(int n,
n 1723 examples/libsmbclient/smbwrapper/wrapper.c return do_select(n, readfds, writefds, exceptfds,
n 193 examples/libsmbclient/smbwrapper/wrapper.h int (* select)(int n,
n 198 examples/libsmbclient/smbwrapper/wrapper.h int (* _select)(int n,
n 203 examples/libsmbclient/smbwrapper/wrapper.h int (* __select)(int n,
n 40 lib/compression/mszip.c uint16_t n; /* literal, length base, or distance base */
n 111 lib/compression/mszip.c #define ZIPNEEDBITS(n) {while(k<(n)){int32_t c=*(ZIP(inpos)++);\
n 113 lib/compression/mszip.c #define ZIPDUMPBITS(n) {b>>=(n);k-=(n);}
n 130 lib/compression/mszip.c uint32_t *b, uint32_t n, uint32_t s, const uint16_t *d, const uint16_t *e,
n 153 lib/compression/mszip.c el = n > 256 ? b[256] : ZIPBMAX; /* set length of EOB code, if any */
n 157 lib/compression/mszip.c p = b; i = n;
n 162 lib/compression/mszip.c if (ZIP(c)[0] == n) /* null input--all zero length codes */
n 204 lib/compression/mszip.c } while (++i < n);
n 271 lib/compression/mszip.c if (p >= ZIP(v) + n)
n 276 lib/compression/mszip.c r.v.n = *p++; /* simple code is just the value */
n 281 lib/compression/mszip.c r.v.n = d[*p++ - s];
n 312 lib/compression/mszip.c uint32_t n, d; /* length and index for copy */
n 345 lib/compression/mszip.c CAB(outbuf)[w++] = (uint8_t)t->v.n;
n 354 lib/compression/mszip.c n = t->v.n + ((uint32_t)b & Zipmask[e]);
n 369 lib/compression/mszip.c d = w - t->v.n - ((uint32_t)b & Zipmask[e]);
n 373 lib/compression/mszip.c n -= (e = (e = ZIPWSIZE - ((d &= ZIPWSIZE-1) > w ? d : w)) > n ?n:e);
n 378 lib/compression/mszip.c } while (n);
n 394 lib/compression/mszip.c uint32_t n; /* number of bytes in block */
n 405 lib/compression/mszip.c n = k & 7;
n 406 lib/compression/mszip.c ZIPDUMPBITS(n);
n 410 lib/compression/mszip.c n = ((uint32_t)b & 0xffff);
n 413 lib/compression/mszip.c if (n != (uint32_t)((~b) & 0xffff))
n 418 lib/compression/mszip.c while(n--)
n 481 lib/compression/mszip.c uint32_t n; /* number of lengths to get */
n 530 lib/compression/mszip.c n = nl + nd;
n 533 lib/compression/mszip.c while((uint32_t)i < n)
n 538 lib/compression/mszip.c j = td->v.n;
n 546 lib/compression/mszip.c if((uint32_t)i + j > n)
n 556 lib/compression/mszip.c if ((uint32_t)i + j > n)
n 567 lib/compression/mszip.c if ((uint32_t)i + j > n)
n 130 lib/crypto/md4.c _PUBLIC_ void mdfour(uint8_t *out, const uint8_t *in, int n)
n 134 lib/crypto/md4.c uint32_t b = n * 8;
n 143 lib/crypto/md4.c while (n > 64) {
n 147 lib/crypto/md4.c n -= 64;
n 152 lib/crypto/md4.c memcpy(buf, in, n);
n 153 lib/crypto/md4.c buf[n] = 0x80;
n 155 lib/crypto/md4.c if (n <= 55) {
n 1 lib/crypto/md4.h void mdfour(uint8_t *out, const uint8_t *in, int n);
n 47 lib/crypto/sha256.c #define ROTR(x,n) (((x)>>(n)) | ((x) << (32 - (n))))
n 164 lib/crypto/sha256.c cshift (uint32_t x, unsigned int n)
n 167 lib/crypto/sha256.c return CRAYFIX((x << n) | (x >> (32 - n)));
n 85 lib/replace/getifaddrs.c int fd, i, n;
n 106 lib/replace/getifaddrs.c n = ifc.ifc_len / sizeof(struct ifreq);
n 109 lib/replace/getifaddrs.c for (i=n-1; i>=0; i--) {
n 162 lib/replace/getifaddrs.c int fd, i, n;
n 183 lib/replace/getifaddrs.c n = strioctl.ic_len / sizeof(struct ifreq);
n 188 lib/replace/getifaddrs.c if (n*sizeof(struct ifreq) + sizeof(int) == strioctl.ic_len) {
n 196 lib/replace/getifaddrs.c for (i = 0; i<n; i++) {
n 199 lib/replace/inet_pton.c const int n = tp - colonp;
n 202 lib/replace/inet_pton.c for (i = 1; i <= n; i++) {
n 203 lib/replace/inet_pton.c endp[- i] = colonp[n - i];
n 204 lib/replace/inet_pton.c colonp[n - i] = 0;
n 114 lib/replace/replace.c int n;
n 121 lib/replace/replace.c n = t->tm_year + 1900 - 1;
n 123 lib/replace/replace.c ((n / 4 - n / 100 + n / 400) - (1969 / 4 - 1969 / 100 + 1969 / 400)) * DAY;
n 343 lib/replace/replace.c char *rep_strndup(const char *s, size_t n)
n 347 lib/replace/replace.c n = strnlen(s, n);
n 348 lib/replace/replace.c ret = malloc(n+1);
n 351 lib/replace/replace.c memcpy(ret, s, n);
n 352 lib/replace/replace.c ret[n] = 0;
n 176 lib/replace/replace.h char *rep_strndup(const char *s, size_t n);
n 182 lib/replace/replace.h size_t rep_strnlen(const char *s, size_t n);
n 73 lib/replace/strptime.c #define get_number(from, to, n) \
n 75 lib/replace/strptime.c int __n = n; \
n 89 lib/replace/strptime.c # define get_alt_number(from, to, n) \
n 95 lib/replace/strptime.c int __n = n; \
n 130 lib/replace/strptime.c get_number (from, to, n); \
n 135 lib/replace/strptime.c # define get_alt_number(from, to, n) \
n 137 lib/replace/strptime.c get_number(from, to, n)
n 162 lib/replace/strptime.c # define strncasecmp(s1, s2, n) __strncasecmp (s1, s2, n)
n 113 lib/replace/test/os2_delete.c int n = os2_delete(d);
n 114 lib/replace/test/os2_delete.c if (n == 0) break;
n 115 lib/replace/test/os2_delete.c total_deleted += n;
n 1380 lib/talloc/talloc.c char *talloc_strndup(const void *t, const char *p, size_t n)
n 1383 lib/talloc/talloc.c return __talloc_strlendup(t, p, strnlen(p, n));
n 1445 lib/talloc/talloc.c char *talloc_strndup_append(char *s, const char *a, size_t n)
n 1455 lib/talloc/talloc.c return __talloc_strlendup_append(s, strlen(s), a, strnlen(a, n));
n 1462 lib/talloc/talloc.c char *talloc_strndup_append_buffer(char *s, const char *a, size_t n)
n 1479 lib/talloc/talloc.c return __talloc_strlendup_append(s, slen, a, strnlen(a, n));
n 176 lib/talloc/talloc.h char *talloc_strndup(const void *t, const char *p, size_t n);
n 177 lib/talloc/talloc.h char *talloc_strndup_append(char *s, const char *a, size_t n);
n 178 lib/talloc/talloc.h char *talloc_strndup_append_buffer(char *s, const char *a, size_t n);
n 265 lib/tdb/common/io.c size_t n = addition>sizeof(buf)?sizeof(buf):addition;
n 266 lib/tdb/common/io.c ssize_t written = pwrite(tdb->fd, buf, n, size);
n 269 lib/tdb/common/io.c written = pwrite(tdb->fd, buf, n, size);
n 279 lib/tdb/common/io.c "%d bytes failed (%s)\n", (int)n,
n 282 lib/tdb/common/io.c } else if (written != n) {
n 285 lib/tdb/common/io.c (int)n));
n 150 lib/tdb/tools/tdbtool.c int n;
n 152 lib/tdb/tools/tdbtool.c n = 16 - (i%16);
n 154 lib/tdb/tools/tdbtool.c if (n>8) printf(" ");
n 155 lib/tdb/tools/tdbtool.c while (n--) printf(" ");
n 157 lib/tdb/tools/tdbtool.c n = i%16;
n 158 lib/tdb/tools/tdbtool.c if (n > 8) n = 8;
n 159 lib/tdb/tools/tdbtool.c print_asc(&buf[i-(i%16)],n); printf(" ");
n 160 lib/tdb/tools/tdbtool.c n = (i%16) - n;
n 161 lib/tdb/tools/tdbtool.c if (n>0) print_asc(&buf[i-n],n);
n 48 lib/tevent/tevent_signal.c #define SIG_SEEN(s, n) (s).seen += (n)
n 448 lib/util/asn1.c int n = b & 0x7f;
n 452 lib/util/asn1.c while (n > 1) {
n 456 lib/util/asn1.c n--;
n 112 lib/util/charset/charset.h int strncasecmp_m(const char *s1, const char *s2, size_t n);
n 120 lib/util/charset/charset.h char *strupper_talloc_n(TALLOC_CTX *ctx, const char *src, size_t n);
n 461 lib/util/charset/iconv.c int n;
n 463 lib/util/charset/iconv.c n = MIN(*inbytesleft, *outbytesleft);
n 465 lib/util/charset/iconv.c swab(*inbuf, *outbuf, (n&~1));
n 466 lib/util/charset/iconv.c if (n&1) {
n 467 lib/util/charset/iconv.c (*outbuf)[n-1] = 0;
n 470 lib/util/charset/iconv.c (*inbytesleft) -= n;
n 471 lib/util/charset/iconv.c (*outbytesleft) -= n;
n 472 lib/util/charset/iconv.c (*inbuf) += n;
n 473 lib/util/charset/iconv.c (*outbuf) += n;
n 487 lib/util/charset/iconv.c int n;
n 489 lib/util/charset/iconv.c n = MIN(*inbytesleft, *outbytesleft);
n 491 lib/util/charset/iconv.c memmove(*outbuf, *inbuf, n);
n 493 lib/util/charset/iconv.c (*inbytesleft) -= n;
n 494 lib/util/charset/iconv.c (*outbytesleft) -= n;
n 495 lib/util/charset/iconv.c (*inbuf) += n;
n 496 lib/util/charset/iconv.c (*outbuf) += n;
n 121 lib/util/charset/util_unistr.c _PUBLIC_ int strncasecmp_m(const char *s1, const char *s2, size_t n)
n 132 lib/util/charset/util_unistr.c while (*s1 && *s2 && n) {
n 133 lib/util/charset/util_unistr.c n--;
n 156 lib/util/charset/util_unistr.c if (n == 0) {
n 469 lib/util/charset/util_unistr.c _PUBLIC_ char *strupper_talloc_n(TALLOC_CTX *ctx, const char *src, size_t n)
n 481 lib/util/charset/util_unistr.c dest = talloc_array(ctx, char, 2*(n+1));
n 486 lib/util/charset/util_unistr.c while (*src && n--) {
n 198 lib/util/debug.c _PUBLIC_ const char *do_debug_tab(int n)
n 203 lib/util/debug.c return tabs[MIN(n, 10)];
n 75 lib/util/debug.h #define DEBUGTAB(n) do_debug_tab(n)
n 108 lib/util/debug.h _PUBLIC_ const char *do_debug_tab(int n);
n 138 lib/util/genrand.c int fd, n;
n 146 lib/util/genrand.c while ((n = read(fd, (char *)buf, sizeof(buf))) > 0) {
n 147 lib/util/genrand.c mdfour(tmp_md4, buf, n);
n 148 lib/util/genrand.c for (n=0;n<16;n++)
n 149 lib/util/genrand.c the_hash[n] ^= tmp_md4[n];
n 79 lib/util/idtree.c static int find_next_bit(uint32_t bm, int maxid, int n)
n 81 lib/util/idtree.c while (n<maxid && !test_bit(n, bm)) n++;
n 82 lib/util/idtree.c return n;
n 105 lib/util/idtree.c int n, m, sh;
n 122 lib/util/idtree.c n = (id >> (IDR_BITS*l)) & IDR_MASK;
n 124 lib/util/idtree.c m = find_next_bit(bm, IDR_SIZE, n);
n 146 lib/util/idtree.c if (m != n) {
n 148 lib/util/idtree.c id = ((id >> sh) ^ n ^ m) << sh;
n 179 lib/util/idtree.c n = id;
n 183 lib/util/idtree.c n = n >> IDR_BITS;
n 184 lib/util/idtree.c set_bit((n & IDR_MASK), p->bitmap);
n 245 lib/util/idtree.c int n;
n 251 lib/util/idtree.c n = (id >> shift) & IDR_MASK;
n 252 lib/util/idtree.c clear_bit(n, p->bitmap);
n 253 lib/util/idtree.c *++paa = &p->ary[n];
n 254 lib/util/idtree.c p = p->ary[n];
n 257 lib/util/idtree.c n = id & IDR_MASK;
n 258 lib/util/idtree.c if (p != NULL && test_bit(n, p->bitmap)) {
n 259 lib/util/idtree.c clear_bit(n, p->bitmap);
n 260 lib/util/idtree.c p->ary[n] = NULL;
n 274 lib/util/idtree.c int n;
n 277 lib/util/idtree.c n = idp->layers * IDR_BITS;
n 283 lib/util/idtree.c if ((id & ~(~0 << MAX_ID_SHIFT)) >> (n + IDR_BITS))
n 289 lib/util/idtree.c while (n >= IDR_BITS && p) {
n 290 lib/util/idtree.c n -= IDR_BITS;
n 291 lib/util/idtree.c p = p->ary[(id >> n) & IDR_MASK];
n 60 lib/util/ms_fnmatch.c static int ms_fnmatch_core(const char *p, const char *n,
n 73 lib/util/ms_fnmatch.c if (max_n->predot && max_n->predot <= n) {
n 76 lib/util/ms_fnmatch.c for (i=0; n[i]; i += size_n) {
n 77 lib/util/ms_fnmatch.c next_codepoint(n+i, &size_n);
n 78 lib/util/ms_fnmatch.c if (ms_fnmatch_core(p, n+i, max_n+1, ldot) == 0) {
n 82 lib/util/ms_fnmatch.c if (!max_n->predot || max_n->predot > n) max_n->predot = n;
n 89 lib/util/ms_fnmatch.c if (max_n->predot && max_n->predot <= n) {
n 92 lib/util/ms_fnmatch.c if (max_n->postdot && max_n->postdot <= n && n <= ldot) {
n 95 lib/util/ms_fnmatch.c for (i=0; n[i]; i += size_n) {
n 96 lib/util/ms_fnmatch.c next_codepoint(n+i, &size_n);
n 97 lib/util/ms_fnmatch.c if (ms_fnmatch_core(p, n+i, max_n+1, ldot) == 0) return 0;
n 98 lib/util/ms_fnmatch.c if (n+i == ldot) {
n 99 lib/util/ms_fnmatch.c if (ms_fnmatch_core(p, n+i+size_n, max_n+1, ldot) == 0) return 0;
n 100 lib/util/ms_fnmatch.c if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n;
n 104 lib/util/ms_fnmatch.c if (!max_n->predot || max_n->predot > n) max_n->predot = n;
n 109 lib/util/ms_fnmatch.c if (! *n) {
n 112 lib/util/ms_fnmatch.c next_codepoint(n, &size_n);
n 113 lib/util/ms_fnmatch.c n += size_n;
n 119 lib/util/ms_fnmatch.c if (n[0] == '.') {
n 120 lib/util/ms_fnmatch.c if (! n[1] && null_match(p) == 0) {
n 125 lib/util/ms_fnmatch.c if (! *n) return null_match(p);
n 126 lib/util/ms_fnmatch.c next_codepoint(n, &size_n);
n 127 lib/util/ms_fnmatch.c n += size_n;
n 132 lib/util/ms_fnmatch.c if (*n == 0 && null_match(p) == 0) {
n 135 lib/util/ms_fnmatch.c if (*n != '.') return -1;
n 136 lib/util/ms_fnmatch.c next_codepoint(n, &size_n);
n 137 lib/util/ms_fnmatch.c n += size_n;
n 141 lib/util/ms_fnmatch.c c2 = next_codepoint(n, &size_n);
n 145 lib/util/ms_fnmatch.c n += size_n;
n 150 lib/util/ms_fnmatch.c if (! *n) {
n 318 lib/util/rbtree.c struct rb_node *n;
n 320 lib/util/rbtree.c n = root->rb_node;
n 321 lib/util/rbtree.c if (!n)
n 323 lib/util/rbtree.c while (n->rb_left)
n 324 lib/util/rbtree.c n = n->rb_left;
n 325 lib/util/rbtree.c return n;
n 330 lib/util/rbtree.c struct rb_node *n;
n 332 lib/util/rbtree.c n = root->rb_node;
n 333 lib/util/rbtree.c if (!n)
n 335 lib/util/rbtree.c while (n->rb_right)
n 336 lib/util/rbtree.c n = n->rb_right;
n 337 lib/util/rbtree.c return n;
n 32 lib/util/tests/idtree.c int n = torture_numops;
n 37 lib/util/tests/idtree.c ids = talloc_zero_array(mem_ctx, int, n);
n 38 lib/util/tests/idtree.c present = talloc_zero_array(mem_ctx, int, n);
n 40 lib/util/tests/idtree.c for (i=0;i<n;i++) {
n 44 lib/util/tests/idtree.c for (i=0;i<n;i++) {
n 45 lib/util/tests/idtree.c int ii = random() % n;
n 71 lib/util/tests/idtree.c ids[ii] = idr_get_new(idr, &ids[ii], n);
n 85 lib/util/tests/idtree.c for (i=0;i<n;i++) {
n 345 lib/util/util.c int n;
n 346 lib/util/util.c n = 16 - (i%16);
n 348 lib/util/util.c if (n>8) DEBUGADD(level,(" "));
n 349 lib/util/util.c while (n--) DEBUGADD(level,(" "));
n 350 lib/util/util.c n = MIN(8,i%16);
n 351 lib/util/util.c print_asc(level,&buf[i-(i%16)],n); DEBUGADD(level,( " " ));
n 352 lib/util/util.c n = (i%16) - n;
n 353 lib/util/util.c if (n>0) print_asc(level,&buf[i-n],n);
n 441 lib/util/util.c char *smb_xstrndup(const char *s, size_t n)
n 454 lib/util/util.c char *s1 = strndup(s, n);
n 459 lib/util/util.c #define strndup(s,n) __ERROR_DONT_USE_STRNDUP_DIRECTLY
n 757 lib/util/util.c _PUBLIC_ size_t ascii_len_n(const char *src, size_t n)
n 761 lib/util/util.c len = strnlen(src, n);
n 762 lib/util/util.c if (len+1 <= n) {
n 811 lib/util/util.c _PUBLIC_ size_t utf16_len_n(const void *src, size_t n)
n 815 lib/util/util.c for (len = 0; (len+2 < n) && SVAL(src, len); len += 2) ;
n 817 lib/util/util.c if (len+2 <= n) {
n 327 lib/util/util.h _PUBLIC_ size_t ascii_len_n(const char *src, size_t n);
n 372 lib/util/util.h _PUBLIC_ size_t utf16_len_n(const void *src, size_t n);
n 636 lib/util/util.h char *smb_xstrndup(const char *s, size_t n);
n 127 lib/util/util_ldb.c char *wrap_casefold(void *context, void *mem_ctx, const char *s, size_t n)
n 129 lib/util/util_ldb.c return strupper_talloc_n(mem_ctx, s, n);
n 27 lib/util/util_ldb.h char *wrap_casefold(void *context, void *mem_ctx, const char *s, size_t n);
n 173 lib/util/xfile.c size_t n = f->bufsize - f->bufused;
n 174 lib/util/xfile.c n = MIN(n, (size*nmemb)-total);
n 176 lib/util/xfile.c if (n == 0) {
n 182 lib/util/xfile.c memcpy(f->buf + f->bufused, total+(const char *)p, n);
n 183 lib/util/xfile.c f->bufused += n;
n 184 lib/util/xfile.c total += n;
n 298 lib/util/xfile.c int n;
n 304 lib/util/xfile.c n = read(f->fd, f->buf, f->bufsize);
n 305 lib/util/xfile.c if (n <= 0) return;
n 306 lib/util/xfile.c f->bufused = n;
n 62 lib/zlib/adler32.c unsigned n;
n 98 lib/zlib/adler32.c n = NMAX / 16; /* NMAX is divisible by 16 */
n 102 lib/zlib/adler32.c } while (--n);
n 185 lib/zlib/contrib/blast/blast.c local int construct(struct huffman *h, const unsigned char *rep, int n)
n 202 lib/zlib/contrib/blast/blast.c } while (--n);
n 203 lib/zlib/contrib/blast/blast.c n = symbol;
n 208 lib/zlib/contrib/blast/blast.c for (symbol = 0; symbol < n; symbol++)
n 210 lib/zlib/contrib/blast/blast.c if (h->count[0] == n) /* no codes! */
n 230 lib/zlib/contrib/blast/blast.c for (symbol = 0; symbol < n; symbol++)
n 430 lib/zlib/contrib/blast/blast.c int ret, n;
n 437 lib/zlib/contrib/blast/blast.c n = 0;
n 438 lib/zlib/contrib/blast/blast.c while (getchar() != EOF) n++;
n 439 lib/zlib/contrib/blast/blast.c if (n) fprintf(stderr, "blast warning: %d unused bytes of input\n", n);
n 150 lib/zlib/contrib/infback9/infback9.c #define NEEDBITS(n) \
n 152 lib/zlib/contrib/infback9/infback9.c while (bits < (unsigned)(n)) \
n 157 lib/zlib/contrib/infback9/infback9.c #define BITS(n) \
n 158 lib/zlib/contrib/infback9/infback9.c ((unsigned)hold & ((1U << (n)) - 1))
n 161 lib/zlib/contrib/infback9/infback9.c #define DROPBITS(n) \
n 163 lib/zlib/contrib/infback9/infback9.c hold >>= (n); \
n 164 lib/zlib/contrib/infback9/infback9.c bits -= (unsigned)(n); \
n 220 lib/zlib/contrib/iostream/zfstream.cpp int n;
n 224 lib/zlib/contrib/iostream/zfstream.cpp n = pptr() - q;
n 226 lib/zlib/contrib/iostream/zfstream.cpp if ( gzwrite( file, q, n) < n )
n 267 lib/zlib/contrib/iostream3/zfstream.cc std::streamsize n)
n 276 lib/zlib/contrib/iostream3/zfstream.cc if (!p || !n)
n 290 lib/zlib/contrib/iostream3/zfstream.cc buffer_size = n;
n 137 lib/zlib/contrib/iostream3/zfstream.h std::streamsize n);
n 98 lib/zlib/contrib/minizip/crypt.h int n; /* index in random header */
n 116 lib/zlib/contrib/minizip/crypt.h for (n = 0; n < RAND_HEAD_LEN-2; n++)
n 119 lib/zlib/contrib/minizip/crypt.h header[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, c, t);
n 123 lib/zlib/contrib/minizip/crypt.h for (n = 0; n < RAND_HEAD_LEN-2; n++)
n 125 lib/zlib/contrib/minizip/crypt.h buf[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, header[n], t);
n 127 lib/zlib/contrib/minizip/crypt.h buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 16) & 0xff, t);
n 128 lib/zlib/contrib/minizip/crypt.h buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 24) & 0xff, t);
n 129 lib/zlib/contrib/minizip/crypt.h return n;
n 18 lib/zlib/contrib/minizip/mztools.c #define WRITE_8(buff, n) do { \
n 19 lib/zlib/contrib/minizip/mztools.c *((unsigned char*)(buff)) = (unsigned char) ((n) & 0xff); \
n 21 lib/zlib/contrib/minizip/mztools.c #define WRITE_16(buff, n) do { \
n 22 lib/zlib/contrib/minizip/mztools.c WRITE_8((unsigned char*)(buff), n); \
n 23 lib/zlib/contrib/minizip/mztools.c WRITE_8(((unsigned char*)(buff)) + 1, (n) >> 8); \
n 25 lib/zlib/contrib/minizip/mztools.c #define WRITE_32(buff, n) do { \
n 26 lib/zlib/contrib/minizip/mztools.c WRITE_16((unsigned char*)(buff), (n) & 0xffff); \
n 27 lib/zlib/contrib/minizip/mztools.c WRITE_16((unsigned char*)(buff) + 2, (n) >> 16); \
n 273 lib/zlib/contrib/minizip/zip.c int n;
n 274 lib/zlib/contrib/minizip/zip.c for (n = 0; n < nbByte; n++)
n 276 lib/zlib/contrib/minizip/zip.c buf[n] = (unsigned char)(x & 0xff);
n 281 lib/zlib/contrib/minizip/zip.c for (n = 0; n < nbByte; n++)
n 283 lib/zlib/contrib/minizip/zip.c buf[n] = 0xff;
n 300 lib/zlib/contrib/minizip/zip.c int n;
n 301 lib/zlib/contrib/minizip/zip.c for (n = 0; n < nbByte; n++) {
n 302 lib/zlib/contrib/minizip/zip.c buf[n] = (unsigned char)(x & 0xff);
n 308 lib/zlib/contrib/minizip/zip.c for (n = 0; n < nbByte; n++)
n 310 lib/zlib/contrib/minizip/zip.c buf[n] = 0xff;
n 319 lib/zlib/contrib/puff/puff.c local int construct(struct huffman *h, short *length, int n)
n 329 lib/zlib/contrib/puff/puff.c for (symbol = 0; symbol < n; symbol++)
n 331 lib/zlib/contrib/puff/puff.c if (h->count[0] == n) /* no codes! */
n 351 lib/zlib/contrib/puff/puff.c for (symbol = 0; symbol < n; symbol++)
n 109 lib/zlib/crc32.c int n, k;
n 123 lib/zlib/crc32.c for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)
n 124 lib/zlib/crc32.c poly |= 1UL << (31 - p[n]);
n 127 lib/zlib/crc32.c for (n = 0; n < 256; n++) {
n 128 lib/zlib/crc32.c c = (unsigned long)n;
n 131 lib/zlib/crc32.c crc_table[0][n] = c;
n 137 lib/zlib/crc32.c for (n = 0; n < 256; n++) {
n 138 lib/zlib/crc32.c c = crc_table[0][n];
n 139 lib/zlib/crc32.c crc_table[4][n] = REV(c);
n 142 lib/zlib/crc32.c crc_table[k][n] = c;
n 143 lib/zlib/crc32.c crc_table[k + 4][n] = REV(c);
n 187 lib/zlib/crc32.c int n;
n 189 lib/zlib/crc32.c for (n = 0; n < 256; n++)
n 190 lib/zlib/crc32.c fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : " ", table[n],
n 191 lib/zlib/crc32.c n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));
n 363 lib/zlib/crc32.c int n;
n 365 lib/zlib/crc32.c for (n = 0; n < GF2_DIM; n++)
n 366 lib/zlib/crc32.c square[n] = gf2_matrix_times(mat, mat[n]);
n 375 lib/zlib/crc32.c int n;
n 387 lib/zlib/crc32.c for (n = 1; n < GF2_DIM; n++) {
n 388 lib/zlib/crc32.c odd[n] = row;
n 319 lib/zlib/deflate.c uInt n;
n 346 lib/zlib/deflate.c for (n = 0; n <= length - MIN_MATCH; n++) {
n 347 lib/zlib/deflate.c INSERT_STRING(s, n, hash_head);
n 1269 lib/zlib/deflate.c register unsigned n, m;
n 1307 lib/zlib/deflate.c n = s->hash_size;
n 1308 lib/zlib/deflate.c p = &s->head[n];
n 1312 lib/zlib/deflate.c } while (--n);
n 1314 lib/zlib/deflate.c n = wsize;
n 1316 lib/zlib/deflate.c p = &s->prev[n];
n 1323 lib/zlib/deflate.c } while (--n);
n 1342 lib/zlib/deflate.c n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
n 1343 lib/zlib/deflate.c s->lookahead += n;
n 200 lib/zlib/examples/gzappend.c local void skip(file *in, unsigned n)
n 204 lib/zlib/examples/gzappend.c if (n > in->left) {
n 205 lib/zlib/examples/gzappend.c n -= in->left;
n 206 lib/zlib/examples/gzappend.c bypass = n & ~((1U << in->size) - 1);
n 210 lib/zlib/examples/gzappend.c n -= bypass;
n 213 lib/zlib/examples/gzappend.c if (n > in->left)
n 216 lib/zlib/examples/gzappend.c in->left -= n;
n 217 lib/zlib/examples/gzappend.c in->next += n;
n 236 lib/zlib/examples/gzappend.c unsigned n;
n 244 lib/zlib/examples/gzappend.c n = read1(in);
n 245 lib/zlib/examples/gzappend.c n += (unsigned)(read1(in)) << 8;
n 246 lib/zlib/examples/gzappend.c skip(in, n);
n 73 lib/zlib/examples/gzlog.c int n;
n 77 lib/zlib/examples/gzlog.c for (n = 8; n < 32; n += 8)
n 78 lib/zlib/examples/gzlog.c val += (unsigned long)(*buf++) << n;
n 85 lib/zlib/examples/gzlog.c int n;
n 89 lib/zlib/examples/gzlog.c for (n = 8; n < 64; n += 8)
n 90 lib/zlib/examples/gzlog.c val += (off_t)(*buf++) << n;
n 97 lib/zlib/examples/gzlog.c int n;
n 99 lib/zlib/examples/gzlog.c for (n = 0; n < 4; n++) {
n 108 lib/zlib/examples/gzlog.c int n;
n 110 lib/zlib/examples/gzlog.c for (n = 0; n < 8; n++) {
n 427 lib/zlib/gzio.c uInt n = s->stream.avail_in;
n 428 lib/zlib/gzio.c if (n > s->stream.avail_out) n = s->stream.avail_out;
n 429 lib/zlib/gzio.c if (n > 0) {
n 430 lib/zlib/gzio.c zmemcpy(s->stream.next_out, s->stream.next_in, n);
n 431 lib/zlib/gzio.c next_out += n;
n 433 lib/zlib/gzio.c s->stream.next_in += n;
n 434 lib/zlib/gzio.c s->stream.avail_out -= n;
n 435 lib/zlib/gzio.c s->stream.avail_in -= n;
n 922 lib/zlib/gzio.c int n;
n 923 lib/zlib/gzio.c for (n = 0; n < 4; n++) {
n 174 lib/zlib/infback.c #define NEEDBITS(n) \
n 176 lib/zlib/infback.c while (bits < (unsigned)(n)) \
n 181 lib/zlib/infback.c #define BITS(n) \
n 182 lib/zlib/infback.c ((unsigned)hold & ((1U << (n)) - 1))
n 185 lib/zlib/infback.c #define DROPBITS(n) \
n 187 lib/zlib/infback.c hold >>= (n); \
n 188 lib/zlib/infback.c bits -= (unsigned)(n); \
n 443 lib/zlib/inflate.c #define NEEDBITS(n) \
n 445 lib/zlib/inflate.c while (bits < (unsigned)(n)) \
n 450 lib/zlib/inflate.c #define BITS(n) \
n 451 lib/zlib/inflate.c ((unsigned)hold & ((1U << (n)) - 1))
n 454 lib/zlib/inflate.c #define DROPBITS(n) \
n 456 lib/zlib/inflate.c hold >>= (n); \
n 457 lib/zlib/inflate.c bits -= (unsigned)(n); \
n 242 lib/zlib/trees.c int n; /* iterates over tree elements */
n 263 lib/zlib/trees.c for (n = 0; n < (1<<extra_lbits[code]); n++) {
n 278 lib/zlib/trees.c for (n = 0; n < (1<<extra_dbits[code]); n++) {
n 286 lib/zlib/trees.c for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
n 294 lib/zlib/trees.c n = 0;
n 295 lib/zlib/trees.c while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
n 296 lib/zlib/trees.c while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
n 297 lib/zlib/trees.c while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
n 298 lib/zlib/trees.c while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
n 306 lib/zlib/trees.c for (n = 0; n < D_CODES; n++) {
n 307 lib/zlib/trees.c static_dtree[n].Len = 5;
n 308 lib/zlib/trees.c static_dtree[n].Code = bi_reverse((unsigned)n, 5);
n 414 lib/zlib/trees.c int n; /* iterates over tree elements */
n 417 lib/zlib/trees.c for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
n 418 lib/zlib/trees.c for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
n 419 lib/zlib/trees.c for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
n 445 lib/zlib/trees.c #define smaller(tree, n, m, depth) \
n 446 lib/zlib/trees.c (tree[n].Freq < tree[m].Freq || \
n 447 lib/zlib/trees.c (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
n 501 lib/zlib/trees.c int n, m; /* iterate over the tree elements */
n 515 lib/zlib/trees.c n = s->heap[h];
n 516 lib/zlib/trees.c bits = tree[tree[n].Dad].Len + 1;
n 518 lib/zlib/trees.c tree[n].Len = (ush)bits;
n 521 lib/zlib/trees.c if (n > max_code) continue; /* not a leaf node */
n 525 lib/zlib/trees.c if (n >= base) xbits = extra[n-base];
n 526 lib/zlib/trees.c f = tree[n].Freq;
n 528 lib/zlib/trees.c if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
n 554 lib/zlib/trees.c n = s->bl_count[bits];
n 555 lib/zlib/trees.c while (n != 0) {
n 564 lib/zlib/trees.c n--;
n 585 lib/zlib/trees.c int n; /* code index */
n 600 lib/zlib/trees.c for (n = 0; n <= max_code; n++) {
n 601 lib/zlib/trees.c int len = tree[n].Len;
n 604 lib/zlib/trees.c tree[n].Code = bi_reverse(next_code[len]++, len);
n 607 lib/zlib/trees.c n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
n 626 lib/zlib/trees.c int n, m; /* iterate over heap elements */
n 636 lib/zlib/trees.c for (n = 0; n < elems; n++) {
n 637 lib/zlib/trees.c if (tree[n].Freq != 0) {
n 638 lib/zlib/trees.c s->heap[++(s->heap_len)] = max_code = n;
n 639 lib/zlib/trees.c s->depth[n] = 0;
n 641 lib/zlib/trees.c tree[n].Len = 0;
n 662 lib/zlib/trees.c for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
n 669 lib/zlib/trees.c pqremove(s, tree, n); /* n = node of least frequency */
n 672 lib/zlib/trees.c s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
n 676 lib/zlib/trees.c tree[node].Freq = tree[n].Freq + tree[m].Freq;
n 677 lib/zlib/trees.c s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
n 678 lib/zlib/trees.c s->depth[n] : s->depth[m]) + 1);
n 679 lib/zlib/trees.c tree[n].Dad = tree[m].Dad = (ush)node;
n 683 lib/zlib/trees.c node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
n 712 lib/zlib/trees.c int n; /* iterates over all tree elements */
n 723 lib/zlib/trees.c for (n = 0; n <= max_code; n++) {
n 724 lib/zlib/trees.c curlen = nextlen; nextlen = tree[n+1].Len;
n 757 lib/zlib/trees.c int n; /* iterates over all tree elements */
n 768 lib/zlib/trees.c for (n = 0; n <= max_code; n++) {
n 769 lib/zlib/trees.c curlen = nextlen; nextlen = tree[n+1].Len;
n 1129 lib/zlib/trees.c int n;
n 1131 lib/zlib/trees.c for (n = 0; n < 9; n++)
n 1132 lib/zlib/trees.c if (s->dyn_ltree[n].Freq != 0)
n 1134 lib/zlib/trees.c if (n == 9)
n 1135 lib/zlib/trees.c for (n = 14; n < 32; n++)
n 1136 lib/zlib/trees.c if (s->dyn_ltree[n].Freq != 0)
n 1138 lib/zlib/trees.c s->strm->data_type = (n == 32) ? Z_TEXT : Z_BINARY;
n 242 lib/zlib/zutil.c int n;
n 248 lib/zlib/zutil.c for (n = 0; n < next_ptr; n++) {
n 249 lib/zlib/zutil.c if (ptr != table[n].new_ptr) continue;
n 251 lib/zlib/zutil.c farfree(table[n].org_ptr);
n 252 lib/zlib/zutil.c while (++n < next_ptr) {
n 253 lib/zlib/zutil.c table[n-1] = table[n];
n 299 libcli/nbt/libnbt.h void nbt_choose_called_name(TALLOC_CTX *mem_ctx, struct nbt_name *n, const char *name, int type);
n 419 libcli/nbt/nbtname.c struct nbt_name *n, const char *name, int type)
n 421 libcli/nbt/nbtname.c n->scope = NULL;
n 422 libcli/nbt/nbtname.c n->type = type;
n 425 libcli/nbt/nbtname.c n->name = "*SMBSERVER";
n 432 libcli/nbt/nbtname.c n->name = "*SMBSERVER";
n 436 libcli/nbt/nbtname.c n->name = talloc_strdup_upper(mem_ctx, s);
n 440 libcli/nbt/nbtname.c n->name = talloc_strdup_upper(mem_ctx, name);
n 363 librpc/gen_ndr/drsblobs.h union ExtendedErrorComputerNameU n;/* [switch_is(present)] */
n 3078 librpc/gen_ndr/ndr_drsblobs.c NDR_CHECK(ndr_push_set_switch_value(ndr, &r->n, r->present));
n 3079 librpc/gen_ndr/ndr_drsblobs.c NDR_CHECK(ndr_push_ExtendedErrorComputerNameU(ndr, NDR_SCALARS, &r->n));
n 3082 librpc/gen_ndr/ndr_drsblobs.c NDR_CHECK(ndr_push_ExtendedErrorComputerNameU(ndr, NDR_BUFFERS, &r->n));
n 3092 librpc/gen_ndr/ndr_drsblobs.c NDR_CHECK(ndr_pull_set_switch_value(ndr, &r->n, r->present));
n 3093 librpc/gen_ndr/ndr_drsblobs.c NDR_CHECK(ndr_pull_ExtendedErrorComputerNameU(ndr, NDR_SCALARS, &r->n));
n 3096 librpc/gen_ndr/ndr_drsblobs.c NDR_CHECK(ndr_pull_ExtendedErrorComputerNameU(ndr, NDR_BUFFERS, &r->n));
n 3106 librpc/gen_ndr/ndr_drsblobs.c ndr_print_set_switch_value(ndr, &r->n, r->present);
n 3107 librpc/gen_ndr/ndr_drsblobs.c ndr_print_ExtendedErrorComputerNameU(ndr, "n", &r->n);
n 216 librpc/ndr/libndr.h #define NDR_PULL_NEED_BYTES(ndr, n) do { \
n 217 librpc/ndr/libndr.h if ((n) > ndr->data_size || ndr->offset + (n) > ndr->data_size) { \
n 218 librpc/ndr/libndr.h return ndr_pull_error(ndr, NDR_ERR_BUFSIZE, "Pull bytes %u", (unsigned)n); \
n 222 librpc/ndr/libndr.h #define NDR_ALIGN(ndr, n) ndr_align_size(ndr->offset, n)
n 224 librpc/ndr/libndr.h #define NDR_ROUND(size, n) (((size)+((n)-1)) & ~((n)-1))
n 226 librpc/ndr/libndr.h #define NDR_PULL_ALIGN(ndr, n) do { \
n 229 librpc/ndr/libndr.h ndr_check_padding(ndr, n); \
n 231 librpc/ndr/libndr.h ndr->offset = (ndr->offset + (n-1)) & ~(n-1); \
n 234 librpc/ndr/libndr.h return ndr_pull_error(ndr, NDR_ERR_BUFSIZE, "Pull align %u", (unsigned)n); \
n 238 librpc/ndr/libndr.h #define NDR_PUSH_NEED_BYTES(ndr, n) NDR_CHECK(ndr_push_expand(ndr, n))
n 240 librpc/ndr/libndr.h #define NDR_PUSH_ALIGN(ndr, n) do { \
n 242 librpc/ndr/libndr.h uint32_t _pad = ((ndr->offset + (n-1)) & ~(n-1)) - ndr->offset; \
n 283 librpc/ndr/libndr.h #define NDR_PULL_ALLOC_N(ndr, s, n) do { \
n 285 librpc/ndr/libndr.h (s) = talloc_array_ptrtype(ndr->current_mem_ctx, (s), n); \
n 286 librpc/ndr/libndr.h if (!(s)) return ndr_pull_error(ndr, NDR_ERR_ALLOC, "Alloc %u * %s failed: %s\n", (unsigned)n, # s, __location__); \
n 379 librpc/ndr/libndr.h size_t ndr_align_size(uint32_t offset, size_t n);
n 479 librpc/ndr/libndr.h void ndr_check_padding(struct ndr_pull *ndr, size_t n);
n 482 librpc/ndr/libndr.h enum ndr_err_code ndr_pull_bytes(struct ndr_pull *ndr, uint8_t *data, uint32_t n);
n 483 librpc/ndr/libndr.h enum ndr_err_code ndr_pull_array_uint8(struct ndr_pull *ndr, int ndr_flags, uint8_t *data, uint32_t n);
n 486 librpc/ndr/libndr.h enum ndr_err_code ndr_push_bytes(struct ndr_push *ndr, const uint8_t *data, uint32_t n);
n 487 librpc/ndr/libndr.h enum ndr_err_code ndr_push_zero(struct ndr_push *ndr, uint32_t n);
n 488 librpc/ndr/libndr.h enum ndr_err_code ndr_push_array_uint8(struct ndr_push *ndr, int ndr_flags, const uint8_t *data, uint32_t n);
n 52 librpc/ndr/ndr.c _PUBLIC_ size_t ndr_align_size(uint32_t offset, size_t n)
n 54 librpc/ndr/ndr.c if ((offset & (n-1)) == 0) return 0;
n 55 librpc/ndr/ndr.c return n - (offset & (n-1));
n 39 librpc/ndr/ndr_basic.c _PUBLIC_ void ndr_check_padding(struct ndr_pull *ndr, size_t n)
n 41 librpc/ndr/ndr_basic.c size_t ofs2 = (ndr->offset + (n-1)) & ~(n-1);
n 49 librpc/ndr/ndr_basic.c DEBUG(0,("WARNING: Non-zero padding to %d: ", (int)n));
n 259 librpc/ndr/ndr_basic.c _PUBLIC_ enum ndr_err_code ndr_pull_bytes(struct ndr_pull *ndr, uint8_t *data, uint32_t n)
n 261 librpc/ndr/ndr_basic.c NDR_PULL_NEED_BYTES(ndr, n);
n 262 librpc/ndr/ndr_basic.c memcpy(data, ndr->data + ndr->offset, n);
n 263 librpc/ndr/ndr_basic.c ndr->offset += n;
n 270 librpc/ndr/ndr_basic.c _PUBLIC_ enum ndr_err_code ndr_pull_array_uint8(struct ndr_pull *ndr, int ndr_flags, uint8_t *data, uint32_t n)
n 275 librpc/ndr/ndr_basic.c return ndr_pull_bytes(ndr, data, n);
n 419 librpc/ndr/ndr_basic.c _PUBLIC_ enum ndr_err_code ndr_push_bytes(struct ndr_push *ndr, const uint8_t *data, uint32_t n)
n 421 librpc/ndr/ndr_basic.c NDR_PUSH_NEED_BYTES(ndr, n);
n 422 librpc/ndr/ndr_basic.c memcpy(ndr->data + ndr->offset, data, n);
n 423 librpc/ndr/ndr_basic.c ndr->offset += n;
n 430 librpc/ndr/ndr_basic.c _PUBLIC_ enum ndr_err_code ndr_push_zero(struct ndr_push *ndr, uint32_t n)
n 432 librpc/ndr/ndr_basic.c NDR_PUSH_NEED_BYTES(ndr, n);
n 433 librpc/ndr/ndr_basic.c memset(ndr->data + ndr->offset, 0, n);
n 434 librpc/ndr/ndr_basic.c ndr->offset += n;
n 441 librpc/ndr/ndr_basic.c _PUBLIC_ enum ndr_err_code ndr_push_array_uint8(struct ndr_push *ndr, int ndr_flags, const uint8_t *data, uint32_t n)
n 446 librpc/ndr/ndr_basic.c return ndr_push_bytes(ndr, data, n);
n 473 nsswitch/libwbclient/wbc_sid.c char *n = strchr(s, '\n');
n 474 nsswitch/libwbclient/wbc_sid.c if (n) {
n 475 nsswitch/libwbclient/wbc_sid.c *n = '\0';
n 603 nsswitch/libwbclient/wbc_sid.c char *n = strchr(s, '\n');
n 604 nsswitch/libwbclient/wbc_sid.c if (n) {
n 605 nsswitch/libwbclient/wbc_sid.c *n = '\0';
n 762 nsswitch/winbind_nss_aix.c int n;
n 790 nsswitch/winbind_nss_aix.c n = sizeof(attr_list) / sizeof(struct attr_types);
n 791 nsswitch/winbind_nss_aix.c size = (n*sizeof(attrlist_t *));
n 800 nsswitch/winbind_nss_aix.c offset = (attrlist_t *)(ret + n);
n 805 nsswitch/winbind_nss_aix.c for ( i=0; i<n; i++ ) {
n 819 nsswitch/winbind_nss_aix.c ret[n] = NULL;
n 26 nsswitch/winbind_nss_irix.c #define PRINTF_ATTRIBUTE(m, n)
n 531 source3/auth/pass_check.c int n;
n 533 source3/auth/pass_check.c for (n = 1; n <= N; n++)
n 534 source3/auth/pass_check.c if (!NT_STATUS_EQUAL(nt_status = string_combinations2(s, 0, fn, n), NT_STATUS_WRONG_PASSWORD))
n 132 source3/client/cifs.upcall.c int i, n;
n 135 source3/client/cifs.upcall.c n = scandir(dirname, &namelist, krb5cc_filter, NULL);
n 136 source3/client/cifs.upcall.c if (n < 0) {
n 142 source3/client/cifs.upcall.c for (i = 0; i < n; i++) {
n 169 source3/client/client.c static int writefile(int f, char *b, int n)
n 174 source3/client/client.c return write(f,b,n);
n 178 source3/client/client.c while (i < n) {
n 179 source3/client/client.c if (*b == '\r' && (i<(n-1)) && *(b+1) == '\n') {
n 197 source3/client/client.c static int readfile(uint8_t *b, int n, XFILE *f)
n 203 source3/client/client.c return x_fread(b,1,n,f);
n 206 source3/client/client.c while (i < (n - 1) && (i < BUFFER_SIZE)) {
n 226 source3/client/client.c static size_t push_source(uint8_t *buf, size_t n, void *priv)
n 235 source3/client/client.c result = readfile(buf, n, state->f);
n 990 source3/client/client.c static NTSTATUS writefile_sink(char *buf, size_t n, void *priv)
n 993 source3/client/client.c if (writefile(*pfd, buf, n) == -1) {
n 121 source3/client/clitar.c static int dotarbuf(int f, char *b, int n);
n 122 source3/client/clitar.c static void dozerobuf(int f, int n);
n 319 source3/client/clitar.c static int dotarbuf(int f, char *b, int n)
n 321 source3/client/clitar.c int fail=1, writ=n;
n 327 source3/client/clitar.c if (tp + n >= tbufsiz) {
n 333 source3/client/clitar.c n-=diff;
n 337 source3/client/clitar.c while (n >= tbufsiz) {
n 339 source3/client/clitar.c n-=tbufsiz;
n 344 source3/client/clitar.c if (n>0) {
n 345 source3/client/clitar.c memcpy(tarbuf+tp, b, n);
n 346 source3/client/clitar.c tp+=n;
n 356 source3/client/clitar.c static void dozerobuf(int f, int n)
n 365 source3/client/clitar.c if (n+tp >= tbufsiz) {
n 371 source3/client/clitar.c memset(tarbuf, 0, (tp+=n-tbufsiz));
n 373 source3/client/clitar.c memset(tarbuf+tp, 0, n);
n 374 source3/client/clitar.c tp+=n;
n 69 source3/include/memcache.h void memcache_add(struct memcache *cache, enum memcache_number n,
n 83 source3/include/memcache.h void memcache_add_talloc(struct memcache *cache, enum memcache_number n,
n 90 source3/include/memcache.h void memcache_delete(struct memcache *cache, enum memcache_number n,
n 98 source3/include/memcache.h bool memcache_lookup(struct memcache *cache, enum memcache_number n,
n 106 source3/include/memcache.h void *memcache_lookup_talloc(struct memcache *cache, enum memcache_number n,
n 113 source3/include/memcache.h void memcache_flush(struct memcache *cache, enum memcache_number n);
n 332 source3/include/proto.h struct bitmap *bitmap_allocate(int n);
n 334 source3/include/proto.h struct bitmap *bitmap_talloc(TALLOC_CTX *mem_ctx, int n);
n 543 source3/include/proto.h struct interface *get_interface(int n);
n 544 source3/include/proto.h const struct sockaddr_storage *iface_n_sockaddr_storage(int n);
n 545 source3/include/proto.h const struct in_addr *iface_n_ip_v4(int n);
n 546 source3/include/proto.h const struct in_addr *iface_n_bcast_v4(int n);
n 547 source3/include/proto.h const struct sockaddr_storage *iface_n_bcast(int n);
n 974 source3/include/proto.h int sys_aio_suspend(const SMB_STRUCT_AIOCB * const cblist[], int n, const struct timespec *timeout);
n 981 source3/include/proto.h int sys_aio_suspend(const SMB_STRUCT_AIOCB * const cblist[], int n, const struct timespec *timeout);
n 1442 source3/include/proto.h bool strnequal(const char *s1,const char *s2,size_t n);
n 1469 source3/include/proto.h char *StrnCpy_fn(const char *fn, int line,char *dest,const char *src,size_t n);
n 1507 source3/include/proto.h char *strnrchr_m(const char *s, char c, unsigned int n);
n 1575 source3/include/proto.h smb_ucs2_t *strnrchr_w(const smb_ucs2_t *s, smb_ucs2_t c, unsigned int n);
n 1585 source3/include/proto.h bool strnequal_w(const smb_ucs2_t *s1,const smb_ucs2_t *s2,size_t n);
n 2763 source3/include/proto.h NTSTATUS (*sink)(char *buf, size_t n,
n 2769 source3/include/proto.h NTSTATUS (*sink)(char *buf, size_t n, void *priv),
n 2790 source3/include/proto.h size_t (*source)(uint8_t *buf, size_t n,
n 2796 source3/include/proto.h size_t (*source)(uint8_t *buf, size_t n, void *priv),
n 3056 source3/include/proto.h char *nmb_namestr(const struct nmb_name *n);
n 3064 source3/include/proto.h void make_nmb_name( struct nmb_name *n, const char *name, int type);
n 3074 source3/include/proto.h void sort_query_replies(char *data, int n, struct in_addr ip);
n 6370 source3/include/proto.h ssize_t read_file(files_struct *fsp,char *data,SMB_OFF_T pos,size_t n);
n 6377 source3/include/proto.h size_t n);
n 7140 source3/include/proto.h SMB_OFF_T vfs_transfer_file(files_struct *in, files_struct *out, SMB_OFF_T n);
n 7159 source3/include/proto.h void nbio_shmem(int n);
n 165 source3/include/safe_string.h #define StrnCpy(dest,src,n) \
n 167 source3/include/safe_string.h dest,src,n)
n 940 source3/include/smb.h unsigned int n;
n 41 source3/include/smb_macros.h #define SMB_ASSERT_ARRAY(a,n) SMB_ASSERT((sizeof(a)/sizeof((a)[0])) >= (n))
n 289 source3/include/smb_macros.h #define calloc(n,s) __ERROR_DONT_USE_CALLOC_DIRECTLY
n 294 source3/include/smb_macros.h #define strndup(s,n) __ERROR_DONT_USE_STRNDUP_DIRECTLY
n 305 source3/include/smb_macros.h #define SMB_STRNDUP(s,n) smb_xstrndup(s,n)
n 317 source3/include/smb_macros.h #define SMB_STRNDUP(s,n) strndup(s,n)
n 867 source3/include/smbprofile.h #define DO_PROFILE_ADD(x,n) \
n 869 source3/include/smbprofile.h ADD_PROFILE_COUNT(x,n); \
n 879 source3/include/smbprofile.h #define START_PROFILE_BYTES(x,n) \
n 884 source3/include/smbprofile.h ADD_PROFILE_COUNT(x##_bytes, n); \
n 899 source3/include/smbprofile.h #define DO_PROFILE_ADD(x,n)
n 901 source3/include/smbprofile.h #define START_PROFILE_BYTES(x,n)
n 26 source3/include/transfer_file.h size_t n,
n 30 source3/include/transfer_file.h SMB_OFF_T transfer_file(int infd, int outfd, SMB_OFF_T n);
n 349 source3/include/vfs.h ssize_t (*vfs_read)(struct vfs_handle_struct *handle, struct files_struct *fsp, void *data, size_t n);
n 350 source3/include/vfs.h ssize_t (*pread)(struct vfs_handle_struct *handle, struct files_struct *fsp, void *data, size_t n, SMB_OFF_T offset);
n 351 source3/include/vfs.h ssize_t (*write)(struct vfs_handle_struct *handle, struct files_struct *fsp, const void *data, size_t n);
n 352 source3/include/vfs.h ssize_t (*pwrite)(struct vfs_handle_struct *handle, struct files_struct *fsp, const void *data, size_t n, SMB_OFF_T offset);
n 493 source3/include/vfs.h int (*aio_suspend)(struct vfs_handle_struct *handle, struct files_struct *fsp, const SMB_STRUCT_AIOCB * const aiocb[], int n, const struct timespec *timeout);
n 54 source3/include/vfs_macros.h #define SMB_VFS_READ(fsp, data, n) ((fsp)->conn->vfs.ops.vfs_read((fsp)->conn->vfs.handles.vfs_read, (fsp), (data), (n)))
n 55 source3/include/vfs_macros.h #define SMB_VFS_PREAD(fsp, data, n, off) ((fsp)->conn->vfs.ops.pread((fsp)->conn->vfs.handles.pread, (fsp), (data), (n), (off)))
n 56 source3/include/vfs_macros.h #define SMB_VFS_WRITE(fsp, data, n) ((fsp)->conn->vfs.ops.write((fsp)->conn->vfs.handles.write, (fsp), (data), (n)))
n 57 source3/include/vfs_macros.h #define SMB_VFS_PWRITE(fsp, data, n, off) ((fsp)->conn->vfs.ops.pwrite((fsp)->conn->vfs.handles.pwrite, (fsp), (data), (n), (off)))
n 150 source3/include/vfs_macros.h #define SMB_VFS_AIO_SUSPEND(fsp,aiocb,n,ts) ((fsp)->conn->vfs.ops.aio_suspend((fsp)->conn->vfs.handles.aio_suspend,(fsp),(aiocb),(n),(ts)))
n 188 source3/include/vfs_macros.h #define SMB_VFS_OPAQUE_READ(fsp, data, n) ((fsp)->conn->vfs_opaque.ops.vfs_read((fsp)->conn->vfs_opaque.handles.vfs_read, (fsp), (data), (n)))
n 189 source3/include/vfs_macros.h #define SMB_VFS_OPAQUE_PREAD(fsp, data, n, off) ((fsp)->conn->vfs_opaque.ops.pread((fsp)->conn->vfs_opaque.handles.pread, (fsp), (data), (n), (off)))
n 190 source3/include/vfs_macros.h #define SMB_VFS_OPAQUE_WRITE(fsp, data, n) ((fsp)->conn->vfs_opaque.ops.write((fsp)->conn->vfs_opaque.handles.write, (fsp), (data), (n)))
n 191 source3/include/vfs_macros.h #define SMB_VFS_OPAQUE_PWRITE(fsp, data, n, off) ((fsp)->conn->vfs_opaque.ops.pwrite((fsp)->conn->vfs_opaque.handles.pwrite, (fsp), (data), (n), (off)))
n 284 source3/include/vfs_macros.h #define SMB_VFS_OPAQUE_AIO_SUSPEND(fsp,aiocb,n,ts) ((fsp)->conn->vfs_opaque.ops.aio_suspend((fsp)->conn->vfs_opaque.handles.aio_suspend,(fsp),(aiocb),(n),(ts)))
n 323 source3/include/vfs_macros.h #define SMB_VFS_NEXT_READ(handle, fsp, data, n) ((handle)->vfs_next.ops.vfs_read((handle)->vfs_next.handles.vfs_read, (fsp), (data), (n)))
n 324 source3/include/vfs_macros.h #define SMB_VFS_NEXT_PREAD(handle, fsp, data, n, off) ((handle)->vfs_next.ops.pread((handle)->vfs_next.handles.pread, (fsp), (data), (n), (off)))
n 325 source3/include/vfs_macros.h #define SMB_VFS_NEXT_WRITE(handle, fsp, data, n) ((handle)->vfs_next.ops.write((handle)->vfs_next.handles.write, (fsp), (data), (n)))
n 326 source3/include/vfs_macros.h #define SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, off) ((handle)->vfs_next.ops.pwrite((handle)->vfs_next.handles.pwrite, (fsp), (data), (n), (off)))
n 419 source3/include/vfs_macros.h #define SMB_VFS_NEXT_AIO_SUSPEND(handle,fsp,aiocb,n,ts) ((handle)->vfs_next.ops.aio_suspend((handle)->vfs_next.handles.aio_suspend,(fsp),(aiocb),(n),(ts)))
n 300 source3/iniparser/src/dictionary.c if (d->n>0) {
n 318 source3/iniparser/src/dictionary.c if (d->n==d->size) {
n 340 source3/iniparser/src/dictionary.c d->n ++ ;
n 388 source3/iniparser/src/dictionary.c d->n -- ;
n 456 source3/iniparser/src/dictionary.c if (d->n<1) {
n 505 source3/iniparser/src/dictionary.c if (d->n != 0) {
n 51 source3/iniparser/src/dictionary.h int n ; /** Number of entries in dictionary */
n 107 source3/iniparser/src/iniparser.c char * iniparser_getsecname(dictionary * d, int n)
n 112 source3/iniparser/src/iniparser.c if (d==NULL || n<0) return NULL ;
n 119 source3/iniparser/src/iniparser.c if (foundsec>n)
n 123 source3/iniparser/src/iniparser.c if (foundsec<=n) {
n 76 source3/iniparser/src/iniparser.h char * iniparser_getsecname(dictionary * d, int n);
n 28 source3/lib/bitmap.c struct bitmap *bitmap_allocate(int n)
n 36 source3/lib/bitmap.c bm->n = n;
n 37 source3/lib/bitmap.c bm->b = SMB_MALLOC_ARRAY(uint32, (n+31)/32);
n 43 source3/lib/bitmap.c memset(bm->b, 0, sizeof(uint32)*((n+31)/32));
n 64 source3/lib/bitmap.c struct bitmap *bitmap_talloc(TALLOC_CTX *mem_ctx, int n)
n 74 source3/lib/bitmap.c bm->n = n;
n 75 source3/lib/bitmap.c bm->b = TALLOC_ARRAY(mem_ctx, uint32, (n+31)/32);
n 80 source3/lib/bitmap.c memset(bm->b, 0, sizeof(uint32)*((n+31)/32));
n 91 source3/lib/bitmap.c int count = MIN(dst->n, src->n);
n 104 source3/lib/bitmap.c if (i >= bm->n) {
n 106 source3/lib/bitmap.c i, bm->n));
n 118 source3/lib/bitmap.c if (i >= bm->n) {
n 120 source3/lib/bitmap.c i, bm->n));
n 132 source3/lib/bitmap.c if (i >= bm->n) return False;
n 147 source3/lib/bitmap.c if (ofs > bm->n) ofs = 0;
n 150 source3/lib/bitmap.c while (i < bm->n) {
n 156 source3/lib/bitmap.c } while (j & 31 && j < bm->n);
n 169 source3/lib/bitmap.c } while (j & 31 && j < bm->n);
n 42 source3/lib/dbwrap_file.c uint32 n = 0;
n 45 source3/lib/dbwrap_file.c n = ((n << 5) + n) ^ (uint32)(p[i]);
n 47 source3/lib/dbwrap_file.c return n;
n 211 source3/lib/dbwrap_rbt.c struct rb_node *n;
n 217 source3/lib/dbwrap_rbt.c n = ctx->tree.rb_node;
n 219 source3/lib/dbwrap_rbt.c while (n != NULL) {
n 222 source3/lib/dbwrap_rbt.c r = db_rbt2node(n);
n 229 source3/lib/dbwrap_rbt.c n = n->rb_left;
n 232 source3/lib/dbwrap_rbt.c n = n->rb_right;
n 293 source3/lib/dbwrap_rbt.c struct rb_node *n;
n 299 source3/lib/dbwrap_rbt.c n = ctx->tree.rb_node;
n 301 source3/lib/dbwrap_rbt.c while (n != NULL) {
n 304 source3/lib/dbwrap_rbt.c r = db_rbt2node(n);
n 311 source3/lib/dbwrap_rbt.c n = n->rb_left;
n 314 source3/lib/dbwrap_rbt.c n = n->rb_right;
n 494 source3/lib/iconv.c int n;
n 496 source3/lib/iconv.c n = MIN(*inbytesleft, *outbytesleft);
n 498 source3/lib/iconv.c swab(*inbuf, *outbuf, (n&~1));
n 499 source3/lib/iconv.c if (n&1) {
n 500 source3/lib/iconv.c (*outbuf)[n-1] = 0;
n 503 source3/lib/iconv.c (*inbytesleft) -= n;
n 504 source3/lib/iconv.c (*outbytesleft) -= n;
n 505 source3/lib/iconv.c (*inbuf) += n;
n 506 source3/lib/iconv.c (*outbuf) += n;
n 519 source3/lib/iconv.c int n;
n 521 source3/lib/iconv.c n = MIN(*inbytesleft, *outbytesleft);
n 523 source3/lib/iconv.c memmove(*outbuf, *inbuf, n);
n 525 source3/lib/iconv.c (*inbytesleft) -= n;
n 526 source3/lib/iconv.c (*outbytesleft) -= n;
n 527 source3/lib/iconv.c (*inbuf) += n;
n 528 source3/lib/iconv.c (*outbuf) += n;
n 180 source3/lib/interface.c struct interface *get_interface(int n)
n 184 source3/lib/interface.c for (i=local_interfaces;i && n;i=i->next) {
n 185 source3/lib/interface.c n--;
n 198 source3/lib/interface.c const struct sockaddr_storage *iface_n_sockaddr_storage(int n)
n 202 source3/lib/interface.c for (i=local_interfaces;i && n;i=i->next) {
n 203 source3/lib/interface.c n--;
n 216 source3/lib/interface.c const struct in_addr *iface_n_ip_v4(int n)
n 220 source3/lib/interface.c for (i=local_interfaces;i && n;i=i->next) {
n 221 source3/lib/interface.c n--;
n 234 source3/lib/interface.c const struct in_addr *iface_n_bcast_v4(int n)
n 238 source3/lib/interface.c for (i=local_interfaces;i && n;i=i->next) {
n 239 source3/lib/interface.c n--;
n 252 source3/lib/interface.c const struct sockaddr_storage *iface_n_bcast(int n)
n 256 source3/lib/interface.c for (i=local_interfaces;i && n;i=i->next) {
n 257 source3/lib/interface.c n--;
n 574 source3/lib/interface.c int n;
n 577 source3/lib/interface.c n = get_interfaces(talloc_tos(), &ifaces);
n 579 source3/lib/interface.c if ((n > 0 )&& (n != total_probed ||
n 580 source3/lib/interface.c memcmp(ifaces, probed_ifaces, sizeof(ifaces[0])*n))) {
n 527 source3/lib/ldb/common/ldb.c int n;
n 555 source3/lib/ldb/common/ldb.c for (n = 0; res->refs[n]; n++) /*noop*/ ;
n 557 source3/lib/ldb/common/ldb.c n = 0;
n 560 source3/lib/ldb/common/ldb.c res->refs = talloc_realloc(res, res->refs, char *, n + 2);
n 565 source3/lib/ldb/common/ldb.c res->refs[n] = talloc_move(res->refs, &ares->referral);
n 566 source3/lib/ldb/common/ldb.c res->refs[n + 1] = NULL;
n 247 source3/lib/ldb/common/ldb_attributes.c int i, n;
n 261 source3/lib/ldb/common/ldb_attributes.c for (n=0;c->subclasses[n];n++) /* noop */;
n 263 source3/lib/ldb/common/ldb_attributes.c s = talloc_realloc(ldb->schema.classes, c->subclasses, char *, n+2);
n 270 source3/lib/ldb/common/ldb_attributes.c s[n] = talloc_strdup(s, subclass);
n 271 source3/lib/ldb/common/ldb_attributes.c if (s[n] == NULL) {
n 275 source3/lib/ldb/common/ldb_attributes.c s[n+1] = NULL;
n 735 source3/lib/ldb/common/ldb_dn.c int i, n, e;
n 744 source3/lib/ldb/common/ldb_dn.c n = newdn->comp_num - 1;
n 752 source3/lib/ldb/common/ldb_dn.c newdn->components[n - i] = ldb_dn_copy_component(newdn->components,
n 1003 source3/lib/ldb/common/ldb_dn.c char *n;
n 1010 source3/lib/ldb/common/ldb_dn.c n = talloc_strdup(dn, name);
n 1011 source3/lib/ldb/common/ldb_dn.c if ( ! n) {
n 1023 source3/lib/ldb/common/ldb_dn.c dn->components[num].name = n;
n 111 source3/lib/ldb/common/ldb_ldif.c int bit_offset=0, byte_offset, idx, i, n;
n 115 source3/lib/ldb/common/ldb_ldif.c n=i=0;
n 124 source3/lib/ldb/common/ldb_ldif.c n = byte_offset+1;
n 129 source3/lib/ldb/common/ldb_ldif.c n = byte_offset+2;
n 134 source3/lib/ldb/common/ldb_ldif.c n--;
n 145 source3/lib/ldb/common/ldb_ldif.c d[n] = 0;
n 146 source3/lib/ldb/common/ldb_ldif.c return n;
n 735 source3/lib/ldb/common/ldb_msg.c int n = (el - msg->elements);
n 736 source3/lib/ldb/common/ldb_msg.c if (n != msg->num_elements-1) {
n 737 source3/lib/ldb/common/ldb_msg.c memmove(el, el+1, ((msg->num_elements-1) - n)*sizeof(*el));
n 748 source3/lib/ldb/common/ldb_msg.c int n = (el - msg->elements);
n 749 source3/lib/ldb/common/ldb_msg.c if (n != msg->num_elements-1) {
n 750 source3/lib/ldb/common/ldb_msg.c memmove(el, el+1, ((msg->num_elements-1) - n)*sizeof(*el));
n 74 source3/lib/ldb/ldb_ildap/ldb_ildap.c int n = 0;
n 87 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n] = talloc(mods, struct ldap_mod);
n 88 source3/lib/ldb/ldb_ildap/ldb_ildap.c if (!mods[n]) {
n 91 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n + 1] = NULL;
n 92 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = 0;
n 93 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->attrib = *el;
n 97 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = LDAP_MODIFY_ADD;
n 100 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = LDAP_MODIFY_DELETE;
n 103 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = LDAP_MODIFY_REPLACE;
n 107 source3/lib/ldb/ldb_ildap/ldb_ildap.c n++;
n 110 source3/lib/ldb/ldb_ildap/ldb_ildap.c *num_mods = n;
n 429 source3/lib/ldb/ldb_ildap/ldb_ildap.c int n;
n 474 source3/lib/ldb/ldb_ildap/ldb_ildap.c for (n = 0; req->op.search.attrs && req->op.search.attrs[n]; n++) /* noop */ ;
n 475 source3/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.SearchRequest.num_attributes = n;
n 491 source3/lib/ldb/ldb_ildap/ldb_ildap.c int i,n;
n 513 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods = ildb_msg_to_mods(msg, &n, req->op.add.message, 0);
n 519 source3/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.AddRequest.num_attributes = n;
n 520 source3/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.AddRequest.attributes = talloc_array(msg, struct ldb_message_element, n);
n 526 source3/lib/ldb/ldb_ildap/ldb_ildap.c for (i = 0; i < n; i++) {
n 541 source3/lib/ldb/ldb_ildap/ldb_ildap.c int i,n;
n 563 source3/lib/ldb/ldb_ildap/ldb_ildap.c mods = ildb_msg_to_mods(msg, &n, req->op.mod.message, 1);
n 569 source3/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.ModifyRequest.num_mods = n;
n 570 source3/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.ModifyRequest.mods = talloc_array(msg, struct ldap_mod, n);
n 576 source3/lib/ldb/ldb_ildap/ldb_ildap.c for (i = 0; i < n; i++) {
n 96 source3/lib/ldb/tools/oLschema2ldif.c int n;
n 100 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, " \t$");
n 101 source3/lib/ldb/tools/oLschema2ldif.c s = talloc_strndup(msg, c, n);
n 105 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 119 source3/lib/ldb/tools/oLschema2ldif.c int n;
n 123 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, "\'");
n 124 source3/lib/ldb/tools/oLschema2ldif.c value = talloc_strndup(ctx, c, n);
n 125 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 128 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, " \t\n");
n 129 source3/lib/ldb/tools/oLschema2ldif.c value = talloc_strndup(ctx, c, n);
n 130 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 142 source3/lib/ldb/tools/oLschema2ldif.c int n;
n 146 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, " \t\n");
n 147 source3/lib/ldb/tools/oLschema2ldif.c type = talloc_strndup(token, c, n);
n 148 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 179 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, ")");
n 180 source3/lib/ldb/tools/oLschema2ldif.c token->value = talloc_strndup(ctx, c, n);
n 181 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 219 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, ")");
n 220 source3/lib/ldb/tools/oLschema2ldif.c token->value = talloc_strndup(ctx, c, n);
n 221 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 238 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, ")");
n 239 source3/lib/ldb/tools/oLschema2ldif.c token->value = talloc_strndup(ctx, c, n);
n 240 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 337 source3/lib/ldb/tools/oLschema2ldif.c int n;
n 375 source3/lib/ldb/tools/oLschema2ldif.c n = strcspn(c, " \t");
n 376 source3/lib/ldb/tools/oLschema2ldif.c s = talloc_strndup(msg, c, n);
n 378 source3/lib/ldb/tools/oLschema2ldif.c c += n;
n 29 source3/lib/memcache.c uint8 n; /* This is really an enum, but save memory */
n 43 source3/lib/memcache.c static bool memcache_is_talloc(enum memcache_number n)
n 47 source3/lib/memcache.c switch (n) {
n 110 source3/lib/memcache.c static int memcache_compare(struct memcache_element *e, enum memcache_number n,
n 115 source3/lib/memcache.c if ((int)e->n < (int)n) return 1;
n 116 source3/lib/memcache.c if ((int)e->n > (int)n) return -1;
n 126 source3/lib/memcache.c struct memcache *cache, enum memcache_number n, DATA_BLOB key)
n 136 source3/lib/memcache.c cmp = memcache_compare(elem, n, key);
n 146 source3/lib/memcache.c bool memcache_lookup(struct memcache *cache, enum memcache_number n,
n 158 source3/lib/memcache.c e = memcache_find(cache, n, key);
n 180 source3/lib/memcache.c void *memcache_lookup_talloc(struct memcache *cache, enum memcache_number n,
n 186 source3/lib/memcache.c if (!memcache_lookup(cache, n, key, &value)) {
n 209 source3/lib/memcache.c if (memcache_is_talloc(e->n)) {
n 235 source3/lib/memcache.c void memcache_delete(struct memcache *cache, enum memcache_number n,
n 247 source3/lib/memcache.c e = memcache_find(cache, n, key);
n 255 source3/lib/memcache.c void memcache_add(struct memcache *cache, enum memcache_number n,
n 275 source3/lib/memcache.c e = memcache_find(cache, n, key);
n 281 source3/lib/memcache.c if (memcache_is_talloc(e->n)) {
n 308 source3/lib/memcache.c e->n = n;
n 325 source3/lib/memcache.c cmp = memcache_compare(elem, n, key);
n 342 source3/lib/memcache.c void memcache_add_talloc(struct memcache *cache, enum memcache_number n,
n 356 source3/lib/memcache.c memcache_add(cache, n, key, data_blob_const(&p, sizeof(p)));
n 359 source3/lib/memcache.c void memcache_flush(struct memcache *cache, enum memcache_number n)
n 387 source3/lib/memcache.c if ((int)elem->n == (int)n) {
n 391 source3/lib/memcache.c if ((int)elem->n < (int)n) {
n 419 source3/lib/memcache.c if ((int)elem->n != (int)n) {
n 429 source3/lib/memcache.c if (e->n != n) {
n 56 source3/lib/ms_fnmatch.c static int ms_fnmatch_core(const smb_ucs2_t *p, const smb_ucs2_t *n,
n 67 source3/lib/ms_fnmatch.c if (max_n->predot && max_n->predot <= n) {
n 70 source3/lib/ms_fnmatch.c for (i=0; n[i]; i++) {
n 71 source3/lib/ms_fnmatch.c if (ms_fnmatch_core(p, n+i, max_n+1, ldot, is_case_sensitive) == 0) {
n 75 source3/lib/ms_fnmatch.c if (!max_n->predot || max_n->predot > n) max_n->predot = n;
n 82 source3/lib/ms_fnmatch.c if (max_n->predot && max_n->predot <= n) {
n 85 source3/lib/ms_fnmatch.c if (max_n->postdot && max_n->postdot <= n && n <= ldot) {
n 88 source3/lib/ms_fnmatch.c for (i=0; n[i]; i++) {
n 89 source3/lib/ms_fnmatch.c if (ms_fnmatch_core(p, n+i, max_n+1, ldot, is_case_sensitive) == 0) return 0;
n 90 source3/lib/ms_fnmatch.c if (n+i == ldot) {
n 91 source3/lib/ms_fnmatch.c if (ms_fnmatch_core(p, n+i+1, max_n+1, ldot, is_case_sensitive) == 0) return 0;
n 92 source3/lib/ms_fnmatch.c if (!max_n->postdot || max_n->postdot > n) max_n->postdot = n;
n 96 source3/lib/ms_fnmatch.c if (!max_n->predot || max_n->predot > n) max_n->predot = n;
n 101 source3/lib/ms_fnmatch.c if (! *n) {
n 104 source3/lib/ms_fnmatch.c n++;
n 109 source3/lib/ms_fnmatch.c if (n[0] == UCS2_CHAR('.')) {
n 110 source3/lib/ms_fnmatch.c if (! n[1] && null_match(p) == 0) {
n 115 source3/lib/ms_fnmatch.c if (! *n) return null_match(p);
n 116 source3/lib/ms_fnmatch.c n++;
n 120 source3/lib/ms_fnmatch.c if (*n == 0 && null_match(p) == 0) {
n 123 source3/lib/ms_fnmatch.c if (*n != UCS2_CHAR('.')) return -1;
n 124 source3/lib/ms_fnmatch.c n++;
n 128 source3/lib/ms_fnmatch.c if (c != *n) {
n 132 source3/lib/ms_fnmatch.c if (toupper_w(c) != toupper_w(*n)) {
n 136 source3/lib/ms_fnmatch.c n++;
n 141 source3/lib/ms_fnmatch.c if (! *n) {
n 2203 source3/lib/system.c int sys_aio_suspend(const SMB_STRUCT_AIOCB * const cblist[], int n, const struct timespec *timeout)
n 2206 source3/lib/system.c return aio_suspend64(cblist, n, timeout);
n 2208 source3/lib/system.c return aio_suspend(cblist, n, timeout);
n 2252 source3/lib/system.c int sys_aio_suspend(const SMB_STRUCT_AIOCB * const cblist[], int n, const struct timespec *timeout)
n 186 source3/lib/username.c int n;
n 189 source3/lib/username.c for (n=1;n<=N;n++) {
n 190 source3/lib/username.c ret = uname_string_combinations2(s,mem_ctx,0,fn,n);
n 224 source3/lib/util.c size_t n;
n 228 source3/lib/util.c for( n=0; n<namecount; n++ ) {
n 229 source3/lib/util.c if( strequal( str_array[i], my_netbios_names(n) ) ) {
n 250 source3/lib/util.c int n;
n 267 source3/lib/util.c for( n=0; my_netbios_names(n); n++ ) {
n 269 source3/lib/util.c n, my_netbios_names(n) ) );
n 1013 source3/lib/util.c #define calloc(n,s) __ERROR_DONT_USE_CALLOC_DIRECTLY
n 1870 source3/lib/util.c int n;
n 1873 source3/lib/util.c for (n=0; my_netbios_names(n); n++) {
n 1874 source3/lib/util.c if (strequal(my_netbios_names(n), s)) {
n 2161 source3/lib/util.c int n;
n 2166 source3/lib/util.c n = vasprintf(ptr, format, ap2);
n 2167 source3/lib/util.c if (n == -1 || ! *ptr) {
n 2171 source3/lib/util.c return n;
n 28 source3/lib/util_file.c int fd, n;
n 41 source3/lib/util_file.c while ((n = read(fd, buf, sizeof(buf))) > 0) {
n 42 source3/lib/util_file.c p = talloc_realloc(NULL, p, char, total + n + 1);
n 48 source3/lib/util_file.c memcpy(p+total, buf, n);
n 49 source3/lib/util_file.c total += n;
n 477 source3/lib/util_sid.c int n, i;
n 479 source3/lib/util_sid.c n = MIN(sid1->num_auths, sid2->num_auths);
n 481 source3/lib/util_sid.c for (i = n-1; i >= 0; --i)
n 1962 source3/lib/util_sock.c int i, n;
n 1977 source3/lib/util_sock.c n = get_interfaces(talloc_tos(), &nics);
n 1978 source3/lib/util_sock.c for (i=0; i<n; i++) {
n 126 source3/lib/util_str.c size_t n = 0;
n 132 source3/lib/util_str.c for (ps = s, pt = t; n < len ; ps++, pt++, n++) {
n 156 source3/lib/util_str.c if (n == len) {
n 161 source3/lib/util_str.c return strncmp(ps, pt, len-n);
n 169 source3/lib/util_str.c return strncmp(ps, pt, len-n);
n 175 source3/lib/util_str.c ret = strncasecmp_w(buffer_s, buffer_t, len-n);
n 201 source3/lib/util_str.c bool strnequal(const char *s1,const char *s2,size_t n)
n 205 source3/lib/util_str.c if (!s1 || !s2 || !n)
n 208 source3/lib/util_str.c return(StrnCaseCmp(s1,s2,n)==0);
n 641 source3/lib/util_str.c char *StrnCpy_fn(const char *fn, int line,char *dest,const char *src,size_t n)
n 646 source3/lib/util_str.c clobber_region(fn, line, dest, n+1);
n 660 source3/lib/util_str.c while (n-- && (*d = *src)) {
n 675 source3/lib/util_str.c static char *strncpyn(char *dest, const char *src, size_t n, char c)
n 681 source3/lib/util_str.c clobber_region(dest, n+1);
n 690 source3/lib/util_str.c strncpy(dest, src, MIN(n, str_len));
n 1278 source3/lib/util_str.c char *strnrchr_m(const char *s, char c, unsigned int n)
n 1290 source3/lib/util_str.c p = strnrchr_w(ws, UCS2_CHAR(c), n);
n 1857 source3/lib/util_str.c int bit_offset, byte_offset, idx, i, n;
n 1862 source3/lib/util_str.c n=i=0;
n 1871 source3/lib/util_str.c n = byte_offset+1;
n 1876 source3/lib/util_str.c n = byte_offset+2;
n 1881 source3/lib/util_str.c if ((n > 0) && (*s == '=')) {
n 1882 source3/lib/util_str.c n -= 1;
n 1886 source3/lib/util_str.c decoded.length = n;
n 36 source3/lib/util_transfer_file.c size_t n,
n 51 source3/lib/util_transfer_file.c while (total < n) {
n 52 source3/lib/util_transfer_file.c num_to_read_thistime = MIN((n - total), TRANSFER_BUF_SIZE);
n 106 source3/lib/util_transfer_file.c SMB_OFF_T transfer_file(int infd, int outfd, SMB_OFF_T n)
n 108 source3/lib/util_transfer_file.c return (SMB_OFF_T)transfer_file_internal(&infd, &outfd, (size_t)n,
n 443 source3/lib/util_unistr.c smb_ucs2_t *strnrchr_w(const smb_ucs2_t *s, smb_ucs2_t c, unsigned int n)
n 449 source3/lib/util_unistr.c if (len == 0 || !n) {
n 455 source3/lib/util_unistr.c n--;
n 458 source3/lib/util_unistr.c if (!n) {
n 562 source3/lib/util_unistr.c size_t n = 0;
n 564 source3/lib/util_unistr.c while ((n < len) && (*(COPY_UCS2_CHAR(&cpb,b))) && (*(COPY_UCS2_CHAR(&cpa,a)) == cpb)) {
n 567 source3/lib/util_unistr.c n++;
n 569 source3/lib/util_unistr.c return (len - n)?(*(COPY_UCS2_CHAR(&cpa,a)) - *(COPY_UCS2_CHAR(&cpb,b))):0;
n 594 source3/lib/util_unistr.c size_t n = 0;
n 596 source3/lib/util_unistr.c while ((n < len) && *COPY_UCS2_CHAR(&cpb,b) && (toupper_w(*(COPY_UCS2_CHAR(&cpa,a))) == toupper_w(cpb))) {
n 599 source3/lib/util_unistr.c n++;
n 601 source3/lib/util_unistr.c return (len - n)?(tolower_w(*(COPY_UCS2_CHAR(&cpa,a))) - tolower_w(*(COPY_UCS2_CHAR(&cpb,b)))):0;
n 624 source3/lib/util_unistr.c bool strnequal_w(const smb_ucs2_t *s1,const smb_ucs2_t *s2,size_t n)
n 629 source3/lib/util_unistr.c if (!s1 || !s2 || !n) {
n 633 source3/lib/util_unistr.c return(strncasecmp_w(s1,s2,n)==0);
n 806 source3/lib/util_unistr.c size_t n = 0;
n 808 source3/lib/util_unistr.c while ((n < len) && *b && *(COPY_UCS2_CHAR(&cp,a)) == UCS2_CHAR(*b)) {
n 811 source3/lib/util_unistr.c n++;
n 813 source3/lib/util_unistr.c return (len - n)?(*(COPY_UCS2_CHAR(&cp,a)) - UCS2_CHAR(*b)):0;
n 394 source3/libgpo/gpext/registry.c size_t n = 0;
n 413 source3/libgpo/gpext/registry.c buf = (uint16 *)file_load(real_filename, &n, 0, NULL);
n 419 source3/libgpo/gpext/registry.c if (!prs_init(&ps, n, mem_ctx, UNMARSHALL)) {
n 424 source3/libgpo/gpext/registry.c if (!prs_copy_data_in(&ps, (char *)buf, n)) {
n 66 source3/libgpo/gpo_filesync.c int n = cli_read(cli, fnum, data, nread, read_size);
n 68 source3/libgpo/gpo_filesync.c if (n <= 0)
n 71 source3/libgpo/gpo_filesync.c if (write(fd, data, n) != n) {
n 75 source3/libgpo/gpo_filesync.c nread += n;
n 59 source3/libgpo/gpo_ini.c size_t n = 0;
n 66 source3/libgpo/gpo_ini.c data_in = (uint8 *)file_load(filename_in, &n, 0, NULL);
n 85 source3/libgpo/gpo_ini.c if (!convert_string_talloc(mem_ctx, CH_UTF16LE, CH_UNIX, data_in, n,
n 116 source3/libsmb/clirap2.c #define PUTSTRING(p,s,n) \
n 118 source3/libsmb/clirap2.c push_ascii(p,s?s:"",n?n:256,STR_TERMINATE);\
n 344 source3/libsmb/clireadwrite.c NTSTATUS (*sink)(char *buf, size_t n, void *priv);
n 402 source3/libsmb/clireadwrite.c NTSTATUS (*sink)(char *buf, size_t n,
n 606 source3/libsmb/clireadwrite.c NTSTATUS (*sink)(char *buf, size_t n, void *priv),
n 642 source3/libsmb/clireadwrite.c static NTSTATUS cli_read_sink(char *buf, size_t n, void *priv)
n 645 source3/libsmb/clireadwrite.c memcpy(*pbuf, buf, n);
n 646 source3/libsmb/clireadwrite.c *pbuf += n;
n 1073 source3/libsmb/clireadwrite.c size_t (*source)(uint8_t *buf, size_t n, void *priv);
n 1144 source3/libsmb/clireadwrite.c size_t (*source)(uint8_t *buf, size_t n,
n 1250 source3/libsmb/clireadwrite.c size_t (*source)(uint8_t *buf, size_t n, void *priv),
n 604 source3/libsmb/libsmb_xattr.c int n;
n 660 source3/libsmb/libsmb_xattr.c n = strlen(attr_strings.access_time_attr);
n 661 source3/libsmb/libsmb_xattr.c if (StrnCaseCmp(tok, attr_strings.access_time_attr, n) == 0) {
n 662 source3/libsmb/libsmb_xattr.c dad->access_time = (time_t)strtol(tok+n+1, NULL, 10);
n 666 source3/libsmb/libsmb_xattr.c n = strlen(attr_strings.change_time_attr);
n 667 source3/libsmb/libsmb_xattr.c if (StrnCaseCmp(tok, attr_strings.change_time_attr, n) == 0) {
n 668 source3/libsmb/libsmb_xattr.c dad->change_time = (time_t)strtol(tok+n+1, NULL, 10);
n 672 source3/libsmb/libsmb_xattr.c n = strlen(attr_strings.write_time_attr);
n 673 source3/libsmb/libsmb_xattr.c if (StrnCaseCmp(tok, attr_strings.write_time_attr, n) == 0) {
n 674 source3/libsmb/libsmb_xattr.c dad->write_time = (time_t)strtol(tok+n+1, NULL, 10);
n 679 source3/libsmb/libsmb_xattr.c n = strlen(attr_strings.create_time_attr);
n 681 source3/libsmb/libsmb_xattr.c n) == 0) {
n 682 source3/libsmb/libsmb_xattr.c dad->create_time = (time_t)strtol(tok+n+1,
n 712 source3/libsmb/libsmb_xattr.c int n = 0;
n 934 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 936 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 948 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 950 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize, "%d",
n 955 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 959 source3/libsmb/libsmb_xattr.c buf += n;
n 960 source3/libsmb/libsmb_xattr.c n_used += n;
n 961 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 962 source3/libsmb/libsmb_xattr.c n = 0;
n 984 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 986 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 996 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 998 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize, "%s",
n 1003 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1007 source3/libsmb/libsmb_xattr.c buf += n;
n 1008 source3/libsmb/libsmb_xattr.c n_used += n;
n 1009 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1010 source3/libsmb/libsmb_xattr.c n = 0;
n 1030 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1032 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1042 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1044 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1049 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1053 source3/libsmb/libsmb_xattr.c buf += n;
n 1054 source3/libsmb/libsmb_xattr.c n_used += n;
n 1055 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1056 source3/libsmb/libsmb_xattr.c n = 0;
n 1082 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1084 source3/libsmb/libsmb_xattr.c n = snprintf(
n 1107 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1109 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1129 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1131 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1140 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1144 source3/libsmb/libsmb_xattr.c buf += n;
n 1145 source3/libsmb/libsmb_xattr.c n_used += n;
n 1146 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1147 source3/libsmb/libsmb_xattr.c n = 0;
n 1191 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1193 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1208 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1210 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1215 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1219 source3/libsmb/libsmb_xattr.c buf += n;
n 1220 source3/libsmb/libsmb_xattr.c n_used += n;
n 1221 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1222 source3/libsmb/libsmb_xattr.c n = 0;
n 1236 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1238 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1252 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1254 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1260 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1264 source3/libsmb/libsmb_xattr.c buf += n;
n 1265 source3/libsmb/libsmb_xattr.c n_used += n;
n 1266 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1267 source3/libsmb/libsmb_xattr.c n = 0;
n 1282 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1284 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1296 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1298 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1303 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1307 source3/libsmb/libsmb_xattr.c buf += n;
n 1308 source3/libsmb/libsmb_xattr.c n_used += n;
n 1309 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1310 source3/libsmb/libsmb_xattr.c n = 0;
n 1324 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1326 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1338 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1340 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1345 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1349 source3/libsmb/libsmb_xattr.c buf += n;
n 1350 source3/libsmb/libsmb_xattr.c n_used += n;
n 1351 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1352 source3/libsmb/libsmb_xattr.c n = 0;
n 1366 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1368 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1380 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1382 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1387 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1391 source3/libsmb/libsmb_xattr.c buf += n;
n 1392 source3/libsmb/libsmb_xattr.c n_used += n;
n 1393 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1394 source3/libsmb/libsmb_xattr.c n = 0;
n 1408 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1410 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1422 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1424 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1429 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1433 source3/libsmb/libsmb_xattr.c buf += n;
n 1434 source3/libsmb/libsmb_xattr.c n_used += n;
n 1435 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1436 source3/libsmb/libsmb_xattr.c n = 0;
n 1450 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1452 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1466 source3/libsmb/libsmb_xattr.c n = strlen(p);
n 1468 source3/libsmb/libsmb_xattr.c n = snprintf(buf, bufsize,
n 1474 source3/libsmb/libsmb_xattr.c if (!determine_size && n > bufsize) {
n 1478 source3/libsmb/libsmb_xattr.c buf += n;
n 1479 source3/libsmb/libsmb_xattr.c n_used += n;
n 1480 source3/libsmb/libsmb_xattr.c bufsize -= n;
n 1481 source3/libsmb/libsmb_xattr.c n = 0;
n 177 source3/libsmb/nmblib.c int m,n=0;
n 208 source3/libsmb/nmblib.c if ((c1 & 0xF0) || (c2 & 0xF0) || (n > sizeof(name->name)-1))
n 210 source3/libsmb/nmblib.c name->name[n++] = (c1<<4) | c2;
n 213 source3/libsmb/nmblib.c name->name[n] = 0;
n 215 source3/libsmb/nmblib.c if (n==MAX_NETBIOSNAME_LEN) {
n 222 source3/libsmb/nmblib.c n = 14;
n 223 source3/libsmb/nmblib.c while (n && name->name[n]==' ')
n 224 source3/libsmb/nmblib.c name->name[n--] = 0;
n 228 source3/libsmb/nmblib.c n = 0;
n 242 source3/libsmb/nmblib.c if (n)
n 243 source3/libsmb/nmblib.c name->scope[n++] = '.';
n 244 source3/libsmb/nmblib.c if (m+2+offset>length || n+m+1>sizeof(name->scope))
n 248 source3/libsmb/nmblib.c name->scope[n++] = (char)ubuf[offset++];
n 256 source3/libsmb/nmblib.c name->scope[n++] = 0;
n 345 source3/libsmb/nmblib.c char *nmb_namestr(const struct nmb_name *n)
n 350 source3/libsmb/nmblib.c pull_ascii_fstring(name, n->name);
n 351 source3/libsmb/nmblib.c if (!n->scope[0])
n 353 source3/libsmb/nmblib.c n->name_type);
n 356 source3/libsmb/nmblib.c n->name_type, n->scope);
n 893 source3/libsmb/nmblib.c void make_nmb_name( struct nmb_name *n, const char *name, int type)
n 896 source3/libsmb/nmblib.c memset( (char *)n, '\0', sizeof(struct nmb_name) );
n 899 source3/libsmb/nmblib.c push_ascii(n->name, unix_name, sizeof(n->name), STR_TERMINATE);
n 900 source3/libsmb/nmblib.c n->name_type = (unsigned int)type & 0xFF;
n 901 source3/libsmb/nmblib.c push_ascii(n->scope, global_scope(), 64, STR_TERMINATE);
n 1223 source3/libsmb/nmblib.c void sort_query_replies(char *data, int n, struct in_addr ip)
n 1225 source3/libsmb/nmblib.c if (n <= 1)
n 1230 source3/libsmb/nmblib.c qsort(data, n, 6, QSORT_CAST name_query_comp);
n 45 source3/libsmb/ntlmssp_parse.c int i, n;
n 67 source3/libsmb/ntlmssp_parse.c n = va_arg(ap, int);
n 81 source3/libsmb/ntlmssp_parse.c n = va_arg(ap, int);
n 105 source3/libsmb/ntlmssp_parse.c n = str_charnum(s);
n 106 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n*2); head_ofs += 2;
n 107 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n*2); head_ofs += 2;
n 110 source3/libsmb/ntlmssp_parse.c s, n*2, STR_UNICODE|STR_NOALIGN);
n 111 source3/libsmb/ntlmssp_parse.c data_ofs += n*2;
n 115 source3/libsmb/ntlmssp_parse.c n = str_ascii_charnum(s);
n 116 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n); head_ofs += 2;
n 117 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n); head_ofs += 2;
n 120 source3/libsmb/ntlmssp_parse.c s, n, STR_ASCII|STR_NOALIGN);
n 121 source3/libsmb/ntlmssp_parse.c data_ofs += n;
n 124 source3/libsmb/ntlmssp_parse.c n = va_arg(ap, int);
n 125 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, data_ofs, n); data_ofs += 2;
n 127 source3/libsmb/ntlmssp_parse.c n = str_charnum(s);
n 128 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, data_ofs, n*2); data_ofs += 2;
n 129 source3/libsmb/ntlmssp_parse.c if (0 < n) {
n 130 source3/libsmb/ntlmssp_parse.c push_string(NULL, blob->data+data_ofs, s, n*2,
n 133 source3/libsmb/ntlmssp_parse.c data_ofs += n*2;
n 138 source3/libsmb/ntlmssp_parse.c n = va_arg(ap, int);
n 139 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n); head_ofs += 2;
n 140 source3/libsmb/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n); head_ofs += 2;
n 142 source3/libsmb/ntlmssp_parse.c if (n && b) /* don't follow null pointers... */
n 143 source3/libsmb/ntlmssp_parse.c memcpy(blob->data+data_ofs, b, n);
n 144 source3/libsmb/ntlmssp_parse.c data_ofs += n;
n 147 source3/libsmb/ntlmssp_parse.c n = va_arg(ap, int);
n 148 source3/libsmb/ntlmssp_parse.c SIVAL(blob->data, head_ofs, n); head_ofs += 4;
n 152 source3/libsmb/ntlmssp_parse.c n = va_arg(ap, int);
n 153 source3/libsmb/ntlmssp_parse.c memcpy(blob->data + head_ofs, b, n);
n 154 source3/libsmb/ntlmssp_parse.c head_ofs += n;
n 158 source3/libsmb/ntlmssp_parse.c n = str_charnum(s) + 1;
n 159 source3/libsmb/ntlmssp_parse.c head_ofs += push_string(NULL, blob->data+head_ofs, s, n,
n 149 source3/libsmb/smbdes.c static void permute(char *out, const char *in, const uchar *p, int n)
n 152 source3/libsmb/smbdes.c for (i=0;i<n;i++)
n 156 source3/libsmb/smbdes.c static void lshift(char *d, int count, int n)
n 160 source3/libsmb/smbdes.c for (i=0;i<n;i++)
n 161 source3/libsmb/smbdes.c out[i] = d[(i+count)%n];
n 162 source3/libsmb/smbdes.c for (i=0;i<n;i++)
n 174 source3/libsmb/smbdes.c static void x_or(char *out, char *in1, char *in2, int n)
n 177 source3/libsmb/smbdes.c for (i=0;i<n;i++)
n 232 source3/libsmb/smbdes.c int m, n;
n 235 source3/libsmb/smbdes.c n = (b[j][1]<<3) | (b[j][2]<<2) | (b[j][3]<<1) | b[j][4];
n 238 source3/libsmb/smbdes.c b[j][k] = (sbox[j][m][n] & (1<<(3-k)))?1:0;
n 386 source3/modules/getdate.c # define YYID(n) (n)
n 688 source3/modules/onefs_shadow_copy.c int n;
n 707 source3/modules/onefs_shadow_copy.c n = sscanf(snap_component,
n 715 source3/modules/onefs_shadow_copy.c if (n != 6)
n 72 source3/modules/vfs_aio_fork.c size_t n;
n 112 source3/modules/vfs_aio_fork.c ssize_t n;
n 143 source3/modules/vfs_aio_fork.c if ( (n = recvmsg(fd, &msg, 0)) <= 0) {
n 144 source3/modules/vfs_aio_fork.c return(n);
n 173 source3/modules/vfs_aio_fork.c return(n);
n 318 source3/modules/vfs_aio_fork.c (int)cmd_struct.n, (int)cmd_struct.offset, fd));
n 344 source3/modules/vfs_aio_fork.c fd, (void *)map->ptr, cmd_struct.n,
n 349 source3/modules/vfs_aio_fork.c fd, (void *)map->ptr, cmd_struct.n,
n 576 source3/modules/vfs_aio_fork.c cmd.n = aiocb->aio_nbytes;
n 620 source3/modules/vfs_aio_fork.c cmd.n = aiocb->aio_nbytes;
n 313 source3/modules/vfs_default.c static ssize_t vfswrap_read(vfs_handle_struct *handle, files_struct *fsp, void *data, size_t n)
n 317 source3/modules/vfs_default.c START_PROFILE_BYTES(syscall_read, n);
n 318 source3/modules/vfs_default.c result = sys_read(fsp->fh->fd, data, n);
n 324 source3/modules/vfs_default.c size_t n, SMB_OFF_T offset)
n 329 source3/modules/vfs_default.c START_PROFILE_BYTES(syscall_pread, n);
n 330 source3/modules/vfs_default.c result = sys_pread(fsp->fh->fd, data, n, offset);
n 335 source3/modules/vfs_default.c result = SMB_VFS_READ(fsp, data, n);
n 346 source3/modules/vfs_default.c result = SMB_VFS_READ(fsp, data, n);
n 356 source3/modules/vfs_default.c result = SMB_VFS_READ(fsp, data, n);
n 367 source3/modules/vfs_default.c static ssize_t vfswrap_write(vfs_handle_struct *handle, files_struct *fsp, const void *data, size_t n)
n 371 source3/modules/vfs_default.c START_PROFILE_BYTES(syscall_write, n);
n 372 source3/modules/vfs_default.c result = sys_write(fsp->fh->fd, data, n);
n 378 source3/modules/vfs_default.c size_t n, SMB_OFF_T offset)
n 383 source3/modules/vfs_default.c START_PROFILE_BYTES(syscall_pwrite, n);
n 384 source3/modules/vfs_default.c result = sys_pwrite(fsp->fh->fd, data, n, offset);
n 389 source3/modules/vfs_default.c result = SMB_VFS_WRITE(fsp, data, n);
n 405 source3/modules/vfs_default.c result = SMB_VFS_WRITE(fsp, data, n);
n 443 source3/modules/vfs_default.c SMB_OFF_T offset, size_t n)
n 447 source3/modules/vfs_default.c START_PROFILE_BYTES(syscall_sendfile, n);
n 448 source3/modules/vfs_default.c result = sys_sendfile(tofd, fromfsp->fh->fd, hdr, offset, n);
n 457 source3/modules/vfs_default.c size_t n)
n 461 source3/modules/vfs_default.c START_PROFILE_BYTES(syscall_recvfile, n);
n 462 source3/modules/vfs_default.c result = sys_recvfile(fromfd, tofsp->fh->fd, offset, n);
n 1527 source3/modules/vfs_default.c static int vfswrap_aio_suspend(struct vfs_handle_struct *handle, struct files_struct *fsp, const SMB_STRUCT_AIOCB * const aiocb[], int n, const struct timespec *timeout)
n 1529 source3/modules/vfs_default.c return sys_aio_suspend(aiocb, n, timeout);
n 134 source3/modules/vfs_full_audit.c void *data, size_t n);
n 136 source3/modules/vfs_full_audit.c void *data, size_t n, SMB_OFF_T offset);
n 138 source3/modules/vfs_full_audit.c const void *data, size_t n);
n 140 source3/modules/vfs_full_audit.c const void *data, size_t n,
n 147 source3/modules/vfs_full_audit.c size_t n);
n 151 source3/modules/vfs_full_audit.c size_t n);
n 356 source3/modules/vfs_full_audit.c static int smb_full_audit_aio_suspend(struct vfs_handle_struct *handle, struct files_struct *fsp, const SMB_STRUCT_AIOCB * const aiocb[], int n, const struct timespec *ts);
n 1249 source3/modules/vfs_full_audit.c void *data, size_t n)
n 1253 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_READ(handle, fsp, data, n);
n 1261 source3/modules/vfs_full_audit.c void *data, size_t n, SMB_OFF_T offset)
n 1265 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_PREAD(handle, fsp, data, n, offset);
n 1273 source3/modules/vfs_full_audit.c const void *data, size_t n)
n 1277 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_WRITE(handle, fsp, data, n);
n 1285 source3/modules/vfs_full_audit.c const void *data, size_t n,
n 1290 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, offset);
n 1313 source3/modules/vfs_full_audit.c size_t n)
n 1317 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_SENDFILE(handle, tofd, fromfsp, hdr, offset, n);
n 1328 source3/modules/vfs_full_audit.c size_t n)
n 1332 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_RECVFILE(handle, fromfd, tofsp, offset, n);
n 2432 source3/modules/vfs_full_audit.c static int smb_full_audit_aio_suspend(struct vfs_handle_struct *handle, struct files_struct *fsp, const SMB_STRUCT_AIOCB * const aiocb[], int n, const struct timespec *ts)
n 2436 source3/modules/vfs_full_audit.c result = SMB_VFS_NEXT_AIO_SUSPEND(handle, fsp, aiocb, n, ts);
n 289 source3/modules/vfs_shadow_copy2.c uint32 n = 0;
n 291 source3/modules/vfs_shadow_copy2.c n = ((n << 5) + n) ^ (uint32)(*s++);
n 293 source3/modules/vfs_shadow_copy2.c return n;
n 334 source3/modules/vfs_smb_traffic_analyzer.c files_struct *fsp, void *data, size_t n)
n 338 source3/modules/vfs_smb_traffic_analyzer.c result = SMB_VFS_NEXT_READ(handle, fsp, data, n);
n 350 source3/modules/vfs_smb_traffic_analyzer.c files_struct *fsp, void *data, size_t n, SMB_OFF_T offset)
n 354 source3/modules/vfs_smb_traffic_analyzer.c result = SMB_VFS_NEXT_PREAD(handle, fsp, data, n, offset);
n 367 source3/modules/vfs_smb_traffic_analyzer.c files_struct *fsp, const void *data, size_t n)
n 371 source3/modules/vfs_smb_traffic_analyzer.c result = SMB_VFS_NEXT_WRITE(handle, fsp, data, n);
n 383 source3/modules/vfs_smb_traffic_analyzer.c files_struct *fsp, const void *data, size_t n, SMB_OFF_T offset)
n 387 source3/modules/vfs_smb_traffic_analyzer.c result = SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, offset);
n 782 source3/modules/vfs_streams_xattr.c size_t n, SMB_OFF_T offset)
n 790 source3/modules/vfs_streams_xattr.c DEBUG(10, ("streams_xattr_pwrite called for %d bytes\n", (int)n));
n 793 source3/modules/vfs_streams_xattr.c return SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, offset);
n 806 source3/modules/vfs_streams_xattr.c if ((offset + n) > ea.value.length-1) {
n 810 source3/modules/vfs_streams_xattr.c offset + n + 1);
n 818 source3/modules/vfs_streams_xattr.c ea.value.length = offset + n + 1;
n 819 source3/modules/vfs_streams_xattr.c ea.value.data[offset+n] = 0;
n 822 source3/modules/vfs_streams_xattr.c memcpy(ea.value.data + offset, data, n);
n 839 source3/modules/vfs_streams_xattr.c return n;
n 844 source3/modules/vfs_streams_xattr.c size_t n, SMB_OFF_T offset)
n 853 source3/modules/vfs_streams_xattr.c return SMB_VFS_NEXT_PREAD(handle, fsp, data, n, offset);
n 873 source3/modules/vfs_streams_xattr.c overlap = (offset + n) > length ? (length - offset) : n;
n 280 source3/modules/vfs_tsmsm.c SMB_OFF_T offset, size_t n)
n 290 source3/modules/vfs_tsmsm.c return SMB_VFS_NEXT_SENDFILE(handle, tofd, fsp, hdr, offset, n);
n 296 source3/modules/vfs_tsmsm.c void *data, size_t n, SMB_OFF_T offset) {
n 300 source3/modules/vfs_tsmsm.c result = SMB_VFS_NEXT_PREAD(handle, fsp, data, n, offset);
n 314 source3/modules/vfs_tsmsm.c void *data, size_t n, SMB_OFF_T offset) {
n 318 source3/modules/vfs_tsmsm.c result = SMB_VFS_NEXT_PWRITE(handle, fsp, data, n, offset);
n 216 source3/nmbd/nmbd.c int n;
n 237 source3/nmbd/nmbd.c for (n=iface_count() - 1; n >= 0; n--) {
n 239 source3/nmbd/nmbd.c const struct interface *iface = get_interface(n);
n 243 source3/nmbd/nmbd.c DEBUG(2,("reload_interfaces: failed to get interface %d\n", n));
n 290 source3/nmbd/nmbd.c for (n=iface_count() - 1; n >= 0; n--) {
n 291 source3/nmbd/nmbd.c struct interface *iface = get_interface(n);
n 309 source3/nmbd/nmbd.c if (n == -1) {
n 158 source3/nmbd/nmbd_mynames.c int a, n;
n 163 source3/nmbd/nmbd_mynames.c for (n=0;n<ARRAY_SIZE(name_types);n++) {
n 167 source3/nmbd/nmbd_mynames.c make_nmb_name(&nmbname, my_netbios_names(i), name_types[n]);
n 8888 source3/param/loadparm.c const char *n = de->d_name;
n 8891 source3/param/loadparm.c if (*n == '.') {
n 8892 source3/param/loadparm.c if ((n[1] == '\0') || (n[1] == '.' && n[2] == '\0')) {
n 8897 source3/param/loadparm.c if (n[0] == ':') {
n 8910 source3/param/loadparm.c r = process_usershare_file(usersharepath, n, snum_template);
n 8917 source3/param/loadparm.c n, usersharepath ));
n 766 source3/printing/nt_printing.c int n = 0;
n 789 source3/printing/nt_printing.c *list = SMB_REALLOC_ARRAY(*list, nt_forms_struct, n+1);
n 794 source3/printing/nt_printing.c (*list)[n] = form;
n 795 source3/printing/nt_printing.c n++;
n 799 source3/printing/nt_printing.c return n;
n 855 source3/printing/nt_printing.c int n=0;
n 866 source3/printing/nt_printing.c for (n=0; n<*count; n++) {
n 867 source3/printing/nt_printing.c if ( strequal((*list)[n].name, form->form_name) ) {
n 874 source3/printing/nt_printing.c if((*list=SMB_REALLOC_ARRAY(*list, nt_forms_struct, n+1)) == NULL) {
n 878 source3/printing/nt_printing.c fstrcpy((*list)[n].name, form->form_name);
n 882 source3/printing/nt_printing.c (*list)[n].flag = form->flags;
n 883 source3/printing/nt_printing.c (*list)[n].width = form->size.width;
n 884 source3/printing/nt_printing.c (*list)[n].length = form->size.height;
n 885 source3/printing/nt_printing.c (*list)[n].left = form->area.left;
n 886 source3/printing/nt_printing.c (*list)[n].top = form->area.top;
n 887 source3/printing/nt_printing.c (*list)[n].right = form->area.right;
n 888 source3/printing/nt_printing.c (*list)[n].bottom = form->area.bottom;
n 903 source3/printing/nt_printing.c int n=0;
n 907 source3/printing/nt_printing.c for (n=0; n<*count; n++) {
n 908 source3/printing/nt_printing.c if (!strncmp((*list)[n].name, del_name, strlen(del_name))) {
n 914 source3/printing/nt_printing.c if (n == *count) {
n 920 source3/printing/nt_printing.c if (asprintf(&key, "%s%s", FORMS_PREFIX, (*list)[n].name) < 0) {
n 939 source3/printing/nt_printing.c int n=0;
n 942 source3/printing/nt_printing.c for (n=0; n<count; n++) {
n 943 source3/printing/nt_printing.c DEBUGADD(106, ("n [%d]:[%s]\n", n, (*list)[n].name));
n 944 source3/printing/nt_printing.c if (!strncmp((*list)[n].name, form->form_name, strlen(form->form_name)))
n 948 source3/printing/nt_printing.c if (n==count) return;
n 950 source3/printing/nt_printing.c (*list)[n].flag = form->flags;
n 951 source3/printing/nt_printing.c (*list)[n].width = form->size.width;
n 952 source3/printing/nt_printing.c (*list)[n].length = form->size.height;
n 953 source3/printing/nt_printing.c (*list)[n].left = form->area.left;
n 954 source3/printing/nt_printing.c (*list)[n].top = form->area.top;
n 955 source3/printing/nt_printing.c (*list)[n].right = form->area.right;
n 956 source3/printing/nt_printing.c (*list)[n].bottom = form->area.bottom;
n 153 source3/rpc_client/cli_lsarpc.c uint32_t n;
n 172 source3/rpc_client/cli_lsarpc.c for (n=0; n < lsa_names.count; n++) {
n 173 source3/rpc_client/cli_lsarpc.c lsa_names.names[n].sid_type = lsa_names2.names[n].sid_type;
n 174 source3/rpc_client/cli_lsarpc.c lsa_names.names[n].name = lsa_names2.names[n].name;
n 175 source3/rpc_client/cli_lsarpc.c lsa_names.names[n].sid_index = lsa_names2.names[n].sid_index;
n 666 source3/rpc_server/srv_pipe_hnd.c static ssize_t process_incoming_data(pipes_struct *p, char *data, size_t n)
n 668 source3/rpc_server/srv_pipe_hnd.c size_t data_to_copy = MIN(n, RPC_MAX_PDU_FRAG_LEN - p->in_data.pdu_received_len);
n 672 source3/rpc_server/srv_pipe_hnd.c (unsigned int)n ));
n 680 source3/rpc_server/srv_pipe_hnd.c incoming data size = %u\n", (unsigned int)p->in_data.pdu_received_len, (unsigned int)n ));
n 755 source3/rpc_server/srv_pipe_hnd.c static ssize_t write_to_internal_pipe(struct pipes_struct *p, char *data, size_t n)
n 757 source3/rpc_server/srv_pipe_hnd.c size_t data_left = n;
n 776 source3/rpc_server/srv_pipe_hnd.c return n;
n 790 source3/rpc_server/srv_pipe_hnd.c static ssize_t read_from_internal_pipe(struct pipes_struct *p, char *data, size_t n,
n 802 source3/rpc_server/srv_pipe_hnd.c (unsigned int)n));
n 815 source3/rpc_server/srv_pipe_hnd.c if(n > RPC_MAX_PDU_FRAG_LEN) {
n 818 source3/rpc_server/srv_pipe_hnd.c (unsigned int)n, get_pipe_name_from_iface(&p->syntax),
n 820 source3/rpc_server/srv_pipe_hnd.c n = RPC_MAX_PDU_FRAG_LEN;
n 835 source3/rpc_server/srv_pipe_hnd.c data_returned = (ssize_t)MIN(n, pdu_remaining);
n 885 source3/rpc_server/srv_pipe_hnd.c data_returned = MIN(n, prs_offset(&p->out_data.frag));
n 891 source3/rpc_server/srv_pipe_hnd.c (*is_data_outstanding) = prs_offset(&p->out_data.frag) > n;
n 98 source3/smbd/conn.c int oldsz = bmap->n;
n 99 source3/smbd/conn.c int newsz = bmap->n + BITMAP_BLOCK_SZ;
n 1151 source3/smbd/dir.c const char *n;
n 1159 source3/smbd/dir.c n = ".";
n 1163 source3/smbd/dir.c n = "..";
n 1166 source3/smbd/dir.c return n;
n 1175 source3/smbd/dir.c while ((n = vfs_readdirname(conn, dirp->dir, sbuf))) {
n 1177 source3/smbd/dir.c if (*n == '.') {
n 1178 source3/smbd/dir.c if ((n[1] == '\0') || (n[1] == '.' && n[2] == '\0')) {
n 1184 source3/smbd/dir.c return n;
n 31 source3/smbd/fileio.c static bool read_from_write_cache(files_struct *fsp,char *data,SMB_OFF_T pos,size_t n)
n 39 source3/smbd/fileio.c if( n > wcp->data_size || pos < wcp->offset || pos + n > wcp->offset + wcp->data_size) {
n 43 source3/smbd/fileio.c memcpy(data, wcp->data + (pos - wcp->offset), n);
n 54 source3/smbd/fileio.c ssize_t read_file(files_struct *fsp,char *data,SMB_OFF_T pos,size_t n)
n 67 source3/smbd/fileio.c if(read_from_write_cache(fsp, data, pos, n)) {
n 68 source3/smbd/fileio.c fsp->fh->pos = pos + n;
n 70 source3/smbd/fileio.c return n;
n 77 source3/smbd/fileio.c if (n > 0) {
n 81 source3/smbd/fileio.c readret = SMB_VFS_PREAD(fsp,data,n,pos);
n 93 source3/smbd/fileio.c readret = SMB_VFS_PREAD(fsp,data,n,pos);
n 105 source3/smbd/fileio.c fsp->fsp_name, (double)pos, (unsigned long)n, (long)ret ));
n 121 source3/smbd/fileio.c size_t n)
n 126 source3/smbd/fileio.c ret = vfs_write_data(req, fsp, data, n);
n 134 source3/smbd/fileio.c ret = vfs_pwrite_data(req, fsp, data, n, pos);
n 138 source3/smbd/fileio.c fsp->fsp_name, (double)pos, (unsigned long)n, (long)ret ));
n 252 source3/smbd/fileio.c size_t n)
n 268 source3/smbd/fileio.c return print_job_write(SNUM(fsp->conn), jobid, data, pos, n);
n 360 source3/smbd/fileio.c total_written = real_write_file(req, fsp, data, pos, n);
n 365 source3/smbd/fileio.c fsp->fsp_name, fsp->fh->fd, (double)pos, (unsigned int)n, (double)wcp->offset, (unsigned int)wcp->data_size));
n 367 source3/smbd/fileio.c fsp->fh->pos = pos + n;
n 395 source3/smbd/fileio.c size_t data_used = MIN((wcp->alloc_size - (pos - wcp->offset)), n);
n 422 source3/smbd/fileio.c if(n == data_used) {
n 423 source3/smbd/fileio.c return n;
n 434 source3/smbd/fileio.c n -= data_used;
n 441 source3/smbd/fileio.c } else if ((pos < wcp->offset) && (pos + n > wcp->offset) &&
n 442 source3/smbd/fileio.c (pos + n <= wcp->offset + wcp->alloc_size)) {
n 460 source3/smbd/fileio.c size_t data_used = pos + n - wcp->offset;
n 462 source3/smbd/fileio.c memcpy(wcp->data, data + n - data_used, data_used);
n 468 source3/smbd/fileio.c if(pos + n > wcp->offset + wcp->data_size) {
n 469 source3/smbd/fileio.c wcp->data_size = pos + n - wcp->offset;
n 487 source3/smbd/fileio.c n -= data_used;
n 528 source3/smbd/fileio.c if(pos + n <= wcp->offset + wcp->alloc_size) {
n 529 source3/smbd/fileio.c data_used = n;
n 566 source3/smbd/fileio.c if(n == data_used) {
n 567 source3/smbd/fileio.c return n;
n 579 source3/smbd/fileio.c n -= data_used;
n 587 source3/smbd/fileio.c (n == 1) &&
n 632 source3/smbd/fileio.c return n;
n 676 source3/smbd/fileio.c len = %u\n",fsp->fh->fd, (double)pos, (unsigned int)n, (double)wcp->offset, (unsigned int)wcp->data_size ));
n 685 source3/smbd/fileio.c if ( n <= wcp->alloc_size && n > wcp->data_size) {
n 688 source3/smbd/fileio.c ssize_t ret = real_write_file(NULL,fsp, data, pos, n);
n 697 source3/smbd/fileio.c (pos + n >= wcp->offset + wcp->data_size) ) {
n 722 source3/smbd/fileio.c write_path, fsp->fh->fd, (double)wcp->file_size, (double)pos, (unsigned int)n,
n 734 source3/smbd/fileio.c if (n > wcp->alloc_size ) {
n 735 source3/smbd/fileio.c ssize_t ret = real_write_file(NULL,fsp, data, pos, n);
n 741 source3/smbd/fileio.c wcp->file_size = pos + n;
n 745 source3/smbd/fileio.c return total_written + n;
n 752 source3/smbd/fileio.c if (n) {
n 760 source3/smbd/fileio.c memcpy(wcp->data+wcp->data_size, data, n);
n 765 source3/smbd/fileio.c wcp->data_size += n;
n 777 source3/smbd/fileio.c (double)wcp->offset, (unsigned int)wcp->data_size, (unsigned int)n));
n 779 source3/smbd/fileio.c total_written += n;
n 120 source3/smbd/lanman.c static int CopyAndAdvance(char **dst, char *src, int *n)
n 123 source3/smbd/lanman.c if (!src || !dst || !n || !(*dst)) {
n 126 source3/smbd/lanman.c l = push_ascii(*dst,src,*n, STR_TERMINATE);
n 131 source3/smbd/lanman.c (*n) -= l;
n 216 source3/smbd/lanman.c int i, n;
n 223 source3/smbd/lanman.c for (n = 0;;) {
n 226 source3/smbd/lanman.c n = 10 * n + (i - '0');
n 228 source3/smbd/lanman.c return n;
n 236 source3/smbd/lanman.c int n = 0;
n 244 source3/smbd/lanman.c n += 2;
n 247 source3/smbd/lanman.c n += 2;
n 250 source3/smbd/lanman.c n += 2;
n 255 source3/smbd/lanman.c n += 4;
n 258 source3/smbd/lanman.c n += 4;
n 262 source3/smbd/lanman.c n += get_counter(&p);
n 266 source3/smbd/lanman.c return n;
n 271 source3/smbd/lanman.c int n = p->buflen;
n 287 source3/smbd/lanman.c if (i > n) {
n 289 source3/smbd/lanman.c i = n = 0;
n 305 source3/smbd/lanman.c n -= i;
n 307 source3/smbd/lanman.c p->stringlen = n;
n 559 source3/smbd/lanman.c print_queue_struct *queue, int n)
n 573 source3/smbd/lanman.c PACKI(desc,"W",n+1); /* uPosition */
n 583 source3/smbd/lanman.c PACKI(desc,"W",n+1); /* uPosition */
n 983 source3/smbd/lanman.c int i, n;
n 1041 source3/smbd/lanman.c n = 0;
n 1044 source3/smbd/lanman.c subcntarr[n] = print_queue_status(i, &queue[n],&status[n]);
n 1045 source3/smbd/lanman.c subcnt += subcntarr[n];
n 1046 source3/smbd/lanman.c n++;
n 1060 source3/smbd/lanman.c n = 0;
n 1064 source3/smbd/lanman.c fill_printq_info(conn,i,uLevel,&desc,subcntarr[n],queue[n],&status[n]);
n 1065 source3/smbd/lanman.c n++;
n 1067 source3/smbd/lanman.c succnt = n;
n 4202 source3/smbd/lanman.c int i, n, succnt=0;
n 4242 source3/smbd/lanman.c n = 0;
n 4246 source3/smbd/lanman.c n++;
n 4248 source3/smbd/lanman.c succnt = n;
n 371 source3/smbd/statcache.c unsigned int n = 0;
n 374 source3/smbd/statcache.c n = ((n << 5) + n) ^ (unsigned int)(*p);
n 376 source3/smbd/statcache.c return n;
n 381 source3/smbd/utmp.c static void utmp_strcpy(char *dest, const char *src, size_t n)
n 385 source3/smbd/utmp.c memset(dest, '\0', n);
n 388 source3/smbd/utmp.c if (len >= n) {
n 389 source3/smbd/utmp.c memcpy(dest, src, n);
n 698 source3/smbd/vfs.c SMB_OFF_T vfs_transfer_file(files_struct *in, files_struct *out, SMB_OFF_T n)
n 700 source3/smbd/vfs.c return transfer_file_internal((void *)in, (void *)out, n,
n 427 source3/torture/locktest.c int n)
n 430 source3/torture/locktest.c printf("testing %u ...\n", n);
n 431 source3/torture/locktest.c for (i=0; i<n; i++) {
n 439 source3/torture/locktest.c return n;
n 453 source3/torture/locktest.c int n, i, n1, skip, r1, r2;
n 460 source3/torture/locktest.c for (n=0; n<numops; n++) {
n 462 source3/torture/locktest.c if (n < sizeof(preset) / sizeof(preset[0])) {
n 463 source3/torture/locktest.c recorded[n] = preset[n];
n 466 source3/torture/locktest.c recorded[n].conn = random() % NCONNECTIONS;
n 467 source3/torture/locktest.c recorded[n].f = random() % NFILES;
n 468 source3/torture/locktest.c recorded[n].start = lock_base + ((unsigned)random() % (lock_range-1));
n 469 source3/torture/locktest.c recorded[n].len = min_length +
n 470 source3/torture/locktest.c random() % (lock_range-(recorded[n].start-lock_base));
n 471 source3/torture/locktest.c recorded[n].start *= RANGE_MULTIPLE;
n 472 source3/torture/locktest.c recorded[n].len *= RANGE_MULTIPLE;
n 476 source3/torture/locktest.c recorded[n].lock_type = READ_LOCK;
n 478 source3/torture/locktest.c recorded[n].lock_type = WRITE_LOCK;
n 481 source3/torture/locktest.c recorded[n].lock_op = OP_LOCK;
n 483 source3/torture/locktest.c recorded[n].lock_op = OP_UNLOCK;
n 485 source3/torture/locktest.c recorded[n].lock_op = OP_REOPEN;
n 487 source3/torture/locktest.c recorded[n].needed = True;
n 488 source3/torture/locktest.c if (!zero_zero && recorded[n].start==0 && recorded[n].len==0) {
n 489 source3/torture/locktest.c recorded[n].len = 1;
n 498 source3/torture/locktest.c n = retest(cli, fnum, numops);
n 500 source3/torture/locktest.c if (n == numops || !analyze) return;
n 501 source3/torture/locktest.c n++;
n 503 source3/torture/locktest.c skip = n/2;
n 506 source3/torture/locktest.c n1 = n;
n 512 source3/torture/locktest.c for (i=0;i<n-skip;i+=skip) {
n 522 source3/torture/locktest.c m = retest(cli, fnum, n);
n 523 source3/torture/locktest.c if (m == n) {
n 532 source3/torture/locktest.c n = m-(skip-1);
n 543 source3/torture/locktest.c if (n1 == n) break;
n 550 source3/torture/locktest.c n1 = retest(cli, fnum, n);
n 551 source3/torture/locktest.c if (n1 != n-1) {
n 552 source3/torture/locktest.c printf("ERROR - inconsistent result (%u %u)\n", n1, n);
n 556 source3/torture/locktest.c for (i=0;i<n;i++) {
n 348 source3/torture/locktest2.c int n)
n 351 source3/torture/locktest2.c printf("testing %u ...\n", n);
n 352 source3/torture/locktest2.c for (i=0; i<n; i++) {
n 360 source3/torture/locktest2.c return n;
n 375 source3/torture/locktest2.c int n, i, n1;
n 385 source3/torture/locktest2.c for (n=0; n<numops; n++) {
n 386 source3/torture/locktest2.c recorded[n].conn = random() % NCONNECTIONS;
n 387 source3/torture/locktest2.c recorded[n].fstype = random() % NUMFSTYPES;
n 388 source3/torture/locktest2.c recorded[n].f = random() % NFILES;
n 389 source3/torture/locktest2.c recorded[n].start = LOCKBASE + ((unsigned)random() % (LOCKRANGE-1));
n 390 source3/torture/locktest2.c recorded[n].len = 1 +
n 391 source3/torture/locktest2.c random() % (LOCKRANGE-(recorded[n].start-LOCKBASE));
n 392 source3/torture/locktest2.c recorded[n].start *= RANGE_MULTIPLE;
n 393 source3/torture/locktest2.c recorded[n].len *= RANGE_MULTIPLE;
n 394 source3/torture/locktest2.c recorded[n].r1 = random() % 100;
n 395 source3/torture/locktest2.c recorded[n].r2 = random() % 100;
n 396 source3/torture/locktest2.c recorded[n].needed = True;
n 401 source3/torture/locktest2.c n = retest(cli, nfs, fnum, numops);
n 403 source3/torture/locktest2.c if (n == numops || !analyze) return;
n 404 source3/torture/locktest2.c n++;
n 407 source3/torture/locktest2.c n1 = n;
n 413 source3/torture/locktest2.c for (i=0;i<n-1;i++) {
n 420 source3/torture/locktest2.c m = retest(cli, nfs, fnum, n);
n 421 source3/torture/locktest2.c if (m == n) {
n 428 source3/torture/locktest2.c n = m;
n 433 source3/torture/locktest2.c if (n1 == n) break;
n 440 source3/torture/locktest2.c n1 = retest(cli, nfs, fnum, n);
n 441 source3/torture/locktest2.c if (n1 != n-1) {
n 442 source3/torture/locktest2.c printf("ERROR - inconsistent result (%u %u)\n", n1, n);
n 446 source3/torture/locktest2.c for (i=0;i<n;i++) {
n 42 source3/torture/masktest.c const char *p = pattern, *n = string;
n 45 source3/torture/masktest.c if (strcmp(p,"?")==0 && strcmp(n,".")==0) goto match;
n 51 source3/torture/masktest.c if (*n != '.') goto nomatch;
n 52 source3/torture/masktest.c n++;
n 56 source3/torture/masktest.c if ((*n == '.' && n[1] != '.') || ! *n) goto next;
n 57 source3/torture/masktest.c n++;
n 61 source3/torture/masktest.c if (n[0] == '.') {
n 62 source3/torture/masktest.c if (! n[1] && ms_fnmatch_lanman_core(p, n+1) == 0) goto match;
n 63 source3/torture/masktest.c if (ms_fnmatch_lanman_core(p, n) == 0) goto match;
n 66 source3/torture/masktest.c if (! *n) goto next;
n 67 source3/torture/masktest.c n++;
n 72 source3/torture/masktest.c for (; *n; n++) {
n 73 source3/torture/masktest.c if (ms_fnmatch_lanman_core(p, n) == 0) goto match;
n 78 source3/torture/masktest.c for (; *n; n++) {
n 79 source3/torture/masktest.c if (ms_fnmatch_lanman_core(p, n) == 0) goto match;
n 80 source3/torture/masktest.c if (*n == '.' && !strchr_m(n+1,'.')) {
n 81 source3/torture/masktest.c n++;
n 88 source3/torture/masktest.c if (*n == 0 && ms_fnmatch_lanman_core(p, n) == 0) goto match;
n 89 source3/torture/masktest.c if (*n != '.') goto nomatch;
n 90 source3/torture/masktest.c n++;
n 94 source3/torture/masktest.c if (c != *n) goto nomatch;
n 95 source3/torture/masktest.c n++;
n 99 source3/torture/masktest.c if (! *n) goto match;
n 106 source3/torture/masktest.c if (ms_fnmatch_lanman_core(p, n) == 0) goto match;
n 45 source3/torture/msgtest.c int i, n;
n 68 source3/torture/msgtest.c n = atoi(argv[2]);
n 72 source3/torture/msgtest.c for (i=0;i<n;i++) {
n 89 source3/torture/msgtest.c for (i=0;i<n;i++) {
n 96 source3/torture/msgtest.c for (i=0;i<n;i++) {
n 113 source3/torture/msgtest.c size_t timelimit = n;
n 69 source3/torture/nbio.c void nbio_shmem(int n)
n 71 source3/torture/nbio.c nprocs = n;
n 280 source3/torture/nbio.c char *s, *n;
n 283 source3/torture/nbio.c n = SMB_STRDUP(name);
n 284 source3/torture/nbio.c n[strlen(n)-1] = 0;
n 285 source3/torture/nbio.c if (asprintf(&s, "%s%s", n, finfo->name) == -1) {
n 302 source3/torture/nbio.c free(n);
n 34 source3/torture/smbiconv.c size_t n;
n 40 source3/torture/smbiconv.c n = smb_iconv (cd, &addr, &len, &outptr, &outlen);
n 103 source3/torture/smbiconv.c ssize_t n = read (fd, inptr, maxlen - actlen);
n 105 source3/torture/smbiconv.c if (n == 0)
n 109 source3/torture/smbiconv.c if (n == -1)
n 116 source3/torture/smbiconv.c inptr += n;
n 117 source3/torture/smbiconv.c actlen += n;
n 123 source3/torture/smbiconv.c ssize_t n;
n 139 source3/torture/smbiconv.c n = read (fd, inptr, maxlen - actlen);
n 141 source3/torture/smbiconv.c if (n == 0)
n 145 source3/torture/smbiconv.c if (n == -1)
n 152 source3/torture/smbiconv.c inptr += n;
n 153 source3/torture/smbiconv.c actlen += n;
n 157 source3/torture/smbiconv.c if (n == 0)
n 440 source3/torture/torture.c unsigned n = (unsigned)sys_random()%10;
n 444 source3/torture/torture.c slprintf(fname, sizeof(fstring) - 1, "\\torture.%u", n);
n 446 source3/torture/torture.c if (!wait_lock(c, fnum2, n*sizeof(int), sizeof(int))) {
n 493 source3/torture/torture.c if (!cli_unlock(c, fnum2, n*sizeof(int), sizeof(int))) {
n 5136 source3/torture/torture.c static size_t null_source(uint8_t *buf, size_t n, void *priv)
n 5141 source3/torture/torture.c thistime = MIN(thistime, n);
n 148 source3/utils/net_dns.c int i, n;
n 155 source3/utils/net_dns.c n = iface_count();
n 157 source3/utils/net_dns.c if (n <= 0) {
n 161 source3/utils/net_dns.c if ( (list = SMB_MALLOC_ARRAY( struct sockaddr_storage, n )) == NULL ) {
n 165 source3/utils/net_dns.c for ( i=0; i<n; i++ ) {
n 375 source3/utils/net_rpc_printer.c int n, ret;
n 376 source3/utils/net_rpc_printer.c n = cli_read(cli_share_src, fnum_src, data, nread,
n 379 source3/utils/net_rpc_printer.c if (n <= 0)
n 383 source3/utils/net_rpc_printer.c nread, n);
n 385 source3/utils/net_rpc_printer.c if (n != ret) {
n 392 source3/utils/net_rpc_printer.c nread += n;
n 156 source3/utils/net_rpc_registry.c char c, n;
n 166 source3/utils/net_rpc_registry.c n = '\0';
n 167 source3/utils/net_rpc_registry.c name_buf.name = &n;
n 274 source3/utils/net_rpc_registry.c char n;
n 278 source3/utils/net_rpc_registry.c n = '\0';
n 279 source3/utils/net_rpc_registry.c name_buf.name = &n;
n 225 source3/utils/net_usershare.c const char *n = de->d_name;
n 228 source3/utils/net_usershare.c if (*n == '.') {
n 229 source3/utils/net_usershare.c if ((n[1] == '\0') || (n[1] == '.' && n[2] == '\0')) {
n 234 source3/utils/net_usershare.c if (!validate_net_name(n, INVALID_SHARENAME_CHARS, strlen(n))) {
n 235 source3/utils/net_usershare.c d_fprintf(stderr, "get_share_list: ignoring bad share name %s\n",n);
n 241 source3/utils/net_usershare.c n);
n 263 source3/utils/net_usershare.c if (!unix_wild_match(wcard, n)) {
n 273 source3/utils/net_usershare.c fl->pathname = talloc_strdup(ctx, n);
n 549 source3/utils/net_usershare.c const char *n = de->d_name;
n 552 source3/utils/net_usershare.c if (*n == '.') {
n 553 source3/utils/net_usershare.c if ((n[1] == '\0') || (n[1] == '.' && n[2] == '\0')) {
n 558 source3/utils/net_usershare.c if (!validate_net_name(n, INVALID_SHARENAME_CHARS, strlen(n))) {
n 559 source3/utils/net_usershare.c d_fprintf(stderr, "count_num_usershares: ignoring bad share name %s\n",n);
n 565 source3/utils/net_usershare.c n);
n 1110 source3/utils/smbcontrol.c static void my_make_nmb_name( struct nmb_name *n, const char *name, int type)
n 1113 source3/utils/smbcontrol.c memset( (char *)n, '\0', sizeof(struct nmb_name) );
n 1116 source3/utils/smbcontrol.c push_ascii(n->name, unix_name, sizeof(n->name), STR_TERMINATE);
n 1117 source3/utils/smbcontrol.c n->name_type = (unsigned int)type & 0xFF;
n 1118 source3/utils/smbcontrol.c push_ascii(n->scope, global_scope(), 64, STR_TERMINATE);
n 395 source3/winbindd/idmap_adex/likewise_cell.c int n = ads_count_replies(c->conn, *msg);
n 397 source3/winbindd/idmap_adex/likewise_cell.c DEBUG(10,("cell_do_search: Located %d entries\n", n));
n 55 source4/auth/ntlmssp/ntlmssp_parse.c size_t n;
n 70 source4/auth/ntlmssp/ntlmssp_parse.c s, &n);
n 74 source4/auth/ntlmssp/ntlmssp_parse.c pointers[i].length = n;
n 82 source4/auth/ntlmssp/ntlmssp_parse.c &n);
n 86 source4/auth/ntlmssp/ntlmssp_parse.c pointers[i].length = n;
n 95 source4/auth/ntlmssp/ntlmssp_parse.c s, &n);
n 99 source4/auth/ntlmssp/ntlmssp_parse.c pointers[i].length = n;
n 143 source4/auth/ntlmssp/ntlmssp_parse.c n = pointers[i].length;
n 144 source4/auth/ntlmssp/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n); head_ofs += 2;
n 145 source4/auth/ntlmssp/ntlmssp_parse.c SSVAL(blob->data, head_ofs, n); head_ofs += 2;
n 147 source4/auth/ntlmssp/ntlmssp_parse.c if (pointers[i].data && n) /* don't follow null pointers... */
n 148 source4/auth/ntlmssp/ntlmssp_parse.c memcpy(blob->data+data_ofs, pointers[i].data, n);
n 149 source4/auth/ntlmssp/ntlmssp_parse.c data_ofs += n;
n 155 source4/auth/ntlmssp/ntlmssp_parse.c n = pointers[i].length;
n 156 source4/auth/ntlmssp/ntlmssp_parse.c SSVAL(blob->data, data_ofs, n); data_ofs += 2;
n 157 source4/auth/ntlmssp/ntlmssp_parse.c if (n >= 0) {
n 158 source4/auth/ntlmssp/ntlmssp_parse.c memcpy(blob->data+data_ofs, pointers[i].data, n);
n 160 source4/auth/ntlmssp/ntlmssp_parse.c data_ofs += n;
n 168 source4/auth/ntlmssp/ntlmssp_parse.c n = pointers[i].length;
n 169 source4/auth/ntlmssp/ntlmssp_parse.c memcpy(blob->data + head_ofs, pointers[i].data, n);
n 170 source4/auth/ntlmssp/ntlmssp_parse.c head_ofs += n;
n 173 source4/auth/ntlmssp/ntlmssp_parse.c n = pointers[i].length;
n 174 source4/auth/ntlmssp/ntlmssp_parse.c memcpy(blob->data + head_ofs, pointers[i].data, n);
n 175 source4/auth/ntlmssp/ntlmssp_parse.c head_ofs += n;
n 116 source4/client/client.c static int writefile(int f, const void *_b, int n, bool translation)
n 122 source4/client/client.c return write(f,b,n);
n 126 source4/client/client.c while (i < n) {
n 127 source4/client/client.c if (*b == '\r' && (i<(n-1)) && *(b+1) == '\n') {
n 144 source4/client/client.c static int readfile(void *_b, int n, XFILE *f, bool translation)
n 151 source4/client/client.c return x_fread(b,1,n,f);
n 154 source4/client/client.c while (i < (n - 1)) {
n 755 source4/client/client.c int n = smbcli_read(ctx->cli->tree, fnum, data, nread + start, read_size);
n 757 source4/client/client.c if (n <= 0) break;
n 759 source4/client/client.c if (writefile(handle,data, n, ctx->translation) != n) {
n 765 source4/client/client.c nread += n;
n 1146 source4/client/client.c int n = maxwrite;
n 1149 source4/client/client.c if ((n = readfile(buf,n,f,ctx->translation)) < 1) {
n 1150 source4/client/client.c if((n == 0) && x_feof(f))
n 1158 source4/client/client.c ret = smbcli_write(ctx->cli->tree, fnum, 0, buf, nread + start, n);
n 1160 source4/client/client.c if (n != ret) {
n 1166 source4/client/client.c nread += n;
n 115 source4/dsdb/samdb/ldb_modules/password_hash.c } n;
n 155 source4/dsdb/samdb/ldb_modules/password_hash.c io->g.nt_hash = io->n.nt_hash;
n 197 source4/dsdb/samdb/ldb_modules/password_hash.c io->g.lm_hash = io->n.lm_hash;
n 237 source4/dsdb/samdb/ldb_modules/password_hash.c cleartext_data.data = io->n.cleartext_utf8->data;
n 238 source4/dsdb/samdb/ldb_modules/password_hash.c cleartext_data.length = io->n.cleartext_utf8->length;
n 977 source4/dsdb/samdb/ldb_modules/password_hash.c MD5Update(&md5, io->n.cleartext_utf8->data, io->n.cleartext_utf8->length);
n 1035 source4/dsdb/samdb/ldb_modules/password_hash.c if (!io->n.cleartext_utf8) {
n 1217 source4/dsdb/samdb/ldb_modules/password_hash.c pcb.cleartext = *io->n.cleartext_utf16;
n 1318 source4/dsdb/samdb/ldb_modules/password_hash.c if ((io->n.cleartext_utf8 || io->n.cleartext_utf16) && (io->n.nt_hash || io->n.lm_hash)) {
n 1325 source4/dsdb/samdb/ldb_modules/password_hash.c if (io->n.cleartext_utf8 && io->n.cleartext_utf16) {
n 1332 source4/dsdb/samdb/ldb_modules/password_hash.c if (io->n.cleartext_utf8) {
n 1335 source4/dsdb/samdb/ldb_modules/password_hash.c io->n.cleartext_utf16 = cleartext_utf16_blob = talloc(io->ac, struct ldb_val);
n 1336 source4/dsdb/samdb/ldb_modules/password_hash.c if (!io->n.cleartext_utf16) {
n 1341 source4/dsdb/samdb/ldb_modules/password_hash.c CH_UTF8, CH_UTF16, io->n.cleartext_utf8->data, io->n.cleartext_utf8->length,
n 1349 source4/dsdb/samdb/ldb_modules/password_hash.c } else if (io->n.cleartext_utf16) {
n 1352 source4/dsdb/samdb/ldb_modules/password_hash.c io->n.cleartext_utf8 = cleartext_utf8_blob = talloc(io->ac, struct ldb_val);
n 1353 source4/dsdb/samdb/ldb_modules/password_hash.c if (!io->n.cleartext_utf8) {
n 1358 source4/dsdb/samdb/ldb_modules/password_hash.c CH_UTF16MUNGED, CH_UTF8, io->n.cleartext_utf16->data, io->n.cleartext_utf16->length,
n 1361 source4/dsdb/samdb/ldb_modules/password_hash.c io->n.cleartext_utf8 = NULL;
n 1366 source4/dsdb/samdb/ldb_modules/password_hash.c if (io->n.cleartext_utf16) {
n 1373 source4/dsdb/samdb/ldb_modules/password_hash.c io->n.nt_hash = nt_hash;
n 1376 source4/dsdb/samdb/ldb_modules/password_hash.c mdfour(nt_hash->hash, io->n.cleartext_utf16->data, io->n.cleartext_utf16->length);
n 1379 source4/dsdb/samdb/ldb_modules/password_hash.c if (io->n.cleartext_utf8) {
n 1383 source4/dsdb/samdb/ldb_modules/password_hash.c CH_UTF8, CH_UNIX, io->n.cleartext_utf8->data, io->n.cleartext_utf8->length,
n 1394 source4/dsdb/samdb/ldb_modules/password_hash.c io->n.lm_hash = lm_hash;
n 1775 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.cleartext_utf8 = ldb_msg_find_ldb_val(msg, "userPassword");
n 1776 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.cleartext_utf16 = ldb_msg_find_ldb_val(msg, "clearTextPassword");
n 1777 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.nt_hash = samdb_result_hash(io.ac, msg, "unicodePwd");
n 1778 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.lm_hash = samdb_result_hash(io.ac, msg, "dBCSPwd");
n 1781 source4/dsdb/samdb/ldb_modules/password_hash.c if (io.n.cleartext_utf8) ldb_msg_remove_attr(msg, "userPassword");
n 1782 source4/dsdb/samdb/ldb_modules/password_hash.c if (io.n.cleartext_utf16) ldb_msg_remove_attr(msg, "clearTextPassword");
n 1783 source4/dsdb/samdb/ldb_modules/password_hash.c if (io.n.nt_hash) ldb_msg_remove_attr(msg, "unicodePwd");
n 1784 source4/dsdb/samdb/ldb_modules/password_hash.c if (io.n.lm_hash) ldb_msg_remove_attr(msg, "dBCSPwd");
n 2138 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.cleartext_utf8 = ldb_msg_find_ldb_val(orig_msg, "userPassword");
n 2139 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.cleartext_utf16 = ldb_msg_find_ldb_val(orig_msg, "clearTextPassword");
n 2160 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.quoted_utf16.data = talloc_memdup(orig_msg, quoted_utf16->data+2, quoted_utf16->length-4);
n 2161 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.quoted_utf16.length = quoted_utf16->length-4;
n 2162 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.cleartext_utf16 = &io.n.quoted_utf16;
n 2163 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.nt_hash = NULL;
n 2165 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.nt_hash = samdb_result_hash(io.ac, orig_msg, "unicodePwd");
n 2168 source4/dsdb/samdb/ldb_modules/password_hash.c io.n.lm_hash = samdb_result_hash(io.ac, orig_msg, "dBCSPwd");
n 133 source4/dsdb/samdb/ldb_modules/rootdse.c uint32_t n = 0;
n 136 source4/dsdb/samdb/ldb_modules/rootdse.c n++;
n 140 source4/dsdb/samdb/ldb_modules/rootdse.c "%u", n) != 0) {
n 147 source4/dsdb/samdb/ldb_modules/rootdse.c uint32_t n = 0;
n 150 source4/dsdb/samdb/ldb_modules/rootdse.c n++;
n 154 source4/dsdb/samdb/ldb_modules/rootdse.c "%u", n) != 0) {
n 469 source4/heimdal/kdc/kerberos5.c unsigned int n = 0;
n 484 source4/heimdal/kdc/kerberos5.c for (j = 0; j < n; j++)
n 493 source4/heimdal/kdc/kerberos5.c if (n >= pa.len)
n 496 source4/heimdal/kdc/kerberos5.c &pa.val[n++],
n 516 source4/heimdal/kdc/kerberos5.c if (n >= pa.len)
n 519 source4/heimdal/kdc/kerberos5.c &pa.val[n++],
n 527 source4/heimdal/kdc/kerberos5.c if(n < pa.len) {
n 529 source4/heimdal/kdc/kerberos5.c pa.len = n;
n 631 source4/heimdal/kdc/kerberos5.c unsigned int n = 0;
n 645 source4/heimdal/kdc/kerberos5.c for (j = 0; j < n; j++)
n 652 source4/heimdal/kdc/kerberos5.c if (n >= pa.len)
n 654 source4/heimdal/kdc/kerberos5.c if((ret = make_etype_info2_entry(&pa.val[n++],
n 673 source4/heimdal/kdc/kerberos5.c if (n >= pa.len)
n 675 source4/heimdal/kdc/kerberos5.c if((ret = make_etype_info2_entry(&pa.val[n++],
n 683 source4/heimdal/kdc/kerberos5.c if(n < pa.len) {
n 685 source4/heimdal/kdc/kerberos5.c pa.len = n;
n 379 source4/heimdal/lib/asn1/der_get.c size_t n;
n 398 source4/heimdal/lib/asn1/der_get.c for (n = 2; len > 0; ++n) {
n 411 source4/heimdal/lib/asn1/der_get.c data->components[n] = u;
n 413 source4/heimdal/lib/asn1/der_get.c if (n > 2 && p[-1] & 0x80) {
n 417 source4/heimdal/lib/asn1/der_get.c data->length = n;
n 87 source4/heimdal/lib/asn1/der_length.c int n;
n 89 source4/heimdal/lib/asn1/der_length.c for (n = 2; n < oid->length; ++n) {
n 90 source4/heimdal/lib/asn1/der_length.c unsigned u = oid->components[n];
n 350 source4/heimdal/lib/asn1/der_put.c int n;
n 352 source4/heimdal/lib/asn1/der_put.c for (n = data->length - 1; n >= 2; --n) {
n 353 source4/heimdal/lib/asn1/der_put.c unsigned u = data->components[n];
n 362 source4/heimdal/lib/asn1/gen.c struct member *n = ASN1_TAILQ_NEXT(m, members);
n 363 source4/heimdal/lib/asn1/gen.c if (n == NULL)
n 365 source4/heimdal/lib/asn1/gen.c if (n->ellipsis && ASN1_TAILQ_NEXT(n, members) == NULL)
n 589 source4/heimdal/lib/asn1/gen.c char *n;
n 591 source4/heimdal/lib/asn1/gen.c asprintf (&n, "%s:1", m->gen_name);
n 592 source4/heimdal/lib/asn1/gen.c if (n == NULL)
n 594 source4/heimdal/lib/asn1/gen.c define_type (level + 1, n, &i, FALSE, FALSE);
n 595 source4/heimdal/lib/asn1/gen.c free (n);
n 633 source4/heimdal/lib/asn1/gen.c char *n;
n 635 source4/heimdal/lib/asn1/gen.c asprintf (&n, "*%s", m->gen_name);
n 636 source4/heimdal/lib/asn1/gen.c if (n == NULL)
n 638 source4/heimdal/lib/asn1/gen.c define_type (level + 1, n, m->type, FALSE, FALSE);
n 639 source4/heimdal/lib/asn1/gen.c free (n);
n 713 source4/heimdal/lib/asn1/gen.c char *n;
n 715 source4/heimdal/lib/asn1/gen.c asprintf (&n, "*%s", m->gen_name);
n 716 source4/heimdal/lib/asn1/gen.c if (n == NULL)
n 718 source4/heimdal/lib/asn1/gen.c define_type (level + 2, n, m->type, FALSE, FALSE);
n 719 source4/heimdal/lib/asn1/gen.c free (n);
n 420 source4/heimdal/lib/asn1/gen_decode.c char *n;
n 455 source4/heimdal/lib/asn1/gen_decode.c asprintf (&n, "&(%s)->val[(%s)->len]", name, name);
n 456 source4/heimdal/lib/asn1/gen_decode.c if (n == NULL)
n 461 source4/heimdal/lib/asn1/gen_decode.c decode_type (n, t->subtype, 0, forwstr, sname);
n 472 source4/heimdal/lib/asn1/gen_decode.c free (n);
n 355 source4/heimdal/lib/asn1/gen_encode.c char *n;
n 363 source4/heimdal/lib/asn1/gen_encode.c asprintf (&n, "&(%s)->val[i]", name);
n 364 source4/heimdal/lib/asn1/gen_encode.c if (n == NULL)
n 369 source4/heimdal/lib/asn1/gen_encode.c encode_type (n, t->subtype, sname);
n 374 source4/heimdal/lib/asn1/gen_encode.c free (n);
n 128 source4/heimdal/lib/asn1/gen_free.c char *n;
n 131 source4/heimdal/lib/asn1/gen_free.c asprintf (&n, "&(%s)->val[(%s)->len-1]", name, name);
n 132 source4/heimdal/lib/asn1/gen_free.c if (n == NULL)
n 134 source4/heimdal/lib/asn1/gen_free.c free_type(n, t->subtype, FALSE);
n 142 source4/heimdal/lib/asn1/gen_free.c free(n);
n 185 source4/heimdal/lib/asn1/gen_length.c char *n;
n 198 source4/heimdal/lib/asn1/gen_length.c asprintf (&n, "&(%s)->val[i]", name);
n 199 source4/heimdal/lib/asn1/gen_length.c if (n == NULL)
n 204 source4/heimdal/lib/asn1/gen_length.c length_type(n, t->subtype, variable, sname);
n 212 source4/heimdal/lib/asn1/gen_length.c free(n);
n 164 source4/heimdal/lib/asn1/lex.c #define YY_LESS_LINENO(n)
n 167 source4/heimdal/lib/asn1/lex.c #define yyless(n) \
n 171 source4/heimdal/lib/asn1/lex.c int yyless_macro_arg = (n); \
n 929 source4/heimdal/lib/asn1/lex.c int n; \
n 930 source4/heimdal/lib/asn1/lex.c for ( n = 0; n < max_size && \
n 931 source4/heimdal/lib/asn1/lex.c (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
n 932 source4/heimdal/lib/asn1/lex.c buf[n] = (char) c; \
n 934 source4/heimdal/lib/asn1/lex.c buf[n++] = (char) c; \
n 937 source4/heimdal/lib/asn1/lex.c result = n; \
n 2449 source4/heimdal/lib/asn1/lex.c yy_size_t n;
n 2453 source4/heimdal/lib/asn1/lex.c n = _yybytes_len + 2;
n 2454 source4/heimdal/lib/asn1/lex.c buf = (char *) yyalloc(n );
n 2463 source4/heimdal/lib/asn1/lex.c b = yy_scan_buffer(buf,n );
n 2488 source4/heimdal/lib/asn1/lex.c #define yyless(n) \
n 2492 source4/heimdal/lib/asn1/lex.c int yyless_macro_arg = (n); \
n 2637 source4/heimdal/lib/asn1/lex.c static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
n 2640 source4/heimdal/lib/asn1/lex.c for ( i = 0; i < n; ++i )
n 2648 source4/heimdal/lib/asn1/lex.c register int n;
n 2649 source4/heimdal/lib/asn1/lex.c for ( n = 0; s[n]; ++n )
n 2652 source4/heimdal/lib/asn1/lex.c return n;
n 400 source4/heimdal/lib/asn1/parse.c # define YYID(n) (n)
n 70 source4/heimdal/lib/com_err/compile_et.c int n;
n 90 source4/heimdal/lib/com_err/compile_et.c for(ec = codes, n = 0; ec; ec = ec->next, n++) {
n 91 source4/heimdal/lib/com_err/compile_et.c while(n < ec->number) {
n 93 source4/heimdal/lib/com_err/compile_et.c n, name, n);
n 94 source4/heimdal/lib/com_err/compile_et.c n++;
n 164 source4/heimdal/lib/com_err/lex.c #define YY_LESS_LINENO(n)
n 167 source4/heimdal/lib/com_err/lex.c #define yyless(n) \
n 171 source4/heimdal/lib/com_err/lex.c int yyless_macro_arg = (n); \
n 610 source4/heimdal/lib/com_err/lex.c int n; \
n 611 source4/heimdal/lib/com_err/lex.c for ( n = 0; n < max_size && \
n 612 source4/heimdal/lib/com_err/lex.c (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
n 613 source4/heimdal/lib/com_err/lex.c buf[n] = (char) c; \
n 615 source4/heimdal/lib/com_err/lex.c buf[n++] = (char) c; \
n 618 source4/heimdal/lib/com_err/lex.c result = n; \
n 1625 source4/heimdal/lib/com_err/lex.c yy_size_t n;
n 1629 source4/heimdal/lib/com_err/lex.c n = _yybytes_len + 2;
n 1630 source4/heimdal/lib/com_err/lex.c buf = (char *) yyalloc(n );
n 1639 source4/heimdal/lib/com_err/lex.c b = yy_scan_buffer(buf,n );
n 1664 source4/heimdal/lib/com_err/lex.c #define yyless(n) \
n 1668 source4/heimdal/lib/com_err/lex.c int yyless_macro_arg = (n); \
n 1813 source4/heimdal/lib/com_err/lex.c static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
n 1816 source4/heimdal/lib/com_err/lex.c for ( i = 0; i < n; ++i )
n 1824 source4/heimdal/lib/com_err/lex.c register int n;
n 1825 source4/heimdal/lib/com_err/lex.c for ( n = 0; s[n]; ++n )
n 1828 source4/heimdal/lib/com_err/lex.c return n;
n 255 source4/heimdal/lib/com_err/parse.c # define YYID(n) (n)
n 39 source4/heimdal/lib/gssapi/krb5/8003.c _gsskrb5_encode_om_uint32(OM_uint32 n, u_char *p)
n 41 source4/heimdal/lib/gssapi/krb5/8003.c p[0] = (n >> 0) & 0xFF;
n 42 source4/heimdal/lib/gssapi/krb5/8003.c p[1] = (n >> 8) & 0xFF;
n 43 source4/heimdal/lib/gssapi/krb5/8003.c p[2] = (n >> 16) & 0xFF;
n 44 source4/heimdal/lib/gssapi/krb5/8003.c p[3] = (n >> 24) & 0xFF;
n 49 source4/heimdal/lib/gssapi/krb5/8003.c _gsskrb5_encode_be_om_uint32(OM_uint32 n, u_char *p)
n 51 source4/heimdal/lib/gssapi/krb5/8003.c p[0] = (n >> 24) & 0xFF;
n 52 source4/heimdal/lib/gssapi/krb5/8003.c p[1] = (n >> 16) & 0xFF;
n 53 source4/heimdal/lib/gssapi/krb5/8003.c p[2] = (n >> 8) & 0xFF;
n 54 source4/heimdal/lib/gssapi/krb5/8003.c p[3] = (n >> 0) & 0xFF;
n 59 source4/heimdal/lib/gssapi/krb5/8003.c _gsskrb5_decode_om_uint32(const void *ptr, OM_uint32 *n)
n 62 source4/heimdal/lib/gssapi/krb5/8003.c *n = (p[0] << 0) | (p[1] << 8) | (p[2] << 16) | (p[3] << 24);
n 67 source4/heimdal/lib/gssapi/krb5/8003.c _gsskrb5_decode_be_om_uint32(const void *ptr, OM_uint32 *n)
n 70 source4/heimdal/lib/gssapi/krb5/8003.c *n = (p[0] <<24) | (p[1] << 16) | (p[2] << 8) | (p[3] << 0);
n 43 source4/heimdal/lib/gssapi/mech/gss_add_oid_set_member.c size_t n;
n 56 source4/heimdal/lib/gssapi/mech/gss_add_oid_set_member.c n = (*oid_set)->count + 1;
n 57 source4/heimdal/lib/gssapi/mech/gss_add_oid_set_member.c tmp = realloc ((*oid_set)->elements, n * sizeof(gss_OID_desc));
n 63 source4/heimdal/lib/gssapi/mech/gss_add_oid_set_member.c (*oid_set)->count = n;
n 64 source4/heimdal/lib/gssapi/mech/gss_add_oid_set_member.c (*oid_set)->elements[n-1] = *member_oid;
n 174 source4/heimdal/lib/gssapi/mech/gss_inquire_cred.c gss_name_t n = (gss_name_t)name;
n 175 source4/heimdal/lib/gssapi/mech/gss_inquire_cred.c if (n)
n 176 source4/heimdal/lib/gssapi/mech/gss_inquire_cred.c gss_release_name(minor_status, &n);
n 567 source4/heimdal/lib/gssapi/spnego/context_stubs.c gss_OID_set mechs, names, n;
n 584 source4/heimdal/lib/gssapi/spnego/context_stubs.c &n);
n 588 source4/heimdal/lib/gssapi/spnego/context_stubs.c for (j = 0; j < n->count; j++)
n 590 source4/heimdal/lib/gssapi/spnego/context_stubs.c &n->elements[j],
n 592 source4/heimdal/lib/gssapi/spnego/context_stubs.c gss_release_oid_set(&junk, &n);
n 307 source4/heimdal/lib/hcrypto/dh.c unsigned i, n = BN_num_bits(pub_key);
n 310 source4/heimdal/lib/hcrypto/dh.c for (i = 0; i <= n; i++)
n 65 source4/heimdal/lib/hcrypto/hash.h cshift (uint32_t x, unsigned int n)
n 68 source4/heimdal/lib/hcrypto/hash.h return CRAYFIX((x << n) | (x >> (32 - n)));
n 80 source4/heimdal/lib/hcrypto/hmac.h const void *data, size_t n, void *md, unsigned int *md_len);
n 252 source4/heimdal/lib/hcrypto/rand-fortuna.c unsigned n;
n 262 source4/heimdal/lib/hcrypto/rand-fortuna.c n = ++st->reseed_count;
n 273 source4/heimdal/lib/hcrypto/rand-fortuna.c if (n & 1 || !n)
n 275 source4/heimdal/lib/hcrypto/rand-fortuna.c n >>= 1;
n 390 source4/heimdal/lib/hcrypto/rand-fortuna.c unsigned n;
n 416 source4/heimdal/lib/hcrypto/rand-fortuna.c n = CIPH_BLOCK;
n 418 source4/heimdal/lib/hcrypto/rand-fortuna.c n = count;
n 419 source4/heimdal/lib/hcrypto/rand-fortuna.c memcpy(dst, st->result, n);
n 420 source4/heimdal/lib/hcrypto/rand-fortuna.c dst += n;
n 421 source4/heimdal/lib/hcrypto/rand-fortuna.c count -= n;
n 507 source4/heimdal/lib/hcrypto/rand-fortuna.c ssize_t n;
n 510 source4/heimdal/lib/hcrypto/rand-fortuna.c while ((n = read(fd, (char *)u.shad, sizeof(u.shad))) > 0)
n 116 source4/heimdal/lib/hcrypto/rc2.c #define ROT16L(w,n) ((w<<n)|(w>>(16-n)))
n 117 source4/heimdal/lib/hcrypto/rc2.c #define ROT16R(w,n) ((w>>n)|(w<<(16-n)))
n 88 source4/heimdal/lib/hcrypto/rsa-imath.c setup_blind(mp_int n, mp_int b, mp_int bi)
n 92 source4/heimdal/lib/hcrypto/rsa-imath.c random_num(b, mp_int_count_bits(n));
n 93 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_mod(b, n, b);
n 94 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_invmod(b, n, bi);
n 98 source4/heimdal/lib/hcrypto/rsa-imath.c blind(mp_int in, mp_int b, mp_int e, mp_int n)
n 103 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_exptmod(b, e, n, &t1);
n 105 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_mod(in, n, in);
n 110 source4/heimdal/lib/hcrypto/rsa-imath.c unblind(mp_int out, mp_int bi, mp_int n)
n 114 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_mod(out, n, out);
n 162 source4/heimdal/lib/hcrypto/rsa-imath.c mpz_t enc, dec, n, e;
n 172 source4/heimdal/lib/hcrypto/rsa-imath.c BN2mpz(&n, rsa->n);
n 178 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 187 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 207 source4/heimdal/lib/hcrypto/rsa-imath.c res = mp_int_exptmod(&dec, &e, &n, &enc);
n 211 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 231 source4/heimdal/lib/hcrypto/rsa-imath.c mpz_t s, us, n, e;
n 239 source4/heimdal/lib/hcrypto/rsa-imath.c BN2mpz(&n, rsa->n);
n 245 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 255 source4/heimdal/lib/hcrypto/rsa-imath.c if (mp_int_compare(&s, &n) >= 0) {
n 256 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 261 source4/heimdal/lib/hcrypto/rsa-imath.c res = mp_int_exptmod(&s, &e, &n, &us);
n 264 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 303 source4/heimdal/lib/hcrypto/rsa-imath.c mpz_t in, out, n, e, b, bi;
n 324 source4/heimdal/lib/hcrypto/rsa-imath.c BN2mpz(&n, rsa->n);
n 333 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_compare(&in, &n) >= 0) {
n 339 source4/heimdal/lib/hcrypto/rsa-imath.c setup_blind(&n, &b, &bi);
n 340 source4/heimdal/lib/hcrypto/rsa-imath.c blind(&in, &b, &e, &n);
n 363 source4/heimdal/lib/hcrypto/rsa-imath.c res = mp_int_exptmod(&in, &d, &n, &out);
n 372 source4/heimdal/lib/hcrypto/rsa-imath.c unblind(&out, &bi, &n);
n 387 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 401 source4/heimdal/lib/hcrypto/rsa-imath.c mpz_t in, out, n, e, b, bi;
n 414 source4/heimdal/lib/hcrypto/rsa-imath.c BN2mpz(&n, rsa->n);
n 424 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_compare(&in, &n) >= 0) {
n 430 source4/heimdal/lib/hcrypto/rsa-imath.c setup_blind(&n, &b, &bi);
n 431 source4/heimdal/lib/hcrypto/rsa-imath.c blind(&in, &b, &e, &n);
n 454 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_compare(&in, &n) >= 0)
n 458 source4/heimdal/lib/hcrypto/rsa-imath.c res = mp_int_exptmod(&in, &d, &n, &out);
n 467 source4/heimdal/lib/hcrypto/rsa-imath.c unblind(&out, &bi, &n);
n 496 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 529 source4/heimdal/lib/hcrypto/rsa-imath.c mpz_t el, p, q, n, d, dmp1, dmq1, iqmp, t1, t2, t3;
n 540 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_init(&n);
n 584 source4/heimdal/lib/hcrypto/rsa-imath.c CHECK(mp_int_mul(&p, &q, &n), MP_OK);
n 604 source4/heimdal/lib/hcrypto/rsa-imath.c rsa->n = mpz2BN(&n);
n 615 source4/heimdal/lib/hcrypto/rsa-imath.c mp_int_clear(&n);
n 141 source4/heimdal/lib/hcrypto/rsa.c free_if(rsa->n);
n 263 source4/heimdal/lib/hcrypto/rsa.c if ((rsa->d == NULL || rsa->n == NULL) &&
n 296 source4/heimdal/lib/hcrypto/rsa.c return BN_num_bytes(rsa->n);
n 458 source4/heimdal/lib/hcrypto/rsa.c k->n = heim_int2BN(&data.modulus);
n 468 source4/heimdal/lib/hcrypto/rsa.c if (k->n == NULL || k->e == NULL || k->d == NULL || k->p == NULL ||
n 485 source4/heimdal/lib/hcrypto/rsa.c if (rsa->n == NULL || rsa->e == NULL || rsa->d == NULL || rsa->p == NULL ||
n 492 source4/heimdal/lib/hcrypto/rsa.c ret = bn2heim_int(rsa->n, &data.modulus);
n 537 source4/heimdal/lib/hcrypto/rsa.c if (bn2heim_int(rsa->n, &data.modulus) ||
n 102 source4/heimdal/lib/hcrypto/rsa.h BIGNUM *n;
n 210 source4/heimdal/lib/hcrypto/sha.c #define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
n 46 source4/heimdal/lib/hcrypto/sha256.c #define ROTR(x,n) (((x)>>(n)) | ((x) << (32 - (n))))
n 152 source4/heimdal/lib/hcrypto/sha256.c #define ROL(x,n) ((x)<<(n))|((x)>>(32-(n)))
n 515 source4/heimdal/lib/hx509/ca.c Name n;
n 524 source4/heimdal/lib/hx509/ca.c ret = hx509_name_to_Name(issuername, &n);
n 530 source4/heimdal/lib/hx509/ca.c gn.u.directoryName.element = n.element;
n 531 source4/heimdal/lib/hx509/ca.c gn.u.directoryName.u.rdnSequence = n.u.rdnSequence;
n 534 source4/heimdal/lib/hx509/ca.c free_Name(&n);
n 616 source4/heimdal/lib/hx509/ca.c int n;
n 619 source4/heimdal/lib/hx509/ca.c n = 1;
n 630 source4/heimdal/lib/hx509/ca.c n++;
n 633 source4/heimdal/lib/hx509/ca.c calloc(n, sizeof(*p.principalName.name_string.val));
n 639 source4/heimdal/lib/hx509/ca.c p.principalName.name_string.len = n;
n 656 source4/heimdal/lib/hx509/ca.c n = 0;
n 658 source4/heimdal/lib/hx509/ca.c p.principalName.name_string.val[n++] = q;
n 1620 source4/heimdal/lib/hx509/cert.c const RelativeDistinguishedName *n)
n 1624 source4/heimdal/lib/hx509/cert.c if (c->len != n->len)
n 1627 source4/heimdal/lib/hx509/cert.c for (i = 0; i < n->len; i++) {
n 1630 source4/heimdal/lib/hx509/cert.c if (der_heim_oid_cmp(&c->val[i].type, &n->val[i].type) != 0)
n 1632 source4/heimdal/lib/hx509/cert.c ret = _hx509_name_ds_cmp(&c->val[i].value, &n->val[i].value, &diff);
n 1642 source4/heimdal/lib/hx509/cert.c match_X501Name(const Name *c, const Name *n)
n 1647 source4/heimdal/lib/hx509/cert.c || n->element != choice_Name_rdnSequence)
n 1649 source4/heimdal/lib/hx509/cert.c if (c->u.rdnSequence.len > n->u.rdnSequence.len)
n 1652 source4/heimdal/lib/hx509/cert.c ret = match_RDN(&c->u.rdnSequence.val[i], &n->u.rdnSequence.val[i]);
n 1661 source4/heimdal/lib/hx509/cert.c match_general_name(const GeneralName *c, const GeneralName *n, int *match)
n 1667 source4/heimdal/lib/hx509/cert.c assert(c->element == n->element);
n 1672 source4/heimdal/lib/hx509/cert.c &n->u.otherName.type_id) != 0)
n 1675 source4/heimdal/lib/hx509/cert.c &n->u.otherName.value) != 0)
n 1684 source4/heimdal/lib/hx509/cert.c if (strcasecmp(c->u.rfc822Name, n->u.rfc822Name) != 0)
n 1687 source4/heimdal/lib/hx509/cert.c s = strchr(n->u.rfc822Name, '@');
n 1706 source4/heimdal/lib/hx509/cert.c lenn = strlen(n->u.dNSName);
n 1709 source4/heimdal/lib/hx509/cert.c if (strcasecmp(&n->u.dNSName[lenn - lenc], c->u.dNSName) != 0)
n 1711 source4/heimdal/lib/hx509/cert.c if (lenc != lenn && n->u.dNSName[lenn - lenc - 1] != '.')
n 1727 source4/heimdal/lib/hx509/cert.c n_name.element = n->u.directoryName.element;
n 1728 source4/heimdal/lib/hx509/cert.c n_name.u.rdnSequence = n->u.directoryName.u.rdnSequence;
n 1744 source4/heimdal/lib/hx509/cert.c match_alt_name(const GeneralName *n, const Certificate *c,
n 1760 source4/heimdal/lib/hx509/cert.c if (n->element == sa.val[j].element) {
n 1762 source4/heimdal/lib/hx509/cert.c ret = match_general_name(n, &sa.val[j], match);
n 2491 source4/heimdal/lib/hx509/cert.c PKCS9_friendlyName n;
n 2512 source4/heimdal/lib/hx509/cert.c ret = decode_PKCS9_friendlyName(a->data.data, a->data.length, &n, &sz);
n 2516 source4/heimdal/lib/hx509/cert.c if (n.len != 1) {
n 2517 source4/heimdal/lib/hx509/cert.c free_PKCS9_friendlyName(&n);
n 2521 source4/heimdal/lib/hx509/cert.c cert->friendlyname = malloc(n.val[0].length + 1);
n 2523 source4/heimdal/lib/hx509/cert.c free_PKCS9_friendlyName(&n);
n 2527 source4/heimdal/lib/hx509/cert.c for (i = 0; i < n.val[0].length; i++) {
n 2528 source4/heimdal/lib/hx509/cert.c if (n.val[0].data[i] <= 0xff)
n 2529 source4/heimdal/lib/hx509/cert.c cert->friendlyname[i] = n.val[0].data[i] & 0xff;
n 2534 source4/heimdal/lib/hx509/cert.c free_PKCS9_friendlyName(&n);
n 225 source4/heimdal/lib/hx509/crypto.c rsa->n = heim_int2BN(&pk.modulus);
n 230 source4/heimdal/lib/hx509/crypto.c if (rsa->n == NULL || rsa->e == NULL) {
n 549 source4/heimdal/lib/hx509/crypto.c return BN_dup(key->private_key.rsa->n);
n 1189 source4/heimdal/lib/hx509/crypto.c rsa->n = heim_int2BN(&pk.modulus);
n 1194 source4/heimdal/lib/hx509/crypto.c if (rsa->n == NULL || rsa->e == NULL) {
n 2501 source4/heimdal/lib/hx509/crypto.c rsa->n = heim_int2BN(&pk.modulus);
n 2513 source4/heimdal/lib/hx509/crypto.c if (rsa->n == NULL || rsa->e == NULL ||
n 60 source4/heimdal/lib/hx509/env.c hx509_env n;
n 62 source4/heimdal/lib/hx509/env.c n = malloc(sizeof(*n));
n 63 source4/heimdal/lib/hx509/env.c if (n == NULL) {
n 68 source4/heimdal/lib/hx509/env.c n->type = env_string;
n 69 source4/heimdal/lib/hx509/env.c n->next = NULL;
n 70 source4/heimdal/lib/hx509/env.c n->name = strdup(key);
n 71 source4/heimdal/lib/hx509/env.c if (n->name == NULL) {
n 72 source4/heimdal/lib/hx509/env.c free(n);
n 75 source4/heimdal/lib/hx509/env.c n->u.string = strdup(value);
n 76 source4/heimdal/lib/hx509/env.c if (n->u.string == NULL) {
n 77 source4/heimdal/lib/hx509/env.c free(n->name);
n 78 source4/heimdal/lib/hx509/env.c free(n);
n 87 source4/heimdal/lib/hx509/env.c e->next = n;
n 89 source4/heimdal/lib/hx509/env.c *env = n;
n 111 source4/heimdal/lib/hx509/env.c hx509_env n;
n 113 source4/heimdal/lib/hx509/env.c n = malloc(sizeof(*n));
n 114 source4/heimdal/lib/hx509/env.c if (n == NULL) {
n 119 source4/heimdal/lib/hx509/env.c n->type = env_list;
n 120 source4/heimdal/lib/hx509/env.c n->next = NULL;
n 121 source4/heimdal/lib/hx509/env.c n->name = strdup(key);
n 122 source4/heimdal/lib/hx509/env.c if (n->name == NULL) {
n 123 source4/heimdal/lib/hx509/env.c free(n);
n 126 source4/heimdal/lib/hx509/env.c n->u.list = list;
n 133 source4/heimdal/lib/hx509/env.c e->next = n;
n 135 source4/heimdal/lib/hx509/env.c *env = n;
n 386 source4/heimdal/lib/hx509/keyset.c hx509_name n;
n 391 source4/heimdal/lib/hx509/keyset.c _hx509_name_from_Name(&cert->tbsCertificate.subject, &n);
n 392 source4/heimdal/lib/hx509/keyset.c hx509_name_to_string(n, &s);
n 393 source4/heimdal/lib/hx509/keyset.c hx509_name_free(&n);
n 394 source4/heimdal/lib/hx509/keyset.c _hx509_name_from_Name(&cert->tbsCertificate.issuer, &n);
n 395 source4/heimdal/lib/hx509/keyset.c hx509_name_to_string(n, &i);
n 396 source4/heimdal/lib/hx509/keyset.c hx509_name_free(&n);
n 225 source4/heimdal/lib/hx509/ks_keychain.c rsa->n = BN_new();
n 226 source4/heimdal/lib/hx509/ks_keychain.c if (rsa->n == NULL) abort();
n 238 source4/heimdal/lib/hx509/ks_keychain.c BN_bin2bn(data, kc->keysize, rsa->n);
n 630 source4/heimdal/lib/hx509/ks_p11.c rsa->n = getattr_bn(p, slot, session, object, CKA_MODULUS);
n 1127 source4/heimdal/lib/hx509/ks_p11.c #define MECHNAME(s,n) case s: mechname = n; break
n 65 source4/heimdal/lib/hx509/name.c const char *n;
n 149 source4/heimdal/lib/hx509/name.c return strdup(no[i].n);
n 165 source4/heimdal/lib/hx509/name.c if (strncasecmp(no[i].n, name, len) == 0)
n 197 source4/heimdal/lib/hx509/name.c _hx509_Name_to_string(const Name *n, char **str)
n 206 source4/heimdal/lib/hx509/name.c for (i = n->u.rdnSequence.len - 1 ; i >= 0 ; i--) {
n 209 source4/heimdal/lib/hx509/name.c for (j = 0; j < n->u.rdnSequence.val[i].len; j++) {
n 210 source4/heimdal/lib/hx509/name.c DirectoryString *ds = &n->u.rdnSequence.val[i].val[j].value;
n 214 source4/heimdal/lib/hx509/name.c oidname = oidtostring(&n->u.rdnSequence.val[i].val[j].type);
n 274 source4/heimdal/lib/hx509/name.c if (j + 1 < n->u.rdnSequence.val[i].len)
n 467 source4/heimdal/lib/hx509/name.c _hx509_name_from_Name(const Name *n, hx509_name *name)
n 473 source4/heimdal/lib/hx509/name.c ret = copy_Name(n, &(*name)->der_name);
n 544 source4/heimdal/lib/hx509/name.c hx509_name n;
n 549 source4/heimdal/lib/hx509/name.c n = calloc(1, sizeof(*n));
n 550 source4/heimdal/lib/hx509/name.c if (n == NULL) {
n 555 source4/heimdal/lib/hx509/name.c n->der_name.element = choice_Name_rdnSequence;
n 614 source4/heimdal/lib/hx509/name.c ret = _hx509_name_modify(context, &n->der_name, 0, &oid, r);
n 623 source4/heimdal/lib/hx509/name.c *name = n;
n 627 source4/heimdal/lib/hx509/name.c hx509_name_free(&n);
n 701 source4/heimdal/lib/hx509/name.c Name *n = &name->der_name;
n 707 source4/heimdal/lib/hx509/name.c if (n->element != choice_Name_rdnSequence) {
n 712 source4/heimdal/lib/hx509/name.c for (i = 0 ; i < n->u.rdnSequence.len; i++) {
n 713 source4/heimdal/lib/hx509/name.c for (j = 0; j < n->u.rdnSequence.val[i].len; j++) {
n 724 source4/heimdal/lib/hx509/name.c DirectoryString *ds = &n->u.rdnSequence.val[i].val[j].value;
n 1102 source4/heimdal/lib/hx509/revoke.c hx509_name n;
n 1104 source4/heimdal/lib/hx509/revoke.c _hx509_name_from_Name(&ocsp.ocsp.tbsResponseData.responderID.u.byName, &n);
n 1105 source4/heimdal/lib/hx509/revoke.c hx509_name_to_string(n, &s);
n 1106 source4/heimdal/lib/hx509/revoke.c hx509_name_free(&n);
n 217 source4/heimdal/lib/hx509/sel-gram.c # define YYID(n) (n)
n 164 source4/heimdal/lib/hx509/sel-lex.c #define YY_LESS_LINENO(n)
n 167 source4/heimdal/lib/hx509/sel-lex.c #define yyless(n) \
n 171 source4/heimdal/lib/hx509/sel-lex.c int yyless_macro_arg = (n); \
n 612 source4/heimdal/lib/hx509/sel-lex.c int n; \
n 613 source4/heimdal/lib/hx509/sel-lex.c for ( n = 0; n < max_size && \
n 614 source4/heimdal/lib/hx509/sel-lex.c (c = getc( yyin )) != EOF && c != '\n'; ++n ) \
n 615 source4/heimdal/lib/hx509/sel-lex.c buf[n] = (char) c; \
n 617 source4/heimdal/lib/hx509/sel-lex.c buf[n++] = (char) c; \
n 620 source4/heimdal/lib/hx509/sel-lex.c result = n; \
n 1611 source4/heimdal/lib/hx509/sel-lex.c yy_size_t n;
n 1615 source4/heimdal/lib/hx509/sel-lex.c n = _yybytes_len + 2;
n 1616 source4/heimdal/lib/hx509/sel-lex.c buf = (char *) yyalloc(n );
n 1625 source4/heimdal/lib/hx509/sel-lex.c b = yy_scan_buffer(buf,n );
n 1650 source4/heimdal/lib/hx509/sel-lex.c #define yyless(n) \
n 1654 source4/heimdal/lib/hx509/sel-lex.c int yyless_macro_arg = (n); \
n 1799 source4/heimdal/lib/hx509/sel-lex.c static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
n 1802 source4/heimdal/lib/hx509/sel-lex.c for ( i = 0; i < n; ++i )
n 1810 source4/heimdal/lib/hx509/sel-lex.c register int n;
n 1811 source4/heimdal/lib/hx509/sel-lex.c for ( n = 0; s[n]; ++n )
n 1814 source4/heimdal/lib/hx509/sel-lex.c return n;
n 1886 source4/heimdal/lib/hx509/sel-lex.c int n;
n 1888 source4/heimdal/lib/hx509/sel-lex.c n = _hx509_expr_input.length - _hx509_expr_input.offset;
n 1889 source4/heimdal/lib/hx509/sel-lex.c if (max_size < n)
n 1890 source4/heimdal/lib/hx509/sel-lex.c n = max_size;
n 1891 source4/heimdal/lib/hx509/sel-lex.c if (n <= 0)
n 1894 source4/heimdal/lib/hx509/sel-lex.c memcpy(buf, _hx509_expr_input.buf + _hx509_expr_input.offset, n);
n 1895 source4/heimdal/lib/hx509/sel-lex.c _hx509_expr_input.offset += n;
n 1897 source4/heimdal/lib/hx509/sel-lex.c return n;
n 40 source4/heimdal/lib/hx509/test_name.c hx509_name n;
n 44 source4/heimdal/lib/hx509/test_name.c ret = hx509_parse_name(context, name, &n);
n 48 source4/heimdal/lib/hx509/test_name.c ret = hx509_name_to_string(n, &s);
n 55 source4/heimdal/lib/hx509/test_name.c hx509_name_free(&n);
n 64 source4/heimdal/lib/hx509/test_name.c hx509_name n;
n 66 source4/heimdal/lib/hx509/test_name.c if (hx509_parse_name(context, name, &n) == HX509_NAME_MALFORMED)
n 68 source4/heimdal/lib/hx509/test_name.c hx509_name_free(&n);
n 76 source4/heimdal/lib/hx509/test_name.c hx509_name n;
n 82 source4/heimdal/lib/hx509/test_name.c ret = hx509_parse_name(context, name, &n);
n 86 source4/heimdal/lib/hx509/test_name.c ret = hx509_name_expand(context, n, env);
n 91 source4/heimdal/lib/hx509/test_name.c ret = hx509_name_to_string(n, &s);
n 92 source4/heimdal/lib/hx509/test_name.c hx509_name_free(&n);
n 1095 source4/heimdal/lib/krb5/addr_families.c int i, n;
n 1129 source4/heimdal/lib/krb5/addr_families.c n = 0;
n 1131 source4/heimdal/lib/krb5/addr_families.c ++n;
n 1133 source4/heimdal/lib/krb5/addr_families.c ALLOC_SEQ(addresses, n);
n 700 source4/heimdal/lib/krb5/context.c int i, n = 0;
n 707 source4/heimdal/lib/krb5/context.c ep = realloc(e, (n + 2) * sizeof(*e));
n 714 source4/heimdal/lib/krb5/context.c e[n] = p[i];
n 715 source4/heimdal/lib/krb5/context.c e[n + 1] = ETYPE_NULL;
n 716 source4/heimdal/lib/krb5/context.c n++;
n 56 source4/heimdal/lib/krb5/copy_host_realm.c unsigned int n, i;
n 59 source4/heimdal/lib/krb5/copy_host_realm.c for (n = 1, p = from; *p != NULL; ++p)
n 60 source4/heimdal/lib/krb5/copy_host_realm.c ++n;
n 62 source4/heimdal/lib/krb5/copy_host_realm.c *to = calloc (n, sizeof(**to));
n 4614 source4/heimdal/lib/krb5/crypto.c unsigned int i, n;
n 4620 source4/heimdal/lib/krb5/crypto.c for (n = 0; context->etypes_des[n]; ++n)
n 4622 source4/heimdal/lib/krb5/crypto.c ret = malloc (n * sizeof(*ret));
n 4623 source4/heimdal/lib/krb5/crypto.c if (ret == NULL && n != 0) {
n 4627 source4/heimdal/lib/krb5/crypto.c for (i = 0; i < n; ++i)
n 4629 source4/heimdal/lib/krb5/crypto.c *len = n;
n 4689 source4/heimdal/lib/krb5/crypto.c unsigned n = 0;
n 4695 source4/heimdal/lib/krb5/crypto.c ++n;
n 4697 source4/heimdal/lib/krb5/crypto.c ret = malloc(n * sizeof(*ret));
n 4698 source4/heimdal/lib/krb5/crypto.c if (ret == NULL && n != 0) {
n 4702 source4/heimdal/lib/krb5/crypto.c n = 0;
n 4706 source4/heimdal/lib/krb5/crypto.c ret[n++] = etypes[i]->type;
n 4708 source4/heimdal/lib/krb5/crypto.c *len = n;
n 44 source4/heimdal/lib/krb5/get_for_creds.c unsigned n, i;
n 48 source4/heimdal/lib/krb5/get_for_creds.c n = 0;
n 50 source4/heimdal/lib/krb5/get_for_creds.c ++n;
n 52 source4/heimdal/lib/krb5/get_for_creds.c tmp = realloc(addr->val, (addr->len + n) * sizeof(*addr->val));
n 53 source4/heimdal/lib/krb5/get_for_creds.c if (tmp == NULL && (addr->len + n) != 0) {
n 59 source4/heimdal/lib/krb5/get_for_creds.c for (i = addr->len; i < (addr->len + n); ++i) {
n 58 source4/heimdal/lib/krb5/get_host_realm.c unsigned int n, i;
n 60 source4/heimdal/lib/krb5/get_host_realm.c for(n = 0, rr = head; rr; rr = rr->next)
n 62 source4/heimdal/lib/krb5/get_host_realm.c ++n;
n 64 source4/heimdal/lib/krb5/get_host_realm.c if (n == 0)
n 67 source4/heimdal/lib/krb5/get_host_realm.c *realms = malloc ((n + 1) * sizeof(krb5_realm));
n 71 source4/heimdal/lib/krb5/get_host_realm.c for (i = 0; i < n + 1; ++i)
n 80 source4/heimdal/lib/krb5/get_host_realm.c for (i = 0; i < n; ++i)
n 267 source4/heimdal/lib/krb5/log.c int min = 0, max = -1, n;
n 271 source4/heimdal/lib/krb5/log.c n = sscanf(p, "%d%c%d/", &min, &c, &max);
n 272 source4/heimdal/lib/krb5/log.c if(n == 2){
n 282 source4/heimdal/lib/krb5/log.c if(n){
n 194 source4/heimdal/lib/krb5/mcache.c krb5_mcache **n, *m = MCACHE(id);
n 204 source4/heimdal/lib/krb5/mcache.c for(n = &mcc_head; n && *n; n = &(*n)->next) {
n 205 source4/heimdal/lib/krb5/mcache.c if(m == *n) {
n 206 source4/heimdal/lib/krb5/mcache.c *n = m->next;
n 419 source4/heimdal/lib/krb5/mcache.c krb5_mcache **n;
n 424 source4/heimdal/lib/krb5/mcache.c for(n = &mcc_head; n && *n; n = &(*n)->next) {
n 425 source4/heimdal/lib/krb5/mcache.c if(mfrom == *n) {
n 426 source4/heimdal/lib/krb5/mcache.c *n = mfrom->next;
n 1888 source4/heimdal/lib/krb5/pkinit.c int lineno = 0, n = 0;
n 1905 source4/heimdal/lib/krb5/pkinit.c n++;
n 1913 source4/heimdal/lib/krb5/pkinit.c n++;
n 1932 source4/heimdal/lib/krb5/pkinit.c m2 = realloc(m, (n + 2) * sizeof(m[0]));
n 1941 source4/heimdal/lib/krb5/pkinit.c m[n] = NULL;
n 1951 source4/heimdal/lib/krb5/pkinit.c m[n] = element;
n 1952 source4/heimdal/lib/krb5/pkinit.c m[n + 1] = NULL;
n 1953 source4/heimdal/lib/krb5/pkinit.c n++;
n 157 source4/heimdal/lib/krb5/principal.c int n;
n 201 source4/heimdal/lib/krb5/principal.c n = 0;
n 237 source4/heimdal/lib/krb5/principal.c comp[n] = malloc(q - start + 1);
n 238 source4/heimdal/lib/krb5/principal.c if (comp[n] == NULL) {
n 244 source4/heimdal/lib/krb5/principal.c memcpy(comp[n], start, q - start);
n 245 source4/heimdal/lib/krb5/principal.c comp[n][q - start] = 0;
n 246 source4/heimdal/lib/krb5/principal.c n++;
n 293 source4/heimdal/lib/krb5/principal.c comp[n] = malloc(q - start + 1);
n 294 source4/heimdal/lib/krb5/principal.c if (comp[n] == NULL) {
n 300 source4/heimdal/lib/krb5/principal.c memcpy(comp[n], start, q - start);
n 301 source4/heimdal/lib/krb5/principal.c comp[n][q - start] = 0;
n 302 source4/heimdal/lib/krb5/principal.c n++;
n 316 source4/heimdal/lib/krb5/principal.c princ_num_comp(*principal) = n;
n 321 source4/heimdal/lib/krb5/principal.c while(n>0){
n 322 source4/heimdal/lib/krb5/principal.c free(comp[--n]);
n 1215 source4/heimdal/lib/krb5/principal.c const char *n, *i, *r;
n 1224 source4/heimdal/lib/krb5/principal.c n = principal->name.name_string.val[0];
n 1228 source4/heimdal/lib/krb5/principal.c n = principal->name.name_string.val[0];
n 1241 source4/heimdal/lib/krb5/principal.c int t = name_convert(context, n, r, &tmp);
n 1244 source4/heimdal/lib/krb5/principal.c n = tmp;
n 1258 source4/heimdal/lib/krb5/principal.c if (strlcpy (name, n, aname_sz) >= aname_sz) {
n 532 source4/heimdal/lib/krb5/v4_glue.c int n,
n 554 source4/heimdal/lib/krb5/v4_glue.c RCHECK(ret, krb5_store_int8(sp, n), error);
n 50 source4/heimdal/lib/roken/copyhostent.c int i, n;
n 65 source4/heimdal/lib/roken/copyhostent.c for (n = 0, p = h->h_aliases; *p != NULL; ++p)
n 66 source4/heimdal/lib/roken/copyhostent.c ++n;
n 67 source4/heimdal/lib/roken/copyhostent.c res->h_aliases = malloc ((n + 1) * sizeof(*res->h_aliases));
n 72 source4/heimdal/lib/roken/copyhostent.c for (i = 0; i < n + 1; ++i)
n 74 source4/heimdal/lib/roken/copyhostent.c for (i = 0; i < n; ++i) {
n 82 source4/heimdal/lib/roken/copyhostent.c for (n = 0, p = h->h_addr_list; *p != NULL; ++p)
n 83 source4/heimdal/lib/roken/copyhostent.c ++n;
n 84 source4/heimdal/lib/roken/copyhostent.c res->h_addr_list = malloc ((n + 1) * sizeof(*res->h_addr_list));
n 89 source4/heimdal/lib/roken/copyhostent.c for (i = 0; i < n + 1; ++i) {
n 92 source4/heimdal/lib/roken/copyhostent.c for (i = 0; i < n; ++i) {
n 59 source4/heimdal/lib/roken/inet_ntop.c int n = (a >> (24 - i * 8)) & 0xFF;
n 62 source4/heimdal/lib/roken/inet_ntop.c if (non_zerop || n / 100 > 0) {
n 63 source4/heimdal/lib/roken/inet_ntop.c *dst++ = digits[n / 100];
n 64 source4/heimdal/lib/roken/inet_ntop.c n %= 100;
n 67 source4/heimdal/lib/roken/inet_ntop.c if (non_zerop || n / 10 > 0) {
n 68 source4/heimdal/lib/roken/inet_ntop.c *dst++ = digits[n / 10];
n 69 source4/heimdal/lib/roken/inet_ntop.c n %= 10;
n 72 source4/heimdal/lib/roken/inet_ntop.c *dst++ = digits[n];
n 144 source4/heimdal/lib/roken/roken_gethostby.c int n;
n 170 source4/heimdal/lib/roken/roken_gethostby.c n = read(s, buf + offset, sizeof(buf) - offset);
n 171 source4/heimdal/lib/roken/roken_gethostby.c if(n <= 0)
n 173 source4/heimdal/lib/roken/roken_gethostby.c offset += n;
n 200 source4/heimdal/lib/wind/normalize.c unsigned n = 0;
n 210 source4/heimdal/lib/wind/normalize.c if (n % 5 == 0) {
n 224 source4/heimdal/lib/wind/normalize.c ++n;
n 631 source4/lib/ldb/common/ldb.c int n;
n 658 source4/lib/ldb/common/ldb.c for (n = 0; res->refs[n]; n++) /*noop*/ ;
n 660 source4/lib/ldb/common/ldb.c n = 0;
n 663 source4/lib/ldb/common/ldb.c res->refs = talloc_realloc(res, res->refs, char *, n + 2);
n 668 source4/lib/ldb/common/ldb.c res->refs[n] = talloc_move(res->refs, &ares->referral);
n 669 source4/lib/ldb/common/ldb.c res->refs[n + 1] = NULL;
n 52 source4/lib/ldb/common/ldb_attributes.c int i, n;
n 59 source4/lib/ldb/common/ldb_attributes.c n = ldb->schema.num_attributes + 1;
n 62 source4/lib/ldb/common/ldb_attributes.c struct ldb_schema_attribute, n);
n 237 source4/lib/ldb/common/ldb_attributes.c int n;
n 244 source4/lib/ldb/common/ldb_attributes.c n = ldb->schema.num_dn_extended_syntax + 1;
n 247 source4/lib/ldb/common/ldb_attributes.c struct ldb_dn_extended_syntax, n);
n 256 source4/lib/ldb/common/ldb_attributes.c ldb->schema.num_dn_extended_syntax = n;
n 128 source4/lib/ldb/common/ldb_controls.c unsigned n;
n 132 source4/lib/ldb/common/ldb_controls.c for (n=0; req->controls && req->controls[n];) { n++; }
n 136 source4/lib/ldb/common/ldb_controls.c n + 2);
n 139 source4/lib/ldb/common/ldb_controls.c ctrls[n] = NULL;
n 140 source4/lib/ldb/common/ldb_controls.c ctrls[n+1] = NULL;
n 150 source4/lib/ldb/common/ldb_controls.c ctrls[n] = ctrl;
n 660 source4/lib/ldb/common/ldb_dn.c char *d, *n;
n 691 source4/lib/ldb/common/ldb_dn.c n = dn->components[i].name;
n 692 source4/lib/ldb/common/ldb_dn.c while (*n) *d++ = *n++;
n 833 source4/lib/ldb/common/ldb_dn.c char *d, *n;
n 873 source4/lib/ldb/common/ldb_dn.c n = dn->components[i].cf_name;
n 874 source4/lib/ldb/common/ldb_dn.c while (*n) *d++ = *n++;
n 1310 source4/lib/ldb/common/ldb_dn.c int n, i, j;
n 1323 source4/lib/ldb/common/ldb_dn.c n = dn->comp_num + child->comp_num;
n 1328 source4/lib/ldb/common/ldb_dn.c n);
n 1334 source4/lib/ldb/common/ldb_dn.c for (i = dn->comp_num - 1, j = n - 1; i >= 0; i--, j--) {
n 1346 source4/lib/ldb/common/ldb_dn.c dn->comp_num = n;
n 1639 source4/lib/ldb/common/ldb_dn.c char *n;
n 1650 source4/lib/ldb/common/ldb_dn.c n = talloc_strdup(dn, name);
n 1651 source4/lib/ldb/common/ldb_dn.c if ( ! n) {
n 1658 source4/lib/ldb/common/ldb_dn.c talloc_free(n);
n 1664 source4/lib/ldb/common/ldb_dn.c dn->components[num].name = n;
n 110 source4/lib/ldb/common/ldb_ldif.c int bit_offset=0, byte_offset, idx, i, n;
n 114 source4/lib/ldb/common/ldb_ldif.c n=i=0;
n 123 source4/lib/ldb/common/ldb_ldif.c n = byte_offset+1;
n 128 source4/lib/ldb/common/ldb_ldif.c n = byte_offset+2;
n 133 source4/lib/ldb/common/ldb_ldif.c n--;
n 144 source4/lib/ldb/common/ldb_ldif.c d[n] = 0;
n 145 source4/lib/ldb/common/ldb_ldif.c return n;
n 741 source4/lib/ldb/common/ldb_msg.c int n = (el - msg->elements);
n 742 source4/lib/ldb/common/ldb_msg.c if (n != msg->num_elements-1) {
n 743 source4/lib/ldb/common/ldb_msg.c memmove(el, el+1, ((msg->num_elements-1) - n)*sizeof(*el));
n 56 source4/lib/ldb/common/ldb_utf8.c char *ldb_casefold_default(void *context, void *mem_ctx, const char *s, size_t n)
n 59 source4/lib/ldb/common/ldb_utf8.c char *ret = talloc_strndup(mem_ctx, s, n);
n 75 source4/lib/ldb/common/ldb_utf8.c char *ldb_casefold(struct ldb_context *ldb, void *mem_ctx, const char *s, size_t n)
n 77 source4/lib/ldb/common/ldb_utf8.c return ldb->utf8_fns.casefold(ldb->utf8_fns.context, mem_ctx, s, n);
n 210 source4/lib/ldb/include/ldb.h char *(*casefold)(void *context, TALLOC_CTX *mem_ctx, const char *s, size_t n);
n 1290 source4/lib/ldb/include/ldb.h char *ldb_casefold(struct ldb_context *ldb, TALLOC_CTX *mem_ctx, const char *s, size_t n);
n 1747 source4/lib/ldb/include/ldb.h char *(*casefold)(void *, void *, const char *, size_t n));
n 151 source4/lib/ldb/include/ldb_private.h char *ldb_casefold_default(void *context, void *mem_ctx, const char *s, size_t n);
n 118 source4/lib/ldb/ldb_ildap/ldb_ildap.c int n = 0;
n 131 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n] = talloc(mods, struct ldap_mod);
n 132 source4/lib/ldb/ldb_ildap/ldb_ildap.c if (!mods[n]) {
n 135 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n + 1] = NULL;
n 136 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = 0;
n 137 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->attrib = *el;
n 141 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = LDAP_MODIFY_ADD;
n 144 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = LDAP_MODIFY_DELETE;
n 147 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods[n]->type = LDAP_MODIFY_REPLACE;
n 151 source4/lib/ldb/ldb_ildap/ldb_ildap.c n++;
n 154 source4/lib/ldb/ldb_ildap/ldb_ildap.c *num_mods = n;
n 424 source4/lib/ldb/ldb_ildap/ldb_ildap.c int n;
n 469 source4/lib/ldb/ldb_ildap/ldb_ildap.c for (n = 0; req->op.search.attrs && req->op.search.attrs[n]; n++) /* noop */ ;
n 470 source4/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.SearchRequest.num_attributes = n;
n 485 source4/lib/ldb/ldb_ildap/ldb_ildap.c int i,n;
n 500 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods = ildb_msg_to_mods(msg, &n, req->op.add.message, 0);
n 506 source4/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.AddRequest.num_attributes = n;
n 507 source4/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.AddRequest.attributes = talloc_array(msg, struct ldb_message_element, n);
n 513 source4/lib/ldb/ldb_ildap/ldb_ildap.c for (i = 0; i < n; i++) {
n 528 source4/lib/ldb/ldb_ildap/ldb_ildap.c int i,n;
n 543 source4/lib/ldb/ldb_ildap/ldb_ildap.c mods = ildb_msg_to_mods(msg, &n, req->op.mod.message, 1);
n 549 source4/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.ModifyRequest.num_mods = n;
n 550 source4/lib/ldb/ldb_ildap/ldb_ildap.c msg->r.ModifyRequest.mods = talloc_array(msg, struct ldap_mod, n);
n 556 source4/lib/ldb/ldb_ildap/ldb_ildap.c for (i = 0; i < n; i++) {
n 32 source4/lib/ldb_wrap.h char *wrap_casefold(void *context, void *mem_ctx, const char *s, size_t n);
n 103 source4/lib/registry/rpc.c int n;
n 109 source4/lib/registry/rpc.c for(n = 0; known_hives[n].hkey; n++) {
n 110 source4/lib/registry/rpc.c if(known_hives[n].hkey == hkey_type)
n 114 source4/lib/registry/rpc.c if (known_hives[n].open == NULL) {
n 125 source4/lib/registry/rpc.c return known_hives[n].open(mykeydata->pipe, mykeydata, &(mykeydata->pol));
n 189 source4/lib/registry/rpc.c uint32_t n,
n 213 source4/lib/registry/rpc.c r.in.enum_index = n;
n 288 source4/lib/registry/rpc.c uint32_t n,
n 306 source4/lib/registry/rpc.c r.in.enum_index = n;
n 209 source4/lib/registry/util.c const char *n;
n 217 source4/lib/registry/util.c error = get_abs_parent(mem_ctx, ctx, path, &parent, &n);
n 219 source4/lib/registry/util.c error = reg_key_del(parent, n);
n 233 source4/lib/registry/util.c const char *n;
n 240 source4/lib/registry/util.c error = get_abs_parent(mem_ctx, ctx, path, &parent, &n);
n 247 source4/lib/registry/util.c error = reg_key_add_name(mem_ctx, parent, n, NULL, sec_desc, result);
n 250 source4/lib/socket/interface.c const char *iface_n_ip(struct interface *ifaces, int n)
n 254 source4/lib/socket/interface.c for (i=ifaces;i && n;i=i->next)
n 255 source4/lib/socket/interface.c n--;
n 266 source4/lib/socket/interface.c const char *iface_n_bcast(struct interface *ifaces, int n)
n 270 source4/lib/socket/interface.c for (i=ifaces;i && n;i=i->next)
n 271 source4/lib/socket/interface.c n--;
n 282 source4/lib/socket/interface.c const char *iface_n_netmask(struct interface *ifaces, int n)
n 286 source4/lib/socket/interface.c for (i=ifaces;i && n;i=i->next)
n 287 source4/lib/socket/interface.c n--;
n 30 source4/lib/tdr/tdr.c #define TDR_PUSH_NEED_BYTES(tdr, n) TDR_CHECK(tdr_push_expand(tdr, tdr->data.length+(n)))
n 32 source4/lib/tdr/tdr.c #define TDR_PULL_NEED_BYTES(tdr, n) do { \
n 33 source4/lib/tdr/tdr.c if ((n) > tdr->data.length || tdr->offset + (n) > tdr->data.length) { \
n 285 source4/lib/tdr/tdr.c #define TDR_ALIGN(l,n) (((l) & ((n)-1)) == 0?0:((n)-((l)&((n)-1))))
n 57 source4/lib/tdr/tdr.h #define TDR_ALLOC(ctx, s, n) do { \
n 58 source4/lib/tdr/tdr.h (s) = talloc_array_size(ctx, sizeof(*(s)), n); \
n 59 source4/lib/tdr/tdr.h if ((n) && !(s)) return NT_STATUS_NO_MEMORY; \
n 400 source4/lib/wmi/wbemdata.c int n;
n 410 source4/lib/wmi/wbemdata.c n = 1;
n 416 source4/lib/wmi/wbemdata.c iref[n].ipid = IUnknown_ipid(ecod->pFSE);
n 417 source4/lib/wmi/wbemdata.c iref[n].cPublicRefs = 5;
n 418 source4/lib/wmi/wbemdata.c iref[n].cPrivateRefs = 0;
n 419 source4/lib/wmi/wbemdata.c ++n;
n 423 source4/lib/wmi/wbemdata.c iref[n].ipid = IUnknown_ipid(ecod->pSE);
n 424 source4/lib/wmi/wbemdata.c iref[n].cPublicRefs = 5;
n 425 source4/lib/wmi/wbemdata.c iref[n].cPrivateRefs = 0;
n 426 source4/lib/wmi/wbemdata.c ++n;
n 429 source4/lib/wmi/wbemdata.c cr = IRemUnknown_RemRelease_send(ox->rem_unknown, mem_ctx, n, iref);
n 4072 source4/lib/wmi/wmi_wrap.c swig_globalvar *n = var->next;
n 4075 source4/lib/wmi/wmi_wrap.c var = n;
n 4080 source4/lib/wmi/wmi_wrap.c swig_varlink_getattr(swig_varlinkobject *v, char *n) {
n 4084 source4/lib/wmi/wmi_wrap.c if (strcmp(var->name,n) == 0) {
n 4097 source4/lib/wmi/wmi_wrap.c swig_varlink_setattr(swig_varlinkobject *v, char *n, PyObject *p) {
n 4101 source4/lib/wmi/wmi_wrap.c if (strcmp(var->name,n) == 0) {
n 148 source4/libcli/auth/smbdes.c static void permute(char *out, const char *in, const uint8_t *p, int n)
n 151 source4/libcli/auth/smbdes.c for (i=0;i<n;i++)
n 155 source4/libcli/auth/smbdes.c static void lshift(char *d, int count, int n)
n 159 source4/libcli/auth/smbdes.c for (i=0;i<n;i++)
n 160 source4/libcli/auth/smbdes.c out[i] = d[(i+count)%n];
n 161 source4/libcli/auth/smbdes.c for (i=0;i<n;i++)
n 173 source4/libcli/auth/smbdes.c static void xor(char *out, char *in1, char *in2, int n)
n 176 source4/libcli/auth/smbdes.c for (i=0;i<n;i++)
n 231 source4/libcli/auth/smbdes.c int m, n;
n 234 source4/libcli/auth/smbdes.c n = (b[j][1]<<3) | (b[j][2]<<2) | (b[j][3]<<1) | b[j][4];
n 237 source4/libcli/auth/smbdes.c b[j][k] = (sbox[j][m][n] & (1<<(3-k)))?1:0;
n 37 source4/libcli/clideltree.c char *s, *n;
n 42 source4/libcli/clideltree.c n = strdup(name);
n 43 source4/libcli/clideltree.c n[strlen(n)-1] = 0;
n 44 source4/libcli/clideltree.c asprintf(&s, "%s%s", n, finfo->name);
n 76 source4/libcli/clideltree.c free(n);
n 769 source4/libcli/ldap/ldap_client.c _PUBLIC_ NTSTATUS ldap_result_n(struct ldap_request *req, int n, struct ldap_message **msg)
n 775 source4/libcli/ldap/ldap_client.c while (req->state < LDAP_REQUEST_DONE && n >= req->num_replies) {
n 781 source4/libcli/ldap/ldap_client.c if (n < req->num_replies) {
n 782 source4/libcli/ldap/ldap_client.c *msg = req->replies[n];
n 117 source4/libcli/ldap/ldap_client.h NTSTATUS ldap_result_n(struct ldap_request *req, int n, struct ldap_message **msg);
n 50 source4/libcli/ldap/ldap_ildap.c int n, i;
n 61 source4/libcli/ldap/ldap_ildap.c for (n=0;attrs && attrs[n];n++) /* noop */ ;
n 71 source4/libcli/ldap/ldap_ildap.c msg->r.SearchRequest.num_attributes = n;
n 78 source4/libcli/ldap/ldap_ildap.c for (i=n=0;true;i++) {
n 95 source4/libcli/ldap/ldap_ildap.c (*results) = talloc_realloc(conn, *results, struct ldap_message *, n+2);
n 100 source4/libcli/ldap/ldap_ildap.c (*results)[n] = talloc_steal(*results, res);
n 101 source4/libcli/ldap/ldap_ildap.c (*results)[n+1] = NULL;
n 102 source4/libcli/ldap/ldap_ildap.c n++;
n 170 source4/libcli/raw/raweas.c int n;
n 183 source4/libcli/raw/raweas.c n = 0;
n 194 source4/libcli/raw/raweas.c *eas = talloc_realloc(mem_ctx, *eas, struct ea_struct, n+1);
n 197 source4/libcli/raw/raweas.c len = ea_pull_struct(&blob2, mem_ctx, &(*eas)[n]);
n 203 source4/libcli/raw/raweas.c n++;
n 206 source4/libcli/raw/raweas.c *num_eas = n;
n 219 source4/libcli/raw/raweas.c int n;
n 227 source4/libcli/raw/raweas.c n = 0;
n 239 source4/libcli/raw/raweas.c *eas = talloc_realloc(mem_ctx, *eas, struct ea_struct, n+1);
n 242 source4/libcli/raw/raweas.c len = ea_pull_struct(&blob2, mem_ctx, &(*eas)[n]);
n 252 source4/libcli/raw/raweas.c n++;
n 256 source4/libcli/raw/raweas.c *num_eas = n;
n 295 source4/libcli/raw/raweas.c int n;
n 308 source4/libcli/raw/raweas.c n = 0;
n 319 source4/libcli/raw/raweas.c *ea_names = talloc_realloc(mem_ctx, *ea_names, struct ea_name, n+1);
n 322 source4/libcli/raw/raweas.c len = ea_pull_name(&blob2, mem_ctx, &(*ea_names)[n]);
n 328 source4/libcli/raw/raweas.c n++;
n 331 source4/libcli/raw/raweas.c *num_names = n;
n 50 source4/libcli/raw/rawfileinfo.c uint_t n = io->num_streams;
n 55 source4/libcli/raw/rawfileinfo.c talloc_realloc(mem_ctx, io->streams, struct stream_struct, n+1);
n 60 source4/libcli/raw/rawfileinfo.c io->streams[n].size = BVAL(blob.data, ofs + 0x08);
n 61 source4/libcli/raw/rawfileinfo.c io->streams[n].alloc_size = BVAL(blob.data, ofs + 0x10);
n 71 source4/libcli/raw/rawfileinfo.c io->streams[n].stream_name.s = (const char *)vstr;
n 72 source4/libcli/raw/rawfileinfo.c io->streams[n].stream_name.private_length = nlen;
n 38 source4/libcli/raw/rawsetfileinfo.c #define NEED_BLOB(n) do { \
n 39 source4/libcli/raw/rawsetfileinfo.c *blob = data_blob_talloc(mem_ctx, NULL, n); \
n 40 source4/libcli/raw/rawsetfileinfo.c if (blob->data == NULL && n != 0) return false; \
n 396 source4/libcli/resolve/dns_ex.c char *n;
n 406 source4/libcli/resolve/dns_ex.c n = strrchr(p, '/');
n 407 source4/libcli/resolve/dns_ex.c if (!n) {
n 412 source4/libcli/resolve/dns_ex.c *n = '\0';
n 413 source4/libcli/resolve/dns_ex.c n++;
n 431 source4/libcli/resolve/dns_ex.c state->names[i] = talloc_strdup(state->names, n);
n 30 source4/libcli/resolve/testsuite.c struct nbt_name n;
n 40 source4/libcli/resolve/testsuite.c ZERO_STRUCT(n);
n 41 source4/libcli/resolve/testsuite.c n.name = host;
n 47 source4/libcli/resolve/testsuite.c struct composite_context *c = resolve_name_host_send(mem_ctx, ev, NULL, 0, 0, &n);
n 231 source4/libcli/smb2/request.c size_t smb2_padding_size(uint32_t offset, size_t n)
n 233 source4/libcli/smb2/request.c if ((offset & (n-1)) == 0) return 0;
n 234 source4/libcli/smb2/request.c return n - (offset & (n-1));
n 78 source4/libnet/libnet_samdump.c struct samdump_secret *n = talloc(samdump_state, struct samdump_secret);
n 80 source4/libnet/libnet_samdump.c n->name = talloc_strdup(n, name);
n 81 source4/libnet/libnet_samdump.c n->secret = data_blob_talloc(n, secret->current_cipher.cipher_data, secret->current_cipher.maxlen);
n 82 source4/libnet/libnet_samdump.c n->mtime = secret->current_cipher_set_time;
n 84 source4/libnet/libnet_samdump.c DLIST_ADD(samdump_state->secrets, n);
n 96 source4/libnet/libnet_samdump.c struct samdump_trusted_domain *n = talloc(samdump_state, struct samdump_trusted_domain);
n 98 source4/libnet/libnet_samdump.c n->name = talloc_strdup(n, trusted_domain->domain_name.string);
n 99 source4/libnet/libnet_samdump.c n->sid = talloc_steal(n, dom_sid);
n 101 source4/libnet/libnet_samdump.c DLIST_ADD(samdump_state->trusted_domains, n);
n 75 source4/nbt_server/nodestatus.c struct nbt_status_name *n = &packet->answers[0].rdata.status.names[name_count];
n 76 source4/nbt_server/nodestatus.c n->name = talloc_asprintf(packet->answers, "%-15s", iname->name.name);
n 77 source4/nbt_server/nodestatus.c if (n->name == NULL) goto failed;
n 78 source4/nbt_server/nodestatus.c n->type = iname->name.type;
n 79 source4/nbt_server/nodestatus.c n->nb_flags = iname->nb_flags;
n 156 source4/ntvfs/ntvfs_util.c struct ntvfs_handle_data *d,*n;
n 158 source4/ntvfs/ntvfs_util.c for (d=h->backend_data; d; d = n) {
n 159 source4/ntvfs/ntvfs_util.c n = d->next;
n 117 source4/ntvfs/posix/pvfs_notify.c static int pvfs_notify_destructor(struct pvfs_notify_buffer *n)
n 119 source4/ntvfs/posix/pvfs_notify.c notify_remove(n->f->pvfs->notify_context, n);
n 120 source4/ntvfs/posix/pvfs_notify.c n->f->notify_buffer = NULL;
n 121 source4/ntvfs/posix/pvfs_notify.c pvfs_notify_send(n, NT_STATUS_OK, true);
n 131 source4/ntvfs/posix/pvfs_notify.c struct pvfs_notify_buffer *n = talloc_get_type(private_data, struct pvfs_notify_buffer);
n 136 source4/ntvfs/posix/pvfs_notify.c n2 = talloc_realloc(n, n->changes, struct notify_changes, n->num_changes+1);
n 141 source4/ntvfs/posix/pvfs_notify.c n->changes = n2;
n 143 source4/ntvfs/posix/pvfs_notify.c new_path = talloc_strdup(n->changes, ev->path);
n 149 source4/ntvfs/posix/pvfs_notify.c n->changes[n->num_changes].action = ev->action;
n 150 source4/ntvfs/posix/pvfs_notify.c n->changes[n->num_changes].name.s = new_path;
n 151 source4/ntvfs/posix/pvfs_notify.c n->num_changes++;
n 160 source4/ntvfs/posix/pvfs_notify.c n->current_buffer_size += len;
n 164 source4/ntvfs/posix/pvfs_notify.c pvfs_notify_send(n, NT_STATUS_OK, true);
n 287 source4/param/share_classic.c const char **n;
n 291 source4/param/share_classic.c n = talloc_array(mem_ctx, const char *, num_services);
n 292 source4/param/share_classic.c if (!n) {
n 298 source4/param/share_classic.c n[i] = talloc_strdup(n, lp_servicename(lp_servicebynum((struct loadparm_context *)ctx->priv_data, i)));
n 299 source4/param/share_classic.c if (!n[i]) {
n 301 source4/param/share_classic.c talloc_free(n);
n 306 source4/param/share_classic.c *names = n;
n 164 source4/param/share_ldb.c const char **n;
n 184 source4/param/share_ldb.c n = talloc_array(mem_ctx, const char *, res->count);
n 185 source4/param/share_ldb.c if (!n) {
n 192 source4/param/share_ldb.c n[j] = talloc_strdup(n, ldb_msg_find_attr_as_string(res->msgs[i], "name", NULL));
n 193 source4/param/share_ldb.c if (!n[j]) {
n 200 source4/param/share_ldb.c *names = n;
n 76 source4/rpc_server/winreg/rpc_winreg.c #define func_winreg_OpenHive(k,n) static WERROR dcesrv_winreg_Open ## k (struct dcesrv_call_state *dce_call, TALLOC_CTX *mem_ctx, struct winreg_Open ## k *r) \
n 78 source4/rpc_server/winreg/rpc_winreg.c return dcesrv_winreg_openhive (dce_call, mem_ctx, n, &r->out.handle);\
n 73 source4/torture/basic/misc.c uint_t n = (uint_t)random()%10;
n 80 source4/torture/basic/misc.c asprintf(&fname, "\\torture.%u", n);
n 82 source4/torture/basic/misc.c if (!wait_lock(c, fnum2, n*sizeof(int), sizeof(int))) {
n 129 source4/torture/basic/misc.c if (NT_STATUS_IS_ERR(smbcli_unlock(c->tree, fnum2, n*sizeof(int), sizeof(int)))) {
n 1293 source4/torture/gentest.c int n;
n 1323 source4/torture/gentest.c for (n=0;n<not1.nttrans.out.num_changes;n++) {
n 1324 source4/torture/gentest.c if (not1.nttrans.out.changes[n].action !=
n 1325 source4/torture/gentest.c not2.nttrans.out.changes[n].action) {
n 1326 source4/torture/gentest.c printf("Notify action %d inconsistent %d %d\n", n,
n 1327 source4/torture/gentest.c not1.nttrans.out.changes[n].action,
n 1328 source4/torture/gentest.c not2.nttrans.out.changes[n].action);
n 1332 source4/torture/gentest.c if (strcmp(not1.nttrans.out.changes[n].name.s,
n 1333 source4/torture/gentest.c not2.nttrans.out.changes[n].name.s)) {
n 1334 source4/torture/gentest.c printf("Notify name %d inconsistent %s %s\n", n,
n 1335 source4/torture/gentest.c not1.nttrans.out.changes[n].name.s,
n 1336 source4/torture/gentest.c not2.nttrans.out.changes[n].name.s);
n 1340 source4/torture/gentest.c if (not1.nttrans.out.changes[n].name.private_length !=
n 1341 source4/torture/gentest.c not2.nttrans.out.changes[n].name.private_length) {
n 1342 source4/torture/gentest.c printf("Notify name length %d inconsistent %d %d\n", n,
n 1343 source4/torture/gentest.c not1.nttrans.out.changes[n].name.private_length,
n 1344 source4/torture/gentest.c not2.nttrans.out.changes[n].name.private_length);
n 2076 source4/torture/gentest.c int n, nlocks;
n 2094 source4/torture/gentest.c for (n=0;n<nlocks;n++) {
n 2095 source4/torture/gentest.c parm[0].lockx.in.locks[n].pid = gen_pid();
n 2096 source4/torture/gentest.c parm[0].lockx.in.locks[n].offset = gen_offset();
n 2097 source4/torture/gentest.c parm[0].lockx.in.locks[n].count = gen_io_count();
n 2483 source4/torture/gentest.c int n;
n 2495 source4/torture/gentest.c for (n=0;n<NSERVERS;n++) {
n 2497 source4/torture/gentest.c req = smb_raw_changenotify_send(servers[n].smb_tree[instance], &parm[n]);
n 2659 source4/torture/gentest.c int n;
n 2669 source4/torture/gentest.c for (n=0;n<parm[0].in.lock_count;n++) {
n 2670 source4/torture/gentest.c parm[0].in.locks[n].offset = gen_offset();
n 2671 source4/torture/gentest.c parm[0].in.locks[n].length = gen_io_count();
n 2673 source4/torture/gentest.c parm[0].in.locks[n].flags = gen_lock_flags_smb2() |
n 2675 source4/torture/gentest.c parm[0].in.locks[n].reserved = gen_bits_mask2(0x0, 0xFFFFFFFF);
n 2798 source4/torture/gentest.c int n;
n 2800 source4/torture/gentest.c n = smb2_deltree(servers[i].smb2_tree[0], "gentest");
n 2802 source4/torture/gentest.c n = smbcli_deltree(servers[i].smb_tree[0], "gentest");
n 2804 source4/torture/gentest.c if (n == -1) {
n 2817 source4/torture/gentest.c if (n > 0) {
n 2818 source4/torture/gentest.c printf("Deleted %d files on server %d\n", n, i);
n 386 source4/torture/locktest.c int n)
n 389 source4/torture/locktest.c printf("testing %u ...\n", n);
n 390 source4/torture/locktest.c for (i=0; i<n; i++) {
n 398 source4/torture/locktest.c return n;
n 415 source4/torture/locktest.c int n, i, n1, skip, r1, r2;
n 422 source4/torture/locktest.c for (n=0; n<numops; n++) {
n 424 source4/torture/locktest.c if (n < sizeof(preset) / sizeof(preset[0])) {
n 425 source4/torture/locktest.c recorded[n] = preset[n];
n 428 source4/torture/locktest.c recorded[n].conn = random() % NCONNECTIONS;
n 429 source4/torture/locktest.c recorded[n].f = random() % NFILES;
n 430 source4/torture/locktest.c recorded[n].start = lock_base + ((uint_t)random() % (lock_range-1));
n 431 source4/torture/locktest.c recorded[n].len = min_length +
n 432 source4/torture/locktest.c random() % (lock_range-(recorded[n].start-lock_base));
n 433 source4/torture/locktest.c recorded[n].start *= RANGE_MULTIPLE;
n 434 source4/torture/locktest.c recorded[n].len *= RANGE_MULTIPLE;
n 435 source4/torture/locktest.c recorded[n].pid = random()%3;
n 436 source4/torture/locktest.c if (recorded[n].pid == 2) {
n 437 source4/torture/locktest.c recorded[n].pid = 0xFFFF; /* see if its magic */
n 442 source4/torture/locktest.c recorded[n].lock_type = READ_LOCK;
n 444 source4/torture/locktest.c recorded[n].lock_type = WRITE_LOCK;
n 447 source4/torture/locktest.c recorded[n].lock_op = OP_LOCK;
n 449 source4/torture/locktest.c recorded[n].lock_op = OP_UNLOCK;
n 451 source4/torture/locktest.c recorded[n].lock_op = OP_REOPEN;
n 453 source4/torture/locktest.c recorded[n].needed = true;
n 454 source4/torture/locktest.c if (!zero_zero && recorded[n].start==0 && recorded[n].len==0) {
n 455 source4/torture/locktest.c recorded[n].len = 1;
n 464 source4/torture/locktest.c n = retest(cli, fnum, numops);
n 466 source4/torture/locktest.c if (n == numops || !analyze) {
n 467 source4/torture/locktest.c if (n != numops) {
n 472 source4/torture/locktest.c n++;
n 474 source4/torture/locktest.c skip = n/2;
n 477 source4/torture/locktest.c n1 = n;
n 483 source4/torture/locktest.c for (i=0;i<n-skip;i+=skip) {
n 493 source4/torture/locktest.c m = retest(cli, fnum, n);
n 494 source4/torture/locktest.c if (m == n) {
n 503 source4/torture/locktest.c n = m-(skip-1);
n 514 source4/torture/locktest.c if (n1 == n) break;
n 521 source4/torture/locktest.c n1 = retest(cli, fnum, n);
n 522 source4/torture/locktest.c if (n1 != n-1) {
n 523 source4/torture/locktest.c printf("ERROR - inconsistent result (%u %u)\n", n1, n);
n 527 source4/torture/locktest.c for (i=0;i<n;i++) {
n 340 source4/torture/locktest2.c int n)
n 343 source4/torture/locktest2.c printf("testing %u ...\n", n);
n 344 source4/torture/locktest2.c for (i=0; i<n; i++) {
n 352 source4/torture/locktest2.c return n;
n 373 source4/torture/locktest2.c int n, i, n1;
n 383 source4/torture/locktest2.c for (n=0; n<numops; n++) {
n 384 source4/torture/locktest2.c recorded[n].conn = random() % NCONNECTIONS;
n 385 source4/torture/locktest2.c recorded[n].fstype = random() % NUMFSTYPES;
n 386 source4/torture/locktest2.c recorded[n].f = random() % NFILES;
n 387 source4/torture/locktest2.c recorded[n].start = LOCKBASE + ((uint_t)random() % (LOCKRANGE-1));
n 388 source4/torture/locktest2.c recorded[n].len = 1 +
n 389 source4/torture/locktest2.c random() % (LOCKRANGE-(recorded[n].start-LOCKBASE));
n 390 source4/torture/locktest2.c recorded[n].start *= RANGE_MULTIPLE;
n 391 source4/torture/locktest2.c recorded[n].len *= RANGE_MULTIPLE;
n 392 source4/torture/locktest2.c recorded[n].r1 = random() % 100;
n 393 source4/torture/locktest2.c recorded[n].r2 = random() % 100;
n 394 source4/torture/locktest2.c recorded[n].needed = true;
n 399 source4/torture/locktest2.c n = retest(cli, nfs, fnum, numops);
n 401 source4/torture/locktest2.c if (n == numops || !analyze) return;
n 402 source4/torture/locktest2.c n++;
n 405 source4/torture/locktest2.c n1 = n;
n 411 source4/torture/locktest2.c for (i=0;i<n-1;i++) {
n 418 source4/torture/locktest2.c m = retest(cli, nfs, fnum, n);
n 419 source4/torture/locktest2.c if (m == n) {
n 426 source4/torture/locktest2.c n = m;
n 431 source4/torture/locktest2.c if (n1 == n) break;
n 438 source4/torture/locktest2.c n1 = retest(cli, nfs, fnum, n);
n 439 source4/torture/locktest2.c if (n1 != n-1) {
n 440 source4/torture/locktest2.c printf("ERROR - inconsistent result (%u %u)\n", n1, n);
n 444 source4/torture/locktest2.c for (i=0;i<n;i++) {
n 40 source4/torture/nbench/nbench.c for (n=0;n<=nb_max_retries && !op;n++) do_reconnect(&cli, tctx, client)
n 44 source4/torture/nbench/nbench.c int n;
n 46 source4/torture/nbench/nbench.c for (n=0;n<nb_max_retries;n++) {
n 66 source4/torture/nbench/nbench.c int n;
n 147 source4/torture/nbench/nbench.c NB_RETRY(nb_rename(params[1], params[2], status, n>0));
n 149 source4/torture/nbench/nbench.c NB_RETRY(nb_unlink(params[1], ival(params[2]), status, n>0));
n 151 source4/torture/nbench/nbench.c NB_RETRY(nb_deltree(params[1], n>0));
n 153 source4/torture/nbench/nbench.c NB_RETRY(nb_rmdir(params[1], status, n>0));
n 155 source4/torture/nbench/nbench.c NB_RETRY(nb_mkdir(params[1], status, n>0));
n 193 source4/torture/nbench/nbench.c if (n > nb_max_retries) {
n 317 source4/torture/nbench/nbio.c void nbio_shmem(int n, int t_timelimit, int t_warmup)
n 319 source4/torture/nbench/nbio.c nprocs = n;
n 805 source4/torture/nbench/nbio.c bool nb_rename(const char *o, const char *n, NTSTATUS status, bool retry)
n 813 source4/torture/nbench/nbio.c io.rename.in.pattern2 = n;
n 52 source4/torture/nbt/winsreplication.c #define _NBT_NAME(n,t,s) {\
n 53 source4/torture/nbt/winsreplication.c .name = n,\
n 988 source4/torture/raw/search.c int i, fnum, n;
n 1010 source4/torture/raw/search.c for (n=0;n<3;n++) {
n 1011 source4/torture/raw/search.c fname = talloc_asprintf(cli, BASEDIR "\\d%d\\f%d-%d.txt", i, i, n);
n 50 source4/torture/raw/setfileinfo.c int n = time(NULL) % 100;
n 52 source4/torture/raw/setfileinfo.c asprintf(&path_fname, BASEDIR "\\fname_test_%d.txt", n);
n 53 source4/torture/raw/setfileinfo.c asprintf(&path_fname_new, BASEDIR "\\fname_test_new_%d.txt", n);
n 54 source4/torture/raw/setfileinfo.c asprintf(&fnum_fname, BASEDIR "\\fnum_test_%d.txt", n);
n 55 source4/torture/raw/setfileinfo.c asprintf(&fnum_fname_new, BASEDIR "\\fnum_test_new_%d.txt", n);
n 466 source4/torture/raw/setfileinfo.c int n = time(NULL) % 100;
n 468 source4/torture/raw/setfileinfo.c asprintf(&path_fname, BASEDIR "\\fname_test_%d.txt", n);
n 469 source4/torture/raw/setfileinfo.c asprintf(&path_fname_new, BASEDIR "\\fname_test_new_%d.txt", n);
n 470 source4/torture/raw/setfileinfo.c asprintf(&fnum_fname, BASEDIR "\\fnum_test_%d.txt", n);
n 471 source4/torture/raw/setfileinfo.c asprintf(&fnum_fname_new, BASEDIR "\\fnum_test_new_%d.txt", n);
n 472 source4/torture/raw/setfileinfo.c asprintf(&path_dname, BASEDIR "\\dname_test_%d", n);
n 473 source4/torture/raw/setfileinfo.c asprintf(&path_dname_new, BASEDIR "\\dname_test_new_%d", n);
n 121 source4/torture/rpc/autoidl.c int n;
n 128 source4/torture/rpc/autoidl.c for (n=0;n<2000;n++) {
n 129 source4/torture/rpc/autoidl.c stub_in = data_blob(NULL, base_in->length + n);
n 132 source4/torture/rpc/autoidl.c memcpy(stub_in.data+insert_ofs+n, base_in->data+insert_ofs, base_in->length-insert_ofs);
n 138 source4/torture/rpc/autoidl.c printf("expand by %d gives %s\n", n, nt_errstr(status));
n 139 source4/torture/rpc/autoidl.c if (n >= 4) {
n 141 source4/torture/rpc/autoidl.c insert_ofs, insert_ofs+n, depth+1);
n 147 source4/torture/rpc/autoidl.c printf("expand by %d gives fault %s\n", n, dcerpc_errstr(tctx, p->last_fault_code));
n 34 source4/torture/rpc/echo.c n = i = value; \
n 35 source4/torture/rpc/echo.c r.in.in_data = n; \
n 36 source4/torture/rpc/echo.c r.out.out_data = &n; \
n 39 source4/torture/rpc/echo.c torture_assert (tctx, n == i+1, talloc_asprintf(tctx, "%d + 1 != %u (should be %u)\n", i, n, i+1)); \
n 40 source4/torture/rpc/echo.c torture_comment (tctx, "%d + 1 = %u\n", i, n); \
n 48 source4/torture/rpc/echo.c uint32_t n;
n 1441 source4/torture/rpc/samr.c struct samr_LookupNames n;
n 1447 source4/torture/rpc/samr.c n.in.domain_handle = domain_handle;
n 1448 source4/torture/rpc/samr.c n.in.num_names = 1;
n 1449 source4/torture/rpc/samr.c n.in.names = sname;
n 1450 source4/torture/rpc/samr.c n.out.rids = &rids;
n 1451 source4/torture/rpc/samr.c n.out.types = &types;
n 1452 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 1454 source4/torture/rpc/samr.c *rid = n.out.rids->ids[0];
n 1460 source4/torture/rpc/samr.c n.in.num_names = 2;
n 1461 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 1470 source4/torture/rpc/samr.c n.in.num_names = 0;
n 1471 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 1478 source4/torture/rpc/samr.c n.in.num_names = 1;
n 1479 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 1490 source4/torture/rpc/samr.c n.in.num_names = 2;
n 1491 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 4168 source4/torture/rpc/samr.c struct samr_LookupNames n;
n 4172 source4/torture/rpc/samr.c n.in.domain_handle = domain_handle;
n 4173 source4/torture/rpc/samr.c n.in.num_names = 1;
n 4174 source4/torture/rpc/samr.c n.in.names = talloc_array(tctx, struct lsa_String, 1);
n 4175 source4/torture/rpc/samr.c n.in.names[0].string = acct_name;
n 4176 source4/torture/rpc/samr.c n.out.rids = &rids;
n 4177 source4/torture/rpc/samr.c n.out.types = &types;
n 4179 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 4187 source4/torture/rpc/samr.c r.in.rid = n.out.rids->ids[0];
n 4192 source4/torture/rpc/samr.c printf("OpenUser(%u) failed - %s\n", n.out.rids->ids[0], nt_errstr(status));
n 4902 source4/torture/rpc/samr.c struct samr_LookupNames n;
n 4950 source4/torture/rpc/samr.c n.in.domain_handle = handle;
n 4951 source4/torture/rpc/samr.c n.in.num_names = sam->count;
n 4952 source4/torture/rpc/samr.c n.in.names = talloc_array(tctx, struct lsa_String, sam->count);
n 4953 source4/torture/rpc/samr.c n.out.rids = &rids;
n 4954 source4/torture/rpc/samr.c n.out.types = &types;
n 4956 source4/torture/rpc/samr.c n.in.names[i].string = sam->entries[i].name.string;
n 4958 source4/torture/rpc/samr.c status = dcerpc_samr_LookupNames(p, tctx, &n);
n 1059 source4/torture/rpc/srvsvc.c int i, n, min, max;
n 1074 source4/torture/rpc/srvsvc.c n = max;
n 1081 source4/torture/rpc/srvsvc.c memset(name, 'A', n);
n 1082 source4/torture/rpc/srvsvc.c name[n] = '\0';
n 1092 source4/torture/rpc/srvsvc.c min = n;
n 1093 source4/torture/rpc/srvsvc.c n += (max - min + 1)/2;
n 1099 source4/torture/rpc/srvsvc.c max = n;
n 1100 source4/torture/rpc/srvsvc.c n -= (max - min)/2;
n 1113 source4/torture/rpc/srvsvc.c for (n = 0x20; n < 0x7e; n++) {
n 1114 source4/torture/rpc/srvsvc.c r.in.name = name = talloc_asprintf(tctx, "%c", (char)n);
n 1124 source4/torture/rpc/srvsvc.c invalidc = talloc_asprintf_append_buffer(invalidc, "%c", (char)n);
n 61 source4/torture/rpc/testjoin.c struct samr_LookupNames n;
n 68 source4/torture/rpc/testjoin.c n.in.domain_handle = handle;
n 69 source4/torture/rpc/testjoin.c n.in.num_names = 1;
n 70 source4/torture/rpc/testjoin.c n.in.names = &sname;
n 71 source4/torture/rpc/testjoin.c n.out.rids = &rids;
n 72 source4/torture/rpc/testjoin.c n.out.types = &types;
n 74 source4/torture/rpc/testjoin.c status = dcerpc_samr_LookupNames(p, mem_ctx, &n);
n 76 source4/torture/rpc/testjoin.c rid = n.out.rids->ids[0];
n 63 source4/torture/smb2/notify.c struct smb2_notify n;
n 69 source4/torture/smb2/notify.c n.in.recursive = 0x0000;
n 70 source4/torture/smb2/notify.c n.in.buffer_size = 0x00080000;
n 71 source4/torture/smb2/notify.c n.in.file.handle = dh;
n 72 source4/torture/smb2/notify.c n.in.completion_filter = 0x00000FFF;
n 73 source4/torture/smb2/notify.c n.in.unknown = 0x00000000;
n 74 source4/torture/smb2/notify.c req = smb2_notify_send(tree, &n);
n 85 source4/torture/smb2/notify.c status = smb2_notify_recv(req, mem_ctx, &n);
n 87 source4/torture/smb2/notify.c CHECK_VALUE(n.out.num_changes, 1);
n 88 source4/torture/smb2/notify.c CHECK_VALUE(n.out.changes[0].action, NOTIFY_ACTION_REMOVED);
n 89 source4/torture/smb2/notify.c CHECK_WIRE_STR(n.out.changes[0].name, FNAME);
n 95 source4/torture/smb2/notify.c n.in.buffer_size = 0x00000000;
n 96 source4/torture/smb2/notify.c req = smb2_notify_send(tree, &n);
n 107 source4/torture/smb2/notify.c status = smb2_notify_recv(req, mem_ctx, &n);
n 114 source4/torture/smb2/notify.c n.in.buffer_size = 0x00080000;
n 115 source4/torture/smb2/notify.c req = smb2_notify_send(tree, &n);
n 126 source4/torture/smb2/notify.c status = smb2_notify_recv(req, mem_ctx, &n);
n 128 source4/torture/smb2/notify.c CHECK_VALUE(n.out.num_changes, 3);
n 129 source4/torture/smb2/notify.c CHECK_VALUE(n.out.changes[0].action, NOTIFY_ACTION_REMOVED);
n 130 source4/torture/smb2/notify.c CHECK_WIRE_STR(n.out.changes[0].name, FNAME);
n 131 source4/torture/smb2/notify.c CHECK_VALUE(n.out.changes[1].action, NOTIFY_ACTION_ADDED);
n 132 source4/torture/smb2/notify.c CHECK_WIRE_STR(n.out.changes[1].name, FNAME);
n 133 source4/torture/smb2/notify.c CHECK_VALUE(n.out.changes[2].action, NOTIFY_ACTION_MODIFIED);
n 134 source4/torture/smb2/notify.c CHECK_WIRE_STR(n.out.changes[2].name, FNAME);
n 142 source4/torture/smb2/notify.c n.in.recursive = 0x0000;
n 143 source4/torture/smb2/notify.c n.in.buffer_size = 0x00000001;
n 144 source4/torture/smb2/notify.c n.in.file.handle = dh;
n 145 source4/torture/smb2/notify.c n.in.completion_filter = 0x00000FFF;
n 146 source4/torture/smb2/notify.c n.in.unknown = 0x00000000;
n 147 source4/torture/smb2/notify.c req = smb2_notify_send(tree, &n);
n 158 source4/torture/smb2/notify.c status = smb2_notify_recv(req, mem_ctx, &n);
n 161 source4/torture/smb2/notify.c n.in.buffer_size = 0x00080000;
n 162 source4/torture/smb2/notify.c req = smb2_notify_send(tree, &n);
n 172 source4/torture/smb2/notify.c status = smb2_notify_recv(req, mem_ctx, &n);
n 176 source4/torture/smb2/notify.c n.in.recursive = 0x0000;
n 177 source4/torture/smb2/notify.c n.in.buffer_size = 0x00080001;
n 178 source4/torture/smb2/notify.c n.in.file.handle = dh;
n 179 source4/torture/smb2/notify.c n.in.completion_filter = 0x00000FFF;
n 180 source4/torture/smb2/notify.c n.in.unknown = 0x00000000;
n 181 source4/torture/smb2/notify.c req = smb2_notify_send(tree, &n);
n 182 source4/torture/smb2/notify.c status = smb2_notify_recv(req, mem_ctx, &n);
n 54 source4/torture/smb2/setinfo.c int n = time(NULL) % 100;
n 58 source4/torture/smb2/setinfo.c fname = talloc_asprintf(torture, BASEDIR "fnum_test_%d.txt", n);
n 59 source4/torture/smb2/setinfo.c fname_new = talloc_asprintf(torture, BASEDIR "fnum_test_new_%d.txt", n);
n 32 source4/torture/smbiconv.c size_t n;
n 38 source4/torture/smbiconv.c n = smb_iconv (cd, &addr, &len, &outptr, &outlen);
n 100 source4/torture/smbiconv.c ssize_t n = read (fd, inptr, maxlen - actlen);
n 102 source4/torture/smbiconv.c if (n == 0)
n 106 source4/torture/smbiconv.c if (n == -1)
n 113 source4/torture/smbiconv.c inptr += n;
n 114 source4/torture/smbiconv.c actlen += n;
n 120 source4/torture/smbiconv.c ssize_t n;
n 136 source4/torture/smbiconv.c n = read (fd, inptr, maxlen - actlen);
n 138 source4/torture/smbiconv.c if (n == 0)
n 142 source4/torture/smbiconv.c if (n == -1)
n 149 source4/torture/smbiconv.c inptr += n;
n 150 source4/torture/smbiconv.c actlen += n;
n 154 source4/torture/smbiconv.c if (n == 0)
n 96 source4/utils/oLschema2ldif.c int n;
n 100 source4/utils/oLschema2ldif.c n = strcspn(c, " \t$");
n 101 source4/utils/oLschema2ldif.c s = talloc_strndup(msg, c, n);
n 105 source4/utils/oLschema2ldif.c c += n;
n 119 source4/utils/oLschema2ldif.c int n;
n 123 source4/utils/oLschema2ldif.c n = strcspn(c, "\'");
n 124 source4/utils/oLschema2ldif.c value = talloc_strndup(ctx, c, n);
n 125 source4/utils/oLschema2ldif.c c += n;
n 128 source4/utils/oLschema2ldif.c n = strcspn(c, " \t\n");
n 129 source4/utils/oLschema2ldif.c value = talloc_strndup(ctx, c, n);
n 130 source4/utils/oLschema2ldif.c c += n;
n 142 source4/utils/oLschema2ldif.c int n;
n 146 source4/utils/oLschema2ldif.c n = strcspn(c, " \t\n");
n 147 source4/utils/oLschema2ldif.c type = talloc_strndup(token, c, n);
n 148 source4/utils/oLschema2ldif.c c += n;
n 179 source4/utils/oLschema2ldif.c n = strcspn(c, ")");
n 180 source4/utils/oLschema2ldif.c token->value = talloc_strndup(ctx, c, n);
n 181 source4/utils/oLschema2ldif.c c += n;
n 219 source4/utils/oLschema2ldif.c n = strcspn(c, ")");
n 220 source4/utils/oLschema2ldif.c token->value = talloc_strndup(ctx, c, n);
n 221 source4/utils/oLschema2ldif.c c += n;
n 238 source4/utils/oLschema2ldif.c n = strcspn(c, ")");
n 239 source4/utils/oLschema2ldif.c token->value = talloc_strndup(ctx, c, n);
n 240 source4/utils/oLschema2ldif.c c += n;
n 337 source4/utils/oLschema2ldif.c int n;
n 375 source4/utils/oLschema2ldif.c n = strcspn(c, " \t");
n 376 source4/utils/oLschema2ldif.c s = talloc_strndup(msg, c, n);
n 378 source4/utils/oLschema2ldif.c c += n;