bin/cpdup/cpdup.c
109
static Node *IterateList(List *list, Node *node, int n);
bin/cpdup/cpdup.c
110
static int AddList(List *list, const char *name, int n, struct stat *st);
bin/cpdup/cpdup.c
1133
int n;
bin/cpdup/cpdup.c
1139
while ((n = hc_read(&SrcHost, fd1, iobuf1, GETIOSIZE)) > 0) {
bin/cpdup/cpdup.c
1141
if (hc_write(&DstHost, fd2, iobuf1, n) != n)
bin/cpdup/cpdup.c
1146
if (n == 0) {
bin/cpdup/cpdup.c
135
int64_t *CountReadBytes, int n);
bin/cpdup/cpdup.c
1376
int64_t *CountReadBytes, int n)
bin/cpdup/cpdup.c
1383
if (n == 0) {
bin/cpdup/cpdup.c
1450
AddList(list, den->d_name, n, statptr);
bin/cpdup/cpdup.c
1576
IterateList(List *list, Node *node, int n)
bin/cpdup/cpdup.c
1582
while (node->no_Value != n && node != &list->li_Node)
bin/cpdup/cpdup.c
1588
AddList(List *list, const char *name, int n, struct stat *st)
bin/cpdup/cpdup.c
1599
(n != 1 && node->no_Value == 1 &&
bin/cpdup/cpdup.c
1627
node->no_Value = n;
bin/cpdup/cpdup.c
1630
return(n);
bin/cpdup/cpdup.c
523
int n;
bin/cpdup/cpdup.c
525
n = stp->st_ino & HLMASK;
bin/cpdup/cpdup.c
527
for (hl = hltable[n]; hl; hl = hl->next) {
bin/cpdup/cpdup.c
542
int n;
bin/cpdup/cpdup.c
556
n = stp->st_ino & HLMASK;
bin/cpdup/cpdup.c
557
new->next = hltable[n];
bin/cpdup/cpdup.c
558
if (hltable[n])
bin/cpdup/cpdup.c
559
hltable[n]->prev = new;
bin/cpdup/cpdup.c
560
hltable[n] = new;
bin/cpdup/cpdup.c
654
int n;
bin/cpdup/cpdup.c
659
while ((n = hc_read(&SrcHost, fd1, iobuf1, GETIOSIZE)) > 0) {
bin/cpdup/cpdup.c
660
CountSourceReadBytes += n;
bin/cpdup/cpdup.c
664
if (x != n)
bin/cpdup/cpdup.c
666
if (bcmp(iobuf1, iobuf2, n) != 0)
bin/cpdup/cpdup.c
671
if (n == 0)
bin/cpdup/cpdup.h
41
#define __aligned(n)
bin/cpdup/cpdup.h
58
char *fextract(FILE *fi, int n, int *pc, int skip);
bin/cpdup/hclink.c
157
int n;
bin/cpdup/hclink.c
163
n = 0;
bin/cpdup/hclink.c
164
while (n < (int)sizeof(struct HCHead)) {
bin/cpdup/hclink.c
165
r = read(hc->fdin, (char *)&tmp + n, sizeof(struct HCHead) - n);
bin/cpdup/hclink.c
168
n += r;
bin/cpdup/hclink.c
187
bcopy(&tmp, trans->rbuf, n);
bin/cpdup/hclink.c
190
while (n < aligned_bytes) {
bin/cpdup/hclink.c
191
r = read(hc->fdin, trans->rbuf + n, aligned_bytes - n);
bin/cpdup/hclink.c
194
n += r;
bin/cpdup/hclink.c
37
int n, m;
bin/cpdup/hclink.c
388
hcc_check_space(hctransaction_t trans, struct HCHead *head, int n, int size)
bin/cpdup/hclink.c
390
size = HCC_ALIGN(size) + n * sizeof(struct HCLeaf);
bin/cpdup/hclink.c
46
n = 0;
bin/cpdup/hclink.c
47
av[n++] = "ssh";
bin/cpdup/hclink.c
49
av[n++] = "-C";
bin/cpdup/hclink.c
51
av[n++] = ssh_argv[m];
bin/cpdup/hclink.c
52
av[n++] = "-T";
bin/cpdup/hclink.c
53
av[n++] = hc->host;
bin/cpdup/hclink.c
54
av[n++] = "cpdup";
bin/cpdup/hclink.c
55
av[n++] = (readonly ? "-RS" : "-S");
bin/cpdup/hclink.c
56
av[n++] = NULL;
bin/cpdup/hclink.h
99
int hcc_check_space(hctransaction_t trans, struct HCHead *head, int n, int size);
bin/cpdup/hcproto.c
1020
int n = (bytes > limit) ? limit : bytes;
bin/cpdup/hcproto.c
1025
hcc_leaf_data(trans, LC_DATA, buf, n);
bin/cpdup/hcproto.c
1034
if (x < 0 || x > n)
bin/cpdup/hcproto.c
1039
if (x < n)
bin/cpdup/hcproto.c
1054
int n = -1;
bin/cpdup/hcproto.c
1063
n = item->bytes - sizeof(*item);
bin/cpdup/hcproto.c
1073
if (n < 0 || n > 32768)
bin/cpdup/hcproto.c
1075
n = write(*fdp, buf, n);
bin/cpdup/hcproto.c
1076
if (n < 0)
bin/cpdup/hcproto.c
1078
hcc_leaf_int32(trans, LC_BYTES, n);
bin/cpdup/hcproto.c
902
int n = (bytes > limit) ? limit : bytes;
bin/cpdup/hcproto.c
906
hcc_leaf_int32(trans, LC_BYTES, n);
bin/cpdup/hcproto.c
922
if (x < n)
bin/cpdup/hcproto.c
938
int n;
bin/cpdup/hcproto.c
954
n = read(*fdp, buf, bytes);
bin/cpdup/hcproto.c
955
if (n < 0)
bin/cpdup/hcproto.c
957
hcc_leaf_data(trans, LC_DATA, buf, n);
bin/cpdup/hcproto.c
970
int n;
bin/cpdup/hcproto.c
981
while ((n = read(fd, buf, 32768)) >= 0) {
bin/cpdup/hcproto.c
982
if (!hcc_check_space(trans, head, 1, n)) {
bin/cpdup/hcproto.c
986
hcc_leaf_data(trans, LC_DATA, buf, n);
bin/cpdup/hcproto.c
987
if (n == 0)
bin/cpdup/hcproto.c
990
if (n < 0) {
bin/cpdup/misc.c
44
fextract(FILE *fi, int n, int *pc, int skip)
bin/cpdup/misc.c
53
imax = (n < 0) ? 64 : n + 1;
bin/cpdup/misc.c
60
if (n == 0 || (n < 0 && (c == ' ' || c == '\n')))
bin/cpdup/misc.c
70
if (n > 0)
bin/cpdup/misc.c
71
--n;
bin/date/vary.c
647
struct vary *n;
bin/date/vary.c
650
n = v->next;
bin/date/vary.c
652
v = n;
bin/dd/dd.c
336
ssize_t n;
bin/dd/dd.c
366
n = read(in.fd, in.dbp, in.dbsz);
bin/dd/dd.c
367
if (n == 0) {
bin/dd/dd.c
373
if (n == -1) {
bin/dd/dd.c
402
} else if (n == in.dbsz) {
bin/dd/dd.c
403
in.dbcnt += in.dbrcnt = n;
bin/dd/dd.c
412
in.dbcnt += in.dbrcnt = n;
bin/dd/dd.c
429
if ((n = in.dbrcnt) & 1) {
bin/dd/dd.c
431
--n;
bin/dd/dd.c
433
swapbytes(in.dbp, (size_t)n);
bin/dd/dd.c
484
size_t cnt, n;
bin/dd/dd.c
512
for (n = force ? out.dbcnt : out.dbsz;; n = out.dbsz) {
bin/dd/dd.c
513
cnt = n;
bin/dd/dd.c
556
if ((size_t)nw == n && n == (size_t)out.dbsz)
bin/dd/dd.c
575
if ((out.dbcnt -= n) < out.dbsz)
bin/dd/position.c
159
ssize_t n;
bin/dd/position.c
190
if ((n = read(out.fd, out.db, out.dbsz)) > 0)
bin/dd/position.c
193
if (n == -1)
bin/dd/position.c
207
n = write(out.fd, out.db, out.dbsz);
bin/dd/position.c
208
if (n == -1)
bin/dd/position.c
210
if (n != out.dbsz)
bin/dd/position.c
55
off_t n;
bin/dd/position.c
58
n = io->offset;
bin/dd/position.c
70
if ((io->flags & ISCHR) == 0 && (n < 0 || n > OFF_MAX / (ssize_t)sz))
bin/dd/position.c
73
else if ((io->flags & ISCHR) != 0 && (uint64_t)n > UINT64_MAX / sz)
bin/dd/position.c
77
return ((off_t)( (uint64_t)n * sz ));
bin/ed/buf.c
146
long n = 0;
bin/ed/buf.c
149
n++;
bin/ed/buf.c
150
if (n && cp == &buffer_head) {
bin/ed/buf.c
154
return n;
bin/ed/buf.c
160
get_addressed_line_node(long n)
bin/ed/buf.c
166
if (n > on)
bin/ed/buf.c
167
if (n <= (on + addr_last) >> 1)
bin/ed/buf.c
168
for (; on < n; on++)
bin/ed/buf.c
172
for (on = addr_last; on > n; on--)
bin/ed/buf.c
176
if (n >= on >> 1)
bin/ed/buf.c
177
for (; on > n; on--)
bin/ed/buf.c
181
for (on = 0; on < n; on++)
bin/ed/buf.c
234
quit(int n)
bin/ed/buf.c
240
exit(n);
bin/ed/cbc.c
322
cbc_encode(unsigned char *msgbuf, int n, FILE *fp)
bin/ed/cbc.c
329
if (n == 8) {
bin/ed/cbc.c
330
for (n = 0; n < 8; n++)
bin/ed/cbc.c
331
msgbuf[n] ^= ivec[n];
bin/ed/cbc.c
346
MEMCPY(msgbuf + n, pvec, 8 - n);
bin/ed/cbc.c
347
msgbuf[7] = n;
bin/ed/cbc.c
348
for (n = 0; n < 8; n++)
bin/ed/cbc.c
349
msgbuf[n] ^= ivec[n];
bin/ed/cbc.c
363
int n; /* number of bytes actually read */
bin/ed/cbc.c
367
if ((n = READ(msgbuf, 8, fp)) == 8) {
bin/ed/cbc.c
380
n = msgbuf[7];
bin/ed/cbc.c
381
if (n < 0 || n > 7) {
bin/ed/cbc.c
387
return n;
bin/ed/cbc.c
389
if (n > 0)
bin/ed/cbc.c
391
else if (n < 0)
bin/ed/cbc.c
66
#define READ(buf, n, fp) fread(buf, sizeof(char), n, fp)
bin/ed/cbc.c
67
#define WRITE(buf, n, fp) fwrite(buf, sizeof(char), n, fp)
bin/ed/ed.h
116
#define REALLOC(b,n,i,err) \
bin/ed/ed.h
117
if ((i) > (n)) { \
bin/ed/ed.h
118
int ti = (n); \
bin/ed/ed.h
136
(n) = ti; \
bin/ed/ed.h
142
#define REALLOC(b,n,i,err) \
bin/ed/ed.h
143
if ((i) > (n)) { \
bin/ed/ed.h
144
int ti = (n); \
bin/ed/ed.h
153
(n) = ti; \
bin/ed/glbl.c
103
while ((n = get_tty_line()) > 0 &&
bin/ed/glbl.c
104
ibuf[n - 1] != '\n')
bin/ed/glbl.c
106
if (n < 0)
bin/ed/glbl.c
108
else if (n == 0) {
bin/ed/glbl.c
111
} else if (n == 1 && !strcmp(ibuf, "\n"))
bin/ed/glbl.c
113
else if (n == 2 && !strcmp(ibuf, "&\n")) {
bin/ed/glbl.c
118
} else if ((cmd = get_extended_line(&n, 0)) == NULL)
bin/ed/glbl.c
121
REALLOC(ocmd, ocmdsz, n + 1, ERR);
bin/ed/glbl.c
122
memcpy(ocmd, cmd, n + 1);
bin/ed/glbl.c
46
long n;
bin/ed/glbl.c
59
for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) {
bin/ed/glbl.c
82
int n;
bin/ed/glbl.c
89
else if ((cmd = get_extended_line(&n, 0)) == NULL)
bin/ed/glbl.c
92
if (!interact && (cmd = get_extended_line(&n, 0)) == NULL)
bin/ed/io.c
146
write_file(char *fn, const char *mode, long n, long m)
bin/ed/io.c
158
if ((size = write_stream(fp, n, m)) < 0) {
bin/ed/io.c
170
return n ? m - n + 1 : 0;
bin/ed/io.c
176
write_stream(FILE *fp, long n, long m)
bin/ed/io.c
178
line_t *lp = get_addressed_line_node(n);
bin/ed/io.c
185
for (; n && n <= m; n++, lp = lp->q_forw) {
bin/ed/io.c
189
if (n != addr_last || !isbinary || !newline_added)
bin/ed/io.c
223
int l, n;
bin/ed/io.c
238
if ((n = get_tty_line()) < 0)
bin/ed/io.c
240
else if (n == 0 || ibuf[n - 1] != '\n') {
bin/ed/io.c
244
REALLOC(cvbuf, cvbufsz, l + n, NULL);
bin/ed/io.c
245
memcpy(cvbuf + l, ibuf, n);
bin/ed/io.c
246
l += n;
bin/ed/io.c
247
if (n < 2 || !has_trailing_escape(cvbuf, cvbuf + l - 1))
bin/ed/io.c
306
put_tty_line(const char *s, int l, long n, int gflag)
bin/ed/io.c
313
printf("%ld\t", n);
bin/ed/io.c
35
read_file(char *fn, long n)
bin/ed/io.c
47
if ((size = read_stream(fp, n)) < 0) {
bin/ed/io.c
59
return current_addr - n;
bin/ed/io.c
68
read_stream(FILE *fp, long n)
bin/ed/io.c
70
line_t *lp = get_addressed_line_node(n);
bin/ed/io.c
75
int appended = (n == addr_last);
bin/ed/io.c
81
for (current_addr = n; (len = get_stream_line(fp)) > 0; size += len) {
bin/ed/main.c
1000
REALLOC(buf, n, i + j, ERR);
bin/ed/main.c
1016
append_lines(long n)
bin/ed/main.c
102
red = (n = strlen(argv[0])) > 2 && argv[0][n - 3] == 'r';
bin/ed/main.c
1023
for (current_addr = n;;) {
bin/ed/main.c
1068
static int n;
bin/ed/main.c
1079
REALLOC(buf, n, size + bp->len, ERR);
bin/ed/main.c
1083
REALLOC(buf, n, size + 2, ERR);
bin/ed/main.c
1105
long n = INC_MOD(second_addr, addr_last);
bin/ed/main.c
1111
a2 = get_addressed_line_node(n);
bin/ed/main.c
1114
} else if (push_undo_stack(UMOV, p, n) == NULL ||
bin/ed/main.c
1119
a1 = get_addressed_line_node(n);
bin/ed/main.c
1150
long n = second_addr - first_addr + 1;
bin/ed/main.c
1155
n = addr - first_addr + 1;
bin/ed/main.c
1158
for (; n > 0; n=m, m=0, np = get_addressed_line_node(current_addr + 1))
bin/ed/main.c
1159
for (; n-- > 0; np = np->q_forw) {
bin/ed/main.c
1184
line_t *n, *p;
bin/ed/main.c
1191
n = get_addressed_line_node(INC_MOD(to, addr_last));
bin/ed/main.c
1195
unset_active_nodes(p->q_forw, n);
bin/ed/main.c
1196
REQUE(p, n);
bin/ed/main.c
1236
mark_line_node(line_t *lp, int n)
bin/ed/main.c
1238
if (!islower((unsigned char)n)) {
bin/ed/main.c
1241
} else if (mark[n - 'a'] == NULL)
bin/ed/main.c
1243
mark[n - 'a'] = lp;
bin/ed/main.c
1250
get_marked_node_addr(int n)
bin/ed/main.c
1252
if (!islower((unsigned char)n)) {
bin/ed/main.c
1256
return get_line_node_addr(mark[n - 'a']);
bin/ed/main.c
1343
int n;
bin/ed/main.c
1350
(n = strlen(s)) + 8 <= PATH_MAX && /* "ed.hup" + '/' */
bin/ed/main.c
1351
(hup = (char *) malloc(n + 10)) != NULL) {
bin/ed/main.c
1353
if (hup[n - 1] != '/')
bin/ed/main.c
1354
hup[n] = '/', hup[n+1] = '\0';
bin/ed/main.c
171
if ((n = get_tty_line()) < 0) {
bin/ed/main.c
174
} else if (n == 0) {
bin/ed/main.c
191
} else if (ibuf[n - 1] != '\n') {
bin/ed/main.c
283
long n;
bin/ed/main.c
298
STRTOL(n, ibufp);
bin/ed/main.c
299
addr += (c == '-' || c == '^') ? -n : n;
bin/ed/main.c
441
int n = 0;
bin/ed/main.c
535
else if ((n = (c == 'G' || c == 'V')))
bin/ed/main.c
538
if (exec_global(n, gflag) < 0)
bin/ed/main.c
741
n++;
bin/ed/main.c
743
} while (!n);
bin/ed/main.c
771
if ((n = *ibufp) == 'q' || n == 'Q') {
bin/ed/main.c
798
else if (modified && !scripted && n == 'q')
bin/ed/main.c
863
check_addr_range(long n, long m)
bin/ed/main.c
866
first_addr = n;
bin/ed/main.c
885
long n = current_addr;
bin/ed/main.c
890
if ((n = dir ? INC_MOD(n, addr_last) : DEC_MOD(n, addr_last))) {
bin/ed/main.c
891
lp = get_addressed_line_node(n);
bin/ed/main.c
897
return n;
bin/ed/main.c
899
} while (n != current_addr);
bin/ed/main.c
912
int n;
bin/ed/main.c
919
} else if ((ibufp = get_extended_line(&n, 1)) == NULL)
bin/ed/main.c
923
if ((n = get_shell_command()) < 0)
bin/ed/main.c
925
if (n)
bin/ed/main.c
928
} else if (n > PATH_MAX - 1) {
bin/ed/main.c
940
for (n = 0; *ibufp != '\n';)
bin/ed/main.c
941
file[n++] = *ibufp++;
bin/ed/main.c
942
file[n] = '\0';
bin/ed/main.c
953
static int n = 0;
bin/ed/main.c
964
REALLOC(buf, n, j + 1, ERR);
bin/ed/main.c
969
REALLOC(buf, n, i + 2, ERR);
bin/ed/main.c
97
int c, n;
bin/ed/main.c
976
REALLOC(buf, n, i + 1, ERR);
bin/ed/main.c
988
REALLOC(buf, n, i + shcmdi, ERR);
bin/ed/re.c
46
int n;
bin/ed/re.c
66
if ((n = regcomp(expr, exprs, 0))) {
bin/ed/re.c
67
regerror(n, expr, error, sizeof error);
bin/ed/sub.c
230
int n;
bin/ed/sub.c
241
(n = *sub - '0') <= re_nsub) {
bin/ed/sub.c
242
j = rm[n].rm_so;
bin/ed/sub.c
243
k = rm[n].rm_eo;
bin/ed/sub.c
74
int n = 0;
bin/ed/sub.c
95
while ((n = get_tty_line()) == 0 ||
bin/ed/sub.c
96
(n > 0 && ibuf[n - 1] != '\n'))
bin/ed/sub.c
98
if (n < 0)
bin/ed/undo.c
101
REQUE(ustack[n].h->q_back, ustack[n].t->q_forw);
bin/ed/undo.c
104
REQUE(ustack[n].h->q_back, ustack[n].h);
bin/ed/undo.c
105
REQUE(ustack[n].t, ustack[n].t->q_forw);
bin/ed/undo.c
109
REQUE(ustack[n - 1].h, ustack[n].h->q_forw);
bin/ed/undo.c
110
REQUE(ustack[n].t->q_back, ustack[n - 1].t);
bin/ed/undo.c
111
REQUE(ustack[n].h, ustack[n].t);
bin/ed/undo.c
112
n--;
bin/ed/undo.c
118
ustack[n].type ^= 1;
bin/ed/undo.c
121
for (n = u_p; n-- > (u_p + 1)/ 2;)
bin/ed/undo.c
122
USWAP(ustack[n], ustack[u_p - 1 - n]);
bin/ed/undo.c
87
long n;
bin/ed/undo.c
98
for (n = u_p; n-- > 0;) {
bin/ed/undo.c
99
switch(ustack[n].type) {
bin/hostname/hostname.c
79
#define RT_ADVANCE(x, n) (x += RT_ROUNDUP((n)->sa_len))
bin/kill/kill.c
153
int n;
bin/kill/kill.c
157
for (n = 1; n < sys_nsig; n++) {
bin/kill/kill.c
158
if (strcasecmp(sys_signame[n], sig) == 0)
bin/kill/kill.c
159
return(n);
bin/kill/kill.c
179
int n;
bin/kill/kill.c
181
for (n = 1; n < sys_nsig; n++) {
bin/kill/kill.c
182
fprintf(fp, "%s", sys_signame[n]);
bin/kill/kill.c
183
if (n == (sys_nsig / 2) || n == (sys_nsig - 1))
bin/ls/ls.c
74
#define MAKENINES(n) \
bin/ls/ls.c
79
for (i = 1; n > 0; i *= 10) \
bin/ls/ls.c
80
n--; \
bin/ls/ls.c
81
n = i - 1; \
bin/ls/util.c
103
n++;
bin/ls/util.c
109
n++;
bin/ls/util.c
115
n += wcwidth(wc);
bin/ls/util.c
117
return (n);
bin/ls/util.c
57
int i, n;
bin/ls/util.c
61
n = 0;
bin/ls/util.c
64
n += printf("%s", s);
bin/ls/util.c
71
n++;
bin/ls/util.c
78
n += wcwidth(wc);
bin/ls/util.c
80
return (n);
bin/ls/util.c
88
int i, n;
bin/ls/util.c
92
n = 0;
bin/ls/util.c
97
n++;
bin/ps/print.c
63
static void put64(u_int64_t n, int w, int type);
bin/ps/print.c
784
put64(u_int64_t n, int w, int type)
bin/ps/print.c
792
snprintf(b, sizeof(b), "%*jd", w, (uintmax_t)n);
bin/ps/print.c
805
for (d = 1; n / d >= 100000; d *= u) {
bin/ps/print.c
833
if (w > 4 && n / d >= u) {
bin/ps/print.c
836
(uintmax_t)(n / (d * u)),
bin/ps/print.c
837
(u_int)(n / (d * u / 100) % 100),
bin/ps/print.c
841
w - 1, (uintmax_t)n / d, type);
bin/sh/alias.c
204
char *n, *v;
bin/sh/alias.c
214
while ((n = *argptr++) != NULL) {
bin/sh/alias.c
215
if ((v = strchr(n+1, '=')) == NULL) /* n+1: funny ksh stuff */
bin/sh/alias.c
216
if ((ap = lookupalias(n, 0)) == NULL) {
bin/sh/alias.c
217
warning("%s: not found", n);
bin/sh/alias.c
223
setalias(n, v);
bin/sh/eval.c
1188
prehash(union node *n)
bin/sh/eval.c
1192
if (n && n->type == NCMD && n->ncmd.args)
bin/sh/eval.c
1193
if (goodname(n->ncmd.args->narg.text))
bin/sh/eval.c
1194
find_command(n->ncmd.args->narg.text, &entry, 0,
bin/sh/eval.c
1239
long n;
bin/sh/eval.c
1244
n = strtol(argv[1], &end, 10);
bin/sh/eval.c
1248
n = 1;
bin/sh/eval.c
1249
if (n > loopnest)
bin/sh/eval.c
1250
n = loopnest;
bin/sh/eval.c
1251
if (n > 0) {
bin/sh/eval.c
1253
skipcount = n;
bin/sh/eval.c
153
union node *n;
bin/sh/eval.c
163
while ((n = parsecmd(0)) != NEOF) {
bin/sh/eval.c
164
if (n != NULL && !nflag) {
bin/sh/eval.c
166
evaltree(n, flags | EV_EXIT);
bin/sh/eval.c
168
evaltree(n, flags);
bin/sh/eval.c
191
evaltree(union node *n, int flags)
bin/sh/eval.c
199
if (n == NULL) {
bin/sh/eval.c
209
TRACE(("evaltree(%p: %d) called\n", (void *)n, n->type));
bin/sh/eval.c
210
switch (n->type) {
bin/sh/eval.c
212
evaltree(n->nbinary.ch1, flags & ~EV_EXIT);
bin/sh/eval.c
215
next = n->nbinary.ch2;
bin/sh/eval.c
218
evaltree(n->nbinary.ch1, EV_TESTED);
bin/sh/eval.c
222
next = n->nbinary.ch2;
bin/sh/eval.c
225
evaltree(n->nbinary.ch1, EV_TESTED);
bin/sh/eval.c
228
next = n->nbinary.ch2;
bin/sh/eval.c
231
evalredir(n, flags);
bin/sh/eval.c
234
evalsubshell(n, flags);
bin/sh/eval.c
238
evalsubshell(n, flags);
bin/sh/eval.c
241
evaltree(n->nif.test, EV_TESTED);
bin/sh/eval.c
245
next = n->nif.ifpart;
bin/sh/eval.c
246
else if (n->nif.elsepart)
bin/sh/eval.c
247
next = n->nif.elsepart;
bin/sh/eval.c
254
evalloop(n, flags & ~EV_EXIT);
bin/sh/eval.c
257
evalfor(n, flags & ~EV_EXIT);
bin/sh/eval.c
260
next = evalcase(n);
bin/sh/eval.c
263
next = n->nclist.body;
bin/sh/eval.c
266
if (n->nclist.body) {
bin/sh/eval.c
267
evaltree(n->nclist.body, flags & ~EV_EXIT);
bin/sh/eval.c
271
next = n->nclist.next;
bin/sh/eval.c
274
defun(n->narg.text, n->narg.next);
bin/sh/eval.c
278
evaltree(n->nnot.com, EV_TESTED);
bin/sh/eval.c
285
evalpipe(n);
bin/sh/eval.c
289
evalcommand(n, flags, (struct backcmd *)NULL);
bin/sh/eval.c
293
out1fmt("Node type = %d\n", n->type);
bin/sh/eval.c
297
n = next;
bin/sh/eval.c
300
} while (n != NULL);
bin/sh/eval.c
313
evalloop(union node *n, int flags)
bin/sh/eval.c
321
evaltree(n->nbinary.ch1, EV_TESTED);
bin/sh/eval.c
333
if (n->type == NWHILE) {
bin/sh/eval.c
340
evaltree(n->nbinary.ch2, flags);
bin/sh/eval.c
350
evalfor(union node *n, int flags)
bin/sh/eval.c
358
for (argp = n->nfor.args ; argp ; argp = argp->narg.next) {
bin/sh/eval.c
366
setvar(n->nfor.var, arglist.args[i], 0);
bin/sh/eval.c
367
evaltree(n->nfor.body, flags);
bin/sh/eval.c
391
evalcase(union node *n)
bin/sh/eval.c
399
expandarg(n->ncase.expr, &arglist, EXP_TILDE);
bin/sh/eval.c
400
for (cp = n->ncase.cases ; cp ; cp = cp->nclist.next) {
bin/sh/eval.c
427
evalsubshell(union node *n, int flags)
bin/sh/eval.c
430
int backgnd = (n->type == NBACKGND);
bin/sh/eval.c
433
expredir(n->nredir.redirect);
bin/sh/eval.c
435
forkshell(jp = makejob(n, 1), n, backgnd) == 0) {
bin/sh/eval.c
438
redirect(n->nredir.redirect, 0);
bin/sh/eval.c
439
evaltree(n->nredir.n, flags | EV_EXIT); /* never returns */
bin/sh/eval.c
454
evalredir(union node *n, int flags)
bin/sh/eval.c
461
expredir(n->nredir.redirect);
bin/sh/eval.c
477
redirect(n->nredir.redirect, REDIR_PUSH);
bin/sh/eval.c
480
evaltree(n->nredir.n, flags);
bin/sh/eval.c
528
expredir(union node *n)
bin/sh/eval.c
532
for (redir = n ; redir ; redir = redir->nfile.next) {
bin/sh/eval.c
568
evalpipe(union node *n)
bin/sh/eval.c
576
TRACE(("evalpipe(%p) called\n", (void *)n));
bin/sh/eval.c
578
for (lp = n->npipe.cmdlist ; lp ; lp = lp->next)
bin/sh/eval.c
581
jp = makejob(n, pipelen);
bin/sh/eval.c
583
for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {
bin/sh/eval.c
584
prehash(lp->n);
bin/sh/eval.c
593
if (forkshell(jp, lp->n, n->npipe.backgnd) == 0) {
bin/sh/eval.c
607
evaltree(lp->n, EV_EXIT);
bin/sh/eval.c
616
if (n->npipe.backgnd == 0) {
bin/sh/eval.c
628
is_valid_fast_cmdsubst(union node *n)
bin/sh/eval.c
631
return (n->type == NCMD);
bin/sh/eval.c
642
evalbackcmd(union node *n, struct backcmd *result)
bin/sh/eval.c
656
if (n == NULL) {
bin/sh/eval.c
662
if (is_valid_fast_cmdsubst(n)) {
bin/sh/eval.c
681
evalcommand(n, EV_BACKCMD, result);
bin/sh/eval.c
691
jp = makejob(n, 1);
bin/sh/eval.c
692
if (forkshell(jp, n, FORK_NOJOB) == 0) {
bin/sh/eval.c
699
evaltree(n, EV_EXIT);
bin/sh/eval.c
97
static int is_valid_fast_cmdsubst(union node *n);
bin/sh/exec.c
179
ssize_t n;
bin/sh/exec.c
188
n = pread(in, buf, sizeof buf, 0);
bin/sh/exec.c
190
if (n > 0 && isbinary(buf, n)) {
bin/sh/expand.c
1514
union node *args, *n;
bin/sh/expand.c
1541
for (n = args; n != NULL; n = n->narg.next) {
bin/sh/expand.c
1542
if (n->narg.backquote != NULL) {
bin/sh/expand.c
1549
for (n = args; n != NULL; n = n->narg.next)
bin/sh/expand.c
1550
expandarg(n, &arglist, EXP_FULL | EXP_TILDE);
bin/sh/expand.c
323
expbackq((*argbackq)->n, c & CTLQUOTE, flag, dst);
bin/sh/jobs.c
1002
if (iflag && rootshell && n)
bin/sh/jobs.c
1003
ps->cmd = commandtext(n);
bin/sh/jobs.c
1345
commandtext(union node *n)
bin/sh/jobs.c
1351
cmdtxt(n);
bin/sh/jobs.c
1358
cmdtxtdogroup(union node *n)
bin/sh/jobs.c
1361
cmdtxt(n);
bin/sh/jobs.c
1367
cmdtxtredir(union node *n, const char *op, int deffd)
bin/sh/jobs.c
1371
if (n->nfile.fd != deffd) {
bin/sh/jobs.c
1372
s[0] = n->nfile.fd + '0';
bin/sh/jobs.c
1377
if (n->type == NTOFD || n->type == NFROMFD) {
bin/sh/jobs.c
1378
if (n->ndup.dupfd >= 0)
bin/sh/jobs.c
1379
s[0] = n->ndup.dupfd + '0';
bin/sh/jobs.c
1385
cmdtxt(n->nfile.fname);
bin/sh/jobs.c
1391
cmdtxt(union node *n)
bin/sh/jobs.c
1396
if (n == NULL)
bin/sh/jobs.c
1398
switch (n->type) {
bin/sh/jobs.c
1400
cmdtxt(n->nbinary.ch1);
bin/sh/jobs.c
1402
cmdtxt(n->nbinary.ch2);
bin/sh/jobs.c
1405
cmdtxt(n->nbinary.ch1);
bin/sh/jobs.c
1407
cmdtxt(n->nbinary.ch2);
bin/sh/jobs.c
1410
cmdtxt(n->nbinary.ch1);
bin/sh/jobs.c
1412
cmdtxt(n->nbinary.ch2);
bin/sh/jobs.c
1415
for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {
bin/sh/jobs.c
1416
cmdtxt(lp->n);
bin/sh/jobs.c
1423
cmdtxt(n->nredir.n);
bin/sh/jobs.c
1428
cmdtxt(n->nredir.n);
bin/sh/jobs.c
1432
cmdtxt(n->nif.test);
bin/sh/jobs.c
1434
cmdtxt(n->nif.ifpart);
bin/sh/jobs.c
1439
cmdtxt(n->nbinary.ch1);
bin/sh/jobs.c
1440
cmdtxtdogroup(n->nbinary.ch2);
bin/sh/jobs.c
1444
cmdtxt(n->nbinary.ch1);
bin/sh/jobs.c
1445
cmdtxtdogroup(n->nbinary.ch2);
bin/sh/jobs.c
1449
cmdputs(n->nfor.var);
bin/sh/jobs.c
1454
cmdputs(n->ncase.expr->narg.text);
bin/sh/jobs.c
1458
cmdputs(n->narg.text);
bin/sh/jobs.c
1463
cmdtxt(n->nnot.com);
bin/sh/jobs.c
1466
for (np = n->ncmd.args ; np ; np = np->narg.next) {
bin/sh/jobs.c
1471
for (np = n->ncmd.redirect ; np ; np = np->nfile.next) {
bin/sh/jobs.c
1477
cmdputs(n->narg.text);
bin/sh/jobs.c
1480
cmdtxtredir(n, ">", 1);
bin/sh/jobs.c
1483
cmdtxtredir(n, ">>", 1);
bin/sh/jobs.c
1486
cmdtxtredir(n, ">&", 1);
bin/sh/jobs.c
1489
cmdtxtredir(n, ">|", 1);
bin/sh/jobs.c
1492
cmdtxtredir(n, "<", 0);
bin/sh/jobs.c
1495
cmdtxtredir(n, "<>", 0);
bin/sh/jobs.c
1498
cmdtxtredir(n, "<&", 0);
bin/sh/jobs.c
902
forkshell(struct job *jp, union node *n, int mode)
bin/sh/jobs.c
907
TRACE(("forkshell(%%%td, %p, %d) called\n", jp - jobtab, (void *)n,
bin/sh/main.c
184
union node *n;
bin/sh/main.c
201
n = parsecmd(inter);
bin/sh/main.c
203
if (n == NEOF) {
bin/sh/main.c
212
} else if (n != NULL && nflag == 0) {
bin/sh/main.c
215
evaltree(n, 0);
bin/sh/memalloc.c
309
growstrstackblock(int n, int min)
bin/sh/memalloc.c
312
return stackblock() + n;
bin/sh/memalloc.h
69
#define grabstackblock(n) stalloc(n)
bin/sh/memalloc.h
72
#define CHECKSTRSPACE(n, p) { if ((size_t)(sstrend - p) < n) p = makestrspace(n, p); }
bin/sh/options.c
372
int i, n;
bin/sh/options.c
374
n = 1;
bin/sh/options.c
376
n = number(argv[1]);
bin/sh/options.c
377
if (n > shellparam.nparam)
bin/sh/options.c
380
shellparam.nparam -= n;
bin/sh/options.c
382
for (i = 0; i < n; i++)
bin/sh/options.c
384
memmove(shellparam.p, shellparam.p + n,
bin/sh/output.c
361
int n;
bin/sh/output.c
363
n = nbytes;
bin/sh/output.c
366
i = write(fd, buf, n);
bin/sh/output.c
368
if ((n -= i) <= 0)
bin/sh/output.c
374
return nbytes - n;
bin/sh/parser.c
1091
union node *n;
bin/sh/parser.c
1188
n = list(0);
bin/sh/parser.c
1197
(*nlpp)->n = n;
bin/sh/parser.c
1243
int c, vc, i, n;
bin/sh/parser.c
1314
n = c == 'U' ? 8 : 4;
bin/sh/parser.c
1316
for (i = 0; i < n; i++) {
bin/sh/parser.c
2164
union node n;
bin/sh/parser.c
2181
n.narg.type = NARG;
bin/sh/parser.c
2182
n.narg.next = NULL;
bin/sh/parser.c
2183
n.narg.text = wordtext;
bin/sh/parser.c
2184
n.narg.backquote = backquotelist;
bin/sh/parser.c
2186
expandarg(&n, NULL, 0);
bin/sh/parser.c
246
union node *n, *first = NULL, **pnext;
bin/sh/parser.c
264
n = makename();
bin/sh/parser.c
265
*pnext = n;
bin/sh/parser.c
266
pnext = &n->narg.next;
bin/sh/parser.c
293
n3->nredir.n = n2;
bin/sh/parser.c
349
union node *n;
bin/sh/parser.c
352
n = pipeline();
bin/sh/parser.c
360
return n;
bin/sh/parser.c
362
n = makebinary(t, n, pipeline());
bin/sh/parser.c
388
lp->n = n1;
bin/sh/parser.c
396
lp->n = pipeline();
bin/sh/parser.c
398
lp->n = command();
bin/sh/parser.c
571
n1->nredir.n = list(0);
bin/sh/parser.c
616
n2->nredir.n = n1;
bin/sh/parser.c
631
union node *n = NULL;
bin/sh/parser.c
654
n = makename();
bin/sh/parser.c
655
*app = n;
bin/sh/parser.c
656
app = &n->narg.next;
bin/sh/parser.c
660
*rpp = n = redirnode;
bin/sh/parser.c
661
rpp = &n->nfile.next;
bin/sh/parser.c
674
if (!noexpand(n->narg.text) || quoteflag ||
bin/sh/parser.c
675
strchr(n->narg.text, '/') ||
bin/sh/parser.c
677
n->narg.text[strlen(n->narg.text) - 1]))
bin/sh/parser.c
679
rmescapes(n->narg.text);
bin/sh/parser.c
680
if (find_builtin(n->narg.text, &special) >= 0 &&
bin/sh/parser.c
683
n->type = NDEFUN;
bin/sh/parser.c
684
n->narg.next = command();
bin/sh/parser.c
686
return n;
bin/sh/parser.c
694
n = (union node *)stalloc(sizeof (struct ncmd));
bin/sh/parser.c
695
n->type = NCMD;
bin/sh/parser.c
696
n->ncmd.args = args;
bin/sh/parser.c
697
n->ncmd.redirect = redir;
bin/sh/parser.c
698
return n;
bin/sh/parser.c
704
union node *n;
bin/sh/parser.c
706
n = (union node *)stalloc(sizeof (struct narg));
bin/sh/parser.c
707
n->type = NARG;
bin/sh/parser.c
708
n->narg.next = NULL;
bin/sh/parser.c
709
n->narg.text = wordtext;
bin/sh/parser.c
710
n->narg.backquote = backquotelist;
bin/sh/parser.c
711
return n;
bin/sh/parser.c
717
union node *n;
bin/sh/parser.c
719
n = (union node *)stalloc(sizeof (struct nbinary));
bin/sh/parser.c
720
n->type = type;
bin/sh/parser.c
721
n->nbinary.ch1 = n1;
bin/sh/parser.c
722
n->nbinary.ch2 = n2;
bin/sh/parser.c
723
return (n);
bin/sh/parser.c
733
fixredir(union node *n, const char *text, int err)
bin/sh/parser.c
737
n->ndup.vname = NULL;
bin/sh/parser.c
740
n->ndup.dupfd = digit_val(text[0]);
bin/sh/parser.c
742
n->ndup.dupfd = -1;
bin/sh/parser.c
748
n->ndup.vname = makename();
bin/sh/parser.c
756
union node *n = redirnode;
bin/sh/parser.c
759
if (n->type == NHERE) {
bin/sh/parser.c
764
n->type = NXHERE;
bin/sh/parser.c
765
TRACE(("Here document %d\n", n->type));
bin/sh/parser.c
781
} else if (n->type == NTOFD || n->type == NFROMFD) {
bin/sh/parser.c
782
fixredir(n, wordtext, 0);
bin/sh/parser.c
784
n->nfile.fname = makename();
bin/sh/parser.c
797
union node *n;
bin/sh/parser.c
808
n = makename();
bin/sh/parser.c
809
here->here->nhere.doc = n;
bin/sh/pregenerated/nodes.c
103
union node n;
bin/sh/pregenerated/nodes.c
111
copyfunc(union node *n)
bin/sh/pregenerated/nodes.c
117
if (n == NULL)
bin/sh/pregenerated/nodes.c
119
sz.blocksize = offsetof(struct funcdef, n);
bin/sh/pregenerated/nodes.c
121
calcsize(n, &sz);
bin/sh/pregenerated/nodes.c
124
st.block = (char *)fn + offsetof(struct funcdef, n);
bin/sh/pregenerated/nodes.c
126
copynode(n, &st);
bin/sh/pregenerated/nodes.c
134
return fn == NULL ? NULL : &fn->n;
bin/sh/pregenerated/nodes.c
139
calcsize(union node *n, struct nodesize *result)
bin/sh/pregenerated/nodes.c
141
if (n == NULL)
bin/sh/pregenerated/nodes.c
143
result->blocksize += nodesize[n->type];
bin/sh/pregenerated/nodes.c
144
switch (n->type) {
bin/sh/pregenerated/nodes.c
150
calcsize(n->nbinary.ch2, result);
bin/sh/pregenerated/nodes.c
151
calcsize(n->nbinary.ch1, result);
bin/sh/pregenerated/nodes.c
154
calcsize(n->ncmd.redirect, result);
bin/sh/pregenerated/nodes.c
155
calcsize(n->ncmd.args, result);
bin/sh/pregenerated/nodes.c
158
sizenodelist(n->npipe.cmdlist, result);
bin/sh/pregenerated/nodes.c
163
calcsize(n->nredir.redirect, result);
bin/sh/pregenerated/nodes.c
164
calcsize(n->nredir.n, result);
bin/sh/pregenerated/nodes.c
167
calcsize(n->nif.elsepart, result);
bin/sh/pregenerated/nodes.c
168
calcsize(n->nif.ifpart, result);
bin/sh/pregenerated/nodes.c
169
calcsize(n->nif.test, result);
bin/sh/pregenerated/nodes.c
172
result->stringsize += strlen(n->nfor.var) + 1;
bin/sh/pregenerated/nodes.c
173
calcsize(n->nfor.body, result);
bin/sh/pregenerated/nodes.c
174
calcsize(n->nfor.args, result);
bin/sh/pregenerated/nodes.c
177
calcsize(n->ncase.cases, result);
bin/sh/pregenerated/nodes.c
178
calcsize(n->ncase.expr, result);
bin/sh/pregenerated/nodes.c
182
calcsize(n->nclist.body, result);
bin/sh/pregenerated/nodes.c
183
calcsize(n->nclist.pattern, result);
bin/sh/pregenerated/nodes.c
184
calcsize(n->nclist.next, result);
bin/sh/pregenerated/nodes.c
188
sizenodelist(n->narg.backquote, result);
bin/sh/pregenerated/nodes.c
189
result->stringsize += strlen(n->narg.text) + 1;
bin/sh/pregenerated/nodes.c
190
calcsize(n->narg.next, result);
bin/sh/pregenerated/nodes.c
197
calcsize(n->nfile.fname, result);
bin/sh/pregenerated/nodes.c
198
calcsize(n->nfile.next, result);
bin/sh/pregenerated/nodes.c
202
calcsize(n->ndup.vname, result);
bin/sh/pregenerated/nodes.c
203
calcsize(n->ndup.next, result);
bin/sh/pregenerated/nodes.c
207
calcsize(n->nhere.doc, result);
bin/sh/pregenerated/nodes.c
208
calcsize(n->nhere.next, result);
bin/sh/pregenerated/nodes.c
211
calcsize(n->nnot.com, result);
bin/sh/pregenerated/nodes.c
223
calcsize(lp->n, result);
bin/sh/pregenerated/nodes.c
231
copynode(union node *n, struct nodecopystate *state)
bin/sh/pregenerated/nodes.c
235
if (n == NULL)
bin/sh/pregenerated/nodes.c
238
state->block = (char *)state->block + nodesize[n->type];
bin/sh/pregenerated/nodes.c
239
switch (n->type) {
bin/sh/pregenerated/nodes.c
245
new->nbinary.ch2 = copynode(n->nbinary.ch2, state);
bin/sh/pregenerated/nodes.c
246
new->nbinary.ch1 = copynode(n->nbinary.ch1, state);
bin/sh/pregenerated/nodes.c
249
new->ncmd.redirect = copynode(n->ncmd.redirect, state);
bin/sh/pregenerated/nodes.c
250
new->ncmd.args = copynode(n->ncmd.args, state);
bin/sh/pregenerated/nodes.c
253
new->npipe.cmdlist = copynodelist(n->npipe.cmdlist, state);
bin/sh/pregenerated/nodes.c
254
new->npipe.backgnd = n->npipe.backgnd;
bin/sh/pregenerated/nodes.c
259
new->nredir.redirect = copynode(n->nredir.redirect, state);
bin/sh/pregenerated/nodes.c
260
new->nredir.n = copynode(n->nredir.n, state);
bin/sh/pregenerated/nodes.c
263
new->nif.elsepart = copynode(n->nif.elsepart, state);
bin/sh/pregenerated/nodes.c
264
new->nif.ifpart = copynode(n->nif.ifpart, state);
bin/sh/pregenerated/nodes.c
265
new->nif.test = copynode(n->nif.test, state);
bin/sh/pregenerated/nodes.c
268
new->nfor.var = nodesavestr(n->nfor.var, state);
bin/sh/pregenerated/nodes.c
269
new->nfor.body = copynode(n->nfor.body, state);
bin/sh/pregenerated/nodes.c
270
new->nfor.args = copynode(n->nfor.args, state);
bin/sh/pregenerated/nodes.c
273
new->ncase.cases = copynode(n->ncase.cases, state);
bin/sh/pregenerated/nodes.c
274
new->ncase.expr = copynode(n->ncase.expr, state);
bin/sh/pregenerated/nodes.c
278
new->nclist.body = copynode(n->nclist.body, state);
bin/sh/pregenerated/nodes.c
279
new->nclist.pattern = copynode(n->nclist.pattern, state);
bin/sh/pregenerated/nodes.c
280
new->nclist.next = copynode(n->nclist.next, state);
bin/sh/pregenerated/nodes.c
284
new->narg.backquote = copynodelist(n->narg.backquote, state);
bin/sh/pregenerated/nodes.c
285
new->narg.text = nodesavestr(n->narg.text, state);
bin/sh/pregenerated/nodes.c
286
new->narg.next = copynode(n->narg.next, state);
bin/sh/pregenerated/nodes.c
293
new->nfile.fname = copynode(n->nfile.fname, state);
bin/sh/pregenerated/nodes.c
294
new->nfile.next = copynode(n->nfile.next, state);
bin/sh/pregenerated/nodes.c
295
new->nfile.fd = n->nfile.fd;
bin/sh/pregenerated/nodes.c
299
new->ndup.vname = copynode(n->ndup.vname, state);
bin/sh/pregenerated/nodes.c
300
new->ndup.dupfd = n->ndup.dupfd;
bin/sh/pregenerated/nodes.c
301
new->ndup.next = copynode(n->ndup.next, state);
bin/sh/pregenerated/nodes.c
302
new->ndup.fd = n->ndup.fd;
bin/sh/pregenerated/nodes.c
306
new->nhere.doc = copynode(n->nhere.doc, state);
bin/sh/pregenerated/nodes.c
307
new->nhere.next = copynode(n->nhere.next, state);
bin/sh/pregenerated/nodes.c
308
new->nhere.fd = n->nhere.fd;
bin/sh/pregenerated/nodes.c
311
new->nnot.com = copynode(n->nnot.com, state);
bin/sh/pregenerated/nodes.c
314
new->type = n->type;
bin/sh/pregenerated/nodes.c
330
(*lpp)->n = copynode(lp->n, state);
bin/sh/pregenerated/nodes.h
155
union node *n;
bin/sh/pregenerated/nodes.h
58
union node *n;
bin/sh/redir.c
113
union node *n;
bin/sh/redir.c
136
for (n = redir ; n ; n = n->nfile.next) {
bin/sh/redir.c
137
fd = n->nfile.fd;
bin/sh/redir.c
140
if ((n->nfile.type == NTOFD || n->nfile.type == NFROMFD) &&
bin/sh/redir.c
141
n->ndup.dupfd == fd)
bin/sh/redir.c
165
openredirect(n, memory);
bin/sh/show.c
103
for (lp = n->npipe.cmdlist ; lp ; lp = lp->next) {
bin/sh/show.c
104
shcmd(lp->n, fp);
bin/sh/show.c
108
if (n->npipe.backgnd)
bin/sh/show.c
114
fprintf(fp, "<node type %d>", n->type);
bin/sh/show.c
248
shtree(bqlist->n, -1, NULL, fp);
bin/sh/show.c
65
showtree(union node *n)
bin/sh/show.c
68
shtree(n, 1, NULL, stdout);
bin/sh/show.c
73
shtree(union node *n, int ind, char *pfx, FILE *fp)
bin/sh/show.c
78
if (n == NULL)
bin/sh/show.c
82
switch(n->type) {
bin/sh/show.c
92
shtree(n->nbinary.ch1, ind, NULL, fp);
bin/sh/show.c
95
shtree(n->nbinary.ch2, ind, NULL, fp);
bin/sh/show.c
98
shcmd(n, fp);
bin/sh/trap.c
112
int n;
bin/sh/trap.c
116
for (n = 1; n < sys_nsig; n++)
bin/sh/trap.c
117
if (sys_signame[n] &&
bin/sh/trap.c
118
strcasecmp(sys_signame[n], sig) == 0)
bin/sh/trap.c
119
return (n);
bin/sh/trap.c
131
int n, outlen;
bin/sh/trap.c
134
for (n = 1; n < sys_nsig; n++) {
bin/sh/trap.c
135
if (sys_signame[n]) {
bin/sh/trap.c
136
out1fmt("%s", sys_signame[n]);
bin/sh/trap.c
137
outlen += strlen(sys_signame[n]);
bin/sh/trap.c
139
out1fmt("%d", n);
bin/sh/trap.c
143
if (outlen > 71 || n == sys_nsig - 1) {
bin/sh/var.c
603
int i, n;
bin/sh/var.c
608
n = 0;
bin/sh/var.c
612
n++;
bin/sh/var.c
617
vars = ckmalloc(n * sizeof(*vars));
bin/sh/var.c
626
qsort(vars, n, sizeof(*vars), var_compare);
bin/sh/var.c
627
for (i = 0; i < n; i++) {
bin/stty/print.c
86
#define put(n, f, d) \
bin/stty/print.c
88
bput((n) + on(f));
bin/test/test.c
245
oexpr(enum token n)
bin/test/test.c
249
res = aexpr(n);
bin/test/test.c
259
aexpr(enum token n)
bin/test/test.c
263
res = nexpr(n);
bin/test/test.c
273
nexpr(enum token n)
bin/test/test.c
275
if (n == UNOT)
bin/test/test.c
277
return primary(n);
bin/test/test.c
281
primary(enum token n)
bin/test/test.c
286
if (n == EOI)
bin/test/test.c
288
if (n == LPAREN) {
bin/test/test.c
301
if (TOKEN_TYPE(n) == UNOP) {
bin/test/test.c
305
switch (n) {
bin/test/test.c
313
return filstat(*++t_wp, n);
bin/test/test.c
325
binop(enum token n)
bin/test/test.c
335
switch (n) {
crypto/libressl/apps/nc/atomicio.c
39
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
crypto/libressl/apps/nc/atomicio.c
48
while (n > pos) {
crypto/libressl/apps/nc/atomicio.c
49
res = (f) (fd, s + pos, n - pos);
crypto/libressl/apps/nc/netcat.c
1152
int n, num_fds;
crypto/libressl/apps/nc/netcat.c
1206
for (n = 0; n < 4; n++) {
crypto/libressl/apps/nc/netcat.c
1207
if (pfd[n].revents & (POLLERR|POLLNVAL)) {
crypto/libressl/apps/nc/netcat.c
1208
pfd[n].fd = -1;
crypto/libressl/apps/nc/netcat.c
1340
ssize_t n;
crypto/libressl/apps/nc/netcat.c
1344
n = tls_write(tls, buf, *bufpos);
crypto/libressl/apps/nc/netcat.c
1345
if (n == -1)
crypto/libressl/apps/nc/netcat.c
1348
n = write(fd, buf, *bufpos);
crypto/libressl/apps/nc/netcat.c
1350
if (n == -1 && (errno == EAGAIN || errno == EINTR))
crypto/libressl/apps/nc/netcat.c
1351
n = TLS_WANT_POLLOUT;
crypto/libressl/apps/nc/netcat.c
1353
if (n <= 0)
crypto/libressl/apps/nc/netcat.c
1354
return n;
crypto/libressl/apps/nc/netcat.c
1356
adjust = *bufpos - n;
crypto/libressl/apps/nc/netcat.c
1358
memmove(buf, buf + n, adjust);
crypto/libressl/apps/nc/netcat.c
1359
*bufpos -= n;
crypto/libressl/apps/nc/netcat.c
1360
return n;
crypto/libressl/apps/nc/netcat.c
1367
ssize_t n;
crypto/libressl/apps/nc/netcat.c
1370
n = tls_read(tls, buf + *bufpos, num);
crypto/libressl/apps/nc/netcat.c
1371
if (n == -1)
crypto/libressl/apps/nc/netcat.c
1374
n = read(fd, buf + *bufpos, num);
crypto/libressl/apps/nc/netcat.c
1376
if (n == -1 && (errno == EAGAIN || errno == EINTR))
crypto/libressl/apps/nc/netcat.c
1377
n = TLS_WANT_POLLIN;
crypto/libressl/apps/nc/netcat.c
1379
if (n <= 0)
crypto/libressl/apps/nc/netcat.c
1380
return n;
crypto/libressl/apps/nc/netcat.c
1381
*bufpos += n;
crypto/libressl/apps/nc/netcat.c
1382
return n;
crypto/libressl/apps/nc/netcat.c
1503
char *n;
crypto/libressl/apps/nc/netcat.c
1507
if (isdigit((unsigned char)*p) && (n = strchr(p, '-')) != NULL) {
crypto/libressl/apps/nc/netcat.c
1508
*n = '\0';
crypto/libressl/apps/nc/netcat.c
1509
n++;
crypto/libressl/apps/nc/netcat.c
1512
hi = strtoport(n, uflag);
crypto/libressl/apps/openssl/apps.c
1145
const char *n;
crypto/libressl/apps/openssl/apps.c
1147
n = a[DB_serial];
crypto/libressl/apps/openssl/apps.c
1148
while (*n == '0')
crypto/libressl/apps/openssl/apps.c
1149
n++;
crypto/libressl/apps/openssl/apps.c
1150
return (lh_strhash(n));
crypto/libressl/apps/openssl/apps.c
1244
int ret = 0, n;
crypto/libressl/apps/openssl/apps.c
1248
n = strlcpy(serialpath, serialfile, sizeof serialpath);
crypto/libressl/apps/openssl/apps.c
1250
n = snprintf(serialpath, sizeof serialpath, "%s.%s",
crypto/libressl/apps/openssl/apps.c
1252
if (n < 0 || n >= sizeof(serialpath)) {
crypto/libressl/apps/openssl/apps.c
2258
int *n = arg;
crypto/libressl/apps/openssl/apps.c
2263
fprintf(stderr, " -%-24s%s", name->name, (++*n % 3 != 0 ? "" : "\n"));
crypto/libressl/apps/openssl/ca.c
1755
X509_NAME *n = parse_name(subj, chtype, multirdn);
crypto/libressl/apps/openssl/ca.c
1757
if (n == NULL) {
crypto/libressl/apps/openssl/ca.c
1761
if (!X509_REQ_set_subject_name(req, n)) {
crypto/libressl/apps/openssl/ca.c
1762
X509_NAME_free(n);
crypto/libressl/apps/openssl/ca.c
1765
X509_NAME_free(n);
crypto/libressl/apps/openssl/ca.c
2325
X509_NAME *n = NULL;
crypto/libressl/apps/openssl/ca.c
2364
n = X509_REQ_get_subject_name(req);
crypto/libressl/apps/openssl/ca.c
2398
if (!X509_NAME_add_entry_by_NID(n, nid, chtype,
crypto/libressl/apps/openssl/certhash.c
479
int n;
crypto/libressl/apps/openssl/certhash.c
488
n = readlink(dep->d_name, target, sizeof(target) - 1);
crypto/libressl/apps/openssl/certhash.c
489
if (n == -1) {
crypto/libressl/apps/openssl/certhash.c
493
if (n >= sizeof(target) - 1) {
crypto/libressl/apps/openssl/certhash.c
497
target[n] = '\0';
crypto/libressl/apps/openssl/crl.c
383
unsigned int n;
crypto/libressl/apps/openssl/crl.c
386
if (!X509_CRL_digest(x, digest, md, &n)) {
crypto/libressl/apps/openssl/crl.c
392
for (j = 0; j < (int) n; j++) {
crypto/libressl/apps/openssl/crl.c
394
(j + 1 == (int)n) ? '\n' : ':');
crypto/libressl/apps/openssl/dhparam.c
234
static int dh_cb(int p, int n, BN_GENCB *cb);
crypto/libressl/apps/openssl/dhparam.c
487
dh_cb(int p, int n, BN_GENCB *cb)
crypto/libressl/apps/openssl/dsa.c
215
int n = 0;
crypto/libressl/apps/openssl/dsa.c
226
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
crypto/libressl/apps/openssl/dsaparam.c
159
static int dsa_cb(int p, int n, BN_GENCB *cb);
crypto/libressl/apps/openssl/dsaparam.c
360
dsa_cb(int p, int n, BN_GENCB *cb)
crypto/libressl/apps/openssl/ec.c
244
int n = 0;
crypto/libressl/apps/openssl/ec.c
256
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
crypto/libressl/apps/openssl/ecparam.c
306
size_t n = 0;
crypto/libressl/apps/openssl/ecparam.c
318
for (n = 0; n < crv_len; n++) {
crypto/libressl/apps/openssl/ecparam.c
321
comment = curves[n].comment;
crypto/libressl/apps/openssl/ecparam.c
322
sname = OBJ_nid2sn(curves[n].nid);
crypto/libressl/apps/openssl/enc.c
309
int n = 0;
crypto/libressl/apps/openssl/enc.c
321
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
crypto/libressl/apps/openssl/enc.c
430
unsigned long n;
crypto/libressl/apps/openssl/enc.c
433
for (n = 0; *p != '\0'; p++) {
crypto/libressl/apps/openssl/enc.c
436
n = n * 10 + i - '0';
crypto/libressl/apps/openssl/enc.c
438
n *= 1024;
crypto/libressl/apps/openssl/enc.c
448
if (enc_config.base64 && n < 80)
crypto/libressl/apps/openssl/enc.c
449
n = 80;
crypto/libressl/apps/openssl/enc.c
451
bsize = (int)n;
crypto/libressl/apps/openssl/enc.c
775
int i, n;
crypto/libressl/apps/openssl/enc.c
778
n = strlen(in);
crypto/libressl/apps/openssl/enc.c
779
if (n > (size * 2)) {
crypto/libressl/apps/openssl/enc.c
784
for (i = 0; i < n; i++) {
crypto/libressl/apps/openssl/gendh.c
205
dh_cb(int p, int n, BN_GENCB *cb)
crypto/libressl/apps/openssl/gendh.c
87
static int dh_cb(int p, int n, BN_GENCB *cb);
crypto/libressl/apps/openssl/genrsa.c
376
genrsa_cb(int p, int n, BN_GENCB *cb)
crypto/libressl/apps/openssl/genrsa.c
86
static int genrsa_cb(int p, int n, BN_GENCB *cb);
crypto/libressl/apps/openssl/openssl.c
396
int n, i, ret = 0;
crypto/libressl/apps/openssl/openssl.c
489
n = sizeof buf;
crypto/libressl/apps/openssl/openssl.c
499
if (!fgets(p, n, stdin))
crypto/libressl/apps/openssl/openssl.c
510
n -= i;
crypto/libressl/apps/openssl/passwd.c
307
int n;
crypto/libressl/apps/openssl/passwd.c
359
n = passwd_len;
crypto/libressl/apps/openssl/passwd.c
360
while (n) {
crypto/libressl/apps/openssl/passwd.c
361
if (!EVP_DigestUpdate(md, (n & 1) ? "\0" : passwd, 1))
crypto/libressl/apps/openssl/passwd.c
363
n >>= 1;
crypto/libressl/apps/openssl/pkey.c
200
int n = 0;
crypto/libressl/apps/openssl/pkey.c
212
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
crypto/libressl/apps/openssl/req.c
1055
const BIGNUM *n = NULL;
crypto/libressl/apps/openssl/req.c
1057
RSA_get0_key(EVP_PKEY_get0_RSA(tpubkey), &n, NULL, NULL);
crypto/libressl/apps/openssl/req.c
1059
BN_print(out, n);
crypto/libressl/apps/openssl/req.c
118
static int add_DN_object(X509_NAME * n, char *text, const char *def, char *value,
crypto/libressl/apps/openssl/req.c
1196
X509_NAME *n;
crypto/libressl/apps/openssl/req.c
1198
if (!(n = parse_name(subject, chtype, multirdn)))
crypto/libressl/apps/openssl/req.c
1201
if (!X509_REQ_set_subject_name(req, n)) {
crypto/libressl/apps/openssl/req.c
1202
X509_NAME_free(n);
crypto/libressl/apps/openssl/req.c
1205
X509_NAME_free(n);
crypto/libressl/apps/openssl/req.c
1451
add_DN_object(X509_NAME * n, char *text, const char *def, char *value,
crypto/libressl/apps/openssl/req.c
1493
if (!X509_NAME_add_entry_by_NID(n, nid, chtype,
crypto/libressl/apps/openssl/rsa.c
233
int n = 0;
crypto/libressl/apps/openssl/rsa.c
245
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
crypto/libressl/apps/openssl/s_server.c
1800
int len, n;
crypto/libressl/apps/openssl/s_server.c
1803
n = write(fileno(stdout), buf + len, i - len);
crypto/libressl/apps/openssl/s_server.c
1804
} while (n == -1 && errno == EINTR);
crypto/libressl/apps/openssl/s_server.c
1806
if (n == -1) {
crypto/libressl/apps/openssl/s_server.c
1810
len += n;
crypto/libressl/apps/openssl/speed.c
2042
int n;
crypto/libressl/apps/openssl/speed.c
2053
for (n = 0; n < multi; ++n) {
crypto/libressl/apps/openssl/speed.c
2062
fds[n] = fd[0];
crypto/libressl/apps/openssl/speed.c
2076
printf("Forked child %d\n", n);
crypto/libressl/apps/openssl/speed.c
2080
for (n = 0; n < multi; ++n) {
crypto/libressl/apps/openssl/speed.c
2085
f = fdopen(fds[n], "r");
crypto/libressl/apps/openssl/speed.c
2092
buf, n);
crypto/libressl/apps/openssl/speed.c
2095
printf("Got: %s from %d\n", buf, n);
crypto/libressl/apps/openssl/speed.c
2116
if (n)
crypto/libressl/apps/openssl/speed.c
2122
if (n)
crypto/libressl/apps/openssl/speed.c
2136
if (n)
crypto/libressl/apps/openssl/speed.c
2142
if (n)
crypto/libressl/apps/openssl/speed.c
2157
if (n)
crypto/libressl/apps/openssl/speed.c
2163
if (n)
crypto/libressl/apps/openssl/speed.c
2178
if (n)
crypto/libressl/apps/openssl/speed.c
2184
if (n)
crypto/libressl/apps/openssl/speed.c
2200
if (n)
crypto/libressl/apps/openssl/speed.c
2209
fprintf(stderr, "Unknown type '%s' from child %d\n", buf, n);
crypto/libressl/apps/openssl/x509.c
1056
const BIGNUM *n = NULL;
crypto/libressl/apps/openssl/x509.c
1058
RSA_get0_key(rsa, &n, NULL, NULL);
crypto/libressl/apps/openssl/x509.c
1059
BN_print(STDout, n);
crypto/libressl/apps/openssl/x509.c
1187
unsigned int n;
crypto/libressl/apps/openssl/x509.c
1194
if (!X509_digest(x, fdig, md, &n)) {
crypto/libressl/apps/openssl/x509.c
1200
for (j = 0; j < (int) n; j++) {
crypto/libressl/apps/openssl/x509.c
1202
(j + 1 == (int)n) ? '\n' : ':');
crypto/libressl/crypto/aes/aes_ige.c
101
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
102
outp->data[n] = inp->data[n] ^ ivp->data[n];
crypto/libressl/crypto/aes/aes_ige.c
104
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
105
outp->data[n] ^= iv2p->data[n];
crypto/libressl/crypto/aes/aes_ige.c
124
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
125
tmp2.data[n] = tmp.data[n] ^ iv.data[n];
crypto/libressl/crypto/aes/aes_ige.c
128
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
129
tmp2.data[n] ^= iv2.data[n];
crypto/libressl/crypto/aes/aes_ige.c
152
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
153
tmp.data[n] = inp->data[n] ^ iv2p->data[n];
crypto/libressl/crypto/aes/aes_ige.c
156
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
157
outp->data[n] ^= ivp->data[n];
crypto/libressl/crypto/aes/aes_ige.c
177
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
178
tmp.data[n] ^= iv2.data[n];
crypto/libressl/crypto/aes/aes_ige.c
181
for (n = 0; n < N_WORDS; ++n)
crypto/libressl/crypto/aes/aes_ige.c
182
tmp.data[n] ^= iv.data[n];
crypto/libressl/crypto/aes/aes_ige.c
83
size_t n;
crypto/libressl/crypto/asn1/a_bitstr.c
115
ASN1_BIT_STRING_set_bit(ASN1_BIT_STRING *a, int n, int value)
crypto/libressl/crypto/asn1/a_bitstr.c
120
w = n/8;
crypto/libressl/crypto/asn1/a_bitstr.c
121
v = 1 << (7 - (n & 0x07));
crypto/libressl/crypto/asn1/a_bitstr.c
149
ASN1_BIT_STRING_get_bit(const ASN1_BIT_STRING *a, int n)
crypto/libressl/crypto/asn1/a_bitstr.c
153
w = n / 8;
crypto/libressl/crypto/asn1/a_bitstr.c
154
v = 1 << (7 - (n & 0x07));
crypto/libressl/crypto/asn1/a_enum.c
226
int i, n = 0;
crypto/libressl/crypto/asn1/a_enum.c
236
n = 2;
crypto/libressl/crypto/asn1/a_enum.c
242
n += 2;
crypto/libressl/crypto/asn1/a_enum.c
248
n += 2;
crypto/libressl/crypto/asn1/a_enum.c
251
return (n);
crypto/libressl/crypto/asn1/a_enum.c
261
int i, j,k, m,n, again, bufsize;
crypto/libressl/crypto/asn1/a_enum.c
315
for (n = 0; n < 2; n++) {
crypto/libressl/crypto/asn1/a_enum.c
316
m = bufp[k + n];
crypto/libressl/crypto/asn1/a_int.c
387
int i, n = 0;
crypto/libressl/crypto/asn1/a_int.c
397
n = 1;
crypto/libressl/crypto/asn1/a_int.c
403
n += 2;
crypto/libressl/crypto/asn1/a_int.c
409
n += 2;
crypto/libressl/crypto/asn1/a_int.c
415
n += 2;
crypto/libressl/crypto/asn1/a_int.c
418
return (n);
crypto/libressl/crypto/asn1/a_int.c
428
int i, j,k, m,n, again, bufsize;
crypto/libressl/crypto/asn1/a_int.c
480
for (n = 0; n < 2; n++) {
crypto/libressl/crypto/asn1/a_int.c
481
m = bufp[k + n];
crypto/libressl/crypto/asn1/a_object.c
174
int n;
crypto/libressl/crypto/asn1/a_object.c
178
n = snprintf(s, sizeof(s), fmt, (unsigned long long)arc);
crypto/libressl/crypto/asn1/a_object.c
179
if (n < 0 || (size_t)n >= sizeof(s))
crypto/libressl/crypto/asn1/a_object.c
181
if (!CBB_add_bytes(cbb, s, n))
crypto/libressl/crypto/asn1/a_strex.c
424
do_name_ex(char_io *io_ch, void *arg, const X509_NAME *n, int indent,
crypto/libressl/crypto/asn1/a_strex.c
490
cnt = X509_NAME_entry_count(n);
crypto/libressl/crypto/asn1/a_strex.c
493
ent = X509_NAME_get_entry(n, cnt - i - 1);
crypto/libressl/crypto/asn1/a_strex.c
495
ent = X509_NAME_get_entry(n, i);
crypto/libressl/crypto/asn1/a_string.c
242
int i, n;
crypto/libressl/crypto/asn1/a_string.c
249
n = 0;
crypto/libressl/crypto/asn1/a_string.c
254
buf[n] = '.';
crypto/libressl/crypto/asn1/a_string.c
256
buf[n] = p[i];
crypto/libressl/crypto/asn1/a_string.c
257
n++;
crypto/libressl/crypto/asn1/a_string.c
258
if (n >= 80) {
crypto/libressl/crypto/asn1/a_string.c
259
if (BIO_write(bp, buf, n) <= 0)
crypto/libressl/crypto/asn1/a_string.c
261
n = 0;
crypto/libressl/crypto/asn1/a_string.c
264
if (n > 0) {
crypto/libressl/crypto/asn1/a_string.c
265
if (BIO_write(bp, buf, n) <= 0)
crypto/libressl/crypto/asn1/a_string.c
317
int i, n = 0;
crypto/libressl/crypto/asn1/a_string.c
327
n = 1;
crypto/libressl/crypto/asn1/a_string.c
333
n += 2;
crypto/libressl/crypto/asn1/a_string.c
339
n += 2;
crypto/libressl/crypto/asn1/a_string.c
342
return n;
crypto/libressl/crypto/asn1/a_string.c
352
int i, j, k, m, n, again, bufsize;
crypto/libressl/crypto/asn1/a_string.c
404
for (n = 0; n < 2; n++) {
crypto/libressl/crypto/asn1/a_string.c
405
m = bufp[k + n];
crypto/libressl/crypto/asn1/asn1_item.c
615
int i, j = 0, n, ret = 1;
crypto/libressl/crypto/asn1/asn1_item.c
617
n = ASN1_item_i2d(x, &b, it);
crypto/libressl/crypto/asn1/asn1_item.c
624
i = BIO_write(out, &(b[j]), n);
crypto/libressl/crypto/asn1/asn1_item.c
625
if (i == n)
crypto/libressl/crypto/asn1/asn1_item.c
632
n -= i;
crypto/libressl/crypto/asn1/asn1_old.c
153
int i, j = 0, n, ret = 1;
crypto/libressl/crypto/asn1/asn1_old.c
155
n = i2d(x, NULL);
crypto/libressl/crypto/asn1/asn1_old.c
156
b = malloc(n);
crypto/libressl/crypto/asn1/asn1_old.c
166
i = BIO_write(out, &(b[j]), n);
crypto/libressl/crypto/asn1/asn1_old.c
167
if (i == n)
crypto/libressl/crypto/asn1/asn1_old.c
174
n -= i;
crypto/libressl/crypto/asn1/t_pkey.c
102
for (i = 0; i < n; i++) {
crypto/libressl/crypto/asn1/t_pkey.c
109
((i + 1) == n) ? "" : ":") <= 0)
crypto/libressl/crypto/asn1/t_pkey.c
71
int n, i;
crypto/libressl/crypto/asn1/t_pkey.c
95
n = BN_bn2bin(num, &buf[1]);
crypto/libressl/crypto/asn1/t_pkey.c
98
n++;
crypto/libressl/crypto/asn1/t_spki.c
105
n = spki->signature->length;
crypto/libressl/crypto/asn1/t_spki.c
107
for (i = 0; i < n; i++) {
crypto/libressl/crypto/asn1/t_spki.c
111
((i + 1) == n) ? "" : ":");
crypto/libressl/crypto/asn1/t_spki.c
83
int i, n;
crypto/libressl/crypto/asn1/t_x509.c
309
int i, n;
crypto/libressl/crypto/asn1/t_x509.c
311
n = sig->length;
crypto/libressl/crypto/asn1/t_x509.c
313
for (i = 0; i < n; i++) {
crypto/libressl/crypto/asn1/t_x509.c
321
((i + 1) == n) ? "" : ":") <= 0)
crypto/libressl/crypto/bf/bf_cfb64.c
101
if (n == 0)
crypto/libressl/crypto/bf/bf_cfb64.c
112
c=iv[n];
crypto/libressl/crypto/bf/bf_cfb64.c
113
iv[n]=cc;
crypto/libressl/crypto/bf/bf_cfb64.c
115
n=(n+1)&0x07;
crypto/libressl/crypto/bf/bf_cfb64.c
119
*num=n;
crypto/libressl/crypto/bf/bf_cfb64.c
71
int n= *num;
crypto/libressl/crypto/bf/bf_cfb64.c
81
if (n == 0)
crypto/libressl/crypto/bf/bf_cfb64.c
91
c= *(in++)^iv[n];
crypto/libressl/crypto/bf/bf_cfb64.c
93
iv[n]=c;
crypto/libressl/crypto/bf/bf_cfb64.c
94
n=(n+1)&0x07;
crypto/libressl/crypto/bf/bf_locl.h
109
#define n2ln(c,l1,l2,n) { \
crypto/libressl/crypto/bf/bf_locl.h
110
c+=n; \
crypto/libressl/crypto/bf/bf_locl.h
112
switch (n) { \
crypto/libressl/crypto/bf/bf_locl.h
125
#define l2nn(l1,l2,c,n) { \
crypto/libressl/crypto/bf/bf_locl.h
126
c+=n; \
crypto/libressl/crypto/bf/bf_locl.h
127
switch (n) { \
crypto/libressl/crypto/bf/bf_locl.h
71
#define c2ln(c,l1,l2,n) { \
crypto/libressl/crypto/bf/bf_locl.h
72
c+=n; \
crypto/libressl/crypto/bf/bf_locl.h
74
switch (n) { \
crypto/libressl/crypto/bf/bf_locl.h
94
#define l2cn(l1,l2,c,n) { \
crypto/libressl/crypto/bf/bf_locl.h
95
c+=n; \
crypto/libressl/crypto/bf/bf_locl.h
96
switch (n) { \
crypto/libressl/crypto/bf/bf_ofb64.c
108
*num=n;
crypto/libressl/crypto/bf/bf_ofb64.c
70
int n= *num;
crypto/libressl/crypto/bf/bf_ofb64.c
88
if (n == 0)
crypto/libressl/crypto/bf/bf_ofb64.c
96
*(out++)= *(in++)^d[n];
crypto/libressl/crypto/bf/bf_ofb64.c
97
n=(n+1)&0x07;
crypto/libressl/crypto/bio/b_print.c
101
ret = vsnprintf(buf, n, format, args);
crypto/libressl/crypto/bio/b_print.c
103
if (ret >= n || ret == -1)
crypto/libressl/crypto/bio/b_print.c
82
BIO_snprintf(char *buf, size_t n, const char *format, ...)
crypto/libressl/crypto/bio/b_print.c
88
ret = vsnprintf(buf, n, format, args);
crypto/libressl/crypto/bio/b_print.c
91
if (ret >= n || ret == -1)
crypto/libressl/crypto/bio/b_print.c
97
BIO_vsnprintf(char *buf, size_t n, const char *format, va_list args)
crypto/libressl/crypto/bio/bf_nbio.c
136
unsigned char n;
crypto/libressl/crypto/bio/bf_nbio.c
145
arc4random_buf(&n, 1);
crypto/libressl/crypto/bio/bf_nbio.c
146
num = (n & 0x07);
crypto/libressl/crypto/bio/bf_nbio.c
168
unsigned char n;
crypto/libressl/crypto/bio/bf_nbio.c
182
arc4random_buf(&n, 1);
crypto/libressl/crypto/bio/bf_nbio.c
183
num = (n&7);
crypto/libressl/crypto/bio/bss_acpt.c
433
int n, ret;
crypto/libressl/crypto/bio/bss_acpt.c
435
n = strlen(str);
crypto/libressl/crypto/bio/bss_acpt.c
436
ret = acpt_write(bp, str, n);
crypto/libressl/crypto/bio/bss_conn.c
575
int n, ret;
crypto/libressl/crypto/bio/bss_conn.c
577
n = strlen(str);
crypto/libressl/crypto/bio/bss_conn.c
578
ret = conn_write(bp, str, n);
crypto/libressl/crypto/bio/bss_dgram.c
625
int n, ret;
crypto/libressl/crypto/bio/bss_dgram.c
627
n = strlen(str);
crypto/libressl/crypto/bio/bss_dgram.c
628
ret = dgram_write(bp, str, n);
crypto/libressl/crypto/bio/bss_fd.c
219
int n, ret;
crypto/libressl/crypto/bio/bss_fd.c
221
n = strlen(str);
crypto/libressl/crypto/bio/bss_fd.c
222
ret = fd_write(bp, str, n);
crypto/libressl/crypto/bio/bss_file.c
314
int n, ret;
crypto/libressl/crypto/bio/bss_file.c
316
n = strlen(str);
crypto/libressl/crypto/bio/bss_file.c
317
ret = file_write(bp, str, n);
crypto/libressl/crypto/bio/bss_sock.c
207
int n, ret;
crypto/libressl/crypto/bio/bss_sock.c
209
n = strlen(str);
crypto/libressl/crypto/bio/bss_sock.c
210
ret = sock_write(bp, str, n);
crypto/libressl/crypto/bn/bn_asm.c
133
bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)
crypto/libressl/crypto/bn/bn_asm.c
135
assert(n >= 0);
crypto/libressl/crypto/bn/bn_asm.c
136
if (n <= 0)
crypto/libressl/crypto/bn/bn_asm.c
140
while (n & ~3) {
crypto/libressl/crypto/bn/bn_asm.c
147
n -= 4;
crypto/libressl/crypto/bn/bn_asm.c
150
while (n) {
crypto/libressl/crypto/bn/bn_asm.c
154
n--;
crypto/libressl/crypto/bn/bn_asm.c
227
bn_sqr_words(BN_ULONG *r, const BN_ULONG *a, int n)
crypto/libressl/crypto/bn/bn_asm.c
229
assert(n >= 0);
crypto/libressl/crypto/bn/bn_asm.c
230
if (n <= 0)
crypto/libressl/crypto/bn/bn_asm.c
234
while (n & ~3) {
crypto/libressl/crypto/bn/bn_asm.c
241
n -= 4;
crypto/libressl/crypto/bn/bn_asm.c
244
while (n) {
crypto/libressl/crypto/bn/bn_asm.c
248
n--;
crypto/libressl/crypto/bn/bn_asm.c
335
bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
crypto/libressl/crypto/bn/bn_asm.c
339
assert(n >= 0);
crypto/libressl/crypto/bn/bn_asm.c
340
if (n <= 0)
crypto/libressl/crypto/bn/bn_asm.c
344
while (n & ~3) {
crypto/libressl/crypto/bn/bn_asm.c
360
n -= 4;
crypto/libressl/crypto/bn/bn_asm.c
363
while (n) {
crypto/libressl/crypto/bn/bn_asm.c
370
n--;
crypto/libressl/crypto/bn/bn_asm.c
376
bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
crypto/libressl/crypto/bn/bn_asm.c
380
assert(n >= 0);
crypto/libressl/crypto/bn/bn_asm.c
381
if (n <= 0)
crypto/libressl/crypto/bn/bn_asm.c
386
while (n & ~3) {
crypto/libressl/crypto/bn/bn_asm.c
414
n -= 4;
crypto/libressl/crypto/bn/bn_asm.c
417
while (n) {
crypto/libressl/crypto/bn/bn_asm.c
427
n--;
crypto/libressl/crypto/bn/bn_asm.c
434
bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
crypto/libressl/crypto/bn/bn_asm.c
439
assert(n >= 0);
crypto/libressl/crypto/bn/bn_asm.c
440
if (n <= 0)
crypto/libressl/crypto/bn/bn_asm.c
444
while (n&~3) {
crypto/libressl/crypto/bn/bn_asm.c
468
n -= 4;
crypto/libressl/crypto/bn/bn_asm.c
471
while (n) {
crypto/libressl/crypto/bn/bn_asm.c
480
n--;
crypto/libressl/crypto/bn/bn_blind.c
225
BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_blind.c
227
return BN_BLINDING_convert_ex(n, NULL, b, ctx);
crypto/libressl/crypto/bn/bn_blind.c
231
BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_blind.c
235
bn_check_top(n);
crypto/libressl/crypto/bn/bn_blind.c
253
if (!BN_mod_mul(n, n,b->A, b->mod, ctx))
crypto/libressl/crypto/bn/bn_blind.c
260
BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_blind.c
262
return BN_BLINDING_invert_ex(n, NULL, b, ctx);
crypto/libressl/crypto/bn/bn_blind.c
266
BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_blind.c
270
bn_check_top(n);
crypto/libressl/crypto/bn/bn_blind.c
273
ret = BN_mod_mul(n, n, r, b->mod, ctx);
crypto/libressl/crypto/bn/bn_blind.c
279
ret = BN_mod_mul(n, n, b->Ai, b->mod, ctx);
crypto/libressl/crypto/bn/bn_blind.c
282
bn_check_top(n);
crypto/libressl/crypto/bn/bn_blind.c
294
BN_BLINDING_set_thread_id(BN_BLINDING *b, unsigned long n)
crypto/libressl/crypto/bn/bn_blind.c
296
b->thread_id = n;
crypto/libressl/crypto/bn/bn_bpsw.c
100
if (!bn_div_by_two_mod_odd_n(U, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
106
if (!bn_div_by_two_mod_odd_n(V, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
124
const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_bpsw.c
142
if (!bn_lucas_step(U, V, digit, D, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
159
bn_strong_lucas_test(int *is_prime, const BIGNUM *n, const BIGNUM *D,
crypto/libressl/crypto/bn/bn_bpsw.c
181
while (BN_is_bit_set(n, s))
crypto/libressl/crypto/bn/bn_bpsw.c
183
if (!BN_rshift(k, n, s))
crypto/libressl/crypto/bn/bn_bpsw.c
193
if (!bn_lucas(U, V, k, D, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
207
if (!bn_lucas_step(U, V, 0, D, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
238
bn_strong_lucas_selfridge(int *is_prime, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_bpsw.c
247
if (!bn_is_perfect_square(&is_perfect_square, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
272
if ((jacobi_symbol = BN_kronecker(D, n, ctx)) == -2)
crypto/libressl/crypto/bn/bn_bpsw.c
291
if (!bn_strong_lucas_test(is_prime, n, D, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
30
bn_div_by_two_mod_odd_n(BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_bpsw.c
308
bn_miller_rabin_base_2(int *is_prime, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_bpsw.c
32
if (!BN_is_odd(n))
crypto/libressl/crypto/bn/bn_bpsw.c
323
if (BN_is_word(n, 2) || BN_is_word(n, 3)) {
crypto/libressl/crypto/bn/bn_bpsw.c
328
if (BN_cmp(n, BN_value_one()) <= 0 || !BN_is_odd(n)) {
crypto/libressl/crypto/bn/bn_bpsw.c
333
if (!BN_sub(n_minus_one, n, BN_value_one()))
crypto/libressl/crypto/bn/bn_bpsw.c
352
if (!BN_mod_exp_ct(x, x, k, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
36
if (!BN_add(a, a, n))
crypto/libressl/crypto/bn/bn_bpsw.c
366
if (!BN_mod_sqr(x, x, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
395
bn_is_prime_bpsw(int *is_prime, const BIGNUM *n, BN_CTX *in_ctx)
crypto/libressl/crypto/bn/bn_bpsw.c
402
if (BN_is_word(n, 2)) {
crypto/libressl/crypto/bn/bn_bpsw.c
407
if (BN_cmp(n, BN_value_one()) <= 0 || !BN_is_odd(n)) {
crypto/libressl/crypto/bn/bn_bpsw.c
41
if (!BN_mod_ct(a, a, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
414
if ((mod = BN_mod_word(n, primes[i])) == (BN_ULONG)-1)
crypto/libressl/crypto/bn/bn_bpsw.c
417
*is_prime = BN_is_word(n, primes[i]);
crypto/libressl/crypto/bn/bn_bpsw.c
427
if (!bn_miller_rabin_base_2(is_prime, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
434
if (!bn_strong_lucas_selfridge(is_prime, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
64
const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_bpsw.c
81
if (!BN_mod_mul(U, U, V, n, ctx))
crypto/libressl/crypto/bn/bn_bpsw.c
89
if (!bn_div_by_two_mod_odd_n(V, n, ctx))
crypto/libressl/crypto/bn/bn_gcd.c
117
static BIGNUM *BN_gcd_no_branch(BIGNUM *in, const BIGNUM *a, const BIGNUM *n,
crypto/libressl/crypto/bn/bn_gcd.c
249
const BIGNUM *n, BN_CTX *ctx);
crypto/libressl/crypto/bn/bn_gcd.c
252
BN_mod_inverse_internal(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
crypto/libressl/crypto/bn/bn_gcd.c
260
return BN_mod_inverse_no_branch(in, a, n, ctx);
crypto/libressl/crypto/bn/bn_gcd.c
263
bn_check_top(n);
crypto/libressl/crypto/bn/bn_gcd.c
292
if (BN_copy(A, n) == NULL)
crypto/libressl/crypto/bn/bn_gcd.c
307
if (BN_is_odd(n) && (BN_num_bits(n) <= (BN_BITS <= 32 ? 450 : 2048))) {
crypto/libressl/crypto/bn/bn_gcd.c
331
if (!BN_uadd(X, X, n))
crypto/libressl/crypto/bn/bn_gcd.c
351
if (!BN_uadd(Y, Y, n))
crypto/libressl/crypto/bn/bn_gcd.c
515
if (!BN_sub(Y, n, Y))
crypto/libressl/crypto/bn/bn_gcd.c
522
if (!Y->neg && BN_ucmp(Y, n) < 0) {
crypto/libressl/crypto/bn/bn_gcd.c
526
if (!BN_nnmod(R, Y,n, ctx))
crypto/libressl/crypto/bn/bn_gcd.c
544
BN_mod_inverse(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_gcd.c
547
(BN_get_flags(n, BN_FLG_CONSTTIME) != 0));
crypto/libressl/crypto/bn/bn_gcd.c
548
return BN_mod_inverse_internal(in, a, n, ctx, ct);
crypto/libressl/crypto/bn/bn_gcd.c
552
BN_mod_inverse_nonct(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_gcd.c
554
return BN_mod_inverse_internal(in, a, n, ctx, 0);
crypto/libressl/crypto/bn/bn_gcd.c
558
BN_mod_inverse_ct(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_gcd.c
560
return BN_mod_inverse_internal(in, a, n, ctx, 1);
crypto/libressl/crypto/bn/bn_gcd.c
567
BN_mod_inverse_no_branch(BIGNUM *in, const BIGNUM *a, const BIGNUM *n,
crypto/libressl/crypto/bn/bn_gcd.c
577
bn_check_top(n);
crypto/libressl/crypto/bn/bn_gcd.c
609
if (BN_copy(A, n) == NULL)
crypto/libressl/crypto/bn/bn_gcd.c
704
if (!BN_sub(Y, n, Y))
crypto/libressl/crypto/bn/bn_gcd.c
711
if (!Y->neg && BN_ucmp(Y, n) < 0) {
crypto/libressl/crypto/bn/bn_gcd.c
715
if (!BN_nnmod(R, Y, n, ctx))
crypto/libressl/crypto/bn/bn_gcd.c
737
BN_gcd_no_branch(BIGNUM *in, const BIGNUM *a, const BIGNUM *n,
crypto/libressl/crypto/bn/bn_gcd.c
754
bn_check_top(n);
crypto/libressl/crypto/bn/bn_gcd.c
776
if (BN_copy(A, n) == NULL)
crypto/libressl/crypto/bn/bn_gf2m.c
1014
n = BN_num_bits(b) - 1;
crypto/libressl/crypto/bn/bn_gf2m.c
1015
for (i = n - 1; i >= 0; i--) {
crypto/libressl/crypto/bn/bn_gf2m.c
368
int n, dN, d0, d1;
crypto/libressl/crypto/bn/bn_gf2m.c
404
n = p[0] - p[k];
crypto/libressl/crypto/bn/bn_gf2m.c
405
d0 = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_gf2m.c
407
n /= BN_BITS2;
crypto/libressl/crypto/bn/bn_gf2m.c
408
z[j - n] ^= (zz >> d0);
crypto/libressl/crypto/bn/bn_gf2m.c
410
z[j - n - 1] ^= (zz << d1);
crypto/libressl/crypto/bn/bn_gf2m.c
414
n = dN;
crypto/libressl/crypto/bn/bn_gf2m.c
417
z[j - n] ^= (zz >> d0);
crypto/libressl/crypto/bn/bn_gf2m.c
419
z[j - n - 1] ^= (zz << d1);
crypto/libressl/crypto/bn/bn_gf2m.c
442
n = p[k] / BN_BITS2;
crypto/libressl/crypto/bn/bn_gf2m.c
445
z[n] ^= (zz << d0);
crypto/libressl/crypto/bn/bn_gf2m.c
447
z[n + 1] ^= tmp_ulong;
crypto/libressl/crypto/bn/bn_gf2m.c
995
int ret = 0, i, n;
crypto/libressl/crypto/bn/bn_isqrt.c
110
if (!BN_rshift(b, n, 2 * c - d - e + 1))
crypto/libressl/crypto/bn/bn_isqrt.c
133
if ((cmp = BN_cmp(b, n)) > 0) {
crypto/libressl/crypto/bn/bn_isqrt.c
203
bn_is_perfect_square(int *out_perfect, const BIGNUM *n, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_isqrt.c
209
if (BN_is_negative(n))
crypto/libressl/crypto/bn/bn_isqrt.c
223
r = BN_lsw(n) & 0x3f;
crypto/libressl/crypto/bn/bn_isqrt.c
228
if ((r = BN_mod_word(n, 11 * 63 * 65)) == (BN_ULONG)-1)
crypto/libressl/crypto/bn/bn_isqrt.c
236
return bn_isqrt(NULL, out_perfect, n, ctx);
crypto/libressl/crypto/bn/bn_isqrt.c
45
bn_isqrt(BIGNUM *out_sqrt, int *out_perfect, const BIGNUM *n, BN_CTX *in_ctx)
crypto/libressl/crypto/bn/bn_isqrt.c
58
if (BN_is_negative(n)) {
crypto/libressl/crypto/bn/bn_isqrt.c
75
if (BN_is_zero(n)) {
crypto/libressl/crypto/bn/bn_isqrt.c
85
c = (BN_num_bits(n) - 1) / 2;
crypto/libressl/crypto/bn/bn_lcl.h
497
#define BN_lsw(n) (((n)->top == 0) ? (BN_ULONG) 0 : (n)->d[0])
crypto/libressl/crypto/bn/bn_lcl.h
502
void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp);
crypto/libressl/crypto/bn/bn_lcl.h
505
int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n);
crypto/libressl/crypto/bn/bn_lcl.h
511
int n, int tna, int tnb, BN_ULONG *t);
crypto/libressl/crypto/bn/bn_lcl.h
513
void bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n);
crypto/libressl/crypto/bn/bn_lcl.h
650
BIGNUM *BN_mod_inverse_ct(BIGNUM *ret, const BIGNUM *a, const BIGNUM *n,
crypto/libressl/crypto/bn/bn_lcl.h
652
BIGNUM *BN_mod_inverse_nonct(BIGNUM *ret, const BIGNUM *a, const BIGNUM *n,
crypto/libressl/crypto/bn/bn_lcl.h
659
int bn_isqrt(BIGNUM *out_sqrt, int *out_perfect, const BIGNUM *n, BN_CTX *ctx);
crypto/libressl/crypto/bn/bn_lcl.h
660
int bn_is_perfect_square(int *out_perfect, const BIGNUM *n, BN_CTX *ctx);
crypto/libressl/crypto/bn/bn_lcl.h
662
int bn_is_prime_bpsw(int *is_prime, const BIGNUM *n, BN_CTX *in_ctx);
crypto/libressl/crypto/bn/bn_lib.c
198
BN_set_flags(BIGNUM *b, int n)
crypto/libressl/crypto/bn/bn_lib.c
200
b->flags |= n;
crypto/libressl/crypto/bn/bn_lib.c
204
BN_get_flags(const BIGNUM *b, int n)
crypto/libressl/crypto/bn/bn_lib.c
206
return b->flags & n;
crypto/libressl/crypto/bn/bn_lib.c
571
unsigned int n;
crypto/libressl/crypto/bn/bn_lib.c
583
n = len;
crypto/libressl/crypto/bn/bn_lib.c
584
if (n == 0) {
crypto/libressl/crypto/bn/bn_lib.c
588
i = ((n - 1) / BN_BYTES) + 1;
crypto/libressl/crypto/bn/bn_lib.c
589
m = ((n - 1) % (BN_BYTES));
crypto/libressl/crypto/bn/bn_lib.c
596
while (n--) {
crypto/libressl/crypto/bn/bn_lib.c
619
int n;
crypto/libressl/crypto/bn/bn_lib.c
628
n = BN_num_bytes(a);
crypto/libressl/crypto/bn/bn_lib.c
630
tolen = n;
crypto/libressl/crypto/bn/bn_lib.c
631
else if (tolen < n) { /* uncommon/unlike case */
crypto/libressl/crypto/bn/bn_lib.c
636
n = BN_num_bytes(&temp);
crypto/libressl/crypto/bn/bn_lib.c
637
if (tolen < n)
crypto/libressl/crypto/bn/bn_lib.c
689
unsigned int i, m, n;
crypto/libressl/crypto/bn/bn_lib.c
705
n = len;
crypto/libressl/crypto/bn/bn_lib.c
706
if (n == 0) {
crypto/libressl/crypto/bn/bn_lib.c
711
i = ((n - 1) / BN_BYTES) + 1;
crypto/libressl/crypto/bn/bn_lib.c
712
m = (n - 1) % BN_BYTES;
crypto/libressl/crypto/bn/bn_lib.c
721
while (n-- > 0) {
crypto/libressl/crypto/bn/bn_lib.c
821
BN_set_bit(BIGNUM *a, int n)
crypto/libressl/crypto/bn/bn_lib.c
825
if (n < 0)
crypto/libressl/crypto/bn/bn_lib.c
828
i = n / BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
829
j = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
844
BN_clear_bit(BIGNUM *a, int n)
crypto/libressl/crypto/bn/bn_lib.c
849
if (n < 0)
crypto/libressl/crypto/bn/bn_lib.c
852
i = n / BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
853
j = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
863
BN_is_bit_set(const BIGNUM *a, int n)
crypto/libressl/crypto/bn/bn_lib.c
868
if (n < 0)
crypto/libressl/crypto/bn/bn_lib.c
870
i = n / BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
871
j = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
878
BN_mask_bits(BIGNUM *a, int n)
crypto/libressl/crypto/bn/bn_lib.c
883
if (n < 0)
crypto/libressl/crypto/bn/bn_lib.c
886
w = n / BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
887
b = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_lib.c
910
bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
crypto/libressl/crypto/bn/bn_lib.c
915
aa = a[n - 1];
crypto/libressl/crypto/bn/bn_lib.c
916
bb = b[n - 1];
crypto/libressl/crypto/bn/bn_lib.c
919
for (i = n - 2; i >= 0; i--) {
crypto/libressl/crypto/bn/bn_lib.c
938
int n, i;
crypto/libressl/crypto/bn/bn_lib.c
940
n = cl - 1;
crypto/libressl/crypto/bn/bn_lib.c
944
if (b[n - i] != 0)
crypto/libressl/crypto/bn/bn_lib.c
950
if (a[n + i] != 0)
crypto/libressl/crypto/bn/bn_mod.c
241
BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx)
crypto/libressl/crypto/bn/bn_mod.c
256
ret = BN_mod_lshift_quick(r, r, n, (abs_m ? abs_m : m));
crypto/libressl/crypto/bn/bn_mod.c
266
BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m)
crypto/libressl/crypto/bn/bn_mod.c
273
while (n > 0) {
crypto/libressl/crypto/bn/bn_mod.c
285
if (max_shift > n)
crypto/libressl/crypto/bn/bn_mod.c
286
max_shift = n;
crypto/libressl/crypto/bn/bn_mod.c
291
n -= max_shift;
crypto/libressl/crypto/bn/bn_mod.c
295
--n;
crypto/libressl/crypto/bn/bn_mont.c
188
BIGNUM *n;
crypto/libressl/crypto/bn/bn_mont.c
192
n = &(mont->N);
crypto/libressl/crypto/bn/bn_mont.c
193
nl = n->top;
crypto/libressl/crypto/bn/bn_mont.c
203
r->neg ^= n->neg;
crypto/libressl/crypto/bn/bn_mont.c
204
np = n->d;
crypto/libressl/crypto/bn/bn_mul.c
1148
bn_mul_low_normal(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n)
crypto/libressl/crypto/bn/bn_mul.c
1151
fprintf(stderr, " bn_mul_low_normal %d * %d\n", n, n);
crypto/libressl/crypto/bn/bn_mul.c
1153
bn_mul_words(r, a, n, b[0]);
crypto/libressl/crypto/bn/bn_mul.c
1156
if (--n <= 0)
crypto/libressl/crypto/bn/bn_mul.c
1158
bn_mul_add_words(&(r[1]), a, n, b[1]);
crypto/libressl/crypto/bn/bn_mul.c
1159
if (--n <= 0)
crypto/libressl/crypto/bn/bn_mul.c
1161
bn_mul_add_words(&(r[2]), a, n, b[2]);
crypto/libressl/crypto/bn/bn_mul.c
1162
if (--n <= 0)
crypto/libressl/crypto/bn/bn_mul.c
1164
bn_mul_add_words(&(r[3]), a, n, b[3]);
crypto/libressl/crypto/bn/bn_mul.c
1165
if (--n <= 0)
crypto/libressl/crypto/bn/bn_mul.c
1167
bn_mul_add_words(&(r[4]), a, n, b[4]);
crypto/libressl/crypto/bn/bn_mul.c
438
int n = n2 / 2, c1, c2;
crypto/libressl/crypto/bn/bn_mul.c
439
int tna = n + dna, tnb = n + dnb;
crypto/libressl/crypto/bn/bn_mul.c
470
c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
crypto/libressl/crypto/bn/bn_mul.c
471
c2 = bn_cmp_part_words(&(b[n]), b,tnb, tnb - n);
crypto/libressl/crypto/bn/bn_mul.c
475
bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */
crypto/libressl/crypto/bn/bn_mul.c
476
bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */
crypto/libressl/crypto/bn/bn_mul.c
482
bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */
crypto/libressl/crypto/bn/bn_mul.c
483
bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */
crypto/libressl/crypto/bn/bn_mul.c
492
bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */
crypto/libressl/crypto/bn/bn_mul.c
493
bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */
crypto/libressl/crypto/bn/bn_mul.c
500
bn_sub_part_words(t, a, &(a[n]), tna, n - tna);
crypto/libressl/crypto/bn/bn_mul.c
501
bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n);
crypto/libressl/crypto/bn/bn_mul.c
506
if (n == 4 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba4 could take
crypto/libressl/crypto/bn/bn_mul.c
510
bn_mul_comba4(&(t[n2]), t, &(t[n]));
crypto/libressl/crypto/bn/bn_mul.c
515
bn_mul_comba4(&(r[n2]), &(a[n]), &(b[n]));
crypto/libressl/crypto/bn/bn_mul.c
516
} else if (n == 8 && dna == 0 && dnb == 0) /* XXX: bn_mul_comba8 could
crypto/libressl/crypto/bn/bn_mul.c
521
bn_mul_comba8(&(t[n2]), t, &(t[n]));
crypto/libressl/crypto/bn/bn_mul.c
526
bn_mul_comba8(&(r[n2]), &(a[n]), &(b[n]));
crypto/libressl/crypto/bn/bn_mul.c
532
bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
crypto/libressl/crypto/bn/bn_mul.c
535
bn_mul_recursive(r, a, b, n, 0, 0, p);
crypto/libressl/crypto/bn/bn_mul.c
536
bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]), n, dna, dnb, p);
crypto/libressl/crypto/bn/bn_mul.c
559
c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));
crypto/libressl/crypto/bn/bn_mul.c
561
p = &(r[n + n2]);
crypto/libressl/crypto/bn/bn_mul.c
583
bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n, int tna,
crypto/libressl/crypto/bn/bn_mul.c
586
int i, j, n2 = n * 2;
crypto/libressl/crypto/bn/bn_mul.c
592
n, tna, n, tnb);
crypto/libressl/crypto/bn/bn_mul.c
594
if (n < 8) {
crypto/libressl/crypto/bn/bn_mul.c
595
bn_mul_normal(r, a, n + tna, b, n + tnb);
crypto/libressl/crypto/bn/bn_mul.c
600
c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
crypto/libressl/crypto/bn/bn_mul.c
601
c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
crypto/libressl/crypto/bn/bn_mul.c
605
bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */
crypto/libressl/crypto/bn/bn_mul.c
606
bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */
crypto/libressl/crypto/bn/bn_mul.c
611
bn_sub_part_words(t, &(a[n]), a, tna, tna - n); /* - */
crypto/libressl/crypto/bn/bn_mul.c
612
bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n); /* + */
crypto/libressl/crypto/bn/bn_mul.c
620
bn_sub_part_words(t, a, &(a[n]), tna, n - tna); /* + */
crypto/libressl/crypto/bn/bn_mul.c
621
bn_sub_part_words(&(t[n]), b, &(b[n]), tnb, n - tnb); /* - */
crypto/libressl/crypto/bn/bn_mul.c
627
bn_sub_part_words(t, a, &(a[n]), tna, n - tna);
crypto/libressl/crypto/bn/bn_mul.c
628
bn_sub_part_words(&(t[n]), &(b[n]), b, tnb, tnb - n);
crypto/libressl/crypto/bn/bn_mul.c
634
if (n == 4) {
crypto/libressl/crypto/bn/bn_mul.c
635
bn_mul_comba4(&(t[n2]), t, &(t[n]));
crypto/libressl/crypto/bn/bn_mul.c
637
bn_mul_normal(&(r[n2]), &(a[n]), tn, &(b[n]), tn);
crypto/libressl/crypto/bn/bn_mul.c
641
if (n == 8) {
crypto/libressl/crypto/bn/bn_mul.c
642
bn_mul_comba8(&(t[n2]), t, &(t[n]));
crypto/libressl/crypto/bn/bn_mul.c
644
bn_mul_normal(&(r[n2]), &(a[n]), tna, &(b[n]), tnb);
crypto/libressl/crypto/bn/bn_mul.c
649
bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
crypto/libressl/crypto/bn/bn_mul.c
650
bn_mul_recursive(r, a, b, n, 0, 0, p);
crypto/libressl/crypto/bn/bn_mul.c
651
i = n / 2;
crypto/libressl/crypto/bn/bn_mul.c
659
bn_mul_recursive(&(r[n2]), &(a[n]), &(b[n]),
crypto/libressl/crypto/bn/bn_mul.c
666
bn_mul_part_recursive(&(r[n2]), &(a[n]), &(b[n]),
crypto/libressl/crypto/bn/bn_mul.c
676
bn_mul_normal(&(r[n2]), &(a[n]), tna,
crypto/libressl/crypto/bn/bn_mul.c
677
&(b[n]), tnb);
crypto/libressl/crypto/bn/bn_mul.c
686
&(a[n]), &(b[n]), i,
crypto/libressl/crypto/bn/bn_mul.c
691
&(a[n]), &(b[n]), i,
crypto/libressl/crypto/bn/bn_mul.c
720
c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));
crypto/libressl/crypto/bn/bn_mul.c
722
p = &(r[n + n2]);
crypto/libressl/crypto/bn/bn_mul.c
746
int n = n2 / 2;
crypto/libressl/crypto/bn/bn_mul.c
752
bn_mul_recursive(r, a, b, n, 0, 0, &(t[0]));
crypto/libressl/crypto/bn/bn_mul.c
753
if (n >= BN_MUL_LOW_RECURSIVE_SIZE_NORMAL) {
crypto/libressl/crypto/bn/bn_mul.c
754
bn_mul_low_recursive(&(t[0]), &(a[0]), &(b[n]), n, &(t[n2]));
crypto/libressl/crypto/bn/bn_mul.c
755
bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
756
bn_mul_low_recursive(&(t[0]), &(a[n]), &(b[0]), n, &(t[n2]));
crypto/libressl/crypto/bn/bn_mul.c
757
bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
759
bn_mul_low_normal(&(t[0]), &(a[0]), &(b[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
760
bn_mul_low_normal(&(t[n]), &(a[n]), &(b[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
761
bn_add_words(&(r[n]), &(r[n]), &(t[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
762
bn_add_words(&(r[n]), &(r[n]), &(t[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
775
int i, n;
crypto/libressl/crypto/bn/bn_mul.c
783
n = n2 / 2;
crypto/libressl/crypto/bn/bn_mul.c
787
c1 = bn_cmp_words(&(a[0]), &(a[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
788
c2 = bn_cmp_words(&(b[n]), &(b[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
791
bn_sub_words(&(r[0]), &(a[n]), &(a[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
792
bn_sub_words(&(r[n]), &(b[0]), &(b[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
798
bn_sub_words(&(r[0]), &(a[n]), &(a[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
799
bn_sub_words(&(r[n]), &(b[n]), &(b[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
808
bn_sub_words(&(r[0]), &(a[0]), &(a[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
809
bn_sub_words(&(r[n]), &(b[0]), &(b[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
816
bn_sub_words(&(r[0]), &(a[0]), &(a[n]), n);
crypto/libressl/crypto/bn/bn_mul.c
817
bn_sub_words(&(r[n]), &(b[n]), &(b[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
825
if (n == 8) {
crypto/libressl/crypto/bn/bn_mul.c
826
bn_mul_comba8(&(t[0]), &(r[0]), &(r[n]));
crypto/libressl/crypto/bn/bn_mul.c
827
bn_mul_comba8(r, &(a[n]), &(b[n]));
crypto/libressl/crypto/bn/bn_mul.c
831
bn_mul_recursive(&(t[0]), &(r[0]), &(r[n]), n, 0, 0, &(t[n2]));
crypto/libressl/crypto/bn/bn_mul.c
832
bn_mul_recursive(r, &(a[n]), &(b[n]), n, 0, 0, &(t[n2]));
crypto/libressl/crypto/bn/bn_mul.c
842
lp = &(t[n2 + n]);
crypto/libressl/crypto/bn/bn_mul.c
843
c1 = (int)(bn_add_words(lp, &(r[0]), &(l[0]), n));
crypto/libressl/crypto/bn/bn_mul.c
850
neg = (int)(bn_sub_words(&(t[n2]), lp, &(t[0]), n));
crypto/libressl/crypto/bn/bn_mul.c
852
bn_add_words(&(t[n2]), lp, &(t[0]), n);
crypto/libressl/crypto/bn/bn_mul.c
857
bn_sub_words(&(t[n2 + n]), &(l[n]), &(t[n2]), n);
crypto/libressl/crypto/bn/bn_mul.c
859
lp = &(t[n2 + n]);
crypto/libressl/crypto/bn/bn_mul.c
861
for (i = 0; i < n; i++)
crypto/libressl/crypto/bn/bn_mul.c
880
c1 = (int)(bn_add_words(lp, &(t[n2 + n]), &(l[0]), n));
crypto/libressl/crypto/bn/bn_mul.c
882
lp = &(t[n2 + n]);
crypto/libressl/crypto/bn/bn_mul.c
885
c1 += (int)(bn_add_words(&(t[n2]), lp, &(r[0]), n));
crypto/libressl/crypto/bn/bn_mul.c
887
c1 -= (int)(bn_sub_words(&(t[n2]), &(t[n2]), &(t[0]), n));
crypto/libressl/crypto/bn/bn_mul.c
889
c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), &(t[0]), n));
crypto/libressl/crypto/bn/bn_mul.c
891
c2 = (int)(bn_add_words(&(r[0]), &(r[0]), &(t[n2 + n]), n));
crypto/libressl/crypto/bn/bn_mul.c
892
c2 += (int)(bn_add_words(&(r[0]), &(r[0]), &(r[n]), n));
crypto/libressl/crypto/bn/bn_mul.c
894
c2 -= (int)(bn_sub_words(&(r[0]), &(r[0]), &(t[n]), n));
crypto/libressl/crypto/bn/bn_mul.c
896
c2 += (int)(bn_add_words(&(r[0]), &(r[0]), &(t[n]), n));
crypto/libressl/crypto/bn/bn_mul.c
919
i = n;
crypto/libressl/crypto/bn/bn_nist.c
422
#define bn_cp_64(to, n, from, m) (to)[n] = (m>=0)?((from)[m]):0;
crypto/libressl/crypto/bn/bn_nist.c
423
#define bn_64_set_0(to, n) (to)[n] = (BN_ULONG)0;
crypto/libressl/crypto/bn/bn_nist.c
428
#define bn_cp_32_naked(to, n, from, m) (((n)&1)?(to[(n)/2]|=((m)&1)?(from[(m)/2]&BN_MASK2h):(from[(m)/2]<<32))\
crypto/libressl/crypto/bn/bn_nist.c
429
:(to[(n)/2] =((m)&1)?(from[(m)/2]>>32):(from[(m)/2]&BN_MASK2l)))
crypto/libressl/crypto/bn/bn_nist.c
430
#define bn_32_set_0(to, n) (((n)&1)?(to[(n)/2]&=BN_MASK2l):(to[(n)/2]=0));
crypto/libressl/crypto/bn/bn_nist.c
431
#define bn_cp_32(to,n,from,m) ((m)>=0)?bn_cp_32_naked(to,n,from,m):bn_32_set_0(to,n)
crypto/libressl/crypto/bn/bn_nist.c
440
#define bn_cp_64(to, n, from, m) \
crypto/libressl/crypto/bn/bn_nist.c
442
bn_cp_32(to, (n)*2, from, (m)*2); \
crypto/libressl/crypto/bn/bn_nist.c
443
bn_cp_32(to, (n)*2+1, from, (m)*2+1); \
crypto/libressl/crypto/bn/bn_nist.c
445
#define bn_64_set_0(to, n) \
crypto/libressl/crypto/bn/bn_nist.c
447
bn_32_set_0(to, (n)*2); \
crypto/libressl/crypto/bn/bn_nist.c
448
bn_32_set_0(to, (n)*2+1); \
crypto/libressl/crypto/bn/bn_nist.c
450
#define bn_cp_32(to, n, from, m) (to)[n] = (m>=0)?((from)[m]):0;
crypto/libressl/crypto/bn/bn_nist.c
451
#define bn_32_set_0(to, n) (to)[n] = (BN_ULONG)0;
crypto/libressl/crypto/bn/bn_rand.c
223
int n;
crypto/libressl/crypto/bn/bn_rand.c
231
n = BN_num_bits(range); /* n > 0 */
crypto/libressl/crypto/bn/bn_rand.c
235
if (n == 1)
crypto/libressl/crypto/bn/bn_rand.c
237
else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) {
crypto/libressl/crypto/bn/bn_rand.c
241
if (!bn_rand(r, n + 1, -1, 0))
crypto/libressl/crypto/bn/bn_rand.c
265
if (!bn_rand(r, n, -1, 0))
crypto/libressl/crypto/bn/bn_shift.c
137
BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
crypto/libressl/crypto/bn/bn_shift.c
143
if (n < 0) {
crypto/libressl/crypto/bn/bn_shift.c
152
nw = n / BN_BITS2;
crypto/libressl/crypto/bn/bn_shift.c
155
lb = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_shift.c
179
BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
crypto/libressl/crypto/bn/bn_shift.c
185
if (n < 0) {
crypto/libressl/crypto/bn/bn_shift.c
193
nw = n / BN_BITS2;
crypto/libressl/crypto/bn/bn_shift.c
194
rb = n % BN_BITS2;
crypto/libressl/crypto/bn/bn_shift.c
200
i = (BN_num_bits(a) - n + (BN_BITS2 - 1)) / BN_BITS2;
crypto/libressl/crypto/bn/bn_shift.c
206
if (n == 0)
crypto/libressl/crypto/bn/bn_sqr.c
157
bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
crypto/libressl/crypto/bn/bn_sqr.c
163
max = n * 2;
crypto/libressl/crypto/bn/bn_sqr.c
168
j = n;
crypto/libressl/crypto/bn/bn_sqr.c
176
for (i = n - 2; i > 0; i--) {
crypto/libressl/crypto/bn/bn_sqr.c
187
bn_sqr_words(tmp, a, n);
crypto/libressl/crypto/bn/bn_sqr.c
206
int n = n2 / 2;
crypto/libressl/crypto/bn/bn_sqr.c
233
c1 = bn_cmp_words(a, &(a[n]), n);
crypto/libressl/crypto/bn/bn_sqr.c
236
bn_sub_words(t, a, &(a[n]), n);
crypto/libressl/crypto/bn/bn_sqr.c
238
bn_sub_words(t, &(a[n]), a, n);
crypto/libressl/crypto/bn/bn_sqr.c
246
bn_sqr_recursive(&(t[n2]), t, n, p);
crypto/libressl/crypto/bn/bn_sqr.c
249
bn_sqr_recursive(r, a, n, p);
crypto/libressl/crypto/bn/bn_sqr.c
250
bn_sqr_recursive(&(r[n2]), &(a[n]), n, p);
crypto/libressl/crypto/bn/bn_sqr.c
267
c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2));
crypto/libressl/crypto/bn/bn_sqr.c
269
p = &(r[n + n2]);
crypto/libressl/crypto/buffer/buffer.c
106
size_t n;
crypto/libressl/crypto/buffer/buffer.c
120
n = (len + 3) / 3 * 4;
crypto/libressl/crypto/buffer/buffer.c
121
if ((ret = recallocarray(str->data, str->max, n, 1)) == NULL) {
crypto/libressl/crypto/buffer/buffer.c
126
str->max = n;
crypto/libressl/crypto/bytestring/bs_cbs.c
39
cbs_get(CBS *cbs, const uint8_t **p, size_t n)
crypto/libressl/crypto/bytestring/bs_cbs.c
41
if (cbs->len < n)
crypto/libressl/crypto/bytestring/bs_cbs.c
45
cbs->data += n;
crypto/libressl/crypto/bytestring/bs_cbs.c
46
cbs->len -= n;
crypto/libressl/crypto/bytestring/bs_cbs.c
51
cbs_peek(CBS *cbs, const uint8_t **p, size_t n)
crypto/libressl/crypto/bytestring/bs_cbs.c
53
if (cbs->len < n)
crypto/libressl/crypto/cast/c_cfb64.c
102
if (n == 0)
crypto/libressl/crypto/cast/c_cfb64.c
113
c=iv[n];
crypto/libressl/crypto/cast/c_cfb64.c
114
iv[n]=cc;
crypto/libressl/crypto/cast/c_cfb64.c
116
n=(n+1)&0x07;
crypto/libressl/crypto/cast/c_cfb64.c
120
*num=n;
crypto/libressl/crypto/cast/c_cfb64.c
72
int n= *num;
crypto/libressl/crypto/cast/c_cfb64.c
82
if (n == 0)
crypto/libressl/crypto/cast/c_cfb64.c
92
c= *(in++)^iv[n];
crypto/libressl/crypto/cast/c_cfb64.c
94
iv[n]=c;
crypto/libressl/crypto/cast/c_cfb64.c
95
n=(n+1)&0x07;
crypto/libressl/crypto/cast/c_ofb64.c
109
*num=n;
crypto/libressl/crypto/cast/c_ofb64.c
71
int n= *num;
crypto/libressl/crypto/cast/c_ofb64.c
89
if (n == 0)
crypto/libressl/crypto/cast/c_ofb64.c
97
*(out++)= *(in++)^d[n];
crypto/libressl/crypto/cast/c_ofb64.c
98
n=(n+1)&0x07;
crypto/libressl/crypto/cast/c_skey.c
64
#define CAST_exp(l,A,a,n) \
crypto/libressl/crypto/cast/c_skey.c
65
A[n/4]=l; \
crypto/libressl/crypto/cast/c_skey.c
66
a[n+3]=(l )&0xff; \
crypto/libressl/crypto/cast/c_skey.c
67
a[n+2]=(l>> 8)&0xff; \
crypto/libressl/crypto/cast/c_skey.c
68
a[n+1]=(l>>16)&0xff; \
crypto/libressl/crypto/cast/c_skey.c
69
a[n+0]=(l>>24)&0xff;
crypto/libressl/crypto/cast/cast_lcl.h
105
#define n2ln(c,l1,l2,n) { \
crypto/libressl/crypto/cast/cast_lcl.h
106
c+=n; \
crypto/libressl/crypto/cast/cast_lcl.h
108
switch (n) { \
crypto/libressl/crypto/cast/cast_lcl.h
121
#define l2nn(l1,l2,c,n) { \
crypto/libressl/crypto/cast/cast_lcl.h
122
c+=n; \
crypto/libressl/crypto/cast/cast_lcl.h
123
switch (n) { \
crypto/libressl/crypto/cast/cast_lcl.h
148
#define ROTL(a,n) ((((a)<<(n))&0xffffffffL)|((a)>>((32-(n))&31)))
crypto/libressl/crypto/cast/cast_lcl.h
158
#define E_CAST(n,key,L,R,OP1,OP2,OP3) \
crypto/libressl/crypto/cast/cast_lcl.h
161
t=(key[n*2] OP1 R)&0xffffffffL; \
crypto/libressl/crypto/cast/cast_lcl.h
162
i=key[n*2+1]; \
crypto/libressl/crypto/cast/cast_lcl.h
174
#define E_CAST(n,key,L,R,OP1,OP2,OP3) \
crypto/libressl/crypto/cast/cast_lcl.h
178
w=(key[n*2] OP1 R)&0xffffffffL; \
crypto/libressl/crypto/cast/cast_lcl.h
179
i=key[n*2+1]; \
crypto/libressl/crypto/cast/cast_lcl.h
196
#define E_CAST(n,key,L,R,OP1,OP2,OP3) \
crypto/libressl/crypto/cast/cast_lcl.h
199
t=(key[n*2] OP1 R)&0xffffffff; \
crypto/libressl/crypto/cast/cast_lcl.h
200
t=ROTL(t,(key[n*2+1])); \
crypto/libressl/crypto/cast/cast_lcl.h
67
#define c2ln(c,l1,l2,n) { \
crypto/libressl/crypto/cast/cast_lcl.h
68
c+=n; \
crypto/libressl/crypto/cast/cast_lcl.h
70
switch (n) { \
crypto/libressl/crypto/cast/cast_lcl.h
90
#define l2cn(l1,l2,c,n) { \
crypto/libressl/crypto/cast/cast_lcl.h
91
c+=n; \
crypto/libressl/crypto/cast/cast_lcl.h
92
switch (n) { \
crypto/libressl/crypto/chacha/chacha-merged.c
48
#define ROTL32(v, n) \
crypto/libressl/crypto/chacha/chacha-merged.c
49
(U32V((v) << (n)) | ((v) >> (32 - (n))))
crypto/libressl/crypto/chacha/chacha.c
43
uint64_t n;
crypto/libressl/crypto/chacha/chacha.c
57
if ((n = len) > UINT32_MAX)
crypto/libressl/crypto/chacha/chacha.c
58
n = UINT32_MAX;
crypto/libressl/crypto/chacha/chacha.c
60
chacha_encrypt_bytes((chacha_ctx *)ctx, in, out, (uint32_t)n);
crypto/libressl/crypto/chacha/chacha.c
62
in += n;
crypto/libressl/crypto/chacha/chacha.c
63
out += n;
crypto/libressl/crypto/chacha/chacha.c
64
len -= n;
crypto/libressl/crypto/chacha/chacha.c
73
uint64_t n;
crypto/libressl/crypto/chacha/chacha.c
88
if ((n = len) > UINT32_MAX)
crypto/libressl/crypto/chacha/chacha.c
89
n = UINT32_MAX;
crypto/libressl/crypto/chacha/chacha.c
91
chacha_encrypt_bytes(&ctx, in, out, (uint32_t)n);
crypto/libressl/crypto/chacha/chacha.c
93
in += n;
crypto/libressl/crypto/chacha/chacha.c
94
out += n;
crypto/libressl/crypto/chacha/chacha.c
95
len -= n;
crypto/libressl/crypto/des/cfb64ede.c
100
iv[n]=c;
crypto/libressl/crypto/des/cfb64ede.c
101
n=(n+1)&0x07;
crypto/libressl/crypto/des/cfb64ede.c
108
if (n == 0)
crypto/libressl/crypto/des/cfb64ede.c
125
c=iv[n];
crypto/libressl/crypto/des/cfb64ede.c
126
iv[n]=cc;
crypto/libressl/crypto/des/cfb64ede.c
128
n=(n+1)&0x07;
crypto/libressl/crypto/des/cfb64ede.c
132
*num=n;
crypto/libressl/crypto/des/cfb64ede.c
145
unsigned long l=length,n=((unsigned int)numbits+7)/8;
crypto/libressl/crypto/des/cfb64ede.c
157
while (l >= n)
crypto/libressl/crypto/des/cfb64ede.c
159
l-=n;
crypto/libressl/crypto/des/cfb64ede.c
163
c2ln(in,d0,d1,n);
crypto/libressl/crypto/des/cfb64ede.c
164
in+=n;
crypto/libressl/crypto/des/cfb64ede.c
167
l2cn(d0,d1,out,n);
crypto/libressl/crypto/des/cfb64ede.c
168
out+=n;
crypto/libressl/crypto/des/cfb64ede.c
199
while (l >= n)
crypto/libressl/crypto/des/cfb64ede.c
201
l-=n;
crypto/libressl/crypto/des/cfb64ede.c
205
c2ln(in,d0,d1,n);
crypto/libressl/crypto/des/cfb64ede.c
206
in+=n;
crypto/libressl/crypto/des/cfb64ede.c
235
l2cn(d0,d1,out,n);
crypto/libressl/crypto/des/cfb64ede.c
236
out+=n;
crypto/libressl/crypto/des/cfb64ede.c
73
int n= *num;
crypto/libressl/crypto/des/cfb64ede.c
82
if (n == 0)
crypto/libressl/crypto/des/cfb64ede.c
98
c= *(in++)^iv[n];
crypto/libressl/crypto/des/cfb64enc.c
101
if (n == 0)
crypto/libressl/crypto/des/cfb64enc.c
112
c=iv[n];
crypto/libressl/crypto/des/cfb64enc.c
113
iv[n]=cc;
crypto/libressl/crypto/des/cfb64enc.c
115
n=(n+1)&0x07;
crypto/libressl/crypto/des/cfb64enc.c
119
*num=n;
crypto/libressl/crypto/des/cfb64enc.c
72
int n= *num;
crypto/libressl/crypto/des/cfb64enc.c
81
if (n == 0)
crypto/libressl/crypto/des/cfb64enc.c
91
c= *(in++)^iv[n];
crypto/libressl/crypto/des/cfb64enc.c
93
iv[n]=c;
crypto/libressl/crypto/des/cfb64enc.c
94
n=(n+1)&0x07;
crypto/libressl/crypto/des/cfb_enc.c
102
l2cn(d0,d1,out,n);
crypto/libressl/crypto/des/cfb_enc.c
103
out+=n;
crypto/libressl/crypto/des/cfb_enc.c
139
while (l >= (unsigned long)n)
crypto/libressl/crypto/des/cfb_enc.c
141
l-=n;
crypto/libressl/crypto/des/cfb_enc.c
145
c2ln(in,d0,d1,n);
crypto/libressl/crypto/des/cfb_enc.c
146
in+=n;
crypto/libressl/crypto/des/cfb_enc.c
180
l2cn(d0,d1,out,n);
crypto/libressl/crypto/des/cfb_enc.c
181
out+=n;
crypto/libressl/crypto/des/cfb_enc.c
76
int num=numbits/8,n=(numbits+7)/8,i,rem=numbits%8;
crypto/libressl/crypto/des/cfb_enc.c
92
while (l >= (unsigned long)n)
crypto/libressl/crypto/des/cfb_enc.c
94
l-=n;
crypto/libressl/crypto/des/cfb_enc.c
98
c2ln(in,d0,d1,n);
crypto/libressl/crypto/des/cfb_enc.c
99
in+=n;
crypto/libressl/crypto/des/des_locl.h
123
#define l2cn(l1,l2,c,n) { \
crypto/libressl/crypto/des/des_locl.h
124
c+=n; \
crypto/libressl/crypto/des/des_locl.h
125
switch (n) { \
crypto/libressl/crypto/des/des_locl.h
137
static inline uint32_t ROTATE(uint32_t a, uint32_t n)
crypto/libressl/crypto/des/des_locl.h
139
return (a>>n)+(a<<(32-n));
crypto/libressl/crypto/des/des_locl.h
362
#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
crypto/libressl/crypto/des/des_locl.h
364
(a)^=((t)<<(n)))
crypto/libressl/crypto/des/des_locl.h
88
#define c2ln(c,l1,l2,n) { \
crypto/libressl/crypto/des/des_locl.h
89
c+=n; \
crypto/libressl/crypto/des/des_locl.h
91
switch (n) { \
crypto/libressl/crypto/des/fcrypt_b.c
74
#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
crypto/libressl/crypto/des/fcrypt_b.c
76
(a)^=((t)<<(n)))
crypto/libressl/crypto/des/fcrypt_b.c
79
#define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)),\
crypto/libressl/crypto/des/fcrypt_b.c
80
(a)=(a)^(t)^(t>>(16-(n))))\
crypto/libressl/crypto/des/ofb64ede.c
103
*(out++)= *(in++)^d[n];
crypto/libressl/crypto/des/ofb64ede.c
104
n=(n+1)&0x07;
crypto/libressl/crypto/des/ofb64ede.c
113
*num=n;
crypto/libressl/crypto/des/ofb64ede.c
72
int n= *num;
crypto/libressl/crypto/des/ofb64ede.c
90
if (n == 0)
crypto/libressl/crypto/des/ofb64enc.c
108
*num=n;
crypto/libressl/crypto/des/ofb64enc.c
70
int n= *num;
crypto/libressl/crypto/des/ofb64enc.c
88
if (n == 0)
crypto/libressl/crypto/des/ofb64enc.c
96
*(out++)= *(in++)^d[n];
crypto/libressl/crypto/des/ofb64enc.c
97
n=(n+1)&0x07;
crypto/libressl/crypto/des/set_key.c
157
#define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)),\
crypto/libressl/crypto/des/set_key.c
158
(a)=(a)^(t)^(t>>(16-(n))))
crypto/libressl/crypto/dsa/dsa_gen.c
110
int i, k, n = 0, m = 0, qsize = qbits >> 3;
crypto/libressl/crypto/dsa/dsa_gen.c
233
n = (bits - 1) / 160;
crypto/libressl/crypto/dsa/dsa_gen.c
242
for (k = 0; k <= n; k++) {
crypto/libressl/crypto/ec/ec_lcl.h
430
int ec_GFp_nistp224_group_set_curve(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a, const BIGNUM *n, BN_CTX *);
crypto/libressl/crypto/ec/ec_lcl.h
439
int ec_GFp_nistp256_group_set_curve(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a, const BIGNUM *n, BN_CTX *);
crypto/libressl/crypto/ec/ec_lcl.h
490
int ec_GFp_nistp521_group_set_curve(EC_GROUP *group, const BIGNUM *p, const BIGNUM *a, const BIGNUM *n, BN_CTX *);
crypto/libressl/crypto/engine/eng_int.h
125
#define engine_table_select(t,n) engine_table_select_tmp(t,n,__FILE__,__LINE__)
crypto/libressl/crypto/engine/eng_table.c
194
int n;
crypto/libressl/crypto/engine/eng_table.c
197
while ((n = sk_ENGINE_find(pile->sk, e)) >= 0) {
crypto/libressl/crypto/engine/eng_table.c
198
(void)sk_ENGINE_delete(pile->sk, n);
crypto/libressl/crypto/evp/bio_b64.c
154
int ret = 0, i, ii, j, k, x, n, num, ret_code = 0;
crypto/libressl/crypto/evp/bio_b64.c
279
n = q - p;
crypto/libressl/crypto/evp/bio_b64.c
280
for (ii = 0; ii < n; ii++)
crypto/libressl/crypto/evp/bio_b64.c
282
ctx->tmp_len = n;
crypto/libressl/crypto/evp/bio_b64.c
357
int n;
crypto/libressl/crypto/evp/bio_b64.c
375
n = ctx->buf_len - ctx->buf_off;
crypto/libressl/crypto/evp/bio_b64.c
376
while (n > 0) {
crypto/libressl/crypto/evp/bio_b64.c
377
i = BIO_write(b->next_bio, &(ctx->buf[ctx->buf_off]), n);
crypto/libressl/crypto/evp/bio_b64.c
382
OPENSSL_assert(i <= n);
crypto/libressl/crypto/evp/bio_b64.c
386
n -= i;
crypto/libressl/crypto/evp/bio_b64.c
396
n = (inl > B64_BLOCK_SIZE) ? B64_BLOCK_SIZE : inl;
crypto/libressl/crypto/evp/bio_b64.c
401
n = 3 - ctx->tmp_len;
crypto/libressl/crypto/evp/bio_b64.c
403
if (n > inl)
crypto/libressl/crypto/evp/bio_b64.c
404
n = inl;
crypto/libressl/crypto/evp/bio_b64.c
405
memcpy(&(ctx->tmp[ctx->tmp_len]), in, n);
crypto/libressl/crypto/evp/bio_b64.c
406
ctx->tmp_len += n;
crypto/libressl/crypto/evp/bio_b64.c
407
ret += n;
crypto/libressl/crypto/evp/bio_b64.c
420
if (n < 3) {
crypto/libressl/crypto/evp/bio_b64.c
421
memcpy(ctx->tmp, in, n);
crypto/libressl/crypto/evp/bio_b64.c
422
ctx->tmp_len = n;
crypto/libressl/crypto/evp/bio_b64.c
423
ret += n;
crypto/libressl/crypto/evp/bio_b64.c
426
n -= n % 3;
crypto/libressl/crypto/evp/bio_b64.c
429
(const unsigned char *)in, n);
crypto/libressl/crypto/evp/bio_b64.c
433
ret += n;
crypto/libressl/crypto/evp/bio_b64.c
438
(unsigned char *)in, n))
crypto/libressl/crypto/evp/bio_b64.c
442
ret += n;
crypto/libressl/crypto/evp/bio_b64.c
444
inl -= n;
crypto/libressl/crypto/evp/bio_b64.c
445
in += n;
crypto/libressl/crypto/evp/bio_b64.c
448
n = ctx->buf_len;
crypto/libressl/crypto/evp/bio_b64.c
449
while (n > 0) {
crypto/libressl/crypto/evp/bio_b64.c
450
i = BIO_write(b->next_bio, &(ctx->buf[ctx->buf_off]), n);
crypto/libressl/crypto/evp/bio_b64.c
455
OPENSSL_assert(i <= n);
crypto/libressl/crypto/evp/bio_b64.c
456
n -= i;
crypto/libressl/crypto/evp/bio_enc.c
237
int ret = 0, n, i;
crypto/libressl/crypto/evp/bio_enc.c
244
n = ctx->buf_len - ctx->buf_off;
crypto/libressl/crypto/evp/bio_enc.c
245
while (n > 0) {
crypto/libressl/crypto/evp/bio_enc.c
246
i = BIO_write(b->next_bio, &(ctx->buf[ctx->buf_off]), n);
crypto/libressl/crypto/evp/bio_enc.c
252
n -= i;
crypto/libressl/crypto/evp/bio_enc.c
261
n = (inl > ENC_BLOCK_SIZE) ? ENC_BLOCK_SIZE : inl;
crypto/libressl/crypto/evp/bio_enc.c
264
(unsigned char *)in, n);
crypto/libressl/crypto/evp/bio_enc.c
265
inl -= n;
crypto/libressl/crypto/evp/bio_enc.c
266
in += n;
crypto/libressl/crypto/evp/bio_enc.c
269
n = ctx->buf_len;
crypto/libressl/crypto/evp/bio_enc.c
270
while (n > 0) {
crypto/libressl/crypto/evp/bio_enc.c
271
i = BIO_write(b->next_bio, &(ctx->buf[ctx->buf_off]), n);
crypto/libressl/crypto/evp/bio_enc.c
276
n -= i;
crypto/libressl/crypto/evp/e_aes.c
1273
int n = 8;
crypto/libressl/crypto/evp/e_aes.c
1277
--n;
crypto/libressl/crypto/evp/e_aes.c
1278
c = counter[n];
crypto/libressl/crypto/evp/e_aes.c
1280
counter[n] = c;
crypto/libressl/crypto/evp/e_aes.c
1283
} while (n);
crypto/libressl/crypto/evp/e_des.c
181
size_t n;
crypto/libressl/crypto/evp/e_des.c
187
for (n = 0; n < chunk*8; ++n) {
crypto/libressl/crypto/evp/e_des.c
188
c[0] = (in[n / 8] & (1 << (7 - n % 8))) ? 0x80 : 0;
crypto/libressl/crypto/evp/e_des.c
191
out[n / 8] = (out[n / 8] &
crypto/libressl/crypto/evp/e_des.c
192
~(0x80 >> (unsigned int)(n % 8))) |
crypto/libressl/crypto/evp/e_des.c
193
((d[0] & 0x80) >> (unsigned int)(n % 8));
crypto/libressl/crypto/evp/e_des3.c
218
size_t n;
crypto/libressl/crypto/evp/e_des3.c
223
for (n = 0; n < inl; ++n) {
crypto/libressl/crypto/evp/e_des3.c
224
c[0] = (in[n/8]&(1 << (7 - n % 8))) ? 0x80 : 0;
crypto/libressl/crypto/evp/e_des3.c
228
out[n / 8] = (out[n / 8] & ~(0x80 >> (unsigned int)(n % 8))) |
crypto/libressl/crypto/evp/e_des3.c
229
((d[0] & 0x80) >> (unsigned int)(n % 8));
crypto/libressl/crypto/evp/encode.c
255
int seof = 0, eof = 0, rv = -1, ret = 0, i, v, tmp, n, decoded_len;
crypto/libressl/crypto/evp/encode.c
258
n = ctx->num;
crypto/libressl/crypto/evp/encode.c
261
if (n > 0 && d[n - 1] == '=') {
crypto/libressl/crypto/evp/encode.c
263
if (n > 1 && d[n - 2] == '=')
crypto/libressl/crypto/evp/encode.c
301
if (n >= 64) {
crypto/libressl/crypto/evp/encode.c
312
OPENSSL_assert(n < (int)sizeof(ctx->enc_data));
crypto/libressl/crypto/evp/encode.c
313
d[n++] = tmp;
crypto/libressl/crypto/evp/encode.c
316
if (n == 64) {
crypto/libressl/crypto/evp/encode.c
317
decoded_len = EVP_DecodeBlock(out, d, n);
crypto/libressl/crypto/evp/encode.c
318
n = 0;
crypto/libressl/crypto/evp/encode.c
335
if (n > 0) {
crypto/libressl/crypto/evp/encode.c
336
if ((n & 3) == 0) {
crypto/libressl/crypto/evp/encode.c
337
decoded_len = EVP_DecodeBlock(out, d, n);
crypto/libressl/crypto/evp/encode.c
338
n = 0;
crypto/libressl/crypto/evp/encode.c
351
rv = seof || (n == 0 && eof) ? 0 : 1;
crypto/libressl/crypto/evp/encode.c
355
ctx->num = n;
crypto/libressl/crypto/evp/encode.c
360
EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n)
crypto/libressl/crypto/evp/encode.c
366
while ((conv_ascii2bin(*f) == B64_WS) && (n > 0)) {
crypto/libressl/crypto/evp/encode.c
368
n--;
crypto/libressl/crypto/evp/encode.c
373
while ((n > 3) && (B64_NOT_BASE64(conv_ascii2bin(f[n - 1]))))
crypto/libressl/crypto/evp/encode.c
374
n--;
crypto/libressl/crypto/evp/encode.c
376
if (n % 4 != 0)
crypto/libressl/crypto/evp/encode.c
379
for (i = 0; i < n; i += 4) {
crypto/libressl/crypto/evp/evp_enc.c
392
int n, ret;
crypto/libressl/crypto/evp/evp_enc.c
423
n = b - bl;
crypto/libressl/crypto/evp/evp_enc.c
425
ctx->buf[i] = n;
crypto/libressl/crypto/evp/evp_enc.c
520
int i, n;
crypto/libressl/crypto/evp/evp_enc.c
551
n = ctx->final[b - 1];
crypto/libressl/crypto/evp/evp_enc.c
552
if (n == 0 || n > (int)b) {
crypto/libressl/crypto/evp/evp_enc.c
556
for (i = 0; i < n; i++) {
crypto/libressl/crypto/evp/evp_enc.c
557
if (ctx->final[--b] != n) {
crypto/libressl/crypto/evp/evp_enc.c
562
n = ctx->cipher->block_size - n;
crypto/libressl/crypto/evp/evp_enc.c
563
for (i = 0; i < n; i++)
crypto/libressl/crypto/evp/evp_enc.c
565
*outl = n;
crypto/libressl/crypto/gost/gost2814789.c
213
unsigned int n;
crypto/libressl/crypto/gost/gost2814789.c
216
n = *num;
crypto/libressl/crypto/gost/gost2814789.c
221
while (n && len) {
crypto/libressl/crypto/gost/gost2814789.c
222
*(out++) = ivec[n] ^= *(in++);
crypto/libressl/crypto/gost/gost2814789.c
224
n = (n + 1) % 8;
crypto/libressl/crypto/gost/gost2814789.c
233
for (; n < 8; n += sizeof(size_t)) {
crypto/libressl/crypto/gost/gost2814789.c
234
*(size_t*)(out + n) =
crypto/libressl/crypto/gost/gost2814789.c
235
*(size_t*)(ivec + n) ^=
crypto/libressl/crypto/gost/gost2814789.c
236
*(size_t*)(in + n);
crypto/libressl/crypto/gost/gost2814789.c
241
n = 0;
crypto/libressl/crypto/gost/gost2814789.c
246
out[n] = ivec[n] ^= in[n];
crypto/libressl/crypto/gost/gost2814789.c
247
++n;
crypto/libressl/crypto/gost/gost2814789.c
250
*num = n;
crypto/libressl/crypto/gost/gost2814789.c
256
if (n == 0) {
crypto/libressl/crypto/gost/gost2814789.c
259
out[l] = ivec[n] ^= in[l];
crypto/libressl/crypto/gost/gost2814789.c
261
n = (n + 1) % 8;
crypto/libressl/crypto/gost/gost2814789.c
263
*num = n;
crypto/libressl/crypto/gost/gost2814789.c
267
while (n && len) {
crypto/libressl/crypto/gost/gost2814789.c
270
*(out++) = ivec[n] ^ (c = *(in++));
crypto/libressl/crypto/gost/gost2814789.c
271
ivec[n] = c;
crypto/libressl/crypto/gost/gost2814789.c
273
n = (n + 1) % 8;
crypto/libressl/crypto/gost/gost2814789.c
282
for (; n < 8; n += sizeof(size_t)) {
crypto/libressl/crypto/gost/gost2814789.c
283
size_t t = *(size_t*)(in + n);
crypto/libressl/crypto/gost/gost2814789.c
284
*(size_t*)(out + n) =
crypto/libressl/crypto/gost/gost2814789.c
285
*(size_t*)(ivec + n) ^ t;
crypto/libressl/crypto/gost/gost2814789.c
286
*(size_t*)(ivec + n) = t;
crypto/libressl/crypto/gost/gost2814789.c
291
n = 0;
crypto/libressl/crypto/gost/gost2814789.c
298
out[n] = ivec[n] ^ (c = in[n]);
crypto/libressl/crypto/gost/gost2814789.c
299
ivec[n] = c;
crypto/libressl/crypto/gost/gost2814789.c
300
++n;
crypto/libressl/crypto/gost/gost2814789.c
303
*num = n;
crypto/libressl/crypto/gost/gost2814789.c
311
if (n == 0) {
crypto/libressl/crypto/gost/gost2814789.c
314
out[l] = ivec[n] ^ (c = in[l]); ivec[n] = c;
crypto/libressl/crypto/gost/gost2814789.c
316
n = (n + 1) % 8;
crypto/libressl/crypto/gost/gost2814789.c
318
*num = n;
crypto/libressl/crypto/gost/gost2814789.c
356
unsigned int n;
crypto/libressl/crypto/gost/gost2814789.c
359
n = *num;
crypto/libressl/crypto/gost/gost2814789.c
363
while (n && len) {
crypto/libressl/crypto/gost/gost2814789.c
364
*(out++) = *(in++) ^ cnt_buf[n];
crypto/libressl/crypto/gost/gost2814789.c
366
n = (n + 1) % 8;
crypto/libressl/crypto/gost/gost2814789.c
376
for (; n < 8; n += sizeof(size_t))
crypto/libressl/crypto/gost/gost2814789.c
377
*(size_t *)(out + n) = *(size_t *)(in + n) ^
crypto/libressl/crypto/gost/gost2814789.c
378
*(size_t *)(cnt_buf + n);
crypto/libressl/crypto/gost/gost2814789.c
382
n = 0;
crypto/libressl/crypto/gost/gost2814789.c
387
out[n] = in[n] ^ cnt_buf[n];
crypto/libressl/crypto/gost/gost2814789.c
388
++n;
crypto/libressl/crypto/gost/gost2814789.c
391
*num = n;
crypto/libressl/crypto/gost/gost2814789.c
397
if (n==0)
crypto/libressl/crypto/gost/gost2814789.c
399
out[l] = in[l] ^ cnt_buf[n];
crypto/libressl/crypto/gost/gost2814789.c
401
n = (n + 1) % 8;
crypto/libressl/crypto/gost/gost2814789.c
404
*num=n;
crypto/libressl/crypto/gost/gost2814789.c
455
GOST2814789IMIT(const unsigned char *d, size_t n, unsigned char *md, int nid,
crypto/libressl/crypto/gost/gost2814789.c
466
GOST2814789IMIT_Update(&c, d, n);
crypto/libressl/crypto/gost/gostr341194.c
103
add_blocks(int n, unsigned char *left, const unsigned char *right)
crypto/libressl/crypto/gost/gostr341194.c
109
for (i = 0; i < n; i++) {
crypto/libressl/crypto/gost/gostr341194.c
259
GOSTR341194(const unsigned char *d, size_t n, unsigned char *md, int nid)
crypto/libressl/crypto/gost/gostr341194.c
268
GOSTR341194_Update(&c, d, n);
crypto/libressl/crypto/gost/streebog.c
1287
int n;
crypto/libressl/crypto/gost/streebog.c
1294
n = c->num;
crypto/libressl/crypto/gost/streebog.c
1295
p[n++] = 1;
crypto/libressl/crypto/gost/streebog.c
1296
memset(p + n, 0, STREEBOG_CBLOCK - n);
crypto/libressl/crypto/gost/streebog.c
1303
for (n = 0; n < STREEBOG_LBLOCK; n++)
crypto/libressl/crypto/gost/streebog.c
1304
c->h[n] = SWAB64(c->h[n]);
crypto/libressl/crypto/gost/streebog.c
1312
for (n = 0; n < STREEBOG256_LENGTH / 8; n++) {
crypto/libressl/crypto/gost/streebog.c
1313
STREEBOG_LONG64 t = c->h[4+n];
crypto/libressl/crypto/gost/streebog.c
1337
for (n = 0; n < STREEBOG512_LENGTH / 8; n++) {
crypto/libressl/crypto/gost/streebog.c
1338
STREEBOG_LONG64 t = c->h[n];
crypto/libressl/crypto/gost/streebog.c
1385
size_t n = STREEBOG_CBLOCK - c->num;
crypto/libressl/crypto/gost/streebog.c
1387
if (len < n) {
crypto/libressl/crypto/gost/streebog.c
1392
memcpy(p + c->num, data, n);
crypto/libressl/crypto/gost/streebog.c
1394
len -= n;
crypto/libressl/crypto/gost/streebog.c
1395
data += n;
crypto/libressl/crypto/gost/streebog.c
1449
STREEBOG256(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/gost/streebog.c
1457
STREEBOG256_Update(&c, d, n);
crypto/libressl/crypto/gost/streebog.c
1464
STREEBOG512(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/gost/streebog.c
1472
STREEBOG512_Update(&c, d, n);
crypto/libressl/crypto/hkdf/hkdf.c
75
size_t n, done = 0;
crypto/libressl/crypto/hkdf/hkdf.c
81
n = (out_len + digest_len - 1) / digest_len;
crypto/libressl/crypto/hkdf/hkdf.c
82
if (out_len + digest_len < out_len || n > 255) {
crypto/libressl/crypto/hkdf/hkdf.c
91
for (i = 0; i < n; i++) {
crypto/libressl/crypto/hmac/hmac.c
260
size_t n, unsigned char *md, unsigned int *md_len)
crypto/libressl/crypto/hmac/hmac.c
275
if (!HMAC_Update(&c, d, n))
crypto/libressl/crypto/idea/i_cfb64.c
102
if (n == 0)
crypto/libressl/crypto/idea/i_cfb64.c
113
c=iv[n];
crypto/libressl/crypto/idea/i_cfb64.c
114
iv[n]=cc;
crypto/libressl/crypto/idea/i_cfb64.c
116
n=(n+1)&0x07;
crypto/libressl/crypto/idea/i_cfb64.c
120
*num=n;
crypto/libressl/crypto/idea/i_cfb64.c
72
int n= *num;
crypto/libressl/crypto/idea/i_cfb64.c
82
if (n == 0)
crypto/libressl/crypto/idea/i_cfb64.c
92
c= *(in++)^iv[n];
crypto/libressl/crypto/idea/i_cfb64.c
94
iv[n]=c;
crypto/libressl/crypto/idea/i_cfb64.c
95
n=(n+1)&0x07;
crypto/libressl/crypto/idea/i_ofb64.c
109
*num=n;
crypto/libressl/crypto/idea/i_ofb64.c
71
int n= *num;
crypto/libressl/crypto/idea/i_ofb64.c
89
if (n == 0)
crypto/libressl/crypto/idea/i_ofb64.c
97
*(out++)= *(in++)^d[n];
crypto/libressl/crypto/idea/i_ofb64.c
98
n=(n+1)&0x07;
crypto/libressl/crypto/idea/idea_lcl.h
100
c+=n; \
crypto/libressl/crypto/idea/idea_lcl.h
101
switch (n) { \
crypto/libressl/crypto/idea/idea_lcl.h
83
#define n2ln(c,l1,l2,n) { \
crypto/libressl/crypto/idea/idea_lcl.h
84
c+=n; \
crypto/libressl/crypto/idea/idea_lcl.h
86
switch (n) { \
crypto/libressl/crypto/idea/idea_lcl.h
99
#define l2nn(l1,l2,c,n) { \
crypto/libressl/crypto/lhash/lh_stats.c
103
LHASH_NODE *n;
crypto/libressl/crypto/lhash/lh_stats.c
107
for (n = lh->b[i], num = 0; n != NULL; n = n->next)
crypto/libressl/crypto/lhash/lh_stats.c
116
LHASH_NODE *n;
crypto/libressl/crypto/lhash/lh_stats.c
122
for (n = lh->b[i], num = 0; n != NULL; n = n->next)
crypto/libressl/crypto/lhash/lh_stats.c
217
LHASH_NODE *n;
crypto/libressl/crypto/lhash/lh_stats.c
221
for (n = lh->b[i], num = 0; n != NULL; n = n->next)
crypto/libressl/crypto/lhash/lh_stats.c
230
LHASH_NODE *n;
crypto/libressl/crypto/lhash/lh_stats.c
236
for (n = lh->b[i], num = 0; n != NULL; n = n->next)
crypto/libressl/crypto/lhash/lhash.c
141
LHASH_NODE *n, *nn;
crypto/libressl/crypto/lhash/lhash.c
147
n = lh->b[i];
crypto/libressl/crypto/lhash/lhash.c
148
while (n != NULL) {
crypto/libressl/crypto/lhash/lhash.c
149
nn = n->next;
crypto/libressl/crypto/lhash/lhash.c
150
free(n);
crypto/libressl/crypto/lhash/lhash.c
151
n = nn;
crypto/libressl/crypto/lhash/lhash.c
249
LHASH_NODE *a, *n;
crypto/libressl/crypto/lhash/lhash.c
263
n = a->next;
crypto/libressl/crypto/lhash/lhash.c
268
a = n;
crypto/libressl/crypto/lhash/lhash.c
288
LHASH_NODE **n, **n1, **n2, *np;
crypto/libressl/crypto/lhash/lhash.c
318
n = reallocarray(lh->b, j, sizeof(LHASH_NODE *));
crypto/libressl/crypto/lhash/lhash.c
319
if (n == NULL) {
crypto/libressl/crypto/lhash/lhash.c
327
n[i] = NULL; /* 02/03/92 eay */
crypto/libressl/crypto/lhash/lhash.c
332
lh->b = n;
crypto/libressl/crypto/lhash/lhash.c
339
LHASH_NODE **n, *n1, *np;
crypto/libressl/crypto/lhash/lhash.c
344
n = reallocarray(lh->b, lh->pmax, sizeof(LHASH_NODE *));
crypto/libressl/crypto/lhash/lhash.c
345
if (n == NULL) {
crypto/libressl/crypto/lhash/lhash.c
354
lh->b = n;
crypto/libressl/crypto/lhash/lhash.c
411
unsigned long n, v;
crypto/libressl/crypto/lhash/lhash.c
417
n = 0x100;
crypto/libressl/crypto/lhash/lhash.c
419
v = n | *c;
crypto/libressl/crypto/lhash/lhash.c
420
n += 0x100;
crypto/libressl/crypto/md32_common.h
147
static inline uint32_t ROTATE(uint32_t a, uint32_t n)
crypto/libressl/crypto/md32_common.h
149
return (a<<n)|(a>>(32-n));
crypto/libressl/crypto/md32_common.h
221
size_t n;
crypto/libressl/crypto/md32_common.h
234
n = c->num;
crypto/libressl/crypto/md32_common.h
235
if (n != 0) {
crypto/libressl/crypto/md32_common.h
238
if (len >= HASH_CBLOCK || len + n >= HASH_CBLOCK) {
crypto/libressl/crypto/md32_common.h
239
memcpy (p + n, data, HASH_CBLOCK - n);
crypto/libressl/crypto/md32_common.h
241
n = HASH_CBLOCK - n;
crypto/libressl/crypto/md32_common.h
242
data += n;
crypto/libressl/crypto/md32_common.h
243
len -= n;
crypto/libressl/crypto/md32_common.h
247
memcpy (p + n, data, len);
crypto/libressl/crypto/md32_common.h
253
n = len/HASH_CBLOCK;
crypto/libressl/crypto/md32_common.h
254
if (n > 0) {
crypto/libressl/crypto/md32_common.h
255
HASH_BLOCK_DATA_ORDER (c, data, n);
crypto/libressl/crypto/md32_common.h
256
n *= HASH_CBLOCK;
crypto/libressl/crypto/md32_common.h
257
data += n;
crypto/libressl/crypto/md32_common.h
258
len -= n;
crypto/libressl/crypto/md32_common.h
280
size_t n = c->num;
crypto/libressl/crypto/md32_common.h
282
p[n] = 0x80; /* there is always room for one */
crypto/libressl/crypto/md32_common.h
283
n++;
crypto/libressl/crypto/md32_common.h
285
if (n > (HASH_CBLOCK - 8)) {
crypto/libressl/crypto/md32_common.h
286
memset (p + n, 0, HASH_CBLOCK - n);
crypto/libressl/crypto/md32_common.h
287
n = 0;
crypto/libressl/crypto/md32_common.h
290
memset (p + n, 0, HASH_CBLOCK - 8 - n);
crypto/libressl/crypto/md4/md4_one.c
64
unsigned char *MD4(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/md4/md4_one.c
72
MD4_Update(&c,d,n);
crypto/libressl/crypto/md5/md5_one.c
64
unsigned char *MD5(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/md5/md5_one.c
72
MD5_Update(&c,d,n);
crypto/libressl/crypto/modes/cbc128.c
102
for(n=0; n<16 && n<len; ++n)
crypto/libressl/crypto/modes/cbc128.c
103
out[n] = in[n] ^ iv[n];
crypto/libressl/crypto/modes/cbc128.c
104
for(; n<16; ++n)
crypto/libressl/crypto/modes/cbc128.c
105
out[n] = iv[n];
crypto/libressl/crypto/modes/cbc128.c
120
size_t n;
crypto/libressl/crypto/modes/cbc128.c
131
for(n=0; n<16; ++n)
crypto/libressl/crypto/modes/cbc128.c
132
out[n] ^= iv[n];
crypto/libressl/crypto/modes/cbc128.c
143
for(n=0; n<16/sizeof(size_t); n++)
crypto/libressl/crypto/modes/cbc128.c
144
out_t[n] ^= iv_t[n];
crypto/libressl/crypto/modes/cbc128.c
158
for(n=0; n<16; ++n) {
crypto/libressl/crypto/modes/cbc128.c
159
c = in[n];
crypto/libressl/crypto/modes/cbc128.c
160
out[n] = tmp.c[n] ^ ivec[n];
crypto/libressl/crypto/modes/cbc128.c
161
ivec[n] = c;
crypto/libressl/crypto/modes/cbc128.c
173
for(n=0; n<16/sizeof(size_t); n++) {
crypto/libressl/crypto/modes/cbc128.c
174
c = in_t[n];
crypto/libressl/crypto/modes/cbc128.c
175
out_t[n] = tmp.t[n] ^ ivec_t[n];
crypto/libressl/crypto/modes/cbc128.c
176
ivec_t[n] = c;
crypto/libressl/crypto/modes/cbc128.c
188
for(n=0; n<16 && n<len; ++n) {
crypto/libressl/crypto/modes/cbc128.c
189
c = in[n];
crypto/libressl/crypto/modes/cbc128.c
190
out[n] = tmp.c[n] ^ ivec[n];
crypto/libressl/crypto/modes/cbc128.c
191
ivec[n] = c;
crypto/libressl/crypto/modes/cbc128.c
194
for (; n<16; ++n)
crypto/libressl/crypto/modes/cbc128.c
195
ivec[n] = in[n];
crypto/libressl/crypto/modes/cbc128.c
73
size_t n;
crypto/libressl/crypto/modes/cbc128.c
80
for(n=0; n<16; ++n)
crypto/libressl/crypto/modes/cbc128.c
81
out[n] = in[n] ^ iv[n];
crypto/libressl/crypto/modes/cbc128.c
90
for(n=0; n<16; n+=sizeof(size_t))
crypto/libressl/crypto/modes/cbc128.c
91
*(size_t*)(out+n) =
crypto/libressl/crypto/modes/cbc128.c
92
*(size_t*)(in+n) ^ *(size_t*)(iv+n);
crypto/libressl/crypto/modes/ccm128.c
157
unsigned int n=8;
crypto/libressl/crypto/modes/ccm128.c
162
--n;
crypto/libressl/crypto/modes/ccm128.c
163
c = counter[n];
crypto/libressl/crypto/modes/ccm128.c
165
counter[n] = c;
crypto/libressl/crypto/modes/ccm128.c
167
} while (n);
crypto/libressl/crypto/modes/ccm128.c
174
size_t n;
crypto/libressl/crypto/modes/ccm128.c
186
for (n=0,i=15-L;i<15;++i) {
crypto/libressl/crypto/modes/ccm128.c
187
n |= ctx->nonce.c[i];
crypto/libressl/crypto/modes/ccm128.c
189
n <<= 8;
crypto/libressl/crypto/modes/ccm128.c
191
n |= ctx->nonce.c[15]; /* reconstructed length */
crypto/libressl/crypto/modes/ccm128.c
194
if (n!=len) return -1; /* length mismatch */
crypto/libressl/crypto/modes/ccm128.c
249
size_t n;
crypto/libressl/crypto/modes/ccm128.c
260
for (n=0,i=15-L;i<15;++i) {
crypto/libressl/crypto/modes/ccm128.c
261
n |= ctx->nonce.c[i];
crypto/libressl/crypto/modes/ccm128.c
263
n <<= 8;
crypto/libressl/crypto/modes/ccm128.c
265
n |= ctx->nonce.c[15]; /* reconstructed length */
crypto/libressl/crypto/modes/ccm128.c
268
if (n!=len) return -1;
crypto/libressl/crypto/modes/ccm128.c
312
{ size_t n=8, val=0;
crypto/libressl/crypto/modes/ccm128.c
316
--n;
crypto/libressl/crypto/modes/ccm128.c
317
val += counter[n] + (inc&0xff);
crypto/libressl/crypto/modes/ccm128.c
318
counter[n] = (unsigned char)val;
crypto/libressl/crypto/modes/ccm128.c
321
} while(n && (inc || val));
crypto/libressl/crypto/modes/ccm128.c
328
size_t n;
crypto/libressl/crypto/modes/ccm128.c
340
for (n=0,i=15-L;i<15;++i) {
crypto/libressl/crypto/modes/ccm128.c
341
n |= ctx->nonce.c[i];
crypto/libressl/crypto/modes/ccm128.c
343
n <<= 8;
crypto/libressl/crypto/modes/ccm128.c
345
n |= ctx->nonce.c[15]; /* reconstructed length */
crypto/libressl/crypto/modes/ccm128.c
348
if (n!=len) return -1; /* length mismatch */
crypto/libressl/crypto/modes/ccm128.c
353
if ((n=len/16)) {
crypto/libressl/crypto/modes/ccm128.c
354
(*stream)(inp,out,n,key,ctx->nonce.c,ctx->cmac.c);
crypto/libressl/crypto/modes/ccm128.c
355
n *= 16;
crypto/libressl/crypto/modes/ccm128.c
356
inp += n;
crypto/libressl/crypto/modes/ccm128.c
357
out += n;
crypto/libressl/crypto/modes/ccm128.c
358
len -= n;
crypto/libressl/crypto/modes/ccm128.c
359
if (len) ctr64_add(ctx->nonce.c,n/16);
crypto/libressl/crypto/modes/ccm128.c
385
size_t n;
crypto/libressl/crypto/modes/ccm128.c
396
for (n=0,i=15-L;i<15;++i) {
crypto/libressl/crypto/modes/ccm128.c
397
n |= ctx->nonce.c[i];
crypto/libressl/crypto/modes/ccm128.c
399
n <<= 8;
crypto/libressl/crypto/modes/ccm128.c
401
n |= ctx->nonce.c[15]; /* reconstructed length */
crypto/libressl/crypto/modes/ccm128.c
404
if (n!=len) return -1;
crypto/libressl/crypto/modes/ccm128.c
406
if ((n=len/16)) {
crypto/libressl/crypto/modes/ccm128.c
407
(*stream)(inp,out,n,key,ctx->nonce.c,ctx->cmac.c);
crypto/libressl/crypto/modes/ccm128.c
408
n *= 16;
crypto/libressl/crypto/modes/ccm128.c
409
inp += n;
crypto/libressl/crypto/modes/ccm128.c
410
out += n;
crypto/libressl/crypto/modes/ccm128.c
411
len -= n;
crypto/libressl/crypto/modes/ccm128.c
412
if (len) ctr64_add(ctx->nonce.c,n/16);
crypto/libressl/crypto/modes/cfb128.c
102
out[n] = ivec[n] ^= in[n];
crypto/libressl/crypto/modes/cfb128.c
103
++n;
crypto/libressl/crypto/modes/cfb128.c
106
*num = n;
crypto/libressl/crypto/modes/cfb128.c
112
if (n == 0) {
crypto/libressl/crypto/modes/cfb128.c
115
out[l] = ivec[n] ^= in[l];
crypto/libressl/crypto/modes/cfb128.c
117
n = (n+1) % 16;
crypto/libressl/crypto/modes/cfb128.c
119
*num = n;
crypto/libressl/crypto/modes/cfb128.c
123
while (n && len) {
crypto/libressl/crypto/modes/cfb128.c
125
*(out++) = ivec[n] ^ (c = *(in++)); ivec[n] = c;
crypto/libressl/crypto/modes/cfb128.c
127
n = (n+1) % 16;
crypto/libressl/crypto/modes/cfb128.c
135
for (; n<16; n+=sizeof(size_t)) {
crypto/libressl/crypto/modes/cfb128.c
136
size_t t = *(size_t*)(in+n);
crypto/libressl/crypto/modes/cfb128.c
137
*(size_t*)(out+n) = *(size_t*)(ivec+n) ^ t;
crypto/libressl/crypto/modes/cfb128.c
138
*(size_t*)(ivec+n) = t;
crypto/libressl/crypto/modes/cfb128.c
143
n = 0;
crypto/libressl/crypto/modes/cfb128.c
149
out[n] = ivec[n] ^ (c = in[n]); ivec[n] = c;
crypto/libressl/crypto/modes/cfb128.c
150
++n;
crypto/libressl/crypto/modes/cfb128.c
153
*num = n;
crypto/libressl/crypto/modes/cfb128.c
160
if (n == 0) {
crypto/libressl/crypto/modes/cfb128.c
163
out[l] = ivec[n] ^ (c = in[l]); ivec[n] = c;
crypto/libressl/crypto/modes/cfb128.c
165
n = (n+1) % 16;
crypto/libressl/crypto/modes/cfb128.c
167
*num=n;
crypto/libressl/crypto/modes/cfb128.c
178
int n,rem,num;
crypto/libressl/crypto/modes/cfb128.c
189
for(n=0 ; n < num ; ++n)
crypto/libressl/crypto/modes/cfb128.c
190
out[n] = (ovec[16+n] = in[n] ^ ivec[n]);
crypto/libressl/crypto/modes/cfb128.c
192
for(n=0 ; n < num ; ++n)
crypto/libressl/crypto/modes/cfb128.c
193
out[n] = (ovec[16+n] = in[n]) ^ ivec[n];
crypto/libressl/crypto/modes/cfb128.c
200
for(n=0 ; n < 16 ; ++n)
crypto/libressl/crypto/modes/cfb128.c
201
ivec[n] = ovec[n+num]<<rem | ovec[n+num+1]>>(8-rem);
crypto/libressl/crypto/modes/cfb128.c
212
size_t n;
crypto/libressl/crypto/modes/cfb128.c
215
for(n=0 ; n<bits ; ++n)
crypto/libressl/crypto/modes/cfb128.c
217
c[0]=(in[n/8]&(1 << (7-n%8))) ? 0x80 : 0;
crypto/libressl/crypto/modes/cfb128.c
219
out[n/8]=(out[n/8]&~(1 << (unsigned int)(7-n%8))) |
crypto/libressl/crypto/modes/cfb128.c
220
((d[0]&0x80) >> (unsigned int)(n%8));
crypto/libressl/crypto/modes/cfb128.c
229
size_t n;
crypto/libressl/crypto/modes/cfb128.c
231
for(n=0 ; n<length ; ++n)
crypto/libressl/crypto/modes/cfb128.c
232
cfbr_encrypt_block(&in[n],&out[n],8,key,ivec,enc,block);
crypto/libressl/crypto/modes/cfb128.c
71
unsigned int n;
crypto/libressl/crypto/modes/cfb128.c
74
n = *num;
crypto/libressl/crypto/modes/cfb128.c
79
while (n && len) {
crypto/libressl/crypto/modes/cfb128.c
80
*(out++) = ivec[n] ^= *(in++);
crypto/libressl/crypto/modes/cfb128.c
82
n = (n+1) % 16;
crypto/libressl/crypto/modes/cfb128.c
90
for (; n<16; n+=sizeof(size_t)) {
crypto/libressl/crypto/modes/cfb128.c
91
*(size_t*)(out+n) =
crypto/libressl/crypto/modes/cfb128.c
92
*(size_t*)(ivec+n) ^= *(size_t*)(in+n);
crypto/libressl/crypto/modes/cfb128.c
97
n = 0;
crypto/libressl/crypto/modes/ctr128.c
120
unsigned int n;
crypto/libressl/crypto/modes/ctr128.c
125
n = *num;
crypto/libressl/crypto/modes/ctr128.c
129
while (n && len) {
crypto/libressl/crypto/modes/ctr128.c
130
*(out++) = *(in++) ^ ecount_buf[n];
crypto/libressl/crypto/modes/ctr128.c
132
n = (n+1) % 16;
crypto/libressl/crypto/modes/ctr128.c
142
for (; n<16; n+=sizeof(size_t))
crypto/libressl/crypto/modes/ctr128.c
143
*(size_t *)(out+n) =
crypto/libressl/crypto/modes/ctr128.c
144
*(size_t *)(in+n) ^ *(size_t *)(ecount_buf+n);
crypto/libressl/crypto/modes/ctr128.c
148
n = 0;
crypto/libressl/crypto/modes/ctr128.c
154
out[n] = in[n] ^ ecount_buf[n];
crypto/libressl/crypto/modes/ctr128.c
155
++n;
crypto/libressl/crypto/modes/ctr128.c
158
*num = n;
crypto/libressl/crypto/modes/ctr128.c
164
if (n==0) {
crypto/libressl/crypto/modes/ctr128.c
168
out[l] = in[l] ^ ecount_buf[n];
crypto/libressl/crypto/modes/ctr128.c
170
n = (n+1) % 16;
crypto/libressl/crypto/modes/ctr128.c
173
*num=n;
crypto/libressl/crypto/modes/ctr128.c
178
u32 n=12;
crypto/libressl/crypto/modes/ctr128.c
182
--n;
crypto/libressl/crypto/modes/ctr128.c
183
c = counter[n];
crypto/libressl/crypto/modes/ctr128.c
185
counter[n] = c;
crypto/libressl/crypto/modes/ctr128.c
187
} while (n);
crypto/libressl/crypto/modes/ctr128.c
195
unsigned int n,ctr32;
crypto/libressl/crypto/modes/ctr128.c
199
n = *num;
crypto/libressl/crypto/modes/ctr128.c
201
while (n && len) {
crypto/libressl/crypto/modes/ctr128.c
202
*(out++) = *(in++) ^ ecount_buf[n];
crypto/libressl/crypto/modes/ctr128.c
204
n = (n+1) % 16;
crypto/libressl/crypto/modes/ctr128.c
245
out[n] = in[n] ^ ecount_buf[n];
crypto/libressl/crypto/modes/ctr128.c
246
++n;
crypto/libressl/crypto/modes/ctr128.c
250
*num=n;
crypto/libressl/crypto/modes/ctr128.c
68
u32 n=16;
crypto/libressl/crypto/modes/ctr128.c
72
--n;
crypto/libressl/crypto/modes/ctr128.c
73
c = counter[n];
crypto/libressl/crypto/modes/ctr128.c
75
counter[n] = c;
crypto/libressl/crypto/modes/ctr128.c
77
} while (n);
crypto/libressl/crypto/modes/ctr128.c
87
size_t *data, c, n;
crypto/libressl/crypto/modes/ctr128.c
89
n = 16 / sizeof(size_t);
crypto/libressl/crypto/modes/ctr128.c
91
--n;
crypto/libressl/crypto/modes/ctr128.c
92
c = data[n];
crypto/libressl/crypto/modes/ctr128.c
94
data[n] = c;
crypto/libressl/crypto/modes/ctr128.c
97
} while (n);
crypto/libressl/crypto/modes/gcm128.c
1036
ctx->Xi.c[n] ^= out[n] = in[n]^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1037
++n;
crypto/libressl/crypto/modes/gcm128.c
1041
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1046
if (n==0) {
crypto/libressl/crypto/modes/gcm128.c
1059
ctx->Xi.c[n] ^= out[i] = in[i]^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1060
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
1061
if (n==0)
crypto/libressl/crypto/modes/gcm128.c
1065
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1073
unsigned int n, ctr;
crypto/libressl/crypto/modes/gcm128.c
1107
n = ctx->mres;
crypto/libressl/crypto/modes/gcm128.c
1110
if (n) {
crypto/libressl/crypto/modes/gcm128.c
1111
while (n && len) {
crypto/libressl/crypto/modes/gcm128.c
1113
*(out++) = c^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1114
ctx->Xi.c[n] ^= c;
crypto/libressl/crypto/modes/gcm128.c
1116
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
1118
if (n==0) GCM_MUL (ctx,Xi);
crypto/libressl/crypto/modes/gcm128.c
1120
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1220
u8 c = in[n];
crypto/libressl/crypto/modes/gcm128.c
1221
ctx->Xi.c[n] ^= c;
crypto/libressl/crypto/modes/gcm128.c
1222
out[n] = c^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1223
++n;
crypto/libressl/crypto/modes/gcm128.c
1227
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1233
if (n==0) {
crypto/libressl/crypto/modes/gcm128.c
1247
out[i] = c^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1248
ctx->Xi.c[n] ^= c;
crypto/libressl/crypto/modes/gcm128.c
1249
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
1250
if (n==0)
crypto/libressl/crypto/modes/gcm128.c
1254
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1262
unsigned int n, ctr;
crypto/libressl/crypto/modes/gcm128.c
1295
n = ctx->mres;
crypto/libressl/crypto/modes/gcm128.c
1296
if (n) {
crypto/libressl/crypto/modes/gcm128.c
1297
while (n && len) {
crypto/libressl/crypto/modes/gcm128.c
1298
ctx->Xi.c[n] ^= *(out++) = *(in++)^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1300
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
1302
if (n==0) GCM_MUL(ctx,Xi);
crypto/libressl/crypto/modes/gcm128.c
1304
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1367
ctx->Xi.c[n] ^= out[n] = in[n]^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1368
++n;
crypto/libressl/crypto/modes/gcm128.c
1372
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
1380
unsigned int n, ctr;
crypto/libressl/crypto/modes/gcm128.c
1413
n = ctx->mres;
crypto/libressl/crypto/modes/gcm128.c
1414
if (n) {
crypto/libressl/crypto/modes/gcm128.c
1415
while (n && len) {
crypto/libressl/crypto/modes/gcm128.c
1417
*(out++) = c^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1418
ctx->Xi.c[n] ^= c;
crypto/libressl/crypto/modes/gcm128.c
1420
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
1422
if (n==0) GCM_MUL (ctx,Xi);
crypto/libressl/crypto/modes/gcm128.c
1424
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
149
size_t rem, n = *xi;
crypto/libressl/crypto/modes/gcm128.c
1490
u8 c = in[n];
crypto/libressl/crypto/modes/gcm128.c
1491
ctx->Xi.c[n] ^= c;
crypto/libressl/crypto/modes/gcm128.c
1492
out[n] = c^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
1493
++n;
crypto/libressl/crypto/modes/gcm128.c
1497
ctx->mres = n;
crypto/libressl/crypto/modes/gcm128.c
217
Z.hi ^= Htable[n].hi;
crypto/libressl/crypto/modes/gcm128.c
218
Z.lo ^= Htable[n].lo;
crypto/libressl/crypto/modes/gcm128.c
222
n = *(--xi);
crypto/libressl/crypto/modes/gcm128.c
833
unsigned int n;
crypto/libressl/crypto/modes/gcm128.c
850
n = ctx->ares;
crypto/libressl/crypto/modes/gcm128.c
851
if (n) {
crypto/libressl/crypto/modes/gcm128.c
852
while (n && len) {
crypto/libressl/crypto/modes/gcm128.c
853
ctx->Xi.c[n] ^= *(aad++);
crypto/libressl/crypto/modes/gcm128.c
855
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
857
if (n==0) GCM_MUL(ctx,Xi);
crypto/libressl/crypto/modes/gcm128.c
859
ctx->ares = n;
crypto/libressl/crypto/modes/gcm128.c
879
n = (unsigned int)len;
crypto/libressl/crypto/modes/gcm128.c
883
ctx->ares = n;
crypto/libressl/crypto/modes/gcm128.c
891
unsigned int n, ctr;
crypto/libressl/crypto/modes/gcm128.c
925
n = ctx->mres;
crypto/libressl/crypto/modes/gcm128.c
928
if (n) {
crypto/libressl/crypto/modes/gcm128.c
929
while (n && len) {
crypto/libressl/crypto/modes/gcm128.c
930
ctx->Xi.c[n] ^= *(out++) = *(in++)^ctx->EKi.c[n];
crypto/libressl/crypto/modes/gcm128.c
932
n = (n+1)%16;
crypto/libressl/crypto/modes/gcm128.c
934
if (n==0) GCM_MUL(ctx,Xi);
crypto/libressl/crypto/modes/gcm128.c
936
ctx->mres = n;
crypto/libressl/crypto/modes/ofb128.c
100
out[n] = in[n] ^ ivec[n];
crypto/libressl/crypto/modes/ofb128.c
101
++n;
crypto/libressl/crypto/modes/ofb128.c
104
*num = n;
crypto/libressl/crypto/modes/ofb128.c
110
if (n==0) {
crypto/libressl/crypto/modes/ofb128.c
113
out[l] = in[l] ^ ivec[n];
crypto/libressl/crypto/modes/ofb128.c
115
n = (n+1) % 16;
crypto/libressl/crypto/modes/ofb128.c
118
*num=n;
crypto/libressl/crypto/modes/ofb128.c
71
unsigned int n;
crypto/libressl/crypto/modes/ofb128.c
74
n = *num;
crypto/libressl/crypto/modes/ofb128.c
78
while (n && len) {
crypto/libressl/crypto/modes/ofb128.c
79
*(out++) = *(in++) ^ ivec[n];
crypto/libressl/crypto/modes/ofb128.c
81
n = (n+1) % 16;
crypto/libressl/crypto/modes/ofb128.c
89
for (; n<16; n+=sizeof(size_t))
crypto/libressl/crypto/modes/ofb128.c
90
*(size_t*)(out+n) =
crypto/libressl/crypto/modes/ofb128.c
91
*(size_t*)(in+n) ^ *(size_t*)(ivec+n);
crypto/libressl/crypto/modes/ofb128.c
95
n = 0;
crypto/libressl/crypto/o_time.c
231
long n = (4 * L) / 146097;
crypto/libressl/crypto/o_time.c
234
L = L - (146097 * n + 3) / 4;
crypto/libressl/crypto/o_time.c
241
*y = 100 * (n - 49) + i + L;
crypto/libressl/crypto/objects/o_names.c
267
int n;
crypto/libressl/crypto/objects/o_names.c
279
d->names[d->n++] = name;
crypto/libressl/crypto/objects/o_names.c
296
int n;
crypto/libressl/crypto/objects/o_names.c
301
d.n = 0;
crypto/libressl/crypto/objects/o_names.c
305
qsort((void *)d.names, d.n, sizeof *d.names, do_all_sorted_cmp);
crypto/libressl/crypto/objects/o_names.c
307
for (n = 0; n < d.n; ++n)
crypto/libressl/crypto/objects/o_names.c
308
fn(d.names[n], arg);
crypto/libressl/crypto/objects/obj_dat.c
343
OBJ_nid2obj(int n)
crypto/libressl/crypto/objects/obj_dat.c
348
if ((n >= 0) && (n < NUM_NID)) {
crypto/libressl/crypto/objects/obj_dat.c
349
if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
crypto/libressl/crypto/objects/obj_dat.c
353
return ((ASN1_OBJECT *)&(nid_objs[n]));
crypto/libressl/crypto/objects/obj_dat.c
359
ob.nid = n;
crypto/libressl/crypto/objects/obj_dat.c
371
OBJ_nid2sn(int n)
crypto/libressl/crypto/objects/obj_dat.c
376
if ((n >= 0) && (n < NUM_NID)) {
crypto/libressl/crypto/objects/obj_dat.c
377
if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
crypto/libressl/crypto/objects/obj_dat.c
381
return (nid_objs[n].sn);
crypto/libressl/crypto/objects/obj_dat.c
387
ob.nid = n;
crypto/libressl/crypto/objects/obj_dat.c
399
OBJ_nid2ln(int n)
crypto/libressl/crypto/objects/obj_dat.c
404
if ((n >= 0) && (n < NUM_NID)) {
crypto/libressl/crypto/objects/obj_dat.c
405
if ((n != NID_undef) && (nid_objs[n].nid == NID_undef)) {
crypto/libressl/crypto/objects/obj_dat.c
409
return (nid_objs[n].ln);
crypto/libressl/crypto/objects/obj_dat.c
415
ob.nid = n;
crypto/libressl/crypto/ocsp/ocsp_ext.c
443
OCSP_crlID_new(const char *url, long *n, char *tim)
crypto/libressl/crypto/ocsp/ocsp_ext.c
456
if (n) {
crypto/libressl/crypto/ocsp/ocsp_ext.c
459
if (!(ASN1_INTEGER_set(cid->crlNum, *n)))
crypto/libressl/crypto/ocsp/ocsp_ht.c
265
int i, n;
crypto/libressl/crypto/ocsp/ocsp_ht.c
270
n = BIO_read(rctx->io, rctx->iobuf, rctx->iobuflen);
crypto/libressl/crypto/ocsp/ocsp_ht.c
272
if (n <= 0) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
279
if (BIO_write(rctx->mem, rctx->iobuf, n) != n)
crypto/libressl/crypto/ocsp/ocsp_ht.c
285
n = BIO_get_mem_data(rctx->mem, &p);
crypto/libressl/crypto/ocsp/ocsp_ht.c
287
p + (n - rctx->asn1_len), rctx->asn1_len);
crypto/libressl/crypto/ocsp/ocsp_ht.c
328
n = BIO_get_mem_data(rctx->mem, &p);
crypto/libressl/crypto/ocsp/ocsp_ht.c
329
if ((n <= 0) || !memchr(p, '\n', n)) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
330
if (n >= rctx->iobuflen) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
336
n = BIO_gets(rctx->mem, (char *)rctx->iobuf, rctx->iobuflen);
crypto/libressl/crypto/ocsp/ocsp_ht.c
337
if (n <= 0) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
345
if (n == rctx->iobuflen) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
377
n = BIO_get_mem_data(rctx->mem, &p);
crypto/libressl/crypto/ocsp/ocsp_ht.c
378
if (n < 2)
crypto/libressl/crypto/ocsp/ocsp_ht.c
392
if (n < 6)
crypto/libressl/crypto/ocsp/ocsp_ht.c
394
n = *p & 0x7F;
crypto/libressl/crypto/ocsp/ocsp_ht.c
396
if (!n || (n > 4)) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
402
for (i = 0; i < n; i++) {
crypto/libressl/crypto/ocsp/ocsp_ht.c
412
rctx->asn1_len += n + 2;
crypto/libressl/crypto/ocsp/ocsp_ht.c
421
n = BIO_get_mem_data(rctx->mem, &p);
crypto/libressl/crypto/ocsp/ocsp_ht.c
422
if (n < (int)rctx->asn1_len)
crypto/libressl/crypto/pem/pem_lib.c
598
int nlen, n, i, j, outl;
crypto/libressl/crypto/pem/pem_lib.c
625
n = (int)((len > (PEM_BUFSIZE * 5)) ? (PEM_BUFSIZE * 5) : len);
crypto/libressl/crypto/pem/pem_lib.c
626
if (!EVP_EncodeUpdate(&ctx, buf, &outl, &(data[j]), n))
crypto/libressl/crypto/pem/pem_lib.c
631
len -= n;
crypto/libressl/crypto/pem/pem_lib.c
632
j += n;
crypto/libressl/crypto/pem/pvkfmt.c
383
if (!read_lebn(&p, nbyte, &rsa->n))
crypto/libressl/crypto/pem/pvkfmt.c
579
bitlen = BN_num_bits(rsa->n);
crypto/libressl/crypto/pem/pvkfmt.c
580
nbyte = BN_num_bytes(rsa->n);
crypto/libressl/crypto/pem/pvkfmt.c
581
hnbyte = (BN_num_bits(rsa->n) + 15) >> 4;
crypto/libressl/crypto/pem/pvkfmt.c
611
nbyte = BN_num_bytes(rsa->n);
crypto/libressl/crypto/pem/pvkfmt.c
612
hnbyte = (BN_num_bits(rsa->n) + 15) >> 4;
crypto/libressl/crypto/pem/pvkfmt.c
614
write_lebn(out, rsa->n, -1);
crypto/libressl/crypto/pkcs12/p12_key.c
161
memcpy(out, Ai, min(n, u));
crypto/libressl/crypto/pkcs12/p12_key.c
162
if (u >= n) {
crypto/libressl/crypto/pkcs12/p12_key.c
166
n -= u;
crypto/libressl/crypto/pkcs12/p12_key.c
75
int saltlen, int id, int iter, int n, unsigned char *out,
crypto/libressl/crypto/pkcs12/p12_key.c
90
id, iter, n, out, md_type);
crypto/libressl/crypto/pkcs12/p12_key.c
99
int saltlen, int id, int iter, int n, unsigned char *out,
crypto/libressl/crypto/rc2/rc2_cbc.c
138
int i,n;
crypto/libressl/crypto/rc2/rc2_cbc.c
150
n=3;
crypto/libressl/crypto/rc2/rc2_cbc.c
167
if (--n == 0) break;
crypto/libressl/crypto/rc2/rc2_cbc.c
168
i=(n == 2)?6:5;
crypto/libressl/crypto/rc2/rc2_cbc.c
183
int i,n;
crypto/libressl/crypto/rc2/rc2_cbc.c
195
n=3;
crypto/libressl/crypto/rc2/rc2_cbc.c
213
if (--n == 0) break;
crypto/libressl/crypto/rc2/rc2_cbc.c
214
i=(n == 2)?6:5;
crypto/libressl/crypto/rc2/rc2_locl.h
105
#define n2ln(c,l1,l2,n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
106
c+=n; \
crypto/libressl/crypto/rc2/rc2_locl.h
108
switch (n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
121
#define l2nn(l1,l2,c,n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
122
c+=n; \
crypto/libressl/crypto/rc2/rc2_locl.h
123
switch (n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
147
#define C_RC2(n) \
crypto/libressl/crypto/rc2/rc2_locl.h
67
#define c2ln(c,l1,l2,n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
68
c+=n; \
crypto/libressl/crypto/rc2/rc2_locl.h
70
switch (n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
90
#define l2cn(l1,l2,c,n) { \
crypto/libressl/crypto/rc2/rc2_locl.h
91
c+=n; \
crypto/libressl/crypto/rc2/rc2_locl.h
92
switch (n) { \
crypto/libressl/crypto/rc2/rc2cfb64.c
102
if (n == 0)
crypto/libressl/crypto/rc2/rc2cfb64.c
113
c=iv[n];
crypto/libressl/crypto/rc2/rc2cfb64.c
114
iv[n]=cc;
crypto/libressl/crypto/rc2/rc2cfb64.c
116
n=(n+1)&0x07;
crypto/libressl/crypto/rc2/rc2cfb64.c
120
*num=n;
crypto/libressl/crypto/rc2/rc2cfb64.c
72
int n= *num;
crypto/libressl/crypto/rc2/rc2cfb64.c
82
if (n == 0)
crypto/libressl/crypto/rc2/rc2cfb64.c
92
c= *(in++)^iv[n];
crypto/libressl/crypto/rc2/rc2cfb64.c
94
iv[n]=c;
crypto/libressl/crypto/rc2/rc2cfb64.c
95
n=(n+1)&0x07;
crypto/libressl/crypto/rc2/rc2ofb64.c
109
*num=n;
crypto/libressl/crypto/rc2/rc2ofb64.c
71
int n= *num;
crypto/libressl/crypto/rc2/rc2ofb64.c
89
if (n == 0)
crypto/libressl/crypto/rc2/rc2ofb64.c
97
*(out++)= *(in++)^d[n];
crypto/libressl/crypto/rc2/rc2ofb64.c
98
n=(n+1)&0x07;
crypto/libressl/crypto/rc4/rc4_skey.c
100
#define SK_LOOP(d,n) { \
crypto/libressl/crypto/rc4/rc4_skey.c
101
tmp=d[(n)]; \
crypto/libressl/crypto/rc4/rc4_skey.c
104
d[(n)]=d[id2]; \
crypto/libressl/crypto/ripemd/rmd_one.c
64
unsigned char *RIPEMD160(const unsigned char *d, size_t n,
crypto/libressl/crypto/ripemd/rmd_one.c
73
RIPEMD160_Update(&c,d,n);
crypto/libressl/crypto/rsa/rsa_ameth.c
184
if (BN_cmp(b->pkey.rsa->n, a->pkey.rsa->n) != 0 ||
crypto/libressl/crypto/rsa/rsa_ameth.c
271
return BN_num_bits(pkey->pkey.rsa->n);
crypto/libressl/crypto/rsa/rsa_ameth.c
431
update_buflen(x->n, &buf_len);
crypto/libressl/crypto/rsa/rsa_ameth.c
449
if (x->n != NULL)
crypto/libressl/crypto/rsa/rsa_ameth.c
450
mod_len = BN_num_bits(x->n);
crypto/libressl/crypto/rsa/rsa_ameth.c
469
if (!ASN1_bn_print(bp, str, x->n, m, off))
crypto/libressl/crypto/rsa/rsa_asn1.c
104
.offset = offsetof(RSA, n),
crypto/libressl/crypto/rsa/rsa_asn1.c
182
.offset = offsetof(RSA, n),
crypto/libressl/crypto/rsa/rsa_chk.c
118
if (BN_cmp(i, key->n) != 0) {
crypto/libressl/crypto/rsa/rsa_chk.c
66
if (!key->p || !key->q || !key->n || !key->e || !key->d) {
crypto/libressl/crypto/rsa/rsa_crpt.c
182
BIGNUM n;
crypto/libressl/crypto/rsa/rsa_crpt.c
203
BN_init(&n);
crypto/libressl/crypto/rsa/rsa_crpt.c
204
BN_with_flags(&n, rsa->n, BN_FLG_CONSTTIME);
crypto/libressl/crypto/rsa/rsa_crpt.c
206
ret = BN_BLINDING_create_param(NULL, e, &n, ctx, rsa->meth->bn_mod_exp,
crypto/libressl/crypto/rsa/rsa_crpt.c
79
return BN_num_bits(r->n);
crypto/libressl/crypto/rsa/rsa_crpt.c
85
return BN_num_bytes(r->n);
crypto/libressl/crypto/rsa/rsa_eay.c
169
if (BN_num_bits(rsa->n) > OPENSSL_RSA_MAX_MODULUS_BITS) {
crypto/libressl/crypto/rsa/rsa_eay.c
174
if (BN_ucmp(rsa->n, rsa->e) <= 0) {
crypto/libressl/crypto/rsa/rsa_eay.c
180
if (BN_num_bits(rsa->n) > OPENSSL_RSA_SMALL_MODULUS_BITS) {
crypto/libressl/crypto/rsa/rsa_eay.c
193
num = BN_num_bytes(rsa->n);
crypto/libressl/crypto/rsa/rsa_eay.c
223
if (BN_ucmp(f, rsa->n) >= 0) {
crypto/libressl/crypto/rsa/rsa_eay.c
231
CRYPTO_LOCK_RSA, rsa->n, ctx))
crypto/libressl/crypto/rsa/rsa_eay.c
234
if (!rsa->meth->bn_mod_exp(ret, f, rsa->e, rsa->n, ctx,
crypto/libressl/crypto/rsa/rsa_eay.c
372
num = BN_num_bytes(rsa->n);
crypto/libressl/crypto/rsa/rsa_eay.c
400
if (BN_ucmp(f, rsa->n) >= 0) {
crypto/libressl/crypto/rsa/rsa_eay.c
436
CRYPTO_LOCK_RSA, rsa->n, ctx))
crypto/libressl/crypto/rsa/rsa_eay.c
439
if (!rsa->meth->bn_mod_exp(ret, f, &d, rsa->n, ctx,
crypto/libressl/crypto/rsa/rsa_eay.c
450
if (!BN_sub(f, rsa->n, ret))
crypto/libressl/crypto/rsa/rsa_eay.c
500
num = BN_num_bytes(rsa->n);
crypto/libressl/crypto/rsa/rsa_eay.c
519
if (BN_ucmp(f, rsa->n) >= 0) {
crypto/libressl/crypto/rsa/rsa_eay.c
555
CRYPTO_LOCK_RSA, rsa->n, ctx))
crypto/libressl/crypto/rsa/rsa_eay.c
558
if (!rsa->meth->bn_mod_exp(ret, f, &d, rsa->n, ctx,
crypto/libressl/crypto/rsa/rsa_eay.c
610
if (BN_num_bits(rsa->n) > OPENSSL_RSA_MAX_MODULUS_BITS) {
crypto/libressl/crypto/rsa/rsa_eay.c
615
if (BN_ucmp(rsa->n, rsa->e) <= 0) {
crypto/libressl/crypto/rsa/rsa_eay.c
621
if (BN_num_bits(rsa->n) > OPENSSL_RSA_SMALL_MODULUS_BITS) {
crypto/libressl/crypto/rsa/rsa_eay.c
634
num = BN_num_bytes(rsa->n);
crypto/libressl/crypto/rsa/rsa_eay.c
652
if (BN_ucmp(f, rsa->n) >= 0) {
crypto/libressl/crypto/rsa/rsa_eay.c
659
CRYPTO_LOCK_RSA, rsa->n, ctx))
crypto/libressl/crypto/rsa/rsa_eay.c
662
if (!rsa->meth->bn_mod_exp(ret, f, rsa->e, rsa->n, ctx,
crypto/libressl/crypto/rsa/rsa_eay.c
667
if (!BN_sub(ret, rsa->n, ret))
crypto/libressl/crypto/rsa/rsa_eay.c
739
CRYPTO_LOCK_RSA, rsa->n, ctx))
crypto/libressl/crypto/rsa/rsa_eay.c
809
if (rsa->e && rsa->n) {
crypto/libressl/crypto/rsa/rsa_eay.c
810
if (!rsa->meth->bn_mod_exp(vrfy, r0, rsa->e, rsa->n, ctx,
crypto/libressl/crypto/rsa/rsa_eay.c
821
if (!BN_mod_ct(vrfy, vrfy, rsa->n, ctx))
crypto/libressl/crypto/rsa/rsa_eay.c
824
if (!BN_add(vrfy, vrfy, rsa->n))
crypto/libressl/crypto/rsa/rsa_eay.c
837
if (!rsa->meth->bn_mod_exp(r0, I, &d, rsa->n, ctx,
crypto/libressl/crypto/rsa/rsa_gen.c
117
if (!rsa->n && ((rsa->n = BN_new()) == NULL))
crypto/libressl/crypto/rsa/rsa_gen.c
146
if (!BN_GENCB_call(cb, 2, n++))
crypto/libressl/crypto/rsa/rsa_gen.c
175
if (!BN_GENCB_call(cb, 2, n++))
crypto/libressl/crypto/rsa/rsa_gen.c
187
if (!BN_mul(rsa->n, rsa->p, rsa->q, ctx))
crypto/libressl/crypto/rsa/rsa_gen.c
97
int bitsp, bitsq, ok = -1, n = 0;
crypto/libressl/crypto/rsa/rsa_lib.c
203
BN_clear_free(r->n);
crypto/libressl/crypto/rsa/rsa_lib.c
251
RSA_get0_key(const RSA *r, const BIGNUM **n, const BIGNUM **e, const BIGNUM **d)
crypto/libressl/crypto/rsa/rsa_lib.c
253
if (n != NULL)
crypto/libressl/crypto/rsa/rsa_lib.c
254
*n = r->n;
crypto/libressl/crypto/rsa/rsa_lib.c
262
RSA_set0_key(RSA *r, BIGNUM *n, BIGNUM *e, BIGNUM *d)
crypto/libressl/crypto/rsa/rsa_lib.c
264
if ((r->n == NULL && n == NULL) || (r->e == NULL && e == NULL))
crypto/libressl/crypto/rsa/rsa_lib.c
267
if (n != NULL) {
crypto/libressl/crypto/rsa/rsa_lib.c
268
BN_free(r->n);
crypto/libressl/crypto/rsa/rsa_lib.c
269
r->n = n;
crypto/libressl/crypto/rsa/rsa_lib.c
349
return r->n;
crypto/libressl/crypto/rsa/rsa_locl.h
57
BIGNUM *n;
crypto/libressl/crypto/rsa/rsa_pss.c
117
MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
crypto/libressl/crypto/rsa/rsa_pss.c
223
MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
crypto/libressl/crypto/sha/sha1_one.c
68
unsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/sha/sha1_one.c
76
SHA1_Update(&c,d,n);
crypto/libressl/crypto/sha/sha256.c
42
unsigned char *SHA224(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/sha/sha256.c
49
SHA256_Update(&c,d,n);
crypto/libressl/crypto/sha/sha256.c
55
unsigned char *SHA256(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/sha/sha256.c
62
SHA256_Update(&c,d,n);
crypto/libressl/crypto/sha/sha512.c
101
p[n]=0x80; /* There always is a room for one */
crypto/libressl/crypto/sha/sha512.c
102
n++;
crypto/libressl/crypto/sha/sha512.c
103
if (n > (sizeof(c->u)-16))
crypto/libressl/crypto/sha/sha512.c
104
memset (p+n,0,sizeof(c->u)-n), n=0,
crypto/libressl/crypto/sha/sha512.c
107
memset (p+n,0,sizeof(c->u)-16-n);
crypto/libressl/crypto/sha/sha512.c
138
for (n=0;n<SHA384_DIGEST_LENGTH/8;n++)
crypto/libressl/crypto/sha/sha512.c
140
SHA_LONG64 t = c->h[n];
crypto/libressl/crypto/sha/sha512.c
153
for (n=0;n<SHA512_DIGEST_LENGTH/8;n++)
crypto/libressl/crypto/sha/sha512.c
155
SHA_LONG64 t = c->h[n];
crypto/libressl/crypto/sha/sha512.c
192
size_t n = sizeof(c->u) - c->num;
crypto/libressl/crypto/sha/sha512.c
194
if (len < n)
crypto/libressl/crypto/sha/sha512.c
200
memcpy (p+c->num,data,n), c->num = 0;
crypto/libressl/crypto/sha/sha512.c
201
len-=n, data+=n;
crypto/libressl/crypto/sha/sha512.c
241
unsigned char *SHA384(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/sha/sha512.c
248
SHA512_Update(&c,d,n);
crypto/libressl/crypto/sha/sha512.c
254
unsigned char *SHA512(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/crypto/sha/sha512.c
261
SHA512_Update(&c,d,n);
crypto/libressl/crypto/sha/sha512.c
312
# define ROTR(a,n) ({ SHA_LONG64 ret; \
crypto/libressl/crypto/sha/sha512.c
315
: "J"(n),"0"(a) \
crypto/libressl/crypto/sha/sha512.c
329
# define ROTR(a,n) ({ SHA_LONG64 ret; \
crypto/libressl/crypto/sha/sha512.c
332
: "r"(a),"K"(n)); ret; })
crypto/libressl/crypto/sha/sha512.c
99
size_t n=c->num;
crypto/libressl/crypto/sm4/sm4.c
102
rotl(uint32_t a, uint8_t n)
crypto/libressl/crypto/sm4/sm4.c
104
return (a << n) | (a >> (32 - n));
crypto/libressl/crypto/sm4/sm4.c
108
load_u32_be(const uint8_t *b, uint32_t n)
crypto/libressl/crypto/sm4/sm4.c
110
return ((uint32_t)b[4 * n] << 24) |
crypto/libressl/crypto/sm4/sm4.c
111
((uint32_t)b[4 * n + 1] << 16) |
crypto/libressl/crypto/sm4/sm4.c
112
((uint32_t)b[4 * n + 2] << 8) |
crypto/libressl/crypto/sm4/sm4.c
113
((uint32_t)b[4 * n + 3]);
crypto/libressl/crypto/ts/ts_lib.c
109
int i, critical, n;
crypto/libressl/crypto/ts/ts_lib.c
114
n = X509v3_get_ext_count(extensions);
crypto/libressl/crypto/ts/ts_lib.c
115
for (i = 0; i < n; i++) {
crypto/libressl/crypto/txt_db/txt_db.c
132
n = 0;
crypto/libressl/crypto/txt_db/txt_db.c
133
pp[n++] = p;
crypto/libressl/crypto/txt_db/txt_db.c
147
if (n >= num)
crypto/libressl/crypto/txt_db/txt_db.c
149
pp[n++] = p;
crypto/libressl/crypto/txt_db/txt_db.c
157
if ((n != num) || (*f != '\0')) {
crypto/libressl/crypto/txt_db/txt_db.c
158
fprintf(stderr, "wrong number of fields on line %ld (looking for field %d, got %d, '%s' left)\n",ln,num,n,f);
crypto/libressl/crypto/txt_db/txt_db.c
162
pp[n] = p;
crypto/libressl/crypto/txt_db/txt_db.c
214
int i, n;
crypto/libressl/crypto/txt_db/txt_db.c
225
n = sk_OPENSSL_PSTRING_num(db->data);
crypto/libressl/crypto/txt_db/txt_db.c
226
for (i = 0; i < n; i++) {
crypto/libressl/crypto/txt_db/txt_db.c
248
long i, j,n, nn, l, tot = 0;
crypto/libressl/crypto/txt_db/txt_db.c
255
n = sk_OPENSSL_PSTRING_num(db->data);
crypto/libressl/crypto/txt_db/txt_db.c
257
for (i = 0; i < n; i++) {
crypto/libressl/crypto/txt_db/txt_db.c
336
int i, n;
crypto/libressl/crypto/txt_db/txt_db.c
357
for (n = 0; n < db->num_fields; n++)
crypto/libressl/crypto/txt_db/txt_db.c
358
free(p[n]);
crypto/libressl/crypto/txt_db/txt_db.c
360
for (n = 0; n < db->num_fields; n++) {
crypto/libressl/crypto/txt_db/txt_db.c
361
if (((p[n] < (char *)p) ||
crypto/libressl/crypto/txt_db/txt_db.c
362
(p[n] > max)) &&
crypto/libressl/crypto/txt_db/txt_db.c
363
(p[n] != NULL))
crypto/libressl/crypto/txt_db/txt_db.c
364
free(p[n]);
crypto/libressl/crypto/txt_db/txt_db.c
76
int i, add, n;
crypto/libressl/crypto/whrlpool/wp_block.c
441
void whirlpool_block(WHIRLPOOL_CTX *ctx,const void *inp,size_t n)
crypto/libressl/crypto/whrlpool/wp_block.c
448
GO_FOR_MMX(ctx,inp,n);
crypto/libressl/crypto/whrlpool/wp_block.c
628
} while(--n);
crypto/libressl/crypto/whrlpool/wp_block.c
79
# define ROTATE(a,n) ({ u64 ret; asm ("rolq %1,%0" \
crypto/libressl/crypto/whrlpool/wp_block.c
80
: "=r"(ret) : "J"(n),"0"(a) : "cc"); ret; })
crypto/libressl/crypto/whrlpool/wp_block.c
87
# define ROTATE(i,n) ((i)<<(n) ^ (i)>>(64-n))
crypto/libressl/crypto/whrlpool/wp_block.c
89
# define ROTATE(i,n) ((i)>>(n) ^ (i)<<(64-n))
crypto/libressl/crypto/whrlpool/wp_dgst.c
100
n = 1;
crypto/libressl/crypto/whrlpool/wp_dgst.c
101
do { c->bitlen[n]++;
crypto/libressl/crypto/whrlpool/wp_dgst.c
102
} while(c->bitlen[n]==0
crypto/libressl/crypto/whrlpool/wp_dgst.c
103
&& ++n<(WHIRLPOOL_COUNTER/sizeof(size_t)));
crypto/libressl/crypto/whrlpool/wp_dgst.c
112
if (bitoff==0 && (n=bits/WHIRLPOOL_BBLOCK))
crypto/libressl/crypto/whrlpool/wp_dgst.c
114
whirlpool_block(c,inp,n);
crypto/libressl/crypto/whrlpool/wp_dgst.c
115
inp += n*WHIRLPOOL_BBLOCK/8;
crypto/libressl/crypto/whrlpool/wp_dgst.c
88
size_t n;
crypto/libressl/crypto/x509/pcy_lib.c
108
int n;
crypto/libressl/crypto/x509/pcy_lib.c
112
n = 1;
crypto/libressl/crypto/x509/pcy_lib.c
114
n = 0;
crypto/libressl/crypto/x509/pcy_lib.c
116
n += sk_X509_POLICY_NODE_num(level->nodes);
crypto/libressl/crypto/x509/pcy_lib.c
117
return n;
crypto/libressl/crypto/x509/pcy_node.c
80
X509_POLICY_DATA n;
crypto/libressl/crypto/x509/pcy_node.c
84
n.valid_policy = (ASN1_OBJECT *)id;
crypto/libressl/crypto/x509/pcy_node.c
85
l.data = &n;
crypto/libressl/crypto/x509/pcy_tree.c
151
int i, n;
crypto/libressl/crypto/x509/pcy_tree.c
157
n = sk_X509_num(certs);
crypto/libressl/crypto/x509/pcy_tree.c
162
explicit_policy = n + 1;
crypto/libressl/crypto/x509/pcy_tree.c
167
any_skip = n + 1;
crypto/libressl/crypto/x509/pcy_tree.c
172
map_skip = n + 1;
crypto/libressl/crypto/x509/pcy_tree.c
175
if (n == 1)
crypto/libressl/crypto/x509/pcy_tree.c
181
for (i = n - 2; i >= 0; i--) {
crypto/libressl/crypto/x509/pcy_tree.c
220
tree->levels = calloc(n, sizeof(X509_POLICY_LEVEL));
crypto/libressl/crypto/x509/pcy_tree.c
231
tree->nlevel = n;
crypto/libressl/crypto/x509/pcy_tree.c
242
for (i = n - 2; i >= 0; i--) {
crypto/libressl/crypto/x509/x509_addr.c
570
int i, n;
crypto/libressl/crypto/x509/x509_addr.c
584
for (n = 16;
crypto/libressl/crypto/x509/x509_addr.c
585
n > 1 && addr[n - 1] == 0x00 && addr[n - 2] == 0x00; n -= 2)
crypto/libressl/crypto/x509/x509_addr.c
587
for (i = 0; i < n; i += 2)
crypto/libressl/crypto/x509/x509_att.c
100
n = sk_X509_ATTRIBUTE_num(sk);
crypto/libressl/crypto/x509/x509_att.c
101
for (; lastpos < n; lastpos++) {
crypto/libressl/crypto/x509/x509_att.c
92
int n;
crypto/libressl/crypto/x509/x509_obj.c
105
n = OBJ_obj2nid(ne->object);
crypto/libressl/crypto/x509/x509_obj.c
106
if ((n == NID_undef) || ((s = OBJ_nid2sn(n)) == NULL)) {
crypto/libressl/crypto/x509/x509_obj.c
156
n = q[j];
crypto/libressl/crypto/x509/x509_obj.c
157
if ((n < ' ') || (n > '~')) {
crypto/libressl/crypto/x509/x509_obj.c
160
*(p++) = hex[(n >> 4) & 0x0f];
crypto/libressl/crypto/x509/x509_obj.c
161
*(p++) = hex[n & 0x0f];
crypto/libressl/crypto/x509/x509_obj.c
163
*(p++) = n;
crypto/libressl/crypto/x509/x509_obj.c
75
int n, lold, l, l1, l2, num, j, type;
crypto/libressl/crypto/x509/x509_pci.c
159
int n;
crypto/libressl/crypto/x509/x509_pci.c
166
while ((n = BIO_read(b, buf, sizeof(buf))) > 0 ||
crypto/libressl/crypto/x509/x509_pci.c
167
(n == 0 && BIO_should_retry(b))) {
crypto/libressl/crypto/x509/x509_pci.c
168
if (!n)
crypto/libressl/crypto/x509/x509_pci.c
172
(*policy)->length + n + 1);
crypto/libressl/crypto/x509/x509_pci.c
179
buf, n);
crypto/libressl/crypto/x509/x509_pci.c
180
(*policy)->length += n;
crypto/libressl/crypto/x509/x509_pci.c
185
if (n < 0) {
crypto/libressl/crypto/x509/x509_txt.c
202
(void) snprintf(buf, sizeof buf, "error number %ld", n);
crypto/libressl/crypto/x509/x509_txt.c
71
X509_verify_cert_error_string(long n)
crypto/libressl/crypto/x509/x509_txt.c
75
switch ((int)n) {
crypto/libressl/crypto/x509/x509_v3.c
102
n = sk_X509_EXTENSION_num(sk);
crypto/libressl/crypto/x509/x509_v3.c
103
for (; lastpos < n; lastpos++) {
crypto/libressl/crypto/x509/x509_v3.c
115
int n;
crypto/libressl/crypto/x509/x509_v3.c
123
n = sk_X509_EXTENSION_num(sk);
crypto/libressl/crypto/x509/x509_v3.c
124
for (; lastpos < n; lastpos++) {
crypto/libressl/crypto/x509/x509_v3.c
157
int n;
crypto/libressl/crypto/x509/x509_v3.c
171
n = sk_X509_EXTENSION_num(sk);
crypto/libressl/crypto/x509/x509_v3.c
172
if (loc > n)
crypto/libressl/crypto/x509/x509_v3.c
173
loc = n;
crypto/libressl/crypto/x509/x509_v3.c
175
loc = n;
crypto/libressl/crypto/x509/x509_v3.c
94
int n;
crypto/libressl/crypto/x509/x509_vfy.c
189
int i, n;
crypto/libressl/crypto/x509/x509_vfy.c
192
n = sk_OPENSSL_STRING_num(id->hosts);
crypto/libressl/crypto/x509/x509_vfy.c
1928
int n = sk_X509_num(ctx->chain) - 1;
crypto/libressl/crypto/x509/x509_vfy.c
1929
X509 *xi = sk_X509_value(ctx->chain, n);
crypto/libressl/crypto/x509/x509_vfy.c
1939
if (n <= 0)
crypto/libressl/crypto/x509/x509_vfy.c
1942
n--;
crypto/libressl/crypto/x509/x509_vfy.c
1943
ctx->error_depth = n;
crypto/libressl/crypto/x509/x509_vfy.c
1944
xs = sk_X509_value(ctx->chain, n);
crypto/libressl/crypto/x509/x509_vfy.c
1952
while (n >= 0) {
crypto/libressl/crypto/x509/x509_vfy.c
196
for (i = 0; i < n; ++i) {
crypto/libressl/crypto/x509/x509_vfy.c
1966
if (!verify_cb_cert(ctx, xi, xi != xs ? n+1 : n,
crypto/libressl/crypto/x509/x509_vfy.c
1970
if (!verify_cb_cert(ctx, xs, n,
crypto/libressl/crypto/x509/x509_vfy.c
1980
if (!chain_verified && !x509_check_cert_time(ctx, xs, n))
crypto/libressl/crypto/x509/x509_vfy.c
1989
ctx->error_depth = n;
crypto/libressl/crypto/x509/x509_vfy.c
1993
if (--n >= 0) {
crypto/libressl/crypto/x509/x509_vfy.c
1995
xs = sk_X509_value(ctx->chain, n);
crypto/libressl/crypto/x509/x509_vfy.c
202
return n == 0;
crypto/libressl/crypto/x509/x509name.c
127
int n;
crypto/libressl/crypto/x509/x509name.c
136
n = sk_X509_NAME_ENTRY_num(sk);
crypto/libressl/crypto/x509/x509name.c
137
for (lastpos++; lastpos < n; lastpos++) {
crypto/libressl/crypto/x509/x509name.c
159
int i, n, set_prev, set_next;
crypto/libressl/crypto/x509/x509name.c
167
n = sk_X509_NAME_ENTRY_num(sk);
crypto/libressl/crypto/x509/x509name.c
169
if (loc == n)
crypto/libressl/crypto/x509/x509name.c
188
for (i = loc; i < n; i++)
crypto/libressl/crypto/x509/x509name.c
245
int n, i, inc;
crypto/libressl/crypto/x509/x509name.c
251
n = sk_X509_NAME_ENTRY_num(sk);
crypto/libressl/crypto/x509/x509name.c
252
if (loc > n)
crypto/libressl/crypto/x509/x509name.c
253
loc = n;
crypto/libressl/crypto/x509/x509name.c
255
loc = n;
crypto/libressl/crypto/x509/x509name.c
266
if (loc >= n) {
crypto/libressl/crypto/x509/x509name.c
284
n = sk_X509_NAME_ENTRY_num(sk);
crypto/libressl/crypto/x509/x509name.c
285
for (i = loc + 1; i < n; i++)
crypto/libressl/include/openssl/asn1.h
568
void ASN1_STRING_length_set(ASN1_STRING *x, int n);
crypto/libressl/include/openssl/asn1.h
579
int ASN1_BIT_STRING_set_bit(ASN1_BIT_STRING *a, int n, int value);
crypto/libressl/include/openssl/asn1.h
580
int ASN1_BIT_STRING_get_bit(const ASN1_BIT_STRING *a, int n);
crypto/libressl/include/openssl/bio.h
396
#define BIO_set_nbio(b,n) BIO_ctrl(b,BIO_C_SET_NBIO,(n),NULL)
crypto/libressl/include/openssl/bio.h
402
#define BIO_set_nbio_accept(b,n) BIO_ctrl(b,BIO_C_SET_ACCEPT,1,(n)?(void *)"a":NULL)
crypto/libressl/include/openssl/bio.h
678
BIO_snprintf(char *buf, size_t n, const char *format, ...)
crypto/libressl/include/openssl/bio.h
682
BIO_vsnprintf(char *buf, size_t n, const char *format, va_list args)
crypto/libressl/include/openssl/bio.h
693
BIO_snprintf(char *buf, size_t n, const char *format, ...)
crypto/libressl/include/openssl/bio.h
697
BIO_vsnprintf(char *buf, size_t n, const char *format, va_list args)
crypto/libressl/include/openssl/bn.h
231
void BN_set_flags(BIGNUM *b, int n);
crypto/libressl/include/openssl/bn.h
232
int BN_get_flags(const BIGNUM *b, int n);
crypto/libressl/include/openssl/bn.h
392
void BN_set_negative(BIGNUM *b, int n);
crypto/libressl/include/openssl/bn.h
411
int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);
crypto/libressl/include/openssl/bn.h
412
int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
crypto/libressl/include/openssl/bn.h
424
int BN_is_bit_set(const BIGNUM *a, int n);
crypto/libressl/include/openssl/bn.h
425
int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
crypto/libressl/include/openssl/bn.h
445
int BN_mask_bits(BIGNUM *a, int n);
crypto/libressl/include/openssl/bn.h
449
int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
crypto/libressl/include/openssl/bn.h
454
int BN_set_bit(BIGNUM *a, int n);
crypto/libressl/include/openssl/bn.h
455
int BN_clear_bit(BIGNUM *a, int n);
crypto/libressl/include/openssl/bn.h
467
const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
crypto/libressl/include/openssl/bn.h
470
const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
crypto/libressl/include/openssl/bn.h
528
int BN_BLINDING_convert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
crypto/libressl/include/openssl/bn.h
529
int BN_BLINDING_invert(BIGNUM *n, BN_BLINDING *b, BN_CTX *ctx);
crypto/libressl/include/openssl/bn.h
530
int BN_BLINDING_convert_ex(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
crypto/libressl/include/openssl/bn.h
531
int BN_BLINDING_invert_ex(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *);
crypto/libressl/include/openssl/conf.h
165
#define NCONF_get_number(c,g,n,r) NCONF_get_number_e(c,g,n,r)
crypto/libressl/include/openssl/des.h
104
#define DES_ede2_cfb64_encrypt(i,o,l,k1,k2,iv,n,e) \
crypto/libressl/include/openssl/des.h
105
DES_ede3_cfb64_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(n),(e))
crypto/libressl/include/openssl/des.h
107
#define DES_ede2_ofb64_encrypt(i,o,l,k1,k2,iv,n) \
crypto/libressl/include/openssl/des.h
108
DES_ede3_ofb64_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(n))
crypto/libressl/include/openssl/dsa.h
196
#define DSA_is_prime(n, callback, cb_arg) \
crypto/libressl/include/openssl/dsa.h
197
BN_is_prime(n, DSS_prime_checks, callback, NULL, cb_arg)
crypto/libressl/include/openssl/ec.h
671
int EC_POINTs_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *n, size_t num, const EC_POINT *p[], const BIGNUM *m[], BN_CTX *ctx);
crypto/libressl/include/openssl/ec.h
682
int EC_POINT_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *n, const EC_POINT *q, const BIGNUM *m, BN_CTX *ctx);
crypto/libressl/include/openssl/evp.h
426
#define EVP_add_cipher_alias(n,alias) \
crypto/libressl/include/openssl/evp.h
427
OBJ_NAME_add((alias),OBJ_NAME_TYPE_CIPHER_METH|OBJ_NAME_ALIAS,(n))
crypto/libressl/include/openssl/evp.h
428
#define EVP_add_digest_alias(n,alias) \
crypto/libressl/include/openssl/evp.h
429
OBJ_NAME_add((alias),OBJ_NAME_TYPE_MD_METH|OBJ_NAME_ALIAS,(n))
crypto/libressl/include/openssl/evp.h
541
int EVP_EncodeBlock(unsigned char *t, const unsigned char *f, int n);
crypto/libressl/include/openssl/evp.h
547
int EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n);
crypto/libressl/include/openssl/gost.h
116
unsigned char *GOST2814789IMIT(const unsigned char *d, size_t n,
crypto/libressl/include/openssl/gost.h
141
unsigned char *GOSTR341194(const unsigned char *d, size_t n,unsigned char *md, int nid);
crypto/libressl/include/openssl/gost.h
169
unsigned char *STREEBOG256(const unsigned char *d, size_t n,unsigned char *md);
crypto/libressl/include/openssl/gost.h
175
unsigned char *STREEBOG512(const unsigned char *d, size_t n,unsigned char *md);
crypto/libressl/include/openssl/hmac.h
88
const unsigned char *d, size_t n, unsigned char *md, unsigned int *md_len);
crypto/libressl/include/openssl/md4.h
97
unsigned char *MD4(const unsigned char *d, size_t n, unsigned char *md);
crypto/libressl/include/openssl/md5.h
105
unsigned char *MD5(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/include/openssl/objects.h
1003
ASN1_OBJECT * OBJ_nid2obj(int n);
crypto/libressl/include/openssl/objects.h
1004
const char * OBJ_nid2ln(int n);
crypto/libressl/include/openssl/objects.h
1005
const char * OBJ_nid2sn(int n);
crypto/libressl/include/openssl/ocsp.h
270
X509_EXTENSION *OCSP_crlID_new(const char *url, long *n, char *tim);
crypto/libressl/include/openssl/pkcs12.h
218
int saltlen, int id, int iter, int n, unsigned char *out,
crypto/libressl/include/openssl/pkcs12.h
221
int saltlen, int id, int iter, int n, unsigned char *out,
crypto/libressl/include/openssl/ripemd.h
98
unsigned char *RIPEMD160(const unsigned char *d, size_t n,
crypto/libressl/include/openssl/rsa.h
377
void RSA_get0_key(const RSA *r, const BIGNUM **n, const BIGNUM **e,
crypto/libressl/include/openssl/rsa.h
379
int RSA_set0_key(RSA *r, BIGNUM *n, BIGNUM *e, BIGNUM *d);
crypto/libressl/include/openssl/sha.h
105
unsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md)
crypto/libressl/include/openssl/sha.h
129
unsigned char *SHA224(const unsigned char *d, size_t n,unsigned char *md)
crypto/libressl/include/openssl/sha.h
135
unsigned char *SHA256(const unsigned char *d, size_t n,unsigned char *md)
crypto/libressl/include/openssl/sha.h
177
unsigned char *SHA384(const unsigned char *d, size_t n,unsigned char *md)
crypto/libressl/include/openssl/sha.h
183
unsigned char *SHA512(const unsigned char *d, size_t n,unsigned char *md)
crypto/libressl/include/openssl/ssl.h
1057
#define SSL_get_shared_group(s, n) \
crypto/libressl/include/openssl/ssl.h
1058
SSL_ctrl((s), SSL_CTRL_GET_SHARED_GROUP, (n), NULL)
crypto/libressl/include/openssl/ssl.h
1157
const char * SSL_get_cipher_list(const SSL *s, int n);
crypto/libressl/include/openssl/stack.h
76
#define M_sk_value(sk,n) ((sk) ? (sk)->data[n] : NULL)
crypto/libressl/include/openssl/x509.h
435
const char *X509_verify_cert_error_string(long n);
crypto/libressl/ssl/bio_ssl.c
493
int n, ret;
crypto/libressl/ssl/bio_ssl.c
495
n = strlen(str);
crypto/libressl/ssl/bio_ssl.c
496
ret = BIO_write(bp, str, n);
crypto/libressl/ssl/bs_cbs.c
39
cbs_get(CBS *cbs, const uint8_t **p, size_t n)
crypto/libressl/ssl/bs_cbs.c
41
if (cbs->len < n)
crypto/libressl/ssl/bs_cbs.c
45
cbs->data += n;
crypto/libressl/ssl/bs_cbs.c
46
cbs->len -= n;
crypto/libressl/ssl/bs_cbs.c
51
cbs_peek(CBS *cbs, const uint8_t **p, size_t n)
crypto/libressl/ssl/bs_cbs.c
53
if (cbs->len < n)
crypto/libressl/ssl/d1_pkt.c
356
int ret, n;
crypto/libressl/ssl/d1_pkt.c
377
n = ssl3_packet_read(s, DTLS1_RT_HEADER_LENGTH);
crypto/libressl/ssl/d1_pkt.c
378
if (n <= 0)
crypto/libressl/ssl/d1_pkt.c
379
return (n);
crypto/libressl/ssl/d1_pkt.c
382
if (n != DTLS1_RT_HEADER_LENGTH)
crypto/libressl/ssl/d1_pkt.c
429
n = ssl3_packet_extend(s, DTLS1_RT_HEADER_LENGTH + rr->length);
crypto/libressl/ssl/d1_pkt.c
430
if (n <= 0)
crypto/libressl/ssl/d1_pkt.c
431
return (n);
crypto/libressl/ssl/d1_pkt.c
434
if (n != DTLS1_RT_HEADER_LENGTH + rr->length)
crypto/libressl/ssl/d1_pkt.c
690
unsigned int n;
crypto/libressl/ssl/d1_pkt.c
810
n = rr->length;
crypto/libressl/ssl/d1_pkt.c
812
n = (unsigned int)len;
crypto/libressl/ssl/d1_pkt.c
814
memcpy(buf, &rr->data[rr->off], n);
crypto/libressl/ssl/d1_pkt.c
816
memset(&rr->data[rr->off], 0, n);
crypto/libressl/ssl/d1_pkt.c
817
rr->length -= n;
crypto/libressl/ssl/d1_pkt.c
818
rr->off += n;
crypto/libressl/ssl/d1_pkt.c
825
return n;
crypto/libressl/ssl/s3_cbc.c
283
#define u32toLE(n, p) \
crypto/libressl/ssl/s3_cbc.c
284
(*((p)++)=(unsigned char)(n), \
crypto/libressl/ssl/s3_cbc.c
285
*((p)++)=(unsigned char)(n>>8), \
crypto/libressl/ssl/s3_cbc.c
286
*((p)++)=(unsigned char)(n>>16), \
crypto/libressl/ssl/s3_cbc.c
287
*((p)++)=(unsigned char)(n>>24))
crypto/libressl/ssl/s3_lib.c
1666
_SSL_get_shared_group(SSL *s, long n)
crypto/libressl/ssl/s3_lib.c
1675
if (n == -1) {
crypto/libressl/ssl/s3_lib.c
1686
if (n == -2)
crypto/libressl/ssl/s3_lib.c
1687
n = 0;
crypto/libressl/ssl/s3_lib.c
1689
if (n < 0)
crypto/libressl/ssl/s3_lib.c
1692
if (!tls1_get_shared_group_by_index(s, n, &nid))
crypto/libressl/ssl/ssl_both.c
403
long n;
crypto/libressl/ssl/ssl_both.c
494
n = s->s3->hs.tls12.message_size - s->internal->init_num;
crypto/libressl/ssl/ssl_both.c
495
while (n > 0) {
crypto/libressl/ssl/ssl_both.c
497
&p[s->internal->init_num], n, 0);
crypto/libressl/ssl/ssl_both.c
503
n -= i;
crypto/libressl/ssl/ssl_lib.c
1530
SSL_get_cipher_list(const SSL *s, int n)
crypto/libressl/ssl/ssl_lib.c
1537
if ((cipher = sk_SSL_CIPHER_value(ciphers, n)) == NULL)
crypto/libressl/ssl/ssl_packet.c
118
n = ssl3_packet_extend(s, record_length + 2);
crypto/libressl/ssl/ssl_packet.c
119
if (n != record_length + 2)
crypto/libressl/ssl/ssl_packet.c
120
return n;
crypto/libressl/ssl/ssl_packet.c
83
int n;
crypto/libressl/ssl/ssl_pkt.c
1022
unsigned int n;
crypto/libressl/ssl/ssl_pkt.c
1052
n = 0;
crypto/libressl/ssl/ssl_pkt.c
1057
n++;
crypto/libressl/ssl/ssl_pkt.c
1062
return n;
crypto/libressl/ssl/ssl_pkt.c
1133
n = rr->length;
crypto/libressl/ssl/ssl_pkt.c
1135
n = (unsigned int)len;
crypto/libressl/ssl/ssl_pkt.c
1137
memcpy(buf, &rr->data[rr->off], n);
crypto/libressl/ssl/ssl_pkt.c
1139
memset(&rr->data[rr->off], 0, n);
crypto/libressl/ssl/ssl_pkt.c
1140
rr->length -= n;
crypto/libressl/ssl/ssl_pkt.c
1141
rr->off += n;
crypto/libressl/ssl/ssl_pkt.c
1151
return n;
crypto/libressl/ssl/ssl_pkt.c
151
ssl3_read_n(SSL *s, int n, int max, int extend)
crypto/libressl/ssl/ssl_pkt.c
158
if (n <= 0)
crypto/libressl/ssl/ssl_pkt.c
159
return n;
crypto/libressl/ssl/ssl_pkt.c
199
if (left > 0 && n > left)
crypto/libressl/ssl/ssl_pkt.c
200
n = left;
crypto/libressl/ssl/ssl_pkt.c
204
if (left >= n) {
crypto/libressl/ssl/ssl_pkt.c
205
s->internal->packet_length += n;
crypto/libressl/ssl/ssl_pkt.c
206
rb->left = left - n;
crypto/libressl/ssl/ssl_pkt.c
207
rb->offset += n;
crypto/libressl/ssl/ssl_pkt.c
208
return (n);
crypto/libressl/ssl/ssl_pkt.c
225
if (n > (int)(rb->len - rb->offset)) {
crypto/libressl/ssl/ssl_pkt.c
232
if (max < n)
crypto/libressl/ssl/ssl_pkt.c
233
max = n;
crypto/libressl/ssl/ssl_pkt.c
238
max = n;
crypto/libressl/ssl/ssl_pkt.c
241
while (left < n) {
crypto/libressl/ssl/ssl_pkt.c
272
if (n > left)
crypto/libressl/ssl/ssl_pkt.c
273
n = left; /* makes the while condition false */
crypto/libressl/ssl/ssl_pkt.c
278
rb->offset += n;
crypto/libressl/ssl/ssl_pkt.c
279
rb->left = left - n;
crypto/libressl/ssl/ssl_pkt.c
280
s->internal->packet_length += n;
crypto/libressl/ssl/ssl_pkt.c
283
return (n);
crypto/libressl/ssl/ssl_pkt.c
289
int n;
crypto/libressl/ssl/ssl_pkt.c
291
n = ssl3_read_n(s, plen, s->s3->rbuf.len, 0);
crypto/libressl/ssl/ssl_pkt.c
292
if (n <= 0)
crypto/libressl/ssl/ssl_pkt.c
293
return n;
crypto/libressl/ssl/ssl_pkt.c
303
int rlen, n;
crypto/libressl/ssl/ssl_pkt.c
309
n = ssl3_read_n(s, rlen, rlen, 1);
crypto/libressl/ssl/ssl_pkt.c
310
if (n <= 0)
crypto/libressl/ssl/ssl_pkt.c
311
return n;
crypto/libressl/ssl/ssl_pkt.c
335
int al, n;
crypto/libressl/ssl/ssl_pkt.c
346
n = ssl3_packet_read(s, SSL3_RT_HEADER_LENGTH);
crypto/libressl/ssl/ssl_pkt.c
347
if (n <= 0)
crypto/libressl/ssl/ssl_pkt.c
348
return (n);
crypto/libressl/ssl/ssl_pkt.c
396
n = ssl3_packet_extend(s, SSL3_RT_HEADER_LENGTH + rr->length);
crypto/libressl/ssl/ssl_pkt.c
397
if (n <= 0)
crypto/libressl/ssl/ssl_pkt.c
398
return (n);
crypto/libressl/ssl/ssl_pkt.c
399
if (n != SSL3_RT_HEADER_LENGTH + rr->length)
crypto/libressl/ssl/ssl_pkt.c
400
return (n);
crypto/libressl/ssl/ssl_pkt.c
477
unsigned int tot, n, nw;
crypto/libressl/ssl/ssl_pkt.c
501
n = (len - tot);
crypto/libressl/ssl/ssl_pkt.c
503
if (n > s->max_send_fragment)
crypto/libressl/ssl/ssl_pkt.c
506
nw = n;
crypto/libressl/ssl/ssl_pkt.c
514
if ((i == (int)n) || (type == SSL3_RT_APPLICATION_DATA &&
crypto/libressl/ssl/ssl_pkt.c
526
n -= i;
crypto/libressl/ssl/t1_lib.c
500
tls1_group_by_index(const SSL *ssl, size_t n, int *out_nid,
crypto/libressl/ssl/t1_lib.c
517
if (count++ == n)
crypto/libressl/ssl/tls13_handshake_msg.c
114
tls13_handshake_msg_read_cb(void *buf, size_t n, void *cb_arg)
crypto/libressl/ssl/tls13_handshake_msg.c
118
return tls13_read_handshake_data(rl, buf, n);
crypto/libressl/ssl/tls13_internal.h
221
ssize_t tls13_read_handshake_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n);
crypto/libressl/ssl/tls13_internal.h
223
size_t n);
crypto/libressl/ssl/tls13_internal.h
225
ssize_t tls13_peek_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n);
crypto/libressl/ssl/tls13_internal.h
226
ssize_t tls13_read_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n);
crypto/libressl/ssl/tls13_internal.h
228
size_t n);
crypto/libressl/ssl/tls13_internal.h
327
ssize_t tls13_legacy_wire_read_cb(void *buf, size_t n, void *arg);
crypto/libressl/ssl/tls13_internal.h
328
ssize_t tls13_legacy_wire_write_cb(const void *buf, size_t n, void *arg);
crypto/libressl/ssl/tls13_legacy.c
26
int n;
crypto/libressl/ssl/tls13_legacy.c
262
size_t n, sent;
crypto/libressl/ssl/tls13_legacy.c
300
n = len - sent;
crypto/libressl/ssl/tls13_legacy.c
302
if (n == 0) {
crypto/libressl/ssl/tls13_legacy.c
307
&buf[sent], n)) <= 0) {
crypto/libressl/ssl/tls13_legacy.c
312
n -= ret;
crypto/libressl/ssl/tls13_legacy.c
36
if ((n = BIO_read(ssl->rbio, buf, len)) <= 0) {
crypto/libressl/ssl/tls13_legacy.c
39
if (n == 0)
crypto/libressl/ssl/tls13_legacy.c
48
if (n == len)
crypto/libressl/ssl/tls13_legacy.c
51
return n;
crypto/libressl/ssl/tls13_legacy.c
55
tls13_legacy_wire_read_cb(void *buf, size_t n, void *arg)
crypto/libressl/ssl/tls13_legacy.c
59
return tls13_legacy_wire_read(ctx->ssl, buf, n);
crypto/libressl/ssl/tls13_legacy.c
65
int n;
crypto/libressl/ssl/tls13_legacy.c
75
if ((n = BIO_write(ssl->wbio, buf, len)) <= 0) {
crypto/libressl/ssl/tls13_legacy.c
85
if (n == len)
crypto/libressl/ssl/tls13_legacy.c
88
return n;
crypto/libressl/ssl/tls13_legacy.c
92
tls13_legacy_wire_write_cb(const void *buf, size_t n, void *arg)
crypto/libressl/ssl/tls13_legacy.c
96
return tls13_legacy_wire_write(ctx->ssl, buf, n);
crypto/libressl/ssl/tls13_quic.c
23
tls13_quic_wire_read_cb(void *buf, size_t n, void *arg)
crypto/libressl/ssl/tls13_quic.c
33
tls13_quic_wire_write_cb(const void *buf, size_t n, void *arg)
crypto/libressl/ssl/tls13_quic.c
57
tls13_quic_handshake_read_cb(void *buf, size_t n, void *arg)
crypto/libressl/ssl/tls13_quic.c
64
return tls_buffer_read(ctx->hs->tls13.quic_read_buffer, buf, n);
crypto/libressl/ssl/tls13_quic.c
68
tls13_quic_handshake_write_cb(const void *buf, size_t n, void *arg)
crypto/libressl/ssl/tls13_quic.c
74
ctx->hs->tls13.quic_write_level, buf, n)) {
crypto/libressl/ssl/tls13_quic.c
79
return n;
crypto/libressl/ssl/tls13_record_layer.c
1002
uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1007
ret = tls13_record_layer_read_internal(rl, content_type, buf, n, 1);
crypto/libressl/ssl/tls13_record_layer.c
1018
uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1023
ret = tls13_record_layer_read_internal(rl, content_type, buf, n, 0);
crypto/libressl/ssl/tls13_record_layer.c
1094
uint8_t content_type, const uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1096
if (n > TLS13_RECORD_MAX_PLAINTEXT_LEN)
crypto/libressl/ssl/tls13_record_layer.c
1097
n = TLS13_RECORD_MAX_PLAINTEXT_LEN;
crypto/libressl/ssl/tls13_record_layer.c
1099
return tls13_record_layer_write_record(rl, content_type, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
1104
const uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1115
ret = tls13_record_layer_write_chunk(rl, content_type, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
1147
tls13_read_handshake_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1150
return rl->cb.handshake_read(buf, n, rl->cb_arg);
crypto/libressl/ssl/tls13_record_layer.c
1152
return tls13_record_layer_read(rl, SSL3_RT_HANDSHAKE, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
1157
size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1160
return rl->cb.handshake_write(buf, n, rl->cb_arg);
crypto/libressl/ssl/tls13_record_layer.c
1162
return tls13_record_layer_write(rl, SSL3_RT_HANDSHAKE, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
1175
tls13_peek_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1180
return tls13_record_layer_peek(rl, SSL3_RT_APPLICATION_DATA, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
1184
tls13_read_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1189
return tls13_record_layer_read(rl, SSL3_RT_APPLICATION_DATA, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
1194
size_t n)
crypto/libressl/ssl/tls13_record_layer.c
1199
return tls13_record_layer_write(rl, SSL3_RT_APPLICATION_DATA, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
23
uint8_t content_type, const uint8_t *buf, size_t n);
crypto/libressl/ssl/tls13_record_layer.c
950
uint8_t content_type, uint8_t *buf, size_t n, int peek)
crypto/libressl/ssl/tls13_record_layer.c
995
return tls_content_peek(rl->rcontent, buf, n);
crypto/libressl/ssl/tls13_record_layer.c
997
return tls_content_read(rl->rcontent, buf, n);
crypto/libressl/ssl/tls_buffer.c
159
tls_buffer_read(struct tls_buffer *buf, uint8_t *rbuf, size_t n)
crypto/libressl/ssl/tls_buffer.c
167
if (n > buf->len - buf->offset)
crypto/libressl/ssl/tls_buffer.c
168
n = buf->len - buf->offset;
crypto/libressl/ssl/tls_buffer.c
170
memcpy(rbuf, &buf->data[buf->offset], n);
crypto/libressl/ssl/tls_buffer.c
172
buf->offset += n;
crypto/libressl/ssl/tls_buffer.c
174
return n;
crypto/libressl/ssl/tls_buffer.c
178
tls_buffer_write(struct tls_buffer *buf, const uint8_t *wbuf, size_t n)
crypto/libressl/ssl/tls_buffer.c
200
if (buf->len > SIZE_MAX - n)
crypto/libressl/ssl/tls_buffer.c
202
if (!tls_buffer_grow(buf, buf->len + n))
crypto/libressl/ssl/tls_buffer.c
205
memcpy(&buf->data[buf->len], wbuf, n);
crypto/libressl/ssl/tls_buffer.c
207
buf->len += n;
crypto/libressl/ssl/tls_buffer.c
209
return n;
crypto/libressl/ssl/tls_buffer.c
213
tls_buffer_append(struct tls_buffer *buf, const uint8_t *wbuf, size_t n)
crypto/libressl/ssl/tls_buffer.c
215
return tls_buffer_write(buf, wbuf, n) == n;
crypto/libressl/ssl/tls_content.c
122
tls_content_read_internal(struct tls_content *content, uint8_t *buf, size_t n,
crypto/libressl/ssl/tls_content.c
125
if (n > CBS_len(&content->cbs))
crypto/libressl/ssl/tls_content.c
126
n = CBS_len(&content->cbs);
crypto/libressl/ssl/tls_content.c
129
memcpy(buf, CBS_data(&content->cbs), n);
crypto/libressl/ssl/tls_content.c
132
if (!CBS_skip(&content->cbs, n))
crypto/libressl/ssl/tls_content.c
136
return n;
crypto/libressl/ssl/tls_content.c
140
tls_content_peek(struct tls_content *content, uint8_t *buf, size_t n)
crypto/libressl/ssl/tls_content.c
142
return tls_content_read_internal(content, buf, n, 1);
crypto/libressl/ssl/tls_content.c
146
tls_content_read(struct tls_content *content, uint8_t *buf, size_t n)
crypto/libressl/ssl/tls_content.c
148
return tls_content_read_internal(content, buf, n, 0);
crypto/libressl/ssl/tls_content.c
64
tls_content_equal(struct tls_content *content, const uint8_t *buf, size_t n)
crypto/libressl/ssl/tls_content.c
66
return CBS_mem_equal(&content->cbs, buf, n);
crypto/libressl/ssl/tls_content.h
32
int tls_content_equal(struct tls_content *content, const uint8_t *buf, size_t n);
crypto/libressl/ssl/tls_content.h
43
ssize_t tls_content_peek(struct tls_content *content, uint8_t *buf, size_t n);
crypto/libressl/ssl/tls_content.h
44
ssize_t tls_content_read(struct tls_content *content, uint8_t *buf, size_t n);
crypto/libressl/ssl/tls_internal.h
67
ssize_t tls_buffer_read(struct tls_buffer *buf, uint8_t *rbuf, size_t n);
crypto/libressl/ssl/tls_internal.h
68
ssize_t tls_buffer_write(struct tls_buffer *buf, const uint8_t *wbuf, size_t n);
crypto/libressl/ssl/tls_internal.h
69
int tls_buffer_append(struct tls_buffer *buf, const uint8_t *wbuf, size_t n);
crypto/libressl/tls/tls_client.c
172
ssize_t n;
crypto/libressl/tls/tls_client.c
192
n = pread(sfd, session, session_len, 0);
crypto/libressl/tls/tls_client.c
193
if (n < 0 || (size_t)n != session_len) {
crypto/libressl/tls/tls_client.c
231
ssize_t n;
crypto/libressl/tls/tls_client.c
257
if ((n = pwrite(sfd, data + offset, len, offset)) == -1) {
crypto/libressl/tls/tls_client.c
261
offset += n;
crypto/libressl/tls/tls_client.c
262
len -= n;
crypto/libressl/tls/tls_config.c
45
ssize_t n;
crypto/libressl/tls/tls_config.c
69
n = read(fd, *buf, *len);
crypto/libressl/tls/tls_config.c
70
if (n < 0 || (size_t)n != *len) {
crypto/libressl/tls/tls_util.c
160
ssize_t n;
crypto/libressl/tls/tls_util.c
176
n = read(fd, buf, size);
crypto/libressl/tls/tls_util.c
177
if (n < 0 || (size_t)n != size)
crypto/openssh/addr.c
142
addr_invert(struct xaddr *n)
crypto/openssh/addr.c
146
if (n == NULL)
crypto/openssh/addr.c
149
switch (n->af) {
crypto/openssh/addr.c
151
n->v4.s_addr = ~n->v4.s_addr;
crypto/openssh/addr.c
155
n->addr32[i] = ~n->addr32[i];
crypto/openssh/addr.c
168
addr_netmask(int af, u_int l, struct xaddr *n)
crypto/openssh/addr.c
172
if (masklen_valid(af, l) != 0 || n == NULL)
crypto/openssh/addr.c
175
memset(n, '\0', sizeof(*n));
crypto/openssh/addr.c
178
n->af = AF_INET;
crypto/openssh/addr.c
181
n->v4.s_addr = htonl((0xffffffff << (32 - l)) & 0xffffffff);
crypto/openssh/addr.c
184
n->af = AF_INET6;
crypto/openssh/addr.c
186
n->addr32[i] = 0xffffffffU;
crypto/openssh/addr.c
188
n->addr32[i] = htonl((0xffffffff << (32 - l)) &
crypto/openssh/addr.c
197
addr_hostmask(int af, u_int l, struct xaddr *n)
crypto/openssh/addr.c
199
if (addr_netmask(af, l, n) == -1 || addr_invert(n) == -1)
crypto/openssh/addr.c
309
uint32_t n;
crypto/openssh/addr.c
318
n = ntohl(a->addr32[3 - i]) + 1;
crypto/openssh/addr.c
319
a->addr32[3 - i] = htonl(n);
crypto/openssh/addr.c
320
if (n != 0)
crypto/openssh/addr.c
377
addr_pton(const char *p, struct xaddr *n)
crypto/openssh/addr.c
395
if (n != NULL && addr_sa_to_xaddr(ai->ai_addr, ai->ai_addrlen,
crypto/openssh/addr.c
396
n) == -1) {
crypto/openssh/addr.c
437
addr_ntop(const struct xaddr *n, char *p, size_t len)
crypto/openssh/addr.c
442
if (addr_xaddr_to_sa(n, _SA(&ss), &slen, 0) == -1)
crypto/openssh/addr.c
458
addr_pton_cidr(const char *p, struct xaddr *n, u_int *l)
crypto/openssh/addr.c
487
if (n != NULL)
crypto/openssh/addr.c
488
memcpy(n, &tmp, sizeof(*n));
crypto/openssh/addr.h
46
int addr_netmask(int af, u_int l, struct xaddr *n);
crypto/openssh/addr.h
47
int addr_hostmask(int af, u_int l, struct xaddr *n);
crypto/openssh/addr.h
48
int addr_invert(struct xaddr *n);
crypto/openssh/addr.h
49
int addr_pton(const char *p, struct xaddr *n);
crypto/openssh/addr.h
52
int addr_pton_cidr(const char *p, struct xaddr *n, u_int *l);
crypto/openssh/addr.h
53
int addr_ntop(const struct xaddr *n, char *p, size_t len);
crypto/openssh/addr.h
57
int addr_is_all0s(const struct xaddr *n);
crypto/openssh/addr.h
58
int addr_host_is_all0s(const struct xaddr *n, u_int masklen);
crypto/openssh/atomicio.c
51
atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
crypto/openssh/atomicio.c
65
while (n > pos) {
crypto/openssh/atomicio.c
66
res = (f) (fd, s + pos, n - pos);
crypto/openssh/atomicio.c
96
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
crypto/openssh/atomicio.c
98
return atomicio6(f, fd, _s, n, NULL, NULL);
crypto/openssh/atomicio.h
38
atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
crypto/openssh/auth-options.c
706
serialise_array(struct sshbuf *m, char **a, size_t n)
crypto/openssh/auth-options.c
712
if (n > INT_MAX)
crypto/openssh/auth-options.c
718
for (i = 0; i < n; i++) {
crypto/openssh/auth-options.c
722
if ((r = sshbuf_put_u32(m, n)) != 0 ||
crypto/openssh/auth-options.c
736
size_t i, n = 0;
crypto/openssh/auth-options.c
748
n = tmp;
crypto/openssh/auth-options.c
749
if (n > 0 && (a = calloc(n, sizeof(*a))) == NULL) {
crypto/openssh/auth-options.c
753
for (i = 0; i < n; i++) {
crypto/openssh/auth-options.c
761
*np = n;
crypto/openssh/auth-options.c
762
n = 0;
crypto/openssh/auth-options.c
765
for (i = 0; i < n; i++)
crypto/openssh/auth-pam.c
1127
sshpam_tty_conv(int n, sshpam_const struct pam_message **msg,
crypto/openssh/auth-pam.c
1134
debug3("PAM: %s called with %d messages", __func__, n);
crypto/openssh/auth-pam.c
1138
if (n <= 0 || n > PAM_MAX_NUM_MSG || !isatty(STDIN_FILENO))
crypto/openssh/auth-pam.c
1141
if ((reply = calloc(n, sizeof(*reply))) == NULL)
crypto/openssh/auth-pam.c
1144
for (i = 0; i < n; ++i) {
crypto/openssh/auth-pam.c
1173
for(i = 0; i < n; i++) {
crypto/openssh/auth-pam.c
1288
sshpam_passwd_conv(int n, sshpam_const struct pam_message **msg,
crypto/openssh/auth-pam.c
1295
debug3("PAM: %s called with %d messages", __func__, n);
crypto/openssh/auth-pam.c
1299
if (n <= 0 || n > PAM_MAX_NUM_MSG)
crypto/openssh/auth-pam.c
1302
if ((reply = calloc(n, sizeof(*reply))) == NULL)
crypto/openssh/auth-pam.c
1305
for (i = 0; i < n; ++i) {
crypto/openssh/auth-pam.c
1335
for(i = 0; i < n; i++) {
crypto/openssh/auth-pam.c
331
u_int n, i, num_env;
crypto/openssh/auth-pam.c
338
if ((r = sshbuf_get_u32(b, &n)) != 0)
crypto/openssh/auth-pam.c
340
if (n > INT_MAX)
crypto/openssh/auth-pam.c
341
fatal("%s: invalid PAM account status %u", __func__, n);
crypto/openssh/auth-pam.c
342
sshpam_account_status = (int)n;
crypto/openssh/auth-pam.c
343
if ((r = sshbuf_get_u32(b, &n)) != 0)
crypto/openssh/auth-pam.c
345
sshpam_password_change_required(n != 0);
crypto/openssh/auth-pam.c
391
sshpam_thread_conv(int n, sshpam_const struct pam_message **msg,
crypto/openssh/auth-pam.c
400
debug3("PAM: %s entering, %d messages", __func__, n);
crypto/openssh/auth-pam.c
408
if (n <= 0 || n > PAM_MAX_NUM_MSG)
crypto/openssh/auth-pam.c
411
if ((reply = calloc(n, sizeof(*reply))) == NULL)
crypto/openssh/auth-pam.c
418
for (i = 0; i < n; ++i) {
crypto/openssh/auth-pam.c
462
for(i = 0; i < n; i++) {
crypto/openssh/auth-pam.c
612
sshpam_null_conv(int n, sshpam_const struct pam_message **msg,
crypto/openssh/auth-pam.c
615
debug3("PAM: %s entering, %d messages", __func__, n);
crypto/openssh/auth-pam.c
622
sshpam_store_conv(int n, sshpam_const struct pam_message **msg,
crypto/openssh/auth-pam.c
628
debug3("PAM: %s called with %d messages", __func__, n);
crypto/openssh/auth-pam.c
631
if (n <= 0 || n > PAM_MAX_NUM_MSG)
crypto/openssh/auth-pam.c
634
if ((reply = calloc(n, sizeof(*reply))) == NULL)
crypto/openssh/auth-pam.c
637
for (i = 0; i < n; ++i) {
crypto/openssh/auth-pam.c
655
for(i = 0; i < n; i++) {
crypto/openssh/auth-pam.c
79
# define PAM_MSG_MEMBER(msg, n, member) ((*(msg))[(n)].member)
crypto/openssh/auth-pam.c
81
# define PAM_MSG_MEMBER(msg, n, member) ((msg)[(n)]->member)
crypto/openssh/auth2-chall.c
366
int n = 0;
crypto/openssh/auth2-chall.c
376
devices[n++] = &mm_bsdauth_device;
crypto/openssh/auth2-chall.c
379
devices[n++] = &mm_sshpam_device;
crypto/openssh/auth2.c
110
size_t len, n;
crypto/openssh/auth2.c
126
n = atomicio(read, fd, banner, len);
crypto/openssh/auth2.c
129
if (n != len) {
crypto/openssh/auth2.c
133
banner[n] = '\0';
crypto/openssh/bitmap.c
101
bitmap_set_bit(struct bitmap *b, u_int n)
crypto/openssh/bitmap.c
106
if ((r = reserve(b, n)) != 0)
crypto/openssh/bitmap.c
108
offset = n / BITMAP_BITS;
crypto/openssh/bitmap.c
111
b->d[offset] |= (BITMAP_WTYPE)1 << (n & BITMAP_WMASK);
crypto/openssh/bitmap.c
126
bitmap_clear_bit(struct bitmap *b, u_int n)
crypto/openssh/bitmap.c
130
if (b->top >= b->len || n > BITMAP_MAX)
crypto/openssh/bitmap.c
132
offset = n / BITMAP_BITS;
crypto/openssh/bitmap.c
135
b->d[offset] &= ~((BITMAP_WTYPE)1 << (n & BITMAP_WMASK));
crypto/openssh/bitmap.c
72
bitmap_test_bit(struct bitmap *b, u_int n)
crypto/openssh/bitmap.c
76
if (b->len == 0 || (n / BITMAP_BITS) > b->top)
crypto/openssh/bitmap.c
78
return (b->d[n / BITMAP_BITS] >> (n & BITMAP_WMASK)) & 1;
crypto/openssh/bitmap.c
82
reserve(struct bitmap *b, u_int n)
crypto/openssh/bitmap.c
87
if (b->top >= b->len || n > BITMAP_MAX)
crypto/openssh/bitmap.c
89
nlen = (n / BITMAP_BITS) + 1;
crypto/openssh/bitmap.h
37
int bitmap_test_bit(struct bitmap *b, u_int n);
crypto/openssh/bitmap.h
40
int bitmap_set_bit(struct bitmap *b, u_int n);
crypto/openssh/bitmap.h
43
void bitmap_clear_bit(struct bitmap *b, u_int n);
crypto/openssh/chacha.c
23
#define ROTL32(v, n) \
crypto/openssh/chacha.c
24
(U32V((v) << (n)) | ((v) >> (32 - (n))))
crypto/openssh/channels.c
5003
int gaierr, n, num_socks = 0, socks[NUM_SOCKS];
crypto/openssh/channels.c
5051
for (n = 0; n < num_socks; n++)
crypto/openssh/channels.c
5052
close(socks[n]);
crypto/openssh/channels.c
5069
for (n = 0; n < num_socks; n++) {
crypto/openssh/channels.c
5070
sock = socks[n];
crypto/openssh/channels.c
5080
for (n = 0; n < num_socks; n++) {
crypto/openssh/channels.c
5081
sock = socks[n];
crypto/openssh/channels.c
5087
(*chanids)[n] = nc->self;
crypto/openssh/channels.c
5089
(*chanids)[n] = -1;
crypto/openssh/channels.c
681
u_int n, *npermp;
crypto/openssh/channels.c
689
n = (*npermp)++;
crypto/openssh/channels.c
691
(*permp)[n].host_to_connect = MAYBE_DUP(host_to_connect);
crypto/openssh/channels.c
692
(*permp)[n].port_to_connect = port_to_connect;
crypto/openssh/channels.c
693
(*permp)[n].listen_host = MAYBE_DUP(listen_host);
crypto/openssh/channels.c
694
(*permp)[n].listen_path = MAYBE_DUP(listen_path);
crypto/openssh/channels.c
695
(*permp)[n].listen_port = listen_port;
crypto/openssh/channels.c
696
(*permp)[n].downstream = downstream;
crypto/openssh/channels.c
698
return (int)n;
crypto/openssh/channels.c
738
u_int i, n;
crypto/openssh/channels.c
742
for (n = 0, i = 0; i < sc->channels_alloc; i++) {
crypto/openssh/channels.c
745
n++;
crypto/openssh/channels.c
757
c->remote_name ? c->remote_name : "???", n);
crypto/openssh/cipher-aesctr.c
71
u32 n = 0;
crypto/openssh/cipher-aesctr.c
75
if (n == 0) {
crypto/openssh/cipher-aesctr.c
79
*(c++) = *(m++) ^ buf[n];
crypto/openssh/cipher-aesctr.c
80
n = (n + 1) % AES_BLOCK_SIZE;
crypto/openssh/clientloop.c
585
long long n;
crypto/openssh/clientloop.c
667
n = (now.tv_sec - next_interval.tv_sec) * 1000LL * 1000 * 1000;
crypto/openssh/clientloop.c
668
n += now.tv_nsec - next_interval.tv_nsec;
crypto/openssh/clientloop.c
669
n /= options.obscure_keystroke_timing_interval * 1000LL * 1000;
crypto/openssh/clientloop.c
670
n = (n < 0) ? 1 : n + 1;
crypto/openssh/clientloop.c
674
options.obscure_keystroke_timing_interval * n, 0);
crypto/openssh/defines.h
700
# define memmove(s1, s2, n) bcopy((s2), (s1), (n))
crypto/openssh/dh.c
103
n = strtonum(arg, 0, 1<<30, &errstr);
crypto/openssh/dh.c
104
if (errstr != NULL || n == 0) {
crypto/openssh/dh.c
239
int n = BN_num_bits(dh_pub);
crypto/openssh/dh.c
267
for (i = 0; i <= n; i++)
crypto/openssh/dh.c
66
long long n;
crypto/openssh/dh.c
85
n = strtonum(arg, 0, 5, &errstr);
crypto/openssh/dh.c
86
if (errstr != NULL || n != MODULI_TYPE_SAFE) {
crypto/openssh/dh.c
94
n = strtonum(arg, 0, 0x1f, &errstr);
crypto/openssh/dh.c
96
(n & MODULI_TESTS_COMPOSITE) || !(n & ~MODULI_TESTS_COMPOSITE)) {
crypto/openssh/groupaccess.c
85
ga_match(char * const *groups, int n)
crypto/openssh/groupaccess.c
90
for (j = 0; j < n; j++)
crypto/openssh/kex.c
1241
size_t len, n;
crypto/openssh/kex.c
1286
for (n = 0; ; n++) {
crypto/openssh/kex.c
1287
if (n >= SSH_MAX_PRE_BANNER_LINES) {
crypto/openssh/kex.c
1366
debug_f("banner line %zu: %s", n, cp);
crypto/openssh/moduli.c
119
#define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31)))
crypto/openssh/moduli.c
120
#define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31)))
crypto/openssh/moduli.c
121
#define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31)))
crypto/openssh/monitor.c
1680
u_int n;
crypto/openssh/monitor.c
1686
if ((r = sshbuf_get_u32(m, &n)) != 0)
crypto/openssh/monitor.c
1688
event = (ssh_audit_event_t)n;
crypto/openssh/monitor_fdpass.c
100
if (n != 1) {
crypto/openssh/monitor_fdpass.c
101
error_f("sendmsg: expected sent 1 got %zd", n);
crypto/openssh/monitor_fdpass.c
124
ssize_t n;
crypto/openssh/monitor_fdpass.c
145
while ((n = recvmsg(sock, &msg, 0)) == -1 &&
crypto/openssh/monitor_fdpass.c
150
if (n == -1) {
crypto/openssh/monitor_fdpass.c
155
if (n != 1) {
crypto/openssh/monitor_fdpass.c
156
error_f("recvmsg: expected received 1 got %zd", n);
crypto/openssh/monitor_fdpass.c
65
ssize_t n;
crypto/openssh/monitor_fdpass.c
90
while ((n = sendmsg(sock, &msg, 0)) == -1 &&
crypto/openssh/monitor_fdpass.c
95
if (n == -1) {
crypto/openssh/monitor_wrap.c
776
u_int i, n;
crypto/openssh/monitor_wrap.c
788
(r = sshbuf_get_u32(m, &n)) != 0 ||
crypto/openssh/monitor_wrap.c
792
sshpam_set_maxtries_reached(n);
crypto/openssh/monitor_wrap.c
811
u_int n, i;
crypto/openssh/monitor_wrap.c
827
if ((r = sshbuf_get_u32(m, &n)) != 0)
crypto/openssh/monitor_wrap.c
829
ret = (int)n; /* XXX */
crypto/openssh/readconf.c
2955
#define FREE_ARRAY(type, n, a) \
crypto/openssh/readconf.c
2958
for (_i = 0; _i < (n); _i++) \
crypto/openssh/readconf.c
894
free_canon_cnames(struct allowed_cname *cnames, u_int n)
crypto/openssh/readconf.c
898
if (cnames == NULL || n == 0)
crypto/openssh/readconf.c
900
for (i = 0; i < n; i++) {
crypto/openssh/scp.c
1675
size_t n, npatterns = 0;
crypto/openssh/scp.c
1813
for (n = 0; n < npatterns; n++) {
crypto/openssh/scp.c
1814
if (strcmp(patterns[n], cp) == 0 ||
crypto/openssh/scp.c
1815
fnmatch(patterns[n], cp, 0) == 0)
crypto/openssh/scp.c
1818
if (n >= npatterns) {
crypto/openssh/scp.c
1822
for (n = 0; n < npatterns; n++) {
crypto/openssh/scp.c
1824
n, patterns[n]);
crypto/openssh/scp.c
1977
for (n = 0; n < npatterns; n++)
crypto/openssh/scp.c
1978
free(patterns[n]);
crypto/openssh/scp.c
1982
for (n = 0; n < npatterns; n++)
crypto/openssh/scp.c
1983
free(patterns[n]);
crypto/openssh/scp.c
474
int ch, fflag, tflag, status, r, n;
crypto/openssh/scp.c
491
for (n = 0; n < argc; n++)
crypto/openssh/scp.c
492
newargv[n] = xstrdup(argv[n]);
crypto/openssh/servconf.c
1258
int cmdline = 0, *intptr, value, value2, n, port, oactive, r;
crypto/openssh/servconf.c
1945
if ((n = sscanf(arg, "%d:%d:%d",
crypto/openssh/servconf.c
1955
} else if (n != 1)
crypto/openssh/servconf.c
1971
switch (n = sscanf(arg, "%d:%d", &value, &value2)) {
crypto/openssh/servconf.c
1974
n = -1;
crypto/openssh/servconf.c
1978
n = -1;
crypto/openssh/servconf.c
1980
if (n != 1 && n != 2)
crypto/openssh/servconf.c
2295
for (n = 0; n < (int)gbuf.gl_pathc; n++) {
crypto/openssh/servconf.c
2297
filename, linenum, gbuf.gl_pathv[n]);
crypto/openssh/servconf.c
2300
item->filename = strdup(gbuf.gl_pathv[n]);
crypto/openssh/servconf.c
2835
#define M_CP_INTOPT(n) do {\
crypto/openssh/servconf.c
2836
if (src->n != -1) \
crypto/openssh/servconf.c
2837
dst->n = src->n; \
crypto/openssh/servconf.c
2888
#define M_CP_STROPT(n) do {\
crypto/openssh/servconf.c
2889
if (src->n != NULL && dst->n != src->n) { \
crypto/openssh/servconf.c
2890
free(dst->n); \
crypto/openssh/servconf.c
2891
dst->n = src->n; \
crypto/openssh/session.c
1092
for (n = 0 ; n < auth_opts->nenv; n++) {
crypto/openssh/session.c
1093
ocp = xstrdup(auth_opts->env[n]);
crypto/openssh/session.c
974
size_t n;
crypto/openssh/sftp-server.c
1731
u_int n, nusers = 0, ngroups = 0;
crypto/openssh/sftp-server.c
1744
if ((r = sshbuf_get_u32(uids, &n)) != 0)
crypto/openssh/sftp-server.c
1746
user_pw = getpwuid((uid_t)n);
crypto/openssh/sftp-server.c
1748
debug3_f("uid %u => \"%s\"", n, name);
crypto/openssh/sftp-server.c
1754
if ((r = sshbuf_get_u32(gids, &n)) != 0)
crypto/openssh/sftp-server.c
1756
gr = getgrgid((gid_t)n);
crypto/openssh/sftp-server.c
1758
debug3_f("gid %u => \"%s\"", n, name);
crypto/openssh/sftp-usergroup.c
153
u_int id, i, n = 0, *ids = NULL;
crypto/openssh/sftp-usergroup.c
165
if (has_id(id, ids, n))
crypto/openssh/sftp-usergroup.c
167
ids = xrecallocarray(ids, n, n + 1, sizeof(*ids));
crypto/openssh/sftp-usergroup.c
168
ids[n++] = id;
crypto/openssh/sftp-usergroup.c
171
*nidsp = n;
crypto/openssh/sftp-usergroup.c
192
u_int id, i, n = 0, *ids = NULL;
crypto/openssh/sftp-usergroup.c
204
if (has_id(id, ids, n))
crypto/openssh/sftp-usergroup.c
206
ids = xrecallocarray(ids, n, n + 1, sizeof(*ids));
crypto/openssh/sftp-usergroup.c
207
ids[n++] = id;
crypto/openssh/sftp-usergroup.c
210
*nidsp = n;
crypto/openssh/sftp.c
1387
cmdnum = cmds[i].n;
crypto/openssh/sftp.c
169
const int n;
crypto/openssh/sftp.c
852
int n;
crypto/openssh/sftp.c
856
if ((n = sftp_readdir(conn, path, &d)) != 0)
crypto/openssh/sftp.c
857
return (n);
crypto/openssh/sftp.c
865
for (n = 0; d[n] != NULL; n++) {
crypto/openssh/sftp.c
866
if (d[n]->filename[0] != '.' || (lflag & LS_SHOW_ALL))
crypto/openssh/sftp.c
867
m = MAXIMUM(m, strlen(d[n]->filename));
crypto/openssh/sftp.c
885
for (n = 0; d[n] != NULL; n++)
crypto/openssh/sftp.c
888
qsort(d, n, sizeof(*d), sdirent_comp);
crypto/openssh/sftp.c
892
for (n = 0; d[n] != NULL && !interrupted; n++) {
crypto/openssh/sftp.c
895
if (d[n]->filename[0] == '.' && !(lflag & LS_SHOW_ALL))
crypto/openssh/sftp.c
898
tmp = sftp_path_append(path, d[n]->filename);
crypto/openssh/sftp.c
909
attrib_to_stat(&d[n]->a, &sb);
crypto/openssh/sftp.c
917
mprintf("%s\n", d[n]->longname);
crypto/openssh/smult_curve25519_ref.c
248
const unsigned char *n,
crypto/openssh/smult_curve25519_ref.c
254
for (i = 0;i < 32;++i) e[i] = n[i];
crypto/openssh/sntrup761.c
105
static void crypto_sort_uint32(void *array,long long n)
crypto/openssh/sntrup761.c
109
for (j = 0;j < n;++j) x[j] ^= 0x80000000;
crypto/openssh/sntrup761.c
110
crypto_sort_int32(array,n);
crypto/openssh/sntrup761.c
111
for (j = 0;j < n;++j) x[j] ^= 0x80000000;
crypto/openssh/sntrup761.c
42
static void crypto_sort_int32(void *array,long long n)
crypto/openssh/sntrup761.c
47
if (n < 2) return;
crypto/openssh/sntrup761.c
49
while (top < n - top) top += top;
crypto/openssh/sntrup761.c
53
while (i + 2 * p <= n) {
crypto/openssh/sntrup761.c
58
for (j = i;j < n - p;++j)
crypto/openssh/sntrup761.c
65
if (j == n - q) goto done;
crypto/openssh/sntrup761.c
76
while (i + p <= n - q) {
crypto/openssh/sntrup761.c
87
while (j < n - q) {
crypto/openssh/ssh-keygen.c
1772
u_int n;
crypto/openssh/ssh-keygen.c
1837
n = 0;
crypto/openssh/ssh-keygen.c
1841
for (; (cp = strsep(&tmp, ",")) != NULL; n++) {
crypto/openssh/ssh-keygen.c
1842
plist = xreallocarray(plist, n + 1, sizeof(*plist));
crypto/openssh/ssh-keygen.c
1843
if (*(plist[n] = xstrdup(cp)) == '\0')
crypto/openssh/ssh-keygen.c
1848
if (n > SSHKEY_CERT_MAX_PRINCIPALS)
crypto/openssh/ssh-keygen.c
1864
public->cert->nprincipals = n;
crypto/openssh/ssh-keygen.c
3758
unsigned int n = 0;
crypto/openssh/ssh-keygen.c
3761
n = do_print_resource_record(pw, identity_file,
crypto/openssh/ssh-keygen.c
3763
if (n == 0)
crypto/openssh/ssh-keygen.c
3768
n += do_print_resource_record(pw,
crypto/openssh/ssh-keygen.c
3772
n += do_print_resource_record(pw,
crypto/openssh/ssh-keygen.c
3776
n += do_print_resource_record(pw,
crypto/openssh/ssh-keygen.c
3779
n += do_print_resource_record(pw,
crypto/openssh/ssh-keygen.c
3782
n += do_print_resource_record(pw,
crypto/openssh/ssh-keygen.c
3785
if (n == 0)
crypto/openssh/ssh-keyscan.c
467
int n = 0, remote_major = 0, remote_minor = 0;
crypto/openssh/ssh-keyscan.c
474
n = snprintf(buf, sizeof buf, "SSH-%d.%d-OpenSSH-keyscan\r\n",
crypto/openssh/ssh-keyscan.c
476
if (n < 0 || (size_t)n >= sizeof(buf)) {
crypto/openssh/ssh-keyscan.c
481
if (atomicio(vwrite, s, buf, n) != (size_t)n) {
crypto/openssh/ssh-keyscan.c
501
(n = atomicio(read, s, cp, 1)) == 1 && *cp != '\n') {
crypto/openssh/ssh-keyscan.c
506
if (n != 1 || strncmp(buf, "SSH-", 4) == 0)
crypto/openssh/ssh-keyscan.c
509
if (n == 0) {
crypto/openssh/ssh-pkcs11.c
1118
CK_ULONG n = 0;
crypto/openssh/ssh-pkcs11.c
1142
rv = f->C_FindObjects(session, &obj, 1, &n);
crypto/openssh/ssh-pkcs11.c
1147
if (n == 0)
crypto/openssh/ssh-pkcs11.c
1223
CK_ULONG n = 0;
crypto/openssh/ssh-pkcs11.c
1247
rv = f->C_FindObjects(session, &obj, 1, &n);
crypto/openssh/ssh-pkcs11.c
1252
if (n == 0)
crypto/openssh/ssh.c
681
size_t n, len;
crypto/openssh/ssh.c
854
for (n = 0; n < len; n++)
crypto/openssh/ssh.c
855
if (cp[n] == ',')
crypto/openssh/ssh.c
856
cp[n] = '\n';
crypto/openssh/ssh_api.c
348
size_t n, j;
crypto/openssh/ssh_api.c
350
for (j = n = 0;;) {
crypto/openssh/ssh_api.c
376
if (ssh->kex->server || ++n > SSH_MAX_PRE_BANNER_LINES) {
crypto/openssh/sshconnect.c
843
u_int i, n, num_othernames = 0;
crypto/openssh/sshconnect.c
855
n = num_othernames;
crypto/openssh/sshconnect.c
856
if (n > MAX_OTHER_NAMES)
crypto/openssh/sshconnect.c
857
n = MAX_OTHER_NAMES;
crypto/openssh/sshconnect.c
858
for (i = 0; i < n; i++) {
crypto/openssh/sshconnect.c
861
if (n < num_othernames) {
crypto/openssh/sshconnect.c
863
num_othernames - n);
crypto/openssh/ssherr.c
23
ssh_err(int n)
crypto/openssh/ssherr.c
25
switch (n) {
crypto/openssh/ssherr.h
87
const char *ssh_err(int n);
crypto/openssh/sshkey-xmss.c
107
state->n = 32;
crypto/openssh/sshkey-xmss.c
111
state->n = 32;
crypto/openssh/sshkey-xmss.c
115
state->n = 32;
crypto/openssh/sshkey-xmss.c
128
if (xmss_set_params(&state->params, state->n, state->h, state->w,
crypto/openssh/sshkey-xmss.c
155
#define num_stack(x) ((x->h+1)*(x->n))
crypto/openssh/sshkey-xmss.c
157
#define num_auth(x) ((x->h)*(x->n))
crypto/openssh/sshkey-xmss.c
158
#define num_keep(x) ((x->h >> 1)*(x->n))
crypto/openssh/sshkey-xmss.c
159
#define num_th_nodes(x) ((x->h - x->k)*(x->n))
crypto/openssh/sshkey-xmss.c
160
#define num_retain(x) (((1ULL << x->k) - x->k - 1) * (x->n))
crypto/openssh/sshkey-xmss.c
182
state->treehash[i].node = &state->th_nodes[state->n*i];
crypto/openssh/sshkey-xmss.c
241
*lenp = 4 + state->n +
crypto/openssh/sshkey-xmss.c
243
state->h * state->n;
crypto/openssh/sshkey-xmss.c
254
return state->n * 2;
crypto/openssh/sshkey-xmss.c
264
return state->n * 4 + 4;
crypto/openssh/sshkey-xmss.c
57
u_int32_t n, w, h, k;
crypto/openssh/sshkey.c
1505
struct sshkey *n = NULL;
crypto/openssh/sshkey.c
1512
if ((n = sshkey_new(k->type)) == NULL) {
crypto/openssh/sshkey.c
1516
if ((r = impl->funcs->copy_public(k, n)) != 0)
crypto/openssh/sshkey.c
1518
if (sshkey_is_cert(k) && (r = sshkey_cert_copy(k, n)) != 0)
crypto/openssh/sshkey.c
1521
*pkp = n;
crypto/openssh/sshkey.c
1522
n = NULL;
crypto/openssh/sshkey.c
1525
sshkey_free(n);
crypto/openssh/sshsig.c
504
ssize_t n, total = 0;
crypto/openssh/sshsig.c
523
if ((n = read(fd, rbuf, sizeof(rbuf))) == -1) {
crypto/openssh/sshsig.c
531
} else if (n == 0) {
crypto/openssh/sshsig.c
535
total += (size_t)n;
crypto/openssh/sshsig.c
536
if ((r = ssh_digest_update(ctx, rbuf, (size_t)n)) != 0) {
crypto/openssh/xmss_fast.c
1004
memcpy(hash_key, sig_msg,n);
crypto/openssh/xmss_fast.c
1005
memcpy(hash_key+n, pk, n);
crypto/openssh/xmss_fast.c
1006
to_byte(hash_key+2*n, idx, n);
crypto/openssh/xmss_fast.c
1008
sig_msg += n;
crypto/openssh/xmss_fast.c
1009
sig_msg_len -= n;
crypto/openssh/xmss_fast.c
101
if (xmss_set_params(&xmss_par, n, (h/d), w, k)) {
crypto/openssh/xmss_fast.c
1013
unsigned long long tmp_sig_len = (params->d * params->xmss_par.wots_par.keysize) + (params->h * n);
crypto/openssh/xmss_fast.c
1015
h_msg(msg_h, sig_msg + tmp_sig_len, m_len, hash_key, 3*n, n);
crypto/openssh/xmss_fast.c
1050
sig_msg += tree_h*n;
crypto/openssh/xmss_fast.c
1051
sig_msg_len -= tree_h*n;
crypto/openssh/xmss_fast.c
1083
sig_msg += tree_h*n;
crypto/openssh/xmss_fast.c
1084
sig_msg_len -= tree_h*n;
crypto/openssh/xmss_fast.c
1088
for (i = 0; i < n; i++)
crypto/openssh/xmss_fast.c
114
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
128
hash_h(wots_pk+i*n, wots_pk+i*2*n, pub_seed, addr, n);
crypto/openssh/xmss_fast.c
133
memcpy(wots_pk+(l>>1)*n, wots_pk+(l-1)*n, n);
crypto/openssh/xmss_fast.c
146
memcpy(leaf, wots_pk, n);
crypto/openssh/xmss_fast.c
154
unsigned char seed[params->n];
crypto/openssh/xmss_fast.c
157
get_seed(seed, sk_seed, params->n, ots_addr);
crypto/openssh/xmss_fast.c
181
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
198
unsigned char stack[(height+1)*n];
crypto/openssh/xmss_fast.c
215
gen_leaf_wots(stack+stackoffset*n, sk_seed, params, pub_seed, ltree_addr, ots_addr);
crypto/openssh/xmss_fast.c
219
memcpy(state->treehash[0].node, stack+stackoffset*n, n);
crypto/openssh/xmss_fast.c
225
memcpy(state->auth + nodeh*n, stack+(stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
229
memcpy(state->treehash[nodeh].node, stack+(stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
232
memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((i >> nodeh) - 3) >> 1)) * n, stack+(stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
237
hash_h(stack+(stackoffset-2)*n, stack+(stackoffset-2)*n, pub_seed,
crypto/openssh/xmss_fast.c
238
node_addr, n);
crypto/openssh/xmss_fast.c
245
for (i = 0; i < n; i++)
crypto/openssh/xmss_fast.c
250
int n = params->n;
crypto/openssh/xmss_fast.c
267
unsigned char nodebuffer[2 * n];
crypto/openssh/xmss_fast.c
271
memcpy(nodebuffer + n, nodebuffer, n);
crypto/openssh/xmss_fast.c
272
memcpy(nodebuffer, state->stack + (state->stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
275
hash_h(nodebuffer, nodebuffer, pub_seed, node_addr, n);
crypto/openssh/xmss_fast.c
281
memcpy(treehash->node, nodebuffer, n);
crypto/openssh/xmss_fast.c
285
memcpy(state->stack + state->stackoffset*n, nodebuffer, n);
crypto/openssh/xmss_fast.c
298
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
301
unsigned char buffer[2*n];
crypto/openssh/xmss_fast.c
306
for (j = 0; j < n; j++)
crypto/openssh/xmss_fast.c
307
buffer[n+j] = leaf[j];
crypto/openssh/xmss_fast.c
308
for (j = 0; j < n; j++)
crypto/openssh/xmss_fast.c
312
for (j = 0; j < n; j++)
crypto/openssh/xmss_fast.c
314
for (j = 0; j < n; j++)
crypto/openssh/xmss_fast.c
315
buffer[n+j] = authpath[j];
crypto/openssh/xmss_fast.c
317
authpath += n;
crypto/openssh/xmss_fast.c
324
hash_h(buffer+n, buffer, pub_seed, addr, n);
crypto/openssh/xmss_fast.c
325
for (j = 0; j < n; j++)
crypto/openssh/xmss_fast.c
329
hash_h(buffer, buffer, pub_seed, addr, n);
crypto/openssh/xmss_fast.c
330
for (j = 0; j < n; j++)
crypto/openssh/xmss_fast.c
331
buffer[j+n] = authpath[j];
crypto/openssh/xmss_fast.c
333
authpath += n;
crypto/openssh/xmss_fast.c
338
hash_h(root, buffer, pub_seed, addr, n);
crypto/openssh/xmss_fast.c
36
static void get_seed(unsigned char *seed, const unsigned char *sk_seed, int n, uint32_t addr[8])
crypto/openssh/xmss_fast.c
388
int n = params->n;
crypto/openssh/xmss_fast.c
410
gen_leaf_wots(state->stack+state->stackoffset*n, sk_seed, params, pub_seed, ltree_addr, ots_addr);
crypto/openssh/xmss_fast.c
415
memcpy(state->treehash[0].node, state->stack+state->stackoffset*n, n);
crypto/openssh/xmss_fast.c
420
memcpy(state->auth + nodeh*n, state->stack+(state->stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
424
memcpy(state->treehash[nodeh].node, state->stack+(state->stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
427
memcpy(state->retain + ((1 << (h - 1 - nodeh)) + nodeh - h + (((idx >> nodeh) - 3) >> 1)) * n, state->stack+(state->stackoffset-1)*n, n);
crypto/openssh/xmss_fast.c
432
hash_h(state->stack+(state->stackoffset-2)*n, state->stack+(state->stackoffset-2)*n, pub_seed, node_addr, n);
crypto/openssh/xmss_fast.c
449
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
45
prf(seed, bytes, sk_seed, n);
crypto/openssh/xmss_fast.c
456
unsigned char buf[2 * n];
crypto/openssh/xmss_fast.c
478
memcpy(buf, state->auth + (tau-1) * n, n);
crypto/openssh/xmss_fast.c
480
memcpy(buf + n, state->keep + ((tau-1) >> 1) * n, n);
crypto/openssh/xmss_fast.c
483
memcpy(state->keep + (tau >> 1)*n, state->auth + tau*n, n);
crypto/openssh/xmss_fast.c
493
hash_h(state->auth + tau * n, buf, pub_seed, node_addr, n);
crypto/openssh/xmss_fast.c
496
memcpy(state->auth + i * n, state->treehash[i].node, n);
crypto/openssh/xmss_fast.c
501
memcpy(state->auth + i * n, state->retain + (offset + rowidx) * n, n);
crypto/openssh/xmss_fast.c
524
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
53
int xmss_set_params(xmss_params *params, int n, int h, int w, int k)
crypto/openssh/xmss_fast.c
531
randombytes(sk+4, 3*n);
crypto/openssh/xmss_fast.c
533
memcpy(pk+n, sk+4+2*n, n);
crypto/openssh/xmss_fast.c
538
treehash_setup(pk, params->h, 0, state, sk+4, params, sk+4+2*n, addr);
crypto/openssh/xmss_fast.c
540
memcpy(sk+4+3*n, pk, n);
crypto/openssh/xmss_fast.c
554
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
560
unsigned char sk_seed[n];
crypto/openssh/xmss_fast.c
561
memcpy(sk_seed, sk+4, n);
crypto/openssh/xmss_fast.c
562
unsigned char sk_prf[n];
crypto/openssh/xmss_fast.c
563
memcpy(sk_prf, sk+4+n, n);
crypto/openssh/xmss_fast.c
564
unsigned char pub_seed[n];
crypto/openssh/xmss_fast.c
565
memcpy(pub_seed, sk+4+2*n, n);
crypto/openssh/xmss_fast.c
571
unsigned char hash_key[3*n];
crypto/openssh/xmss_fast.c
582
unsigned char R[n];
crypto/openssh/xmss_fast.c
583
unsigned char msg_h[n];
crypto/openssh/xmss_fast.c
584
unsigned char ots_seed[n];
crypto/openssh/xmss_fast.c
593
prf(R, idx_bytes_32, sk_prf, n);
crypto/openssh/xmss_fast.c
595
memcpy(hash_key, R, n);
crypto/openssh/xmss_fast.c
596
memcpy(hash_key+n, sk+4+3*n, n);
crypto/openssh/xmss_fast.c
597
to_byte(hash_key+2*n, idx, n);
crypto/openssh/xmss_fast.c
599
h_msg(msg_h, msg, msglen, hash_key, 3*n, n);
crypto/openssh/xmss_fast.c
60
params->n = n;
crypto/openssh/xmss_fast.c
614
for (i = 0; i < n; i++)
crypto/openssh/xmss_fast.c
617
sig_msg += n;
crypto/openssh/xmss_fast.c
618
*sig_msg_len += n;
crypto/openssh/xmss_fast.c
629
get_seed(ots_seed, sk_seed, n, ots_addr);
crypto/openssh/xmss_fast.c
63
wots_set_params(&wots_par, n, w);
crypto/openssh/xmss_fast.c
638
memcpy(sig_msg, state->auth, h*n);
crypto/openssh/xmss_fast.c
647
sig_msg += params->h*n;
crypto/openssh/xmss_fast.c
648
*sig_msg_len += params->h*n;
crypto/openssh/xmss_fast.c
665
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
670
unsigned char pkhash[n];
crypto/openssh/xmss_fast.c
671
unsigned char root[n];
crypto/openssh/xmss_fast.c
672
unsigned char msg_h[n];
crypto/openssh/xmss_fast.c
673
unsigned char hash_key[3*n];
crypto/openssh/xmss_fast.c
675
unsigned char pub_seed[n];
crypto/openssh/xmss_fast.c
676
memcpy(pub_seed, pk+n, n);
crypto/openssh/xmss_fast.c
692
memcpy(hash_key, sig_msg+4,n);
crypto/openssh/xmss_fast.c
693
memcpy(hash_key+n, pk, n);
crypto/openssh/xmss_fast.c
694
to_byte(hash_key+2*n, idx, n);
crypto/openssh/xmss_fast.c
696
sig_msg += (n+4);
crypto/openssh/xmss_fast.c
697
sig_msg_len -= (n+4);
crypto/openssh/xmss_fast.c
700
unsigned long long tmp_sig_len = params->wots_par.keysize+params->h*n;
crypto/openssh/xmss_fast.c
702
h_msg(msg_h, sig_msg + tmp_sig_len, m_len, hash_key, 3*n, n);
crypto/openssh/xmss_fast.c
723
sig_msg += params->h*n;
crypto/openssh/xmss_fast.c
724
sig_msg_len -= params->h*n;
crypto/openssh/xmss_fast.c
726
for (i = 0; i < n; i++)
crypto/openssh/xmss_fast.c
752
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
754
unsigned char ots_seed[params->n];
crypto/openssh/xmss_fast.c
760
randombytes(sk+params->index_len, 3*n);
crypto/openssh/xmss_fast.c
762
memcpy(pk+n, sk+params->index_len+2*n, n);
crypto/openssh/xmss_fast.c
770
treehash_setup(pk, params->xmss_par.h, 0, states + i, sk+params->index_len, &(params->xmss_par), pk+n, addr);
crypto/openssh/xmss_fast.c
772
get_seed(ots_seed, sk+params->index_len, n, addr);
crypto/openssh/xmss_fast.c
773
wots_sign(wots_sigs + i*params->xmss_par.wots_par.keysize, pk, ots_seed, &(params->xmss_par.wots_par), pk+n, addr);
crypto/openssh/xmss_fast.c
775
treehash_setup(pk, params->xmss_par.h, 0, states + i, sk+params->index_len, &(params->xmss_par), pk+n, addr);
crypto/openssh/xmss_fast.c
776
memcpy(sk+params->index_len+3*n, pk, n);
crypto/openssh/xmss_fast.c
789
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
801
unsigned char sk_seed[n];
crypto/openssh/xmss_fast.c
802
unsigned char sk_prf[n];
crypto/openssh/xmss_fast.c
803
unsigned char pub_seed[n];
crypto/openssh/xmss_fast.c
805
unsigned char R[n];
crypto/openssh/xmss_fast.c
806
unsigned char msg_h[n];
crypto/openssh/xmss_fast.c
807
unsigned char hash_key[3*n];
crypto/openssh/xmss_fast.c
808
unsigned char ots_seed[n];
crypto/openssh/xmss_fast.c
820
memcpy(sk_seed, sk+idx_len, n);
crypto/openssh/xmss_fast.c
821
memcpy(sk_prf, sk+idx_len+n, n);
crypto/openssh/xmss_fast.c
822
memcpy(pub_seed, sk+idx_len+2*n, n);
crypto/openssh/xmss_fast.c
839
prf(R, idx_bytes_32, sk_prf, n);
crypto/openssh/xmss_fast.c
841
memcpy(hash_key, R, n);
crypto/openssh/xmss_fast.c
842
memcpy(hash_key+n, sk+idx_len+3*n, n);
crypto/openssh/xmss_fast.c
843
to_byte(hash_key+2*n, idx, n);
crypto/openssh/xmss_fast.c
846
h_msg(msg_h, msg, msglen, hash_key, 3*n, n);
crypto/openssh/xmss_fast.c
860
for (i = 0; i < n; i++)
crypto/openssh/xmss_fast.c
863
sig_msg += n;
crypto/openssh/xmss_fast.c
864
*sig_msg_len += n;
crypto/openssh/xmss_fast.c
881
get_seed(ots_seed, sk_seed, n, ots_addr);
crypto/openssh/xmss_fast.c
889
memcpy(sig_msg, states[0].auth, tree_h*n);
crypto/openssh/xmss_fast.c
890
sig_msg += tree_h*n;
crypto/openssh/xmss_fast.c
891
*sig_msg_len += tree_h*n;
crypto/openssh/xmss_fast.c
90
int xmssmt_set_params(xmssmt_params *params, int n, int h, int d, int w, int k)
crypto/openssh/xmss_fast.c
902
memcpy(sig_msg, states[i].auth, tree_h*n);
crypto/openssh/xmss_fast.c
903
sig_msg += tree_h*n;
crypto/openssh/xmss_fast.c
904
*sig_msg_len += tree_h*n;
crypto/openssh/xmss_fast.c
944
get_seed(ots_seed, sk+params->index_len, n, ots_addr);
crypto/openssh/xmss_fast.c
972
unsigned int n = params->n;
crypto/openssh/xmss_fast.c
98
params->n = n;
crypto/openssh/xmss_fast.c
982
unsigned char pkhash[n];
crypto/openssh/xmss_fast.c
983
unsigned char root[n];
crypto/openssh/xmss_fast.c
984
unsigned char msg_h[n];
crypto/openssh/xmss_fast.c
985
unsigned char hash_key[3*n];
crypto/openssh/xmss_fast.c
987
unsigned char pub_seed[n];
crypto/openssh/xmss_fast.c
988
memcpy(pub_seed, pk+n, n);
crypto/openssh/xmss_fast.h
22
unsigned int n;
crypto/openssh/xmss_fast.h
29
unsigned int n;
crypto/openssh/xmss_fast.h
63
int xmss_set_params(xmss_params *params, int n, int h, int w, int k);
crypto/openssh/xmss_fast.h
70
int xmssmt_set_params(xmssmt_params *params, int n, int h, int d, int w, int k);
crypto/openssh/xmss_hash.c
102
prf(key, byte_addr, pub_seed, n);
crypto/openssh/xmss_hash.c
106
prf(bitmask, byte_addr, pub_seed, n);
crypto/openssh/xmss_hash.c
109
prf(bitmask+n, byte_addr, pub_seed, n);
crypto/openssh/xmss_hash.c
110
for (i = 0; i < 2*n; i++) {
crypto/openssh/xmss_hash.c
113
return core_hash_SHA2(out, 1, key, n, buf, 2*n, n);
crypto/openssh/xmss_hash.c
116
int hash_f(unsigned char *out, const unsigned char *in, const unsigned char *pub_seed, uint32_t addr[8], const unsigned int n)
crypto/openssh/xmss_hash.c
118
unsigned char buf[n];
crypto/openssh/xmss_hash.c
119
unsigned char key[n];
crypto/openssh/xmss_hash.c
120
unsigned char bitmask[n];
crypto/openssh/xmss_hash.c
126
prf(key, byte_addr, pub_seed, n);
crypto/openssh/xmss_hash.c
130
prf(bitmask, byte_addr, pub_seed, n);
crypto/openssh/xmss_hash.c
132
for (i = 0; i < n; i++) {
crypto/openssh/xmss_hash.c
135
return core_hash_SHA2(out, 0, key, n, buf, n, n);
crypto/openssh/xmss_hash.c
38
int core_hash_SHA2(unsigned char *out, const unsigned int type, const unsigned char *key, unsigned int keylen, const unsigned char *in, unsigned long long inlen, unsigned int n){
crypto/openssh/xmss_hash.c
40
unsigned char buf[inlen + n + keylen];
crypto/openssh/xmss_hash.c
45
to_byte(buf, type, n);
crypto/openssh/xmss_hash.c
48
buf[i+n] = key[i];
crypto/openssh/xmss_hash.c
52
buf[keylen + n + i] = in[i];
crypto/openssh/xmss_hash.c
55
if (n == 32) {
crypto/openssh/xmss_hash.c
56
SHA256(buf, inlen + keylen + n, out);
crypto/openssh/xmss_hash.c
60
if (n == 64) {
crypto/openssh/xmss_hash.c
61
SHA512(buf, inlen + keylen + n, out);
crypto/openssh/xmss_hash.c
79
int h_msg(unsigned char *out, const unsigned char *in, unsigned long long inlen, const unsigned char *key, const unsigned int keylen, const unsigned int n)
crypto/openssh/xmss_hash.c
81
if (keylen != 3*n){
crypto/openssh/xmss_hash.c
85
return core_hash_SHA2(out, 2, key, keylen, in, inlen, n);
crypto/openssh/xmss_hash.c
91
int hash_h(unsigned char *out, const unsigned char *in, const unsigned char *pub_seed, uint32_t addr[8], const unsigned int n)
crypto/openssh/xmss_hash.c
94
unsigned char buf[2*n];
crypto/openssh/xmss_hash.c
95
unsigned char key[n];
crypto/openssh/xmss_hash.c
96
unsigned char bitmask[2*n];
crypto/openssh/xmss_hash.h
17
int h_msg(unsigned char *out,const unsigned char *in,unsigned long long inlen, const unsigned char *key, const unsigned int keylen, const unsigned int n);
crypto/openssh/xmss_hash.h
18
int hash_h(unsigned char *out, const unsigned char *in, const unsigned char *pub_seed, uint32_t addr[8], const unsigned int n);
crypto/openssh/xmss_hash.h
19
int hash_f(unsigned char *out, const unsigned char *in, const unsigned char *pub_seed, uint32_t addr[8], const unsigned int n);
crypto/openssh/xmss_wots.c
114
gen_chain(pk+i*params->n, pk+i*params->n, 0, params->w-1, params, pub_seed, addr);
crypto/openssh/xmss_wots.c
152
gen_chain(sig+i*params->n, sig+i*params->n, 0, basew[i], params, pub_seed, addr);
crypto/openssh/xmss_wots.c
187
gen_chain(pk+i*params->n, sig+i*params->n, basew[i], params->w-1-basew[i], params, pub_seed, addr);
crypto/openssh/xmss_wots.c
38
wots_set_params(wots_params *params, int n, int w)
crypto/openssh/xmss_wots.c
40
params->n = n;
crypto/openssh/xmss_wots.c
43
params->len_1 = (CHAR_BIT * n) / params->log_w;
crypto/openssh/xmss_wots.c
46
params->keysize = params->len * params->n;
crypto/openssh/xmss_wots.c
60
prf((outseeds + (i*params->n)), ctr, inseed, params->n);
crypto/openssh/xmss_wots.c
74
for (j = 0; j < params->n; j++)
crypto/openssh/xmss_wots.c
79
hash_f(out, out, pub_seed, addr, params->n);
crypto/openssh/xmss_wots.h
26
uint32_t n;
crypto/openssh/xmss_wots.h
39
void wots_set_params(wots_params *params, int n, int w);
games/adventure/init.c
273
trapdel(int n __unused)
games/adventure/io.c
354
int len, m, n, entries = 0;
games/adventure/io.c
381
n = atoi(buf); /* newloc mod 1000 = newloc */
games/adventure/io.c
383
n = atoi(buf + len - 3);
games/adventure/io.c
397
t->tloc = n; /* table entry mod 1000 */
games/adventure/io.c
487
int n = rnum();
games/adventure/io.c
488
if (n < 0)
games/adventure/io.c
490
cond[n] |= setbit[bitnum];
games/adventure/save.c
660
unsigned i, j, n;
games/adventure/save.c
709
n = save_intarrays[i].num;
games/adventure/save.c
710
for (j=0; j<n; j++) {
games/adventure/save.c
751
unsigned i, j, n;
games/adventure/save.c
818
n = save_intarrays[i].num;
games/adventure/save.c
819
for (j=0; j<n; j++) {
games/adventure/subr.c
111
bitset(int l, int n)
games/adventure/subr.c
113
if (cond[l] & setbit[n])
games/adventure/subr.c
135
pct(int n)
games/adventure/subr.c
137
if (ran(100) < n)
games/adventure/subr.c
490
bug(int n)
games/adventure/subr.c
492
printf("Please tell jim@rand.org that fatal bug %d happened.\n", n);
games/atc/update.c
364
findplane(int n)
games/atc/update.c
369
if (pp->plane_no == n)
games/atc/update.c
372
if (pp->plane_no == n)
games/backgammon/backgammon/extra.c
112
int n; /* accumulated judgment */
games/backgammon/backgammon/extra.c
123
n = eval() * cturn;
games/backgammon/backgammon/extra.c
128
fprintf(trace, "\n\tpip = %d, ", n);
games/backgammon/backgammon/extra.c
138
n += ((OFFC - OFFO) * 7) / 2;
games/backgammon/backgammon/extra.c
142
n -= OFFO * 7 / 2;
games/backgammon/backgammon/extra.c
146
n += OFFC * 7 / 2;
games/backgammon/backgammon/extra.c
149
n -= 7;
games/backgammon/backgammon/extra.c
151
n -= 7;
games/backgammon/backgammon/extra.c
153
n -= 7;
games/backgammon/backgammon/extra.c
155
n += 7;
games/backgammon/backgammon/extra.c
157
n += 7;
games/backgammon/backgammon/extra.c
159
n += 7;
games/backgammon/backgammon/extra.c
160
n += ((OFFC - OFFO) * 7) / 2;
games/backgammon/backgammon/extra.c
163
fprintf(trace, "off = %d, ", n);
games/backgammon/backgammon/extra.c
167
n -= freemen(bar);
games/backgammon/backgammon/extra.c
168
n += freemen(home);
games/backgammon/backgammon/extra.c
169
n += trapped(home, -cturn);
games/backgammon/backgammon/extra.c
170
n -= trapped(bar, cturn);
games/backgammon/backgammon/extra.c
173
fprintf(trace, "free = %d\n", n);
games/backgammon/backgammon/extra.c
179
if (n > 10 + rnum(7))
games/backgammon/backgammon/extra.c
203
trapped(int n, int inc)
games/backgammon/backgammon/extra.c
209
l = n + 7 * inc;
games/backgammon/backgammon/extra.c
210
for (i = n + inc; i != l; i += inc) {
games/backgammon/backgammon/move.c
488
int n;
games/backgammon/backgammon/move.c
519
n = barmen - abs(board[home]);
games/backgammon/backgammon/move.c
523
if (abs(chance - ch) + 25 * n > rnum(150))
games/backgammon/backgammon/move.c
524
return (n ? (n < 0) : (ch < chance));
games/backgammon/backgammon/move.c
538
if (n)
games/backgammon/backgammon/move.c
539
return (n < 0);
games/backgammon/backgammon/move.c
553
if (abs(n = pt - points) > rnum(4))
games/backgammon/backgammon/move.c
554
return (n > 0);
games/backgammon/common_source/fancy.c
196
int n; /* number of men on position */
games/backgammon/common_source/fancy.c
202
n = abs(b); /* initialize n and pc */
games/backgammon/common_source/fancy.c
205
if (n < 6 && cpos < 54) /* position cursor at start */
games/backgammon/common_source/fancy.c
213
if (n > j + k)
games/backgammon/common_source/fancy.c
217
if (n < 6) { /* stop if none left */
games/backgammon/common_source/fancy.c
218
if (j + 1 == n)
games/backgammon/common_source/fancy.c
222
if (n < 11) { /* two columns */
games/backgammon/common_source/fancy.c
224
if (j + 5 >= n)
games/backgammon/common_source/fancy.c
230
if (j + 6 >= n)
games/backgammon/common_source/fancy.c
236
if (j + 10 >= n)
games/backgammon/common_source/fancy.c
302
int o, n, nv;
games/backgammon/common_source/fancy.c
312
n = (nv - 1) / 5;
games/backgammon/common_source/fancy.c
313
if (o == n) {
games/backgammon/common_source/fancy.c
321
fixcol(r + inc * (nv - n * 5), nc,
games/backgammon/common_source/fancy.c
329
if (o + n == 1) {
games/backgammon/common_source/fancy.c
330
if (n) {
games/backgammon/common_source/fancy.c
347
if (n == 2) {
games/backgammon/common_source/fancy.c
362
if (n > o) {
games/backgammon/common_source/fancy.c
364
abs(5 * n - ov), col, inc);
games/backgammon/common_source/fancy.c
365
if (nv != 5 * n)
games/backgammon/common_source/fancy.c
366
fixcol(r, c + n, abs(5 * n - nv),
games/backgammon/common_source/fancy.c
369
fixcol(r + inc * (nv % 5), c + n,
games/backgammon/common_source/fancy.c
370
abs(5 * n - nv), ' ', inc);
games/backgammon/common_source/fancy.c
420
int n; /* temporary variable */
games/backgammon/common_source/fancy.c
444
if (HO && (n = r + c * lND + lHO) < ccount) {
games/backgammon/common_source/fancy.c
446
ccount = n;
games/backgammon/common_source/fancy.c
451
if ((n = (r - curr) + c * lND + 1) < ccount) {
games/backgammon/common_source/fancy.c
453
ccount = n;
games/backgammon/common_source/fancy.c
456
if (c >= curc && (n = (r - curr) + (c - curc) * lND) < ccount) {
games/backgammon/common_source/fancy.c
458
ccount = n;
games/backgammon/common_source/fancy.c
461
if (c < curc && (n = (r - curr) + (curc - c) * lBC) < ccount) {
games/backgammon/common_source/fancy.c
463
ccount = n;
games/backgammon/common_source/fancy.c
469
if ((n = (curr - r) * lUP + c * lND + 1) < ccount) {
games/backgammon/common_source/fancy.c
471
ccount = n;
games/backgammon/common_source/fancy.c
475
(n = (curr - r) * lUP + (c - curc) * lND) < ccount) {
games/backgammon/common_source/fancy.c
477
ccount = n;
games/backgammon/common_source/fancy.c
481
(n = (curr - r) * lUP + (curc - c) * lBC) < ccount) {
games/backgammon/common_source/fancy.c
483
ccount = n;
games/backgammon/common_source/one.c
41
int n, d;
games/backgammon/common_source/one.c
45
n = abs(mm->g[i] - mm->p[i]);
games/backgammon/common_source/one.c
52
if (n == max ? mm->D1 < n : mm->D1 != n)
games/backgammon/common_source/one.c
55
if (n == max ? mm->D0 < n && mm->D1 < n : mm->D0 != n && mm->D1 != n)
games/backgammon/common_source/one.c
57
if (n == max ? mm->D0 < n : mm->D0 != n) {
games/backgammon/common_source/save.c
51
save(struct move *mm, int n)
games/backgammon/common_source/save.c
57
if (n) {
games/backgammon/common_source/subs.c
151
wrint(int n)
games/backgammon/common_source/subs.c
159
if (n > t - 1)
games/backgammon/common_source/subs.c
160
writec((n / t) % 10 + '0');
games/backgammon/common_source/subs.c
162
writec(n % 10 + '0');
games/backgammon/common_source/table.c
121
n = rsetbrd(mm);
games/backgammon/common_source/table.c
122
if (n == 0) {
games/backgammon/common_source/table.c
123
n = -1;
games/backgammon/common_source/table.c
127
if ((ist = n) > 0)
games/backgammon/common_source/table.c
151
n = dotable(mm, c, ist);
games/backgammon/common_source/table.c
152
if (n >= 0) {
games/backgammon/common_source/table.c
154
if (n > 2)
games/backgammon/common_source/table.c
157
ist = n;
games/backgammon/common_source/table.c
158
if (n)
games/backgammon/common_source/table.c
163
if (n == -1 && mvl >= mm->mvlim)
games/backgammon/common_source/table.c
165
if (n == -1 && mvl < mm->mvlim - 1)
games/backgammon/common_source/table.c
168
if (n == -6) {
games/backgammon/common_source/table.c
185
ist = n = rsetbrd(mm);
games/backgammon/common_source/table.c
188
if (n != -5)
games/backgammon/common_source/table.c
189
return (n);
games/backgammon/common_source/table.c
291
int i, j, n;
games/backgammon/common_source/table.c
293
n = 0;
games/backgammon/common_source/table.c
298
if ((n = dotable(mm, cin[j], n)) < 0)
games/backgammon/common_source/table.c
299
return n;
games/backgammon/common_source/table.c
300
return (n);
games/backgammon/common_source/table.c
80
int j, n;
games/battlestar/command1.c
212
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/command1.c
213
if (injuries[n] == 1) {
games/battlestar/command1.c
214
injuries[n] = 2;
games/battlestar/command1.c
93
int n;
games/battlestar/command2.c
173
int n;
games/battlestar/command2.c
175
for (n = 0;
games/battlestar/command2.c
176
!((n == SWORD || n == KNIFE || n == TWO_HANDED || n == MACE ||
games/battlestar/command2.c
177
n == CLEAVER || n == BROAD || n == CHAIN || n == SHOVEL ||
games/battlestar/command2.c
178
n == HALBERD) && testbit(inven, n)) && n < NUMOFOBJECTS;
games/battlestar/command2.c
179
n++);
games/battlestar/command2.c
180
if (n == NUMOFOBJECTS) {
games/battlestar/command2.c
208
printf("Your %s should do the trick.\n", objsht[n]);
games/battlestar/command3.c
183
int n;
games/battlestar/command3.c
194
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/command3.c
195
injuries[n] = 0;
games/battlestar/command3.c
62
int n;
games/battlestar/command3.c
89
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/command3.c
90
if (testbit(inven, n)) {
games/battlestar/command3.c
91
clearbit(inven, n);
games/battlestar/command3.c
92
setbit(location[position].objects, n);
games/battlestar/command4.c
206
unsigned int n;
games/battlestar/command4.c
252
for (n = 0; n < NUMOFWORDS; n++)
games/battlestar/command4.c
253
location[deposit].objects[n] =
games/battlestar/command5.c
132
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/command5.c
133
injuries[n] = 0;
games/battlestar/command5.c
180
int n;
games/battlestar/command5.c
189
for (n = 0; n < ourtime - oldtime; n++)
games/battlestar/command5.c
207
n = rnd(NUMOFOBJECTS);
games/battlestar/command5.c
208
while (!testbit(inven, n))
games/battlestar/command5.c
209
n = rnd(NUMOFOBJECTS);
games/battlestar/command5.c
210
clearbit(inven, n);
games/battlestar/command5.c
211
if (n != AMULET && n != MEDALION &&
games/battlestar/command5.c
212
n != TALISMAN)
games/battlestar/command5.c
215
n);
games/battlestar/command5.c
216
carrying -= objwt[n];
games/battlestar/command5.c
217
encumber -= objcumber[n];
games/battlestar/command5.c
94
int n;
games/battlestar/cypher.c
115
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
117
n) && objsht[n]) {
games/battlestar/cypher.c
119
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
135
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
137
n) && objsht[n]) {
games/battlestar/cypher.c
139
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
155
switch(n) {
games/battlestar/cypher.c
186
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
187
if (testbit(inven, n)) {
games/battlestar/cypher.c
189
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
207
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
208
if (testbit(inven, n) ||
games/battlestar/cypher.c
209
(testbit(location[position].objects, n) && objsht[n])) {
games/battlestar/cypher.c
211
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
228
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
229
if (testbit(wear, n)) {
games/battlestar/cypher.c
231
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
246
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
247
if (testbit(wear, n)) {
games/battlestar/cypher.c
249
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
264
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
266
n) && objsht[n]) {
games/battlestar/cypher.c
268
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
283
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
284
if (testbit(inven, n)) {
games/battlestar/cypher.c
286
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
301
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
302
if (testbit(inven, n)) {
games/battlestar/cypher.c
304
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
321
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
322
if (testbit(inven, n))
games/battlestar/cypher.c
323
printf("\t%s\n", objsht[n]);
games/battlestar/cypher.c
348
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
349
if (testbit(wear, n))
games/battlestar/cypher.c
350
printf("\t%s\n", objsht[n]);
games/battlestar/cypher.c
355
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/cypher.c
356
if (injuries[n])
games/battlestar/cypher.c
357
printf("\t%s\n", ouch[n]);
games/battlestar/cypher.c
375
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
376
if (testbit(inven, n)) {
games/battlestar/cypher.c
378
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
38
int n;
games/battlestar/extern.h
266
#define is_plural_object(n) (objflags[(n)] & OBJ_PLURAL)
games/battlestar/extern.h
271
#define A_OR_AN(n) (objflags[(n)] & OBJ_AN ? "an " : "a ")
games/battlestar/extern.h
272
#define A_OR_AN_OR_THE(n) (is_plural_object((n)) ? "the " : A_OR_AN((n)))
games/battlestar/extern.h
273
#define A_OR_AN_OR_BLANK(n) (is_plural_object((n)) ? "" : A_OR_AN((n)))
games/battlestar/extern.h
274
#define IS_OR_ARE(n) (is_plural_object((n)) ? "are " : "is ")
games/battlestar/fly.c
180
int r, c, n;
games/battlestar/fly.c
185
for (n = 0; n < i; n++) {
games/battlestar/fly.c
197
int n;
games/battlestar/fly.c
201
for (n = MIDR - 4; n < MIDR - 1; n++) {
games/battlestar/fly.c
202
mvaddch(n, MIDC, '|');
games/battlestar/fly.c
203
mvaddch(n + 6, MIDC, '|');
games/battlestar/fly.c
210
int n;
games/battlestar/fly.c
214
for (n = MIDR - 4; n < MIDR - 1; n++) {
games/battlestar/fly.c
215
mvaddch(n, MIDC, ' ');
games/battlestar/fly.c
216
mvaddch(n + 6, MIDC, ' ');
games/battlestar/fly.c
223
int n;
games/battlestar/fly.c
228
for (n = LINES - 1 - 2; n >= MIDR + 1; n--) {
games/battlestar/fly.c
229
mvaddch(n, MIDC + MIDR - n, '/');
games/battlestar/fly.c
230
mvaddch(n, MIDC - MIDR + n, '\\');
games/battlestar/fly.c
234
for (n = LINES - 1 - 2; n >= MIDR + 1; n--) {
games/battlestar/fly.c
235
mvaddch(n, MIDC + MIDR - n, ' ');
games/battlestar/fly.c
236
mvaddch(n, MIDC - MIDR + n, ' ');
games/battlestar/misc.c
51
int j = 0, n;
games/battlestar/misc.c
53
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/misc.c
54
if (testbit(array, n))
games/battlestar/parse.c
100
if ((wp = lookup(words[n])) == NULL) {
games/battlestar/parse.c
101
wordvalue[n] = -1;
games/battlestar/parse.c
102
wordtype[n] = -1;
games/battlestar/parse.c
104
wordvalue[n] = wp->value;
games/battlestar/parse.c
105
wordtype[n] = wp->article;
games/battlestar/parse.c
109
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
110
if (wordtype[n] == ADJS) {
games/battlestar/parse.c
112
for (i = n + 1; i < wordcount; i++) {
games/battlestar/parse.c
120
for (n = 0; n < wordcount; n++)
games/battlestar/parse.c
121
if (wordvalue[n] == AND && words[n][0] == ','
games/battlestar/parse.c
122
&& wordtype[n + 1] == VERB) {
games/battlestar/parse.c
123
wordvalue[n] = -1;
games/battlestar/parse.c
124
wordtype[n] = -1;
games/battlestar/parse.c
129
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
130
if (wordvalue[n - 1] == AND && wordvalue[n] == AND) {
games/battlestar/parse.c
132
for (i = n + 1; i < wordcount; i++) {
games/battlestar/parse.c
148
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
149
if ((wordtype[n - 1] == NOUNS ||
games/battlestar/parse.c
150
wordtype[n - 1] == OBJECT) &&
games/battlestar/parse.c
151
wordvalue[n] == AND &&
games/battlestar/parse.c
152
wordvalue[n + 1] == EVERYTHING) {
games/battlestar/parse.c
154
wordvalue[n + 1] = wordvalue[n - 1];
games/battlestar/parse.c
155
wordvalue[n - 1] = EVERYTHING;
games/battlestar/parse.c
156
wordtype[n + 1] = wordtype[n - 1];
games/battlestar/parse.c
157
wordtype[n - 1] = OBJECT;
games/battlestar/parse.c
158
strcpy(tmpword, words[n - 1]);
games/battlestar/parse.c
159
strlcpy(words[n - 1], words[n + 1], WORDLEN);
games/battlestar/parse.c
160
strcpy(words[n + 1], tmpword);
games/battlestar/parse.c
164
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
165
if (wordvalue[n - 1] == EVERYTHING &&
games/battlestar/parse.c
166
wordvalue[n] == AND &&
games/battlestar/parse.c
167
wordvalue[n + 1] == EVERYTHING) {
games/battlestar/parse.c
169
for (i = n + 1; i < wordcount; i++) {
games/battlestar/parse.c
95
int n;
games/battlestar/parse.c
99
for (n = 0; n <= wordcount; n++) {
games/battlestar/room.c
63
int n;
games/battlestar/room.c
66
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/room.c
67
if (testbit(p, n) && objdes[n])
games/battlestar/room.c
68
puts(objdes[n]);
games/battlestar/save.c
106
for (n = 1; n <= NUMOFROOMS; n++) {
games/battlestar/save.c
107
fwrite(location[n].link, sizeof location[n].link, 1, fp);
games/battlestar/save.c
108
fwrite(location[n].objects, sizeof location[n].objects, 1, fp);
games/battlestar/save.c
38
int n;
games/battlestar/save.c
52
for (n = 1; n <= NUMOFROOMS; n++) {
games/battlestar/save.c
53
fread(location[n].link, sizeof location[n].link, 1, fp);
games/battlestar/save.c
54
fread(location[n].objects, sizeof location[n].objects, 1, fp);
games/battlestar/save.c
90
int n;
games/boggle/boggle/mach.c
355
int n;
games/boggle/boggle/mach.c
366
if ((n = strlen(w)) > maxw)
games/boggle/boggle/mach.c
367
maxw = n;
games/boggle/boggle/mach.c
388
showword(int n)
games/boggle/boggle/mach.c
392
row = LIST_LINE + n % (lastline - LIST_LINE + 1);
games/boggle/boggle/mach.c
393
col = colstarts[n / (lastline - LIST_LINE + 1)];
games/boggle/boggle/mach.c
396
printw("%s", pword[n]);
games/boggle/boggle/mach.c
402
printw("%s", pword[n]);
games/boggle/boggle/word.c
127
long n;
games/boggle/boggle/word.c
144
n = (long)statb.st_size;
games/boggle/boggle/word.c
146
dictend = dictspace + n;
games/boggle/boggle/word.c
150
while (n > 0 && (st = fread(p, 1, BUFSIZ, fp)) > 0) {
games/boggle/boggle/word.c
152
n -= st;
games/boggle/mkdict/mkdict.c
101
if (argc == 2 && nwords % n)
games/boggle/mkdict/mkdict.c
60
int n = 1; /* suppress maybe stuff */
games/boggle/mkdict/mkdict.c
68
n = strtonum(argv[1], 1, INT_MAX, &errstr);
games/bs/bs.c
245
prompt(int n, const char *f, ...)
games/bs/bs.c
251
move(PROMPTLINE + n, 0);
games/bs/bs.c
289
rnd(int n)
games/bs/bs.c
291
return(random() % n);
games/bs/bs.c
953
int navail, x, y, d, n, hit = S_MISS;
games/bs/bs.c
987
for (d = 0, n = rnd(navail) + 1; n; n--)
games/cribbage/cards.c
102
cremove(CARD a, CARD d[], int n)
games/cribbage/cards.c
106
for (i = j = 0; i < n; i++)
games/cribbage/cards.c
109
if (j < n)
games/cribbage/cards.c
118
sorthand(CARD h[], int n)
games/cribbage/cards.c
123
for (endp = &h[n]; h < endp - 1; h++)
games/cribbage/cards.c
88
isone(CARD a, CARD b[], int n)
games/cribbage/cards.c
92
for (i = 0; i < n; i++)
games/cribbage/io.c
147
prhand(CARD h[], int n, WINDOW *win, bool blank)
games/cribbage/io.c
152
for (i = 0; i < n; i++)
games/cribbage/io.c
163
infrom(CARD hand[], int n, const char *prompt)
games/cribbage/io.c
168
if (n < 1) {
games/cribbage/io.c
169
printf("\nINFROM: %d = n < 1!!\n", n);
games/cribbage/io.c
175
if (!isone(crd, hand, n))
games/cribbage/io.c
178
for (i = 0; i < n; i++)
games/cribbage/io.c
182
if (i >= n) {
games/cribbage/io.c
190
for (i = 0; i < n; i++)
games/cribbage/io.c
193
if (i >= n)
games/cribbage/io.c
196
for (j = i + 1; j < n; j++)
games/cribbage/io.c
199
if (j < n)
games/cribbage/score.c
105
scorehand(CARD hand[], CARD starter, int n, bool crb, bool do_explain)
games/cribbage/score.c
117
for (i = 0; i < n; i++) { /* check for flush */
games/cribbage/score.c
128
if (flag && n >= CINHAND) {
games/cribbage/score.c
146
h[n] = starter;
games/cribbage/score.c
147
sorthand(h, n + 1); /* sort by rank */
games/cribbage/score.c
148
i = 2 * fifteens(h, n + 1);
games/cribbage/score.c
157
i = pairuns(h, n + 1);
games/cribbage/score.c
175
fifteens(CARD hand[], int n)
games/cribbage/score.c
189
for (endp = &hand[n]; hand < endp; hand++) {
games/cribbage/score.c
216
pairuns(CARD h[], int n)
games/cribbage/score.c
230
for (i = 1; i < n; i++) {
games/cribbage/score.c
248
if (i == (n - 1) && run) {
games/cribbage/score.c
283
pegscore(CARD crd, CARD tbl[], int n, int sum)
games/cribbage/score.c
296
if (!n)
games/cribbage/score.c
299
while ((crd.rank == tbl[n - j].rank) && (n - j >= 0))
games/cribbage/score.c
303
if (n < 2)
games/cribbage/score.c
310
for (i = n - 1; i >= 0; --i) {
games/cribbage/support.c
104
for (i = n - 1; i >= 0; --i) {
games/cribbage/support.c
284
anymove(CARD hand[], int n, int sum)
games/cribbage/support.c
288
if (n < 1)
games/cribbage/support.c
291
for (i = 1; i < n; i++) {
games/cribbage/support.c
303
anysumto(CARD hand[], int n, int s, int t)
games/cribbage/support.c
307
for (i = 0; i < n; i++) {
games/cribbage/support.c
318
numofval(CARD h[], int n, int v)
games/cribbage/support.c
323
for (i = 0; i < n; i++) {
games/cribbage/support.c
334
makeknown(CARD h[], int n)
games/cribbage/support.c
338
for (i = 0; i < n; i++)
games/cribbage/support.c
56
cchose(CARD h[], int n, int s)
games/cribbage/support.c
60
if (n <= 1)
games/cribbage/support.c
63
if ((j = anysumto(h, n, s, 4)) >= 0)
games/cribbage/support.c
65
if ((j = anysumto(h, n, s, 3)) >= 0 && s == 0)
games/cribbage/support.c
71
if ((j = anysumto(h, n, s, 21 - i)) >= 0) {
games/cribbage/support.c
72
if ((l = numofval(h, n, i)) > 0) {
games/cribbage/support.c
82
if ((j = anysumto(h, n, s, tv[i])) >= 0) {
games/cribbage/support.c
83
if ((l = numofval(h, n, 15 - tv[i])) > 0) {
games/cribbage/support.c
93
for (i = n - 1; i >= 0; --i) {
games/fish/fish.c
137
int n;
games/fish/fish.c
177
n = p - cards;
games/fish/fish.c
178
if (userhand[n] <= 3 && userhand[n]) {
games/fish/fish.c
179
userasked[n] = 1;
games/fish/fish.c
180
return(n);
games/fish/fish.c
182
if (userhand[n] == 4) {
games/fish/fish.c
190
printf("You don't have any %s's!\n", cards[n]);
games/fish/fish.c
419
nrandom(int n)
games/fish/fish.c
422
return((int)random() % n);
games/gomoku/bdinit.c
174
int i, f, r, n, d1, d2;
games/gomoku/bdinit.c
209
n = sp2->s_frame[r] - frames;
games/gomoku/bdinit.c
210
ip[n] = vertex;
games/gomoku/bdinit.c
211
str[n] |= (f == 5) ? mask & 0xA : mask;
games/gomoku/bdinit.c
217
str[n] |= 0xA0;
games/gomoku/bdinit.c
219
str[n] |= 0xF0;
games/gomoku/bdinit.c
223
str[n] |= 0xA0;
games/gomoku/bdinit.c
225
str[n] |= 0xF0;
games/gomoku/bdinit.c
229
str[n] |= 0xC0;
games/gomoku/bdinit.c
231
str[n] |= 0xF0;
games/gomoku/bdinit.c
235
str[n] |= 0xC0;
games/gomoku/bdinit.c
237
str[n] |= 0xF0;
games/gomoku/bdinit.c
240
str[n] |= 0xF0;
games/gomoku/main.c
361
int i, n, s1, s2, d1, d2;
games/gomoku/main.c
426
n = 0;
games/gomoku/main.c
434
n = (sp->s_frame[d1] - frames) * FAREA;
games/gomoku/main.c
444
n += sp->s_frame[d2] - frames;
games/gomoku/main.c
446
stoc(s2), pdir[d2], overlap[n]);
games/gomoku/main.c
465
n = *str++ - '0';
games/gomoku/main.c
467
n = 0;
games/gomoku/main.c
471
if (n) {
games/gomoku/main.c
472
if (cbp->c_nframes > n)
games/gomoku/main.c
474
if (cbp->c_nframes != n)
games/gomoku/makemove.c
119
n = 0;
games/gomoku/makemove.c
122
n++;
games/gomoku/makemove.c
140
if (n == 5)
games/gomoku/makemove.c
148
cp->c.a = 4 - n;
games/gomoku/makemove.c
151
cp->c.a = 5 - n;
games/gomoku/makemove.c
154
val = weight[n];
games/gomoku/makemove.c
217
int i, f, r, r1, d, d1, n;
games/gomoku/makemove.c
250
n = 0;
games/gomoku/makemove.c
255
n++;
games/gomoku/makemove.c
259
if (n == 0) {
games/gomoku/makemove.c
263
intersect[a * FAREA + b] = n = sp - board;
games/gomoku/makemove.c
264
intersect[b * FAREA + a] = n;
games/gomoku/makemove.c
269
} else if (n == 1) {
games/gomoku/makemove.c
277
intersect[a * FAREA + b] = n = esp - board;
games/gomoku/makemove.c
278
intersect[b * FAREA + a] = n;
games/gomoku/makemove.c
64
int i, f, r, d, n;
games/gomoku/pickmove.c
1079
int i, n, mask, flags, verts, myindex, fcnt;
games/gomoku/pickmove.c
1091
n = (fcbp - frames) * FAREA;
games/gomoku/pickmove.c
1092
str = &overlap[n];
games/gomoku/pickmove.c
1093
ip = &intersect[n];
games/gomoku/pickmove.c
1108
n = i + ((flags & C_OPEN_1) != 0);
games/gomoku/pickmove.c
1109
if (mask & (1 << n)) {
games/gomoku/pickmove.c
1115
if (tcbp->c_dir == fcbp->c_dir && (mask & (0x10 << n)))
games/gomoku/pickmove.c
1122
n = ip[tcbp - frames];
games/gomoku/pickmove.c
1123
if (osp != &board[n]) {
games/gomoku/pickmove.c
1135
(n == tcbp->c_vertex ||
games/gomoku/pickmove.c
1136
n == tcbp->c_vertex + 5 * dd[tcbp->c_dir]))
games/gomoku/pickmove.c
1139
(n == fcbp->c_vertex ||
games/gomoku/pickmove.c
1140
n == fcbp->c_vertex + 5 * dd[fcbp->c_dir]))
games/gomoku/pickmove.c
1143
vertices->o_intersect = n;
games/gomoku/pickmove.c
1146
vertices->o_off = (n - tcbp->c_vertex) /
games/gomoku/pickmove.c
1152
n = i + ((flags & C_OPEN_0) != 0);
games/gomoku/pickmove.c
1159
if (mask & (1 << n)) {
games/gomoku/pickmove.c
1165
if (cbp->c_dir == fcbp->c_dir && (mask & (0x10 << n)))
games/gomoku/pickmove.c
1172
n = ip[cbp - frames];
games/gomoku/pickmove.c
1173
if (osp != &board[n]) {
games/gomoku/pickmove.c
1185
(n == cbp->c_vertex ||
games/gomoku/pickmove.c
1186
n == cbp->c_vertex + 5 * dd[cbp->c_dir]))
games/gomoku/pickmove.c
1189
(n == fcbp->c_vertex ||
games/gomoku/pickmove.c
1190
n == fcbp->c_vertex + 5 * dd[fcbp->c_dir]))
games/gomoku/pickmove.c
1193
vertices->o_intersect = n;
games/gomoku/pickmove.c
1196
vertices->o_off = (n - cbp->c_vertex) /
games/gomoku/pickmove.c
1217
int n, inx;
games/gomoku/pickmove.c
1237
n = curlevel + 1;
games/gomoku/pickmove.c
1238
spp = scbpp + n;
games/gomoku/pickmove.c
1270
cpp = cbpp + n;
games/gomoku/pickmove.c
1271
spp = scbpp + n;
games/gomoku/pickmove.c
1283
debuglog("sort1: n%d", n);
games/gomoku/pickmove.c
1285
for (cpp = scbpp; cpp < scbpp + n; cpp++) {
games/gomoku/pickmove.c
1296
for (cpp = cbpp; cpp < cbpp + n; cpp++) {
games/gomoku/pickmove.c
1464
int d, n, mask;
games/gomoku/pickmove.c
1471
d = dd[n = cbp->c_dir];
games/gomoku/pickmove.c
1472
mask = ~((IFLAG | CFLAG) << n);
games/gomoku/pickmove.c
1473
n = open ? 6 : 5;
games/gomoku/pickmove.c
1474
for (; --n >= 0; sp += d)
games/gomoku/pickmove.c
1479
list_eq(struct combostr **scbpp, struct combostr **cbpp, int n)
games/gomoku/pickmove.c
1483
spp = scbpp + n;
games/gomoku/pickmove.c
1484
cpp = cbpp + n;
games/gomoku/pickmove.c
236
int i, r, d, n;
games/gomoku/pickmove.c
266
n = combolen;
games/gomoku/pickmove.c
308
n = sp - board;
games/gomoku/pickmove.c
309
BIT_SET(tmpmap, n);
games/gomoku/pickmove.c
335
while (d <= ((movenum + 1) >> 1) && combolen > n) {
games/gomoku/pickmove.c
338
d, combolen - n, combocnt, elistcnt);
games/gomoku/pickmove.c
341
n = combolen;
games/gomoku/pickmove.c
418
int baseB, fcnt, emask, bmask, n;
games/gomoku/pickmove.c
466
n = fcb.c.a + fcb.c.b - 1;
games/gomoku/pickmove.c
467
if (baseB < n)
games/gomoku/pickmove.c
468
n = baseB;
games/gomoku/pickmove.c
485
ncbp->c_combo.c.b = n;
games/gomoku/pickmove.c
650
int n, c;
games/gomoku/pickmove.c
712
n = ep->e_fval.c.a + ep->e_fval.c.b - 1;
games/gomoku/pickmove.c
713
if (baseB < n)
games/gomoku/pickmove.c
714
n = baseB;
games/gomoku/pickmove.c
729
ncbp->c_combo.c.b = n;
games/gomoku/pickmove.c
750
n = (vertices[0].o_intersect - ocbp->c_vertex) /
games/gomoku/pickmove.c
752
ncbp->c_emask[1] = emask & ~(1 << n);
games/grdc/grdc.c
217
} while (forever ? 1 : --n);
games/grdc/grdc.c
290
set(int t, int n)
games/grdc/grdc.c
298
m = 7 << n;
games/grdc/grdc.c
300
next[i] |= ((disp[t] >> (4 - i) * 3) & 07) << n;
games/grdc/grdc.c
54
int i, s, k, n, ch;
games/grdc/grdc.c
60
n = 0;
games/grdc/grdc.c
94
n = atoi(*argv);
games/hack/config.h
197
#define Bitfield(x,n) unsigned x:n
games/hack/hack.c
887
losehp(int n, const char *knam)
games/hack/hack.c
889
u.uhp -= n;
games/hack/hack.c
900
losehp_m(int n, struct monst *mtmp)
games/hack/hack.c
902
u.uhp -= n;
games/hack/hack.end.c
112
done_intr(int n __unused)
games/hack/hack.end.c
120
done_hangup(int n)
games/hack/hack.end.c
124
done_intr(n);
games/hack/hack.end.c
624
ordin(int n)
games/hack/hack.end.c
626
int dg = n % 10;
games/hack/hack.end.c
628
return ((dg == 0 || dg > 3 || n / 10 == 1) ? "th" : (dg == 1) ? "st" :
games/hack/hack.end.c
646
hang_up(int n __unused)
games/hack/hack.end.c
91
done1(int n __unused)
games/hack/hack.engrave.c
103
size_t n;
games/hack/hack.engrave.c
110
n = strlen(s);
games/hack/hack.engrave.c
112
if (!strncmp(s, t, n))
games/hack/hack.invent.c
291
sobj_at(int n, int x, int y)
games/hack/hack.invent.c
296
if (otmp->ox == x && otmp->oy == y && otmp->otyp == n)
games/hack/hack.pager.c
134
intruph(int n __unused)
games/hack/hack.rip.c
127
int n = strlen(text) / 2;
games/hack/hack.rip.c
128
printf(ripmid, 8 + n, text, 8 - n, "");
games/hack/hack.save.c
85
hang_up(int n __unused)
games/hack/hack.shk.c
119
doinvbill(int n)
games/hack/hack.shk.c
94
shopdig(int n)
games/hack/hack.topl.c
212
int n, n0, tlpos, dead;
games/hack/hack.topl.c
246
for (n = 0; n < CO; n++)
games/hack/hack.topl.c
247
if (bp[n] == ' ')
games/hack/hack.topl.c
248
n0 = n;
games/hack/hack.topl.c
250
for (n = 0; n < CO - 1; n++)
games/hack/hack.topl.c
251
if (!letter(bp[n]))
games/hack/hack.topl.c
252
n0 = n;
games/hack/makedefs.c
140
int n = read(fd, lp0, (line + LINSZ) - lp0);
games/hack/makedefs.c
141
if (n < 0) {
games/hack/makedefs.c
145
if (n == 0)
games/hack/makedefs.c
147
lpe = lp0 + n;
games/hack/rnd.c
89
d(int n, int x)
games/hack/rnd.c
91
int tmp = n;
games/hack/rnd.c
93
while (n--)
games/hals_end/hals_end.c
87
int n;
games/hals_end/hals_end.c
89
for (n = 0; n < 2; n++) {
games/hunt/huntd/makemaze.c
43
# define ODD(n) ((n) & 01)
games/hunt/huntd/shots.c
457
int n, dir = -1;
games/hunt/huntd/shots.c
520
n = rand_num(count);
games/hunt/huntd/shots.c
521
if (n >= 0 && mask & NORTH)
games/hunt/huntd/shots.c
522
dir = NORTH, n--;
games/hunt/huntd/shots.c
523
if (n >= 0 && mask & SOUTH)
games/hunt/huntd/shots.c
524
dir = SOUTH, n--;
games/hunt/huntd/shots.c
525
if (n >= 0 && mask & EAST)
games/hunt/huntd/shots.c
526
dir = EAST, n--;
games/hunt/huntd/shots.c
527
if (n >= 0 && mask & WEST)
games/hunt/huntd/shots.c
528
dir = WEST, n--;
games/larn/create.c
472
fillmroom(int n, char what, int arg)
games/larn/create.c
475
for (i = 0; i < n; i++)
games/larn/create.c
480
froom(int n, char itm, int arg)
games/larn/create.c
482
if (rnd(151) < n)
games/larn/display.c
367
int i, j, l, n;
games/larn/display.c
392
for (n = minx; n <= maxx; n++)
games/larn/display.c
393
if (know[n][j] == 0) {
games/larn/display.c
394
cursor(n + 1, j + 1);
games/larn/display.c
398
for (i = n; i <= x; i++) {
games/larn/display.c
419
n = maxx;
games/larn/display.c
490
int l, n, i, j;
games/larn/display.c
495
n = playery + diroffy[dir];
games/larn/display.c
496
if (l < 0 || l >= MAXX || n < 0 || n >= MAXY) {
games/larn/display.c
500
i = item[l][n];
games/larn/display.c
501
j = mitem[l][n];
games/larn/display.c
507
if (l == 33 && n == MAXY - 1 && level == 1) {
games/larn/display.c
510
for (n = 0; n < MAXY; n++)
games/larn/display.c
511
if (item[l][n] == OENTRANCE) {
games/larn/display.c
513
playery = n;
games/larn/display.c
521
hitmonster(l, n);
games/larn/display.c
527
playery = n;
games/larn/io.c
188
long wide, left, cont, n; /* data for lprintf */
games/larn/io.c
209
n = va_arg(ap, long);
games/larn/io.c
210
if (n < 0) {
games/larn/io.c
211
n = -n;
games/larn/io.c
217
*tmpb = (char)(n % 10 + '0');
games/larn/io.c
218
while (n > 9)
games/larn/io.c
219
*(--tmpb) = (char)((n /= 10) % 10 + '0');
games/larn/io.c
244
n = wide - strlen(tmpb);
games/larn/io.c
246
while (n-- > 0)
games/larn/io.c
252
while (n-- > 0)
games/larn/io.c
451
int n = LINBUFSIZE, quote = 0;
games/larn/io.c
456
for (;; --n, cc = lgetc()) {
games/larn/io.c
459
if ((n <= 1) || ((cc <= 32) && (quote == 0))) {
games/larn/scores.c
264
int i, j, n, k;
games/larn/scores.c
289
for (n = 0; n < 26; n++) {
games/larn/scores.c
290
iven[n] = sco[j].sciv[n][0];
games/larn/scores.c
291
ivenarg[n] = sco[j].sciv[n][1];
games/larn/scores.c
294
for (n = 0; n < 26; n++)
games/larn/scores.c
295
if (k == iven[n]) {
games/larn/scores.c
297
show3(n);
games/larn/scores.c
702
int n;
games/larn/scores.c
714
for (n = stbuf.st_size / sizeof(struct log_fmt); n > 0; --n) {
games/monop/monop.c
243
do_quit(int n __unused)
games/random/randomize_fd.c
176
n = rand_node_allocate();
games/random/randomize_fd.c
179
n->len = slen + 2;
games/random/randomize_fd.c
180
n->cp = (u_char *)malloc(slen + 2);
games/random/randomize_fd.c
181
if (n->cp == NULL)
games/random/randomize_fd.c
184
memmove(n->cp, &buf[bufc], slen);
games/random/randomize_fd.c
185
n->cp[slen] = buf[i];
games/random/randomize_fd.c
186
n->cp[slen + 1] = '\0';
games/random/randomize_fd.c
189
rand_node_append(n);
games/random/randomize_fd.c
207
for (j = 0, prev = n = rand_root; n != NULL; j++, prev = n, n = n->next) {
games/random/randomize_fd.c
209
if (n->cp == NULL)
games/random/randomize_fd.c
212
ret = printf("%.*s", (int)n->len - 1, n->cp);
games/random/randomize_fd.c
216
if (n == rand_root)
games/random/randomize_fd.c
217
rand_root = n->next;
games/random/randomize_fd.c
218
if (n == rand_tail)
games/random/randomize_fd.c
221
prev->next = n->next;
games/random/randomize_fd.c
222
rand_node_free(n);
games/random/randomize_fd.c
47
struct rand_node *n;
games/random/randomize_fd.c
49
n = (struct rand_node *)malloc(sizeof(struct rand_node));
games/random/randomize_fd.c
50
if (n == NULL)
games/random/randomize_fd.c
53
n->len = 0;
games/random/randomize_fd.c
54
n->cp = NULL;
games/random/randomize_fd.c
55
n->next = NULL;
games/random/randomize_fd.c
56
return(n);
games/random/randomize_fd.c
60
rand_node_free(struct rand_node *n)
games/random/randomize_fd.c
62
if (n != NULL) {
games/random/randomize_fd.c
63
if (n->cp != NULL)
games/random/randomize_fd.c
64
free(n->cp);
games/random/randomize_fd.c
66
free(n);
games/random/randomize_fd.c
71
rand_node_free_rec(struct rand_node *n)
games/random/randomize_fd.c
73
if (n != NULL) {
games/random/randomize_fd.c
74
if (n->next != NULL)
games/random/randomize_fd.c
75
rand_node_free_rec(n->next);
games/random/randomize_fd.c
77
rand_node_free(n);
games/random/randomize_fd.c
82
rand_node_append(struct rand_node *n)
games/random/randomize_fd.c
85
rand_root = rand_tail = n;
games/random/randomize_fd.c
87
rand_tail->next = n;
games/random/randomize_fd.c
88
rand_tail = n;
games/random/randomize_fd.c
97
struct rand_node *n, *prev;
games/robots/move_robs.c
137
sign(int n)
games/robots/move_robs.c
139
if (n < 0)
games/robots/move_robs.c
141
else if (n > 0)
games/rogue/hit.c
172
int i = 0, j, n, d, total = 0;
games/rogue/hit.c
175
n = get_number(ds+i);
games/rogue/hit.c
182
for (j = 0; j < n; j++) {
games/rogue/inventory.c
212
short i = 0, j, maxlen = 0, n;
games/rogue/inventory.c
230
if ((n = strlen(descs[i])) > maxlen) {
games/rogue/inventory.c
231
maxlen = n;
games/rogue/inventory.c
386
int n;
games/rogue/inventory.c
388
n = 0;
games/rogue/inventory.c
396
get_com_id(&n, ch);
games/rogue/inventory.c
397
sprintf(buf, "run %s %s", com_id_tab[n].com_desc + 8, until);
games/rogue/inventory.c
424
short i, j, n;
games/rogue/inventory.c
435
n = strlen(id_scrolls[i].title);
games/rogue/inventory.c
436
strcpy(id_scrolls[i].title+(n-1), "' ");
games/rogue/level.c
703
hide_boxed_passage(short row1, short col1, short row2, short col2, short n)
games/rogue/level.c
723
for (i = 0; i < n; i++) {
games/rogue/machdep.c
442
md_malloc(int n)
games/rogue/machdep.c
446
t = malloc(n);
games/rogue/message.c
134
short i = 0, n;
games/rogue/message.c
137
n = strlen(prompt);
games/rogue/message.c
140
mvaddstr(0, n + 1, insert);
games/rogue/message.c
143
move(0, (n + i + 1));
games/rogue/message.c
158
mvaddch(0, i + n, ' ');
games/rogue/message.c
159
move(MIN_ROW-1, i+n);
games/rogue/message.c
305
pad(const char *s, short n)
games/rogue/message.c
309
for (i = strlen(s); i < n; i++) {
games/rogue/monster.c
127
short n;
games/rogue/monster.c
131
n = get_rand(4, 6);
games/rogue/monster.c
133
for (i = 0; i < n; i++) {
games/rogue/monster.c
225
party_monsters(int rn, int n)
games/rogue/monster.c
233
n += n;
games/rogue/monster.c
238
for (i = 0; i < n; i++) {
games/rogue/monster.c
301
short i, n;
games/rogue/monster.c
378
NEXT_TRY: n = get_rand(0, 5);
games/rogue/monster.c
379
switch(n) {
games/rogue/monster.c
381
if (!tried[n] && mtry(monster, row, monster->col-1)) {
games/rogue/monster.c
386
if (!tried[n] && mtry(monster, row, monster->col)) {
games/rogue/monster.c
391
if (!tried[n] && mtry(monster, row, monster->col+1)) {
games/rogue/monster.c
396
if (!tried[n] && mtry(monster, monster->row-1, col)) {
games/rogue/monster.c
401
if (!tried[n] && mtry(monster, monster->row, col)) {
games/rogue/monster.c
406
if (!tried[n] && mtry(monster, monster->row+1, col)) {
games/rogue/monster.c
411
if (!tried[n]) {
games/rogue/monster.c
412
tried[n] = 1;
games/rogue/move.c
153
n = strlen(desc);
games/rogue/move.c
154
desc[n] = '(';
games/rogue/move.c
155
desc[n+1] = obj->ichar;
games/rogue/move.c
156
desc[n+2] = ')';
games/rogue/move.c
157
desc[n+3] = 0;
games/rogue/move.c
373
short i, n;
games/rogue/move.c
392
n = get_rand(0, (FAINT - rogue.moves_left));
games/rogue/move.c
393
if (n > 0) {
games/rogue/move.c
399
for (i = 0; i < n; i++) {
games/rogue/move.c
546
static short heal_exp = -1, n, c = 0;
games/rogue/move.c
558
n = 20;
games/rogue/move.c
561
n = 18;
games/rogue/move.c
564
n = 17;
games/rogue/move.c
567
n = 14;
games/rogue/move.c
570
n = 13;
games/rogue/move.c
573
n = 10;
games/rogue/move.c
576
n = 9;
games/rogue/move.c
579
n = 8;
games/rogue/move.c
582
n = 7;
games/rogue/move.c
585
n = 4;
games/rogue/move.c
588
n = 3;
games/rogue/move.c
592
n = 2;
games/rogue/move.c
595
if (++c >= n) {
games/rogue/move.c
67
short n, status, d;
games/rogue/object.c
166
short i, n;
games/rogue/object.c
172
n = coin_toss() ? get_rand(2, 4) : get_rand(3, 5);
games/rogue/object.c
174
n++;
games/rogue/object.c
179
for (i = 0; i < n; i++) {
games/rogue/object.c
644
short n;
games/rogue/object.c
648
n = rand_percent(99) ? party_objects(party_room) : 11;
games/rogue/object.c
650
party_monsters(party_room, n);
games/rogue/pack.c
554
short n, stat;
games/rogue/pack.c
565
n = strlen(desc);
games/rogue/pack.c
566
desc[n] = '(';
games/rogue/pack.c
567
desc[n+1] = obj->ichar;
games/rogue/pack.c
568
desc[n+2] = ')';
games/rogue/pack.c
569
desc[n+3] = 0;
games/rogue/room.c
284
short n, N, row, col;
games/rogue/room.c
290
n = get_rand(5, 10);
games/rogue/room.c
291
if (n > N) {
games/rogue/room.c
292
n = N - 2;
games/rogue/room.c
294
for (i = 0; i < n; i++) {
games/rogue/save.c
321
rw_id(struct id id_table[], FILE *fp, int n, boolean wr)
games/rogue/save.c
325
for (i = 0; i < n; i++) {
games/rogue/save.c
343
short n;
games/rogue/save.c
345
n = strlen(s) + 1;
games/rogue/save.c
346
xxxx(s, n);
games/rogue/save.c
347
r_write(fp, (char *) &n, sizeof(short));
games/rogue/save.c
348
r_write(fp, s, n);
games/rogue/save.c
354
short n;
games/rogue/save.c
356
r_read(fp, (char *) &n, sizeof(short));
games/rogue/save.c
357
if (n < 0 || n > (short)len) {
games/rogue/save.c
360
r_read(fp, s, n);
games/rogue/save.c
361
xxxx(s, n);
games/rogue/save.c
363
s[n-1] = 0;
games/rogue/save.c
378
r_read(FILE *fp, char *buf, int n)
games/rogue/save.c
380
if (fread(buf, sizeof(char), n, fp) != (unsigned)n) {
games/rogue/save.c
386
r_write(FILE *fp, const char *buf, int n)
games/rogue/save.c
389
if (fwrite(buf, sizeof(char), n, fp) != (unsigned)n) {
games/rogue/score.c
199
short i, n, rank = 10, x, ne = 0, found_player = -1;
games/rogue/score.c
218
if (((n = fread(scores[i], sizeof(char), 80, fp)) < 80) && (n != 0)) {
games/rogue/score.c
220
} else if (n != 0) {
games/rogue/score.c
222
if ((n = fread(n_names[i], sizeof(char), 30, fp)) < 30) {
games/rogue/score.c
327
short rank, short n, const object *monster, short other)
games/rogue/score.c
332
if (n > 0) {
games/rogue/score.c
333
for (i = n; i > rank; i--) {
games/rogue/score.c
513
xxxx(char *buf, short n)
games/rogue/score.c
518
for (i = 0; i < n; i++) {
games/rogue/spec_hit.c
118
short i, n;
games/rogue/spec_hit.c
132
n = get_rand(4, 8);
games/rogue/spec_hit.c
133
for (i = 0; i < n; i++) {
games/rogue/spec_hit.c
171
short i, n, t = 0;
games/rogue/spec_hit.c
193
n = get_rand(0, MAX_PACK_COUNT);
games/rogue/spec_hit.c
196
for (i = 0; i <= n; i++) {
games/rogue/spec_hit.c
242
short row, col, i, n;
games/rogue/spec_hit.c
261
for (n = 0; n <= 5; n++) {
games/rogue/spec_hit.c
262
for (i = -n; i <= n; i++) {
games/rogue/spec_hit.c
263
if (try_to_cough(row+n, col+i, obj)) {
games/rogue/spec_hit.c
266
if (try_to_cough(row-n, col+i, obj)) {
games/rogue/spec_hit.c
270
for (i = -n; i <= n; i++) {
games/rogue/spec_hit.c
271
if (try_to_cough(row+i, col-n, obj)) {
games/rogue/spec_hit.c
274
if (try_to_cough(row+i, col+n, obj)) {
games/rogue/spec_hit.c
433
short n;
games/rogue/spec_hit.c
438
n = get_rand(1, 3); /* 1 Hp, 2 Str, 3 both */
games/rogue/spec_hit.c
440
if ((n != 2) || (!sustain_strength)) {
games/rogue/spec_hit.c
443
if (n != 2) {
games/rogue/spec_hit.c
448
if (n != 1) {
games/rogue/trap.c
137
short i, n, tries = 0;
games/rogue/trap.c
141
n = 0;
games/rogue/trap.c
143
n = get_rand(0, 2);
games/rogue/trap.c
145
n = get_rand(1, 2);
games/rogue/trap.c
147
n = get_rand(2, 3);
games/rogue/trap.c
149
n = get_rand(2, 4);
games/rogue/trap.c
151
n = get_rand(3, 5);
games/rogue/trap.c
153
n = get_rand(5, MAX_TRAPS);
games/rogue/trap.c
155
for (i = 0; i < n; i++) {
games/rogue/trap.c
222
search(short n, boolean is_auto)
games/rogue/trap.c
241
for (s = 0; s < n; s++) {
games/sail/assorted.c
100
rigg[n] = 0;
games/sail/assorted.c
102
rigg[n] -= rhits;
games/sail/assorted.c
55
int n;
games/sail/assorted.c
88
for (n = 0; n < 3; n++) {
games/sail/assorted.c
89
if (chits > crew[n]) {
games/sail/assorted.c
90
chits -= crew[n];
games/sail/assorted.c
91
crew[n] = 0;
games/sail/assorted.c
93
crew[n] -= chits;
games/sail/assorted.c
97
for (n = 0; n < 3; n++) {
games/sail/assorted.c
98
if (rhits > rigg[n]) {
games/sail/assorted.c
99
rhits -= rigg[n];
games/sail/dr_1.c
270
int n;
games/sail/dr_1.c
284
for (n = 0; n < 3; n++) {
games/sail/dr_1.c
285
if (sp->file->OBP[n].turnsent)
games/sail/dr_1.c
286
men += sp->file->OBP[n].mensent;
games/sail/dr_1.c
288
for (n = 0; n < 3; n++) {
games/sail/dr_1.c
289
if (sp->file->DBP[n].turnsent)
games/sail/dr_1.c
290
men += sp->file->DBP[n].mensent;
games/sail/dr_1.c
360
for (n = 0; n < 3 && sp->file->captured == 0; n++) {
games/sail/dr_1.c
361
if (!crew[n]) {
games/sail/dr_2.c
254
int new, n;
games/sail/dr_2.c
258
if ((n = str_end(temp)) < '1' || n > '9')
games/sail/dr_2.c
259
for (n = 1; vma - n >= 0; n++) {
games/sail/dr_2.c
260
snprintf(st, sizeof(st), "%d", n);
games/sail/dr_2.c
268
ma-n, ta, af, vma-n,
games/sail/dr_2.c
272
if ((ma > 0 && ta > 0 && (n = str_end(temp)) != 'l' && n != 'r') ||
games/sail/dr_2.c
287
if ((ma > 0 && ta > 0 && (n = str_end(temp)) != 'l' && n != 'r') ||
games/sail/dr_3.c
100
dir[n] = sp->file->dir;
games/sail/dr_3.c
101
drift[n] = sp->file->drift;
games/sail/dr_3.c
102
moved[n] = 0;
games/sail/dr_3.c
103
n++;
games/sail/dr_3.c
114
n = 0;
games/sail/dr_3.c
119
step(sp, sp->file->movebuf[k], &moved[n]);
games/sail/dr_3.c
120
n++;
games/sail/dr_3.c
125
n = 0;
games/sail/dr_3.c
147
send_foul(sq, n);
games/sail/dr_3.c
167
n++;
games/sail/dr_3.c
173
n = 0;
games/sail/dr_3.c
177
if (row[n] != sp->file->row)
games/sail/dr_3.c
179
if (col[n] != sp->file->col)
games/sail/dr_3.c
181
if (dir[n] != sp->file->dir)
games/sail/dr_3.c
183
if (drift[n] != sp->file->drift)
games/sail/dr_3.c
186
n++;
games/sail/dr_3.c
271
int n;
games/sail/dr_3.c
275
for (n = 0; n < NBP && bp[n].turnsent; n++)
games/sail/dr_3.c
277
if (n < NBP && sections) {
games/sail/dr_3.c
279
send_dbp(from, n, turn, to->file->index, sections);
games/sail/dr_3.c
281
send_obp(from, n, turn, to->file->index, sections);
games/sail/dr_3.c
295
int n, OBP = 0, DBP = 0, dbp = 0;
games/sail/dr_3.c
300
for (n = 0; n < NBP; n++, bp++) {
games/sail/dr_3.c
56
int n;
games/sail/dr_3.c
91
n = 0;
games/sail/dr_3.c
98
row[n] = sp->file->row;
games/sail/dr_3.c
99
col[n] = sp->file->col;
games/sail/dr_5.c
48
int n;
games/sail/dr_5.c
51
for (n = 0; n < 3; n++) {
games/sail/dr_5.c
52
if (totalfrom > crewfrom[n]) {
games/sail/dr_5.c
53
totalfrom -= crewfrom[n];
games/sail/dr_5.c
54
crewfrom[n] = 0;
games/sail/dr_5.c
56
crewfrom[n] -= totalfrom;
games/sail/dr_5.c
73
int n;
games/sail/dr_5.c
83
for (n=0; n < NBP; n++, bp++) {
games/sail/dr_main.c
57
int n;
games/sail/dr_main.c
78
for (n = 0; n < NNATION; n++)
games/sail/dr_main.c
79
nat[n] = 0;
games/sail/lo_main.c
112
title[n++], sbuf, ship->shipname, log.l_netpoints,
games/sail/lo_main.c
126
int n = 0, npeople;
games/sail/lo_main.c
153
title[n++], sbuf, ship->shipname, log.l_netpoints,
games/sail/lo_main.c
70
int n = 0, npeople;
games/sail/misc.c
200
int n;
games/sail/misc.c
217
n = fread(log, sizeof(struct logs), NLOG, fp);
games/sail/misc.c
218
for (lp = &log[n]; lp < &log[NLOG]; lp++)
games/sail/parties.c
72
int n;
games/sail/parties.c
74
for (n = 0; n < NBP; p++, n++) {
games/sail/parties.c
78
send_dbp(ship, n, 0, 0, 0);
games/sail/parties.c
80
send_obp(ship, n, 0, 0, 0);
games/sail/pl_1.c
122
choke(int n __unused)
games/sail/pl_1.c
129
child(int n __unused)
games/sail/pl_2.c
49
newturn(int n __unused)
games/sail/pl_3.c
152
for (n = 0; n < 3 && mf->captured == 0; n++)
games/sail/pl_3.c
153
if (!crew[n]) {
games/sail/pl_3.c
51
int n, r;
games/sail/pl_3.c
63
for (n = 0; n < 3; n++) {
games/sail/pl_3.c
64
if (mf->OBP[n].turnsent)
games/sail/pl_3.c
65
men += mf->OBP[n].mensent;
games/sail/pl_3.c
67
for (n = 0; n < 3; n++) {
games/sail/pl_3.c
68
if (mf->DBP[n].turnsent)
games/sail/pl_3.c
69
men += mf->DBP[n].mensent;
games/sail/pl_5.c
160
int n;
games/sail/pl_5.c
168
for (n = 0; n < NBP; n++) {
games/sail/pl_5.c
169
if (mf->OBP[n].turnsent)
games/sail/pl_5.c
170
men += mf->OBP[n].mensent;
games/sail/pl_5.c
172
for (n = 0; n < NBP; n++) {
games/sail/pl_5.c
173
if (mf->DBP[n].turnsent)
games/sail/pl_5.c
174
men += mf->DBP[n].mensent;
games/sail/pl_7.c
508
sgetstr(const char *pr, char *buf, int n)
games/sail/pl_7.c
536
if (c >= ' ' && c < 0x7f && p < buf + n - 1) {
games/sail/pl_7.c
721
int n;
games/sail/pl_7.c
731
for (n = 0; n < BOX_X; n++)
games/sail/pl_7.c
734
for (n = 0; n < BOX_X; n++)
games/sail/pl_7.c
736
for (n = BOX_T+1; n < BOX_B; n++) {
games/sail/pl_7.c
737
mvaddch(n, BOX_L, '|');
games/sail/pl_7.c
738
mvaddch(n, BOX_R, '|');
games/sail/pl_main.c
59
int n;
games/sail/pl_main.c
68
for (n = 0; n < NNATION; n++)
games/sail/pl_main.c
69
nat[n] = 0;
games/sail/sync.c
320
int n;
games/sail/sync.c
333
for (n = TIMEOUT; --n >= 0;) {
games/sail/sync.c
353
if (n <= 0)
games/tetris/scores.c
340
unsigned int i, n;
games/tetris/scores.c
373
for (i = 0, sp = scores; i < nscores; sp += n) {
games/tetris/scores.c
374
n = 20;
games/tetris/scores.c
375
if (i + n > nscores)
games/tetris/scores.c
376
n = nscores - i;
games/tetris/scores.c
377
printem(level, i + 1, sp, n, me);
games/tetris/scores.c
378
if ((i += n) < nscores) {
games/tetris/scores.c
393
printem(int level, int offset, struct highscore *hs, int n, const char *me)
games/tetris/scores.c
406
for (row = 0; row < n; row++) {
games/trek/getpar.c
49
int n;
games/trek/getpar.c
54
i = scanf("%d", &n);
games/trek/getpar.c
58
return (n);
games/trek/klmove.c
62
int n;
games/trek/klmove.c
77
for (n = 0; n < Etc.nkling; n++) {
games/trek/klmove.c
78
k = &Etc.klingon[n];
games/trek/move.c
132
n = xn + 0.5;
games/trek/move.c
136
dx, dy, xn, n);
games/trek/move.c
140
for (i = 0; i < n; i++) {
games/trek/move.c
182
n = 0;
games/trek/move.c
201
n = 0;
games/trek/move.c
208
if (n > 0) {
games/trek/move.c
80
int n;
games/trek/phaser.c
204
n = Etc.nkling;
games/trek/phaser.c
205
if (n > NBANKS)
games/trek/phaser.c
206
n = NBANKS;
games/trek/phaser.c
207
tot = n * (n + 1) / 2;
games/trek/phaser.c
208
for (i = 0; i < n; i++) {
games/trek/phaser.c
222
b->units = ((n - i) / tot) * extra;
games/trek/phaser.c
240
for (i = 0; i < n; i++) {
games/trek/phaser.c
280
n = Etc.nkling;
games/trek/phaser.c
282
for (j = 0; j < n; j++) {
games/trek/phaser.c
98
int n;
games/trek/snova.c
65
int n;
games/trek/snova.c
81
n = ranf(q->stars);
games/trek/snova.c
86
if ((n -= 1) <= 0)
games/trek/snova.c
88
if (n <= 0)
games/trek/torped.c
117
n = -1;
games/trek/torped.c
119
n = 1;
games/trek/torped.c
122
for (; n && n <= 3; n++) {
games/trek/torped.c
124
course2 = course + randcourse(n);
games/trek/torped.c
140
if (n > 0)
games/trek/torped.c
141
printf(", torpedo number %d", n);
games/trek/torped.c
217
randcourse(int n)
games/trek/torped.c
225
if (n < 0)
games/trek/torped.c
228
printf(" on torpedo %d\n", n);
games/trek/torped.c
72
int n;
games/worms/worms.c
175
int x, y, h, n;
games/worms/worms.c
233
for (n = 0; n < LI; ++n) {
games/worms/worms.c
234
ref[n] = ip;
games/worms/worms.c
237
for (ip = ref[0], n = LI * CO; --n >= 0;)
games/worms/worms.c
239
for (n = number, w = &worm[0]; --n >= 0; w++) {
games/worms/worms.c
278
for (n = 0, w = &worm[0]; n < number; n++, w++) {
games/worms/worms.c
282
flavor[n % sizeof(flavor)]);
games/worms/worms.c
313
flavor[n % sizeof(flavor)]);
games/wump/wump.c
73
#define plural(n) (n == 1 ? "" : "s")
include/arpa/nameser.h
416
#define NS_NXT_BIT_SET( n,p) (p[(n)/NS_NXT_BITS] |= (0x80>>((n)%NS_NXT_BITS)))
include/arpa/nameser.h
417
#define NS_NXT_BIT_CLEAR(n,p) (p[(n)/NS_NXT_BITS] &= ~(0x80>>((n)%NS_NXT_BITS)))
include/arpa/nameser.h
418
#define NS_NXT_BIT_ISSET(n,p) (p[(n)/NS_NXT_BITS] & (0x80>>((n)%NS_NXT_BITS)))
include/printf.h
114
int __printf_pad(struct __printf_io *io, int n, int zero);
include/wchar.h
153
int swprintf(wchar_t * __restrict, size_t n, const wchar_t * __restrict,
include/wchar.h
159
int vswprintf(wchar_t * __restrict, size_t n, const wchar_t * __restrict,
include/wchar.h
255
int wcsncasecmp(const wchar_t *, const wchar_t *, size_t n);
include/xlocale/_wchar.h
87
int swprintf_l(wchar_t * __restrict, size_t n, locale_t,
include/xlocale/_wchar.h
94
int vswprintf_l(wchar_t * __restrict, size_t n, locale_t,
lib/csu/common/initfini.c
49
size_t array_size, n;
lib/csu/common/initfini.c
52
for (n = array_size; n > 0; n--) {
lib/csu/common/initfini.c
53
fn = __fini_array_start[n - 1];
lib/csu/common/initfini.c
64
size_t array_size, n;
lib/csu/common/initfini.c
72
for (n = 0; n < array_size; n++) {
lib/csu/common/initfini.c
73
fn = __preinit_array_start[n];
lib/csu/common/initfini.c
79
for (n = 0; n < array_size; n++) {
lib/csu/common/initfini.c
80
fn = __init_array_start[n];
lib/i18n_module/BIG5/citrus_big5.c
179
uint64_t n;
lib/i18n_module/BIG5/citrus_big5.c
187
for (n = start; n <= end; ++n)
lib/i18n_module/BIG5/citrus_big5.c
188
ei->cell[n & 0xFF] |= i;
lib/i18n_module/BIG5/citrus_big5.c
272
char ** __restrict s, size_t n,
lib/i18n_module/BIG5/citrus_big5.c
293
if (n < 1)
lib/i18n_module/BIG5/citrus_big5.c
297
n--;
lib/i18n_module/BIG5/citrus_big5.c
310
if (n < 1) {
lib/i18n_module/BIG5/citrus_big5.c
315
n--;
lib/i18n_module/BIG5/citrus_big5.c
358
size_t n, wchar_t wc, _BIG5State * __restrict psenc __unused,
lib/i18n_module/BIG5/citrus_big5.c
386
if (n < l) {
lib/i18n_module/DECHanyu/citrus_dechanyu.c
168
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/DECHanyu/citrus_dechanyu.c
185
if (n-- < 1)
lib/i18n_module/DECHanyu/citrus_dechanyu.c
221
if (n-- < 1)
lib/i18n_module/DECHanyu/citrus_dechanyu.c
228
if (n-- < 1)
lib/i18n_module/DECHanyu/citrus_dechanyu.c
237
if (n-- < 1)
lib/i18n_module/DECHanyu/citrus_dechanyu.c
249
if (n-- < 1)
lib/i18n_module/DECHanyu/citrus_dechanyu.c
277
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/DECHanyu/citrus_dechanyu.c
305
if (n < psenc->chlen) {
lib/i18n_module/EUC/citrus_euc.c
194
size_t n, _EUCState *psenc, size_t *nresult)
lib/i18n_module/EUC/citrus_euc.c
213
if (n < 1)
lib/i18n_module/EUC/citrus_euc.c
217
n--;
lib/i18n_module/EUC/citrus_euc.c
231
if (n < 1)
lib/i18n_module/EUC/citrus_euc.c
235
n--;
lib/i18n_module/EUC/citrus_euc.c
277
_citrus_EUC_wcrtomb_priv(_EUCEncodingInfo *ei, char *s, size_t n, wchar_t wc,
lib/i18n_module/EUC/citrus_euc.c
296
if (n < (unsigned)i) {
lib/i18n_module/EUCTW/citrus_euctw.c
180
size_t n, _EUCTWState * __restrict psenc, size_t * __restrict nresult)
lib/i18n_module/EUCTW/citrus_euctw.c
199
if (n < 1)
lib/i18n_module/EUCTW/citrus_euctw.c
203
n--;
lib/i18n_module/EUCTW/citrus_euctw.c
217
if (n < 1)
lib/i18n_module/EUCTW/citrus_euctw.c
221
n--;
lib/i18n_module/EUCTW/citrus_euctw.c
271
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/EUCTW/citrus_euctw.c
288
if (n < len) {
lib/i18n_module/EUCTW/citrus_euctw.c
296
if (n < len) {
lib/i18n_module/EUCTW/citrus_euctw.c
305
if (n < len) {
lib/i18n_module/GBK2K/citrus_gbk2k.c
152
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/GBK2K/citrus_gbk2k.c
190
if (n-- < 1)
lib/i18n_module/GBK2K/citrus_gbk2k.c
252
char * __restrict s, size_t n, wchar_t wc, _GBK2KState * __restrict psenc,
lib/i18n_module/GBK2K/citrus_gbk2k.c
264
if (n < len) {
lib/i18n_module/HZ/citrus_hz.c
178
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/HZ/citrus_hz.c
202
if (n-- < 1) {
lib/i18n_module/HZ/citrus_hz.c
300
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/HZ/citrus_hz.c
363
if (n < 2)
lib/i18n_module/HZ/citrus_hz.c
365
n -= 2;
lib/i18n_module/HZ/citrus_hz.c
369
if (n < 2)
lib/i18n_module/HZ/citrus_hz.c
371
n -= 2;
lib/i18n_module/HZ/citrus_hz.c
376
if (n < len)
lib/i18n_module/HZ/citrus_hz.c
397
char * __restrict s, size_t n, _HZState * __restrict psenc,
lib/i18n_module/HZ/citrus_hz.c
406
if (n < 2)
lib/i18n_module/HZ/citrus_hz.c
408
n -= 2;
lib/i18n_module/HZ/citrus_hz.c
412
if (n < 1)
lib/i18n_module/ISO2022/citrus_iso2022.c
1010
char * __restrict string, size_t n, char ** __restrict result,
lib/i18n_module/ISO2022/citrus_iso2022.c
1156
if (n < len) {
lib/i18n_module/ISO2022/citrus_iso2022.c
1176
char * __restrict s, size_t n, _ISO2022State * __restrict psenc,
lib/i18n_module/ISO2022/citrus_iso2022.c
1192
if (sizeof(buf) < len || n < len-1) {
lib/i18n_module/ISO2022/citrus_iso2022.c
1205
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/ISO2022/citrus_iso2022.c
1221
if (sizeof(buf) < len || n < len) {
lib/i18n_module/ISO2022/citrus_iso2022.c
530
seqmatch(const char * __restrict s, size_t n,
lib/i18n_module/ISO2022/citrus_iso2022.c
536
while ((size_t)(p - sp->chars) < n && p - sp->chars < sp->len) {
lib/i18n_module/ISO2022/citrus_iso2022.c
577
char * __restrict string, size_t n, char ** __restrict result,
lib/i18n_module/ISO2022/citrus_iso2022.c
586
if (1 <= n && string[0] == '\017') {
lib/i18n_module/ISO2022/citrus_iso2022.c
589
n--;
lib/i18n_module/ISO2022/citrus_iso2022.c
592
if (1 <= n && string[0] == '\016') {
lib/i18n_module/ISO2022/citrus_iso2022.c
595
n--;
lib/i18n_module/ISO2022/citrus_iso2022.c
600
if (1 <= n && string[0] && strchr("\217\216", string[0])) {
lib/i18n_module/ISO2022/citrus_iso2022.c
604
n--;
lib/i18n_module/ISO2022/citrus_iso2022.c
609
if (1 <= n && string[0] != '\033')
lib/i18n_module/ISO2022/citrus_iso2022.c
614
nmatch = seqmatch(string, n, sp);
lib/i18n_module/ISO2022/citrus_iso2022.c
615
if (sp->len == nmatch && n >= (size_t)(sp->len))
lib/i18n_module/ISO2022/citrus_iso2022.c
652
n -= sp->len;
lib/i18n_module/ISO2022/citrus_iso2022.c
657
if (2 <= n && string[0] == '\033' &&
lib/i18n_module/ISO2022/citrus_iso2022.c
661
n -= 2;
lib/i18n_module/ISO2022/citrus_iso2022.c
667
if (2 <= n && string[0] == '\033' &&
lib/i18n_module/ISO2022/citrus_iso2022.c
671
n -= 2;
lib/i18n_module/ISO2022/citrus_iso2022.c
676
if (2 <= n && string[0] == '\033' && string[1] &&
lib/i18n_module/ISO2022/citrus_iso2022.c
680
n -= 2;
lib/i18n_module/ISO2022/citrus_iso2022.c
690
nmatch = seqmatch(string, n, sp);
lib/i18n_module/ISO2022/citrus_iso2022.c
698
if (n < (size_t)(sp->len)) {
lib/i18n_module/ISO2022/citrus_iso2022.c
699
if ((size_t)(nmatch) == n) {
lib/i18n_module/ISO2022/citrus_iso2022.c
717
if (n < 1) {
lib/i18n_module/ISO2022/citrus_iso2022.c
746
if (2 <= n &&
lib/i18n_module/ISO2022/citrus_iso2022.c
750
if (3 <= n &&
lib/i18n_module/ISO2022/citrus_iso2022.c
763
if (1 <= n)
lib/i18n_module/ISO2022/citrus_iso2022.c
847
size_t n, _ISO2022State * __restrict psenc, size_t * __restrict nresult)
lib/i18n_module/ISO2022/citrus_iso2022.c
877
if (n > 0) {
lib/i18n_module/ISO2022/citrus_iso2022.c
879
n--;
lib/i18n_module/ISO2022/citrus_iso2022.c
895
if (n == 0) {
lib/i18n_module/ISO2022/citrus_iso2022.c
909
wchar = _ISO2022_sgetwchar(ei, s0, n, &result, psenc);
lib/i18n_module/ISO2022/citrus_iso2022.c
918
n -= (result - s0);
lib/i18n_module/ISO2022/citrus_iso2022.c
920
if (n > 0)
lib/i18n_module/ISO2022/citrus_iso2022.c
925
n += c;
lib/i18n_module/ISO2022/citrus_iso2022.c
926
if (n < sizeof(psenc->ch)) {
lib/i18n_module/ISO2022/citrus_iso2022.c
927
memcpy(psenc->ch, s0 - c, n);
lib/i18n_module/ISO2022/citrus_iso2022.c
928
psenc->chlen = n;
lib/i18n_module/JOHAB/citrus_johab.c
148
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/JOHAB/citrus_johab.c
163
if (n-- < 1)
lib/i18n_module/JOHAB/citrus_johab.c
181
if (n-- < 1) {
lib/i18n_module/JOHAB/citrus_johab.c
204
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/JOHAB/citrus_johab.c
214
if (n < 1)
lib/i18n_module/JOHAB/citrus_johab.c
219
if (n < 2) {
lib/i18n_module/JOHAB/citrus_johab.c
288
int m, n, l, linear, t;
lib/i18n_module/JOHAB/citrus_johab.c
298
n = 0x21;
lib/i18n_module/JOHAB/citrus_johab.c
301
n = 0x4A;
lib/i18n_module/JOHAB/citrus_johab.c
304
l = ((idx >> 8) & 0xFF) - n;
lib/i18n_module/MSKanji/citrus_mskanji.c
156
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/MSKanji/citrus_mskanji.c
176
if (n < 1)
lib/i18n_module/MSKanji/citrus_mskanji.c
180
n--;
lib/i18n_module/MSKanji/citrus_mskanji.c
191
if (n < 1)
lib/i18n_module/MSKanji/citrus_mskanji.c
195
n--;
lib/i18n_module/MSKanji/citrus_mskanji.c
235
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/MSKanji/citrus_mskanji.c
247
if (n < 2) {
lib/i18n_module/MSKanji/citrus_mskanji.c
262
if (n < 1) {
lib/i18n_module/UES/citrus_ues.c
188
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/UES/citrus_ues.c
209
if (n-- < 1)
lib/i18n_module/UES/citrus_ues.c
216
if (n-- < 1)
lib/i18n_module/UES/citrus_ues.c
237
if (n-- < 1) {
lib/i18n_module/UES/citrus_ues.c
299
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/UES/citrus_ues.c
308
if (n-- < 1)
lib/i18n_module/UES/citrus_ues.c
312
if (n < 6)
lib/i18n_module/UES/citrus_ues.c
316
if (n < 12)
lib/i18n_module/UES/citrus_ues.c
322
if (n < 10)
lib/i18n_module/UTF1632/citrus_utf1632.c
100
char **s, size_t n, _UTF1632State *psenc, size_t *nresult)
lib/i18n_module/UTF1632/citrus_utf1632.c
122
if (n == 0)
lib/i18n_module/UTF1632/citrus_utf1632.c
125
n--;
lib/i18n_module/UTF1632/citrus_utf1632.c
245
_citrus_UTF1632_wcrtomb_priv(_UTF1632EncodingInfo *ei, char *s, size_t n,
lib/i18n_module/UTF1632/citrus_utf1632.c
264
if (n < cnt)
lib/i18n_module/UTF1632/citrus_utf1632.c
267
s += cnt, n -= cnt;
lib/i18n_module/UTF1632/citrus_utf1632.c
279
if (n < 4)
lib/i18n_module/UTF1632/citrus_utf1632.c
286
if (n < 2)
lib/i18n_module/UTF1632/citrus_utf1632.c
312
if (n < 4)
lib/i18n_module/UTF7/citrus_utf7.c
153
uint16_t * __restrict u16, char ** __restrict s, size_t n,
lib/i18n_module/UTF7/citrus_utf7.c
164
if (n-- < 1) {
lib/i18n_module/UTF7/citrus_utf7.c
242
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/UTF7/citrus_utf7.c
255
err = _citrus_UTF7_mbtoutf16(ei, &hi, s, n, psenc, &nr);
lib/i18n_module/UTF7/citrus_utf7.c
262
n -= nr;
lib/i18n_module/UTF7/citrus_utf7.c
268
err = _citrus_UTF7_mbtoutf16(ei, &lo, s, n, psenc, &nr);
lib/i18n_module/UTF7/citrus_utf7.c
298
char * __restrict s, size_t n __unused, uint16_t u16,
lib/i18n_module/UTF7/citrus_utf7.c
347
char * __restrict s, size_t n, wchar_t wchar,
lib/i18n_module/UTF7/citrus_utf7.c
370
err = _citrus_UTF7_utf16tomb(ei, s, n, u16[i], psenc, &nr);
lib/i18n_module/UTF7/citrus_utf7.c
374
n -= nr;
lib/i18n_module/UTF7/citrus_utf7.c
385
char * __restrict s, size_t n, _UTF7State * __restrict psenc,
lib/i18n_module/UTF7/citrus_utf7.c
395
if (n-- < 1)
lib/i18n_module/UTF7/citrus_utf7.c
407
if (n-- < 1)
lib/i18n_module/UTF8/citrus_utf8.c
181
size_t n, _UTF8State *psenc, size_t *nresult)
lib/i18n_module/UTF8/citrus_utf8.c
198
if (n-- < 1)
lib/i18n_module/UTF8/citrus_utf8.c
211
if (n-- < 1)
lib/i18n_module/UTF8/citrus_utf8.c
244
_citrus_UTF8_wcrtomb_priv(_UTF8EncodingInfo *ei __unused, char *s, size_t n,
lib/i18n_module/UTF8/citrus_utf8.c
261
if (n < cnt) {
lib/i18n_module/VIQR/citrus_viqr.c
103
mnemonic_ext_find(wchar_t wc, const mnemonic_def_t *head, size_t n)
lib/i18n_module/VIQR/citrus_viqr.c
107
for (; n > 0; n >>= 1) {
lib/i18n_module/VIQR/citrus_viqr.c
108
mid = head + (n >> 1);
lib/i18n_module/VIQR/citrus_viqr.c
113
--n;
lib/i18n_module/VIQR/citrus_viqr.c
255
wchar_t * __restrict pwc, char ** __restrict s, size_t n,
lib/i18n_module/VIQR/citrus_viqr.c
275
if (n-- < 1) {
lib/i18n_module/VIQR/citrus_viqr.c
317
char * __restrict s, size_t n, wchar_t wc,
lib/i18n_module/VIQR/citrus_viqr.c
335
if (n-- < 1)
lib/i18n_module/VIQR/citrus_viqr.c
359
if (n-- < 1)
lib/i18n_module/VIQR/citrus_viqr.c
383
char * __restrict s __unused, size_t n __unused,
lib/i18n_module/VIQR/citrus_viqr.c
438
size_t i, n;
lib/i18n_module/VIQR/citrus_viqr.c
450
n = strlen(s);
lib/i18n_module/VIQR/citrus_viqr.c
451
if (ei->mb_cur_max < n)
lib/i18n_module/VIQR/citrus_viqr.c
452
ei->mb_cur_max = n;
lib/i18n_module/VIQR/citrus_viqr.c
462
n = strlen(p->name);
lib/i18n_module/VIQR/citrus_viqr.c
463
if (ei->mb_cur_max < n)
lib/i18n_module/VIQR/citrus_viqr.c
464
ei->mb_cur_max = n;
lib/i18n_module/ZW/citrus_zw.c
110
wchar_t * __restrict pwc, char **__restrict s, size_t n,
lib/i18n_module/ZW/citrus_zw.c
127
if (n-- < 1) { \
lib/i18n_module/ZW/citrus_zw.c
255
char *__restrict s, size_t n, wchar_t wc,
lib/i18n_module/ZW/citrus_zw.c
269
if (n < 4)
lib/i18n_module/ZW/citrus_zw.c
271
n -= 4;
lib/i18n_module/ZW/citrus_zw.c
280
if (n < 2)
lib/i18n_module/ZW/citrus_zw.c
282
n -= 2;
lib/i18n_module/ZW/citrus_zw.c
302
if (n < 2)
lib/i18n_module/ZW/citrus_zw.c
304
n -= 2;
lib/i18n_module/ZW/citrus_zw.c
310
if (n < 2)
lib/i18n_module/ZW/citrus_zw.c
312
n -= 2;
lib/i18n_module/ZW/citrus_zw.c
340
char * __restrict s, size_t n, _ZWState * __restrict psenc,
lib/i18n_module/ZW/citrus_zw.c
348
if (n-- < 1)
lib/i18n_module/iconv_std/citrus_iconv_std.c
107
_csid_t *csid, _index_t *idx, char **s, size_t n, size_t *nresult,
lib/i18n_module/iconv_std/citrus_iconv_std.c
111
return (_stdenc_mbtocs(se->se_handle, csid, idx, s, n, se->se_ps,
lib/i18n_module/iconv_std/citrus_iconv_std.c
117
char *s, size_t n, _csid_t csid, _index_t idx, size_t *nresult,
lib/i18n_module/iconv_std/citrus_iconv_std.c
121
return (_stdenc_cstomb(se->se_handle, s, n, csid, idx, se->se_ps,
lib/i18n_module/iconv_std/citrus_iconv_std.c
127
char *s, size_t n, _wc_t wc, size_t *nresult,
lib/i18n_module/iconv_std/citrus_iconv_std.c
131
return (_stdenc_wctomb(se->se_handle, s, n, wc, se->se_ps, nresult,
lib/i18n_module/iconv_std/citrus_iconv_std.c
136
put_state_resetx(struct _citrus_iconv_std_encoding *se, char *s, size_t n,
lib/i18n_module/iconv_std/citrus_iconv_std.c
140
return (_stdenc_put_state_reset(se->se_handle, s, n, se->se_ps, nresult));
lib/i18n_module/mapper_std/citrus_mapper_std.c
105
idx = idx * lz->width + n - lz->begin;
lib/i18n_module/mapper_std/citrus_mapper_std.c
154
uint32_t m, n;
lib/i18n_module/mapper_std/citrus_mapper_std.c
162
n = 1 << (m - 1);
lib/i18n_module/mapper_std/citrus_mapper_std.c
163
n |= n - 1;
lib/i18n_module/mapper_std/citrus_mapper_std.c
165
rc->rc_src_rowcol_mask = n;
lib/i18n_module/mapper_std/citrus_mapper_std.c
174
n = be32toh(rcx->rcx_src_row_end);
lib/i18n_module/mapper_std/citrus_mapper_std.c
175
if (m + n > 0) {
lib/i18n_module/mapper_std/citrus_mapper_std.c
176
ret = set_linear_zone(lz, m, n);
lib/i18n_module/mapper_std/citrus_mapper_std.c
185
n = be32toh(rcx->rcx_src_col_end);
lib/i18n_module/mapper_std/citrus_mapper_std.c
187
return (set_linear_zone(lz, m, n));
lib/i18n_module/mapper_std/citrus_mapper_std.c
197
uint32_t m, n;
lib/i18n_module/mapper_std/citrus_mapper_std.c
206
n = 1 << (m - 1);
lib/i18n_module/mapper_std/citrus_mapper_std.c
207
n |= n - 1;
lib/i18n_module/mapper_std/citrus_mapper_std.c
209
rc->rc_src_rowcol_mask = n;
lib/i18n_module/mapper_std/citrus_mapper_std.c
221
n = be32toh(rcx->rcx_src_rowcol[i].end);
lib/i18n_module/mapper_std/citrus_mapper_std.c
222
ret = set_linear_zone(lz, m, n);
lib/i18n_module/mapper_std/citrus_mapper_std.c
83
_index_t idx = 0, n;
lib/i18n_module/mapper_std/citrus_mapper_std.c
93
n = (src >> i) & rc->rc_src_rowcol_mask;
lib/i18n_module/mapper_std/citrus_mapper_std.c
94
if (n < lz->begin || n > lz->end) {
lib/libalias/alias_db.c
2265
int i, n, n100;
lib/libalias/alias_db.c
2282
n = n100/100;
lib/libalias/alias_db.c
2285
if (n > ALIAS_CLEANUP_MAX_SPOKES)
lib/libalias/alias_db.c
2287
n = ALIAS_CLEANUP_MAX_SPOKES;
lib/libalias/alias_db.c
2291
for (i=0; i<n; i++)
lib/libalias/alias_db.c
2294
else if (n > 0)
lib/libalias/alias_db.c
2297
houseKeepingResidual = n100 - 100*n;
lib/libalias/alias_db.c
2299
for (i=0; i<n; i++)
lib/libalias/alias_db.c
2302
else if (n < 0)
lib/libalias/alias_db.c
446
u_int n;
lib/libalias/alias_db.c
448
n = alias_addr.s_addr;
lib/libalias/alias_db.c
450
n += alias_port;
lib/libalias/alias_db.c
451
n += link_type;
lib/libalias/alias_db.c
452
return(n % LINK_TABLE_IN_SIZE);
lib/libalias/alias_db.c
460
u_int n;
lib/libalias/alias_db.c
462
n = src_addr.s_addr;
lib/libalias/alias_db.c
463
n += dst_addr.s_addr;
lib/libalias/alias_db.c
465
n += src_port;
lib/libalias/alias_db.c
466
n += dst_port;
lib/libalias/alias_db.c
468
n += link_type;
lib/libalias/alias_db.c
470
return(n % LINK_TABLE_OUT_SIZE);
lib/libalias/alias_nbt.c
464
NBTNsResourceNULL *n;
lib/libalias/alias_nbt.c
471
n = (NBTNsResourceNULL *)( (u_char *)q + sizeof(NBTNsResource) );
lib/libalias/alias_nbt.c
478
if ((char *)(n + 1) > pmax) {
lib/libalias/alias_nbt.c
479
n = NULL;
lib/libalias/alias_nbt.c
482
n++;
lib/libalias/alias_nbt.c
485
if ((char *)(n + 1) > pmax)
lib/libalias/alias_nbt.c
486
n = NULL;
lib/libalias/alias_nbt.c
488
return ((u_char *)n);
lib/libalias/alias_nbt.c
497
NBTNsResourceNULL *n;
lib/libalias/alias_nbt.c
504
n = (NBTNsResourceNULL *)( (u_char *)q + sizeof(NBTNsResource) );
lib/libalias/alias_nbt.c
510
q = (NBTNsResource *)AliasHandleName( (u_char *)n, pmax ); /* XXX */
lib/libalias/alias_nbt.c
512
if (q == NULL || (char *)((u_char *)n + bcount) > pmax)
lib/libalias/alias_nbt.c
515
return ((u_char *)n + bcount);
lib/libalias/alias_nbt.c
528
NBTNsResourceNBSTAT *n;
lib/libalias/alias_nbt.c
535
n = (NBTNsResourceNBSTAT *)( (u_char *)q + sizeof(NBTNsResource) );
lib/libalias/alias_nbt.c
540
if (q == NULL || (char *)((u_char *)n + bcount) > pmax)
lib/libalias/alias_nbt.c
543
return ((u_char *)n + bcount);
lib/libalias/alias_proxy.c
176
int n;
lib/libalias/alias_proxy.c
178
n = sscanf(s, "%d", port);
lib/libalias/alias_proxy.c
179
if (n != 1)
lib/libalias/alias_proxy.c
542
int i, n, len;
lib/libalias/alias_proxy.c
667
n = sscanf(token, "%s %s", s, str_server_port);
lib/libalias/alias_proxy.c
668
if (n != 2)
lib/libalias/alias_proxy.c
680
n = sscanf(token, "%d", &rule_index);
lib/libalias/alias_proxy.c
681
if (n != 1 || rule_index < 0)
lib/libalias/alias_proxy.c
694
n = sscanf(token, "%d", &rule_to_delete);
lib/libalias/alias_proxy.c
695
if (n != 1)
lib/libalias/alias_proxy.c
738
n = sscanf(token, "%s %d", s, &nbits);
lib/libalias/alias_proxy.c
739
if (n != 2)
lib/libalias/alias_util.c
142
DifferentialChecksum(u_short *cksum, u_short *new, u_short *old, int n)
lib/libalias/alias_util.c
148
for (i=0; i<n; i++)
lib/libbluetooth/bluetooth.h
108
#define bt_malloc(n) malloc(n)
lib/libc/citrus/citrus_lookup.h
52
_citrus_lookup_alias(const char *path, const char *key, char *buf, size_t n,
lib/libc/citrus/citrus_lookup.h
57
ret = _citrus_lookup_simple(path, key, buf, n, ignore_case);
lib/libc/citrus/citrus_module.c
128
int i, n;
lib/libc/citrus/citrus_module.c
130
for (n = 0, i = 0; i < MAXDEWEY; i++) {
lib/libc/citrus/citrus_module.c
138
dewey[n++] = (int)_bcs_strtol(cp, &cp, 10);
lib/libc/citrus/citrus_module.c
141
return (n);
lib/libc/citrus/citrus_module.c
203
int n;
lib/libc/citrus/citrus_module.c
212
if ((n = _getdewey(tmp, dp->d_name+len+4)) == 0)
lib/libc/citrus/citrus_module.c
227
if (n == 1 || tmp[1] >= minor)
lib/libc/citrus/citrus_module.c
236
if (_cmpndewey(tmp, n, dewey, ndewey) <= 0)
lib/libc/citrus/citrus_module.c
245
ndewey = n;
lib/libc/citrus/citrus_none.c
107
char *s, size_t n, _csid_t csid, _index_t idx, void *ps __unused,
lib/libc/citrus/citrus_none.c
119
if (n < 1) {
lib/libc/citrus/citrus_none.c
126
if (n < 2) {
lib/libc/citrus/citrus_none.c
135
if (n < 3) {
lib/libc/citrus/citrus_none.c
145
if (n < 3) {
lib/libc/citrus/citrus_none.c
162
_wc_t * __restrict pwc, char ** __restrict s, size_t n,
lib/libc/citrus/citrus_none.c
172
if (n == 0) {
lib/libc/citrus/citrus_none.c
190
char * __restrict s, size_t n, _wc_t wc,
lib/libc/citrus/citrus_none.c
199
if (n == 0) {
lib/libc/citrus/citrus_none.c
205
if (s != NULL && n > 0)
lib/libc/citrus/citrus_none.c
213
char * __restrict s __unused, size_t n __unused,
lib/libc/citrus/citrus_none.c
86
_csid_t *csid, _index_t *idx, char **s, size_t n,
lib/libc/citrus/citrus_none.c
90
if (n < 1) {
lib/libc/citrus/citrus_prop.c
249
size_t m, n;
lib/libc/citrus/citrus_prop.c
255
n = 0;
lib/libc/citrus/citrus_prop.c
269
s[n] = quot;
lib/libc/citrus/citrus_prop.c
270
++n, --m;
lib/libc/citrus/citrus_prop.c
276
t = realloc(s, n + m);
lib/libc/citrus/citrus_prop.c
287
s[n] = '\0';
lib/libc/citrus/citrus_prop.c
297
s[n] = ch;
lib/libc/citrus/citrus_prop.c
298
++n, --m;
lib/libc/citrus/citrus_prop.c
317
char * __restrict s, size_t n)
lib/libc/citrus/citrus_prop.c
322
for (m = 0; m < n; ++m) {
lib/libc/citrus/citrus_prop.c
83
int ch, cutlim, n; \
lib/libc/citrus/citrus_prop.c
92
if (p == NULL || (n = (p - xdigit)) >= base) \
lib/libc/citrus/citrus_prop.c
94
if (acc > cutoff || (acc == cutoff && n > cutlim)) \
lib/libc/citrus/citrus_prop.c
97
acc += n; \
lib/libc/citrus/citrus_stdenc.h
102
char * __restrict s, size_t n, void * __restrict ps,
lib/libc/citrus/citrus_stdenc.h
106
return ((*ce->ce_ops->eo_put_state_reset)(ce, s, n, ps, nresult));
lib/libc/citrus/citrus_stdenc.h
72
char ** __restrict s, size_t n, void * __restrict ps,
lib/libc/citrus/citrus_stdenc.h
76
return ((*ce->ce_ops->eo_mbtocs)(ce, csid, idx, s, n, ps, nresult,
lib/libc/citrus/citrus_stdenc.h
82
char * __restrict s, size_t n, _citrus_csid_t csid, _citrus_index_t idx,
lib/libc/citrus/citrus_stdenc.h
87
return ((*ce->ce_ops->eo_cstomb)(ce, s, n, csid, idx, ps, nresult,
lib/libc/citrus/citrus_stdenc.h
93
char * __restrict s, size_t n, _citrus_wc_t wc, void * __restrict ps,
lib/libc/citrus/citrus_stdenc.h
97
return ((*ce->ce_ops->eo_wctomb)(ce, s, n, wc, ps, nresult, hooks));
lib/libc/citrus/citrus_stdenc_local.h
38
#define _CITRUS_STDENC_GETOPS_FUNC_BASE(n) \
lib/libc/citrus/citrus_stdenc_local.h
39
int n(struct _citrus_stdenc_ops *, size_t)
lib/libc/citrus/citrus_stdenc_template.h
115
char ** __restrict s, size_t n, void * __restrict ps,
lib/libc/citrus/citrus_stdenc_template.h
121
ret = _FUNCNAME(mbrtowc_priv)(_CE_TO_EI(ce), &wc, s, n,
lib/libc/citrus/citrus_stdenc_template.h
134
char * __restrict s, size_t n, _citrus_csid_t csid, _citrus_index_t idx,
lib/libc/citrus/citrus_stdenc_template.h
147
ret = _FUNCNAME(wcrtomb_priv)(_CE_TO_EI(ce), s, n, wc,
lib/libc/citrus/citrus_stdenc_template.h
154
_citrus_wc_t * __restrict wc, char ** __restrict s, size_t n,
lib/libc/citrus/citrus_stdenc_template.h
160
ret = _FUNCNAME(mbrtowc_priv)(_CE_TO_EI(ce), wc, s, n,
lib/libc/citrus/citrus_stdenc_template.h
169
char * __restrict s, size_t n, _citrus_wc_t wc, void * __restrict ps,
lib/libc/citrus/citrus_stdenc_template.h
174
ret = _FUNCNAME(wcrtomb_priv)(_CE_TO_EI(ce), s, n, wc, _TO_STATE(ps),
lib/libc/citrus/citrus_stdenc_template.h
181
char * __restrict s __unused, size_t n __unused,
lib/libc/citrus/citrus_stdenc_template.h
186
return ((_FUNCNAME(put_state_reset)(_CE_TO_EI(ce), s, n, _TO_STATE(ps),
lib/libc/compat-43/sigcompat.c
68
int n;
lib/libc/compat-43/sigcompat.c
72
n = _sigprocmask(SIG_SETMASK, &set, &oset);
lib/libc/compat-43/sigcompat.c
73
if (n)
lib/libc/compat-43/sigcompat.c
74
return (n);
lib/libc/compat-43/sigcompat.c
82
int n;
lib/libc/compat-43/sigcompat.c
86
n = _sigprocmask(SIG_BLOCK, &set, &oset);
lib/libc/compat-43/sigcompat.c
87
if (n)
lib/libc/compat-43/sigcompat.c
88
return (n);
lib/libc/db/btree/bt_split.c
186
n = NBINTERNAL(nksize);
lib/libc/db/btree/bt_split.c
187
if (n < nbytes) {
lib/libc/db/btree/bt_split.c
189
bt_pfxsaved += nbytes - n;
lib/libc/db/btree/bt_split.c
191
nbytes = n;
lib/libc/db/btree/bt_split.c
85
uint32_t n, nbytes, nksize;
lib/libc/db/btree/btree.h
106
#define LALIGN(n) roundup2(n, sizeof(pgno_t))
lib/libc/db/hash/hash.c
572
int n, ndx, off, size;
lib/libc/db/hash/hash.c
590
for (bp = (uint16_t *)rbufp->page, n = *bp++, ndx = 1; ndx < n;)
lib/libc/db/hash/hash.c
610
n = *bp++;
lib/libc/db/hash/hash.c
632
n = *bp++;
lib/libc/db/hash/hash.c
856
unsigned int n, bucket;
lib/libc/db/hash/hash.c
858
n = hashp->hash(k, len);
lib/libc/db/hash/hash.c
859
bucket = n & hashp->HIGH_MASK;
lib/libc/db/hash/hash_bigkey.c
107
n = p[0];
lib/libc/db/hash/hash_bigkey.c
108
p[++n] = off;
lib/libc/db/hash/hash_bigkey.c
109
p[0] = ++n;
lib/libc/db/hash/hash_bigkey.c
110
FREESPACE(p) = off - PAGE_META(n);
lib/libc/db/hash/hash_bigkey.c
112
p[n] = PARTIAL_KEY;
lib/libc/db/hash/hash_bigkey.c
116
n = p[0];
lib/libc/db/hash/hash_bigkey.c
134
p[n] = off;
lib/libc/db/hash/hash_bigkey.c
135
p[n - 2] = FULL_KEY_DATA;
lib/libc/db/hash/hash_bigkey.c
140
p[n - 2] = FULL_KEY;
lib/libc/db/hash/hash_bigkey.c
162
n = p[0];
lib/libc/db/hash/hash_bigkey.c
163
p[++n] = off;
lib/libc/db/hash/hash_bigkey.c
164
p[0] = ++n;
lib/libc/db/hash/hash_bigkey.c
165
FREESPACE(p) = off - PAGE_META(n);
lib/libc/db/hash/hash_bigkey.c
168
p[n] = FULL_KEY;
lib/libc/db/hash/hash_bigkey.c
175
p[n] = FULL_KEY_DATA;
lib/libc/db/hash/hash_bigkey.c
197
int key_done, n;
lib/libc/db/hash/hash_bigkey.c
235
n = bp[0];
lib/libc/db/hash/hash_bigkey.c
236
pageno = bp[n - 1];
lib/libc/db/hash/hash_bigkey.c
240
if (n > 2) {
lib/libc/db/hash/hash_bigkey.c
248
n -= 2;
lib/libc/db/hash/hash_bigkey.c
249
bp[0] = n;
lib/libc/db/hash/hash_bigkey.c
250
FREESPACE(bp) = hashp->BSIZE - PAGE_META(n);
lib/libc/db/hash/hash_bigkey.c
321
int n;
lib/libc/db/hash/hash_bigkey.c
326
n = bp[0];
lib/libc/db/hash/hash_bigkey.c
334
((n == 2) || (bp[n] == OVFLPAGE) || (FREESPACE(bp))))
lib/libc/db/hash/hash_bigkey.c
337
pageno = bp[n - 1];
lib/libc/db/hash/hash_bigkey.c
560
uint16_t free_space, n, off, *tp;
lib/libc/db/hash/hash_bigkey.c
596
n = tp[0];
lib/libc/db/hash/hash_bigkey.c
599
tp[++n] = (uint16_t)addr;
lib/libc/db/hash/hash_bigkey.c
600
tp[++n] = OVFLPAGE;
lib/libc/db/hash/hash_bigkey.c
601
tp[0] = n;
lib/libc/db/hash/hash_bigkey.c
625
n = tp[4];
lib/libc/db/hash/hash_bigkey.c
634
tp[4] = n;
lib/libc/db/hash/hash_bigkey.c
86
int key_size, n;
lib/libc/db/hash/hash_func.c
112
uint32_t n, loop;
lib/libc/db/hash/hash_func.c
115
#define HASHC n = *k++ + 65599 * n
lib/libc/db/hash/hash_func.c
117
n = 0;
lib/libc/db/hash/hash_func.c
144
return (n);
lib/libc/db/hash/hash_page.c
100
n = bp[0];
lib/libc/db/hash/hash_page.c
104
bp[++n] = off;
lib/libc/db/hash/hash_page.c
109
bp[++n] = off;
lib/libc/db/hash/hash_page.c
112
bp[0] = n;
lib/libc/db/hash/hash_page.c
113
bp[n + 1] = off - ((n + 3) * sizeof(uint16_t));
lib/libc/db/hash/hash_page.c
114
bp[n + 2] = off;
lib/libc/db/hash/hash_page.c
126
int n;
lib/libc/db/hash/hash_page.c
129
n = bp[0];
lib/libc/db/hash/hash_page.c
139
if (ndx != (n - 1)) {
lib/libc/db/hash/hash_page.c
147
for (i = ndx + 2; i <= n; i += 2) {
lib/libc/db/hash/hash_page.c
166
bp[n] = OFFSET(bp) + pairlen;
lib/libc/db/hash/hash_page.c
167
bp[n - 1] = bp[n + 1] + pairlen + 2 * sizeof(uint16_t);
lib/libc/db/hash/hash_page.c
168
bp[0] = n - 2;
lib/libc/db/hash/hash_page.c
186
int n, ndx, retval;
lib/libc/db/hash/hash_page.c
207
for (n = 1, ndx = 1; n < ino[0]; n += 2) {
lib/libc/db/hash/hash_page.c
208
if (ino[n + 1] < REAL_KEY) {
lib/libc/db/hash/hash_page.c
216
key.data = (unsigned char *)op + ino[n];
lib/libc/db/hash/hash_page.c
217
key.size = off - ino[n];
lib/libc/db/hash/hash_page.c
223
copyto = ino[n + 1] + diff;
lib/libc/db/hash/hash_page.c
224
memmove(op + copyto, op + ino[n + 1],
lib/libc/db/hash/hash_page.c
225
off - ino[n + 1]);
lib/libc/db/hash/hash_page.c
226
ino[ndx] = copyto + ino[n] - ino[n + 1];
lib/libc/db/hash/hash_page.c
229
copyto = ino[n + 1];
lib/libc/db/hash/hash_page.c
233
val.data = (unsigned char *)op + ino[n + 1];
lib/libc/db/hash/hash_page.c
234
val.size = ino[n] - ino[n + 1];
lib/libc/db/hash/hash_page.c
239
off = ino[n + 1];
lib/libc/db/hash/hash_page.c
289
uint16_t n, off, ov_addr, scopyto;
lib/libc/db/hash/hash_page.c
299
n = ino[0] - 1;
lib/libc/db/hash/hash_page.c
300
while (n < ino[0]) {
lib/libc/db/hash/hash_page.c
319
} else if (ino[n + 1] == OVFLPAGE) {
lib/libc/db/hash/hash_page.c
320
ov_addr = ino[n];
lib/libc/db/hash/hash_page.c
335
n = 1;
lib/libc/db/hash/hash_page.c
345
for (n = 1; (n < ino[0]) && (ino[n + 1] >= REAL_KEY); n += 2) {
lib/libc/db/hash/hash_page.c
347
key.data = (unsigned char *)cino + ino[n];
lib/libc/db/hash/hash_page.c
348
key.size = off - ino[n];
lib/libc/db/hash/hash_page.c
349
val.data = (unsigned char *)cino + ino[n + 1];
lib/libc/db/hash/hash_page.c
350
val.size = ino[n] - ino[n + 1];
lib/libc/db/hash/hash_page.c
351
off = ino[n + 1];
lib/libc/db/hash/hash_page.c
879
uint16_t free_space, n, off, pageno;
lib/libc/db/hash/hash_page.c
882
n = sp[0];
lib/libc/db/hash/hash_page.c
886
pageno = sp[n - 1];
lib/libc/db/hash/hash_page.c
888
sp[n - 1] = off;
lib/libc/db/hash/hash_page.c
891
sp[n] = off;
lib/libc/db/hash/hash_page.c
893
sp[0] = n + 2;
lib/libc/db/hash/hash_page.c
894
sp[n + 1] = pageno;
lib/libc/db/hash/hash_page.c
895
sp[n + 2] = OVFLPAGE;
lib/libc/db/hash/hash_page.c
95
uint16_t *bp, n, off;
lib/libc/gen/_pthread_stubs.c
50
#define WRlc(f, n) \
lib/libc/gen/_pthread_stubs.c
51
__weak_reference_asm(f, _ ## n);
lib/libc/gen/_pthread_stubs.c
52
#define WR(f, n) \
lib/libc/gen/_pthread_stubs.c
53
__weak_reference_asm(f, _ ## n); \
lib/libc/gen/_pthread_stubs.c
54
__weak_reference_asm(f, n)
lib/libc/gen/arc4random.c
198
_rs_random_buf(void *_buf, size_t n)
lib/libc/gen/arc4random.c
204
_rs_stir_if_needed(n);
lib/libc/gen/arc4random.c
205
while (n > 0) {
lib/libc/gen/arc4random.c
207
m = minimum(n, rs->rs_have);
lib/libc/gen/arc4random.c
213
n -= m;
lib/libc/gen/arc4random.c
247
arc4random_buf(void *buf, size_t n)
lib/libc/gen/arc4random.c
250
_rs_random_buf(buf, n);
lib/libc/gen/arc4random.c
91
_rs_init(u_char *buf, size_t n)
lib/libc/gen/arc4random.c
93
if (n < KEYSZ + IVSZ)
lib/libc/gen/devname.c
50
size_t n = len;
lib/libc/gen/devname.c
52
if (sysctlbyname("kern.devname", buf, &n, &dev, sizeof(dev)) == 0)
lib/libc/gen/exec.c
110
int n;
lib/libc/gen/exec.c
113
n = 1;
lib/libc/gen/exec.c
115
n++;
lib/libc/gen/exec.c
117
argv = alloca((n + 1) * sizeof(*argv));
lib/libc/gen/exec.c
123
n = 1;
lib/libc/gen/exec.c
125
while ((argv[n] = va_arg(ap, const char *)) != NULL)
lib/libc/gen/exec.c
126
n++;
lib/libc/gen/exec.c
55
int n;
lib/libc/gen/exec.c
58
n = 1;
lib/libc/gen/exec.c
60
n++;
lib/libc/gen/exec.c
62
argv = alloca((n + 1) * sizeof(*argv));
lib/libc/gen/exec.c
68
n = 1;
lib/libc/gen/exec.c
70
while ((argv[n] = va_arg(ap, const char *)) != NULL)
lib/libc/gen/exec.c
71
n++;
lib/libc/gen/exec.c
82
int n;
lib/libc/gen/exec.c
85
n = 1;
lib/libc/gen/exec.c
87
n++;
lib/libc/gen/exec.c
89
argv = alloca((n + 1) * sizeof(*argv));
lib/libc/gen/exec.c
95
n = 1;
lib/libc/gen/exec.c
97
while ((argv[n] = va_arg(ap, const char *)) != NULL)
lib/libc/gen/exec.c
98
n++;
lib/libc/gen/getbsize.c
43
long n, max, mul, blocksize;
lib/libc/gen/getbsize.c
53
if ((n = strtol(p, &ep, 10)) < 0)
lib/libc/gen/getbsize.c
55
if (n == 0)
lib/libc/gen/getbsize.c
56
n = 1;
lib/libc/gen/getbsize.c
81
n = 512;
lib/libc/gen/getbsize.c
86
if (n > max) {
lib/libc/gen/getbsize.c
88
n = max;
lib/libc/gen/getbsize.c
90
if ((blocksize = n * mul) < 512) {
lib/libc/gen/getbsize.c
93
blocksize = n = 512;
lib/libc/gen/getbsize.c
96
blocksize = n = 512;
lib/libc/gen/getbsize.c
98
snprintf(header, sizeof(header), "%ld%s-blocks", n, form);
lib/libc/gen/getcap.c
1012
n = 0;
lib/libc/gen/getcap.c
1026
n = n * base + digit;
lib/libc/gen/getcap.c
1033
*num = n;
lib/libc/gen/getcap.c
299
int n;
lib/libc/gen/getcap.c
301
n = _read(fd, buf, sizeof(buf));
lib/libc/gen/getcap.c
302
if (n <= 0) {
lib/libc/gen/getcap.c
305
if (n < 0) {
lib/libc/gen/getcap.c
314
b_end = buf+n;
lib/libc/gen/getcap.c
831
int n, i;
lib/libc/gen/getcap.c
833
n = 0;
lib/libc/gen/getcap.c
836
n = n * 8 + (*bp++ - '0');
lib/libc/gen/getcap.c
838
*mp++ = n;
lib/libc/gen/getcap.c
982
long n;
lib/libc/gen/getdevpath.c
188
int n;
lib/libc/gen/getdevpath.c
208
n = readlink(*pathp, path, len);
lib/libc/gen/getdevpath.c
209
if (n < 0 || n > len) {
lib/libc/gen/getdevpath.c
217
path[n] = 0;
lib/libc/gen/getgrent.c
1474
unsigned long n;
lib/libc/gen/getgrent.c
1498
n = strtoul(p, &q, 10);
lib/libc/gen/getgrent.c
1499
if (q < eol && *q == ':' && gid == (gid_t)n)
lib/libc/gen/getgrent.c
1516
unsigned long n;
lib/libc/gen/getgrent.c
1531
n = strtoul(s_gid, &s_gid, 10);
lib/libc/gen/getgrent.c
1534
grp->gr_gid = (gid_t)n;
lib/libc/gen/getgrent.c
768
is_comment_line(const char *s, size_t n)
lib/libc/gen/getgrent.c
772
eom = &s[n];
lib/libc/gen/getpwent.c
1038
uint32_t n;
lib/libc/gen/getpwent.c
1052
if (p + sizeof(n) > eom) \
lib/libc/gen/getpwent.c
1054
memcpy(&n, p, sizeof(n)); \
lib/libc/gen/getpwent.c
1055
(field) = ntohl(n); \
lib/libc/gen/getpwent.c
1056
p += sizeof(n); \
lib/libc/gen/getpwent.c
1478
size_t n;
lib/libc/gen/getpwent.c
1485
n = 0;
lib/libc/gen/getpwent.c
1486
n += pwd->pw_name != NULL ? strlen(pwd->pw_name) + 1 : 0;
lib/libc/gen/getpwent.c
1487
n += pwd->pw_passwd != NULL ? strlen(pwd->pw_passwd) + 1 : 0;
lib/libc/gen/getpwent.c
1488
n += pwd->pw_class != NULL ? strlen(pwd->pw_class) + 1 : 0;
lib/libc/gen/getpwent.c
1489
n += pwd->pw_gecos != NULL ? strlen(pwd->pw_gecos) + 1 : 0;
lib/libc/gen/getpwent.c
1490
n += pwd->pw_dir != NULL ? strlen(pwd->pw_dir) + 1 : 0;
lib/libc/gen/getpwent.c
1491
n += pwd->pw_shell != NULL ? strlen(pwd->pw_shell) + 1 : 0;
lib/libc/gen/getpwent.c
1492
copy = malloc(n);
lib/libc/gen/getpwent.c
1498
eob = ©[n];
lib/libc/gen/getpwent.c
1522
if ((n = strlcpy(p, q, eob-p)) >= eob-p) { \
lib/libc/gen/getpwent.c
1526
p += n + 1; \
lib/libc/gen/ldexp.c
106
if (n< -50000) return tiny*x; /*underflow*/
lib/libc/gen/ldexp.c
109
k = k+n;
lib/libc/gen/ldexp.c
114
if (n > 50000) /* in case integer overflow in n+k */
lib/libc/gen/ldexp.c
96
ldexp(double x, int n)
lib/libc/gen/nlist.c
62
int fd, n;
lib/libc/gen/nlist.c
67
n = __fdnlist(fd, list);
lib/libc/gen/nlist.c
69
return (n);
lib/libc/gen/nlist.c
86
int n = -1;
lib/libc/gen/nlist.c
90
n = (nlist_fn[i].fn)(fd, list);
lib/libc/gen/nlist.c
91
if (n != -1)
lib/libc/gen/nlist.c
94
return (n);
lib/libc/include/reentrant.h
130
#define thr_sigsetmask(f, n, o) _pthread_sigmask(f, n, o)
lib/libc/inet/inet_addr.c
105
int base, n;
lib/libc/inet/inet_addr.c
174
n = pp - parts + 1;
lib/libc/inet/inet_addr.c
175
switch (n) {
lib/libc/inet/inet_cidr_ntop.c
216
int n;
lib/libc/inet/inet_cidr_ntop.c
219
n = 4;
lib/libc/inet/inet_cidr_ntop.c
221
n = 3;
lib/libc/inet/inet_cidr_ntop.c
223
n = 2;
lib/libc/inet/inet_cidr_ntop.c
224
n = decoct(src+12, n, tp, sizeof tmp - (tp - tmp));
lib/libc/inet/inet_cidr_ntop.c
225
if (n == 0) {
lib/libc/inet/inet_cidr_pton.c
220
const int n = tp - colonp;
lib/libc/inet/inet_cidr_pton.c
225
for (i = 1; i <= n; i++) {
lib/libc/inet/inet_cidr_pton.c
226
endp[- i] = colonp[n - i];
lib/libc/inet/inet_cidr_pton.c
227
colonp[n - i] = 0;
lib/libc/inet/inet_cidr_pton.c
79
int n, ch, tmp, bits;
lib/libc/inet/inet_cidr_pton.c
86
n = strchr(digits, ch) - digits;
lib/libc/inet/inet_cidr_pton.c
87
assert(n >= 0 && n <= 9);
lib/libc/inet/inet_cidr_pton.c
89
tmp += n;
lib/libc/inet/inet_net_pton.c
124
n = strchr(digits, ch) - digits;
lib/libc/inet/inet_net_pton.c
125
assert(n >= 0 && n <= 9);
lib/libc/inet/inet_net_pton.c
127
bits += n;
lib/libc/inet/inet_net_pton.c
184
int n;
lib/libc/inet/inet_net_pton.c
189
n = 0;
lib/libc/inet/inet_net_pton.c
195
if (n++ != 0 && val == 0) /*%< no leading zeros */
lib/libc/inet/inet_net_pton.c
205
if (n == 0)
lib/libc/inet/inet_net_pton.c
215
int n;
lib/libc/inet/inet_net_pton.c
220
n = 0;
lib/libc/inet/inet_net_pton.c
226
if (n++ != 0 && val == 0) /*%< no leading zeros */
lib/libc/inet/inet_net_pton.c
241
n = 0;
lib/libc/inet/inet_net_pton.c
246
if (n == 0)
lib/libc/inet/inet_net_pton.c
344
const int n = tp - colonp;
lib/libc/inet/inet_net_pton.c
349
for (i = 1; i <= n; i++) {
lib/libc/inet/inet_net_pton.c
350
endp[- i] = colonp[n - i];
lib/libc/inet/inet_net_pton.c
351
colonp[n - i] = 0;
lib/libc/inet/inet_net_pton.c
57
int n, ch, tmp = 0, dirty, bits;
lib/libc/inet/inet_net_pton.c
72
n = strchr(xdigits, ch) - xdigits;
lib/libc/inet/inet_net_pton.c
73
assert(n >= 0 && n <= 15);
lib/libc/inet/inet_net_pton.c
75
tmp = n;
lib/libc/inet/inet_net_pton.c
77
tmp = (tmp << 4) | n;
lib/libc/inet/inet_net_pton.c
95
n = strchr(digits, ch) - digits;
lib/libc/inet/inet_net_pton.c
96
assert(n >= 0 && n <= 9);
lib/libc/inet/inet_net_pton.c
98
tmp += n;
lib/libc/inet/inet_network.c
51
in_addr_t val, base, n;
lib/libc/inet/inet_network.c
90
n = pp - parts;
lib/libc/inet/inet_network.c
91
if (n > 4U)
lib/libc/inet/inet_network.c
93
for (val = 0, i = 0; i < n; i++) {
lib/libc/inet/inet_pton.c
197
const int n = tp - colonp;
lib/libc/inet/inet_pton.c
202
for (i = 1; i <= n; i++) {
lib/libc/inet/inet_pton.c
203
endp[- i] = colonp[n - i];
lib/libc/inet/inet_pton.c
204
colonp[n - i] = 0;
lib/libc/locale/ascii.c
90
_ascii_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/ascii.c
96
if (n == 0)
lib/libc/locale/big5.c
115
n = 1;
lib/libc/locale/big5.c
119
if (n == 0)
lib/libc/locale/big5.c
138
if (n < 2) {
lib/libc/locale/big5.c
98
_BIG5_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/collate.c
208
int n = table->info->subst_count[pass];
lib/libc/locale/collate.c
210
if (n == 0)
lib/libc/locale/euc.c
137
size_t n, mbstate_t * __restrict ps)
lib/libc/locale/euc.c
139
return (_EUC_mbrtowc_impl(pwc, s, n, ps, SS2, 4, 0, 0));
lib/libc/locale/euc.c
184
size_t n, mbstate_t * __restrict ps)
lib/libc/locale/euc.c
186
return (_EUC_mbrtowc_impl(pwc, s, n, ps, 0, 0, 0, 0));
lib/libc/locale/euc.c
231
size_t n, mbstate_t * __restrict ps)
lib/libc/locale/euc.c
233
return (_EUC_mbrtowc_impl(pwc, s, n, ps, SS2, 2, SS3, 3));
lib/libc/locale/euc.c
278
size_t n, mbstate_t * __restrict ps)
lib/libc/locale/euc.c
280
return (_EUC_mbrtowc_impl(pwc, s, n, ps, SS2, 4, 0, 0));
lib/libc/locale/euc.c
311
size_t n, mbstate_t * __restrict ps,
lib/libc/locale/euc.c
328
n = 1;
lib/libc/locale/euc.c
332
if (n == 0)
lib/libc/locale/euc.c
364
for (i = 0; i < MIN(want, n); i++) {
lib/libc/locale/fix_grouping.c
48
char n;
lib/libc/locale/fix_grouping.c
72
n = *src - '0';
lib/libc/locale/fix_grouping.c
75
n *= 10;
lib/libc/locale/fix_grouping.c
76
n += *src - '0';
lib/libc/locale/fix_grouping.c
79
*dst = n;
lib/libc/locale/gb18030.c
108
n = 1;
lib/libc/locale/gb18030.c
112
ncopy = MIN(MIN(n, MB_CUR_MAX), sizeof(gs->bytes) - gs->count);
lib/libc/locale/gb18030.c
117
n = gs->count;
lib/libc/locale/gb18030.c
119
if (n == 0)
lib/libc/locale/gb18030.c
134
if (n < 2)
lib/libc/locale/gb18030.c
147
if (n < 3)
lib/libc/locale/gb18030.c
153
if (n < 4)
lib/libc/locale/gb18030.c
92
size_t n, mbstate_t * __restrict ps)
lib/libc/locale/gb2312.c
108
_GB2312_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/gb2312.c
125
n = 1;
lib/libc/locale/gb2312.c
129
ncopy = MIN(MIN(n, MB_CUR_MAX), sizeof(gs->bytes) - gs->count);
lib/libc/locale/gb2312.c
134
n = gs->count;
lib/libc/locale/gb2312.c
136
if ((len = _GB2312_check(s, n)) < 0)
lib/libc/locale/gb2312.c
85
_GB2312_check(const char *str, size_t n)
lib/libc/locale/gb2312.c
89
if (n == 0)
lib/libc/locale/gb2312.c
93
if (n < 2)
lib/libc/locale/gbk.c
113
n = 1;
lib/libc/locale/gbk.c
117
if (n == 0)
lib/libc/locale/gbk.c
136
if (n < 2) {
lib/libc/locale/gbk.c
96
_GBK_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/mblen.c
40
mblen_l(const char *s, size_t n, locale_t locale)
lib/libc/locale/mblen.c
51
rval = XLOCALE_CTYPE(locale)->__mbrtowc(NULL, s, n, &locale->mblen);
lib/libc/locale/mblen.c
58
mblen(const char *s, size_t n)
lib/libc/locale/mblen.c
60
return mblen_l(s, n, __get_locale());
lib/libc/locale/mbrlen.c
39
mbrlen_l(const char * __restrict s, size_t n, mbstate_t * __restrict ps, locale_t locale)
lib/libc/locale/mbrlen.c
44
return (XLOCALE_CTYPE(locale)->__mbrtowc(NULL, s, n, ps));
lib/libc/locale/mbrlen.c
48
mbrlen(const char * __restrict s, size_t n, mbstate_t * __restrict ps)
lib/libc/locale/mbrlen.c
50
return mbrlen_l(s, n, ps, __get_locale());
lib/libc/locale/mbrtocXX_iconv.h
106
srcleft = cs->srcbuf_len + n;
lib/libc/locale/mbrtocXX_iconv.h
152
mbrtocXX(charXX_t * __restrict pc, const char * __restrict s, size_t n,
lib/libc/locale/mbrtocXX_iconv.h
156
return (mbrtocXX_l(pc, s, n, ps, __get_locale()));
lib/libc/locale/mbrtocXX_iconv.h
58
mbrtocXX_l(charXX_t * __restrict pc, const char * __restrict s, size_t n,
lib/libc/locale/mbrtocXX_iconv.h
95
if (n > sizeof(cs->srcbuf) - cs->srcbuf_len)
lib/libc/locale/mbrtocXX_iconv.h
96
n = sizeof(cs->srcbuf) - cs->srcbuf_len;
lib/libc/locale/mbrtocXX_iconv.h
97
memcpy(cs->srcbuf + cs->srcbuf_len, s, n);
lib/libc/locale/mbrtowc.c
40
size_t n, mbstate_t * __restrict ps, locale_t locale)
lib/libc/locale/mbrtowc.c
45
return (XLOCALE_CTYPE(locale)->__mbrtowc(pwc, s, n, ps));
lib/libc/locale/mbrtowc.c
50
size_t n, mbstate_t * __restrict ps)
lib/libc/locale/mbrtowc.c
52
return mbrtowc_l(pwc, s, n, ps, __get_locale());
lib/libc/locale/mbstowcs.c
41
mbstowcs_l(wchar_t * __restrict pwcs, const char * __restrict s, size_t n, locale_t locale)
lib/libc/locale/mbstowcs.c
50
return (XLOCALE_CTYPE(locale)->__mbsnrtowcs(pwcs, &sp, SIZE_T_MAX, n, &mbs));
lib/libc/locale/mbstowcs.c
53
mbstowcs(wchar_t * __restrict pwcs, const char * __restrict s, size_t n)
lib/libc/locale/mbstowcs.c
55
return mbstowcs_l(pwcs, s, n, __get_locale());
lib/libc/locale/mbtowc.c
41
mbtowc_l(wchar_t * __restrict pwc, const char * __restrict s, size_t n, locale_t locale)
lib/libc/locale/mbtowc.c
52
rval = XLOCALE_CTYPE(locale)->__mbrtowc(pwc, s, n, &locale->mbtowc);
lib/libc/locale/mbtowc.c
64
mbtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n)
lib/libc/locale/mbtowc.c
66
return mbtowc_l(pwc, s, n, __get_locale());
lib/libc/locale/mskanji.c
109
n = 1;
lib/libc/locale/mskanji.c
113
if (n == 0)
lib/libc/locale/mskanji.c
130
if (n < 2) {
lib/libc/locale/mskanji.c
93
_MSKanji_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/none.c
103
if (n == 0)
lib/libc/locale/none.c
217
size_t n = *slen;
lib/libc/locale/none.c
219
for (i = j = 0; i < n; ++i) {
lib/libc/locale/none.c
258
size_t n = *slen;
lib/libc/locale/none.c
260
for (i = j = 0; i < n; ++i) {
lib/libc/locale/none.c
96
_none_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/utf8.c
115
_UTF8_mbrtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n,
lib/libc/locale/utf8.c
131
n = 1;
lib/libc/locale/utf8.c
135
if (n == 0)
lib/libc/locale/utf8.c
192
for (i = (us->want == 0) ? 1 : 0; i < MIN(want, n); i++) {
lib/libc/locale/utf8.c
450
size_t n = *slen;
lib/libc/locale/utf8.c
454
for (i = j = 0; i < n; ++i) {
lib/libc/locale/utf8.c
518
if (i + k >= n) {
lib/libc/locale/utf8.c
520
want = n - i;
lib/libc/locale/utf8.c
614
size_t n = *slen;
lib/libc/locale/utf8.c
619
for (i = j = 0; i < n; ++i) {
lib/libc/locale/wcsftime.c
102
n = mbsrtowcs_l(wcs, &dstp, maxsize, &mbs, locale);
lib/libc/locale/wcsftime.c
103
if (n == (size_t)-2 || n == (size_t)-1 || dstp != NULL)
lib/libc/locale/wcsftime.c
108
return (n);
lib/libc/locale/wcsftime.c
65
size_t n, sflen;
lib/libc/locale/wcstombs.c
41
wcstombs_l(char * __restrict s, const wchar_t * __restrict pwcs, size_t n,
lib/libc/locale/wcstombs.c
51
return (XLOCALE_CTYPE(locale)->__wcsnrtombs(s, &pwcsp, SIZE_T_MAX, n, &mbs));
lib/libc/locale/wcstombs.c
54
wcstombs(char * __restrict s, const wchar_t * __restrict pwcs, size_t n)
lib/libc/locale/wcstombs.c
56
return wcstombs_l(s, pwcs, n, __get_locale());
lib/libc/nameser/ns_name.c
100
u_int n;
lib/libc/nameser/ns_name.c
107
while ((n = *cp++) != 0) {
lib/libc/nameser/ns_name.c
108
if ((n & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
128
if ((n & NS_CMPRSFLGS) == NS_TYPE_ELT) {
lib/libc/nameser/ns_name.c
131
if (n != DNS_LABELTYPE_BITSTRING) {
lib/libc/nameser/ns_name.c
203
int c, n, escaped, e = 0;
lib/libc/nameser/ns_name.c
235
n = (cp - digits) * 100;
lib/libc/nameser/ns_name.c
241
n += (cp - digits) * 10;
lib/libc/nameser/ns_name.c
247
n += (cp - digits);
lib/libc/nameser/ns_name.c
248
if (n > 255) {
lib/libc/nameser/ns_name.c
252
c = n;
lib/libc/nameser/ns_name.c
338
u_int n;
lib/libc/nameser/ns_name.c
349
while ((n = *cp++) != 0) {
lib/libc/nameser/ns_name.c
350
if ((n & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
355
*dn++ = n;
lib/libc/nameser/ns_name.c
388
int n, len, checked, l;
lib/libc/nameser/ns_name.c
400
while ((n = *srcp++) != 0) {
lib/libc/nameser/ns_name.c
402
switch (n & NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
415
*dstp++ = n;
lib/libc/nameser/ns_name.c
428
srcp = msg + (((n & 0x3f) << 8) | (*srcp & 0xff));
lib/libc/nameser/ns_name.c
482
int n, l, first = 1;
lib/libc/nameser/ns_name.c
502
n = *srcp;
lib/libc/nameser/ns_name.c
503
if ((n & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
517
} while (n != 0);
lib/libc/nameser/ns_name.c
523
n = *srcp;
lib/libc/nameser/ns_name.c
524
if (n != 0 && msg != NULL) {
lib/libc/nameser/ns_name.c
544
if ((n & NS_CMPRSFLGS) == NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
548
n = labellen(srcp);
lib/libc/nameser/ns_name.c
549
if (dstp + 1 + n >= eob) {
lib/libc/nameser/ns_name.c
552
memcpy(dstp, srcp, n + 1);
lib/libc/nameser/ns_name.c
553
srcp += n + 1;
lib/libc/nameser/ns_name.c
554
dstp += n + 1;
lib/libc/nameser/ns_name.c
555
} while (n != 0);
lib/libc/nameser/ns_name.c
581
int n;
lib/libc/nameser/ns_name.c
583
if ((n = ns_name_unpack(msg, eom, src, tmp, sizeof tmp)) == -1)
lib/libc/nameser/ns_name.c
587
return (n);
lib/libc/nameser/ns_name.c
643
u_int n;
lib/libc/nameser/ns_name.c
647
while (cp < eom && (n = *cp++) != 0) {
lib/libc/nameser/ns_name.c
649
switch (n & NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
651
cp += n;
lib/libc/nameser/ns_name.c
744
u_int n;
lib/libc/nameser/ns_name.c
758
while ((n = *cp++) != 0) {
lib/libc/nameser/ns_name.c
762
switch (n & NS_CMPRSFLGS) {
lib/libc/nameser/ns_name.c
764
n = labellen(cp - 1); /*%< XXX */
lib/libc/nameser/ns_name.c
765
if (n != *dn++)
lib/libc/nameser/ns_name.c
768
for ((void)NULL; n > 0; n--)
lib/libc/nameser/ns_name.c
779
cp = msg + (((n & 0x3f) << 8) | *cp);
lib/libc/nameser/ns_print.c
410
int n, lcnt;
lib/libc/nameser/ns_print.c
426
n = 0;
lib/libc/nameser/ns_print.c
438
len = SPRINTF((tmp, "%d ", n));
lib/libc/nameser/ns_print.c
443
} while (++n & 07);
lib/libc/nameser/ns_print.c
454
int n;
lib/libc/nameser/ns_print.c
483
for (n = 0; n < len; n += 48) {
lib/libc/nameser/ns_print.c
485
T(addstr(base64_key + n, MIN(len - n, 48),
lib/libc/nameser/ns_print.c
490
n = SPRINTF((tmp, " ; key_tag= %u", key_id));
lib/libc/nameser/ns_print.c
491
T(addstr(tmp, n, &buf, &buflen));
lib/libc/nameser/ns_print.c
501
int n;
lib/libc/nameser/ns_print.c
546
for (n = 0; n < len; n += 48) {
lib/libc/nameser/ns_print.c
548
T(addstr(base64_key + n, MIN(len - n, 48),
lib/libc/nameser/ns_print.c
557
int n, c;
lib/libc/nameser/ns_print.c
563
n = edata - rdata;
lib/libc/nameser/ns_print.c
564
for (c = 0; c < n*8; c++)
lib/libc/nameser/ns_print.c
574
int n;
lib/libc/nameser/ns_print.c
603
for (n = 0; n < len; n += 48) {
lib/libc/nameser/ns_print.c
606
T(addstr(base64_cert + n, MIN(len - n, 48),
lib/libc/nameser/ns_print.c
648
int n;
lib/libc/nameser/ns_print.c
653
n = ns_get16(rdata); rdata += INT16SZ;
lib/libc/nameser/ns_print.c
654
rdata += n; /*%< sig */
lib/libc/nameser/ns_print.c
655
n = ns_get16(rdata); rdata += INT16SZ; /*%< original id */
lib/libc/nameser/ns_print.c
709
int n, m;
lib/libc/nameser/ns_print.c
719
n = MIN(16, edata - rdata);
lib/libc/nameser/ns_print.c
720
for (m = 0; m < n; m++)
lib/libc/nameser/ns_print.c
723
if (n < 16) {
lib/libc/nameser/ns_print.c
729
for (m = 0; m < n; m++)
lib/libc/nameser/ns_print.c
734
rdata += n;
lib/libc/nameser/ns_print.c
795
int n = *rdata;
lib/libc/nameser/ns_print.c
797
if (rdata + 1 + n <= edata) {
lib/libc/nameser/ns_print.c
799
while (n-- > 0) {
lib/libc/nameser/ns_print.c
827
int n;
lib/libc/nameser/ns_print.c
829
n = dn_expand(msg, msg + msglen, *pp, *buf, *buflen);
lib/libc/nameser/ns_print.c
830
if (n < 0)
lib/libc/nameser/ns_print.c
853
*pp += n;
lib/libc/nameser/ns_print.c
86
int n;
lib/libc/nameser/ns_print.c
88
n = ns_sprintrrf(ns_msg_base(*handle), ns_msg_size(*handle),
lib/libc/nameser/ns_print.c
92
return (n);
lib/libc/nameser/ns_samedomain.c
169
size_t n = strlen(src);
lib/libc/nameser/ns_samedomain.c
171
if (n + sizeof "." > dstsize) { /*%< Note: sizeof == 2 */
lib/libc/nameser/ns_samedomain.c
176
while (n >= 1U && dst[n - 1] == '.') /*%< Ends in "." */
lib/libc/nameser/ns_samedomain.c
177
if (n >= 2U && dst[n - 2] == '\\' && /*%< Ends in "\." */
lib/libc/nameser/ns_samedomain.c
178
(n < 3U || dst[n - 3] != '\\')) /*%< But not "\\." */
lib/libc/nameser/ns_samedomain.c
181
dst[--n] = '\0';
lib/libc/nameser/ns_samedomain.c
182
dst[n++] = '.';
lib/libc/nameser/ns_samedomain.c
183
dst[n] = '\0';
lib/libc/net/ether_addr.c
119
ether_ntoa_r(const struct ether_addr *n, char *a)
lib/libc/net/ether_addr.c
123
i = sprintf(a, "%02x:%02x:%02x:%02x:%02x:%02x", n->octet[0],
lib/libc/net/ether_addr.c
124
n->octet[1], n->octet[2], n->octet[3], n->octet[4], n->octet[5]);
lib/libc/net/ether_addr.c
131
ether_ntoa(const struct ether_addr *n)
lib/libc/net/ether_addr.c
135
return (ether_ntoa_r(n, a));
lib/libc/net/getaddrinfo.c
1718
int n;
lib/libc/net/getaddrinfo.c
1754
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/getaddrinfo.c
1755
if ((n < 0) || !(*name_ok)(bp)) {
lib/libc/net/getaddrinfo.c
1759
cp += n + QFIXEDSZ;
lib/libc/net/getaddrinfo.c
1765
n = strlen(bp) + 1; /* for the \0 */
lib/libc/net/getaddrinfo.c
1766
if (n >= MAXHOSTNAMELEN) {
lib/libc/net/getaddrinfo.c
1771
bp += n;
lib/libc/net/getaddrinfo.c
1778
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/getaddrinfo.c
1779
if ((n < 0) || !(*name_ok)(bp)) {
lib/libc/net/getaddrinfo.c
1783
cp += n; /* name */
lib/libc/net/getaddrinfo.c
1788
n = _getshort(cp);
lib/libc/net/getaddrinfo.c
1792
cp += n;
lib/libc/net/getaddrinfo.c
1797
n = dn_expand(answer->buf, eom, cp, tbuf, sizeof tbuf);
lib/libc/net/getaddrinfo.c
1798
if ((n < 0) || !(*name_ok)(tbuf)) {
lib/libc/net/getaddrinfo.c
1802
cp += n;
lib/libc/net/getaddrinfo.c
1804
n = strlen(tbuf) + 1; /* for the \0 */
lib/libc/net/getaddrinfo.c
1805
if (n > ep - bp || n >= MAXHOSTNAMELEN) {
lib/libc/net/getaddrinfo.c
1811
bp += n;
lib/libc/net/getaddrinfo.c
1816
cp += n;
lib/libc/net/getaddrinfo.c
1827
cp += n;
lib/libc/net/getaddrinfo.c
1838
cp += n;
lib/libc/net/getaddrinfo.c
1841
if (type == T_A && n != INADDRSZ) {
lib/libc/net/getaddrinfo.c
1842
cp += n;
lib/libc/net/getaddrinfo.c
1845
if (type == T_AAAA && n != IN6ADDRSZ) {
lib/libc/net/getaddrinfo.c
1846
cp += n;
lib/libc/net/getaddrinfo.c
1854
cp += n;
lib/libc/net/getaddrinfo.c
1872
cp += n;
lib/libc/net/getaddrinfo.c
1880
cp += n;
lib/libc/net/getaddrinfo.c
2061
ai = getanswer(buf2, q2.n, q2.name, q2.qtype, pai, res);
lib/libc/net/getaddrinfo.c
2068
ai = getanswer(buf, q.n, q.name, q.qtype, pai, res);
lib/libc/net/getaddrinfo.c
208
int n; /* result length */
lib/libc/net/getaddrinfo.c
2362
int n;
lib/libc/net/getaddrinfo.c
2400
n = res_nmkquery(res, QUERY, name, class, type, NULL, 0, NULL,
lib/libc/net/getaddrinfo.c
2402
if (n > 0 && (res->_flags & RES_F_EDNS0ERR) == 0 &&
lib/libc/net/getaddrinfo.c
2404
n = res_nopt(res, n, buf, MAXPACKET, anslen);
lib/libc/net/getaddrinfo.c
2405
if (n <= 0) {
lib/libc/net/getaddrinfo.c
2412
return (n);
lib/libc/net/getaddrinfo.c
2414
n = res_nsend(res, buf, n, answer, anslen);
lib/libc/net/getaddrinfo.c
2415
if (n < 0) {
lib/libc/net/getaddrinfo.c
2436
if (n > anslen)
lib/libc/net/getaddrinfo.c
2450
t->n = n;
lib/libc/net/getaddrinfo.c
2663
size_t n, d;
lib/libc/net/getaddrinfo.c
2675
n = strlen(name);
lib/libc/net/getaddrinfo.c
2676
if (n >= MAXDNAME) {
lib/libc/net/getaddrinfo.c
2680
if (n > 0 && name[--n] == '.') {
lib/libc/net/getaddrinfo.c
2681
strncpy(nbuf, name, n);
lib/libc/net/getaddrinfo.c
2682
nbuf[n] = '\0';
lib/libc/net/getaddrinfo.c
2686
n = strlen(name);
lib/libc/net/getaddrinfo.c
2688
if (n + d + 1 >= MAXDNAME) {
lib/libc/net/getaddrinfo.c
588
int i, n;
lib/libc/net/getaddrinfo.c
592
for (n = 0, ai = sentinel->ai_next; ai != NULL; ai = ai->ai_next, n++)
lib/libc/net/getaddrinfo.c
598
if (n <= 1)
lib/libc/net/getaddrinfo.c
599
return(n);
lib/libc/net/getaddrinfo.c
602
if ((aio = malloc(sizeof(*aio) * n)) == NULL)
lib/libc/net/getaddrinfo.c
603
return(n); /* give up reordering */
lib/libc/net/getaddrinfo.c
604
memset(aio, 0, sizeof(*aio) * n);
lib/libc/net/getaddrinfo.c
611
return (n);
lib/libc/net/getaddrinfo.c
614
for (i = 0, ai = sentinel->ai_next; i < n; ai = ai->ai_next, i++) {
lib/libc/net/getaddrinfo.c
623
qsort(aio, n, sizeof(*aio), comp_dst);
lib/libc/net/getaddrinfo.c
626
for (i = 0, aip = &sentinel->ai_next; i < n; i++) {
lib/libc/net/getaddrinfo.c
635
return(n);
lib/libc/net/gethostbydns.c
143
int n;
lib/libc/net/gethostbydns.c
182
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/gethostbydns.c
183
if ((n < 0) || !(*name_ok)(bp)) {
lib/libc/net/gethostbydns.c
187
BOUNDED_INCR(n + QFIXEDSZ);
lib/libc/net/gethostbydns.c
193
n = strlen(bp) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
194
if (n >= MAXHOSTNAMELEN) {
lib/libc/net/gethostbydns.c
199
bp += n;
lib/libc/net/gethostbydns.c
213
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/gethostbydns.c
214
if ((n < 0) || !(*name_ok)(bp)) {
lib/libc/net/gethostbydns.c
218
cp += n; /* name */
lib/libc/net/gethostbydns.c
227
n = _getshort(cp);
lib/libc/net/gethostbydns.c
229
BOUNDS_CHECK(cp, n);
lib/libc/net/gethostbydns.c
230
erdata = cp + n;
lib/libc/net/gethostbydns.c
233
cp += n;
lib/libc/net/gethostbydns.c
239
n = dn_expand(answer->buf, eom, cp, tbuf, sizeof tbuf);
lib/libc/net/gethostbydns.c
240
if ((n < 0) || !(*name_ok)(tbuf)) {
lib/libc/net/gethostbydns.c
244
cp += n;
lib/libc/net/gethostbydns.c
251
n = strlen(bp) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
252
if (n >= MAXHOSTNAMELEN) {
lib/libc/net/gethostbydns.c
256
bp += n;
lib/libc/net/gethostbydns.c
258
n = strlen(tbuf) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
259
if (n > ep - bp || n >= MAXHOSTNAMELEN) {
lib/libc/net/gethostbydns.c
265
bp += n;
lib/libc/net/gethostbydns.c
269
n = dn_expand(answer->buf, eom, cp, tbuf, sizeof tbuf);
lib/libc/net/gethostbydns.c
270
if (n < 0 || !res_dnok(tbuf)) {
lib/libc/net/gethostbydns.c
274
cp += n;
lib/libc/net/gethostbydns.c
280
n = strlen(tbuf) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
281
if (n > ep - bp || n >= MAXHOSTNAMELEN) {
lib/libc/net/gethostbydns.c
287
bp += n;
lib/libc/net/gethostbydns.c
296
cp += n;
lib/libc/net/gethostbydns.c
304
cp += n;
lib/libc/net/gethostbydns.c
307
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/gethostbydns.c
308
if ((n < 0) || !res_hnok(bp)) {
lib/libc/net/gethostbydns.c
313
cp += n;
lib/libc/net/gethostbydns.c
323
n = -1;
lib/libc/net/gethostbydns.c
324
if (n != -1) {
lib/libc/net/gethostbydns.c
325
n = strlen(bp) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
326
if (n >= MAXHOSTNAMELEN) {
lib/libc/net/gethostbydns.c
330
bp += n;
lib/libc/net/gethostbydns.c
336
n = strlen(bp) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
337
if (n >= MAXHOSTNAMELEN) {
lib/libc/net/gethostbydns.c
341
bp += n;
lib/libc/net/gethostbydns.c
352
cp += n;
lib/libc/net/gethostbydns.c
355
if (n != he->h_length) {
lib/libc/net/gethostbydns.c
356
cp += n;
lib/libc/net/gethostbydns.c
369
if (bp + n >= ep) {
lib/libc/net/gethostbydns.c
370
dbg_printf("size (%d) too big\n", n, statp);
lib/libc/net/gethostbydns.c
378
cp += n;
lib/libc/net/gethostbydns.c
381
memcpy(*hap++ = bp, cp, n);
lib/libc/net/gethostbydns.c
382
bp += n;
lib/libc/net/gethostbydns.c
383
cp += n;
lib/libc/net/gethostbydns.c
412
n = strlen(qname) + 1; /* for the \0 */
lib/libc/net/gethostbydns.c
413
if (n > ep - bp || n >= MAXHOSTNAMELEN)
lib/libc/net/gethostbydns.c
417
bp += n;
lib/libc/net/gethostbydns.c
473
int n, type, error;
lib/libc/net/gethostbydns.c
515
n = res_nsearch(statp, name, C_IN, type, buf->buf, sizeof(buf->buf));
lib/libc/net/gethostbydns.c
516
if (n < 0) {
lib/libc/net/gethostbydns.c
518
dbg_printf("res_nsearch failed (%d)\n", n, statp);
lib/libc/net/gethostbydns.c
521
} else if (n > sizeof(buf->buf)) {
lib/libc/net/gethostbydns.c
523
dbg_printf("static buffer is too small (%d)\n", n, statp);
lib/libc/net/gethostbydns.c
527
error = gethostanswer(buf, n, name, type, &he, hed, statp);
lib/libc/net/gethostbydns.c
554
int n;
lib/libc/net/gethostbydns.c
596
for (n = NS_IN6ADDRSZ - 1; n >= 0; n--) {
lib/libc/net/gethostbydns.c
598
uaddr[n] & 0xf,
lib/libc/net/gethostbydns.c
599
(uaddr[n] >> 4) & 0xf));
lib/libc/net/gethostbydns.c
611
n = res_nquery(statp, qbuf, C_IN, T_PTR, (u_char *)buf->buf,
lib/libc/net/gethostbydns.c
613
if (n < 0) {
lib/libc/net/gethostbydns.c
615
dbg_printf("res_nquery failed (%d)\n", n, statp);
lib/libc/net/gethostbydns.c
619
if (n > sizeof buf->buf) {
lib/libc/net/gethostbydns.c
621
dbg_printf("static buffer is too small (%d)\n", n, statp);
lib/libc/net/gethostbydns.c
625
if (gethostanswer(buf, n, qbuf, T_PTR, &he, hed, statp) != 0) {
lib/libc/net/gethostnamadr.c
121
n = hptr->h_length = he->h_length;
lib/libc/net/gethostnamadr.c
129
memcpy(cp, he->h_addr_list[i], n);
lib/libc/net/gethostnamadr.c
131
cp += n;
lib/libc/net/gethostnamadr.c
137
n = strlen(he->h_name) + 1;
lib/libc/net/gethostnamadr.c
140
cp += n;
lib/libc/net/gethostnamadr.c
145
n = strlen(he->h_aliases[i]) + 1;
lib/libc/net/gethostnamadr.c
148
cp += n;
lib/libc/net/gethostnamadr.c
99
int i, n;
lib/libc/net/getnameinfo.c
341
int n;
lib/libc/net/getnameinfo.c
347
n = snprintf(buf, bufsiz, "%u", sa6->sin6_scope_id);
lib/libc/net/getnameinfo.c
348
if (n < 0 || n >= bufsiz)
lib/libc/net/getnameinfo.c
351
return n;
lib/libc/net/getnameinfo.c
364
n = snprintf(buf, bufsiz, "%u", sa6->sin6_scope_id);
lib/libc/net/getnameinfo.c
365
if (n < 0 || (size_t)n >= bufsiz)
lib/libc/net/getnameinfo.c
368
return n;
lib/libc/net/getnameinfo.c
385
int n;
lib/libc/net/getnameinfo.c
391
n = snprintf(host, hostlen, "link#%d", sdl->sdl_index);
lib/libc/net/getnameinfo.c
392
if (n > hostlen) {
lib/libc/net/getnameinfo.c
429
int i, n;
lib/libc/net/getnameinfo.c
434
n = snprintf(outp, hostlen, "%s%02x",
lib/libc/net/getnameinfo.c
436
if (n < 0 || n >= hostlen) {
lib/libc/net/getnameinfo.c
440
outp += n;
lib/libc/net/getnameinfo.c
441
hostlen -= n;
lib/libc/net/getnetbydns.c
159
int n;
lib/libc/net/getnetbydns.c
201
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/getnetbydns.c
202
if ((n < 0) || !res_dnok(bp))
lib/libc/net/getnetbydns.c
204
cp += n;
lib/libc/net/getnetbydns.c
211
GETSHORT(n, cp);
lib/libc/net/getnetbydns.c
213
n = dn_expand(answer->buf, eom, cp, bp, ep - bp);
lib/libc/net/getnetbydns.c
214
if ((n < 0) || !res_hnok(bp)) {
lib/libc/net/getnetbydns.c
215
cp += n;
lib/libc/net/getnetbydns.c
218
cp += n;
lib/libc/net/getnetbydns.c
220
n = strlen(bp) + 1;
lib/libc/net/getnetbydns.c
221
bp += n;
lib/libc/net/getnetbydns.c
235
n = strlen(ans) + 1;
lib/libc/net/getnetbydns.c
236
if (ep - bp < n) {
lib/libc/net/getnetnamadr.c
294
int i, n;
lib/libc/net/getnetnamadr.c
318
n = strlen(ne->n_name) + 1;
lib/libc/net/getnetnamadr.c
321
cp += n;
lib/libc/net/getnetnamadr.c
326
n = strlen(ne->n_aliases[i]) + 1;
lib/libc/net/getnetnamadr.c
329
cp += n;
lib/libc/net/getprotoent.c
297
int i, n;
lib/libc/net/getprotoent.c
320
n = strlen(pe->p_name) + 1;
lib/libc/net/getprotoent.c
323
cp += n;
lib/libc/net/getprotoent.c
328
n = strlen(pe->p_aliases[i]) + 1;
lib/libc/net/getprotoent.c
331
cp += n;
lib/libc/net/hesiod.c
265
int n;
lib/libc/net/hesiod.c
316
n = 0;
lib/libc/net/hesiod.c
317
while (*data && n < 2) {
lib/libc/net/hesiod.c
324
ctx->classes[n++] = C_IN;
lib/libc/net/hesiod.c
327
ctx->classes[n++] =
lib/libc/net/hesiod.c
331
while (n < 2)
lib/libc/net/hesiod.c
332
ctx->classes[n++] = 0;
lib/libc/net/hesiod.c
357
int ancount, qdcount, i, j, n, skip, type, class, len;
lib/libc/net/hesiod.c
364
n = res_mkquery(QUERY, name, qclass, T_TXT, NULL, 0,
lib/libc/net/hesiod.c
366
if (n < 0)
lib/libc/net/hesiod.c
370
n = res_send(qbuf, n, abuf, MAX_HESRESP);
lib/libc/net/hesiod.c
371
if (n < 0 || n > MAX_HESRESP) {
lib/libc/net/hesiod.c
380
eom = abuf + n;
lib/libc/net/hesiod.c
432
n = (unsigned char) *p++;
lib/libc/net/hesiod.c
433
if (p + n > eor) {
lib/libc/net/hesiod.c
437
memcpy(dst, p, (size_t)n);
lib/libc/net/hesiod.c
438
p += n;
lib/libc/net/hesiod.c
439
dst += n;
lib/libc/net/name6.c
584
int i, j, n;
lib/libc/net/name6.c
604
for (n = 0; n < hp->h_length; n++) {
lib/libc/net/name6.c
605
if ((ap[n] & mp[n]) != sp[n])
lib/libc/net/name6.c
608
if (n == hp->h_length)
lib/libc/net/name6.c
613
n = i;
lib/libc/net/name6.c
615
for (i = 0; i < n - 1; i++) {
lib/libc/net/name6.c
616
for (j = i + 1; j < n; j++) {
lib/libc/net/name6.c
637
int i, n;
lib/libc/net/name6.c
657
for (n = 0; hp->h_addr_list[n] != NULL; n++)
lib/libc/net/name6.c
663
if (n <= 1)
lib/libc/net/name6.c
667
if ((aio = malloc(sizeof(*aio) * n)) == NULL)
lib/libc/net/name6.c
669
memset(aio, 0, sizeof(*aio) * n);
lib/libc/net/name6.c
679
for (i = 0; i < n; i++) {
lib/libc/net/name6.c
712
qsort(aio, n, sizeof(*aio), comp_dst);
lib/libc/net/name6.c
715
for (i = 0; i < n; i++)
lib/libc/nls/msgcat.c
78
#define SAVEFAIL(n, l, e) { WLOCK(NLERR); \
lib/libc/nls/msgcat.c
81
np->name = strdup(n); \
lib/libc/resolv/res_comp.c
100
return (n);
lib/libc/resolv/res_comp.c
96
int n = ns_name_uncompress(msg, eom, src, dst, (size_t)dstsiz);
lib/libc/resolv/res_comp.c
98
if (n > 0 && dst[0] == '.')
lib/libc/resolv/res_debug.c
148
int n, sflag, rrnum;
lib/libc/resolv/res_debug.c
239
n = ns_sprintrr(handle, &rr, NULL, NULL,
lib/libc/resolv/res_debug.c
241
if (n < 0) {
lib/libc/resolv/res_debug.c
347
int n;
lib/libc/resolv/res_debug.c
349
if ((n = dn_expand(msg, msg + len, cp, name, sizeof name)) < 0)
lib/libc/resolv/res_debug.c
355
return (cp + n);
lib/libc/resolv/res_debug.c
371
int n, newlen;
lib/libc/resolv/res_debug.c
373
if ((n = dn_expand(msg, cp + msglen, cp, name, namelen)) < 0)
lib/libc/resolv/res_debug.c
382
return (cp + n);
lib/libc/resolv/res_debug.c
390
const u_char *n;
lib/libc/resolv/res_debug.c
392
n = p_fqnname(cp, msg, MAXCDNAME, name, sizeof name);
lib/libc/resolv/res_debug.c
393
if (n == NULL)
lib/libc/resolv/res_debug.c
396
return (n);
lib/libc/resolv/res_findzonecut.c
185
int n;
lib/libc/resolv/res_findzonecut.c
196
if ((n = get_soa(statp, dname, class, opts, zname, zsize,
lib/libc/resolv/res_findzonecut.c
199
(n = satisfy(statp, mname, &nsrrs, addrs, naddrs)) > 0))
lib/libc/resolv/res_findzonecut.c
203
if ((n = get_ns(statp, zname, class, opts, &nsrrs)) < 0 ||
lib/libc/resolv/res_findzonecut.c
205
(n = satisfy(statp, mname, &nsrrs, addrs, naddrs)) > 0))
lib/libc/resolv/res_findzonecut.c
209
if ((n = get_glue(statp, class, opts, &nsrrs)) >= 0)
lib/libc/resolv/res_findzonecut.c
210
n = satisfy(statp, mname, &nsrrs, addrs, naddrs);
lib/libc/resolv/res_findzonecut.c
213
DPRINTF(("FINISH n=%d (%s)", n, (n < 0) ? strerror(errno) : "OK"));
lib/libc/resolv/res_findzonecut.c
216
return (n);
lib/libc/resolv/res_findzonecut.c
226
int n, x;
lib/libc/resolv/res_findzonecut.c
228
n = 0;
lib/libc/resolv/res_findzonecut.c
234
n += x;
lib/libc/resolv/res_findzonecut.c
243
n += x;
lib/libc/resolv/res_findzonecut.c
245
DPRINTF(("satisfy(%s): %d", mname, n));
lib/libc/resolv/res_findzonecut.c
246
return (n);
lib/libc/resolv/res_findzonecut.c
254
int n = 0;
lib/libc/resolv/res_findzonecut.c
261
n++;
lib/libc/resolv/res_findzonecut.c
263
DPRINTF(("add_addrs: %d", n));
lib/libc/resolv/res_findzonecut.c
264
return (n);
lib/libc/resolv/res_findzonecut.c
274
int n, i, ancount, nscount;
lib/libc/resolv/res_findzonecut.c
299
n = do_query(statp, dname, class, ns_t_soa, resp, &msg);
lib/libc/resolv/res_findzonecut.c
300
if (n < 0) {
lib/libc/resolv/res_findzonecut.c
302
dname, p_class(class), n));
lib/libc/resolv/res_findzonecut.c
305
if (n > 0) {
lib/libc/resolv/res_findzonecut.c
307
sect = ns_s_max, n = 0;
lib/libc/resolv/res_findzonecut.c
313
sect = ns_s_an, n = ancount;
lib/libc/resolv/res_findzonecut.c
315
sect = ns_s_ns, n = nscount;
lib/libc/resolv/res_findzonecut.c
317
sect = ns_s_max, n = 0;
lib/libc/resolv/res_findzonecut.c
319
for (i = 0; i < n; i++) {
lib/libc/resolv/res_findzonecut.c
413
int n;
lib/libc/resolv/res_findzonecut.c
420
n = do_query(statp, zname, class, ns_t_ns, resp, &msg);
lib/libc/resolv/res_findzonecut.c
421
if (n != 0) {
lib/libc/resolv/res_findzonecut.c
423
zname, p_class(class), n));
lib/libc/resolv/res_findzonecut.c
452
int n;
lib/libc/resolv/res_findzonecut.c
457
n = do_query(statp, nsrr->name, class, ns_t_a,
lib/libc/resolv/res_findzonecut.c
459
if (n < 0) {
lib/libc/resolv/res_findzonecut.c
465
if (n > 0) {
lib/libc/resolv/res_findzonecut.c
479
n = do_query(statp, nsrr->name, class, ns_t_aaaa,
lib/libc/resolv/res_findzonecut.c
481
if (n < 0) {
lib/libc/resolv/res_findzonecut.c
487
if (n > 0) {
lib/libc/resolv/res_findzonecut.c
673
int i, n;
lib/libc/resolv/res_findzonecut.c
675
n = res_nmkquery(statp, ns_o_query, dname, class, qtype,
lib/libc/resolv/res_findzonecut.c
677
if (n < 0) {
lib/libc/resolv/res_findzonecut.c
681
n = res_nsend(statp, req, n, resp, NS_MAXMSG);
lib/libc/resolv/res_findzonecut.c
682
if (n < 0) {
lib/libc/resolv/res_findzonecut.c
686
if (n == 0) {
lib/libc/resolv/res_findzonecut.c
691
if (ns_initparse(resp, n, msg) < 0) {
lib/libc/resolv/res_findzonecut.c
695
n = 0;
lib/libc/resolv/res_findzonecut.c
703
n += (ns_rr_class(rr) == class &&
lib/libc/resolv/res_findzonecut.c
707
return (n);
lib/libc/resolv/res_init.c
160
int n;
lib/libc/resolv/res_init.c
282
for (n = 0; *cp && pp < statp->dnsrch + MAXDNSRCH; cp++) {
lib/libc/resolv/res_init.c
287
n = 1;
lib/libc/resolv/res_init.c
288
} else if (n) {
lib/libc/resolv/res_init.c
290
n = 0;
lib/libc/resolv/res_init.c
349
for (n = 0; *cp && pp < statp->dnsrch + MAXDNSRCH; cp++) {
lib/libc/resolv/res_init.c
352
n = 1;
lib/libc/resolv/res_init.c
353
} else if (n) {
lib/libc/resolv/res_init.c
355
n = 0;
lib/libc/resolv/res_init.c
415
n = *cp;
lib/libc/resolv/res_init.c
419
if (ISSORTMASK(n)) {
lib/libc/resolv/res_init.c
420
*cp++ = n;
lib/libc/resolv/res_init.c
426
n = *cp;
lib/libc/resolv/res_init.c
440
*cp = n;
lib/libc/resolv/res_mkquery.c
105
int n;
lib/libc/resolv/res_mkquery.c
140
if ((n = dn_comp(dname, cp, ep - cp - QFIXEDSZ, dnptrs,
lib/libc/resolv/res_mkquery.c
143
cp += n;
lib/libc/resolv/res_mkquery.c
156
n = dn_comp((const char *)data, cp, ep - cp - RRFIXEDSZ,
lib/libc/resolv/res_mkquery.c
158
if (n < 0)
lib/libc/resolv/res_mkquery.c
160
cp += n;
lib/libc/resolv/res_mkupdate.c
1061
int n;
lib/libc/resolv/res_mkupdate.c
1075
if (sscanf(s, "%d", &n) != 1 || n <= 0)
lib/libc/resolv/res_mkupdate.c
1076
n = -1;
lib/libc/resolv/res_mkupdate.c
1077
return (n);
lib/libc/resolv/res_mkupdate.c
190
if ((n = dn_comp(rrecp->r_dname, cp, buflen, dnptrs,
lib/libc/resolv/res_mkupdate.c
193
cp += n;
lib/libc/resolv/res_mkupdate.c
194
ShrinkBuffer(n + 2*INT16SZ);
lib/libc/resolv/res_mkupdate.c
236
n = dn_comp(buf2, cp, buflen, dnptrs, lastdnptr);
lib/libc/resolv/res_mkupdate.c
237
if (n < 0)
lib/libc/resolv/res_mkupdate.c
239
cp += n;
lib/libc/resolv/res_mkupdate.c
240
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
249
n = dn_comp(buf2, cp, buflen,
lib/libc/resolv/res_mkupdate.c
251
if (n < 0)
lib/libc/resolv/res_mkupdate.c
253
cp += n;
lib/libc/resolv/res_mkupdate.c
254
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
283
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
284
if (n < 0)
lib/libc/resolv/res_mkupdate.c
287
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
290
n = dn_comp(buf2, cp, buflen, dnptrs, lastdnptr);
lib/libc/resolv/res_mkupdate.c
291
if (n < 0)
lib/libc/resolv/res_mkupdate.c
293
cp += n;
lib/libc/resolv/res_mkupdate.c
294
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
297
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
298
if (n < 0)
lib/libc/resolv/res_mkupdate.c
301
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
303
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
304
if (n < 0)
lib/libc/resolv/res_mkupdate.c
307
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
309
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
310
if (n < 0)
lib/libc/resolv/res_mkupdate.c
313
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
317
n = dn_comp(buf2, cp, buflen, NULL, NULL);
lib/libc/resolv/res_mkupdate.c
318
if (n < 0)
lib/libc/resolv/res_mkupdate.c
320
cp += n;
lib/libc/resolv/res_mkupdate.c
321
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
324
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
325
if (n < 0)
lib/libc/resolv/res_mkupdate.c
327
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
333
n = dn_comp(buf2, cp, buflen, dnptrs,
lib/libc/resolv/res_mkupdate.c
335
if (n < 0)
lib/libc/resolv/res_mkupdate.c
337
cp += n;
lib/libc/resolv/res_mkupdate.c
338
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
364
if ((n = res_servicenumber(buf2)) <= 0)
lib/libc/resolv/res_mkupdate.c
367
if (n < MAXPORT) {
lib/libc/resolv/res_mkupdate.c
368
bm[n/8] |= (0x80>>(n%8));
lib/libc/resolv/res_mkupdate.c
369
if ((unsigned)n > maxbm)
lib/libc/resolv/res_mkupdate.c
370
maxbm = n;
lib/libc/resolv/res_mkupdate.c
382
if ((n = getstr_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
385
if (n > 255)
lib/libc/resolv/res_mkupdate.c
387
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
388
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
389
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
390
cp += n;
lib/libc/resolv/res_mkupdate.c
395
if ((n = getstr_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
401
if (n > 255)
lib/libc/resolv/res_mkupdate.c
403
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
404
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
405
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
406
cp += n;
lib/libc/resolv/res_mkupdate.c
411
if ((n = getstr_str(buf2, sizeof buf2, &startp,
lib/libc/resolv/res_mkupdate.c
414
if (n > 255)
lib/libc/resolv/res_mkupdate.c
416
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
417
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
418
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
419
cp += n;
lib/libc/resolv/res_mkupdate.c
423
if ((n = getstr_str(buf2, sizeof buf2, &startp,
lib/libc/resolv/res_mkupdate.c
426
if ((n > 255) || (n == 0))
lib/libc/resolv/res_mkupdate.c
428
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
429
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
430
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
431
cp += n;
lib/libc/resolv/res_mkupdate.c
432
if ((n = getstr_str(buf2, sizeof buf2, &startp,
lib/libc/resolv/res_mkupdate.c
434
n = 0;
lib/libc/resolv/res_mkupdate.c
435
if (n > 255)
lib/libc/resolv/res_mkupdate.c
437
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
438
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
439
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
440
cp += n;
lib/libc/resolv/res_mkupdate.c
443
if ((n = inet_nsap_addr((char *)startp, (u_char *)buf2, sizeof(buf2))) != 0) {
lib/libc/resolv/res_mkupdate.c
444
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
445
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
446
cp += n;
lib/libc/resolv/res_mkupdate.c
452
if ((n = loc_aton((char *)startp, (u_char *)buf2)) != 0) {
lib/libc/resolv/res_mkupdate.c
453
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
454
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
455
cp += n;
lib/libc/resolv/res_mkupdate.c
468
if ((n = getword_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
477
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
478
if (n < 0)
lib/libc/resolv/res_mkupdate.c
481
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
483
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
484
if (n <= 0 || n > 255)
lib/libc/resolv/res_mkupdate.c
487
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
528
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
529
if (n < 0)
lib/libc/resolv/res_mkupdate.c
532
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
536
n = dn_comp(buf2, cp, buflen, dnptrs, lastdnptr);
lib/libc/resolv/res_mkupdate.c
537
if (n < 0)
lib/libc/resolv/res_mkupdate.c
539
cp += n;
lib/libc/resolv/res_mkupdate.c
540
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
542
if ((n = getword_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
556
n = gethexnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
557
if (n < 0)
lib/libc/resolv/res_mkupdate.c
560
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
562
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
563
if (n < 0)
lib/libc/resolv/res_mkupdate.c
566
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
568
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
569
if (n < 0)
lib/libc/resolv/res_mkupdate.c
572
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
574
if ((n = getword_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
593
n = dn_comp(buf2, cp, buflen, NULL, NULL);
lib/libc/resolv/res_mkupdate.c
594
if (n < 0)
lib/libc/resolv/res_mkupdate.c
596
cp += n;
lib/libc/resolv/res_mkupdate.c
597
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
612
n = maxtype/NS_NXT_BITS+1;
lib/libc/resolv/res_mkupdate.c
613
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
614
memcpy(cp, data, n);
lib/libc/resolv/res_mkupdate.c
615
cp += n;
lib/libc/resolv/res_mkupdate.c
620
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
621
if (n < 0)
lib/libc/resolv/res_mkupdate.c
624
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
626
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
627
if (n < 0)
lib/libc/resolv/res_mkupdate.c
630
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
632
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
633
if (n < 0)
lib/libc/resolv/res_mkupdate.c
636
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
638
if ((n = getword_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
660
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
661
if (n < 0 || n > 65535)
lib/libc/resolv/res_mkupdate.c
664
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
666
n = getnum_str(&startp, endp);
lib/libc/resolv/res_mkupdate.c
667
if (n < 0 || n > 65535)
lib/libc/resolv/res_mkupdate.c
670
PUTSHORT(n, cp);
lib/libc/resolv/res_mkupdate.c
672
if ((n = getstr_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
676
if (n > 255)
lib/libc/resolv/res_mkupdate.c
678
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
679
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
680
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
681
cp += n;
lib/libc/resolv/res_mkupdate.c
683
if ((n = getstr_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
687
if (n > 255)
lib/libc/resolv/res_mkupdate.c
689
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
690
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
691
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
692
cp += n;
lib/libc/resolv/res_mkupdate.c
694
if ((n = getstr_str(buf2, sizeof buf2,
lib/libc/resolv/res_mkupdate.c
698
if (n > 255)
lib/libc/resolv/res_mkupdate.c
700
ShrinkBuffer(n+1);
lib/libc/resolv/res_mkupdate.c
701
*cp++ = n;
lib/libc/resolv/res_mkupdate.c
702
memcpy(cp, buf2, n);
lib/libc/resolv/res_mkupdate.c
703
cp += n;
lib/libc/resolv/res_mkupdate.c
707
n = dn_comp(buf2, cp, buflen, NULL, NULL);
lib/libc/resolv/res_mkupdate.c
708
if (n < 0)
lib/libc/resolv/res_mkupdate.c
710
cp += n;
lib/libc/resolv/res_mkupdate.c
711
ShrinkBuffer(n);
lib/libc/resolv/res_mkupdate.c
716
n = (u_int16_t)((cp - sp2) - INT16SZ);
lib/libc/resolv/res_mkupdate.c
717
PUTSHORT(n, sp2);
lib/libc/resolv/res_mkupdate.c
842
int c, n;
lib/libc/resolv/res_mkupdate.c
849
for (n = 0; *startpp <= endp; ) {
lib/libc/resolv/res_mkupdate.c
876
n = n * 16 + (c - '0');
lib/libc/resolv/res_mkupdate.c
878
n = n * 16 + (tolower(c) - 'a' + 10);
lib/libc/resolv/res_mkupdate.c
881
return (n + m);
lib/libc/resolv/res_mkupdate.c
890
int c, n;
lib/libc/resolv/res_mkupdate.c
894
for (n = 0; *startpp <= endp; ) {
lib/libc/resolv/res_mkupdate.c
91
int n, i, soanum, multiline;
lib/libc/resolv/res_mkupdate.c
920
n = n * 10 + (c - '0');
lib/libc/resolv/res_mkupdate.c
923
return (n + m);
lib/libc/resolv/res_query.c
117
int n;
lib/libc/resolv/res_query.c
128
n = res_nmkquery(statp, QUERY, name, class, type, NULL, 0, NULL,
lib/libc/resolv/res_query.c
131
if (n > 0 && (statp->_flags & RES_F_EDNS0ERR) == 0 &&
lib/libc/resolv/res_query.c
133
n = res_nopt(statp, n, buf, sizeof(buf), anslen);
lib/libc/resolv/res_query.c
134
rdata = &buf[n];
lib/libc/resolv/res_query.c
135
if (n > 0 && (statp->options & RES_NSID) != 0U) {
lib/libc/resolv/res_query.c
136
n = res_nopt_rdata(statp, n, buf, sizeof(buf), rdata,
lib/libc/resolv/res_query.c
141
if (n <= 0) {
lib/libc/resolv/res_query.c
147
return (n);
lib/libc/resolv/res_query.c
150
n = res_nsend(statp, buf, n, answer, anslen);
lib/libc/resolv/res_query.c
151
if (n < 0) {
lib/libc/resolv/res_query.c
167
return (n);
lib/libc/resolv/res_query.c
198
return (n);
lib/libc/resolv/res_query.c
363
int n, d;
lib/libc/resolv/res_query.c
375
n = strlen(name);
lib/libc/resolv/res_query.c
376
if (n >= MAXDNAME) {
lib/libc/resolv/res_query.c
380
n--;
lib/libc/resolv/res_query.c
381
if (n >= 0 && name[n] == '.') {
lib/libc/resolv/res_query.c
382
strncpy(nbuf, name, n);
lib/libc/resolv/res_query.c
383
nbuf[n] = '\0';
lib/libc/resolv/res_query.c
387
n = strlen(name);
lib/libc/resolv/res_query.c
389
if (n + d + 1 >= MAXDNAME) {
lib/libc/resolv/res_send.c
1006
n = poll(&pollfd, 1, polltimeout);
lib/libc/resolv/res_send.c
1009
if (n == 0) {
lib/libc/resolv/res_send.c
1014
if (n < 0) {
lib/libc/resolv/res_send.c
1210
int n;
lib/libc/resolv/res_send.c
1219
n = select(nfds, rfds, wfds, efds, tvp);
lib/libc/resolv/res_send.c
1224
return (n);
lib/libc/resolv/res_send.c
236
int n, ttype, tclass;
lib/libc/resolv/res_send.c
238
n = dn_expand(buf, eom, cp, tname, sizeof tname);
lib/libc/resolv/res_send.c
239
if (n < 0)
lib/libc/resolv/res_send.c
241
cp += n;
lib/libc/resolv/res_send.c
287
int n, ttype, tclass;
lib/libc/resolv/res_send.c
289
n = dn_expand(buf1, eom1, cp, tname, sizeof tname);
lib/libc/resolv/res_send.c
290
if (n < 0)
lib/libc/resolv/res_send.c
292
cp += n;
lib/libc/resolv/res_send.c
307
int gotsomewhere, terrno, tries, v_circuit, resplen, ns, n;
lib/libc/resolv/res_send.c
481
n = send_vc(statp, buf, buflen, ans, anssiz, &terrno,
lib/libc/resolv/res_send.c
483
if (n < 0)
lib/libc/resolv/res_send.c
485
if (n == 0)
lib/libc/resolv/res_send.c
487
resplen = n;
lib/libc/resolv/res_send.c
490
n = send_dg(statp,
lib/libc/resolv/res_send.c
496
if (n < 0)
lib/libc/resolv/res_send.c
498
if (n == 0)
lib/libc/resolv/res_send.c
502
resplen = n;
lib/libc/resolv/res_send.c
601
get_nsaddr(res_state statp, size_t n)
lib/libc/resolv/res_send.c
604
if (!statp->nsaddr_list[n].sin_family && EXT(statp).ext) {
lib/libc/resolv/res_send.c
610
return (struct sockaddr *)(void *)&EXT(statp).ext->nsaddrs[n];
lib/libc/resolv/res_send.c
617
return (struct sockaddr *)(void *)&statp->nsaddr_list[n];
lib/libc/resolv/res_send.c
630
int truncating, connreset, resplen, n;
lib/libc/resolv/res_send.c
741
while ((n = read(statp->_vcsock, (char *)cp, (int)len)) > 0) {
lib/libc/resolv/res_send.c
743
while ((n = _read(statp->_vcsock, (char *)cp, (int)len)) > 0) {
lib/libc/resolv/res_send.c
745
cp += n;
lib/libc/resolv/res_send.c
746
if ((len -= n) == 0)
lib/libc/resolv/res_send.c
749
if (n <= 0) {
lib/libc/resolv/res_send.c
791
while (len != 0 && (n = read(statp->_vcsock, (char *)cp, (int)len)) > 0){
lib/libc/resolv/res_send.c
793
while (len != 0 && (n = _read(statp->_vcsock, (char *)cp, (int)len)) > 0){
lib/libc/resolv/res_send.c
795
cp += n;
lib/libc/resolv/res_send.c
796
len -= n;
lib/libc/resolv/res_send.c
798
if (n <= 0) {
lib/libc/resolv/res_send.c
814
n = read(statp->_vcsock, junk,
lib/libc/resolv/res_send.c
816
n = _read(statp->_vcsock, junk,
lib/libc/resolv/res_send.c
819
if (n > 0)
lib/libc/resolv/res_send.c
820
len -= n;
lib/libc/resolv/res_send.c
863
int resplen, seconds, n, s;
lib/libc/resolv/res_send.c
992
n = _kevent(kq, &kv, 1, &kv, 1, &timeout);
lib/libc/resolv/res_send.c
996
n = pselect(s + 1, &dsmask, NULL, NULL, &timeout, NULL);
lib/libc/resolv/res_update.c
157
n = res_nmkupdate(statp, HEAD(zptr->z_rrlist),
lib/libc/resolv/res_update.c
159
DPRINTF(("res_mkupdate -> %d", n));
lib/libc/resolv/res_update.c
160
if (n < 0)
lib/libc/resolv/res_update.c
176
n = res_nsendsigned(statp, packet, n, key,
lib/libc/resolv/res_update.c
180
n = res_nsend(statp, packet, n, answer, sizeof answer);
lib/libc/resolv/res_update.c
181
if (n < 0) {
lib/libc/resolv/res_update.c
183
n, strerror(errno)));
lib/libc/resolv/res_update.c
98
int nzones = 0, nscount = 0, n;
lib/libc/rpc/clnt_dg.c
308
int kin_len, n, rpc_lock_value;
lib/libc/rpc/clnt_dg.c
419
n = _kevent(cu->cu_kq, &cu->cu_kin, kin_len, &kv, 1, &ts);
lib/libc/rpc/clnt_dg.c
423
if (n == 1) {
lib/libc/rpc/clnt_dg.c
447
if (n == -1 && errno != EINTR) {
lib/libc/stdio/fflush.c
103
int n, t;
lib/libc/stdio/fflush.c
112
n = fp->pub._p - p; /* write this much */
lib/libc/stdio/fflush.c
121
for (; n > 0; n -= t, p += t) {
lib/libc/stdio/fflush.c
122
t = _swrite(fp, (char *)p, n);
lib/libc/stdio/fflush.c
127
memmove(fp->pub._p, p, n);
lib/libc/stdio/fflush.c
128
fp->pub._p += n;
lib/libc/stdio/fflush.c
130
fp->pub._w -= n;
lib/libc/stdio/fgets.c
101
n -= len;
lib/libc/stdio/fgets.c
49
fgets(char *buf, int n, FILE *fp)
lib/libc/stdio/fgets.c
55
if (n <= 0) /* sanity check */
lib/libc/stdio/fgets.c
61
n--; /* leave space for NUL */
lib/libc/stdio/fgets.c
62
while (n != 0) {
lib/libc/stdio/fgets.c
85
if (len > n)
lib/libc/stdio/fgets.c
86
len = n;
lib/libc/stdio/fgetws.c
101
} while (wsp[-1] != L'\n' && n > 1 && (fp->pub._r > 0 ||
lib/libc/stdio/fgetws.c
119
fgetws(wchar_t * __restrict ws, int n, FILE * __restrict fp)
lib/libc/stdio/fgetws.c
121
return fgetws_l(ws, n, fp, __get_locale());
lib/libc/stdio/fgetws.c
46
fgetws_l(wchar_t * __restrict ws, int n, FILE * __restrict fp, locale_t locale)
lib/libc/stdio/fgetws.c
65
if (n <= 0) {
lib/libc/stdio/fgetws.c
82
fp->pub._r, n - 1, st);
lib/libc/stdio/fgetws.c
99
n -= nconv;
lib/libc/stdio/findfp.c
104
g->niobs = n;
lib/libc/stdio/findfp.c
106
while (--n >= 0)
lib/libc/stdio/findfp.c
118
int n;
lib/libc/stdio/findfp.c
128
for (fp = g->iobs, n = g->niobs; --n >= 0; fp++)
lib/libc/stdio/findfp.c
93
moreglue(int n)
lib/libc/stdio/findfp.c
99
g = (struct glue *)malloc(sizeof(*g) + ALIGNBYTES + n * sizeof(FILE));
lib/libc/stdio/fseek.c
223
n = fp->_up - fp->_bf._base;
lib/libc/stdio/fseek.c
224
curoff -= n;
lib/libc/stdio/fseek.c
225
n += fp->_ur;
lib/libc/stdio/fseek.c
227
n = fp->pub._p - fp->_bf._base;
lib/libc/stdio/fseek.c
228
curoff -= n;
lib/libc/stdio/fseek.c
229
n += fp->pub._r;
lib/libc/stdio/fseek.c
237
if (target >= curoff && target < curoff + n) {
lib/libc/stdio/fseek.c
241
fp->pub._r = n - o;
lib/libc/stdio/fseek.c
265
n = target - curoff;
lib/libc/stdio/fseek.c
266
if (n) {
lib/libc/stdio/fseek.c
267
if (__srefill(fp) || fp->pub._r < n)
lib/libc/stdio/fseek.c
269
fp->pub._p += n;
lib/libc/stdio/fseek.c
270
fp->pub._r -= n;
lib/libc/stdio/fseek.c
95
size_t n;
lib/libc/stdio/ftell.c
123
n = fp->pub._p - fp->_bf._base;
lib/libc/stdio/ftell.c
124
if (pos > OFF_MAX - n) {
lib/libc/stdio/ftell.c
128
pos += n;
lib/libc/stdio/ftell.c
86
size_t n;
lib/libc/stdio/fvwrite.c
64
#define COPY(n) (void)memcpy((void *)fp->pub._p, (void *)p, (size_t)(n))
lib/libc/stdio/fwalk.c
45
int n, ret;
lib/libc/stdio/fwalk.c
58
for (fp = g->iobs, n = g->niobs; --n >= 0; fp++)
lib/libc/stdio/fwrite.c
50
size_t n;
lib/libc/stdio/fwrite.c
55
uio.uio_resid = iov.iov_len = n = count * size;
lib/libc/stdio/fwrite.c
66
count = (n - uio.uio_resid) / size;
lib/libc/stdio/fwrite.c
74
size_t n;
lib/libc/stdio/fwrite.c
77
n = fwrite_unlocked(buf, size, count, fp);
lib/libc/stdio/fwrite.c
79
return (n);
lib/libc/stdio/getdelim.c
42
p2roundup(size_t n)
lib/libc/stdio/getdelim.c
45
if (!powerof2(n)) {
lib/libc/stdio/getdelim.c
46
n--;
lib/libc/stdio/getdelim.c
47
n |= n >> 1;
lib/libc/stdio/getdelim.c
48
n |= n >> 2;
lib/libc/stdio/getdelim.c
49
n |= n >> 4;
lib/libc/stdio/getdelim.c
50
n |= n >> 8;
lib/libc/stdio/getdelim.c
51
n |= n >> 16;
lib/libc/stdio/getdelim.c
53
n |= n >> 32;
lib/libc/stdio/getdelim.c
55
n++;
lib/libc/stdio/getdelim.c
57
return (n);
lib/libc/stdio/gets_s.c
102
ret = _gets_s(buf, n);
lib/libc/stdio/gets_s.c
49
_gets_s(char *buf, rsize_t n)
lib/libc/stdio/gets_s.c
55
for (s = buf, n--; (c = __sgetc(stdin)) != '\n' && n > 0 ; n--) {
lib/libc/stdio/gets_s.c
69
if (n == 0) {
lib/libc/stdio/gets_s.c
82
gets_s(char *buf, rsize_t n)
lib/libc/stdio/gets_s.c
88
} else if (n > RSIZE_MAX) {
lib/libc/stdio/gets_s.c
92
} else if (n == 0) {
lib/libc/stdio/printf-pos.c
245
int n; /* handy integer (short term usage) */
lib/libc/stdio/printf-pos.c
293
n = 0;
lib/libc/stdio/printf-pos.c
295
n = 10 * n + to_digit(ch);
lib/libc/stdio/printf-pos.c
299
types.nextarg = n;
lib/libc/stdio/printf-pos.c
433
int n; /* handy integer (short term usage) */
lib/libc/stdio/printf-pos.c
481
n = 0;
lib/libc/stdio/printf-pos.c
483
n = 10 * n + to_digit(ch);
lib/libc/stdio/printf-pos.c
487
types.nextarg = n;
lib/libc/stdio/printf-pos.c
624
int n, newsize = oldsize * 2;
lib/libc/stdio/printf-pos.c
637
for (n = oldsize; n < newsize; n++)
lib/libc/stdio/printf-pos.c
638
newtable[n] = T_UNUSED;
lib/libc/stdio/printf-pos.c
653
int n;
lib/libc/stdio/printf-pos.c
663
for (n = 1; n <= types->tablemax; n++) {
lib/libc/stdio/printf-pos.c
664
switch (types->table[n]) {
lib/libc/stdio/printf-pos.c
666
(*argtable) [n].intarg = va_arg(ap, int);
lib/libc/stdio/printf-pos.c
669
(*argtable) [n].pschararg = va_arg(ap, signed char *);
lib/libc/stdio/printf-pos.c
672
(*argtable) [n].pshortarg = va_arg(ap, short *);
lib/libc/stdio/printf-pos.c
675
(*argtable) [n].intarg = va_arg(ap, int);
lib/libc/stdio/printf-pos.c
678
(*argtable) [n].uintarg = va_arg(ap, unsigned int);
lib/libc/stdio/printf-pos.c
681
(*argtable) [n].pintarg = va_arg(ap, int *);
lib/libc/stdio/printf-pos.c
684
(*argtable) [n].longarg = va_arg(ap, long);
lib/libc/stdio/printf-pos.c
687
(*argtable) [n].ulongarg = va_arg(ap, unsigned long);
lib/libc/stdio/printf-pos.c
690
(*argtable) [n].plongarg = va_arg(ap, long *);
lib/libc/stdio/printf-pos.c
693
(*argtable) [n].longlongarg = va_arg(ap, long long);
lib/libc/stdio/printf-pos.c
696
(*argtable) [n].ulonglongarg = va_arg(ap, unsigned long long);
lib/libc/stdio/printf-pos.c
699
(*argtable) [n].plonglongarg = va_arg(ap, long long *);
lib/libc/stdio/printf-pos.c
702
(*argtable) [n].ptrdiffarg = va_arg(ap, ptrdiff_t);
lib/libc/stdio/printf-pos.c
705
(*argtable) [n].pptrdiffarg = va_arg(ap, ptrdiff_t *);
lib/libc/stdio/printf-pos.c
708
(*argtable) [n].sizearg = va_arg(ap, size_t);
lib/libc/stdio/printf-pos.c
711
(*argtable) [n].sizearg = va_arg(ap, ssize_t);
lib/libc/stdio/printf-pos.c
714
(*argtable) [n].pssizearg = va_arg(ap, ssize_t *);
lib/libc/stdio/printf-pos.c
717
(*argtable) [n].intmaxarg = va_arg(ap, intmax_t);
lib/libc/stdio/printf-pos.c
720
(*argtable) [n].uintmaxarg = va_arg(ap, uintmax_t);
lib/libc/stdio/printf-pos.c
723
(*argtable) [n].pintmaxarg = va_arg(ap, intmax_t *);
lib/libc/stdio/printf-pos.c
727
(*argtable) [n].doublearg = va_arg(ap, double);
lib/libc/stdio/printf-pos.c
732
(*argtable) [n].longdoublearg = va_arg(ap, long double);
lib/libc/stdio/printf-pos.c
736
(*argtable) [n].pchararg = va_arg(ap, char *);
lib/libc/stdio/printf-pos.c
739
(*argtable) [n].pvoidarg = va_arg(ap, void *);
lib/libc/stdio/printf-pos.c
742
(*argtable) [n].wintarg = va_arg(ap, wint_t);
lib/libc/stdio/printf-pos.c
745
(*argtable) [n].pwchararg = va_arg(ap, wchar_t *);
lib/libc/stdio/printf-pos.c
84
int n;
lib/libc/stdio/printf-pos.c
90
for (n = 0; n < STATIC_ARG_TBL_SIZE; n++)
lib/libc/stdio/printf-pos.c
91
types->table[n] = T_UNUSED;
lib/libc/stdio/printfcommon.h
118
int n;
lib/libc/stdio/printfcommon.h
121
n = (howmany >= PADSIZE) ? PADSIZE : howmany;
lib/libc/stdio/printfcommon.h
122
if (io_print(iop, with, n, locale))
lib/libc/stdio/printfcommon.h
124
howmany -= n;
lib/libc/stdio/printflocal.h
62
#define to_char(n) ((n) + '0')
lib/libc/stdio/snprintf.c
52
snprintf(char * __restrict str, size_t n, char const * __restrict fmt, ...)
lib/libc/stdio/snprintf.c
59
on = n;
lib/libc/stdio/snprintf.c
60
if (n != 0)
lib/libc/stdio/snprintf.c
61
n--;
lib/libc/stdio/snprintf.c
62
if (n > INT_MAX) {
lib/libc/stdio/snprintf.c
70
f._bf._size = f.pub._w = n;
lib/libc/stdio/snprintf.c
78
snprintf_l(char * __restrict str, size_t n, locale_t locale,
lib/libc/stdio/snprintf.c
87
on = n;
lib/libc/stdio/snprintf.c
88
if (n != 0)
lib/libc/stdio/snprintf.c
89
n--;
lib/libc/stdio/snprintf.c
90
if (n > INT_MAX) {
lib/libc/stdio/snprintf.c
98
f._bf._size = f.pub._w = n;
lib/libc/stdio/stdio.c
102
_swrite(FILE *fp, const char *buf, int n)
lib/libc/stdio/stdio.c
114
ret = (*fp->_write)(fp->_cookie, buf, n);
lib/libc/stdio/stdio.c
50
__sread(void *cookie, char *buf, int n)
lib/libc/stdio/stdio.c
54
return(_read(fp->pub._fileno, buf, (size_t)n));
lib/libc/stdio/stdio.c
58
__swrite(void *cookie, const char *buf, int n)
lib/libc/stdio/stdio.c
62
return (_write(fp->pub._fileno, buf, (size_t)n));
lib/libc/stdio/stdio.c
84
_sread(FILE *fp, char *buf, int n)
lib/libc/stdio/stdio.c
88
ret = (*fp->_read)(fp->_cookie, buf, n);
lib/libc/stdio/swprintf.c
35
swprintf(wchar_t * __restrict s, size_t n, const wchar_t * __restrict fmt, ...)
lib/libc/stdio/swprintf.c
41
ret = vswprintf(s, n, fmt, ap);
lib/libc/stdio/swprintf.c
48
swprintf_l(wchar_t * __restrict s, size_t n, locale_t locale,
lib/libc/stdio/swprintf.c
55
ret = vswprintf_l(s, n, locale, fmt, ap);
lib/libc/stdio/vfprintf.c
307
int n, n2; /* handy integer (short term usage) */
lib/libc/stdio/vfprintf.c
478
if ((n = fmt - cp) != 0) {
lib/libc/stdio/vfprintf.c
479
if ((unsigned)ret + n > INT_MAX) {
lib/libc/stdio/vfprintf.c
484
PRINT(cp, n);
lib/libc/stdio/vfprintf.c
485
ret += n;
lib/libc/stdio/vfprintf.c
555
n = 0;
lib/libc/stdio/vfprintf.c
557
n = 10 * n + to_digit(ch);
lib/libc/stdio/vfprintf.c
561
nextarg = n;
lib/libc/stdio/vfprintf.c
572
width = n;
lib/libc/stdio/vfprintf.c
982
n = grouping_print(&gs, &io,
lib/libc/stdio/vfprintf.c
984
if (n < 0)
lib/libc/stdio/vfprintf.c
986
cp += n;
lib/libc/stdio/vfscanf.c
131
int n;
lib/libc/stdio/vfscanf.c
136
if ((n = fp->pub._r) < width) {
lib/libc/stdio/vfscanf.c
137
sum += n;
lib/libc/stdio/vfscanf.c
138
width -= n;
lib/libc/stdio/vfscanf.c
139
fp->pub._p += n;
lib/libc/stdio/vfscanf.c
166
int n, nread;
lib/libc/stdio/vfscanf.c
170
n = 0;
lib/libc/stdio/vfscanf.c
175
n += nread;
lib/libc/stdio/vfscanf.c
177
if (n == 0)
lib/libc/stdio/vfscanf.c
179
return (n);
lib/libc/stdio/vfscanf.c
186
int n;
lib/libc/stdio/vfscanf.c
189
n = 0;
lib/libc/stdio/vfscanf.c
191
n++, fp->pub._r--, fp->pub._p++;
lib/libc/stdio/vfscanf.c
195
if (n == 0)
lib/libc/stdio/vfscanf.c
213
n = p - p0;
lib/libc/stdio/vfscanf.c
214
if (n == 0)
lib/libc/stdio/vfscanf.c
218
return (n);
lib/libc/stdio/vfscanf.c
227
int n, nread;
lib/libc/stdio/vfscanf.c
230
n = 0;
lib/libc/stdio/vfscanf.c
234
n += nread;
lib/libc/stdio/vfscanf.c
241
n += nread;
lib/libc/stdio/vfscanf.c
245
if (n == 0)
lib/libc/stdio/vfscanf.c
249
return (n);
lib/libc/stdio/vfscanf.c
256
int n;
lib/libc/stdio/vfscanf.c
259
n = 0;
lib/libc/stdio/vfscanf.c
261
n++, fp->pub._r--, fp->pub._p++;
lib/libc/stdio/vfscanf.c
278
n = p - p0;
lib/libc/stdio/vfscanf.c
280
return (n);
lib/libc/stdio/vfscanf.c
288
int n, nread;
lib/libc/stdio/vfscanf.c
291
n = 0;
lib/libc/stdio/vfscanf.c
295
n += nread;
lib/libc/stdio/vfscanf.c
302
n += nread;
lib/libc/stdio/vfscanf.c
308
return (n);
lib/libc/stdio/vfscanf.c
823
int c, n, v, i;
lib/libc/stdio/vfscanf.c
852
n = *fmt++; /* and examine the next */
lib/libc/stdio/vfscanf.c
853
switch (n) {
lib/libc/stdio/vfscanf.c
877
n = *fmt;
lib/libc/stdio/vfscanf.c
878
if (n == ']'
lib/libc/stdio/vfscanf.c
879
|| (table->__collate_load_error ? n < c :
lib/libc/stdio/vfscanf.c
880
__collate_range_cmp(n, c) < 0
lib/libc/stdio/vfscanf.c
891
} while (c < n);
lib/libc/stdio/vfscanf.c
895
__collate_range_cmp(i, n) <= 0
lib/libc/stdio/vfscanf.c
900
c = n;
lib/libc/stdio/vfscanf.c
920
c = n;
lib/libc/stdio/vfwprintf.c
1045
n = grouping_print(&gs, &io,
lib/libc/stdio/vfwprintf.c
1047
if (n < 0)
lib/libc/stdio/vfwprintf.c
1049
cp += n;
lib/libc/stdio/vfwprintf.c
386
int n, n2; /* handy integer (short term usage) */
lib/libc/stdio/vfwprintf.c
546
if ((n = fmt - cp) != 0) {
lib/libc/stdio/vfwprintf.c
547
if ((unsigned)ret + n > INT_MAX) {
lib/libc/stdio/vfwprintf.c
552
PRINT(cp, n);
lib/libc/stdio/vfwprintf.c
553
ret += n;
lib/libc/stdio/vfwprintf.c
623
n = 0;
lib/libc/stdio/vfwprintf.c
625
n = 10 * n + to_digit(ch);
lib/libc/stdio/vfwprintf.c
629
nextarg = n;
lib/libc/stdio/vfwprintf.c
640
width = n;
lib/libc/stdio/vfwscanf.c
146
int n;
lib/libc/stdio/vfwscanf.c
148
n = 0;
lib/libc/stdio/vfwscanf.c
157
n++;
lib/libc/stdio/vfwscanf.c
159
if (n == 0)
lib/libc/stdio/vfwscanf.c
161
return (n);
lib/libc/stdio/vfwscanf.c
168
int n;
lib/libc/stdio/vfwscanf.c
170
n = 0;
lib/libc/stdio/vfwscanf.c
174
n++;
lib/libc/stdio/vfwscanf.c
176
if (n == 0)
lib/libc/stdio/vfwscanf.c
178
return (n);
lib/libc/stdio/vfwscanf.c
188
int n;
lib/libc/stdio/vfwscanf.c
190
n = 0;
lib/libc/stdio/vfwscanf.c
200
n++;
lib/libc/stdio/vfwscanf.c
206
return (n);
lib/libc/stdio/vfwscanf.c
215
int n;
lib/libc/stdio/vfwscanf.c
218
n = 0;
lib/libc/stdio/vfwscanf.c
221
n++;
lib/libc/stdio/vfwscanf.c
231
n = wcp - wcp0;
lib/libc/stdio/vfwscanf.c
232
if (n == 0)
lib/libc/stdio/vfwscanf.c
236
return (n);
lib/libc/stdio/vsnprintf.c
50
vsnprintf_l(char * __restrict str, size_t n, locale_t locale,
lib/libc/stdio/vsnprintf.c
59
on = n;
lib/libc/stdio/vsnprintf.c
60
if (n != 0)
lib/libc/stdio/vsnprintf.c
61
n--;
lib/libc/stdio/vsnprintf.c
62
if (n > INT_MAX) {
lib/libc/stdio/vsnprintf.c
68
if (n == 0) {
lib/libc/stdio/vsnprintf.c
72
n = 1;
lib/libc/stdio/vsnprintf.c
76
f._bf._size = f.pub._w = n;
lib/libc/stdio/vsnprintf.c
83
vsnprintf(char * __restrict str, size_t n, const char * __restrict fmt,
lib/libc/stdio/vsnprintf.c
86
return vsnprintf_l(str, n, __get_locale(), fmt, ap);
lib/libc/stdio/vswprintf.c
107
vswprintf(wchar_t * __restrict s, size_t n, const wchar_t * __restrict fmt,
lib/libc/stdio/vswprintf.c
110
return vswprintf_l(s, n, __get_locale(), fmt, ap);
lib/libc/stdio/vswprintf.c
47
vswprintf_l(wchar_t * __restrict s, size_t n, locale_t locale,
lib/libc/stdio/vswprintf.c
58
if (n == 0) {
lib/libc/stdio/vswprintf.c
62
if (n - 1 > INT_MAX) {
lib/libc/stdio/vswprintf.c
91
nwc = mbsrtowcs_l(s, (const char **)&mbp, n, &mbs, locale);
lib/libc/stdio/vswprintf.c
98
if (nwc == n) {
lib/libc/stdio/vswprintf.c
99
s[n - 1] = L'\0';
lib/libc/stdio/wbuf.c
49
int n;
lib/libc/stdio/wbuf.c
74
n = fp->pub._p - fp->_bf._base;
lib/libc/stdio/wbuf.c
75
if (n >= fp->_bf._size) {
lib/libc/stdio/wbuf.c
78
n = 0;
lib/libc/stdio/wbuf.c
82
if (++n == fp->_bf._size || (fp->pub._flags & __SLBF && c == '\n'))
lib/libc/stdio/xprintf.c
137
int n;
lib/libc/stdio/xprintf.c
146
if ((n = (howmany)) > 0) {
lib/libc/stdio/xprintf.c
147
while (n > PADSIZE) {
lib/libc/stdio/xprintf.c
149
n -= PADSIZE;
lib/libc/stdio/xprintf.c
151
ret += __printf_puts(io, with, n);
lib/libc/stdio/xprintf.c
174
__printf_arginfo_pct(const struct printf_info *pi __unused, size_t n __unused,
lib/libc/stdio/xprintf.c
193
__printf_arginfo_n(const struct printf_info *pi __unused, size_t n, int *argt)
lib/libc/stdio/xprintf.c
196
assert(n >= 1);
lib/libc/stdio/xprintf.c
278
int n;
lib/libc/stdio/xprintf.c
366
n = 0;
lib/libc/stdio/xprintf.c
368
n *= 10;
lib/libc/stdio/xprintf.c
369
n += to_digit(*fmt);
lib/libc/stdio/xprintf.c
375
nextarg = n;
lib/libc/stdio/xprintf.c
378
pi->width = n;
lib/libc/stdio/xprintf.c
558
n = printf_tbl[pi->spec].render(
lib/libc/stdio/xprintf.c
560
if (n < 0)
lib/libc/stdio/xprintf.c
563
ret += n;
lib/libc/stdio/xprintf_errno.c
42
__printf_arginfo_errno(const struct printf_info *pi __unused, size_t n,
lib/libc/stdio/xprintf_errno.c
46
assert(n >= 1);
lib/libc/stdio/xprintf_float.c
122
__printf_arginfo_float(const struct printf_info *pi, size_t n, int *argt)
lib/libc/stdio/xprintf_float.c
124
assert (n > 0);
lib/libc/stdio/xprintf_float.c
81
#define to_char(n) ((n) + '0')
lib/libc/stdio/xprintf_hexdump.c
40
size_t n, int *argt)
lib/libc/stdio/xprintf_hexdump.c
43
assert(n >= 2);
lib/libc/stdio/xprintf_int.c
233
__printf_arginfo_int(const struct printf_info *pi, size_t n, int *argt)
lib/libc/stdio/xprintf_int.c
235
assert (n > 0);
lib/libc/stdio/xprintf_int.c
447
__printf_arginfo_ptr(const struct printf_info *pi __unused, size_t n, int *argt)
lib/libc/stdio/xprintf_int.c
450
assert (n > 0);
lib/libc/stdio/xprintf_int.c
66
#define to_char(n) ((n) + '0')
lib/libc/stdio/xprintf_quote.c
42
__printf_arginfo_quote(const struct printf_info *pi __unused, size_t n,
lib/libc/stdio/xprintf_quote.c
46
assert(n >= 1);
lib/libc/stdio/xprintf_str.c
110
__printf_arginfo_str(const struct printf_info *pi, size_t n, int *argt)
lib/libc/stdio/xprintf_str.c
113
assert (n > 0);
lib/libc/stdio/xprintf_str.c
153
__printf_arginfo_chr(const struct printf_info *pi, size_t n, int *argt)
lib/libc/stdio/xprintf_str.c
156
assert (n > 0);
lib/libc/stdio/xprintf_time.c
46
__printf_arginfo_time(const struct printf_info *pi __unused, size_t n,
lib/libc/stdio/xprintf_time.c
50
assert(n >= 1);
lib/libc/stdio/xprintf_vis.c
41
__printf_arginfo_vis(const struct printf_info *pi __unused, size_t n,
lib/libc/stdio/xprintf_vis.c
45
assert(n >= 1);
lib/libc/stdlib/atexit.c
173
int n, ni, has_phdr;
lib/libc/stdlib/atexit.c
187
for (n = p->ind; --n >= 0;) {
lib/libc/stdlib/atexit.c
188
if (p->fns[n].fn_type == ATEXIT_FN_EMPTY)
lib/libc/stdlib/atexit.c
190
fn = p->fns[n];
lib/libc/stdlib/atexit.c
202
p->fns[n].fn_type = ATEXIT_FN_EMPTY;
lib/libc/stdlib/dmalloc.c
537
size_t n = (size_t)*bytes;
lib/libc/stdlib/dmalloc.c
542
if (n < 128) {
lib/libc/stdlib/dmalloc.c
543
if (n < 16) {
lib/libc/stdlib/dmalloc.c
544
*bytes = n = (n + 7) & ~7;
lib/libc/stdlib/dmalloc.c
546
return(n / 8 - 1); /* 8 byte chunks, 2 zones */
lib/libc/stdlib/dmalloc.c
548
*bytes = n = (n + 15) & ~15;
lib/libc/stdlib/dmalloc.c
550
return(n / 16 + 2); /* 16 byte chunks, 8 zones */
lib/libc/stdlib/dmalloc.c
553
if (n < 4096) {
lib/libc/stdlib/dmalloc.c
562
while (n >= x) {
lib/libc/stdlib/dmalloc.c
569
*bytes = n = roundup2(n, c);
lib/libc/stdlib/dmalloc.c
571
return (i + n / c - CHUNKFACTOR);
lib/libc/stdlib/dmalloc.c
573
*bytes = n = (n + c - 1) & ~(c - 1);
lib/libc/stdlib/dmalloc.c
575
return (n / c + i);
lib/libc/stdlib/dmalloc.c
577
if (n < 256) {
lib/libc/stdlib/dmalloc.c
578
*bytes = n = (n + 15) & ~15;
lib/libc/stdlib/dmalloc.c
580
return(n / (CHUNKINGLO*2) + CHUNKINGLO*1 - 1);
lib/libc/stdlib/dmalloc.c
582
if (n < 8192) {
lib/libc/stdlib/dmalloc.c
583
if (n < 512) {
lib/libc/stdlib/dmalloc.c
584
*bytes = n = (n + 31) & ~31;
lib/libc/stdlib/dmalloc.c
586
return(n / (CHUNKINGLO*4) + CHUNKINGLO*2 - 1);
lib/libc/stdlib/dmalloc.c
588
if (n < 1024) {
lib/libc/stdlib/dmalloc.c
589
*bytes = n = (n + 63) & ~63;
lib/libc/stdlib/dmalloc.c
591
return(n / (CHUNKINGLO*8) + CHUNKINGLO*3 - 1);
lib/libc/stdlib/dmalloc.c
593
if (n < 2048) {
lib/libc/stdlib/dmalloc.c
594
*bytes = n = (n + 127) & ~127;
lib/libc/stdlib/dmalloc.c
596
return(n / (CHUNKINGLO*16) + CHUNKINGLO*4 - 1);
lib/libc/stdlib/dmalloc.c
598
if (n < 4096) {
lib/libc/stdlib/dmalloc.c
599
*bytes = n = (n + 255) & ~255;
lib/libc/stdlib/dmalloc.c
601
return(n / (CHUNKINGLO*32) + CHUNKINGLO*5 - 1);
lib/libc/stdlib/dmalloc.c
603
*bytes = n = (n + 511) & ~511;
lib/libc/stdlib/dmalloc.c
605
return(n / (CHUNKINGLO*64) + CHUNKINGLO*6 - 1);
lib/libc/stdlib/dmalloc.c
607
if (n < 16384) {
lib/libc/stdlib/dmalloc.c
608
*bytes = n = (n + 1023) & ~1023;
lib/libc/stdlib/dmalloc.c
610
return(n / (CHUNKINGLO*128) + CHUNKINGLO*7 - 1);
lib/libc/stdlib/dmalloc.c
612
if (n < 32768) { /* 16384-32767 */
lib/libc/stdlib/dmalloc.c
613
*bytes = n = (n + 2047) & ~2047;
lib/libc/stdlib/dmalloc.c
615
return(n / (CHUNKINGLO*256) + CHUNKINGLO*8 - 1);
lib/libc/stdlib/dmalloc.c
617
if (n < 65536) {
lib/libc/stdlib/dmalloc.c
618
*bytes = n = (n + 4095) & ~4095; /* 32768-65535 */
lib/libc/stdlib/dmalloc.c
620
return(n / (CHUNKINGLO*512) + CHUNKINGLO*9 - 1);
lib/libc/stdlib/dmalloc.c
627
while (n >= x) {
lib/libc/stdlib/dmalloc.c
634
*bytes = n = (n + c - 1) & ~(c - 1);
lib/libc/stdlib/dmalloc.c
636
return (n / c + i);
lib/libc/stdlib/merge.c
256
setup(u_char *list1, u_char *list2, size_t n, size_t size,
lib/libc/stdlib/merge.c
263
if (n <= 5) {
lib/libc/stdlib/merge.c
264
insertionsort(list1, n, size, cmp);
lib/libc/stdlib/merge.c
265
*EVAL(list2) = (u_char*) list2 + n*size;
lib/libc/stdlib/merge.c
272
i = 4 + (n & 1);
lib/libc/stdlib/merge.c
273
insertionsort(list1 + (n - i) * size, i, size, cmp);
lib/libc/stdlib/merge.c
274
last = list1 + size * (n - i);
lib/libc/stdlib/merge.c
275
*EVAL(list2 + (last - list1)) = list2 + n * size;
lib/libc/stdlib/merge.c
311
p2 = *EVAL(p2) = list2 + n*size;
lib/libc/stdlib/merge.c
328
insertionsort(u_char *a, size_t n, size_t size,
lib/libc/stdlib/merge.c
334
for (ai = a+size; --n >= 1; ai += size)
lib/libc/stdlib/nmalloc.c
700
size_t n = (unsigned int)*bytes; /* unsigned for shift opt */
lib/libc/stdlib/nmalloc.c
712
if (n < 16) {
lib/libc/stdlib/nmalloc.c
713
*bytes = n = (n + 7) & ~7;
lib/libc/stdlib/nmalloc.c
715
return(n / 8 - 1); /* 8 byte chunks, 2 zones */
lib/libc/stdlib/nmalloc.c
718
if (n < 128) {
lib/libc/stdlib/nmalloc.c
719
*bytes = n = (n + 15) & ~15;
lib/libc/stdlib/nmalloc.c
721
return(n / 16 + 2); /* 16 byte chunks, 8 zones */
lib/libc/stdlib/nmalloc.c
724
if (n < 256) {
lib/libc/stdlib/nmalloc.c
725
*bytes = n = (n + 15) & ~15;
lib/libc/stdlib/nmalloc.c
727
return(n / 16 + 7);
lib/libc/stdlib/nmalloc.c
729
if (n < 8192) {
lib/libc/stdlib/nmalloc.c
730
if (n < 512) {
lib/libc/stdlib/nmalloc.c
731
*bytes = n = (n + 31) & ~31;
lib/libc/stdlib/nmalloc.c
733
return(n / 32 + 15);
lib/libc/stdlib/nmalloc.c
735
if (n < 1024) {
lib/libc/stdlib/nmalloc.c
736
*bytes = n = (n + 63) & ~63;
lib/libc/stdlib/nmalloc.c
738
return(n / 64 + 23);
lib/libc/stdlib/nmalloc.c
740
if (n < 2048) {
lib/libc/stdlib/nmalloc.c
741
*bytes = n = (n + 127) & ~127;
lib/libc/stdlib/nmalloc.c
743
return(n / 128 + 31);
lib/libc/stdlib/nmalloc.c
745
if (n < 4096) {
lib/libc/stdlib/nmalloc.c
746
*bytes = n = (n + 255) & ~255;
lib/libc/stdlib/nmalloc.c
748
return(n / 256 + 39);
lib/libc/stdlib/nmalloc.c
750
*bytes = n = (n + 511) & ~511;
lib/libc/stdlib/nmalloc.c
752
return(n / 512 + 47);
lib/libc/stdlib/nmalloc.c
755
if (n < 16384) {
lib/libc/stdlib/nmalloc.c
756
*bytes = n = (n + 1023) & ~1023;
lib/libc/stdlib/nmalloc.c
758
return(n / 1024 + 55);
lib/libc/stdlib/nmalloc.c
762
if (n < 32768) {
lib/libc/stdlib/nmalloc.c
763
*bytes = n = (n + 2047) & ~2047;
lib/libc/stdlib/nmalloc.c
765
return(n / 2048 + 63);
lib/libc/stdlib/nmalloc.c
768
_mpanic("Unexpected byte count %zu", n);
lib/libc/stdlib/qsort.c
102
qsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
lib/libc/stdlib/qsort.c
106
qsort(void *a, size_t n, size_t es, cmp_t *cmp)
lib/libc/stdlib/qsort.c
116
if (n < 7) {
lib/libc/stdlib/qsort.c
117
for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
lib/libc/stdlib/qsort.c
124
pm = (char *)a + (n / 2) * es;
lib/libc/stdlib/qsort.c
125
if (n > 7) {
lib/libc/stdlib/qsort.c
127
pn = (char *)a + (n - 1) * es;
lib/libc/stdlib/qsort.c
128
if (n > 40) {
lib/libc/stdlib/qsort.c
129
d = (n / 8) * es;
lib/libc/stdlib/qsort.c
139
pc = pd = (char *)a + (n - 1) * es;
lib/libc/stdlib/qsort.c
165
for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
lib/libc/stdlib/qsort.c
173
pn = (char *)a + n * es;
lib/libc/stdlib/qsort.c
187
n = r / es;
lib/libc/stdlib/qsort.c
49
#define swapcode(TYPE, parmi, parmj, n) { \
lib/libc/stdlib/qsort.c
50
long i = (n) / sizeof (TYPE); \
lib/libc/stdlib/qsort.c
64
swapfunc(char *a, char *b, int n, int swaptype)
lib/libc/stdlib/qsort.c
67
swapcode(long, a, b, n)
lib/libc/stdlib/qsort.c
69
swapcode(char, a, b, n)
lib/libc/stdlib/qsort.c
80
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
lib/libc/stdlib/radixsort.c
100
sradixsort(const u_char **a, int n, const u_char *tab, u_int endch)
lib/libc/stdlib/radixsort.c
107
if (n < THRESHOLD)
lib/libc/stdlib/radixsort.c
108
simplesort(a, n, 0, tr, endch);
lib/libc/stdlib/radixsort.c
110
if ((ta = malloc(n * sizeof(a))) == NULL)
lib/libc/stdlib/radixsort.c
112
r_sort_b(a, ta, n, 0, tr, endch);
lib/libc/stdlib/radixsort.c
119
#define pop(a, n, i) a = (--sp)->sa, n = sp->sn, i = sp->si
lib/libc/stdlib/radixsort.c
120
#define push(a, n, i) sp->sa = a, sp->sn = n, (sp++)->si = i
lib/libc/stdlib/radixsort.c
125
r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch)
lib/libc/stdlib/radixsort.c
136
push(a, n, i);
lib/libc/stdlib/radixsort.c
138
pop(a, n, i);
lib/libc/stdlib/radixsort.c
139
if (n < THRESHOLD) {
lib/libc/stdlib/radixsort.c
140
simplesort(a, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
143
an = a + n;
lib/libc/stdlib/radixsort.c
157
r_sort_a(a, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
167
if (nc == 1 && count[bmin] == n) {
lib/libc/stdlib/radixsort.c
168
push(a, n, i+1);
lib/libc/stdlib/radixsort.c
223
r_sort_b(const u_char **a, const u_char **ta, int n, int i, const u_char *tr,
lib/libc/stdlib/radixsort.c
234
push(a, n, i);
lib/libc/stdlib/radixsort.c
236
pop(a, n, i);
lib/libc/stdlib/radixsort.c
237
if (n < THRESHOLD) {
lib/libc/stdlib/radixsort.c
238
simplesort(a, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
244
for (ak = a + n; --ak >= a;) {
lib/libc/stdlib/radixsort.c
253
r_sort_b(a, ta, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
265
top[255] = a + n;
lib/libc/stdlib/radixsort.c
284
for (ak = ta + n, ai = a+n; ak > ta;) /* Copy to temp. */
lib/libc/stdlib/radixsort.c
286
for (ak = ta+n; --ak >= ta;) /* Deal to piles. */
lib/libc/stdlib/radixsort.c
293
simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch)
lib/libc/stdlib/radixsort.c
298
for (ak = a+1; --n >= 1; ak++)
lib/libc/stdlib/radixsort.c
88
radixsort(const u_char **a, int n, const u_char *tab, u_int endch)
lib/libc/stdlib/radixsort.c
95
r_sort_a(a, n, 0, tr, endch);
lib/libc/stdlib/random.c
274
size_t n;
lib/libc/stdlib/random.c
287
n = _read(fd, (void *)state, len);
lib/libc/stdlib/random.c
289
if ((ssize_t)n < 0)
lib/libc/stdlib/random.c
290
n = 0;
lib/libc/stdlib/random.c
296
n = n & ~15;
lib/libc/stdlib/random.c
297
if (n < len) {
lib/libc/stdlib/random.c
298
size_t r = len - n;
lib/libc/stdlib/random.c
299
if (sysctlbyname("kern.random", (char *)state + n,
lib/libc/stdlib/random.c
301
n += r;
lib/libc/stdlib/random.c
311
n = n & ~15;
lib/libc/stdlib/random.c
312
if (n < len) {
lib/libc/stdlib/random.c
355
initstate(unsigned long seed, char *arg_state, long n)
lib/libc/stdlib/random.c
364
if (n < BREAK_0) {
lib/libc/stdlib/random.c
366
"random: not enough state (%ld bytes); ignored.\n", n);
lib/libc/stdlib/random.c
369
if (n < BREAK_1) {
lib/libc/stdlib/random.c
373
} else if (n < BREAK_2) {
lib/libc/stdlib/random.c
377
} else if (n < BREAK_3) {
lib/libc/stdlib/random.c
381
} else if (n < BREAK_4) {
lib/libc/stdtime/strftime.c
536
_conv(const int n, const char * const format, char * const pt,
lib/libc/stdtime/strftime.c
541
snprintf(buf, sizeof(buf), format, n);
lib/libc/stdtime/strptime.c
484
long n;
lib/libc/stdtime/strptime.c
489
n = strtol_l(buf, &cp, 10, locale);
lib/libc/stdtime/strptime.c
490
if (errno == ERANGE || (long)(t = n) != n) {
lib/libc/string/memccpy.c
36
memccpy(void *t, const void *f, int c, size_t n)
lib/libc/string/memccpy.c
39
if (n) {
lib/libc/string/memccpy.c
46
} while (--n != 0);
lib/libc/string/memchr.c
39
memchr(const void *s, int c, size_t n)
lib/libc/string/memchr.c
41
if (n != 0) {
lib/libc/string/memchr.c
47
} while (--n != 0);
lib/libc/string/memcmp.c
42
memcmp(const void *s1, const void *s2, size_t n)
lib/libc/string/memcmp.c
44
if (n != 0) {
lib/libc/string/memcmp.c
50
} while (--n != 0);
lib/libc/string/memrchr.c
28
memrchr(const void *s, int c, size_t n)
lib/libc/string/memrchr.c
32
if (n != 0) {
lib/libc/string/memrchr.c
33
cp = (unsigned char *)s + n;
lib/libc/string/memrchr.c
37
} while (--n != 0);
lib/libc/string/memset_s.c
36
memset_s(void *s, rsize_t smax, int c, rsize_t n)
lib/libc/string/memset_s.c
44
lim = n < smax ? n : smax;
lib/libc/string/memset_s.c
52
} else if (n > RSIZE_MAX) {
lib/libc/string/memset_s.c
57
if (n > smax) {
lib/libc/string/stpncpy.c
32
stpncpy(char * __restrict dst, const char * __restrict src, size_t n)
lib/libc/string/stpncpy.c
35
for (; n--; dst++, src++) {
lib/libc/string/stpncpy.c
38
while (n--)
lib/libc/string/strcasecmp.c
62
strncasecmp_l(const char *s1, const char *s2, size_t n, locale_t locale)
lib/libc/string/strcasecmp.c
65
if (n != 0) {
lib/libc/string/strcasecmp.c
75
} while (--n != 0);
lib/libc/string/strcasecmp.c
81
strncasecmp(const char *s1, const char *s2, size_t n)
lib/libc/string/strcasecmp.c
83
return strncasecmp_l(s1, s2, n, __get_locale());
lib/libc/string/strlcat.c
36
size_t n = siz;
lib/libc/string/strlcat.c
40
while (n-- != 0 && *d != '\0')
lib/libc/string/strlcat.c
43
n = siz - dlen;
lib/libc/string/strlcat.c
45
if (n == 0)
lib/libc/string/strlcat.c
48
if (n != 1) {
lib/libc/string/strlcat.c
50
n--;
lib/libc/string/strlcpy.c
34
size_t n = siz;
lib/libc/string/strlcpy.c
37
if (n != 0) {
lib/libc/string/strlcpy.c
38
while (--n != 0) {
lib/libc/string/strlcpy.c
45
if (n == 0) {
lib/libc/string/strncat.c
44
strncat(char * __restrict dst, const char * __restrict src, size_t n)
lib/libc/string/strncat.c
46
if (n != 0) {
lib/libc/string/strncat.c
56
} while (--n != 0);
lib/libc/string/strncmp.c
36
strncmp(const char *s1, const char *s2, size_t n)
lib/libc/string/strncmp.c
39
if (n == 0)
lib/libc/string/strncmp.c
47
} while (--n != 0);
lib/libc/string/strncpy.c
43
strncpy(char * __restrict dst, const char * __restrict src, size_t n)
lib/libc/string/strncpy.c
45
if (n != 0) {
lib/libc/string/strncpy.c
52
while (--n != 0)
lib/libc/string/strncpy.c
56
} while (--n != 0);
lib/libc/string/strndup.c
39
strndup(const char *str, size_t n)
lib/libc/string/strndup.c
44
len = strnlen(str, n);
lib/libc/string/strsignal.c
105
n = strlcpy(ebuf,
lib/libc/string/strsignal.c
113
n = strlcpy(ebuf,
lib/libc/string/strsignal.c
132
p = (ebuf + n);
lib/libc/string/strsignal.c
92
size_t n;
lib/libc/string/swab.c
42
int n;
lib/libc/string/swab.c
47
n = len >> 1;
lib/libc/string/swab.c
52
for (; n & 0x7; --n)
lib/libc/string/swab.c
54
for (n >>= 3; n > 0; --n) {
lib/libc/string/timingsafe_bcmp.c
21
timingsafe_bcmp(const void *b1, const void *b2, size_t n)
lib/libc/string/timingsafe_bcmp.c
26
for (; n > 0; n--)
lib/libc/string/wcpncpy.c
32
wcpncpy(wchar_t * __restrict dst, const wchar_t * __restrict src, size_t n)
lib/libc/string/wcpncpy.c
35
for (; n--; dst++, src++) {
lib/libc/string/wcpncpy.c
38
while (n--)
lib/libc/string/wcslcat.c
46
size_t n = siz;
lib/libc/string/wcslcat.c
50
while (*d != '\0' && n-- != 0)
lib/libc/string/wcslcat.c
53
n = siz - dlen;
lib/libc/string/wcslcat.c
55
if (n == 0)
lib/libc/string/wcslcat.c
58
if (n != 1) {
lib/libc/string/wcslcat.c
60
n--;
lib/libc/string/wcslcpy.c
44
size_t n = siz;
lib/libc/string/wcslcpy.c
47
if (n != 0 && --n != 0) {
lib/libc/string/wcslcpy.c
51
} while (--n != 0);
lib/libc/string/wcslcpy.c
55
if (n == 0) {
lib/libc/string/wcsncasecmp.c
33
wcsncasecmp(const wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wcsncasecmp.c
37
if (n == 0)
lib/libc/string/wcsncasecmp.c
44
if (--n == 0)
lib/libc/string/wcsncat.c
33
wcsncat(wchar_t * __restrict s1, const wchar_t * __restrict s2, size_t n)
lib/libc/string/wcsncat.c
44
while (*r && n) {
lib/libc/string/wcsncat.c
46
n--;
lib/libc/string/wcsncmp.c
35
wcsncmp(const wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wcsncmp.c
38
if (n == 0)
lib/libc/string/wcsncmp.c
48
} while (--n != 0);
lib/libc/string/wcsncpy.c
42
wcsncpy(wchar_t * __restrict dst, const wchar_t * __restrict src, size_t n)
lib/libc/string/wcsncpy.c
44
if (n != 0) {
lib/libc/string/wcsncpy.c
51
while (--n != 0)
lib/libc/string/wcsncpy.c
55
} while (--n != 0);
lib/libc/string/wcswidth.c
49
wcswidth_l(const wchar_t *pwcs, size_t n, locale_t locale)
lib/libc/string/wcswidth.c
56
while (n-- > 0 && (wc = *pwcs++) != L'\0') {
lib/libc/string/wcswidth.c
65
wcswidth(const wchar_t *pwcs, size_t n)
lib/libc/string/wcswidth.c
67
return wcswidth_l(pwcs, n, __get_locale());
lib/libc/string/wmemchr.c
33
wmemchr(const wchar_t *s, wchar_t c, size_t n)
lib/libc/string/wmemchr.c
37
for (i = 0; i < n; i++) {
lib/libc/string/wmemcmp.c
33
wmemcmp(const wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wmemcmp.c
37
for (i = 0; i < n; i++) {
lib/libc/string/wmemcpy.c
34
wmemcpy(wchar_t * __restrict d, const wchar_t * __restrict s, size_t n)
lib/libc/string/wmemcpy.c
36
return (wchar_t *)memcpy(d, s, n * sizeof(wchar_t));
lib/libc/string/wmemmove.c
34
wmemmove(wchar_t *d, const wchar_t *s, size_t n)
lib/libc/string/wmemmove.c
36
return (wchar_t *)memmove(d, s, n * sizeof(wchar_t));
lib/libc/string/wmemset.c
33
wmemset(wchar_t *s, wchar_t c, size_t n)
lib/libc/string/wmemset.c
39
for (i = 0; i < n; i++) {
lib/libc/sysvipc/sockets.c
143
ssize_t n;
lib/libc/sysvipc/sockets.c
169
if ((n = sendmsg(sock, &msg, 0)) == -1) {
lib/libc/sysvipc/sockets.c
173
if (n != sizeof(int)) {
lib/libc/sysvipc/sockets.c
175
(long)n);
lib/libc/sysvipc/sockets.c
195
ssize_t n;
lib/libc/sysvipc/sockets.c
213
if ((n = recvmsg(sock, &msg, 0)) == -1)
lib/libc/sysvipc/sockets.c
215
if (n != sizeof(int)) {
lib/libc/sysvipc/sockets.c
217
(long)n);
lib/libc/sysvipc/sockets.c
252
ssize_t n;
lib/libc/sysvipc/sockets.c
273
if ((n = sendmsg(sock, &msg, 0)) == -1) {
lib/libc/sysvipc/sockets.c
288
ssize_t n;
lib/libc/sysvipc/sockets.c
306
n = recvmsg(sock, &msg, 0);
lib/libc/sysvipc/sockets.c
307
} while (n < 0 && errno == EINTR);
lib/libc/sysvipc/sockets.c
309
if (n < 0) {
lib/libc/sysvipc/sockets.c
314
if (n == 0) {
lib/libc/sysvipc/sockets.c
326
result = n;
lib/libc/upmap/ukp_setproctitle.c
62
size_t n;
lib/libc/upmap/ukp_setproctitle.c
75
n = 0;
lib/libc/upmap/ukp_setproctitle.c
77
n = snprintf(sptbuf, t, "%s: ", _getprogname());
lib/libc/upmap/ukp_setproctitle.c
79
vsnprintf(sptbuf + n, t - n, fmt, ap);
lib/libc/uuid/uuid_from_string.c
47
int n;
lib/libc/uuid/uuid_from_string.c
72
n = sscanf(s,
lib/libc/uuid/uuid_from_string.c
79
if (n != 11)
lib/libc/uuid/uuid_from_string.c
83
n = u->clock_seq_hi_and_reserved;
lib/libc/uuid/uuid_from_string.c
84
if ((n & 0x80) != 0x00 && /* variant 0? */
lib/libc/uuid/uuid_from_string.c
85
(n & 0xc0) != 0x80 && /* variant 1? */
lib/libc/uuid/uuid_from_string.c
86
(n & 0xe0) != 0xc0) { /* variant 2? */
lib/libc/xdr/xdr_rec.c
514
ssize_t n;
lib/libc/xdr/xdr_rec.c
518
n = rstrm->readit(rstrm->tcp_handle, rstrm->in_hdrp,
lib/libc/xdr/xdr_rec.c
520
if (n == 0) {
lib/libc/xdr/xdr_rec.c
524
if (n < 0) {
lib/libc/xdr/xdr_rec.c
528
rstrm->in_hdrp += n;
lib/libc/xdr/xdr_rec.c
529
rstrm->in_hdrlen += n;
lib/libc/xdr/xdr_rec.c
556
n = rstrm->readit(rstrm->tcp_handle,
lib/libc/xdr/xdr_rec.c
560
if (n < 0) {
lib/libc/xdr/xdr_rec.c
565
if (n == 0) {
lib/libc/xdr/xdr_rec.c
570
rstrm->in_received += n;
lib/libc/yp/yplib.c
132
struct ypmatch_ent *n, *c = ypdb->cache;
lib/libc/yp/yplib.c
135
n = c->ypc_next;
lib/libc/yp/yplib.c
137
c = n;
lib/libc/yp/yplib.c
147
struct ypmatch_ent *n, *p = NULL;
lib/libc/yp/yplib.c
154
n = c->ypc_next;
lib/libc/yp/yplib.c
156
c = n;
lib/libcalendar/easter.c
40
int c, i, j, k, l, n;
lib/libcalendar/easter.c
42
n = y % 19;
lib/libcalendar/easter.c
45
i = (c - c/4 -(c-k)/3 + 19 * n + 15) % 30;
lib/libcalendar/easter.c
46
i = i -(i/28) * (1 - (i/28) * (29/(i + 1)) * ((21 - n)/11));
lib/libcrypt/blowfish.c
69
#define BLFRND(s,p,i,j,n) (i ^= F(s,j) ^ (p)[n])
lib/libcrypt/crypt-sha256.c
20
# define SWAP(n) \
lib/libcrypt/crypt-sha256.c
21
(((n) << 24) | (((n) & 0xff00) << 8) | (((n) >> 8) & 0xff00) | ((n) >> 24))
lib/libcrypt/crypt-sha256.c
23
# define SWAP(n) (n)
lib/libcrypt/crypt-sha256.c
476
int n = snprintf (cp, MAX (0, buflen), "%s%zu$",
lib/libcrypt/crypt-sha256.c
478
cp += n;
lib/libcrypt/crypt-sha256.c
479
buflen -= n;
lib/libcrypt/crypt-sha256.c
494
int n = (N); \
lib/libcrypt/crypt-sha256.c
495
while (n-- > 0 && buflen > 0) \
lib/libcrypt/crypt-sha512.c
20
# define SWAP(n) \
lib/libcrypt/crypt-sha512.c
21
(((n) << 56) \
lib/libcrypt/crypt-sha512.c
22
| (((n) & 0xff00) << 40) \
lib/libcrypt/crypt-sha512.c
23
| (((n) & 0xff0000) << 24) \
lib/libcrypt/crypt-sha512.c
24
| (((n) & 0xff000000) << 8) \
lib/libcrypt/crypt-sha512.c
25
| (((n) >> 8) & 0xff000000) \
lib/libcrypt/crypt-sha512.c
26
| (((n) >> 24) & 0xff0000) \
lib/libcrypt/crypt-sha512.c
27
| (((n) >> 40) & 0xff00) \
lib/libcrypt/crypt-sha512.c
28
| ((n) >> 56))
lib/libcrypt/crypt-sha512.c
30
# define SWAP(n) (n)
lib/libcrypt/crypt-sha512.c
507
int n = snprintf (cp, MAX (0, buflen), "%s%zu$",
lib/libcrypt/crypt-sha512.c
509
cp += n;
lib/libcrypt/crypt-sha512.c
510
buflen -= n;
lib/libcrypt/crypt-sha512.c
525
int n = (N); \
lib/libcrypt/crypt-sha512.c
526
while (n-- > 0 && buflen > 0) \
lib/libcrypt/crypt.h
38
extern void _crypt_to64(char *s, unsigned long v, int n);
lib/libcrypt/misc.c
39
_crypt_to64(char *s, unsigned long v, int n)
lib/libcrypt/misc.c
41
while (--n >= 0) {
lib/libcuse/cuse_lib.c
157
unsigned long n;
lib/libcuse/cuse_lib.c
160
for (n = remainder = 0; n != CUSE_ALLOC_UNIT_MAX; n++) {
lib/libcuse/cuse_lib.c
161
if (a_cuse[n].ptr == NULL)
lib/libcuse/cuse_lib.c
164
ptr_min = a_cuse[n].ptr;
lib/libcuse/cuse_lib.c
165
ptr_max = a_cuse[n].ptr + a_cuse[n].size - 1;
lib/libcuse/cuse_lib.c
174
return ((n << CUSE_ALLOC_UNIT_SHIFT) + remainder);
lib/libcuse/cuse_lib.c
184
unsigned long n;
lib/libcuse/cuse_lib.c
203
for (n = 0; n <= CUSE_ALLOC_UNIT_MAX - m; ) {
lib/libcuse/cuse_lib.c
204
if (a_cuse[n].size != 0) {
lib/libcuse/cuse_lib.c
206
n += howmany(a_cuse[n].size, 1 << CUSE_ALLOC_UNIT_SHIFT);
lib/libcuse/cuse_lib.c
211
if (a_cuse[n + x].size != 0)
lib/libcuse/cuse_lib.c
216
n += x + 1;
lib/libcuse/cuse_lib.c
220
a_cuse[n].size = size;
lib/libcuse/cuse_lib.c
223
info.alloc_nr = n;
lib/libcuse/cuse_lib.c
230
MAP_SHARED, f_cuse, n << CUSE_ALLOC_UNIT_SHIFT);
lib/libcuse/cuse_lib.c
234
a_cuse[n].ptr = ptr;
lib/libcuse/cuse_lib.c
244
a_cuse[n].size = 0;
lib/libcuse/cuse_lib.c
245
n++;
lib/libcuse/cuse_lib.c
254
int n;
lib/libcuse/cuse_lib.c
260
for (n = 0; n != CUSE_ALLOC_UNIT_MAX; n++) {
lib/libcuse/cuse_lib.c
261
if (a_cuse[n].ptr == ptr)
lib/libcuse/cuse_lib.c
266
return (n != CUSE_ALLOC_UNIT_MAX);
lib/libcuse/cuse_lib.c
275
int n;
lib/libcuse/cuse_lib.c
281
for (n = 0; n != CUSE_ALLOC_UNIT_MAX; n++) {
lib/libcuse/cuse_lib.c
282
if (a_cuse[n].ptr != ptr)
lib/libcuse/cuse_lib.c
285
temp = a_cuse[n];
lib/libcuse/cuse_lib.c
293
info.alloc_nr = n;
lib/libcuse/cuse_lib.c
303
a_cuse[n].ptr = NULL;
lib/libcuse/cuse_lib.c
304
a_cuse[n].size = 0;
lib/libdevattr/devattr.c
140
ssize_t r,n;
lib/libdevattr/devattr.c
151
n = send(s, xml+r, sz-r, 0);
lib/libdevattr/devattr.c
152
if (n <= 0)
lib/libdevattr/devattr.c
153
return n;
lib/libdevattr/devattr.c
154
r += n;
lib/libdevattr/devattr.c
165
int n, r;
lib/libdevattr/devattr.c
169
n = recv(s, &sz, sizeof(sz), MSG_WAITALL);
lib/libdevattr/devattr.c
170
if ((n <= 0) || (sz > 12*1024*1024)) /* Arbitrary limit */
lib/libdevattr/devattr.c
171
return n;
lib/libdevattr/devattr.c
176
n = recv(s, xml+r, sz-r, MSG_WAITALL);
lib/libdevattr/devattr.c
177
if (n <= 0) {
lib/libdevattr/devattr.c
179
return n;
lib/libdevattr/devattr.c
181
r += n;
lib/libdevattr/devattr.c
289
int n;
lib/libdevattr/devattr.c
308
n = send_xml(s, xml);
lib/libdevattr/devattr.c
311
if (n <= 0)
lib/libdevattr/devattr.c
314
if ((n = read_xml(s, &xml)) <= 0)
lib/libdevattr/devattr.c
317
xml[n+1] = '\0';
lib/libdevattr/devattr_monitor.c
142
int n;
lib/libdevattr/devattr_monitor.c
144
if ((n = read_xml(udev_monitor->socket, &xml)) <= 0)
lib/libdevattr/devattr_monitor.c
147
xml[n+1] = '\0';
lib/libdevattr/devattr_monitor.c
182
int n;
lib/libdevattr/devattr_monitor.c
203
n = send_xml(udev_monitor->socket, xml);
lib/libdevattr/devattr_monitor.c
205
if (n <= 0)
lib/libdmsg/crypto.c
354
ssize_t n;
lib/libdmsg/crypto.c
572
n = read(iocom->sock_fd, ptr, blksize - (i & blkmask));
lib/libdmsg/crypto.c
573
if (n <= 0)
lib/libdmsg/crypto.c
576
i += n;
lib/libdmsg/crypto.c
619
n = 0;
lib/libdmsg/crypto.c
621
n += handrx.verf[i];
lib/libdmsg/crypto.c
623
++n;
lib/libdmsg/crypto.c
624
if (n != 0)
lib/libdmsg/crypto.c
722
struct iovec *iov, int n, size_t *nactp)
lib/libdmsg/crypto.c
732
for (i = 0; i < n && nmax; ++i) {
lib/libdmsg/dmsg.h
455
struct iovec *iov, int n, size_t *nactp);
lib/libdmsg/msg.c
1259
ssize_t n;
lib/libdmsg/msg.c
1379
n = writev(iocom->sock_fd, iov, iovcnt);
lib/libdmsg/msg.c
1381
if (n > 0) {
lib/libdmsg/msg.c
1382
ioq->fifo_beg += n;
lib/libdmsg/msg.c
1403
n = writev(iocom->sock_fd, iov, iovcnt);
lib/libdmsg/msg.c
1405
if (n > 0)
lib/libdmsg/msg.c
1406
nact = n;
lib/libdmsg/msg.c
1491
if (n < 0) {
lib/libdmsg/msg.c
619
ssize_t n;
lib/libdmsg/msg.c
669
n = read(iocom->sock_fd,
lib/libdmsg/msg.c
672
if (n <= 0) {
lib/libdmsg/msg.c
673
if (n == 0) {
lib/libdmsg/msg.c
683
n = 0;
lib/libdmsg/msg.c
686
ioq->fifo_end += (size_t)n;
lib/libdmsg/msg.c
687
nmax -= (size_t)n;
lib/libdmsg/msg.c
789
n = read(iocom->sock_fd,
lib/libdmsg/msg.c
792
if (n <= 0) {
lib/libdmsg/msg.c
793
if (n == 0) {
lib/libdmsg/msg.c
803
n = 0;
lib/libdmsg/msg.c
806
ioq->fifo_end += (size_t)n;
lib/libdmsg/msg.c
807
nmax -= (size_t)n;
lib/libdmsg/msg.c
927
n = read(iocom->sock_fd,
lib/libdmsg/msg.c
930
if (n <= 0) {
lib/libdmsg/msg.c
931
if (n == 0) {
lib/libdmsg/msg.c
941
n = 0;
lib/libdmsg/msg.c
944
ioq->fifo_end += (size_t)n;
lib/libdmsg/msg.c
945
nmax -= (size_t)n;
lib/libefivar/efivar-dp-xlate.c
121
int error, rv = 0, n, i;
lib/libefivar/efivar-dp-xlate.c
193
n = getfsstat(NULL, 0, MNT_NOWAIT) + 1;
lib/libefivar/efivar-dp-xlate.c
194
if (n < 0) {
lib/libefivar/efivar-dp-xlate.c
198
mntlen = sizeof(struct statfs) * n;
lib/libefivar/efivar-dp-xlate.c
200
n = getfsstat(mnt, mntlen, MNT_NOWAIT);
lib/libefivar/efivar-dp-xlate.c
201
if (n < 0) {
lib/libefivar/efivar-dp-xlate.c
205
for (i = 0; i < n; i++) {
lib/libefivar/efivar-dp-xlate.c
243
if (i >= n)
lib/libefivar/uefi-dplib.h
527
#define StrnCmp(a, b, n) strncmp(a, b, n)
lib/libevtr/evtr.c
271
struct id_map *v, *n;
lib/libevtr/evtr.c
273
for (v = RB_MIN(id_tree, root); v; v = n) {
lib/libevtr/evtr.c
274
n = RB_NEXT(id_tree, root, v);
lib/libevtr/evtr.c
550
struct event_fmt *n;
lib/libevtr/evtr.c
552
if (!(n = malloc(sizeof(*n)))) {
lib/libevtr/evtr.c
553
return n;
lib/libevtr/evtr.c
555
memcpy(n, o, sizeof(*n));
lib/libevtr/evtr.c
556
return n;
lib/libevtr/ktrfmt.yy.c
1659
yy_size_t n;
lib/libevtr/ktrfmt.yy.c
1663
n = _yybytes_len + 2;
lib/libevtr/ktrfmt.yy.c
1664
buf = (char *) __ktrfmtalloc(n );
lib/libevtr/ktrfmt.yy.c
1673
b = __ktrfmt_scan_buffer(buf,n );
lib/libevtr/ktrfmt.yy.c
1698
#define yyless(n) \
lib/libevtr/ktrfmt.yy.c
1702
int yyless_macro_arg = (n); \
lib/libevtr/ktrfmt.yy.c
1847
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
lib/libevtr/ktrfmt.yy.c
1850
for ( i = 0; i < n; ++i )
lib/libevtr/ktrfmt.yy.c
1858
register int n;
lib/libevtr/ktrfmt.yy.c
1859
for ( n = 0; s[n]; ++n )
lib/libevtr/ktrfmt.yy.c
1862
return n;
lib/libevtr/ktrfmt.yy.c
189
#define YY_LESS_LINENO(n)
lib/libevtr/ktrfmt.yy.c
192
#define yyless(n) \
lib/libevtr/ktrfmt.yy.c
196
int yyless_macro_arg = (n); \
lib/libevtr/ktrfmt.yy.c
653
size_t n; \
lib/libevtr/ktrfmt.yy.c
654
for ( n = 0; n < max_size && \
lib/libevtr/ktrfmt.yy.c
655
(c = getc( __ktrfmtin )) != EOF && c != '\n'; ++n ) \
lib/libevtr/ktrfmt.yy.c
656
buf[n] = (char) c; \
lib/libevtr/ktrfmt.yy.c
658
buf[n++] = (char) c; \
lib/libevtr/ktrfmt.yy.c
661
result = n; \
lib/libexecinfo/private_libelf.h
2165
uint32_t n, nbuckets, nchains, maskwords, shift2, symndx, t32;
lib/libexecinfo/private_libelf.h
2204
for (n = 0; n < maskwords; n++) {
lib/libexecinfo/private_libelf.h
2208
bloom64[n] = t64;
lib/libexecinfo/private_libelf.h
2215
for (n = 0; n < nbuckets; n++) {
lib/libexecinfo/private_libelf.h
2219
buckets[n] = t32;
lib/libexecinfo/private_libelf.h
2234
for (n = 0; n < nchains; n++) {
lib/libexecinfo/unwind.c
41
size_t n;
lib/libexecinfo/unwind.c
48
if (t->n == (size_t)~0) {
lib/libexecinfo/unwind.c
50
t->n = 0;
lib/libexecinfo/unwind.c
53
if (t->n < t->len)
lib/libexecinfo/unwind.c
54
t->arr[t->n++] = _Unwind_GetIP(ctx);
lib/libexecinfo/unwind.c
65
ctx.n = (size_t)~0;
lib/libexecinfo/unwind.c
68
if (ctx.n != (size_t)~0 && ctx.n > 0)
lib/libexecinfo/unwind.c
69
ctx.arr[--ctx.n] = NULL; /* Skip frame below __start */
lib/libexecinfo/unwind.c
71
return ctx.n;
lib/libfetch/common.h
136
#define ftp_seterr(n) fetch_seterr(ftp_errlist, n)
lib/libfetch/common.h
137
#define http_seterr(n) fetch_seterr(http_errlist, n)
lib/libfetch/common.h
138
#define netdb_seterr(n) fetch_seterr(netdb_errlist, n)
lib/libfetch/common.h
139
#define url_seterr(n) fetch_seterr(url_errlist, n)
lib/libfetch/common.h
140
#define socks5_seterr(n) fetch_seterr(socks5_errlist, n)
lib/libfetch/fetch.c
356
int i, n;
lib/libfetch/fetch.c
424
for (n = 0, q = ++p; *q && (*q != '/'); q++) {
lib/libfetch/fetch.c
425
if (*q >= '0' && *q <= '9' && n < INT_MAX / 10) {
lib/libfetch/fetch.c
426
n = n * 10 + (*q - '0');
lib/libfetch/fetch.c
433
if (n < 1 || n > IPPORT_MAX)
lib/libfetch/fetch.c
435
u->port = n;
lib/libfetch/http.c
1548
int e, i, n, val;
lib/libfetch/http.c
1578
n = MAX_REDIRECT;
lib/libfetch/http.c
1849
n = 1;
lib/libfetch/http.c
1887
++n;
lib/libfetch/http.c
1893
++n;
lib/libfetch/http.c
1953
} while (++i < n);
lib/libftpio/ftpio.c
288
FTP_t n;
lib/libftpio/ftpio.c
296
n = ftp_new();
lib/libftpio/ftpio.c
298
if (n && ftp_login_session(n, host, af, user, passwd, port, verbose) == SUCCESS) {
lib/libftpio/ftpio.c
299
fp = funopen(n, ftp_read_method, ftp_write_method, NULL, ftp_close_method); /* BSD 4.4 function! */
lib/libftpio/ftpio.c
302
if (!n)
lib/libftpio/ftpio.c
305
else switch(n->error) {
lib/libftpio/ftpio.c
315
*retcode = n->error;
lib/libftpio/ftpio.c
510
FTP_t n = (FTP_t)vp;
lib/libftpio/ftpio.c
512
fd = n->fd_ctrl;
lib/libftpio/ftpio.c
521
FTP_t n = (FTP_t)vp;
lib/libftpio/ftpio.c
523
fd = n->fd_ctrl;
lib/libftpio/ftpio.c
529
ftp_close_method(void *n)
lib/libftpio/ftpio.c
533
i = ftp_close((FTP_t)n);
lib/libftpio/ftpio.c
534
free(n);
lib/libftpio/ftpio.c
55
static int ftp_read_method(void *n, char *buf, int nbytes);
lib/libftpio/ftpio.c
56
static int ftp_write_method(void *n, const char *buf, int nbytes);
lib/libftpio/ftpio.c
57
static int ftp_close_method(void *n);
lib/libftpio/ftpio.c
591
int n, i = strlen(s);
lib/libftpio/ftpio.c
594
n = write(fd, s, i);
lib/libftpio/ftpio.c
596
if (FtpTimedOut || i != n)
lib/libipfw3/basic/ipfw3_basic.c
223
int i, n;
lib/libipfw3/basic/ipfw3_basic.c
228
for (n=i+1; n < len; n++) {
lib/libipfw3/basic/ipfw3_basic.c
229
if ( (p[n/8] & (1 << (7 - (n%8)))) != 0)
lib/libipfw3/layer2/ipfw3_layer2.c
65
int i, n;
lib/libipfw3/layer2/ipfw3_layer2.c
70
for (n = i + 1; n < len; n++) {
lib/libipfw3/layer2/ipfw3_layer2.c
71
if ( (p[n/8] & (1 << (7 - (n%8)))) != 0)
lib/libkcore/kcore_file.c
102
for (n = 0; n < fdp.fd_nfiles; n++) {
lib/libkcore/kcore_file.c
103
if (kvm_read(kc->kd, (long)(&fdp.fd_files[n].fp), &fpp,
lib/libkcore/kcore_file.c
106
&fdp.fd_files[n].fp, procs->kp_pid);
lib/libkcore/kcore_file.c
116
kcore_make_file(*files + *len, &fp, procs->kp_pid, 0, n);
lib/libkcore/kcore_file.c
61
int maxfiles, n, retval;
lib/libkiconv/quirks.c
93
#define NumOf(n) (sizeof((n)) / sizeof((n)[0]))
lib/libkvm/kvm.c
106
int n;
lib/libkvm/kvm.c
117
n = strlen(cp);
lib/libkvm/kvm.c
118
(void)snprintf(&cp[n], sizeof(kd->errbuf) - n, ": %s",
lib/libkvm/kvm.c
125
_kvm_malloc(kvm_t *kd, size_t n)
lib/libkvm/kvm.c
129
if ((p = calloc(n, sizeof(char))) == NULL)
lib/libkvm/kvm.c
131
n, strerror(errno));
lib/libkvm/kvm_file.c
107
int n, f;
lib/libkvm/kvm_file.c
133
n = fdp.fd_nfiles * sizeof(struct fdnode);
lib/libkvm/kvm_file.c
135
if (kvm_read(kd, (uintptr_t)fdp.fd_files, fd_files, n) != n) {
lib/libkvm/kvm_file.c
69
pid_t pid, uid_t owner, int n)
lib/libkvm/kvm_file.c
76
ufile->f_fd = n;
lib/libkvm/kvm_getswapinfo.c
424
int n;
lib/libkvm/kvm_getswapinfo.c
449
n = (int)(bytes / ksize);
lib/libkvm/kvm_getswapinfo.c
455
for (i = swi = 0; i < n; ++i) {
lib/libkvm/kvm_getswapinfo.c
471
for (i = ti = 0; i < n; ++i) {
lib/libkvm/kvm_proc.c
422
int cnt, partcnt, n;
lib/libkvm/kvm_proc.c
434
for (n = 0; n < allproc_hsize; n++) {
lib/libkvm/kvm_proc.c
435
pl[n] = _kvm_malloc(kd, sizeof(struct proclist));
lib/libkvm/kvm_proc.c
437
sizeof(struct procglob) * n +
lib/libkvm/kvm_proc.c
440
if (KREAD(kd, (u_long)nextoff, pl[n])) {
lib/libkvm/kvm_proc.c
447
if (LIST_EMPTY(pl[n]))
lib/libkvm/kvm_proc.c
451
p = pl[n]->lh_first;
lib/libkvm/kvm_proc.c
454
free(pl[n]);
lib/libkvm/kvm_proc.c
459
free(pl[n]);
lib/libkvm/kvm_proc.c
551
_kvm_realloc(kvm_t *kd, void *p, size_t n)
lib/libkvm/kvm_proc.c
553
void *np = (void *)realloc(p, n);
lib/libkvm/kvm_proc.c
746
ps_str_a(struct ps_strings *p, u_long *addr, int *n)
lib/libkvm/kvm_proc.c
749
*n = p->ps_nargvstr;
lib/libkvm/kvm_proc.c
753
ps_str_e(struct ps_strings *p, u_long *addr, int *n)
lib/libkvm/kvm_proc.c
756
*n = p->ps_nenvstr;
lib/libkvm/kvm_x86_64.c
114
int n;
lib/libkvm/kvm_x86_64.c
122
n = e->e_phnum;
lib/libkvm/kvm_x86_64.c
124
while (n && (pa < p->p_paddr || pa >= p->p_paddr + p->p_memsz))
lib/libkvm/kvm_x86_64.c
125
p++, n--;
lib/libkvm/kvm_x86_64.c
126
if (n == 0)
lib/libldns/ldns/config.h
745
void *memmove(void *dest, const void *src, size_t n);
lib/libncurses/include/comp_userdefs.c
1144
unsigned n;
lib/libncurses/include/comp_userdefs.c
1146
for (n = 0; n < USERTABSIZE; ++n) {
lib/libncurses/include/comp_userdefs.c
1147
(*actual)[n].ute_name = strings + len;
lib/libncurses/include/comp_userdefs.c
1148
(*actual)[n].ute_type = (int) source[n].ute_type;
lib/libncurses/include/comp_userdefs.c
1149
(*actual)[n].ute_argc = source[n].ute_argc;
lib/libncurses/include/comp_userdefs.c
1150
(*actual)[n].ute_args = source[n].ute_args;
lib/libncurses/include/comp_userdefs.c
1151
(*actual)[n].ute_index = source[n].ute_index;
lib/libncurses/include/comp_userdefs.c
1152
(*actual)[n].ute_link = source[n].ute_link;
lib/libnetgraph7/msg.c
238
int n;
lib/libnetgraph7/msg.c
243
n = poll(&rfds, 1, INFTIM);
lib/libnetgraph7/msg.c
244
if (n == -1) {
lib/libnvmm/libnvmm_x86.c
1834
fsm_read(struct x86_decode_fsm *fsm, uint8_t *bytes, size_t n)
lib/libnvmm/libnvmm_x86.c
1836
if (fsm->buf + n > fsm->end) {
lib/libnvmm/libnvmm_x86.c
1839
memcpy(bytes, fsm->buf, n);
lib/libnvmm/libnvmm_x86.c
1844
fsm_advance(struct x86_decode_fsm *fsm, size_t n,
lib/libnvmm/libnvmm_x86.c
1847
fsm->buf += n;
lib/libnvmm/libnvmm_x86.c
2018
size_t n;
lib/libnvmm/libnvmm_x86.c
2021
n = 1;
lib/libnvmm/libnvmm_x86.c
2023
n = 2;
lib/libnvmm/libnvmm_x86.c
2025
n = 4;
lib/libnvmm/libnvmm_x86.c
2030
if (fsm_read(fsm, (uint8_t *)&data, n) == -1) {
lib/libnvmm/libnvmm_x86.c
2035
data = sign_extend(data, n);
lib/libnvmm/libnvmm_x86.c
2041
fsm_advance(fsm, n, node_immediate);
lib/libnvmm/libnvmm_x86.c
2043
fsm_advance(fsm, n, NULL);
lib/libnvmm/libnvmm_x86.c
2584
size_t n = 0;
lib/libnvmm/libnvmm_x86.c
2599
n = 1;
lib/libnvmm/libnvmm_x86.c
2602
fsm_advance(fsm, n, node_main);
lib/libpam/modules/pam_exec/pam_exec.c
52
#define ENV_ITEM(n) { (n), #n }
lib/libpam/modules/pam_unix/pam_unix.c
463
to64(char *s, long v, int n)
lib/libpam/modules/pam_unix/pam_unix.c
465
while (--n >= 0) {
lib/libssh/openbsd-compat/blowfish.c
68
#define BLFRND(s,p,i,j,n) (i ^= F(s,j) ^ (p)[n])
lib/libssh/openbsd-compat/bsd-misc.c
368
mbtowc(wchar_t *pwc, const char *s, size_t n)
lib/libssh/openbsd-compat/bsd-misc.c
372
if (*s < 0 || *s > 0x7f || n < 1) {
lib/libssh/openbsd-compat/bsd-misc.c
392
bzero(void *b, size_t n)
lib/libssh/openbsd-compat/bsd-misc.c
394
(void)memset(b, 0, n);
lib/libssh/openbsd-compat/glob.c
426
g_strncmp(const Char *s1, const char *s2, size_t n)
lib/libssh/openbsd-compat/glob.c
430
while (n--) {
lib/libssh/openbsd-compat/glob.c
574
size_t n = pglob->gl_pathc - oldpathc;
lib/libssh/openbsd-compat/glob.c
577
if ((path_stat = calloc(n, sizeof(*path_stat))) == NULL)
lib/libssh/openbsd-compat/glob.c
579
for (i = 0; i < n; i++) {
lib/libssh/openbsd-compat/glob.c
583
qsort(path_stat, n, sizeof(*path_stat), compare_gps);
lib/libssh/openbsd-compat/glob.c
584
for (i = 0; i < n; i++) {
lib/libssh/openbsd-compat/openbsd-compat.h
116
char *strndup(const char *s, size_t n);
lib/libssh/openbsd-compat/openbsd-compat.h
320
void explicit_bzero(void *p, size_t n);
lib/libssh/openbsd-compat/openbsd-compat.h
346
# define FD_SET(n, set) kludge_FD_SET(n, set)
lib/libssh/openbsd-compat/openbsd-compat.h
347
# define FD_ISSET(n, set) kludge_FD_ISSET(n, set)
lib/libssh/openbsd-compat/openssl-compat.h
105
void RSA_get0_key(const RSA *r, const BIGNUM **n, const BIGNUM **e,
lib/libssh/openbsd-compat/openssl-compat.h
110
int RSA_set0_key(RSA *r, BIGNUM *n, BIGNUM *e, BIGNUM *d);
lib/libtcplay/hdr.c
47
#define BE_TO_HOST(n, v) v = be ## n ## toh(v)
lib/libtcplay/hdr.c
48
#define LE_TO_HOST(n, v) v = le ## n ## toh(v)
lib/libtcplay/hdr.c
49
#define HOST_TO_BE(n, v) v = htobe ## n (v)
lib/libtcplay/hdr.c
50
#define HOST_TO_LE(n, v) v = htole ## n (v)
lib/libtcplay/humanize.c
128
n = n_check = strtoull(buf, &endptr, 10);
lib/libtcplay/humanize.c
156
n *= multiplier;
lib/libtcplay/humanize.c
158
if ((uint64_t)(n/multiplier) != n_check) {
lib/libtcplay/humanize.c
163
n += d;
lib/libtcplay/humanize.c
164
*dest = n;
lib/libtcplay/humanize.c
175
uint64_t n, out;
lib/libtcplay/humanize.c
181
n = strtoull(argv[1], NULL, 10);
lib/libtcplay/humanize.c
183
err = _humanize_number(buf, 1024, n);
lib/libtcplay/humanize.c
189
printf("Converting: %"PRIu64" => %s => %"PRIu64"\n", n, buf, out);
lib/libtcplay/humanize.c
76
uint64_t n, n_check, d;
lib/libtcplay/io.c
399
ssize_t n;
lib/libtcplay/io.c
442
n = read(fd, pass, bufsz-1);
lib/libtcplay/io.c
443
if (n > 0) {
lib/libtcplay/io.c
444
pass[n-1] = '\0'; /* Strip trailing \n */
lib/libtcplay/tcplay.c
290
int n = 0;
lib/libtcplay/tcplay.c
298
n += snprintf(buf+n, bufsz-n, "%s%s", chain->cipher->name,
lib/libtelnet/genget.c
71
int n;
lib/libtelnet/genget.c
78
if ((n = isprefix(name, *c)) == 0)
lib/libtelnet/genget.c
80
if (n < 0) /* exact match */
lib/libtelnet/pk.c
173
BIGNUM *n = NULL;
lib/libtelnet/pk.c
175
if ((n = BN_new()) == NULL)
lib/libtelnet/pk.c
178
BN_init(n);
lib/libtelnet/pk.c
180
BN_add_word(n, (u_long)i);
lib/libtelnet/pk.c
182
BN_sub_word(n, (u_long)(-i));
lib/libtelnet/pk.c
183
return(n);
lib/libu4bhid/usage.c
105
n = strdup(name);
lib/libu4bhid/usage.c
106
if (!n)
lib/libu4bhid/usage.c
121
curpage->page_contents[curpage->pagesize].name = n;
lib/libu4bhid/usage.c
140
curpage->name = n;
lib/libu4bhid/usage.c
76
char line[100], name[100], *p, *n;
lib/libusb/libusb10_desc.c
45
#define N_ALIGN(n) (-((-(n)) & (-8UL)))
lib/libusb/libusb10_io.c
618
uint32_t n;
lib/libusb/libusb10_io.c
630
for (n = 0; n != off; n++) {
lib/libusb/libusb10_io.c
631
ptr += transfer->iso_packet_desc[n].length;
lib/libusb/libusb10_io.c
659
int n;
lib/libusb/libusb10_io.c
664
for (n = 0; n != transfer->num_iso_packets; n++)
lib/libusb/libusb10_io.c
665
transfer->iso_packet_desc[n].length = length;
lib/libusb/libusb20.c
838
uint16_t n;
lib/libusb/libusb20.c
873
n = (temp[0] / 2) - 1;
lib/libusb/libusb20.c
874
if (n > len) {
lib/libusb/libusb20.c
875
n = len;
lib/libusb/libusb20.c
884
for (i = 0; (i != n); i++) {
lib/libusb/libusb20_desc.h
113
#define LIBUSB20_ME_STRUCT(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
117
#define LIBUSB20_ME_STRUCT_ARRAY(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
122
#define LIBUSB20_ME_INTEGER(n, field, ismeta, un, u, bits, a, size) \
lib/libusb/libusb20_desc.h
129
#define LIBUSB20_ME_UINT8_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
130
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 8, , 1)
lib/libusb/libusb20_desc.h
132
#define LIBUSB20_ME_UINT8_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
133
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 8, [arg], arg)
lib/libusb/libusb20_desc.h
135
#define LIBUSB20_ME_SINT8_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
136
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 8, , 1)
lib/libusb/libusb20_desc.h
138
#define LIBUSB20_ME_SINT8_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
139
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 8, [arg], arg)
lib/libusb/libusb20_desc.h
141
#define LIBUSB20_ME_UINT16_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
142
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 16, , 1)
lib/libusb/libusb20_desc.h
144
#define LIBUSB20_ME_UINT16_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
145
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 16, [arg], arg)
lib/libusb/libusb20_desc.h
147
#define LIBUSB20_ME_SINT16_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
148
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 16, , 1)
lib/libusb/libusb20_desc.h
150
#define LIBUSB20_ME_SINT16_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
151
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 16, [arg], arg)
lib/libusb/libusb20_desc.h
153
#define LIBUSB20_ME_UINT32_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
154
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 32, , 1)
lib/libusb/libusb20_desc.h
156
#define LIBUSB20_ME_UINT32_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
157
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 32, [arg], arg)
lib/libusb/libusb20_desc.h
159
#define LIBUSB20_ME_SINT32_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
160
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 32, , 1)
lib/libusb/libusb20_desc.h
162
#define LIBUSB20_ME_SINT32_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
163
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 32, [arg], arg)
lib/libusb/libusb20_desc.h
165
#define LIBUSB20_ME_UINT64_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
166
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 64, , 1)
lib/libusb/libusb20_desc.h
168
#define LIBUSB20_ME_UINT64_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
169
LIBUSB20_ME_INTEGER(n, field, ismeta, UN, u, 64, [arg], arg)
lib/libusb/libusb20_desc.h
171
#define LIBUSB20_ME_SINT64_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
172
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 64, , 1)
lib/libusb/libusb20_desc.h
174
#define LIBUSB20_ME_SINT64_ARRAY_T(n, field, arg, ismeta) \
lib/libusb/libusb20_desc.h
175
LIBUSB20_ME_INTEGER(n, field, ismeta,,, 64, [arg], arg)
lib/libusb/libusb20_desc.h
177
#define LIBUSB20_MAKE_DECODED_FIELD(n, type, field, arg) \
lib/libusb/libusb20_desc.h
178
LIBUSB20_ME_##type (n, field, arg, LIBUSB20_NO)
lib/libusb/libusb20_desc.h
196
#define LIBUSB20_MAKE_FORMAT_SUB(n, type, field, arg) \
lib/libusb/libusb20_desc.h
197
LIBUSB20_ME_##type (n, field, arg, LIBUSB20_YES)
lib/libusb/libusb20_desc.h
207
#define LIBUSB20_DEVICE_DESC(m,n) \
lib/libusb/libusb20_desc.h
208
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
209
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
210
m(n, UINT16_T, bcdUSB, ) \
lib/libusb/libusb20_desc.h
211
m(n, UINT8_T, bDeviceClass, ) \
lib/libusb/libusb20_desc.h
212
m(n, UINT8_T, bDeviceSubClass, ) \
lib/libusb/libusb20_desc.h
213
m(n, UINT8_T, bDeviceProtocol, ) \
lib/libusb/libusb20_desc.h
214
m(n, UINT8_T, bMaxPacketSize0, ) \
lib/libusb/libusb20_desc.h
215
m(n, UINT16_T, idVendor, ) \
lib/libusb/libusb20_desc.h
216
m(n, UINT16_T, idProduct, ) \
lib/libusb/libusb20_desc.h
217
m(n, UINT16_T, bcdDevice, ) \
lib/libusb/libusb20_desc.h
218
m(n, UINT8_T, iManufacturer, ) \
lib/libusb/libusb20_desc.h
219
m(n, UINT8_T, iProduct, ) \
lib/libusb/libusb20_desc.h
220
m(n, UINT8_T, iSerialNumber, ) \
lib/libusb/libusb20_desc.h
221
m(n, UINT8_T, bNumConfigurations, ) \
lib/libusb/libusb20_desc.h
225
#define LIBUSB20_ENDPOINT_DESC(m,n) \
lib/libusb/libusb20_desc.h
226
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
227
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
228
m(n, UINT8_T, bEndpointAddress, ) \
lib/libusb/libusb20_desc.h
229
m(n, UINT8_T, bmAttributes, ) \
lib/libusb/libusb20_desc.h
230
m(n, UINT16_T, wMaxPacketSize, ) \
lib/libusb/libusb20_desc.h
231
m(n, UINT8_T, bInterval, ) \
lib/libusb/libusb20_desc.h
232
m(n, UINT8_T, bRefresh, ) \
lib/libusb/libusb20_desc.h
233
m(n, UINT8_T, bSynchAddress, ) \
lib/libusb/libusb20_desc.h
237
#define LIBUSB20_INTERFACE_DESC(m,n) \
lib/libusb/libusb20_desc.h
238
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
239
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
240
m(n, UINT8_T, bInterfaceNumber, ) \
lib/libusb/libusb20_desc.h
241
m(n, UINT8_T, bAlternateSetting, ) \
lib/libusb/libusb20_desc.h
242
m(n, UINT8_T, bNumEndpoints, ) \
lib/libusb/libusb20_desc.h
243
m(n, UINT8_T, bInterfaceClass, ) \
lib/libusb/libusb20_desc.h
244
m(n, UINT8_T, bInterfaceSubClass, ) \
lib/libusb/libusb20_desc.h
245
m(n, UINT8_T, bInterfaceProtocol, ) \
lib/libusb/libusb20_desc.h
246
m(n, UINT8_T, iInterface, ) \
lib/libusb/libusb20_desc.h
250
#define LIBUSB20_CONFIG_DESC(m,n) \
lib/libusb/libusb20_desc.h
251
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
252
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
253
m(n, UINT16_T, wTotalLength, ) \
lib/libusb/libusb20_desc.h
254
m(n, UINT8_T, bNumInterfaces, ) \
lib/libusb/libusb20_desc.h
255
m(n, UINT8_T, bConfigurationValue, ) \
lib/libusb/libusb20_desc.h
256
m(n, UINT8_T, iConfiguration, ) \
lib/libusb/libusb20_desc.h
257
m(n, UINT8_T, bmAttributes, ) \
lib/libusb/libusb20_desc.h
258
m(n, UINT8_T, bMaxPower, ) \
lib/libusb/libusb20_desc.h
262
#define LIBUSB20_CONTROL_SETUP(m,n) \
lib/libusb/libusb20_desc.h
263
m(n, UINT8_T, bmRequestType, ) \
lib/libusb/libusb20_desc.h
264
m(n, UINT8_T, bRequest, ) \
lib/libusb/libusb20_desc.h
265
m(n, UINT16_T, wValue, ) \
lib/libusb/libusb20_desc.h
266
m(n, UINT16_T, wIndex, ) \
lib/libusb/libusb20_desc.h
267
m(n, UINT16_T, wLength, ) \
lib/libusb/libusb20_desc.h
271
#define LIBUSB20_SS_ENDPT_COMP_DESC(m,n) \
lib/libusb/libusb20_desc.h
272
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
273
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
274
m(n, UINT8_T, bMaxBurst, ) \
lib/libusb/libusb20_desc.h
275
m(n, UINT8_T, bmAttributes, ) \
lib/libusb/libusb20_desc.h
276
m(n, UINT16_T, wBytesPerInterval, ) \
lib/libusb/libusb20_desc.h
280
#define LIBUSB20_USB_20_DEVCAP_DESC(m,n) \
lib/libusb/libusb20_desc.h
281
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
282
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
283
m(n, UINT8_T, bDevCapabilityType, ) \
lib/libusb/libusb20_desc.h
284
m(n, UINT32_T, bmAttributes, ) \
lib/libusb/libusb20_desc.h
288
#define LIBUSB20_SS_USB_DEVCAP_DESC(m,n) \
lib/libusb/libusb20_desc.h
289
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
290
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
291
m(n, UINT8_T, bDevCapabilityType, ) \
lib/libusb/libusb20_desc.h
292
m(n, UINT8_T, bmAttributes, ) \
lib/libusb/libusb20_desc.h
293
m(n, UINT16_T, wSpeedSupported, ) \
lib/libusb/libusb20_desc.h
294
m(n, UINT8_T, bFunctionalitySupport, ) \
lib/libusb/libusb20_desc.h
295
m(n, UINT8_T, bU1DevExitLat, ) \
lib/libusb/libusb20_desc.h
296
m(n, UINT16_T, wU2DevExitLat, ) \
lib/libusb/libusb20_desc.h
300
#define LIBUSB20_BOS_DESCRIPTOR(m,n) \
lib/libusb/libusb20_desc.h
301
m(n, UINT8_T, bLength, ) \
lib/libusb/libusb20_desc.h
302
m(n, UINT8_T, bDescriptorType, ) \
lib/libusb/libusb20_desc.h
303
m(n, UINT16_T, wTotalLength, ) \
lib/libusb/libusb20_desc.h
304
m(n, UINT8_T, bNumDeviceCapabilities, ) \
lib/libusb/libusb20_int.h
121
#define LIBUSB20_DEVICE(m,n) \
lib/libusb/libusb20_int.h
122
m(n, detach_kernel_driver) \
lib/libusb/libusb20_int.h
123
m(n, do_request_sync) \
lib/libusb/libusb20_int.h
124
m(n, get_config_desc_full) \
lib/libusb/libusb20_int.h
125
m(n, get_config_index) \
lib/libusb/libusb20_int.h
126
m(n, kernel_driver_active) \
lib/libusb/libusb20_int.h
127
m(n, process) \
lib/libusb/libusb20_int.h
128
m(n, reset_device) \
lib/libusb/libusb20_int.h
129
m(n, check_connected) \
lib/libusb/libusb20_int.h
130
m(n, set_power_mode) \
lib/libusb/libusb20_int.h
131
m(n, get_power_mode) \
lib/libusb/libusb20_int.h
132
m(n, get_port_path) \
lib/libusb/libusb20_int.h
133
m(n, get_power_usage) \
lib/libusb/libusb20_int.h
134
m(n, set_alt_index) \
lib/libusb/libusb20_int.h
135
m(n, set_config_index) \
lib/libusb/libusb20_int.h
136
m(n, tr_cancel_async) \
lib/libusb/libusb20_int.h
137
m(n, tr_clear_stall_sync) \
lib/libusb/libusb20_int.h
138
m(n, tr_close) \
lib/libusb/libusb20_int.h
139
m(n, tr_open) \
lib/libusb/libusb20_int.h
140
m(n, tr_submit) \
lib/libusb/libusb20_int.h
66
#define LIBUSB20_DEFINE(n,field) \
lib/libusb/libusb20_int.h
69
#define LIBUSB20_DECLARE(n,field) \
lib/libusb/libusb20_int.h
70
/* .field = */ n##_##field,
lib/libusb/libusb20_int.h
72
#define LIBUSB20_BACKEND(m,n) \
lib/libusb/libusb20_int.h
74
m(n, get_backend_name) \
lib/libusb/libusb20_int.h
76
m(n, init_backend) \
lib/libusb/libusb20_int.h
77
m(n, exit_backend) \
lib/libusb/libusb20_int.h
78
m(n, dev_get_info) \
lib/libusb/libusb20_int.h
79
m(n, dev_get_iface_desc) \
lib/libusb/libusb20_int.h
80
m(n, root_get_dev_quirk) \
lib/libusb/libusb20_int.h
81
m(n, root_get_quirk_name) \
lib/libusb/libusb20_int.h
82
m(n, root_add_dev_quirk) \
lib/libusb/libusb20_int.h
83
m(n, root_remove_dev_quirk) \
lib/libusb/libusb20_int.h
84
m(n, root_set_template) \
lib/libusb/libusb20_int.h
85
m(n, root_get_template) \
lib/libusb/libusb20_int.h
87
m(n, open_device) \
lib/libusb/libusb20_int.h
88
m(n, close_device) \
lib/libutil/efun.c
102
emalloc(size_t n)
lib/libutil/efun.c
104
void *p = malloc(n);
lib/libutil/efun.c
106
(*efunc)(1, "Cannot allocate %zu bytes", n);
lib/libutil/efun.c
111
ecalloc(size_t n, size_t s)
lib/libutil/efun.c
113
void *p = calloc(n, s);
lib/libutil/efun.c
115
(*efunc)(1, "Cannot allocate %zu bytes", n);
lib/libutil/efun.c
120
erealloc(void *p, size_t n)
lib/libutil/efun.c
122
void *q = realloc(p, n);
lib/libutil/efun.c
124
(*efunc)(1, "Cannot re-allocate %zu bytes", n);
lib/libutil/humanize_number.c
175
int n;
lib/libutil/humanize_number.c
177
n = (int)len - r - 2;
lib/libutil/humanize_number.c
179
if (n > 2) /* max 2 fractional digits */
lib/libutil/humanize_number.c
180
n = 2;
lib/libutil/humanize_number.c
182
while (n) {
lib/libutil/humanize_number.c
184
--n;
lib/libutil/property.c
122
if (n >= PROPERTY_MAX_NAME) {
lib/libutil/property.c
123
n = 0;
lib/libutil/property.c
127
hold_n[n++] = ch;
lib/libutil/property.c
142
hold_n[n] = '\0';
lib/libutil/property.c
144
v = n = 0;
lib/libutil/property.c
150
hold_n[n] = '\0';
lib/libutil/property.c
151
v = n = 0;
lib/libutil/property.c
155
hold_n[n++] = ch;
lib/libutil/property.c
161
v = n = 0;
lib/libutil/property.c
172
v = n = 0;
lib/libutil/property.c
178
v = n = 0;
lib/libutil/property.c
191
n = v = 0;
lib/libutil/property.c
195
v = n = 0;
lib/libutil/property.c
217
v = n = 0;
lib/libutil/property.c
46
properties n;
lib/libutil/property.c
48
if ((n = (properties)malloc(sizeof(struct _property))) == NULL)
lib/libutil/property.c
50
n->next = NULL;
lib/libutil/property.c
52
if ((n->name = strdup(name)) == NULL) {
lib/libutil/property.c
53
free(n);
lib/libutil/property.c
57
n->name = NULL;
lib/libutil/property.c
59
if ((n->value = strdup(value)) == NULL) {
lib/libutil/property.c
60
free(n->name);
lib/libutil/property.c
61
free(n);
lib/libutil/property.c
65
n->value = NULL;
lib/libutil/property.c
66
return (n);
lib/libutil/property.c
76
int bp, n, v, max;
lib/libutil/property.c
80
n = v = bp = max = 0;
lib/omd/private_md5.h
106
#define _md5_ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
libexec/bootpd/bootpd.c
187
int n, ba_len, ra_len;
libexec/bootpd/bootpd.c
296
if (!stmp || (sscanf(stmp, "%d", &n) != 1) || (n < 0)) {
libexec/bootpd/bootpd.c
301
debug = n;
libexec/bootpd/bootpd.c
336
if (!stmp || (sscanf(stmp, "%d", &n) != 1) || (n < 0)) {
libexec/bootpd/bootpd.c
341
actualtimeout.tv_sec = (int32) (60 * n);
libexec/bootpd/bootpd.c
347
timeout = (n > 0) ? &actualtimeout : NULL;
libexec/bootpd/bootpd.c
389
n = open(_PATH_TTY, O_RDWR);
libexec/bootpd/bootpd.c
390
if (n >= 0) {
libexec/bootpd/bootpd.c
391
ioctl(n, TIOCNOTTY, NULL);
libexec/bootpd/bootpd.c
392
(void) close(n);
libexec/bootpd/bootpd.c
539
n = recvfrom(s, pktbuf, MAX_MSG_SIZE, 0,
libexec/bootpd/bootpd.c
541
if (n <= 0) {
libexec/bootpd/bootpd.c
548
if (n < sizeof(struct bootp)) {
libexec/bootpd/bootpd.c
554
pktlen = n;
libexec/bootpd/bootpd.c
629
int n;
libexec/bootpd/bootpd.c
889
n = strlen(clntpath);
libexec/bootpd/bootpd.c
893
clntpath[n] = 0; /* Try it without the suffix */
libexec/bootpd/bootpgw/bootpgw.c
160
int n, ba_len, ra_len;
libexec/bootpd/bootpgw/bootpgw.c
253
if (!stmp || (sscanf(stmp, "%d", &n) != 1) || (n < 0)) {
libexec/bootpd/bootpgw/bootpgw.c
257
debug = n;
libexec/bootpd/bootpgw/bootpgw.c
268
if (!stmp || (sscanf(stmp, "%d", &n) != 1) ||
libexec/bootpd/bootpgw/bootpgw.c
269
(n < 0) || (n > 16))
libexec/bootpd/bootpgw/bootpgw.c
274
maxhops = (u_char)n;
libexec/bootpd/bootpgw/bootpgw.c
293
if (!stmp || (sscanf(stmp, "%d", &n) != 1) || (n < 0)) {
libexec/bootpd/bootpgw/bootpgw.c
297
actualtimeout.tv_sec = (int32) (60 * n);
libexec/bootpd/bootpgw/bootpgw.c
303
timeout = (n > 0) ? &actualtimeout : NULL;
libexec/bootpd/bootpgw/bootpgw.c
314
if (!stmp || (sscanf(stmp, "%d", &n) != 1) ||
libexec/bootpd/bootpgw/bootpgw.c
315
(n < 0) || (n > 60))
libexec/bootpd/bootpgw/bootpgw.c
320
minwait = (u_int)n;
libexec/bootpd/bootpgw/bootpgw.c
360
n = open(_PATH_TTY, O_RDWR);
libexec/bootpd/bootpgw/bootpgw.c
361
if (n >= 0) {
libexec/bootpd/bootpgw/bootpgw.c
362
ioctl(n, TIOCNOTTY, NULL);
libexec/bootpd/bootpgw/bootpgw.c
363
(void) close(n);
libexec/bootpd/bootpgw/bootpgw.c
456
n = recvfrom(s, pktbuf, MAX_MSG_SIZE, 0,
libexec/bootpd/bootpgw/bootpgw.c
458
if (n <= 0) {
libexec/bootpd/bootpgw/bootpgw.c
465
if (n < sizeof(struct bootp)) {
libexec/bootpd/bootpgw/bootpgw.c
471
pktlen = n;
libexec/bootpd/dovend.c
375
int n;
libexec/bootpd/dovend.c
379
for (n = 4; n > 0; n--) {
libexec/bootpd/dumptab.c
111
n = 0;
libexec/bootpd/dumptab.c
116
n++;
libexec/bootpd/dumptab.c
120
report(LOG_INFO, "dumped %d entries to \"%s\".", n, filename);
libexec/bootpd/dumptab.c
53
int n;
libexec/bootpd/getether.c
129
int n;
libexec/bootpd/getether.c
160
n = ifrp->ifr_addr.sa_len + sizeof(ifrp->ifr_name);
libexec/bootpd/getether.c
161
if (n < sizeof(*ifrp))
libexec/bootpd/getether.c
162
n = sizeof(*ifrp);
libexec/bootpd/getether.c
163
ifrp = (struct ifreq *) ((char *) ifrp + n);
libexec/bootpd/getif.c
121
u_int n = 4; /* bytes left, then bitmask */
libexec/bootpd/getif.c
124
while (n && (*ca == *cb)) {
libexec/bootpd/getif.c
128
n--;
libexec/bootpd/getif.c
131
if (n) {
libexec/bootpd/getif.c
132
n = 0x80;
libexec/bootpd/getif.c
133
while (n && ((*ca & n) == (*cb & n))) {
libexec/bootpd/getif.c
135
n >>= 1;
libexec/bootpd/hwaddr.c
310
bitrev(int n)
libexec/bootpd/hwaddr.c
317
r |= (n & 1);
libexec/bootpd/hwaddr.c
318
n >>= 1;
libexec/bootpd/readfile.c
1153
int n, len, quoteflag;
libexec/bootpd/readfile.c
1156
n = 0;
libexec/bootpd/readfile.c
1158
while ((n < len) && (**src)) {
libexec/bootpd/readfile.c
1174
n++;
libexec/bootpd/readfile.c
1180
while ((n > 0) && isspace(dest[-1])) {
libexec/bootpd/readfile.c
1182
n--;
libexec/bootpd/readfile.c
1186
*length = n;
libexec/bootpd/readfile.c
1646
int n;
libexec/bootpd/readfile.c
1661
n = lookup_ipa(tmpstr, result);
libexec/bootpd/readfile.c
1662
if (n < 0)
libexec/bootpd/readfile.c
1664
return n;
libexec/bootpd/readfile.c
1697
n = pp - parts;
libexec/bootpd/readfile.c
1698
switch (n) {
libexec/bootpd/rtmsg.c
100
ioctl(s, FIONREAD, &n);
libexec/bootpd/rtmsg.c
94
int n;
libexec/bootpd/rtmsg.c
97
ioctl(s, FIONREAD, &n);
libexec/bootpd/rtmsg.c
98
while (n > 0) {
libexec/bootpd/tools/bootpef/bootpef.c
132
int n;
libexec/bootpd/tools/bootpef/bootpef.c
188
if (!stmp || (sscanf(stmp, "%d", &n) != 1) || (n < 0)) {
libexec/bootpd/tools/bootpef/bootpef.c
193
debug = n;
libexec/bootpd/tools/bootptest/bootptest.c
142
int n, fromlen, recvcnt;
libexec/bootpd/tools/bootptest/bootptest.c
360
n = BUFLEN - sizeof(*bp) + BP_VEND_LEN;
libexec/bootpd/tools/bootptest/bootptest.c
361
n = read(fd, bp->bp_vend, n);
libexec/bootpd/tools/bootptest/bootptest.c
363
if (n < 0) {
libexec/bootpd/tools/bootptest/bootptest.c
367
printf("read %d bytes of vendor template\n", n);
libexec/bootpd/tools/bootptest/bootptest.c
368
if (n > BP_VEND_LEN) {
libexec/bootpd/tools/bootptest/bootptest.c
371
snaplen += (n - BP_VEND_LEN);
libexec/bootpd/tools/bootptest/bootptest.c
392
n = select(s + 1, (fd_set *) & readfds, NULL, NULL, &tv);
libexec/bootpd/tools/bootptest/bootptest.c
393
if (n < 0) {
libexec/bootpd/tools/bootptest/bootptest.c
397
if (n == 0) {
libexec/bootpd/tools/bootptest/bootptest.c
413
n = recvfrom(s, rcvbuf, BUFLEN, 0,
libexec/bootpd/tools/bootptest/bootptest.c
415
if (n <= 0) {
libexec/bootpd/tools/bootptest/bootptest.c
418
if (n < sizeof(struct bootp)) {
libexec/bootpd/tools/bootptest/bootptest.c
427
snaplen = n;
libexec/bootpd/tools/bootptest/bootptest.c
429
bootp_print(rcvbuf, n, sin_from.sin_port, 0);
libexec/diff3prog/diff3prog.c
146
int ch, i, m, n;
libexec/diff3prog/diff3prog.c
185
n = readin(argv[1], &d23);
libexec/diff3prog/diff3prog.c
190
merge(m, n);
libexec/diff3prog/diff3prog.c
266
get_line(FILE *b, size_t *n)
libexec/diff3prog/diff3prog.c
288
if (n != NULL)
libexec/diff3prog/diff3prog.c
289
*n = len;
libexec/diff3prog/diff3prog.c
462
size_t j, n;
libexec/diff3prog/diff3prog.c
465
for (n = 0; cline[i] < from - 1; n += j) {
libexec/diff3prog/diff3prog.c
472
return ((int) n);
libexec/diff3prog/diff3prog.c
546
edscript(int n)
libexec/diff3prog/diff3prog.c
552
for (; n > 0; n--) {
libexec/diff3prog/diff3prog.c
553
if (!oflag || !overlap[n])
libexec/diff3prog/diff3prog.c
554
prange(&de[n].old);
libexec/diff3prog/diff3prog.c
556
printf("%da\n=======\n", de[n].old.to -1);
libexec/diff3prog/diff3prog.c
557
(void)fseek(fp[2], (long)de[n].new.from, SEEK_SET);
libexec/diff3prog/diff3prog.c
558
for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {
libexec/diff3prog/diff3prog.c
571
if (!oflag || !overlap[n])
libexec/diff3prog/diff3prog.c
575
printf("%da\n%s\n.\n", de[n].old.from - 1, f1mark);
libexec/dma/dfcompat.c
38
size_t n = siz;
libexec/dma/dfcompat.c
41
if (n != 0) {
libexec/dma/dfcompat.c
42
while (--n != 0) {
libexec/dma/dfcompat.c
49
if (n == 0) {
libexec/dma/net.c
112
n = write(fd, cmd + pos, len - pos);
libexec/dma/net.c
113
if (n < 0)
libexec/dma/net.c
115
pos += n;
libexec/dma/net.c
84
ssize_t n;
libexec/ftpd/ftpcmd.y
1188
get_line(char *s, int n, FILE *iop)
libexec/ftpd/ftpcmd.y
1196
for (c = 0; tmpline[c] != '\0' && --n > 0; ++c) {
libexec/ftpd/ftpcmd.y
1240
if (--n <= 0) {
libexec/ftpd/ftpcmd.y
1298
int n;
libexec/ftpd/ftpcmd.y
1307
n = get_line(cbuf, sizeof(cbuf)-1, stdin);
libexec/ftpd/ftpcmd.y
1308
if (n == -1) {
libexec/ftpd/ftpcmd.y
1311
} else if (n == -2) {
libexec/ftpd/ftpcmd.y
1394
n = strlen(cp);
libexec/ftpd/ftpcmd.y
1395
cpos += n - 1;
libexec/ftpd/ftpcmd.y
1399
if (n > 1 && cbuf[cpos] == '\n') {
libexec/ftpd/ftpcmd.y
1752
int n;
libexec/ftpd/ftpcmd.y
1759
for (pp = gl.gl_pathv, p = NULL, n = 0; *pp; pp++)
libexec/ftpd/ftpcmd.y
1762
n++;
libexec/ftpd/ftpcmd.y
1764
if (n == 0)
libexec/ftpd/ftpcmd.y
1766
else if (n == 1)
libexec/ftpd/ftpd.c
1668
off_t i, n;
libexec/ftpd/ftpd.c
1671
n = restart_point;
libexec/ftpd/ftpd.c
1673
while (i++ < n) {
libexec/ftpd/ftpd.c
1748
off_t i, n;
libexec/ftpd/ftpd.c
1751
n = restart_point;
libexec/ftpd/ftpd.c
1753
while (i++ < n) {
libexec/ftpd/ftpd.c
2478
reply(int n, const char *fmt, ...)
libexec/ftpd/ftpd.c
2482
printf("%d ", n);
libexec/ftpd/ftpd.c
2489
syslog(LOG_DEBUG, "<--- %d ", n);
libexec/ftpd/ftpd.c
2497
lreply(int n, const char *fmt, ...)
libexec/ftpd/ftpd.c
2501
printf("%d- ", n);
libexec/ftpd/ftpd.c
2508
syslog(LOG_DEBUG, "<--- %d- ", n);
libexec/ftpd/ftpd.c
3312
int n;
libexec/ftpd/ftpd.c
3315
for (p = s, n = 0; *p; p++)
libexec/ftpd/ftpd.c
3317
n++;
libexec/ftpd/ftpd.c
3319
if ((s2 = malloc(p - s + n + 1)) == NULL)
libexec/getty/subr.c
139
if (cgetnum(buf, np->field, &n) == -1)
libexec/getty/subr.c
143
np->value = n;
libexec/getty/subr.c
232
set_flags(int n)
libexec/getty/subr.c
237
switch (n) {
libexec/getty/subr.c
328
if (n == 1) { /* read mode flags */
libexec/getty/subr.c
341
if (n == 0)
libexec/getty/subr.c
63
long n;
libexec/rbootd/bpf.c
109
if (ioctl(BpfFd, BIOCGDLT, (caddr_t)&n) < 0) {
libexec/rbootd/bpf.c
113
if (n != DLT_EN10MB) {
libexec/rbootd/bpf.c
115
IntfName, n);
libexec/rbootd/bpf.c
122
n = 1;
libexec/rbootd/bpf.c
123
if (ioctl(BpfFd, BIOCIMMEDIATE, (caddr_t)&n) < 0) {
libexec/rbootd/bpf.c
211
int minunit, n;
libexec/rbootd/bpf.c
256
n = atoi(cp);
libexec/rbootd/bpf.c
257
if (n < minunit) {
libexec/rbootd/bpf.c
258
minunit = n;
libexec/rbootd/bpf.c
85
int n = 0;
libexec/rbootd/defs.h
74
#define STRNEQN(s1,s2,n) ((*s1 == *s2) && (strncmp(s1,s2,n) == 0))
libexec/rtld-elf/libmap.c
395
lm_findn (const char *p, const char *f, const int n)
libexec/rtld-elf/libmap.c
399
if (n < sizeof(pathbuf) - 1)
libexec/rtld-elf/libmap.c
402
s = xmalloc(n + 1);
libexec/rtld-elf/libmap.c
403
memcpy(s, f, n);
libexec/rtld-elf/libmap.c
404
s[n] = '\0';
libexec/rtld-elf/libmap.c
427
lmp_find (const char *n)
libexec/rtld-elf/libmap.c
431
dbg("%s(\"%s\")", __func__, n);
libexec/rtld-elf/libmap.c
434
if ((lmp->type == T_EXACT && strcmp(n, lmp->p) == 0) ||
libexec/rtld-elf/libmap.c
435
(lmp->type == T_DIRECTORY && strncmp(n, lmp->p, strlen(lmp->p)) == 0) ||
libexec/rtld-elf/libmap.c
436
(lmp->type == T_BASENAME && strcmp(quickbasename(n), lmp->p) == 0))
libexec/rtld-elf/libmap.c
442
lmp_init (char *n)
libexec/rtld-elf/libmap.c
446
dbg("%s(\"%s\")", __func__, n);
libexec/rtld-elf/libmap.c
449
lmp->p = n;
libexec/rtld-elf/libmap.c
450
if (n[strlen(n)-1] == '/')
libexec/rtld-elf/libmap.c
452
else if (strchr(n,'/') == NULL)
libexec/rtld-elf/malloc.c
139
long n;
libexec/rtld-elf/malloc.c
147
pagesz = n = getpagesize();
libexec/rtld-elf/malloc.c
151
n = n - sizeof (*op) - ((long)op & (n - 1));
libexec/rtld-elf/malloc.c
152
if (n < 0)
libexec/rtld-elf/malloc.c
153
n += pagesz;
libexec/rtld-elf/malloc.c
154
if (n) {
libexec/rtld-elf/malloc.c
155
pagepool_start += n;
libexec/rtld-elf/malloc.c
170
if (nbytes <= (unsigned long)(n = pagesz - sizeof (*op) - RSLOP)) {
libexec/rtld-elf/malloc.c
178
n = -(sizeof (*op) + RSLOP);
libexec/rtld-elf/malloc.c
183
while (nbytes > amt + n) {
libexec/rtld-elf/malloc.c
442
morepages(int n)
libexec/rtld-elf/malloc.c
457
if ((pagepool_start = mmap(0, n * pagesz,
libexec/rtld-elf/malloc.c
463
pagepool_end = pagepool_start + n * pagesz;
libexec/rtld-elf/malloc.c
466
return n;
libexec/rtld-elf/rtld.c
2006
free_needed_filtees(Needed_Entry *n)
libexec/rtld-elf/rtld.c
2010
for (needed = n; needed != NULL; needed = needed->next) {
libexec/rtld-elf/rtld.c
2016
for (needed = n; needed != NULL; needed = needed1) {
libexec/rtld-elf/rtld.c
291
#define LD_UTRACE(e, h, mb, ms, r, n) do { \
libexec/rtld-elf/rtld.c
293
ld_utrace_log(e, h, mb, ms, r, n); \
libexec/rtld-elf/rtld.c
3970
const Needed_Entry *n;
libexec/rtld-elf/rtld.c
3978
for (n = needed; n != NULL; n = n->next) {
libexec/rtld-elf/rtld.c
3979
if (n->obj == NULL ||
libexec/rtld-elf/rtld.c
3980
(res = symlook_list(&req1, &n->obj->dagmembers, dlp)) != 0)
libexec/rtld-elf/rtld_printf.c
128
int ch, n;
libexec/rtld-elf/rtld_printf.c
190
for (n = 0;; ++fmt) {
libexec/rtld-elf/rtld_printf.c
191
n = n * 10 + ch - '0';
libexec/rtld-elf/rtld_printf.c
197
dwidth = n;
libexec/rtld-elf/rtld_printf.c
199
width = n;
libexec/rtld-elf/rtld_printf.c
211
n = *p++;
libexec/rtld-elf/rtld_printf.c
212
if (num & (1 << (n - 1))) {
libexec/rtld-elf/rtld_printf.c
214
for (; (n = *p) > ' '; ++p)
libexec/rtld-elf/rtld_printf.c
215
PCHAR(n);
libexec/rtld-elf/rtld_printf.c
301
n = strlen (p);
libexec/rtld-elf/rtld_printf.c
303
for (n = 0; n < dwidth && p[n]; n++)
libexec/rtld-elf/rtld_printf.c
306
width -= n;
libexec/rtld-elf/rtld_printf.c
311
while (n--)
libexec/rtld-elf/rtld_printf.c
376
p = ksprintn(nbuf, num, base, &n, upper);
libexec/rtld-elf/rtld_printf.c
389
width -= tmp + imax(dwidth, n);
libexec/rtld-elf/rtld_printf.c
390
dwidth -= n;
libexec/telnetd/defs.h
117
#define FD_SET(n, p) ((p)->fds_bits[0] |= (1<<(n)))
libexec/telnetd/defs.h
118
#define FD_CLR(n, p) ((p)->fds_bits[0] &= ~(1<<(n)))
libexec/telnetd/defs.h
119
#define FD_ISSET(n, p) ((p)->fds_bits[0] & (1<<(n)))
libexec/telnetd/utility.c
118
int n;
libexec/telnetd/utility.c
120
if ((n = pfrontp - pbackp) > 0) {
libexec/telnetd/utility.c
122
output_data("td: ptyflush %d chars\r\n", n));
libexec/telnetd/utility.c
123
DIAG(TD_PTYDATA, printdata("pd", pbackp, n));
libexec/telnetd/utility.c
124
n = write(pty, pbackp, n);
libexec/telnetd/utility.c
126
if (n < 0) {
libexec/telnetd/utility.c
131
pbackp += n;
libexec/telnetd/utility.c
247
int n;
libexec/telnetd/utility.c
250
while ((n = nfrontp - nbackp) > 0) {
libexec/telnetd/utility.c
254
n += output_data("td: netflush %d chars\r\n", n);
libexec/telnetd/utility.c
272
n = write(net, nbackp, n); /* normal write */
libexec/telnetd/utility.c
274
n = neturg - nbackp;
libexec/telnetd/utility.c
283
if (n > 1) {
libexec/telnetd/utility.c
284
n = send(net, nbackp, n-1, 0); /* send URGENT all by itself */
libexec/telnetd/utility.c
286
n = send(net, nbackp, n, MSG_OOB); /* URGENT data */
libexec/telnetd/utility.c
289
if (n == -1) {
libexec/telnetd/utility.c
295
nbackp += n;
libexec/tftpd/tftpd.c
110
int n;
libexec/tftpd/tftpd.c
171
n = recvfrom(0, buf, sizeof (buf), 0,
libexec/tftpd/tftpd.c
173
if (n < 0) {
libexec/tftpd/tftpd.c
213
n = i;
libexec/tftpd/tftpd.c
303
tftp(tp, n);
libexec/tftpd/tftpd.c
583
int size, n;
libexec/tftpd/tftpd.c
619
n = recv(peer, ackbuf, sizeof (ackbuf), 0);
libexec/tftpd/tftpd.c
621
if (n < 0) {
libexec/tftpd/tftpd.c
662
int n, size;
libexec/tftpd/tftpd.c
683
n = recv(peer, dp, PKTSIZE, 0);
libexec/tftpd/tftpd.c
685
if (n < 0) { /* really? */
libexec/tftpd/tftpd.c
704
size = writeit(file, &dp, n - 4, pf->f_convert);
libexec/tftpd/tftpd.c
705
if (size != (n-4)) { /* ahem */
libexec/tftpd/tftpd.c
720
n = recv(peer, buf, sizeof (buf), 0); /* normally times out and quits */
libexec/tftpd/tftpd.c
722
if (n >= 4 && /* if read some data */
libexec/tftpd/tftpd.c
821
int size, i, n;
libexec/tftpd/tftpd.c
830
n = snprintf(bp, size, "%s%c%d", options[i].o_type,
libexec/tftpd/tftpd.c
832
bp += n+1;
libexec/tftpd/tftpd.c
833
size -= n+1;
libexec/tftpd/tftpd.c
853
n = recv(peer, ackbuf, sizeof (ackbuf), 0);
libexec/tftpd/tftpd.c
855
if (n < 0) {
sbin/badsect/badsect.c
197
int n;
sbin/badsect/badsect.c
203
n = read(fsi, bf, size);
sbin/badsect/badsect.c
204
if (n != size) {
sbin/cryptdisks/cryptdisks.c
124
int c, n, i;
sbin/cryptdisks/cryptdisks.c
141
for (n = 1; c < i; c++) {
sbin/cryptdisks/cryptdisks.c
145
if ((c >= 1) && (&buffer[c] != tokens[n-1])) {
sbin/cryptdisks/cryptdisks.c
152
tokens[n-1] = &buffer[c+1];
sbin/cryptdisks/cryptdisks.c
174
tokens[n++] = &buffer[c--];
sbin/cryptdisks/cryptdisks.c
177
tokens[n] = NULL;
sbin/cryptdisks/cryptdisks.c
184
return n;
sbin/cryptdisks/cryptdisks.c
450
int c, n, i = 0;
sbin/cryptdisks/cryptdisks.c
464
n = line_tokenize(buffer, &iswhitespace, '#', tokens);
sbin/cryptdisks/cryptdisks.c
471
if ((n < 2) || (tokens[0][0] == '\0'))
sbin/cryptdisks/cryptdisks.c
478
if (n >= 4)
sbin/devfsctl/devfsctl.c
607
int c, n, i = 0;
sbin/devfsctl/devfsctl.c
630
for (n = 1; c < i; c++) {
sbin/devfsctl/devfsctl.c
634
if ((c >= 1) && (&buffer[c] != tokens[n-1])) {
sbin/devfsctl/devfsctl.c
638
tokens[n-1] = &buffer[c+1];
sbin/devfsctl/devfsctl.c
655
tokens[n++] = &buffer[c--];
sbin/devfsctl/devfsctl.c
658
tokens[n] = NULL;
sbin/devfsctl/devfsctl.c
665
if ((quote) || (n < 2) || (tokens[0][0] == '\0'))
sbin/dhclient/dhclient.c
108
findproto(char *cp, int n)
sbin/dhclient/dhclient.c
113
if (n == 0)
sbin/dhclient/dhclient.c
116
if (i & n) {
sbin/dhclient/dhclient.c
138
get_ifa(char *cp, int n)
sbin/dhclient/dhclient.c
143
if (n == 0)
sbin/dhclient/dhclient.c
146
if (i & n) {
sbin/dhclient/dhclient.c
169
ssize_t n;
sbin/dhclient/dhclient.c
173
n = read(routefd, &msg, sizeof(msg));
sbin/dhclient/dhclient.c
174
} while (n == -1 && errno == EINTR);
sbin/dhclient/dhclient.c
177
if (n < sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen ||
sbin/dhclient/dhclient.c
2321
ssize_t n;
sbin/dhclient/dhclient.c
2325
n = read(fd, buf, sizeof(buf));
sbin/dhclient/dhclient.c
2326
if (n > 0) {
sbin/dhclient/dhclient.c
2327
buf[n-1] = 0;
sbin/dhclient/privsep.c
54
ssize_t n;
sbin/dhclient/privsep.c
57
n = write(sock, buf->buf + buf->rpos, buf->size - buf->rpos);
sbin/dhclient/privsep.c
58
if (n == 0) /* connection closed */
sbin/dhclient/privsep.c
60
if (n != -1 && n < buf->size - buf->rpos)
sbin/dhclient/privsep.c
63
} while (n == -1 && (errno == EAGAIN || errno == EINTR));
sbin/dhclient/privsep.c
65
if (n == -1)
sbin/dhclient/privsep.c
75
ssize_t n;
sbin/dhclient/privsep.c
78
n = read(sock, buf, nbytes);
sbin/dhclient/privsep.c
79
if (n == 0) { /* connection closed */
sbin/dhclient/privsep.c
85
if (n != -1 && n < nbytes)
sbin/dhclient/privsep.c
87
} while (n == -1 && (errno == EINTR || errno == EAGAIN));
sbin/dhclient/privsep.c
89
if (n == -1)
sbin/disklabel32/disklabel.c
1050
#define NXTNUM(n) do { \
sbin/disklabel32/disklabel.c
1056
(n) = strtoul(cp, NULL, 10); \
sbin/disklabel32/disklabel.c
1061
#define NXTWORD(w,n) do { \
sbin/disklabel32/disklabel.c
1068
(n) = strtoul(cp, &tmp, 10); \
sbin/disklabel64/disklabel64.c
1480
uint32_t n;
sbin/disklabel64/disklabel64.c
1529
for (n = 0; n < lp->d_npartitions; ++n) {
sbin/disklabel64/disklabel64.c
1530
part = &lp->d_partitions[n];
sbin/dmesg/dmesg.c
143
u_int n;
sbin/dmesg/dmesg.c
179
n = xindex - rindex;
sbin/dmesg/dmesg.c
180
if (n > cur.msg_size - 1024) {
sbin/dmesg/dmesg.c
182
n = xindex - rindex;
sbin/dmesg/dmesg.c
191
if (buflen > n)
sbin/dmesg/dmesg.c
192
buflen = n;
sbin/dmesg/dmesg.c
203
n = n - buflen;
sbin/dmesg/dmesg.c
205
if ((int)n <= 0) {
sbin/dump/cache.c
109
int n;
sbin/dump/cache.c
152
n = pread(fd, blk->b_Data, BlockSize, blk->b_Offset);
sbin/dump/cache.c
153
if (n != BlockSize) {
sbin/dump/dumprmt.c
226
int n, i, cc;
sbin/dump/dumprmt.c
229
n = rmtcall("read", line);
sbin/dump/dumprmt.c
230
if (n < 0)
sbin/dump/dumprmt.c
232
return (n);
sbin/dump/dumprmt.c
233
for (i = 0; i < n; i += cc) {
sbin/dump/dumprmt.c
234
cc = read(rmtape, buf+i, n - i);
sbin/dump/dumprmt.c
238
return (n);
sbin/dumpfs/dumpfs.c
108
ssize_t n;
sbin/dumpfs/dumpfs.c
116
if ((n = read(fd, &afs, SBSIZE)) == -1)
sbin/dumpfs/dumpfs.c
119
if (n != SBSIZE) {
sbin/dumpfs/dumpfs.c
315
ssize_t n;
sbin/dumpfs/dumpfs.c
323
if ((n = read(fd, &afs, SBSIZE)) == -1)
sbin/dumpfs/dumpfs.c
326
if (n != SBSIZE) {
sbin/fdisk/fdisk.c
501
int boot_fd, n;
sbin/fdisk/fdisk.c
520
n = read(boot_fd, mboot.bootinst, mboot.bootinst_size);
sbin/fdisk/fdisk.c
522
if (n == -1)
sbin/fdisk/fdisk.c
524
if (n != mboot.bootinst_size)
sbin/ffsinfo/ffsinfo.c
106
n = read(fsi, bf, size);
sbin/ffsinfo/ffsinfo.c
107
if (n != (ssize_t)size) {
sbin/ffsinfo/ffsinfo.c
99
ssize_t n;
sbin/fsck/dir.c
103
unsigned int dsize, n;
sbin/fsck/dir.c
134
if ((n = (*idesc->id_func)(idesc)) & ALTERED) {
sbin/fsck/dir.c
152
if (n & STOP)
sbin/fsck/dir.c
153
return (n);
sbin/fsck/inode.c
114
for (ap = &dino.di_ib[0], n = 1; n <= UFS_NIADDR; ap++, n++) {
sbin/fsck/inode.c
117
ret = iblock(idesc, n, remsize);
sbin/fsck/inode.c
151
int i, n, (*func)(), nif;
sbin/fsck/inode.c
159
if (((n = (*func)(idesc)) & KEEPON) == 0)
sbin/fsck/inode.c
160
return (n);
sbin/fsck/inode.c
191
n = (*func)(idesc);
sbin/fsck/inode.c
193
n = iblock(idesc, ilevel, isize);
sbin/fsck/inode.c
194
if (n & STOP) {
sbin/fsck/inode.c
196
return (n);
sbin/fsck/inode.c
61
long n, ndb, offset;
sbin/fsck/pass2.c
124
if ((n = inplast - i) > 1000)
sbin/fsck/pass2.c
125
n = 1000;
sbin/fsck/pass2.c
126
qsort(inpsort + i, (size_t)n, sizeof *inpsort, blksort);
sbin/fsck/pass2.c
227
int n, entrysize, ret = 0;
sbin/fsck/pass2.c
290
n = dirp->d_reclen - entrysize;
sbin/fsck/pass2.c
296
memset(dirp, 0, (size_t)n);
sbin/fsck/pass2.c
297
dirp->d_reclen = n;
sbin/fsck/pass2.c
323
n = DIRSIZ(0, dirp);
sbin/fsck/pass2.c
324
if (dirp->d_reclen < n + entrysize)
sbin/fsck/pass2.c
326
proto.d_reclen = dirp->d_reclen - n;
sbin/fsck/pass2.c
327
dirp->d_reclen = n;
sbin/fsck/pass2.c
330
dirp = (struct direct *)((char *)(dirp) + n);
sbin/fsck/pass2.c
390
n = 0;
sbin/fsck/pass2.c
393
n = reply("REMOVE");
sbin/fsck/pass2.c
409
n = reply("REMOVE");
sbin/fsck/pass2.c
421
n = 1;
sbin/fsck/pass2.c
425
if ((n = reply("REMOVE")) == 1)
sbin/fsck/pass2.c
451
n = 1;
sbin/fsck/pass2.c
454
if ((n = reply("REMOVE")) == 1)
sbin/fsck/pass2.c
478
if (n == 0)
sbin/fsck/pass2.c
57
long i, n;
sbin/fsck/pass4.c
53
int i, n, cg;
sbin/fsck/pass4.c
74
n = inoinfo(inumber)->ino_linkcnt;
sbin/fsck/pass4.c
75
if (n) {
sbin/fsck/pass4.c
76
adjust(&idesc, (short)n);
sbin/fsck_msdosfs/dir.c
1054
struct dirTodoNode *n = pendingDirectories->next;
sbin/fsck_msdosfs/dir.c
1061
pendingDirectories = n;
sbin/fsck_msdosfs/dir.c
881
struct dirTodoNode *n;
sbin/fsck_msdosfs/dir.c
987
if (!(n = newDirTodo())) {
sbin/fsck_msdosfs/dir.c
991
n->next = pendingDirectories;
sbin/fsck_msdosfs/dir.c
992
n->dir = d;
sbin/fsck_msdosfs/dir.c
993
pendingDirectories = n;
sbin/fsck_msdosfs/fat.c
1052
copyfat(struct fat_descriptor *fat, int n)
sbin/fsck_msdosfs/fat.c
1071
dst_off = boot->bpbResSectors + n * boot->FATsecs;
sbin/fsck_msdosfs/fat.c
1089
perr("Unable to write FAT %d", n);
sbin/fsirand/fsirand.c
111
int devfd, n, cg;
sbin/fsirand/fsirand.c
140
if ((n = read(devfd, (void *)sblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
142
(n < SBSIZE) ? "short read" : strerror(errno));
sbin/fsirand/fsirand.c
171
} else if ((n = write(devfd, (void *)sblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
173
cg + 1, device, (n < SBSIZE) ? "short write"
sbin/fsirand/fsirand.c
217
if ((n = write(devfd, (void *)sblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
219
(n < SBSIZE) ? "short write" : strerror(errno));
sbin/fsirand/fsirand.c
233
} else if ((n = write(devfd, (void *)sblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
235
cg + 1, device, (n < SBSIZE) ? "short write"
sbin/fsirand/fsirand.c
246
} else if ((n = read(devfd, inodebuf, ibufsize)) != ibufsize) {
sbin/fsirand/fsirand.c
248
(n < ibufsize) ? "short read" : strerror(errno));
sbin/fsirand/fsirand.c
252
for (n = 0; n < sblock->fs_ipg; n++, inumber++) {
sbin/fsirand/fsirand.c
257
inodebuf[n].di_gen);
sbin/fsirand/fsirand.c
259
inodebuf[n].di_gen = random();
sbin/fsirand/fsirand.c
270
} else if ((n = write(devfd, inodebuf, ibufsize)) !=
sbin/fsirand/fsirand.c
273
(n != ibufsize) ? "short write" :
sbin/fsirand/fsirand.c
59
int n, ex = 0;
sbin/fsirand/fsirand.c
62
while ((n = getopt(argc, argv, "bfp")) != -1) {
sbin/fsirand/fsirand.c
63
switch (n) {
sbin/fsirand/fsirand.c
90
for (n = optind; n < argc; n++) {
sbin/fsirand/fsirand.c
92
puts(argv[n]);
sbin/fsirand/fsirand.c
93
ex += fsirand(argv[n]);
sbin/fsirand/fsirand.c
94
if (n < argc - 1)
sbin/gpt/map.c
103
if (start == n->map_start) {
sbin/gpt/map.c
104
m->map_prev = n->map_prev;
sbin/gpt/map.c
105
m->map_next = n;
sbin/gpt/map.c
110
n->map_prev = m;
sbin/gpt/map.c
111
n->map_start += size;
sbin/gpt/map.c
112
n->map_size -= size;
sbin/gpt/map.c
113
} else if (start + size == n->map_start + n->map_size) {
sbin/gpt/map.c
114
p = n;
sbin/gpt/map.c
122
p = mkmap(n->map_start, start - n->map_start, n->map_type);
sbin/gpt/map.c
126
n->map_start += p->map_size + m->map_size;
sbin/gpt/map.c
127
n->map_size -= (p->map_size + m->map_size);
sbin/gpt/map.c
128
p->map_prev = n->map_prev;
sbin/gpt/map.c
130
n->map_prev = m;
sbin/gpt/map.c
131
m->map_next = n;
sbin/gpt/map.c
57
map_t *m, *n, *p;
sbin/gpt/map.c
59
n = mediamap;
sbin/gpt/map.c
60
while (n != NULL && n->map_start + n->map_size <= start)
sbin/gpt/map.c
61
n = n->map_next;
sbin/gpt/map.c
62
if (n == NULL)
sbin/gpt/map.c
65
if (n->map_start + n->map_size < start + size) {
sbin/gpt/map.c
69
(uintmax_t)n->map_start, (uintmax_t)n->map_size,
sbin/gpt/map.c
74
if (n->map_start == start && n->map_size == size) {
sbin/gpt/map.c
75
if (n->map_type != MAP_TYPE_UNUSED) {
sbin/gpt/map.c
76
if (n->map_type != MAP_TYPE_MBR_PART ||
sbin/gpt/map.c
82
n->map_type = type;
sbin/gpt/map.c
83
n->map_data = data;
sbin/gpt/map.c
84
return (n);
sbin/gpt/map.c
87
if (n->map_type != MAP_TYPE_UNUSED) {
sbin/gpt/map.c
88
if (n->map_type != MAP_TYPE_MBR_PART ||
sbin/gpt/map.c
91
n->map_type, type);
sbin/gpt/map.c
94
n->map_type = MAP_TYPE_UNUSED;
sbin/growfs/growfs.c
1541
ssize_t n;
sbin/growfs/growfs.c
1548
n = read(fsi, bf, size);
sbin/growfs/growfs.c
1549
if (n != (ssize_t)size) {
sbin/growfs/growfs.c
1564
ssize_t n;
sbin/growfs/growfs.c
1575
n = write(fso, bf, size);
sbin/growfs/growfs.c
1576
if (n != (ssize_t)size) {
sbin/hammer/cmd_cleanup.c
1252
int n;
sbin/hammer/cmd_cleanup.c
1270
n = 0;
sbin/hammer/cmd_cleanup.c
1275
if (n == nmax - 1) {
sbin/hammer/cmd_cleanup.c
1279
av[n++] = arg;
sbin/hammer/cmd_cleanup.c
1281
av[n++] = NULL;
sbin/hammer/cmd_cleanup.c
581
int n;
sbin/hammer/cmd_cleanup.c
583
n = fread(config->config.text, 1, sizeof(config->config.text) - 1, fp);
sbin/hammer/cmd_cleanup.c
584
if (n >= 0)
sbin/hammer/cmd_cleanup.c
585
bzero(config->config.text + n, sizeof(config->config.text) - n);
sbin/hammer/cmd_config.c
110
ssize_t n;
sbin/hammer/cmd_config.c
193
n = read(fd, config.config.text, sizeof(config.config.text) - 1);
sbin/hammer/cmd_config.c
194
if (n < 0) {
sbin/hammer/cmd_config.c
198
if (n == sizeof(config.config.text) - 1) {
sbin/hammer/cmd_config.c
203
bzero(config.config.text + n, sizeof(config.config.text) - n);
sbin/hammer/cmd_config.c
54
ssize_t n;
sbin/hammer/cmd_config.c
87
n = read(fd, config.config.text, sizeof(config.config.text) - 1);
sbin/hammer/cmd_config.c
88
if (n == sizeof(config.config.text) - 1) {
sbin/hammer/cmd_config.c
93
bzero(config.config.text + n, sizeof(config.config.text) - n);
sbin/hammer/cmd_history.c
216
int n;
sbin/hammer/cmd_history.c
224
n = (len > (int)sizeof(buf)) ? (int)sizeof(buf) : len;
sbin/hammer/cmd_history.c
225
r = read(fd, buf, n);
sbin/hammer/cmd_history.c
229
for (n = 0; n < r; ++n) {
sbin/hammer/cmd_history.c
230
if (isprint(buf[n]))
sbin/hammer/cmd_history.c
231
putc(buf[n], stdout);
sbin/hammer/cmd_mirror.c
100
int n;
sbin/hammer/cmd_mirror.c
1285
size_t n;
sbin/hammer/cmd_mirror.c
1298
for (n = 0; n < HAMMER_MREC_HEADSIZE; n += i) {
sbin/hammer/cmd_mirror.c
1299
i = read(fd, (char *)pickup + n,
sbin/hammer/cmd_mirror.c
1300
HAMMER_MREC_HEADSIZE - n);
sbin/hammer/cmd_mirror.c
1304
if (n == 0)
sbin/hammer/cmd_mirror.c
1306
if (n != HAMMER_MREC_HEADSIZE) {
sbin/hammer/cmd_mirror.c
1348
for (n = HAMMER_MREC_HEADSIZE; n < bytes; n += i) {
sbin/hammer/cmd_mirror.c
1349
i = read(fd, buf + count + n, bytes - n);
sbin/hammer/cmd_mirror.c
1353
if (n != bytes) {
sbin/hammer/cmd_mirror.c
1413
size_t n;
sbin/hammer/cmd_mirror.c
1420
n = HAMMER_MREC_HEADSIZE;
sbin/hammer/cmd_mirror.c
1425
for (n = 0; n < HAMMER_MREC_HEADSIZE; n += i) {
sbin/hammer/cmd_mirror.c
1426
i = read(fdin, (char *)&mrechd + n, HAMMER_MREC_HEADSIZE - n);
sbin/hammer/cmd_mirror.c
1430
if (n == 0) {
sbin/hammer/cmd_mirror.c
1434
if (n != HAMMER_MREC_HEADSIZE) {
sbin/hammer/cmd_mirror.c
1450
while (n < bytes) {
sbin/hammer/cmd_mirror.c
1451
i = read(fdin, (char *)mrec + n, bytes - n);
sbin/hammer/cmd_mirror.c
1454
n += i;
sbin/hammer/cmd_mirror.c
1456
if (n != bytes) {
sbin/hammer/cmd_mirror.c
163
n = validate_mrec_header(fd, 0, 0, pfs.pfs_id, &pickup,
sbin/hammer/cmd_mirror.c
1639
size_t n;
sbin/hammer/cmd_mirror.c
1648
n = BandwidthOpt - *bwcount;
sbin/hammer/cmd_mirror.c
165
if (n < 0) { /* got TERM record */
sbin/hammer/cmd_mirror.c
1650
n = nbytes;
sbin/hammer/cmd_mirror.c
1651
if (n)
sbin/hammer/cmd_mirror.c
1652
r = write(fd, buf, n);
sbin/hammer/cmd_mirror.c
1658
if ((size_t)r != n)
sbin/hammer/cmd_mirror.c
1660
*bwcount += n;
sbin/hammer/cmd_mirror.c
1713
size_t n;
sbin/hammer/cmd_mirror.c
1727
for (n = 0; n < i; ++n) {
sbin/hammer/cmd_mirror.c
1728
if (ScoreBuf[n] == 0)
sbin/hammer/cmd_mirror.c
1729
ScoreBuf[n] = ' ';
sbin/hammer/cmd_mirror.c
1734
n = strlen(ScoreBuf + i);
sbin/hammer/cmd_mirror.c
1735
while (n < w - 1) {
sbin/hammer/cmd_mirror.c
1736
ScoreBuf[i + n] = ' ';
sbin/hammer/cmd_mirror.c
1737
++n;
sbin/hammer/cmd_mirror.c
1739
ScoreBuf[i + n] = '\n';
sbin/hammer/cmd_mirror.c
306
n = writebw(1, mirror.ubuf, mirror.count,
sbin/hammer/cmd_mirror.c
309
n = write(1, mirror.ubuf, mirror.count);
sbin/hammer/cmd_mirror.c
311
if (n != mirror.count) {
sbin/hammer/cmd_mirror.c
775
int n;
sbin/hammer/cmd_mirror.c
850
n = validate_mrec_header(fd, 0, 1, pfs.pfs_id, &pickup,
sbin/hammer/cmd_mirror.c
852
if (n < 0) { /* got TERM record */
sbin/hammer/cmd_pfs.c
735
int n;
sbin/hammer/cmd_pfs.c
739
n = strtol(str, &ptr, 10);
sbin/hammer/cmd_pfs.c
740
if (n < 0)
sbin/hammer/cmd_pfs.c
743
days = n;
sbin/hammer/cmd_pfs.c
746
n = strtol(ptr + 1, &ptr, 10);
sbin/hammer/cmd_pfs.c
748
n = 0;
sbin/hammer/cmd_pfs.c
750
if (n < 0)
sbin/hammer/cmd_pfs.c
752
hrs = n;
sbin/hammer/cmd_pfs.c
754
n = strtol(ptr + 1, &ptr, 10);
sbin/hammer/cmd_pfs.c
755
if (n < 0)
sbin/hammer/cmd_pfs.c
757
mins = n;
sbin/hammer/cmd_pfs.c
759
n = strtol(ptr + 1, &ptr, 10);
sbin/hammer/cmd_pfs.c
760
if (n < 0)
sbin/hammer/cmd_pfs.c
762
secs = n;
sbin/hammer/ondisk.c
207
int n;
sbin/hammer/ondisk.c
211
n = readhammervol(volume);
sbin/hammer/ondisk.c
212
if (n == -1) {
sbin/hammer/ondisk.c
752
int n;
sbin/hammer/ondisk.c
795
for (n = 0; n < limit_index; ++n)
sbin/hammer/ondisk.c
796
ondisk->vol0_undo_array[n] = alloc_undo_bigblock(root_vol);
sbin/hammer/ondisk.c
797
while (n < HAMMER_MAX_UNDO_BIGBLOCKS)
sbin/hammer/ondisk.c
798
ondisk->vol0_undo_array[n++] = HAMMER_BLOCKMAP_UNAVAIL;
sbin/hammer/ondisk.c
958
ssize_t n;
sbin/hammer/ondisk.c
960
n = pread(volume->fd, data, size, offset);
sbin/hammer/ondisk.c
961
if (n != size)
sbin/hammer/ondisk.c
985
ssize_t n;
sbin/hammer/ondisk.c
990
n = pwrite(volume->fd, data, size, offset);
sbin/hammer/ondisk.c
991
if (n != size)
sbin/hammer2/cmd_cleanup.c
47
int n;
sbin/hammer2/cmd_cleanup.c
54
n = getmntinfo(&fsary, MNT_NOWAIT);
sbin/hammer2/cmd_cleanup.c
55
if (n <= 0) {
sbin/hammer2/cmd_cleanup.c
60
for (i = 0; i < n; ++i) {
sbin/hammer2/cmd_pfs.c
222
int n;
sbin/hammer2/cmd_pfs.c
239
for (n = 0; n < nmnts; ++n) {
sbin/hammer2/cmd_pfs.c
240
if ((fd = hammer2_ioctl_handle(mnts[n])) < 0) {
sbin/hammer2/cmd_recover.c
1246
int n;
sbin/hammer2/cmd_recover.c
1260
for (n = 0; n < count; ++n) {
sbin/hammer2/cmd_recover.c
1265
bref = &base[n];
sbin/hammer2/cmd_recover.c
1394
int n;
sbin/hammer2/cmd_recover.c
1396
for (n = 0; n < count; ++n) {
sbin/hammer2/cmd_recover.c
1400
bref = &base[n];
sbin/hammer2/cmd_rsa.c
127
int n;
sbin/hammer2/cmd_rsa.c
190
while ((n = read(0, data_in + off, blksize - off)) > 0) {
sbin/hammer2/cmd_rsa.c
191
off += n;
sbin/hammer2/cmd_rsa.c
237
if (n < 0) {
sbin/hammer2/cmd_rsa.c
262
int n;
sbin/hammer2/cmd_rsa.c
324
while ((n = read(0, data_in + off, blksize - off)) > 0) {
sbin/hammer2/cmd_rsa.c
325
off += n;
sbin/hammer2/cmd_rsa.c
371
if (n < 0) {
sbin/hammer2/cmd_service.c
755
size_t n;
sbin/hammer2/cmd_service.c
758
n = 0;
sbin/hammer2/cmd_service.c
759
error = sysctlbyname("kern.disks", NULL, &n, NULL, 0);
sbin/hammer2/cmd_service.c
760
if (error < 0 || n == 0)
sbin/hammer2/cmd_service.c
762
if (n >= sizeof(tmpbuf))
sbin/hammer2/cmd_service.c
763
buf = malloc(n + 1);
sbin/hammer2/cmd_service.c
766
error = sysctlbyname("kern.disks", buf, &n, NULL, 0);
sbin/hammer2/cmd_service.c
768
buf[n] = 0;
sbin/hammer2/cmd_volume.c
44
int fd, i, j, n, w, all = 0, ecode = 0;
sbin/hammer2/cmd_volume.c
73
n = (int)strlen(entry->path);
sbin/hammer2/cmd_volume.c
74
if (n > w)
sbin/hammer2/cmd_volume.c
75
w = n;
sbin/hammer2/ondisk.c
482
int i, n, w = 0;
sbin/hammer2/ondisk.c
486
n = (int)strlen(vol->path);
sbin/hammer2/ondisk.c
487
if (n > w)
sbin/hammer2/ondisk.c
488
w = n;
sbin/hammer2/subs.c
420
int n;
sbin/hammer2/subs.c
428
n = getfsstat(NULL, 0, MNT_NOWAIT);
sbin/hammer2/subs.c
429
av = calloc(n, sizeof(char *));
sbin/hammer2/subs.c
430
fs = calloc(n, sizeof(struct statfs));
sbin/hammer2/subs.c
431
if (getfsstat(fs, sizeof(*fs) * n, MNT_NOWAIT) != n) {
sbin/hammer2/subs.c
440
for (i = w = 0; i < n; ++i) {
sbin/hammer2/zlib/hammer2_zlib_adler32.c
108
n = NMAX / 16; /* NMAX is divisible by 16 */
sbin/hammer2/zlib/hammer2_zlib_adler32.c
112
} while (--n);
sbin/hammer2/zlib/hammer2_zlib_adler32.c
72
unsigned n;
sbin/hammer2/zlib/hammer2_zlib_deflate.c
800
register unsigned n, m;
sbin/hammer2/zlib/hammer2_zlib_deflate.c
839
n = s->hash_size;
sbin/hammer2/zlib/hammer2_zlib_deflate.c
840
p = &s->head[n];
sbin/hammer2/zlib/hammer2_zlib_deflate.c
844
} while (--n);
sbin/hammer2/zlib/hammer2_zlib_deflate.c
846
n = wsize;
sbin/hammer2/zlib/hammer2_zlib_deflate.c
848
p = &s->prev[n];
sbin/hammer2/zlib/hammer2_zlib_deflate.c
855
} while (--n);
sbin/hammer2/zlib/hammer2_zlib_deflate.c
874
n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
sbin/hammer2/zlib/hammer2_zlib_deflate.c
875
s->lookahead += n;
sbin/hammer2/zlib/hammer2_zlib_inflate.c
444
#define NEEDBITS(n) \
sbin/hammer2/zlib/hammer2_zlib_inflate.c
446
while (bits < (unsigned)(n)) \
sbin/hammer2/zlib/hammer2_zlib_inflate.c
451
#define BITS(n) \
sbin/hammer2/zlib/hammer2_zlib_inflate.c
452
((unsigned)hold & ((1U << (n)) - 1))
sbin/hammer2/zlib/hammer2_zlib_inflate.c
455
#define DROPBITS(n) \
sbin/hammer2/zlib/hammer2_zlib_inflate.c
457
hold >>= (n); \
sbin/hammer2/zlib/hammer2_zlib_inflate.c
458
bits -= (unsigned)(n); \
sbin/hammer2/zlib/hammer2_zlib_trees.c
1134
int n;
sbin/hammer2/zlib/hammer2_zlib_trees.c
1137
for (n = 0; n <= 31; n++, black_mask >>= 1)
sbin/hammer2/zlib/hammer2_zlib_trees.c
1138
if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
sbin/hammer2/zlib/hammer2_zlib_trees.c
1145
for (n = 32; n < LITERALS; n++)
sbin/hammer2/zlib/hammer2_zlib_trees.c
1146
if (s->dyn_ltree[n].Freq != 0)
sbin/hammer2/zlib/hammer2_zlib_trees.c
239
int n; /* iterates over tree elements */
sbin/hammer2/zlib/hammer2_zlib_trees.c
262
for (n = 0; n < (1<<extra_lbits[code]); n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
277
for (n = 0; n < (1<<extra_dbits[code]); n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
285
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
293
n = 0;
sbin/hammer2/zlib/hammer2_zlib_trees.c
294
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
sbin/hammer2/zlib/hammer2_zlib_trees.c
295
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
sbin/hammer2/zlib/hammer2_zlib_trees.c
296
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
sbin/hammer2/zlib/hammer2_zlib_trees.c
297
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
sbin/hammer2/zlib/hammer2_zlib_trees.c
305
for (n = 0; n < D_CODES; n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
306
static_dtree[n].Len = 5;
sbin/hammer2/zlib/hammer2_zlib_trees.c
307
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
sbin/hammer2/zlib/hammer2_zlib_trees.c
416
int n; /* iterates over tree elements */
sbin/hammer2/zlib/hammer2_zlib_trees.c
419
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
sbin/hammer2/zlib/hammer2_zlib_trees.c
420
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
sbin/hammer2/zlib/hammer2_zlib_trees.c
421
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
sbin/hammer2/zlib/hammer2_zlib_trees.c
447
#define smaller(tree, n, m, depth) \
sbin/hammer2/zlib/hammer2_zlib_trees.c
448
(tree[n].Freq < tree[m].Freq || \
sbin/hammer2/zlib/hammer2_zlib_trees.c
449
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
sbin/hammer2/zlib/hammer2_zlib_trees.c
502
int n, m; /* iterate over the tree elements */
sbin/hammer2/zlib/hammer2_zlib_trees.c
516
n = s->heap[h];
sbin/hammer2/zlib/hammer2_zlib_trees.c
517
bits = tree[tree[n].Dad].Len + 1;
sbin/hammer2/zlib/hammer2_zlib_trees.c
519
tree[n].Len = (ush)bits;
sbin/hammer2/zlib/hammer2_zlib_trees.c
522
if (n > max_code) continue; /* not a leaf node */
sbin/hammer2/zlib/hammer2_zlib_trees.c
526
if (n >= base) xbits = extra[n-base];
sbin/hammer2/zlib/hammer2_zlib_trees.c
527
f = tree[n].Freq;
sbin/hammer2/zlib/hammer2_zlib_trees.c
529
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
sbin/hammer2/zlib/hammer2_zlib_trees.c
555
n = s->bl_count[bits];
sbin/hammer2/zlib/hammer2_zlib_trees.c
556
while (n != 0) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
565
n--;
sbin/hammer2/zlib/hammer2_zlib_trees.c
588
int n; /* code index */
sbin/hammer2/zlib/hammer2_zlib_trees.c
603
for (n = 0; n <= max_code; n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
604
int len = tree[n].Len;
sbin/hammer2/zlib/hammer2_zlib_trees.c
607
tree[n].Code = bi_reverse(next_code[len]++, len);
sbin/hammer2/zlib/hammer2_zlib_trees.c
610
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
sbin/hammer2/zlib/hammer2_zlib_trees.c
629
int n, m; /* iterate over heap elements */
sbin/hammer2/zlib/hammer2_zlib_trees.c
639
for (n = 0; n < elems; n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
640
if (tree[n].Freq != 0) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
641
s->heap[++(s->heap_len)] = max_code = n;
sbin/hammer2/zlib/hammer2_zlib_trees.c
642
s->depth[n] = 0;
sbin/hammer2/zlib/hammer2_zlib_trees.c
644
tree[n].Len = 0;
sbin/hammer2/zlib/hammer2_zlib_trees.c
665
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
sbin/hammer2/zlib/hammer2_zlib_trees.c
672
pqremove(s, tree, n); /* n = node of least frequency */
sbin/hammer2/zlib/hammer2_zlib_trees.c
675
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
sbin/hammer2/zlib/hammer2_zlib_trees.c
679
tree[node].Freq = tree[n].Freq + tree[m].Freq;
sbin/hammer2/zlib/hammer2_zlib_trees.c
680
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
sbin/hammer2/zlib/hammer2_zlib_trees.c
681
s->depth[n] : s->depth[m]) + 1);
sbin/hammer2/zlib/hammer2_zlib_trees.c
682
tree[n].Dad = tree[m].Dad = (ush)node;
sbin/hammer2/zlib/hammer2_zlib_trees.c
686
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
sbin/hammer2/zlib/hammer2_zlib_trees.c
716
int n; /* iterates over all tree elements */
sbin/hammer2/zlib/hammer2_zlib_trees.c
727
for (n = 0; n <= max_code; n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
728
curlen = nextlen; nextlen = tree[n+1].Len;
sbin/hammer2/zlib/hammer2_zlib_trees.c
760
int n; /* iterates over all tree elements */
sbin/hammer2/zlib/hammer2_zlib_trees.c
771
for (n = 0; n <= max_code; n++) {
sbin/hammer2/zlib/hammer2_zlib_trees.c
772
curlen = nextlen; nextlen = tree[n+1].Len;
sbin/ifconfig/af_link.c
56
int n;
sbin/ifconfig/af_link.c
70
n = sdl->sdl_nlen > 0 ? sdl->sdl_nlen + 1 : 0;
sbin/ifconfig/af_link.c
71
printf("\tlladdr %s\n", link_ntoa(sdl) + n);
sbin/ifconfig/ifconfig.c
1157
int n;
sbin/ifconfig/ifconfig.c
1159
n = snprintf(newname, sizeof(newname), "%s", val);
sbin/ifconfig/ifconfig.c
1160
if (n >= (int)sizeof(newname))
sbin/ifconfig/ifieee80211.c
2431
int n;
sbin/ifconfig/ifieee80211.c
2434
n = vsnprintf(buf+1, sizeof(buf)-1, fmt, ap);
sbin/ifconfig/ifieee80211.c
2436
col += 1+n;
sbin/ifconfig/ifieee80211.c
2439
col += n;
sbin/ifconfig/ifieee80211.c
2814
int n;
sbin/ifconfig/ifieee80211.c
2825
n = LE_READ_2(ie);
sbin/ifconfig/ifieee80211.c
2828
for (; n > 0; n--) {
sbin/ifconfig/ifieee80211.c
2835
n = LE_READ_2(ie);
sbin/ifconfig/ifieee80211.c
2838
for (; n > 0; n--) {
sbin/ifconfig/ifieee80211.c
2899
int n;
sbin/ifconfig/ifieee80211.c
2910
n = LE_READ_2(ie);
sbin/ifconfig/ifieee80211.c
2913
for (; n > 0; n--) {
sbin/ifconfig/ifieee80211.c
2920
n = LE_READ_2(ie);
sbin/ifconfig/ifieee80211.c
2923
for (; n > 0; n--) {
sbin/ifconfig/ifieee80211.c
2949
int n;
sbin/ifconfig/ifieee80211.c
2997
for (n = 15; n >= 0; n--) {
sbin/ifconfig/ifieee80211.c
3002
switch (cfg_mthd & (1 << n)) {
sbin/ifconfig/ifieee80211.c
3072
cfg_mthd & (1 << n));
sbin/ifconfig/ifieee80211.c
3082
n = LE_READ_2(ie);
sbin/ifconfig/ifieee80211.c
3083
if (n < (int)nitems(dev_pass_id))
sbin/ifconfig/ifieee80211.c
3084
printf(" dpi:%s", dev_pass_id[n]);
sbin/ifconfig/ifieee80211.c
3097
for (n = 0; n < tlv_len; n++)
sbin/ifconfig/ifieee80211.c
3098
printf("%02x", ie[n]);
sbin/ifconfig/ifieee80211.c
3103
for (n = 7; n >= 0; n--) {
sbin/ifconfig/ifieee80211.c
3108
switch (*ie & (1 << n)) {
sbin/ifconfig/ifieee80211.c
3125
*ie & (1 << n));
sbin/ifconfig/ifieee80211.c
3142
for (n = 0; n < (tlv_len - 1); n++)
sbin/ifconfig/ifieee80211.c
3143
printf("%02x-", ie[n]);
sbin/ifconfig/ifieee80211.c
3144
printf("%02x", ie[n]);
sbin/ifconfig/ifieee80211.c
3148
for (n = 0; n < tlv_len; n++)
sbin/ifconfig/ifieee80211.c
3149
printf("%02x", ie[n]);
sbin/ip6fw/ip6fw.c
141
plen2mask(int n)
sbin/ip6fw/ip6fw.c
149
for (i = 0; i < 16; i++, p++, n -= 8) {
sbin/ip6fw/ip6fw.c
150
if (n >= 8) {
sbin/ip6fw/ip6fw.c
154
*p = pl2m[n];
sbin/ip6fw/ip6fw.c
438
struct ip6_fw *r, *rules, *n;
sbin/ip6fw/ip6fw.c
450
if ((n = realloc(rules, nalloc * 2 + 200)) == NULL)
sbin/ip6fw/ip6fw.c
453
rules = n;
sbin/ipfw/ipfw2.c
1633
int bcwidth, n, nbytes, nstat, ndyn, pcwidth, width;
sbin/ipfw/ipfw2.c
1681
for (n = 0, r = data; n < nstat; n++,
sbin/ipfw/ipfw2.c
1695
for (n = 0, d = dynrules; n < ndyn; n++, d++) {
sbin/ipfw/ipfw2.c
1707
for (n = 0, r = data; n < nstat; n++,
sbin/ipfw/ipfw2.c
1713
for (n = 0, d = dynrules; n < ndyn; n++, d++)
sbin/ipfw/ipfw2.c
1729
for (n = seen = 0, r = data; n < nstat; n++,
sbin/ipfw/ipfw2.c
1753
for (n = 0, d = dynrules; n < ndyn; n++, d++) {
sbin/ipfw/ipfw2.c
3780
int n;
sbin/ipfw/ipfw2.c
3782
n = inet_pton(AF_INET, *av, &te->key.sin_addr);
sbin/ipfw/ipfw2.c
3783
if (n == 0) {
sbin/ipfw/ipfw2.c
3786
} else if (n < 0) {
sbin/ipfw/ipfw2.c
605
int i, n;
sbin/ipfw/ipfw2.c
609
for (n=i+1; n < len; n++)
sbin/ipfw/ipfw2.c
610
if ( (p[n/8] & (1 << (7 - (n%8)))) != 0)
sbin/ipfw3/ipfw3nat.c
142
int n, len = 0;
sbin/ipfw3/ipfw3nat.c
151
for (n = 0; n < ioc->count; n++) {
sbin/ipfw3/ipfw3sync.c
287
int n;
sbin/ipfw3/ipfw3sync.c
292
n = atoi(*av);
sbin/ipfw3/ipfw3sync.c
293
if(do_set_x(IP_FW_SYNC_CENTRE_TEST, &n, sizeof(n)) < 0) {
sbin/ipfw3/ipfw3sync.c
296
printf("centre test %d sent\n", n);
sbin/iscontrol/config.c
235
int state, len, n;
sbin/iscontrol/config.c
249
n = 0;
sbin/iscontrol/config.c
251
n = p - lp;
sbin/iscontrol/config.c
252
if(len && strncmp(lp, key, MAX(n, len)) == 0)
sbin/iscontrol/fsm.c
274
int n, fd, nfd;
sbin/iscontrol/fsm.c
290
size_t n;
sbin/iscontrol/fsm.c
291
n = sizeof(sess->isid);
sbin/iscontrol/fsm.c
292
if(sysctlbyname("net.iscsi.isid", (void *)sess->isid, (size_t *)&n, 0, 0) != 0)
sbin/iscontrol/fsm.c
295
if(ioctl(fd, ISCSISETSES, &n)) {
sbin/iscontrol/fsm.c
300
asprintf(&dev, "%s%d", iscsidev, n);
sbin/iscontrol/fsm.c
489
int len, n;
sbin/iscontrol/fsm.c
498
n = strlen((char *)ptr) + 1;
sbin/iscontrol/fsm.c
499
len -= n;
sbin/iscontrol/fsm.c
500
ptr += n;
sbin/iscontrol/iscontrol.h
42
#define BIT(n) (1 <<(n))
sbin/iscontrol/login.c
109
n = strlen(ptr) + 1;
sbin/iscontrol/login.c
110
len -= n;
sbin/iscontrol/login.c
111
ptr += n;
sbin/iscontrol/login.c
154
int len, klen, n;
sbin/iscontrol/login.c
212
n = strlen(ptr) + 1;
sbin/iscontrol/login.c
213
len -= n;
sbin/iscontrol/login.c
214
ptr += n;
sbin/iscontrol/login.c
75
int n;
sbin/iscontrol/login.c
81
n = sep - sp;
sbin/iscontrol/login.c
83
n = strlen(sp);
sbin/iscontrol/login.c
86
if(strncasecmp(lp->name, sp, n) == 0)
sbin/iscontrol/login.c
99
int klen, len, n;
sbin/iscontrol/pdu.c
158
size_t len, n;
sbin/iscontrol/pdu.c
167
n = strlen(ptr) + 1;
sbin/iscontrol/pdu.c
168
len -= n;
sbin/iscontrol/pdu.c
169
ptr += n;
sbin/jscan/dump_output.c
42
int n;
sbin/jscan/dump_output.c
45
for (n = 0; n < jd->jd_size; n += r) {
sbin/jscan/dump_output.c
46
r = write(1, jd->jd_data + n, jd->jd_size - n);
sbin/jscan/dump_output.c
60
if (n != jd->jd_size) {
sbin/jscan/jfile.c
234
int n;
sbin/jscan/jfile.c
385
n = jreadbuf(jf, direction, jd->jd_data + sizeof(head),
sbin/jscan/jfile.c
387
if (n != (int)(recsize - sizeof(head))) {
sbin/jscan/jfile.c
457
n = jreadbuf(jf, direction, jd->jd_data, recsize - sizeof(tail));
sbin/jscan/jfile.c
458
if (n != (int)(recsize - sizeof(tail))) {
sbin/jscan/jfile.c
579
int n;
sbin/jscan/jfile.c
616
n = write(jf->jf_write_fd, jd->jd_data, jd->jd_size);
sbin/jscan/jfile.c
617
if (n != jd->jd_size) {
sbin/jscan/jfile.c
622
jf->jf_write_pos += n;
sbin/jscan/jfile.c
771
int n;
sbin/jscan/jfile.c
778
n = read(jf->jf_fd, (char *)buf + ttl, bytes - ttl);
sbin/jscan/jfile.c
779
if (n <= 0) {
sbin/jscan/jfile.c
780
if (n < 0 && ttl == 0)
sbin/jscan/jfile.c
784
ttl += n;
sbin/jscan/jfile.c
785
jf->jf_pos += n;
sbin/jscan/jfile.c
792
n = read(jf->jf_fd, (char *)buf + ttl, bytes - ttl);
sbin/jscan/jfile.c
793
if (n <= 0) {
sbin/jscan/jfile.c
794
if (n < 0 && ttl == 0)
sbin/jscan/jfile.c
798
ttl += n;
sbin/jscan/jstream.c
372
int n;
sbin/jscan/jstream.c
375
n = jsreadany(js, off, &ptr);
sbin/jscan/jstream.c
376
if (n == 0)
sbin/jscan/jstream.c
378
if (n > bytes)
sbin/jscan/jstream.c
379
n = bytes;
sbin/jscan/jstream.c
380
bcopy(ptr, buf, n);
sbin/jscan/jstream.c
381
buf = (char *)buf + n;
sbin/jscan/jstream.c
382
off += n;
sbin/jscan/jstream.c
383
bytes -= n;
sbin/jscan/jstream.c
399
int n;
sbin/jscan/jstream.c
401
n = jsreadany(js, off, bufp);
sbin/jscan/jstream.c
402
if (n < bytes) {
sbin/jscan/jstream.c
428
int n;
sbin/jscan/jstream.c
432
while (bytes && (n = jsreadany(js, off, &bufp)) > 0) {
sbin/jscan/jstream.c
433
if (n > bytes)
sbin/jscan/jstream.c
434
n = bytes;
sbin/jscan/jstream.c
435
r = func(fd, bufp, n);
sbin/jscan/jstream.c
436
if (r != n) {
sbin/jscan/jstream.c
440
res += n;
sbin/jscan/jstream.c
441
bytes -= n;
sbin/jscan/jstream.c
442
off += n;
sbin/jscan/jstream.c
455
int n;
sbin/jscan/jstream.c
462
n = (int)(off - scan->js_normalized_off);
sbin/jscan/jstream.c
463
*bufp = scan->js_normalized_base + n;
sbin/jscan/jstream.c
464
return(scan->js_normalized_size - n);
sbin/jscan/subs.c
350
int n;
sbin/jscan/subs.c
356
n = read(fd, buf, sizeof(buf) - 1);
sbin/jscan/subs.c
357
if (n >= 0)
sbin/jscan/subs.c
358
buf[n] = 0;
sbin/mount/mount.c
788
int n;
sbin/mount/mount.c
792
if (sscanf(path, "acd%d", &n) == 1)
sbin/mount/mount.c
794
if (sscanf(path, "cd%d", &n) == 1)
sbin/newfs/fscopy.c
135
int n;
sbin/newfs/fscopy.c
190
} else if ((n = open(path, O_RDONLY)) < 0) {
sbin/newfs/fscopy.c
195
} else if (read(n, node->fs_Data, node->fs_St.st_size) != node->fs_St.st_size) {
sbin/newfs/fscopy.c
210
if ((n = readlink(path, buf, sizeof(buf))) > 0) {
sbin/newfs/fscopy.c
211
if ((node->fs_Data = malloc(n + 1)) == NULL) {
sbin/newfs/fscopy.c
216
node->fs_Bytes = n;
sbin/newfs/fscopy.c
217
bcopy(buf, node->fs_Data, n);
sbin/newfs/fscopy.c
218
node->fs_Data[n] = 0;
sbin/newfs/fscopy.c
220
} else if (n == 0) {
sbin/newfs/mkfs.c
1213
int n;
sbin/newfs/mkfs.c
1224
n = read(fsi, bf, size);
sbin/newfs/mkfs.c
1225
if (n != size) {
sbin/newfs/mkfs.c
1242
int n;
sbin/newfs/mkfs.c
1248
n = write(fso, wc, wc_end);
sbin/newfs/mkfs.c
1249
if (n != wc_end) {
sbin/newfs/mkfs.c
1277
int n;
sbin/newfs/mkfs.c
1310
n = write(fso, bf, size);
sbin/newfs/mkfs.c
1311
if (n != size) {
sbin/newfs/mkfs.c
1313
fso, (long)bno, n, size);
sbin/newfs/newfs.c
212
int fsi = -1, fso = -1, len, n, vflag;
sbin/newfs/newfs.c
455
n = getmntinfo(&mp, MNT_NOWAIT);
sbin/newfs/newfs.c
456
if (n == 0)
sbin/newfs/newfs.c
464
while (--n >= 0) {
sbin/newfs_hammer2/mkfs_hammer2.c
268
size_t n;
sbin/newfs_hammer2/mkfs_hammer2.c
277
n = pwrite(vol->fd, buf, HAMMER2_PBUFSIZE, tmp_base);
sbin/newfs_hammer2/mkfs_hammer2.c
278
if (n != HAMMER2_PBUFSIZE) {
sbin/newfs_hammer2/mkfs_hammer2.c
300
n = pwrite(vol->fd, buf, HAMMER2_PBUFSIZE, tmp_base);
sbin/newfs_hammer2/mkfs_hammer2.c
301
if (n != HAMMER2_PBUFSIZE) {
sbin/newfs_hammer2/mkfs_hammer2.c
321
size_t n;
sbin/newfs_hammer2/mkfs_hammer2.c
486
n = pwrite(vol->fd, buf, HAMMER2_PBUFSIZE,
sbin/newfs_hammer2/mkfs_hammer2.c
488
if (n != HAMMER2_PBUFSIZE) {
sbin/newfs_hammer2/mkfs_hammer2.c
522
size_t n;
sbin/newfs_hammer2/mkfs_hammer2.c
529
n = pwrite(vol->fd, buf, HAMMER2_PBUFSIZE,
sbin/newfs_hammer2/mkfs_hammer2.c
531
if (n != HAMMER2_PBUFSIZE) {
sbin/newfs_hammer2/mkfs_hammer2.c
621
n = pwrite(vol->fd, buf, HAMMER2_PBUFSIZE,
sbin/newfs_hammer2/mkfs_hammer2.c
623
if (n != HAMMER2_PBUFSIZE) {
sbin/newfs_msdos/mkfs_msdos.c
246
ssize_t n;
sbin/newfs_msdos/mkfs_msdos.c
660
if ((n = read(fd1, img, bpb.bpbBytesPerSec)) == -1) {
sbin/newfs_msdos/mkfs_msdos.c
664
if ((unsigned)n != bpb.bpbBytesPerSec) {
sbin/newfs_msdos/mkfs_msdos.c
760
n = write(fd, physbuf, chunksize);
sbin/newfs_msdos/mkfs_msdos.c
761
if (n != chunksize) {
sbin/newfs_msdos/mkfs_msdos.c
775
n = write(fd, physbuf, tailsize);
sbin/newfs_msdos/mkfs_msdos.c
776
if (n != tailsize) {
sbin/newfs_msdos/mkfs_msdos.c
807
int n, r;
sbin/newfs_msdos/mkfs_msdos.c
809
if (!(n = getmntinfo(&mp, MNT_NOWAIT))) {
sbin/newfs_msdos/mkfs_msdos.c
818
for (; n--; mp++) {
sbin/ping/ping.c
1310
double n = nreceived + nrepeats;
sbin/ping/ping.c
1311
double avg = tsum / n;
sbin/ping/ping.c
1312
double vari = tsumsq / n - avg * avg;
sbin/ping/ping.c
741
int cc, n;
sbin/ping/ping.c
761
n = select(s + 1, &rfds, NULL, NULL, &timeout);
sbin/ping/ping.c
762
if (n < 0)
sbin/ping/ping.c
764
if (n == 1) {
sbin/ping/ping.c
796
if (n == 0 || options & F_FLOOD) {
sbin/rconfig/client.c
39
#define LONG_ALIGN(n) roundup2(n, sizeof(long))
sbin/rconfig/server.c
180
size_t n;
sbin/rconfig/server.c
188
n = (bytes > sizeof(buf)) ? sizeof(buf) : bytes;
sbin/rconfig/server.c
189
n = fread(buf, 1, n, fp);
sbin/rconfig/server.c
190
if (n <= 0) {
sbin/rconfig/server.c
194
if (fwrite(buf, 1, n, fo) != n) {
sbin/rconfig/server.c
198
bytes -= n;
sbin/rconfig/server.c
204
n = (bytes > sizeof(buf)) ? sizeof(buf) : bytes;
sbin/rconfig/server.c
205
if (fwrite(buf, 1, n, fo) != n)
sbin/rconfig/server.c
207
bytes -= n;
sbin/rconfig/server.c
245
int n;
sbin/rconfig/server.c
252
n = recvfrom(fd, ibuf, sizeof(ibuf) - 1, 0, (void *)&sain, &sain_len);
sbin/rconfig/server.c
253
if (n < 0) {
sbin/rconfig/server.c
258
ibuf[n] = 0;
sbin/rconfig/server.c
259
n = 0;
sbin/rconfig/server.c
272
n = strlen(obuf);
sbin/rconfig/server.c
277
if (n)
sbin/rconfig/server.c
278
sendto(fd, obuf, n, 0, (void *)&sain, sain_len);
sbin/rconfig/subs.c
130
n = recvfrom(fd, buf, sizeof(buf) - 1, 0, (void *)rsin, &rsin_len);
sbin/rconfig/subs.c
133
if (n < 0) {
sbin/rconfig/subs.c
140
while (n > 0 && (buf[n - 1] == '\r' || buf[n - 1] == '\n'))
sbin/rconfig/subs.c
141
--n;
sbin/rconfig/subs.c
142
buf[n] = 0;
sbin/rconfig/subs.c
161
int n;
sbin/rconfig/subs.c
207
n = strlen(buf);
sbin/rconfig/subs.c
212
for (rc = 0; *bufp && rc < *lenp; rc += n) {
sbin/rconfig/subs.c
213
if ((n = *lenp - rc) > (int)sizeof(buf))
sbin/rconfig/subs.c
214
n = sizeof(buf);
sbin/rconfig/subs.c
215
n = fread(*bufp + rc, 1, n, *pfi);
sbin/rconfig/subs.c
216
if (n <= 0)
sbin/rconfig/subs.c
238
while (n > 0 && (buf[n-1] == '\r' || buf[n-1] == '\n'))
sbin/rconfig/subs.c
239
--n;
sbin/rconfig/subs.c
240
buf[n] = 0;
sbin/rconfig/subs.c
242
*lenp = n;
sbin/rconfig/subs.c
84
int n;
sbin/rcorder/hash.h
119
#define Hash_Size(n) (((n) + sizeof (int) - 1) / sizeof (int))
sbin/restore/tape.c
1319
swabshort(u_char *sp, int n)
sbin/restore/tape.c
1323
while (--n >= 0) {
sbin/restore/tape.c
1331
swablong(u_char *sp, int n)
sbin/restore/tape.c
1335
while (--n >= 0) {
sbin/restore/tape.c
1346
int n = 0;
sbin/restore/tape.c
1352
n = (n * 10) + (*cp++ - '0');
sbin/restore/tape.c
1356
if (n == 0)
sbin/restore/tape.c
1357
n = 1;
sbin/restore/tape.c
1358
sp = swabshort(sp, n);
sbin/restore/tape.c
1362
if (n == 0)
sbin/restore/tape.c
1363
n = 1;
sbin/restore/tape.c
1364
sp = swablong(sp, n);
sbin/restore/tape.c
1368
if (n == 0)
sbin/restore/tape.c
1369
n = 1;
sbin/restore/tape.c
1370
sp += n;
sbin/restore/tape.c
1374
n = 0;
sbin/route/route.c
1278
int n, error;
sbin/route/route.c
1289
n = read(s, msg, sizeof(msg));
sbin/route/route.c
1292
if (n == -1) {
sbin/route/route.c
1297
printf("\ngot message of size %d on %s", n, ctime(&now));
sbin/route/route.c
1298
print_rtmsg((struct rt_msghdr *)msg, n);
sbin/routed/defs.h
412
struct netinfo *n;
sbin/routed/input.c
139
struct netinfo *n, *lim;
sbin/routed/input.c
170
n = rip->rip_nets;
sbin/routed/input.c
184
&& n < lim && n->n_family == RIP_AF_AUTH) {
sbin/routed/input.c
240
if (n >= lim) {
sbin/routed/input.c
245
if (cc%sizeof(*n) != sizeof(struct rip)%sizeof(*n)) {
sbin/routed/input.c
260
&& n->n_family == RIP_AF_AUTH
sbin/routed/input.c
270
n->n_metric = ntohl(n->n_metric);
sbin/routed/input.c
278
if (n->n_family == RIP_AF_UNSPEC
sbin/routed/input.c
279
&& n->n_metric == HOPCNT_INFINITY) {
sbin/routed/input.c
322
v12buf.n->n_family = RIP_AF_INET;
sbin/routed/input.c
323
v12buf.n->n_dst = RIP_DEFAULT;
sbin/routed/input.c
328
v12buf.n->n_metric = htonl(i);
sbin/routed/input.c
329
v12buf.n++;
sbin/routed/input.c
347
if (n->n_family == RIP_AF_AUTH)
sbin/routed/input.c
350
if (n->n_family != RIP_AF_INET) {
sbin/routed/input.c
355
ntohs(n->n_family),
sbin/routed/input.c
356
naddr_ntoa(n->n_dst));
sbin/routed/input.c
362
dst = n->n_dst;
sbin/routed/input.c
373
|| 0 == (mask = ntohl(n->n_mask))
sbin/routed/input.c
380
rt = rtfind(n->n_dst);
sbin/routed/input.c
383
v12buf.n->n_mask = mask;
sbin/routed/input.c
386
v12buf.n->n_metric = HOPCNT_INFINITY;
sbin/routed/input.c
391
v12buf.n->n_family = RIP_AF_INET;
sbin/routed/input.c
392
v12buf.n->n_dst = dst;
sbin/routed/input.c
393
v12buf.n->n_metric = (rt->rt_metric+1
sbin/routed/input.c
397
if (v12buf.n->n_metric > HOPCNT_INFINITY)
sbin/routed/input.c
398
v12buf.n->n_metric = HOPCNT_INFINITY;
sbin/routed/input.c
400
v12buf.n->n_tag = rt->rt_tag;
sbin/routed/input.c
401
v12buf.n->n_mask = mask;
sbin/routed/input.c
407
v12buf.n->n_nhop = rt->rt_gate;
sbin/routed/input.c
410
v12buf.n->n_metric = htonl(v12buf.n->n_metric);
sbin/routed/input.c
414
if (++v12buf.n >= v12buf.lim)
sbin/routed/input.c
416
} while (++n < lim);
sbin/routed/input.c
427
((char *)v12buf.n - (char*)v12buf.buf));
sbin/routed/input.c
431
((char *)v12buf.n - (char*)v12buf.buf));
sbin/routed/input.c
471
if (cc%sizeof(*n) != sizeof(struct rip)%sizeof(*n)) {
sbin/routed/input.c
526
if (n >= lim) {
sbin/routed/input.c
576
if (n->n_family == RIP_AF_AUTH)
sbin/routed/input.c
579
n->n_metric = ntohl(n->n_metric);
sbin/routed/input.c
580
dst = n->n_dst;
sbin/routed/input.c
581
if (n->n_family != RIP_AF_INET
sbin/routed/input.c
582
&& (n->n_family != RIP_AF_UNSPEC
sbin/routed/input.c
588
n->n_family,
sbin/routed/input.c
599
if (n->n_metric == 0
sbin/routed/input.c
600
|| n->n_metric > HOPCNT_INFINITY) {
sbin/routed/input.c
604
n->n_metric,
sbin/routed/input.c
613
if (n->n_nhop != 0) {
sbin/routed/input.c
615
n->n_nhop = 0;
sbin/routed/input.c
618
if (on_net(n->n_nhop,
sbin/routed/input.c
620
&& check_dst(n->n_nhop)) {
sbin/routed/input.c
621
gate = n->n_nhop;
sbin/routed/input.c
628
naddr_ntoa(n->n_nhop));
sbin/routed/input.c
629
n->n_nhop = 0;
sbin/routed/input.c
635
|| 0 == (mask = ntohl(n->n_mask))) {
sbin/routed/input.c
647
n->n_tag = 0;
sbin/routed/input.c
651
n->n_metric += aifp->int_metric;
sbin/routed/input.c
652
if (n->n_metric > HOPCNT_INFINITY)
sbin/routed/input.c
653
n->n_metric = HOPCNT_INFINITY;
sbin/routed/input.c
677
&& (int)n->n_metric >= aifp->int_d_metric)
sbin/routed/input.c
726
new.rts_metric = n->n_metric;
sbin/routed/input.c
727
new.rts_tag = n->n_tag;
sbin/routed/input.c
733
input_route(dst, mask, &new, n);
sbin/routed/input.c
738
} while (++n < lim);
sbin/routed/input.c
751
struct netinfo *n)
sbin/routed/input.c
784
if (n->n_nhop != 0
sbin/routed/input.c
785
&& 0 != ifwithaddr(n->n_nhop, 1, 0))
sbin/routed/input.c
882
if (n->n_nhop != 0
sbin/routed/input.c
883
&& 0 != ifwithaddr(n->n_nhop, 1, 0))
sbin/routed/main.c
121
while ((n = getopt(argc, argv, "sqdghmpAtvT:F:P:")) != -1) {
sbin/routed/main.c
122
switch (n) {
sbin/routed/main.c
171
n = FAKE_METRIC;
sbin/routed/main.c
174
n = (int)strtoul(p+1, &q, 0);
sbin/routed/main.c
176
&& n <= HOPCNT_INFINITY-1
sbin/routed/main.c
177
&& n >= 1)
sbin/routed/main.c
188
parm.parm_d_metric = n;
sbin/routed/main.c
421
n = 1 + (0-t2.tv_sec)/SUPPLY_INTERVAL;
sbin/routed/main.c
422
next_bcast.tv_sec += n*SUPPLY_INTERVAL;
sbin/routed/main.c
484
n = select(sock_max, &ibits, 0, 0, &wtime);
sbin/routed/main.c
485
if (n <= 0) {
sbin/routed/main.c
486
if (n < 0 && errno != EINTR && errno != EAGAIN)
sbin/routed/main.c
493
n--;
sbin/routed/main.c
497
n--;
sbin/routed/main.c
501
n--;
sbin/routed/main.c
504
for (ifp = ifnet; n > 0 && 0 != ifp; ifp = ifp->int_next) {
sbin/routed/main.c
508
n--;
sbin/routed/main.c
87
int n, mib[4], off;
sbin/routed/output.c
250
wb->n = wb->base;
sbin/routed/output.c
251
memset(wb->n, 0, NETS_LEN*sizeof(*wb->n));
sbin/routed/output.c
258
na = (struct netauth*)wb->n;
sbin/routed/output.c
263
wb->n++;
sbin/routed/output.c
271
wb->n++;
sbin/routed/output.c
287
na2 = (struct netauth*)wb->n;
sbin/routed/output.c
296
wb->n++;
sbin/routed/output.c
320
((char *)wb->n - (char*)wb->buf)) < 0
sbin/routed/output.c
401
wb->n->n_family = RIP_AF_INET;
sbin/routed/output.c
402
wb->n->n_dst = htonl(dst_h);
sbin/routed/output.c
406
wb->n->n_metric = ((stopint || ag->ag_metric < 1)
sbin/routed/output.c
409
wb->n->n_metric = htonl(wb->n->n_metric);
sbin/routed/output.c
422
wb->n->n_nhop = ag->ag_nhop;
sbin/routed/output.c
423
wb->n->n_mask = htonl(mask);
sbin/routed/output.c
424
wb->n->n_tag = ag->ag_tag;
sbin/routed/output.c
428
if (++wb->n >= wb->lim)
sbin/routed/output.c
769
v12buf.n->n_family = RIP_AF_INET;
sbin/routed/output.c
770
v12buf.n->n_dst = htonl(RIP_DEFAULT);
sbin/routed/output.c
771
v12buf.n->n_metric = htonl(def_metric);
sbin/routed/output.c
772
v12buf.n++;
sbin/routed/output.c
782
if (v12buf.n != v12buf.base
sbin/routed/output.c
783
&& (v12buf.n > v12buf.base+1
sbin/routed/output.c
786
if (v2buf.n != v2buf.base
sbin/routed/output.c
787
&& (v2buf.n > v2buf.base+1
sbin/routed/parms.c
163
int metric, n, lnum;
sbin/routed/parms.c
209
n = sscanf(lptr, "%4s %129[^ \t] gateway"
sbin/routed/parms.c
212
if (n != 4 && n != 5) {
sbin/routed/parms.c
214
lptr, n);
sbin/routed/rdisc.c
1028
for (n = 0; n < p->ad.icmp_ad_num; n++) {
sbin/routed/rdisc.c
935
int n, cc, hlen;
sbin/routed/rtquery/rtquery.c
568
struct netinfo *n, *lim;
sbin/routed/rtquery/rtquery.c
604
if (size > (int)sizeof(imsg_buf) - (int)sizeof(*n)) {
sbin/routed/rtquery/rtquery.c
607
size = (int)sizeof(imsg_buf) - (int)sizeof(*n);
sbin/routed/rtquery/rtquery.c
612
} else if (size%sizeof(*n) != sizeof(struct rip)%sizeof(*n)) {
sbin/routed/rtquery/rtquery.c
616
n = IMSG.rip_nets;
sbin/routed/rtquery/rtquery.c
617
lim = (struct netinfo *)((char*)n + size) - 1;
sbin/routed/rtquery/rtquery.c
618
for (; n <= lim; n++) {
sbin/routed/rtquery/rtquery.c
620
if (n->n_family == RIP_AF_INET) {
sbin/routed/rtquery/rtquery.c
621
in.s_addr = n->n_dst;
sbin/routed/rtquery/rtquery.c
624
mask = ntohl(n->n_mask);
sbin/routed/rtquery/rtquery.c
675
} else if (n->n_family == RIP_AF_AUTH) {
sbin/routed/rtquery/rtquery.c
676
na = (struct netauth*)n;
sbin/routed/rtquery/rtquery.c
678
&& n == IMSG.rip_nets) {
sbin/routed/rtquery/rtquery.c
685
&& n == IMSG.rip_nets) {
sbin/routed/rtquery/rtquery.c
704
if (md5_authed && n+1 > lim
sbin/routed/rtquery/rtquery.c
720
ntohs(n->n_family),
sbin/routed/rtquery/rtquery.c
721
(char)(n->n_dst >> 24),
sbin/routed/rtquery/rtquery.c
722
(char)(n->n_dst >> 16),
sbin/routed/rtquery/rtquery.c
723
(char)(n->n_dst >> 8),
sbin/routed/rtquery/rtquery.c
724
(char)n->n_dst);
sbin/routed/rtquery/rtquery.c
728
net_buf, (int)ntohl(n->n_metric), name);
sbin/routed/rtquery/rtquery.c
730
if (n->n_nhop != 0) {
sbin/routed/rtquery/rtquery.c
731
in.s_addr = n->n_nhop;
sbin/routed/rtquery/rtquery.c
740
if (n->n_tag != 0)
sbin/routed/rtquery/rtquery.c
741
printf(" tag=%#x%s", n->n_tag,
sbin/routed/trace.c
851
struct netinfo *n, *lim;
sbin/routed/trace.c
852
# define NA ((struct netauth*)n)
sbin/routed/trace.c
881
n = msg->rip_nets;
sbin/routed/trace.c
883
for (; n < lim; n++) {
sbin/routed/trace.c
885
&& n->n_family == RIP_AF_UNSPEC
sbin/routed/trace.c
886
&& ntohl(n->n_metric) == HOPCNT_INFINITY
sbin/routed/trace.c
888
&& (n+1 == lim
sbin/routed/trace.c
889
|| (n+2 == lim
sbin/routed/trace.c
890
&& (n+1)->n_family == RIP_AF_AUTH))) {
sbin/routed/trace.c
892
if (n->n_dst != 0)
sbin/routed/trace.c
894
naddr_ntoa(n->n_dst));
sbin/routed/trace.c
895
if (n->n_mask != 0)
sbin/routed/trace.c
897
(u_int)ntohl(n->n_mask));
sbin/routed/trace.c
898
if (n->n_nhop != 0)
sbin/routed/trace.c
900
naddr_ntoa(n->n_nhop));
sbin/routed/trace.c
901
if (n->n_tag != 0)
sbin/routed/trace.c
903
ntohs(n->n_tag));
sbin/routed/trace.c
908
if (n->n_family == RIP_AF_AUTH) {
sbin/routed/trace.c
910
&& n == msg->rip_nets) {
sbin/routed/trace.c
920
&& n == msg->rip_nets) {
sbin/routed/trace.c
948
if (n->n_family != RIP_AF_INET) {
sbin/routed/trace.c
951
ntohs(n->n_family),
sbin/routed/trace.c
952
naddr_ntoa(n->n_dst),
sbin/routed/trace.c
953
(u_int)ntohl(n->n_mask));
sbin/routed/trace.c
956
addrname(n->n_dst, ntohl(n->n_mask),
sbin/routed/trace.c
957
n->n_mask==0 ? 2 : 1));
sbin/routed/trace.c
960
addrname(n->n_dst, ntohl(n->n_mask),
sbin/routed/trace.c
961
n->n_mask==0 ? 2 : 0));
sbin/routed/trace.c
964
(u_int)ntohl(n->n_metric));
sbin/routed/trace.c
965
if (n->n_nhop != 0)
sbin/routed/trace.c
967
naddr_ntoa(n->n_nhop));
sbin/routed/trace.c
968
if (n->n_tag != 0)
sbin/routed/trace.c
969
fprintf(ftrace, "tag=%#x", ntohs(n->n_tag));
sbin/routed/trace.c
972
if (size != (char *)n - (char *)msg)
sbin/svc/execute.c
1006
n = fwrite(buf, 1, i - b, fp);
sbin/svc/execute.c
1007
if (n > 0)
sbin/svc/execute.c
1008
r += n;
sbin/svc/execute.c
1009
if (n < 0)
sbin/svc/execute.c
1013
n = fwrite(".", 1, 1, fp);
sbin/svc/execute.c
1016
if (n < 0)
sbin/svc/execute.c
55
static int escapewrite(FILE *fp, char *buf, int n, int *statep);
sbin/svc/execute.c
625
int n;
sbin/svc/execute.c
649
n = InitCmd->logwindex - windex;
sbin/svc/execute.c
650
if (n < 0 || n > InitCmd->logcount) {
sbin/svc/execute.c
662
if (n > lbsize - (windex & lbmask))
sbin/svc/execute.c
663
n = lbsize - (windex & lbmask);
sbin/svc/execute.c
664
if (n > LOGCHUNK)
sbin/svc/execute.c
665
n = LOGCHUNK;
sbin/svc/execute.c
666
if (n == 0) {
sbin/svc/execute.c
672
bcopy(InitCmd->logbuf + (windex & lbmask), buf, n);
sbin/svc/execute.c
678
n = escapewrite(cmd->fp, buf, n, &dotstate);
sbin/svc/execute.c
680
if (n > 0)
sbin/svc/execute.c
681
lastnl = (buf[n-1] == '\n');
sbin/svc/execute.c
684
if (n < 0)
sbin/svc/execute.c
686
windex += n;
sbin/svc/execute.c
769
int n;
sbin/svc/execute.c
777
n = cmd->logcount - (lbsize - LOGCHUNK);
sbin/svc/execute.c
778
if (n > 0) {
sbin/svc/execute.c
779
cmd->logcount -= n;
sbin/svc/execute.c
780
cmd->logwindex += n;
sbin/svc/execute.c
783
n = lbsize - windex;
sbin/svc/execute.c
784
if (n > LOGCHUNK)
sbin/svc/execute.c
785
n = LOGCHUNK;
sbin/svc/execute.c
787
n = read(cmd->logfds[0], cmd->logbuf + windex, n);
sbin/svc/execute.c
789
if (n > 0) {
sbin/svc/execute.c
791
write(cmd->logfd, cmd->logbuf + windex, n);
sbin/svc/execute.c
792
cmd->logcount += n;
sbin/svc/execute.c
793
cmd->logwindex += n;
sbin/svc/execute.c
796
if (n == 0 || (n < 0 && errno != EINTR))
sbin/svc/execute.c
959
escapewrite(FILE *fp, char *buf, int n, int *statep)
sbin/svc/execute.c
969
while (i < n) {
sbin/svc/execute.c
970
for (i = b; i < n; ++i) {
sbin/swapon/swapon.c
293
int fd,i,n;
sbin/swapon/swapon.c
316
n = (int)(bytes / ksize);
sbin/swapon/swapon.c
317
for (i = 0; i < n; ++i) {
sbin/swapon/swapon.c
428
int i, n;
sbin/swapon/swapon.c
481
n = (int)(bytes / ksize);
sbin/swapon/swapon.c
491
for (i = 0; i < n; ++i) {
sbin/udevd/test_udevd.c
331
int n, evtype;
sbin/udevd/test_udevd.c
337
if ((n = read_xml(udev_monitor->socket, xml, 12*1024*1024)) <= 0) {
sbin/udevd/test_udevd.c
342
xml[n+1] = '\0';
sbin/udevd/test_udevd.c
398
n = send_xml(udev_monitor->socket, xml);
sbin/udevd/test_udevd.c
400
if (n <= 0)
sbin/udevd/test_udevd.c
578
ssize_t r,n;
sbin/udevd/test_udevd.c
589
n = send(s, xml+r, sz-r, 0);
sbin/udevd/test_udevd.c
590
if (n <= 0)
sbin/udevd/test_udevd.c
591
return n;
sbin/udevd/test_udevd.c
592
r += n;
sbin/udevd/test_udevd.c
602
int n, r;
sbin/udevd/test_udevd.c
604
n = recv(s, &sz, sizeof(sz), MSG_WAITALL);
sbin/udevd/test_udevd.c
605
if (n <= 0)
sbin/udevd/test_udevd.c
606
return n;
sbin/udevd/test_udevd.c
610
n = recv(s, buf+r, sz-r, MSG_WAITALL);
sbin/udevd/test_udevd.c
611
if (n <= 0)
sbin/udevd/test_udevd.c
612
return n;
sbin/udevd/test_udevd.c
613
r += n;
sbin/udevd/test_udevd.c
727
int n, t;
sbin/udevd/test_udevd.c
738
n = send_xml(s, xml);
sbin/udevd/test_udevd.c
741
if (n <= 0)
sbin/udevd/test_udevd.c
745
if ((n = read_xml(s, xml, 12*1024*1024)) <= 0) {
sbin/udevd/test_udevd.c
750
xml[n+1] = '\0';
sbin/udevd/udevd.c
170
int n, idx, evtype;
sbin/udevd/udevd.c
177
if ((n = read(fd, xml, sz)) <= 0) {
sbin/udevd/udevd_client.c
101
int r, n, error;
sbin/udevd/udevd_client.c
112
n = read_xml(cli->fd, &xml);
sbin/udevd/udevd_client.c
113
if (n == 0)
sbin/udevd/udevd_client.c
115
else if (n < 0)
sbin/udevd/udevd_client.c
118
xml[n+1] = '\0';
sbin/udevd/udevd_client.c
138
for(n = 0; cmd_fn[n].cmd != NULL; n++) {
sbin/udevd/udevd_client.c
139
if (prop_string_equals_cstring(ps, cmd_fn[n].cmd))
sbin/udevd/udevd_client.c
143
if (cmd_fn[n].cmd != NULL) {
sbin/udevd/udevd_client.c
144
error = cmd_fn[n].fn(cli, dict);
sbin/udevd/udevd_socket.c
100
return n;
sbin/udevd/udevd_socket.c
102
r += n;
sbin/udevd/udevd_socket.c
61
ssize_t r,n;
sbin/udevd/udevd_socket.c
72
n = send(s, xml+r, sz-r, 0);
sbin/udevd/udevd_socket.c
73
if (n <= 0)
sbin/udevd/udevd_socket.c
74
return n;
sbin/udevd/udevd_socket.c
75
r += n;
sbin/udevd/udevd_socket.c
86
int n, r;
sbin/udevd/udevd_socket.c
90
n = recv(s, &sz, sizeof(sz), MSG_WAITALL);
sbin/udevd/udevd_socket.c
91
if ((n <= 0) || (sz > 12*1024*1024)) /* Arbitrary limit */
sbin/udevd/udevd_socket.c
92
return n;
sbin/udevd/udevd_socket.c
97
n = recv(s, xml+r, sz-r, MSG_WAITALL);
sbin/udevd/udevd_socket.c
98
if (n <= 0) {
share/examples/libusb20/bulk.c
203
unsigned n = strtoul(argv[out_len], 0, 0);
share/examples/libusb20/bulk.c
204
if (n > 255)
share/examples/libusb20/bulk.c
207
out_len, n);
share/examples/libusb20/bulk.c
208
out_buf[out_len] = (uint8_t)n;
share/examples/libusb20/control.c
374
unsigned n = strtoul(argv[out_len], 0, 0);
share/examples/libusb20/control.c
375
if (n > 255)
share/examples/libusb20/control.c
378
out_len, n);
share/examples/libusb20/control.c
379
out_buf[out_len] = (uint8_t)n;
stand/boot/common/load_elf.c
736
size_t n;
stand/boot/common/load_elf.c
748
for (n = 0; n < ef->relsz / sizeof(r); n++) {
stand/boot/common/load_elf.c
749
COPYOUT(ef->rel + n, &r, sizeof(r));
stand/boot/common/load_elf.c
756
for (n = 0; n < ef->relasz / sizeof(a); n++) {
stand/boot/common/load_elf.c
757
COPYOUT(ef->rela + n, &a, sizeof(a));
stand/boot/common/ufsread.c
103
ssize_t n;
stand/boot/common/ufsread.c
106
while ((n = boot2_ufs_read(*ino, buf, DEV_BSIZE)) > 0)
stand/boot/common/ufsread.c
117
if (n != -1 && ls)
stand/boot/common/ufsread.c
128
ssize_t n;
stand/boot/common/ufsread.c
141
if ((n = s - path) > MAXNAMLEN)
stand/boot/common/ufsread.c
143
ls = *path == '?' && n == 1 && !*s;
stand/boot/common/ufsread.c
144
memcpy(name, path, n);
stand/boot/common/ufsread.c
145
name[n] = 0;
stand/boot/common/ufsread.c
175
size_t n;
stand/boot/common/ufsread.c
180
for (n = 0; sblock_try[n] != -1; n++) {
stand/boot/common/ufsread.c
181
if (dskread(fs, sblock_try[n] / DEV_BSIZE,
stand/boot/common/ufsread.c
190
fs->fs_sblockloc == sblock_try[n])
stand/boot/common/ufsread.c
194
fs->fs_sblockloc == sblock_try[n])
stand/boot/common/ufsread.c
201
if (sblock_try[n] == -1)
stand/boot/common/ufsread.c
225
size_t n, nb, size, off, vboff;
stand/boot/common/ufsread.c
255
n = IPERVBLK(fs);
stand/boot/common/ufsread.c
256
if (dskread(blkbuf, INO_TO_VBA(fs, n, ufs_inode), DBPERVBLK))
stand/boot/common/ufsread.c
258
n = INO_TO_VBO(n, ufs_inode);
stand/boot/common/ufsread.c
260
dp1 = ((struct ufs1_dinode *)blkbuf)[n];
stand/boot/common/ufsread.c
262
dp2 = ((struct ufs2_dinode *)blkbuf)[n];
stand/boot/common/ufsread.c
265
dp1 = ((struct ufs1_dinode *)blkbuf)[n];
stand/boot/common/ufsread.c
267
dp2 = ((struct ufs2_dinode *)blkbuf)[n];
stand/boot/common/ufsread.c
275
n = size - fs_off;
stand/boot/common/ufsread.c
276
if (nbyte > n)
stand/boot/common/ufsread.c
277
nbyte = n;
stand/boot/common/ufsread.c
285
n = INDIRPERVBLK(fs);
stand/boot/common/ufsread.c
287
u = (u_int)(lbn - NDADDR) / n * DBPERVBLK;
stand/boot/common/ufsread.c
294
n = (lbn - NDADDR) & (n - 1);
stand/boot/common/ufsread.c
296
addr = ((ufs1_daddr_t *)indbuf)[n];
stand/boot/common/ufsread.c
298
addr = ((ufs2_daddr_t *)indbuf)[n];
stand/boot/common/ufsread.c
301
addr = ((ufs1_daddr_t *)indbuf)[n];
stand/boot/common/ufsread.c
303
addr = ((ufs2_daddr_t *)indbuf)[n];
stand/boot/common/ufsread.c
310
n = sblksize(fs, (ssize_t)size, lbn) - (off & ~VBLKMASK);
stand/boot/common/ufsread.c
311
if (n > VBLKSIZE)
stand/boot/common/ufsread.c
312
n = VBLKSIZE;
stand/boot/common/ufsread.c
314
if (dskread(blkbuf, vbaddr, n >> DEV_BSHIFT))
stand/boot/common/ufsread.c
318
n -= vboff;
stand/boot/common/ufsread.c
319
if (n > nb)
stand/boot/common/ufsread.c
320
n = nb;
stand/boot/common/ufsread.c
321
memcpy(s, blkbuf + vboff, n);
stand/boot/common/ufsread.c
322
s += n;
stand/boot/common/ufsread.c
323
fs_off += n;
stand/boot/common/ufsread.c
324
nb -= n;
stand/boot/efi/libefi/efipart.c
110
status = OpenProtocolByHandle(hin[n], &blkio_guid,
stand/boot/efi/libefi/efipart.c
139
aliases[nout] = hin[n];
stand/boot/efi/libefi/efipart.c
141
hout[nout] = hin[n];
stand/boot/efi/libefi/efipart.c
70
u_int n, nin, nout;
stand/boot/efi/libefi/efipart.c
95
for (n = 0; n < nin; n++) {
stand/boot/efi/libefi/efipart.c
96
status = OpenProtocolByHandle(hin[n], &devpath_guid,
stand/boot/pc32/btxld/btxld.c
313
unsigned int fmt, x, n, i;
stand/boot/pc32/btxld/btxld.c
349
for (n = i = 0; i < ee->e_phnum; i++) {
stand/boot/pc32/btxld/btxld.c
353
switch (n++) {
stand/boot/pc32/btxld/btxld.c
426
size_t n;
stand/boot/pc32/btxld/btxld.c
429
if ((n = sizeof(buf)) > nbyte)
stand/boot/pc32/btxld/btxld.c
430
n = nbyte;
stand/boot/pc32/btxld/btxld.c
431
if (readx(fdi, buf, n, offset) != n)
stand/boot/pc32/btxld/btxld.c
433
writex(fdo, buf, n);
stand/boot/pc32/btxld/btxld.c
434
nbyte -= n;
stand/boot/pc32/btxld/btxld.c
445
ssize_t n;
stand/boot/pc32/btxld/btxld.c
449
if ((n = read(fd, buf, nbyte)) == -1)
stand/boot/pc32/btxld/btxld.c
451
return n;
stand/boot/pc32/btxld/btxld.c
460
ssize_t n;
stand/boot/pc32/btxld/btxld.c
462
if ((n = write(fd, buf, nbyte)) == -1)
stand/boot/pc32/btxld/btxld.c
464
if ((size_t)n != nbyte)
stand/boot/pc32/libi386/bioscd.c
266
int n;
stand/boot/pc32/libi386/bioscd.c
294
n = BOUNCEBUF_SIZE / BIOSCD_SECSIZE;
stand/boot/pc32/libi386/bioscd.c
295
if (n > blks)
stand/boot/pc32/libi386/bioscd.c
296
n = blks;
stand/boot/pc32/libi386/bioscd.c
299
packet[1] = n;
stand/boot/pc32/libi386/bioscd.c
315
bcopy(bounce_base, dest, n * BIOSCD_SECSIZE);
stand/boot/pc32/libi386/bioscd.c
316
blks -= n;
stand/boot/pc32/libi386/bioscd.c
317
dest += n * BIOSCD_SECSIZE;
stand/boot/pc32/libi386/biossmap.c
120
} while (v86.ebx != 0 && smaplen < n);
stand/boot/pc32/libi386/biossmap.c
50
int n;
stand/boot/pc32/libi386/biossmap.c
52
n = 0;
stand/boot/pc32/libi386/biossmap.c
67
n++;
stand/boot/pc32/libi386/biossmap.c
69
if (n == 0)
stand/boot/pc32/libi386/biossmap.c
71
n += 10; /* spare room */
stand/boot/pc32/libi386/biossmap.c
72
smapbase = malloc(n * sizeof(*smapbase));
stand/boot/pc32/libi386/pxe.c
527
time_t n = 0;
stand/boot/pc32/libi386/pxe.c
528
time(&n);
stand/boot/pc32/libi386/pxe.c
529
return n;
stand/boot/pc32/libi386/smbios.c
130
UUID_TYPE n;
stand/boot/pc32/libi386/smbios.c
135
n = UUID_GET(addr, i) + 1;
stand/boot/pc32/libi386/smbios.c
136
if (zeros == 0 && n == 0)
stand/boot/pc32/libi386/smbios.c
138
else if (ones == 0 && n == 1)
stand/lib/arp.c
164
ssize_t n;
stand/lib/arp.c
173
n = readether(d, pkt, len, tleft, &etype);
stand/lib/arp.c
175
if (n == -1 || n < sizeof(struct ether_arp)) {
stand/lib/arp.c
178
printf("bad len=%d\n", n);
stand/lib/arp.c
240
return (n);
stand/lib/bootp.c
274
ssize_t n;
stand/lib/bootp.c
282
n = readudp(d, pkt, len, tleft);
stand/lib/bootp.c
283
if (n == -1 || n < sizeof(struct bootp) - BOOTP_VENDSIZE)
stand/lib/bootp.c
291
(long)bp, (int)n);
stand/lib/bootp.c
320
return(n);
stand/lib/dosfs.c
108
#define bytsec(n) ((n) >> SSHIFT)
stand/lib/dosfs.c
111
#define bytblk(fs, n) ((n) >> (fs)->bshift)
stand/lib/dosfs.c
251
u_int nb, off, clus, c, cnt, n;
stand/lib/dosfs.c
258
if (nb > (n = size - f->offset))
stand/lib/dosfs.c
259
nb = n;
stand/lib/dosfs.c
266
n = 0;
stand/lib/dosfs.c
269
n = bytblk(f->fs, f->offset);
stand/lib/dosfs.c
271
n++;
stand/lib/dosfs.c
272
while (n--) {
stand/lib/dosfs.c
280
if (!clus || (n = f->fs->bsize - off) > cnt)
stand/lib/dosfs.c
281
n = cnt;
stand/lib/dosfs.c
284
buf, n)))
stand/lib/dosfs.c
286
f->offset += n;
stand/lib/dosfs.c
289
buf += n;
stand/lib/dosfs.c
290
cnt -= n;
stand/lib/dosfs.c
502
size_t n;
stand/lib/dosfs.c
514
if ((n = s - path) > 255)
stand/lib/dosfs.c
516
memcpy(name, path, n);
stand/lib/dosfs.c
517
name[n] = 0;
stand/lib/dosfs.c
627
u_int n, x, c;
stand/lib/dosfs.c
630
for (n = 0; n < 3; n++)
stand/lib/dosfs.c
631
for (p = (u_char *)xde + ix[n].off, x = ix[n].dim; x;
stand/lib/dosfs.c
676
int n;
stand/lib/dosfs.c
682
if ((n = fatcnt(fs, c)) == -1)
stand/lib/dosfs.c
683
return n;
stand/lib/dosfs.c
684
size = blkbyt(fs, n);
stand/lib/dosfs.c
696
int n;
stand/lib/dosfs.c
698
for (n = 0; okclus(fs, c); n++)
stand/lib/dosfs.c
701
return fatend(fs->fatsz, c) ? n : -1;
stand/lib/dosfs.c
739
u_int off, n;
stand/lib/dosfs.c
748
if ((n = SECSIZ - off) > nbyte)
stand/lib/dosfs.c
749
n = nbyte;
stand/lib/dosfs.c
750
memcpy(s, fs->buf + off, n);
stand/lib/dosfs.c
751
s += n;
stand/lib/dosfs.c
752
nbyte -= n;
stand/lib/dosfs.c
754
n = nbyte & (SECSIZ - 1);
stand/lib/dosfs.c
755
if (nbyte -= n) {
stand/lib/dosfs.c
761
if (n) {
stand/lib/dosfs.c
764
memcpy(s, fs->buf, n);
stand/lib/ether.c
100
n = netif_get(d, eh, len, tleft);
stand/lib/ether.c
101
if (n == -1 || n < sizeof(*eh))
stand/lib/ether.c
116
n -= sizeof(*eh);
stand/lib/ether.c
117
return (n);
stand/lib/ether.c
57
ssize_t n;
stand/lib/ether.c
72
n = netif_put(d, eh, len);
stand/lib/ether.c
73
if (n == -1 || n < sizeof(*eh))
stand/lib/ether.c
76
n -= sizeof(*eh);
stand/lib/ether.c
77
return (n);
stand/lib/ether.c
89
ssize_t n;
stand/lib/gets.c
40
ngets(char *buf, int n)
stand/lib/gets.c
75
if ((n < 1) || ((lp - buf) < n)) {
stand/lib/hammer1.c
426
int n;
stand/lib/hammer1.c
454
n = hammer_btree_search_node(&search, node);
stand/lib/hammer1.c
458
for (; n < node->count + internal; n++) {
stand/lib/hammer1.c
459
e = &node->elms[n];
stand/lib/hammer1.c
467
if (n > 0)
stand/lib/hammer1.c
468
e = &node->elms[--n];
stand/lib/hammer1.c
479
if (n == node->count)
stand/lib/hammer1.c
490
n++;
stand/lib/hammer1.c
494
while (n < node->count && e->base.delete_tid != 0) {
stand/lib/hammer1.c
496
n++;
stand/lib/hammer1.c
502
if (n == node->count) {
stand/lib/hammer1.c
679
for (char *n = name; *path != 0 && *path != '/'; path++, n++) {
stand/lib/hammer1.c
680
n[0] = *path;
stand/lib/hammer1.c
681
n[1] = 0;
stand/lib/net.c
134
int n;
stand/lib/net.c
177
n = pp - parts + 1;
stand/lib/net.c
178
switch (n) {
stand/lib/net.c
219
int n;
stand/lib/net.c
226
n = 4;
stand/lib/net.c
239
} while (--n > 0);
stand/lib/net.c
245
number(char *s, int *n)
stand/lib/net.c
247
for (*n = 0; isdigit(*s); s++)
stand/lib/net.c
248
*n = (*n * 10) + *s - '0';
stand/lib/net.c
256
n_long addr = 0, n;
stand/lib/net.c
260
p = number(p, &n);
stand/lib/net.c
261
addr |= (n << 24) & 0xff000000;
stand/lib/net.c
264
p = number(p, &n);
stand/lib/net.c
265
addr |= (n << 16) & 0xff0000;
stand/lib/net.c
268
p = number(p, &n);
stand/lib/net.c
269
addr |= (n << 8) & 0xff00;
stand/lib/net.c
272
p = number(p, &n);
stand/lib/net.c
273
addr |= n & 0xff;
stand/lib/printf.c
183
int ch, n;
stand/lib/printf.c
247
for (n = 0;; ++fmt) {
stand/lib/printf.c
248
n = n * 10 + ch - '0';
stand/lib/printf.c
254
dwidth = n;
stand/lib/printf.c
256
width = n;
stand/lib/printf.c
316
n = strlen (p);
stand/lib/printf.c
318
for (n = 0; n < dwidth && p[n]; n++)
stand/lib/printf.c
321
width -= n;
stand/lib/printf.c
326
while (n--)
stand/lib/printf.c
387
p = ksprintn(nbuf, num, base, &n, upper);
stand/lib/printf.c
400
width -= tmp + imax(dwidth, n);
stand/lib/printf.c
401
dwidth -= n;
stand/lib/qdivrem.c
140
for (n = 4; v[1] == 0; v++) {
stand/lib/qdivrem.c
141
if (--n == 1) {
stand/lib/qdivrem.c
174
for (m = 4 - n; u[1] == 0; u++)
stand/lib/qdivrem.c
190
shl(&u[0], m + n, d); /* u <<= d */
stand/lib/qdivrem.c
191
shl(&v[1], n - 1, d); /* v <<= d */
stand/lib/qdivrem.c
234
for (t = 0, i = n; i > 0; i--) {
stand/lib/qdivrem.c
249
for (t = 0, i = n; i > 0; i--) { /* D6: add back. */
stand/lib/qdivrem.c
266
for (i = m + n; i > m; --i)
stand/lib/qdivrem.c
92
int m, n, d, j, i;
stand/lib/rarp.c
151
ssize_t n;
stand/lib/rarp.c
160
n = readether(d, pkt, len, tleft, &etype);
stand/lib/rarp.c
162
if (n == -1 || n < sizeof(struct ether_arp)) {
stand/lib/rarp.c
165
printf("bad len=%d\n", n);
stand/lib/rarp.c
213
return (n);
stand/lib/rpc.c
239
ssize_t n;
stand/lib/rpc.c
248
n = readudp(d, pkt, len, tleft);
stand/lib/rpc.c
249
if (n <= (4 * 4))
stand/lib/rpc.c
280
return (n);
stand/lib/strcasecmp.c
49
strncasecmp(const char *s1, const char *s2, size_t n)
stand/lib/strcasecmp.c
51
if (n != 0) {
stand/lib/strcasecmp.c
61
} while (--n != 0);
stand/lib/udp.c
134
ssize_t n;
stand/lib/udp.c
148
n = readether(d, ip, len + sizeof(*ip) + sizeof(*uh), tleft, &etype);
stand/lib/udp.c
149
if (n == -1 || n < sizeof(*ip) + sizeof(*uh))
stand/lib/udp.c
191
if (n < ntohs(ip->ip_len)) {
stand/lib/udp.c
195
(int)n, ntohs(ip->ip_len));
stand/lib/udp.c
213
n -= hlen - sizeof(*ip);
stand/lib/udp.c
229
n = ntohs(uh->uh_ulen) + sizeof(*ip);
stand/lib/udp.c
230
if (n > RECV_SIZE - ETHER_SIZE) {
stand/lib/udp.c
231
printf("readudp: huge packet, udp len %d\n", (int)n);
stand/lib/udp.c
240
if (in_cksum(ui, n) != 0) {
stand/lib/udp.c
260
n -= sizeof(*ip) + sizeof(*uh);
stand/lib/udp.c
261
return (n);
stand/lib/uuid_from_string.c
122
n = u->clock_seq_hi_and_reserved;
stand/lib/uuid_from_string.c
123
if ((n & 0x80) != 0x00 && /* variant 0? */
stand/lib/uuid_from_string.c
124
(n & 0xc0) != 0x80 && /* variant 1? */
stand/lib/uuid_from_string.c
125
(n & 0xe0) != 0xc0) { /* variant 2? */
stand/lib/uuid_from_string.c
91
int n;
sys/bus/firewire/firewire.h
276
u_int16_t n;
sys/bus/firewire/fwdev.c
654
fwdevlst->n = i;
sys/bus/firewire/fwdma.c
146
int esize, int n, int flag)
sys/bus/firewire/fwdma.c
156
nseg = n;
sys/bus/firewire/fwdma.c
160
nseg = howmany(n, ssize / esize);
sys/bus/gpio/gpio_acpi/gpio_acpi.c
398
int n;
sys/bus/gpio/gpio_acpi/gpio_acpi.c
411
n = 0;
sys/bus/gpio/gpio_acpi/gpio_acpi.c
417
n++;
sys/bus/gpio/gpio_acpi/gpio_acpi.c
423
if (n <= 0) {
sys/bus/gpio/gpio_acpi/gpio_acpi.c
427
sc->infos = kmalloc(n*sizeof(*sc->infos), M_DEVBUF, M_WAITOK | M_ZERO);
sys/bus/gpio/gpio_acpi/gpio_acpi.c
428
for (res = (ACPI_RESOURCE *)b.Pointer; res < end && sc->num_aei < n;
sys/bus/pccard/pccardvar.h
276
#define pccard_tuple_read_n(tuple, n, idxn) \
sys/bus/pccard/pccardvar.h
277
(((n)==1)?pccard_tuple_read_1((tuple), (idxn)) : \
sys/bus/pccard/pccardvar.h
278
(((n)==2)?pccard_tuple_read_2((tuple), (idxn)) : \
sys/bus/pccard/pccardvar.h
279
(((n)==3)?pccard_tuple_read_3((tuple), (idxn)) : \
sys/bus/pci/pci.c
3073
#define REG(n, w) PCIB_READ_CONFIG(pcib, busno, s, f, n, w)
sys/bus/pci/pci.c
510
#define REG(n, w) PCIB_READ_CONFIG(pcib, b, s, f, n, w)
sys/bus/pci/pci.c
533
#define REG(n, w) PCIB_READ_CONFIG(pcib, b, s, f, n, w)
sys/bus/pci/pci.c
639
#define REG(n, w) \
sys/bus/pci/pci.c
640
PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
673
#define REG(n, w) \
sys/bus/pci/pci.c
674
PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
716
#define REG(n, w) \
sys/bus/pci/pci.c
717
PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
731
#define REG(n, w) \
sys/bus/pci/pci.c
732
PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
763
#define REG(n, w) \
sys/bus/pci/pci.c
764
PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
823
#define REG(n, w) \
sys/bus/pci/pci.c
824
PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
850
#define REG(n, w) PCIB_READ_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, w)
sys/bus/pci/pci.c
851
#define WREG(n, v, w) PCIB_WRITE_CONFIG(pcib, cfg->bus, cfg->slot, cfg->func, n, v, w)
sys/bus/pci/pcireg.h
940
#define PCIR_VC_RESOURCE_CAP(n) (0x10 + (n) * 0x0C)
sys/bus/pci/pcireg.h
941
#define PCIR_VC_RESOURCE_CTL(n) (0x14 + (n) * 0x0C)
sys/bus/pci/pcireg.h
942
#define PCIR_VC_RESOURCE_STA(n) (0x18 + (n) * 0x0C)
sys/bus/ppbus/ppb_msq.h
120
#define MS_RASSERT_P(n,reg) { MS_OP_RASSERT_P, {{ n }, { reg }}}
sys/bus/ppbus/ppb_msq.h
121
#define MS_RFETCH_P(n,reg,mask) { MS_OP_RFETCH_P, {{ n }, { reg }, { mask }}}
sys/bus/ppbus/ppbconf.h
70
#define nSTROBE n(STROBE)
sys/bus/ppbus/ppbconf.h
71
#define nAUTOFEED n(AUTOFEED)
sys/bus/ppbus/ppbconf.h
72
#define INIT n(nINIT)
sys/bus/ppbus/ppbconf.h
73
#define nSELECTIN n(SELECTIN)
sys/bus/ppbus/ppbconf.h
74
#define nPCD n(PCD)
sys/bus/u4b/audio/uaudio.c
161
#define MIX_SIZE(n) ((((n) == MIX_SIGNED_16) || \
sys/bus/u4b/audio/uaudio.c
162
((n) == MIX_UNSIGNED_16)) ? 2 : 1)
sys/bus/u4b/audio/uaudio.c
163
#define MIX_UNSIGNED(n) ((n) == MIX_UNSIGNED_16)
sys/bus/u4b/audio/uaudio.c
2143
uint32_t n;
sys/bus/u4b/audio/uaudio.c
2241
for (n = 0; n != blockcount; n++) {
sys/bus/u4b/audio/uaudio.c
2264
usbd_xfer_set_frame_len(xfer, n, frame_len);
sys/bus/u4b/audio/uaudio.c
2275
n = (ch->end - ch->cur);
sys/bus/u4b/audio/uaudio.c
2276
if (n > total)
sys/bus/u4b/audio/uaudio.c
2277
n = total;
sys/bus/u4b/audio/uaudio.c
2279
usbd_copy_in(pc, offset, ch->cur, n);
sys/bus/u4b/audio/uaudio.c
2281
total -= n;
sys/bus/u4b/audio/uaudio.c
2282
ch->cur += n;
sys/bus/u4b/audio/uaudio.c
2283
offset += n;
sys/bus/u4b/audio/uaudio.c
2312
int n;
sys/bus/u4b/audio/uaudio.c
2347
for (n = 0; n != nframes; n++) {
sys/bus/u4b/audio/uaudio.c
2350
len = usbd_xfer_frame_len(xfer, n);
sys/bus/u4b/audio/uaudio.c
2406
for (n = 0; n != nframes; n++)
sys/bus/u4b/audio/uaudio.c
2407
usbd_xfer_set_frame_len(xfer, n, mfl);
sys/bus/u4b/audio/uaudio.c
2807
int n;
sys/bus/u4b/audio/uaudio.c
2816
for (n = 0, pmc = sc->sc_mixer_root; pmc != NULL;
sys/bus/u4b/audio/uaudio.c
2817
pmc = pmc->next, n++) {
sys/bus/u4b/audio/uaudio.c
2823
pmc->name, n, chan);
sys/bus/u4b/audio/uaudio.c
2826
pmc->name, n);
sys/bus/u4b/audio/uaudio.c
4472
uint8_t n;
sys/bus/u4b/audio/uaudio.c
4474
n = iot->usr.id_max;
sys/bus/u4b/audio/uaudio.c
4476
if (isset(iot->usr.bit_input, n)) {
sys/bus/u4b/audio/uaudio.c
4478
return (root + n);
sys/bus/u4b/audio/uaudio.c
4480
} while (n--);
sys/bus/u4b/audio/uaudio.c
4489
uint8_t n;
sys/bus/u4b/audio/uaudio.c
4491
n = iot->usr.id_max;
sys/bus/u4b/audio/uaudio.c
4493
if (isset(iot->usr.bit_output, n)) {
sys/bus/u4b/audio/uaudio.c
4495
return (root + n);
sys/bus/u4b/audio/uaudio.c
4497
} while (n--);
sys/bus/u4b/audio/uaudio.c
4508
uint8_t n;
sys/bus/u4b/audio/uaudio.c
4513
for (n = 0; n < n_id; n++) {
sys/bus/u4b/audio/uaudio.c
4515
i = p_id[n];
sys/bus/u4b/audio/uaudio.c
4529
is_last = ((n + 1) == n_id);
sys/bus/u4b/audio/uaudio.c
4612
uint8_t n;
sys/bus/u4b/audio/uaudio.c
4617
for (n = 0; n < n_id; n++) {
sys/bus/u4b/audio/uaudio.c
4619
i = p_id[n];
sys/bus/u4b/audio/uaudio.c
4633
is_last = ((n + 1) == n_id);
sys/bus/u4b/audio/uaudio.c
4737
uint8_t n;
sys/bus/u4b/audio/uaudio.c
4743
for (n = 0; n < n_id; n++) {
sys/bus/u4b/audio/uaudio.c
4745
i = p_id[n];
sys/bus/u4b/audio/uaudio.c
4759
is_last = ((n + 1) == n_id);
sys/bus/u4b/audio/uaudio.c
5764
uint32_t n;
sys/bus/u4b/audio/uaudio.c
5766
for (n = 0; n < UMIDI_EMB_JACK_MAX; n++) {
sys/bus/u4b/audio/uaudio.c
5767
sub = &chan->sub[n];
sys/bus/u4b/audio/uaudio.c
5910
uint32_t n;
sys/bus/u4b/audio/uaudio.c
5954
for (n = 0; n < chan->max_emb_jack; n++) {
sys/bus/u4b/audio/uaudio.c
5956
sub = &chan->sub[n];
sys/bus/u4b/audio/uaudio.c
5959
&umidi_fifo_methods, &sub->fifo, unit, n,
sys/bus/u4b/audio/uaudio.c
5990
uint32_t n;
sys/bus/u4b/audio/uaudio.c
5992
for (n = 0; n < UMIDI_EMB_JACK_MAX; n++)
sys/bus/u4b/audio/uaudio.c
5993
usb_fifo_detach(&chan->sub[n].fifo);
sys/bus/u4b/audio/uaudioreg.h
140
#define UA_GETSAMP(p, n) ((uint32_t)((((p)->tSamFreq[((n)*3)+0]) | \
sys/bus/u4b/audio/uaudioreg.h
141
((p)->tSamFreq[((n)*3)+1] << 8) | \
sys/bus/u4b/audio/uaudioreg.h
142
((p)->tSamFreq[((n)*3)+2] << 16))))
sys/bus/u4b/audio/uaudioreg.h
412
#define UA_PROC_MASK(n) (1<< ((n)-1))
sys/bus/u4b/controller/ehci.c
3503
uint32_t n;
sys/bus/u4b/controller/ehci.c
3642
for (n = 0; n != nitd; n++) {
sys/bus/u4b/controller/ehci.c
3645
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ehci.c
3652
td->page_cache = pc + n;
sys/bus/u4b/controller/ehci.c
3656
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ehci.c
3666
for (n = 0; n != nsitd; n++) {
sys/bus/u4b/controller/ehci.c
3669
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ehci.c
3676
td->page_cache = pc + n;
sys/bus/u4b/controller/ehci.c
3680
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ehci.c
3690
for (n = 0; n != nqtd; n++) {
sys/bus/u4b/controller/ehci.c
3693
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ehci.c
3700
qtd->page_cache = pc + n;
sys/bus/u4b/controller/ehci.c
3704
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ehci.c
3718
for (n = 0; n != nqh; n++) {
sys/bus/u4b/controller/ehci.c
3721
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ehci.c
3728
qh->page_cache = pc + n;
sys/bus/u4b/controller/ehci.c
3732
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ehcireg.h
139
#define EHCI_PORTSC(n) (0x40+(4*(n))) /* RO, RW, RWC Port Status reg */
sys/bus/u4b/controller/ohci.c
2386
uint32_t n;
sys/bus/u4b/controller/ohci.c
2462
for (n = 0; n != ntd; n++) {
sys/bus/u4b/controller/ohci.c
2465
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ohci.c
2472
td->page_cache = pc + n;
sys/bus/u4b/controller/ohci.c
2476
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ohci.c
2486
for (n = 0; n != nitd; n++) {
sys/bus/u4b/controller/ohci.c
2489
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ohci.c
2496
itd->page_cache = pc + n;
sys/bus/u4b/controller/ohci.c
2500
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ohci.c
2514
for (n = 0; n != nqh; n++) {
sys/bus/u4b/controller/ohci.c
2517
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/ohci.c
2524
ed->page_cache = pc + n;
sys/bus/u4b/controller/ohci.c
2528
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/ohcireg.h
113
#define OHCI_RH_PORT_STATUS(n) (0x50 + ((n)*4)) /* 1 based indexing */
sys/bus/u4b/controller/uhci.c
2840
uint32_t n;
sys/bus/u4b/controller/uhci.c
2917
n = 0;
sys/bus/u4b/controller/uhci.c
2920
n++;
sys/bus/u4b/controller/uhci.c
2925
n--;
sys/bus/u4b/controller/uhci.c
2934
if (n < 3) {
sys/bus/u4b/controller/uhci.c
2935
n = 3;
sys/bus/u4b/controller/uhci.c
2937
align = (1 << n);
sys/bus/u4b/controller/uhci.c
2961
for (n = 0; n != ntd; n++) {
sys/bus/u4b/controller/uhci.c
2964
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/uhci.c
2981
td->page_cache = pc + n;
sys/bus/u4b/controller/uhci.c
2985
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/uhci.c
2999
for (n = 0; n != nqh; n++) {
sys/bus/u4b/controller/uhci.c
3002
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/uhci.c
3009
qh->page_cache = pc + n;
sys/bus/u4b/controller/uhci.c
3013
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/uhci.c
313
uint16_t n;
sys/bus/u4b/controller/uhci.c
338
n = UHCI_RESET_TIMEOUT;
sys/bus/u4b/controller/uhci.c
339
while (n--) {
sys/bus/u4b/controller/uhci.c
354
n = 10;
sys/bus/u4b/controller/uhci.c
355
while (n--) {
sys/bus/u4b/controller/uhci.h
86
#define UHCI_TD_SET_ERRCNT(n) ((n) << 27)
sys/bus/u4b/controller/xhci.c
3733
uint32_t n;
sys/bus/u4b/controller/xhci.c
3802
for (n = 0; n != ntd; n++) {
sys/bus/u4b/controller/xhci.c
3805
usbd_get_page(pc + n, 0, &page_info);
sys/bus/u4b/controller/xhci.c
3812
td->page_cache = pc + n;
sys/bus/u4b/controller/xhci.c
3816
usb_pc_cpu_flush(pc + n);
sys/bus/u4b/controller/xhci.c
4294
uint8_t n;
sys/bus/u4b/controller/xhci.c
4311
for (n = 1; n != XHCI_MAX_ENDPOINTS; n++) {
sys/bus/u4b/controller/xhci.c
4314
n | XHCI_DB_SID_SET(p));
sys/bus/u4b/controller/xhci.c
4328
uint8_t n;
sys/bus/u4b/controller/xhci.c
4343
for (n = 1; n != XHCI_MAX_ENDPOINTS; n++) {
sys/bus/u4b/controller/xhci.c
4344
err = xhci_cmd_stop_ep(sc, 1, n, index);
sys/bus/u4b/controller/xhci.c
4347
"%u on slot %u (ignored).\n", n, index);
sys/bus/u4b/controller/xhci.h
171
#define XHCI_INCTX_0_DROP_MASK(n) (1U << (n))
sys/bus/u4b/controller/xhci.h
173
#define XHCI_INCTX_1_ADD_MASK(n) (1U << (n))
sys/bus/u4b/controller/xhcireg.h
102
#define XHCI_DNCTRL_MASK(n) (1U << (n))
sys/bus/u4b/controller/xhcireg.h
116
#define XHCI_PORTSC(n) (0x3F0 + (0x10 * (n))) /* XHCI port status */
sys/bus/u4b/controller/xhcireg.h
143
#define XHCI_PORTPMSC(n) (0x3F4 + (0x10 * (n))) /* XHCI status and control */
sys/bus/u4b/controller/xhcireg.h
156
#define XHCI_PORTLI(n) (0x3F8 + (0x10 * (n))) /* XHCI port link info */
sys/bus/u4b/controller/xhcireg.h
158
#define XHCI_PORTRSV(n) (0x3FC + (0x10 * (n))) /* XHCI port reserved */
sys/bus/u4b/controller/xhcireg.h
163
#define XHCI_IMAN(n) (0x0020 + (0x20 * (n))) /* XHCI interrupt management */
sys/bus/u4b/controller/xhcireg.h
166
#define XHCI_IMOD(n) (0x0024 + (0x20 * (n))) /* XHCI interrupt moderation */
sys/bus/u4b/controller/xhcireg.h
173
#define XHCI_ERSTSZ(n) (0x0028 + (0x20 * (n))) /* XHCI event ring segment table size */
sys/bus/u4b/controller/xhcireg.h
176
#define XHCI_ERSTBA_LO(n) (0x0030 + (0x20 * (n))) /* XHCI event ring segment table BA */
sys/bus/u4b/controller/xhcireg.h
177
#define XHCI_ERSTBA_HI(n) (0x0034 + (0x20 * (n))) /* XHCI event ring segment table BA */
sys/bus/u4b/controller/xhcireg.h
178
#define XHCI_ERDP_LO(n) (0x0038 + (0x20 * (n))) /* XHCI event ring dequeue pointer */
sys/bus/u4b/controller/xhcireg.h
181
#define XHCI_ERDP_HI(n) (0x003C + (0x20 * (n))) /* XHCI event ring dequeue pointer */
sys/bus/u4b/controller/xhcireg.h
184
#define XHCI_DOORBELL(n) (0x0000 + (4 * (n)))
sys/bus/u4b/input/ukbd.c
1204
uint16_t n;
sys/bus/u4b/input/ukbd.c
1242
for (n = 0; n < UKBD_NFKEY; n++) {
sys/bus/u4b/input/ukbd.c
1243
sc->sc_fkeymap[n] = fkey_tab[n];
sys/bus/u4b/net/if_cdce.c
1221
uint16_t n;
sys/bus/u4b/net/if_cdce.c
1242
for (n = 0; n != sc->sc_ncm.tx_nframe; n++) {
sys/bus/u4b/net/if_cdce.c
1262
if (n == 0) {
sys/bus/u4b/net/if_cdce.c
1267
n--;
sys/bus/u4b/net/if_cdce.c
1276
USETW(sc->sc_ncm.dp[n].wFrameLength, m->m_pkthdr.len);
sys/bus/u4b/net/if_cdce.c
1277
USETW(sc->sc_ncm.dp[n].wFrameIndex, offset);
sys/bus/u4b/net/if_cdce.c
1307
if (n == 0)
sys/bus/u4b/net/if_cdce.c
1310
rem = (sizeof(sc->sc_ncm.dpt) + (4 * n) + 4);
sys/bus/u4b/net/if_cdce.c
1315
for (; n != CDCE_NCM_SUBFRAMES_MAX; n++) {
sys/bus/u4b/net/if_cdce.c
1316
USETW(sc->sc_ncm.dp[n].wFrameLength, 0);
sys/bus/u4b/net/if_cdce.c
1317
USETW(sc->sc_ncm.dp[n].wFrameIndex, 0);
sys/bus/u4b/net/if_cdce.c
762
cdce_free_queue(struct mbuf **ppm, uint8_t n)
sys/bus/u4b/net/if_cdce.c
765
for (x = 0; x != n; x++) {
sys/bus/u4b/net/if_ipheth.c
368
ipheth_free_queue(struct mbuf **ppm, uint8_t n)
sys/bus/u4b/net/if_ipheth.c
372
for (x = 0; x != n; x++) {
sys/bus/u4b/serial/u3g.c
611
uint8_t n;
sys/bus/u4b/serial/u3g.c
620
for (n = 0; n != NELEM(setup); n++) {
sys/bus/u4b/serial/u3g.c
622
memcpy(&req, setup[n], sizeof(req));
sys/bus/u4b/serial/u3g.c
637
__DECONST(uint8_t *, &setup[n][8]));
sys/bus/u4b/serial/u3g.c
641
(unsigned int)n);
sys/bus/u4b/serial/u3g.c
794
int ep, n;
sys/bus/u4b/serial/u3g.c
806
for (n = 0; n != U3G_N_TRANSFER; n++)
sys/bus/u4b/serial/u3g.c
807
u3g_config_tmp[n] = u3g_config[n];
sys/bus/u4b/serial/u3g.c
837
for (n = 0; n < U3G_N_TRANSFER; n++)
sys/bus/u4b/serial/u3g.c
838
u3g_config_tmp[n].ep_index = ep;
sys/bus/u4b/serial/ubser.c
229
uint8_t n;
sys/bus/u4b/serial/ubser.c
277
for (n = 0; n < sc->sc_numser; n++) {
sys/bus/u4b/serial/ubser.c
278
sc->sc_ucom[n].sc_portno = n;
sys/bus/u4b/serial/uftdi_reg.h
125
#define FTDI_SIO_SET_DATA_BITS(n) (n)
sys/bus/u4b/serial/umcs.c
300
int n;
sys/bus/u4b/serial/umcs.c
303
for (n = 0; n < UMCS7840_N_TRANSFERS; ++n)
sys/bus/u4b/serial/umcs.c
304
umcs7840_config_tmp[n] = umcs7840_bulk_config_data[n];
sys/bus/u4b/serial/umcs.c
351
for (n = 0; n < UMCS7840_N_TRANSFERS; ++n) {
sys/bus/u4b/serial/umcs.c
353
umcs7840_config_tmp[n].endpoint = umcs7840_bulk_config_data[n].endpoint + 2 * sc->sc_ucom[subunit].sc_portno;
sys/bus/u4b/serial/umcs.c
354
umcs7840_config_tmp[n].callback = umcs7840_rw_callbacks[subunit][n];
sys/bus/u4b/template/usb_template.c
1237
uint8_t n;
sys/bus/u4b/template/usb_template.c
1305
for (n = 0;; n++) {
sys/bus/u4b/template/usb_template.c
1307
buf = usb_temp_get_config_desc(udev, NULL, n);
sys/bus/u4b/template/usb_template.c
1314
"Config Descriptor %u, error = %s\n", n,
sys/bus/u4b/template/usb_template.c
562
uint8_t n;
sys/bus/u4b/template/usb_template.c
586
for (n = 1; n != (USB_EP_MAX / 2); n++) {
sys/bus/u4b/template/usb_template.c
589
(ues->methods->get_hw_ep_profile) (ues->udev, &pf, n);
sys/bus/u4b/template/usb_template.c
596
if (isset(ues->bmInAlloc, n)) {
sys/bus/u4b/template/usb_template.c
603
if (isset(ues->bmOutAlloc, n)) {
sys/bus/u4b/template/usb_template.c
629
best_n = n;
sys/bus/u4b/usb_debug.h
38
#define DPRINTFN(n,fmt,...) do { \
sys/bus/u4b/usb_debug.h
39
if ((USB_DEBUG_VAR) >= (n)) { \
sys/bus/u4b/usb_dev.c
1731
int n, struct uio *uio)
sys/bus/u4b/usb_dev.c
1741
error = uiomove(cp, n, uio);
sys/bus/u4b/usb_dev.c
1867
uint8_t n;
sys/bus/u4b/usb_dev.c
1883
for (n = 0;; n += 2) {
sys/bus/u4b/usb_dev.c
1885
if (n == USB_FIFO_MAX) {
sys/bus/u4b/usb_dev.c
1890
if (udev->fifo[n + USB_FIFO_TX] != NULL) {
sys/bus/u4b/usb_dev.c
1894
if (udev->fifo[n + USB_FIFO_RX] != NULL) {
sys/bus/u4b/usb_dev.c
1910
f_tx->fifo_index = n + USB_FIFO_TX;
sys/bus/u4b/usb_dev.c
1918
f_rx->fifo_index = n + USB_FIFO_RX;
sys/bus/u4b/usb_dev.c
1934
for (n = 0; n != 4; n++) {
sys/bus/u4b/usb_dev.c
1936
if (pm->basename[n] == NULL) {
sys/bus/u4b/usb_dev.c
1941
"%s%u%s", pm->basename[n],
sys/bus/u4b/usb_dev.c
1942
unit, pm->postfix[n] ?
sys/bus/u4b/usb_dev.c
1943
pm->postfix[n] : "")) {
sys/bus/u4b/usb_dev.c
1948
"%s%u.%u%s", pm->basename[n],
sys/bus/u4b/usb_dev.c
1949
unit, subunit, pm->postfix[n] ?
sys/bus/u4b/usb_dev.c
1950
pm->postfix[n] : "")) {
sys/bus/u4b/usb_dev.c
1958
if (n & 1) {
sys/bus/u4b/usb_dev.c
1959
f_rx->symlink[n / 2] =
sys/bus/u4b/usb_dev.c
1962
f_tx->symlink[n / 2] =
sys/bus/u4b/usb_dev.c
400
uint8_t n;
sys/bus/u4b/usb_dev.c
434
for (n = 0;; n += 2) {
sys/bus/u4b/usb_dev.c
436
if (n == USB_FIFO_MAX) {
sys/bus/u4b/usb_dev.c
439
n = 0;
sys/bus/u4b/usb_dev.c
448
f = udev->fifo[n + USB_FIFO_TX];
sys/bus/u4b/usb_dev.c
465
f = udev->fifo[n + USB_FIFO_RX];
sys/bus/u4b/usb_dev.c
502
(udev->fifo[n + USB_FIFO_TX] == NULL)) {
sys/bus/u4b/usb_dev.c
515
f->fifo_index = n + USB_FIFO_TX;
sys/bus/u4b/usb_dev.c
522
udev->fifo[n + USB_FIFO_TX] = f;
sys/bus/u4b/usb_dev.c
527
(udev->fifo[n + USB_FIFO_RX] == NULL)) {
sys/bus/u4b/usb_dev.c
541
f->fifo_index = n + USB_FIFO_RX;
sys/bus/u4b/usb_dev.c
548
udev->fifo[n + USB_FIFO_RX] = f;
sys/bus/u4b/usb_dev.c
552
crd->txfifo = udev->fifo[n + USB_FIFO_TX];
sys/bus/u4b/usb_dev.c
555
crd->rxfifo = udev->fifo[n + USB_FIFO_RX];
sys/bus/u4b/usb_dev.c
558
DPRINTFN(5, "fifo index = %d\n", n);
sys/bus/u4b/usb_dev.c
559
cpd->fifo_index = n;
sys/bus/u4b/usb_dev.c
569
uint8_t n;
sys/bus/u4b/usb_dev.c
576
for (n = 0; n != 2; n++) {
sys/bus/u4b/usb_dev.c
577
if (f->symlink[n]) {
sys/bus/u4b/usb_dev.c
578
usb_free_symlink(f->symlink[n]);
sys/bus/u4b/usb_dev.c
579
f->symlink[n] = NULL;
sys/bus/u4b/usb_generic.c
1043
usb_frcount_t n;
sys/bus/u4b/usb_generic.c
1117
n = 1;
sys/bus/u4b/usb_generic.c
1127
n = 0;
sys/bus/u4b/usb_generic.c
1157
for (; n != xfer->nframes; n++) {
sys/bus/u4b/usb_generic.c
1159
error = copyin(fs_ep.pLength + n,
sys/bus/u4b/usb_generic.c
1164
usbd_xfer_set_frame_len(xfer, n, length);
sys/bus/u4b/usb_generic.c
1175
error = copyin(fs_ep.ppBuffer + n,
sys/bus/u4b/usb_generic.c
1186
usbd_xfer_set_frame_offset(xfer, offset, n);
sys/bus/u4b/usb_generic.c
1189
kaddr = xfer->frbuffers[n].buffer;
sys/bus/u4b/usb_generic.c
1220
usb_frcount_t n;
sys/bus/u4b/usb_generic.c
1261
n = 0; /* should never happen */
sys/bus/u4b/usb_generic.c
1263
n = 1;
sys/bus/u4b/usb_generic.c
1271
n = 0;
sys/bus/u4b/usb_generic.c
1279
for (; n != xfer->nframes; n++) {
sys/bus/u4b/usb_generic.c
1282
error = copyin(fs_ep.pLength + n,
sys/bus/u4b/usb_generic.c
1297
length = xfer->frlengths[n];
sys/bus/u4b/usb_generic.c
1308
error = copyin(fs_ep.ppBuffer + n,
sys/bus/u4b/usb_generic.c
1319
kaddr = xfer->frbuffers[n].buffer;
sys/bus/u4b/usb_generic.c
1336
fs_ep.pLength + n, sizeof(length));
sys/bus/u4b/usb_generic.c
2073
uint8_t n;
sys/bus/u4b/usb_generic.c
2168
for (n = 0; n != 4; n++) {
sys/bus/u4b/usb_generic.c
2170
u.stat->uds_requests_fail[n] =
sys/bus/u4b/usb_generic.c
2171
f->udev->bus->stats_err.uds_requests[n];
sys/bus/u4b/usb_generic.c
2173
u.stat->uds_requests_ok[n] =
sys/bus/u4b/usb_generic.c
2174
f->udev->bus->stats_ok.uds_requests[n];
sys/bus/u4b/usb_generic.c
2193
n = *u.pint & 0xFF;
sys/bus/u4b/usb_generic.c
2195
iface = usbd_get_iface(f->udev, n);
sys/bus/u4b/usb_generic.c
2209
n = *u.pint & 0xFF;
sys/bus/u4b/usb_generic.c
2211
if (n == USB_IFACE_INDEX_ANY) {
sys/bus/u4b/usb_generic.c
2219
usb_detach_device(f->udev, n, 0);
sys/bus/u4b/usb_generic.c
2225
usbd_set_parent_iface(f->udev, n, n);
sys/bus/u4b/usb_generic.c
530
usb_frcount_t n;
sys/bus/u4b/usb_generic.c
541
for (n = 0; n != xfer->aframes; n++) {
sys/bus/u4b/usb_generic.c
543
xfer->frlengths[n], 1);
sys/bus/u4b/usb_generic.c
549
for (n = 0; n != xfer->nframes; n++) {
sys/bus/u4b/usb_generic.c
551
usbd_xfer_set_frame_len(xfer, n, xfer->max_frame_size);
sys/bus/u4b/usb_generic.c
570
usb_frcount_t n;
sys/bus/u4b/usb_generic.c
579
for (n = 0; n != xfer->nframes; n++) {
sys/bus/u4b/usb_generic.c
582
usbd_xfer_set_frame_len(xfer, n, actlen);
sys/bus/u4b/usb_generic.c
589
for (; n != xfer->nframes; n++) {
sys/bus/u4b/usb_generic.c
591
usbd_xfer_set_frame_len(xfer, n, 0);
sys/bus/u4b/usb_hid.c
652
uint8_t n;
sys/bus/u4b/usb_hid.c
665
n = (hsize + 7) / 8;
sys/bus/u4b/usb_hid.c
666
rpos += n;
sys/bus/u4b/usb_hid.c
667
while (n--) {
sys/bus/u4b/usb_hid.c
670
data |= buf[rpos] << (8 * n);
sys/bus/u4b/usb_hid.c
675
n = 32 - hsize;
sys/bus/u4b/usb_hid.c
679
data = (int32_t)((int32_t)data << n) >> n;
sys/bus/u4b/usb_hid.c
681
data = (uint32_t)((uint32_t)data << n) >> n;
sys/bus/u4b/usb_hid.c
712
uint8_t n;
sys/bus/u4b/usb_hid.c
724
n = (hsize + 7) / 8;
sys/bus/u4b/usb_hid.c
727
rpos += n;
sys/bus/u4b/usb_hid.c
728
while (n--) {
sys/bus/u4b/usb_hid.c
731
buf[rpos] &= ~(mask >> (8 * n));
sys/bus/u4b/usb_hid.c
732
buf[rpos] |= (data >> (8 * n));
sys/bus/u4b/usb_ioctl.h
49
#define USB_IOCTL_STRUCT_ALIGN(n) __aligned(n)
sys/bus/u4b/usb_ioctl.h
51
#define USB_IOCTL_STRUCT_ALIGN(n)
sys/bus/u4b/usb_parse.c
271
uint8_t n;
sys/bus/u4b/usb_parse.c
276
n = 0;
sys/bus/u4b/usb_parse.c
290
n++;
sys/bus/u4b/usb_parse.c
291
if (n == 0xFF)
sys/bus/u4b/usb_parse.c
296
return (n);
sys/bus/u4b/usb_request.c
1101
uint16_t n;
sys/bus/u4b/usb_request.c
1137
n = (temp[0] / 2) - 1;
sys/bus/u4b/usb_request.c
1138
if (n > len) {
sys/bus/u4b/usb_request.c
1139
n = len;
sys/bus/u4b/usb_request.c
1148
for (i = 0; (i != n); i++) {
sys/bus/u4b/usb_request.c
808
uint16_t n;
sys/bus/u4b/usb_request.c
825
n = 0;
sys/bus/u4b/usb_request.c
829
n += usb_port_reset_delay;
sys/bus/u4b/usb_request.c
854
if (n > 1000) {
sys/bus/u4b/usb_request.c
855
n = 0;
sys/bus/u4b/usb_request.c
867
if (n == 0) {
sys/bus/u4b/usb_request.c
899
uint16_t n;
sys/bus/u4b/usb_request.c
932
n = 0;
sys/bus/u4b/usb_request.c
936
n += usb_port_reset_delay;
sys/bus/u4b/usb_request.c
953
if (n > 1000) {
sys/bus/u4b/usb_request.c
954
n = 0;
sys/bus/u4b/usb_request.c
966
if (n == 0) {
sys/bus/u4b/usb_transfer.c
1022
for (setup = setup_start, n = 0;
sys/bus/u4b/usb_transfer.c
1023
setup != setup_end; setup++, n++) {
sys/bus/u4b/usb_transfer.c
1138
ppxfer[n] = xfer;
sys/bus/u4b/usb_transfer.c
2248
usbd_xfer_set_frames(struct usb_xfer *xfer, usb_frcount_t n)
sys/bus/u4b/usb_transfer.c
2250
xfer->nframes = n;
sys/bus/u4b/usb_transfer.c
3315
uint16_t n;
sys/bus/u4b/usb_transfer.c
3319
for (n = 0; n != max; n++) {
sys/bus/u4b/usb_transfer.c
3321
xfer = ppxfer[n];
sys/bus/u4b/usb_transfer.c
899
uint16_t n;
sys/bus/u4b/usb_transfer.c
925
for (setup = setup_start, n = 0;
sys/bus/u4b/usb_transfer.c
926
setup != setup_end; setup++, n++) {
sys/bus/u4b/usb_transfer.c
935
ppxfer[n] = NULL;
sys/bus/u4b/usbdi.h
357
#define USB_DRIVER_INFO(n) \
sys/bus/u4b/usbdi.h
358
.driver_info = (n)
sys/bus/u4b/usbdi.h
566
void usbd_xfer_set_frames(struct usb_xfer *xfer, usb_frcount_t n);
sys/bus/u4b/usbhid.h
58
#define USB_HID_DESCRIPTOR_SIZE(n) (9+((n)*3))
sys/bus/u4b/wlan/if_rumreg.h
137
#define RT2573_NUM_BSSID_MSK(n) (((n * 3) & 3) << 16)
sys/bus/u4b/wlan/if_rumreg.h
141
#define RT2573_TBCN_EXP(n) ((n) << 8)
sys/bus/u4b/wlan/if_run.c
4130
run_rt3070_rf_write(sc, 2, rt3070_freqs[i].n);
sys/bus/u4b/wlan/if_run.c
4205
run_rt3070_rf_write(sc, 2, rt3070_freqs[i].n);
sys/bus/u4b/wlan/if_run.c
4355
run_rt3070_rf_write(sc, 8, rt3070_freqs[i].n);
sys/bus/u4b/wlan/if_run.c
4505
run_rt3070_rf_write(sc, 8, rt3070_freqs[i].n);
sys/bus/u4b/wlan/if_run.c
4628
run_rt3070_rf_write(sc, 8, freqs->n & 0xff);
sys/bus/u4b/wlan/if_run.c
4631
rf |= ((freqs->n & 0x0100) >> 8) << 4;
sys/bus/u4b/wlan/if_run.c
525
uint8_t n, r, k;
sys/bus/u4b/wlan/if_run.c
531
uint16_t n;
sys/cpu/x86_64/include/atomic.h
545
atomic_cas_ptr(volatile void *p, void *e, void *n)
sys/cpu/x86_64/include/atomic.h
548
: "=a" (n), "=m" (*(volatile unsigned long *)p)
sys/cpu/x86_64/include/atomic.h
549
: "r" (n), "a" (e), "m" (*(volatile unsigned long *)p));
sys/cpu/x86_64/include/atomic.h
551
return (n);
sys/crypto/blowfish/bf_locl.h
100
#define l2cn(l1,l2,c,n) { \
sys/crypto/blowfish/bf_locl.h
101
c+=n; \
sys/crypto/blowfish/bf_locl.h
102
switch (n) { \
sys/crypto/blowfish/bf_locl.h
115
#define n2ln(c,l1,l2,n) { \
sys/crypto/blowfish/bf_locl.h
116
c+=n; \
sys/crypto/blowfish/bf_locl.h
118
switch (n) { \
sys/crypto/blowfish/bf_locl.h
131
#define l2nn(l1,l2,c,n) { \
sys/crypto/blowfish/bf_locl.h
132
c+=n; \
sys/crypto/blowfish/bf_locl.h
133
switch (n) { \
sys/crypto/blowfish/bf_locl.h
77
#define c2ln(c,l1,l2,n) { \
sys/crypto/blowfish/bf_locl.h
78
c+=n; \
sys/crypto/blowfish/bf_locl.h
80
switch (n) { \
sys/crypto/chacha20/chacha.c
24
#define ROTL32(v, n) \
sys/crypto/chacha20/chacha.c
25
(U32V((v) << (n)) | ((v) >> (32 - (n))))
sys/crypto/des/des_locl.h
110
#define l2cn(l1,l2,c,n) { \
sys/crypto/des/des_locl.h
111
c+=n; \
sys/crypto/des/des_locl.h
112
switch (n) { \
sys/crypto/des/des_locl.h
124
#define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
sys/crypto/des/des_locl.h
341
#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
sys/crypto/des/des_locl.h
343
(a)^=((t)<<(n)))
sys/crypto/des/des_locl.h
75
#define c2ln(c,l1,l2,n) { \
sys/crypto/des/des_locl.h
76
c+=n; \
sys/crypto/des/des_locl.h
78
switch (n) { \
sys/crypto/des/des_setkey.c
139
#define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)),\
sys/crypto/des/des_setkey.c
140
(a)=(a)^(t)^(t>>(16-(n))))
sys/crypto/rmd160/rmd160.c
73
#define ROL(n, x) (((x) << (n)) | ((x) >> (32-(n))))
sys/crypto/serpent/serpent.c
39
#define rotr(x,n) (((x) >> ((int)((n) & 0x1f))) | ((x) << ((int)((32 - ((n) & 0x1f))))))
sys/crypto/serpent/serpent.c
40
#define rotl(x,n) (((x) << ((int)((n) & 0x1f))) | ((x) >> ((int)((32 - ((n) & 0x1f))))))
sys/crypto/sha1.c
62
#define S(n, x) (((x) << (n)) | ((x) >> (32 - n)))
sys/crypto/sha1.c
64
#define H(n) (ctxt->h.b32[(n)])
sys/crypto/sha1.c
67
#define W(n) (ctxt->m.b32[(n)])
sys/crypto/sha2/sha2.c
167
#define ADDINC128(w,n) { \
sys/crypto/sha2/sha2.c
168
(w)[0] += (sha2_word64)(n); \
sys/crypto/sha2/sha2.c
169
if ((w)[0] < (n)) { \
sys/crypto/twofish/twofish.c
100
#define q(n,x) q_tab[n][x]
sys/crypto/twofish/twofish.c
281
#define mds(n,x) m_tab[n][x]
sys/crypto/twofish/twofish.c
40
#define extract_byte(x,n) ((u_int8_t)((x) >> (8 * n)))
sys/crypto/twofish/twofish.c
44
#define rotr(x,n) (((x)>>(n))|((x)<<(32-(n))))
sys/crypto/twofish/twofish.c
45
#define rotl(x,n) (((x)<<(n))|((x)>>(32-(n))))
sys/ddb/db_input.c
100
for (p = db_lc; p < db_le-n; p++) {
sys/ddb/db_input.c
101
*p = *(p+n);
sys/ddb/db_input.c
104
db_putnchars(BLANK, n);
sys/ddb/db_input.c
106
db_le -= n;
sys/ddb/db_input.c
67
static void db_delete (int n, int bwd);
sys/ddb/db_input.c
92
db_delete(int n, int bwd)
sys/ddb/db_input.c
97
db_lc -= n;
sys/ddb/db_input.c
98
db_putnchars(BACKUP, n);
sys/ddb/db_sym.c
138
int n = strlen(db_symtabs[i].name);
sys/ddb/db_sym.c
141
n == (cp - symstr) &&
sys/ddb/db_sym.c
142
strncmp(symstr, db_symtabs[i].name, n) == 0
sys/dev/acpica/acpi_timer.c
358
int min, max, max2, n, delta;
sys/dev/acpica/acpi_timer.c
372
for (n = 0; n < 2000; n++) {
sys/dev/acpica/acpi_timer.c
394
n = 0;
sys/dev/acpica/acpi_timer.c
396
n = 0;
sys/dev/acpica/acpi_timer.c
398
n = 1;
sys/dev/acpica/acpi_timer.c
401
n ? "GOOD" : "BAD ",
sys/dev/acpica/acpi_timer.c
405
return (n);
sys/dev/acpica/acpi_video/acpi_video.c
1003
return (n);
sys/dev/acpica/acpi_video/acpi_video.c
461
int n, x;
sys/dev/acpica/acpi_video/acpi_video.c
502
n = 0;
sys/dev/acpica/acpi_video/acpi_video.c
505
if (vn->vo_unit.num != n)
sys/dev/acpica/acpi_video/acpi_video.c
508
n++;
sys/dev/acpica/acpi_video/acpi_video.c
511
ksnprintf(name, sizeof(name), "%s%d", type, n);
sys/dev/acpica/acpi_video/acpi_video.c
517
vo->vo_unit.num = n;
sys/dev/acpica/acpi_video/acpi_video.c
972
int num, i, n, *levels;
sys/dev/acpica/acpi_video/acpi_video.c
995
for (i = 0, n = 0; i < num; i++)
sys/dev/acpica/acpi_video/acpi_video.c
996
if (acpi_PkgInt32(res, i, &levels[n]) == 0)
sys/dev/acpica/acpi_video/acpi_video.c
997
n++;
sys/dev/acpica/acpi_video/acpi_video.c
998
if (n < 2) {
sys/dev/acpica/aibs/atk0110.c
143
int i, n;
sys/dev/acpica/aibs/atk0110.c
177
n = o[0].Integer.Value;
sys/dev/acpica/aibs/atk0110.c
178
if (bp->Package.Count - 1 < n) {
sys/dev/acpica/aibs/atk0110.c
182
} else if (bp->Package.Count - 1 > n) {
sys/dev/acpica/aibs/atk0110.c
183
int on = n;
sys/dev/acpica/aibs/atk0110.c
186
n = bp->Package.Count - 1;
sys/dev/acpica/aibs/atk0110.c
189
", assume %i\n", name, on, bp->Package.Count - 1, n);
sys/dev/acpica/aibs/atk0110.c
191
if (n < 1) {
sys/dev/acpica/aibs/atk0110.c
198
as = kmalloc(sizeof(*as) * n, M_DEVBUF, M_NOWAIT | M_ZERO);
sys/dev/acpica/aibs/atk0110.c
220
for (i = 0, o++; i < n; i++, o++) {
sys/dev/acpica/aibs/atk0110.c
300
int i, n = sc->sc_sensordev.maxnumt[st];
sys/dev/acpica/aibs/atk0110.c
328
for (i = 0; i < n; i++)
sys/dev/acpica/aibs/atk0110.c
333
for (i = 0; i < n; i++) {
sys/dev/agp/agp_amd64.c
165
int i, n, error;
sys/dev/agp/agp_amd64.c
167
for (i = 0, n = 0; i < PCI_SLOTMAX && n < AMD64_MAX_MCTRL; i++) {
sys/dev/agp/agp_amd64.c
170
sc->mctrl[n] = i;
sys/dev/agp/agp_amd64.c
171
n++;
sys/dev/agp/agp_amd64.c
174
if (n == 0)
sys/dev/agp/agp_amd64.c
177
sc->n_mctrl = n;
sys/dev/apple/fw/apple_fw.c
224
int n;
sys/dev/apple/fw/apple_fw.c
237
n = sc->sc_ssdt_count;
sys/dev/apple/fw/apple_fw.c
238
if (n >= APPLE_FW_MAX_SSDTS)
sys/dev/apple/fw/apple_fw.c
241
memcpy(sc->sc_ssdts[n].oem_table_id, table->OemTableId,
sys/dev/apple/fw/apple_fw.c
243
sc->sc_ssdts[n].oem_table_id[ACPI_OEM_TABLE_ID_SIZE] = '\0';
sys/dev/apple/fw/apple_fw_dsm.c
100
ddev->props[n].ival = (int64_t)elem->Integer.Value;
sys/dev/apple/fw/apple_fw_dsm.c
101
ddev->props[n].val_len = sizeof(int64_t);
sys/dev/apple/fw/apple_fw_dsm.c
104
ddev->props[n].val_type = APPLE_FW_PROP_STRING;
sys/dev/apple/fw/apple_fw_dsm.c
105
strlcpy(ddev->props[n].sval, elem->String.Pointer,
sys/dev/apple/fw/apple_fw_dsm.c
106
sizeof(ddev->props[n].sval));
sys/dev/apple/fw/apple_fw_dsm.c
107
ddev->props[n].val_len = elem->String.Length;
sys/dev/apple/fw/apple_fw_dsm.c
110
ddev->props[n].val_type = APPLE_FW_PROP_BUFFER;
sys/dev/apple/fw/apple_fw_dsm.c
111
ddev->props[n].val_len =
sys/dev/apple/fw/apple_fw_dsm.c
113
memcpy(ddev->props[n].bval, elem->Buffer.Pointer,
sys/dev/apple/fw/apple_fw_dsm.c
114
ddev->props[n].val_len);
sys/dev/apple/fw/apple_fw_dsm.c
79
int n;
sys/dev/apple/fw/apple_fw_dsm.c
92
n = ddev->prop_count;
sys/dev/apple/fw/apple_fw_dsm.c
93
strlcpy(ddev->props[n].key, elem->String.Pointer,
sys/dev/apple/fw/apple_fw_dsm.c
94
sizeof(ddev->props[n].key));
sys/dev/apple/fw/apple_fw_dsm.c
99
ddev->props[n].val_type = APPLE_FW_PROP_INT;
sys/dev/crypto/tpm/tpm.c
1100
int n;
sys/dev/crypto/tpm/tpm.c
1102
for (p = buf, n = len; n--; DELAY(TPM_LEGACY_DELAY)) {
sys/dev/crypto/tpm/tpm.c
1103
if (!n && len != TPM_BUFSIZ) {
sys/dev/crypto/tpm/tpm.c
1188
int n, len, rv;
sys/dev/crypto/tpm/tpm.c
1231
for (len -= cnt, p = buf, n = sizeof(buf); len > 0; p = buf, len -= n,
sys/dev/crypto/tpm/tpm.c
1232
n = sizeof(buf)) {
sys/dev/crypto/tpm/tpm.c
1233
n = MIN(n, len);
sys/dev/crypto/tpm/tpm.c
1235
kprintf("%s: n %d len %d\n", __func__, n, len);
sys/dev/crypto/tpm/tpm.c
1237
if ((rv = (sc->sc_read)(sc, p, n, NULL, TPM_PARAM_SIZE))) {
sys/dev/crypto/tpm/tpm.c
1242
p += n;
sys/dev/crypto/tpm/tpm.c
1262
int n, rv;
sys/dev/crypto/tpm/tpm.c
1273
n = MIN(sizeof(buf), uio->uio_resid);
sys/dev/crypto/tpm/tpm.c
1274
if ((rv = uiomove((caddr_t)buf, n, uio))) {
sys/dev/crypto/tpm/tpm.c
1284
if ((rv = (sc->sc_write(sc, buf, n)))) {
sys/dev/crypto/tpm/tpm.c
772
int rv, n, bcnt;
sys/dev/crypto/tpm/tpm.c
784
n = MIN(len, bcnt);
sys/dev/crypto/tpm/tpm.c
786
kprintf("%s: fetching %d, burst is %d\n", __func__, n, bcnt);
sys/dev/crypto/tpm/tpm.c
788
for (; n--; len--) {
sys/dev/disk/dm/device-mapper.c
586
uint64_t n;
sys/dev/disk/dm/device-mapper.c
587
n = 0;
sys/dev/disk/dm/device-mapper.c
593
n = (10 * n) + (*s - '0');
sys/dev/disk/dm/device-mapper.c
597
return n;
sys/dev/disk/dm/dm_ioctl.c
810
int i, n, argc;
sys/dev/disk/dm/dm_ioctl.c
817
n = target->max_argc;
sys/dev/disk/dm/dm_ioctl.c
818
if (n) {
sys/dev/disk/dm/dm_ioctl.c
819
dmdebug("Max argc %d for %s target\n", n, target->name);
sys/dev/disk/dm/dm_ioctl.c
821
n = 20; /* large enough slots for most targets */
sys/dev/disk/dm/dm_ioctl.c
824
argv = kmalloc(sizeof(*argv) * n, M_DM, M_WAITOK | M_ZERO);
sys/dev/disk/dm/dm_ioctl.c
827
ap < &argv[n] && (*ap = strsep(¶ms, " \t")) != NULL;) {
sys/dev/disk/dm/striped/dm_target_striped.c
105
if ((table_en->length / n) % chunksize) {
sys/dev/disk/dm/striped/dm_target_striped.c
112
n * sizeof(struct target_stripe_dev);
sys/dev/disk/dm/striped/dm_target_striped.c
116
tsc->stripe_num = n;
sys/dev/disk/dm/striped/dm_target_striped.c
129
for (n = 0, i = 0; n < tsc->stripe_num; ++n) {
sys/dev/disk/dm/striped/dm_target_striped.c
132
tsc->stripe_devs[n].pdev = dm_pdev_insert(arg);
sys/dev/disk/dm/striped/dm_target_striped.c
133
if (tsc->stripe_devs[n].pdev == NULL)
sys/dev/disk/dm/striped/dm_target_striped.c
137
tsc->stripe_devs[n].offset = atoi64(arg);
sys/dev/disk/dm/striped/dm_target_striped.c
138
dm_table_add_deps(table_en, tsc->stripe_devs[n].pdev);
sys/dev/disk/dm/striped/dm_target_striped.c
140
if (n != tsc->stripe_num) {
sys/dev/disk/dm/striped/dm_target_striped.c
464
int n;
sys/dev/disk/dm/striped/dm_target_striped.c
466
for (n = 0; n < tsc->stripe_num; ++n) {
sys/dev/disk/dm/striped/dm_target_striped.c
467
if (tsc->stripe_devs[n].pdev) {
sys/dev/disk/dm/striped/dm_target_striped.c
468
dm_pdev_decr(tsc->stripe_devs[n].pdev);
sys/dev/disk/dm/striped/dm_target_striped.c
469
tsc->stripe_devs[n].pdev = NULL;
sys/dev/disk/dm/striped/dm_target_striped.c
73
int i, n, siz, chunksize;
sys/dev/disk/dm/striped/dm_target_striped.c
80
n = (int)atoi64(argv[0]);
sys/dev/disk/dm/striped/dm_target_striped.c
81
if (n <= 0 || n > MAX_STRIPES) {
sys/dev/disk/dm/striped/dm_target_striped.c
83
n, MAX_STRIPES);
sys/dev/disk/dm/striped/dm_target_striped.c
87
if (table_en->length % n) {
sys/dev/disk/dm/striped/dm_target_striped.c
92
if (argc != (2 + n * 2)) {
sys/dev/disk/dm/striped/dm_target_striped.c
94
argc, n);
sys/dev/disk/fd/fd.c
364
int n;
sys/dev/disk/fd/fd.c
371
for (n = 0; n < n_out; n++)
sys/dev/disk/fd/fd.c
378
cmd, n + 1, n_out);
sys/dev/disk/fd/fd.c
383
for (n = 0; n < n_in; n++)
sys/dev/disk/fd/fd.c
391
cmd, n + 1, n_in);
sys/dev/disk/iscsi/initiator/isc_sm.c
262
size_t len, n;
sys/dev/disk/iscsi/initiator/isc_sm.c
274
n = pp->ds_len;
sys/dev/disk/iscsi/initiator/isc_sm.c
275
len += n;
sys/dev/disk/iscsi/initiator/isc_sm.c
277
bhp->DSLength = ((n & 0x00ff0000) >> 16)
sys/dev/disk/iscsi/initiator/isc_sm.c
278
| (n & 0x0000ff00)
sys/dev/disk/iscsi/initiator/isc_sm.c
279
| ((n & 0x000000ff) << 16);
sys/dev/disk/iscsi/initiator/isc_sm.c
281
bhp->DSLength = n;
sys/dev/disk/iscsi/initiator/isc_sm.c
284
n = 4 - (len & 03);
sys/dev/disk/iscsi/initiator/isc_sm.c
285
len += n;
sys/dev/disk/iscsi/initiator/isc_sm.c
635
int error, n;
sys/dev/disk/iscsi/initiator/isc_sm.c
641
n = sizeof(buf);
sys/dev/disk/iscsi/initiator/isc_sm.c
642
ksnprintf(bp, n, "recv=%d sent=%d", sp->stats.nrecv, sp->stats.nsent);
sys/dev/disk/iscsi/initiator/isc_sm.c
644
n -= strlen(bp);
sys/dev/disk/iscsi/initiator/isc_sm.c
645
ksnprintf(bp, n, " flags=0x%08x pdus-alloc=%d pdus-max=%d",
sys/dev/disk/iscsi/initiator/isc_sm.c
648
n -= strlen(bp);
sys/dev/disk/iscsi/initiator/isc_sm.c
649
ksnprintf(bp, n, " cws=%d cmd=%x exp=%x max=%x stat=%x itt=%x",
sys/dev/disk/iscsi/initiator/isc_soc.c
373
size_t n, len;
sys/dev/disk/iscsi/initiator/isc_soc.c
394
n = bhs->DSLength;
sys/dev/disk/iscsi/initiator/isc_soc.c
396
pp->ds_len = ((n & 0x00ff0000) >> 16)
sys/dev/disk/iscsi/initiator/isc_soc.c
397
| (n & 0x0000ff00)
sys/dev/disk/iscsi/initiator/isc_soc.c
398
| ((n & 0x000000ff) << 16);
sys/dev/disk/iscsi/initiator/isc_soc.c
400
pp->ds_len = n;
sys/dev/disk/iscsi/initiator/iscsi.c
444
int n, error;
sys/dev/disk/iscsi/initiator/iscsi.c
468
n = pp->ahs_len;
sys/dev/disk/iscsi/initiator/iscsi.c
469
error = copyin(pp->ahs, bp, n);
sys/dev/disk/iscsi/initiator/iscsi.c
475
bp += n;
sys/dev/disk/iscsi/initiator/iscsi.c
478
n = pp->ds_len;
sys/dev/disk/iscsi/initiator/iscsi.c
479
error = copyin(pp->ds, bp, n);
sys/dev/disk/iscsi/initiator/iscsi.c
485
bp += n;
sys/dev/disk/iscsi/initiator/iscsi.c
486
while(n & 03) {
sys/dev/disk/iscsi/initiator/iscsi.c
487
n++;
sys/dev/disk/iscsi/initiator/iscsi.c
515
size_t need, have, n;
sys/dev/disk/iscsi/initiator/iscsi.c
548
n = 0;
sys/dev/disk/iscsi/initiator/iscsi.c
583
n = MIN(up->ahs_size, need);
sys/dev/disk/iscsi/initiator/iscsi.c
584
error = copyout(bp, (caddr_t)up->ahs, n);
sys/dev/disk/iscsi/initiator/iscsi.c
585
up->ahs_len = n;
sys/dev/disk/iscsi/initiator/iscsi.c
593
have = up->ahs_size - n;
sys/dev/disk/iscsi/initiator/iscsi.c
594
up->ds = (caddr_t)up->ahs + n;
sys/dev/disk/iscsi/initiator/iscsi.c
596
n = MIN(have, need);
sys/dev/disk/iscsi/initiator/iscsi.c
597
error = copyout(bp, (caddr_t)up->ds, n);
sys/dev/disk/iscsi/initiator/iscsi.c
598
up->ds_len = n;
sys/dev/disk/iscsi/initiator/iscsi.c
617
int error, n;
sys/dev/disk/iscsi/initiator/iscsi.c
627
for(n = 0; n < MAX_SESSIONS; n++)
sys/dev/disk/iscsi/initiator/iscsi.c
628
if(sc->sessions[n] == NULL)
sys/dev/disk/iscsi/initiator/iscsi.c
630
if(n == MAX_SESSIONS) {
sys/dev/disk/iscsi/initiator/iscsi.c
639
sc->sessions[n] = sp;
sys/dev/disk/iscsi/initiator/iscsi.c
640
debug(8, "n is %d", n);
sys/dev/disk/iscsi/initiator/iscsi.c
641
sp->dev = make_dev(&iscsi_ops, n, UID_ROOT, GID_WHEEL, 0600, "iscsi%d", n);
sys/dev/disk/iscsi/initiator/iscsi.c
647
*ndev = sp->sid = n;
sys/dev/disk/iscsi/initiator/iscsi.c
657
sdebug(2, "sessionID=%d sp=%p", n, sp);
sys/dev/disk/iscsi/initiator/iscsi.c
695
int n;
sys/dev/disk/iscsi/initiator/iscsi.c
708
n = 0;
sys/dev/disk/iscsi/initiator/iscsi.c
710
debug(2, "%2d] sp->flags=0x%08x", n, sp->flags);
sys/dev/disk/iscsi/initiator/iscsi.c
711
n++;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
251
u_int i, n, last;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
260
n = ntohl(pq->pdu.ipdu.bhs.CmdSN);
sys/dev/disk/iscsi/initiator/iscsi_subr.c
261
if(last > n)
sys/dev/disk/iscsi/initiator/iscsi_subr.c
262
last = n;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
263
sdebug(2, "last=%x n=%x", last, n);
sys/dev/disk/iscsi/initiator/iscsi_subr.c
273
int n = 0;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
279
n++;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
283
n++;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
287
n++;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
291
n++;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
295
n++;
sys/dev/disk/iscsi/initiator/iscsi_subr.c
297
if(n != 0)
sys/dev/disk/iscsi/initiator/iscsi_subr.c
298
xdebug("%d pdus recovered, should have been ZERO!", n);
sys/dev/disk/iscsi/initiator/iscsi_subr.c
299
return n;
sys/dev/disk/iscsi/initiator/iscsivar.h
66
#define BIT(n) (1 <<(n))
sys/dev/disk/isp/ispreg.h
458
#define MBOX_OFF(n) (MBOX_BLOCK + ((n) << 1))
sys/dev/disk/isp/ispvar.h
135
#define ISP_QUEUE_SIZE(n) ((n) * QENTRY_LEN)
sys/dev/disk/nata/ata-queue.c
680
size_t n;
sys/dev/disk/nata/ata-queue.c
685
n = req->u.ata.count;
sys/dev/disk/nata/ata-queue.c
688
if (left < n)
sys/dev/disk/nata/ata-queue.c
690
left -= n;
sys/dev/disk/ncr/ncrreg.h
401
#define SCR_COPY(n) (0xc0000000 | SCR_NO_FLUSH | (n))
sys/dev/disk/ncr/ncrreg.h
402
#define SCR_COPY_F(n) (0xc0000000 | (n))
sys/dev/disk/nvme/nvme_chipset.h
65
#define NVME_REG_SUBQ_BELL(n, dstrd4) (0x1000 + ((n) * 2 + 0) * (dstrd4))
sys/dev/disk/nvme/nvme_chipset.h
66
#define NVME_REG_COMQ_BELL(n, dstrd4) (0x1000 + ((n) * 2 + 1) * (dstrd4))
sys/dev/disk/sili/sili.h
167
#define SILI_PREG_LRAM_SLOT(n) (0x0000 + (128 * (n)))
sys/dev/disk/sili/sili.h
194
#define SILI_PREG_PM_STATUS(n) (0x0F80 + (8 * (n)))
sys/dev/disk/sili/sili.h
195
#define SILI_PREG_PM_QACTIVE(n) (0x0F84 + (8 * (n)))
sys/dev/disk/sili/sili.h
282
#define SILI_PREG_INT_STEER(n) ((n) << 30) /* Port Int -> INTA...INTD */
sys/dev/disk/sili/sili.h
475
#define SILI_PREG_CMDACT(n) (0x1C00 + (8 * (n)))
sys/dev/disk/sili/sili.h
53
#define SILI_REG_SLOTST(n) (0x0000 + ((n) * 4))
sys/dev/disk/sili/sili.h
57
#define SILI_REG_GCTL_PORTEN(n) (1 << (n)) /* Port interrupt ena */
sys/dev/disk/sili/sili.h
65
#define SILI_REG_GINT_PORTST(n) (1 << (n)) /* Port interrupt stat */
sys/dev/disk/sili/sili.h
85
#define SILI_REG_BIST_CTL_RXSEL(n) ((n) << 16)
sys/dev/disk/sili/sili.h
86
#define SILI_REG_BIST_CTL_TXSEL(n) (1 << (n))
sys/dev/disk/sym/sym_defs.h
697
#define SCR_COPY(n) (0xc0000000 | SCR_NO_FLUSH | (n))
sys/dev/disk/sym/sym_defs.h
698
#define SCR_COPY_F(n) (0xc0000000 | (n))
sys/dev/disk/sym/sym_defs.h
800
#define SCR_LOAD_R(reg, how, n) \
sys/dev/disk/sym/sym_defs.h
801
(0xe1000000 | (how) | (SCR_REG_OFS2(REG(reg))) | (n))
sys/dev/disk/sym/sym_defs.h
803
#define SCR_STORE_R(reg, how, n) \
sys/dev/disk/sym/sym_defs.h
804
(0xe0000000 | (how) | (SCR_REG_OFS2(REG(reg))) | (n))
sys/dev/disk/sym/sym_defs.h
806
#define SCR_LOAD_ABS(reg, n) SCR_LOAD_R(reg, SCR_NO_FLUSH2, n)
sys/dev/disk/sym/sym_defs.h
807
#define SCR_LOAD_REL(reg, n) SCR_LOAD_R(reg, SCR_NO_FLUSH2|SCR_DSA_REL2, n)
sys/dev/disk/sym/sym_defs.h
808
#define SCR_LOAD_ABS_F(reg, n) SCR_LOAD_R(reg, 0, n)
sys/dev/disk/sym/sym_defs.h
809
#define SCR_LOAD_REL_F(reg, n) SCR_LOAD_R(reg, SCR_DSA_REL2, n)
sys/dev/disk/sym/sym_defs.h
811
#define SCR_STORE_ABS(reg, n) SCR_STORE_R(reg, SCR_NO_FLUSH2, n)
sys/dev/disk/sym/sym_defs.h
812
#define SCR_STORE_REL(reg, n) SCR_STORE_R(reg, SCR_NO_FLUSH2|SCR_DSA_REL2,n)
sys/dev/disk/sym/sym_defs.h
813
#define SCR_STORE_ABS_F(reg, n) SCR_STORE_R(reg, 0, n)
sys/dev/disk/sym/sym_defs.h
814
#define SCR_STORE_REL_F(reg, n) SCR_STORE_R(reg, SCR_DSA_REL2, n)
sys/dev/disk/sym/sym_hipd.c
241
#define sym_set_bit(p, n) (((u32 *)(p))[(n)>>5] |= (1<<((n)&0x1f)))
sys/dev/disk/sym/sym_hipd.c
242
#define sym_clr_bit(p, n) (((u32 *)(p))[(n)>>5] &= ~(1<<((n)&0x1f)))
sys/dev/disk/sym/sym_hipd.c
243
#define sym_is_bit(p, n) (((u32 *)(p))[(n)>>5] & (1<<((n)&0x1f)))
sys/dev/disk/sym/sym_hipd.c
3076
int i, n;
sys/dev/disk/sym/sym_hipd.c
3081
n = 0;
sys/dev/disk/sym/sym_hipd.c
3095
++n;
sys/dev/disk/sym/sym_hipd.c
3103
return n;
sys/dev/disk/sym/sym_hipd.c
517
#define __sym_calloc(mp, s, n) __sym_calloc2(mp, s, n, MEMO_WARN)
sys/dev/disk/sym/sym_hipd.c
5340
int n;
sys/dev/disk/sym/sym_hipd.c
5344
n = dp_ofs + (tmp & 0xffffff);
sys/dev/disk/sym/sym_hipd.c
5345
if (n > 0) {
sys/dev/disk/sym/sym_hipd.c
5349
dp_ofs = n;
sys/dev/disk/sym/sym_hipd.c
765
#define _sym_calloc_dma(np, s, n) __sym_calloc_dma(np->bus_dmat, s, n)
sys/dev/disk/sym/sym_hipd.c
766
#define _sym_mfree_dma(np, p, s, n) \
sys/dev/disk/sym/sym_hipd.c
767
__sym_mfree_dma(np->bus_dmat, _uvptv_(p), s, n)
sys/dev/disk/sym/sym_hipd.c
768
#define sym_calloc_dma(s, n) _sym_calloc_dma(np, s, n)
sys/dev/disk/sym/sym_hipd.c
769
#define sym_mfree_dma(p, s, n) _sym_mfree_dma(np, p, s, n)
sys/dev/disk/sym/sym_hipd.c
777
static void sym_printb_hex (u_char *p, int n)
sys/dev/disk/sym/sym_hipd.c
779
while (n-- > 0)
sys/dev/disk/sym/sym_hipd.c
786
static void sym_printl_hex (char *label, u_char *p, int n)
sys/dev/disk/sym/sym_hipd.c
789
sym_printb_hex (p, n);
sys/dev/disk/vpo/vpoio.c
77
#define H_AUTO n(AUTOFEED)
sys/dev/disk/vpo/vpoio.c
79
#define H_STROBE n(STROBE)
sys/dev/disk/vpo/vpoio.c
81
#define H_BSY n(nBUSY)
sys/dev/disk/vpo/vpoio.c
84
#define H_nSEL n(SELECT)
sys/dev/disk/vpo/vpoio.c
86
#define H_nERR n(PERROR)
sys/dev/disk/vpo/vpoio.c
88
#define H_nACK n(nACK)
sys/dev/disk/vpo/vpoio.c
90
#define H_nFLT n(nFAULT)
sys/dev/disk/vpo/vpoio.c
91
#define H_SELIN n(SELECTIN)
sys/dev/disk/vpo/vpoio.c
94
#define H_nINIT n(nINIT)
sys/dev/disk/xdisk/xdisk.c
427
int n;
sys/dev/disk/xdisk/xdisk.c
465
for (n = 0; n < MAXTAGS; ++n) {
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
138
static void amdgpu_atif_parse_notification(struct amdgpu_atif_notifications *n, u32 mask)
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
140
n->display_switch = mask & ATIF_DISPLAY_SWITCH_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
141
n->expansion_mode_change = mask & ATIF_EXPANSION_MODE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
142
n->thermal_state = mask & ATIF_THERMAL_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
143
n->forced_power_state = mask & ATIF_FORCED_POWER_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
144
n->system_power_state = mask & ATIF_SYSTEM_POWER_SOURCE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
145
n->display_conf_change = mask & ATIF_DISPLAY_CONF_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
146
n->px_gfx_switch = mask & ATIF_PX_GFX_SWITCH_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
147
n->brightness_change = mask & ATIF_PANEL_BRIGHTNESS_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
148
n->dgpu_display_event = mask & ATIF_DGPU_DISPLAY_EVENT_SUPPORTED;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
264
struct amdgpu_atif_notification_cfg *n = &atif->notification_cfg;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
291
n->enabled = false;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
292
n->command_code = 0;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
294
n->enabled = true;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
295
n->command_code = 0x81;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
301
n->enabled = true;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
302
n->command_code = params.command_code;
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
307
(n->enabled ? "enabled" : "disabled"),
sys/dev/drm/amd/amdgpu/amdgpu_acpi.c
308
n->command_code);
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
53
int n, cts;
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
57
n = 128 * freq;
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
61
div = gcd(n, cts);
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
63
n /= div;
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
70
mul = ((128*freq/1000) + (n-1))/n;
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
72
n *= mul;
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
76
if (n < (128*freq/1500))
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
78
if (n > (128*freq/300))
sys/dev/drm/amd/amdgpu/amdgpu_afmt.c
81
*N = n;
sys/dev/drm/amd/amdgpu/amdgpu_amdkfd.c
127
int i, n;
sys/dev/drm/amd/amdgpu/amdgpu_amdkfd.c
172
n = (adev->asic_type < CHIP_VEGA20) ? 2 : 8;
sys/dev/drm/amd/amdgpu/amdgpu_amdkfd.c
174
for (i = 0; i < n; i += 2) {
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
130
time = amdgpu_benchmark_do_move(adev, size, saddr, daddr, n);
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
134
amdgpu_benchmark_log_results(n, size, time,
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
32
uint64_t saddr, uint64_t daddr, int n)
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
40
for (i = 0; i < n; i++) {
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
61
static void amdgpu_benchmark_log_results(int n, unsigned size,
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
66
unsigned int throughput = (n * (size >> 10)) / time;
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
69
kind, n, size >> 10, sdomain, ddomain, time,
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
80
int r, n;
sys/dev/drm/amd/amdgpu/amdgpu_benchmark.c
90
n = AMDGPU_BENCHMARK_ITERATIONS;
sys/dev/drm/amd/amdgpu/amdgpu_kms.c
652
unsigned n, alloc_size;
sys/dev/drm/amd/amdgpu/amdgpu_kms.c
682
n = copy_to_user(out, regs, min(size, alloc_size));
sys/dev/drm/amd/amdgpu/amdgpu_kms.c
684
return n ? -EFAULT : 0;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
39
unsigned n, size;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
47
n = adev->gmc.gart_size - AMDGPU_IB_POOL_SIZE*64*1024;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
50
n -= adev->rings[i]->ring_size;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
52
n -= AMDGPU_GPU_PAGE_SIZE;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
54
n -= adev->irq.ih.ring_size;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
55
n /= size;
sys/dev/drm/amd/amdgpu/amdgpu_test.c
57
gtt_obj = kcalloc(n, sizeof(*gtt_obj), GFP_KERNEL);
sys/dev/drm/amd/amdgpu/amdgpu_test.c
59
DRM_ERROR("Failed to allocate %d pointers\n", n);
sys/dev/drm/amd/amdgpu/amdgpu_test.c
85
for (i = 0; i < n; i++) {
sys/dev/drm/amd/amdgpu/atom.c
88
static void debug_print_spaces(int n)
sys/dev/drm/amd/amdgpu/atom.c
90
while (n--)
sys/dev/drm/amd/amdgpu/ci_dpm.c
1830
static int ci_dpm_force_state_sclk(struct amdgpu_device *adev, u32 n)
sys/dev/drm/amd/amdgpu/ci_dpm.c
1836
amdgpu_ci_send_msg_to_smc_with_parameter(adev, PPSMC_MSG_SCLKDPM_SetEnabledMask, 1 << n);
sys/dev/drm/amd/amdgpu/ci_dpm.c
1844
static int ci_dpm_force_state_mclk(struct amdgpu_device *adev, u32 n)
sys/dev/drm/amd/amdgpu/ci_dpm.c
1850
amdgpu_ci_send_msg_to_smc_with_parameter(adev, PPSMC_MSG_MCLKDPM_SetEnabledMask, 1 << n);
sys/dev/drm/amd/amdgpu/ci_dpm.c
1858
static int ci_dpm_force_state_pcie(struct amdgpu_device *adev, u32 n)
sys/dev/drm/amd/amdgpu/ci_dpm.c
1864
amdgpu_ci_send_msg_to_smc_with_parameter(adev, PPSMC_MSG_PCIeDPM_ForceLevel, n);
sys/dev/drm/amd/amdgpu/ci_dpm.c
1872
static int ci_set_power_limit(struct amdgpu_device *adev, u32 n)
sys/dev/drm/amd/amdgpu/ci_dpm.c
1878
amdgpu_ci_send_msg_to_smc_with_parameter(adev, PPSMC_MSG_PkgPwrSetLimit, n);
sys/dev/drm/amd/amdgpu/ci_dpm.c
308
static int ci_set_power_limit(struct amdgpu_device *adev, u32 n);
sys/dev/drm/amd/amdgpu/cikd.h
216
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/drm/amd/amdgpu/cikd.h
218
((n) & 0x3FFF) << 16)
sys/dev/drm/amd/amdgpu/cikd.h
225
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/drm/amd/amdgpu/cikd.h
227
((n) & 0x3FFF) << 16)
sys/dev/drm/amd/amdgpu/cikd.h
229
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/drm/amd/amdgpu/kv_dpm.c
142
u32 n = 0;
sys/dev/drm/amd/amdgpu/kv_dpm.c
147
sclk_voltage_mapping_table->entries[n].sclk_frequency =
sys/dev/drm/amd/amdgpu/kv_dpm.c
149
sclk_voltage_mapping_table->entries[n].vid_2bit =
sys/dev/drm/amd/amdgpu/kv_dpm.c
152
n++;
sys/dev/drm/amd/amdgpu/kv_dpm.c
156
sclk_voltage_mapping_table->num_max_dpm_entries = n;
sys/dev/drm/amd/amdgpu/si_dpm.c
2349
u64 pwr_efficiency_ratio, n, d;
sys/dev/drm/amd/amdgpu/si_dpm.c
2354
n = div64_u64((u64)1024 * curr_vddc * curr_vddc * ((u64)1000 + margin), (u64)1000);
sys/dev/drm/amd/amdgpu/si_dpm.c
2356
pwr_efficiency_ratio = div64_u64(n, d);
sys/dev/drm/amd/amdgpu/soc15d.h
41
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/drm/amd/amdgpu/soc15d.h
43
((n) & 0x3FFF) << 16)
sys/dev/drm/amd/amdgpu/soc15d.h
50
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/drm/amd/amdgpu/soc15d.h
52
((n) & 0x3FFF) << 16)
sys/dev/drm/amd/amdgpu/soc15d.h
54
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/drm/amd/amdgpu/vid.h
100
((n) & 0x3FFF) << 16)
sys/dev/drm/amd/amdgpu/vid.h
107
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/drm/amd/amdgpu/vid.h
109
((n) & 0x3FFF) << 16)
sys/dev/drm/amd/amdgpu/vid.h
111
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/drm/amd/amdgpu/vid.h
98
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm.c
3834
int n;
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm.c
3853
n = ARRAY_SIZE(common_modes);
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm.c
3855
for (i = 0; i < n; i++) {
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
359
int n;
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
377
n = vsnprintf(NULL, 0, msg, args);
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
380
if (n <= 0)
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
384
total = log_ctx->pos + n + 1;
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
403
n = vscnprintf(
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
410
if (n > 0)
sys/dev/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
411
log_ctx->pos += n;
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
230
int n = 27;
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
255
n * (n - 1)));
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
257
n -= 2;
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
258
} while (n > 2);
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
283
int n = 26;
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
292
n * (n - 1)));
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
294
n -= 2;
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
295
} while (n != 0);
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
309
unsigned int n = 9;
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
312
n + 2,
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
313
n + 1);
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
325
n));
sys/dev/drm/amd/display/dc/basics/fixpt31_32.c
326
while (--n != 1);
sys/dev/drm/amd/display/dc/dc_helper.c
326
uint32_t index, uint32_t reg_val, int n,
sys/dev/drm/amd/display/dc/dc_helper.c
33
uint32_t addr, uint32_t reg_val, int n,
sys/dev/drm/amd/display/dc/dc_helper.c
331
uint32_t index, uint32_t reg_val, int n,
sys/dev/drm/amd/display/dc/dc_helper.c
344
while (i < n) {
sys/dev/drm/amd/display/dc/dc_helper.c
45
while (i < n) {
sys/dev/drm/amd/display/dc/dce120/dce120_timing_generator.c
42
#define CRTC_REG_UPDATE_N(reg_name, n, ...) \
sys/dev/drm/amd/display/dc/dce120/dce120_timing_generator.c
43
generic_reg_update_soc15(tg110->base.ctx, tg110->offsets.crtc, reg_name, n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/dce120/dce120_timing_generator.c
45
#define CRTC_REG_SET_N(reg_name, n, ...) \
sys/dev/drm/amd/display/dc/dce120/dce120_timing_generator.c
46
generic_reg_set_soc15(tg110->base.ctx, tg110->offsets.crtc, reg_name, n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/dcn10/dcn10_link_encoder.c
1292
#define HPD_REG_UPDATE_N(reg_name, n, ...) \
sys/dev/drm/amd/display/dc/dcn10/dcn10_link_encoder.c
1296
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/dcn10/dcn10_link_encoder.c
1325
#define AUX_REG_UPDATE_N(reg_name, n, ...) \
sys/dev/drm/amd/display/dc/dcn10/dcn10_link_encoder.c
1329
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/dm_services.h
144
uint32_t addr, uint32_t reg_val, int n,
sys/dev/drm/amd/display/dc/dm_services.h
169
#define generic_reg_update_soc15(ctx, inst_offset, reg_name, n, ...)\
sys/dev/drm/amd/display/dc/dm_services.h
172
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/dm_services.h
174
#define generic_reg_set_soc15(ctx, inst_offset, reg_name, n, ...)\
sys/dev/drm/amd/display/dc/dm_services.h
176
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/inc/reg_helper.h
225
#define REG_UPDATE_N(reg_name, n, ...) \
sys/dev/drm/amd/display/dc/inc/reg_helper.h
229
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/inc/reg_helper.h
452
#define IX_REG_SET_N(index_reg_name, data_reg_name, index, n, initial_val, ...) \
sys/dev/drm/amd/display/dc/inc/reg_helper.h
456
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/inc/reg_helper.h
469
#define IX_REG_UPDATE_N(index_reg_name, data_reg_name, index, n, ...) \
sys/dev/drm/amd/display/dc/inc/reg_helper.h
473
n, __VA_ARGS__)
sys/dev/drm/amd/display/dc/inc/reg_helper.h
490
uint32_t index, uint32_t reg_val, int n,
sys/dev/drm/amd/display/dc/inc/reg_helper.h
54
#define REG_SET_N(reg_name, n, initial_val, ...) \
sys/dev/drm/amd/display/dc/inc/reg_helper.h
58
n, __VA_ARGS__)
sys/dev/drm/amd/include/kgd_pp_interface.h
248
int (*set_power_limit)(void *handle, uint32_t n);
sys/dev/drm/amd/powerplay/hwmgr/smu7_powertune.c
1091
int smu7_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n)
sys/dev/drm/amd/powerplay/hwmgr/smu7_powertune.c
1098
PPSMC_MSG_PkgPwrSetLimit, n<<8);
sys/dev/drm/amd/powerplay/hwmgr/smu7_powertune.h
57
int smu7_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/drm/amd/powerplay/hwmgr/vega10_powertune.c
1328
int vega10_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n)
sys/dev/drm/amd/powerplay/hwmgr/vega10_powertune.c
1334
PPSMC_MSG_SetPptLimit, n);
sys/dev/drm/amd/powerplay/hwmgr/vega10_powertune.h
74
int vega10_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/drm/amd/powerplay/hwmgr/vega20_powertune.c
32
int vega20_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n)
sys/dev/drm/amd/powerplay/hwmgr/vega20_powertune.c
39
PPSMC_MSG_SetPptLimit, n);
sys/dev/drm/amd/powerplay/hwmgr/vega20_powertune.h
26
int vega20_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/drm/amd/powerplay/inc/hwmgr.h
328
int (*set_power_limit)(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/drm/amd/powerplay/inc/pp_debug.h
58
#define GET_FLEXIBLE_ARRAY_MEMBER_ADDR(type, member, ptr, n) \
sys/dev/drm/amd/powerplay/inc/pp_debug.h
59
(type *)((char *)&(ptr)->member + (sizeof(type) * (n)))
sys/dev/drm/drm_blend.c
427
int i, n = 0;
sys/dev/drm/drm_blend.c
448
states[n++] = plane_state;
sys/dev/drm/drm_blend.c
454
sort(states, n, sizeof(*states), drm_atomic_state_zpos_cmp, NULL);
sys/dev/drm/drm_blend.c
456
for (i = 0; i < n; i++) {
sys/dev/drm/drm_connector.c
164
struct drm_connector *connector, *n;
sys/dev/drm/drm_connector.c
175
llist_for_each_entry_safe(connector, n, freed, free_node) {
sys/dev/drm/drm_context.c
501
struct drm_ctx_list *pos, *n;
sys/dev/drm/drm_context.c
503
list_for_each_entry_safe(pos, n, &dev->ctxlist, head) {
sys/dev/drm/drm_edid.c
1937
int i, n = 0;
sys/dev/drm/drm_edid.c
1941
n = (127 - d) / 18;
sys/dev/drm/drm_edid.c
1942
for (i = 0; i < n; i++)
sys/dev/drm/drm_edid.c
1949
unsigned int i, n = min((int)ext[0x02], 6);
sys/dev/drm/drm_edid.c
1955
for (i = 0; i < n; i++)
sys/dev/drm/drm_fb_helper.c
2425
int n, int width, int height)
sys/dev/drm/drm_fb_helper.c
2433
if (n == fb_helper->connector_count)
sys/dev/drm/drm_fb_helper.c
2436
fb_helper_conn = fb_helper->connector_info[n];
sys/dev/drm/drm_fb_helper.c
2439
best_crtcs[n] = NULL;
sys/dev/drm/drm_fb_helper.c
2440
best_score = drm_pick_crtcs(fb_helper, best_crtcs, modes, n+1, width, height);
sys/dev/drm/drm_fb_helper.c
2441
if (modes[n] == NULL)
sys/dev/drm/drm_fb_helper.c
2468
for (o = 0; o < n; o++)
sys/dev/drm/drm_fb_helper.c
2472
if (o < n) {
sys/dev/drm/drm_fb_helper.c
2477
if (!drm_mode_equal(modes[o], modes[n]))
sys/dev/drm/drm_fb_helper.c
2481
crtcs[n] = crtc;
sys/dev/drm/drm_fb_helper.c
2482
memcpy(crtcs, best_crtcs, n * sizeof(struct drm_fb_helper_crtc *));
sys/dev/drm/drm_fb_helper.c
2483
score = my_score + drm_pick_crtcs(fb_helper, crtcs, modes, n + 1,
sys/dev/drm/i915/i915_cmd_parser.c
1087
int offset, n;
sys/dev/drm/i915/i915_cmd_parser.c
1103
for (n = batch_start_offset >> PAGE_SHIFT; batch_len; n++) {
sys/dev/drm/i915/i915_cmd_parser.c
1106
src = kmap_atomic(i915_gem_object_get_page(src_obj, n));
sys/dev/drm/i915/i915_drv.h
3025
unsigned int n, unsigned int *offset);
sys/dev/drm/i915/i915_drv.h
3029
unsigned int n);
sys/dev/drm/i915/i915_drv.h
3033
unsigned int n);
sys/dev/drm/i915/i915_drv.h
3037
unsigned long n);
sys/dev/drm/i915/i915_drv.h
3728
static inline unsigned long nsecs_to_jiffies_timeout(const u64 n)
sys/dev/drm/i915/i915_drv.h
3732
div_u64(n, NSEC_PER_SEC) >= MAX_JIFFY_OFFSET / HZ)
sys/dev/drm/i915/i915_drv.h
3735
return min_t(u64, MAX_JIFFY_OFFSET, nsecs_to_jiffies64(n) + 1);
sys/dev/drm/i915/i915_gem.c
6522
unsigned int n,
sys/dev/drm/i915/i915_gem.c
6530
GEM_BUG_ON(n >= obj->base.size >> PAGE_SHIFT);
sys/dev/drm/i915/i915_gem.c
6542
if (n < READ_ONCE(iter->sg_idx))
sys/dev/drm/i915/i915_gem.c
6556
while (idx + count <= n) {
sys/dev/drm/i915/i915_gem.c
6591
if (unlikely(n < idx)) /* insertion completed by another thread */
sys/dev/drm/i915/i915_gem.c
6597
while (idx + count <= n) {
sys/dev/drm/i915/i915_gem.c
6603
*offset = n - idx;
sys/dev/drm/i915/i915_gem.c
6609
sg = radix_tree_lookup(&iter->radix, n);
sys/dev/drm/i915/i915_gem.c
6625
*offset = n - base;
sys/dev/drm/i915/i915_gem.c
6634
i915_gem_object_get_page(struct drm_i915_gem_object *obj, unsigned int n)
sys/dev/drm/i915/i915_gem.c
6641
sg = i915_gem_object_get_sg(obj, n, &offset);
sys/dev/drm/i915/i915_gem.c
6648
unsigned int n)
sys/dev/drm/i915/i915_gem.c
6652
page = i915_gem_object_get_page(obj, n);
sys/dev/drm/i915/i915_gem.c
6661
unsigned long n)
sys/dev/drm/i915/i915_gem.c
6666
sg = i915_gem_object_get_sg(obj, n, &offset);
sys/dev/drm/i915/i915_gem_batch_pool.c
36
int n;
sys/dev/drm/i915/i915_gem_batch_pool.c
40
for (n = 0; n < ARRAY_SIZE(pool->cache_list); n++)
sys/dev/drm/i915/i915_gem_batch_pool.c
41
INIT_LIST_HEAD(&pool->cache_list[n]);
sys/dev/drm/i915/i915_gem_batch_pool.c
52
int n;
sys/dev/drm/i915/i915_gem_batch_pool.c
56
for (n = 0; n < ARRAY_SIZE(pool->cache_list); n++) {
sys/dev/drm/i915/i915_gem_batch_pool.c
60
&pool->cache_list[n],
sys/dev/drm/i915/i915_gem_batch_pool.c
64
INIT_LIST_HEAD(&pool->cache_list[n]);
sys/dev/drm/i915/i915_gem_batch_pool.c
87
int n, ret;
sys/dev/drm/i915/i915_gem_batch_pool.c
95
n = fls(size >> PAGE_SHIFT) - 1;
sys/dev/drm/i915/i915_gem_batch_pool.c
96
if (n >= ARRAY_SIZE(pool->cache_list))
sys/dev/drm/i915/i915_gem_batch_pool.c
97
n = ARRAY_SIZE(pool->cache_list) - 1;
sys/dev/drm/i915/i915_gem_batch_pool.c
98
list = &pool->cache_list[n];
sys/dev/drm/i915/i915_gem_context.c
209
unsigned int n;
sys/dev/drm/i915/i915_gem_context.c
217
for (n = 0; n < ARRAY_SIZE(ctx->__engine); n++) {
sys/dev/drm/i915/i915_gem_context.c
218
struct intel_context *ce = &ctx->__engine[n];
sys/dev/drm/i915/i915_gem_context.c
330
unsigned int n;
sys/dev/drm/i915/i915_gem_context.c
342
for (n = 0; n < ARRAY_SIZE(ctx->__engine); n++) {
sys/dev/drm/i915/i915_gem_context.c
343
struct intel_context *ce = &ctx->__engine[n];
sys/dev/drm/i915/i915_gem_execbuffer.c
2083
__free_fence_array(struct drm_syncobj **fences, unsigned int n)
sys/dev/drm/i915/i915_gem_execbuffer.c
2085
while (n--)
sys/dev/drm/i915/i915_gem_execbuffer.c
2086
drm_syncobj_put(ptr_mask_bits(fences[n], 2));
sys/dev/drm/i915/i915_gem_execbuffer.c
2097
unsigned long n;
sys/dev/drm/i915/i915_gem_execbuffer.c
2121
for (n = 0; n < nfences; n++) {
sys/dev/drm/i915/i915_gem_execbuffer.c
2145
fences[n] = ptr_pack_bits(syncobj, fence.flags, 2);
sys/dev/drm/i915/i915_gem_execbuffer.c
2151
__free_fence_array(fences, n);
sys/dev/drm/i915/i915_gem_execbuffer.c
2168
unsigned int n;
sys/dev/drm/i915/i915_gem_execbuffer.c
2171
for (n = 0; n < nfences; n++) {
sys/dev/drm/i915/i915_gem_execbuffer.c
2176
syncobj = ptr_unpack_bits(fences[n], &flags, 2);
sys/dev/drm/i915/i915_gem_execbuffer.c
2199
unsigned int n;
sys/dev/drm/i915/i915_gem_execbuffer.c
2201
for (n = 0; n < nfences; n++) {
sys/dev/drm/i915/i915_gem_execbuffer.c
2205
syncobj = ptr_unpack_bits(fences[n], &flags, 2);
sys/dev/drm/i915/i915_gem_gtt.h
575
i915_page_dir_dma_addr(const struct i915_hw_ppgtt *ppgtt, const unsigned n)
sys/dev/drm/i915/i915_gem_gtt.h
577
return px_dma(ppgtt->pdp.page_directory[n]);
sys/dev/drm/i915/i915_gem_stolen.c
86
resource_size_t start, resource_size_t n, const char *name)
sys/dev/drm/i915/i915_gem_stolen.c
92
stolen_rman.rm_end = start + n;
sys/dev/drm/i915/i915_gpu_error.c
1373
unsigned int n;
sys/dev/drm/i915/i915_gpu_error.c
1375
for (n = 0; n < execlists_num_ports(execlists); n++) {
sys/dev/drm/i915/i915_gpu_error.c
1376
struct i915_request *rq = port_request(&execlists->port[n]);
sys/dev/drm/i915/i915_gpu_error.c
1381
record_request(rq, &ee->execlist[n]);
sys/dev/drm/i915/i915_gpu_error.c
1384
ee->num_ports = n;
sys/dev/drm/i915/i915_gpu_error.c
470
int n;
sys/dev/drm/i915/i915_gpu_error.c
544
for (n = 0; n < ee->num_ports; n++) {
sys/dev/drm/i915/i915_gpu_error.c
545
err_printf(m, " ELSP[%d]:", n);
sys/dev/drm/i915/i915_gpu_error.c
546
error_print_request(m, " ", &ee->execlist[n], epoch);
sys/dev/drm/i915/i915_reg.h
10395
#define COMMAND_LENGTH_SHIFT(n) (8 * (n)) /* n: 0...3 */
sys/dev/drm/i915/i915_reg.h
10396
#define COMMAND_LENGTH_MASK(n) (0xff << (8 * (n)))
sys/dev/drm/i915/i915_reg.h
10400
#define MIPI_READ_DATA_RETURN(port, n) _MMIO(_MIPI(port, _MIPIA_READ_DATA_RETURN0, _MIPIC_READ_DATA_RETURN0) + 4 * (n)) /* n: 0...7 */
sys/dev/drm/i915/i915_reg.h
10405
#define READ_DATA_VALID(n) (1 << (n))
sys/dev/drm/i915/i915_reg.h
339
#define GEN8_RING_PDP_UDW(engine, n) _MMIO((engine)->mmio_base + 0x270 + (n) * 8 + 4)
sys/dev/drm/i915/i915_reg.h
340
#define GEN8_RING_PDP_LDW(engine, n) _MMIO((engine)->mmio_base + 0x270 + (n) * 8)
sys/dev/drm/i915/i915_reg.h
502
#define GEN7_SO_NUM_PRIMS_WRITTEN(n) _MMIO(0x5200 + (n) * 8)
sys/dev/drm/i915/i915_reg.h
503
#define GEN7_SO_NUM_PRIMS_WRITTEN_UDW(n) _MMIO(0x5200 + (n) * 8 + 4)
sys/dev/drm/i915/i915_reg.h
505
#define GEN7_SO_PRIM_STORAGE_NEEDED(n) _MMIO(0x5240 + (n) * 8)
sys/dev/drm/i915/i915_reg.h
506
#define GEN7_SO_PRIM_STORAGE_NEEDED_UDW(n) _MMIO(0x5240 + (n) * 8 + 4)
sys/dev/drm/i915/i915_reg.h
520
#define HSW_CS_GPR(n) _MMIO(0x2600 + (n) * 8)
sys/dev/drm/i915/i915_reg.h
521
#define HSW_CS_GPR_UDW(n) _MMIO(0x2600 + (n) * 8 + 4)
sys/dev/drm/i915/i915_reg.h
8307
#define FORCEWAKE_MEDIA_VDBOX_GEN11(n) _MMIO(0xa540 + (n) * 4)
sys/dev/drm/i915/i915_reg.h
8308
#define FORCEWAKE_MEDIA_VEBOX_GEN11(n) _MMIO(0xa560 + (n) * 4)
sys/dev/drm/i915/i915_reg.h
8312
#define FORCEWAKE_ACK_MEDIA_VDBOX_GEN11(n) _MMIO(0x0D50 + (n) * 4)
sys/dev/drm/i915/i915_reg.h
8313
#define FORCEWAKE_ACK_MEDIA_VEBOX_GEN11(n) _MMIO(0x0D70 + (n) * 4)
sys/dev/drm/i915/i915_reg.h
8742
#define GEN7_SO_WRITE_OFFSET(n) _MMIO(0x5280 + (n) * 4)
sys/dev/drm/i915/i915_reg.h
8761
#define AUD_CONFIG_N(n) \
sys/dev/drm/i915/i915_reg.h
8762
(((((n) >> 12) & 0xff) << AUD_CONFIG_UPPER_N_SHIFT) | \
sys/dev/drm/i915/i915_reg.h
8763
(((n) & 0xfff) << AUD_CONFIG_LOWER_N_SHIFT))
sys/dev/drm/i915/i915_reg.h
9094
#define DDI_BUF_TRANS_SELECT(n) ((n) << 24)
sys/dev/drm/i915/i915_trace.h
58
#define trace_i915_gem_request_in(request, n)
sys/dev/drm/i915/i915_utils.h
73
#define ptr_mask_bits(ptr, n) ({ \
sys/dev/drm/i915/i915_utils.h
75
(typeof(ptr))(__v & -BIT(n)); \
sys/dev/drm/i915/i915_utils.h
78
#define ptr_unmask_bits(ptr, n) ((unsigned long)(ptr) & (BIT(n) - 1))
sys/dev/drm/i915/i915_utils.h
80
#define ptr_unpack_bits(ptr, bits, n) ({ \
sys/dev/drm/i915/i915_utils.h
82
*(bits) = __v & (BIT(n) - 1); \
sys/dev/drm/i915/i915_utils.h
83
(typeof(ptr))(__v & -BIT(n)); \
sys/dev/drm/i915/i915_utils.h
86
#define ptr_pack_bits(ptr, bits, n) ({ \
sys/dev/drm/i915/i915_utils.h
88
GEM_BUG_ON(__bits & -BIT(n)); \
sys/dev/drm/i915/i915_vma.c
1083
struct i915_vma_active *active, *n;
sys/dev/drm/i915/i915_vma.c
1105
rbtree_postorder_for_each_entry_safe(active, n,
sys/dev/drm/i915/i915_vma.c
800
struct i915_vma_active *iter, *n;
sys/dev/drm/i915/i915_vma.c
812
rbtree_postorder_for_each_entry_safe(iter, n, &vma->active, node) {
sys/dev/drm/i915/intel_audio.c
153
int n;
sys/dev/drm/i915/intel_audio.c
221
return hdmi_aud_ncts[i].n;
sys/dev/drm/i915/intel_audio.c
331
DRM_DEBUG_KMS("using Maud %u, Naud %u\n", nm->m, nm->n);
sys/dev/drm/i915/intel_audio.c
343
tmp |= AUD_CONFIG_N(nm->n);
sys/dev/drm/i915/intel_audio.c
372
int n, rate;
sys/dev/drm/i915/intel_audio.c
383
n = audio_config_hdmi_get_n(crtc_state, rate);
sys/dev/drm/i915/intel_audio.c
384
if (n != 0) {
sys/dev/drm/i915/intel_audio.c
385
DRM_DEBUG_KMS("using N %d\n", n);
sys/dev/drm/i915/intel_audio.c
388
tmp |= AUD_CONFIG_N(n);
sys/dev/drm/i915/intel_audio.c
71
u16 n;
sys/dev/drm/i915/intel_breadcrumbs.c
239
struct intel_wait *wait, *n;
sys/dev/drm/i915/intel_breadcrumbs.c
260
rbtree_postorder_for_each_entry_safe(wait, n, &b->waiters, node) {
sys/dev/drm/i915/intel_breadcrumbs.c
566
struct rb_node *n = rb_next(next);
sys/dev/drm/i915/intel_breadcrumbs.c
569
next = n;
sys/dev/drm/i915/intel_breadcrumbs.c
620
struct i915_request *rq, *n;
sys/dev/drm/i915/intel_breadcrumbs.c
646
list_for_each_entry_safe(rq, n, &b->signals, signaling.link) {
sys/dev/drm/i915/intel_breadcrumbs.c
673
list_for_each_entry_safe(rq, n, &list, signaling.link) {
sys/dev/drm/i915/intel_ddi.c
1276
int n, p, r;
sys/dev/drm/i915/intel_ddi.c
1300
n = (wrpll & WRPLL_DIVIDER_FB_MASK) >> WRPLL_DIVIDER_FB_SHIFT;
sys/dev/drm/i915/intel_ddi.c
1303
return (refclk * n * 100) / (p * r);
sys/dev/drm/i915/intel_ddi.c
1720
clock.n = (state->pll1 & PORT_PLL_N_MASK) >> PORT_PLL_N_SHIFT;
sys/dev/drm/i915/intel_display.c
10518
clock.n = ffs((fp & FP_N_PINEVIEW_DIV_MASK) >> FP_N_DIV_SHIFT) - 1;
sys/dev/drm/i915/intel_display.c
10521
clock.n = (fp & FP_N_DIV_MASK) >> FP_N_DIV_SHIFT;
sys/dev/drm/i915/intel_display.c
11459
intel_compare_m_n(unsigned int m, unsigned int n,
sys/dev/drm/i915/intel_display.c
11463
if (m == m2 && n == n2)
sys/dev/drm/i915/intel_display.c
11466
if (exact || !m || !n || !m2 || !n2)
sys/dev/drm/i915/intel_display.c
11471
if (n > n2) {
sys/dev/drm/i915/intel_display.c
11472
while (n > n2) {
sys/dev/drm/i915/intel_display.c
11476
} else if (n < n2) {
sys/dev/drm/i915/intel_display.c
11477
while (n < n2) {
sys/dev/drm/i915/intel_display.c
11479
n <<= 1;
sys/dev/drm/i915/intel_display.c
11483
if (n != n2)
sys/dev/drm/i915/intel_display.c
15487
.n = 2,
sys/dev/drm/i915/intel_display.c
171
} dot, vco, n, m, m1, m2, p, p1;
sys/dev/drm/i915/intel_display.c
246
.n = { .min = 2, .max = 16 },
sys/dev/drm/i915/intel_display.c
259
.n = { .min = 2, .max = 16 },
sys/dev/drm/i915/intel_display.c
272
.n = { .min = 2, .max = 16 },
sys/dev/drm/i915/intel_display.c
285
.n = { .min = 1, .max = 6 },
sys/dev/drm/i915/intel_display.c
298
.n = { .min = 1, .max = 6 },
sys/dev/drm/i915/intel_display.c
312
.n = { .min = 1, .max = 4 },
sys/dev/drm/i915/intel_display.c
327
.n = { .min = 1, .max = 4 },
sys/dev/drm/i915/intel_display.c
340
.n = { .min = 1, .max = 3 },
sys/dev/drm/i915/intel_display.c
354
.n = { .min = 1, .max = 3 },
sys/dev/drm/i915/intel_display.c
369
.n = { .min = 3, .max = 6 },
sys/dev/drm/i915/intel_display.c
383
.n = { .min = 3, .max = 6 },
sys/dev/drm/i915/intel_display.c
401
.n = { .min = 1, .max = 5 },
sys/dev/drm/i915/intel_display.c
414
.n = { .min = 1, .max = 3 },
sys/dev/drm/i915/intel_display.c
427
.n = { .min = 1, .max = 3 },
sys/dev/drm/i915/intel_display.c
441
.n = { .min = 1, .max = 2 },
sys/dev/drm/i915/intel_display.c
454
.n = { .min = 1, .max = 3 },
sys/dev/drm/i915/intel_display.c
473
.n = { .min = 1, .max = 7 },
sys/dev/drm/i915/intel_display.c
489
.n = { .min = 1, .max = 1 },
sys/dev/drm/i915/intel_display.c
500
.n = { .min = 1, .max = 1 },
sys/dev/drm/i915/intel_display.c
554
if (WARN_ON(clock->n == 0 || clock->p == 0))
sys/dev/drm/i915/intel_display.c
556
clock->vco = DIV_ROUND_CLOSEST(refclk * clock->m, clock->n);
sys/dev/drm/i915/intel_display.c
571
if (WARN_ON(clock->n + 2 == 0 || clock->p == 0))
sys/dev/drm/i915/intel_display.c
573
clock->vco = DIV_ROUND_CLOSEST(refclk * clock->m, clock->n + 2);
sys/dev/drm/i915/intel_display.c
583
if (WARN_ON(clock->n == 0 || clock->p == 0))
sys/dev/drm/i915/intel_display.c
585
clock->vco = DIV_ROUND_CLOSEST(refclk * clock->m, clock->n);
sys/dev/drm/i915/intel_display.c
595
if (WARN_ON(clock->n == 0 || clock->p == 0))
sys/dev/drm/i915/intel_display.c
598
clock->n << 22);
sys/dev/drm/i915/intel_display.c
614
if (clock->n < limit->n.min || limit->n.max < clock->n)
sys/dev/drm/i915/intel_display.c
6817
static void compute_m_n(unsigned int m, unsigned int n,
sys/dev/drm/i915/intel_display.c
6831
*ret_n = min_t(unsigned int, roundup_pow_of_two(n), DATA_LINK_N_MAX);
sys/dev/drm/i915/intel_display.c
6833
*ret_m = div_u64((uint64_t) m * *ret_n, n);
sys/dev/drm/i915/intel_display.c
6865
return (1 << dpll->n) << 16 | dpll->m2;
sys/dev/drm/i915/intel_display.c
6870
return dpll->n << 16 | dpll->m1 << 8 | dpll->m2;
sys/dev/drm/i915/intel_display.c
702
for (clock.n = limit->n.min;
sys/dev/drm/i915/intel_display.c
703
clock.n <= limit->n.max; clock.n++) {
sys/dev/drm/i915/intel_display.c
7054
bestn = pipe_config->dpll.n;
sys/dev/drm/i915/intel_display.c
7152
bestn = pipe_config->dpll.n;
sys/dev/drm/i915/intel_display.c
758
for (clock.n = limit->n.min;
sys/dev/drm/i915/intel_display.c
759
clock.n <= limit->n.max; clock.n++) {
sys/dev/drm/i915/intel_display.c
7842
clock.n = (mdiv >> DPIO_N_SHIFT) & 0xf;
sys/dev/drm/i915/intel_display.c
7959
clock.n = (pll_dw1 >> DPIO_CHV_N_DIV_SHIFT) & 0xf;
sys/dev/drm/i915/intel_display.c
813
max_n = limit->n.max;
sys/dev/drm/i915/intel_display.c
815
for (clock.n = limit->n.min; clock.n <= max_n; clock.n++) {
sys/dev/drm/i915/intel_display.c
835
max_n = clock.n;
sys/dev/drm/i915/intel_display.c
8623
return i9xx_dpll_compute_m(dpll) < factor * dpll->n;
sys/dev/drm/i915/intel_display.c
8654
if (reduced_clock->m < factor * reduced_clock->n)
sys/dev/drm/i915/intel_display.c
901
int max_n = min(limit->n.max, refclk / 19200);
sys/dev/drm/i915/intel_display.c
909
for (clock.n = limit->n.min; clock.n <= max_n; clock.n++) {
sys/dev/drm/i915/intel_display.c
918
clock.m2 = DIV_ROUND_CLOSEST(target * clock.p * clock.n,
sys/dev/drm/i915/intel_display.c
971
clock.n = 1, clock.m1 = 2;
sys/dev/drm/i915/intel_display.c
983
clock.n) << 22, refclk * clock.m1);
sys/dev/drm/i915/intel_dp.c
62
{ .p1 = 2, .p2 = 10, .n = 2, .m1 = 23, .m2 = 8 } },
sys/dev/drm/i915/intel_dp.c
64
{ .p1 = 1, .p2 = 10, .n = 1, .m1 = 14, .m2 = 2 } }
sys/dev/drm/i915/intel_dp.c
69
{ .p1 = 2, .p2 = 10, .n = 1, .m1 = 12, .m2 = 9 } },
sys/dev/drm/i915/intel_dp.c
71
{ .p1 = 1, .p2 = 10, .n = 2, .m1 = 14, .m2 = 8 } }
sys/dev/drm/i915/intel_dp.c
76
{ .p1 = 3, .p2 = 2, .n = 5, .m1 = 3, .m2 = 81 } },
sys/dev/drm/i915/intel_dp.c
78
{ .p1 = 2, .p2 = 2, .n = 1, .m1 = 2, .m2 = 27 } }
sys/dev/drm/i915/intel_dp.c
92
{ .p1 = 4, .p2 = 2, .n = 1, .m1 = 2, .m2 = 0x819999a } },
sys/dev/drm/i915/intel_dp.c
94
{ .p1 = 4, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x6c00000 } },
sys/dev/drm/i915/intel_dpll_mgr.c
1666
uint32_t n;
sys/dev/drm/i915/intel_dpll_mgr.c
1703
clk_div->n = best_clock.n;
sys/dev/drm/i915/intel_dpll_mgr.c
1770
dpll_hw_state->pll1 = PORT_PLL_N(clk_div->n);
sys/dev/drm/i915/intel_drv.h
446
int n;
sys/dev/drm/i915/intel_gpu_commands.h
59
#define MI_DISPLAY_FLIP_PLANE(n) ((n) << 20)
sys/dev/drm/i915/intel_guc_reg.h
51
#define SOFT_SCRATCH(n) _MMIO(0xc180 + (n) * 4)
sys/dev/drm/i915/intel_guc_submission.c
679
unsigned int n;
sys/dev/drm/i915/intel_guc_submission.c
681
for (n = 0; n < execlists_num_ports(execlists); n++) {
sys/dev/drm/i915/intel_guc_submission.c
685
rq = port_unpack(&port[n], &count);
sys/dev/drm/i915/intel_guc_submission.c
687
port_set(&port[n], port_pack(rq, ++count));
sys/dev/drm/i915/intel_lrc.c
474
unsigned int n;
sys/dev/drm/i915/intel_lrc.c
492
for (n = execlists_num_ports(execlists); n--; ) {
sys/dev/drm/i915/intel_lrc.c
497
rq = port_unpack(&port[n], &count);
sys/dev/drm/i915/intel_lrc.c
499
GEM_BUG_ON(count > !n);
sys/dev/drm/i915/intel_lrc.c
502
port_set(&port[n], port_pack(rq, count));
sys/dev/drm/i915/intel_lrc.c
504
GEM_DEBUG_EXEC(port[n].context_id = upper_32_bits(desc));
sys/dev/drm/i915/intel_lrc.c
507
engine->name, n,
sys/dev/drm/i915/intel_lrc.c
508
port[n].context_id, count,
sys/dev/drm/i915/intel_lrc.c
514
GEM_BUG_ON(!n);
sys/dev/drm/i915/intel_lrc.c
518
write_desc(execlists, desc, n);
sys/dev/drm/i915/intel_lrc.c
561
unsigned int n;
sys/dev/drm/i915/intel_lrc.c
571
for (n = execlists_num_ports(execlists); --n; )
sys/dev/drm/i915/intel_lrc.c
572
write_desc(execlists, 0, n);
sys/dev/drm/i915/intel_lrc.c
574
write_desc(execlists, ce->lrc_desc, n);
sys/dev/drm/i915/intel_lrc_reg.h
49
#define ASSIGN_CTX_PDP(ppgtt, reg_state, n) do { \
sys/dev/drm/i915/intel_lrc_reg.h
51
const u64 addr__ = i915_page_dir_dma_addr((ppgtt), (n)); \
sys/dev/drm/i915/intel_lrc_reg.h
52
(reg_state__)[CTX_PDP ## n ## _UDW + 1] = upper_32_bits(addr__); \
sys/dev/drm/i915/intel_lrc_reg.h
53
(reg_state__)[CTX_PDP ## n ## _LDW + 1] = lower_32_bits(addr__); \
sys/dev/drm/i915/intel_ringbuffer.h
815
u32 __must_check *intel_ring_begin(struct i915_request *rq, unsigned int n);
sys/dev/drm/i915/intel_sdvo.c
1096
clock->n = 3;
sys/dev/drm/i915/intel_sdvo.c
1102
clock->n = 6;
sys/dev/drm/i915/intel_uncore.c
324
u32 n;
sys/dev/drm/i915/intel_uncore.c
329
n = fifo_free_entries(dev_priv);
sys/dev/drm/i915/intel_uncore.c
331
n = dev_priv->uncore.fifo_count;
sys/dev/drm/i915/intel_uncore.c
333
if (n <= GT_FIFO_NUM_RESERVED_ENTRIES) {
sys/dev/drm/i915/intel_uncore.c
334
if (wait_for_atomic((n = fifo_free_entries(dev_priv)) >
sys/dev/drm/i915/intel_uncore.c
337
DRM_DEBUG("GT_FIFO timeout, entries: %u\n", n);
sys/dev/drm/i915/intel_uncore.c
342
dev_priv->uncore.fifo_count = n - 1;
sys/dev/drm/i915/vlv_dsi_pll.c
104
(ffs(n) - 1) << DSI_PLL_N1_DIV_SHIFT |
sys/dev/drm/i915/vlv_dsi_pll.c
271
u32 m = 0, p = 0, n;
sys/dev/drm/i915/vlv_dsi_pll.c
290
n = (pll_div & DSI_PLL_N1_DIV_MASK) >> DSI_PLL_N1_DIV_SHIFT;
sys/dev/drm/i915/vlv_dsi_pll.c
291
n = 1 << n; /* register has log2(N1) */
sys/dev/drm/i915/vlv_dsi_pll.c
320
dsi_clock = (m * refclk) / (p * n);
sys/dev/drm/i915/vlv_dsi_pll.c
59
unsigned int m, n, p;
sys/dev/drm/i915/vlv_dsi_pll.c
71
n = 4;
sys/dev/drm/i915/vlv_dsi_pll.c
76
n = 1;
sys/dev/drm/i915/vlv_dsi_pll.c
83
delta = abs(target_dsi_clk - (m_min * ref_clk) / (p_min * n));
sys/dev/drm/i915/vlv_dsi_pll.c
91
int calc_dsi_clk = (m * ref_clk) / (p * n);
sys/dev/drm/include/asm/string_64.h
42
memset64(u64 *s, uint64_t v, size_t n)
sys/dev/drm/include/asm/string_64.h
47
: "+D" (dest), "+c" (n) /* output operands (modified input) */
sys/dev/drm/include/asm/string_64.h
55
memset_p(void **p, void *v, size_t n)
sys/dev/drm/include/asm/string_64.h
57
return memset64((u64 *)p, (uint64_t)v, n);
sys/dev/drm/include/asm/uaccess.h
35
copy_to_user(void *to, const void *from, unsigned long n)
sys/dev/drm/include/asm/uaccess.h
37
if (copyout(from, to, n) != 0)
sys/dev/drm/include/asm/uaccess.h
38
return n;
sys/dev/drm/include/asm/uaccess.h
43
copy_from_user(void *to, const void *from, unsigned long n)
sys/dev/drm/include/asm/uaccess.h
45
if (copyin(from, to, n) != 0)
sys/dev/drm/include/asm/uaccess.h
46
return n;
sys/dev/drm/include/asm/uaccess.h
75
__copy_to_user_inatomic(void __user *to, const void *from, unsigned n)
sys/dev/drm/include/asm/uaccess.h
77
return (copyout(from, to, n) != 0 ? n : 0);
sys/dev/drm/include/asm/uaccess.h
82
unsigned long n)
sys/dev/drm/include/asm/uaccess.h
91
return ((copyin_nofault(__DECONST(void *, from), to, n) != 0 ? n : 0));
sys/dev/drm/include/drm/drm_ioctl.h
72
#define DRM_IOCTL_NR(n) ((n) & 0xff)
sys/dev/drm/include/linux/atomic.h
57
#define atomic_cmpset(p, o, n) atomic_cmpset_32(&((p)->counter), o, n)
sys/dev/drm/include/linux/atomic.h
59
#define atomic64_cmpxchg(p, o, n) \
sys/dev/drm/include/linux/atomic.h
60
(atomic_cmpset_long((volatile uint64_t *)(p),(o),(n)) ? (o) : (0))
sys/dev/drm/include/linux/bitmap.h
61
bitmap_complement(void *d, void *s, u_int n)
sys/dev/drm/include/linux/bitmap.h
67
for (b = 0; b < n; b += 32)
sys/dev/drm/include/linux/bitops.h
36
#define BIT_MASK(n) (~0UL >> (BITS_PER_LONG - (n)))
sys/dev/drm/include/linux/bitops.h
37
#define BITS_TO_LONGS(n) howmany((n), BITS_PER_LONG)
sys/dev/drm/include/linux/bug.h
39
#define BUILD_BUG_ON_NOT_POWER_OF_2(n)
sys/dev/drm/include/linux/circ_buf.h
49
int n = ((head) + end) & ((size)-1); \
sys/dev/drm/include/linux/circ_buf.h
50
n < end ? n : end;})
sys/dev/drm/include/linux/circ_buf.h
55
int n = (end + (tail)) & ((size)-1); \
sys/dev/drm/include/linux/circ_buf.h
56
n <= end ? n : end+1;})
sys/dev/drm/include/linux/dma-mapping.h
40
#define DMA_BIT_MASK(n) (((n) == 64) ? ~0ULL : (1ULL<<(n)) - 1)
sys/dev/drm/include/linux/hashtable.h
45
__hash_init(struct hlist_head *hash, unsigned n)
sys/dev/drm/include/linux/hashtable.h
48
while (n --> 0)
sys/dev/drm/include/linux/hashtable.h
49
INIT_HLIST_HEAD(&hash[n]);
sys/dev/drm/include/linux/hashtable.h
53
__hash_empty(struct hlist_head *hash, unsigned n)
sys/dev/drm/include/linux/hashtable.h
56
while (n --> 0) {
sys/dev/drm/include/linux/hashtable.h
57
if (!hlist_empty(&hash[n]))
sys/dev/drm/include/linux/hashtable.h
67
#define hash_add(h, n, k) hlist_add_head(n, &(h)[(k) % __arraycount(h)])
sys/dev/drm/include/linux/hashtable.h
68
#define hash_del(n) hlist_del_init(n)
sys/dev/drm/include/linux/hashtable.h
71
#define hash_for_each_possible(h, n, f, k) \
sys/dev/drm/include/linux/hashtable.h
72
hlist_for_each_entry(n, &(h)[(k) % __arraycount(h)], f)
sys/dev/drm/include/linux/hashtable.h
74
#define hash_for_each_safe(h, i, t, n, f) \
sys/dev/drm/include/linux/hashtable.h
76
hlist_for_each_entry_safe(n, t, &(h)[i], f)
sys/dev/drm/include/linux/jiffies.h
83
static inline u64 nsecs_to_jiffies(u64 n)
sys/dev/drm/include/linux/jiffies.h
85
return (n * hz) / NSEC_PER_SEC;
sys/dev/drm/include/linux/jiffies.h
88
static inline u64 nsecs_to_jiffies64(u64 n)
sys/dev/drm/include/linux/jiffies.h
90
return nsecs_to_jiffies(n);
sys/dev/drm/include/linux/kernel.h
132
#define upper_32_bits(n) ((u32)(((n) >> 16) >> 16))
sys/dev/drm/include/linux/kernel.h
133
#define lower_32_bits(n) ((u32)(n))
sys/dev/drm/include/linux/kernel.h
61
#define DIV_ROUND_DOWN_ULL(x, n) (((unsigned long long)(x) / (n)) * (n))
sys/dev/drm/include/linux/list.h
153
#define list_safe_reset_next(ptr, n, member) \
sys/dev/drm/include/linux/list.h
154
(n) = list_next_entry(ptr, member)
sys/dev/drm/include/linux/list.h
162
#define list_for_each_safe(p, n, head) \
sys/dev/drm/include/linux/list.h
163
for (p = (head)->next, n = p->next; p != (head); p = n, n = p->next)
sys/dev/drm/include/linux/list.h
169
#define list_for_each_entry_safe(p, n, h, field) \
sys/dev/drm/include/linux/list.h
171
n = list_entry(p->field.next, typeof(*p), field); &p->field != (h);\
sys/dev/drm/include/linux/list.h
172
p = n, n = list_entry(n->field.next, typeof(*n), field))
sys/dev/drm/include/linux/list.h
192
#define list_for_each_entry_safe_from(pos, n, head, member) \
sys/dev/drm/include/linux/list.h
193
for (n = list_entry(pos->member.next, typeof(*pos), member); \
sys/dev/drm/include/linux/list.h
195
pos = n, n = list_entry(n->member.next, typeof(*n), member))
sys/dev/drm/include/linux/list.h
201
#define list_for_each_entry_safe_reverse(p, n, h, field) \
sys/dev/drm/include/linux/list.h
203
n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
sys/dev/drm/include/linux/list.h
204
p = n, n = list_entry(n->field.prev, typeof(*n), field))
sys/dev/drm/include/linux/list.h
332
hlist_del(struct hlist_node *n)
sys/dev/drm/include/linux/list.h
335
if (n->next)
sys/dev/drm/include/linux/list.h
336
n->next->pprev = n->pprev;
sys/dev/drm/include/linux/list.h
337
*n->pprev = n->next;
sys/dev/drm/include/linux/list.h
341
hlist_del_init(struct hlist_node *n)
sys/dev/drm/include/linux/list.h
344
if (hlist_unhashed(n))
sys/dev/drm/include/linux/list.h
346
hlist_del(n);
sys/dev/drm/include/linux/list.h
347
INIT_HLIST_NODE(n);
sys/dev/drm/include/linux/list.h
351
hlist_add_head(struct hlist_node *n, struct hlist_head *h)
sys/dev/drm/include/linux/list.h
354
n->next = h->first;
sys/dev/drm/include/linux/list.h
356
h->first->pprev = &n->next;
sys/dev/drm/include/linux/list.h
357
h->first = n;
sys/dev/drm/include/linux/list.h
358
n->pprev = &h->first;
sys/dev/drm/include/linux/list.h
362
hlist_add_before(struct hlist_node *n, struct hlist_node *next)
sys/dev/drm/include/linux/list.h
365
n->pprev = next->pprev;
sys/dev/drm/include/linux/list.h
366
n->next = next;
sys/dev/drm/include/linux/list.h
367
next->pprev = &n->next;
sys/dev/drm/include/linux/list.h
368
*(n->pprev) = n;
sys/dev/drm/include/linux/list.h
372
hlist_add_after(struct hlist_node *n, struct hlist_node *next)
sys/dev/drm/include/linux/list.h
375
next->next = n->next;
sys/dev/drm/include/linux/list.h
376
n->next = next;
sys/dev/drm/include/linux/list.h
377
next->pprev = &n->next;
sys/dev/drm/include/linux/list.h
457
#define hlist_for_each_safe(p, n, head) \
sys/dev/drm/include/linux/list.h
458
for (p = (head)->first; p && ({ n = p->next; 1; }); p = n)
sys/dev/drm/include/linux/list.h
475
#define hlist_for_each_entry_safe(pos, n, head, member) \
sys/dev/drm/include/linux/list.h
477
(pos) && ({ n = (pos)->member.next; 1; }); \
sys/dev/drm/include/linux/list.h
478
pos = hlist_entry_safe(n, typeof(*(pos)), member))
sys/dev/drm/include/linux/list.h
483
#define hlist_add_head_rcu(n, h) hlist_add_head(n, h)
sys/dev/drm/include/linux/list.h
485
#define hlist_del_init_rcu(n) hlist_del_init(n)
sys/dev/drm/include/linux/llist.h
87
#define llist_for_each_entry_safe(pos, n, node, member) \
sys/dev/drm/include/linux/llist.h
90
(n = llist_entry(pos->member.next, __typeof(*pos), member), pos); \
sys/dev/drm/include/linux/llist.h
91
pos = n)
sys/dev/drm/include/linux/log2.h
100
(n) & (1ULL << 32) ? 32 : \
sys/dev/drm/include/linux/log2.h
101
(n) & (1ULL << 31) ? 31 : \
sys/dev/drm/include/linux/log2.h
102
(n) & (1ULL << 30) ? 30 : \
sys/dev/drm/include/linux/log2.h
103
(n) & (1ULL << 29) ? 29 : \
sys/dev/drm/include/linux/log2.h
104
(n) & (1ULL << 28) ? 28 : \
sys/dev/drm/include/linux/log2.h
105
(n) & (1ULL << 27) ? 27 : \
sys/dev/drm/include/linux/log2.h
106
(n) & (1ULL << 26) ? 26 : \
sys/dev/drm/include/linux/log2.h
107
(n) & (1ULL << 25) ? 25 : \
sys/dev/drm/include/linux/log2.h
108
(n) & (1ULL << 24) ? 24 : \
sys/dev/drm/include/linux/log2.h
109
(n) & (1ULL << 23) ? 23 : \
sys/dev/drm/include/linux/log2.h
110
(n) & (1ULL << 22) ? 22 : \
sys/dev/drm/include/linux/log2.h
111
(n) & (1ULL << 21) ? 21 : \
sys/dev/drm/include/linux/log2.h
112
(n) & (1ULL << 20) ? 20 : \
sys/dev/drm/include/linux/log2.h
113
(n) & (1ULL << 19) ? 19 : \
sys/dev/drm/include/linux/log2.h
114
(n) & (1ULL << 18) ? 18 : \
sys/dev/drm/include/linux/log2.h
115
(n) & (1ULL << 17) ? 17 : \
sys/dev/drm/include/linux/log2.h
116
(n) & (1ULL << 16) ? 16 : \
sys/dev/drm/include/linux/log2.h
117
(n) & (1ULL << 15) ? 15 : \
sys/dev/drm/include/linux/log2.h
118
(n) & (1ULL << 14) ? 14 : \
sys/dev/drm/include/linux/log2.h
119
(n) & (1ULL << 13) ? 13 : \
sys/dev/drm/include/linux/log2.h
120
(n) & (1ULL << 12) ? 12 : \
sys/dev/drm/include/linux/log2.h
121
(n) & (1ULL << 11) ? 11 : \
sys/dev/drm/include/linux/log2.h
122
(n) & (1ULL << 10) ? 10 : \
sys/dev/drm/include/linux/log2.h
123
(n) & (1ULL << 9) ? 9 : \
sys/dev/drm/include/linux/log2.h
124
(n) & (1ULL << 8) ? 8 : \
sys/dev/drm/include/linux/log2.h
125
(n) & (1ULL << 7) ? 7 : \
sys/dev/drm/include/linux/log2.h
126
(n) & (1ULL << 6) ? 6 : \
sys/dev/drm/include/linux/log2.h
127
(n) & (1ULL << 5) ? 5 : \
sys/dev/drm/include/linux/log2.h
128
(n) & (1ULL << 4) ? 4 : \
sys/dev/drm/include/linux/log2.h
129
(n) & (1ULL << 3) ? 3 : \
sys/dev/drm/include/linux/log2.h
130
(n) & (1ULL << 2) ? 2 : \
sys/dev/drm/include/linux/log2.h
132
(sizeof(n) <= 4) ? \
sys/dev/drm/include/linux/log2.h
133
fls((u32)(n)) - 1 : flsll((u64)(n)) - 1 \
sys/dev/drm/include/linux/log2.h
136
#define order_base_2(n) ilog2(roundup_pow_of_two(n))
sys/dev/drm/include/linux/log2.h
44
is_power_of_2(unsigned long n)
sys/dev/drm/include/linux/log2.h
46
return (n == roundup_pow_of_two(n));
sys/dev/drm/include/linux/log2.h
65
#define ilog2(n) \
sys/dev/drm/include/linux/log2.h
67
__builtin_constant_p(n) ? ( \
sys/dev/drm/include/linux/log2.h
68
(n) < 2 ? 0 : \
sys/dev/drm/include/linux/log2.h
69
(n) & (1ULL << 63) ? 63 : \
sys/dev/drm/include/linux/log2.h
70
(n) & (1ULL << 62) ? 62 : \
sys/dev/drm/include/linux/log2.h
71
(n) & (1ULL << 61) ? 61 : \
sys/dev/drm/include/linux/log2.h
72
(n) & (1ULL << 60) ? 60 : \
sys/dev/drm/include/linux/log2.h
73
(n) & (1ULL << 59) ? 59 : \
sys/dev/drm/include/linux/log2.h
74
(n) & (1ULL << 58) ? 58 : \
sys/dev/drm/include/linux/log2.h
75
(n) & (1ULL << 57) ? 57 : \
sys/dev/drm/include/linux/log2.h
76
(n) & (1ULL << 56) ? 56 : \
sys/dev/drm/include/linux/log2.h
77
(n) & (1ULL << 55) ? 55 : \
sys/dev/drm/include/linux/log2.h
78
(n) & (1ULL << 54) ? 54 : \
sys/dev/drm/include/linux/log2.h
79
(n) & (1ULL << 53) ? 53 : \
sys/dev/drm/include/linux/log2.h
80
(n) & (1ULL << 52) ? 52 : \
sys/dev/drm/include/linux/log2.h
81
(n) & (1ULL << 51) ? 51 : \
sys/dev/drm/include/linux/log2.h
82
(n) & (1ULL << 50) ? 50 : \
sys/dev/drm/include/linux/log2.h
83
(n) & (1ULL << 49) ? 49 : \
sys/dev/drm/include/linux/log2.h
84
(n) & (1ULL << 48) ? 48 : \
sys/dev/drm/include/linux/log2.h
85
(n) & (1ULL << 47) ? 47 : \
sys/dev/drm/include/linux/log2.h
86
(n) & (1ULL << 46) ? 46 : \
sys/dev/drm/include/linux/log2.h
87
(n) & (1ULL << 45) ? 45 : \
sys/dev/drm/include/linux/log2.h
88
(n) & (1ULL << 44) ? 44 : \
sys/dev/drm/include/linux/log2.h
89
(n) & (1ULL << 43) ? 43 : \
sys/dev/drm/include/linux/log2.h
90
(n) & (1ULL << 42) ? 42 : \
sys/dev/drm/include/linux/log2.h
91
(n) & (1ULL << 41) ? 41 : \
sys/dev/drm/include/linux/log2.h
92
(n) & (1ULL << 40) ? 40 : \
sys/dev/drm/include/linux/log2.h
93
(n) & (1ULL << 39) ? 39 : \
sys/dev/drm/include/linux/log2.h
94
(n) & (1ULL << 38) ? 38 : \
sys/dev/drm/include/linux/log2.h
95
(n) & (1ULL << 37) ? 37 : \
sys/dev/drm/include/linux/log2.h
96
(n) & (1ULL << 36) ? 36 : \
sys/dev/drm/include/linux/log2.h
97
(n) & (1ULL << 35) ? 35 : \
sys/dev/drm/include/linux/log2.h
98
(n) & (1ULL << 34) ? 34 : \
sys/dev/drm/include/linux/log2.h
99
(n) & (1ULL << 33) ? 33 : \
sys/dev/drm/include/linux/math64.h
36
#define do_div(n, base) ({ \
sys/dev/drm/include/linux/math64.h
39
__rem = ((uint64_t)(n)) % __base; \
sys/dev/drm/include/linux/math64.h
40
(n) = ((uint64_t)(n)) / __base; \
sys/dev/drm/include/linux/mm.h
187
void * kvmalloc_array(size_t n, size_t size, gfp_t flags);
sys/dev/drm/include/linux/mm.h
54
nth_page(struct page *page, int n)
sys/dev/drm/include/linux/mm.h
56
return page + n;
sys/dev/drm/include/linux/rculist.h
32
static inline void hlist_add_behind_rcu(struct hlist_node *n,
sys/dev/drm/include/linux/rculist.h
35
hlist_add_after(prev, n);
sys/dev/drm/include/linux/refcount.h
42
refcount_set(refcount_t *r, unsigned int n)
sys/dev/drm/include/linux/refcount.h
44
atomic_set(&r->refs, n);
sys/dev/drm/include/linux/slab.h
44
#define kcalloc(n, size, flags) kzalloc((n) * (size), flags)
sys/dev/drm/include/linux/slab.h
47
kmalloc_array(size_t n, size_t size, gfp_t flags)
sys/dev/drm/include/linux/slab.h
49
return kmalloc(n * size, M_DRM, flags);
sys/dev/drm/include/linux/swap.h
53
int n;
sys/dev/drm/include/linux/swap.h
58
for (n = 0; n < nswdev; n++) {
sys/dev/drm/include/linux/swap.h
59
sp = &swdevt[n];
sys/dev/drm/include/linux/types.h
39
#define DECLARE_BITMAP(n, bits) \
sys/dev/drm/include/linux/types.h
40
unsigned long n[howmany(bits, sizeof(long) * 8)]
sys/dev/drm/include/uapi/drm/drm_mode.h
399
#define DRM_MODE_PROP_TYPE(n) ((n) << 6)
sys/dev/drm/linux_rcu.c
134
int n;
sys/dev/drm/linux_rcu.c
144
n = rcu->s;
sys/dev/drm/linux_rcu.c
145
while (n != rcu->e) {
sys/dev/drm/linux_rcu.c
146
nelms[n & nmask] = oelms[n & rcu->mask];
sys/dev/drm/linux_rcu.c
147
++n;
sys/dev/drm/linux_vmalloc.c
136
kvmalloc_array(size_t n, size_t size, gfp_t flags)
sys/dev/drm/linux_vmalloc.c
138
if (n == 0)
sys/dev/drm/linux_vmalloc.c
141
if (n > SIZE_MAX / size)
sys/dev/drm/linux_vmalloc.c
144
return kmalloc(n * size, M_DRM, flags);
sys/dev/drm/radeon/atom.c
89
static void debug_print_spaces(int n)
sys/dev/drm/radeon/atom.c
91
while (n--)
sys/dev/drm/radeon/ci_dpm.c
1732
static int ci_dpm_force_state_sclk(struct radeon_device *rdev, u32 n)
sys/dev/drm/radeon/ci_dpm.c
1738
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_SCLKDPM_SetEnabledMask, 1 << n);
sys/dev/drm/radeon/ci_dpm.c
1746
static int ci_dpm_force_state_mclk(struct radeon_device *rdev, u32 n)
sys/dev/drm/radeon/ci_dpm.c
1752
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_MCLKDPM_SetEnabledMask, 1 << n);
sys/dev/drm/radeon/ci_dpm.c
176
static int ci_set_power_limit(struct radeon_device *rdev, u32 n);
sys/dev/drm/radeon/ci_dpm.c
1760
static int ci_dpm_force_state_pcie(struct radeon_device *rdev, u32 n)
sys/dev/drm/radeon/ci_dpm.c
1766
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_PCIeDPM_ForceLevel, n);
sys/dev/drm/radeon/ci_dpm.c
1774
static int ci_set_power_limit(struct radeon_device *rdev, u32 n)
sys/dev/drm/radeon/ci_dpm.c
1780
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_PkgPwrSetLimit, n);
sys/dev/drm/radeon/cikd.h
1682
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/drm/radeon/cikd.h
1684
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/cikd.h
1691
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/drm/radeon/cikd.h
1693
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/cikd.h
1695
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/drm/radeon/evergreend.h
1416
#define DMA_PACKET(cmd, sub_cmd, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/evergreend.h
1418
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/evergreend.h
1534
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/drm/radeon/evergreend.h
1536
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/evergreend.h
1543
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/drm/radeon/evergreend.h
1545
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/ni_dpm.c
1395
u64 tmp, n, d;
sys/dev/drm/radeon/ni_dpm.c
1420
n = ((u64)near_tdp_limit * ((u64)std_vddc_med * (u64)std_vddc_med) * 90);
sys/dev/drm/radeon/ni_dpm.c
1422
tmp = div64_u64(n, d);
sys/dev/drm/radeon/nid.h
1148
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/drm/radeon/nid.h
1150
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/nid.h
1157
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/drm/radeon/nid.h
1159
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/nid.h
1337
#define DMA_PACKET(cmd, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/nid.h
1340
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/nid.h
1342
#define DMA_IB_PACKET(cmd, vmid, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/nid.h
1344
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/nid.h
1346
#define DMA_PTE_PDE_PACKET(n) ((2 << 28) | \
sys/dev/drm/radeon/nid.h
1349
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/r100.c
1377
const unsigned *auth, unsigned n,
sys/dev/drm/radeon/r100.c
1392
if ((reg >> 7) > n) {
sys/dev/drm/radeon/r100.c
1396
if (((reg + (pkt->count << 2)) >> 7) > n) {
sys/dev/drm/radeon/r100.c
2479
static int r100_rbbm_fifo_wait_for_entry(struct radeon_device *rdev, unsigned n)
sys/dev/drm/radeon/r100.c
2486
if (tmp >= n) {
sys/dev/drm/radeon/r100d.h
59
#define PACKET0(reg, n) (CP_PACKET0 | \
sys/dev/drm/radeon/r100d.h
61
REG_SET(PACKET0_COUNT, (n)))
sys/dev/drm/radeon/r100d.h
63
#define PACKET3(op, n) (CP_PACKET3 | \
sys/dev/drm/radeon/r100d.h
65
REG_SET(PACKET3_COUNT, (n)))
sys/dev/drm/radeon/r300d.h
60
#define PACKET0(reg, n) (CP_PACKET0 | \
sys/dev/drm/radeon/r300d.h
62
REG_SET(PACKET0_COUNT, (n)))
sys/dev/drm/radeon/r300d.h
64
#define PACKET3(op, n) (CP_PACKET3 | \
sys/dev/drm/radeon/r300d.h
66
REG_SET(PACKET3_COUNT, (n)))
sys/dev/drm/radeon/r600d.h
1584
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/drm/radeon/r600d.h
1586
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/r600d.h
1587
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/drm/radeon/r600d.h
1589
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/r600d.h
645
#define DMA_PACKET(cmd, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/r600d.h
648
(((n) & 0xFFFF) << 0))
sys/dev/drm/radeon/radeon.h
3009
unsigned n);
sys/dev/drm/radeon/radeon_acpi.c
150
static void radeon_atif_parse_notification(struct radeon_atif_notifications *n, u32 mask)
sys/dev/drm/radeon/radeon_acpi.c
152
n->display_switch = mask & ATIF_DISPLAY_SWITCH_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
153
n->expansion_mode_change = mask & ATIF_EXPANSION_MODE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
154
n->thermal_state = mask & ATIF_THERMAL_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
155
n->forced_power_state = mask & ATIF_FORCED_POWER_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
156
n->system_power_state = mask & ATIF_SYSTEM_POWER_SOURCE_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
157
n->display_conf_change = mask & ATIF_DISPLAY_CONF_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
158
n->px_gfx_switch = mask & ATIF_PX_GFX_SWITCH_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
159
n->brightness_change = mask & ATIF_PANEL_BRIGHTNESS_CHANGE_REQUEST_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
160
n->dgpu_display_event = mask & ATIF_DGPU_DISPLAY_EVENT_SUPPORTED;
sys/dev/drm/radeon/radeon_acpi.c
246
struct radeon_atif_notification_cfg *n)
sys/dev/drm/radeon/radeon_acpi.c
274
n->enabled = false;
sys/dev/drm/radeon/radeon_acpi.c
275
n->command_code = 0;
sys/dev/drm/radeon/radeon_acpi.c
277
n->enabled = true;
sys/dev/drm/radeon/radeon_acpi.c
278
n->command_code = 0x81;
sys/dev/drm/radeon/radeon_acpi.c
284
n->enabled = true;
sys/dev/drm/radeon/radeon_acpi.c
285
n->command_code = params.command_code;
sys/dev/drm/radeon/radeon_acpi.c
290
(n->enabled ? "enabled" : "disabled"),
sys/dev/drm/radeon/radeon_acpi.c
291
n->command_code);
sys/dev/drm/radeon/radeon_asic.h
126
const unsigned *auth, unsigned n,
sys/dev/drm/radeon/radeon_audio.c
561
int n, cts;
sys/dev/drm/radeon/radeon_audio.c
565
n = 128 * freq;
sys/dev/drm/radeon/radeon_audio.c
569
div = gcd(n, cts);
sys/dev/drm/radeon/radeon_audio.c
571
n /= div;
sys/dev/drm/radeon/radeon_audio.c
578
mul = ((128*freq/1000) + (n-1))/n;
sys/dev/drm/radeon/radeon_audio.c
580
n *= mul;
sys/dev/drm/radeon/radeon_audio.c
584
if (n < (128*freq/1500))
sys/dev/drm/radeon/radeon_audio.c
586
if (n > (128*freq/300))
sys/dev/drm/radeon/radeon_audio.c
589
*N = n;
sys/dev/drm/radeon/radeon_benchmark.c
124
RADEON_BENCHMARK_COPY_DMA, n,
sys/dev/drm/radeon/radeon_benchmark.c
129
radeon_benchmark_log_results(n, size, time,
sys/dev/drm/radeon/radeon_benchmark.c
135
RADEON_BENCHMARK_COPY_BLIT, n,
sys/dev/drm/radeon/radeon_benchmark.c
140
radeon_benchmark_log_results(n, size, time,
sys/dev/drm/radeon/radeon_benchmark.c
37
int flag, int n,
sys/dev/drm/radeon/radeon_benchmark.c
46
for (i = 0; i < n; i++) {
sys/dev/drm/radeon/radeon_benchmark.c
75
static void radeon_benchmark_log_results(int n, unsigned size,
sys/dev/drm/radeon/radeon_benchmark.c
80
unsigned int throughput = (n * (size >> 10)) / time;
sys/dev/drm/radeon/radeon_benchmark.c
83
kind, n, size >> 10, sdomain, ddomain, time,
sys/dev/drm/radeon/radeon_benchmark.c
93
int r, n;
sys/dev/drm/radeon/radeon_benchmark.c
96
n = RADEON_BENCHMARK_ITERATIONS;
sys/dev/drm/radeon/radeon_combios.c
1332
int i, n;
sys/dev/drm/radeon/radeon_combios.c
1341
n = RBIOS8(tmds_info + 5) + 1;
sys/dev/drm/radeon/radeon_combios.c
1342
if (n > 4)
sys/dev/drm/radeon/radeon_combios.c
1343
n = 4;
sys/dev/drm/radeon/radeon_combios.c
1344
for (i = 0; i < n; i++) {
sys/dev/drm/radeon/radeon_combios.c
1355
n = RBIOS8(tmds_info + 5) + 1;
sys/dev/drm/radeon/radeon_combios.c
1356
if (n > 4)
sys/dev/drm/radeon/radeon_combios.c
1357
n = 4;
sys/dev/drm/radeon/radeon_combios.c
1358
for (i = 0; i < n; i++) {
sys/dev/drm/radeon/radeon_display.c
1094
static inline uint32_t radeon_div(uint64_t n, uint32_t d)
sys/dev/drm/radeon/radeon_display.c
1098
n += d / 2;
sys/dev/drm/radeon/radeon_display.c
1100
mod = do_div(n, d);
sys/dev/drm/radeon/radeon_display.c
1101
return n;
sys/dev/drm/radeon/radeon_i2c.c
241
u8 n, m, loop;
sys/dev/drm/radeon/radeon_i2c.c
263
n = loop - 1;
sys/dev/drm/radeon/radeon_i2c.c
265
prescale = m | (n << 8);
sys/dev/drm/radeon/radeon_irq_kms.c
572
bool enable, const char *name, unsigned n)
sys/dev/drm/radeon/radeon_irq_kms.c
581
DRM_DEBUG("%s%d interrupts enabled\n", name, n);
sys/dev/drm/radeon/radeon_irq_kms.c
584
DRM_DEBUG("%s%d interrupts disabled\n", name, n);
sys/dev/drm/radeon/radeon_legacy_tv.c
549
uint32_t m, n, p;
sys/dev/drm/radeon/radeon_legacy_tv.c
694
n = NTSC_TV_PLL_N_27;
sys/dev/drm/radeon/radeon_legacy_tv.c
698
n = NTSC_TV_PLL_N_14;
sys/dev/drm/radeon/radeon_legacy_tv.c
704
n = PAL_TV_PLL_N_27;
sys/dev/drm/radeon/radeon_legacy_tv.c
708
n = PAL_TV_PLL_N_14;
sys/dev/drm/radeon/radeon_legacy_tv.c
715
((n & RADEON_TV_N0LO_MASK) << RADEON_TV_N0LO_SHIFT) |
sys/dev/drm/radeon/radeon_legacy_tv.c
716
(((n >> 9) & RADEON_TV_N0HI_MASK) << RADEON_TV_N0HI_SHIFT) |
sys/dev/drm/radeon/radeon_object.c
431
struct radeon_bo *bo, *n;
sys/dev/drm/radeon/radeon_object.c
437
list_for_each_entry_safe(bo, n, &rdev->gem.objects, list) {
sys/dev/drm/radeon/radeon_pm.c
148
struct radeon_bo *bo, *n;
sys/dev/drm/radeon/radeon_pm.c
153
list_for_each_entry_safe(bo, n, &rdev->gem.objects, list) {
sys/dev/drm/radeon/radeon_test.c
39
unsigned n, size;
sys/dev/drm/radeon/radeon_test.c
59
n = rdev->mc.gtt_size - rdev->gart_pin_size;
sys/dev/drm/radeon/radeon_test.c
60
n /= size;
sys/dev/drm/radeon/radeon_test.c
62
gtt_obj = kzalloc(n * sizeof(*gtt_obj), GFP_KERNEL);
sys/dev/drm/radeon/radeon_test.c
64
DRM_ERROR("Failed to allocate %d pointers\n", n);
sys/dev/drm/radeon/radeon_test.c
83
for (i = 0; i < n; i++) {
sys/dev/drm/radeon/rv515d.h
200
#define PACKET0(reg, n) (CP_PACKET0 | \
sys/dev/drm/radeon/rv515d.h
202
REG_SET(PACKET0_COUNT, (n)))
sys/dev/drm/radeon/rv515d.h
204
#define PACKET3(op, n) (CP_PACKET3 | \
sys/dev/drm/radeon/rv515d.h
206
REG_SET(PACKET3_COUNT, (n)))
sys/dev/drm/radeon/rv770d.h
663
#define DMA_PACKET(cmd, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/rv770d.h
666
(((n) & 0xFFFF) << 0))
sys/dev/drm/radeon/rv770d.h
985
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/drm/radeon/rv770d.h
987
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/rv770d.h
988
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/drm/radeon/rv770d.h
990
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/si_dpm.c
2260
u64 pwr_efficiency_ratio, n, d;
sys/dev/drm/radeon/si_dpm.c
2265
n = div64_u64((u64)1024 * curr_vddc * curr_vddc * ((u64)1000 + margin), (u64)1000);
sys/dev/drm/radeon/si_dpm.c
2267
pwr_efficiency_ratio = div64_u64(n, d);
sys/dev/drm/radeon/sid.h
1586
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/drm/radeon/sid.h
1588
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/sid.h
1595
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/drm/radeon/sid.h
1597
((n) & 0x3FFF) << 16)
sys/dev/drm/radeon/sid.h
1599
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/drm/radeon/sid.h
1853
#define DMA_PACKET(cmd, b, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/sid.h
1857
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/sid.h
1859
#define DMA_IB_PACKET(cmd, vmid, n) ((((cmd) & 0xF) << 28) | \
sys/dev/drm/radeon/sid.h
1861
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/sid.h
1863
#define DMA_PTE_PDE_PACKET(n) ((2 << 28) | \
sys/dev/drm/radeon/sid.h
1866
(((n) & 0xFFFFF) << 0))
sys/dev/drm/radeon/sumo_dpm.c
1599
u32 n = 0;
sys/dev/drm/radeon/sumo_dpm.c
1604
sclk_voltage_mapping_table->entries[n].sclk_frequency =
sys/dev/drm/radeon/sumo_dpm.c
1606
sclk_voltage_mapping_table->entries[n].vid_2bit =
sys/dev/drm/radeon/sumo_dpm.c
1609
n++;
sys/dev/drm/radeon/sumo_dpm.c
1613
sclk_voltage_mapping_table->num_max_dpm_entries = n;
sys/dev/drm/radeon/trinity_dpm.h
125
int trinity_dpm_force_state(struct radeon_device *rdev, u32 n);
sys/dev/drm/radeon/trinity_dpm.h
126
int trinity_dpm_n_levels_disabled(struct radeon_device *rdev, u32 n);
sys/dev/drm/radeon/trinity_smc.c
74
int trinity_dpm_force_state(struct radeon_device *rdev, u32 n)
sys/dev/drm/radeon/trinity_smc.c
76
WREG32_SMC(SMU_SCRATCH0, n);
sys/dev/drm/radeon/trinity_smc.c
81
int trinity_dpm_n_levels_disabled(struct radeon_device *rdev, u32 n)
sys/dev/drm/radeon/trinity_smc.c
83
WREG32_SMC(SMU_SCRATCH0, n);
sys/dev/drm/ttm/ttm_page_alloc_dma.c
553
const char *n[] = {"wc", "uc", "cached", " dma32", "huge"};
sys/dev/drm/ttm/ttm_page_alloc_dma.c
605
"%s", n[i]);
sys/dev/misc/cuse/cuse.c
1035
int n;
sys/dev/misc/cuse/cuse.c
1040
for (match = n = 0; n != CUSE_DEVICES_MAX; n++) {
sys/dev/misc/cuse/cuse.c
1041
if (cuse_alloc_unit[n] != NULL) {
sys/dev/misc/cuse/cuse.c
1042
if ((cuse_alloc_unit_id[n] ^ id) & CUSE_ID_MASK)
sys/dev/misc/cuse/cuse.c
1044
if ((cuse_alloc_unit_id[n] & ~CUSE_ID_MASK) == x) {
sys/dev/misc/cuse/cuse.c
1053
for (n = 0; n != CUSE_DEVICES_MAX; n++) {
sys/dev/misc/cuse/cuse.c
1054
if (cuse_alloc_unit[n] == NULL) {
sys/dev/misc/cuse/cuse.c
1055
cuse_alloc_unit[n] = pcs;
sys/dev/misc/cuse/cuse.c
1056
cuse_alloc_unit_id[n] = id | x;
sys/dev/misc/cuse/cuse.c
1089
int n;
sys/dev/misc/cuse/cuse.c
1092
for (n = 0; n != CUSE_DEVICES_MAX; n++) {
sys/dev/misc/cuse/cuse.c
1093
if (cuse_alloc_unit[n] == pcs) {
sys/dev/misc/cuse/cuse.c
1094
if (cuse_alloc_unit_id[n] == id || id == -1) {
sys/dev/misc/cuse/cuse.c
1095
cuse_alloc_unit[n] = NULL;
sys/dev/misc/cuse/cuse.c
1096
cuse_alloc_unit_id[n] = 0;
sys/dev/misc/cuse/cuse.c
1126
int n;
sys/dev/misc/cuse/cuse.c
1175
n = cuse_alloc_unit_by_id_locked(pcs,
sys/dev/misc/cuse/cuse.c
1179
if (n < 0)
sys/dev/misc/cuse/cuse.c
1182
*(int *)data = n;
sys/dev/misc/cuse/cuse.c
1187
n = *(int *)data;
sys/dev/misc/cuse/cuse.c
1189
n = (n & CUSE_ID_MASK);
sys/dev/misc/cuse/cuse.c
1192
n = cuse_alloc_unit_by_id_locked(pcs, n);
sys/dev/misc/cuse/cuse.c
1195
if (n < 0)
sys/dev/misc/cuse/cuse.c
1198
*(int *)data = n;
sys/dev/misc/cuse/cuse.c
1203
n = *(int *)data;
sys/dev/misc/cuse/cuse.c
1205
n = CUSE_ID_DEFAULT(n);
sys/dev/misc/cuse/cuse.c
1208
error = cuse_free_unit_by_id_locked(pcs, n);
sys/dev/misc/cuse/cuse.c
1214
n = *(int *)data;
sys/dev/misc/cuse/cuse.c
1217
error = cuse_free_unit_by_id_locked(pcs, n);
sys/dev/misc/cuse/cuse.c
1253
n = pccmd->got_signal;
sys/dev/misc/cuse/cuse.c
1256
n = 0;
sys/dev/misc/cuse/cuse.c
1260
*(int *)data = n;
sys/dev/misc/cuse/cuse.c
1271
for (n = 0; n != CUSE_CMD_MAX; n++) {
sys/dev/misc/cuse/cuse.c
1272
pcc->cmds[n].sub.per_file_handle = *(uintptr_t *)data;
sys/dev/misc/cuse/cuse.c
1474
int n;
sys/dev/misc/cuse/cuse.c
1483
for (n = 0; n != CUSE_CMD_MAX; n++) {
sys/dev/misc/cuse/cuse.c
1484
pccmd = &pcc->cmds[n];
sys/dev/misc/cuse/cuse.c
1507
int n;
sys/dev/misc/cuse/cuse.c
1545
for (n = 0; n != CUSE_CMD_MAX; n++) {
sys/dev/misc/cuse/cuse.c
1546
pccmd = &pcc->cmds[n];
sys/dev/misc/cuse/cuse.c
1549
pccmd->sub.command = n;
sys/dev/misc/cuse/cuse.c
368
int n;
sys/dev/misc/cuse/cuse.c
376
for (n = 0; n != CUSE_CMD_MAX; n++) {
sys/dev/misc/cuse/cuse.c
377
if (pcc->cmds[n].entered == td)
sys/dev/misc/cuse/cuse.c
378
return (&pcc->cmds[n]);
sys/dev/misc/cuse/cuse.c
539
uint32_t n;
sys/dev/misc/cuse/cuse.c
547
for (n = 0; n != CUSE_CMD_MAX; n++) {
sys/dev/misc/cuse/cuse.c
548
pccmd = &pcc->cmds[n];
sys/dev/misc/evdev/evdev_mt.c
248
evdev_mt_matching(int *matrix, int m, int n, int *buffer)
sys/dev/misc/evdev/evdev_mt.c
256
int *c2r = cs + n; /* column-to-row assignments in cs */
sys/dev/misc/evdev/evdev_mt.c
257
int *cd = c2r + n; /* column deltas (reduction) */
sys/dev/misc/evdev/evdev_mt.c
263
for (col = 0; col < n; col++) {
sys/dev/misc/evdev/evdev_mt.c
265
for (i = 0, p = matrix + col; i < m; i++, p += n) {
sys/dev/misc/evdev/evdev_mt.c
281
mc[row] -= n;
sys/dev/misc/evdev/evdev_mt.c
283
for (i = 0, p = matrix; i < m; i++, p += n)
sys/dev/misc/evdev/evdev_mt.c
306
j = mc[row] + n;
sys/dev/misc/evdev/evdev_mt.c
324
int i, j, m, n, dx, dy, slot, num_touches;
sys/dev/misc/evdev/evdev_mt.c
344
n = size;
sys/dev/misc/evdev/evdev_mt.c
353
n = num_touches;
sys/dev/misc/evdev/evdev_mt.c
355
evdev_mt_matching(mt->matrix, m, n, p);
sys/dev/misc/evdev/evdev_mt.c
363
p = (n == size ? c2r : r2c);
sys/dev/misc/evdev/evdev_mt.c
368
p = (n == size ? r2c : c2r);
sys/dev/misc/lpt/lpt.c
731
unsigned n;
sys/dev/misc/lpt/lpt.c
761
while ((n = (unsigned)szmin(BUFSIZE, uio->uio_resid)) != 0) {
sys/dev/misc/lpt/lpt.c
763
uiomove(sc->sc_cp, (size_t)n, uio);
sys/dev/misc/lpt/lpt.c
764
sc->sc_xfercnt = n;
sys/dev/misc/musycc/musycc.c
769
u_int32_t u, u1, n, c;
sys/dev/misc/musycc/musycc.c
777
n = u >> 16;
sys/dev/misc/musycc/musycc.c
781
kprintf("%s: IRQ: %08x n = %d c = %d\n", csc->serial[0].nodename, u, n, c);
sys/dev/misc/musycc/musycc.c
783
j = (n + i) % NIQD;
sys/dev/misc/nmdm/nmdm.c
114
nmdminit(int n)
sys/dev/misc/nmdm/nmdm.c
123
if (n & ~0x7f)
sys/dev/misc/nmdm/nmdm.c
127
pt->part1.dev = dev1 = make_dev(&nmdm_ops, n << 1,
sys/dev/misc/nmdm/nmdm.c
128
0, 0, 0666, "nmdm%dA", n);
sys/dev/misc/nmdm/nmdm.c
129
pt->part2.dev = dev2 = make_dev(&nmdm_ops, (n << 1) + 1,
sys/dev/misc/nmdm/nmdm.c
130
0, 0, 0666, "nmdm%dB", n);
sys/dev/misc/nmdm/nmdm.c
56
static void nmdminit (int n);
sys/dev/misc/snp/snp.c
126
static int snp_in (struct snoop *snp, char *buf, int n);
sys/dev/misc/snp/snp.c
259
int error, len, n, nblen;
sys/dev/misc/snp/snp.c
291
n = snp->snp_len;
sys/dev/misc/snp/snp.c
304
if ((snp->snp_flags & SNOOP_OFLOW) && (n < snp->snp_len)) {
sys/dev/misc/snp/snp.c
328
snp_in(struct snoop *snp, char *buf, int n)
sys/dev/misc/snp/snp.c
335
KASSERT(n >= 0, ("negative snoop char count"));
sys/dev/misc/snp/snp.c
337
if (n == 0)
sys/dev/misc/snp/snp.c
360
if (n > s_free) {
sys/dev/misc/snp/snp.c
362
while ((n > s_free) && ((nblen * 2) <= SNOOP_MAXLEN)) {
sys/dev/misc/snp/snp.c
366
if ((n <= s_free) && (nbuf = kmalloc(nblen, M_SNP, M_NOWAIT))) {
sys/dev/misc/snp/snp.c
381
if (n > s_tail) {
sys/dev/misc/snp/snp.c
389
bcopy(buf, to, n);
sys/dev/misc/snp/snp.c
390
snp->snp_len += n;
sys/dev/misc/snp/snp.c
398
return (n);
sys/dev/misc/syscons/scterm-sc.c
182
int i, n;
sys/dev/misc/syscons/scterm-sc.c
275
n = tcp->param[0];
sys/dev/misc/syscons/scterm-sc.c
276
if (n < 1)
sys/dev/misc/syscons/scterm-sc.c
277
n = 1;
sys/dev/misc/syscons/scterm-sc.c
278
sc_move_cursor(scp, 0, scp->ypos + n);
sys/dev/misc/syscons/scterm-sc.c
282
n = tcp->param[0];
sys/dev/misc/syscons/scterm-sc.c
283
if (n < 1)
sys/dev/misc/syscons/scterm-sc.c
284
n = 1;
sys/dev/misc/syscons/scterm-sc.c
285
sc_move_cursor(scp, 0, scp->ypos - n);
sys/dev/misc/syscons/scterm-sc.c
299
n = 0;
sys/dev/misc/syscons/scterm-sc.c
301
n = tcp->param[0];
sys/dev/misc/syscons/scterm-sc.c
302
sc_term_clr_eos(scp, n, sc->scr_map[0x20],
sys/dev/misc/syscons/scterm-sc.c
308
n = 0;
sys/dev/misc/syscons/scterm-sc.c
310
n = tcp->param[0];
sys/dev/misc/syscons/scterm-sc.c
311
sc_term_clr_eol(scp, n, sc->scr_map[0x20],
sys/dev/misc/syscons/scterm-sc.c
346
n = tcp->param[0];
sys/dev/misc/syscons/scterm-sc.c
347
if (n < 1)
sys/dev/misc/syscons/scterm-sc.c
348
n = 1;
sys/dev/misc/syscons/scterm-sc.c
349
if (n > scp->xsize - scp->xpos)
sys/dev/misc/syscons/scterm-sc.c
350
n = scp->xsize - scp->xpos;
sys/dev/misc/syscons/scterm-sc.c
351
sc_vtb_erase(&scp->vtb, scp->cursor_pos, n,
sys/dev/misc/syscons/scterm-sc.c
354
mark_for_update(scp, scp->cursor_pos + n - 1);
sys/dev/misc/syscons/scterm-sc.c
385
switch (n = tcp->param[i]) {
sys/dev/misc/syscons/scterm-sc.c
427
tcp->cur_color.fg = ansi_col[n - 30];
sys/dev/misc/syscons/scterm-sc.c
439
tcp->cur_color.bg = ansi_col[n - 40];
sys/dev/misc/syscons/scterm-sc.c
464
n = 0;
sys/dev/misc/syscons/scterm-sc.c
466
n = tcp->param[0];
sys/dev/misc/syscons/scterm-sc.c
467
switch (n) {
sys/dev/misc/syscons/sctermvar.h
100
n = scp->xsize - scp->xpos;
sys/dev/misc/syscons/sctermvar.h
101
count = scp->xsize - (scp->xpos + n);
sys/dev/misc/syscons/sctermvar.h
102
sc_vtb_move(&scp->vtb, scp->cursor_pos, scp->cursor_pos + n, count);
sys/dev/misc/syscons/sctermvar.h
103
sc_vtb_erase(&scp->vtb, scp->cursor_pos, n, ch, attr);
sys/dev/misc/syscons/sctermvar.h
105
mark_for_update(scp, scp->cursor_pos + n + count - 1);
sys/dev/misc/syscons/sctermvar.h
109
sc_term_del_char(scr_stat *scp, int n, int ch, int attr)
sys/dev/misc/syscons/sctermvar.h
113
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
114
n = 1;
sys/dev/misc/syscons/sctermvar.h
115
if (n > scp->xsize - scp->xpos)
sys/dev/misc/syscons/sctermvar.h
116
n = scp->xsize - scp->xpos;
sys/dev/misc/syscons/sctermvar.h
117
count = scp->xsize - (scp->xpos + n);
sys/dev/misc/syscons/sctermvar.h
118
sc_vtb_move(&scp->vtb, scp->cursor_pos + n, scp->cursor_pos, count);
sys/dev/misc/syscons/sctermvar.h
119
sc_vtb_erase(&scp->vtb, scp->cursor_pos + count, n, ch, attr);
sys/dev/misc/syscons/sctermvar.h
121
mark_for_update(scp, scp->cursor_pos + n + count - 1);
sys/dev/misc/syscons/sctermvar.h
125
sc_term_col(scr_stat *scp, int n)
sys/dev/misc/syscons/sctermvar.h
127
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
128
n = 1;
sys/dev/misc/syscons/sctermvar.h
129
sc_move_cursor(scp, n - 1, scp->ypos);
sys/dev/misc/syscons/sctermvar.h
133
sc_term_row(scr_stat *scp, int n)
sys/dev/misc/syscons/sctermvar.h
135
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
136
n = 1;
sys/dev/misc/syscons/sctermvar.h
137
sc_move_cursor(scp, scp->xpos, n - 1);
sys/dev/misc/syscons/sctermvar.h
141
sc_term_up(scr_stat *scp, int n, int head)
sys/dev/misc/syscons/sctermvar.h
143
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
144
n = 1;
sys/dev/misc/syscons/sctermvar.h
145
n = imin(n, scp->ypos - head);
sys/dev/misc/syscons/sctermvar.h
146
if (n <= 0)
sys/dev/misc/syscons/sctermvar.h
148
sc_move_cursor(scp, scp->xpos, scp->ypos - n);
sys/dev/misc/syscons/sctermvar.h
152
sc_term_down(scr_stat *scp, int n, int tail)
sys/dev/misc/syscons/sctermvar.h
156
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
157
n = 1;
sys/dev/misc/syscons/sctermvar.h
158
n = imin(n, tail - scp->ypos - 1);
sys/dev/misc/syscons/sctermvar.h
159
if (n <= 0)
sys/dev/misc/syscons/sctermvar.h
161
sc_move_cursor(scp, scp->xpos, scp->ypos + n);
sys/dev/misc/syscons/sctermvar.h
165
sc_term_left(scr_stat *scp, int n)
sys/dev/misc/syscons/sctermvar.h
167
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
168
n = 1;
sys/dev/misc/syscons/sctermvar.h
169
sc_move_cursor(scp, scp->xpos - n, scp->ypos);
sys/dev/misc/syscons/sctermvar.h
173
sc_term_right(scr_stat *scp, int n)
sys/dev/misc/syscons/sctermvar.h
175
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
176
n = 1;
sys/dev/misc/syscons/sctermvar.h
177
sc_move_cursor(scp, scp->xpos + n, scp->ypos);
sys/dev/misc/syscons/sctermvar.h
181
sc_term_up_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail)
sys/dev/misc/syscons/sctermvar.h
185
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
186
n = 1;
sys/dev/misc/syscons/sctermvar.h
187
if (n <= scp->ypos - head) {
sys/dev/misc/syscons/sctermvar.h
188
sc_move_cursor(scp, scp->xpos, scp->ypos - n);
sys/dev/misc/syscons/sctermvar.h
190
sc_term_ins_line(scp, head, n - (scp->ypos - head),
sys/dev/misc/syscons/sctermvar.h
197
sc_term_down_scroll(scr_stat *scp, int n, int ch, int attr, int head, int tail)
sys/dev/misc/syscons/sctermvar.h
201
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
202
n = 1;
sys/dev/misc/syscons/sctermvar.h
203
if (n < tail - scp->ypos) {
sys/dev/misc/syscons/sctermvar.h
204
sc_move_cursor(scp, scp->xpos, scp->ypos + n);
sys/dev/misc/syscons/sctermvar.h
206
sc_term_del_line(scp, head, n - (tail - scp->ypos) + 1,
sys/dev/misc/syscons/sctermvar.h
213
sc_term_clr_eos(scr_stat *scp, int n, int ch, int attr)
sys/dev/misc/syscons/sctermvar.h
215
switch (n) {
sys/dev/misc/syscons/sctermvar.h
240
sc_term_clr_eol(scr_stat *scp, int n, int ch, int attr)
sys/dev/misc/syscons/sctermvar.h
242
switch (n) {
sys/dev/misc/syscons/sctermvar.h
266
sc_term_tab(scr_stat *scp, int n)
sys/dev/misc/syscons/sctermvar.h
271
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
272
n = 1;
sys/dev/misc/syscons/sctermvar.h
273
i = (scp->xpos & ~7) + 8*n;
sys/dev/misc/syscons/sctermvar.h
289
sc_term_backtab(scr_stat *scp, int n)
sys/dev/misc/syscons/sctermvar.h
293
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
294
n = 1;
sys/dev/misc/syscons/sctermvar.h
296
i -= 8*n;
sys/dev/misc/syscons/sctermvar.h
298
i -= 8*(n - 1);
sys/dev/misc/syscons/sctermvar.h
37
static __inline void sc_term_ins_line(scr_stat *scp, int y, int n, int ch,
sys/dev/misc/syscons/sctermvar.h
39
static __inline void sc_term_del_line(scr_stat *scp, int y, int n, int ch,
sys/dev/misc/syscons/sctermvar.h
41
static __inline void sc_term_ins_char(scr_stat *scp, int n, int ch,
sys/dev/misc/syscons/sctermvar.h
43
static __inline void sc_term_del_char(scr_stat *scp, int n, int ch,
sys/dev/misc/syscons/sctermvar.h
45
static __inline void sc_term_col(scr_stat *scp, int n);
sys/dev/misc/syscons/sctermvar.h
46
static __inline void sc_term_row(scr_stat *scp, int n);
sys/dev/misc/syscons/sctermvar.h
47
static __inline void sc_term_up(scr_stat *scp, int n, int head);
sys/dev/misc/syscons/sctermvar.h
48
static __inline void sc_term_down(scr_stat *scp, int n, int tail);
sys/dev/misc/syscons/sctermvar.h
49
static __inline void sc_term_left(scr_stat *scp, int n);
sys/dev/misc/syscons/sctermvar.h
50
static __inline void sc_term_right(scr_stat *scp, int n);
sys/dev/misc/syscons/sctermvar.h
51
static __inline void sc_term_up_scroll(scr_stat *scp, int n, int ch,
sys/dev/misc/syscons/sctermvar.h
53
static __inline void sc_term_down_scroll(scr_stat *scp, int n, int ch,
sys/dev/misc/syscons/sctermvar.h
55
static __inline void sc_term_clr_eos(scr_stat *scp, int n, int ch, int attr);
sys/dev/misc/syscons/sctermvar.h
56
static __inline void sc_term_clr_eol(scr_stat *scp, int n, int ch, int attr);
sys/dev/misc/syscons/sctermvar.h
57
static __inline void sc_term_tab(scr_stat *scp, int n);
sys/dev/misc/syscons/sctermvar.h
58
static __inline void sc_term_backtab(scr_stat *scp, int n);
sys/dev/misc/syscons/sctermvar.h
65
sc_term_ins_line(scr_stat *scp, int y, int n, int ch, int attr, int tail)
sys/dev/misc/syscons/sctermvar.h
69
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
70
n = 1;
sys/dev/misc/syscons/sctermvar.h
71
if (n > tail - y)
sys/dev/misc/syscons/sctermvar.h
72
n = tail - y;
sys/dev/misc/syscons/sctermvar.h
73
sc_vtb_ins(&scp->vtb, y*scp->xsize, n*scp->xsize, ch, attr);
sys/dev/misc/syscons/sctermvar.h
79
sc_term_del_line(scr_stat *scp, int y, int n, int ch, int attr, int tail)
sys/dev/misc/syscons/sctermvar.h
83
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
84
n = 1;
sys/dev/misc/syscons/sctermvar.h
85
if (n > tail - y)
sys/dev/misc/syscons/sctermvar.h
86
n = tail - y;
sys/dev/misc/syscons/sctermvar.h
87
sc_vtb_delete(&scp->vtb, y*scp->xsize, n*scp->xsize, ch, attr);
sys/dev/misc/syscons/sctermvar.h
93
sc_term_ins_char(scr_stat *scp, int n, int ch, int attr)
sys/dev/misc/syscons/sctermvar.h
97
if (n < 1)
sys/dev/misc/syscons/sctermvar.h
98
n = 1;
sys/dev/misc/syscons/sctermvar.h
99
if (n > scp->xsize - scp->xpos)
sys/dev/misc/syscons/scvtb.c
58
size_t n;
sys/dev/misc/syscons/scvtb.c
70
for (n = 0; n < count; ++n)
sys/dev/misc/syscons/scvtb.c
71
dw[n] = sw[n];
sys/dev/misc/syscons/scvtb.c
73
*(uint8_t *)(dw + n) = *(uint8_t *)(sw + n);
sys/dev/misc/syscons/warp/warp_saver.c
68
int i, j, k, n;
sys/dev/misc/syscons/warp/warp_saver.c
70
for (i = 1, k = 0, n = SPP*8; i < 5; i++, n /= 2)
sys/dev/misc/syscons/warp/warp_saver.c
71
for (j = 0; j < n; j++, k++) {
sys/dev/netif/alc/if_alc.c
1647
#define ALC_SYSCTL_STAT_ADD32(c, h, n, p, d) \
sys/dev/netif/alc/if_alc.c
1648
SYSCTL_ADD_UINT(c, h, OID_AUTO, n, CTLFLAG_RD, p, 0, d)
sys/dev/netif/alc/if_alc.c
1649
#define ALC_SYSCTL_STAT_ADD64(c, h, n, p, d) \
sys/dev/netif/alc/if_alc.c
1650
SYSCTL_ADD_QUAD(c, h, OID_AUTO, n, CTLFLAG_RD, p, 0, d)
sys/dev/netif/ale/if_ale.c
687
#define ALE_SYSCTL_STAT_ADD32(c, h, n, p, d) \
sys/dev/netif/ale/if_ale.c
688
SYSCTL_ADD_UINT(c, h, OID_AUTO, n, CTLFLAG_RD, p, 0, d)
sys/dev/netif/ale/if_ale.c
689
#define ALE_SYSCTL_STAT_ADD64(c, h, n, p, d) \
sys/dev/netif/ale/if_ale.c
690
SYSCTL_ADD_QUAD(c, h, OID_AUTO, n, CTLFLAG_RD, p, 0, d)
sys/dev/netif/ath/ath/if_ath_debug.c
149
int i, n;
sys/dev/netif/ath/ath/if_ath_debug.c
161
n = ((bf->bf_nseg - 1) / 4) + 1;
sys/dev/netif/ath/ath/if_ath_debug.c
164
i < n;
sys/dev/netif/ath/ath/if_ath_keycache.c
102
for (i = 0, n = hk->kv_len; i < n; i++)
sys/dev/netif/ath/ath/if_ath_keycache.c
99
int i, n;
sys/dev/netif/ath/ath/if_ath_tx.c
147
int i, n;
sys/dev/netif/ath/ath/if_ath_tx.c
157
n = ((bf->bf_nseg - 1) / sc->sc_tx_nmaps) + 1;
sys/dev/netif/ath/ath/if_ath_tx.c
159
i < n;
sys/dev/netif/ath/ath_hal/ah.c
256
ath_hal_reverseBits(uint32_t val, uint32_t n)
sys/dev/netif/ath/ath_hal/ah.c
261
for (i = 0, retval = 0; i < n; i++) {
sys/dev/netif/ath/ath_hal/ah.c
276
#define HT_LTF(n) ((n) * 4)
sys/dev/netif/ath/ath_hal/ah_eeprom_v1.h
49
#define AR_EEPROM_ATHEROS(n) (AR_EEPROM_ATHEROS_BASE+(n))
sys/dev/netif/ath/ath_hal/ah_internal.h
615
extern uint32_t ath_hal_reverseBits(uint32_t val, uint32_t n);
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
106
#define AR_KEYTABLE(n) (AR_KEYTABLE_0 + ((n)*32))
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
281
#define AR_GPIOCR_IN(n) (0<<((n)*2)) /* input-only */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
282
#define AR_GPIOCR_OUT0(n) (1<<((n)*2)) /* output-only if GPIODO = 0 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
283
#define AR_GPIOCR_OUT1(n) (2<<((n)*2)) /* output-only if GPIODO = 1 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
284
#define AR_GPIOCR_OUT(n) (3<<((n)*2)) /* always output */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
285
#define AR_GPIOCR_ALL(n) (3<<((n)*2)) /* all bits for pin */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
286
#define AR_GPIOCR_INT_SEL(n) ((n)<<12) /* GPIO interrupt pin select */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
400
#define AR_KEYTABLE_KEY0(n) (AR_KEYTABLE(n) + 0) /* key bit 0-31 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
401
#define AR_KEYTABLE_KEY1(n) (AR_KEYTABLE(n) + 4) /* key bit 32-47 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
402
#define AR_KEYTABLE_KEY2(n) (AR_KEYTABLE(n) + 8) /* key bit 48-79 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
403
#define AR_KEYTABLE_KEY3(n) (AR_KEYTABLE(n) + 12) /* key bit 80-95 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
404
#define AR_KEYTABLE_KEY4(n) (AR_KEYTABLE(n) + 16) /* key bit 96-127 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
405
#define AR_KEYTABLE_TYPE(n) (AR_KEYTABLE(n) + 20) /* key type */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
409
#define AR_KEYTABLE_MAC0(n) (AR_KEYTABLE(n) + 24) /* MAC address 1-32 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
410
#define AR_KEYTABLE_MAC1(n) (AR_KEYTABLE(n) + 28) /* MAC address 33-47 */
sys/dev/netif/ath/ath_hal/ar5210/ar5210reg.h
64
#define AR_EP_AIR(n) (AR_EP_AIR_BASE + (n)*4)
sys/dev/netif/ath/ath_hal/ar5211/ar5211_xmit.c
456
uint32_t n;
sys/dev/netif/ath/ath_hal/ar5211/ar5211_xmit.c
461
n = OS_REG_READ(ah, AR_QSTS(q)) & AR_Q_STS_PEND_FR_CNT_M;
sys/dev/netif/ath/ath_hal/ar5211/ar5211_xmit.c
467
if (n == 0 && (OS_REG_READ(ah, AR_Q_TXE) & (1<<q)))
sys/dev/netif/ath/ath_hal/ar5211/ar5211_xmit.c
468
n = 1; /* arbitrarily pick 1 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211_xmit.c
469
return n;
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
271
#define AR_KEYTABLE(n) (AR_KEYTABLE_0 + ((n)*32))
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
849
#define AR_KEYTABLE_KEY0(n) (AR_KEYTABLE(n) + 0) /* key bit 0-31 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
850
#define AR_KEYTABLE_KEY1(n) (AR_KEYTABLE(n) + 4) /* key bit 32-47 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
851
#define AR_KEYTABLE_KEY2(n) (AR_KEYTABLE(n) + 8) /* key bit 48-79 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
852
#define AR_KEYTABLE_KEY3(n) (AR_KEYTABLE(n) + 12) /* key bit 80-95 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
853
#define AR_KEYTABLE_KEY4(n) (AR_KEYTABLE(n) + 16) /* key bit 96-127 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
854
#define AR_KEYTABLE_TYPE(n) (AR_KEYTABLE(n) + 20) /* key type */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
860
#define AR_KEYTABLE_MAC0(n) (AR_KEYTABLE(n) + 24) /* MAC address 1-32 */
sys/dev/netif/ath/ath_hal/ar5211/ar5211reg.h
861
#define AR_KEYTABLE_MAC1(n) (AR_KEYTABLE(n) + 28) /* MAC address 33-47 */
sys/dev/netif/bge/if_bge.c
5022
struct mbuf *n;
sys/dev/netif/bge/if_bge.c
5033
for (n = m, found = 0; n != NULL; n = n->m_next) {
sys/dev/netif/bge/if_bge.c
5034
if (n->m_len < 8) {
sys/dev/netif/bge/if_bge.c
5044
n = m_defrag(m, M_NOWAIT);
sys/dev/netif/bge/if_bge.c
5046
n = m;
sys/dev/netif/bge/if_bge.c
5047
return n;
sys/dev/netif/bnx/if_bnx.c
5043
struct mbuf *n;
sys/dev/netif/bnx/if_bnx.c
5054
for (n = m, found = 0; n != NULL; n = n->m_next) {
sys/dev/netif/bnx/if_bnx.c
5055
if (n->m_len < 8) {
sys/dev/netif/bnx/if_bnx.c
5065
n = m_defrag(m, M_NOWAIT);
sys/dev/netif/bnx/if_bnx.c
5067
n = m;
sys/dev/netif/bnx/if_bnx.c
5068
return n;
sys/dev/netif/bwn/bwn/if_bwn.c
5919
if (rxhdr->phy.n.power0 == 16 || rxhdr->phy.n.power0 == 32)
sys/dev/netif/bwn/bwn/if_bwn.c
5920
rssi = max(rxhdr->phy.n.power1, rxhdr->ps2.n.power2);
sys/dev/netif/bwn/bwn/if_bwn.c
5922
rssi = max(rxhdr->phy.n.power0, rxhdr->phy.n.power1);
sys/dev/netif/bwn/bwn/if_bwn.c
5927
rxhdr->phy.n.power0,
sys/dev/netif/bwn/bwn/if_bwn.c
5928
rxhdr->phy.n.power1,
sys/dev/netif/bwn/bwn/if_bwn.c
5929
rxhdr->ps2.n.power2);
sys/dev/netif/bwn/bwn/if_bwn.c
6514
bwn_antenna_sanitize(struct bwn_mac *mac, uint8_t n)
sys/dev/netif/bwn/bwn/if_bwn.c
6519
if (n == 0)
sys/dev/netif/bwn/bwn/if_bwn.c
6525
if (!(mask & (1 << (n - 1))))
sys/dev/netif/bwn/bwn/if_bwn.c
6527
return (n);
sys/dev/netif/bwn/bwn/if_bwnvar.h
139
#define BWN_DMA_BIT_MASK(n) (((n) == 64) ? ~0ULL : ((1ULL<<(n))-1))
sys/dev/netif/bwn/bwn/if_bwnvar.h
261
} __packed n;
sys/dev/netif/bwn/bwn/if_bwnvar.h
267
} __packed n;
sys/dev/netif/de/dc21040reg.h
578
#define TULIP_SROM_2114X_CMDBITS(n) (((n) & 0x0071) << 18)
sys/dev/netif/et/if_et.c
1316
int n;
sys/dev/netif/et/if_et.c
1318
for (n = 0; n < ET_RX_NRING; ++n) {
sys/dev/netif/et/if_et.c
1319
struct et_rxbuf_data *rbd = &sc->sc_rx_data[n];
sys/dev/netif/et/if_et.c
1320
struct et_rxdesc_ring *rx_ring = &sc->sc_rx_ring[n];
sys/dev/netif/et/if_et.c
1479
int n;
sys/dev/netif/et/if_et.c
1481
for (n = 0; n < ET_RX_NRING; ++n) {
sys/dev/netif/et/if_et.c
1482
struct et_rxbuf_data *rbd = &sc->sc_rx_data[n];
sys/dev/netif/et/if_et.c
1489
"newbuf failed: %d\n", n, i, error);
sys/dev/netif/iwi/if_iwi.c
110
#define DPRINTFN(n, x) do { if (iwi_debug >= (n)) kprintf x; } while (0)
sys/dev/netif/iwi/if_iwi.c
1181
int n;
sys/dev/netif/iwi/if_iwi.c
1200
for (n = 7; n >= 0; n--) {
sys/dev/netif/iwi/if_iwi.c
1202
(((addr >> n) & 1) << IWI_EEPROM_SHIFT_D));
sys/dev/netif/iwi/if_iwi.c
1204
(((addr >> n) & 1) << IWI_EEPROM_SHIFT_D) | IWI_EEPROM_C);
sys/dev/netif/iwi/if_iwi.c
1211
for (n = 15; n >= 0; n--) {
sys/dev/netif/iwi/if_iwi.c
1215
val |= ((tmp & IWI_EEPROM_Q) >> IWI_EEPROM_SHIFT_Q) << n;
sys/dev/netif/iwi/if_iwi.c
123
#define DPRINTFN(n, x)
sys/dev/netif/iwm/if_iwmreg.h
5738
#define IWM_SCAN_CONFIG_N_CHANNELS(n) ((n) << 26)
sys/dev/netif/iwn/if_iwn.c
2456
iwn_read_eeprom_band(struct iwn_softc *sc, int n, int maxchans, int *nchans,
sys/dev/netif/iwn/if_iwn.c
2459
struct iwn_eeprom_chan *channels = sc->eeprom_channels[n];
sys/dev/netif/iwn/if_iwn.c
2460
const struct iwn_chan_band *band = &iwn_bands[n];
sys/dev/netif/iwn/if_iwn.c
2468
if (n == 0) {
sys/dev/netif/iwn/if_iwn.c
2509
iwn_read_eeprom_ht40(struct iwn_softc *sc, int n, int maxchans, int *nchans,
sys/dev/netif/iwn/if_iwn.c
2512
struct iwn_eeprom_chan *channels = sc->eeprom_channels[n];
sys/dev/netif/iwn/if_iwn.c
2513
const struct iwn_chan_band *band = &iwn_bands[n];
sys/dev/netif/iwn/if_iwn.c
2535
nflags |= (n == 5 ? IEEE80211_CHAN_G : IEEE80211_CHAN_A);
sys/dev/netif/iwn/if_iwn.c
2567
iwn_read_eeprom_channels(struct iwn_softc *sc, int n, uint32_t addr)
sys/dev/netif/iwn/if_iwn.c
2571
iwn_read_prom_data(sc, addr, &sc->eeprom_channels[n],
sys/dev/netif/iwn/if_iwn.c
2572
iwn_bands[n].nchan * sizeof (struct iwn_eeprom_chan));
sys/dev/netif/iwn/if_iwn.c
2574
if (n < 5) {
sys/dev/netif/iwn/if_iwn.c
2575
iwn_read_eeprom_band(sc, n, IEEE80211_CHAN_MAX, &ic->ic_nchans,
sys/dev/netif/iwn/if_iwn.c
2578
iwn_read_eeprom_ht40(sc, n, IEEE80211_CHAN_MAX, &ic->ic_nchans,
sys/dev/netif/iwn/if_iwn.c
5633
#define fdivround(a, b, n) \
sys/dev/netif/iwn/if_iwn.c
5634
((((1 << n) * (a)) / (b) + (1 << n) / 2) / (1 << n))
sys/dev/netif/iwn/if_iwn.c
5636
#define interpolate(x, x1, y1, x2, y2, n) \
sys/dev/netif/iwn/if_iwn.c
5637
((y1) + fdivround(((int)(x) - (x1)) * ((y2) - (y1)), (x2) - (x1), n))
sys/dev/netif/ix/ixgbe_82599.c
1447
u32 n = (_n); \
sys/dev/netif/ix/ixgbe_82599.c
1448
if (IXGBE_ATR_COMMON_HASH_KEY & (0x01 << n)) \
sys/dev/netif/ix/ixgbe_82599.c
1449
common_hash ^= lo_hash_dword >> n; \
sys/dev/netif/ix/ixgbe_82599.c
1450
else if (IXGBE_ATR_BUCKET_HASH_KEY & (0x01 << n)) \
sys/dev/netif/ix/ixgbe_82599.c
1451
bucket_hash ^= lo_hash_dword >> n; \
sys/dev/netif/ix/ixgbe_82599.c
1452
else if (IXGBE_ATR_SIGNATURE_HASH_KEY & (0x01 << n)) \
sys/dev/netif/ix/ixgbe_82599.c
1453
sig_hash ^= lo_hash_dword << (16 - n); \
sys/dev/netif/ix/ixgbe_82599.c
1454
if (IXGBE_ATR_COMMON_HASH_KEY & (0x01 << (n + 16))) \
sys/dev/netif/ix/ixgbe_82599.c
1455
common_hash ^= hi_hash_dword >> n; \
sys/dev/netif/ix/ixgbe_82599.c
1456
else if (IXGBE_ATR_BUCKET_HASH_KEY & (0x01 << (n + 16))) \
sys/dev/netif/ix/ixgbe_82599.c
1457
bucket_hash ^= hi_hash_dword >> n; \
sys/dev/netif/ix/ixgbe_82599.c
1458
else if (IXGBE_ATR_SIGNATURE_HASH_KEY & (0x01 << (n + 16))) \
sys/dev/netif/ix/ixgbe_82599.c
1459
sig_hash ^= hi_hash_dword << (16 - n); \
sys/dev/netif/ix/ixgbe_82599.c
1595
u32 n = (_n); \
sys/dev/netif/ix/ixgbe_82599.c
1596
if (IXGBE_ATR_BUCKET_HASH_KEY & (0x01 << n)) \
sys/dev/netif/ix/ixgbe_82599.c
1597
bucket_hash ^= lo_hash_dword >> n; \
sys/dev/netif/ix/ixgbe_82599.c
1598
if (IXGBE_ATR_BUCKET_HASH_KEY & (0x01 << (n + 16))) \
sys/dev/netif/ix/ixgbe_82599.c
1599
bucket_hash ^= hi_hash_dword >> n; \
sys/dev/netif/mxge/mxge_mcp.h
178
#define MXGEFW_ETH_SEND(n) (0x200000 + (((n) & 0x03) * 0x40000))
sys/dev/netif/mxge/mxge_mcp.h
179
#define MXGEFW_ETH_SEND_OFFSET(n) (MXGEFW_ETH_SEND(n) - MXGEFW_ETH_SEND_4)
sys/dev/netif/nfe/if_nfe.c
369
const struct nfe_dev *n;
sys/dev/netif/nfe/if_nfe.c
374
for (n = nfe_devices; n->desc != NULL; ++n) {
sys/dev/netif/nfe/if_nfe.c
375
if (vid == n->vid && did == n->did) {
sys/dev/netif/nfe/if_nfe.c
451
device_set_desc(dev, n->desc);
sys/dev/netif/oce/oce_if.h
201
#define upper_32_bits(n) ((uint32_t)(((n) >> 16) >> 16))
sys/dev/netif/oce/oce_if.h
294
#define RING_GET(ring, n) \
sys/dev/netif/oce/oce_if.h
295
ring->cidx = GET_Q_NEXT(ring->cidx, n, ring->num_items)
sys/dev/netif/oce/oce_if.h
296
#define RING_PUT(ring, n) \
sys/dev/netif/oce/oce_if.h
297
ring->pidx = GET_Q_NEXT(ring->pidx, n, ring->num_items)
sys/dev/netif/ral/rt2560.c
82
#define DPRINTFN(sc, n, fmt, ...) do { \
sys/dev/netif/ral/rt2560.c
83
if (sc->sc_debug >= (n)) \
sys/dev/netif/ral/rt2560.c
846
int n;
sys/dev/netif/ral/rt2560.c
866
n = (RAL_READ(sc, RT2560_CSR21) & RT2560_93C46) ? 5 : 7;
sys/dev/netif/ral/rt2560.c
867
for (; n >= 0; n--) {
sys/dev/netif/ral/rt2560.c
869
(((addr >> n) & 1) << RT2560_SHIFT_D));
sys/dev/netif/ral/rt2560.c
871
(((addr >> n) & 1) << RT2560_SHIFT_D) | RT2560_C);
sys/dev/netif/ral/rt2560.c
878
for (n = 15; n >= 0; n--) {
sys/dev/netif/ral/rt2560.c
88
#define DPRINTFN(sc, n, fmt, ...)
sys/dev/netif/ral/rt2560.c
881
val |= ((tmp & RT2560_Q) >> RT2560_SHIFT_Q) << n;
sys/dev/netif/ral/rt2661.c
79
#define DPRINTFN(sc, n, fmt, ...) do { \
sys/dev/netif/ral/rt2661.c
80
if (sc->sc_debug >= (n)) \
sys/dev/netif/ral/rt2661.c
838
int n;
sys/dev/netif/ral/rt2661.c
85
#define DPRINTFN(sc, n, fmt, ...)
sys/dev/netif/ral/rt2661.c
858
n = (RAL_READ(sc, RT2661_E2PROM_CSR) & RT2661_93C46) ? 5 : 7;
sys/dev/netif/ral/rt2661.c
859
for (; n >= 0; n--) {
sys/dev/netif/ral/rt2661.c
861
(((addr >> n) & 1) << RT2661_SHIFT_D));
sys/dev/netif/ral/rt2661.c
863
(((addr >> n) & 1) << RT2661_SHIFT_D) | RT2661_C);
sys/dev/netif/ral/rt2661.c
870
for (n = 15; n >= 0; n--) {
sys/dev/netif/ral/rt2661.c
873
val |= ((tmp & RT2661_Q) >> RT2661_SHIFT_Q) << n;
sys/dev/netif/ral/rt2860.c
1051
int n;
sys/dev/netif/ral/rt2860.c
1071
n = ((RAL_READ(sc, RT2860_PCI_EECTRL) & 0x30) == 0) ? 5 : 7;
sys/dev/netif/ral/rt2860.c
1072
for (; n >= 0; n--) {
sys/dev/netif/ral/rt2860.c
1074
(((addr >> n) & 1) << RT2860_SHIFT_D));
sys/dev/netif/ral/rt2860.c
1076
(((addr >> n) & 1) << RT2860_SHIFT_D) | RT2860_C);
sys/dev/netif/ral/rt2860.c
1083
for (n = 15; n >= 0; n--) {
sys/dev/netif/ral/rt2860.c
1086
val |= ((tmp & RT2860_Q) >> RT2860_SHIFT_Q) << n;
sys/dev/netif/ral/rt2860.c
216
uint8_t n, r, k;
sys/dev/netif/ral/rt2860.c
2560
rt3090_rf_write(sc, 2, rt3090_freqs[i].n);
sys/dev/netif/ral/rt2860.c
2625
rt3090_rf_write(sc, 8, rt3090_freqs[i].n);
sys/dev/netif/ral/rt2860.c
76
#define DPRINTFN(n, x) do { if (sc->sc_debug >= (n)) kprintf x; } while (0)
sys/dev/netif/ral/rt2860.c
79
#define DPRINTFN(n, x)
sys/dev/netif/sis/if_sis.c
221
sis_reverse(uint16_t n)
sys/dev/netif/sis/if_sis.c
223
n = ((n >> 1) & 0x5555) | ((n << 1) & 0xaaaa);
sys/dev/netif/sis/if_sis.c
224
n = ((n >> 2) & 0x3333) | ((n << 2) & 0xcccc);
sys/dev/netif/sis/if_sis.c
225
n = ((n >> 4) & 0x0f0f) | ((n << 4) & 0xf0f0);
sys/dev/netif/sis/if_sis.c
226
n = ((n >> 8) & 0x00ff) | ((n << 8) & 0xff00);
sys/dev/netif/sis/if_sis.c
228
return(n);
sys/dev/netif/sis/if_sis.c
815
uint32_t h, i, n, ctl;
sys/dev/netif/sis/if_sis.c
822
n = 16;
sys/dev/netif/sis/if_sis.c
824
n = 8;
sys/dev/netif/sis/if_sis.c
835
for (i = 0; i < n; i++)
sys/dev/netif/sis/if_sis.c
838
for (i = 0; i < n; i++)
sys/dev/netif/sis/if_sis.c
849
if (i > n) {
sys/dev/netif/sis/if_sis.c
851
for (i = 0; i < n; i++)
sys/dev/netif/sis/if_sis.c
856
for (i = 0; i < n; i++) {
sys/dev/netif/sk/if_sk.c
239
#define DPRINTFN(n,x) if (skdebug >= (n)) kprintf x
sys/dev/netif/sk/if_sk.c
247
#define DPRINTFN(n,x)
sys/dev/netif/stge/if_stge.c
1521
struct mbuf *n;
sys/dev/netif/stge/if_stge.c
1523
n = NULL;
sys/dev/netif/stge/if_stge.c
1527
n = m;
sys/dev/netif/stge/if_stge.c
1529
MGETHDR(n, M_NOWAIT, MT_DATA);
sys/dev/netif/stge/if_stge.c
1530
if (n != NULL) {
sys/dev/netif/stge/if_stge.c
1531
bcopy(m->m_data, n->m_data, ETHER_HDR_LEN);
sys/dev/netif/stge/if_stge.c
1534
n->m_len = ETHER_HDR_LEN;
sys/dev/netif/stge/if_stge.c
1535
M_MOVE_PKTHDR(n, m);
sys/dev/netif/stge/if_stge.c
1536
n->m_next = m;
sys/dev/netif/stge/if_stge.c
1541
return (n);
sys/dev/netif/vge/if_vge.c
1107
struct mbuf *n = NULL;
sys/dev/netif/vge/if_vge.c
1111
n = m_getcl(M_NOWAIT, MT_DATA, M_PKTHDR);
sys/dev/netif/vge/if_vge.c
1112
if (n == NULL)
sys/dev/netif/vge/if_vge.c
1114
m = n;
sys/dev/netif/vge/if_vge.c
1146
if (n != NULL)
sys/dev/netif/vge/if_vge.c
1147
m_freem(n);
sys/dev/netif/wi/if_wi.c
1565
int n;
sys/dev/netif/wi/if_wi.c
1574
n = 0;
sys/dev/netif/wi/if_wi.c
1588
if (n >= 16)
sys/dev/netif/wi/if_wi.c
1590
IEEE80211_ADDR_COPY(&mlist.wi_mcast[n],
sys/dev/netif/wi/if_wi.c
1592
n++;
sys/dev/netif/wi/if_wi.c
1601
IEEE80211_ADDR_LEN * n);
sys/dev/netif/wpi/if_wpi.c
1449
wpi_read_eeprom_band(struct wpi_softc *sc, uint8_t n, int maxchans,
sys/dev/netif/wpi/if_wpi.c
1452
struct wpi_eeprom_chan *channels = sc->eeprom_channels[n];
sys/dev/netif/wpi/if_wpi.c
1453
const struct wpi_chan_band *band = &wpi_bands[n];
sys/dev/netif/wpi/if_wpi.c
1461
if (n == 0) {
sys/dev/netif/wpi/if_wpi.c
1471
band->chan[i],n);
sys/dev/netif/wpi/if_wpi.c
1496
wpi_read_eeprom_channels(struct wpi_softc *sc, uint8_t n)
sys/dev/netif/wpi/if_wpi.c
1499
const struct wpi_chan_band *band = &wpi_bands[n];
sys/dev/netif/wpi/if_wpi.c
1504
error = wpi_read_prom_data(sc, band->addr, &sc->eeprom_channels[n],
sys/dev/netif/wpi/if_wpi.c
1511
wpi_read_eeprom_band(sc, n, IEEE80211_CHAN_MAX, &ic->ic_nchans,
sys/dev/netif/wpi/if_wpi.c
1574
wpi_read_eeprom_group(struct wpi_softc *sc, uint8_t n)
sys/dev/netif/wpi/if_wpi.c
1576
struct wpi_power_group *group = &sc->groups[n];
sys/dev/netif/wpi/if_wpi.c
1582
if ((error = wpi_read_prom_data(sc, WPI_EEPROM_POWER_GRP + n * 32,
sys/dev/netif/wpi/if_wpi.c
1595
"power group %d: chan=%d maxpwr=%d temp=%d\n", n, group->chan,
sys/dev/netif/wpi/if_wpi.c
3778
#define fdivround(a, b, n) \
sys/dev/netif/wpi/if_wpi.c
3779
((((1 << n) * (a)) / (b) + (1 << n) / 2) / (1 << n))
sys/dev/netif/wpi/if_wpi.c
3782
#define interpolate(x, x1, y1, x2, y2, n) \
sys/dev/netif/wpi/if_wpi.c
3783
((y1) + fdivround(((x) - (x1)) * ((y2) - (y1)), (x2) - (x1), n))
sys/dev/powermng/aps/aps.c
184
int bp, stat, n;
sys/dev/powermng/aps/aps.c
190
for (n = 0; n < 100; n++) {
sys/dev/powermng/aps/aps.c
203
if (n == 100) {
sys/dev/powermng/aps/aps.c
213
for (n = 1, bp = 2; n < 16; bp <<= 1, n++) {
sys/dev/powermng/aps/aps.c
215
bus_space_write_1(iot, ioh, APS_TWR_BASE + n, buf[n]);
sys/dev/powermng/aps/aps.c
216
DPRINTF(("aps_do_io: write %2d 0x%02x\n", n, buf[n]));
sys/dev/powermng/aps/aps.c
220
for (n = 0; n < 100; n++) {
sys/dev/powermng/aps/aps.c
227
if (n == 100) {
sys/dev/powermng/aps/aps.c
236
for (n = 0, bp = 1; n < 16; bp <<= 1, n++) {
sys/dev/powermng/aps/aps.c
238
buf[n] = bus_space_read_1(iot, ioh, APS_TWR_BASE + n);
sys/dev/powermng/aps/aps.c
239
DPRINTF(("aps_do_io: read %2d 0x%02x\n", n, buf[n]));
sys/dev/powermng/it/it.c
207
it_setup_volt(struct it_softc *sc, int start, int n)
sys/dev/powermng/it/it.c
211
for (i = 0; i < n; ++i) {
sys/dev/powermng/it/it.c
236
it_setup_temp(struct it_softc *sc, int start, int n)
sys/dev/powermng/it/it.c
240
for (i = 0; i < n; ++i)
sys/dev/powermng/it/it.c
245
it_setup_fan(struct it_softc *sc, int start, int n)
sys/dev/powermng/it/it.c
249
for (i = 0; i < n; ++i)
sys/dev/powermng/lm/lm78.c
667
lm_refresh_volt(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
669
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
672
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
674
sensor->value *= sc->lm_sensors[n].rfact;
sys/dev/powermng/lm/lm78.c
679
lm_refresh_temp(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
681
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
688
sdata = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
701
lm_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
703
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
713
if (sc->lm_sensors[n].reg == LM_FAN1 ||
sys/dev/powermng/lm/lm78.c
714
sc->lm_sensors[n].reg == LM_FAN2) {
sys/dev/powermng/lm/lm78.c
716
if (sc->lm_sensors[n].reg == LM_FAN1)
sys/dev/powermng/lm/lm78.c
722
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
753
wb_w83637hf_refresh_vcore(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
755
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
758
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
773
wb_refresh_nvolt(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
775
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
778
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
780
sensor->value *= sc->lm_sensors[n].rfact;
sys/dev/powermng/lm/lm78.c
786
wb_w83627ehf_refresh_nvolt(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
788
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
791
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
799
wb_refresh_temp(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
801
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
811
sdata = sc->lm_readreg(sc, sc->lm_sensors[n].reg) << 1;
sys/dev/powermng/lm/lm78.c
812
sdata += sc->lm_readreg(sc, sc->lm_sensors[n].reg + 1) >> 7;
sys/dev/powermng/lm/lm78.c
825
wb_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
827
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
835
if (sc->lm_sensors[n].reg == LM_FAN1 ||
sys/dev/powermng/lm/lm78.c
836
sc->lm_sensors[n].reg == LM_FAN2 ||
sys/dev/powermng/lm/lm78.c
837
sc->lm_sensors[n].reg == LM_FAN3) {
sys/dev/powermng/lm/lm78.c
839
fan = (sc->lm_sensors[n].reg - LM_FAN1);
sys/dev/powermng/lm/lm78.c
844
if (sc->lm_sensors[n].reg == LM_FAN1 ||
sys/dev/powermng/lm/lm78.c
845
sc->lm_sensors[n].reg == LM_FAN2) {
sys/dev/powermng/lm/lm78.c
847
if (sc->lm_sensors[n].reg == LM_FAN1)
sys/dev/powermng/lm/lm78.c
851
} else if (sc->lm_sensors[n].reg == LM_FAN3) {
sys/dev/powermng/lm/lm78.c
854
} else if (sc->lm_sensors[n].reg == WB_BANK0_FAN4 ||
sys/dev/powermng/lm/lm78.c
855
sc->lm_sensors[n].reg == WB_BANK0_FAN5) {
sys/dev/powermng/lm/lm78.c
857
if (sc->lm_sensors[n].reg == WB_BANK0_FAN4)
sys/dev/powermng/lm/lm78.c
863
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
874
wb_w83792d_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
876
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
879
switch (sc->lm_sensors[n].reg) {
sys/dev/powermng/lm/lm78.c
906
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
919
wb_nct6776f_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
921
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
924
datah = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/powermng/lm/lm78.c
925
datal = sc->lm_readreg(sc, sc->lm_sensors[n].reg + 1);
sys/dev/powermng/lm/lm78.c
937
as_refresh_temp(struct lm_softc *sc, int n)
sys/dev/powermng/lm/lm78.c
939
struct ksensor *sensor = &sc->sensors[n];
sys/dev/powermng/lm/lm78.c
946
sdata = sc->lm_readreg(sc, sc->lm_sensors[n].reg) << 1;
sys/dev/powermng/lm/lm78.c
947
sdata += sc->lm_readreg(sc, sc->lm_sensors[n].reg + 1) >> 7;
sys/dev/powermng/powernow/powernow.c
141
int i , j, n;
sys/dev/powermng/powernow/powernow.c
143
for (n = 0, i = 0; i < cstate->n_states; i++) {
sys/dev/powermng/powernow/powernow.c
152
j = n;
sys/dev/powermng/powernow/powernow.c
161
n++;
sys/dev/powermng/uguru/uguru.c
1017
uguru_ac5_read_sensor(struct uguru_softc *sc, int n)
sys/dev/powermng/uguru/uguru.c
1023
reg = sc->uguru_sensors[n].reg | 0x0880;
sys/dev/powermng/uguru/uguru.c
908
uguru_refresh_temp(struct uguru_softc *sc, int n)
sys/dev/powermng/uguru/uguru.c
910
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/powermng/uguru/uguru.c
914
ret = sc->read(sc, n);
sys/dev/powermng/uguru/uguru.c
935
uguru_refresh_volt(struct uguru_softc *sc, int n)
sys/dev/powermng/uguru/uguru.c
939
if (sc->read(sc, n))
sys/dev/powermng/uguru/uguru.c
946
sc->sc_sensors[n].value =
sys/dev/powermng/uguru/uguru.c
947
sc->cs.reading * sc->uguru_sensors[n].rfact;
sys/dev/powermng/uguru/uguru.c
948
sc->sc_sensors[n].status = status;
sys/dev/powermng/uguru/uguru.c
952
uguru_refresh_fan(struct uguru_softc *sc, int n)
sys/dev/powermng/uguru/uguru.c
954
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/powermng/uguru/uguru.c
957
ret = sc->read(sc, n);
sys/dev/powermng/uguru/uguru.c
976
uguru_read_sensor(struct uguru_softc *sc, int n)
sys/dev/powermng/uguru/uguru.c
978
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/powermng/uguru/uguru.c
981
uint8_t reg = sc->uguru_sensors[n].reg;
sys/dev/raid/amr/amrreg.h
389
struct amr_notify n;
sys/dev/raid/hpt27xx/list.h
121
#define list_for_each_safe(pos, n, head) \
sys/dev/raid/hpt27xx/list.h
122
for (pos = (head)->next, n = pos->next; pos != (head); \
sys/dev/raid/hpt27xx/list.h
123
pos = n, n = pos->next)
sys/dev/raid/hptrr/list.h
123
#define list_for_each_safe(pos, n, head) \
sys/dev/raid/hptrr/list.h
124
for (pos = (head)->next, n = pos->next; pos != (head); \
sys/dev/raid/hptrr/list.h
125
pos = n, n = pos->next)
sys/dev/smbus/atmel_mxt/atmel_mxt.c
657
size_t n;
sys/dev/smbus/atmel_mxt/atmel_mxt.c
737
n = uio->uio_resid;
sys/dev/smbus/atmel_mxt/atmel_mxt.c
738
if (n > sizeof(pkt))
sys/dev/smbus/atmel_mxt/atmel_mxt.c
739
n = sizeof(pkt);
sys/dev/smbus/atmel_mxt/atmel_mxt.c
740
error = uiomove((void *)&pkt, n, uio);
sys/dev/smbus/atmel_mxt/atmel_mxt.c
754
size_t n;
sys/dev/smbus/atmel_mxt/atmel_mxt.c
760
n = uio->uio_resid;
sys/dev/smbus/atmel_mxt/atmel_mxt.c
761
if (n > sizeof(pkt))
sys/dev/smbus/atmel_mxt/atmel_mxt.c
762
n = sizeof(pkt);
sys/dev/smbus/atmel_mxt/atmel_mxt.c
763
error = uiomove((void *)&pkt, n, uio);
sys/dev/smbus/atmel_mxt/test_atmel.c
167
int n;
sys/dev/smbus/atmel_mxt/test_atmel.c
179
n = mxt_read_reg(fd, 0, &rup.info, sizeof(rup.info));
sys/dev/smbus/atmel_mxt/test_atmel.c
180
for (i = 0; i < n; ++i)
sys/dev/smbus/atmel_mxt/test_atmel.c
190
n = mxt_read_reg(fd, 0, rbuf, totsize);
sys/dev/smbus/atmel_mxt/test_atmel.c
191
if (n != totsize) {
sys/dev/smbus/atmel_mxt/test_atmel.c
192
printf("mxt_read_reg: config failed: %d/%d\n", n, totsize);
sys/dev/smbus/atmel_mxt/test_atmel.c
226
n = mxt_read_object(fd, obj, &msg, sizeof(msg));
sys/dev/smbus/atmel_mxt/test_atmel.c
229
for (i = 0; i < n; ++i)
sys/dev/smbus/cyapa/cyapa.c
1661
size_t n;
sys/dev/smbus/cyapa/cyapa.c
1663
n = CYAPA_BUFSIZE - (fifo->rindex & CYAPA_BUFMASK);
sys/dev/smbus/cyapa/cyapa.c
1664
if (n > (size_t)(fifo->windex - fifo->rindex))
sys/dev/smbus/cyapa/cyapa.c
1665
n = (size_t)(fifo->windex - fifo->rindex);
sys/dev/smbus/cyapa/cyapa.c
1666
return n;
sys/dev/smbus/cyapa/cyapa.c
1691
fifo_read(struct cyapa_fifo *fifo, size_t n)
sys/dev/smbus/cyapa/cyapa.c
1695
if (n > (CYAPA_BUFSIZE - (fifo->rindex & CYAPA_BUFMASK))) {
sys/dev/smbus/cyapa/cyapa.c
1700
fifo->rindex += n;
sys/dev/smbus/cyapa/cyapa.c
1744
size_t n;
sys/dev/smbus/cyapa/cyapa.c
1746
n = CYAPA_BUFSIZE - (fifo->windex & CYAPA_BUFMASK);
sys/dev/smbus/cyapa/cyapa.c
1747
if (n > (size_t)(CYAPA_BUFSIZE - (fifo->windex - fifo->rindex)))
sys/dev/smbus/cyapa/cyapa.c
1748
n = (size_t)(CYAPA_BUFSIZE - (fifo->windex - fifo->rindex));
sys/dev/smbus/cyapa/cyapa.c
1749
return n;
sys/dev/smbus/cyapa/cyapa.c
1754
fifo_write(struct cyapa_fifo *fifo, size_t n)
sys/dev/smbus/cyapa/cyapa.c
1759
fifo->windex += n;
sys/dev/smbus/cyapa/cyapa.c
218
static char *fifo_read(struct cyapa_fifo *fifo, size_t n);
sys/dev/smbus/cyapa/cyapa.c
219
static char *fifo_write(struct cyapa_fifo *fifo, size_t n);
sys/dev/smbus/cyapa/cyapa.c
621
size_t n;
sys/dev/smbus/cyapa/cyapa.c
758
(n = fifo_ready(&sc->rfifo)) > 0) {
sys/dev/smbus/cyapa/cyapa.c
759
if (n > uio->uio_resid)
sys/dev/smbus/cyapa/cyapa.c
760
n = uio->uio_resid;
sys/dev/smbus/cyapa/cyapa.c
766
for (v = 0; v < n; ++v)
sys/dev/smbus/cyapa/cyapa.c
771
error = uiomove(fifo_read(&sc->rfifo, 0), n, uio);
sys/dev/smbus/cyapa/cyapa.c
774
fifo_read(&sc->rfifo, n);
sys/dev/smbus/cyapa/cyapa.c
793
size_t n;
sys/dev/smbus/cyapa/cyapa.c
802
while ((n = fifo_space(&sc->wfifo)) > 0 && uio->uio_resid) {
sys/dev/smbus/cyapa/cyapa.c
803
if (n > uio->uio_resid)
sys/dev/smbus/cyapa/cyapa.c
804
n = uio->uio_resid;
sys/dev/smbus/cyapa/cyapa.c
805
error = uiomove(fifo_write(&sc->wfifo, 0), n, uio);
sys/dev/smbus/cyapa/cyapa.c
808
fifo_write(&sc->wfifo, n);
sys/dev/sound/midi/midi.c
1125
midisynth_open(void *n, void *arg, int flags)
sys/dev/sound/midi/midi.c
1127
struct snd_midi *m = ((struct synth_midi *)n)->m;
sys/dev/sound/midi/midi.c
1189
midisynth_close(void *n)
sys/dev/sound/midi/midi.c
1191
struct snd_midi *m = ((struct synth_midi *)n)->m;
sys/dev/sound/midi/midi.c
1235
midisynth_writeraw(void *n, uint8_t *buf, size_t len)
sys/dev/sound/midi/midi.c
1237
struct snd_midi *m = ((struct synth_midi *)n)->m;
sys/dev/sound/midi/midi.c
1324
midisynth_killnote(void *n, uint8_t chn, uint8_t note, uint8_t vel)
sys/dev/sound/midi/midi.c
1345
return midisynth_writeraw(n, c, 3);
sys/dev/sound/midi/midi.c
1349
midisynth_setinstr(void *n, uint8_t chn, uint16_t instr)
sys/dev/sound/midi/midi.c
1359
return midisynth_writeraw(n, c, 2);
sys/dev/sound/midi/midi.c
1363
midisynth_startnote(void *n, uint8_t chn, uint8_t note, uint8_t vel)
sys/dev/sound/midi/midi.c
1377
return midisynth_writeraw(n, c, 3);
sys/dev/sound/midi/midi.c
1380
midisynth_alloc(void *n, uint8_t chan, uint8_t note)
sys/dev/sound/midi/midi.c
1386
midisynth_controller(void *n, uint8_t chn, uint8_t ctrlnum, uint16_t val)
sys/dev/sound/midi/midi.c
1396
return midisynth_writeraw(n, c, 3);
sys/dev/sound/midi/midi.c
1400
midisynth_bender(void *n, uint8_t chn, uint16_t val)
sys/dev/sound/midi/midi.c
1412
return midisynth_writeraw(n, c, 3);
sys/dev/sound/pci/als4000.c
334
u_int32_t i, n;
sys/dev/sound/pci/als4000.c
336
n = sizeof(playback_cmds) / sizeof(playback_cmds[0]);
sys/dev/sound/pci/als4000.c
337
for (i = 0; i < n; i++) {
sys/dev/sound/pci/es137x.c
1227
unsigned int n, truncm, freq, result;
sys/dev/sound/pci/es137x.c
1235
n = rate / 3000;
sys/dev/sound/pci/es137x.c
1236
if ((1 << n) & ((1 << 15) | (1 << 13) | (1 << 11) | (1 << 9)))
sys/dev/sound/pci/es137x.c
1237
n--;
sys/dev/sound/pci/es137x.c
1238
truncm = (21 * n - 1) | 1;
sys/dev/sound/pci/es137x.c
1239
freq = ((48000UL << 15) / rate) * n;
sys/dev/sound/pci/es137x.c
1240
result = (48000UL << 15) / (freq / n);
sys/dev/sound/pci/es137x.c
1246
(((239 - truncm) >> 1) << 9) | (n << 4));
sys/dev/sound/pci/es137x.c
1251
0x8000 | (((119 - truncm) >> 1) << 9) | (n << 4));
sys/dev/sound/pci/es137x.c
1258
es1371_src_write(es, ES_SMPREG_VOL_ADC, n << 8);
sys/dev/sound/pci/es137x.c
1259
es1371_src_write(es, ES_SMPREG_VOL_ADC + 1, n << 8);
sys/dev/sound/pci/hda/hdaa.c
1332
int error, n = 0, i;
sys/dev/sound/pci/hda/hdaa.c
1339
n += ksnprintf(buf + n, sizeof(buf) - n, "%s%s",
sys/dev/sound/pci/hda/hdaa.c
1340
n != 0 ? "," : "", hdaa_quirks_tab[i].key);
sys/dev/sound/pci/hda/hdaa.c
1438
#define CONN_RESVAL(r, e, n) ((r) >> ((32 / (e)) * (n)))
sys/dev/sound/pci/hda/hdaa.c
1439
#define CONN_RANGE(r, e, n) (CONN_RESVAL(r, e, n) & CONN_RMASK(e))
sys/dev/sound/pci/hda/hdaa.c
1440
#define CONN_CNID(r, e, n) (CONN_RESVAL(r, e, n) & CONN_NMASK(e))
sys/dev/sound/pci/hda/hdaa.c
6337
int n = 0, i, numgpi;
sys/dev/sound/pci/hda/hdaa.c
6349
n += ksnprintf(buf + n, sizeof(buf) - n, "%s%d=%d",
sys/dev/sound/pci/hda/hdaa.c
6350
n != 0 ? " " : "", i, ((data >> i) & 1));
sys/dev/sound/pci/hda/hdaa.c
6361
int n = 0, i, numgpio;
sys/dev/sound/pci/hda/hdaa.c
6377
n += ksnprintf(buf + n, sizeof(buf) - n, "%s%d=",
sys/dev/sound/pci/hda/hdaa.c
6378
n != 0 ? " " : "", i);
sys/dev/sound/pci/hda/hdaa.c
6380
n += ksnprintf(buf + n, sizeof(buf) - n, "disabled");
sys/dev/sound/pci/hda/hdaa.c
6383
n += ksnprintf(buf + n, sizeof(buf) - n, "%sput(%d)",
sys/dev/sound/pci/hda/hdaa.c
6394
int error, n = 0, i, numgpio;
sys/dev/sound/pci/hda/hdaa.c
6402
n += ksnprintf(buf + n, sizeof(buf) - n, "%s%d=%s",
sys/dev/sound/pci/hda/hdaa.c
6403
n != 0 ? " " : "", i, HDA_GPIO_ACTIONS[x]);
sys/dev/sound/pci/hda/hdaa.c
6425
int n = 0, i, numgpo;
sys/dev/sound/pci/hda/hdaa.c
6437
n += ksnprintf(buf + n, sizeof(buf) - n, "%s%d=%d",
sys/dev/sound/pci/hda/hdaa.c
6438
n != 0 ? " " : "", i, ((data >> i) & 1));
sys/dev/sound/pci/hda/hdaa.c
6448
int error, n = 0, i, numgpo;
sys/dev/sound/pci/hda/hdaa.c
6456
n += ksnprintf(buf + n, sizeof(buf) - n, "%s%d=%s",
sys/dev/sound/pci/hda/hdaa.c
6457
n != 0 ? " " : "", i, HDA_GPIO_ACTIONS[x]);
sys/dev/sound/pci/hda/hdaa.h
38
#define HDAA_GPIO_SHIFT(n) (n * 3)
sys/dev/sound/pci/hda/hdaa.h
39
#define HDAA_GPIO_MASK(n) (0x7 << (n * 3))
sys/dev/sound/pci/hda/hdaa.h
40
#define HDAA_GPIO_KEEP(n) (0x0 << (n * 3))
sys/dev/sound/pci/hda/hdaa.h
41
#define HDAA_GPIO_SET(n) (0x1 << (n * 3))
sys/dev/sound/pci/hda/hdaa.h
42
#define HDAA_GPIO_CLEAR(n) (0x2 << (n * 3))
sys/dev/sound/pci/hda/hdaa.h
43
#define HDAA_GPIO_DISABLE(n) (0x3 << (n * 3))
sys/dev/sound/pci/hda/hdaa.h
44
#define HDAA_GPIO_INPUT(n) (0x4 << (n * 3))
sys/dev/sound/pci/hda/hdac_private.h
54
#define HDAC_ISDCTL(sc, n) (_HDAC_ISDCTL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
55
#define HDAC_ISDSTS(sc, n) (_HDAC_ISDSTS((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
56
#define HDAC_ISDPICB(sc, n) (_HDAC_ISDPICB((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
57
#define HDAC_ISDCBL(sc, n) (_HDAC_ISDCBL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
58
#define HDAC_ISDLVI(sc, n) (_HDAC_ISDLVI((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
59
#define HDAC_ISDFIFOD(sc, n) (_HDAC_ISDFIFOD((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
60
#define HDAC_ISDFMT(sc, n) (_HDAC_ISDFMT((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
61
#define HDAC_ISDBDPL(sc, n) (_HDAC_ISDBDPL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
62
#define HDAC_ISDBDPU(sc, n) (_HDAC_ISDBDPU((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
64
#define HDAC_OSDCTL(sc, n) (_HDAC_OSDCTL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
65
#define HDAC_OSDSTS(sc, n) (_HDAC_OSDSTS((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
66
#define HDAC_OSDPICB(sc, n) (_HDAC_OSDPICB((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
67
#define HDAC_OSDCBL(sc, n) (_HDAC_OSDCBL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
68
#define HDAC_OSDLVI(sc, n) (_HDAC_OSDLVI((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
69
#define HDAC_OSDFIFOD(sc, n) (_HDAC_OSDFIFOD((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
70
#define HDAC_OSDBDPL(sc, n) (_HDAC_OSDBDPL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
71
#define HDAC_OSDBDPU(sc, n) (_HDAC_OSDBDPU((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
73
#define HDAC_BSDCTL(sc, n) (_HDAC_BSDCTL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
74
#define HDAC_BSDSTS(sc, n) (_HDAC_BSDSTS((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
75
#define HDAC_BSDPICB(sc, n) (_HDAC_BSDPICB((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
76
#define HDAC_BSDCBL(sc, n) (_HDAC_BSDCBL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
77
#define HDAC_BSDLVI(sc, n) (_HDAC_BSDLVI((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
78
#define HDAC_BSDFIFOD(sc, n) (_HDAC_BSDFIFOD((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
79
#define HDAC_BSDBDPL(sc, n) (_HDAC_BSDBDPL((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_private.h
80
#define HDAC_BSDBDPU(sc, n) (_HDAC_BSDBDPU((n), (sc)->num_iss, (sc)->num_oss))
sys/dev/sound/pci/hda/hdac_reg.h
100
#define _HDAC_OSDBDPL(n, iss, oss) (0x18 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
101
#define _HDAC_OSDBDPU(n, iss, oss) (0x1c + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
103
#define _HDAC_BSDOFFSET(n, iss, oss) (0x80 + ((iss) * 0x20) + ((oss) * 0x20) + ((n) * 0x20))
sys/dev/sound/pci/hda/hdac_reg.h
104
#define _HDAC_BSDCTL(n, iss, oss) (0x00 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
105
#define _HDAC_BSDSTS(n, iss, oss) (0x03 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
106
#define _HDAC_BSDPICB(n, iss, oss) (0x04 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
107
#define _HDAC_BSDCBL(n, iss, oss) (0x08 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
108
#define _HDAC_BSDLVI(n, iss, oss) (0x0c + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
109
#define _HDAC_BSDFIFOD(n, iss, oss) (0x10 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
110
#define _HDAC_BSDFMT(n, iss, oss) (0x12 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
111
#define _HDAC_BSDBDPL(n, iss, oss) (0x18 + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
112
#define _HDAC_BSDBDBU(n, iss, oss) (0x1c + _HDAC_BSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
155
#define HDAC_STATESTS_SDIWAKE(statests, n) \
sys/dev/sound/pci/hda/hdac_reg.h
157
HDAC_STATESTS_SDIWAKE_SHIFT) >> (n)) & 0x0001)
sys/dev/sound/pci/hda/hdac_reg.h
81
#define _HDAC_ISDOFFSET(n, iss, oss) (0x80 + ((n) * 0x20))
sys/dev/sound/pci/hda/hdac_reg.h
82
#define _HDAC_ISDCTL(n, iss, oss) (0x00 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
83
#define _HDAC_ISDSTS(n, iss, oss) (0x03 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
84
#define _HDAC_ISDPICB(n, iss, oss) (0x04 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
85
#define _HDAC_ISDCBL(n, iss, oss) (0x08 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
86
#define _HDAC_ISDLVI(n, iss, oss) (0x0c + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
87
#define _HDAC_ISDFIFOD(n, iss, oss) (0x10 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
88
#define _HDAC_ISDFMT(n, iss, oss) (0x12 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
89
#define _HDAC_ISDBDPL(n, iss, oss) (0x18 + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
90
#define _HDAC_ISDBDPU(n, iss, oss) (0x1c + _HDAC_ISDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
92
#define _HDAC_OSDOFFSET(n, iss, oss) (0x80 + ((iss) * 0x20) + ((n) * 0x20))
sys/dev/sound/pci/hda/hdac_reg.h
93
#define _HDAC_OSDCTL(n, iss, oss) (0x00 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
94
#define _HDAC_OSDSTS(n, iss, oss) (0x03 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
95
#define _HDAC_OSDPICB(n, iss, oss) (0x04 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
96
#define _HDAC_OSDCBL(n, iss, oss) (0x08 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
97
#define _HDAC_OSDLVI(n, iss, oss) (0x0c + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
98
#define _HDAC_OSDFIFOD(n, iss, oss) (0x10 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdac_reg.h
99
#define _HDAC_OSDFMT(n, iss, oss) (0x12 + _HDAC_OSDOFFSET(n, iss, oss))
sys/dev/sound/pci/hda/hdacc.c
494
int i, n;
sys/dev/sound/pci/hda/hdacc.c
519
for (i = startnode, n = 0; i < endnode; i++, n++) {
sys/dev/sound/pci/hda/hdacc.c
520
codec->fgs[n].nid = i;
sys/dev/sound/pci/hda/hdacc.c
522
codec->fgs[n].type =
sys/dev/sound/pci/hda/hdacc.c
525
codec->fgs[n].subsystem_id = hda_command(dev,
sys/dev/sound/pci/hda/hdacc.c
528
codec->fgs[n].dev = child = device_add_child(dev, NULL, -1);
sys/dev/sound/pci/hda/hdacc.c
533
device_set_ivars(child, &codec->fgs[n]);
sys/dev/sound/pci/hdspe-pcm.c
44
uint32_t n;
sys/dev/sound/pci/hdspe-pcm.c
549
sc->ctrl_register |= hdspe_encode_latency(hl->n);
sys/dev/sound/pci/maestro.c
1073
interleave(int16_t *l, int16_t *r, int16_t *p, unsigned n)
sys/dev/sound/pci/maestro.c
1077
for (end = l + n; l < end; ) {
sys/dev/sound/pci/maestro.c
1115
mixdown(int16_t *src, int16_t *dest, unsigned n)
sys/dev/sound/pci/maestro.c
1119
for (end = dest + n; dest < end; dest++)
sys/dev/sound/pci/maestro.c
1318
adjust_pchbase(struct agg_chinfo *chans, u_int n, u_int size)
sys/dev/sound/pci/maestro.c
1325
for (i = 0; i < n; i++) {
sys/dev/sound/pci/maestro.c
1339
for (k = 1, i = 1; i < n; i++) {
sys/dev/sound/pci/maestro.c
1350
for (i = 0; i < n; i++) {
sys/dev/sound/pci/via8233.h
49
#define VIA_DXS_BASE(n) (0x10 * (n))
sys/dev/sound/pci/via8233.h
91
#define VIA_WR_BASE(n) (0x60 + (n) * 0x10)
sys/dev/sound/pci/vibes.c
129
u_int8_t n;
sys/dev/sound/pci/vibes.c
132
n = sv_direct_get(sc, reg);
sys/dev/sound/pci/vibes.c
133
if (n != val) {
sys/dev/sound/pci/vibes.c
134
device_printf(sc->dev, "sv_direct_set register 0x%02x %d != %d from line %d\n", reg, n, val, line);
sys/dev/sound/pci/vibes.c
161
u_int8_t n;
sys/dev/sound/pci/vibes.c
162
n = sv_indirect_get(sc, reg);
sys/dev/sound/pci/vibes.c
163
if (n != val) {
sys/dev/sound/pci/vibes.c
164
device_printf(sc->dev, "sv_indirect_set register 0x%02x %d != %d line %d\n", reg, n, val, line);
sys/dev/sound/pci/vibes.c
259
u_int32_t rs, re, r, best_r = 0, r2, t, n, best_n = 0;
sys/dev/sound/pci/vibes.c
280
for (n = 3; n < 34; n++) {
sys/dev/sound/pci/vibes.c
281
m = f_out * n / (SV_F_REF / r2);
sys/dev/sound/pci/vibes.c
285
f_actual = m * SV_F_REF / (n * r2);
sys/dev/sound/pci/vibes.c
294
best_n = n - 2;
sys/dev/sound/pcm/feeder.c
169
cmpdesc(struct pcm_feederdesc *n, struct pcm_feederdesc *m)
sys/dev/sound/pcm/feeder.c
171
return ((n->type == m->type) &&
sys/dev/sound/pcm/feeder.c
172
((n->in == 0) || (n->in == m->in)) &&
sys/dev/sound/pcm/feeder.c
173
((n->out == 0) || (n->out == m->out)) &&
sys/dev/sound/pcm/feeder.c
174
(n->flags == m->flags));
sys/dev/virtual/nvmm/nvmm.c
1000
for (n = 0; n < NVMM_MAX_VCPUS; n++) {
sys/dev/virtual/nvmm/nvmm.c
1001
os_mtx_destroy(&machines[i].cpus[n].lock);
sys/dev/virtual/nvmm/nvmm.c
972
size_t i, n;
sys/dev/virtual/nvmm/nvmm.c
981
for (n = 0; n < NVMM_MAX_VCPUS; n++) {
sys/dev/virtual/nvmm/nvmm.c
982
machines[i].cpus[n].present = false;
sys/dev/virtual/nvmm/nvmm.c
983
machines[i].cpus[n].cpuid = n;
sys/dev/virtual/nvmm/nvmm.c
984
os_mtx_init(&machines[i].cpus[n].lock);
sys/dev/virtual/nvmm/nvmm.c
996
size_t i, n;
sys/dev/virtual/virtio/mmio/virtio_mmio_kenv.c
145
size_t n;
sys/dev/virtual/virtio/mmio/virtio_mmio_kenv.c
152
for (n = 1; n <= 9999; n++) {
sys/dev/virtual/virtio/mmio/virtio_mmio_kenv.c
153
ksnprintf(name, sizeof(name), "hw.virtio.mmio.device_%zu", n);
sys/dev/virtual/virtio/net/if_vtnet.c
2038
struct mbuf *n;
sys/dev/virtual/virtio/net/if_vtnet.c
2042
n = m_dup(m, M_NOWAIT);
sys/dev/virtual/virtio/net/if_vtnet.c
2044
if ((m = n) == NULL)
sys/dev/virtual/virtio/virtio/virtio.c
119
int n;
sys/dev/virtual/virtio/virtio/virtio.c
130
for (n = 0, val = 1ULL << 63; val != 0; val >>= 1) {
sys/dev/virtual/virtio/virtio/virtio.c
138
if (n++ == 0)
sys/dev/virtual/virtio/virtio/virtio.c
150
if (n > 0)
sys/dev/virtual/vkernel/cdrom/vcd.c
143
int n;
sys/dev/virtual/vkernel/cdrom/vcd.c
156
n = pread(sc->fd, bp->b_data,
sys/dev/virtual/vkernel/cdrom/vcd.c
161
n = pwrite(sc->fd, bp->b_data,
sys/dev/virtual/vkernel/cdrom/vcd.c
168
if (n != bp->b_bcount) {
sys/dev/virtual/vkernel/cdrom/vcd.c
173
bp->b_resid = bp->b_bcount - n;
sys/dev/virtual/vkernel/disk/vdisk.c
306
int n;
sys/dev/virtual/vkernel/disk/vdisk.c
314
n = bp->b_bcount;
sys/dev/virtual/vkernel/disk/vdisk.c
316
n = pread(sc->fd, bp->b_data, bp->b_bcount,
sys/dev/virtual/vkernel/disk/vdisk.c
326
n = bp->b_bcount;
sys/dev/virtual/vkernel/disk/vdisk.c
328
n = pwrite(sc->fd, bp->b_data, bp->b_bcount,
sys/dev/virtual/vkernel/disk/vdisk.c
334
n = -1;
sys/dev/virtual/vkernel/disk/vdisk.c
336
n = bp->b_bcount;
sys/dev/virtual/vkernel/disk/vdisk.c
342
if (bp->b_bcount != n) {
sys/dev/virtual/vkernel/disk/vdisk.c
346
bp->b_resid = bp->b_bcount - n;
sys/dev/virtual/vkernel/net/if_vke.c
634
int n;
sys/dev/virtual/vkernel/net/if_vke.c
668
n = read(sc->sc_fd, mtod(m, void *), MCLBYTES);
sys/dev/virtual/vkernel/net/if_vke.c
669
if (n > 0) {
sys/dev/virtual/vkernel/net/if_vke.c
674
m->m_pkthdr.len = m->m_len = n;
sys/dev/virtual/vkernel/net/if_vke.c
89
#define LOW_POW_2(n) (1 << (fls(n) - 1))
sys/kern/imgact_elf.c
1734
int n;
sys/kern/imgact_elf.c
1777
for (n = 0; n < 100 && note >= note0 && note < note_end; n++) {
sys/kern/imgact_elf.c
615
int error = 0, i, n;
sys/kern/imgact_elf.c
645
n = 0;
sys/kern/imgact_elf.c
649
if (n == 0)
sys/kern/imgact_elf.c
651
n++;
sys/kern/kern_checkpoint.c
857
int n;
sys/kern/kern_checkpoint.c
865
n = 0;
sys/kern/kern_checkpoint.c
871
n = strlen(bp);
sys/kern/kern_checkpoint.c
872
bcopy(bp, temp, n + 1); /* normalize location of the path */
sys/kern/kern_checkpoint.c
873
temp[n++] = '/';
sys/kern/kern_checkpoint.c
874
temp[n] = '\0';
sys/kern/kern_checkpoint.c
876
for (i= 0; n < MAXPATHLEN && format[i]; i++) {
sys/kern/kern_checkpoint.c
883
temp[n++] = '%';
sys/kern/kern_checkpoint.c
886
if ((n + namelen) > MAXPATHLEN) {
sys/kern/kern_checkpoint.c
892
memcpy(temp+n, name, namelen);
sys/kern/kern_checkpoint.c
893
n += namelen;
sys/kern/kern_checkpoint.c
897
if ((n + l) > MAXPATHLEN) {
sys/kern/kern_checkpoint.c
903
memcpy(temp+n, buf, l);
sys/kern/kern_checkpoint.c
904
n += l;
sys/kern/kern_checkpoint.c
908
if ((n + l) > MAXPATHLEN) {
sys/kern/kern_checkpoint.c
914
memcpy(temp+n, buf, l);
sys/kern/kern_checkpoint.c
915
n += l;
sys/kern/kern_checkpoint.c
922
temp[n++] = format[i];
sys/kern/kern_checkpoint.c
925
temp[n] = '\0';
sys/kern/kern_clock.c
163
int n = sniff_target;
sys/kern/kern_clock.c
164
if (n < 0)
sys/kern/kern_clock.c
166
else if (n < ncpus)
sys/kern/kern_clock.c
167
cpu_sniff(n);
sys/kern/kern_clock.c
370
collect_cputime_callback(int n)
sys/kern/kern_clock.c
379
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_clock.c
380
cpu_states[CP_USER] += cputime_percpu[n].cp_user;
sys/kern/kern_clock.c
381
cpu_states[CP_NICE] += cputime_percpu[n].cp_nice;
sys/kern/kern_clock.c
382
cpu_states[CP_SYS] += cputime_percpu[n].cp_sys;
sys/kern/kern_clock.c
383
cpu_states[CP_INTR] += cputime_percpu[n].cp_intr;
sys/kern/kern_clock.c
384
cpu_states[CP_IDLE] += cputime_percpu[n].cp_idle;
sys/kern/kern_clock.c
388
for (n = 0; n < CPUSTATES; ++n) {
sys/kern/kern_clock.c
389
total = cpu_states[n] - cpu_base[n];
sys/kern/kern_clock.c
390
cpu_base[n] = cpu_states[n];
sys/kern/kern_clock.c
391
cpu_states[n] = total;
sys/kern/kern_clock.c
419
int n;
sys/kern/kern_clock.c
421
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_clock.c
422
lwkt_setcpu_self(globaldata_find(n));
sys/kern/kern_clock.c
471
int n;
sys/kern/kern_clock.c
473
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_clock.c
474
lwkt_setcpu_self(globaldata_find(n));
sys/kern/kern_clock.c
799
int n;
sys/kern/kern_clock.c
801
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_clock.c
802
gd = globaldata_find(n);
sys/kern/kern_clock.c
807
if (n == ncpus) {
sys/kern/kern_clock.c
808
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_clock.c
809
gd = globaldata_find(n);
sys/kern/kern_collect.c
103
return n;
sys/kern/kern_collect.c
107
kcollect_unregister(int n)
sys/kern/kern_collect.c
110
if (n >= 0 && n < KCOLLECT_ENTRIES) {
sys/kern/kern_collect.c
111
kcollect_slots[n] = NULL;
sys/kern/kern_collect.c
112
kcollect_callback[n] = NULL;
sys/kern/kern_collect.c
124
kcollect_setvalue(int n, uint64_t value)
sys/kern/kern_collect.c
128
if (n >= 0 && n < KCOLLECT_ENTRIES) {
sys/kern/kern_collect.c
130
kcollect_ary[i].data[n] = value;
sys/kern/kern_collect.c
139
kcollect_setscale(int n, uint64_t value)
sys/kern/kern_collect.c
141
if (n >= 0 && n < KCOLLECT_ENTRIES) {
sys/kern/kern_collect.c
142
kcollect_scale.data[n] = value;
sys/kern/kern_collect.c
151
int n;
sys/kern/kern_collect.c
161
for (n = 0; n < KCOLLECT_ENTRIES; ++n) {
sys/kern/kern_collect.c
162
if (kcollect_callback[n]) {
sys/kern/kern_collect.c
163
kcollect_ary[i].data[n] =
sys/kern/kern_collect.c
164
kcollect_callback[n](n);
sys/kern/kern_collect.c
83
int n;
sys/kern/kern_collect.c
87
n = which;
sys/kern/kern_collect.c
89
for (n = KCOLLECT_DYNAMIC_START; n < KCOLLECT_ENTRIES; ++n) {
sys/kern/kern_collect.c
90
if (kcollect_slots[n] == NULL)
sys/kern/kern_collect.c
94
if (n < 0 || n >= KCOLLECT_ENTRIES) {
sys/kern/kern_collect.c
95
n = -1;
sys/kern/kern_collect.c
97
kcollect_slots[n] = id;
sys/kern/kern_collect.c
98
kcollect_callback[n] = func;
sys/kern/kern_collect.c
99
kcollect_scale.data[n] = scale;
sys/kern/kern_descrip.c
1679
right_subtree_size(int n)
sys/kern/kern_descrip.c
1681
return (n ^ (n | (n + 1)));
sys/kern/kern_descrip.c
1688
right_ancestor(int n)
sys/kern/kern_descrip.c
1690
return (n | (n + 1));
sys/kern/kern_descrip.c
1697
left_ancestor(int n)
sys/kern/kern_descrip.c
1699
return ((n & (n + 1)) - 1);
sys/kern/kern_descrip.c
1760
int n;
sys/kern/kern_descrip.c
1764
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_descrip.c
1766
&uip->ui_pcpu[n].pu_openfiles, 0);
sys/kern/kern_descrip.c
1874
fdavail(struct proc *p, int n)
sys/kern/kern_descrip.c
1892
if ((i = lim - fdp->fd_nfiles) > 0 && (n -= i) <= 0) {
sys/kern/kern_descrip.c
1899
if (fdnode->fp == NULL && --n <= 0) {
sys/kern/kern_descrip.c
2015
int n;
sys/kern/kern_descrip.c
2053
for (n = 0; n < fdp->fd_nfiles; ++n) {
sys/kern/kern_descrip.c
2054
if ((fp = fdp->fd_files[n].fp) == NULL)
sys/kern/kern_descrip.c
2058
fclearcache(&fdp->fd_files[n], NULL, 0);
sys/kern/kern_descrip.c
2061
fdp->fd_files[n].fp = info->nfp;
sys/kern/kern_descrip.c
2063
knote_fdclose(fp, fdp, n); /* XXX */
sys/kern/kern_descrip.c
3460
int n;
sys/kern/kern_descrip.c
3483
for (n = 0; n < fdp->fd_nfiles; ++n) {
sys/kern/kern_descrip.c
3484
if ((fp = fdp->fd_files[n].fp) == NULL)
sys/kern/kern_descrip.c
3490
kcore_make_file(&kf, fp, p->p_pid, uid, n);
sys/kern/kern_event.c
403
int n;
sys/kern/kern_event.c
414
n = 1;
sys/kern/kern_event.c
415
error = kqueue_register(kn->kn_kq, &kev, &n, 0);
sys/kern/kern_event.c
802
int i, n, total, error, nerrors = 0;
sys/kern/kern_event.c
820
n = 0;
sys/kern/kern_event.c
821
error = kevent_copyinfn(uap, kev, KQ_NEVENTS, &n);
sys/kern/kern_event.c
824
if (n == 0)
sys/kern/kern_event.c
826
for (i = 0; i < n; ++i)
sys/kern/kern_event.c
828
for (i = 0; i < n; ++i) {
sys/kern/kern_event.c
829
gobbled = n - i;
sys/kern/kern_event.c
901
while ((n = nevents - total) > 0) {
sys/kern/kern_event.c
902
if (n > KQ_NEVENTS)
sys/kern/kern_event.c
903
n = KQ_NEVENTS;
sys/kern/kern_event.c
909
i = kqueue_scan(kq, kev, n, &marker, closedcounter, flags);
sys/kern/kern_event.c
927
if (i < n && *res)
sys/kern/kern_event.c
938
if (i != n && kq->kq_count == 0 && *res == 0) {
sys/kern/kern_iosched.c
157
bwillinode(int n)
sys/kern/kern_kmalloc.c
696
int n;
sys/kern/kern_kmalloc.c
698
for (n = ttl = 0; n < ncpus; ++n)
sys/kern/kern_kmalloc.c
699
ttl += type->ks_use[n].memuse;
sys/kern/kern_lockf.c
134
int n;
sys/kern/kern_lockf.c
142
for (n = 0; n < ncpus; ++n)
sys/kern/kern_lockf.c
143
pup->pu_posixlocks += p->p_uidpcpu[n].pu_posixlocks;
sys/kern/kern_lockf.c
145
for (n = 0; n < ncpus; ++n)
sys/kern/kern_lockf.c
146
pup->pu_posixlocks -= p->p_uidpcpu[n].pu_posixlocks;
sys/kern/kern_mpipe.c
100
construct(mpipe->array[n], priv);
sys/kern/kern_mpipe.c
126
int n;
sys/kern/kern_mpipe.c
143
for (n = mpipe->free_count - 1; n >= 0; --n) {
sys/kern/kern_mpipe.c
144
buf = mpipe->array[n];
sys/kern/kern_mpipe.c
145
mpipe->array[n] = NULL;
sys/kern/kern_mpipe.c
208
int n;
sys/kern/kern_mpipe.c
210
if ((n = mpipe->free_count) != 0) {
sys/kern/kern_mpipe.c
214
--n;
sys/kern/kern_mpipe.c
215
buf = mpipe->array[n];
sys/kern/kern_mpipe.c
216
mpipe->array[n] = NULL; /* sanity check, not absolutely needed */
sys/kern/kern_mpipe.c
217
mpipe->free_count = n;
sys/kern/kern_mpipe.c
339
int n;
sys/kern/kern_mpipe.c
345
if ((n = mpipe->free_count) < mpipe->ary_count) {
sys/kern/kern_mpipe.c
349
mpipe->array[n] = buf;
sys/kern/kern_mpipe.c
72
int n;
sys/kern/kern_mpipe.c
97
n = mpipe->free_count;
sys/kern/kern_mpipe.c
98
mpipe->array[n] = kmalloc(bytes, mpipe->type, M_WAITOK | mpipe->mflags);
sys/kern/kern_nrandom.c
186
unsigned int n;
sys/kern/kern_nrandom.c
189
n = csprng_iterator++ % ncpus;
sys/kern/kern_nrandom.c
190
return &csprng_pcpu[n];
sys/kern/kern_nrandom.c
493
int n;
sys/kern/kern_nrandom.c
502
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_nrandom.c
503
state = &csprng_pcpu[n];
sys/kern/kern_nrandom.c
504
rgd = globaldata_find(n);
sys/kern/kern_nrandom.c
654
int n;
sys/kern/kern_nrandom.c
657
n = bytes;
sys/kern/kern_nrandom.c
662
if (n > 256)
sys/kern/kern_nrandom.c
663
n = 256;
sys/kern/kern_nrandom.c
666
bytes -= n;
sys/kern/kern_nrandom.c
667
buf += n;
sys/kern/kern_nrandom.c
729
size_t n;
sys/kern/kern_nrandom.c
733
n = req->oldlen;
sys/kern/kern_nrandom.c
734
if (n > 1024 * 1024)
sys/kern/kern_nrandom.c
735
n = 1024 * 1024;
sys/kern/kern_nrandom.c
736
while (n > 0) {
sys/kern/kern_nrandom.c
737
if ((r = n) > sizeof(buf))
sys/kern/kern_nrandom.c
743
n -= r;
sys/kern/kern_nrandom.c
754
ssize_t n;
sys/kern/kern_nrandom.c
767
n = (ssize_t)sizeof(buf);
sys/kern/kern_nrandom.c
768
if (n > bytes - r)
sys/kern/kern_nrandom.c
769
n = bytes - r;
sys/kern/kern_nrandom.c
770
read_random(buf, n, 1);
sys/kern/kern_nrandom.c
771
error = copyout(buf, (char *)uap->buf + r, n);
sys/kern/kern_nrandom.c
774
r += n;
sys/kern/kern_ntptime.c
57
#define L_RSHIFT(v, n) \
sys/kern/kern_ntptime.c
60
(v) = -(-(v) >> (n)); \
sys/kern/kern_ntptime.c
62
(v) = (v) >> (n); \
sys/kern/kern_proc.c
1076
int n;
sys/kern/kern_proc.c
1121
n = ALLPROC_HASH(base);
sys/kern/kern_proc.c
1122
prg = &procglob[n];
sys/kern/kern_proc.c
1181
int n;
sys/kern/kern_proc.c
1183
n = ALLPROC_HASH(p->p_pid);
sys/kern/kern_proc.c
1184
prg = &procglob[n];
sys/kern/kern_proc.c
1210
int n;
sys/kern/kern_proc.c
1212
n = ALLPROC_HASH(p->p_pid);
sys/kern/kern_proc.c
1213
prg = &procglob[n];
sys/kern/kern_proc.c
1408
int n;
sys/kern/kern_proc.c
1424
for (n = ns; n < ne; ++n) {
sys/kern/kern_proc.c
1425
procglob_t *prg = &procglob[n];
sys/kern/kern_proc.c
1466
int n;
sys/kern/kern_proc.c
1477
for (n = ns; n < ne; ++n) {
sys/kern/kern_proc.c
1478
procglob_t *prg = &procglob[n];
sys/kern/kern_proc.c
1520
int n;
sys/kern/kern_proc.c
1527
for (n = 0; n < ALLPROC_HSIZE; ++n) {
sys/kern/kern_proc.c
1528
procglob_t *prg = &procglob[n];
sys/kern/kern_proc.c
1667
int n;
sys/kern/kern_proc.c
1705
for (n = 0; n < ALLPROC_HSIZE; ++n) {
sys/kern/kern_proc.c
1706
procglob_t *prg = &procglob[n];
sys/kern/kern_proc.c
1796
for (n = 1; (flags & KERN_PROC_FLAG_LWKT) && n <= ncpus; ++n) {
sys/kern/kern_proc.c
1800
nid = (origcpu + n) % ncpus;
sys/kern/kern_proc.c
1870
size_t n;
sys/kern/kern_proc.c
1913
size_t n;
sys/kern/kern_proc.c
1917
for (n = 0; n < LPMAP_MAXTHREADTITLE - 1; ++n) {
sys/kern/kern_proc.c
1918
if (base[n] == 0)
sys/kern/kern_proc.c
1921
error = SYSCTL_OUT(req, base, n);
sys/kern/kern_proc.c
1932
size_t n;
sys/kern/kern_proc.c
1936
for (n = 0; n < UPMAP_MAXPROCTITLE - 1; ++n) {
sys/kern/kern_proc.c
1937
if (base[n] == 0)
sys/kern/kern_proc.c
1940
error = SYSCTL_OUT(req, base, n);
sys/kern/kern_proc.c
1979
n = req->newlen;
sys/kern/kern_proc.c
1980
if (n >= sizeof(lp->lwp_lpmap->thread_title))
sys/kern/kern_proc.c
1981
n = sizeof(lp->lwp_lpmap->thread_title) - 1;
sys/kern/kern_proc.c
1982
lp->lwp_lpmap->thread_title[n] = 0;
sys/kern/kern_proc.c
1983
bcopy(pa->ar_args, lp->lwp_lpmap->thread_title, n);
sys/kern/kern_proc.c
1992
n = req->newlen;
sys/kern/kern_proc.c
1993
if (n >= sizeof(lp->lwp_lpmap->thread_title))
sys/kern/kern_proc.c
1994
n = sizeof(lp->lwp_lpmap->thread_title) - 1;
sys/kern/kern_proc.c
1995
p->p_upmap->proc_title[n] = 0;
sys/kern/kern_proc.c
1996
bcopy(pa->ar_args, p->p_upmap->proc_title, n);
sys/kern/kern_proc.c
305
int n;
sys/kern/kern_proc.c
312
n = o | PLOCK_WAITING;
sys/kern/kern_proc.c
332
if (atomic_cmpset_int(&p->p_lock, o, n)) {
sys/kern/kern_proc.c
352
int n;
sys/kern/kern_proc.c
367
n = (o - 1) & ~PLOCK_WAITING;
sys/kern/kern_proc.c
368
if (atomic_cmpset_int(&p->p_lock, o, n)) {
sys/kern/kern_proc.c
396
int n;
sys/kern/kern_proc.c
411
n = (o + 1) | PLOCK_ZOMB;
sys/kern/kern_proc.c
412
if (atomic_cmpset_int(&p->p_lock, o, n))
sys/kern/kern_proc.c
418
n = o | PLOCK_WAITING;
sys/kern/kern_proc.c
420
if (atomic_cmpset_int(&p->p_lock, o, n)) {
sys/kern/kern_proc.c
440
int n;
sys/kern/kern_proc.c
456
n = (o - 1) & ~(PLOCK_ZOMB | PLOCK_WAITING | PLOCK_WAITRES);
sys/kern/kern_proc.c
457
if (atomic_cmpset_int(&p->p_lock, o, n)) {
sys/kern/kern_proc.c
506
int n;
sys/kern/kern_proc.c
519
n = ALLPROC_HASH(pid);
sys/kern/kern_proc.c
520
prg = &procglob[n];
sys/kern/kern_proc.c
549
int n;
sys/kern/kern_proc.c
560
n = ALLPROC_HASH(pid);
sys/kern/kern_proc.c
561
prg = &procglob[n];
sys/kern/kern_proc.c
589
int n;
sys/kern/kern_proc.c
602
n = ALLPROC_HASH(pid);
sys/kern/kern_proc.c
603
prg = &procglob[n];
sys/kern/kern_proc.c
647
int n;
sys/kern/kern_proc.c
649
n = PGRP_HASH(pgrp->pg_id);
sys/kern/kern_proc.c
650
prg = &procglob[n];
sys/kern/kern_proc.c
704
int n;
sys/kern/kern_proc.c
706
n = PGRP_HASH(pgid);
sys/kern/kern_proc.c
707
prg = &procglob[n];
sys/kern/kern_proc.c
744
int n;
sys/kern/kern_proc.c
760
n = PGRP_HASH(pgid);
sys/kern/kern_proc.c
761
prg = &procglob[n];
sys/kern/kern_proc.c
901
int n;
sys/kern/kern_proc.c
903
n = SESS_HASH(sess->s_sid);
sys/kern/kern_proc.c
904
prg = &procglob[n];
sys/kern/kern_refcount.c
61
u_int n;
sys/kern/kern_refcount.c
64
n = *countp;
sys/kern/kern_refcount.c
67
if ((n & ~REFCNTF_WAITING) == 0)
sys/kern/kern_refcount.c
74
if (atomic_fcmpset_int(countp, &n, n | REFCNTF_WAITING))
sys/kern/kern_resource.c
292
donice(struct proc *chgp, int n)
sys/kern/kern_resource.c
301
if (n > PRIO_MAX)
sys/kern/kern_resource.c
302
n = PRIO_MAX;
sys/kern/kern_resource.c
303
if (n < PRIO_MIN)
sys/kern/kern_resource.c
304
n = PRIO_MIN;
sys/kern/kern_resource.c
305
if (n < chgp->p_nice && caps_priv_check(cr, SYSCAP_NOSCHED))
sys/kern/kern_resource.c
307
chgp->p_nice = n;
sys/kern/kern_resource.c
531
doionice(struct proc *chgp, int n)
sys/kern/kern_resource.c
539
if (n > IOPRIO_MAX)
sys/kern/kern_resource.c
540
n = IOPRIO_MAX;
sys/kern/kern_resource.c
541
if (n < IOPRIO_MIN)
sys/kern/kern_resource.c
542
n = IOPRIO_MIN;
sys/kern/kern_resource.c
543
if (n < chgp->p_ionice &&
sys/kern/kern_resource.c
548
chgp->p_ionice = n;
sys/kern/kern_resource.c
59
static int donice (struct proc *chgp, int n);
sys/kern/kern_resource.c
60
static int doionice (struct proc *chgp, int n);
sys/kern/kern_sensors.c
408
char n[32];
sys/kern/kern_sensors.c
417
ksnprintf(n, sizeof(n), "%s%d", sensor_type_s[sens->type], sens->numt);
sys/kern/kern_sensors.c
419
("sensor %s:%s sysctl node already installed", sensdev->xname, n));
sys/kern/kern_sensors.c
422
SYSCTL_CHILDREN(sensdev->oid), OID_AUTO, n,
sys/kern/kern_sig.c
2449
int i, l, n;
sys/kern/kern_sig.c
2458
for (i = 0, n = 0; n < MAXPATHLEN && format[i]; i++) {
sys/kern/kern_sig.c
2464
temp[n++] = '%';
sys/kern/kern_sig.c
2467
if ((n + namelen) > MAXPATHLEN) {
sys/kern/kern_sig.c
2475
memcpy(temp+n, name, namelen);
sys/kern/kern_sig.c
2476
n += namelen;
sys/kern/kern_sig.c
2480
if ((n + l) > MAXPATHLEN) {
sys/kern/kern_sig.c
2488
memcpy(temp+n, buf, l);
sys/kern/kern_sig.c
2489
n += l;
sys/kern/kern_sig.c
2493
if ((n + l) > MAXPATHLEN) {
sys/kern/kern_sig.c
2501
memcpy(temp+n, buf, l);
sys/kern/kern_sig.c
2502
n += l;
sys/kern/kern_sig.c
2511
temp[n++] = format[i];
sys/kern/kern_sig.c
2514
temp[n] = '\0';
sys/kern/kern_slaballoc.c
360
int n;
sys/kern/kern_slaballoc.c
381
for (n = 0; n < ncpus; ++n)
sys/kern/kern_slaballoc.c
382
malloc_mgt_init(type, &use[n].mgt, type->ks_objsize);
sys/kern/kern_slaballoc.c
538
int n;
sys/kern/kern_slaballoc.c
555
for (n = 1; n < ncpus; ++n)
sys/kern/kern_slaballoc.c
556
malloc_mgt_init(t, &t->ks_use[n].mgt, t->ks_objsize);
sys/kern/kern_slaballoc.c
640
unsigned int n = (unsigned int)*bytes; /* unsigned for shift opt */
sys/kern/kern_slaballoc.c
642
if (n < 128) {
sys/kern/kern_slaballoc.c
643
*bytes = n = (n + 7) & ~7;
sys/kern/kern_slaballoc.c
645
return(n / 8 - 1); /* 8 byte chunks, 16 zones */
sys/kern/kern_slaballoc.c
647
if (n < 256) {
sys/kern/kern_slaballoc.c
648
*bytes = n = (n + 15) & ~15;
sys/kern/kern_slaballoc.c
650
return(n / 16 + 7);
sys/kern/kern_slaballoc.c
652
if (n < 8192) {
sys/kern/kern_slaballoc.c
653
if (n < 512) {
sys/kern/kern_slaballoc.c
654
*bytes = n = (n + 31) & ~31;
sys/kern/kern_slaballoc.c
656
return(n / 32 + 15);
sys/kern/kern_slaballoc.c
658
if (n < 1024) {
sys/kern/kern_slaballoc.c
659
*bytes = n = (n + 63) & ~63;
sys/kern/kern_slaballoc.c
661
return(n / 64 + 23);
sys/kern/kern_slaballoc.c
663
if (n < 2048) {
sys/kern/kern_slaballoc.c
664
*bytes = n = (n + 127) & ~127;
sys/kern/kern_slaballoc.c
666
return(n / 128 + 31);
sys/kern/kern_slaballoc.c
668
if (n < 4096) {
sys/kern/kern_slaballoc.c
669
*bytes = n = (n + 255) & ~255;
sys/kern/kern_slaballoc.c
671
return(n / 256 + 39);
sys/kern/kern_slaballoc.c
673
*bytes = n = (n + 511) & ~511;
sys/kern/kern_slaballoc.c
675
return(n / 512 + 47);
sys/kern/kern_slaballoc.c
678
if (n < 16384) {
sys/kern/kern_slaballoc.c
679
*bytes = n = (n + 1023) & ~1023;
sys/kern/kern_slaballoc.c
681
return(n / 1024 + 55);
sys/kern/kern_slaballoc.c
685
if (n < 32768) {
sys/kern/kern_slaballoc.c
686
*bytes = n = (n + 2047) & ~2047;
sys/kern/kern_slaballoc.c
688
return(n / 2048 + 63);
sys/kern/kern_slaballoc.c
691
panic("Unexpected byte count %d", n);
sys/kern/kern_subr.c
117
while (n > 0 && uio->uio_resid) {
sys/kern/kern_subr.c
125
if (cnt > n)
sys/kern/kern_subr.c
126
cnt = n;
sys/kern/kern_subr.c
155
n -= cnt;
sys/kern/kern_subr.c
183
uiomovebp(struct buf *bp, caddr_t cp, size_t n, struct uio *uio)
sys/kern/kern_subr.c
194
return (uiomove(cp, n, uio));
sys/kern/kern_subr.c
207
uiomove_nofault(caddr_t cp, size_t n, struct uio *uio)
sys/kern/kern_subr.c
213
error = uiomove(cp, n, uio);
sys/kern/kern_subr.c
223
uiomovez(size_t n, struct uio *uio)
sys/kern/kern_subr.c
233
while (n > 0 && uio->uio_resid) {
sys/kern/kern_subr.c
241
if (cnt > n)
sys/kern/kern_subr.c
242
cnt = n;
sys/kern/kern_subr.c
261
n -= cnt;
sys/kern/kern_subr.c
540
uiomove_fromphys(vm_page_t *ma, vm_offset_t offset, size_t n, struct uio *uio)
sys/kern/kern_subr.c
563
while (n > 0 && uio->uio_resid) {
sys/kern/kern_subr.c
571
if (cnt > n)
sys/kern/kern_subr.c
572
cnt = n;
sys/kern/kern_subr.c
609
n -= cnt;
sys/kern/kern_subr.c
96
uiomove(caddr_t cp, size_t n, struct uio *uio)
sys/kern/kern_synch.c
1101
int n;
sys/kern/kern_synch.c
1108
n = BSRCPUMASK(mask);
sys/kern/kern_synch.c
1109
CPUMASK_NANDBIT(mask, n);
sys/kern/kern_synch.c
1110
tgd = globaldata_find(n);
sys/kern/kern_synch.c
1460
collect_load_callback(int n)
sys/kern/kern_synch.c
1472
int n;
sys/kern/kern_synch.c
1483
for (n = 0; n < ncpus; ++n) {
sys/kern/kern_synch.c
1484
gd = globaldata_find(n);
sys/kern/kern_synch.c
1528
uint32_t n;
sys/kern/kern_synch.c
1547
n = TCHASHSHIFT(slpque_tablesize) + 1;
sys/kern/kern_synch.c
1549
hash_size = sizeof(struct tslpque) * n;
sys/kern/kern_synch.c
1554
for (i = 0; i < n; ++i)
sys/kern/kern_synch.c
1566
int n;
sys/kern/kern_synch.c
1583
for (n = 7; n < tblsize2; n += 2) {
sys/kern/kern_synch.c
1584
if (tblsize % n == 0)
sys/kern/kern_synch.c
1587
if (n == tblsize2)
sys/kern/kern_sysref.c
137
int n;
sys/kern/kern_sysref.c
173
n = srclass->offset + sizeof(struct sysref);
sys/kern/kern_sysref.c
174
KKASSERT(n <= srclass->objsize);
sys/kern/kern_sysref.c
175
if (n != srclass->objsize)
sys/kern/kern_sysref.c
176
bzero(data + n, srclass->objsize - n);
sys/kern/kern_uuid.c
116
size_t n;
sys/kern/kern_uuid.c
142
for (n = 0; n < count; n++) {
sys/kern/kern_uuid.c
147
store[n] = *(struct uuid *)&uuid;
sys/kern/kern_uuid.c
373
int n;
sys/kern/kern_uuid.c
394
n = ksscanf(str, "%8x-%4x-%4x-%2x%2x-%2x%2x%2x%2x%2x%2x", c + 0, c + 1,
sys/kern/kern_uuid.c
397
if (n != 11)
sys/kern/kern_uuid.c
406
for (n = 0; n < 6; n++)
sys/kern/kern_uuid.c
407
uuid->node[n] = c[n + 5];
sys/kern/kern_varsym.c
367
vsslock(struct varsymset **vss, struct varsymset *n)
sys/kern/kern_varsym.c
372
lockmgr(&n->vx_lock, LK_SHARED);
sys/kern/kern_varsym.c
373
*vss = n;
sys/kern/kern_xio.c
103
int n;
sys/kern/kern_xio.c
111
if ((n = PAGE_SIZE - xio->xio_offset) > kbytes)
sys/kern/kern_xio.c
112
n = kbytes;
sys/kern/kern_xio.c
113
for (i = 0; n && i < XIO_INTERNAL_PAGES; ++i) {
sys/kern/kern_xio.c
119
kbytes -= n;
sys/kern/kern_xio.c
120
xio->xio_bytes += n;
sys/kern/kern_xio.c
121
if ((n = kbytes) > PAGE_SIZE)
sys/kern/kern_xio.c
122
n = PAGE_SIZE;
sys/kern/kern_xio.c
131
if (i < XIO_INTERNAL_PAGES && n) {
sys/kern/kern_xio.c
228
int n;
sys/kern/kern_xio.c
239
if ((n = PAGE_SIZE - offset) > bytes)
sys/kern/kern_xio.c
240
n = bytes;
sys/kern/kern_xio.c
249
error = copyout((char *)lwbuf_kva(lwb) + offset, uptr, n);
sys/kern/kern_xio.c
253
bytes -= n;
sys/kern/kern_xio.c
254
uptr = (char *)uptr + n;
sys/kern/kern_xio.c
257
if ((n = bytes) > PAGE_SIZE)
sys/kern/kern_xio.c
258
n = PAGE_SIZE;
sys/kern/kern_xio.c
277
int n;
sys/kern/kern_xio.c
288
if ((n = PAGE_SIZE - offset) > bytes)
sys/kern/kern_xio.c
289
n = bytes;
sys/kern/kern_xio.c
298
bcopy((char *)lwbuf_kva(lwb) + offset, kptr, n);
sys/kern/kern_xio.c
300
bytes -= n;
sys/kern/kern_xio.c
301
kptr = (char *)kptr + n;
sys/kern/kern_xio.c
304
if ((n = bytes) > PAGE_SIZE)
sys/kern/kern_xio.c
305
n = PAGE_SIZE;
sys/kern/kern_xio.c
324
int n;
sys/kern/kern_xio.c
335
if ((n = PAGE_SIZE - offset) > bytes)
sys/kern/kern_xio.c
336
n = bytes;
sys/kern/kern_xio.c
345
error = copyin(uptr, (char *)lwbuf_kva(lwb) + offset, n);
sys/kern/kern_xio.c
349
bytes -= n;
sys/kern/kern_xio.c
350
uptr = (const char *)uptr + n;
sys/kern/kern_xio.c
353
if ((n = bytes) > PAGE_SIZE)
sys/kern/kern_xio.c
354
n = PAGE_SIZE;
sys/kern/kern_xio.c
373
int n;
sys/kern/kern_xio.c
384
if ((n = PAGE_SIZE - offset) > bytes)
sys/kern/kern_xio.c
385
n = bytes;
sys/kern/kern_xio.c
394
bcopy(kptr, (char *)lwbuf_kva(lwb) + offset, n);
sys/kern/kern_xio.c
396
bytes -= n;
sys/kern/kern_xio.c
397
kptr = (const char *)kptr + n;
sys/kern/kern_xio.c
400
if ((n = bytes) > PAGE_SIZE)
sys/kern/kern_xio.c
401
n = PAGE_SIZE;
sys/kern/lwkt_ipiq.c
551
int n;
sys/kern/lwkt_ipiq.c
558
n = BSFCPUMASK(mask);
sys/kern/lwkt_ipiq.c
559
if (n != gd->gd_cpuid) {
sys/kern/lwkt_ipiq.c
560
sgd = globaldata_find(n);
sys/kern/lwkt_ipiq.c
571
ATOMIC_CPUMASK_NANDBIT(gd->gd_ipimask, n);
sys/kern/lwkt_ipiq.c
573
ATOMIC_CPUMASK_ORBIT(gd->gd_ipimask, n);
sys/kern/lwkt_ipiq.c
576
CPUMASK_NANDBIT(mask, n);
sys/kern/lwkt_ipiq.c
603
int n;
sys/kern/lwkt_ipiq.c
610
n = BSFCPUMASK(mask);
sys/kern/lwkt_ipiq.c
611
if (n != gd->gd_cpuid) {
sys/kern/lwkt_ipiq.c
612
sgd = globaldata_find(n);
sys/kern/lwkt_ipiq.c
623
ATOMIC_CPUMASK_NANDBIT(gd->gd_ipimask, n);
sys/kern/lwkt_ipiq.c
625
ATOMIC_CPUMASK_ORBIT(gd->gd_ipimask, n);
sys/kern/lwkt_ipiq.c
628
CPUMASK_NANDBIT(mask, n);
sys/kern/lwkt_ipiq.c
658
int n;
sys/kern/lwkt_ipiq.c
666
n = BSFCPUMASK(mask);
sys/kern/lwkt_ipiq.c
667
if (n != gd->gd_cpuid) {
sys/kern/lwkt_ipiq.c
668
sgd = globaldata_find(n);
sys/kern/lwkt_ipiq.c
683
CPUMASK_NANDBIT(mask, n);
sys/kern/lwkt_token.c
574
int n;
sys/kern/lwkt_token.c
600
n = i;
sys/kern/lwkt_token.c
605
for (i = 0; i < n; ++i) {
sys/kern/md4c.c
68
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
sys/kern/md5c.c
103
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
sys/kern/subr_alist.c
491
alist_blk_t n = ALIST_BMAP_RADIX - count;
sys/kern/subr_alist.c
494
mask = (alist_bmap_t)-1 >> n;
sys/kern/subr_alist.c
496
for (j = 0; j <= n; j += count) {
sys/kern/subr_alist.c
553
alist_blk_t n = count / radix * 2; /* number of bits */
sys/kern/subr_alist.c
556
mask = (alist_bmap_t)-1 >> (ALIST_BMAP_RADIX - n);
sys/kern/subr_alist.c
557
for (j = 0; j < ALIST_META_RADIX; j += n / 2) {
sys/kern/subr_alist.c
563
mask <<= n;
sys/kern/subr_alist.c
668
alist_blk_t n = blk & (ALIST_BMAP_RADIX - 1);
sys/kern/subr_alist.c
671
mask = ((alist_bmap_t)-1 << n) &
sys/kern/subr_alist.c
672
((alist_bmap_t)-1 >> (ALIST_BMAP_RADIX - count - n));
sys/kern/subr_blist.c
420
int n = (int)(BLIST_BMAP_RADIX - count);
sys/kern/subr_blist.c
423
mask = (u_swblk_t)-1 >> n;
sys/kern/subr_blist.c
425
for (j = 0; j <= n; ++j) {
sys/kern/subr_blist.c
557
int n = blk & (BLIST_BMAP_RADIX - 1);
sys/kern/subr_blist.c
560
mask = ((u_swblk_t)-1 << n) &
sys/kern/subr_blist.c
561
((u_swblk_t)-1 >> (BLIST_BMAP_RADIX - count - n));
sys/kern/subr_blist.c
698
int n = blk & (BLIST_BMAP_RADIX - 1);
sys/kern/subr_blist.c
702
mask = ((u_swblk_t)-1 << n) &
sys/kern/subr_blist.c
703
((u_swblk_t)-1 >> (BLIST_BMAP_RADIX - count - n));
sys/kern/subr_cpu_topology.c
158
migrate_elements(cpu_node_t **a, int n, int pos)
sys/kern/subr_cpu_topology.c
162
for (i = pos; i < n - 1 ; i++) {
sys/kern/subr_disk.c
1427
size_t n;
sys/kern/subr_disk.c
1443
n = bio->bio_buf->b_bcount;
sys/kern/subr_disk.c
1444
next_offset = bio->bio_offset + n;
sys/kern/subr_disk.c
1446
if (left < n)
sys/kern/subr_disk.c
1448
left -= n;
sys/kern/subr_gtaskqueue.c
607
struct grouptask *n;
sys/kern/subr_gtaskqueue.c
626
LIST_FOREACH(n, &qgroup->tqg_queue[i].tgc_tasks,
sys/kern/subr_gtaskqueue.c
628
if (n->gt_uniq == uniq)
sys/kern/subr_gtaskqueue.c
630
if (n != NULL)
sys/kern/subr_kcore.c
59
pid_t pid, uid_t owner, int n)
sys/kern/subr_kcore.c
66
ufile->f_fd = n;
sys/kern/subr_log.c
129
u_int n;
sys/kern/subr_log.c
162
n = xindex - lindex;
sys/kern/subr_log.c
163
if (n > mbp->msg_size - 1024) {
sys/kern/subr_log.c
165
n = xindex - lindex;
sys/kern/subr_log.c
172
n = mbp->msg_size - lindex_modulo;
sys/kern/subr_log.c
173
if (n > xindex - lindex)
sys/kern/subr_log.c
174
n = xindex - lindex;
sys/kern/subr_log.c
175
if ((size_t)n > uio->uio_resid)
sys/kern/subr_log.c
176
n = (u_int)uio->uio_resid;
sys/kern/subr_log.c
182
(size_t)n, uio);
sys/kern/subr_log.c
185
mbp->msg_bufl = lindex + n;
sys/kern/subr_log.c
264
u_int n;
sys/kern/subr_log.c
277
n = xindex - lindex;
sys/kern/subr_log.c
278
if (n > mbp->msg_size - 1024) {
sys/kern/subr_log.c
280
n = xindex - lindex;
sys/kern/subr_log.c
282
*(int *)ap->a_data = n;
sys/kern/subr_prf.c
1049
u_int n;
sys/kern/subr_prf.c
1060
n = xindex - lindex;
sys/kern/subr_prf.c
1061
if (n > mbp->msg_size - 1024) {
sys/kern/subr_prf.c
1066
n = xindex - rindex;
sys/kern/subr_prf.c
1067
if (n > mbp->msg_size - 1024) {
sys/kern/subr_prf.c
1079
u_int n;
sys/kern/subr_prf.c
1085
n = xindex - rindex;
sys/kern/subr_prf.c
1086
if (n > oldp->msg_size - 1024)
sys/kern/subr_prf.c
1129
u_int n;
sys/kern/subr_prf.c
1156
n = xindex - rindex;
sys/kern/subr_prf.c
1157
if (n > mbp->msg_size - 1024) {
sys/kern/subr_prf.c
1159
n = xindex - rindex;
sys/kern/subr_prf.c
1177
} else if (n <= mbp->msg_size - rindex_modulo) {
sys/kern/subr_prf.c
1183
n - rindex_modulo,
sys/kern/subr_prf.c
1194
n -= mbp->msg_size - rindex_modulo;
sys/kern/subr_prf.c
1197
n, req);
sys/kern/subr_prf.c
557
int ch, n;
sys/kern/subr_prf.c
652
for (n = 0;; ++fmt) {
sys/kern/subr_prf.c
653
n = n * 10 + ch - '0';
sys/kern/subr_prf.c
659
dwidth = n;
sys/kern/subr_prf.c
661
width = n;
sys/kern/subr_prf.c
718
n = *p++;
sys/kern/subr_prf.c
719
if (num & (1 << (n - 1))) {
sys/kern/subr_prf.c
721
for (; (n = *p) > ' '; ++p)
sys/kern/subr_prf.c
722
PCHAR(n);
sys/kern/subr_prf.c
755
n = strlen (p);
sys/kern/subr_prf.c
757
for (n = 0; n < dwidth && p[n]; n++)
sys/kern/subr_prf.c
760
width -= n;
sys/kern/subr_prf.c
765
while (n--)
sys/kern/subr_prf.c
827
p = ksprintn(nbuf, num, base, &n, upper);
sys/kern/subr_prf.c
840
width -= tmp + imax(dwidth, n);
sys/kern/subr_prf.c
841
dwidth -= n;
sys/kern/subr_prf.c
917
u_int n;
sys/kern/subr_prf.c
959
n = xindex - rindex;
sys/kern/subr_prf.c
960
if (n > mbp->msg_size - 1024) {
sys/kern/subr_prf.c
962
n = xindex - rindex;
sys/kern/subr_scanf.c
108
int n; /* handy integer */
sys/kern/subr_scanf.c
292
if ((n = inr) < width) {
sys/kern/subr_scanf.c
293
sum += n;
sys/kern/subr_scanf.c
294
width -= n;
sys/kern/subr_scanf.c
295
inp += n;
sys/kern/subr_scanf.c
323
n = 0;
sys/kern/subr_scanf.c
325
n++, inr--, inp++;
sys/kern/subr_scanf.c
329
if (n == 0)
sys/kern/subr_scanf.c
334
if (n == 0)
sys/kern/subr_scanf.c
349
n = p - p0;
sys/kern/subr_scanf.c
350
if (n == 0)
sys/kern/subr_scanf.c
355
nread += n;
sys/kern/subr_scanf.c
364
n = 0;
sys/kern/subr_scanf.c
366
n++, inr--, inp++;
sys/kern/subr_scanf.c
372
nread += n;
sys/kern/subr_scanf.c
552
int c, n, v;
sys/kern/subr_scanf.c
563
for (n = 0; n < 256; n++)
sys/kern/subr_scanf.c
564
tab[n] = v; /* memset(tab, v, 256) */
sys/kern/subr_scanf.c
580
n = *fmt++; /* and examine the next */
sys/kern/subr_scanf.c
581
switch (n) {
sys/kern/subr_scanf.c
605
n = *fmt;
sys/kern/subr_scanf.c
606
if (n == ']' || n < c) {
sys/kern/subr_scanf.c
614
} while (c < n);
sys/kern/subr_scanf.c
615
c = n;
sys/kern/subr_scanf.c
628
c = n;
sys/kern/sys_generic.c
1010
n = 1;
sys/kern/sys_generic.c
1011
kqueue_register(&skap->lwp->lwp_kqueue, &kev, &n, 0);
sys/kern/sys_generic.c
1437
int n;
sys/kern/sys_generic.c
1456
n = 1;
sys/kern/sys_generic.c
1457
kqueue_register(&pkap->lwp->lwp_kqueue, &kev, &n,
sys/kern/sys_generic.c
1697
int n;
sys/kern/sys_generic.c
1712
n = 1;
sys/kern/sys_generic.c
1713
if ((error = kqueue_register(&kq, &kev, &n, 0)) != 0) {
sys/kern/sys_generic.c
1722
n = 1;
sys/kern/sys_generic.c
1723
kqueue_register(&kq, &kev, &n, 0);
sys/kern/sys_generic.c
995
int n;
sys/kern/sys_pipe.c
153
int n;
sys/kern/sys_pipe.c
174
for (n = 0; n < ncpus; ++n)
sys/kern/sys_pipe.c
175
mtx_init(&pipe_gdlocks[n].mtx, "pipekm");
sys/kern/tty_conf.c
60
#define NODISC(n) \
sys/kern/tty_subr.c
127
clist_qtob(struct clist *cl, char *dest, int n)
sys/kern/tty_subr.c
133
if (n > cl->c_cc)
sys/kern/tty_subr.c
134
n = cl->c_cc;
sys/kern/tty_subr.c
135
count = n;
sys/kern/tty_subr.c
138
while (n) {
sys/kern/tty_subr.c
143
--n;
sys/kern/tty_subr.c
155
ndflush(struct clist *cl, int n)
sys/kern/tty_subr.c
159
if (n > cl->c_cc)
sys/kern/tty_subr.c
160
n = cl->c_cc;
sys/kern/tty_subr.c
161
i = cl->c_cchead + n;
sys/kern/tty_subr.c
165
cl->c_cc -= n;
sys/kern/tty_subr.c
194
clist_btoq(char *src, int n, struct clist *cl)
sys/kern/tty_subr.c
201
if (count > n)
sys/kern/tty_subr.c
202
count = n; /* count = bytes to copy */
sys/kern/tty_subr.c
203
remain = n - count; /* remain = bytes not copied */
sys/kern/tty_subr.c
216
cl->c_cc += n - remain; /* bytes actually copied */
sys/kern/tty_subr.c
53
int n;
sys/kern/tty_subr.c
68
n = cl->c_ccmax - cl->c_cchead;
sys/kern/tty_subr.c
69
if (n > count)
sys/kern/tty_subr.c
70
n = count;
sys/kern/tty_subr.c
71
bcopy(cl->c_data + cl->c_cchead, data, n * sizeof(*data));
sys/kern/tty_subr.c
72
if (n < count) {
sys/kern/tty_subr.c
73
bcopy(cl->c_data, data + n,
sys/kern/tty_subr.c
74
(count - n) * sizeof(*data));
sys/kern/uipc_mbuf.c
1188
struct mbuf *n, *nfirst = NULL, **ntail = &nfirst;
sys/kern/uipc_mbuf.c
1192
n = m_getl(len, how, type, 0, &nsize);
sys/kern/uipc_mbuf.c
1193
if (n == NULL)
sys/kern/uipc_mbuf.c
1195
n->m_len = 0;
sys/kern/uipc_mbuf.c
1196
*ntail = n;
sys/kern/uipc_mbuf.c
1197
ntail = &n->m_next;
sys/kern/uipc_mbuf.c
1313
struct mbuf *n;
sys/kern/uipc_mbuf.c
1320
n = m->m_next;
sys/kern/uipc_mbuf.c
1454
return (n);
sys/kern/uipc_mbuf.c
1532
struct mbuf *n, **np;
sys/kern/uipc_mbuf.c
1563
n = m_gethdr(wait, m->m_type);
sys/kern/uipc_mbuf.c
1565
n = m_get(wait, m->m_type);
sys/kern/uipc_mbuf.c
1566
*np = n;
sys/kern/uipc_mbuf.c
1567
if (n == NULL)
sys/kern/uipc_mbuf.c
1570
if (!m_dup_pkthdr(n, m, wait))
sys/kern/uipc_mbuf.c
1573
n->m_pkthdr.len -= off0;
sys/kern/uipc_mbuf.c
1575
n->m_pkthdr.len = len;
sys/kern/uipc_mbuf.c
1578
n->m_len = min(len, m->m_len - off);
sys/kern/uipc_mbuf.c
1580
KKASSERT((n->m_flags & M_EXT) == 0);
sys/kern/uipc_mbuf.c
1581
n->m_data = m->m_data + off;
sys/kern/uipc_mbuf.c
1583
n->m_ext = m->m_ext;
sys/kern/uipc_mbuf.c
1584
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
sys/kern/uipc_mbuf.c
1586
bcopy(mtod(m, caddr_t) + off, mtod(n, caddr_t),
sys/kern/uipc_mbuf.c
1587
n->m_len);
sys/kern/uipc_mbuf.c
1590
len -= n->m_len;
sys/kern/uipc_mbuf.c
1593
np = &n->m_next;
sys/kern/uipc_mbuf.c
1616
struct mbuf *top, *n, *o;
sys/kern/uipc_mbuf.c
1618
n = m_gethdr(how, m->m_type);
sys/kern/uipc_mbuf.c
1619
top = n;
sys/kern/uipc_mbuf.c
1620
if (!n)
sys/kern/uipc_mbuf.c
1623
if (!m_dup_pkthdr(n, m, how))
sys/kern/uipc_mbuf.c
1625
n->m_len = m->m_len;
sys/kern/uipc_mbuf.c
1627
KKASSERT((n->m_flags & M_EXT) == 0);
sys/kern/uipc_mbuf.c
1628
n->m_data = m->m_data;
sys/kern/uipc_mbuf.c
1630
n->m_ext = m->m_ext;
sys/kern/uipc_mbuf.c
1631
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
sys/kern/uipc_mbuf.c
1633
n->m_data = n->m_pktdat + (m->m_data - m->m_pktdat);
sys/kern/uipc_mbuf.c
1634
bcopy(mtod(m, void *), mtod(n, void *), n->m_len);
sys/kern/uipc_mbuf.c
1643
n->m_next = o;
sys/kern/uipc_mbuf.c
1644
n = n->m_next;
sys/kern/uipc_mbuf.c
1646
n->m_len = m->m_len;
sys/kern/uipc_mbuf.c
1648
KKASSERT((n->m_flags & M_EXT) == 0);
sys/kern/uipc_mbuf.c
1649
n->m_data = m->m_data;
sys/kern/uipc_mbuf.c
1651
n->m_ext = m->m_ext;
sys/kern/uipc_mbuf.c
1652
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
sys/kern/uipc_mbuf.c
1654
bcopy(mtod(m, void *), mtod(n, void *), n->m_len);
sys/kern/uipc_mbuf.c
1706
struct mbuf **p, *n, *top = NULL;
sys/kern/uipc_mbuf.c
1721
n = m_getl(remain, how, m->m_type, top == NULL ? M_PKTHDR : 0,
sys/kern/uipc_mbuf.c
1723
if (n == NULL)
sys/kern/uipc_mbuf.c
1726
if (!m_dup_pkthdr(n, m, how))
sys/kern/uipc_mbuf.c
1730
*p = n;
sys/kern/uipc_mbuf.c
1731
p = &n->m_next;
sys/kern/uipc_mbuf.c
1734
n->m_len = 0;
sys/kern/uipc_mbuf.c
1735
while (n->m_len < nsize && m != NULL) {
sys/kern/uipc_mbuf.c
1736
chunk = min(nsize - n->m_len, m->m_len - moff);
sys/kern/uipc_mbuf.c
1737
bcopy(m->m_data + moff, n->m_data + n->m_len, chunk);
sys/kern/uipc_mbuf.c
1739
n->m_len += chunk;
sys/kern/uipc_mbuf.c
176
struct mbuf *n;
sys/kern/uipc_mbuf.c
1774
struct mbuf **p, *n, *top = NULL;
sys/kern/uipc_mbuf.c
1794
n = NULL;
sys/kern/uipc_mbuf.c
180
n = m->m_nextpkt;
sys/kern/uipc_mbuf.c
1807
if (n == NULL) {
sys/kern/uipc_mbuf.c
1808
n = m_getl(gsize, how, MT_DATA, 0, &nsize);
sys/kern/uipc_mbuf.c
1809
if (n == NULL)
sys/kern/uipc_mbuf.c
1811
n->m_len = 0;
sys/kern/uipc_mbuf.c
1812
*p = n;
sys/kern/uipc_mbuf.c
1813
p = &n->m_next;
sys/kern/uipc_mbuf.c
1816
bcopy(m->m_data + moff, n->m_data + n->m_len, chunk);
sys/kern/uipc_mbuf.c
1819
n->m_len += chunk;
sys/kern/uipc_mbuf.c
1822
n = NULL;
sys/kern/uipc_mbuf.c
1841
m_cat(struct mbuf *m, struct mbuf *n)
sys/kern/uipc_mbuf.c
1844
while (n) {
sys/kern/uipc_mbuf.c
1846
m->m_data + m->m_len + n->m_len >= &m->m_dat[MLEN]) {
sys/kern/uipc_mbuf.c
1848
m->m_next = n;
sys/kern/uipc_mbuf.c
1852
bcopy(mtod(n, caddr_t), mtod(m, caddr_t) + m->m_len, n->m_len);
sys/kern/uipc_mbuf.c
1853
m->m_len += n->m_len;
sys/kern/uipc_mbuf.c
1854
n = m_free(n);
sys/kern/uipc_mbuf.c
190
m = n;
sys/kern/uipc_mbuf.c
1961
struct mbuf *n, *mfirst, *mlast;
sys/kern/uipc_mbuf.c
2032
MGETHDR(n, how, m->m_type);
sys/kern/uipc_mbuf.c
2033
if (n == NULL) {
sys/kern/uipc_mbuf.c
2037
M_MOVE_PKTHDR(n, m);
sys/kern/uipc_mbuf.c
2038
MCLGET(n, how);
sys/kern/uipc_mbuf.c
2039
if ((n->m_flags & M_EXT) == 0) {
sys/kern/uipc_mbuf.c
2040
m_free(n);
sys/kern/uipc_mbuf.c
2045
n = m_getcl(how, m->m_type, m->m_flags);
sys/kern/uipc_mbuf.c
2046
if (n == NULL) {
sys/kern/uipc_mbuf.c
2061
mfirst = n;
sys/kern/uipc_mbuf.c
2065
memcpy(mtod(n, caddr_t), mtod(m, caddr_t) + off, cc);
sys/kern/uipc_mbuf.c
2066
n->m_len = cc;
sys/kern/uipc_mbuf.c
2068
mlast->m_next = n;
sys/kern/uipc_mbuf.c
2069
mlast = n;
sys/kern/uipc_mbuf.c
2076
n = m_getcl(how, m->m_type, m->m_flags);
sys/kern/uipc_mbuf.c
2077
if (n == NULL) {
sys/kern/uipc_mbuf.c
2083
n->m_next = m->m_next;
sys/kern/uipc_mbuf.c
2103
m_pullup(struct mbuf *n, int len)
sys/kern/uipc_mbuf.c
2114
if (!(n->m_flags & M_EXT) &&
sys/kern/uipc_mbuf.c
2115
n->m_data + len < &n->m_dat[MLEN] &&
sys/kern/uipc_mbuf.c
2116
n->m_next) {
sys/kern/uipc_mbuf.c
2117
if (n->m_len >= len)
sys/kern/uipc_mbuf.c
2118
return (n);
sys/kern/uipc_mbuf.c
2119
m = n;
sys/kern/uipc_mbuf.c
2120
n = n->m_next;
sys/kern/uipc_mbuf.c
2125
if (n->m_flags & M_PKTHDR)
sys/kern/uipc_mbuf.c
2126
m = m_gethdr(M_NOWAIT, n->m_type);
sys/kern/uipc_mbuf.c
2128
m = m_get(M_NOWAIT, n->m_type);
sys/kern/uipc_mbuf.c
2132
if (n->m_flags & M_PKTHDR)
sys/kern/uipc_mbuf.c
2133
M_MOVE_PKTHDR(m, n);
sys/kern/uipc_mbuf.c
2137
count = min(min(max(len, max_protohdr), space), n->m_len);
sys/kern/uipc_mbuf.c
2138
bcopy(mtod(n, caddr_t), mtod(m, caddr_t) + m->m_len, count);
sys/kern/uipc_mbuf.c
2141
n->m_len -= count;
sys/kern/uipc_mbuf.c
2143
if (n->m_len)
sys/kern/uipc_mbuf.c
2144
n->m_data += count;
sys/kern/uipc_mbuf.c
2146
n = m_free(n);
sys/kern/uipc_mbuf.c
2147
} while (len > 0 && n);
sys/kern/uipc_mbuf.c
2152
m->m_next = n;
sys/kern/uipc_mbuf.c
2155
m_freem(n);
sys/kern/uipc_mbuf.c
2173
struct mbuf *m, *n;
sys/kern/uipc_mbuf.c
2182
n = m_gethdr(wait, m0->m_type);
sys/kern/uipc_mbuf.c
2183
if (n == NULL)
sys/kern/uipc_mbuf.c
2185
n->m_pkthdr.rcvif = m0->m_pkthdr.rcvif;
sys/kern/uipc_mbuf.c
2186
n->m_pkthdr.len = m0->m_pkthdr.len - len0;
sys/kern/uipc_mbuf.c
2192
MH_ALIGN(n, 0);
sys/kern/uipc_mbuf.c
2193
n->m_next = m_split(m, len, wait);
sys/kern/uipc_mbuf.c
2194
if (n->m_next == NULL) {
sys/kern/uipc_mbuf.c
2195
m_free(n);
sys/kern/uipc_mbuf.c
2198
n->m_len = 0;
sys/kern/uipc_mbuf.c
2199
return (n);
sys/kern/uipc_mbuf.c
2202
MH_ALIGN(n, remain);
sys/kern/uipc_mbuf.c
2204
n = m->m_next;
sys/kern/uipc_mbuf.c
2206
return (n);
sys/kern/uipc_mbuf.c
2208
n = m_get(wait, m->m_type);
sys/kern/uipc_mbuf.c
2209
if (n == NULL)
sys/kern/uipc_mbuf.c
2211
M_ALIGN(n, remain);
sys/kern/uipc_mbuf.c
2215
KKASSERT((n->m_flags & M_EXT) == 0);
sys/kern/uipc_mbuf.c
2216
n->m_data = m->m_data + len;
sys/kern/uipc_mbuf.c
2218
n->m_ext = m->m_ext;
sys/kern/uipc_mbuf.c
2219
n->m_flags |= m->m_flags & (M_EXT | M_EXT_CLUSTER);
sys/kern/uipc_mbuf.c
2221
bcopy(mtod(m, caddr_t) + len, mtod(n, caddr_t), remain);
sys/kern/uipc_mbuf.c
2223
n->m_len = remain;
sys/kern/uipc_mbuf.c
2225
n->m_next = m->m_next;
sys/kern/uipc_mbuf.c
2227
return (n);
sys/kern/uipc_mbuf.c
2298
struct mbuf *n;
sys/kern/uipc_mbuf.c
2301
MGET(n, M_NOWAIT, MT_DATA);
sys/kern/uipc_mbuf.c
2302
if (n == NULL)
sys/kern/uipc_mbuf.c
2304
n->m_len = 0;
sys/kern/uipc_mbuf.c
2305
last->m_next = n;
sys/kern/uipc_mbuf.c
2306
last = n;
sys/kern/uipc_mbuf.c
2330
struct mbuf *m = m0, *n;
sys/kern/uipc_mbuf.c
2352
n = m_getl(off + len, how, m->m_type, 0, &nsize);
sys/kern/uipc_mbuf.c
2353
if (n == NULL)
sys/kern/uipc_mbuf.c
2355
n->m_len = min(nsize, off + len);
sys/kern/uipc_mbuf.c
2356
bzero(mtod(n, void *), n->m_len);
sys/kern/uipc_mbuf.c
2357
m->m_next = n;
sys/kern/uipc_mbuf.c
2379
n = m_getl(len, how, m->m_type, 0, &nsize);
sys/kern/uipc_mbuf.c
2380
if (n == NULL)
sys/kern/uipc_mbuf.c
2382
n->m_len = min(nsize, len);
sys/kern/uipc_mbuf.c
2383
m->m_next = n;
sys/kern/uipc_mbuf.c
2427
struct mbuf *m, *n;
sys/kern/uipc_mbuf.c
2450
n = m_get(M_NOWAIT, m->m_type);
sys/kern/uipc_mbuf.c
2451
if (n == NULL)
sys/kern/uipc_mbuf.c
2453
n->m_len = min(MLEN, remainder);
sys/kern/uipc_mbuf.c
2454
bcopy(cp, mtod(n, caddr_t), n->m_len);
sys/kern/uipc_mbuf.c
2455
cp += n->m_len, remainder -= n->m_len;
sys/kern/uipc_mbuf.c
2456
m->m_next = n;
sys/kern/uipc_mbuf.c
2457
m = n;
sys/kern/uipc_mbuf2.c
113
n = m;
sys/kern/uipc_mbuf2.c
114
while (n != NULL && off > 0) {
sys/kern/uipc_mbuf2.c
115
if (n->m_len > off)
sys/kern/uipc_mbuf2.c
117
off -= n->m_len;
sys/kern/uipc_mbuf2.c
118
n = n->m_next;
sys/kern/uipc_mbuf2.c
121
while (n != NULL && n->m_len == 0)
sys/kern/uipc_mbuf2.c
122
n = n->m_next;
sys/kern/uipc_mbuf2.c
123
if (!n) {
sys/kern/uipc_mbuf2.c
128
sharedcluster = (m_sharecount(n) > 1);
sys/kern/uipc_mbuf2.c
134
if ((off == 0 || offp) && len <= n->m_len - off && !sharedcluster)
sys/kern/uipc_mbuf2.c
143
if (len <= n->m_len - off) {
sys/kern/uipc_mbuf2.c
144
o = m_dup1(n, off, n->m_len - off, M_NOWAIT);
sys/kern/uipc_mbuf2.c
149
n->m_len = off;
sys/kern/uipc_mbuf2.c
150
o->m_next = n->m_next;
sys/kern/uipc_mbuf2.c
151
n->m_next = o;
sys/kern/uipc_mbuf2.c
152
n = n->m_next;
sys/kern/uipc_mbuf2.c
162
hlen = n->m_len - off;
sys/kern/uipc_mbuf2.c
170
for (o = n->m_next; o != NULL; o = o->m_next)
sys/kern/uipc_mbuf2.c
181
if ((off == 0 || offp) && M_TRAILINGSPACE(n) >= tlen &&
sys/kern/uipc_mbuf2.c
183
m_copydata(n->m_next, 0, tlen, mtod(n, caddr_t) + n->m_len);
sys/kern/uipc_mbuf2.c
184
n->m_len += tlen;
sys/kern/uipc_mbuf2.c
185
m_adj(n->m_next, tlen);
sys/kern/uipc_mbuf2.c
188
if ((off == 0 || offp) && M_LEADINGSPACE(n->m_next) >= hlen &&
sys/kern/uipc_mbuf2.c
189
!sharedcluster && n->m_next->m_len >= tlen) {
sys/kern/uipc_mbuf2.c
190
n->m_next->m_data -= hlen;
sys/kern/uipc_mbuf2.c
191
n->m_next->m_len += hlen;
sys/kern/uipc_mbuf2.c
192
bcopy(mtod(n, caddr_t) + off, mtod(n->m_next, caddr_t), hlen);
sys/kern/uipc_mbuf2.c
193
n->m_len -= hlen;
sys/kern/uipc_mbuf2.c
194
n = n->m_next;
sys/kern/uipc_mbuf2.c
210
bcopy(mtod(n, caddr_t) + off, mtod(o, caddr_t), hlen);
sys/kern/uipc_mbuf2.c
211
n->m_len -= hlen;
sys/kern/uipc_mbuf2.c
213
m_copydata(n->m_next, 0, tlen, mtod(o, caddr_t) + o->m_len);
sys/kern/uipc_mbuf2.c
215
m_adj(n->m_next, tlen);
sys/kern/uipc_mbuf2.c
216
o->m_next = n->m_next;
sys/kern/uipc_mbuf2.c
217
n->m_next = o;
sys/kern/uipc_mbuf2.c
218
n = o;
sys/kern/uipc_mbuf2.c
227
kprintf("%c%d", t == n ? '*' : ' ', t->m_len);
sys/kern/uipc_mbuf2.c
233
return n;
sys/kern/uipc_mbuf2.c
239
struct mbuf *n;
sys/kern/uipc_mbuf2.c
243
n = m_getl(len, wait, m->m_type, m->m_flags, NULL);
sys/kern/uipc_mbuf2.c
244
if (!n)
sys/kern/uipc_mbuf2.c
246
if (off == 0 && (m->m_flags & M_PKTHDR) && !m_dup_pkthdr(n, m, wait)) {
sys/kern/uipc_mbuf2.c
247
m_free(n);
sys/kern/uipc_mbuf2.c
250
m_copydata(m, off, len, mtod(n, void *));
sys/kern/uipc_mbuf2.c
251
return n;
sys/kern/uipc_mbuf2.c
92
struct mbuf *n, *o;
sys/kern/uipc_sockbuf.c
100
if (n->m_flags & M_EOR) {
sys/kern/uipc_sockbuf.c
105
sbcompress(sb, m, n);
sys/kern/uipc_sockbuf.c
129
struct mbuf *n = NULL;
sys/kern/uipc_sockbuf.c
132
for (m = sb->sb_mb; m; m = n) {
sys/kern/uipc_sockbuf.c
133
n = m->m_nextpkt;
sys/kern/uipc_sockbuf.c
134
if (n == NULL && sb->sb_lastrecord != m) {
sys/kern/uipc_sockbuf.c
143
if (n == NULL && m->m_next == NULL) {
sys/kern/uipc_sockbuf.c
234
struct mbuf *m, *n;
sys/kern/uipc_sockbuf.c
243
for (n = control; n; n = n->m_next) {
sys/kern/uipc_sockbuf.c
244
if (n->m_next == NULL) /* keep pointer to last control buf */
sys/kern/uipc_sockbuf.c
255
if (n)
sys/kern/uipc_sockbuf.c
256
n->m_next = m0; /* concatenate data to control */
sys/kern/uipc_sockbuf.c
260
for (n = m; n; n = n->m_next)
sys/kern/uipc_sockbuf.c
261
sballoc(sb, n);
sys/kern/uipc_sockbuf.c
292
struct mbuf *n;
sys/kern/uipc_sockbuf.c
303
length = m_countm(control, &n, &cmbcnt) + m_countm(m0, NULL, &m0mbcnt);
sys/kern/uipc_sockbuf.c
307
n->m_next = m0; /* concatenate data to control */
sys/kern/uipc_sockbuf.c
520
struct mbuf *n;
sys/kern/uipc_sockbuf.c
530
for (n = m; n; n = n->m_next)
sys/kern/uipc_sockbuf.c
531
sbfree(sb, n);
sys/kern/uipc_sockbuf.c
550
struct mbuf *n;
sys/kern/uipc_sockbuf.c
554
n = m->m_next;
sys/kern/uipc_sockbuf.c
555
if (n) {
sys/kern/uipc_sockbuf.c
556
sb->sb_mb = n;
sys/kern/uipc_sockbuf.c
558
sb->sb_lastrecord = n;
sys/kern/uipc_sockbuf.c
560
n->m_nextpkt = m->m_nextpkt;
sys/kern/uipc_sockbuf.c
577
return(n);
sys/kern/uipc_sockbuf.c
86
struct mbuf *n;
sys/kern/uipc_sockbuf.c
91
n = sb->sb_lastrecord;
sys/kern/uipc_sockbuf.c
92
if (n) {
sys/kern/uipc_sockbuf.c
93
if (n->m_flags & M_EOR) {
sys/kern/uipc_sockbuf.c
98
n = sb->sb_lastmbuf;
sys/kern/uipc_sockbuf.c
99
if (n) {
sys/kern/uipc_socket.c
1266
struct mbuf *m, *n;
sys/kern/uipc_socket.c
1430
n = sbunlinkmbuf(&so->so_rcv.sb, m, NULL);
sys/kern/uipc_socket.c
1438
m = n;
sys/kern/uipc_socket.c
1509
n = sbunlinkmbuf(&so->so_rcv.sb, m,
sys/kern/uipc_socket.c
1512
m = n;
sys/kern/uipc_socket.c
1523
n = m_copym(m, 0, len, M_WAITOK);
sys/kern/uipc_socket.c
1524
if (n)
sys/kern/uipc_socket.c
1525
sbappend(sio, n);
sys/kern/uipc_socket.c
1621
struct mbuf *m, *n;
sys/kern/uipc_socket.c
1744
n = m;
sys/kern/uipc_socket.c
1746
while (n && restmp < resid) {
sys/kern/uipc_socket.c
1747
n->m_flags |= M_SOLOCKED;
sys/kern/uipc_socket.c
1748
restmp += n->m_len;
sys/kern/uipc_socket.c
1749
if (n->m_next == NULL)
sys/kern/uipc_socket.c
1750
n = n->m_nextpkt;
sys/kern/uipc_socket.c
1752
n = n->m_next;
sys/kern/uipc_socket.c
1843
n = sbunlinkmbuf(&so->so_rcv.sb, m, NULL);
sys/kern/uipc_socket.c
1845
m = n;
sys/kern/uipc_socket.c
1854
n = m_copym(m, 0, offset, M_WAITOK);
sys/kern/uipc_socket.c
1855
if (n)
sys/kern/uipc_socket.c
1856
sbappend(sio, n);
sys/kern/uipc_usrreq.c
1436
int error, i, n;
sys/kern/uipc_usrreq.c
1446
n = head->count;
sys/kern/uipc_usrreq.c
1447
req->oldidx = (n + n/8) * sizeof(struct xunpcb);
sys/kern/uipc_usrreq.c
1459
n = head->count;
sys/kern/uipc_usrreq.c
1464
while ((unp = TAILQ_NEXT(marker, unp_link)) != NULL && i < n) {
sys/kern/usched_dfly.c
1605
int n;
sys/kern/usched_dfly.c
1662
for (n = 0; n < cpup->child_no; ++n) {
sys/kern/usched_dfly.c
1669
cpun = cpup->child_node[n];
sys/kern/usched_dfly.c
1899
int n;
sys/kern/usched_dfly.c
1942
for (n = 0; n < cpup->child_no; ++n) {
sys/kern/usched_dfly.c
1950
cpun = cpup->child_node[n];
sys/kern/vfs_bio.c
4428
long n;
sys/kern/vfs_bio.c
4430
for (n = 0; n < nbuf; ++n) {
sys/kern/vfs_bio.c
4431
if ((error = callback(&buf[n], info)) < 0) {
sys/kern/vfs_bio.c
614
long n;
sys/kern/vfs_bio.c
631
for (n = 0; n < nbuf; n++) {
sys/kern/vfs_bio.c
632
bp = &buf[n];
sys/kern/vfs_bio.c
639
MAXBSIZE * n);
sys/kern/vfs_cache.c
451
int n;
sys/kern/vfs_cache.c
453
for (n = 0; n < ncpus; ++n) {
sys/kern/vfs_cache.c
454
struct mntcache *cache = &pcpu_mntcache[n];
sys/kern/vfs_cache.c
4672
uint32_t n;
sys/kern/vfs_cache.c
4675
n = neg_rover++; /* SMP heuristical, race ok */
sys/kern/vfs_cache.c
4677
n = n % (uint32_t)ncpus;
sys/kern/vfs_cache.c
4691
pn = &pcpu_ncache[n];
sys/kern/vfs_helper.c
313
int n;
sys/kern/vfs_helper.c
344
n = PAGE_SIZE - offset;
sys/kern/vfs_helper.c
345
if (n > uio->uio_resid)
sys/kern/vfs_helper.c
346
n = uio->uio_resid;
sys/kern/vfs_helper.c
349
if (uio->uio_offset + n > vp->v_filesize)
sys/kern/vfs_helper.c
350
n = vp->v_filesize - uio->uio_offset;
sys/kern/vfs_helper.c
351
if (n == 0)
sys/kern/vfs_helper.c
374
n, uio);
sys/kern/vfs_journal.c
1466
int n;
sys/kern/vfs_journal.c
1471
n = (bytes > bufsize) ? bufsize : (int)bytes;
sys/kern/vfs_journal.c
1472
error = vn_rdwr(UIO_READ, vp, buf, n, off, UIO_SYSSPACE, IO_NODELOCKED,
sys/kern/vfs_journal.c
1478
jrecord_leaf(jrec, JLEAF_FILEDATA, buf, n);
sys/kern/vfs_journal.c
1479
bytes -= n;
sys/kern/vfs_journal.c
1480
off += n;
sys/kern/vfs_lock.c
1264
freesomevnodes(int n)
sys/kern/vfs_lock.c
1269
while (n) {
sys/kern/vfs_lock.c
1270
if ((vp = cleanfreevnode(n)) == NULL)
sys/kern/vfs_lock.c
1273
--n;
sys/kern/vfs_lock.c
310
int n = 0;
sys/kern/vfs_lock.c
314
n += gd->gd_cachedvnodes;
sys/kern/vfs_lock.c
316
return n;
sys/kern/vfs_lock.c
323
int n = 0;
sys/kern/vfs_lock.c
327
n += gd->gd_cachedvnodes + gd->gd_inactivevnodes;
sys/kern/vfs_lock.c
329
return n;
sys/kern/vfs_nlookup.c
1933
collect_nlookup_callback(int n)
sys/kern/vfs_nlookup.c
1940
for (n = 0; n < ncpus; ++n) {
sys/kern/vfs_nlookup.c
1941
globaldata_t gd = globaldata_find(n);
sys/kern/vfs_subr.c
1288
int n;
sys/kern/vfs_subr.c
1342
while ((n = vp->v_opencount) != 0) {
sys/kern/vfs_subr.c
1347
if (vp->v_opencount == n) {
sys/kern/vfs_sync.c
520
int n = syncdelay;
sys/kern/vfs_sync.c
541
} while(--n);
sys/kern/vfs_syscalls.c
733
int n;
sys/kern/vfs_syscalls.c
747
for (n = 0; n < fdp->fd_nfiles; ++n) {
sys/kern/vfs_syscalls.c
748
fp = fdp->fd_files[n].fp;
sys/libiconv/iconv_xlat.c
100
*inbuf += n;
sys/libiconv/iconv_xlat.c
101
*outbuf += n;
sys/libiconv/iconv_xlat.c
102
*inbytesleft -= n;
sys/libiconv/iconv_xlat.c
103
*outbytesleft -= n;
sys/libiconv/iconv_xlat.c
86
int n, r;
sys/libiconv/iconv_xlat.c
93
r = n = 1;
sys/libiconv/iconv_xlat.c
95
r = n = min(*inbytesleft, *outbytesleft);
sys/libkern/arc4random.c
171
int n;
sys/libkern/arc4random.c
180
for (n = 0; n < 256; n++)
sys/libkern/arc4random.c
181
d->arc4_sbox[n] = (uint8_t)n;
sys/libkern/arc4random.c
189
for (n = 0; n < 768 * 4; n++)
sys/libkern/arc4random.c
54
int r, n;
sys/libkern/arc4random.c
63
for (n = r; n < sizeof(key); n++)
sys/libkern/arc4random.c
64
key[n] = key[n % r];
sys/libkern/arc4random.c
67
for (n = 0; n < 256; n++) {
sys/libkern/arc4random.c
68
d->arc4_j = (d->arc4_j + d->arc4_sbox[n] + key[n]) % 256;
sys/libkern/arc4random.c
69
arc4_swap(&d->arc4_sbox[n], &d->arc4_sbox[d->arc4_j]);
sys/libkern/arc4random.c
76
for (n = 0; n < 768 * 4; n++)
sys/libkern/linux_idr.c
144
right_subtree_size(int n)
sys/libkern/linux_idr.c
146
return (n ^ (n | (n + 1)));
sys/libkern/linux_idr.c
153
right_ancestor(int n)
sys/libkern/linux_idr.c
155
return (n | (n + 1));
sys/libkern/linux_idr.c
162
left_ancestor(int n)
sys/libkern/linux_idr.c
164
return ((n & (n + 1)) - 1);
sys/libkern/memcchr.c
60
memcchr(const void *begin, int c, size_t n)
sys/libkern/memcchr.c
75
if (n == 0)
sys/libkern/memcchr.c
84
end = (const unsigned char *)begin + n;
sys/libkern/qsort.c
101
kqsort_r(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
sys/libkern/qsort.c
105
kqsort(void *a, size_t n, size_t es, cmp_t *cmp)
sys/libkern/qsort.c
113
if (n < 7) {
sys/libkern/qsort.c
114
for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
sys/libkern/qsort.c
120
pm = (char *)a + (n / 2) * es;
sys/libkern/qsort.c
121
if (n > 7) {
sys/libkern/qsort.c
123
pn = (char *)a + (n - 1) * es;
sys/libkern/qsort.c
124
if (n > 40) {
sys/libkern/qsort.c
125
d = (n / 8) * es;
sys/libkern/qsort.c
135
pc = pd = (char *)a + (n - 1) * es;
sys/libkern/qsort.c
161
for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
sys/libkern/qsort.c
168
pn = (char *)a + n * es;
sys/libkern/qsort.c
182
n = r / es;
sys/libkern/qsort.c
48
#define swapcode(TYPE, parmi, parmj, n) { \
sys/libkern/qsort.c
49
long i = (n) / sizeof (TYPE); \
sys/libkern/qsort.c
63
swapfunc(char *a, char *b, int n, int swaptype)
sys/libkern/qsort.c
66
swapcode(long, a, b, n)
sys/libkern/qsort.c
68
swapcode(char, a, b, n)
sys/libkern/qsort.c
79
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
sys/libkern/strcasecmp.c
50
strncasecmp(const char *s1, const char *s2, size_t n)
sys/libkern/strcasecmp.c
53
if (n != 0) {
sys/libkern/strcasecmp.c
63
} while (--n != 0);
sys/libkern/strlcat.c
47
size_t n = siz;
sys/libkern/strlcat.c
51
while (n-- != 0 && *d != '\0')
sys/libkern/strlcat.c
54
n = siz - dlen;
sys/libkern/strlcat.c
56
if (n == 0)
sys/libkern/strlcat.c
59
if (n != 1) {
sys/libkern/strlcat.c
61
n--;
sys/libkern/strlcpy.c
45
size_t n = siz;
sys/libkern/strlcpy.c
48
if (n != 0 && --n != 0) {
sys/libkern/strlcpy.c
52
} while (--n != 0);
sys/libkern/strlcpy.c
56
if (n == 0) {
sys/libkern/strncat.c
44
strncat(char * __restrict dst, const char * __restrict src, size_t n)
sys/libkern/strncat.c
46
if (n != 0) {
sys/libkern/strncat.c
56
} while (--n != 0);
sys/libkern/strncmp.c
36
strncmp(const char *s1, const char *s2, size_t n)
sys/libkern/strncmp.c
39
if (n == 0)
sys/libkern/strncmp.c
47
} while (--n != 0);
sys/libkern/strncpy.c
43
strncpy(char * __restrict dst, const char * __restrict src, size_t n)
sys/libkern/strncpy.c
45
if (n != 0) {
sys/libkern/strncpy.c
52
while (--n != 0)
sys/libkern/strncpy.c
56
} while (--n != 0);
sys/libkern/timingsafe_bcmp.c
21
timingsafe_bcmp(const void *b1, const void *b2, size_t n)
sys/libkern/timingsafe_bcmp.c
26
for (; n > 0; n--)
sys/libprop/prop_dictionary.c
188
const void *n, const void *v)
sys/libprop/prop_dictionary.c
190
const struct _prop_dictionary_keysym *pdk = n;
sys/libprop/prop_number.c
136
_prop_number_rb_compare_key(void *ctx __unused, const void *n, const void *v)
sys/libprop/prop_number.c
138
const struct _prop_number *pn = n;
sys/net/accf_http/accf_http.c
116
struct mbuf *n;
sys/net/accf_http/accf_http.c
118
for (;m != NULL; m = n) {
sys/net/accf_http/accf_http.c
119
n = npkt;
sys/net/accf_http/accf_http.c
146
struct mbuf *n;
sys/net/accf_http/accf_http.c
148
for (;m != NULL; m = n) {
sys/net/accf_http/accf_http.c
149
n = npkt;
sys/net/accf_http/accf_http.c
228
struct mbuf *m, *n;
sys/net/accf_http/accf_http.c
237
for (m = so->so_rcv.ssb_mb; m; m = n) {
sys/net/accf_http/accf_http.c
238
n = m->m_nextpkt;
sys/net/accf_http/accf_http.c
256
if (mbufstrncmp(m, n, i, cc, "HTTP/1.") == 1) {
sys/net/accf_http/accf_http.c
263
} else if (mbufstrcmp(m, n, i, "HTTP/1.0") == 1 ||
sys/net/accf_http/accf_http.c
264
mbufstrcmp(m, n, i, "HTTP/1.1") == 1) {
sys/net/accf_http/accf_http.c
304
struct mbuf *m, *n;
sys/net/accf_http/accf_http.c
323
for (m = so->so_rcv.ssb_mb; m; m = n) {
sys/net/accf_http/accf_http.c
324
n = m->m_nextpkt;
sys/net/altq/altq_classq.h
122
int i, n;
sys/net/altq/altq_classq.h
131
n = krandom() % qlen(q) + 1;
sys/net/altq/altq_classq.h
132
for (i = 0; i < n; i++) {
sys/net/altq/altq_red.c
266
int n;
sys/net/altq/altq_red.c
289
n = t / rp->red_pkttime - 1;
sys/net/altq/altq_red.c
292
if (n > 0)
sys/net/altq/altq_red.c
294
pow_w(rp->red_wtab, n);
sys/net/altq/altq_red.c
579
pow_w(struct wtab *w, int n)
sys/net/altq/altq_red.c
584
if (n >= w->w_param_max)
sys/net/altq/altq_red.c
588
if (n <= 0)
sys/net/altq/altq_red.c
593
while (n) {
sys/net/altq/altq_red.c
594
if (n & bit) {
sys/net/altq/altq_red.c
596
n &= ~bit;
sys/net/altq/altq_rio.c
297
int dpindex, i, n, t;
sys/net/altq/altq_rio.c
322
n = t / rp->rio_pkttime;
sys/net/altq/altq_rio.c
324
if (n > 0)
sys/net/altq/altq_rio.c
326
pow_w(rp->rio_wtab, n);
sys/net/bpf.c
1601
int n, error;
sys/net/bpf.c
1606
n = 0;
sys/net/bpf.c
1612
if (n >= bfl->bfl_len) {
sys/net/bpf.c
1616
bfl->bfl_list + n, sizeof(u_int));
sys/net/bpf.c
1618
n++;
sys/net/bpf.c
1620
bfl->bfl_len = n;
sys/net/bpf.c
758
int n;
sys/net/bpf.c
760
n = d->bd_slen;
sys/net/bpf.c
762
n += d->bd_hlen;
sys/net/bpf.c
764
*(int *)ap->a_data = n;
sys/net/gif/if_gif.c
209
int n;
sys/net/gif/if_gif.c
211
for (n = 0; n < netisr_ncpus; ++n) {
sys/net/gif/if_gif.c
212
rt = sc->gif_ro[n].ro_rt;
sys/net/gif/if_gif.c
214
KASSERT(rt->rt_cpuid == n,
sys/net/gif/if_gif.c
216
rt->rt_cpuid, n));
sys/net/gif/if_gif.c
218
sc->gif_ro[n].ro_rt = NULL;
sys/net/gif/if_gif.c
221
rt = sc->gif_ro6[n].ro_rt;
sys/net/gif/if_gif.c
223
KASSERT(rt->rt_cpuid == n,
sys/net/gif/if_gif.c
225
rt->rt_cpuid, n));
sys/net/gif/if_gif.c
227
sc->gif_ro6[n].ro_rt = NULL;
sys/net/if.c
699
unsigned int n;
sys/net/if.c
706
n = if_indexlim * sizeof(*q);
sys/net/if.c
707
q = kmalloc(n, M_IFADDR, M_WAITOK | M_ZERO);
sys/net/if.c
709
bcopy(ifindex2ifnet, q, n/2);
sys/net/if_ethersubr.c
1685
int n;
sys/net/if_ethersubr.c
1690
n = ksscanf(macstr, "%x:%x:%x:%x:%x:%x", &o0, &o1, &o2,
sys/net/if_ethersubr.c
1692
if (n != 6)
sys/net/if_ethersubr.c
1709
int n;
sys/net/if_ethersubr.c
1711
n = ksnprintf(buf, len, "%02x:%02x:%02x:%02x:%02x:%02x", addr[0],
sys/net/if_ethersubr.c
1714
if (n < 17)
sys/net/if_ethersubr.c
348
struct mbuf *n;
sys/net/if_ethersubr.c
350
if ((n = m_copypacket(m, M_NOWAIT)) != NULL) {
sys/net/if_ethersubr.c
351
n->m_pkthdr.csum_flags |= csum_flags;
sys/net/if_ethersubr.c
353
n->m_pkthdr.csum_data = 0xffff;
sys/net/if_ethersubr.c
354
if_simloop(ifp, n, dst->sa_family, hlen);
sys/net/ip6fw/ip6_fw.h
113
#define IPV6_FW_SETNSRCP(rule, n) do { \
sys/net/ip6fw/ip6_fw.h
115
(rule)->fw_nports |= (n); \
sys/net/ip6fw/ip6_fw.h
118
#define IPV6_FW_SETNDSTP(rule, n) do { \
sys/net/ip6fw/ip6_fw.h
120
(rule)->fw_nports |= (n) << 4;\
sys/net/ip_mroute/ip_mroute.c
1023
struct rtdetq *n = rte->next;
sys/net/ip_mroute/ip_mroute.c
1028
rte = n;
sys/net/ip_mroute/ip_mroute.c
1411
struct rtdetq *n = rte->next;
sys/net/ip_mroute/ip_mroute.c
1415
rte = n;
sys/net/ip_mroute/ip_mroute.c
654
struct rtdetq *n = rte->next;
sys/net/ip_mroute/ip_mroute.c
658
rte = n;
sys/net/ip_mroute/ip_mroute.h
85
#define VIFM_SET(n, m) ((m) |= (1 << (n)))
sys/net/ip_mroute/ip_mroute.h
86
#define VIFM_CLR(n, m) ((m) &= ~(1 << (n)))
sys/net/ip_mroute/ip_mroute.h
87
#define VIFM_ISSET(n, m) ((m) & (1 << (n)))
sys/net/ipfw/ip_fw2.c
4715
struct ip_fw *n;
sys/net/ipfw/ip_fw2.c
4717
n = rule->next;
sys/net/ipfw/ip_fw2.c
4719
ctx->ipfw_layer3_chain = n;
sys/net/ipfw/ip_fw2.c
4721
prev->next = n;
sys/net/ipfw/ip_fw2.c
4748
return n;
sys/net/ipfw3/ip_fw3.h
54
#define NEED(c, n, msg) {if (c < n) errx(EX_USAGE, msg);}
sys/net/ipfw3_nat/ip_fw3_nat.c
520
int ioc_nat_id, i, n, cpu;
sys/net/ipfw3_nat/ip_fw3_nat.c
531
for (n = 0; n < NAT_ID_MAX; n++) {
sys/net/ipfw3_nat/ip_fw3_nat.c
532
if (ioc_nat_id == 0 || ioc_nat_id == n + 1) {
sys/net/ipfw3_nat/ip_fw3_nat.c
533
if (nat_ctx->nats[n] == NULL)
sys/net/ipfw3_nat/ip_fw3_nat.c
535
the = nat_ctx->nats[n];
sys/net/ipfw3_nat/ip_fw3_nat.c
546
ioc->nat_id = n + 1;
sys/net/ipfw3_nat/ip_fw3_nat.c
572
ioc->nat_id = n + 1;
sys/net/ipfw3_nat/ip_fw3_nat.c
587
for (n = 0; n < NAT_ID_MAX; n++) {
sys/net/ipfw3_nat/ip_fw3_nat.c
588
if (ioc_nat_id == 0 || ioc_nat_id == n + 1) {
sys/net/ipfw3_nat/ip_fw3_nat.c
589
if (nat_ctx->nats[n] == NULL)
sys/net/ipfw3_nat/ip_fw3_nat.c
591
the = nat_ctx->nats[n];
sys/net/ipfw3_nat/ip_fw3_nat.c
602
ioc->nat_id = n + 1;
sys/net/ipfw3_nat/ip_fw3_nat.c
627
ioc->nat_id = n + 1;
sys/net/ipfw3_nat/ip_fw3_nat.c
643
for (n = 0; n < NAT_ID_MAX; n++) {
sys/net/ipfw3_nat/ip_fw3_nat.c
644
if (ioc_nat_id == 0 || ioc_nat_id == n + 1) {
sys/net/ipfw3_nat/ip_fw3_nat.c
645
if (nat_ctx->nats[n] == NULL)
sys/net/ipfw3_nat/ip_fw3_nat.c
647
the = nat_ctx->nats[n];
sys/net/ipfw3_nat/ip_fw3_nat.c
658
ioc->nat_id = n + 1;
sys/net/ipfw3_nat/ip_fw3_nat.c
683
ioc->nat_id = n + 1;
sys/net/ipfw3_nat/ip_fw3_nat.c
739
int n;
sys/net/ipfw3_nat/ip_fw3_nat.c
757
for (n = 0; n < ioc->count; n++) {
sys/net/netisr2.h
130
#define IN_NETISR(n) \
sys/net/netisr2.h
131
(&curthread->td_msgport == netisr_cpuport((n)))
sys/net/netisr2.h
132
#define IN_NETISR_NCPUS(n) \
sys/net/netisr2.h
133
((n) < netisr_ncpus && IN_NETISR((n)))
sys/net/netisr2.h
136
#define ASSERT_NETISR_NCPUS(n) \
sys/net/netisr2.h
137
KASSERT(IN_NETISR_NCPUS(n), \
sys/net/netisr2.h
139
curthread, (n), netisr_ncpus))
sys/net/netmap/netmap.c
1133
int n = kring->na->num_tx_rings + 1;
sys/net/netmap/netmap.c
1139
pos < n ? "TX" : "RX", pos < n ? pos : pos - n,
sys/net/netmap/netmap.c
2066
netmap_reset(struct netmap_adapter *na, enum txrx tx, u_int n,
sys/net/netmap/netmap.c
2090
if (n >= na->num_tx_rings)
sys/net/netmap/netmap.c
2092
kring = na->tx_rings + n;
sys/net/netmap/netmap.c
2095
if (n >= na->num_rx_rings)
sys/net/netmap/netmap.c
2097
kring = na->rx_rings + n;
sys/net/netmap/netmap.c
2120
na->nm_notify(na, n, tx, NAF_GLOBAL_NOTIFY);
sys/net/netmap/netmap.c
733
u_int k = kring->ring->cur, n = kring->ring->reserved;
sys/net/netmap/netmap.c
737
if (n > 0) {
sys/net/netmap/netmap.c
738
if (k < n)
sys/net/netmap/netmap.c
740
k += n;
sys/net/netmap/netmap.c
742
for (n = kring->nr_hwcur; n != k;) {
sys/net/netmap/netmap.c
743
struct netmap_slot *slot = &kring->ring->slot[n];
sys/net/netmap/netmap.c
745
n = nm_next(n, lim);
sys/net/netmap/netmap.c
749
D("bad pkt at %d len %d", n, slot->len);
sys/net/netmap/netmap.c
889
u_int j, n, lim = kring->nkr_num_slots;
sys/net/netmap/netmap.c
917
n = k >= j ? k - j : k + lim - j;
sys/net/netmap/netmap.c
918
kring->nr_hwavail -= n;
sys/net/netmap/netmap_generic.c
353
u_int n = 0;
sys/net/netmap/netmap_generic.c
375
n++;
sys/net/netmap/netmap_generic.c
378
kring->nr_hwavail += n;
sys/net/netmap/netmap_generic.c
379
ND("tx completed [%d] -> hwavail %d", n, kring->nr_hwavail);
sys/net/netmap/netmap_generic.c
381
return n;
sys/net/netmap/netmap_generic.c
393
u_int n = kring->nkr_num_slots;
sys/net/netmap/netmap_generic.c
400
e = (hwcur + n + ntc) / 2;
sys/net/netmap/netmap_generic.c
401
if (e >= n) {
sys/net/netmap/netmap_generic.c
402
e -= n;
sys/net/netmap/netmap_generic.c
406
if (unlikely(e >= n)) {
sys/net/netmap/netmap_generic.c
575
ND("tx #%d, hwavail = %d", n, kring->nr_hwavail);
sys/net/netmap/netmap_generic.c
639
u_int j, n, lim = kring->nkr_num_slots - 1;
sys/net/netmap/netmap_generic.c
651
n = 0;
sys/net/netmap/netmap_generic.c
679
n++;
sys/net/netmap/netmap_generic.c
681
if (n) {
sys/net/netmap/netmap_generic.c
683
kring->nr_hwavail += n;
sys/net/netmap/netmap_generic.c
684
IFRATE(rate_ctx.new.rxpkt += n);
sys/net/netmap/netmap_generic.c
702
for (n = 0; j != k; n++) {
sys/net/netmap/netmap_generic.c
709
kring->nr_hwavail -= n;
sys/net/netmap/netmap_kern.h
508
nm_kr_lease(struct netmap_kring *k, u_int n, int is_rx)
sys/net/netmap/netmap_kern.h
516
if (n > nm_kr_space(k, is_rx)) {
sys/net/netmap/netmap_kern.h
517
D("invalid request for %d slots", n);
sys/net/netmap/netmap_kern.h
521
k->nkr_hwlease += n;
sys/net/netmap/netmap_kern.h
618
enum txrx tx, u_int n, u_int new_cur);
sys/net/netmap/netmap_kern.h
798
int n = kr->nkr_num_slots;
sys/net/netmap/netmap_kern.h
801
return idx + n;
sys/net/netmap/netmap_kern.h
802
else if (idx < n)
sys/net/netmap/netmap_kern.h
805
return idx - n;
sys/net/netmap/netmap_kern.h
812
int n = kr->nkr_num_slots;
sys/net/netmap/netmap_kern.h
815
return idx + n;
sys/net/netmap/netmap_kern.h
816
else if (idx < n)
sys/net/netmap/netmap_kern.h
819
return idx - n;
sys/net/netmap/netmap_mem2.c
230
int i, k = p->_clustentries, n = p->objtotal;
sys/net/netmap/netmap_mem2.c
233
for (i = 0; i < n; i += k, ofs += p->_clustsize) {
sys/net/netmap/netmap_mem2.c
251
#define netmap_if_offset(n, v) \
sys/net/netmap/netmap_mem2.c
252
netmap_obj_offset(&(n)->pools[NETMAP_IF_POOL], (v))
sys/net/netmap/netmap_mem2.c
254
#define netmap_ring_offset(n, v) \
sys/net/netmap/netmap_mem2.c
255
((n)->pools[NETMAP_IF_POOL].memtotal + \
sys/net/netmap/netmap_mem2.c
256
netmap_obj_offset(&(n)->pools[NETMAP_RING_POOL], (v)))
sys/net/netmap/netmap_mem2.c
258
#define netmap_buf_offset(n, v) \
sys/net/netmap/netmap_mem2.c
259
((n)->pools[NETMAP_IF_POOL].memtotal + \
sys/net/netmap/netmap_mem2.c
260
(n)->pools[NETMAP_RING_POOL].memtotal + \
sys/net/netmap/netmap_mem2.c
261
netmap_obj_offset(&(n)->pools[NETMAP_BUF_POOL], (v)))
sys/net/netmap/netmap_mem2.c
343
u_int i, j, n = p->numclusters;
sys/net/netmap/netmap_mem2.c
345
for (i = 0, j = 0; i < n; i++, j += p->_clustentries) {
sys/net/netmap/netmap_mem2.c
362
#define netmap_if_malloc(n, len) netmap_obj_malloc(&(n)->pools[NETMAP_IF_POOL], len, NULL, NULL)
sys/net/netmap/netmap_mem2.c
363
#define netmap_if_free(n, v) netmap_obj_free_va(&(n)->pools[NETMAP_IF_POOL], (v))
sys/net/netmap/netmap_mem2.c
364
#define netmap_ring_malloc(n, len) netmap_obj_malloc(&(n)->pools[NETMAP_RING_POOL], len, NULL, NULL)
sys/net/netmap/netmap_mem2.c
365
#define netmap_ring_free(n, v) netmap_obj_free_va(&(n)->pools[NETMAP_RING_POOL], (v))
sys/net/netmap/netmap_mem2.c
366
#define netmap_buf_malloc(n, _pos, _index) \
sys/net/netmap/netmap_mem2.c
367
netmap_obj_malloc(&(n)->pools[NETMAP_BUF_POOL], NETMAP_BDG_BUF_SIZE(n), _pos, _index)
sys/net/netmap/netmap_mem2.c
371
#define netmap_buf_index(n, v) \
sys/net/netmap/netmap_mem2.c
372
(netmap_obj_offset(&(n)->pools[NETMAP_BUF_POOL], (v)) / NETMAP_BDG_BUF_SIZE(n))
sys/net/netmap/netmap_mem2.c
377
netmap_new_bufs(struct netmap_mem_d *nmd, struct netmap_slot *slot, u_int n)
sys/net/netmap/netmap_mem2.c
384
for (i = 0; i < n; i++) {
sys/net/netmap/netmap_mem2.c
399
ND("allocated %d buffers, %d available, first at %d", n, p->objfree, pos);
sys/net/netmap/netmap_mem2.c
407
bzero(slot, n * sizeof(slot[0]));
sys/net/netmap/netmap_mem2.c
44
#define NMA_LOCK_INIT(n) lockinit(&(n)->nm_mtx, "netmap memory allocator lock", 0, LK_CANRECURSE)
sys/net/netmap/netmap_mem2.c
45
#define NMA_LOCK_DESTROY(n) lockuninit(&(n)->nm_mtx)
sys/net/netmap/netmap_mem2.c
46
#define NMA_LOCK(n) lockmgr(&(n)->nm_mtx, LK_EXCLUSIVE)
sys/net/netmap/netmap_mem2.c
47
#define NMA_UNLOCK(n) lockmgr(&(n)->nm_mtx, LK_RELEASE)
sys/net/netmap/netmap_mem2.c
559
size_t n;
sys/net/netmap/netmap_mem2.c
565
n = sizeof(struct lut_entry) * p->objtotal;
sys/net/netmap/netmap_mem2.c
566
p->lut = kmalloc(n, M_NETMAP, M_NOWAIT | M_ZERO);
sys/net/netmap/netmap_mem2.c
568
D("Unable to create lookup table (%d bytes) for '%s'", (int)n, p->name);
sys/net/netmap/netmap_mem2.c
573
n = (p->objtotal + 31) / 32;
sys/net/netmap/netmap_mem2.c
574
p->bitmap = kmalloc(sizeof(uint32_t) * n, M_NETMAP, M_NOWAIT | M_ZERO);
sys/net/netmap/netmap_mem2.c
576
D("Unable to create bitmap (%d entries) for allocator '%s'", (int)n,
sys/net/netmap/netmap_mem2.c
580
p->bitmap_slots = n;
sys/net/netmap/netmap_mem2.c
586
n = p->_clustsize;
sys/net/netmap/netmap_mem2.c
591
clust = contigmalloc(n, M_NETMAP, M_NOWAIT | M_ZERO,
sys/net/netmap/netmap_mem2.c
607
n, M_NETMAP);
sys/net/netmap/netmap_mem2.h
210
#define NETMAP_BDG_BUF_SIZE(n) ((n)->pools[NETMAP_BUF_POOL]._objsize)
sys/net/netmap/netmap_user.h
176
u_int n;
sys/net/netmap/netmap_user.h
227
for (n = d->first_ring; n <= d->last_ring; n++) {
sys/net/netmap/netmap_user.h
228
struct netmap_ring *ring = NETMAP_RXRING(d->nifp, n);
sys/net/netmap/netmap_user.h
262
int n = d->last_ring - d->first_ring + 1;
sys/net/netmap/netmap_user.h
271
for (c=0; c < n && cnt != got; c++) {
sys/net/netmap/netmap_vale.c
1143
nm_bdg_flush(struct nm_bdg_fwd *ft, u_int n, struct netmap_vp_adapter *na,
sys/net/netmap/netmap_vale.c
1161
for (i = 0; likely(i < n); i += ft[i].ft_frags) {
sys/net/netmap/netmap_vale.c
1218
ND(5, "pass 1 done %d pkts %d dsts", n, num_dsts);
sys/net/netmap/netmap_vale.c
1491
int n;
sys/net/netmap/netmap_vale.c
1496
n = netmap_ring_reinit(kring);
sys/net/netmap/netmap_vale.c
1511
n = k - j;
sys/net/netmap/netmap_vale.c
1512
if (n < 0)
sys/net/netmap/netmap_vale.c
1513
n += kring->nkr_num_slots;
sys/net/netmap/netmap_vale.c
1514
ND("userspace releases %d packets", n);
sys/net/netmap/netmap_vale.c
1515
for (n = 0; likely(j != k); n++) {
sys/net/netmap/netmap_vale.c
1526
kring->nr_hwavail -= n;
sys/net/netmap/netmap_vale.c
1531
n = 0;
sys/net/netmap/netmap_vale.c
1534
return n;
sys/net/netmap/netmap_vale.c
951
nm_bdg_flush(struct nm_bdg_fwd *ft, u_int n,
sys/net/pf/if_pfsync.c
567
&tree_id[n], st);
sys/net/pf/if_pfsync.c
591
&pf_statetbl[n], sk);
sys/net/pf/pf.c
113
#define DPFPRINTF(n, x) if (pf_status.debug >= (n)) kprintf x
sys/net/pf/pf.c
1375
u_int32_t n; /* timeout retention 0-100% */
sys/net/pf/pf.c
1384
n = (states - start) * 100 / (end - start);
sys/net/pf/pf.c
1385
if (n > 100)
sys/net/pf/pf.c
1386
n = 0;
sys/net/pf/pf.c
1388
n = 100 - n;
sys/net/pf/pf.c
1399
timeout, n, pkts, n + (100 - n) * pkts / 200);
sys/net/pf/pf.c
1402
n += (100 - n) * pkts / 200; /* recover by up-to 50% */
sys/net/pf/pf.c
1403
timeout = timeout * n / 100;
sys/net/pf/pf.c
2347
pf_match_addr(u_int8_t n, struct pf_addr *a, struct pf_addr *m,
sys/net/pf/pf.c
2375
if (n)
sys/net/pf/pf.c
2380
if (n)
sys/net/pf/pf.c
2501
pf_step_into_anchor(int *depth, struct pf_ruleset **rs, int n,
sys/net/pf/pf.c
2531
*r = TAILQ_FIRST((*rs)->rules[n].active.ptr);
sys/net/pf/pf.c
2535
pf_step_out_of_anchor(int *depth, struct pf_ruleset **rs, int n,
sys/net/pf/pf.c
2554
*r = TAILQ_FIRST((*rs)->rules[n].active.ptr);
sys/net/pf/pf.c
6859
struct mbuf *m = *m0, *n = NULL;
sys/net/pf/pf.c
7010
if (!n)
sys/net/pf/pf.c
7011
n = m;
sys/net/pf/pf.c
7108
if (n != m) {
sys/net/pf/pf.c
7109
m_freem(n);
sys/net/pf/pf.c
7110
n = NULL;
sys/net/pf/pf_if.c
767
int n = 0;
sys/net/pf/pf_if.c
774
if (*size > n++) {
sys/net/pf/pf_if.c
788
*size = n;
sys/net/pf/pf_if.c
796
int n;
sys/net/pf/pf_if.c
802
n = strlen(filter);
sys/net/pf/pf_if.c
803
if (n < 1 || n >= IFNAMSIZ)
sys/net/pf/pf_if.c
805
if (filter[n-1] >= '0' && filter[n-1] <= '9')
sys/net/pf/pf_ioctl.c
138
#define DPFPRINTF(n, x) if (pf_status.debug >= (n)) kprintf x
sys/net/pf/pf_ioctl.c
1777
int n;
sys/net/pf/pf_ioctl.c
1781
for (n = 0; n < ncpus; ++n) {
sys/net/pf/pf_ioctl.c
1782
pfc = &pf_counters[n];
sys/net/pf/pf_ioctl.c
2850
struct pf_src_node *n, *p, *pstore;
sys/net/pf/pf_ioctl.c
2857
RB_FOREACH(n, pf_src_tree,
sys/net/pf/pf_ioctl.c
2876
RB_FOREACH(n, pf_src_tree, &tree_src_tracking[nn]) {
sys/net/pf/pf_ioctl.c
2884
bcopy(n, pstore, sizeof(*pstore));
sys/net/pf/pf_ioctl.c
2885
if (n->rule.ptr != NULL)
sys/net/pf/pf_ioctl.c
2886
pstore->rule.nr = n->rule.ptr->nr;
sys/net/pf/pf_ioctl.c
2894
diff = secs - n->conn_rate.last;
sys/net/pf/pf_ioctl.c
2895
if (diff >= n->conn_rate.seconds)
sys/net/pf/pf_ioctl.c
2899
n->conn_rate.count * diff /
sys/net/pf/pf_ioctl.c
2900
n->conn_rate.seconds;
sys/net/pf/pf_ioctl.c
2917
struct pf_src_node *n;
sys/net/pf/pf_ioctl.c
2932
RB_FOREACH(n, pf_src_tree, &tree_src_tracking[nn]) {
sys/net/pf/pf_ioctl.c
2933
n->expire = 1;
sys/net/pf/pf_ioctl.c
2934
n->states = 0;
sys/net/pf/pf_ioctl.c
3102
struct pf_src_node *n;
sys/net/pf/pf_ioctl.c
3113
RB_FOREACH(n, pf_src_tree, &tree_src_tracking[nn]) {
sys/net/pf/pf_ioctl.c
3114
n->expire = 1;
sys/net/pf/pf_ioctl.c
3115
n->states = 0;
sys/net/pf/pf_norm.c
116
int n;
sys/net/pf/pf_norm.c
137
for (n = 0; n < ncpus; ++n) {
sys/net/pf/pf_norm.c
138
TAILQ_INIT(&pf_fragqueue[n]);
sys/net/pf/pf_norm.c
139
TAILQ_INIT(&pf_cachequeue[n]);
sys/net/pf/pf_norm.c
140
RB_INIT(&pf_frag_tree[n]);
sys/net/pf/pf_norm.c
141
RB_INIT(&pf_cache_tree[n]);
sys/net/pf/pf_table.c
1277
int n, nn;
sys/net/pf/pf_table.c
1282
n = nn = pfr_table_count(filter, flags);
sys/net/pf/pf_table.c
1283
if (n < 0)
sys/net/pf/pf_table.c
1285
if (n > *size) {
sys/net/pf/pf_table.c
1286
*size = n;
sys/net/pf/pf_table.c
1292
if (n-- <= 0)
sys/net/pf/pf_table.c
1297
if (n) {
sys/net/pf/pf_table.c
1298
kprintf("pfr_get_tables: corruption detected (%d).\n", n);
sys/net/pf/pf_table.c
1311
int n, nn;
sys/net/pf/pf_table.c
1318
n = nn = pfr_table_count(filter, flags);
sys/net/pf/pf_table.c
1319
if (n < 0)
sys/net/pf/pf_table.c
1321
if (n > *size) {
sys/net/pf/pf_table.c
1322
*size = n;
sys/net/pf/pf_table.c
1331
if (n-- <= 0)
sys/net/pf/pf_table.c
1348
if (n) {
sys/net/pf/pf_table.c
1349
kprintf("pfr_get_tstats: corruption detected (%d).\n", n);
sys/net/pf/pf_table.c
845
int rv, n = 0;
sys/net/pf/pf_table.c
855
n++;
sys/net/pf/pf_table.c
857
kt->pfrkt_cnt += n;
sys/net/pf/pf_table.c
888
int n = 0;
sys/net/pf/pf_table.c
892
n++;
sys/net/pf/pf_table.c
894
kt->pfrkt_cnt -= n;
sys/net/pf/pfvar.h
304
#define PF_MATCHA(n, a, m, b, f) \
sys/net/pf/pfvar.h
305
pf_match_addr(n, a, m, b, f)
sys/net/pf/pfvar.h
340
#define PF_MATCHA(n, a, m, b, f) \
sys/net/pf/pfvar.h
341
pf_match_addr(n, a, m, b, f)
sys/net/pf/pfvar.h
366
#define PF_MATCHA(n, a, m, b, f) \
sys/net/pf/pfvar.h
367
pf_match_addr(n, a, m, b, f)
sys/net/ppp_layer/slcompress.c
101
*cp++ = (n); \
sys/net/ppp_layer/slcompress.c
104
#define ENCODEZ(n) { \
sys/net/ppp_layer/slcompress.c
105
if ((u_int16_t)(n) >= 256 || (u_int16_t)(n) == 0) { \
sys/net/ppp_layer/slcompress.c
107
cp[1] = (n); \
sys/net/ppp_layer/slcompress.c
108
cp[0] = (n) >> 8; \
sys/net/ppp_layer/slcompress.c
111
*cp++ = (n); \
sys/net/ppp_layer/slcompress.c
60
#define BCMP(p1, p2, n) bcmp((char *)(p1), (char *)(p2), (int)(n))
sys/net/ppp_layer/slcompress.c
61
#define BCOPY(p1, p2, n) bcopy((char *)(p1), (char *)(p2), (int)(n))
sys/net/ppp_layer/slcompress.c
94
#define ENCODE(n) { \
sys/net/ppp_layer/slcompress.c
95
if ((u_int16_t)(n) >= 256) { \
sys/net/ppp_layer/slcompress.c
97
cp[1] = (n); \
sys/net/ppp_layer/slcompress.c
98
cp[0] = (n) >> 8; \
sys/net/radix.c
203
const u_char *m, *n, *lim, *lim2;
sys/net/radix.c
208
n = _n;
sys/net/radix.c
209
lim2 = lim = n + clen(n);
sys/net/radix.c
210
longer = clen(n++) - clen(m++);
sys/net/radix.c
215
while (n < lim) {
sys/net/radix.c
216
if (*n & ~(*m))
sys/net/radix.c
218
if (*n++ != *m++)
sys/net/radix.c
221
while (n < lim2) {
sys/net/radix.c
222
if (*n++) /* n is longer and more specific */
sys/net/radix.c
643
const u_char *m, *n, *lim;
sys/net/radix.c
646
n = _n;
sys/net/radix.c
648
if (clen(m) > clen(n)) {
sys/net/radix.c
653
if (clen(m) == clen(n)) {
sys/net/radix.c
654
for (lim = m + clen(m); m < lim; m++, n++) {
sys/net/radix.c
655
if (*m > *n)
sys/net/radix.h
193
#define R_Malloc(p, t, n) \
sys/net/radix.h
194
(p = (t) kmalloc((n), M_RTABLE, M_INTWAIT | M_NULLOK))
sys/net/radix.h
201
#define R_Malloc(p, t, n) (p = (t) malloc((n)))
sys/net/radix.h
215
bool rn_refines(const void *m, const void *n);
sys/net/raw_usrreq.c
112
struct mbuf *n;
sys/net/raw_usrreq.c
114
n = m_copypacket(m, M_NOWAIT);
sys/net/raw_usrreq.c
115
if (n != NULL) {
sys/net/raw_usrreq.c
117
if (ssb_appendaddr(&last->so_rcv, src, n,
sys/net/raw_usrreq.c
119
m_freem(n);
sys/net/route.c
1779
struct radix_node *n;
sys/net/route.c
1782
n = rn_addmask(mask, search, true, rn_cpumaskhead(mycpuid));
sys/net/route.c
1783
if (n != NULL &&
sys/net/route.c
1784
mask->sa_len >= clen(n->rn_key) &&
sys/net/route.c
1786
n->rn_key + 1, clen(n->rn_key) - 1) == 0) {
sys/net/route.c
1787
return __DECONST(struct sockaddr *, n->rn_key);
sys/net/route.h
314
#define RT_ROUNDUP2(a, n) ((a) > 0 ? (1 + (((a) - 1) | ((n) - 1))) : (n))
sys/net/route.h
316
#define RT_ADVANCE(x, n) (x += RT_ROUNDUP((n)->sa_len))
sys/net/rtsock.c
1159
struct mbuf *m, *n;
sys/net/rtsock.c
1183
n = m_getc(len - dlen, M_NOWAIT, MT_DATA);
sys/net/rtsock.c
1184
if (n == NULL) {
sys/net/rtsock.c
1188
m_cat(m, n);
sys/net/rtsock.c
1459
struct mbuf *n = m_get(M_NOWAIT, MT_DATA);
sys/net/rtsock.c
1460
if (n == NULL) {
sys/net/rtsock.c
1464
KKASSERT(data_len <= M_TRAILINGSPACE(n));
sys/net/rtsock.c
1465
bcopy(data, mtod(n, void *), data_len);
sys/net/rtsock.c
1466
n->m_len = data_len;
sys/net/rtsock.c
1467
m->m_next = n;
sys/net/wg/if_wg.c
106
#define WG_PKT_WITH_PADDING(n) \
sys/net/wg/if_wg.c
107
(((n) + (WG_PKT_PADDING - 1)) & ~(WG_PKT_PADDING - 1))
sys/net/wg/if_wg.c
108
#define WG_PKT_ENCRYPTED_LEN(n) \
sys/net/wg/if_wg.c
109
(offsetof(struct wg_pkt_data, buf[(n)]) + NOISE_AUTHTAG_LEN)
sys/net/wg/selftest/allowedips.c
117
uint8_t n;
sys/net/wg/selftest/allowedips.c
121
if ((n = cidr % 32) != 0)
sys/net/wg/selftest/allowedips.c
123
(uint32_t)htonl((0xFFFFFFFFUL << (32 - n)) & 0xFFFFFFFFUL);
sys/net/wg/selftest/allowedips.c
161
#define IP6MATCH_SEG(ip, node, n) \
sys/net/wg/selftest/allowedips.c
162
((ip->__u6_addr.__u6_addr32[n] & node->mask.ip6[n]) \
sys/net/wg/selftest/allowedips.c
163
== node->ip.ip6[n])
sys/net/wg/selftest/allowedips.c
521
#define T_INSERT(n, peer, af, ipa, ipb, ipc, ipd, cidr) do { \
sys/net/wg/selftest/allowedips.c
526
kprintf("%s: insert #%d: FAIL\n", __func__, n); \
sys/net/wg/selftest/allowedips.c
531
#define T_LOOKUP(n, op, peer, af, ipa, ipb, ipc, ipd) do { \
sys/net/wg/selftest/allowedips.c
536
kprintf("%s: lookup #%d: FAIL\n", __func__, n); \
sys/net/zlib.c
1445
unsigned n, m;
sys/net/zlib.c
1480
n = s->hash_size;
sys/net/zlib.c
1481
p = &s->head[n];
sys/net/zlib.c
1485
} while (--n);
sys/net/zlib.c
1487
n = wsize;
sys/net/zlib.c
1488
p = &s->prev[n];
sys/net/zlib.c
1495
} while (--n);
sys/net/zlib.c
1513
n = read_buf(s->strm, (charf *)s->window + s->strstart + s->lookahead,
sys/net/zlib.c
1515
s->lookahead += n;
sys/net/zlib.c
2064
int n; /* iterates over tree elements */
sys/net/zlib.c
2078
for (n = 0; n < (1<<extra_lbits[code]); n++) {
sys/net/zlib.c
2093
for (n = 0; n < (1<<extra_dbits[code]); n++) {
sys/net/zlib.c
2101
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
sys/net/zlib.c
2109
n = 0;
sys/net/zlib.c
2110
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
sys/net/zlib.c
2111
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
sys/net/zlib.c
2112
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
sys/net/zlib.c
2113
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
sys/net/zlib.c
2121
for (n = 0; n < D_CODES; n++) {
sys/net/zlib.c
2122
static_dtree[n].Len = 5;
sys/net/zlib.c
2123
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
sys/net/zlib.c
2164
int n; /* iterates over tree elements */
sys/net/zlib.c
2167
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
sys/net/zlib.c
2168
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
sys/net/zlib.c
2169
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
sys/net/zlib.c
2195
#define smaller(tree, n, m, depth) \
sys/net/zlib.c
2196
(tree[n].Freq < tree[m].Freq || \
sys/net/zlib.c
2197
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
sys/net/zlib.c
2255
int n, m; /* iterate over the tree elements */
sys/net/zlib.c
2269
n = s->heap[h];
sys/net/zlib.c
2270
bits = tree[tree[n].Dad].Len + 1;
sys/net/zlib.c
2272
tree[n].Len = (ush)bits;
sys/net/zlib.c
2275
if (n > max_code) continue; /* not a leaf node */
sys/net/zlib.c
2279
if (n >= base) xbits = extra[n-base];
sys/net/zlib.c
2280
f = tree[n].Freq;
sys/net/zlib.c
2282
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
sys/net/zlib.c
2308
n = s->bl_count[bits];
sys/net/zlib.c
2309
while (n != 0) {
sys/net/zlib.c
2318
n--;
sys/net/zlib.c
2342
int n; /* code index */
sys/net/zlib.c
2357
for (n = 0; n <= max_code; n++) {
sys/net/zlib.c
2358
int len = tree[n].Len;
sys/net/zlib.c
2361
tree[n].Code = bi_reverse(next_code[len]++, len);
sys/net/zlib.c
2364
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
sys/net/zlib.c
2385
int n, m; /* iterate over heap elements */
sys/net/zlib.c
2395
for (n = 0; n < elems; n++) {
sys/net/zlib.c
2396
if (tree[n].Freq != 0) {
sys/net/zlib.c
2397
s->heap[++(s->heap_len)] = max_code = n;
sys/net/zlib.c
2398
s->depth[n] = 0;
sys/net/zlib.c
2400
tree[n].Len = 0;
sys/net/zlib.c
2421
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
sys/net/zlib.c
2428
pqremove(s, tree, n); /* n = node of least frequency */
sys/net/zlib.c
2431
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
sys/net/zlib.c
2435
tree[node].Freq = tree[n].Freq + tree[m].Freq;
sys/net/zlib.c
2436
s->depth[node] = (uch) (MAX(s->depth[n], s->depth[m]) + 1);
sys/net/zlib.c
2437
tree[n].Dad = tree[m].Dad = (ush)node;
sys/net/zlib.c
2441
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
sys/net/zlib.c
2472
int n; /* iterates over all tree elements */
sys/net/zlib.c
2483
for (n = 0; n <= max_code; n++) {
sys/net/zlib.c
2484
curlen = nextlen; nextlen = tree[n+1].Len;
sys/net/zlib.c
2519
int n; /* iterates over all tree elements */
sys/net/zlib.c
2530
for (n = 0; n <= max_code; n++) {
sys/net/zlib.c
2531
curlen = nextlen; nextlen = tree[n+1].Len;
sys/net/zlib.c
2916
int n = 0;
sys/net/zlib.c
2919
while (n < 7) bin_freq += s->dyn_ltree[n++].Freq;
sys/net/zlib.c
2920
while (n < 128) ascii_freq += s->dyn_ltree[n++].Freq;
sys/net/zlib.c
2921
while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;
sys/net/zlib.c
3056
uInt n)); /* dictionary length */
sys/net/zlib.c
3381
uInt n; /* number of bytes to look at */
sys/net/zlib.c
3394
if ((n = z->avail_in) == 0)
sys/net/zlib.c
3400
while (n && m < 4)
sys/net/zlib.c
3408
p++, n--;
sys/net/zlib.c
3414
z->avail_in = n;
sys/net/zlib.c
3600
#define UPDIN {z->avail_in=n;z->total_in+=p-z->next_in;z->next_in=p;}
sys/net/zlib.c
3605
#define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;}
sys/net/zlib.c
3606
#define NEEDBYTE {if(n)r=Z_OK;else LEAVE}
sys/net/zlib.c
3607
#define NEXTBYTE (n--,*p++)
sys/net/zlib.c
3746
uInt n; /* bytes available there */
sys/net/zlib.c
3819
if (n == 0)
sys/net/zlib.c
3823
if (t > n) t = n;
sys/net/zlib.c
3826
p += t; n -= t;
sys/net/zlib.c
3991
n++;
sys/net/zlib.c
4025
inflate_set_dictionary(inflate_blocks_statef *s, const Bytef *d, uInt n)
sys/net/zlib.c
4027
zmemcpy((charf *)s->window, d, n);
sys/net/zlib.c
4028
s->read = s->write = s->window + n;
sys/net/zlib.c
4046
uInt n; /* bytes available there */
sys/net/zlib.c
4060
while (n) {
sys/net/zlib.c
4061
t = n; /* how many to do */
sys/net/zlib.c
4070
n -= t;
sys/net/zlib.c
4217
huft_build(uIntf *b, uInt n, uInt s, const uIntf *d, const uIntf *e,
sys/net/zlib.c
4248
p = b; i = n;
sys/net/zlib.c
4252
if (c[0] == n) /* null input--all zero length codes */
sys/net/zlib.c
4299
} while (++i < n);
sys/net/zlib.c
4300
n = x[g]; /* set n to length of v */
sys/net/zlib.c
4371
if (p >= v + n)
sys/net/zlib.c
4511
zfalloc(voidpf q, uInt n, uInt s)
sys/net/zlib.c
4513
Assert(s == sizeof(inflate_huft) && n <= *(intf *)q,
sys/net/zlib.c
4515
*(intf *)q -= n+s-s; /* s-s to avoid warning */
sys/net/zlib.c
4716
uInt n; /* bytes available there */
sys/net/zlib.c
4730
if (m >= 258 && n >= 10)
sys/net/zlib.c
4901
uInt n;
sys/net/zlib.c
4910
n = (uInt)((q <= s->write ? s->write : s->end) - q);
sys/net/zlib.c
4911
if (n > z->avail_out) n = z->avail_out;
sys/net/zlib.c
4912
if (n && r == Z_BUF_ERROR) r = Z_OK;
sys/net/zlib.c
4915
z->avail_out -= n;
sys/net/zlib.c
4916
z->total_out += n;
sys/net/zlib.c
4920
z->adler = s->check = (*s->checkfn)(s->check, q, n);
sys/net/zlib.c
4924
zmemcpy(p, q, n);
sys/net/zlib.c
4925
p += n;
sys/net/zlib.c
4927
q += n;
sys/net/zlib.c
4938
n = (uInt)(s->write - q);
sys/net/zlib.c
4939
if (n > z->avail_out) n = z->avail_out;
sys/net/zlib.c
4940
if (n && r == Z_BUF_ERROR) r = Z_OK;
sys/net/zlib.c
4943
z->avail_out -= n;
sys/net/zlib.c
4944
z->total_out += n;
sys/net/zlib.c
4948
z->adler = s->check = (*s->checkfn)(s->check, q, n);
sys/net/zlib.c
4952
zmemcpy(p, q, n);
sys/net/zlib.c
4953
p += n;
sys/net/zlib.c
4955
q += n;
sys/net/zlib.c
4992
#define UNGRAB {n+=(c=k>>3);p-=c;k&=7;}
sys/net/zlib.c
5011
uInt n; /* bytes available there */
sys/net/zlib.c
5131
} while (m >= 258 && n >= 10);
sys/net/zlib.c
5268
int n;
sys/net/zlib.c
5274
for (n = 0; n < next_ptr; n++) {
sys/net/zlib.c
5275
if (ptr != table[n].new_ptr) continue;
sys/net/zlib.c
5277
farfree(table[n].org_ptr);
sys/net/zlib.c
5278
while (++n < next_ptr) {
sys/net/zlib.c
5279
table[n-1] = table[n];
sys/net/zlib.c
832
uInt n;
sys/net/zlib.c
860
for (n = 0; n <= length - MIN_MATCH; n++) {
sys/net/zlib.c
861
INSERT_STRING(s, n, hash_head);
sys/netbt/bluetooth.h
137
# define DPRINTFN(n, fmt, args...) do { \
sys/netbt/bluetooth.h
138
if (bluetooth_debug > (n)) \
sys/netbt/hci_link.c
538
struct mbuf *n = NULL;
sys/netbt/hci_link.c
568
n = m_split(m, mlen, M_NOWAIT);
sys/netbt/hci_link.c
569
if (n == NULL)
sys/netbt/hci_link.c
581
m = n;
sys/netbt/l2cap_lower.c
67
struct l2cap_req *req, *n;
sys/netbt/l2cap_lower.c
88
n = TAILQ_NEXT(req, lr_next);
sys/netbt/l2cap_lower.c
92
req = n;
sys/netgraph/async/ng_async.c
530
struct mbuf *n;
sys/netgraph/async/ng_async.c
566
if ((n = m_devget(sc->sbuf + skip,
sys/netgraph/async/ng_async.c
569
NG_SEND_DATA(error, sc->sync, n, meta);
sys/netgraph/fec/ng_fec.c
957
struct ng_fec_portlist *n = NULL;
sys/netgraph/fec/ng_fec.c
959
n = TAILQ_NEXT(p, fec_list);
sys/netgraph/fec/ng_fec.c
960
if (n == NULL)
sys/netgraph/fec/ng_fec.c
961
n = TAILQ_FIRST(&b->ng_fec_ports);
sys/netgraph/fec/ng_fec.c
962
while (n != p) {
sys/netgraph/fec/ng_fec.c
963
if (n->fec_ifstat == 1)
sys/netgraph/fec/ng_fec.c
965
n = TAILQ_NEXT(n, fec_list);
sys/netgraph/fec/ng_fec.c
966
if (n == NULL)
sys/netgraph/fec/ng_fec.c
967
n = TAILQ_FIRST(&b->ng_fec_ports);
sys/netgraph/fec/ng_fec.c
969
if (n == p)
sys/netgraph/fec/ng_fec.c
971
p = n;
sys/netgraph/ksocket/ng_ksocket.c
1048
struct mbuf *n;
sys/netgraph/ksocket/ng_ksocket.c
1071
for (n = sio.sb_mb; n != NULL; n = n->m_next)
sys/netgraph/ksocket/ng_ksocket.c
1072
sio.sb_mb->m_pkthdr.len += n->m_len;
sys/netgraph/mppc/ng_mppc.h
59
#define MPPC_MAX_BLOWUP(n) ((n) * 9 / 8 + 26)
sys/netgraph/netgraph/ng_base.c
110
struct mbuf *n; \
sys/netgraph/netgraph/ng_base.c
115
for (total = 0, n = (m); n != NULL; n = n->m_next) \
sys/netgraph/netgraph/ng_base.c
116
total += n->m_len; \
sys/netgraph/ng_device.c
229
int n = 0;
sys/netgraph/ng_device.c
246
for(n = 0;n<MAX_NGD && unit == -1;n++) {
sys/netgraph/ng_device.c
249
if(tmp->unit == n) {
sys/netgraph/ng_device.c
253
unit = n;
sys/netgraph/ppp/ng_ppp.c
1548
struct mbuf *n = m_split(m, len, M_NOWAIT);
sys/netgraph/ppp/ng_ppp.c
1550
if (n == NULL) {
sys/netgraph/ppp/ng_ppp.c
1554
m = n;
sys/netgraph7/async/ng_async.c
556
struct mbuf *n;
sys/netgraph7/async/ng_async.c
592
if ((n = m_devget(sc->sbuf + skip,
sys/netgraph7/async/ng_async.c
596
sc->sync, n);
sys/netgraph7/async/ng_async.c
599
sc->sync ,n);
sys/netgraph7/bluetooth/drivers/bt3c/ng_bt3c_var.h
85
#define NG_BT3C_STAT_BYTES_SENT(s, n) (s).bytes_sent += (n)
sys/netgraph7/bluetooth/drivers/bt3c/ng_bt3c_var.h
87
#define NG_BT3C_STAT_BYTES_RECV(s, n) (s).bytes_recv += (n)
sys/netgraph7/bluetooth/drivers/h4/ng_h4_var.h
79
#define NG_H4_STAT_BYTES_SENT(s, n) (s).bytes_sent += (n)
sys/netgraph7/bluetooth/drivers/h4/ng_h4_var.h
81
#define NG_H4_STAT_BYTES_RECV(s, n) (s).bytes_recv += (n)
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1065
int n;
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1072
for (n = 0; n < nframes; n ++)
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1073
if (ubt_isoc_read_one_frame(xfer, n) < 0)
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1079
for (n = 0; n < nframes; n ++)
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1080
usbd_xfer_set_frame_len(xfer, n,
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1195
int n, space, offset;
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1224
n = min(space, m->m_pkthdr.len);
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1225
if (n > 0) {
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1226
usbd_m_copy_in(pc, offset, m,0, n);
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1227
m_adj(m, n);
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1229
offset += n;
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1230
space -= n;
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1252
for (n = 0; n < nframes; n ++) {
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1253
usbd_xfer_set_frame_len(xfer, n,
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt.c
1255
offset -= usbd_xfer_frame_len(xfer, n);
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt_var.h
84
#define UBT_STAT_BYTES_SENT(sc, n) (sc)->sc_stat.bytes_sent += (n)
sys/netgraph7/bluetooth/drivers/ubt/ng_ubt_var.h
86
#define UBT_STAT_BYTES_RECV(sc, n) (sc)->sc_stat.bytes_recv += (n)
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1017
n = ng_hci_get_neighbor(unit, &con->bdaddr);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1018
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1019
n = ng_hci_new_neighbor(unit);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1020
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1025
bcopy(&con->bdaddr, &n->bdaddr, sizeof(n->bdaddr));
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1027
getmicrotime(&n->updated);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1029
n->clock_offset = le16toh(ep->clock_offset);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1086
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1096
n = ng_hci_get_neighbor(unit, &ep->bdaddr);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1097
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1098
n = ng_hci_new_neighbor(unit);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1099
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1104
bcopy(&ep->bdaddr, &n->bdaddr, sizeof(n->bdaddr));
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1106
getmicrotime(&n->updated);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1108
n->page_scan_mode = ep->page_scan_mode;
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1120
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1130
n = ng_hci_get_neighbor(unit, &ep->bdaddr);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1131
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1132
n = ng_hci_new_neighbor(unit);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1133
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1138
bcopy(&ep->bdaddr, &n->bdaddr, sizeof(n->bdaddr));
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1140
getmicrotime(&n->updated);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
1142
n->page_scan_rep_mode = ep->page_scan_rep_mode;
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
376
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
393
n = ng_hci_get_neighbor(unit, &bdaddr);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
394
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
396
n = ng_hci_new_neighbor(unit);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
397
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
402
getmicrotime(&n->updated);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
404
bcopy(&bdaddr, &n->bdaddr, sizeof(n->bdaddr));
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
408
n->page_scan_rep_mode = *mtod(event, u_int8_t *);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
414
n->page_scan_mode = *mtod(event, u_int8_t *);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
421
m_copydata(event, 0, sizeof(n->clock_offset),
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
422
&n->clock_offset);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
423
n->clock_offset = le16toh(n->clock_offset);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
738
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
761
n = ng_hci_get_neighbor(unit, &con->bdaddr);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
762
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
763
n = ng_hci_new_neighbor(unit);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
764
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
769
bcopy(&con->bdaddr, &n->bdaddr, sizeof(n->bdaddr));
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
771
getmicrotime(&n->updated);
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
773
bcopy(ep->features, n->features, sizeof(n->features));
sys/netgraph7/bluetooth/hci/ng_hci_evnt.c
995
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_main.c
453
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_main.c
459
for (n = LIST_FIRST(&unit->neighbors); n != NULL; ) {
sys/netgraph7/bluetooth/hci/ng_hci_main.c
460
ng_hci_neighbor_p nn = LIST_NEXT(n, next);
sys/netgraph7/bluetooth/hci/ng_hci_main.c
462
if (ng_hci_neighbor_stale(n))
sys/netgraph7/bluetooth/hci/ng_hci_main.c
463
ng_hci_free_neighbor(n);
sys/netgraph7/bluetooth/hci/ng_hci_main.c
467
n = nn;
sys/netgraph7/bluetooth/hci/ng_hci_main.c
485
LIST_FOREACH(n, &unit->neighbors, next) {
sys/netgraph7/bluetooth/hci/ng_hci_main.c
486
e2->page_scan_rep_mode = n->page_scan_rep_mode;
sys/netgraph7/bluetooth/hci/ng_hci_main.c
487
e2->page_scan_mode = n->page_scan_mode;
sys/netgraph7/bluetooth/hci/ng_hci_main.c
488
e2->clock_offset = n->clock_offset;
sys/netgraph7/bluetooth/hci/ng_hci_main.c
489
bcopy(&n->bdaddr, &e2->bdaddr,
sys/netgraph7/bluetooth/hci/ng_hci_main.c
491
bcopy(&n->features, &e2->features,
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
177
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
179
n = kmalloc(sizeof(*n), M_NETGRAPH_HCI, M_WAITOK | M_NULLOK | M_ZERO);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
180
if (n != NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
181
getmicrotime(&n->updated);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
182
LIST_INSERT_HEAD(&unit->neighbors, n, next);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
185
return (n);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
193
ng_hci_free_neighbor(ng_hci_neighbor_p n)
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
195
LIST_REMOVE(n, next);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
196
bzero(n, sizeof(*n));
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
197
kfree(n, M_NETGRAPH_HCI);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
218
ng_hci_neighbor_p n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
220
for (n = LIST_FIRST(&unit->neighbors); n != NULL; ) {
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
221
ng_hci_neighbor_p nn = LIST_NEXT(n, next);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
223
if (!ng_hci_neighbor_stale(n)) {
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
224
if (bcmp(&n->bdaddr, bdaddr, sizeof(*bdaddr)) == 0)
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
227
ng_hci_free_neighbor(n); /* remove old entry */
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
229
n = nn;
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
232
return (n);
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
240
ng_hci_neighbor_stale(ng_hci_neighbor_p n)
sys/netgraph7/bluetooth/hci/ng_hci_misc.c
246
return (now.tv_sec - n->updated.tv_sec > bluetooth_hci_max_neighbor_age());
sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c
117
ng_hci_neighbor_t *n = NULL;
sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c
267
n = ng_hci_get_neighbor(unit, &ep->bdaddr);
sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c
268
if (n == NULL) {
sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c
273
req->cp.page_scan_rep_mode = n->page_scan_rep_mode;
sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c
274
req->cp.page_scan_mode = n->page_scan_mode;
sys/netgraph7/bluetooth/hci/ng_hci_ulpi.c
275
req->cp.clock_offset = htole16(n->clock_offset);
sys/netgraph7/bluetooth/hci/ng_hci_var.h
112
#define NG_HCI_BUFF_SCO_SET(b, n, s, f) \
sys/netgraph7/bluetooth/hci/ng_hci_var.h
116
(b).sco_pkts = (n); \
sys/netgraph7/bluetooth/hci/ng_hci_var.h
143
#define NG_HCI_STAT_ACL_SENT(s, n) (s).acl_sent += (n)
sys/netgraph7/bluetooth/hci/ng_hci_var.h
145
#define NG_HCI_STAT_SCO_SENT(s, n) (s).sco_sent += (n)
sys/netgraph7/bluetooth/hci/ng_hci_var.h
95
#define NG_HCI_BUFF_ACL_SET(b, n, s, f) \
sys/netgraph7/bluetooth/hci/ng_hci_var.h
99
(b).acl_pkts = (n); \
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
554
int n = 0;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
558
n++;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
559
if (n > NG_L2CAP_MAX_CON_NUM)
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
560
n = NG_L2CAP_MAX_CON_NUM;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
564
sizeof(*e1) + n * sizeof(*e2), M_WAITOK | M_NULLOK);
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
573
e1->num_connections = n;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
591
if (--n <= 0)
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
601
int n = 0;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
605
n ++;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
606
if (n > NG_L2CAP_MAX_CHAN_NUM)
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
607
n = NG_L2CAP_MAX_CHAN_NUM;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
612
n * sizeof(ng_l2cap_node_chan_ep), M_WAITOK | M_NULLOK);
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
621
e1->num_channels = n;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_main.c
637
if (--n <= 0)
sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c
247
ng_l2cap_chan_p f = NULL, n = NULL;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c
261
n = LIST_NEXT(f, next);
sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c
266
f = n;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c
390
ng_l2cap_cmd_p f = NULL, n = NULL;
sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c
394
n = TAILQ_NEXT(f, next);
sys/netgraph7/bluetooth/l2cap/ng_l2cap_misc.c
403
f = n;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3592
struct mbuf *top = NULL, *m = NULL, *n = NULL, *nextpkt = NULL;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3604
n = sb->sb_mb;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3605
nextpkt = n->m_nextpkt;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3608
while (length > 0 && n != NULL) {
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3609
len = min(mlen - m->m_len, n->m_len - noff);
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3613
bcopy(mtod(n, caddr_t)+noff, mtod(m, caddr_t)+m->m_len, len);
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3630
if (noff == n->m_len) {
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3632
n = n->m_next;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3634
if (n == NULL)
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3635
n = nextpkt;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3637
nextpkt = (n != NULL)? n->m_nextpkt : NULL;
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3643
if (length > 0 && n == NULL)
sys/netgraph7/bluetooth/socket/ng_btsocket_rfcomm.c
3644
panic("%s: bogus length=%d, n=%p", __func__, length, n);
sys/netgraph7/ksocket/ng_ksocket.c
1076
struct mbuf *n;
sys/netgraph7/ksocket/ng_ksocket.c
1104
for (n = sio.sb_mb; n != NULL; n = n->m_next) {
sys/netgraph7/ksocket/ng_ksocket.c
1105
sio.sb_mb->m_pkthdr.len += n->m_len;
sys/netgraph7/ksocket/ng_ksocket.c
1106
n->m_nextpkt = NULL;
sys/netgraph7/mppc/ng_mppc.h
60
#define MPPC_MAX_BLOWUP(n) ((n) * 9 / 8 + 26)
sys/netgraph7/netgraph.h
677
#define _NGI_SET_NODE(i,n) do { _NGI_NODE(i) = n; n = NULL;} while (0)
sys/netgraph7/netgraph.h
782
#define NGI_SET_NODE(i,n) \
sys/netgraph7/netgraph.h
783
do { _ngi_check(i, _NN_); _NGI_SET_NODE(i, n); } while (0)
sys/netgraph7/netgraph.h
813
#define NGI_SET_NODE(i,n) _NGI_SET_NODE(i,n)
sys/netgraph7/netgraph.h
837
#define NGI_GET_NODE(i,n) /* YOU NOW HAVE THE REFERENCE */ \
sys/netgraph7/netgraph.h
839
(n) = NGI_NODE(i); \
sys/netgraph7/netgraph/ng_base.c
358
struct mbuf *n; \
sys/netgraph7/netgraph/ng_base.c
362
for (total = 0, n = (m); n != NULL; n = n->m_next) { \
sys/netgraph7/netgraph/ng_base.c
363
total += n->m_len; \
sys/netgraph7/netgraph/ng_base.c
364
if (n->m_nextpkt != NULL) \
sys/netgraph7/ng_fec.c
1078
struct ng_fec_portlist *n = NULL;
sys/netgraph7/ng_fec.c
1080
n = TAILQ_NEXT(p, fec_list);
sys/netgraph7/ng_fec.c
1081
if (n == NULL)
sys/netgraph7/ng_fec.c
1082
n = TAILQ_FIRST(&b->ng_fec_ports);
sys/netgraph7/ng_fec.c
1083
while (n != p) {
sys/netgraph7/ng_fec.c
1084
if (n->fec_ifstat == 1)
sys/netgraph7/ng_fec.c
1086
n = TAILQ_NEXT(n, fec_list);
sys/netgraph7/ng_fec.c
1087
if (n == NULL)
sys/netgraph7/ng_fec.c
1088
n = TAILQ_FIRST(&b->ng_fec_ports);
sys/netgraph7/ng_fec.c
1090
if (n == p)
sys/netgraph7/ng_fec.c
1092
p = n;
sys/netgraph7/ng_ipfw.c
193
u_int16_t n; /* numeric representation of hook */
sys/netgraph7/ng_ipfw.c
196
n = (u_int16_t)strtol(name, &endptr, 10);
sys/netgraph7/ng_ipfw.c
199
return ng_ipfw_findhook1(node, n);
sys/netgraph7/ng_vlan.c
287
t->n = priv->nent;
sys/netgraph7/ng_vlan.c
71
return table->n;
sys/netgraph7/ng_vlan.h
65
u_int32_t n;
sys/netgraph7/ppp/ng_ppp.c
2083
struct mbuf *n = m_split(m, len, M_NOWAIT);
sys/netgraph7/ppp/ng_ppp.c
2085
if (n == NULL) {
sys/netgraph7/ppp/ng_ppp.c
2091
m_tag_copy_chain(n, m, M_NOWAIT);
sys/netgraph7/ppp/ng_ppp.c
2092
m = n;
sys/netgraph7/pppoe/ng_pppoe.c
1341
struct mbuf *n;
sys/netgraph7/pppoe/ng_pppoe.c
1342
n = m_dup(m, M_NOWAIT);
sys/netgraph7/pppoe/ng_pppoe.c
1344
m = n;
sys/netinet/in_cksum.c
128
if ((n = m->m_len - offset) > bytes)
sys/netinet/in_cksum.c
129
n = bytes;
sys/netinet/in_cksum.c
130
bytes -= n;
sys/netinet/in_cksum.c
140
if (((intptr_t)ptr & 1) && n) {
sys/netinet/in_cksum.c
153
--n;
sys/netinet/in_cksum.c
156
if (((intptr_t)ptr & 2) && n > 1) {
sys/netinet/in_cksum.c
162
n -= 2;
sys/netinet/in_cksum.c
169
if (n >= 4) {
sys/netinet/in_cksum.c
172
sum32 = asm_ones32((const void *)ptr, n >> 2);
sys/netinet/in_cksum.c
178
ptr += n & ~3;
sys/netinet/in_cksum.c
186
if (n & 2) {
sys/netinet/in_cksum.c
194
if (n & 1) {
sys/netinet/in_cksum.c
74
int n;
sys/netinet/in_pcb.c
2415
int error, n;
sys/netinet/in_pcb.c
2424
n = 0;
sys/netinet/in_pcb.c
2427
n += pcbinfo_arr[cpu].ipi_count;
sys/netinet/in_pcb.c
2428
req->oldidx = (n + n/8 + 10) * sizeof(struct xinpcb);
sys/netinet/in_pcb.c
2454
n = pcbinfo->ipi_count;
sys/netinet/in_pcb.c
2458
while ((inp = LIST_NEXT(marker, inp_list)) != NULL && i < n) {
sys/netinet/in_pcb.c
2480
if (error == 0 && i < n) {
sys/netinet/in_pcb.c
2483
while (i < n) {
sys/netinet/ip_icmp.c
145
icmp_error(struct mbuf *n, int type, int code, n_long dest, int destmtu)
sys/netinet/ip_icmp.c
147
struct ip *oip = mtod(n, struct ip *), *nip;
sys/netinet/ip_icmp.c
165
if (n->m_flags & M_DECRYPTED)
sys/netinet/ip_icmp.c
170
n->m_len >= oiplen + ICMP_MINLEN &&
sys/netinet/ip_icmp.c
176
if (n->m_flags & (M_BCAST|M_MCAST))
sys/netinet/ip_icmp.c
212
m_copydata(n, 0, icmplen, &icp->icmp_ip);
sys/netinet/ip_icmp.c
224
m->m_pkthdr.rcvif = n->m_pkthdr.rcvif;
sys/netinet/ip_icmp.c
231
m->m_pkthdr.fw_flags |= n->m_pkthdr.fw_flags & FW_MBUF_GENERATED;
sys/netinet/ip_icmp.c
235
m_freem(n);
sys/netinet/ip_input.c
1276
n = m->m_next;
sys/netinet/ip_input.c
1278
m_cat(m, n);
sys/netinet/ip_input.c
1321
for (n = m; n; n = n->m_next)
sys/netinet/ip_input.c
1322
plen += n->m_len;
sys/netinet/ip_input.c
982
struct mbuf *n;
sys/netinet/ip_output.c
965
struct mbuf *n;
sys/netinet/ip_output.c
977
MGETHDR(n, M_NOWAIT, MT_HEADER);
sys/netinet/ip_output.c
978
if (n == NULL) {
sys/netinet/ip_output.c
982
n->m_pkthdr.rcvif = NULL;
sys/netinet/ip_output.c
983
n->m_pkthdr.len = m->m_pkthdr.len + optlen;
sys/netinet/ip_output.c
986
n->m_next = m;
sys/netinet/ip_output.c
987
m = n;
sys/netinet/raw_ip.c
165
struct mbuf *n = m_copypacket(m, M_NOWAIT);
sys/netinet/raw_ip.c
167
if (n) {
sys/netinet/raw_ip.c
171
ip_savecontrol(last, &opts, ip, n);
sys/netinet/raw_ip.c
173
(struct sockaddr *)&ripsrc, n,
sys/netinet/raw_ip.c
175
m_freem(n);
sys/netinet/tcp_input.c
306
#define iceildiv(n, d) (((n)+(d)-1) / (d))
sys/netinet/tcp_sack.c
975
int n = 0;
sys/netinet/tcp_sack.c
978
while (n < tp->nsackhistory &&
sys/netinet/tcp_sack.c
980
if (tp->sackhistory[n].rblk_start != hstart) {
sys/netinet/tcp_sack.c
981
*lp++ = htonl(tp->sackhistory[n].rblk_start);
sys/netinet/tcp_sack.c
982
*lp++ = htonl(tp->sackhistory[n].rblk_end);
sys/netinet/tcp_sack.c
985
++n;
sys/netinet/tcp_subr.c
1228
int error, i, n;
sys/netinet/tcp_subr.c
1234
n = 0;
sys/netinet/tcp_subr.c
1242
n += tcbinfo[ccpu].ipi_count;
sys/netinet/tcp_subr.c
1243
req->oldidx = (n + n/8 + 10) * sizeof(struct xtcpcb);
sys/netinet/tcp_subr.c
1267
n = tcbinfo[ccpu].ipi_count;
sys/netinet/tcp_subr.c
1271
while ((inp = LIST_NEXT(marker, inp_list)) != NULL && i < n) {
sys/netinet/tcp_subr.c
1298
if (error == 0 && i < n) {
sys/netinet/tcp_subr.c
1301
while (i < n) {
sys/netinet/tcp_subr.c
1685
int n;
sys/netinet/tcp_subr.c
1741
read_random(&n, sizeof(n), 1);
sys/netinet/tcp_subr.c
1742
isn->last_offset += (n & 0x000FFFFF) + 0x00100000;
sys/netinet/udp_usrreq.c
181
struct mbuf *n, int off, struct sockaddr_in *udp_in);
sys/netinet/udp_usrreq.c
348
struct mbuf *n;
sys/netinet/udp_usrreq.c
350
if ((n = m_copypacket(m, M_NOWAIT)) != NULL)
sys/netinet/udp_usrreq.c
351
udp_append(last, ip, n,
sys/netinet/udp_usrreq.c
657
udp_append(struct inpcb *last, struct ip *ip, struct mbuf *n, int off,
sys/netinet/udp_usrreq.c
667
ip_savecontrol(last, &opts, ip, n);
sys/netinet/udp_usrreq.c
668
m_adj(n, off);
sys/netinet/udp_usrreq.c
672
(struct sockaddr *)udp_in, n, opts);
sys/netinet/udp_usrreq.c
675
m_freem(n);
sys/netinet6/icmp6.c
1109
struct mbuf *n = NULL;
sys/netinet6/icmp6.c
1250
n = ni6_nametodns(hostname, hostnamelen, 0);
sys/netinet6/icmp6.c
1251
if (!n || n->m_next || n->m_len == 0)
sys/netinet6/icmp6.c
1257
if (!ni6_dnsmatch(subj, subjlen, mtod(n, const char *),
sys/netinet6/icmp6.c
1258
n->m_len)) {
sys/netinet6/icmp6.c
1261
m_freem(n);
sys/netinet6/icmp6.c
1262
n = NULL;
sys/netinet6/icmp6.c
1326
n = m_getb(replylen, M_NOWAIT, m->m_type, M_PKTHDR);
sys/netinet6/icmp6.c
1327
if (n == NULL) {
sys/netinet6/icmp6.c
1331
M_MOVE_PKTHDR(n, m); /* just for recvif */
sys/netinet6/icmp6.c
1332
n->m_pkthdr.len = n->m_len = replylen;
sys/netinet6/icmp6.c
1335
bcopy(mtod(m, caddr_t), mtod(n, caddr_t), sizeof(struct ip6_hdr));
sys/netinet6/icmp6.c
1336
nni6 = (struct icmp6_nodeinfo *)(mtod(n, struct ip6_hdr *) + 1);
sys/netinet6/icmp6.c
1357
fqdn = (struct ni_reply_fqdn *)(mtod(n, caddr_t) +
sys/netinet6/icmp6.c
1365
n->m_next = ni6_nametodns(hostname, hostnamelen, oldfqdn);
sys/netinet6/icmp6.c
1366
if (n->m_next == NULL)
sys/netinet6/icmp6.c
1369
if (n->m_next->m_next != NULL)
sys/netinet6/icmp6.c
1371
n->m_pkthdr.len += n->m_next->m_len;
sys/netinet6/icmp6.c
1378
n->m_pkthdr.len = n->m_len =
sys/netinet6/icmp6.c
1380
lenlim = M_TRAILINGSPACE(n);
sys/netinet6/icmp6.c
1383
n->m_pkthdr.len = n->m_len = sizeof(struct ip6_hdr) +
sys/netinet6/icmp6.c
1393
return (n);
sys/netinet6/icmp6.c
1397
if (n)
sys/netinet6/icmp6.c
1398
m_freem(n);
sys/netinet6/icmp6.c
1859
struct mbuf *n;
sys/netinet6/icmp6.c
1861
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) != NULL) {
sys/netinet6/icmp6.c
1863
ip6_savecontrol(last, &opts, ip6, n);
sys/netinet6/icmp6.c
1865
m_adj(n, off);
sys/netinet6/icmp6.c
1869
(struct sockaddr *)&fromsa, n, opts) == 0) {
sys/netinet6/icmp6.c
1870
m_freem(n);
sys/netinet6/icmp6.c
403
struct mbuf *m = *mp, *n;
sys/netinet6/icmp6.c
533
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
537
if ((n->m_flags & M_EXT) ||
sys/netinet6/icmp6.c
538
n->m_len < off + sizeof(struct icmp6_hdr)) {
sys/netinet6/icmp6.c
539
struct mbuf *n0 = n;
sys/netinet6/icmp6.c
552
n = m_getb(maxlen, M_NOWAIT, n0->m_type, M_PKTHDR);
sys/netinet6/icmp6.c
553
if (n == NULL) {
sys/netinet6/icmp6.c
559
M_MOVE_PKTHDR(n, n0);
sys/netinet6/icmp6.c
563
nip6 = mtod(n, struct ip6_hdr *);
sys/netinet6/icmp6.c
569
n->m_len = noff + sizeof(struct icmp6_hdr);
sys/netinet6/icmp6.c
576
n->m_pkthdr.len = n0len + (noff - off);
sys/netinet6/icmp6.c
577
n->m_next = n0;
sys/netinet6/icmp6.c
579
nip6 = mtod(n, struct ip6_hdr *);
sys/netinet6/icmp6.c
585
if (n) {
sys/netinet6/icmp6.c
588
icmp6_reflect(n, noff);
sys/netinet6/icmp6.c
606
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
612
mld6_input(n, off);
sys/netinet6/icmp6.c
648
n = m_copym(m, 0, M_COPYALL, M_NOWAIT);
sys/netinet6/icmp6.c
649
if (n != NULL)
sys/netinet6/icmp6.c
650
n = ni6_input(n, off);
sys/netinet6/icmp6.c
667
n = m_getb(maxlen, M_NOWAIT, m->m_type, M_PKTHDR);
sys/netinet6/icmp6.c
668
if (n == NULL) {
sys/netinet6/icmp6.c
672
if (!m_dup_pkthdr(n, m, M_NOWAIT)) {
sys/netinet6/icmp6.c
680
m_free(n);
sys/netinet6/icmp6.c
683
n->m_len = 0;
sys/netinet6/icmp6.c
684
maxhlen = M_TRAILINGSPACE(n) - maxlen;
sys/netinet6/icmp6.c
690
nip6 = mtod(n, struct ip6_hdr *);
sys/netinet6/icmp6.c
698
n->m_pkthdr.len = n->m_len = sizeof(struct ip6_hdr) +
sys/netinet6/icmp6.c
704
if (n) {
sys/netinet6/icmp6.c
707
icmp6_reflect(n, noff);
sys/netinet6/icmp6.c
723
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
729
nd6_rs_input(n, off, icmp6len);
sys/netinet6/icmp6.c
739
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
745
nd6_ra_input(n, off, icmp6len);
sys/netinet6/icmp6.c
755
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
761
nd6_ns_input(n, off, icmp6len);
sys/netinet6/icmp6.c
771
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
777
nd6_na_input(n, off, icmp6len);
sys/netinet6/icmp6.c
787
if ((n = m_copym(m, 0, M_COPYALL, M_NOWAIT)) == NULL) {
sys/netinet6/icmp6.c
793
icmp6_redirect_input(n, off);
sys/netinet6/in6_ifattach.c
595
char n[64]; /* a single label must not exceed 63 chars */
sys/netinet6/in6_ifattach.c
603
if (p - name > sizeof(n) - 1)
sys/netinet6/in6_ifattach.c
606
strncpy(n, name, l);
sys/netinet6/in6_ifattach.c
607
n[(int)l] = '\0';
sys/netinet6/in6_ifattach.c
608
for (q = n; *q; q++) {
sys/netinet6/in6_ifattach.c
617
MD5Update(&ctxt, n, l);
sys/netinet6/ip6_input.c
1370
struct mbuf *n;
sys/netinet6/ip6_input.c
1390
n = m_getb(elen, M_NOWAIT, MT_DATA, 0);
sys/netinet6/ip6_input.c
1391
if (n == NULL)
sys/netinet6/ip6_input.c
1393
n->m_len = 0;
sys/netinet6/ip6_input.c
1395
if (elen >= M_TRAILINGSPACE(n)) {
sys/netinet6/ip6_input.c
1396
m_free(n);
sys/netinet6/ip6_input.c
1400
m_copydata(m, off, elen, mtod(n, void *));
sys/netinet6/ip6_input.c
1401
n->m_len = elen;
sys/netinet6/ip6_input.c
1402
return n;
sys/netinet6/ip6_input.c
250
struct mbuf *n;
sys/netinet6/ip6_input.c
252
n = m_getb(m->m_pkthdr.len, M_NOWAIT, MT_DATA, M_PKTHDR);
sys/netinet6/ip6_input.c
253
if (n == NULL)
sys/netinet6/ip6_input.c
255
M_MOVE_PKTHDR(n, m);
sys/netinet6/ip6_input.c
257
m_copydata(m, 0, n->m_pkthdr.len, mtod(n, void *));
sys/netinet6/ip6_input.c
258
n->m_len = n->m_pkthdr.len;
sys/netinet6/ip6_input.c
260
m = n;
sys/netinet6/ip6_input.c
799
struct ip6aux *n;
sys/netinet6/ip6_input.c
801
n = ip6_addaux(m);
sys/netinet6/ip6_input.c
802
if (n)
sys/netinet6/ip6_input.c
803
n->ip6a_dstia6 = ia6;
sys/netinet6/ip6_input.c
804
return n; /* NULL if failed to set */
sys/netinet6/ip6_input.c
810
struct ip6aux *n;
sys/netinet6/ip6_input.c
812
n = ip6_findaux(m);
sys/netinet6/ip6_input.c
813
if (n)
sys/netinet6/ip6_input.c
814
return n->ip6a_dstia6;
sys/netinet6/ip6_mroute.c
1245
struct rtdetq *n = rte->next;
sys/netinet6/ip6_mroute.c
1248
rte = n;
sys/netinet6/ip6_mroute.c
531
struct rtdetq *n = rte->next;
sys/netinet6/ip6_mroute.c
535
rte = n;
sys/netinet6/ip6_mroute.c
763
struct rtdetq *n = rte->next;
sys/netinet6/ip6_mroute.c
770
rte = n;
sys/netinet6/ip6_mroute.h
106
#define IF_SET(n, p) ((p)->ifs_bits[(n)/NIFBITS] |= (1 << ((n) % NIFBITS)))
sys/netinet6/ip6_mroute.h
107
#define IF_CLR(n, p) ((p)->ifs_bits[(n)/NIFBITS] &= ~(1 << ((n) % NIFBITS)))
sys/netinet6/ip6_mroute.h
108
#define IF_ISSET(n, p) ((p)->ifs_bits[(n)/NIFBITS] & (1 << ((n) % NIFBITS)))
sys/netinet6/ip6_output.c
1008
struct mbuf *n, *mlast;
sys/netinet6/ip6_output.c
1011
n = m_copym(m0, sizeof(struct ip6_hdr),
sys/netinet6/ip6_output.c
1013
if (n == NULL)
sys/netinet6/ip6_output.c
1015
m->m_next = n;
sys/netinet6/ip6_output.c
1017
n = m;
sys/netinet6/ip6_output.c
1020
for (mlast = n; mlast->m_next; mlast = mlast->m_next)
sys/netinet6/ip6_output.c
952
struct mbuf *n;
sys/netinet6/ip6_output.c
965
n = m_getcl(M_NOWAIT, MT_DATA, 0);
sys/netinet6/ip6_output.c
966
if (!n)
sys/netinet6/ip6_output.c
968
n->m_len = oldoptlen + JUMBOOPTLEN;
sys/netinet6/ip6_output.c
969
bcopy(mtod(mopt, caddr_t), mtod(n, caddr_t), oldoptlen);
sys/netinet6/ip6_output.c
970
optbuf = mtod(n, caddr_t) + oldoptlen;
sys/netinet6/ip6_output.c
972
mopt = exthdrs->ip6e_hbh = n;
sys/netinet6/nd6.h
84
#define ND6_IS_LLINFO_PROBREACH(n) ((n)->ln_state > ND6_LLINFO_INCOMPLETE)
sys/netinet6/nd6_rtr.c
664
struct nd_defrouter *dr, *n;
sys/netinet6/nd6_rtr.c
689
n = (struct nd_defrouter *)kmalloc(sizeof(*n), M_IP6NDP,
sys/netinet6/nd6_rtr.c
691
if (n == NULL) {
sys/netinet6/nd6_rtr.c
695
*n = *new;
sys/netinet6/nd6_rtr.c
702
TAILQ_INSERT_TAIL(&nd_defrouter, n, dr_entry);
sys/netinet6/nd6_rtr.c
703
if (TAILQ_FIRST(&nd_defrouter) == n)
sys/netinet6/nd6_rtr.c
706
return (n);
sys/netinet6/raw_ip6.c
158
struct mbuf *n;
sys/netinet6/raw_ip6.c
160
n = m_copym(m, 0, M_COPYALL, M_NOWAIT);
sys/netinet6/raw_ip6.c
161
if (n != NULL) {
sys/netinet6/raw_ip6.c
167
ip6_savecontrol(last, &opts, ip6, n);
sys/netinet6/raw_ip6.c
170
m_adj(n, *offp);
sys/netinet6/raw_ip6.c
174
n, opts) == 0) {
sys/netinet6/raw_ip6.c
175
m_freem(n);
sys/netinet6/raw_ip6.c
394
struct mbuf *n;
sys/netinet6/raw_ip6.c
409
n = m;
sys/netinet6/raw_ip6.c
410
while (n && n->m_len <= off) {
sys/netinet6/raw_ip6.c
411
off -= n->m_len;
sys/netinet6/raw_ip6.c
412
n = n->m_next;
sys/netinet6/raw_ip6.c
414
if (!n)
sys/netinet6/raw_ip6.c
416
p = (u_int16_t *)(mtod(n, caddr_t) + off);
sys/netinet6/udp6_usrreq.c
248
struct mbuf *n;
sys/netinet6/udp6_usrreq.c
250
n = m_copym(m, 0, M_COPYALL, M_NOWAIT);
sys/netinet6/udp6_usrreq.c
251
if (n != NULL) {
sys/netinet6/udp6_usrreq.c
263
ip6, n);
sys/netinet6/udp6_usrreq.c
265
m_adj(n, off + sizeof(struct udphdr));
sys/netinet6/udp6_usrreq.c
269
n, opts) == 0) {
sys/netinet6/udp6_usrreq.c
270
m_freem(n);
sys/netproto/802_11/wlan/ieee80211.c
1947
findmedia(const struct ratemedia rates[], int n, u_int match)
sys/netproto/802_11/wlan/ieee80211.c
1951
for (i = 0; i < n; i++)
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
625
struct mbuf *n = NULL;
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
630
n = m_gethdr(M_NOWAIT, MT_DATA);
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
640
n = m_getjcl(M_NOWAIT, MT_DATA, M_PKTHDR, space);
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
642
if (__predict_true(n != NULL)) {
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
643
m_move_pkthdr(n, m);
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
644
n->m_data = (caddr_t)(ALIGN(n->m_data + align) - align);
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
645
m_copydata(m, 0, pktlen, mtod(n, void *));
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
646
n->m_len = pktlen;
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
654
return n;
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
727
get_random_bytes(void *p, size_t n)
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
731
while (n > 0) {
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
733
size_t nb = n > sizeof(uint32_t) ? sizeof(uint32_t) : n;
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
734
bcopy(&v, dp, n > sizeof(uint32_t) ? sizeof(uint32_t) : n);
sys/netproto/802_11/wlan/ieee80211_dragonfly.c
735
dp += sizeof(uint32_t), n -= nb;
sys/netproto/802_11/wlan/ieee80211_hostap.c
1236
int n;
sys/netproto/802_11/wlan/ieee80211_hostap.c
1273
n = le16dec(frm);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1275
if (len < n*4+2) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1279
len, n);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1283
for (; n > 0; n--) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1293
n = le16dec(frm);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1295
if (len < n*4) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1299
len, n);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1303
for (; n > 0; n--) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1384
int n;
sys/netproto/802_11/wlan/ieee80211_hostap.c
1420
n = le16dec(frm);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1422
if (len < n*4+2) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1426
len, n);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1430
for (; n > 0; n--) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1440
n = le16dec(frm);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1442
if (len < n*4) {
sys/netproto/802_11/wlan/ieee80211_hostap.c
1446
len, n);
sys/netproto/802_11/wlan/ieee80211_hostap.c
1450
for (; n > 0; n--) {
sys/netproto/802_11/wlan/ieee80211_ht.c
469
struct mbuf *n;
sys/netproto/802_11/wlan/ieee80211_ht.c
492
n = m_split(m, framelen, M_NOWAIT);
sys/netproto/802_11/wlan/ieee80211_ht.c
493
if (n == NULL) {
sys/netproto/802_11/wlan/ieee80211_ht.c
507
m = n;
sys/netproto/802_11/wlan/ieee80211_ht.c
655
int n = rap->rxa_qframes, j;
sys/netproto/802_11/wlan/ieee80211_ht.c
660
if (--n == 0)
sys/netproto/802_11/wlan/ieee80211_ht.c
664
KASSERT(n == 0, ("lost %d frames", n));
sys/netproto/802_11/wlan/ieee80211_ht.c
742
int n = rap->rxa_qframes, j;
sys/netproto/802_11/wlan/ieee80211_ht.c
751
if (--n == 0)
sys/netproto/802_11/wlan/ieee80211_ht.c
755
KASSERT(n == 0, ("%s: lost %d frames, qframes %d off %d "
sys/netproto/802_11/wlan/ieee80211_ht.c
757
__func__, n, rap->rxa_qframes, i, rap->rxa_start,
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1676
#define PERR_DFLAGS(n) perr.perr_dests[n].dest_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1677
#define PERR_DADDR(n) perr.perr_dests[n].dest_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1678
#define PERR_DSEQ(n) perr.perr_dests[n].dest_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1679
#define PERR_DRCODE(n) perr.perr_dests[n].dest_rcode
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1713
#define PERR_DFLAGS(n) perr->perr_dests[n].dest_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1714
#define PERR_DADDR(n) perr->perr_dests[n].dest_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1715
#define PERR_DSEQ(n) perr->perr_dests[n].dest_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1716
#define PERR_DEXTADDR(n) perr->perr_dests[n].dest_ext_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1717
#define PERR_DRCODE(n) perr->perr_dests[n].dest_rcode
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1880
#define PERR_DFLAGS(n) perr.perr_dests[n].dest_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1881
#define PERR_DADDR(n) perr.perr_dests[n].dest_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1882
#define PERR_DSEQ(n) perr.perr_dests[n].dest_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1883
#define PERR_DEXTADDR(n) perr.perr_dests[n].dest_ext_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
1884
#define PERR_DRCODE(n) perr.perr_dests[n].dest_rcode
sys/netproto/802_11/wlan/ieee80211_hwmp.c
2053
#define PREQ_TFLAGS(n) preq.preq_targets[n].target_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
2054
#define PREQ_TADDR(n) preq.preq_targets[n].target_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
2055
#define PREQ_TSEQ(n) preq.preq_targets[n].target_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
710
#define PREQ_TFLAGS(n) preq->preq_targets[n].target_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
711
#define PREQ_TADDR(n) preq->preq_targets[n].target_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
712
#define PREQ_TSEQ(n) preq->preq_targets[n].target_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
772
#define PERR_DFLAGS(n) perr->perr_dests[n].dest_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
773
#define PERR_DADDR(n) perr->perr_dests[n].dest_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
774
#define PERR_DSEQ(n) perr->perr_dests[n].dest_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
775
#define PERR_EXTADDR(n) perr->perr_dests[n].dest_ext_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
776
#define PERR_DRCODE(n) perr->perr_dests[n].dest_rcode
sys/netproto/802_11/wlan/ieee80211_hwmp.c
852
#define PREQ_TFLAGS(n) preq.preq_targets[n].target_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
853
#define PREQ_TADDR(n) preq.preq_targets[n].target_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
854
#define PREQ_TSEQ(n) preq.preq_targets[n].target_seq
sys/netproto/802_11/wlan/ieee80211_hwmp.c
976
#define PREQ_TFLAGS(n) preq->preq_targets[n].target_flags
sys/netproto/802_11/wlan/ieee80211_hwmp.c
977
#define PREQ_TADDR(n) preq->preq_targets[n].target_addr
sys/netproto/802_11/wlan/ieee80211_hwmp.c
978
#define PREQ_TSEQ(n) preq->preq_targets[n].target_seq
sys/netproto/802_11/wlan/ieee80211_output.c
1249
struct mbuf *n = m_gethdr(M_NOWAIT, m->m_type);
sys/netproto/802_11/wlan/ieee80211_output.c
1250
if (n == NULL) {
sys/netproto/802_11/wlan/ieee80211_output.c
1271
m_move_pkthdr(n, m);
sys/netproto/802_11/wlan/ieee80211_output.c
1272
n->m_len = 0; /* NB: m_gethdr does not set */
sys/netproto/802_11/wlan/ieee80211_output.c
1273
n->m_data += needed_space;
sys/netproto/802_11/wlan/ieee80211_output.c
1281
n->m_len += sizeof(struct ether_header);
sys/netproto/802_11/wlan/ieee80211_output.c
1287
n->m_next = m;
sys/netproto/802_11/wlan/ieee80211_output.c
1288
m = n;
sys/netproto/802_11/wlan/ieee80211_phy.c
592
#define HT_LTF(n) ((n) * 4)
sys/netproto/802_11/wlan/ieee80211_regdomain.c
182
sort_channels(void *a, size_t n, size_t size)
sys/netproto/802_11/wlan/ieee80211_regdomain.c
187
KASSERT(n > 0, ("no channels"));
sys/netproto/802_11/wlan/ieee80211_regdomain.c
188
for (ai = aa+size; --n >= 1; ai += size)
sys/netproto/802_11/wlan/ieee80211_regdomain.c
50
int *n, struct ieee80211_channel *c)
sys/netproto/802_11/wlan/ieee80211_regdomain.c
56
*n = maxchan;
sys/netproto/802_11/wlan/ieee80211_superg.c
266
struct mbuf *n;
sys/netproto/802_11/wlan/ieee80211_superg.c
316
n = m_split(m, framelen, M_NOWAIT);
sys/netproto/802_11/wlan/ieee80211_superg.c
317
if (n == NULL) {
sys/netproto/802_11/wlan/ieee80211_superg.c
331
m_adj(n, roundup2(framelen, 4) - framelen); /* padding */
sys/netproto/802_11/wlan/ieee80211_superg.c
332
n = ieee80211_decap1(n, &framelen);
sys/netproto/802_11/wlan/ieee80211_superg.c
333
if (n == NULL) {
sys/netproto/802_11/wlan/ieee80211_superg.c
339
return n; /* 2nd delivered by caller */
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
471
struct mbuf *n;
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
482
n = m;
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
486
pos_next = mtod(n, uint8_t *);
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
489
if (n->m_len >= space_next) {
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
502
xor_block(b+sp, pos_next, n->m_len);
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
503
sp += n->m_len, dl -= n->m_len;
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
504
n = n->m_next;
sys/netproto/802_11/wlan_ccmp/ieee80211_crypto_ccmp.c
505
if (n == NULL)
sys/platform/pc64/apic/lapic.c
980
int n = BSFCPUMASK(target);
sys/platform/pc64/apic/lapic.c
981
CPUMASK_NANDBIT(target, n);
sys/platform/pc64/apic/lapic.c
982
single_apic_ipi(n, vector, delivery_mode);
sys/platform/pc64/isa/clock.c
215
int n;
sys/platform/pc64/isa/clock.c
228
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/isa/clock.c
229
gscan = globaldata_find(n);
sys/platform/pc64/isa/clock.c
386
DODELAY(int n, int doswitch)
sys/platform/pc64/isa/clock.c
403
kprintf("DELAY(%d)...", n);
sys/platform/pc64/isa/clock.c
419
ticks_left = muldivu64(n, sys_cputimer->freq + 999999, 1000000);
sys/platform/pc64/isa/clock.c
441
getit_calls, (n + 5) / getit_calls);
sys/platform/pc64/isa/clock.c
449
DELAY(int n)
sys/platform/pc64/isa/clock.c
451
DODELAY(n, 0);
sys/platform/pc64/x86_64/__udivti3.c
102
utwords n, d, q, r;
sys/platform/pc64/x86_64/__udivti3.c
105
n.all = a;
sys/platform/pc64/x86_64/__udivti3.c
109
if (n.s.high == 0) {
sys/platform/pc64/x86_64/__udivti3.c
116
*rem = n.s.low % d.s.low;
sys/platform/pc64/x86_64/__udivti3.c
117
return n.s.low / d.s.low;
sys/platform/pc64/x86_64/__udivti3.c
124
*rem = n.s.low;
sys/platform/pc64/x86_64/__udivti3.c
135
*rem = n.s.high % d.s.low;
sys/platform/pc64/x86_64/__udivti3.c
136
return n.s.high / d.s.low;
sys/platform/pc64/x86_64/__udivti3.c
139
if (n.s.low == 0) {
sys/platform/pc64/x86_64/__udivti3.c
145
r.s.high = n.s.high % d.s.high;
sys/platform/pc64/x86_64/__udivti3.c
149
return n.s.high / d.s.high;
sys/platform/pc64/x86_64/__udivti3.c
157
r.s.low = n.s.low;
sys/platform/pc64/x86_64/__udivti3.c
158
r.s.high = n.s.high & (d.s.high - 1);
sys/platform/pc64/x86_64/__udivti3.c
161
return n.s.high >> __builtin_ctzl(d.s.high);
sys/platform/pc64/x86_64/__udivti3.c
167
sr = __builtin_clzl(d.s.high) - __builtin_clzl(n.s.high);
sys/platform/pc64/x86_64/__udivti3.c
171
*rem = n.all;
sys/platform/pc64/x86_64/__udivti3.c
178
q.s.high = n.s.low << (n_udword_bits - sr);
sys/platform/pc64/x86_64/__udivti3.c
180
r.s.high = n.s.high >> sr;
sys/platform/pc64/x86_64/__udivti3.c
181
r.s.low = (n.s.high << (n_udword_bits - sr)) | (n.s.low >> sr);
sys/platform/pc64/x86_64/__udivti3.c
190
*rem = n.s.low & (d.s.low - 1);
sys/platform/pc64/x86_64/__udivti3.c
192
return n.all;
sys/platform/pc64/x86_64/__udivti3.c
194
q.s.high = n.s.high >> sr;
sys/platform/pc64/x86_64/__udivti3.c
195
q.s.low = (n.s.high << (n_udword_bits - sr)) |
sys/platform/pc64/x86_64/__udivti3.c
196
(n.s.low >> sr);
sys/platform/pc64/x86_64/__udivti3.c
204
__builtin_clzl(n.s.high);
sys/platform/pc64/x86_64/__udivti3.c
231
q.s.low = (n.s.low << (n_utword_bits - sr)) &
sys/platform/pc64/x86_64/__udivti3.c
233
q.s.high = ((n.s.low << ( n_udword_bits - sr)) &
sys/platform/pc64/x86_64/__udivti3.c
235
(((n.s.high << (n_utword_bits - sr)) |
sys/platform/pc64/x86_64/__udivti3.c
236
(n.s.low >> (sr - n_udword_bits))) &
sys/platform/pc64/x86_64/__udivti3.c
238
r.s.high = (n.s.high >> sr) &
sys/platform/pc64/x86_64/__udivti3.c
240
r.s.low = ((n.s.high >> (sr - n_udword_bits)) &
sys/platform/pc64/x86_64/__udivti3.c
242
(((n.s.high << (n_udword_bits - sr)) |
sys/platform/pc64/x86_64/__udivti3.c
243
(n.s.low >> sr)) &
sys/platform/pc64/x86_64/__udivti3.c
250
sr = __builtin_clzl(d.s.high) - __builtin_clzl(n.s.high);
sys/platform/pc64/x86_64/__udivti3.c
254
*rem = n.all;
sys/platform/pc64/x86_64/__udivti3.c
261
q.s.high = n.s.low << (n_udword_bits - sr);
sys/platform/pc64/x86_64/__udivti3.c
274
r.s.high = (n.s.high >> sr) &
sys/platform/pc64/x86_64/__udivti3.c
276
r.s.low = (n.s.high << (n_udword_bits - sr)) |
sys/platform/pc64/x86_64/__udivti3.c
277
((n.s.low >> sr) &
sys/platform/pc64/x86_64/dump_machdep.c
80
int n;
sys/platform/pc64/x86_64/dump_machdep.c
83
for (n = 0; n < NELEM(dump_map); n++) {
sys/platform/pc64/x86_64/dump_machdep.c
84
if (dump_avail[n].phys_beg == 0 && dump_avail[n].phys_end == 0)
sys/platform/pc64/x86_64/dump_machdep.c
86
dump_map[n].md_start = dump_avail[n].phys_beg;
sys/platform/pc64/x86_64/dump_machdep.c
87
dump_map[n].md_size = dump_avail[n].phys_end -
sys/platform/pc64/x86_64/dump_machdep.c
88
dump_avail[n].phys_beg;
sys/platform/pc64/x86_64/machdep.c
3633
int n;
sys/platform/pc64/x86_64/machdep.c
3656
for (n = 1; n < 8; ++n) {
sys/platform/pc64/x86_64/mp_flame.c
106
int n;
sys/platform/pc64/x86_64/mp_flame.c
135
for (n = 1; n < FLAME_GRAPH_FRAMES - 1; ++n) {
sys/platform/pc64/x86_64/mp_flame.c
138
fge->rips[n] = (intptr_t)*(char **)(rbp + 8);
sys/platform/pc64/x86_64/mp_flame.c
143
fge->rips[n] = 0;
sys/platform/pc64/x86_64/mp_flame.c
152
int n;
sys/platform/pc64/x86_64/mp_flame.c
164
for (n = 0; n < ncpus && error == 0; ++n) {
sys/platform/pc64/x86_64/mp_flame.c
167
error = SYSCTL_OUT(req, flame_graph_array + n,
sys/platform/pc64/x86_64/mp_flame.c
170
error = SYSCTL_OUT(req, flame_graph_array[n].fge,
sys/platform/pc64/x86_64/mp_flame.c
72
int n;
sys/platform/pc64/x86_64/mp_flame.c
76
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/x86_64/mp_flame.c
80
fg = &flame_graph_array[n];
sys/platform/pc64/x86_64/pmap.c
1198
#define SYSMAP(c, p, v, n) \
sys/platform/pc64/x86_64/pmap.c
1199
v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
sys/platform/pc64/x86_64/pmap.c
1547
int n;
sys/platform/pc64/x86_64/pmap.c
1563
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/x86_64/pmap.c
1566
ps = CPU_prvspace[n];
sys/platform/pc64/x86_64/pmap.c
1575
pmap_init_iso_range(r_idt_arr[n].rd_base,
sys/platform/pc64/x86_64/pmap.c
1576
r_idt_arr[n].rd_limit + 1);
sys/platform/pc64/x86_64/pmap.c
843
allocpages(vm_paddr_t *firstaddr, long n)
sys/platform/pc64/x86_64/pmap.c
848
bzero((void *)ret, n * PAGE_SIZE);
sys/platform/pc64/x86_64/pmap.c
849
*firstaddr += n * PAGE_SIZE;
sys/platform/pc64/x86_64/pmap_inval.c
645
vm_pindex_t n;
sys/platform/pc64/x86_64/pmap_inval.c
647
n = (bulk->va_end - bulk->va_beg) >> PAGE_SHIFT;
sys/platform/pc64/x86_64/pmap_inval.c
648
pmap_inval_smp(bulk->pmap, bulk->va_beg, n, NULL, 0);
sys/platform/pc64/x86_64/pmap_inval.c
676
int n = BSFCPUMASK(cpumask);
sys/platform/pc64/x86_64/pmap_inval.c
679
KKASSERT(n >= 0 && n < MAXCPU);
sys/platform/pc64/x86_64/pmap_inval.c
682
CPUMASK_NANDBIT(cpumask, n);
sys/platform/pc64/x86_64/pmap_inval.c
683
info = &invinfo[n];
sys/platform/pc64/x86_64/pmap_inval.c
704
cpu, n, info->done.ary[0], info->mask.ary[0],
sys/platform/pc64/x86_64/pmap_inval.c
725
if (n != cpu) {
sys/platform/pc64/x86_64/pmap_inval.c
737
CPUMASK_TESTBIT(info->mask, n)) {
sys/platform/pc64/x86_64/vm_machdep.c
1185
int n;
sys/platform/pc64/x86_64/vm_machdep.c
1188
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/x86_64/vm_machdep.c
1189
lwkt_setcpu_self(globaldata_find(n));
sys/platform/pc64/x86_64/vm_machdep.c
511
int n;
sys/platform/pc64/x86_64/vm_machdep.c
521
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/x86_64/vm_machdep.c
522
lwkt_setcpu_self(globaldata_find(n));
sys/platform/pc64/x86_64/vm_machdep.c
792
int n;
sys/platform/pc64/x86_64/vm_machdep.c
795
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/x86_64/vm_machdep.c
796
lwkt_setcpu_self(globaldata_find(n));
sys/platform/pc64/x86_64/vm_machdep.c
946
int n;
sys/platform/pc64/x86_64/vm_machdep.c
955
for (n = 0; n < ncpus; ++n) {
sys/platform/pc64/x86_64/vm_machdep.c
956
lwkt_setcpu_self(globaldata_find(n));
sys/platform/vkernel64/platform/console.c
180
int n;
sys/platform/vkernel64/platform/console.c
190
while ((n = clist_qtob(&tp->t_outq, buf, sizeof(buf))) > 0) {
sys/platform/vkernel64/platform/console.c
195
pwrite(1, buf, n, -1);
sys/platform/vkernel64/platform/console.c
301
int n;
sys/platform/vkernel64/platform/console.c
322
n = extpread(0, buf, sizeof(buf), O_FNONBLOCKING, -1LL);
sys/platform/vkernel64/platform/console.c
323
for (i = 0; i < n; ++i)
sys/platform/vkernel64/platform/console.c
325
} while (n > 0);
sys/platform/vkernel64/platform/console.c
407
ssize_t n;
sys/platform/vkernel64/platform/console.c
411
n = pread(0, &c, 1, -1);
sys/platform/vkernel64/platform/console.c
412
if (n == 1)
sys/platform/vkernel64/platform/console.c
414
if (n < 0 && errno == EINTR)
sys/platform/vkernel64/platform/console.c
416
panic("vconsgetc: EOF on console %jd %d", (intmax_t)n, errno);
sys/platform/vkernel64/platform/copyio.c
276
size_t n;
sys/platform/vkernel64/platform/copyio.c
283
n = PAGE_SIZE - ((vm_offset_t)uptr & PAGE_MASK);
sys/platform/vkernel64/platform/copyio.c
284
if (n > 32)
sys/platform/vkernel64/platform/copyio.c
285
n = 32;
sys/platform/vkernel64/platform/copyio.c
286
if (n > len)
sys/platform/vkernel64/platform/copyio.c
287
n = len;
sys/platform/vkernel64/platform/copyio.c
288
if ((error = copyin(uptr, kptr, n)) != 0)
sys/platform/vkernel64/platform/copyio.c
290
while (n) {
sys/platform/vkernel64/platform/copyio.c
297
--n;
sys/platform/vkernel64/platform/copyio.c
318
size_t n;
sys/platform/vkernel64/platform/copyio.c
328
n = PAGE_SIZE - ((vm_offset_t)udaddr & PAGE_MASK);
sys/platform/vkernel64/platform/copyio.c
329
if (n > len)
sys/platform/vkernel64/platform/copyio.c
330
n = len;
sys/platform/vkernel64/platform/copyio.c
333
kaddr, n);
sys/platform/vkernel64/platform/copyio.c
334
len -= n;
sys/platform/vkernel64/platform/copyio.c
335
udaddr = (const char *)udaddr + n;
sys/platform/vkernel64/platform/copyio.c
336
kaddr = (char *)kaddr + n;
sys/platform/vkernel64/platform/copyio.c
359
size_t n;
sys/platform/vkernel64/platform/copyio.c
369
n = PAGE_SIZE - ((vm_offset_t)udaddr & PAGE_MASK);
sys/platform/vkernel64/platform/copyio.c
370
if (n > len)
sys/platform/vkernel64/platform/copyio.c
371
n = len;
sys/platform/vkernel64/platform/copyio.c
374
((vm_offset_t)udaddr & PAGE_MASK), n);
sys/platform/vkernel64/platform/copyio.c
375
len -= n;
sys/platform/vkernel64/platform/copyio.c
376
udaddr = (char *)udaddr + n;
sys/platform/vkernel64/platform/copyio.c
377
kaddr = (const char *)kaddr + n;
sys/platform/vkernel64/platform/init.c
179
int n;
sys/platform/vkernel64/platform/init.c
278
n = strlen(optarg);
sys/platform/vkernel64/platform/init.c
282
kenv_size = n + 2;
sys/platform/vkernel64/platform/init.c
287
kenv_size2 = kenv_size + n + 1;
sys/platform/vkernel64/platform/init.c
295
for (i = 0, j = pos; i < n; ++i) {
sys/platform/vkernel64/platform/kqueue.c
182
int n;
sys/platform/vkernel64/platform/kqueue.c
188
n = kevent(KQueueFd, NULL, 0, kevary, 8, &ts);
sys/platform/vkernel64/platform/kqueue.c
189
for (i = 0; i < n; ++i) {
sys/platform/vkernel64/platform/kqueue.c
195
} while (n == 8);
sys/platform/vkernel64/platform/pmap.c
395
allocpages(vm_paddr_t *firstaddr, int n)
sys/platform/vkernel64/platform/pmap.c
401
*firstaddr += n * PAGE_SIZE;
sys/platform/vkernel64/platform/pmap.c
523
#define SYSMAP(c, p, v, n) \
sys/platform/vkernel64/platform/pmap.c
524
v = (c)va; va += ((n)*PAGE_SIZE); p = pte; pte += (n);
sys/platform/vkernel64/platform/systimer.c
239
int n;
sys/platform/vkernel64/platform/systimer.c
254
for (n = 0; n < ncpus; ++n) {
sys/platform/vkernel64/platform/systimer.c
255
gscan = globaldata_find(n);
sys/platform/vkernel64/platform/systimer.c
256
delta = vktimer_reload[n] - curtime;
sys/platform/vkernel64/platform/systimer.c
258
pthread_kill(ap_tids[n], SIGURG);
sys/platform/vkernel64/platform/systimer.c
269
for (n = 0; n < ncpus; ++n) {
sys/platform/vkernel64/platform/systimer.c
270
gscan = globaldata_find(n);
sys/platform/vkernel64/platform/systimer.c
271
delta = vktimer_reload[n] - curtime;
sys/platform/vkernel64/x86_64/mp.c
222
int n = BSFCPUMASK(target);
sys/platform/vkernel64/x86_64/mp.c
223
CPUMASK_NANDBIT(target, n);
sys/platform/vkernel64/x86_64/mp.c
224
single_cpu_ipi(n, vector, delivery_mode);
sys/platform/vkernel64/x86_64/mp.c
236
int n = BSFCPUMASK(map);
sys/platform/vkernel64/x86_64/mp.c
237
CPUMASK_NANDBIT(map, n);
sys/platform/vkernel64/x86_64/mp.c
238
ATOMIC_CPUMASK_ORBIT(stopped_cpus, n);
sys/platform/vkernel64/x86_64/mp.c
239
if (pthread_kill(ap_tids[n], SIGXCPU) != 0)
sys/platform/vkernel64/x86_64/mp.c
257
int n = BSFCPUMASK(map);
sys/platform/vkernel64/x86_64/mp.c
258
CPUMASK_NANDBIT(map, n);
sys/platform/vkernel64/x86_64/mp.c
259
ATOMIC_CPUMASK_NANDBIT(stopped_cpus, n);
sys/platform/vkernel64/x86_64/mp.c
260
if (pthread_kill(ap_tids[n], SIGXCPU) != 0)
sys/sys/_fd_set.h
61
#define _fdset_mask(n) ((__fd_mask)1 << ((unsigned int)(n) % __NFDBITS))
sys/sys/_fd_set.h
62
#define FD_SET(n, p) \
sys/sys/_fd_set.h
63
((p)->fds_bits[(unsigned int)(n)/__NFDBITS] |= _fdset_mask(n))
sys/sys/_fd_set.h
64
#define FD_CLR(n, p) \
sys/sys/_fd_set.h
65
((p)->fds_bits[(unsigned int)(n)/__NFDBITS] &= ~_fdset_mask(n))
sys/sys/_fd_set.h
66
#define FD_ISSET(n, p) \
sys/sys/_fd_set.h
67
((p)->fds_bits[(unsigned int)(n)/__NFDBITS] & _fdset_mask(n))
sys/sys/atomic_common.h
78
#define __atomic_load_generic(p, t, ut, n) \
sys/sys/atomic_common.h
80
t: __atomic_load_ ## n ## _relaxed(p), \
sys/sys/atomic_common.h
81
ut: __atomic_load_ ## n ## _relaxed(p))
sys/sys/atomic_common.h
82
#define __atomic_store_generic(p, v, t, ut, n) \
sys/sys/atomic_common.h
84
t: __atomic_store_ ## n ## _relaxed(p, v), \
sys/sys/atomic_common.h
85
ut: __atomic_store_ ## n ## _relaxed(p, v))
sys/sys/atomic_common.h
91
#define __atomic_load_generic(p, t, ut, n) \
sys/sys/atomic_common.h
92
__atomic_load_ ## n ## _relaxed(p)
sys/sys/atomic_common.h
93
#define __atomic_store_generic(p, v, t, ut, n) \
sys/sys/atomic_common.h
94
__atomic_store_ ## n ## _relaxed(p, v)
sys/sys/buf.h
470
void pbuf_adjcount(int *pfreecnt, int n);
sys/sys/buf2.h
232
buf_countdeps(struct buf *bp, int n)
sys/sys/buf2.h
240
r = ops->io_countdeps(bp, n);
sys/sys/cdefs.h
121
#define __VM_CACHELINE_ALIGN(n) \
sys/sys/cdefs.h
122
(((n) + __VM_CACHELINE_MASK) & ~__VM_CACHELINE_MASK)
sys/sys/cdefs.h
246
#define __alloc_size2(n, x) __attribute__((__alloc_size__(n, x)))
sys/sys/cdefs.h
249
#define __alloc_size2(n, x)
sys/sys/exislock2.h
171
exis_cache(exislock_t *xlk, long n)
sys/sys/exislock2.h
183
pticks += n + 1;
sys/sys/filedesc.h
165
int fdavail (struct proc *p, int n);
sys/sys/ioccom.h
56
#define _IO(g,n) _IOC(IOC_VOID, (g), (n), 0)
sys/sys/ioccom.h
57
#define _IOWINT(g,n) _IOC(IOC_VOID, (g), (n), sizeof(int))
sys/sys/ioccom.h
58
#define _IOR(g,n,t) _IOC(IOC_OUT, (g), (n), sizeof(t))
sys/sys/ioccom.h
59
#define _IOW(g,n,t) _IOC(IOC_IN, (g), (n), sizeof(t))
sys/sys/ioccom.h
61
#define _IOWR(g,n,t) _IOC(IOC_INOUT, (g), (n), sizeof(t))
sys/sys/kcollect.h
100
void kcollect_unregister(int n);
sys/sys/kcollect.h
101
void kcollect_setvalue(int n, uint64_t value);
sys/sys/kcollect.h
102
void kcollect_setscale(int n, uint64_t value);
sys/sys/kcollect.h
96
typedef uint64_t (*kcallback_t)(int n);
sys/sys/mbuf.h
766
struct mbuf *m, *n;
sys/sys/mbuf.h
768
n = mbufq_flush(mq);
sys/sys/mbuf.h
769
while ((m = n) != NULL) {
sys/sys/mbuf.h
770
n = STAILQ_NEXT(m, m_stailqpkt);
sys/sys/proc.h
489
#define PSTALL(p, msg, n) \
sys/sys/proc.h
490
do { if ((p)->p_lock > (n)) pstall((p), (msg), (n)); } while (0)
sys/sys/refcount.h
103
u_int n;
sys/sys/refcount.h
105
n = atomic_fetchadd_int(countp, -i);
sys/sys/refcount.h
106
if (n == (REFCNTF_WAITING | i)) {
sys/sys/refcount.h
109
n &= ~REFCNTF_WAITING;
sys/sys/refcount.h
111
return (n == i);
sys/sys/refcount.h
89
u_int n;
sys/sys/refcount.h
91
n = atomic_fetchadd_int(countp, -1);
sys/sys/refcount.h
92
if (n == (REFCNTF_WAITING | 1)) {
sys/sys/refcount.h
95
n &= ~REFCNTF_WAITING;
sys/sys/refcount.h
97
return (n == 1);
sys/sys/sockbuf.h
136
void sbcompress (struct sockbuf *sb, struct mbuf *m, struct mbuf *n);
sys/sys/socket.h
441
#define _CMSG_ALIGN(n) (((n) + __ALIGNBYTES) & ~__ALIGNBYTES)
sys/sys/socket.h
444
#define CMSG_ALIGN(n) _CMSG_ALIGN(n)
sys/sys/sysctl.h
89
#define CTLTYPE_BIT32(n) (0x10 | ((n) << CTLSHIFT_BITFLD))
sys/sys/sysctl.h
90
#define CTLTYPE_BIT64(n) (0x11 | ((n) << CTLSHIFT_BITFLD))
sys/sys/ttycom.h
116
#define UIOCCMD(n) _IO('u', n) /* usr cntl op "n" */
sys/sys/uio.h
76
size_t n, struct uio *uio);
sys/vfs/dirfs/dirfs.h
104
#define debug_node2(n) do { \
sys/vfs/dirfs/dirfs.h
107
n, n->dn_name, n->dn_fd, n->dn_parent, n->dn_vnode, \
sys/vfs/dirfs/dirfs.h
108
n->dn_refcnt, dirfs_flag2str(n)); \
sys/vfs/dirfs/dirfs.h
114
#define dirfs_node_islocked(n) (lockstatus(&(n)->dn_lock,curthread) == LK_EXCLUSIVE)
sys/vfs/dirfs/dirfs.h
115
#define dirfs_node_lock(n) lockmgr(&(n)->dn_lock, LK_EXCLUSIVE|LK_RETRY)
sys/vfs/dirfs/dirfs.h
116
#define dirfs_node_unlock(n) lockmgr(&(n)->dn_lock, LK_RELEASE)
sys/vfs/dirfs/dirfs.h
125
#define dirfs_node_isroot(n) (n->dn_state & DIRFS_ROOT)
sys/vfs/dirfs/dirfs_vnops.c
123
dirfs_node_t dnp, dirfs_node_t pdnp, char *n, int error);
sys/vfs/ext2fs/ext2_hash.c
166
int n = 16;
sys/vfs/ext2fs/ext2_hash.c
169
while (n-- > 0) {
sys/vfs/ext2fs/ext2_hash.c
84
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
sys/vfs/hammer/hammer.h
1594
hammer_volume_number_test(hammer_mount_t hmp, int n)
sys/vfs/hammer/hammer.h
1596
int i = __hammer_vol_index(n);
sys/vfs/hammer/hammer.h
1597
return((hmp->volume_map[i] & __hammer_vol_low(n)) != 0);
sys/vfs/hammer/hammer.h
884
#define HAMMER_VOLUME_NUMBER_FOREACH(hmp, n) \
sys/vfs/hammer/hammer.h
885
for (n = 0; n < HAMMER_MAX_VOLUMES; n++) \
sys/vfs/hammer/hammer.h
886
if (hammer_volume_number_test(hmp, n))
sys/vfs/hammer/hammer_btree.c
2717
int n;
sys/vfs/hammer/hammer_btree.c
2719
n = hammer_node_max_elements(node->type);
sys/vfs/hammer/hammer_btree.c
2720
if (n == -1)
sys/vfs/hammer/hammer_btree.c
2723
return(n == node->count);
sys/vfs/hammer/hammer_btree.c
2729
int i, n;
sys/vfs/hammer/hammer_btree.c
2737
n = ondisk->count + 1; /* count is NOT boundary inclusive */
sys/vfs/hammer/hammer_btree.c
2740
n = ondisk->count; /* there is no boundary */
sys/vfs/hammer/hammer_btree.c
2749
for (i = 0; i < n; ++i) {
sys/vfs/hammer/hammer_cursor.c
384
collect_node(hammer_node_t *array, int *counts, int n, hammer_node_t node)
sys/vfs/hammer/hammer_cursor.c
388
for (i = 0; i < n; ++i) {
sys/vfs/hammer/hammer_cursor.c
392
if (i == n) {
sys/vfs/hammer/hammer_cursor.c
409
int n;
sys/vfs/hammer/hammer_cursor.c
411
n = collect_node(nodes, counts, 0, cursor1->node);
sys/vfs/hammer/hammer_cursor.c
413
n = collect_node(nodes, counts, n, cursor1->parent);
sys/vfs/hammer/hammer_cursor.c
414
n = collect_node(nodes, counts, n, cursor2->node);
sys/vfs/hammer/hammer_cursor.c
416
n = collect_node(nodes, counts, n, cursor2->parent);
sys/vfs/hammer/hammer_cursor.c
419
for (i = 0; i < n; ++i) {
sys/vfs/hammer/hammer_cursor.c
437
int n;
sys/vfs/hammer/hammer_cursor.c
439
n = collect_node(nodes, counts, 0, cursor1->node);
sys/vfs/hammer/hammer_cursor.c
441
n = collect_node(nodes, counts, n, cursor1->parent);
sys/vfs/hammer/hammer_cursor.c
442
n = collect_node(nodes, counts, n, cursor2->node);
sys/vfs/hammer/hammer_cursor.c
444
n = collect_node(nodes, counts, n, cursor2->parent);
sys/vfs/hammer/hammer_cursor.c
446
for (i = 0; i < n; ++i)
sys/vfs/hammer/hammer_io.c
1413
hammer_io_countdeps(struct buf *bp, int n)
sys/vfs/hammer/hammer_rebalance.c
284
int n;
sys/vfs/hammer/hammer_rebalance.c
346
n = howmany(count, rebal->saturation);
sys/vfs/hammer/hammer_rebalance.c
347
avg_elms = howmany(count, n);
sys/vfs/hammer/hammer_redo.c
131
n = bytes -
sys/vfs/hammer/hammer_redo.c
147
if (n <= 0) {
sys/vfs/hammer/hammer_redo.c
200
n = 0;
sys/vfs/hammer/hammer_redo.c
201
} else if (n > len) {
sys/vfs/hammer/hammer_redo.c
202
n = len;
sys/vfs/hammer/hammer_redo.c
204
bytes = HAMMER_HEAD_DOALIGN(n) +
sys/vfs/hammer/hammer_redo.c
209
(intmax_t)next_offset, bytes, n);
sys/vfs/hammer/hammer_redo.c
225
redo->redo_data_bytes = n;
sys/vfs/hammer/hammer_redo.c
226
bcopy(base, redo + 1, n);
sys/vfs/hammer/hammer_redo.c
227
len -= n;
sys/vfs/hammer/hammer_redo.c
228
base = (char *)base + n;
sys/vfs/hammer/hammer_redo.c
229
file_off += n;
sys/vfs/hammer/hammer_redo.c
73
int n;
sys/vfs/hammer/hammer_subs.c
1052
int n;
sys/vfs/hammer/hammer_subs.c
1059
n = ptr - str;
sys/vfs/hammer/hammer_subs.c
1060
if (n == 2 && str[0] == '-' && str[1] == '1') {
sys/vfs/hammer/hammer_subs.c
1062
} else if (n == 18 && str[0] == '0' && (str[1] | 0x20) == 'x') {
sys/vfs/hammer/hammer_transaction.c
193
uint32_t n;
sys/vfs/hammer/hammer_transaction.c
240
n = (namekey >> (63 - OBJID_CACHE_BULK_BITS)) & OBJID_CACHE_BULK_MASK;
sys/vfs/hammer/hammer_transaction.c
241
n = ocp_allocbit(ocp, n);
sys/vfs/hammer/hammer_transaction.c
242
tid = ocp->base_tid + n;
sys/vfs/hammer/hammer_transaction.c
269
ocp_allocbit(hammer_objid_cache_t ocp, uint32_t n)
sys/vfs/hammer/hammer_transaction.c
273
n0 = (n >> 5) & 31;
sys/vfs/hammer/hammer_transaction.c
274
n &= 31;
sys/vfs/hammer/hammer_transaction.c
276
while (ocp->bm1[n0] & (1 << n)) {
sys/vfs/hammer/hammer_transaction.c
279
n = 0;
sys/vfs/hammer/hammer_transaction.c
280
} else if (++n == 32) {
sys/vfs/hammer/hammer_transaction.c
282
n = 0;
sys/vfs/hammer/hammer_transaction.c
286
ocp->bm1[n0] |= 1 << n;
sys/vfs/hammer/hammer_transaction.c
289
return((n0 << 5) + n);
sys/vfs/hammer/hammer_transaction.c
37
static uint32_t ocp_allocbit(hammer_objid_cache_t ocp, uint32_t n);
sys/vfs/hammer/hammer_undo.c
106
int n;
sys/vfs/hammer/hammer_undo.c
177
n = bytes -
sys/vfs/hammer/hammer_undo.c
193
if (n <= 0) {
sys/vfs/hammer/hammer_undo.c
216
if (n > len) {
sys/vfs/hammer/hammer_undo.c
217
n = len;
sys/vfs/hammer/hammer_undo.c
218
bytes = HAMMER_HEAD_DOALIGN(n) +
sys/vfs/hammer/hammer_undo.c
224
(intmax_t)next_offset, bytes, n);
sys/vfs/hammer/hammer_undo.c
233
undo->undo_data_bytes = n;
sys/vfs/hammer/hammer_undo.c
234
bcopy(base, undo + 1, n);
sys/vfs/hammer/hammer_undo.c
279
len -= n;
sys/vfs/hammer/hammer_undo.c
280
base = (char *)base + n;
sys/vfs/hammer/hammer_undo.c
281
zone_off += n;
sys/vfs/hammer/hammer_vfsops.c
277
long n;
sys/vfs/hammer/hammer_vfsops.c
293
n = nbuf * 25;
sys/vfs/hammer/hammer_vfsops.c
294
if (n > kmalloc_limit(M_HAMMER) / 512)
sys/vfs/hammer/hammer_vfsops.c
295
n = kmalloc_limit(M_HAMMER) / 512;
sys/vfs/hammer/hammer_vfsops.c
296
if (n > 2 * 1024 * 1024)
sys/vfs/hammer/hammer_vfsops.c
297
n = 2 * 1024 * 1024;
sys/vfs/hammer/hammer_vfsops.c
298
hammer_limit_recs = (int)n;
sys/vfs/hammer/hammer_vnops.c
2656
int n;
sys/vfs/hammer/hammer_vnops.c
2769
n = (int)(rec_offset - (bio->bio_offset + boff));
sys/vfs/hammer/hammer_vnops.c
2770
if (n > 0) {
sys/vfs/hammer/hammer_vnops.c
2771
if (n > bp->b_bufsize - boff)
sys/vfs/hammer/hammer_vnops.c
2772
n = bp->b_bufsize - boff;
sys/vfs/hammer/hammer_vnops.c
2773
bzero((char *)bp->b_data + boff, n);
sys/vfs/hammer/hammer_vnops.c
2774
boff += n;
sys/vfs/hammer/hammer_vnops.c
2775
n = 0;
sys/vfs/hammer/hammer_vnops.c
2786
roff = -n;
sys/vfs/hammer/hammer_vnops.c
2788
n = cursor.leaf->data_len - roff;
sys/vfs/hammer/hammer_vnops.c
2789
if (n <= 0) {
sys/vfs/hammer/hammer_vnops.c
2790
hdkprintf("bad n=%d roff=%d\n", n, roff);
sys/vfs/hammer/hammer_vnops.c
2791
n = 0;
sys/vfs/hammer/hammer_vnops.c
2792
} else if (n > bp->b_bufsize - boff) {
sys/vfs/hammer/hammer_vnops.c
2793
n = bp->b_bufsize - boff;
sys/vfs/hammer/hammer_vnops.c
2817
n = 0;
sys/vfs/hammer/hammer_vnops.c
2818
else if (ip->trunc_off < rec_offset + n)
sys/vfs/hammer/hammer_vnops.c
2819
n = (int)(ip->trunc_off - rec_offset);
sys/vfs/hammer/hammer_vnops.c
2825
n = 0;
sys/vfs/hammer/hammer_vnops.c
2826
else if (ip->sync_trunc_off < rec_offset + n)
sys/vfs/hammer/hammer_vnops.c
2827
n = (int)(ip->sync_trunc_off - rec_offset);
sys/vfs/hammer/hammer_vnops.c
2844
isdedupable = (boff == 0 && n == bp->b_bufsize &&
sys/vfs/hammer/hammer_vnops.c
2865
} else if (n) {
sys/vfs/hammer/hammer_vnops.c
2869
(char *)bp->b_data + boff, n);
sys/vfs/hammer/hammer_vnops.c
2878
boff += n;
sys/vfs/hammer/hammer_vnops.c
312
int n;
sys/vfs/hammer/hammer_vnops.c
441
n = blksize - offset;
sys/vfs/hammer/hammer_vnops.c
442
if (n > uio->uio_resid)
sys/vfs/hammer/hammer_vnops.c
443
n = uio->uio_resid;
sys/vfs/hammer/hammer_vnops.c
444
if (n > ip->ino_data.size - uio->uio_offset)
sys/vfs/hammer/hammer_vnops.c
445
n = (int)(ip->ino_data.size - uio->uio_offset);
sys/vfs/hammer/hammer_vnops.c
455
error = uiomovebp(bp, (char *)bp->b_data + offset, n, uio);
sys/vfs/hammer/hammer_vnops.c
460
hammer_stats_file_read += n;
sys/vfs/hammer/hammer_vnops.c
509
int n;
sys/vfs/hammer/hammer_vnops.c
657
n = blksize - offset;
sys/vfs/hammer/hammer_vnops.c
658
if (n > uio->uio_resid) {
sys/vfs/hammer/hammer_vnops.c
659
n = uio->uio_resid;
sys/vfs/hammer/hammer_vnops.c
664
nsize = uio->uio_offset + n;
sys/vfs/hammer/hammer_vnops.c
724
error = uiomovebp(bp, bp->b_data + offset, n, uio);
sys/vfs/hammer/hammer_vnops.c
750
(size_t)n);
sys/vfs/hammer/hammer_vnops.c
772
hammer_stats_file_write += n;
sys/vfs/hammer2/hammer2_bulkfree.c
1368
int n;
sys/vfs/hammer2/hammer2_bulkfree.c
1371
n = hammer2_icrc32(&bref->data_off, sizeof(bref->data_off));
sys/vfs/hammer2/hammer2_bulkfree.c
1372
dedup = cbinfo->dedup + (n & (HAMMER2_DEDUP_HEUR_MASK & ~7));
sys/vfs/hammer2/hammer2_disk.h
1086
#define HAMMER2_PFS_DEC(n) ((n) & 0x0F)
sys/vfs/hammer2/hammer2_disk.h
1087
#define HAMMER2_PFS_DEC_TRANSITION(n) (((n) >> 4) & 0x0F)
sys/vfs/hammer2/hammer2_disk.h
1088
#define HAMMER2_PFS_ENC_TRANSITION(n) (((n) & 0x0F) << 4)
sys/vfs/hammer2/hammer2_disk.h
752
#define HAMMER2_ENC_CHECK(n) (((n) & 15) << 4)
sys/vfs/hammer2/hammer2_disk.h
753
#define HAMMER2_DEC_CHECK(n) (((n) >> 4) & 15)
sys/vfs/hammer2/hammer2_disk.h
754
#define HAMMER2_ENC_COMP(n) ((n) & 15)
sys/vfs/hammer2/hammer2_disk.h
755
#define HAMMER2_DEC_COMP(n) ((n) & 15)
sys/vfs/hammer2/hammer2_disk.h
761
#define HAMMER2_ENC_ALGO(n) (n)
sys/vfs/hammer2/hammer2_disk.h
762
#define HAMMER2_DEC_ALGO(n) ((n) & 15)
sys/vfs/hammer2/hammer2_disk.h
763
#define HAMMER2_ENC_LEVEL(n) ((n) << 4)
sys/vfs/hammer2/hammer2_disk.h
764
#define HAMMER2_DEC_LEVEL(n) (((n) >> 4) & 15)
sys/vfs/hammer2/hammer2_freemap.c
379
int n;
sys/vfs/hammer2/hammer2_freemap.c
411
n = start + count;
sys/vfs/hammer2/hammer2_freemap.c
412
bmap = &chain->data->bmdata[n];
sys/vfs/hammer2/hammer2_freemap.c
414
if (n >= HAMMER2_FREEMAP_COUNT) {
sys/vfs/hammer2/hammer2_freemap.c
433
base_key = key + n * l0size;
sys/vfs/hammer2/hammer2_freemap.c
435
class, n,
sys/vfs/hammer2/hammer2_freemap.c
455
n = start - count;
sys/vfs/hammer2/hammer2_freemap.c
456
bmap = &chain->data->bmdata[n];
sys/vfs/hammer2/hammer2_freemap.c
457
if (n < 0) {
sys/vfs/hammer2/hammer2_freemap.c
476
base_key = key + n * l0size;
sys/vfs/hammer2/hammer2_freemap.c
478
class, n,
sys/vfs/hammer2/hammer2_freemap.c
571
uint16_t class, int n, int sub_key,
sys/vfs/hammer2/hammer2_freemap.c
61
int n, int sub_key, int radix, hammer2_key_t *basep);
sys/vfs/hammer2/hammer2_freemap.c
769
if (n & 1) {
sys/vfs/hammer2/hammer2_synchro.c
374
int n;
sys/vfs/hammer2/hammer2_synchro.c
497
n = -1;
sys/vfs/hammer2/hammer2_synchro.c
504
n = 1;
sys/vfs/hammer2/hammer2_synchro.c
512
n = hammer2_chain_cmp(chain, focus);
sys/vfs/hammer2/hammer2_synchro.c
518
if (n < 0) {
sys/vfs/hammer2/hammer2_synchro.c
525
} else if (n == 0 && chain->bref.modify_tid !=
sys/vfs/hammer2/hammer2_synchro.c
548
} else if (n == 0) {
sys/vfs/hammer2/hammer2_synchro.c
555
} else if (n > 0) {
sys/vfs/hammer2/hammer2_vnops.c
1052
int n;
sys/vfs/hammer2/hammer2_vnops.c
1078
n = lblksize - loff;
sys/vfs/hammer2/hammer2_vnops.c
1079
if (n > uio->uio_resid) {
sys/vfs/hammer2/hammer2_vnops.c
1080
n = uio->uio_resid;
sys/vfs/hammer2/hammer2_vnops.c
1081
if (loff == lbase && uio->uio_offset + n == new_eof)
sys/vfs/hammer2/hammer2_vnops.c
1142
error = uiomovebp(bp, bp->b_data + loff, n, uio);
sys/vfs/hammer2/hammer2_vnops.c
931
int n;
sys/vfs/hammer2/hammer2_vnops.c
977
n = lblksize - loff;
sys/vfs/hammer2/hammer2_vnops.c
978
if (n > uio->uio_resid)
sys/vfs/hammer2/hammer2_vnops.c
979
n = uio->uio_resid;
sys/vfs/hammer2/hammer2_vnops.c
980
if (n > size - uio->uio_offset)
sys/vfs/hammer2/hammer2_vnops.c
981
n = (int)(size - uio->uio_offset);
sys/vfs/hammer2/hammer2_vnops.c
983
uiomovebp(bp, bp->b_data + loff, n, uio);
sys/vfs/hammer2/zlib/hammer2_zlib_adler32.c
108
n = NMAX / 16; /* NMAX is divisible by 16 */
sys/vfs/hammer2/zlib/hammer2_zlib_adler32.c
112
} while (--n);
sys/vfs/hammer2/zlib/hammer2_zlib_adler32.c
72
unsigned n;
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
805
register unsigned n, m;
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
844
n = s->hash_size;
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
845
p = &s->head[n];
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
849
} while (--n);
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
851
n = wsize;
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
853
p = &s->prev[n];
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
860
} while (--n);
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
879
n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
sys/vfs/hammer2/zlib/hammer2_zlib_deflate.c
880
s->lookahead += n;
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
449
#define NEEDBITS(n) \
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
451
while (bits < (unsigned)(n)) \
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
456
#define BITS(n) \
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
457
((unsigned)hold & ((1U << (n)) - 1))
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
460
#define DROPBITS(n) \
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
462
hold >>= (n); \
sys/vfs/hammer2/zlib/hammer2_zlib_inflate.c
463
bits -= (unsigned)(n); \
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
1134
int n;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
1137
for (n = 0; n <= 31; n++, black_mask >>= 1)
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
1138
if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
1145
for (n = 32; n < LITERALS; n++)
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
1146
if (s->dyn_ltree[n].Freq != 0)
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
239
int n; /* iterates over tree elements */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
262
for (n = 0; n < (1<<extra_lbits[code]); n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
277
for (n = 0; n < (1<<extra_dbits[code]); n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
285
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
293
n = 0;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
294
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
295
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
296
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
297
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
305
for (n = 0; n < D_CODES; n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
306
static_dtree[n].Len = 5;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
307
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
416
int n; /* iterates over tree elements */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
419
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
420
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
421
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
447
#define smaller(tree, n, m, depth) \
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
448
(tree[n].Freq < tree[m].Freq || \
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
449
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
502
int n, m; /* iterate over the tree elements */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
516
n = s->heap[h];
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
517
bits = tree[tree[n].Dad].Len + 1;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
519
tree[n].Len = (ush)bits;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
522
if (n > max_code) continue; /* not a leaf node */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
526
if (n >= base) xbits = extra[n-base];
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
527
f = tree[n].Freq;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
529
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
555
n = s->bl_count[bits];
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
556
while (n != 0) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
565
n--;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
588
int n; /* code index */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
603
for (n = 0; n <= max_code; n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
604
int len = tree[n].Len;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
607
tree[n].Code = bi_reverse(next_code[len]++, len);
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
610
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
629
int n, m; /* iterate over heap elements */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
639
for (n = 0; n < elems; n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
640
if (tree[n].Freq != 0) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
641
s->heap[++(s->heap_len)] = max_code = n;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
642
s->depth[n] = 0;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
644
tree[n].Len = 0;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
665
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
672
pqremove(s, tree, n); /* n = node of least frequency */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
675
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
679
tree[node].Freq = tree[n].Freq + tree[m].Freq;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
680
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
681
s->depth[n] : s->depth[m]) + 1);
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
682
tree[n].Dad = tree[m].Dad = (ush)node;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
686
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
716
int n; /* iterates over all tree elements */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
727
for (n = 0; n <= max_code; n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
728
curlen = nextlen; nextlen = tree[n+1].Len;
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
760
int n; /* iterates over all tree elements */
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
771
for (n = 0; n <= max_code; n++) {
sys/vfs/hammer2/zlib/hammer2_zlib_trees.c
772
curlen = nextlen; nextlen = tree[n+1].Len;
sys/vfs/hpfs/hpfs.h
158
#define AB_ADDNREC(abp, sz, n) { \
sys/vfs/hpfs/hpfs.h
159
(abp)->ab_busycnt += (n); \
sys/vfs/hpfs/hpfs.h
160
(abp)->ab_freecnt -= (n); \
sys/vfs/hpfs/hpfs.h
161
(abp)->ab_freeoff += (n) * (sz); \
sys/vfs/hpfs/hpfs.h
163
#define AB_RMNREC(abp, sz, n) { \
sys/vfs/hpfs/hpfs.h
164
(abp)->ab_busycnt -= (n); \
sys/vfs/hpfs/hpfs.h
165
(abp)->ab_freecnt += (n); \
sys/vfs/hpfs/hpfs.h
166
(abp)->ab_freeoff -= (n) * (sz);\
sys/vfs/isofs/cd9660/cd9660_util.c
195
sgetrune(const char *string, size_t n, char const **result,
sys/vfs/isofs/cd9660/cd9660_util.c
202
len = i = (n < 2) ? n : 2;
sys/vfs/isofs/cd9660/cd9660_vnops.c
259
long size, n, on;
sys/vfs/isofs/cd9660/cd9660_vnops.c
273
n = szmin((u_int)(imp->logical_block_size - on),
sys/vfs/isofs/cd9660/cd9660_vnops.c
278
if (diff < n)
sys/vfs/isofs/cd9660/cd9660_vnops.c
279
n = diff;
sys/vfs/isofs/cd9660/cd9660_vnops.c
303
n = imin(n, size - bp->b_resid);
sys/vfs/isofs/cd9660/cd9660_vnops.c
309
error = uiomove(bp->b_data + on, (int)n, uio);
sys/vfs/isofs/cd9660/cd9660_vnops.c
311
} while (error == 0 && uio->uio_resid > 0 && n != 0);
sys/vfs/mfs/mfs_vfsops.c
554
int n = PAGE_SIZE - ((vm_offset_t)base & PAGE_MASK);
sys/vfs/mfs/mfs_vfsops.c
555
bytes -= n;
sys/vfs/mfs/mfs_vfsops.c
556
base += n;
sys/vfs/msdosfs/msdosfs_fat.c
685
u_long cl, n;
sys/vfs/msdosfs/msdosfs_fat.c
691
for (cl = start, n = count; n-- > 0;)
sys/vfs/msdosfs/msdosfs_fat.c
701
for (cl = start, n = count; n-- > 0;)
sys/vfs/msdosfs/msdosfs_vnops.c
1489
long n;
sys/vfs/msdosfs/msdosfs_vnops.c
1572
for (n = (int)offset / sizeof(struct direntry);
sys/vfs/msdosfs/msdosfs_vnops.c
1573
n < 2; n++) {
sys/vfs/msdosfs/msdosfs_vnops.c
1578
switch (n) {
sys/vfs/msdosfs/msdosfs_vnops.c
1612
n = szmin(pmp->pm_bpcluster - on, uio->uio_resid);
sys/vfs/msdosfs/msdosfs_vnops.c
1616
n = min(n, diff);
sys/vfs/msdosfs/msdosfs_vnops.c
1625
n = min(n, blsize - bp->b_resid);
sys/vfs/msdosfs/msdosfs_vnops.c
1626
if (n == 0) {
sys/vfs/msdosfs/msdosfs_vnops.c
1637
(char *)dentp < bp->b_data + on + n;
sys/vfs/msdosfs/msdosfs_vnops.c
459
u_int n;
sys/vfs/msdosfs/msdosfs_vnops.c
544
n = szmin(uio->uio_resid, diff);
sys/vfs/msdosfs/msdosfs_vnops.c
546
if (diff < n)
sys/vfs/msdosfs/msdosfs_vnops.c
547
n = diff;
sys/vfs/msdosfs/msdosfs_vnops.c
549
if (diff < n)
sys/vfs/msdosfs/msdosfs_vnops.c
550
n = diff;
sys/vfs/msdosfs/msdosfs_vnops.c
551
error = uiomovebp(bp, bp->b_data + on, (size_t)n, uio);
sys/vfs/msdosfs/msdosfs_vnops.c
553
} while (error == 0 && uio->uio_resid > 0 && n != 0);
sys/vfs/msdosfs/msdosfs_vnops.c
567
int n;
sys/vfs/msdosfs/msdosfs_vnops.c
671
n = (int)szmin(uio->uio_resid, pmp->pm_bpcluster - croffset);
sys/vfs/msdosfs/msdosfs_vnops.c
672
if (uio->uio_offset + n > dep->de_FileSize) {
sys/vfs/msdosfs/msdosfs_vnops.c
673
dep->de_FileSize = uio->uio_offset + n;
sys/vfs/msdosfs/msdosfs_vnops.c
740
error = uiomovebp(bp, bp->b_data + croffset, (size_t)n, uio);
sys/vfs/msdosfs/msdosfs_vnops.c
764
else if (n + croffset == pmp->pm_bpcluster) {
sys/vfs/nfs/nfs.h
105
#define NFS_CMPFH(n, f, s) \
sys/vfs/nfs/nfs.h
106
((n)->n_fhsize == (s) && !bcmp((caddr_t)(n)->n_fhp, (caddr_t)(f), (s)))
sys/vfs/nfs/nfs.h
108
#define NFS_SRVMAXDATA(n) \
sys/vfs/nfs/nfs.h
109
(((n)->nd_flag & ND_NFSV3) ? (((n)->nd_nam2) ? \
sys/vfs/nfs/nfs.h
575
#define NFSW_CONTIG(o, n) \
sys/vfs/nfs/nfs.h
576
((o)->nd_eoff >= (n)->nd_off && \
sys/vfs/nfs/nfs.h
577
!bcmp((caddr_t)&(o)->nd_fh, (caddr_t)&(n)->nd_fh, NFSX_V3FH))
sys/vfs/nfs/nfs.h
579
#define NFSW_SAMECRED(o, n) \
sys/vfs/nfs/nfs.h
580
(((o)->nd_flag & ND_KERBAUTH) == ((n)->nd_flag & ND_KERBAUTH) && \
sys/vfs/nfs/nfs.h
581
!bcmp((caddr_t)&(o)->nd_cr, (caddr_t)&(n)->nd_cr, \
sys/vfs/nfs/nfs_bio.c
103
size_t n;
sys/vfs/nfs/nfs_bio.c
1057
size_t n;
sys/vfs/nfs/nfs_bio.c
1119
n = (size_t)bp->b_bcount - uiop->uio_resid;
sys/vfs/nfs/nfs_bio.c
1120
bzero(bp->b_data + n, bp->b_bcount - n);
sys/vfs/nfs/nfs_bio.c
225
n = 0;
sys/vfs/nfs/nfs_bio.c
256
n = biosize - boff;
sys/vfs/nfs/nfs_bio.c
257
if (n > uio->uio_resid)
sys/vfs/nfs/nfs_bio.c
258
n = uio->uio_resid;
sys/vfs/nfs/nfs_bio.c
259
if (loffset + boff + n > np->n_size)
sys/vfs/nfs/nfs_bio.c
260
n = np->n_size - loffset - boff;
sys/vfs/nfs/nfs_bio.c
280
n = szmin(uio->uio_resid, (size_t)bp->b_bcount - bp->b_resid);
sys/vfs/nfs/nfs_bio.c
397
n = 0;
sys/vfs/nfs/nfs_bio.c
399
n = szmin(uio->uio_resid,
sys/vfs/nfs/nfs_bio.c
403
n > (size_t)(np->n_direofoffset - uio->uio_offset)) {
sys/vfs/nfs/nfs_bio.c
404
n = (size_t)(np->n_direofoffset - uio->uio_offset);
sys/vfs/nfs/nfs_bio.c
409
n = 0;
sys/vfs/nfs/nfs_bio.c
415
if (n > 0)
sys/vfs/nfs/nfs_bio.c
416
error = uiomovebp(bp, bp->b_data + boff, n, uio);
sys/vfs/nfs/nfs_bio.c
419
if (n > 0)
sys/vfs/nfs/nfs_bio.c
420
error = uiomovebp(bp, bp->b_data + boff, n, uio);
sys/vfs/nfs/nfs_bio.c
421
n = 0;
sys/vfs/nfs/nfs_bio.c
424
if (n > 0) {
sys/vfs/nfs/nfs_bio.c
439
epos = bp->b_data + boff + n;
sys/vfs/nfs/nfs_bio.c
451
n = 0;
sys/vfs/nfs/nfs_bio.c
463
} while (error == 0 && uio->uio_resid > 0 && n > 0);
sys/vfs/nfs/nfs_socket.c
2250
struct mbuf *n = NULL;
sys/vfs/nfs/nfs_socket.c
2267
n = m_dup_data(m, M_WAITOK);
sys/vfs/nfs/nfs_socket.c
2269
*pm = n;
sys/vfs/nfs/nfs_socket.c
938
int n;
sys/vfs/nfs/nfs_socket.c
942
n = ((NFS_SRTT(rep) * 7) +
sys/vfs/nfs/nfs_socket.c
944
d = n - NFS_SRTT(rep);
sys/vfs/nfs/nfs_socket.c
945
NFS_SRTT(rep) = n;
sys/vfs/nfs/nfs_socket.c
955
n = ((NFS_SDRTT(rep) * 15) + d) >> 4;
sys/vfs/nfs/nfs_socket.c
957
n = ((NFS_SDRTT(rep) * 3) + d) >> 2;
sys/vfs/nfs/nfs_socket.c
958
NFS_SDRTT(rep) = n;
sys/vfs/nfs/nfs_socket.c
972
int n;
sys/vfs/nfs/nfs_socket.c
977
n = nmp->nm_srtt[proct[procnum]];
sys/vfs/nfs/nfs_socket.c
978
n += NFS_ASYSCALE * NFS_HZ;
sys/vfs/nfs/nfs_socket.c
979
if (n < NFS_ASYSCALE * NFS_HZ * 10)
sys/vfs/nfs/nfs_socket.c
980
n = NFS_ASYSCALE * NFS_HZ * 10;
sys/vfs/nfs/nfs_socket.c
981
nmp->nm_srtt[proct[procnum]] = n;
sys/vfs/nfs/nfsm_subs.c
292
int n;
sys/vfs/nfs/nfsm_subs.c
309
n = mtod(info->md, caddr_t) + info->md->m_len - info->dpos;
sys/vfs/nfs/nfsm_subs.c
310
if (bytes <= n) {
sys/vfs/nfs/nfsm_subs.c
314
error = nfsm_disct(&info->md, &info->dpos, bytes, n, &cp2);
sys/vfs/nfs/nfsm_subs.c
336
int n;
sys/vfs/nfs/nfsm_subs.c
339
n = nfsm_rndup(VTONFS(vp)->n_fhsize) + NFSX_UNSIGNED;
sys/vfs/nfs/nfsm_subs.c
340
if (n <= M_TRAILINGSPACE(info->mb)) {
sys/vfs/nfs/nfsm_subs.c
341
tl = nfsm_build(info, n);
sys/vfs/nfs/nfsm_subs.c
343
*(tl + ((n >> 2) - 2)) = 0;
sys/vfs/nfs/nfsm_subs.c
446
int n;
sys/vfs/nfs/nfsm_subs.c
453
if ((n = fxdr_unsigned(int, *tl)) <= 0 || n > NFSX_V3FHMAX) {
sys/vfs/nfs/nfsm_subs.c
459
n = NFSX_V2FH;
sys/vfs/nfs/nfsm_subs.c
461
*fhpp = nfsm_dissect(info, nfsm_rndup(n));
sys/vfs/nfs/nfsm_subs.c
464
return(n);
sys/vfs/nfs/nfsm_subs.c
847
int n;
sys/vfs/nfs/nfsm_subs.c
854
n = nfsm_rndup(len) + NFSX_UNSIGNED;
sys/vfs/nfs/nfsm_subs.c
855
if (n <= M_TRAILINGSPACE(info->mb)) {
sys/vfs/nfs/nfsm_subs.c
856
tl = nfsm_build(info, n);
sys/vfs/nfs/nfsm_subs.c
858
*(tl + ((n >> 2) - 2)) = 0;
sys/vfs/nfs/nfsm_subs.c
914
int n;
sys/vfs/nfs/nfsm_subs.c
916
n = mtod(info->md, caddr_t) + info->md->m_len - info->dpos;
sys/vfs/nfs/nfsm_subs.c
917
if (n >= len) {
sys/vfs/nfs/nfsm_subs.c
920
} else if ((error = nfs_adv(&info->md, &info->dpos, len, n)) != 0) {
sys/vfs/udf/osta.c
214
udf_cksum(unsigned char *s, int n)
sys/vfs/udf/osta.c
218
while (n-- > 0)
sys/vfs/udf/osta.c
225
udf_unicode_cksum(unsigned short *s, int n)
sys/vfs/udf/osta.c
229
while (n-- > 0) {
sys/vfs/ufs/ufs_dirhash.c
58
#define BLKFREE2IDX(n) ((n) > DH_NFSTATS ? DH_NFSTATS : (n))
sys/vm/swap_pager.c
1592
int n = 0;
sys/vm/swap_pager.c
1636
int n;
sys/vm/swap_pager.c
1641
if ((n = swap_async_max) > nswbuf_kva / 2)
sys/vm/swap_pager.c
1642
n = nswbuf_kva / 2;
sys/vm/swap_pager.c
1643
if (n < 1)
sys/vm/swap_pager.c
1644
n = 1;
sys/vm/swap_pager.c
1645
swap_async_max = n;
sys/vm/swap_pager.c
1655
n -= nsw_wcount_async_max;
sys/vm/swap_pager.c
1656
if (nsw_wcount_async + n >= 0) {
sys/vm/swap_pager.c
1657
nsw_wcount_async_max += n;
sys/vm/swap_pager.c
1658
pbuf_adjcount(&nsw_wcount_async, n);
sys/vm/swap_pager.c
1671
for (i = 0; i < count; i += n) {
sys/vm/swap_pager.c
1681
n = min(BLIST_MAX_ALLOC, count - i);
sys/vm/swap_pager.c
1682
n = min(n, nsw_cluster_max);
sys/vm/swap_pager.c
1693
(blk = swp_pager_getswapspace(object, n)) == SWAPBLK_NONE &&
sys/vm/swap_pager.c
1694
n > 4
sys/vm/swap_pager.c
1696
n >>= 1;
sys/vm/swap_pager.c
1699
for (j = 0; j < n; ++j)
sys/vm/swap_pager.c
1705
kprintf("swap_alloc %08jx,%d\n", (intmax_t)blk, n);
sys/vm/swap_pager.c
1713
if ((blk ^ (blk + n)) & ~SWB_DMMASK) {
sys/vm/swap_pager.c
1715
swp_pager_freeswapspace(object, blk + j, n - j);
sys/vm/swap_pager.c
1716
n = j;
sys/vm/swap_pager.c
1733
pmap_qenter_noinval((vm_offset_t)bp->b_data, &m[i], n);
sys/vm/swap_pager.c
1736
bp->b_bcount = PAGE_SIZE * n;
sys/vm/swap_pager.c
1739
for (j = 0; j < n; ++j) {
sys/vm/swap_pager.c
1751
bp->b_xio.xio_npages = n;
sys/vm/swap_pager.c
1769
for (j = 0; j < n; ++j)
sys/vm/swap_pager.c
1790
for (j = 0; j < n; ++j)
sys/vm/swap_pager.c
2168
int n;
sys/vm/swap_pager.c
2173
for (n = 0; n < VMOBJ_HSIZE; ++n) {
sys/vm/swap_pager.c
2174
hash = &vm_object_hash[n];
sys/vm/swap_pager.c
346
collect_swap_callback(int n)
sys/vm/swap_pager.c
395
int n, n2;
sys/vm/swap_pager.c
435
n = vmstats.v_page_count / 2;
sys/vm/swap_pager.c
436
if (maxswzone && n < maxswzone / sizeof(struct swblock))
sys/vm/swap_pager.c
437
n = maxswzone / sizeof(struct swblock);
sys/vm/swap_pager.c
438
n2 = n;
sys/vm/swap_pager.c
444
n,
sys/vm/swap_pager.c
452
n -= ((n + 2) / 3);
sys/vm/swap_pager.c
453
} while (n > 0);
sys/vm/swap_pager.c
457
if (n2 != n)
sys/vm/swap_pager.c
458
kprintf("Swap zone entries reduced from %d to %d.\n", n2, n);
sys/vm/swap_pager.c
667
int n;
sys/vm/swap_pager.c
684
n = count - (int)info.begi;
sys/vm/swap_pager.c
686
if (n < t)
sys/vm/swap_pager.c
687
n = t;
sys/vm/swap_pager.c
688
if (n < 1)
sys/vm/swap_pager.c
689
n = 1;
sys/vm/swap_pager.c
690
return(n);
sys/vm/swap_pager.c
758
int n = 0;
sys/vm/swap_pager.c
765
if (n == 0) {
sys/vm/swap_pager.c
766
n = BLIST_MAX_ALLOC;
sys/vm/swap_pager.c
767
while ((blk = swp_pager_getswapspace(object, n)) ==
sys/vm/swap_pager.c
770
n >>= 1;
sys/vm/swap_pager.c
771
if (n == 0) {
sys/vm/swap_pager.c
783
--n;
sys/vm/swap_pager.c
785
swp_pager_meta_free(object, start, n);
sys/vm/vm_fault.c
1042
for (n = 1; n < nlim; ++n) {
sys/vm/vm_fault.c
1043
m = vm_page_hash_get(obj, first_pindex + n);
sys/vm/vm_fault.c
1062
fs->mary[n] = m;
sys/vm/vm_fault.c
1064
*mextcountp = n;
sys/vm/vm_fault.c
421
int n;
sys/vm/vm_fault.c
788
for (n = 0; n < mextcount; ++n)
sys/vm/vm_fault.c
789
vm_page_flag_set(fs.mary[n], PG_VPTMAPPED);
sys/vm/vm_fault.c
793
for (n = 0; n < mextcount; ++n) {
sys/vm/vm_fault.c
794
pmap_enter(fs.map->pmap, vaddr + (n << PAGE_SHIFT),
sys/vm/vm_fault.c
795
fs.mary[n], fs.prot | inherit_prot,
sys/vm/vm_fault.c
809
for (n = 0; n < mextcount; ++n) {
sys/vm/vm_fault.c
811
KKASSERT(fs.mary[n]->busy_count & PBUSY_MASK);
sys/vm/vm_fault.c
813
vm_page_sbusy_drop(fs.mary[n]);
sys/vm/vm_fault.c
819
vm_page_wire(fs.mary[n]);
sys/vm/vm_fault.c
821
vm_page_unwire(fs.mary[n], 1);
sys/vm/vm_fault.c
824
vm_page_activate(fs.mary[n]);
sys/vm/vm_fault.c
826
KKASSERT(fs.mary[n]->busy_count & PBUSY_LOCKED);
sys/vm/vm_fault.c
827
vm_page_wakeup(fs.mary[n]);
sys/vm/vm_fault.c
938
int n;
sys/vm/vm_kern.h
98
#define KM_CPU(n) (((n) << KM_CPU_SHIFT) | KM_CPU_SPEC)
sys/vm/vm_map.c
348
int32_t n;
sys/vm/vm_map.c
350
n = vm->vm_refcnt;
sys/vm/vm_map.c
352
if (n & VM_REF_DELETED)
sys/vm/vm_map.c
353
n = -1;
sys/vm/vm_map.c
354
return n;
sys/vm/vm_map.c
396
uint32_t n;
sys/vm/vm_map.c
399
n = atomic_fetchadd_int(&vm->vm_refcnt, 1);
sys/vm/vm_map.c
400
KKASSERT((n & VM_REF_DELETED) == 0);
sys/vm/vm_map.c
411
uint32_t n;
sys/vm/vm_map.c
420
n = atomic_fetchadd_int(&vm->vm_refcnt, -1) - 1;
sys/vm/vm_map.c
421
while (n == 0) {
sys/vm/vm_map.c
426
n = vm->vm_refcnt;
sys/vm/vm_map.c
562
vm_offset_t n;
sys/vm/vm_map.c
573
n = (cur->ba.end - cur->ba.start) / PAGE_SIZE;
sys/vm/vm_map.c
575
SWAP_META_PAGES * n / object->size + 1;
sys/vm/vm_meter.c
111
int n;
sys/vm/vm_meter.c
114
for (n = 0; n < ncpus; ++n) {
sys/vm/vm_meter.c
115
gd = globaldata_find(n);
sys/vm/vm_meter.c
447
collect_vmstats_callback(int n)
sys/vm/vm_meter.c
468
for (n = 0; n < ncpus; ++n) {
sys/vm/vm_meter.c
469
struct globaldata *gd = globaldata_find(n);
sys/vm/vm_object.c
1836
int n;
sys/vm/vm_object.c
1842
for (n = 0; n < VMOBJ_HSIZE; ++n) {
sys/vm/vm_object.c
1843
hash = &vm_object_hash[n];
sys/vm/vm_object.c
1947
int n;
sys/vm/vm_object.c
1949
for (n = 0; n < VMOBJ_HSIZE; ++n) {
sys/vm/vm_object.c
1950
hash = &vm_object_hash[n];
sys/vm/vm_page.h
482
#define VM_ALLOC_CPU(n) (((n) << VM_ALLOC_CPU_SHIFT) | \
sys/vm/vm_pageout.c
295
PQAVERAGE(long n)
sys/vm/vm_pageout.c
299
if (n >= 0) {
sys/vm/vm_pageout.c
300
avg = ((n + (PQ_L2_SIZE - 1)) / (PQ_L2_SIZE / 2) + 1);
sys/vm/vm_pageout.c
302
avg = ((n - (PQ_L2_SIZE - 1)) / (PQ_L2_SIZE / 2) - 1);
sys/vm/vm_pager.c
689
pbuf_adjcount(int *pfreecnt, int n)
sys/vm/vm_pager.c
691
if (n) {
sys/vm/vm_pager.c
692
atomic_add_int(pfreecnt, n);
sys/vm/vm_swap.c
612
int n;
sys/vm/vm_swap.c
615
for (n = 0; n < nswdev; ++n) {
sys/vm/vm_swap.c
616
sp = &swdevt[n];
sys/vm/vm_swapcache.c
709
int n;
sys/vm/vm_swapcache.c
794
n = swap_pager_condfree(object, &marker->dummy_obj.size,
sys/vm/vm_swapcache.c
805
if (n <= 0 ||
sys/vm/vm_swapcache.c
814
count -= n;
sys/vm/vm_swapcache.c
815
marker->save_off += n * PAGE_SIZE;
sys/vm/vm_vmspace.c
105
n = atomic_fetchadd_int(&ve->refs, 1);
sys/vm/vm_vmspace.c
106
if ((n & VKE_REF_DELETED) == 0) {
sys/vm/vm_vmspace.c
121
n = atomic_fetchadd_int(&ve->refs, 1);
sys/vm/vm_vmspace.c
122
if (n & VKE_REF_DELETED) {
sys/vm/vm_vmspace.c
92
uint32_t n;
sys/vm/vm_zone.c
136
n = zmax / 10 + 1;
sys/vm/vm_zone.c
138
if (zpcpu->zfreecnt >= n * 4)
sys/vm/vm_zone.c
165
} while (--n > 0 && z->zfreecnt > z->zfreemin);
sys/vm/vm_zone.c
832
int n;
sys/vm/vm_zone.c
849
for (n = 0; n < ncpus; ++n) {
sys/vm/vm_zone.c
850
freecnt += curzone->zpcpu[n].zfreecnt;
sys/vm/vm_zone.c
851
znalloc += curzone->zpcpu[n].znalloc;
sys/vm/vm_zone.c
95
long n;
test/crypto/cryptoapi/cryptoapi_test.c
187
char to_hex(int n)
test/crypto/cryptoapi/cryptoapi_test.c
189
if (n >= 0 && n <= 9)
test/crypto/cryptoapi/cryptoapi_test.c
190
return ('0' + n);
test/crypto/cryptoapi/cryptoapi_test.c
191
if (n >= 10 && n <= 15)
test/crypto/cryptoapi/cryptoapi_test.c
192
return ('a' + n - 10);
test/crypto/cryptoapi/cryptoapi_test.c
45
static char to_hex(int n);
test/debug/crc32.c
22
int n;
test/debug/crc32.c
29
while ((n = read(0, buf, sizeof(buf))) > 0) {
test/debug/crc32.c
31
crc1 = iscsi_crc32_ext(buf, n, crc1);
test/debug/crc32.c
33
crc2 = crc32_ext(buf, n, crc2);
test/debug/crc32hw.c
132
int n;
test/debug/crc32hw.c
134
for (n = 0; n < 32; n++)
test/debug/crc32hw.c
135
square[n] = gf2_matrix_times(mat, mat[n]);
test/debug/crc32hw.c
145
int n;
test/debug/crc32hw.c
152
for (n = 1; n < 32; n++) {
test/debug/crc32hw.c
153
odd[n] = row;
test/debug/crc32hw.c
176
for (n = 0; n < 32; n++)
test/debug/crc32hw.c
177
even[n] = odd[n];
test/debug/crc32hw.c
184
uint32_t n;
test/debug/crc32hw.c
188
for (n = 0; n < 256; n++) {
test/debug/crc32hw.c
189
zeros[0][n] = gf2_matrix_times(op, n);
test/debug/crc32hw.c
190
zeros[1][n] = gf2_matrix_times(op, n << 8);
test/debug/crc32hw.c
191
zeros[2][n] = gf2_matrix_times(op, n << 16);
test/debug/crc32hw.c
192
zeros[3][n] = gf2_matrix_times(op, n << 24);
test/debug/crc32hw.c
349
size_t off, n;
test/debug/crc32hw.c
362
n = (size_t)got - off;
test/debug/crc32hw.c
363
if (n > CHUNK)
test/debug/crc32hw.c
364
n = CHUNK;
test/debug/crc32hw.c
365
crc = argc > 1 ? crc32c_sw(crc, buf + off, n) :
test/debug/crc32hw.c
366
crc32c(crc, buf + off, n);
test/debug/crc32hw.c
367
off += n;
test/debug/crc32hw.c
52
uint32_t n, crc, k;
test/debug/crc32hw.c
54
for (n = 0; n < 256; n++) {
test/debug/crc32hw.c
55
crc = n;
test/debug/crc32hw.c
64
crc32c_table[0][n] = crc;
test/debug/crc32hw.c
66
for (n = 0; n < 256; n++) {
test/debug/crc32hw.c
67
crc = crc32c_table[0][n];
test/debug/crc32hw.c
70
crc32c_table[k][n] = crc;
test/debug/icrc32.c
22
int n;
test/debug/icrc32.c
29
while ((n = read(0, buf, sizeof(buf))) > 0) {
test/debug/icrc32.c
31
crc1 = iscsi_crc32_ext(buf, n, crc1);
test/debug/icrc32.c
33
crc2 = crc32_ext(buf, n, crc2);
test/debug/mbufinfo.c
200
int n;
test/debug/mbufinfo.c
203
for (n = 0; n < len; n += count) {
test/debug/mbufinfo.c
204
count = len - n;
test/debug/mbufinfo.c
207
kkread(kd, (long)data + n, buf, count);
test/debug/mbufinfo.c
209
if ((n + i) % 16 == 0) {
test/debug/mbufinfo.c
210
printf(" %04x ", n + i);
test/debug/mbufinfo.c
213
if ((n + i) % 16 == 15 || i + 1 == count) {
test/debug/ncptrace.c
101
int n;
test/debug/ncptrace.c
149
n = strlen(path);
test/debug/ncptrace.c
151
if (strncmp(path, av[i], n) == 0) {
test/debug/ncptrace.c
153
mntinfo.mnt_ncmountpt.ncp, av[i] + n);
test/mcast/mcast.c
111
n = sendto(s, &mreq, sizeof(mreq), 0,
test/mcast/mcast.c
113
if (n < 0) {
test/mcast/mcast.c
27
int s, opt, n, delay;
test/pcpu/ncache-stats.c
47
#define _NCH_ENT(t, n, tt) \
test/pcpu/ncache-stats.c
50
printf("%-9ld%s", nch[i-1].n, "\t"); \
test/pcpu/ncache-stats.c
52
printf("(%-9ld)\n", tt.n); \
test/socket/accept/block/accept_block.c
111
n = read(s, &dummy, sizeof(dummy));
test/socket/accept/block/accept_block.c
112
if (n < 0) {
test/socket/accept/block/accept_block.c
115
} else if (n != sizeof(dummy)) {
test/socket/accept/block/accept_block.c
57
int opt, port, dummy, n, status, panic, ex;
test/socket/accept/nonblock/accept_nblock.c
113
n = read(s, &dummy, sizeof(dummy));
test/socket/accept/nonblock/accept_nblock.c
114
if (n < 0) {
test/socket/accept/nonblock/accept_nblock.c
54
int opt, port, dummy, n, status, panic, ex;
test/socket/accept4/block/accept4_block.c
124
n = read(s, &dummy, sizeof(dummy));
test/socket/accept4/block/accept4_block.c
125
if (n < 0) {
test/socket/accept4/block/accept4_block.c
128
} else if (n != sizeof(dummy)) {
test/socket/accept4/block/accept4_block.c
63
int opt, port, dummy, n, status, panic, ex;
test/socket/accept4/nonblock/accept4_nblock.c
101
n = read(s, &dummy, sizeof(dummy));
test/socket/accept4/nonblock/accept4_nblock.c
102
if (n < 0) {
test/socket/accept4/nonblock/accept4_nblock.c
49
int opt, port, dummy, n, status, panic, ex;
test/socket/recvmsg/cloexec/recvmsg_cloexec.c
101
int n;
test/socket/recvmsg/cloexec/recvmsg_cloexec.c
121
if ((n=recvmsg(s, &msg, MSG_CMSG_CLOEXEC)) < 0)
test/socket/recvmsg/cloexec/recvmsg_cloexec.c
123
if (n == 0){
test/socket/recvmsg/cloexec/recvmsg_cloexec.c
74
int n;
test/socket/recvmsg/cloexec/recvmsg_cloexec.c
93
if ((n=sendmsg(s, &msg, 0)) != (int)iov.iov_len)
test/socket/socket/nonblock/socket_nblock.c
39
int s, n, error, port, opt;
test/socket/socket/nonblock/socket_nblock.c
77
n = read(s, &buf, 1);
test/socket/socket/nonblock/socket_nblock.c
78
if (n < 0) {
test/socket/socketpair/nonblock/sockpair_nblock.c
29
int s[2], n, error;
test/socket/socketpair/nonblock/sockpair_nblock.c
42
n = read(s[0], &buf, 1);
test/socket/socketpair/nonblock/sockpair_nblock.c
43
if (n < 0) {
test/socket/socketpair/nonblock/sockpair_nblock.c
54
n = read(s[1], &buf, 1);
test/socket/socketpair/nonblock/sockpair_nblock.c
55
if (n < 0) {
test/stress/fsx/fsx.c
373
unsigned n = 0;
test/stress/fsx/fsx.c
385
if (n == 0) {
test/stress/fsx/fsx.c
391
n++;
test/stress/fsx/fsx.c
398
if (n) {
test/stress/fsx/fsx.c
399
prt("\t0x%5x\n", n);
test/stress/stress2/lib/options.c
245
int i, n;
test/stress/stress2/lib/options.c
249
if ((n = readlink(path, buf, sizeof(buf) -1)) < 0) {
test/stress/stress2/lib/options.c
252
if ((n = readlink(path, buf, sizeof(buf) -1)) > 0)
test/stress/stress2/lib/options.c
255
if (n < 0)
test/stress/stress2/lib/options.c
258
buf[n] = '\0';
test/stress/stress2/testcases/mkfifo/mkfifo.c
50
int i, n, *buf;
test/stress/stress2/testcases/mkfifo/mkfifo.c
59
if ((n = read(fd, buf, bufsize)) < 0)
test/stress/stress2/testcases/mkfifo/mkfifo.c
61
if (n == 0) break;
test/stress/stress2/testcases/socket/socket.c
50
int n, t, *buf;
test/stress/stress2/testcases/socket/socket.c
56
if ((n = read(sv[0], buf, bufsize)) < 0)
test/stress/stress2/testcases/socket/socket.c
58
t += n;
test/stress/stress2/testcases/socket/socket.c
59
if (n == 0) break;
test/stress/stress2/testcases/tcp/tcp.c
53
int n, t, *buf;
test/stress/stress2/testcases/tcp/tcp.c
88
if ((n = read(msgsock, buf, bufsize)) < 0)
test/stress/stress2/testcases/tcp/tcp.c
90
t += n;
test/stress/stress2/testcases/tcp/tcp.c
91
if (n == 0) break;
test/stress/stress2/testcases/udp/udp.c
101
n = write(f, buf, bufsize);
test/stress/stress2/testcases/udp/udp.c
102
if (n == -1 && errno == ENOBUFS)
test/stress/stress2/testcases/udp/udp.c
104
if (n == -1 && errno == ECONNREFUSED)
test/stress/stress2/testcases/udp/udp.c
106
if (n == -1)
test/stress/stress2/testcases/udp/udp.c
108
if (n == 0) break;
test/stress/stress2/testcases/udp/udp.c
63
int f, i, n;
test/sysperf/exec1.c
52
int n;
test/sysperf/exec1.c
73
for (n = 0; n < ncpus; ++n) {
test/sysperf/lockmgr1.c
18
int n;
test/sysperf/lockmgr1.c
34
n = strtol(av[1], NULL, 0);
test/sysperf/lockmgr1.c
36
n = 1;
test/sysperf/lockmgr1.c
39
for (i = 0; i < n; ++i) {
test/sysperf/lockmgr1.c
50
stop_timing(max * n, "varsym1");
test/sysperf/lockmgr2.c
19
int n;
test/sysperf/lockmgr2.c
43
n = strtol(av[1], NULL, 0);
test/sysperf/lockmgr2.c
45
n = 1;
test/sysperf/lockmgr2.c
48
for (i = 0; i < n; ++i) {
test/sysperf/lockmgr2.c
63
stop_timing(max * n, "lockmgr2");
test/sysperf/lockmgr3.c
19
int n;
test/sysperf/lockmgr3.c
44
n = strtol(av[1], NULL, 0);
test/sysperf/lockmgr3.c
46
n = 1;
test/sysperf/lockmgr3.c
49
for (i = 0; i < n; ++i) {
test/sysperf/lockmgr3.c
65
stop_timing(max * n * 4, "lockmgr3");
test/sysperf/pipe2.c
67
int n;
test/sysperf/pipe2.c
74
n = read(fds[1], buf + i, bytes - i);
test/sysperf/pipe2.c
75
if (n <= 0)
test/sysperf/pipe2.c
77
if (n + i == bytes)
test/sysperf/pipe2.c
80
i += n;
test/sysperf/read1.c
58
int n = (bytes - i > sizeof(Buf)) ? sizeof(Buf) : bytes - i;
test/sysperf/read1.c
59
if (write(fd, Buf, n) != n) {
test/sysperf/socketpair.c
67
int n;
test/sysperf/socketpair.c
74
n = read(fds[1], buf + i, bytes - i);
test/sysperf/socketpair.c
75
if (n <= 0)
test/sysperf/socketpair.c
77
if (n + i == bytes)
test/sysperf/socketpair.c
80
i += n;
test/sysperf/syscall1.c
15
int n;
test/sysperf/syscall1.c
32
n = strtol(av[1], NULL, 0);
test/sysperf/syscall1.c
34
n = 1;
test/sysperf/syscall1.c
37
for (i = 0; i < n; ++i) {
test/sysperf/syscall1.c
48
stop_timing(count * n, "getuid()");
test/sysperf/umtx1.c
24
int n;
test/sysperf/umtx1.c
29
for (n = 1; n; --n) {
test/testcases/io/sendfd_1/sendfd_1.c
38
int n;
test/testcases/io/sendfd_1/sendfd_1.c
57
if((n=sendmsg(s, &msg, 0)) != iov.iov_len)
test/testcases/io/sendfd_1/sendfd_1.c
65
int n;
test/testcases/io/sendfd_1/sendfd_1.c
85
if((n=recvmsg(s, &msg, 0)) < 0)
test/testcases/io/sendfd_1/sendfd_1.c
87
if(n == 0){
test/testcases/libnvmm/h_io_assist.c
112
#define PATENTRY(n, type) (type << ((n) * 8))
test/testcases/libnvmm/h_mem_assist.c
264
#define PATENTRY(n, type) (type << ((n) * 8))
test/udp/bindconnfail/udp_bindconnfail.c
100
n = read(s2, buf, sizeof(buf));
test/udp/bindconnfail/udp_bindconnfail.c
101
if (n < 0)
test/udp/bindconnfail/udp_bindconnfail.c
103
printf("read %d, done\n", n);
test/udp/bindconnfail/udp_bindconnfail.c
25
int s1, s2, opt, n, on = 1;
test/udp/bindconnfail/udp_bindconnfail.c
93
n = sendto(s2, buf, sizeof(buf), 0,
test/udp/bindconnfail/udp_bindconnfail.c
95
if (n < 0)
test/udp/bindconnfail/udp_bindconnfail.c
97
else if (n != (int)sizeof(buf))
test/udp/bindconnfail/udp_bindconnfail.c
98
errx(2, "sent truncated data %d", n);
test/udp/bindconnsend/udp_bindconnsend.c
25
int s, opt, n, reuseport;
test/udp/bindconnsend/udp_bindconnsend.c
87
n = write(s, buf, sizeof(buf));
test/udp/bindconnsend/udp_bindconnsend.c
88
if (n < 0)
test/udp/bindconnsend/udp_bindconnsend.c
90
else if (n != (int)sizeof(buf))
test/udp/bindconnsend/udp_bindconnsend.c
91
errx(2, "written truncated data %d", n);
test/udp/bindconnsend/udp_bindconnsend.c
93
n = read(s, buf, sizeof(buf));
test/udp/bindconnsend/udp_bindconnsend.c
94
if (n < 0)
test/udp/bindconnsend/udp_bindconnsend.c
96
printf("read %d, done\n", n);
test/udp/bindsend/udp_bindsend.c
25
int s, opt, n, reuseport;
test/udp/bindsend/udp_bindsend.c
84
n = sendto(s, buf, sizeof(buf), 0,
test/udp/bindsend/udp_bindsend.c
86
if (n < 0)
test/udp/bindsend/udp_bindsend.c
88
else if (n != (int)sizeof(buf))
test/udp/bindsend/udp_bindsend.c
89
errx(2, "sent truncated data %d", n);
test/udp/bindsend/udp_bindsend.c
91
n = read(s, buf, sizeof(buf));
test/udp/bindsend/udp_bindsend.c
92
if (n < 0)
test/udp/bindsend/udp_bindsend.c
94
printf("read %d, done\n", n);
test/udp/conn2send/udp_conn2send.c
26
int s, opt, n, reuseport;
test/udp/conn2send/udp_conn2send.c
80
n = sendto(s, buf, sizeof(buf), 0,
test/udp/conn2send/udp_conn2send.c
82
if (n < 0)
test/udp/conn2send/udp_conn2send.c
84
else if (n != (int)sizeof(buf))
test/udp/conn2send/udp_conn2send.c
85
errx(2, "sent truncated data %d", n);
test/udp/conn2send/udp_conn2send.c
87
n = read(s, buf, sizeof(buf));
test/udp/conn2send/udp_conn2send.c
88
if (n < 0)
test/udp/conn2send/udp_conn2send.c
90
printf("read %d, done\n", n);
test/udp/connsend/udp_connsend.c
25
int s, opt, n;
test/udp/connsend/udp_connsend.c
58
n = write(s, buf, sizeof(buf));
test/udp/connsend/udp_connsend.c
59
if (n < 0)
test/udp/connsend/udp_connsend.c
61
else if (n != (int)sizeof(buf))
test/udp/connsend/udp_connsend.c
62
errx(2, "written truncated data %d", n);
test/udp/connsend/udp_connsend.c
64
n = read(s, buf, sizeof(buf));
test/udp/connsend/udp_connsend.c
65
if (n < 0)
test/udp/connsend/udp_connsend.c
67
printf("read %d, done\n", n);
test/udp/disconnsend/udp_disconnsend.c
25
int s, opt, n;
test/udp/disconnsend/udp_disconnsend.c
62
n = sendto(s, buf, sizeof(buf), 0,
test/udp/disconnsend/udp_disconnsend.c
64
if (n < 0)
test/udp/disconnsend/udp_disconnsend.c
66
else if (n != (int)sizeof(buf))
test/udp/disconnsend/udp_disconnsend.c
67
errx(2, "sendto truncated data %d", n);
test/udp/disconnsend/udp_disconnsend.c
69
n = read(s, buf, sizeof(buf));
test/udp/disconnsend/udp_disconnsend.c
70
if (n < 0)
test/udp/disconnsend/udp_disconnsend.c
72
printf("read %d, done\n", n);
test/udp/mcastbind/mcastbind.c
122
n = read(s1, buf, sizeof(buf));
test/udp/mcastbind/mcastbind.c
123
if (n < 0)
test/udp/mcastbind/mcastbind.c
125
fprintf(stderr, "read 1 got %d\n", n);
test/udp/mcastbind/mcastbind.c
127
n = read(s2, buf, sizeof(buf));
test/udp/mcastbind/mcastbind.c
128
if (n < 0)
test/udp/mcastbind/mcastbind.c
130
fprintf(stderr, "read 2 got %d\n", n);
test/udp/mcastbind/mcastbind.c
75
int s1, s2, opt, n, bind_any, iface_idx;
test/udp/mcastconn/mcastconn.c
111
n = read(s1, buf, sizeof(buf));
test/udp/mcastconn/mcastconn.c
112
if (n < 0)
test/udp/mcastconn/mcastconn.c
114
fprintf(stderr, "read 1 got %d\n", n);
test/udp/mcastconn/mcastconn.c
116
n = read(s2, buf, sizeof(buf));
test/udp/mcastconn/mcastconn.c
117
if (n < 0)
test/udp/mcastconn/mcastconn.c
119
fprintf(stderr, "read 2 got %d\n", n);
test/udp/mcastconn/mcastconn.c
54
int s1, s2, opt, n;
test/udp/mcastsend/mcastsend.c
128
n = sendto(s, buf, sizeof(buf), 0,
test/udp/mcastsend/mcastsend.c
130
if (n < 0)
test/udp/mcastsend/mcastsend.c
132
else if (n < (int)sizeof(buf))
test/udp/mcastsend/mcastsend.c
133
errx(2, "sent truncated data %d", n);
test/udp/mcastsend/mcastsend.c
28
int s, opt, n, loop = 0, use_mreq = 0, iface_idx;
test/udp/sendsrcaddr/udp_sendsrcaddr.c
153
n = test_sendsrcaddr(s, NULL, &src);
test/udp/sendsrcaddr/udp_sendsrcaddr.c
155
if (n < 0)
test/udp/sendsrcaddr/udp_sendsrcaddr.c
158
if (n > 0)
test/udp/sendsrcaddr/udp_sendsrcaddr.c
184
n = test_sendsrcaddr(s, NULL, &src);
test/udp/sendsrcaddr/udp_sendsrcaddr.c
186
if (n < 0)
test/udp/sendsrcaddr/udp_sendsrcaddr.c
189
if (n > 0)
test/udp/sendsrcaddr/udp_sendsrcaddr.c
25
int n;
test/udp/sendsrcaddr/udp_sendsrcaddr.c
27
iov.iov_base = &n;
test/udp/sendsrcaddr/udp_sendsrcaddr.c
28
iov.iov_len = sizeof(n);
test/udp/sendsrcaddr/udp_sendsrcaddr.c
64
int s, opt, s2, on, n;
test/udp/sendwildcard/udp_sendwildcard.c
25
int s, opt, n, reuseport;
test/udp/sendwildcard/udp_sendwildcard.c
67
n = sendto(s, buf, sizeof(buf), 0,
test/udp/sendwildcard/udp_sendwildcard.c
69
if (n < 0)
test/udp/sendwildcard/udp_sendwildcard.c
71
else if (n != (int)sizeof(buf))
test/udp/sendwildcard/udp_sendwildcard.c
72
errx(2, "sent truncated data %d", n);
test/udp/sendwildcard/udp_sendwildcard.c
74
n = read(s, buf, sizeof(buf));
test/udp/sendwildcard/udp_sendwildcard.c
75
if (n < 0)
test/udp/sendwildcard/udp_sendwildcard.c
77
printf("read %d, done\n", n);
test/udp/tos/udp_tos.c
122
n = recvmsg(s, &msg, MSG_WAITALL);
test/udp/tos/udp_tos.c
123
if (n < 0)
test/udp/tos/udp_tos.c
125
else if (n != sizeof(buf))
test/udp/tos/udp_tos.c
126
errx(1, "recvmsg received %d", n);
test/udp/tos/udp_tos.c
25
int s, opt, n, tos, cmsg_tos;
test/unix/loopdesc/loopdesc.c
21
int n, buf;
test/unix/loopdesc/loopdesc.c
39
n = sendmsg(to_s, &msg, 0);
test/unix/loopdesc/loopdesc.c
40
if (n < 0)
test/unix/loopdesc/loopdesc.c
42
else if (n != sizeof(buf))
test/unix/loopdesc/loopdesc.c
43
errx(1, "sendmsg sent %d", n);
test/unix/passdesc/passdesc.c
113
int s[2], fd, status, n, discard, skipfd;
test/unix/passdesc/passdesc.c
155
n = read(s[1], &buf, sizeof(buf));
test/unix/passdesc/passdesc.c
156
if (n < 0)
test/unix/passdesc/passdesc.c
171
n = write(fd, TEST_FILENAME, strlen(TEST_FILENAME));
test/unix/passdesc/passdesc.c
172
if (n < 0)
test/unix/passdesc/passdesc.c
174
else if (n != strlen(TEST_FILENAME))
test/unix/passdesc/passdesc.c
175
errx(1, "write %d", n);
test/unix/passdesc/passdesc.c
29
int n;
test/unix/passdesc/passdesc.c
47
n = sendmsg(s, &msg, 0);
test/unix/passdesc/passdesc.c
48
if (n < 0)
test/unix/passdesc/passdesc.c
50
else if (n != test_buflen)
test/unix/passdesc/passdesc.c
51
errx(1, "sendmsg sent %d", n);
test/unix/passdesc/passdesc.c
65
int n, fd;
test/unix/passdesc/passdesc.c
77
n = recvmsg(s, &msg, MSG_WAITALL);
test/unix/passdesc/passdesc.c
78
if (n < 0)
test/unix/passdesc/passdesc.c
80
else if (n != test_buflen)
test/unix/passdesc/passdesc.c
81
errx(1, "recvmsg received %d", n);
test/unix/passdesc/passdesc.c
95
n = read(fd, data, sizeof(data) - 1);
test/unix/passdesc/passdesc.c
96
if (n < 0)
test/unix/passdesc/passdesc.c
98
data[n] = '\0';
test/unix/unconn_dgram/unconn_dgram.c
18
int s, n;
test/unix/unconn_dgram/unconn_dgram.c
28
n = sendto(s, UNCONN_DGRAM_PATH, sizeof(UNCONN_DGRAM_PATH), 0,
test/unix/unconn_dgram/unconn_dgram.c
30
if (n < 0)
test/unix/unconn_dgram/unconn_dgram.c
32
else if (n != sizeof(UNCONN_DGRAM_PATH))
test/unix/unconn_dgram/unconn_dgram.c
42
int s, n, status;
test/unix/unconn_dgram/unconn_dgram.c
70
n = read(s, buf, sizeof(buf));
test/unix/unconn_dgram/unconn_dgram.c
71
if (n < 0) {
test/unix/unconn_dgram/unconn_dgram.c
73
} else if (n != sizeof(UNCONN_DGRAM_PATH)) {
tools/regression/include/tgmath/tgmath.c
149
float (scalbnf)(float x, int n) { n_float++; }
tools/regression/include/tgmath/tgmath.c
150
double (scalbn)(double x, int n) { n_double++; }
tools/regression/include/tgmath/tgmath.c
151
long double (scalbnl)(long double x, int n) { n_long_double++; }
tools/regression/include/tgmath/tgmath.c
152
float (scalblnf)(float x, long n) { n_float++; }
tools/regression/include/tgmath/tgmath.c
153
double (scalbln)(double x, long n) { n_double++; }
tools/regression/include/tgmath/tgmath.c
154
long double (scalblnl)(long double x, long n) { n_long_double++; }
tools/regression/lib/libc-regex/testregex.c
1073
#define TABS(n) &ts[7-((n)&7)]
tools/regression/lib/libc-regex/testregex.c
1168
int n = 0;
tools/regression/lib/libc-regex/testregex.c
1179
n++;
tools/regression/lib/libc-regex/testregex.c
1182
n--;
tools/regression/lib/libc-regex/testregex.c
1185
if (n == 1 && !memcmp(s, "E_DUP_MAX", 9))
tools/regression/lib/libc-regex/testregex.c
887
int n;
tools/regression/lib/libc-regex/testregex.c
933
n = -1;
tools/regression/lib/libc-regex/testregex.c
938
n = RE_DUP_MAX;
tools/regression/lib/libc-regex/testregex.c
941
n += strtol(p, &p, 10);
tools/regression/lib/libc-regex/testregex.c
944
n = strtol(p, &p, 10);
tools/regression/lib/libc-regex/testregex.c
947
if (m!=match[i].rm_so || n!=match[i].rm_eo)
tools/regression/p1003_1b/yield.c
52
static void buzz(int n)
tools/regression/p1003_1b/yield.c
68
int nslaves, n;
tools/regression/p1003_1b/yield.c
83
n = nslaves = 10;
tools/regression/p1003_1b/yield.c
90
n = nslaves = atoi(argv[1]);
tools/tools/ath/athdecode/main.c
407
int tmp, n;
tools/tools/ath/athdecode/main.c
410
n = *p++;
tools/tools/ath/athdecode/main.c
411
if (r->val & (1 << (n - 1))) {
tools/tools/ath/athdecode/main.c
413
for (; (n = *p) > ' '; ++p)
tools/tools/ath/athdecode/main.c
414
putc(n, fd);
tools/tools/ath/athpow/athpow.c
139
printPcdacTable(FILE *fd, u_int16_t pcdac[], u_int n)
tools/tools/ath/athpow/athpow.c
141
int i, halfRates = n/2;
tools/tools/ath/athpow/athpow.c
150
printPowerPerRate(FILE *fd, u_int16_t ratesArray[], u_int n)
tools/tools/ath/athpow/athpow.c
158
int i, halfRates = n/2;
tools/tools/ath/athpow/athpow.c
62
static void printPcdacTable(FILE *fd, u_int16_t pcdac[], u_int n);
tools/tools/ath/athpow/athpow.c
63
static void printPowerPerRate(FILE *fd, u_int16_t ratesArray[], u_int n);
tools/tools/ath/athprom/athprom.c
490
#define strneq(a,b,n) (strncasecmp(a,b,n) == 0)
tools/tools/ath/athrd/athrd.c
807
int n = 1;
tools/tools/ath/athrd/athrd.c
932
if ((n++ % (showchannels ? 7 : 6)) == 0)
tools/tools/ath/athregs/dumpregs.c
613
u_int n = 2 * sizeof(u_int32_t); /* reg range + first */
tools/tools/ath/athregs/dumpregs.c
621
n += regs[i].end - regs[i].start;
tools/tools/ath/athregs/dumpregs.c
623
space += n;
tools/tools/bus_autoconf/bus_usb.c
253
uint32_t n = 1;
tools/tools/bus_autoconf/bus_usb.c
262
return (n);
tools/tools/bus_autoconf/bus_usb.c
274
while (n < nid) {
tools/tools/bus_autoconf/bus_usb.c
275
if (id[n].is_any != 1 || id[n].is_vp != 1)
tools/tools/bus_autoconf/bus_usb.c
277
if (id[n].idVendor != id[0].idVendor)
tools/tools/bus_autoconf/bus_usb.c
279
if (strcmp(id[n].module_name, id[0].module_name))
tools/tools/bus_autoconf/bus_usb.c
281
if (strcmp(id[n].module_mode, id[0].module_mode))
tools/tools/bus_autoconf/bus_usb.c
283
n++;
tools/tools/bus_autoconf/bus_usb.c
286
if (n == 1) {
tools/tools/bus_autoconf/bus_usb.c
292
for (x = 0; x != n; x++) {
tools/tools/bus_autoconf/bus_usb.c
294
(x == (n - 1)) ? "" : "|");
tools/tools/bus_autoconf/bus_usb.c
323
return (n);
tools/tools/drm/radeon/mkregtable/mkregtable.c
390
#define list_for_each_safe(pos, n, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
391
for (pos = (head)->next, n = pos->next; pos != (head); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
392
pos = n, n = pos->next)
tools/tools/drm/radeon/mkregtable/mkregtable.c
400
#define list_for_each_prev_safe(pos, n, head) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
401
for (pos = (head)->prev, n = pos->prev; \
tools/tools/drm/radeon/mkregtable/mkregtable.c
403
pos = n, n = pos->prev)
tools/tools/drm/radeon/mkregtable/mkregtable.c
485
#define list_for_each_entry_safe(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
487
n = list_entry(pos->member.next, typeof(*pos), member); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
489
pos = n, n = list_entry(n->member.next, typeof(*n), member))
tools/tools/drm/radeon/mkregtable/mkregtable.c
501
#define list_for_each_entry_safe_continue(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
503
n = list_entry(pos->member.next, typeof(*pos), member); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
505
pos = n, n = list_entry(n->member.next, typeof(*n), member))
tools/tools/drm/radeon/mkregtable/mkregtable.c
517
#define list_for_each_entry_safe_from(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
518
for (n = list_entry(pos->member.next, typeof(*pos), member); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
520
pos = n, n = list_entry(n->member.next, typeof(*n), member))
tools/tools/drm/radeon/mkregtable/mkregtable.c
532
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
tools/tools/drm/radeon/mkregtable/mkregtable.c
534
n = list_entry(pos->member.prev, typeof(*pos), member); \
tools/tools/drm/radeon/mkregtable/mkregtable.c
536
pos = n, n = list_entry(n->member.prev, typeof(*n), member))
tools/tools/drm/radeon/mkregtable/mkregtable.c
578
unsigned nlloop, i, j, n, c, id;
tools/tools/drm/radeon/mkregtable/mkregtable.c
585
n = 4;
tools/tools/drm/radeon/mkregtable/mkregtable.c
586
if (n > c)
tools/tools/drm/radeon/mkregtable/mkregtable.c
587
n = c;
tools/tools/drm/radeon/mkregtable/mkregtable.c
588
c -= n;
tools/tools/drm/radeon/mkregtable/mkregtable.c
589
for (j = 0; j < n; j++) {
tools/tools/net80211/w00t/libw00t/w00t.c
188
#define BIT(n) (1<<(n))
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
141
memcpy(state->s, &rc4initial, n);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
143
for (i = 0; i < n; i++) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
144
j = (j + state->s[i] + key[i % keylen]) % n;
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
188
uint8_t state[n];
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
195
memcpy(state, rc4initial, n);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
241
static void getdrv(PTW_tableentry orgtable[][n], int keylen, double * normal, double * ausreiser) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
250
for (i = 0; i < n; i++) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
253
e = numvotes/n;
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
261
for (j = 0; j < n; j++) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
267
for (j = 0; j < n; j++) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
285
static int doRound(PTW_tableentry sortedtable[][n], int keybyte, int fixat, uint8_t fixvalue, int * searchborders, uint8_t * key, int keylen, PTW_attackstate * state, uint8_t sum, int * strongbytes) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
319
static int doComputation(PTW_attackstate * state, uint8_t * key, int keylen, PTW_tableentry table[][n], sorthelper * sh2, int * strongbytes, int keylimit) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
375
PTW_tableentry (*table)[n] = alloca(sizeof(PTW_tableentry) * n * keylen);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
380
memcpy(table, state->table, sizeof(PTW_tableentry) * n * keylen);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
384
qsort(&table[i][0], n, sizeof(PTW_tableentry), &compare);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
388
sorthelper (* sh)[n-1] = alloca(sizeof(sorthelper) * (n-1) * keylen);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
396
for (j = 1; j < n; j++) {
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
402
qsort(sh, (n-1)*keylen, sizeof(sorthelper), &comparesorthelper);
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
47
uint8_t s[n];
tools/tools/net80211/wesside/wesside/aircrack-ptw-lib.c
475
for (k = 0; k < n; k++) {
tools/tools/net80211/wesside/wesside/wesside.c
2304
#define BIT(n) (1<<(n))
tools/tools/net80211/wesside/wesside/wesside.c
668
unsigned short* n;
tools/tools/net80211/wesside/wesside/wesside.c
674
n = (unsigned short*) ((unsigned char*) wh + sizeof(*wh));
tools/tools/net80211/wesside/wesside/wesside.c
675
n++;
tools/tools/net80211/wesside/wesside/wesside.c
676
*n = 1;
tools/tools/net80211/wlaninject/wlaninject.c
469
#define BIT(n) (1<<(n))
tools/tools/net80211/wlantxtime/wlantxtime.c
325
#define HT_LTF(n) ((n) * 4)
tools/tools/net80211/wlanwatch/wlanwatch.c
139
static int first = 1, n;
tools/tools/net80211/wlanwatch/wlanwatch.c
224
if ((n = snprintf(cp, cpe - cp, " %x", *s)) > 0)
tools/tools/net80211/wlanwatch/wlanwatch.c
225
cp += n;
tools/tools/net80211/wlanwatch/wlanwatch.c
78
int n, s;
tools/tools/net80211/wlanwatch/wlanwatch.c
85
n = read(s, msg, 2048);
tools/tools/net80211/wlanwatch/wlanwatch.c
86
print_rtmsg((struct rt_msghdr *)msg, n);
tools/tools/net80211/wlanwds/wlanwds.c
162
ssize_t n = read(s, msg, sizeof(msg));
tools/tools/net80211/wlanwds/wlanwds.c
163
handle_rtmsg((struct rt_msghdr *)msg, n);
tools/tools/netrate/accept_connect/kq_connect_client/kq_connect_client.c
223
int n, i, done = 0;
tools/tools/netrate/accept_connect/kq_connect_client/kq_connect_client.c
248
n = connect(s, (const struct sockaddr *)tmp,
tools/tools/netrate/accept_connect/kq_connect_client/kq_connect_client.c
250
if (n == 0) {
tools/tools/netrate/accept_connect/kq_connect_client/kq_connect_client.c
275
n = kevent(kq, evt_change, nchange, evt, nevt_max, NULL);
tools/tools/netrate/accept_connect/kq_connect_client/kq_connect_client.c
276
if (n < 0)
tools/tools/netrate/accept_connect/kq_connect_client/kq_connect_client.c
280
for (i = 0; i < n; ++i) {
tools/tools/netrate/kq_sendrecv/kq_recvserv/kq_recvserv.c
328
int n;
tools/tools/netrate/kq_sendrecv/kq_recvserv/kq_recvserv.c
340
n = write(s1, &ack, sizeof(ack));
tools/tools/netrate/kq_sendrecv/kq_recvserv/kq_recvserv.c
341
if (n != sizeof(ack)) {
tools/tools/netrate/kq_sendrecv/kq_recvserv/kq_recvserv.c
351
n = read(evt[i].ident, buf, recv_buflen);
tools/tools/netrate/kq_sendrecv/kq_recvserv/kq_recvserv.c
352
if (n <= 0) {
tools/tools/netrate/kq_sendrecv/kq_recvserv/kq_recvserv.c
353
if (n == 0 || errno != EAGAIN)
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
530
int s, n, ports_sz, d;
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
544
n = read(s, &info_hdr, sizeof(info_hdr));
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
545
if (n != sizeof(info_hdr)) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
546
if (n < 0) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
566
n = read(s, ports, ports_sz);
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
567
if (n != ports_sz) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
568
if (n < 0) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
619
int nconn = 0, kq, n, fd = -1, buflen;
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
704
n = read(conn->c_s, &ack, sizeof(ack));
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
705
if (n != sizeof(ack)) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
706
if (n < 0) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
722
n = kevent(kq, &chg_evt, 1, NULL, 0, NULL);
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
723
if (n < 0)
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
765
n = kevent(kq, &chg_evt, 1, NULL, 0, NULL);
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
766
if (n < 0)
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
796
n = sendfile(fd, conn->c_s, off, len, NULL,
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
798
if (n == 0 || (n < 0 && errno == EAGAIN))
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
799
n = m;
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
801
n = write(conn->c_s, buf, buflen);
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
804
if (n < 0) {
tools/tools/netrate/kq_sendrecv/kq_sendcli/kq_sendcli.c
813
conn->c_stat += n;
tools/tools/netrate/netperf/tcp_cc/tcp_cc.c
131
int n, arg1, arg2, arg3, arg4;
tools/tools/netrate/netperf/tcp_cc/tcp_cc.c
134
n = sscanf(line, "%d%d%d%d%lf%lf",
tools/tools/netrate/netperf/tcp_cc/tcp_cc.c
136
if (n == 6) {
tools/tools/netrate/netperf/tcp_stream/tcp_stream.c
259
int n, arg1, arg2, arg3;
tools/tools/netrate/netperf/tcp_stream/tcp_stream.c
262
n = sscanf(line, "%d%d%d%lf%lf",
tools/tools/netrate/netperf/tcp_stream/tcp_stream.c
264
if (n == 5) {
tools/tools/netrate/pktgenctl/pktgenctl.c
101
int fd, c, n, ndst_alloc;
tools/tools/netrate/pktgenctl/pktgenctl.c
146
n = inet_pton(AF_INET, optarg, &dst_sin->sin_addr);
tools/tools/netrate/pktgenctl/pktgenctl.c
147
if (n == 0)
tools/tools/netrate/pktgenctl/pktgenctl.c
149
else if (n < 0)
tools/tools/netrate/pktgenctl/pktgenctl.c
157
n = inet_pton(AF_INET, optarg, &src_sin->sin_addr);
tools/tools/netrate/pktgenctl/pktgenctl.c
158
if (n == 0)
tools/tools/netrate/pktgenctl/pktgenctl.c
160
else if (n < 0)
tools/tools/netrate/udpecho/udpecho.c
149
int n;
tools/tools/netrate/udpecho/udpecho.c
152
n = recvfrom(s, buf, BUFLEN, 0,
tools/tools/netrate/udpecho/udpecho.c
154
if (n > 0 && (flags & FLAG_NOREPLY) == 0) {
tools/tools/netrate/udpecho/udpecho.c
155
sendto(s, buf, n, 0,
tools/tools/usbtest/usb_control_ep_test.c
615
int n;
tools/tools/usbtest/usb_control_ep_test.c
636
for (n = 0; n != config->num_interface; n++) {
tools/tools/usbtest/usb_control_ep_test.c
638
libusb20_dev_detach_kernel_driver(pdev, n);
tools/tools/usbtest/usb_control_ep_test.c
645
for (m = 0; m != config->interface[n].num_altsetting; m++) {
tools/tools/usbtest/usb_control_ep_test.c
649
if (libusb20_dev_set_alt_index(pdev, n, m + 1)) {
tools/tools/usbtest/usb_control_ep_test.c
650
printf("ERROR on interface %d alt %d\n", n, m + 1);
tools/tools/usbtest/usb_control_ep_test.c
659
if (libusb20_dev_set_alt_index(pdev, n, 0)) {
tools/tools/usbtest/usb_control_ep_test.c
660
printf("ERROR on interface %d alt %d\n", n, 0);
tools/tools/usbtest/usb_modem_test.c
150
uint32_t n;
tools/tools/usbtest/usb_modem_test.c
152
for (n = 0; n != len; n++) {
tools/tools/usbtest/usb_modem_test.c
153
modem_out_state(buf + n);
tools/tools/usbtest/usb_modem_test.c
162
uint32_t n;
tools/tools/usbtest/usb_modem_test.c
164
for (n = 0; n != len; n++) {
tools/tools/usbtest/usb_modem_test.c
165
modem_in_state(buf[n], n);
usr.bin/apply/apply.c
100
n = p[0] - '0';
usr.bin/apply/apply.c
131
if (n == 0) {
usr.bin/apply/apply.c
160
nargs = n;
usr.bin/apply/apply.c
57
int ch, debug, i, magic, n, nargs, offset, rval;
usr.bin/apply/apply.c
96
for (n = 0, p = argv[0]; *p != '\0'; ++p)
usr.bin/apply/apply.c
99
if (p[0] - '0' > n)
usr.bin/basename/basename.c
108
size_t n;
usr.bin/basename/basename.c
114
for (r = p; r < q; r += n) {
usr.bin/basename/basename.c
115
n = mbrlen(r, MB_LEN_MAX, &mbs);
usr.bin/basename/basename.c
116
if (n == (size_t)-1 || n == (size_t)-2) {
usr.bin/basename/basename.c
118
n = 1;
usr.bin/bc/bc.y
306
ssize_t n;
usr.bin/bc/bc.y
309
n = node($10, cs("M"), $8, cs("s."),
usr.bin/bc/bc.y
312
n = node($10, $8, cs("s."), $6, $3,
usr.bin/bc/bc.y
315
emit_macro($3, n);
usr.bin/bc/bc.y
336
ssize_t n;
usr.bin/bc/bc.y
339
n = node($6, cs("M"), $4, $3, END_NODE);
usr.bin/bc/bc.y
341
n = node($6, $4, $3, END_NODE);
usr.bin/bc/bc.y
342
emit_macro($3, n);
usr.bin/bc/bc.y
385
int n = node(prologue, $8, epilogue,
usr.bin/bc/bc.y
388
emit_macro($1, n);
usr.bin/bc/bc.y
657
ssize_t n = node(cs("R"), $5, END_NODE);
usr.bin/bc/bc.y
658
emit_macro($3, n);
usr.bin/bc/bc.y
663
ssize_t n = node(cs("R"), $5, END_NODE);
usr.bin/bc/bc.y
664
emit_macro($3, n);
usr.bin/bc/bc.y
927
add_par(ssize_t n)
usr.bin/bc/bc.y
929
prologue = node(cs("S"), n, prologue, END_NODE);
usr.bin/bc/bc.y
930
epilogue = node(epilogue, cs("L"), n, cs("s."), END_NODE);
usr.bin/bc/bc.y
934
add_local(ssize_t n)
usr.bin/bc/bc.y
936
prologue = node(cs("0S"), n, prologue, END_NODE);
usr.bin/bc/bc.y
937
epilogue = node(epilogue, cs("L"), n, cs("s."), END_NODE);
usr.bin/bc/bc.y
944
int n;
usr.bin/bc/bc.y
947
n = asprintf(&str, "%s: %s:%d: %s: unexpected EOF",
usr.bin/bc/bc.y
950
n = asprintf(&str,
usr.bin/bc/bc.y
954
n = asprintf(&str,
usr.bin/bc/bc.y
958
n = asprintf(&str, "%s: %s:%d: %s: %s unexpected",
usr.bin/bc/bc.y
960
if (n == -1)
usr.bin/bdes/bdes.c
101
#define READ(buf, n) fread(buf, sizeof(char), n, stdin)
usr.bin/bdes/bdes.c
102
#define WRITE(buf,n) \
usr.bin/bdes/bdes.c
103
if (fwrite(buf, sizeof(char), n, stdout) != n) \
usr.bin/bdes/bdes.c
104
warnx("fwrite error at %d", n);
usr.bin/bdes/bdes.c
414
int n = 0; /* the integer collected */
usr.bin/bdes/bdes.c
426
n = n * 10 + *p - '0';
usr.bin/bdes/bdes.c
434
return((n % mult != 0) ? -1 : n);
usr.bin/bdes/bdes.c
483
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
487
for (bn = 0; (n = READ(msgbuf, 8)) == 8; bn++) {
usr.bin/bdes/bdes.c
499
MEMZERO(&msgbuf[n], 8 - n);
usr.bin/bdes/bdes.c
500
msgbuf[7] = n;
usr.bin/bdes/bdes.c
512
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
517
for (bn = 1; (n = READ(msgbuf, 8)) == 8; bn++) {
usr.bin/bdes/bdes.c
526
n = msgbuf[7];
usr.bin/bdes/bdes.c
527
if (n < 0 || n > 7)
usr.bin/bdes/bdes.c
533
WRITE(msgbuf, n);
usr.bin/bdes/bdes.c
535
if (n > 0)
usr.bin/bdes/bdes.c
545
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
552
for (bn = 1; (n = READ(msgbuf, 8)) == 8; bn++) {
usr.bin/bdes/bdes.c
553
for (n = 0; n < 8; n++)
usr.bin/bdes/bdes.c
554
msgbuf[n] ^= ivec[n];
usr.bin/bdes/bdes.c
564
MEMZERO(&msgbuf[n], 8 - n);
usr.bin/bdes/bdes.c
565
msgbuf[7] = n;
usr.bin/bdes/bdes.c
566
for (n = 0; n < 8; n++)
usr.bin/bdes/bdes.c
567
msgbuf[n] ^= ivec[n];
usr.bin/bdes/bdes.c
579
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
585
for (bn = 0; (n = READ(msgbuf, 8)) == 8; bn++) {
usr.bin/bdes/bdes.c
598
n = msgbuf[7];
usr.bin/bdes/bdes.c
599
if (n < 0 || n > 7)
usr.bin/bdes/bdes.c
605
WRITE(msgbuf, n);
usr.bin/bdes/bdes.c
607
if (n > 0)
usr.bin/bdes/bdes.c
617
int n, j; /* number of bytes actually read */
usr.bin/bdes/bdes.c
626
while ((n = READ(msgbuf, 8)) == 8) {
usr.bin/bdes/bdes.c
627
for (n = 0; n < 8; n++)
usr.bin/bdes/bdes.c
628
encbuf[n] = msgbuf[n] ^ ivec[n];
usr.bin/bdes/bdes.c
635
if (n > 0) {
usr.bin/bdes/bdes.c
636
MEMZERO(&msgbuf[n], 8 - n);
usr.bin/bdes/bdes.c
637
for (n = 0; n < 8; n++)
usr.bin/bdes/bdes.c
638
encbuf[n] = msgbuf[n] ^ ivec[n];
usr.bin/bdes/bdes.c
646
for (n = 0; macbits > 7; n++, macbits -= 8)
usr.bin/bdes/bdes.c
647
(void)putchar(encbuf[n]);
usr.bin/bdes/bdes.c
651
msgbuf[0] |= encbuf[n] & bits[j];
usr.bin/bdes/bdes.c
662
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
675
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
usr.bin/bdes/bdes.c
678
for (n = 0; n < 8 - nbytes; n++)
usr.bin/bdes/bdes.c
679
ivec[n] = ivec[n+nbytes];
usr.bin/bdes/bdes.c
680
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
681
ivec[8 - nbytes + n] = ibuf[n] ^ msgbuf[n];
usr.bin/bdes/bdes.c
689
MEMZERO(&ibuf[n], nbytes - n);
usr.bin/bdes/bdes.c
690
ibuf[nbytes - 1] = n;
usr.bin/bdes/bdes.c
693
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
694
ibuf[n] ^= msgbuf[n];
usr.bin/bdes/bdes.c
704
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
719
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
usr.bin/bdes/bdes.c
732
n = obuf[nbytes-1];
usr.bin/bdes/bdes.c
733
if (n < 0 || n > nbytes-1)
usr.bin/bdes/bdes.c
739
WRITE(obuf, n);
usr.bin/bdes/bdes.c
741
if (n > 0)
usr.bin/bdes/bdes.c
751
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
765
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
usr.bin/bdes/bdes.c
768
for (n = 0; n < 8 - nbytes; n++)
usr.bin/bdes/bdes.c
769
ivec[n] = ivec[n + nbytes];
usr.bin/bdes/bdes.c
770
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
771
ivec[8 - nbytes + n] = (ibuf[n] ^ msgbuf[n]) | 0x80;
usr.bin/bdes/bdes.c
772
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
773
obuf[n] = ivec[8 - nbytes + n] & 0x7f;
usr.bin/bdes/bdes.c
781
MEMZERO(&ibuf[n], nbytes - n);
usr.bin/bdes/bdes.c
782
ibuf[nbytes - 1] = ('0' + n)|0200;
usr.bin/bdes/bdes.c
785
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
786
ibuf[n] ^= msgbuf[n];
usr.bin/bdes/bdes.c
796
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
811
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
usr.bin/bdes/bdes.c
824
if ((n = (obuf[nbytes-1] - '0')) < 0
usr.bin/bdes/bdes.c
825
|| n > nbytes-1)
usr.bin/bdes/bdes.c
831
WRITE(obuf, n);
usr.bin/bdes/bdes.c
833
if (n > 0)
usr.bin/bdes/bdes.c
844
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
859
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
usr.bin/bdes/bdes.c
862
for (n = 0; n < 8 - nbytes; n++)
usr.bin/bdes/bdes.c
863
ivec[n] = ivec[n + nbytes];
usr.bin/bdes/bdes.c
864
for (n = 0; n < nbytes; n++) {
usr.bin/bdes/bdes.c
865
ivec[8 - nbytes + n] = msgbuf[n];
usr.bin/bdes/bdes.c
866
obuf[n] = ibuf[n] ^ msgbuf[n];
usr.bin/bdes/bdes.c
875
MEMZERO(&ibuf[n], nbytes - n);
usr.bin/bdes/bdes.c
876
ibuf[nbytes - 1] = n;
usr.bin/bdes/bdes.c
890
int n; /* number of bytes actually read */
usr.bin/bdes/bdes.c
905
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
usr.bin/bdes/bdes.c
918
n = obuf[nbytes-1];
usr.bin/bdes/bdes.c
919
if (n < 0 || n > nbytes-1)
usr.bin/bdes/bdes.c
928
WRITE(obuf, n);
usr.bin/bdes/bdes.c
930
if (n > 0)
usr.bin/bdes/bdes.c
940
int n, j; /* number of bytes actually read */
usr.bin/bdes/bdes.c
952
while ((n = READ(ibuf, nbytes)) == nbytes) {
usr.bin/bdes/bdes.c
955
for (n = 0; n < 8 - nbytes; n++)
usr.bin/bdes/bdes.c
956
ivec[n] = ivec[n + nbytes];
usr.bin/bdes/bdes.c
957
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
958
ivec[8 - nbytes + n] = ibuf[n] ^ msgbuf[n];
usr.bin/bdes/bdes.c
964
MEMZERO(&ibuf[n], nbytes - n);
usr.bin/bdes/bdes.c
965
ibuf[nbytes - 1] = '0' + n;
usr.bin/bdes/bdes.c
968
for (n = 0; n < nbytes; n++)
usr.bin/bdes/bdes.c
969
ibuf[n] ^= msgbuf[n];
usr.bin/bdes/bdes.c
975
for (n = 0; macbits > 7; n++, macbits -= 8)
usr.bin/bdes/bdes.c
976
(void)putchar(msgbuf[n]);
usr.bin/bdes/bdes.c
980
msgbuf[0] |= msgbuf[n] & bits[j];
usr.bin/calendar/basics.c
100
nth_kday(int n, int dow, struct date *date)
usr.bin/calendar/basics.c
102
if (n == 0)
usr.bin/calendar/basics.c
107
if (n > 0)
usr.bin/calendar/basics.c
111
return 7 * n + kday;
usr.bin/calendar/basics.h
77
int nth_kday(int n, int dow, struct date *date);
usr.bin/calendar/chinese.c
423
size_t n = nitems(jieqis);
usr.bin/calendar/chinese.c
425
for (size_t i = 0; i < n; i++) {
usr.bin/calendar/chinese.c
427
jq2 = &jieqis[(i+1) % n];
usr.bin/calendar/chinese.c
430
jq2 = &jieqis[(i+2) % n];
usr.bin/calendar/ecclesiastical.c
80
int n = (14 + 11 * y_mod19 - (int)floor(century * 0.75) +
usr.bin/calendar/ecclesiastical.c
82
int shifted_epact = mod(n, 30);
usr.bin/calendar/moon.c
130
nth_new_moon(int n)
usr.bin/calendar/moon.c
133
int k = n - n0; /* Months since j2000 */
usr.bin/calendar/moon.c
645
int n = (int)lround((t - t0) / mean_synodic_month);
usr.bin/calendar/moon.c
646
double tn = nth_new_moon(n);
usr.bin/calendar/moon.c
681
int n = (int)lround((t - t0) / mean_synodic_month - phi / 360.0);
usr.bin/calendar/moon.c
683
int k = n - 1;
usr.bin/calendar/moon.c
702
int n = (int)lround((t - t0) / mean_synodic_month - phi / 360.0);
usr.bin/calendar/moon.c
704
double t1 = nth_new_moon(n);
usr.bin/calendar/moon.c
706
n++;
usr.bin/calendar/moon.c
707
t1 = nth_new_moon(n);
usr.bin/calendar/moon.h
55
double nth_new_moon(int n);
usr.bin/calendar/utils.c
57
poly(double x, const double *coefs, size_t n)
usr.bin/calendar/utils.c
61
for (size_t i = 0; i < n; i++) {
usr.bin/calendar/utils.h
254
double poly(double x, const double *coefs, size_t n);
usr.bin/chat/chat.c
1144
echo_stderr(int n)
usr.bin/chat/chat.c
1149
switch (n) {
usr.bin/chat/chat.c
1161
s = character(n);
usr.bin/chat/chat.c
1205
int n, abort_len, report_len;
usr.bin/chat/chat.c
1232
for (n = 0; n < n_reports; ++n) {
usr.bin/chat/chat.c
1233
if ((report_string[n] != NULL) &&
usr.bin/chat/chat.c
1234
s - temp >= (report_len = strlen(report_string[n])) &&
usr.bin/chat/chat.c
1235
strncmp(s - report_len, report_string[n], report_len) == 0) {
usr.bin/chat/chat.c
1240
strcat (report_buffer, report_string[n]);
usr.bin/chat/chat.c
1242
report_string[n] = NULL;
usr.bin/chat/chat.c
1274
for (n = 0; n < n_aborts; ++n) {
usr.bin/chat/chat.c
1275
if (s - temp >= (abort_len = strlen(abort_string[n])) &&
usr.bin/chat/chat.c
1276
strncmp(s - abort_len, abort_string[n], abort_len) == 0) {
usr.bin/chat/chat.c
1285
exit_code = n + 4;
usr.bin/chat/chat.c
1286
strcpy(fail_reason = fail_buffer, abort_string[n]);
usr.bin/chat/chat.c
1349
int c, i, n;
usr.bin/chat/chat.c
1446
n = prec;
usr.bin/chat/chat.c
1448
n = strlen((char *)p);
usr.bin/chat/chat.c
1449
if (prec > 0 && prec < n)
usr.bin/chat/chat.c
1450
n = prec;
usr.bin/chat/chat.c
1452
while (n > 0 && buflen > 0) {
usr.bin/chat/chat.c
1454
--n;
usr.bin/chat/chat.c
1521
if ((n = width - len) > 0) {
usr.bin/chat/chat.c
1522
buflen -= n;
usr.bin/chat/chat.c
1523
for (; n > 0; --n)
usr.bin/comm/comm.c
183
size_t n;
usr.bin/comm/comm.c
186
if ((n = mbstowcs(NULL, str, 0)) == (size_t)-1)
usr.bin/comm/comm.c
188
if (SIZE_MAX / sizeof(*buf) < n + 1)
usr.bin/comm/comm.c
190
if ((buf = malloc((n + 1) * sizeof(*buf))) == NULL)
usr.bin/comm/comm.c
192
if (mbstowcs(buf, str, n + 1) != n)
usr.bin/comm/comm.c
206
ssize_t n;
usr.bin/comm/comm.c
210
if ((n = getline(bufp, buflenp, fp)) < 0)
usr.bin/comm/comm.c
212
if (n > 0 && (*bufp)[n - 1] == '\n')
usr.bin/comm/comm.c
213
(*bufp)[n - 1] = '\0';
usr.bin/crunch/crunchgen/crunchgen.c
965
char *n, *s, *d;
usr.bin/crunch/crunchgen/crunchgen.c
974
if ((n = strdup(str)) == NULL)
usr.bin/crunch/crunchgen/crunchgen.c
976
for (d = s = n; *s != '\0'; s++) {
usr.bin/crunch/crunchgen/crunchgen.c
983
return n;
usr.bin/crunch/crunchide/crunchide.c
214
int fd, i, n, rv;
usr.bin/crunch/crunchide/crunchide.c
224
n = sizeof exec_formats / sizeof exec_formats[0];
usr.bin/crunch/crunchide/crunchide.c
225
for (i = 0; i < n; i++) {
usr.bin/crunch/crunchide/crunchide.c
233
if (i == n) {
usr.bin/csplit/csplit.c
295
toomuch(FILE *ofp, long n)
usr.bin/csplit/csplit.c
314
if (n == 0)
usr.bin/csplit/csplit.c
318
lineno -= n;
usr.bin/csplit/csplit.c
336
if (buf[nread - i] == '\n' && n-- == 0)
usr.bin/csplit/csplit.c
340
} while (n > 0);
usr.bin/cut/cut.c
212
needpos(size_t n)
usr.bin/cut/cut.c
218
if (n > npos) {
usr.bin/cut/cut.c
221
npos = n;
usr.bin/cut/cut.c
222
while (n > npos)
usr.bin/cut/cut.c
76
size_t n;
usr.bin/cut/cut.c
95
n = mbrtowc(&dchar, optarg, MB_LEN_MAX, NULL);
usr.bin/cut/cut.c
96
if (dchar == '\0' || n != strlen(optarg))
usr.bin/dc/bcode.c
1287
struct number *n;
usr.bin/dc/bcode.c
1294
n = pop_number();
usr.bin/dc/bcode.c
1295
if (n == NULL) {
usr.bin/dc/bcode.c
1298
if (BN_is_zero(n->number)) {
usr.bin/dc/bcode.c
1301
} else if (BN_is_negative(n->number))
usr.bin/dc/bcode.c
1304
scale = max(bmachine.scale, n->scale);
usr.bin/dc/bcode.c
1305
normalize(n, 2*scale);
usr.bin/dc/bcode.c
1306
x = BN_dup(n->number);
usr.bin/dc/bcode.c
1315
bn_check(BN_div(x, NULL, n->number, x, ctx));
usr.bin/dc/bcode.c
1329
free_number(n);
usr.bin/dc/bcode.c
1567
struct number *n;
usr.bin/dc/bcode.c
1570
n = pop_number();
usr.bin/dc/bcode.c
1571
if (n == NULL)
usr.bin/dc/bcode.c
1573
i = get_ulong(n);
usr.bin/dc/bcode.c
1574
free_number(n);
usr.bin/dc/bcode.c
1590
struct number *n;
usr.bin/dc/bcode.c
1593
n = pop_number();
usr.bin/dc/bcode.c
1594
if (n == NULL)
usr.bin/dc/bcode.c
1596
i = get_ulong(n);
usr.bin/dc/bcode.c
310
pn(const char *str, const struct number *n)
usr.bin/dc/bcode.c
312
char *p = BN_bn2dec(n->number);
usr.bin/dc/bcode.c
316
fprintf(stderr, " %s (%u)\n" , p, n->scale);
usr.bin/dc/bcode.c
321
pbn(const char *str, const BIGNUM *n)
usr.bin/dc/bcode.c
323
char *p = BN_bn2dec(n);
usr.bin/dc/bcode.c
345
scale_number(BIGNUM *n, int s)
usr.bin/dc/bcode.c
356
bn_check(BN_mul_word(n, factors[abs_scale]));
usr.bin/dc/bcode.c
358
BN_div_word(n, factors[abs_scale]);
usr.bin/dc/bcode.c
374
bn_check(BN_mul(n, n, a, ctx));
usr.bin/dc/bcode.c
376
bn_check(BN_div(n, NULL, n, a, ctx));
usr.bin/dc/bcode.c
384
split_number(const struct number *n, BIGNUM *i, BIGNUM *f)
usr.bin/dc/bcode.c
388
bn_checkp(BN_copy(i, n->number));
usr.bin/dc/bcode.c
390
if (n->scale == 0 && f != NULL)
usr.bin/dc/bcode.c
392
else if (n->scale < sizeof(factors)/sizeof(factors[0])) {
usr.bin/dc/bcode.c
393
rem = BN_div_word(i, factors[n->scale]);
usr.bin/dc/bcode.c
408
bn_check(BN_set_word(p, n->scale));
usr.bin/dc/bcode.c
410
bn_check(BN_div(i, f, n->number, a, ctx));
usr.bin/dc/bcode.c
418
normalize(struct number *n, u_int s)
usr.bin/dc/bcode.c
420
scale_number(n->number, s - n->scale);
usr.bin/dc/bcode.c
421
n->scale = s;
usr.bin/dc/bcode.c
425
get_ulong(struct number *n)
usr.bin/dc/bcode.c
427
normalize(n, 0);
usr.bin/dc/bcode.c
428
return BN_get_word(n->number);
usr.bin/dc/bcode.c
432
negate(struct number *n)
usr.bin/dc/bcode.c
434
BN_set_negative(n->number, !BN_is_negative(n->number));
usr.bin/dc/bcode.c
438
push_number(struct number *n)
usr.bin/dc/bcode.c
440
stack_pushnumber(&bmachine.stack, n);
usr.bin/dc/bcode.c
561
struct number *n;
usr.bin/dc/bcode.c
563
n = new_number();
usr.bin/dc/bcode.c
564
bn_check(BN_set_word(n->number, bmachine.scale));
usr.bin/dc/bcode.c
565
push_number(n);
usr.bin/dc/bcode.c
571
struct number *n;
usr.bin/dc/bcode.c
574
n = pop_number();
usr.bin/dc/bcode.c
575
if (n != NULL) {
usr.bin/dc/bcode.c
576
if (BN_is_negative(n->number))
usr.bin/dc/bcode.c
579
scale = get_ulong(n);
usr.bin/dc/bcode.c
585
free_number(n);
usr.bin/dc/bcode.c
592
struct number *n;
usr.bin/dc/bcode.c
594
n = new_number();
usr.bin/dc/bcode.c
595
bn_check(BN_set_word(n->number, bmachine.obase));
usr.bin/dc/bcode.c
596
push_number(n);
usr.bin/dc/bcode.c
602
struct number *n;
usr.bin/dc/bcode.c
605
n = pop_number();
usr.bin/dc/bcode.c
606
if (n != NULL) {
usr.bin/dc/bcode.c
607
base = get_ulong(n);
usr.bin/dc/bcode.c
612
free_number(n);
usr.bin/dc/bcode.c
619
struct number *n;
usr.bin/dc/bcode.c
621
n = new_number();
usr.bin/dc/bcode.c
622
bn_check(BN_set_word(n->number, bmachine.ibase));
usr.bin/dc/bcode.c
623
push_number(n);
usr.bin/dc/bcode.c
629
struct number *n;
usr.bin/dc/bcode.c
632
n = pop_number();
usr.bin/dc/bcode.c
633
if (n != NULL) {
usr.bin/dc/bcode.c
634
base = get_ulong(n);
usr.bin/dc/bcode.c
640
free_number(n);
usr.bin/dc/bcode.c
648
struct number *n;
usr.bin/dc/bcode.c
651
n = new_number();
usr.bin/dc/bcode.c
652
bn_check(BN_set_word(n->number, i));
usr.bin/dc/bcode.c
653
push_number(n);
usr.bin/dc/bcode.c
661
struct number *n;
usr.bin/dc/bcode.c
676
n = new_number();
usr.bin/dc/bcode.c
677
bn_check(BN_set_word(n->number, scale));
usr.bin/dc/bcode.c
678
push_number(n);
usr.bin/dc/bcode.c
683
count_digits(const struct number *n)
usr.bin/dc/bcode.c
688
if (BN_is_zero(n->number))
usr.bin/dc/bcode.c
689
return n->scale ? n->scale : 1;
usr.bin/dc/bcode.c
693
fract_part->scale = n->scale;
usr.bin/dc/bcode.c
694
split_number(n, int_part->number, fract_part->number);
usr.bin/dc/bcode.c
703
return i + n->scale;
usr.bin/dc/bcode.c
711
struct number *n = NULL;
usr.bin/dc/bcode.c
720
n = new_number();
usr.bin/dc/bcode.c
721
bn_check(BN_set_word(n->number, digits));
usr.bin/dc/bcode.c
725
n = new_number();
usr.bin/dc/bcode.c
726
bn_check(BN_set_word(n->number, digits));
usr.bin/dc/bcode.c
730
push_number(n);
usr.bin/dc/bcode.c
739
struct number *n;
usr.bin/dc/bcode.c
748
n = value->u.num;
usr.bin/dc/bcode.c
749
normalize(n, 0);
usr.bin/dc/bcode.c
750
if (BN_num_bits(n->number) > 8)
usr.bin/dc/bcode.c
751
bn_check(BN_mask_bits(n->number, 8));
usr.bin/dc/bcode.c
752
str[0] = BN_get_word(n->number);
usr.bin/dc/bcode.c
790
struct number *n;
usr.bin/dc/bcode.c
796
n = new_number();
usr.bin/dc/bcode.c
797
bn_check(BN_zero(n->number));
usr.bin/dc/bcode.c
798
push_number(n);
usr.bin/dc/bcode.c
861
struct number *inumber, *n;
usr.bin/dc/bcode.c
880
n = new_number();
usr.bin/dc/bcode.c
881
bn_check(BN_zero(n->number));
usr.bin/dc/bcode.c
882
push_number(n);
usr.bin/dc/inout.c
184
struct number *n;
usr.bin/dc/inout.c
190
n = new_number();
usr.bin/dc/inout.c
191
bn_check(BN_zero(n->number));
usr.bin/dc/inout.c
212
n->scale++;
usr.bin/dc/inout.c
214
bn_check(BN_mul_word(n->number, base));
usr.bin/dc/inout.c
220
bn_check(BN_add_word(n->number, v));
usr.bin/dc/inout.c
223
negate(n);
usr.bin/dc/inout.c
224
return n;
usr.bin/dc/inout.c
388
print_ascii(FILE *f, const struct number *n)
usr.bin/dc/inout.c
393
v = BN_dup(n->number);
usr.bin/dc/mem.c
33
struct number *n;
usr.bin/dc/mem.c
35
n = bmalloc(sizeof(*n));
usr.bin/dc/mem.c
36
n->scale = 0;
usr.bin/dc/mem.c
37
n->number = BN_new();
usr.bin/dc/mem.c
38
if (n->number == NULL)
usr.bin/dc/mem.c
40
return n;
usr.bin/dc/mem.c
44
free_number(struct number *n)
usr.bin/dc/mem.c
46
BN_free(n->number);
usr.bin/dc/mem.c
47
free(n);
usr.bin/dc/mem.c
53
struct number *n;
usr.bin/dc/mem.c
55
n = bmalloc(sizeof(*n));
usr.bin/dc/mem.c
56
n->scale = a->scale;
usr.bin/dc/mem.c
57
n->number = BN_dup(a->number);
usr.bin/dc/mem.c
58
bn_checkp(n->number);
usr.bin/dc/mem.c
59
return n;
usr.bin/dc/stack.c
292
struct array *n;
usr.bin/dc/stack.c
297
n = array_new();
usr.bin/dc/stack.c
298
array_grow(n, a->size);
usr.bin/dc/stack.c
300
stack_dup_value(&a->data[i], &n->data[i]);
usr.bin/dc/stack.c
301
return n;
usr.bin/dc/stack.c
338
struct value n;
usr.bin/dc/stack.c
341
n.type = BCODE_NONE;
usr.bin/dc/stack.c
342
n.array = NULL;
usr.bin/dc/stack.c
343
stack_push(stack, &n);
usr.bin/dfregress/parser.c
103
for (n = 1; c < i; c++) {
usr.bin/dfregress/parser.c
107
if ((c >= 1) && (&buffer[c] != tokens[n-1])) {
usr.bin/dfregress/parser.c
114
tokens[n-1] = &buffer[c+1];
usr.bin/dfregress/parser.c
136
tokens[n++] = &buffer[c--];
usr.bin/dfregress/parser.c
139
tokens[n] = NULL;
usr.bin/dfregress/parser.c
146
return n;
usr.bin/dfregress/parser.c
154
int c, n, i = 0;
usr.bin/dfregress/parser.c
168
n = line_tokenize(buffer, &iswhitespace, '#', tokens);
usr.bin/dfregress/parser.c
175
if ((n < 1) || (tokens[0][0] == '\0'))
usr.bin/dfregress/parser.c
86
int c, n, i;
usr.bin/diff/diffreg.c
544
equiv(struct line *a, int n, struct line *b, int m, int *c)
usr.bin/diff/diffreg.c
549
while (i <= n && j <= m) {
usr.bin/diff/diffreg.c
557
while (i <= n)
usr.bin/diff/diffreg.c
573
isqrt(int n)
usr.bin/diff/diffreg.c
577
if (n == 0)
usr.bin/diff/diffreg.c
582
x = n / x;
usr.bin/diff/diffreg.c
591
stone(int *a, int n, int *b, int *c, int flags)
usr.bin/diff/diffreg.c
600
sq = isqrt(n);
usr.bin/diff/diffreg.c
606
for (i = 1; i <= n; i++) {
usr.bin/diff/diffreg.c
795
sort(struct line *a, int n)
usr.bin/diff/diffreg.c
800
if (n == 0)
usr.bin/diff/diffreg.c
802
for (j = 1; j <= n; j *= 2)
usr.bin/diff/diffreg.c
805
k = n - m;
usr.bin/dsynth/build.c
1007
n = IterateWorker % MaxWorkers;
usr.bin/dsynth/build.c
1008
work = &WorkerAry[n];
usr.bin/dsynth/build.c
1016
if (n <= MaxWorkers / 2) {
usr.bin/dsynth/build.c
813
int n;
usr.bin/dsynth/config.c
682
size_t n;
usr.bin/dsynth/config.c
690
n = 0;
usr.bin/dsynth/config.c
692
while (n != sizeof(note) &&
usr.bin/dsynth/config.c
706
if (n + r > sizeof(note))
usr.bin/dsynth/config.c
707
r = sizeof(note) - n;
usr.bin/dsynth/config.c
708
bcopy((char *)v, (char *)¬e + n, r);
usr.bin/dsynth/config.c
709
n += r;
usr.bin/dsynth/config.c
713
if (n != sizeof(note))
usr.bin/dsynth/dsynth.c
563
int n;
usr.bin/dsynth/dsynth.c
584
for (n = 0; n < ac; ++n)
usr.bin/dsynth/dsynth.c
585
av[n] = oldav[n];
usr.bin/dsynth/dsynth.c
598
for (n = 0; n < ac + nadd; ++n)
usr.bin/dsynth/dsynth.c
599
printf(" %s", av[n]);
usr.bin/dsynth/mount.c
60
int n;
usr.bin/dsynth/mount.c
92
for (n = 0; n < MaxWorkers; ++n) {
usr.bin/dsynth/mount.c
93
asprintf(&buf, "%s/bin.%03d/ls", BuildBase, n);
usr.bin/dsynth/ncurses.c
200
ssize_t n;
usr.bin/dsynth/ncurses.c
207
n = readlogline(&nclog, &ptr);
usr.bin/dsynth/ncurses.c
208
if (n < 0)
usr.bin/dsynth/ncurses.c
210
if (n == 0)
usr.bin/dsynth/ncurses.c
216
if (n > COLS)
usr.bin/dsynth/ncurses.c
219
w = n;
usr.bin/dsynth/pkglist.c
178
ParsePackageList(int n, char **ary, int debugstop)
usr.bin/dsynth/pkglist.c
195
for (i = 0; i < n; ++i) {
usr.bin/dsynth/repo.c
673
int n;
usr.bin/dsynth/repo.c
675
n = 0;
usr.bin/dsynth/repo.c
678
++n;
usr.bin/dsynth/repo.c
680
return n;
usr.bin/dsynth/subs.c
737
int n;
usr.bin/dsynth/subs.c
753
n = (cmsg->cmsg_len - sizeof(cmsg)) /
usr.bin/dsynth/subs.c
755
for (i = 0; i < n; ++i)
usr.bin/dsynth/subs.c
867
int n;
usr.bin/dsynth/subs.c
884
for (n = log->buf_scan; n < log->buf_end; ++n) {
usr.bin/dsynth/subs.c
885
if (log->buf[n] == '\n') {
usr.bin/dsynth/subs.c
887
r = n - log->buf_beg;
usr.bin/dsynth/subs.c
888
log->buf_beg = n + 1;
usr.bin/dsynth/subs.c
889
log->buf_scan = n + 1;
usr.bin/dsynth/subs.c
901
if (n == sizeof(log->buf)) {
usr.bin/dsynth/subs.c
908
n - log->buf_beg);
usr.bin/dsynth/subs.c
911
n -= log->buf_beg;
usr.bin/dsynth/subs.c
933
r = n - 1;
usr.bin/dsynth/subs.c
934
log->buf_beg = n;
usr.bin/dsynth/subs.c
935
log->buf_scan = n;
usr.bin/evtranalyze/evtranalyze.c
383
rows_init(struct rows *rows, int n, double height, double perc)
usr.bin/evtranalyze/evtranalyze.c
386
rows->row_increment = height / n;
usr.bin/evtranalyze/evtranalyze.c
396
rows_n(struct rows *rows, int n, double *y, double *height)
usr.bin/evtranalyze/evtranalyze.c
398
*y = n * rows->row_increment + rows->row_off;
usr.bin/expand/expand.c
116
for (n = 0; n < nstops; n++)
usr.bin/expand/expand.c
117
if (tabstops[n] > column)
usr.bin/expand/expand.c
119
if (n == nstops) {
usr.bin/expand/expand.c
124
while (column < tabstops[n]) {
usr.bin/expand/expand.c
58
int n;
usr.bin/flame_graph/collect.c
108
for (n = 0; n < ncpus; ++n) {
usr.bin/flame_graph/collect.c
121
rindex = savewindex[n];
usr.bin/flame_graph/collect.c
137
flame_doentry(n, rindex, scan);
usr.bin/flame_graph/collect.c
140
savewindex[n] = windex;
usr.bin/flame_graph/collect.c
51
int n;
usr.bin/flame_graph/collect.c
70
n = 0;
usr.bin/flame_graph/collect.c
75
++n;
usr.bin/flame_graph/collect.c
76
if ((n & 127) == 0)
usr.bin/flame_graph/collect.c
94
int n;
usr.bin/flame_graph/process.c
61
int n;
usr.bin/flame_graph/process.c
64
n = 0;
usr.bin/flame_graph/process.c
74
if (n == MAXELM)
usr.bin/flame_graph/process.c
76
++n;
usr.bin/fmt/fmt.c
454
{ size_t n=np;
usr.bin/fmt/fmt.c
455
while (n<length) {
usr.bin/fmt/fmt.c
458
while (n+word_length < length && line[n+word_length] != ' ')
usr.bin/fmt/fmt.c
461
while (n+space_length < length && line[n+space_length] == ' ')
usr.bin/fmt/fmt.c
465
line+n, word_length, space_length-word_length);
usr.bin/fmt/fmt.c
466
n += space_length;
usr.bin/fmt/fmt.c
479
size_t n=0;
usr.bin/fmt/fmt.c
480
while (n<length && *line++ == ' ') ++n;
usr.bin/fmt/fmt.c
481
return n;
usr.bin/gcore/elfcore.c
379
int n;
usr.bin/gcore/elfcore.c
399
if ((n = read(fd, &status->pr_reg, sizeof status->pr_reg)) == -1)
usr.bin/gcore/elfcore.c
401
if (n < sizeof status->pr_reg)
usr.bin/gcore/elfcore.c
403
name, sizeof(status->pr_reg), n);
usr.bin/gcore/elfcore.c
410
if ((n = read(fd, fpregset, sizeof *fpregset)) == -1)
usr.bin/gcore/elfcore.c
412
if (n < sizeof *fpregset)
usr.bin/gcore/elfcore.c
414
name, sizeof(*fpregset), n);
usr.bin/gcore/elfcore.c
421
if ((n = read(fd, line, sizeof line - 1)) == -1)
usr.bin/gcore/elfcore.c
423
if (n > MAXCOMLEN)
usr.bin/gcore/elfcore.c
424
n = MAXCOMLEN;
usr.bin/gcore/elfcore.c
425
for (i = 0; i < n && line[i] != ' '; i++)
usr.bin/gcore/elfcore.c
487
int n;
usr.bin/gcore/elfcore.c
492
n = sscanf(mapbuf + pos, "%lx %lx %*d %*d %*x %3[-rwx]"
usr.bin/gcore/elfcore.c
495
if (n != 4)
usr.bin/getaddrinfo/getaddrinfo.c
226
const char *const *table, size_t n)
usr.bin/getaddrinfo/getaddrinfo.c
232
assert((uintmax_t)n <= (uintmax_t)INT_MAX);
usr.bin/getaddrinfo/getaddrinfo.c
247
for (i = 0; i < n; i++)
usr.bin/getaddrinfo/getaddrinfo.c
250
if (i == n)
usr.bin/getaddrinfo/getaddrinfo.c
264
int n;
usr.bin/getaddrinfo/getaddrinfo.c
272
n = printf("%s", socket_types[ai->ai_socktype]);
usr.bin/getaddrinfo/getaddrinfo.c
274
n = printf("%d", ai->ai_socktype);
usr.bin/getaddrinfo/getaddrinfo.c
275
if (n < 0)
usr.bin/getaddrinfo/getaddrinfo.c
282
n = printf(" %s", address_families[ai->ai_family]);
usr.bin/getaddrinfo/getaddrinfo.c
284
n = printf(" %d", ai->ai_family);
usr.bin/getaddrinfo/getaddrinfo.c
285
if (n < 0)
usr.bin/getaddrinfo/getaddrinfo.c
291
n = printf(" %d", ai->ai_protocol);
usr.bin/getaddrinfo/getaddrinfo.c
293
n = printf(" %s", protoent->p_name);
usr.bin/getaddrinfo/getaddrinfo.c
294
if (n < 0)
usr.bin/getaddrinfo/getaddrinfo.c
301
n = sockaddr_snprintf(buf, sizeof(buf), " %a %p",
usr.bin/getaddrinfo/getaddrinfo.c
306
n = sockaddr_snprintf(buf, sizeof(buf),
usr.bin/getaddrinfo/getaddrinfo.c
317
if (n < 0) {
usr.bin/getaddrinfo/getaddrinfo.c
321
if (sizeof(buf) <= (size_t)n)
usr.bin/gzip/unbzip2.c
68
ssize_t n;
usr.bin/gzip/unbzip2.c
70
n = read(in, inbuf, BUFLEN);
usr.bin/gzip/unbzip2.c
71
if (n < 0)
usr.bin/gzip/unbzip2.c
73
if (n == 0)
usr.bin/gzip/unbzip2.c
76
bzs.avail_in = n;
usr.bin/gzip/unbzip2.c
78
*bytes_in += n;
usr.bin/gzip/unbzip2.c
91
ssize_t n;
usr.bin/gzip/unbzip2.c
93
n = write(out, outbuf, BUFLEN - bzs.avail_out);
usr.bin/gzip/unbzip2.c
94
if (n < 0)
usr.bin/gzip/unbzip2.c
96
bytes_out += n;
usr.bin/hexdump/display.c
228
int n;
usr.bin/hexdump/display.c
267
n = fread((char *)curp + nread, sizeof(u_char),
usr.bin/hexdump/display.c
269
if (!n) {
usr.bin/hexdump/display.c
277
length -= n;
usr.bin/hexdump/display.c
278
if (!(need -= n)) {
usr.bin/hexdump/display.c
294
nread += n;
usr.bin/hexdump/odsyntax.c
368
unsigned long long n;
usr.bin/hexdump/odsyntax.c
411
n = (isize >= sizeof(n)) ? ULLONG_MAX : (1ULL << (8 * isize)) - 1;
usr.bin/hexdump/odsyntax.c
413
while (n != 0) {
usr.bin/hexdump/odsyntax.c
415
n >>= (fchar == 'x') ? 4 : 3;
usr.bin/iconv/iconv.c
140
do_list(unsigned int n, const char * const *list, void *data __unused)
usr.bin/iconv/iconv.c
144
for(i = 0; i < n; i++) {
usr.bin/iconv/iconv.c
146
if (i < n - 1)
usr.bin/indent/indent.c
1227
int n,
usr.bin/indent/indent.c
1244
while ((n = read(fileno(input), buff, sizeof(buff))) > 0)
usr.bin/indent/indent.c
1245
if (write(bakchn, buff, n) != n)
usr.bin/indent/indent.c
1247
if (n < 0)
usr.bin/join/join.c
358
size_t n;
usr.bin/join/join.c
363
n = mbrtowc(&c, s, MB_LEN_MAX, NULL);
usr.bin/join/join.c
364
if (n == (size_t)-1 || n == (size_t)-2)
usr.bin/join/join.c
366
s += n;
usr.bin/join/join.c
373
s[-n] = '\0';
usr.bin/join/join.c
411
size_t n;
usr.bin/join/join.c
413
if ((n = mbsrtowcs(NULL, &s, 0, NULL)) == (size_t)-1)
usr.bin/join/join.c
415
if ((wcs = malloc((n + 1) * sizeof(*wcs))) == NULL)
usr.bin/join/join.c
417
mbsrtowcs(wcs, &s, n + 1, NULL);
usr.bin/jot/jot.c
137
n = getprec(argv[2]);
usr.bin/jot/jot.c
147
if (n > prec) /* maximum precision */
usr.bin/jot/jot.c
148
prec = n;
usr.bin/jot/jot.c
83
int n = 0;
usr.bin/kdump/kdump.c
295
#define print_number(i,n,c) do { \
usr.bin/kdump/kdump.c
301
n--; \
usr.bin/ktrdump/ktrdump.c
1000
bestn = n;
usr.bin/ktrdump/ktrdump.c
1019
int n;
usr.bin/ktrdump/ktrdump.c
1027
for (n = 0; ctl[n]; ++n) {
usr.bin/ktrdump/ktrdump.c
1028
fmt[n] = ctl[n];
usr.bin/ktrdump/ktrdump.c
1029
if (ctl[n] == '%')
usr.bin/ktrdump/ktrdump.c
1032
if (n == 0) {
usr.bin/ktrdump/ktrdump.c
1035
n = 1;
usr.bin/ktrdump/ktrdump.c
1036
while (n < (int)sizeof(fmt)) {
usr.bin/ktrdump/ktrdump.c
1037
fmt[n] = ctl[n];
usr.bin/ktrdump/ktrdump.c
1038
fmt[n+1] = 0;
usr.bin/ktrdump/ktrdump.c
1040
switch(ctl[n]) {
usr.bin/ktrdump/ktrdump.c
1071
++n;
usr.bin/ktrdump/ktrdump.c
1076
++n;
usr.bin/ktrdump/ktrdump.c
1085
++n;
usr.bin/ktrdump/ktrdump.c
1094
++n;
usr.bin/ktrdump/ktrdump.c
1133
++n;
usr.bin/ktrdump/ktrdump.c
1136
fmt[n] = 0;
usr.bin/ktrdump/ktrdump.c
1139
ctl += n;
usr.bin/ktrdump/ktrdump.c
176
int n;
usr.bin/ktrdump/ktrdump.c
339
for (n = 0; n < ncpus; ++n)
usr.bin/ktrdump/ktrdump.c
340
iterate_buf(ctx, ktr_bufs, n, &last_timestamp[n],
usr.bin/ktrdump/ktrdump.c
450
print_entry(FILE *fo, int n, int row, struct ktr_entry *entry,
usr.bin/ktrdump/ktrdump.c
458
fprintf(fo, "%-3d ", n);
usr.bin/ktrdump/ktrdump.c
515
print_callback(void *ctx, int n, int row, struct ktr_entry *entry, uint64_t *last_ts)
usr.bin/ktrdump/ktrdump.c
519
print_entry(fo, n, row, entry, last_ts);
usr.bin/ktrdump/ktrdump.c
648
dump_callback(void *ctx, int n, int row __unused, struct ktr_entry *entry,
usr.bin/ktrdump/ktrdump.c
662
ev.cpu = n;
usr.bin/ktrdump/ktrdump.c
707
u_int n;
usr.bin/ktrdump/ktrdump.c
715
n = 256 - ((intptr_t)(kptr + l) & 255);
usr.bin/ktrdump/ktrdump.c
716
if (n > sizeof(ctx->save_buf) - l - 1)
usr.bin/ktrdump/ktrdump.c
717
n = sizeof(ctx->save_buf) - l - 1;
usr.bin/ktrdump/ktrdump.c
718
if (kvm_read(kd, (uintptr_t)(kptr + l), ctx->save_buf + l, n) < 0)
usr.bin/ktrdump/ktrdump.c
720
while (l < sizeof(ctx->save_buf) && n) {
usr.bin/ktrdump/ktrdump.c
723
--n;
usr.bin/ktrdump/ktrdump.c
726
if (n)
usr.bin/ktrdump/ktrdump.c
986
int n, bestn;
usr.bin/ktrdump/ktrdump.c
993
for (n = 0; n < ncpus; ++n) {
usr.bin/ktrdump/ktrdump.c
994
buf = ktr_bufs + n;
usr.bin/ldd/ldd.c
108
ssize_t n;
usr.bin/ldd/ldd.c
118
if ((n = read(fd, &hdr, sizeof hdr)) == -1) {
usr.bin/ldd/ldd.c
127
if ((size_t)n >= sizeof hdr.elf && IS_ELF(hdr.elf)) {
usr.bin/localedef/charmap.c
221
charmap_t *n = NULL;
usr.bin/localedef/charmap.c
231
if ((n = calloc(1, sizeof (*n))) == NULL) {
usr.bin/localedef/charmap.c
235
n->wc = wc;
usr.bin/localedef/charmap.c
236
RB_INSERT(cmap_wc, &cmap_wc, n);
usr.bin/localedef/charmap.c
246
if ((n == NULL) && ((n = calloc(1, sizeof (*n))) == NULL)) {
usr.bin/localedef/charmap.c
250
n->wc = wc;
usr.bin/localedef/charmap.c
251
n->name = sym;
usr.bin/localedef/charmap.c
253
RB_INSERT(cmap_sym, &cmap_sym, n);
usr.bin/localedef/charmap.c
343
charmap_t *n;
usr.bin/localedef/charmap.c
346
n = RB_FIND(cmap_sym, &cmap_sym, &srch);
usr.bin/localedef/charmap.c
347
if (n && n->wc != (wchar_t)-1) {
usr.bin/localedef/charmap.c
349
*wc = n->wc;
usr.bin/localedef/collate.c
1081
wsncpy(wchar_t *s1, const wchar_t *s2, size_t n)
usr.bin/localedef/collate.c
1085
n++;
usr.bin/localedef/collate.c
1086
while (--n > 0 && (*s1++ = *s2++) != 0)
usr.bin/localedef/collate.c
1088
if (n > 0)
usr.bin/localedef/collate.c
1089
while (--n > 0)
usr.bin/localedef/collate.c
1113
int i, j, n;
usr.bin/localedef/collate.c
1208
RB_COUNT(temp, substs, &substs[i], n);
usr.bin/localedef/collate.c
1209
collinfo.subst_count[i] = n;
usr.bin/localedef/collate.c
1210
if ((st = calloc(n, sizeof (collate_subst_t))) == NULL) {
usr.bin/localedef/collate.c
1214
n = 0;
usr.bin/localedef/collate.c
1216
if ((st[n].key = resolve_pri(sb->key)) < 0) {
usr.bin/localedef/collate.c
1220
if (st[n].key != (n | COLLATE_SUBST_PRIORITY)) {
usr.bin/localedef/collate.c
1224
st[n].pri[j] = get_weight(sb->ref[j], i);
usr.bin/localedef/collate.c
1226
n++;
usr.bin/localedef/collate.c
1228
if (n != collinfo.subst_count[i])
usr.bin/localedef/collate.c
1244
n = 0;
usr.bin/localedef/collate.c
1246
(void) wsncpy(chain[n].str, ce->expand, COLLATE_STR_LEN);
usr.bin/localedef/collate.c
1248
chain[n].pri[i] = get_weight(ce->ref[i], i);
usr.bin/localedef/collate.c
1250
n++;
usr.bin/localedef/collate.c
1252
if (n != collinfo.chain_count)
usr.bin/localedef/collate.c
1258
RB_NUMNODES(collchar_t, collchars, &collchars, n);
usr.bin/localedef/collate.c
1259
large = calloc(n, sizeof (collate_large_t));
usr.bin/localedef/monetary.c
163
add_monetary_group(int n)
usr.bin/localedef/monetary.c
168
(void) asprintf(&s, "%d", n);
usr.bin/localedef/monetary.c
170
(void) asprintf(&s, "%s;%d", mon.mon_grouping, n);
usr.bin/localedef/monetary.c
90
add_monetary_num(int n)
usr.bin/localedef/monetary.c
94
(void) asprintf(&str, "%d", n);
usr.bin/localedef/numeric.c
89
add_numeric_group(int n)
usr.bin/localedef/numeric.c
94
(void) asprintf(&s, "%d", n);
usr.bin/localedef/numeric.c
96
(void) asprintf(&s, "%s;%d", numeric.grouping, n);
usr.bin/localedef/wide.c
182
towide_none(wchar_t *c, const char *mb, unsigned n __unused)
usr.bin/localedef/wide.c
208
towide_utf8(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
242
if (nb > (int)n) {
usr.bin/localedef/wide.c
313
towide_dbcs(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
324
if (n < 2) {
usr.bin/localedef/wide.c
345
int n = 0, c;
usr.bin/localedef/wide.c
348
n = 4;
usr.bin/localedef/wide.c
350
n = 3;
usr.bin/localedef/wide.c
352
n = 2;
usr.bin/localedef/wide.c
354
n = 1;
usr.bin/localedef/wide.c
356
c = n;
usr.bin/localedef/wide.c
357
while (n) {
usr.bin/localedef/wide.c
358
n--;
usr.bin/localedef/wide.c
359
s[n] = wc & 0xff;
usr.bin/localedef/wide.c
372
towide_big5(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
374
return (towide_dbcs(wc, mb, n));
usr.bin/localedef/wide.c
382
towide_gbk(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
384
return (towide_dbcs(wc, mb, n));
usr.bin/localedef/wide.c
392
towide_gb2312(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
394
return (towide_dbcs(wc, mb, n));
usr.bin/localedef/wide.c
403
towide_gb18030(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
414
if (n < 2) {
usr.bin/localedef/wide.c
424
if (n < 4) {
usr.bin/localedef/wide.c
446
towide_mskanji(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
458
if (n < 2) {
usr.bin/localedef/wide.c
479
towide_euc_impl(wchar_t *wc, const char *mb, unsigned n,
usr.bin/localedef/wide.c
512
if ((int)n < width) {
usr.bin/localedef/wide.c
536
towide_euccn(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
538
return (towide_euc_impl(wc, mb, n, 0x8e, 4, 0, 0));
usr.bin/localedef/wide.c
550
towide_eucjp(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
552
return (towide_euc_impl(wc, mb, n, 0x8e, 2, 0x8f, 3));
usr.bin/localedef/wide.c
564
towide_euckr(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
566
return (towide_euc_impl(wc, mb, n, 0, 0, 0, 0));
usr.bin/localedef/wide.c
578
towide_euctw(wchar_t *wc, const char *mb, unsigned n)
usr.bin/localedef/wide.c
580
return (towide_euc_impl(wc, mb, n, 0x8e, 4, 0, 0));
usr.bin/login/login.c
775
size_t n;
usr.bin/login/login.c
782
n = strlen(*pp);
usr.bin/login/login.c
783
if (s[n] == '=' && strncmp(s, *pp, n) == 0)
usr.bin/m4/eval.c
125
int c, n;
usr.bin/m4/eval.c
131
for (n = 0; n < argc; n++)
usr.bin/m4/eval.c
132
printf("argv[%d] = %s\n", n, argv[n]);
usr.bin/m4/eval.c
325
for (n = argc - 1; n > 3; n--) {
usr.bin/m4/eval.c
327
pbstr(argv[n]);
usr.bin/m4/eval.c
338
if (argc > 2 && (n = atoi(argv[2])) != 0)
usr.bin/m4/eval.c
339
dodiv(n);
usr.bin/m4/eval.c
364
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
365
macro_undefine(argv[n]);
usr.bin/m4/eval.c
375
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
376
macro_popdef(argv[n]);
usr.bin/m4/eval.c
436
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
437
fprintf(stderr, "%s ", argv[n]);
usr.bin/m4/eval.c
470
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
471
dodefn(argv[n]);
usr.bin/m4/eval.c
517
int n;
usr.bin/m4/eval.c
549
for (n = argc - 1; n > 2; n--) {
usr.bin/m4/eval.c
550
pbstr(argv[n]);
usr.bin/m4/eval.c
558
for (n = argc - 1; n > 2; n--) {
usr.bin/m4/eval.c
560
pbstr(argv[n]);
usr.bin/m4/eval.c
657
int n;
usr.bin/m4/eval.c
661
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
662
if ((p = lookup_macro_definition(argv[n])) != NULL)
usr.bin/m4/eval.c
663
dump_one_def(argv[n], p);
usr.bin/m4/eval.c
674
int n;
usr.bin/m4/eval.c
677
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
678
mark_traced(argv[n], on);
usr.bin/m4/eval.c
805
dodiv(int n)
usr.bin/m4/eval.c
809
oindex = n;
usr.bin/m4/eval.c
810
if (n >= maxout) {
usr.bin/m4/eval.c
812
resizedivs(n + 10);
usr.bin/m4/eval.c
814
n = 0; /* bitbucket */
usr.bin/m4/eval.c
817
if (n < 0)
usr.bin/m4/eval.c
818
n = 0; /* bitbucket */
usr.bin/m4/eval.c
819
if (outfile[n] == NULL) {
usr.bin/m4/eval.c
823
(outfile[n] = fdopen(fd, "w+")) == NULL)
usr.bin/m4/eval.c
828
active = outfile[n];
usr.bin/m4/eval.c
839
int n;
usr.bin/m4/eval.c
844
n = strtonum(argv[ind], 1, INT_MAX, &errstr);
usr.bin/m4/eval.c
849
if (n < maxout && outfile[n] != NULL)
usr.bin/m4/eval.c
850
getdiv(n);
usr.bin/m4/eval.c
855
for (n = 1; n < maxout; n++)
usr.bin/m4/eval.c
856
if (outfile[n] != NULL)
usr.bin/m4/eval.c
857
getdiv(n);
usr.bin/m4/gnum4.c
163
ndptr n;
usr.bin/m4/gnum4.c
166
n = lookup(argv[2]);
usr.bin/m4/gnum4.c
167
if (n == NULL || (p = macro_getdef(n)) == NULL)
usr.bin/m4/gnum4.c
171
eval(argv + 1, argc - 1, p->type, is_traced(n));
usr.bin/m4/gnum4.c
207
addchars(const char *c, size_t n)
usr.bin/m4/gnum4.c
209
if (n == 0)
usr.bin/m4/gnum4.c
211
while (current + n > bufsize) {
usr.bin/m4/gnum4.c
218
memcpy(buffer + current, c, n);
usr.bin/m4/gnum4.c
219
current += n;
usr.bin/m4/gnum4.c
258
add_sub(int n, const char *string, regex_t *re, regmatch_t *pm)
usr.bin/m4/gnum4.c
260
if (n > (int)re->re_nsub)
usr.bin/m4/gnum4.c
261
warnx("No subexpression %d", n);
usr.bin/m4/gnum4.c
264
else if (pm[n].rm_so != -1 && pm[n].rm_eo != -1)
usr.bin/m4/gnum4.c
265
addchars(string + pm[n].rm_so, pm[n].rm_eo - pm[n].rm_so);
usr.bin/m4/gnum4.c
74
struct path_entry *n;
usr.bin/m4/gnum4.c
76
n = malloc(sizeof(struct path_entry));
usr.bin/m4/gnum4.c
77
if (n == NULL)
usr.bin/m4/gnum4.c
79
n->name = strdup(dirname);
usr.bin/m4/gnum4.c
80
if (n->name == NULL)
usr.bin/m4/gnum4.c
82
n->next = NULL;
usr.bin/m4/gnum4.c
83
return n;
usr.bin/m4/gnum4.c
89
struct path_entry *n;
usr.bin/m4/gnum4.c
91
n = new_path_entry(dirname);
usr.bin/m4/gnum4.c
94
last->next = n;
usr.bin/m4/gnum4.c
95
last = n;
usr.bin/m4/gnum4.c
97
last = first = n;
usr.bin/m4/lib/ohash_do.c
29
struct _ohash_record *n;
usr.bin/m4/lib/ohash_do.c
45
n = (h->info.halloc)(sizeof(struct _ohash_record) * ns, h->info.data);
usr.bin/m4/lib/ohash_do.c
46
if (n == NULL)
usr.bin/m4/lib/ohash_do.c
53
while (n[i].p != NULL) {
usr.bin/m4/lib/ohash_do.c
58
n[i].hv = h->t[j].hv;
usr.bin/m4/lib/ohash_do.c
59
n[i].p = h->t[j].p;
usr.bin/m4/lib/ohash_do.c
64
h->t = n;
usr.bin/m4/look.c
140
ndptr n;
usr.bin/m4/look.c
143
n = ohash_find(¯os, i);
usr.bin/m4/look.c
144
if (n == NULL) {
usr.bin/m4/look.c
145
n = ohash_create_entry(¯o_info, name, &end);
usr.bin/m4/look.c
146
ohash_insert(¯os, i, n);
usr.bin/m4/look.c
147
n->trace_flags = FLAG_NO_TRACE;
usr.bin/m4/look.c
148
n->builtin_type = MACRTYPE;
usr.bin/m4/look.c
149
n->d = NULL;
usr.bin/m4/look.c
151
return n;
usr.bin/m4/look.c
157
ndptr n = create_entry(name);
usr.bin/m4/look.c
158
if (n->d != NULL) {
usr.bin/m4/look.c
159
if (n->d->defn != null)
usr.bin/m4/look.c
160
free(n->d->defn);
usr.bin/m4/look.c
162
n->d = xalloc(sizeof(struct macro_definition), NULL);
usr.bin/m4/look.c
163
n->d->next = NULL;
usr.bin/m4/look.c
165
setup_definition(n->d, defn, name);
usr.bin/m4/look.c
171
ndptr n;
usr.bin/m4/look.c
174
n = create_entry(name);
usr.bin/m4/look.c
176
d->next = n->d;
usr.bin/m4/look.c
177
n->d = d;
usr.bin/m4/look.c
178
setup_definition(n->d, defn, name);
usr.bin/m4/look.c
184
ndptr n = lookup(name);
usr.bin/m4/look.c
185
if (n != NULL) {
usr.bin/m4/look.c
188
for (r = n->d; r != NULL; r = r2) {
usr.bin/m4/look.c
194
n->d = NULL;
usr.bin/m4/look.c
201
ndptr n = lookup(name);
usr.bin/m4/look.c
203
if (n != NULL) {
usr.bin/m4/look.c
204
struct macro_definition *r = n->d;
usr.bin/m4/look.c
206
n->d = r->next;
usr.bin/m4/look.c
217
ndptr n;
usr.bin/m4/look.c
220
for (n = ohash_first(¯os, &i); n != NULL;
usr.bin/m4/look.c
221
n = ohash_next(¯os, &i))
usr.bin/m4/look.c
222
if (n->d != NULL)
usr.bin/m4/look.c
223
f(n->name, n->d);
usr.bin/m4/look.c
229
ndptr n;
usr.bin/m4/look.c
239
n = create_entry(name2);
usr.bin/m4/look.c
240
n->builtin_type = type;
usr.bin/m4/look.c
241
n->d = xalloc(sizeof(struct macro_definition), NULL);
usr.bin/m4/look.c
242
n->d->defn = name2;
usr.bin/m4/look.c
243
n->d->type = type;
usr.bin/m4/look.c
244
n->d->next = NULL;
usr.bin/m4/main.c
164
int n;
usr.bin/m4/main.c
272
for (n = 1; n < maxout; n++) { /* default wrap-up: undivert */
usr.bin/m4/main.c
273
if (outfile[n] != NULL)
usr.bin/m4/main.c
274
getdiv(n);
usr.bin/m4/manual_tokenizer.c
1572
yy_size_t n;
usr.bin/m4/manual_tokenizer.c
1576
n = _yybytes_len + 2;
usr.bin/m4/manual_tokenizer.c
1577
buf = (char *) yyalloc(n );
usr.bin/m4/manual_tokenizer.c
1586
b = yy_scan_buffer(buf,n );
usr.bin/m4/manual_tokenizer.c
1611
#define yyless(n) \
usr.bin/m4/manual_tokenizer.c
1615
int yyless_macro_arg = (n); \
usr.bin/m4/manual_tokenizer.c
169
#define YY_LESS_LINENO(n)
usr.bin/m4/manual_tokenizer.c
172
#define yyless(n) \
usr.bin/m4/manual_tokenizer.c
176
int yyless_macro_arg = (n); \
usr.bin/m4/manual_tokenizer.c
1760
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
usr.bin/m4/manual_tokenizer.c
1763
for ( i = 0; i < n; ++i )
usr.bin/m4/manual_tokenizer.c
1771
register int n;
usr.bin/m4/manual_tokenizer.c
1772
for ( n = 0; s[n]; ++n )
usr.bin/m4/manual_tokenizer.c
1775
return n;
usr.bin/m4/manual_tokenizer.c
603
size_t n; \
usr.bin/m4/manual_tokenizer.c
604
for ( n = 0; n < max_size && \
usr.bin/m4/manual_tokenizer.c
605
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
usr.bin/m4/manual_tokenizer.c
606
buf[n] = (char) c; \
usr.bin/m4/manual_tokenizer.c
608
buf[n++] = (char) c; \
usr.bin/m4/manual_tokenizer.c
611
result = n; \
usr.bin/m4/misc.c
101
size_t n;
usr.bin/m4/misc.c
103
n = strlen(s);
usr.bin/m4/misc.c
104
while (endpbb - bp <= (long)n)
usr.bin/m4/misc.c
106
while (n > 0)
usr.bin/m4/misc.c
107
*bp++ = s[--n];
usr.bin/m4/misc.c
114
pbnum(int n)
usr.bin/m4/misc.c
116
pbnumbase(n, 10, 0);
usr.bin/m4/misc.c
120
pbnumbase(int n, int base, int d)
usr.bin/m4/misc.c
132
num = (n < 0) ? -n : n;
usr.bin/m4/misc.c
139
if (n < 0)
usr.bin/m4/misc.c
144
if (n < 0)
usr.bin/m4/misc.c
152
pbunsigned(unsigned long n)
usr.bin/m4/misc.c
155
pushback(n % 10 + '0');
usr.bin/m4/misc.c
157
while ((n /= 10) > 0);
usr.bin/m4/misc.c
228
getdiv(int n)
usr.bin/m4/misc.c
232
if (active == outfile[n])
usr.bin/m4/misc.c
234
rewind(outfile[n]);
usr.bin/m4/misc.c
235
while ((c = getc(outfile[n])) != EOF)
usr.bin/m4/misc.c
237
fclose(outfile[n]);
usr.bin/m4/misc.c
238
outfile[n] = NULL;
usr.bin/m4/misc.c
255
int n;
usr.bin/m4/misc.c
257
for (n = 0; n < maxout; n++)
usr.bin/m4/misc.c
258
if (outfile[n] != NULL) {
usr.bin/m4/misc.c
259
fclose(outfile[n]);
usr.bin/m4/misc.c
284
resizedivs(int n)
usr.bin/m4/misc.c
288
outfile = (FILE **)xrealloc(outfile, sizeof(FILE *) * n,
usr.bin/m4/misc.c
289
"too many diverts %d", n);
usr.bin/m4/misc.c
290
for (i = maxout; i < n; i++)
usr.bin/m4/misc.c
292
maxout = n;
usr.bin/m4/misc.c
296
xalloc(size_t n, const char *fmt, ...)
usr.bin/m4/misc.c
298
void *p = malloc(n);
usr.bin/m4/misc.c
315
xrealloc(void *old, size_t n, const char *fmt, ...)
usr.bin/m4/misc.c
317
char *p = realloc(old, n);
usr.bin/m4/stdd.h
53
#define STREQN(a, b, n) ((a)[0] == (b)[0] && strncmp(a, b, n) == 0)
usr.bin/mail/cmd1.c
54
int n, mesg, flag, size;
usr.bin/mail/cmd1.c
58
n = msgvec[0];
usr.bin/mail/cmd1.c
59
if (n != 0)
usr.bin/mail/cmd1.c
60
screen = (n-1)/size;
usr.bin/mail/cmd1.c
70
if (dot != &message[n-1])
usr.bin/mail/cmd2.c
387
clob1(int n)
usr.bin/mail/cmd2.c
392
if (n <= 0)
usr.bin/mail/cmd2.c
396
clob1(n - 1);
usr.bin/mail/cmd3.c
100
if (n < strlen(lastbang)) {
usr.bin/mail/cmd3.c
110
n -= strlen(lastbang);
usr.bin/mail/cmd3.c
115
if (--n <= 1)
usr.bin/mail/cmd3.c
121
if (--n <= 1)
usr.bin/mail/cmd3.c
93
int n, changed = 0;
usr.bin/mail/cmd3.c
97
n = sizeof(bangbuf);
usr.bin/mail/fio.c
183
int n;
usr.bin/mail/fio.c
188
n = strlen(linebuf);
usr.bin/mail/fio.c
189
if (n > 0 && linebuf[n - 1] == '\n')
usr.bin/mail/fio.c
190
linebuf[--n] = '\0';
usr.bin/mail/fio.c
191
if (n > 0 && linebuf[n - 1] == '\r')
usr.bin/mail/fio.c
192
linebuf[--n] = '\0';
usr.bin/mail/fio.c
193
return (n);
usr.bin/mail/lex.c
197
int n, eofloop = 0;
usr.bin/mail/lex.c
227
n = 0;
usr.bin/mail/lex.c
229
if (readline(input, &linebuf[n], LINESIZE - n) < 0) {
usr.bin/mail/lex.c
230
if (n == 0)
usr.bin/mail/lex.c
231
n = -1;
usr.bin/mail/lex.c
234
if ((n = strlen(linebuf)) == 0)
usr.bin/mail/lex.c
236
n--;
usr.bin/mail/lex.c
237
if (linebuf[n] != '\\')
usr.bin/mail/lex.c
239
linebuf[n++] = ' ';
usr.bin/mail/lex.c
242
if (n < 0) {
usr.bin/mail/lex.c
609
int u, n, mdot, d, s;
usr.bin/mail/lex.c
624
for (mp = &message[0], n = 0, u = 0; mp < &message[msgCount]; mp++) {
usr.bin/mail/lex.c
626
n++;
usr.bin/mail/lex.c
648
if (n > 0)
usr.bin/mail/lex.c
649
printf(" %d new", n);
usr.bin/mail/lex.c
650
if (u-n > 0)
usr.bin/mail/names.c
204
int n;
usr.bin/mail/names.c
239
n = 0;
usr.bin/mail/names.c
253
n++;
usr.bin/mail/names.c
259
while (n >= 0) {
usr.bin/mail/names.c
261
n--;
usr.bin/mail/names.c
550
struct name *n;
usr.bin/mail/names.c
553
n = np;
usr.bin/mail/names.c
554
if ((t = count(n)) == 0)
usr.bin/mail/names.c
578
for (; n != NULL; n = n->n_flink)
usr.bin/mail/names.c
579
if ((n->n_type & GDEL) == 0)
usr.bin/mail/names.c
580
*ap++ = n->n_name;
usr.bin/ministat/ministat.c
142
unsigned n;
usr.bin/ministat/ministat.c
161
if (ds->n >= ds->lpoints) {
usr.bin/ministat/ministat.c
165
memcpy(ds->points, dp, sizeof *dp * ds->n);
usr.bin/ministat/ministat.c
168
ds->points[ds->n++] = a;
usr.bin/ministat/ministat.c
184
return (ds->points[ds->n - 1]);
usr.bin/ministat/ministat.c
191
return(ds->sy / ds->n);
usr.bin/ministat/ministat.c
197
if ((ds->n % 2) == 0)
usr.bin/ministat/ministat.c
198
return ((ds->points[ds->n / 2] + (ds->points[(ds->n / 2) - 1])) / 2);
usr.bin/ministat/ministat.c
200
return (ds->points[ds->n / 2]);
usr.bin/ministat/ministat.c
211
if (ds->syy <= ds->sy * ds->sy / ds->n)
usr.bin/ministat/ministat.c
213
return (ds->syy - ds->sy * ds->sy / ds->n) / (ds->n - 1.0);
usr.bin/ministat/ministat.c
235
ds->n, Min(ds), Max(ds), Median(ds), Avg(ds), Stddev(ds));
usr.bin/ministat/ministat.c
246
i = ds->n + rs->n - 2;
usr.bin/ministat/ministat.c
251
spool = (ds->n - 1) * Var(ds) + (rs->n - 1) * Var(rs);
usr.bin/ministat/ministat.c
252
spool /= ds->n + rs->n - 2;
usr.bin/ministat/ministat.c
254
s = spool * sqrt(1.0 / ds->n + 1.0 / rs->n);
usr.bin/ministat/ministat.c
258
re = (ds->n - 1) * Var(ds) + (rs->n - 1) * Var(rs) *
usr.bin/ministat/ministat.c
260
re *= (ds->n + rs->n) / (ds->n * rs->n * (ds->n + rs->n - 2.0));
usr.bin/ministat/ministat.c
335
unsigned n;
usr.bin/ministat/ministat.c
357
for (n = 0; n < ds->n; n++) {
usr.bin/ministat/ministat.c
358
x = (ds->points[n] - pl->x0) / pl->dx;
usr.bin/ministat/ministat.c
376
for (n = 0; n < ds->n; n++) {
usr.bin/ministat/ministat.c
377
x = (ds->points[n] - pl->x0) / pl->dx;
usr.bin/ministat/ministat.c
465
ReadSet(FILE *f, const char *n, int column, const char *delim)
usr.bin/ministat/ministat.c
474
s->name = strdup(n);
usr.bin/ministat/ministat.c
493
errx(2, "Invalid data on line %d in %s", line, n);
usr.bin/ministat/ministat.c
497
if (s->n < 3) {
usr.bin/ministat/ministat.c
499
"Dataset %s must contain at least 3 data points\n", n);
usr.bin/ministat/ministat.c
502
qsort(s->points, s->n, sizeof *s->points, dbl_cmp);
usr.bin/mkcsmapper/yacc.y
557
u_int32_t m, n;
usr.bin/mkcsmapper/yacc.y
563
n = end & ~rowcol_mask;
usr.bin/mkcsmapper/yacc.y
564
if (m != n)
usr.bin/mkcsmapper/yacc.y
574
n = end & rowcol_mask;
usr.bin/mkcsmapper/yacc.y
576
if (n < p->begin || n > p->end)
usr.bin/mkcsmapper/yacc.y
587
u_int32_t n;
usr.bin/mkcsmapper/yacc.y
592
n = ((lz->begin >> i) & rowcol_mask) - p->begin;
usr.bin/mkcsmapper/yacc.y
593
ofs = (ofs * p->width) + n;
usr.bin/mkcsmapper/yacc.y
595
n = lz->width;
usr.bin/mkcsmapper/yacc.y
596
while (n-- > 0) {
usr.bin/monitor/monitor.c
123
int n;
usr.bin/monitor/monitor.c
137
n = kevent(KQueueFd, &kev, 1, NULL, 0, NULL);
usr.bin/monitor/monitor.c
138
if (n < 0) {
usr.bin/monitor/monitor.c
162
int n;
usr.bin/monitor/monitor.c
164
n = kevent(KQueueFd, NULL, 0, kev_array, 1, NULL);
usr.bin/monitor/monitor.c
165
for (i = 0; i < n; ++i) {
usr.bin/msgs/msgs.c
717
int n, cmsg, fd;
usr.bin/msgs/msgs.c
725
if ((n = strlen(inbuf)) > 0 && inbuf[n - 1] == '\n')
usr.bin/msgs/msgs.c
726
inbuf[n - 1] = '\0';
usr.bin/msgs/msgs.c
754
for (n=0; in[n] > ' '; n++) { /* sizeof fname? */
usr.bin/msgs/msgs.c
755
fname[n] = in[n];
usr.bin/msgs/msgs.c
757
fname[n] = '\0';
usr.bin/msgs/msgs.c
782
while ((n = fread(inbuf, 1, sizeof inbuf, cpfrom)))
usr.bin/msgs/msgs.c
783
fwrite(inbuf, 1, n, cpto);
usr.bin/ncal/ncal.c
530
int n; /* number of lines to print */
usr.bin/ncal/ncal.c
537
n = sizeof(switches) / sizeof(struct djswitch);
usr.bin/ncal/ncal.c
538
m = (n + 1) / 2;
usr.bin/ncal/ncal.c
539
n /= 2;
usr.bin/ncal/ncal.c
540
for (p = switches; p != switches + n; p++)
usr.bin/ncal/ncal.c
542
if (m != n)
usr.bin/netstat/if.c
175
int n, m, cpu;
usr.bin/netstat/if.c
342
n = sdl->sdl_alen;
usr.bin/netstat/if.c
351
n = cp - sa->sa_data + 1;
usr.bin/netstat/if.c
354
while (--n >= 0)
usr.bin/netstat/if.c
356
n > 0 ? ':' : ' ');
usr.bin/netstat/main.c
216
int n;
usr.bin/netstat/main.c
241
nsz = sizeof(n);
usr.bin/netstat/main.c
242
sysctlbyname("net.netisr.ncpus", &n, &nsz, NULL, 0);
usr.bin/netstat/main.c
244
if (cpuflag < 0 || cpuflag >= n) {
usr.bin/netstat/main.c
548
plural(int n)
usr.bin/netstat/main.c
550
return (n != 1 ? "s" : "");
usr.bin/netstat/main.c
554
plurales(int n)
usr.bin/netstat/main.c
556
return (n != 1 ? "es" : "");
usr.bin/netstat/mbuf.c
112
for (n = 1; n < ncpus; ++n) {
usr.bin/netstat/mbuf.c
113
mbstat[0].m_mbufs += mbstat[n].m_mbufs;
usr.bin/netstat/mbuf.c
114
mbstat[0].m_clusters += mbstat[n].m_clusters;
usr.bin/netstat/mbuf.c
115
mbstat[0].m_drops += mbstat[n].m_drops;
usr.bin/netstat/mbuf.c
116
mbstat[0].m_wait += mbstat[n].m_wait;
usr.bin/netstat/mbuf.c
117
mbstat[0].m_drain += mbstat[n].m_drain;
usr.bin/netstat/mbuf.c
120
mbtypes[i] += mbtypes[n * nmbtypes + i];
usr.bin/netstat/mbuf.c
74
int n;
usr.bin/newkey/generic.c
72
BIGNUM *n = NULL;
usr.bin/newkey/generic.c
74
if ((n = BN_new()) == NULL)
usr.bin/newkey/generic.c
77
BN_init(n);
usr.bin/newkey/generic.c
79
BN_add_word(n, (u_long)i);
usr.bin/newkey/generic.c
81
BN_sub_word(n, (u_long)(-i));
usr.bin/newkey/generic.c
82
return(n);
usr.bin/patch/pch.c
1263
LINENUM n;
usr.bin/patch/pch.c
1299
n = p_end - i + 1;
usr.bin/patch/pch.c
1301
n = -i;
usr.bin/patch/pch.c
1302
p_efake += n;
usr.bin/patch/pch.c
1303
p_bfake += n;
usr.bin/patch/pch.c
1305
for (n = 0; i <= p_end; i++, n++) {
usr.bin/patch/pch.c
1306
p_line[n] = tp_line[i];
usr.bin/patch/pch.c
1307
p_char[n] = tp_char[i];
usr.bin/patch/pch.c
1308
if (p_char[n] == '+')
usr.bin/patch/pch.c
1309
p_char[n] = '-';
usr.bin/patch/pch.c
1310
p_len[n] = tp_len[i];
usr.bin/patch/pch.c
1314
p_line[n] = tp_line[i];
usr.bin/patch/pch.c
1315
p_char[n] = tp_char[i];
usr.bin/patch/pch.c
1316
p_len[n] = tp_len[i];
usr.bin/patch/pch.c
1317
n++;
usr.bin/patch/pch.c
1336
for (i = 0; n <= p_end; i++, n++) {
usr.bin/patch/pch.c
1337
p_line[n] = tp_line[i];
usr.bin/patch/pch.c
1338
p_char[n] = tp_char[i];
usr.bin/patch/pch.c
1339
if (p_char[n] == '-')
usr.bin/patch/pch.c
1340
p_char[n] = '+';
usr.bin/patch/pch.c
1341
p_len[n] = tp_len[i];
usr.bin/patch/pch.c
1623
size_t n;
usr.bin/patch/pch.c
1626
for (n = 0, cp = path; (cp = strchr(cp, '/')) != NULL; n++, cp++) {
usr.bin/patch/pch.c
1630
return n;
usr.bin/pwait/pwait.c
122
n = kevent(kq, NULL, 0, e, nleft, NULL);
usr.bin/pwait/pwait.c
123
if (n == -1)
usr.bin/pwait/pwait.c
126
for (i = 0; i < n; i++) {
usr.bin/pwait/pwait.c
140
nleft -= n;
usr.bin/pwait/pwait.c
68
int opt, nleft, n, i, duplicate, status;
usr.bin/pwait/pwait.c
97
for (n = 0; n < argc; n++) {
usr.bin/pwait/pwait.c
98
s = argv[n];
usr.bin/rfcomm_sppd/rfcomm_sppd.c
128
int lm, n, rfcomm, tty_in, tty_out;
usr.bin/rfcomm_sppd/rfcomm_sppd.c
139
while ((n = getopt(argc, argv, "a:c:d:hm:s:t:")) != -1) {
usr.bin/rfcomm_sppd/rfcomm_sppd.c
140
switch (n) {
usr.bin/rfcomm_sppd/rfcomm_sppd.c
256
n = max(tty_in, rfcomm) + 1;
usr.bin/rfcomm_sppd/rfcomm_sppd.c
262
if (select(n, &rdset, NULL, NULL, NULL) < 0) {
usr.bin/rfcomm_sppd/rfcomm_sppd.c
398
int sv, fd, n;
usr.bin/rfcomm_sppd/rfcomm_sppd.c
422
for (n = 0 ; ; n++) {
usr.bin/rfcomm_sppd/rfcomm_sppd.c
423
if (services[n].name == NULL)
usr.bin/rfcomm_sppd/rfcomm_sppd.c
426
if (strcasecmp(services[n].name, service) == 0)
usr.bin/rfcomm_sppd/rfcomm_sppd.c
437
if (sdp_register_service(ss, services[n].class, laddr,
usr.bin/rfcomm_sppd/rfcomm_sppd.c
438
pdu, services[n].pdulen, NULL) != 0) {
usr.bin/rpcinfo/rpcinfo.c
830
int n;
usr.bin/rpcinfo/rpcinfo.c
835
n = snprintf(p, end - p, "%d%s", vl->vers,
usr.bin/rpcinfo/rpcinfo.c
837
if (n < 0 || n + p >= end)
usr.bin/rpcinfo/rpcinfo.c
839
p += n;
usr.bin/rpcinfo/rpcinfo.c
846
n = snprintf(p, end - p, "%s%s", nl->netid,
usr.bin/rpcinfo/rpcinfo.c
848
if (n < 0 || n + p >= end)
usr.bin/rpcinfo/rpcinfo.c
850
p += n;
usr.bin/rs/rs.c
206
int n;
usr.bin/rs/rs.c
211
n = (flags & ONEOSEPONLY ? 1 : colwidths[col] - (p - s));
usr.bin/rs/rs.c
213
while (n-- > 0)
usr.bin/rs/rs.c
217
while (n-- > 0)
usr.bin/rs/rs.c
238
int n;
usr.bin/rs/rs.c
281
if ((n = strlen(*ep++)) > max)
usr.bin/rs/rs.c
282
max = n;
usr.bin/rs/rs.c
289
if ((n = strlen(ep[j])) > max)
usr.bin/rs/rs.c
290
max = n;
usr.bin/rs/rs.c
314
n = orows * ocols;
usr.bin/rs/rs.c
315
if (n > nelem && (flags & RECYCLE))
usr.bin/rs/rs.c
316
nelem = n;
usr.bin/rwho/rwho.c
122
for (n = cc / sizeof (struct whoent); n > 0; n--) {
usr.bin/rwho/rwho.c
75
int f, n, i, ch;
usr.bin/script/script.c
218
n = select(master + 1, &rfd, 0, 0, tvp);
usr.bin/script/script.c
219
if (n < 0 && errno != EINTR)
usr.bin/script/script.c
221
if (n > 0 && FD_ISSET(STDIN_FILENO, &rfd)) {
usr.bin/script/script.c
242
if (n > 0 && FD_ISSET(master, &rfd)) {
usr.bin/script/script.c
93
int aflg, Fflg, kflg, pflg, ch, k, n;
usr.bin/sdiff/sdiff.c
714
size_t file1start, file1end, file2start, file2end, n;
usr.bin/sdiff/sdiff.c
863
n = file2end - file2start + 1;
usr.bin/sdiff/sdiff.c
867
n = file1end - file1start + 1 + 1 + file2end - file2start + 1;
usr.bin/sdiff/sdiff.c
871
n = file1end - file1start + 1;
usr.bin/sdiff/sdiff.c
879
while (n--) {
usr.bin/sdpquery/search.c
568
uint32_t n;
usr.bin/sdpquery/search.c
588
for (n = 0; n < values_len; n ++) {
usr.bin/sdpquery/search.c
589
values[n].flags = SDP_ATTR_INVALID;
usr.bin/sdpquery/search.c
590
values[n].attr = 0;
usr.bin/sdpquery/search.c
591
values[n].vlen = BSIZE;
usr.bin/sdpquery/search.c
592
values[n].value = buffer[n];
usr.bin/sdpquery/search.c
604
n = sdp_search(xs, 1, &service, attrs_len, attrs, values_len, values);
usr.bin/sdpquery/search.c
605
if (n != 0)
usr.bin/sdpquery/search.c
611
for (n = 0; n < values_len; n ++) {
usr.bin/sdpquery/search.c
612
if (values[n].flags != SDP_ATTR_OK)
usr.bin/sdpquery/search.c
615
switch (values[n].attr) {
usr.bin/sdpquery/search.c
618
if (values[n].vlen == 5) {
usr.bin/sdpquery/search.c
619
SDP_GET8(type, values[n].value);
usr.bin/sdpquery/search.c
621
SDP_GET32(value, values[n].value);
usr.bin/sdpquery/search.c
631
values[n].vlen);
usr.bin/sdpquery/search.c
636
print_service_class_id_list(values[n].value,
usr.bin/sdpquery/search.c
637
values[n].value + values[n].vlen);
usr.bin/sdpquery/search.c
642
print_protocol_descriptor_list(values[n].value,
usr.bin/sdpquery/search.c
643
values[n].value + values[n].vlen);
usr.bin/sdpquery/search.c
648
print_bluetooth_profile_descriptor_list(values[n].value,
usr.bin/sdpquery/search.c
649
values[n].value + values[n].vlen);
usr.bin/sdpquery/search.c
654
values[n].attr);
usr.bin/sed/compile.c
622
#define ADVANCE_N(s, n) \
usr.bin/sed/compile.c
625
while (*(adv + (n) - 1) != '\0') { \
usr.bin/sed/compile.c
626
*adv = *(adv + (n)); \
usr.bin/sed/compile.c
677
s->n = 1; /* Default */
usr.bin/sed/compile.c
690
s->n = 0;
usr.bin/sed/compile.c
715
s->n = nval;
usr.bin/sed/defs.h
64
int n; /* Occurrence to subst. */
usr.bin/sed/main.c
218
cu_fgets(char *buf, int n, int *more)
usr.bin/sed/main.c
261
if ((p = fgets(buf, n, f)) != NULL) {
usr.bin/sed/main.c
278
if (n-- <= 1) {
usr.bin/sed/process.c
389
int lastempty, n;
usr.bin/sed/process.c
407
n = cp->u.s->n;
usr.bin/sed/process.c
412
if (n <= 1 && (match[0].rm_so > le))
usr.bin/sed/process.c
418
if (n <= 1) {
usr.bin/sed/process.c
421
if (n == 1)
usr.bin/sed/process.c
422
n = -1;
usr.bin/sed/process.c
428
n--;
usr.bin/sed/process.c
454
} while (n >= 0 && slen >= 0 &&
usr.bin/sed/process.c
458
if (n > 0)
usr.bin/sockstat/sockstat.c
368
int n;
usr.bin/sockstat/sockstat.c
373
n = xprintf("%s%c", protoname, af == AF_INET ? '4' : '6');
usr.bin/sockstat/sockstat.c
376
n = xprintf("%s", protoname);
usr.bin/sockstat/sockstat.c
380
if (width > 0 && width > n)
usr.bin/sockstat/sockstat.c
381
xprintf("%*s", width - n, "");
usr.bin/sockstat/sockstat.c
390
int port, n;
usr.bin/sockstat/sockstat.c
394
n = sun->sun_len - offsetof(struct sockaddr_un, sun_path);
usr.bin/sockstat/sockstat.c
395
xprintf("%.*s", n, sun->sun_path);
usr.bin/sockstat/sockstat.c
396
if (width > 0 && width > n)
usr.bin/sockstat/sockstat.c
397
xprintf("%*s", width - n, "");
usr.bin/sockstat/sockstat.c
421
n = xprintf("%s:*", addrstr);
usr.bin/sockstat/sockstat.c
423
n = xprintf("%s:%d", addrstr, port);
usr.bin/sockstat/sockstat.c
424
if (width > 0 && width > n)
usr.bin/sockstat/sockstat.c
425
xprintf("%*s", width - n, "");
usr.bin/sockstat/sockstat.c
478
int hash, n;
usr.bin/sockstat/sockstat.c
484
for (xf = xfiles, n = 0; n < (int)nxfiles; ++n, ++xf) {
usr.bin/sort/bwstring.c
278
size_t n = MB_CUR_MAX;
usr.bin/sort/bwstring.c
280
if (n > len - cptr)
usr.bin/sort/bwstring.c
281
n = len - cptr;
usr.bin/sort/bwstring.c
282
charlen = mbrlen(s + cptr, n, &mbs);
usr.bin/sort/bwstring.c
294
n = mbrtowc(ret->data.wstr + (chars++),
usr.bin/sort/bwstring.c
296
if ((n == (size_t)-1) || (n == (size_t)-2))
usr.bin/sort/file.c
1467
merge_sub_lists(struct sort_list **sl, size_t n, FILE* f_out)
usr.bin/sort/file.c
1475
for (i = 0; i < n; i++)
usr.bin/sort/file.c
1484
sub_list_sink(sl, 0, n);
usr.bin/sort/file.c
1492
merge_list_parts(struct sort_list **parts, size_t n, const char *fn)
usr.bin/sort/file.c
1498
merge_sub_lists(parts, n, f_out);
usr.bin/sort/radixsort.c
100
sort_left_dec(size_t n)
usr.bin/sort/radixsort.c
103
sort_left -= n;
usr.bin/sort/radixsort.c
127
#define sort_left_dec(n)
usr.bin/sort/radixsort.c
453
size_t n;
usr.bin/sort/radixsort.c
458
n = sln - i - 1;
usr.bin/sort/radixsort.c
459
slc = sl->sublevels[n];
usr.bin/sort/radixsort.c
469
sl->sublevels[n] = NULL;
usr.bin/sort/radixsort.c
584
size_t n;
usr.bin/sort/radixsort.c
588
n = sl->sln - i - 1;
usr.bin/sort/radixsort.c
589
slc = sl->sublevels[n];
usr.bin/sort/radixsort.c
596
sl->sublevels[n] = NULL;
usr.bin/sort/sort.h
47
#define getstr(n) nlsstr[n]
usr.bin/sort/sort.h
52
#define getstr(n) catgets(catalog, 1, n, nlsstr[n])
usr.bin/su/su.c
597
size_t n;
usr.bin/su/su.c
604
n = strlen(*pp);
usr.bin/su/su.c
605
if (s[n] == '=' && strncmp(s, *pp, n) == 0)
usr.bin/systat/altqs.c
114
#define IFSTAT_ERR(n, s) do { \
usr.bin/systat/altqs.c
117
err((n), (s)); \
usr.bin/systat/altqs.c
128
u_int n = 0, i = 0;
usr.bin/systat/altqs.c
132
n = getifnum(); /* NOTE: can return < 0 */
usr.bin/systat/altqs.c
136
for (i = 0; i < n; i++) {
usr.bin/systat/altqs.c
411
int n;
usr.bin/systat/altqs.c
418
n = pa.nr;
usr.bin/systat/altqs.c
419
for (i = 0; i < n; ++i) {
usr.bin/systat/ifstat.c
155
u_int n = 0, i = 0;
usr.bin/systat/ifstat.c
157
n = getifnum(); /* NOTE: can return < 0 */
usr.bin/systat/ifstat.c
160
for (i = 0; i < n; i++) {
usr.bin/systat/ifstat.c
91
#define IFSTAT_ERR(n, s) do { \
usr.bin/systat/ifstat.c
94
err((n), (s)); \
usr.bin/systat/main.c
280
int i, n;
usr.bin/systat/main.c
282
n = 0;
usr.bin/systat/main.c
288
mvprintw(2 + ++n, 10, "%s", n_list[i].n_name);
usr.bin/systat/pftop.c
300
size_t n;
usr.bin/systat/pftop.c
318
n = 1024;
usr.bin/systat/pftop.c
319
array = malloc(n * sizeof(*array));
usr.bin/systat/pftop.c
330
if (i == n) {
usr.bin/systat/pftop.c
331
n *= 2;
usr.bin/systat/pftop.c
332
array = realloc(array, n * sizeof(*array));
usr.bin/systat/pftop.c
346
n = i;
usr.bin/systat/pftop.c
347
for (i = 0; i < n; ++i) {
usr.bin/systat/vmmeter.c
119
int i, n;
usr.bin/systat/vmmeter.c
130
n = X_START + CPU_LABEL_W;
usr.bin/systat/vmmeter.c
132
DRAW_ROW(n, CPU_START + i, 6, "%*u", D(i, v_timer));
usr.bin/systat/vmmeter.c
133
DRAW_ROW(n, CPU_START + i, 8, "%*u", D(i, v_ipi));
usr.bin/systat/vmmeter.c
134
DRAW_ROW(n, CPU_START + i, 8, "%*u", D(i, v_intr));
usr.bin/systat/vmmeter.c
145
DRAW_ROW(n, CPU_START + i, 6, "%*.1f",
usr.bin/systat/vmmeter.c
147
DRAW_ROW(n, CPU_START + i, 6, "%*.1f", CPUV(d, sys));
usr.bin/systat/vmmeter.c
148
DRAW_ROW(n, CPU_START + i, 6, "%*.1f", CPUV(d, intr));
usr.bin/systat/vmmeter.c
149
DRAW_ROW(n, CPU_START + i, 6, "%*.1f", CPUV(d, idle));
usr.bin/systat/vmmeter.c
156
DRAW_ROW(n, CPU_START + i, 8, "%*u", 9999999);
usr.bin/systat/vmmeter.c
158
DRAW_ROW(n, CPU_START + i, 8, "%*u",
usr.bin/systat/vmmeter.c
162
DRAW_ROW2(n, CPU_START + i, (WideMode ? 24 : 16),
usr.bin/systat/vmmeter.c
165
DRAW_ROW2(n, CPU_START + i, 17, "%*.*s", "");
usr.bin/systat/vmmeter.c
167
DRAW_ROW2(n, CPU_START + i, (WideMode ? 24 : 16),
usr.bin/systat/vmmeter.c
171
DRAW_ROWX(n, CPU_START + i, 17,
usr.bin/systat/vmmeter.c
182
DRAW_ROW2(n, CPU_START + i, 30, "%*.*s",
usr.bin/systat/vmmeter.c
193
n = X_START + CPU_LABEL_W;
usr.bin/systat/vmmeter.c
194
DRAW_ROW(n, TOT_START, 6, "%*u", DTOT(v_timer)); /* timer */
usr.bin/systat/vmmeter.c
195
DRAW_ROW(n, TOT_START, 8, "%*u", DTOT(v_ipi)); /* ipi */
usr.bin/systat/vmmeter.c
196
DRAW_ROW(n, TOT_START, 8, "%*u", DTOT(v_intr)); /* extint */
usr.bin/systat/vmmeter.c
198
DRAW_ROW(n, TOT_START, 6, "%*.1f", CPUVTOT(user) + /* user */
usr.bin/systat/vmmeter.c
200
DRAW_ROW(n, TOT_START, 6, "%*.1f", CPUVTOT(sys)); /* sys */
usr.bin/systat/vmmeter.c
201
DRAW_ROW(n, TOT_START, 6, "%*.1f", CPUVTOT(intr)); /* intr */
usr.bin/systat/vmmeter.c
202
DRAW_ROW(n, TOT_START, 6, "%*.1f", CPUVTOT(idle)); /* idle */
usr.bin/systat/vmmeter.c
204
DRAW_ROWX(n, TOT_START, 8, "%7u", DTOT(v_lock_colls));
usr.bin/systat/vmmeter.c
205
DRAW_ROWX(n, TOT_START, 0, " (%5.2f%% coltot)",
usr.bin/systat/vmmeter.c
224
int i, n;
usr.bin/systat/vmmeter.c
228
n = X_START + CPU_LABEL_W;
usr.bin/systat/vmmeter.c
230
DRAW_ROW(n, TOT_START - 1, 6, "%*s", "timer");
usr.bin/systat/vmmeter.c
231
DRAW_ROW(n, TOT_START - 1, 8, "%*s", "ipi");
usr.bin/systat/vmmeter.c
232
DRAW_ROW(n, TOT_START - 1, 8, "%*s", "extint");
usr.bin/systat/vmmeter.c
233
DRAW_ROW(n, TOT_START - 1, 6, "%*s", "user%");
usr.bin/systat/vmmeter.c
234
DRAW_ROW(n, TOT_START - 1, 6, "%*s", "sys%");
usr.bin/systat/vmmeter.c
235
DRAW_ROW(n, TOT_START - 1, 6, "%*s", "intr%");
usr.bin/systat/vmmeter.c
236
DRAW_ROW(n, TOT_START - 1, 6, "%*s", "idle%");
usr.bin/systat/vmmeter.c
237
DRAW_ROW(n, TOT_START - 1, 8, "%*s", "smpcol");
usr.bin/systat/vmmeter.c
238
DRAW_ROW(n, TOT_START - 1, (WideMode ? 24 : 16), "%*s", "contention");
usr.bin/systat/vmmeter.c
24
#define DRAW_ROW(n, y, w, fmt, args...) \
usr.bin/systat/vmmeter.c
240
DRAW_ROW(n, TOT_START - 1, 17, "%*s", "lockaddr");
usr.bin/systat/vmmeter.c
243
DRAW_ROW(n, TOT_START - 1, 30, "%*s", "sample_pc");
usr.bin/systat/vmmeter.c
246
n = X_START + CPU_LABEL_W;
usr.bin/systat/vmmeter.c
247
DRAW_ROW(n, TOT_START + 1, 6, "%*s", "-----");
usr.bin/systat/vmmeter.c
248
DRAW_ROW(n, TOT_START + 1, 8, "%*s", "-------");
usr.bin/systat/vmmeter.c
249
DRAW_ROW(n, TOT_START + 1, 8, "%*s", "-------");
usr.bin/systat/vmmeter.c
250
DRAW_ROW(n, TOT_START + 1, 6, "%*s", "-----");
usr.bin/systat/vmmeter.c
251
DRAW_ROW(n, TOT_START + 1, 6, "%*s", "-----");
usr.bin/systat/vmmeter.c
252
DRAW_ROW(n, TOT_START + 1, 6, "%*s", "-----");
usr.bin/systat/vmmeter.c
253
DRAW_ROW(n, TOT_START + 1, 6, "%*s", "-----");
usr.bin/systat/vmmeter.c
254
DRAW_ROW(n, TOT_START + 1, 8, "%*s", "-------");
usr.bin/systat/vmmeter.c
255
DRAW_ROW(n, TOT_START + 1, (WideMode ? 24 : 16),
usr.bin/systat/vmmeter.c
259
DRAW_ROW(n, TOT_START + 1, 17, "%*s", "---------------");
usr.bin/systat/vmmeter.c
26
mvprintw(y, n, fmt, w - 1, args); \
usr.bin/systat/vmmeter.c
261
DRAW_ROW(n, TOT_START + 1, 30,
usr.bin/systat/vmmeter.c
27
n += w; \
usr.bin/systat/vmmeter.c
270
n = X_START + CPU_LABEL_W;
usr.bin/systat/vmmeter.c
271
DRAW_ROW(n, TOT_STARTX - 1, 15, "%-*s", "contention");
usr.bin/systat/vmmeter.c
272
DRAW_ROW(n, TOT_STARTX - 1, 35, "%-*s", "function");
usr.bin/systat/vmmeter.c
30
#define DRAW_ROW2(n, y, w, fmt, args...) \
usr.bin/systat/vmmeter.c
32
mvprintw(y, n, fmt, w - 1, w - 1, args);\
usr.bin/systat/vmmeter.c
33
n += w; \
usr.bin/systat/vmmeter.c
36
#define DRAW_ROWX(n, y, w, fmt, args...) \
usr.bin/systat/vmmeter.c
38
mvprintw(y, n, fmt, args); \
usr.bin/systat/vmmeter.c
39
n += w; \
usr.bin/systat/vmstat.c
734
put64(intmax_t n, int l, int lc, int w, int type)
usr.bin/systat/vmstat.c
743
if (n == 0) {
usr.bin/systat/vmstat.c
749
snprintf(b, sizeof(b), "%*jd", w, n);
usr.bin/systat/vmstat.c
751
snprintf(b, sizeof(b), "%*jd%c", w - 1, n, type);
usr.bin/systat/vmstat.c
761
if (n < 0) {
usr.bin/systat/vmstat.c
762
n = -n;
usr.bin/systat/vmstat.c
768
for (d = 1; n / d >= 1000; d *= u) {
usr.bin/systat/vmstat.c
793
if (n / d >= 100)
usr.bin/systat/vmstat.c
795
else if (n / d >= 10)
usr.bin/systat/vmstat.c
801
n / d, n / (d / 1000) % 1000, type);
usr.bin/systat/vmstat.c
804
n / d, n / (d / 100) % 100, type);
usr.bin/systat/vmstat.c
807
n / d, n / (d / 10) % 10, type);
usr.bin/systat/vmstat.c
810
n / d, type);
usr.bin/tail/forward.c
274
int i, n;
usr.bin/tail/forward.c
282
n = 0;
usr.bin/tail/forward.c
295
EV_SET(&ev[n], fileno(file->fp), EVFILT_VNODE,
usr.bin/tail/forward.c
298
n++;
usr.bin/tail/forward.c
300
EV_SET(&ev[n], fileno(file->fp), EVFILT_READ,
usr.bin/tail/forward.c
302
n++;
usr.bin/tail/forward.c
305
if (kevent(kq, ev, n, NULL, 0, &ts) < 0)
usr.bin/tail/forward.c
315
int active, ev_change, i, n;
usr.bin/tail/forward.c
418
n = kevent(kq, NULL, 0, ev, 1,
usr.bin/tail/forward.c
420
if (n < 0 && errno != EINTR)
usr.bin/tail/forward.c
422
} while (n < 0);
usr.bin/tail/forward.c
423
if (n == 0) {
usr.bin/tail/misc.c
68
int n;
usr.bin/tail/misc.c
76
n = (mip->mapoff + mip->maplen) - startoff;
usr.bin/tail/misc.c
77
if (n > len)
usr.bin/tail/misc.c
78
n = len;
usr.bin/tail/misc.c
79
WR(mip->start + (startoff - mip->mapoff), n);
usr.bin/tail/misc.c
80
startoff += n;
usr.bin/tail/misc.c
81
len -= n;
usr.bin/tee/tee.c
102
n = rval;
usr.bin/tee/tee.c
105
if ((wval = write(p->fd, bp, n)) == -1) {
usr.bin/tee/tee.c
111
} while (n -= wval);
usr.bin/tee/tee.c
60
int n, fd, rval, wval, flags;
usr.bin/telnet/fdset.h
40
#define FD_SET(n, p) ((p)->fds_bits[0] |= (1<<(n)))
usr.bin/telnet/fdset.h
41
#define FD_CLR(n, p) ((p)->fds_bits[0] &= ~(1<<(n)))
usr.bin/telnet/fdset.h
42
#define FD_ISSET(n, p) ((p)->fds_bits[0] & (1<<(n)))
usr.bin/telnet/network.c
125
int n, n1;
usr.bin/telnet/network.c
131
if ((n1 = n = ring_full_consecutive(&netoring)) > 0) {
usr.bin/telnet/network.c
133
n = send(net, (char *)netoring.consume, n, 0); /* normal write */
usr.bin/telnet/network.c
143
n = send(net, (char *)netoring.consume, 1, MSG_OOB);/* URGENT data */
usr.bin/telnet/network.c
146
if (n < 0) {
usr.bin/telnet/network.c
155
n = 0;
usr.bin/telnet/network.c
157
if (netdata && n) {
usr.bin/telnet/network.c
158
Dump('>', netoring.consume, n);
usr.bin/telnet/network.c
160
if (n) {
usr.bin/telnet/network.c
161
ring_consumed(&netoring, n);
usr.bin/telnet/network.c
166
if ((n1 == n) && ring_full_consecutive(&netoring)) {
usr.bin/telnet/sys_bsd.c
128
TerminalWrite(char *buf, int n)
usr.bin/telnet/sys_bsd.c
130
return write(tout, buf, n);
usr.bin/telnet/sys_bsd.c
134
TerminalRead(char *buf, int n)
usr.bin/telnet/sys_bsd.c
136
return read(tin, buf, n);
usr.bin/telnet/telnet.c
528
int n;
usr.bin/telnet/telnet.c
544
for (n = 1, cp = buf; *cp && *cp != ':'; cp++) {
usr.bin/telnet/telnet.c
546
n++;
usr.bin/telnet/telnet.c
551
argv = (char **)malloc((n+3)*sizeof(char *));
usr.bin/telnet/telnet.c
560
n = 0;
usr.bin/telnet/telnet.c
571
if (n || (cp - cp2 > 41))
usr.bin/telnet/telnet.c
587
n = 0;
usr.bin/telnet/telnet.c
594
n = 1;
usr.bin/telnet/telnet.c
639
int n;
usr.bin/telnet/telnet.c
641
n = strlen(name) + 1;
usr.bin/telnet/telnet.c
643
if (strncasecmp(*ap, name, n) == 0)
usr.bin/telnet/terminal.c
116
int n, n0, n1;
usr.bin/telnet/terminal.c
119
if ((n1 = n = ring_full_consecutive(&ttyoring)) > 0) {
usr.bin/telnet/terminal.c
124
n = TerminalWrite(ttyoring.consume, n);
usr.bin/telnet/terminal.c
127
if (n > 0) {
usr.bin/telnet/terminal.c
128
if (termdata && n) {
usr.bin/telnet/terminal.c
129
Dump('>', ttyoring.consume, n);
usr.bin/telnet/terminal.c
136
if (n1 == n && n0 > n) {
usr.bin/telnet/terminal.c
137
n1 = n0 - n;
usr.bin/telnet/terminal.c
141
n += n1;
usr.bin/telnet/terminal.c
143
ring_consumed(&ttyoring, n);
usr.bin/telnet/terminal.c
145
if (n < 0)
usr.bin/telnet/terminal.c
147
if (n == n0) {
usr.bin/telnet/terminal.c
152
return n0 - n + 1;
usr.bin/tftp/main.c
325
int n;
usr.bin/tftp/main.c
342
for (n = 1; n < argc - 1; n++)
usr.bin/tftp/main.c
343
if (strchr(argv[n], ':')) {
usr.bin/tftp/main.c
377
for (n = 1; n < argc - 1; n++) {
usr.bin/tftp/main.c
378
strcpy(cp, tail(argv[n]));
usr.bin/tftp/main.c
379
fd = open(argv[n], O_RDONLY);
usr.bin/tftp/main.c
381
warn("%s", argv[n]);
usr.bin/tftp/main.c
386
argv[n], hostname, targ, mode);
usr.bin/tftp/main.c
405
int n;
usr.bin/tftp/main.c
422
for (n = 1; n < argc ; n++)
usr.bin/tftp/main.c
423
if (strrchr(argv[n], ':') == 0) {
usr.bin/tftp/main.c
428
for (n = 1; n < argc ; n++) {
usr.bin/tftp/main.c
429
src = strrchr(argv[n], ':');
usr.bin/tftp/main.c
431
src = argv[n];
usr.bin/tftp/main.c
434
cp = argv[n];
usr.bin/tftp/tftp.c
129
n = sendto(f, dp, size + 4, 0,
usr.bin/tftp/tftp.c
131
if (n != size + 4) {
usr.bin/tftp/tftp.c
140
n = recvfrom(f, ackbuf, sizeof(ackbuf), 0,
usr.bin/tftp/tftp.c
142
} while (n <= 0);
usr.bin/tftp/tftp.c
144
if (n < 0) {
usr.bin/tftp/tftp.c
157
tpacket("received", ap, n);
usr.bin/tftp/tftp.c
205
int n;
usr.bin/tftp/tftp.c
254
n = recvfrom(f, dp, PKTSIZE, 0,
usr.bin/tftp/tftp.c
256
} while (n <= 0);
usr.bin/tftp/tftp.c
258
if (n < 0) {
usr.bin/tftp/tftp.c
271
tpacket("received", dp, n);
usr.bin/tftp/tftp.c
300
size = writeit(file, &dp, n - 4, convert);
usr.bin/tftp/tftp.c
382
tpacket(const char *s, struct tftphdr *tp, int n)
usr.bin/tftp/tftp.c
397
n -= 2;
usr.bin/tftp/tftp.c
404
printf("<block=%d, %d bytes>\n", ntohs(tp->th_block), n - 4);
usr.bin/tftp/tftp.c
90
int n;
usr.bin/tip/cmds.c
821
int n = 0;
usr.bin/tip/cmds.c
823
while (*p && n < num) {
usr.bin/tip/cmds.c
832
parg++, n++;
usr.bin/tip/cmds.c
836
return(n);
usr.bin/tip/tip.c
443
speed(int n)
usr.bin/tip/tip.c
445
return (n);
usr.bin/tip/tip.c
568
xpwrite(int fd, char *buf, int n)
usr.bin/tip/tip.c
575
for (i = 0; i < n; i++) {
usr.bin/tip/tip.c
579
if (write(fd, buf, n) < 0) {
usr.bin/tip/unidialer.c
591
int nc, nl, n;
usr.bin/tip/unidialer.c
607
n = read(FD, &c, 1);
usr.bin/tip/unidialer.c
609
if (n <= 0)
usr.bin/tip/unidialer.c
746
static void unidialer_write (int fd, const char *cp, int n)
usr.bin/tip/unidialer.c
749
for ( ; n-- ; cp++) {
usr.bin/tip/unidialer.c
758
int n = 0;
usr.bin/tip/unidialer.c
761
if (ioctl(FD, FIONREAD, &n) < 0)
usr.bin/tip/unidialer.c
763
if (n <= 0)
usr.bin/tip/unidialer.c
765
if (read(FD, buf, n) != n)
usr.bin/tip/unidialer.c
767
write(1, buf, n);
usr.bin/tip/unidialer.c
97
static void unidialer_write(int fd, const char *cp, int n);
usr.bin/top/m_dragonfly.c
1185
int n;
usr.bin/top/m_dragonfly.c
1194
n = kvm_getswapinfo(kd, swapary, 1, 0);
usr.bin/top/m_dragonfly.c
1195
if (n < 0 || swapary[0].ksw_total == 0)
usr.bin/top/m_dragonfly.c
1201
n = (int)((double)swapary[0].ksw_used * 100.0 /
usr.bin/top/m_dragonfly.c
1203
return (n);
usr.bin/tput/tput.c
100
(void)printf("%d\n", n);
usr.bin/tput/tput.c
54
int ch, exitval, n;
usr.bin/tput/tput.c
99
else if ((n = tgetnum(p)) != -1)
usr.bin/tr/str.c
238
int n, cnt, *p;
usr.bin/tr/str.c
278
n = p - (int *)s->set;
usr.bin/tr/str.c
282
if (n > 1)
usr.bin/tr/str.c
283
mergesort(s->set, n, sizeof(*(s->set)), charcoll);
usr.bin/tr/tr.c
283
n = p - carray;
usr.bin/tr/tr.c
284
if (Cflag && n > 1)
usr.bin/tr/tr.c
285
(void)mergesort(carray, n, sizeof(*carray), charcoll);
usr.bin/tr/tr.c
289
for (cnt = 0; cnt < n; cnt++) {
usr.bin/tr/tr.c
64
int n, *p;
usr.bin/tsort/tsort.c
109
int c, n;
usr.bin/tsort/tsort.c
146
for (b = bufs, n = 2; --n >= 0; b++)
usr.bin/tsort/tsort.c
150
for (n = 0, c = getc(fp);;) {
usr.bin/tsort/tsort.c
157
b = &bufs[n];
usr.bin/tsort/tsort.c
168
if (n)
usr.bin/tsort/tsort.c
170
n = !n;
usr.bin/tsort/tsort.c
173
if (n)
usr.bin/tsort/tsort.c
234
NODE *n;
usr.bin/tsort/tsort.c
245
bcopy(data.data, &n, sizeof(n));
usr.bin/tsort/tsort.c
246
return (n);
usr.bin/tsort/tsort.c
254
if ((n = malloc(sizeof(NODE) + key.size)) == NULL)
usr.bin/tsort/tsort.c
257
n->n_narcs = 0;
usr.bin/tsort/tsort.c
258
n->n_arcsize = 0;
usr.bin/tsort/tsort.c
259
n->n_arcs = NULL;
usr.bin/tsort/tsort.c
260
n->n_refcnt = 0;
usr.bin/tsort/tsort.c
261
n->n_flags = 0;
usr.bin/tsort/tsort.c
262
bcopy(name, n->n_name, key.size);
usr.bin/tsort/tsort.c
265
if ((n->n_next = graph) != NULL)
usr.bin/tsort/tsort.c
266
graph->n_prevp = &n->n_next;
usr.bin/tsort/tsort.c
267
n->n_prevp = &graph;
usr.bin/tsort/tsort.c
268
graph = n;
usr.bin/tsort/tsort.c
271
data.data = &n;
usr.bin/tsort/tsort.c
272
data.size = sizeof(n);
usr.bin/tsort/tsort.c
275
return (n);
usr.bin/tsort/tsort.c
285
NODE *n;
usr.bin/tsort/tsort.c
287
for (n = graph; n != NULL; n = n->n_next)
usr.bin/tsort/tsort.c
288
n->n_flags &= ~NF_NODEST;
usr.bin/tsort/tsort.c
295
NODE *n, *next;
usr.bin/tsort/tsort.c
305
for (cnt = 0, n = graph; n != NULL; n = next) {
usr.bin/tsort/tsort.c
306
next = n->n_next;
usr.bin/tsort/tsort.c
307
if (n->n_refcnt == 0) {
usr.bin/tsort/tsort.c
308
remove_node(n);
usr.bin/tsort/tsort.c
323
for (cnt = 0, n = graph; n != NULL; n = n->n_next)
usr.bin/tsort/tsort.c
330
for (n = graph; n != NULL; n = n->n_next)
usr.bin/tsort/tsort.c
331
if (!(n->n_flags & NF_ACYCLIC)) {
usr.bin/tsort/tsort.c
332
if ((cnt = find_cycle(n, n, 0, 0))) {
usr.bin/tsort/tsort.c
339
remove_node(n);
usr.bin/tsort/tsort.c
344
n->n_flags |= NF_ACYCLIC;
usr.bin/tsort/tsort.c
349
if (n == NULL)
usr.bin/tsort/tsort.c
359
remove_node(NODE *n)
usr.bin/tsort/tsort.c
364
printf("%s\n", n->n_name);
usr.bin/tsort/tsort.c
365
for (np = n->n_arcs, i = n->n_narcs; --i >= 0; np++)
usr.bin/tsort/tsort.c
367
n->n_narcs = 0;
usr.bin/tsort/tsort.c
368
*n->n_prevp = n->n_next;
usr.bin/tsort/tsort.c
369
if (n->n_next != NULL)
usr.bin/tsort/tsort.c
370
n->n_next->n_prevp = n->n_prevp;
usr.bin/uname/uname.c
262
size_t n;
usr.bin/uname/uname.c
266
n = NATIVE_LENGTH;
usr.bin/uname/uname.c
267
for (; n--; ++p)
usr.bin/undo/undo.c
424
int n;
usr.bin/undo/undo.c
503
while ((n = fread(buf, 1, 8192, fi)) > 0)
usr.bin/undo/undo.c
504
fwrite(buf, 1, n, fp);
usr.bin/unexpand/unexpand.c
108
int dcol, doneline, limit, n, ocol, width;
usr.bin/unexpand/unexpand.c
125
for (n = 0; n < nstops &&
usr.bin/unexpand/unexpand.c
126
tabstops[n] - 1 < dcol; n++)
usr.bin/unexpand/unexpand.c
128
if (n < nstops - 1 && tabstops[n] - 1 < limit) {
usr.bin/unexpand/unexpand.c
129
dcol = tabstops[n];
usr.bin/unexpand/unexpand.c
147
for (n = 0; n < nstops && tabstops[n] - 1 < ocol; n++)
usr.bin/unexpand/unexpand.c
149
while (ocol < dcol && n < nstops && ocol < limit) {
usr.bin/unexpand/unexpand.c
151
ocol = tabstops[n++];
usr.bin/unifdef/unifdef.c
1541
size_t n;
usr.bin/unifdef/unifdef.c
1545
n = (size_t)(end - start) + 1;
usr.bin/unifdef/unifdef.c
1546
s = malloc(n);
usr.bin/unifdef/unifdef.c
1549
snprintf(s, n, "%s", start);
usr.bin/uniq/uniq.c
182
size_t n;
usr.bin/uniq/uniq.c
185
if ((n = mbstowcs(NULL, str, 0)) == (size_t)-1)
usr.bin/uniq/uniq.c
187
if (SIZE_MAX / sizeof(*buf) < n + 1)
usr.bin/uniq/uniq.c
189
if ((buf = malloc((n + 1) * sizeof(*buf))) == NULL)
usr.bin/uniq/uniq.c
191
if (mbstowcs(buf, str, n + 1) != n)
usr.bin/uniq/uniq.c
194
if (n > 0 && buf[n - 1] == L'\n')
usr.bin/uniq/uniq.c
195
buf[n - 1] = L'\0';
usr.bin/unzip/unzip.c
507
for (int n = 0; ; n++) {
usr.bin/unzip/unzip.c
509
if (tty && (n % 4) == 0)
usr.bin/unzip/unzip.c
510
info(" %c\b\b", spinner[(n / 4) % sizeof spinner]);
usr.bin/unzip/unzip.c
540
if (a_opt && n == 0) {
usr.bin/usbhidaction/usbhidaction.c
184
n = read(fd, buf, sz);
usr.bin/usbhidaction/usbhidaction.c
186
printf("read %d bytes:", n);
usr.bin/usbhidaction/usbhidaction.c
187
for (i = 0; i < n; i++)
usr.bin/usbhidaction/usbhidaction.c
191
if (n < 0) {
usr.bin/usbhidaction/usbhidaction.c
198
if (n != sz) {
usr.bin/usbhidaction/usbhidaction.c
470
int n, r;
usr.bin/usbhidaction/usbhidaction.c
477
n = strtol(p, &p, 10) - 1;
usr.bin/usbhidaction/usbhidaction.c
478
if (n >= 0 && n < argc) {
usr.bin/usbhidaction/usbhidaction.c
479
strncpy(q, argv[n], len);
usr.bin/usbhidaction/usbhidaction.c
88
int fd, fp, ch, n, val, i;
usr.bin/uudecode/uudecode.c
168
size_t n, m;
usr.bin/uudecode/uudecode.c
195
n = strlen(q);
usr.bin/uudecode/uudecode.c
196
while (n > 0 && (q[n-1] == '\n' || q[n-1] == '\r'))
usr.bin/uudecode/uudecode.c
197
q[--n] = '\0';
usr.bin/uudecode/uudecode.c
199
if (n > 0)
usr.bin/uudecode/uudecode.c
228
n = strlen(pw->pw_dir);
usr.bin/uudecode/uudecode.c
229
if (buf + n > p) {
usr.bin/uudecode/uudecode.c
232
if (sizeof(buf) < n + m) {
usr.bin/uudecode/uudecode.c
237
p = memmove(buf + n, p, m);
usr.bin/uudecode/uudecode.c
239
q = memcpy(p - n, pw->pw_dir, n);
usr.bin/uudecode/uudecode.c
311
size_t n;
usr.bin/uudecode/uudecode.c
313
n = strlen(end);
usr.bin/uudecode/uudecode.c
314
if (strncmp(ptr, end, n) != 0 ||
usr.bin/uudecode/uudecode.c
315
strspn(ptr + n, " \t\r\n") != strlen(ptr + n)) {
usr.bin/uudecode/uudecode.c
407
int n;
usr.bin/uudecode/uudecode.c
419
n = b64_pton(inbuf, outbuf, sizeof(outbuf));
usr.bin/uudecode/uudecode.c
421
if (n < 0)
usr.bin/uudecode/uudecode.c
423
fwrite(outbuf, 1, n, outfp);
usr.bin/uuencode/uuencode.c
140
size_t n;
usr.bin/uuencode/uuencode.c
146
while ((n = fread(buf, 1, sizeof(buf), stdin))) {
usr.bin/uuencode/uuencode.c
148
rv = b64_ntop(buf, n, buf2, NELEM(buf2));
usr.bin/uuencode/uuencode.c
164
int ch, n;
usr.bin/uuencode/uuencode.c
169
while ((n = fread(buf, 1, 45, stdin))) {
usr.bin/uuencode/uuencode.c
170
ch = ENC(n);
usr.bin/uuencode/uuencode.c
173
for (p = buf; n > 0; n -= 3, p += 3) {
usr.bin/uuencode/uuencode.c
175
if (n < 3) {
usr.bin/uuencode/uuencode.c
177
if (n < 2)
usr.bin/vknet/vknet.c
207
int n;
usr.bin/vknet/vknet.c
224
for (n = 0; n < bytes; n += r) {
usr.bin/vknet/vknet.c
225
r = read(stream->fdin, (char *)&head + n,
usr.bin/vknet/vknet.c
226
bytes - n);
usr.bin/vknet/vknet.c
230
if (n != bytes)
usr.bin/vknet/vknet.c
237
for (n = 0; n < bytes; n += r) {
usr.bin/vknet/vknet.c
238
r = read(stream->fdin, pkt + n, bytes - n);
usr.bin/vknet/vknet.c
242
if (n != bytes)
usr.bin/vmstat/vmstat.c
1039
int n;
usr.bin/vmstat/vmstat.c
1115
for (n = 0; idbuf[n]; ++n) {
usr.bin/vmstat/vmstat.c
1116
if (idbuf[n] == ' ')
usr.bin/vmstat/vmstat.c
1117
idbuf[n] = '_';
usr.bin/vmstat/vmstat.c
1189
int n;
usr.bin/vmstat/vmstat.c
1205
for (n = 0; n < ncpus; ++n) {
usr.bin/vmstat/vmstat.c
1206
znalloc_prev += save[i].zpcpu[n].znalloc;
usr.bin/vmstat/vmstat.c
1211
for (n = 0; n < ncpus; ++n) {
usr.bin/vmstat/vmstat.c
1212
zfreecnt_next += zone.zpcpu[n].zfreecnt;
usr.bin/vmstat/vmstat.c
1213
znalloc_next += zone.zpcpu[n].znalloc;
usr.bin/window/alias.h
49
#define alias_set(n, s) var_setstr1(&alias_head, n, s)
usr.bin/window/alias.h
51
#define alias_unset(n) var_unset1(&alias_head, n)
usr.bin/window/alias.h
52
#define alias_lookup(n) (*var_lookup1(&alias_head, n))
usr.bin/window/cmd5.c
105
getminmax(int x, int n, int a, int b, int *curx, int *minx, int *maxx)
usr.bin/window/cmd5.c
108
*curx = x + n - 1;
usr.bin/window/cmd5.c
113
*minx = 1 - n;
usr.bin/window/cmd5.c
114
else if (x <= b - n)
usr.bin/window/cmd5.c
117
*minx = b - n;
usr.bin/window/cmd5.c
119
if (x >= b - n)
usr.bin/window/cmd5.c
122
*maxx = b - n;
usr.bin/window/cmd7.c
242
int n;
usr.bin/window/cmd7.c
256
yp->length = n = cend - c + 1;
usr.bin/window/cmd7.c
263
for (bp += c, cp = yp->line; --n >= 0;)
usr.bin/window/compress.c
341
int n;
usr.bin/window/compress.c
359
n = cc_sweep_phase(cc_buffer, bufsize, cc_tokens);
usr.bin/window/compress.c
360
cc_compress_phase(cc_output, bufsize, cc_tokens, n);
usr.bin/window/compress.c
374
int i, n;
usr.bin/window/compress.c
403
n = cc_sweep(buffer, bufsize, pp, i);
usr.bin/window/compress.c
404
pp += n;
usr.bin/window/compress.c
407
if (--n > 0) {
usr.bin/window/compress.c
408
printf(" %d", n);
usr.bin/window/compress.c
409
nn += n;
usr.bin/window/compress.c
427
cc_sweep0(char *buffer, int n, int length)
usr.bin/window/compress.c
438
i = n;
usr.bin/window/compress.c
446
for (i = n--; --i;) {
usr.bin/window/compress.c
497
int n = length;
usr.bin/window/compress.c
501
while (--n);
usr.bin/window/compress.c
516
int n = length;
usr.bin/window/compress.c
519
while (--n);
usr.bin/window/lcmd2.c
177
int n;
usr.bin/window/lcmd2.c
179
for (n = 0, i = 0; i < NWINDOW; i++)
usr.bin/window/lcmd2.c
181
n++;
usr.bin/window/lcmd2.c
182
if (n == 0) {
usr.bin/window/lcmd2.c
186
if ((w = openiwin(n + 2, "Windows")) == NULL) {
usr.bin/window/lcmd2.c
313
int n;
usr.bin/window/lcmd2.c
315
for (n = 0, vp = a + 1; vp->v_type != V_ERR; vp++, n++)
usr.bin/window/lcmd2.c
316
for (p = vp->v_str; *p; p++, n++)
usr.bin/window/lcmd2.c
318
if ((str = str_alloc(n)) == NULL) {
usr.bin/window/mloop.c
56
int n;
usr.bin/window/mloop.c
65
if ((n = p - wwibp) > 0) {
usr.bin/window/mloop.c
71
while (--n >= 0)
usr.bin/window/mloop.c
74
(void) write(w->ww_pty, wwibp, n);
usr.bin/window/scanner.c
553
int n;
usr.bin/window/scanner.c
577
n = c - '0';
usr.bin/window/scanner.c
581
return n;
usr.bin/window/scanner.c
583
n = n * 8 + c - '0';
usr.bin/window/scanner.c
587
return n;
usr.bin/window/scanner.c
589
return n * 8 + c - '0';
usr.bin/window/string.c
58
str_ncpy(const char *s, int n)
usr.bin/window/string.c
64
if (n > l)
usr.bin/window/string.c
65
n = l;
usr.bin/window/string.c
66
str = p = str_alloc(n + 1);
usr.bin/window/string.c
69
while (--n >= 0)
usr.bin/window/tt.h
159
#define tttputs(s, n) tputs((s)->ts_str, (n), tttputc)
usr.bin/window/ttgeneric.c
201
gen_insline(int n)
usr.bin/window/ttgeneric.c
206
ttpgoto(gen_ALn, 0, n, gen_LI - tt.tt_row);
usr.bin/window/ttgeneric.c
208
while (--n >= 0)
usr.bin/window/ttgeneric.c
213
gen_delline(int n)
usr.bin/window/ttgeneric.c
218
ttpgoto(gen_DLn, 0, n, gen_LI - tt.tt_row);
usr.bin/window/ttgeneric.c
220
while (--n >= 0)
usr.bin/window/ttgeneric.c
243
gen_write(const char *p, int n)
usr.bin/window/ttgeneric.c
249
ttwrite(p, n);
usr.bin/window/ttgeneric.c
250
tt.tt_col += n;
usr.bin/window/ttgeneric.c
381
gen_insspace(int n)
usr.bin/window/ttgeneric.c
384
ttpgoto(gen_ICn, 0, n, gen_CO - tt.tt_col);
usr.bin/window/ttgeneric.c
386
while (--n >= 0)
usr.bin/window/ttgeneric.c
391
gen_delchar(int n)
usr.bin/window/ttgeneric.c
394
ttpgoto(gen_DCn, 0, n, gen_CO - tt.tt_col);
usr.bin/window/ttgeneric.c
396
while (--n >= 0)
usr.bin/window/ttgeneric.c
401
gen_scroll_down(int n)
usr.bin/window/ttgeneric.c
405
ttpgoto(gen_SFn, 0, n, n);
usr.bin/window/ttgeneric.c
407
while (--n >= 0)
usr.bin/window/ttgeneric.c
412
gen_scroll_up(int n)
usr.bin/window/ttgeneric.c
416
ttpgoto(gen_SRn, 0, n, n);
usr.bin/window/ttgeneric.c
418
while (--n >= 0)
usr.bin/window/tth19.c
108
h19_insline(int n)
usr.bin/window/tth19.c
110
while (--n >= 0) {
usr.bin/window/tth19.c
117
h19_delline(int n)
usr.bin/window/tth19.c
119
while (--n >= 0) {
usr.bin/window/tth19.c
138
h19_write(const char *p, int n)
usr.bin/window/tth19.c
144
ttwrite(p, n);
usr.bin/window/tth19.c
145
tt.tt_col += n;
usr.bin/window/tth19.c
246
h19_delchar(int n)
usr.bin/window/tth19.c
248
while (--n >= 0)
usr.bin/window/tth19.c
253
h19_scroll_down(int n)
usr.bin/window/tth19.c
256
while (--n >= 0)
usr.bin/window/tth19.c
261
h19_scroll_up(int n)
usr.bin/window/tth19.c
264
while (--n >= 0)
usr.bin/window/ttoutput.c
129
while (n > 0) {
usr.bin/window/ttoutput.c
134
if ((m = tt_obe - tt_obp) > n)
usr.bin/window/ttoutput.c
135
m = n;
usr.bin/window/ttoutput.c
139
n -= m;
usr.bin/window/ttoutput.c
51
int n = tt_obp - tt_ob;
usr.bin/window/ttoutput.c
53
if (n == 0)
usr.bin/window/ttoutput.c
56
(*tt.tt_checksum)(tt_ob, n);
usr.bin/window/ttoutput.c
64
n = write(1, p, tt_obp - p);
usr.bin/window/ttoutput.c
65
if (n < 0) {
usr.bin/window/ttoutput.c
71
} else if (n == 0) {
usr.bin/window/ttoutput.c
75
wwnwrc += n;
usr.bin/window/ttoutput.c
76
p += n;
usr.bin/window/ttoutput.c
90
ttwrite(const char *s, int n)
usr.bin/window/ttoutput.c
92
switch (n) {
usr.bin/window/tttermcap.c
101
tputs(tgoto(s->ts_str, col, row), n, tttputc);
usr.bin/window/tttermcap.c
107
int n, r;
usr.bin/window/tttermcap.c
110
(n = a->ts_n - b->ts_n) < 0 ? a->ts_n : b->ts_n)))
usr.bin/window/tttermcap.c
112
return n;
usr.bin/window/tttermcap.c
98
ttpgoto(struct tt_str *s, int col, int row, int n)
usr.bin/window/ttzapple.c
103
zz_insline(int n)
usr.bin/window/ttzapple.c
105
if (n == 1)
usr.bin/window/ttzapple.c
109
ttputc(n + ' ');
usr.bin/window/ttzapple.c
114
zz_delline(int n)
usr.bin/window/ttzapple.c
116
if (n == 1)
usr.bin/window/ttzapple.c
120
ttputc(n + ' ');
usr.bin/window/ttzapple.c
135
zz_write(const char *p, int n)
usr.bin/window/ttzapple.c
139
ttwrite(p, n);
usr.bin/window/ttzapple.c
140
tt.tt_col += n;
usr.bin/window/ttzapple.c
301
zz_insspace(int n)
usr.bin/window/ttzapple.c
303
if (n == 1)
usr.bin/window/ttzapple.c
307
ttputc(n + ' ');
usr.bin/window/ttzapple.c
312
zz_delchar(int n)
usr.bin/window/ttzapple.c
314
if (n == 1)
usr.bin/window/ttzapple.c
318
ttputc(n + ' ');
usr.bin/window/ttzapple.c
323
zz_scroll_down(int n)
usr.bin/window/ttzapple.c
325
if (n == 1) {
usr.bin/window/ttzapple.c
332
ttputc(n + ' ');
usr.bin/window/ttzapple.c
337
zz_scroll_up(int n)
usr.bin/window/ttzapple.c
339
if (n == 1)
usr.bin/window/ttzapple.c
343
ttputc(n + ' ');
usr.bin/window/ttzapple.c
360
zz_set_token(int t, char *s, int n)
usr.bin/window/ttzapple.c
373
s[n - 1] |= 0x80;
usr.bin/window/ttzapple.c
374
ttwrite(s, n);
usr.bin/window/ttzapple.c
375
s[n - 1] &= ~0x80;
usr.bin/window/ttzapple.c
379
zz_put_token(int t, const char *s __unused, int n __unused)
usr.bin/window/ttzapple.c
394
zz_rint(char *p, int n)
usr.bin/window/ttzapple.c
400
return n;
usr.bin/window/ttzapple.c
401
for (i = n, q = p; --i >= 0;) {
usr.bin/window/ttzapple.c
446
return q - (p - n);
usr.bin/window/ttzapple.c
450
zz_checksum(char *p, int n)
usr.bin/window/ttzapple.c
452
while (--n >= 0) {
usr.bin/window/var.h
56
#define var_set(n, v) var_set1(&var_head, n, v)
usr.bin/window/var.h
57
#define var_setstr(n, s) var_setstr1(&var_head, n, s)
usr.bin/window/var.h
58
#define var_setnum(n, i) var_setnum1(&var_head, n, i)
usr.bin/window/var.h
59
#define var_unset(n) var_unset1(&var_head, n)
usr.bin/window/var.h
60
#define var_lookup(n) (*var_lookup1(&var_head, n))
usr.bin/window/wwgets.c
43
wwgets(char *buf, int n, struct ww *w)
usr.bin/window/wwgets.c
86
if (p >= buf + n - 1)
usr.bin/window/wwiomux.c
155
int n;
usr.bin/window/wwiomux.c
173
n = read(w->ww_pty, p, w->ww_obe - p);
usr.bin/window/wwiomux.c
174
if (n < 0) {
usr.bin/window/wwiomux.c
178
} else if (n == 0) {
usr.bin/window/wwiomux.c
184
wwnwreadc += n;
usr.bin/window/wwiomux.c
185
w->ww_obq += n;
usr.bin/window/wwiomux.c
187
n--;
usr.bin/window/wwiomux.c
189
wwnwreadc += n;
usr.bin/window/wwiomux.c
190
w->ww_obq += n;
usr.bin/window/wwiomux.c
218
int n = wwwrite(w, w->ww_obp, w->ww_obq - w->ww_obp);
usr.bin/window/wwiomux.c
219
if ((w->ww_obp += n) == w->ww_obq)
usr.bin/window/wwiomux.c
227
int n = wwwrite(w, w->ww_obp,
usr.bin/window/wwiomux.c
229
if ((w->ww_obp += n) == w->ww_obq)
usr.bin/window/wwrint.c
53
int n;
usr.bin/window/wwrint.c
56
n = read(0, wwibq, wwibe - wwibq);
usr.bin/window/wwrint.c
57
if (n > 0) {
usr.bin/window/wwrint.c
59
n = (*tt.tt_rint)(wwibq, n);
usr.bin/window/wwrint.c
60
if (n > 0) {
usr.bin/window/wwrint.c
61
wwibq += n;
usr.bin/window/wwrint.c
62
wwnreadc += n;
usr.bin/window/wwrint.c
71
} else if (n == 0)
usr.bin/window/wwscroll.c
43
wwscroll(struct ww *w, int n)
usr.bin/window/wwscroll.c
48
if (n == 0)
usr.bin/window/wwscroll.c
50
dir = n < 0 ? -1 : 1;
usr.bin/window/wwscroll.c
51
top = w->ww_b.t - n;
usr.bin/window/wwscroll.c
56
n = abs(top - w->ww_b.t);
usr.bin/window/wwscroll.c
57
if (n < w->ww_i.nr) {
usr.bin/window/wwscroll.c
58
while (--n >= 0) {
usr.bin/window/wwupdate.c
208
int n;
usr.bin/window/wwupdate.c
221
n = 5;
usr.bin/window/wwupdate.c
226
if (--n <= 0)
usr.bin/window/wwupdate.c
231
n = 5;
usr.bin/window/wwupdate.c
238
n = q - buf;
usr.bin/window/wwupdate.c
239
if (!wwwrap || i != wwnrow - 1 || c + n != wwncol)
usr.bin/window/wwupdate.c
240
xxwrite(i, c, buf, n, m);
usr.bin/window/wwupdate.c
242
if (n > 1) {
usr.bin/window/wwupdate.c
244
n--;
usr.bin/window/wwupdate.c
247
xxwrite(i, c, buf, n, m);
usr.bin/window/wwupdate.c
248
c += n - 1;
usr.bin/window/wwupdate.c
258
if (--n)
usr.bin/window/wwupdate.c
259
xxwrite(i, c, buf, n, m);
usr.bin/window/wwupdate.c
53
int n;
usr.bin/window/wwupdate.c
70
for (t1--, n = 1; t1 < t2;)
usr.bin/window/wwupdate.c
72
n++;
usr.bin/window/wwupdate.c
77
if ((check_clreos = n * 10 > (wwnrow - st) * 9)) {
usr.bin/window/wwwrite.c
291
wwnwwra += n;
usr.bin/window/wwwrite.c
292
n = p - savep;
usr.bin/window/wwwrite.c
293
wwnwwrc += n;
usr.bin/window/wwwrite.c
294
return n;
usr.bin/window/wwwrite.c
56
wwwrite(struct ww *w, const char *p, int n)
usr.bin/window/wwwrite.c
60
const char *q = p + n;
usr.bin/window/xx.c
248
xxwrite(int row, int col, char *p, int n, int m)
usr.bin/window/xx.c
252
if (xxbufp + n + 1 > xxbufe)
usr.bin/window/xx.c
258
xp->arg2 = n;
usr.bin/window/xx.c
261
memmove(xxbufp, p, n);
usr.bin/window/xx.c
262
xxbufp += n;
usr.bin/write/write.c
263
done(__unused int n)
usr.sbin/arp/arp.c
593
my_ether_aton(char *a, struct ether_addr *n)
usr.sbin/arp/arp.c
601
*n = *ea;
usr.sbin/arp/arp.c
82
static int my_ether_aton(char *a, struct ether_addr *n);
usr.sbin/authpf/authpf.c
165
if ((n = snprintf(rulesetname, sizeof(rulesetname), "%s(%ld)",
usr.sbin/authpf/authpf.c
166
luser, (long)getpid())) < 0 || (u_int)n >= sizeof(rulesetname)) {
usr.sbin/authpf/authpf.c
169
if ((n = snprintf(rulesetname, sizeof(rulesetname), "%ld",
usr.sbin/authpf/authpf.c
170
(long)getpid())) < 0 || (u_int)n >= sizeof(rulesetname)) {
usr.sbin/authpf/authpf.c
178
n = snprintf(pidfile, sizeof(pidfile), "%s/%s", PATH_PIDFILE, ipsrc);
usr.sbin/authpf/authpf.c
179
if (n < 0 || (u_int)n >= sizeof(pidfile)) {
usr.sbin/authpf/authpf.c
518
int n;
usr.sbin/authpf/authpf.c
521
n = snprintf(tmp, sizeof(tmp), "%s/%s", userdir, user);
usr.sbin/authpf/authpf.c
522
if (n < 0 || (u_int)n >= sizeof(tmp)) {
usr.sbin/authpf/authpf.c
83
int lockcnt = 0, n, pidfd;
usr.sbin/autofs/automount.c
111
mountpoint = node_path(n);
usr.sbin/autofs/automount.c
142
struct node *n, *n2;
usr.sbin/autofs/automount.c
158
n = node_find(root, mntbuf[i].f_mntonname);
usr.sbin/autofs/automount.c
159
if (n != NULL) {
usr.sbin/autofs/automount.c
172
TAILQ_FOREACH(n, &root->n_children, n_next) {
usr.sbin/autofs/automount.c
173
if (!node_is_direct_map(n)) {
usr.sbin/autofs/automount.c
174
mount_if_not_already(n, n->n_map, n->n_options,
usr.sbin/autofs/automount.c
175
n->n_key, mntbuf, nitems);
usr.sbin/autofs/automount.c
179
TAILQ_FOREACH(n2, &n->n_children, n_next) {
usr.sbin/autofs/automount.c
180
mount_if_not_already(n2, n->n_map, n->n_options,
usr.sbin/autofs/automount.c
99
mount_if_not_already(const struct node *n, const char *map, const char *options,
usr.sbin/autofs/common.c
149
struct node *n;
usr.sbin/autofs/common.c
151
n = calloc(1, sizeof(*n));
usr.sbin/autofs/common.c
152
if (n == NULL)
usr.sbin/autofs/common.c
155
n->n_key = checked_strdup("/");
usr.sbin/autofs/common.c
156
n->n_options = checked_strdup("");
usr.sbin/autofs/common.c
158
TAILQ_INIT(&n->n_children);
usr.sbin/autofs/common.c
160
return (n);
usr.sbin/autofs/common.c
167
struct node *n;
usr.sbin/autofs/common.c
169
n = calloc(1, sizeof(*n));
usr.sbin/autofs/common.c
170
if (n == NULL)
usr.sbin/autofs/common.c
173
TAILQ_INIT(&n->n_children);
usr.sbin/autofs/common.c
176
n->n_key = key;
usr.sbin/autofs/common.c
178
n->n_options = options;
usr.sbin/autofs/common.c
180
n->n_options = strdup("");
usr.sbin/autofs/common.c
181
n->n_location = location;
usr.sbin/autofs/common.c
183
n->n_config_file = config_file;
usr.sbin/autofs/common.c
185
n->n_config_line = config_line;
usr.sbin/autofs/common.c
188
n->n_parent = parent;
usr.sbin/autofs/common.c
189
TAILQ_INSERT_TAIL(&parent->n_children, n, n_next);
usr.sbin/autofs/common.c
191
return (n);
usr.sbin/autofs/common.c
198
struct node *n;
usr.sbin/autofs/common.c
200
n = calloc(1, sizeof(*n));
usr.sbin/autofs/common.c
201
if (n == NULL)
usr.sbin/autofs/common.c
204
TAILQ_INIT(&n->n_children);
usr.sbin/autofs/common.c
207
n->n_key = key;
usr.sbin/autofs/common.c
209
n->n_options = options;
usr.sbin/autofs/common.c
211
n->n_options = strdup("");
usr.sbin/autofs/common.c
212
n->n_map = map;
usr.sbin/autofs/common.c
214
n->n_config_file = config_file;
usr.sbin/autofs/common.c
216
n->n_config_line = config_line;
usr.sbin/autofs/common.c
219
n->n_parent = parent;
usr.sbin/autofs/common.c
220
TAILQ_INSERT_TAIL(&parent->n_children, n, n_next);
usr.sbin/autofs/common.c
222
return (n);
usr.sbin/autofs/common.c
229
struct node *n;
usr.sbin/autofs/common.c
234
n = node_new(parent, o->n_key, o->n_options, o->n_location,
usr.sbin/autofs/common.c
238
node_duplicate(child, n);
usr.sbin/autofs/common.c
240
return (n);
usr.sbin/autofs/common.c
244
node_delete(struct node *n)
usr.sbin/autofs/common.c
248
assert (n != NULL);
usr.sbin/autofs/common.c
250
TAILQ_FOREACH_SAFE(child, &n->n_children, n_next, tmp)
usr.sbin/autofs/common.c
253
if (n->n_parent != NULL)
usr.sbin/autofs/common.c
254
TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);
usr.sbin/autofs/common.c
256
free(n);
usr.sbin/autofs/common.c
264
node_move_after(struct node *n, struct node *previous)
usr.sbin/autofs/common.c
267
TAILQ_REMOVE(&n->n_parent->n_children, n, n_next);
usr.sbin/autofs/common.c
268
n->n_parent = previous->n_parent;
usr.sbin/autofs/common.c
269
TAILQ_INSERT_AFTER(&previous->n_parent->n_children, previous, n, n_next);
usr.sbin/autofs/common.c
275
struct node *n, *n2, *tmp, *tmp2, *tmproot;
usr.sbin/autofs/common.c
278
TAILQ_FOREACH_SAFE(n, &root->n_children, n_next, tmp) {
usr.sbin/autofs/common.c
279
if (n->n_key[0] != '+')
usr.sbin/autofs/common.c
291
yyin = auto_popen(AUTO_INCLUDE_PATH, n->n_key + 1, NULL);
usr.sbin/autofs/common.c
296
parse_master_yyin(tmproot, n->n_key);
usr.sbin/autofs/common.c
298
parse_map_yyin(tmproot, n->n_key, NULL);
usr.sbin/autofs/common.c
304
n->n_key);
usr.sbin/autofs/common.c
313
node_move_after(n2, n);
usr.sbin/autofs/common.c
316
node_delete(n);
usr.sbin/autofs/common.c
384
node_expand_ampersand(struct node *n, const char *key)
usr.sbin/autofs/common.c
388
if (n->n_location != NULL) {
usr.sbin/autofs/common.c
390
if (n->n_parent != NULL &&
usr.sbin/autofs/common.c
391
strcmp(n->n_parent->n_key, "*") != 0) {
usr.sbin/autofs/common.c
392
n->n_location = expand_ampersand(n->n_location,
usr.sbin/autofs/common.c
393
n->n_parent->n_key);
usr.sbin/autofs/common.c
396
n->n_location = expand_ampersand(n->n_location, key);
usr.sbin/autofs/common.c
400
TAILQ_FOREACH(child, &n->n_children, n_next)
usr.sbin/autofs/common.c
408
node_expand_wildcard(struct node *n, const char *key)
usr.sbin/autofs/common.c
414
if (strcmp(n->n_key, "*") == 0) {
usr.sbin/autofs/common.c
415
expanded = node_duplicate(n, NULL);
usr.sbin/autofs/common.c
417
node_move_after(expanded, n);
usr.sbin/autofs/common.c
420
TAILQ_FOREACH(child, &n->n_children, n_next)
usr.sbin/autofs/common.c
425
node_expand_defined(struct node *n)
usr.sbin/autofs/common.c
430
if (n->n_location != NULL) {
usr.sbin/autofs/common.c
431
n->n_location = defined_expand(n->n_location);
usr.sbin/autofs/common.c
432
if (n->n_location == NULL) {
usr.sbin/autofs/common.c
434
node_path(n));
usr.sbin/autofs/common.c
439
TAILQ_FOREACH(child, &n->n_children, n_next) {
usr.sbin/autofs/common.c
449
node_is_direct_key(const struct node *n)
usr.sbin/autofs/common.c
452
if (n->n_parent != NULL && n->n_parent->n_parent == NULL &&
usr.sbin/autofs/common.c
453
strcmp(n->n_key, "/-") == 0) {
usr.sbin/autofs/common.c
461
node_is_direct_map(const struct node *n)
usr.sbin/autofs/common.c
465
assert(n->n_parent != NULL);
usr.sbin/autofs/common.c
466
if (n->n_parent->n_parent == NULL)
usr.sbin/autofs/common.c
468
n = n->n_parent;
usr.sbin/autofs/common.c
471
return (node_is_direct_key(n));
usr.sbin/autofs/common.c
475
node_has_wildcards(const struct node *n)
usr.sbin/autofs/common.c
479
TAILQ_FOREACH(child, &n->n_children, n_next) {
usr.sbin/autofs/common.c
488
node_expand_maps(struct node *n, bool indirect)
usr.sbin/autofs/common.c
492
TAILQ_FOREACH_SAFE(child, &n->n_children, n_next, tmp) {
usr.sbin/autofs/common.c
520
node_expand_direct_maps(struct node *n)
usr.sbin/autofs/common.c
523
node_expand_maps(n, false);
usr.sbin/autofs/common.c
527
node_expand_indirect_maps(struct node *n)
usr.sbin/autofs/common.c
530
node_expand_maps(n, true);
usr.sbin/autofs/common.c
534
node_path_x(const struct node *n, char *x)
usr.sbin/autofs/common.c
538
if (n->n_parent == NULL)
usr.sbin/autofs/common.c
545
if (node_is_direct_key(n) && x[0] != '\0')
usr.sbin/autofs/common.c
548
assert(n->n_key[0] != '\0');
usr.sbin/autofs/common.c
549
path = concat(n->n_key, '/', x);
usr.sbin/autofs/common.c
552
return (node_path_x(n->n_parent, path));
usr.sbin/autofs/common.c
560
node_path(const struct node *n)
usr.sbin/autofs/common.c
565
path = node_path_x(n, checked_strdup(""));
usr.sbin/autofs/common.c
578
node_options_x(const struct node *n, char *x)
usr.sbin/autofs/common.c
582
if (n == NULL)
usr.sbin/autofs/common.c
585
options = concat(x, ',', n->n_options);
usr.sbin/autofs/common.c
588
return (node_options_x(n->n_parent, options));
usr.sbin/autofs/common.c
597
node_options(const struct node *n)
usr.sbin/autofs/common.c
600
return (node_options_x(n, checked_strdup("")));
usr.sbin/autofs/common.c
604
node_print_indent(const struct node *n, const char *cmdline_options,
usr.sbin/autofs/common.c
610
path = node_path(n);
usr.sbin/autofs/common.c
611
tmp = node_options(n);
usr.sbin/autofs/common.c
622
first_child = TAILQ_FIRST(&n->n_children);
usr.sbin/autofs/common.c
625
assert(n->n_location == NULL || n->n_map == NULL);
usr.sbin/autofs/common.c
634
n->n_location != NULL ? n->n_location : n->n_map != NULL ? n->n_map : "",
usr.sbin/autofs/common.c
635
node_is_direct_map(n) ? "direct" : "indirect",
usr.sbin/autofs/common.c
637
n->n_config_file, n->n_config_line);
usr.sbin/autofs/common.c
643
TAILQ_FOREACH(child, &n->n_children, n_next)
usr.sbin/autofs/common.c
653
node_print(const struct node *n, const char *cmdline_options)
usr.sbin/autofs/common.c
657
TAILQ_FOREACH(child, &n->n_children, n_next)
usr.sbin/autofs/common.h
100
bool node_is_direct_map(const struct node *n);
usr.sbin/autofs/common.h
101
bool node_has_wildcards(const struct node *n);
usr.sbin/autofs/common.h
102
char *node_path(const struct node *n);
usr.sbin/autofs/common.h
103
char *node_options(const struct node *n);
usr.sbin/autofs/common.h
107
void node_expand_indirect_maps(struct node *n);
usr.sbin/autofs/common.h
108
void node_print(const struct node *n, const char *cmdline_options);
usr.sbin/boot0cfg/boot0cfg.c
220
ssize_t n;
usr.sbin/boot0cfg/boot0cfg.c
224
if ((n = read(fd, buf, MBRSIZE)) == -1)
usr.sbin/boot0cfg/boot0cfg.c
226
if (n != MBRSIZE)
usr.sbin/boot0cfg/boot0cfg.c
239
(n = read(fd, *mbr, mbr_size)) == -1)
usr.sbin/boot0cfg/boot0cfg.c
241
if (n != mbr_size)
usr.sbin/boot0cfg/boot0cfg.c
261
ssize_t n;
usr.sbin/boot0cfg/boot0cfg.c
265
n = write(fd, mbr, mbr_size);
usr.sbin/boot0cfg/boot0cfg.c
267
if (n != mbr_size)
usr.sbin/bthcid/client.c
134
socklen_t n;
usr.sbin/bthcid/client.c
140
n = sizeof(un);
usr.sbin/bthcid/client.c
141
fd = accept(sock, (struct sockaddr *)&un, &n);
usr.sbin/bthcid/client.c
147
n = 1;
usr.sbin/bthcid/client.c
148
if (ioctl(fd, FIONBIO, &n) < 0) {
usr.sbin/bthcid/client.c
186
int n;
usr.sbin/bthcid/client.c
188
n = recv(sock, &rp, sizeof(rp), 0);
usr.sbin/bthcid/client.c
189
if (n != sizeof(rp)) {
usr.sbin/bthcid/client.c
190
if (n != 0)
usr.sbin/bthcid/client.c
258
int n = 0;
usr.sbin/bthcid/client.c
269
n++;
usr.sbin/bthcid/client.c
272
if (n == 0)
usr.sbin/bthcid/client.c
276
n, (n == 1 ? "" : "s"));
usr.sbin/bthcid/hci.c
134
int n;
usr.sbin/bthcid/hci.c
138
n = recvfrom(sock, buffer, sizeof(buffer), 0,
usr.sbin/bthcid/hci.c
140
if (n < 0) {
usr.sbin/bthcid/hci.c
241
int n;
usr.sbin/bthcid/hci.c
254
n = HCI_PIN_SIZE;
usr.sbin/bthcid/hci.c
255
while (n > 0 && pin[n - 1] == 0)
usr.sbin/bthcid/hci.c
256
n--;
usr.sbin/bthcid/hci.c
257
cp.pin_size = n;
usr.sbin/bthcid/hci.c
259
n = send_hci_cmd(sock, addr,
usr.sbin/bthcid/hci.c
268
n = send_hci_cmd(sock, addr, HCI_CMD_PIN_CODE_NEG_REP,
usr.sbin/bthcid/hci.c
272
if (n < 0) {
usr.sbin/bthcid/hci.c
289
int n;
usr.sbin/bthcid/hci.c
301
n = send_hci_cmd(sock, addr, HCI_CMD_LINK_KEY_REP, sizeof(cp), &cp);
usr.sbin/bthcid/hci.c
311
n = send_hci_cmd(sock, addr, HCI_CMD_LINK_KEY_NEG_REP, sizeof(cp), &cp);
usr.sbin/bthcid/hci.c
314
if (n < 0) {
usr.sbin/cdcontrol/cdcontrol.c
150
char n;
usr.sbin/cdcontrol/cdcontrol.c
159
n = toupper(*s);
usr.sbin/cdcontrol/cdcontrol.c
161
n = *s;
usr.sbin/cdcontrol/cdcontrol.c
162
putchar(n);
usr.sbin/cdcontrol/cdcontrol.c
461
unsigned int n;
usr.sbin/cdcontrol/cdcontrol.c
469
n = h.ending_track - h.starting_track + 1;
usr.sbin/cdcontrol/cdcontrol.c
470
rc = read_toc_entrys ((n + 1) * sizeof (struct cd_toc_entry));
usr.sbin/cdcontrol/cdcontrol.c
478
return play_blocks (0, msf2lba (toc_buffer[n].addr.msf.minute,
usr.sbin/cdcontrol/cdcontrol.c
479
toc_buffer[n].addr.msf.second,
usr.sbin/cdcontrol/cdcontrol.c
480
toc_buffer[n].addr.msf.frame));
usr.sbin/cdcontrol/cdcontrol.c
482
return play_blocks (0, ntohl(toc_buffer[n].addr.lba));
usr.sbin/cdcontrol/cdcontrol.c
495
len = msf2lba (toc_buffer[n].addr.msf.minute,
usr.sbin/cdcontrol/cdcontrol.c
496
toc_buffer[n].addr.msf.second,
usr.sbin/cdcontrol/cdcontrol.c
497
toc_buffer[n].addr.msf.frame) - blk;
usr.sbin/cdcontrol/cdcontrol.c
499
len = ntohl(toc_buffer[n].addr.lba) - blk;
usr.sbin/cdcontrol/cdcontrol.c
584
else if (tr1 > n)
usr.sbin/cdcontrol/cdcontrol.c
585
tr1 = n;
usr.sbin/cdcontrol/cdcontrol.c
636
tr2 = n;
usr.sbin/cdcontrol/cdcontrol.c
638
m2 = toc_buffer[n].addr.msf.minute;
usr.sbin/cdcontrol/cdcontrol.c
639
s2 = toc_buffer[n].addr.msf.second;
usr.sbin/cdcontrol/cdcontrol.c
640
f2 = toc_buffer[n].addr.msf.frame;
usr.sbin/cdcontrol/cdcontrol.c
642
lba2msf(ntohl(toc_buffer[n].addr.lba),
usr.sbin/cdcontrol/cdcontrol.c
649
} else if (tr2 > n) {
usr.sbin/cdcontrol/cdcontrol.c
650
tr2 = n;
usr.sbin/cdcontrol/cdcontrol.c
678
tm = toc_buffer[n].addr.msf.minute;
usr.sbin/cdcontrol/cdcontrol.c
679
ts = toc_buffer[n].addr.msf.second;
usr.sbin/cdcontrol/cdcontrol.c
680
tf = toc_buffer[n].addr.msf.frame;
usr.sbin/cdcontrol/cdcontrol.c
682
lba2msf(ntohl(toc_buffer[n].addr.lba),
usr.sbin/cdcontrol/cdcontrol.c
684
if ((tr2 < n)
usr.sbin/cdcontrol/cdcontrol.c
707
m2 = toc_buffer[n].addr.msf.minute;
usr.sbin/cdcontrol/cdcontrol.c
708
s2 = toc_buffer[n].addr.msf.second;
usr.sbin/cdcontrol/cdcontrol.c
709
f2 = toc_buffer[n].addr.msf.frame;
usr.sbin/cdcontrol/cdcontrol.c
711
lba2msf(ntohl(toc_buffer[n].addr.lba),
usr.sbin/cdcontrol/cdcontrol.c
733
end = n;
usr.sbin/cdcontrol/cdcontrol.c
745
int dir, junk, n, off, rc, trk;
usr.sbin/cdcontrol/cdcontrol.c
752
n = h.ending_track - h.starting_track + 1;
usr.sbin/cdcontrol/cdcontrol.c
769
return (play_track (trk, 1, n, 1));
usr.sbin/cdcontrol/cdcontrol.c
870
dbprog_sum(int n)
usr.sbin/cdcontrol/cdcontrol.c
877
sprintf(buf, "%u", n);
usr.sbin/cdcontrol/cdcontrol.c
904
n = 0;
usr.sbin/cdcontrol/cdcontrol.c
920
n += dbprog_sum((TC_MM(i) * 60) + TC_SS(i));
usr.sbin/cdcontrol/cdcontrol.c
926
return((n % 0xff) << 24 | t << 8 | ntr);
usr.sbin/cdcontrol/cdcontrol.c
948
int rc, i, n;
usr.sbin/cdcontrol/cdcontrol.c
963
n = h.ending_track - h.starting_track + 1;
usr.sbin/cdcontrol/cdcontrol.c
964
rc = read_toc_entrys ((n + 1) * sizeof (struct cd_toc_entry));
usr.sbin/cdcontrol/cdcontrol.c
973
for (i = 0; i < n; i++) {
usr.sbin/cdcontrol/cdcontrol.c
977
printf ("%5d ", toc_buffer[n].track);
usr.sbin/cdcontrol/cdcontrol.c
978
prtrack (toc_buffer + n, 1);
usr.sbin/chkgrp/chkgrp.c
114
warnx("%s: line %d: missing field(s)", gfn, n);
usr.sbin/chkgrp/chkgrp.c
123
warnx("%s: line %d: '%c' invalid character", gfn, n, *cp);
usr.sbin/chkgrp/chkgrp.c
130
warnx("%s: line %d: '%c' invalid character", gfn, n, *cp);
usr.sbin/chkgrp/chkgrp.c
137
warnx("%s: line %d: too many fields", gfn, n);
usr.sbin/chkgrp/chkgrp.c
144
gfn, n, k + 1);
usr.sbin/chkgrp/chkgrp.c
151
warnx("%s: line %d: GID is not numeric", gfn, n);
usr.sbin/chkgrp/chkgrp.c
162
err(EX_IOERR, "%s: line %d", gfn, n);
usr.sbin/chkgrp/chkgrp.c
56
int n = 0, i, k, e = 0;
usr.sbin/chkgrp/chkgrp.c
79
while (++n) {
usr.sbin/chkgrp/chkgrp.c
83
warnx("%s: line %d: no newline character", gfn, n);
usr.sbin/config/mkioconf.c
147
const char *n;
usr.sbin/config/mkioconf.c
149
n = devstr(dp);
usr.sbin/config/mkioconf.c
155
dp->d_name, dp->d_unit, n, n);
usr.sbin/cron/crontab/crontab.c
220
char n[MAX_FNAME];
usr.sbin/cron/crontab/crontab.c
225
sprintf(n, CRON_TAB(User));
usr.sbin/cron/crontab/crontab.c
226
if (!(f = fopen(n, "r"))) {
usr.sbin/cron/crontab/crontab.c
230
err(ERROR_EXIT, "%s", n);
usr.sbin/cron/crontab/crontab.c
263
char n[MAX_FNAME];
usr.sbin/cron/crontab/crontab.c
276
sprintf(n, CRON_TAB(User));
usr.sbin/cron/crontab/crontab.c
277
if (unlink(n)) {
usr.sbin/cron/crontab/crontab.c
281
err(ERROR_EXIT, "%s", n);
usr.sbin/cron/crontab/crontab.c
298
char n[MAX_FNAME], q[MAX_TEMPSTR];
usr.sbin/cron/crontab/crontab.c
309
sprintf(n, CRON_TAB(User));
usr.sbin/cron/crontab/crontab.c
310
if (!(f = fopen(n, "r"))) {
usr.sbin/cron/crontab/crontab.c
312
err(ERROR_EXIT, "%s", n);
usr.sbin/cron/crontab/crontab.c
490
char n[MAX_FNAME - 5], envstr[MAX_ENVSTR], tn[MAX_FNAME];
usr.sbin/cron/crontab/crontab.c
502
sprintf(n, "tmp.%d", Pid);
usr.sbin/cron/crontab/crontab.c
503
sprintf(tn, CRON_TAB(n));
usr.sbin/cron/crontab/crontab.c
589
sprintf(n, CRON_TAB(User));
usr.sbin/cron/crontab/crontab.c
590
if (rename(tn, n)) {
usr.sbin/cron/crontab/crontab.c
591
warn("error renaming %s to %s", tn, n);
usr.sbin/dconschat/dconschat.c
127
dread(struct dcons_state *dc, void *buf, size_t n, off_t offset)
usr.sbin/dconschat/dconschat.c
131
return (pread(dc->fd, buf, n, offset));
usr.sbin/dconschat/dconschat.c
133
return (kvm_read(dc->kd, offset, buf, n));
usr.sbin/dconschat/dconschat.c
139
dwrite(struct dcons_state *dc, void *buf, size_t n, off_t offset)
usr.sbin/dconschat/dconschat.c
142
return (n);
usr.sbin/dconschat/dconschat.c
146
return (pwrite(dc->fd, buf, n, offset));
usr.sbin/dconschat/dconschat.c
148
return (kvm_write(dc->kd, offset, buf, n));
usr.sbin/dconschat/dconschat.c
721
int i, n;
usr.sbin/dconschat/dconschat.c
724
n = kevent(dc->kq, NULL, 0, elist, NEVENT, &dc->to);
usr.sbin/dconschat/dconschat.c
725
for (i = 0; i < n; i ++) {
usr.sbin/dntpd/ntpreq.c
104
int n;
usr.sbin/dntpd/ntpreq.c
124
n = write(fd, &wmsg, NTP_MSGSIZE_NOAUTH);
usr.sbin/dntpd/ntpreq.c
125
if (n != NTP_MSGSIZE_NOAUTH)
usr.sbin/dntpd/ntpreq.c
144
while ((n = read(fd, &rmsg, sizeof(rmsg))) >= 0) {
usr.sbin/dntpd/ntpreq.c
145
if (n < NTP_MSGSIZE_NOAUTH)
usr.sbin/efivar/efivar.c
262
int i, n;
usr.sbin/efivar/efivar.c
264
n = efi_known_guid(&tbl);
usr.sbin/efivar/efivar.c
265
for (i = 0; i < n; i++)
usr.sbin/fstyp/exfat.c
157
unsigned n, sect;
usr.sbin/fstyp/exfat.c
165
for (n = 0; n < bytespersec; n++) {
usr.sbin/fstyp/exfat.c
167
switch (n) {
usr.sbin/fstyp/exfat.c
175
(checksum >> 1) + (uint32_t)sector[n];
usr.sbin/ftp-proxy/ftp-proxy.c
1125
int n;
usr.sbin/ftp-proxy/ftp-proxy.c
1132
while ((n = get_line(s->sbuf, &s->sbuf_valid)) > 0) {
usr.sbin/ftp-proxy/ftp-proxy.c
1154
if (n == -1) {
usr.sbin/ftp-proxy/ftp-proxy.c
1188
static int n = 0;
usr.sbin/ftp-proxy/ftp-proxy.c
1191
n = (n + 1) % NTOP_BUFS;
usr.sbin/ftp-proxy/ftp-proxy.c
1192
ntop_buf[n][0] = '\0';
usr.sbin/ftp-proxy/ftp-proxy.c
1197
return (inet_ntop(AF_INET, &sin->sin_addr, ntop_buf[n],
usr.sbin/ftp-proxy/ftp-proxy.c
1204
return (inet_ntop(AF_INET6, &sin6->sin6_addr, ntop_buf[n],
usr.sbin/ftp-proxy/ftp-proxy.c
257
int n;
usr.sbin/ftp-proxy/ftp-proxy.c
264
while ((n = get_line(s->cbuf, &s->cbuf_valid)) > 0) {
usr.sbin/ftp-proxy/ftp-proxy.c
283
if (n == -1) {
usr.sbin/ftp-proxy/ftp-proxy.c
866
int n;
usr.sbin/ftp-proxy/ftp-proxy.c
878
n = sscanf(p, " %u,%u,%u,%u,%u,%u", &v[0], &v[1], &v[2],
usr.sbin/ftp-proxy/ftp-proxy.c
880
if (n == 6 && v[0] < 256 && v[1] < 256 && v[2] < 256 &&
usr.sbin/ftp-proxy/ftp-proxy.c
885
n = sscanf(p, "(%u,%u,%u,%u,%u,%u)", &v[0], &v[1], &v[2],
usr.sbin/ftp-proxy/ftp-proxy.c
887
if (n == 6 && v[0] < 256 && v[1] < 256 && v[2] < 256 &&
usr.sbin/ftp-proxy/ftp-proxy.c
892
n = sscanf(p, "(|||%u|)", &port);
usr.sbin/ftp-proxy/ftp-proxy.c
893
if (n == 1 && port < 65536)
usr.sbin/ftp-proxy/ftp-proxy.c
897
n = sscanf(p, " |1|%u.%u.%u.%u|%u|", &v[0], &v[1], &v[2],
usr.sbin/ftp-proxy/ftp-proxy.c
899
if (n == 5 && v[0] < 256 && v[1] < 256 && v[2] < 256 &&
usr.sbin/ftp-proxy/ftp-proxy.c
902
n = sscanf(p, " |2|%*[a-fA-F0-9:]|%u|", &port);
usr.sbin/ftp-proxy/ftp-proxy.c
903
if (n == 1 && port < 65536)
usr.sbin/fwcontrol/fwcontrol.c
97
printf("%d devices (info_len=%d)\n", data->n, data->info_len);
usr.sbin/fwcontrol/fwdv.c
367
cycle_acc += frame_cycle[systype].n;
usr.sbin/fwcontrol/fwdv.c
374
pad_acc += pad_rate[systype].n;
usr.sbin/fwcontrol/fwdv.c
58
int n,d;
usr.sbin/gifconfig/gifconfig.c
721
int n;
usr.sbin/gifconfig/gifconfig.c
726
if ((n = sdl->sdl_alen) > 0) {
usr.sbin/gifconfig/gifconfig.c
731
while (--n >= 0)
usr.sbin/gifconfig/gifconfig.c
732
printf("%02x%c",*cp++ & 0xff, n>0? ':' : ' ');
usr.sbin/inetd/builtins.c
736
int count = 0, n;
usr.sbin/inetd/builtins.c
745
n = read(fd, buf, len-count);
usr.sbin/inetd/builtins.c
747
if (n == 0)
usr.sbin/inetd/builtins.c
749
if (n < 0)
usr.sbin/inetd/builtins.c
751
while (--n >= 0) {
usr.sbin/inetd/inetd.c
505
int n, ctrl;
usr.sbin/inetd/inetd.c
515
if ((n = select(maxsock + 1, &readable, NULL, NULL, NULL)) <= 0) {
usr.sbin/inetd/inetd.c
516
if (n < 0 && errno != EINTR) {
usr.sbin/inetd/inetd.c
550
for (sep = servtab; n && sep; sep = sep->se_next)
usr.sbin/inetd/inetd.c
552
n--;
usr.sbin/installer/libaura/popen.c
243
int n;
usr.sbin/installer/libaura/popen.c
264
n = select(fileno(p) + 1, &r, NULL, NULL, tvp);
usr.sbin/installer/libaura/popen.c
266
if (n == 0) {
usr.sbin/installer/libaura/popen.c
269
} else if (n < 0) {
usr.sbin/installer/libdfui/conn_tcp.c
433
read_data(FILE *f, char *buf, int n)
usr.sbin/installer/libdfui/conn_tcp.c
440
while (bcount < n) {
usr.sbin/installer/libdfui/conn_tcp.c
441
if ((br = fread(buf, 1, n - bcount, f)) > 0) {
usr.sbin/installer/libdfui/conn_tcp.c
454
write_data(FILE *f, const char *buf, int n)
usr.sbin/installer/libdfui/conn_tcp.c
461
while (bcount < n) {
usr.sbin/installer/libdfui/conn_tcp.c
462
if ((bw = fwrite(buf, 1, n - bcount, f)) > 0) {
usr.sbin/installer/libdfui/form.c
1148
int n = 0;
usr.sbin/installer/libdfui/form.c
1156
n++;
usr.sbin/installer/libdfui/form.c
1160
return(n);
usr.sbin/installer/libdfui/form.c
679
int n = 0;
usr.sbin/installer/libdfui/form.c
687
n++;
usr.sbin/installer/libdfui/form.c
691
return(n);
usr.sbin/installer/libdfui/form.c
732
int n = 0;
usr.sbin/installer/libdfui/form.c
740
n++;
usr.sbin/installer/libdfui/form.c
744
return(n);
usr.sbin/installer/libdfui/form.c
772
int n = 0;
usr.sbin/installer/libdfui/form.c
780
n++;
usr.sbin/installer/libdfui/form.c
784
return(n);
usr.sbin/installer/libinstaller/commands.c
295
int n;
usr.sbin/installer/libinstaller/commands.c
319
n = select(fileno(cmdout) + 1, &r, NULL, NULL, &tv);
usr.sbin/installer/libinstaller/commands.c
321
fprintf(stderr, "+ select() = %d\n", n);
usr.sbin/installer/libinstaller/commands.c
323
if (n < 0) {
usr.sbin/installer/libinstaller/commands.c
328
} else if (n == 0) {
usr.sbin/installer/libinstaller/commands.c
356
n = kill(pid, SIGTERM);
usr.sbin/installer/libinstaller/commands.c
358
fprintf(stderr, "+ kill() = %d\n", n);
usr.sbin/installer/libinstaller/commands.c
365
n = aura_pclose(cmdout) / 256;
usr.sbin/installer/libinstaller/commands.c
367
fprintf(stderr, "+ pclose() = %d\n", n);
usr.sbin/installer/libinstaller/commands.c
369
return(n);
usr.sbin/installer/libinstaller/commands.c
507
int n = 0;
usr.sbin/installer/libinstaller/commands.c
513
n++;
usr.sbin/installer/libinstaller/commands.c
539
dfui_progress_set_amount(pr, (i * 100) / n);
usr.sbin/installer/libinstaller/functions.c
281
next_power_of_two(unsigned long n)
usr.sbin/installer/libinstaller/functions.c
287
while (p < n && p > op) {
usr.sbin/installer/libinstaller/functions.c
292
return(p > op ? p : n);
usr.sbin/kbdcontrol/kbdcontrol.c
916
int n;
usr.sbin/kbdcontrol/kbdcontrol.c
929
for (n = 0; n < ndelays - 1; n++)
usr.sbin/kbdcontrol/kbdcontrol.c
930
if (delay <= delays[n])
usr.sbin/kbdcontrol/kbdcontrol.c
932
for (n = 0; n < nrepeats - 1; n++)
usr.sbin/kbdcontrol/kbdcontrol.c
933
if (repeat <= repeats[n])
usr.sbin/lpr/common_source/displayq.c
377
int *r, n;
usr.sbin/lpr/common_source/displayq.c
391
for (n = 0, cp = cfile+3; isdigit(*cp); )
usr.sbin/lpr/common_source/displayq.c
392
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/common_source/displayq.c
394
if (*r == n && !strcmp(cp, from_host))
usr.sbin/lpr/common_source/displayq.c
505
prank(int n)
usr.sbin/lpr/common_source/displayq.c
512
if (n == 0) {
usr.sbin/lpr/common_source/displayq.c
517
if ((n/10)%10 == 1)
usr.sbin/lpr/common_source/displayq.c
518
snprintf(rline, sizeof(rline), "%dth", n);
usr.sbin/lpr/common_source/displayq.c
520
snprintf(rline, sizeof(rline), "%d%s", n, r[n%10]);
usr.sbin/lpr/common_source/net.c
261
int i, n;
usr.sbin/lpr/common_source/net.c
269
n = 0;
usr.sbin/lpr/common_source/net.c
272
n++;
usr.sbin/lpr/common_source/net.c
275
n--; /* correct for count of trailing null */
usr.sbin/lpr/common_source/net.c
277
if (n > NIOV) {
usr.sbin/lpr/common_source/net.c
278
iovp = malloc(n * sizeof *iovp);
usr.sbin/lpr/common_source/net.c
285
for (i = 0; i < n; i++) {
usr.sbin/lpr/common_source/net.c
290
retval = writev(strm, iovp, n);
usr.sbin/lpr/common_source/rmjob.c
150
int i, n;
usr.sbin/lpr/common_source/rmjob.c
169
for (i = 1; (n = fread(current, sizeof(char), sizeof(current), fp)) <= 0; i++) {
usr.sbin/lpr/common_source/rmjob.c
171
n = 1;
usr.sbin/lpr/common_source/rmjob.c
176
current[n-1] = '\0';
usr.sbin/lpr/common_source/rmjob.c
226
int *r, n;
usr.sbin/lpr/common_source/rmjob.c
259
for (n = 0, cp = file+3; isdigit(*cp); )
usr.sbin/lpr/common_source/rmjob.c
260
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/common_source/rmjob.c
262
if (*r == n && isowner(line+1, file))
usr.sbin/lpr/common_source/startdaemon.c
57
int s, n;
usr.sbin/lpr/common_source/startdaemon.c
98
while ((n = read(s, &c, 1)) > 0)
usr.sbin/lpr/lpc/cmds.c
1207
int jobnum, n;
usr.sbin/lpr/lpc/cmds.c
1232
n = 0;
usr.sbin/lpr/lpc/cmds.c
1234
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/lpc/cmds.c
1235
if (jobnum != n)
usr.sbin/lpr/lpc/cmds.c
647
int didhead, i, n, nitems, rmcp;
usr.sbin/lpr/lpc/cmds.c
713
n = 0;
usr.sbin/lpr/lpc/cmds.c
719
n++;
usr.sbin/lpr/lpc/cmds.c
721
if (n == 0) {
usr.sbin/lpr/lpc/lpc.c
257
int n = 0;
usr.sbin/lpr/lpc/lpc.c
261
n < MAX_MARGV -1; n++) {
usr.sbin/lpr/lpd/lpd.c
463
int n;
usr.sbin/lpr/lpd/lpd.c
474
if ((n = read(STDOUT_FILENO, cp, 1)) != 1) {
usr.sbin/lpr/lpd/lpd.c
475
if (n < 0)
usr.sbin/lpr/lpd/printjob.c
590
int n, i;
usr.sbin/lpr/lpd/printjob.c
624
while ((n = read(fi, buf, BUFSIZ)) > 0)
usr.sbin/lpr/lpd/printjob.c
625
if (write(ofd, buf, n) != n) {
usr.sbin/lpr/lpd/printjob.c
675
n = 4;
usr.sbin/lpr/lpd/printjob.c
694
n = 5;
usr.sbin/lpr/lpd/printjob.c
700
n = 3;
usr.sbin/lpr/lpd/printjob.c
711
for (n = 0; n < 4; n++) {
usr.sbin/lpr/lpd/printjob.c
712
if (fonts[n][0] != '/')
usr.sbin/lpr/lpd/printjob.c
715
write(fo, fonts[n], strlen(fonts[n]));
usr.sbin/lpr/lpd/printjob.c
725
n = 3;
usr.sbin/lpr/lpd/printjob.c
731
n = 3;
usr.sbin/lpr/lpd/printjob.c
737
n = 3;
usr.sbin/lpr/lpd/printjob.c
743
n = 3;
usr.sbin/lpr/lpd/printjob.c
762
av[n++] = "-n";
usr.sbin/lpr/lpd/printjob.c
763
av[n++] = logname;
usr.sbin/lpr/lpd/printjob.c
764
av[n++] = "-h";
usr.sbin/lpr/lpd/printjob.c
765
av[n++] = origin_host;
usr.sbin/lpr/lpd/printjob.c
766
av[n++] = pp->acct_file;
usr.sbin/lpr/lpd/printjob.c
767
av[n] = NULL;
usr.sbin/lpr/lpd/printjob.c
794
n = open(tempstderr, O_WRONLY|O_TRUNC, 0664);
usr.sbin/lpr/lpd/printjob.c
795
if (n >= 0)
usr.sbin/lpr/lpd/printjob.c
796
dup2(n, 2);
usr.sbin/lpr/lpr/lpr.c
529
copy(const struct printer *pp, int f, const char n[])
usr.sbin/lpr/lpr/lpr.c
535
card('T', title ? title : n);
usr.sbin/lpr/lpr/lpr.c
539
card('N', n);
usr.sbin/lpr/lpr/lpr.c
544
printf("%s: %s: temp file write error\n", progname, n);
usr.sbin/lpr/lpr/lpr.c
553
progname, n);
usr.sbin/lpr/lpr/lpr.c
561
f ? n : "stdin");
usr.sbin/lpr/lpr/lpr.c
628
nfile(char *n)
usr.sbin/lpr/lpr/lpr.c
634
f = open(n, O_WRONLY | O_EXCL | O_CREAT, FILMOD);
usr.sbin/lpr/lpr/lpr.c
637
printf("%s: cannot create %s\n", progname, n);
usr.sbin/lpr/lpr/lpr.c
641
printf("%s: cannot chown %s\n", progname, n);
usr.sbin/lpr/lpr/lpr.c
645
if (++n[inchar] > 'z') {
usr.sbin/lpr/lpr/lpr.c
646
if (++n[inchar-2] == 't') {
usr.sbin/lpr/lpr/lpr.c
650
n[inchar] = 'A';
usr.sbin/lpr/lpr/lpr.c
651
} else if (n[inchar] == '[')
usr.sbin/lpr/lpr/lpr.c
652
n[inchar] = 'a';
usr.sbin/lpr/lpr/lpr.c
836
int len, fd, n;
usr.sbin/lpr/lpr/lpr.c
851
n = 0;
usr.sbin/lpr/lpr/lpr.c
856
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/lpr/lpr.c
860
tfname = lmktemp(pp, "tf", n, len);
usr.sbin/lpr/lpr/lpr.c
861
cfname = lmktemp(pp, "cf", n, len);
usr.sbin/lpr/lpr/lpr.c
862
dfname = lmktemp(pp, "df", n, len);
usr.sbin/lpr/lpr/lpr.c
864
n = (n + 1) % 1000;
usr.sbin/lpr/lpr/lpr.c
866
snprintf(buf, sizeof(buf), "%03d\n", n);
usr.sbin/makefs/cd9660.c
1482
} *n;
usr.sbin/makefs/cd9660.c
1484
#define PTQUEUE_NEW(n,s,r,t){\
usr.sbin/makefs/cd9660.c
1485
n = emalloc(sizeof(struct s)); \
usr.sbin/makefs/cd9660.c
1486
n->node = t;\
usr.sbin/makefs/cd9660.c
1508
PTQUEUE_NEW(n, ptq_entry, -1, diskStructure->rootNode);
usr.sbin/makefs/cd9660.c
1511
TAILQ_INSERT_HEAD(&pt_head, n, ptq);
usr.sbin/makefs/cd9660.c
1515
n = TAILQ_FIRST(&pt_head);
usr.sbin/makefs/cd9660.c
1516
dirNode = n->node;
usr.sbin/makefs/cd9660.c
1517
TAILQ_REMOVE(&pt_head, n, ptq);
usr.sbin/makefs/cd9660.c
1518
free(n);
usr.sbin/makefs/cd9660.c
1543
PTQUEUE_NEW(n, ptq_entry, -1, cn);
usr.sbin/makefs/cd9660.c
1544
TAILQ_INSERT_TAIL(&pt_head, n, ptq);
usr.sbin/makefs/cd9660/cd9660_debug.c
123
debug_print_path_tree(cd9660node *n)
usr.sbin/makefs/cd9660/cd9660_debug.c
125
cd9660node *iterator = n;
usr.sbin/makefs/cd9660/cd9660_debug.c
128
if (n->parent == NULL)
usr.sbin/makefs/cd9660/cd9660_debug.c
197
int n = 0;
usr.sbin/makefs/cd9660/cd9660_debug.c
209
debug_dump_to_xml_ptentry(&pttemp, n, mode);
usr.sbin/makefs/cd9660/cd9660_debug.c
210
n++;
usr.sbin/makefs/cd9660/cd9660_debug.c
50
print_n_tabs(int n)
usr.sbin/makefs/cd9660/cd9660_debug.c
54
for (i = 1; i <= n; i ++)
usr.sbin/makefs/cd9660/cd9660_debug.c
60
debug_print_rrip_info(cd9660node *n)
usr.sbin/makefs/cd9660/cd9660_debug.c
70
debug_print_susp_attrs(cd9660node *n, int indent)
usr.sbin/makefs/cd9660/cd9660_debug.c
74
TAILQ_FOREACH(t, &n->head, rr_ll) {
usr.sbin/makefs/ffs/buf.c
198
void *n;
usr.sbin/makefs/ffs/buf.c
234
n = erealloc(bp->b_data, (size_t)size);
usr.sbin/makefs/ffs/buf.c
235
memset(n, 0, (size_t)size);
usr.sbin/makefs/ffs/buf.c
236
bp->b_data = n;
usr.sbin/makefs/ffs/ffs_bswap.c
100
n->fs_pendingblocks = bswap64(o->fs_pendingblocks);
usr.sbin/makefs/ffs/ffs_bswap.c
101
n->fs_pendinginodes = bswap32(o->fs_pendinginodes);
usr.sbin/makefs/ffs/ffs_bswap.c
107
n->fs_snapinum[i] = bswap32(o->fs_snapinum[i]);
usr.sbin/makefs/ffs/ffs_bswap.c
108
n->fs_avgfilesize = bswap32(o->fs_avgfilesize);
usr.sbin/makefs/ffs/ffs_bswap.c
109
n->fs_avgfpdir = bswap32(o->fs_avgfpdir);
usr.sbin/makefs/ffs/ffs_bswap.c
111
n->fs_flags = bswap32(o->fs_flags);
usr.sbin/makefs/ffs/ffs_bswap.c
112
n->fs_contigsumsize = bswap32(o->fs_contigsumsize);
usr.sbin/makefs/ffs/ffs_bswap.c
113
n->fs_maxsymlinklen = bswap32(o->fs_maxsymlinklen);
usr.sbin/makefs/ffs/ffs_bswap.c
114
n->fs_old_inodefmt = bswap32(o->fs_old_inodefmt);
usr.sbin/makefs/ffs/ffs_bswap.c
115
n->fs_maxfilesize = bswap64(o->fs_maxfilesize);
usr.sbin/makefs/ffs/ffs_bswap.c
116
n->fs_qbmask = bswap64(o->fs_qbmask);
usr.sbin/makefs/ffs/ffs_bswap.c
117
n->fs_qfmask = bswap64(o->fs_qfmask);
usr.sbin/makefs/ffs/ffs_bswap.c
118
n->fs_state = bswap32(o->fs_state);
usr.sbin/makefs/ffs/ffs_bswap.c
119
n->fs_old_postblformat = bswap32(o->fs_old_postblformat);
usr.sbin/makefs/ffs/ffs_bswap.c
120
n->fs_old_nrpos = bswap32(o->fs_old_nrpos);
usr.sbin/makefs/ffs/ffs_bswap.c
121
n->fs_old_postbloff = bswap32(o->fs_old_postbloff);
usr.sbin/makefs/ffs/ffs_bswap.c
122
n->fs_old_rotbloff = bswap32(o->fs_old_rotbloff);
usr.sbin/makefs/ffs/ffs_bswap.c
124
n->fs_magic = bswap32(o->fs_magic);
usr.sbin/makefs/ffs/ffs_bswap.c
128
ffs_dinode1_swap(struct ufs1_dinode *o, struct ufs1_dinode *n)
usr.sbin/makefs/ffs/ffs_bswap.c
131
n->di_mode = bswap16(o->di_mode);
usr.sbin/makefs/ffs/ffs_bswap.c
132
n->di_nlink = bswap16(o->di_nlink);
usr.sbin/makefs/ffs/ffs_bswap.c
133
n->di_size = bswap64(o->di_size);
usr.sbin/makefs/ffs/ffs_bswap.c
134
n->di_atime = bswap32(o->di_atime);
usr.sbin/makefs/ffs/ffs_bswap.c
135
n->di_atimensec = bswap32(o->di_atimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
136
n->di_mtime = bswap32(o->di_mtime);
usr.sbin/makefs/ffs/ffs_bswap.c
137
n->di_mtimensec = bswap32(o->di_mtimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
138
n->di_ctime = bswap32(o->di_ctime);
usr.sbin/makefs/ffs/ffs_bswap.c
139
n->di_ctimensec = bswap32(o->di_ctimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
140
memcpy(n->di_db, o->di_db, sizeof(n->di_db));
usr.sbin/makefs/ffs/ffs_bswap.c
141
memcpy(n->di_ib, o->di_ib, sizeof(n->di_ib));
usr.sbin/makefs/ffs/ffs_bswap.c
142
n->di_flags = bswap32(o->di_flags);
usr.sbin/makefs/ffs/ffs_bswap.c
143
n->di_blocks = bswap32(o->di_blocks);
usr.sbin/makefs/ffs/ffs_bswap.c
144
n->di_gen = bswap32(o->di_gen);
usr.sbin/makefs/ffs/ffs_bswap.c
145
n->di_uid = bswap32(o->di_uid);
usr.sbin/makefs/ffs/ffs_bswap.c
146
n->di_gid = bswap32(o->di_gid);
usr.sbin/makefs/ffs/ffs_bswap.c
151
ffs_dinode2_swap(struct ufs2_dinode *o, struct ufs2_dinode *n)
usr.sbin/makefs/ffs/ffs_bswap.c
153
n->di_mode = bswap16(o->di_mode);
usr.sbin/makefs/ffs/ffs_bswap.c
154
n->di_nlink = bswap16(o->di_nlink);
usr.sbin/makefs/ffs/ffs_bswap.c
155
n->di_uid = bswap32(o->di_uid);
usr.sbin/makefs/ffs/ffs_bswap.c
156
n->di_gid = bswap32(o->di_gid);
usr.sbin/makefs/ffs/ffs_bswap.c
157
n->di_blksize = bswap32(o->di_blksize);
usr.sbin/makefs/ffs/ffs_bswap.c
158
n->di_size = bswap64(o->di_size);
usr.sbin/makefs/ffs/ffs_bswap.c
159
n->di_blocks = bswap64(o->di_blocks);
usr.sbin/makefs/ffs/ffs_bswap.c
160
n->di_atime = bswap64(o->di_atime);
usr.sbin/makefs/ffs/ffs_bswap.c
161
n->di_atimensec = bswap32(o->di_atimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
162
n->di_mtime = bswap64(o->di_mtime);
usr.sbin/makefs/ffs/ffs_bswap.c
163
n->di_mtimensec = bswap32(o->di_mtimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
164
n->di_ctime = bswap64(o->di_ctime);
usr.sbin/makefs/ffs/ffs_bswap.c
165
n->di_ctimensec = bswap32(o->di_ctimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
166
n->di_birthtime = bswap64(o->di_ctime);
usr.sbin/makefs/ffs/ffs_bswap.c
167
n->di_birthnsec = bswap32(o->di_ctimensec);
usr.sbin/makefs/ffs/ffs_bswap.c
168
n->di_gen = bswap32(o->di_gen);
usr.sbin/makefs/ffs/ffs_bswap.c
169
n->di_kernflags = bswap32(o->di_kernflags);
usr.sbin/makefs/ffs/ffs_bswap.c
170
n->di_flags = bswap32(o->di_flags);
usr.sbin/makefs/ffs/ffs_bswap.c
171
n->di_extsize = bswap32(o->di_extsize);
usr.sbin/makefs/ffs/ffs_bswap.c
172
memcpy(n->di_extb, o->di_extb, sizeof(n->di_extb));
usr.sbin/makefs/ffs/ffs_bswap.c
173
memcpy(n->di_db, o->di_db, sizeof(n->di_db));
usr.sbin/makefs/ffs/ffs_bswap.c
174
memcpy(n->di_ib, o->di_ib, sizeof(n->di_ib));
usr.sbin/makefs/ffs/ffs_bswap.c
179
ffs_csum_swap(struct csum *o, struct csum *n, int size)
usr.sbin/makefs/ffs/ffs_bswap.c
185
nint = (u_int32_t*)n;
usr.sbin/makefs/ffs/ffs_bswap.c
192
ffs_csumtotal_swap(struct csum_total *o, struct csum_total *n)
usr.sbin/makefs/ffs/ffs_bswap.c
194
n->cs_ndir = bswap64(o->cs_ndir);
usr.sbin/makefs/ffs/ffs_bswap.c
195
n->cs_nbfree = bswap64(o->cs_nbfree);
usr.sbin/makefs/ffs/ffs_bswap.c
196
n->cs_nifree = bswap64(o->cs_nifree);
usr.sbin/makefs/ffs/ffs_bswap.c
197
n->cs_nffree = bswap64(o->cs_nffree);
usr.sbin/makefs/ffs/ffs_bswap.c
204
ffs_cg_swap(struct cg *o, struct cg *n, struct fs *fs)
usr.sbin/makefs/ffs/ffs_bswap.c
211
n->cg_firstfield = bswap32(o->cg_firstfield);
usr.sbin/makefs/ffs/ffs_bswap.c
212
n->cg_magic = bswap32(o->cg_magic);
usr.sbin/makefs/ffs/ffs_bswap.c
213
n->cg_old_time = bswap32(o->cg_old_time);
usr.sbin/makefs/ffs/ffs_bswap.c
214
n->cg_cgx = bswap32(o->cg_cgx);
usr.sbin/makefs/ffs/ffs_bswap.c
215
n->cg_old_ncyl = bswap16(o->cg_old_ncyl);
usr.sbin/makefs/ffs/ffs_bswap.c
216
n->cg_old_niblk = bswap16(o->cg_old_niblk);
usr.sbin/makefs/ffs/ffs_bswap.c
217
n->cg_ndblk = bswap32(o->cg_ndblk);
usr.sbin/makefs/ffs/ffs_bswap.c
218
n->cg_cs.cs_ndir = bswap32(o->cg_cs.cs_ndir);
usr.sbin/makefs/ffs/ffs_bswap.c
219
n->cg_cs.cs_nbfree = bswap32(o->cg_cs.cs_nbfree);
usr.sbin/makefs/ffs/ffs_bswap.c
220
n->cg_cs.cs_nifree = bswap32(o->cg_cs.cs_nifree);
usr.sbin/makefs/ffs/ffs_bswap.c
221
n->cg_cs.cs_nffree = bswap32(o->cg_cs.cs_nffree);
usr.sbin/makefs/ffs/ffs_bswap.c
222
n->cg_rotor = bswap32(o->cg_rotor);
usr.sbin/makefs/ffs/ffs_bswap.c
223
n->cg_frotor = bswap32(o->cg_frotor);
usr.sbin/makefs/ffs/ffs_bswap.c
224
n->cg_irotor = bswap32(o->cg_irotor);
usr.sbin/makefs/ffs/ffs_bswap.c
226
n->cg_frsum[i] = bswap32(o->cg_frsum[i]);
usr.sbin/makefs/ffs/ffs_bswap.c
228
n->cg_old_btotoff = bswap32(o->cg_old_btotoff);
usr.sbin/makefs/ffs/ffs_bswap.c
229
n->cg_old_boff = bswap32(o->cg_old_boff);
usr.sbin/makefs/ffs/ffs_bswap.c
230
n->cg_iusedoff = bswap32(o->cg_iusedoff);
usr.sbin/makefs/ffs/ffs_bswap.c
231
n->cg_freeoff = bswap32(o->cg_freeoff);
usr.sbin/makefs/ffs/ffs_bswap.c
232
n->cg_nextfreeoff = bswap32(o->cg_nextfreeoff);
usr.sbin/makefs/ffs/ffs_bswap.c
233
n->cg_clustersumoff = bswap32(o->cg_clustersumoff);
usr.sbin/makefs/ffs/ffs_bswap.c
234
n->cg_clusteroff = bswap32(o->cg_clusteroff);
usr.sbin/makefs/ffs/ffs_bswap.c
235
n->cg_nclusterblks = bswap32(o->cg_nclusterblks);
usr.sbin/makefs/ffs/ffs_bswap.c
237
n->cg_niblk = bswap32(o->cg_niblk);
usr.sbin/makefs/ffs/ffs_bswap.c
238
n->cg_initediblk = bswap32(o->cg_initediblk);
usr.sbin/makefs/ffs/ffs_bswap.c
239
n->cg_time = bswap64(o->cg_time);
usr.sbin/makefs/ffs/ffs_bswap.c
247
if (n->cg_magic == CG_MAGIC) {
usr.sbin/makefs/ffs/ffs_bswap.c
248
btotoff = n->cg_old_btotoff;
usr.sbin/makefs/ffs/ffs_bswap.c
249
boff = n->cg_old_boff;
usr.sbin/makefs/ffs/ffs_bswap.c
250
clustersumoff = n->cg_clustersumoff;
usr.sbin/makefs/ffs/ffs_bswap.c
252
btotoff = bswap32(n->cg_old_btotoff);
usr.sbin/makefs/ffs/ffs_bswap.c
253
boff = bswap32(n->cg_old_boff);
usr.sbin/makefs/ffs/ffs_bswap.c
254
clustersumoff = bswap32(n->cg_clustersumoff);
usr.sbin/makefs/ffs/ffs_bswap.c
256
n32 = (u_int32_t *)((u_int8_t *)n + btotoff);
usr.sbin/makefs/ffs/ffs_bswap.c
258
n16 = (u_int16_t *)((u_int8_t *)n + boff);
usr.sbin/makefs/ffs/ffs_bswap.c
267
n32 = (u_int32_t *)((u_int8_t *)n + clustersumoff);
usr.sbin/makefs/ffs/ffs_bswap.c
64
void ffs_csum_swap(struct csum *o, struct csum *n, int size);
usr.sbin/makefs/ffs/ffs_bswap.c
65
void ffs_csumtotal_swap(struct csum_total *o, struct csum_total *n);
usr.sbin/makefs/ffs/ffs_bswap.c
68
ffs_sb_swap(struct fs *o, struct fs *n)
usr.sbin/makefs/ffs/ffs_bswap.c
79
n32 = (u_int32_t *)n;
usr.sbin/makefs/ffs/ffs_bswap.c
83
n->fs_swuid = bswap64(o->fs_swuid);
usr.sbin/makefs/ffs/ffs_bswap.c
84
n->fs_cgrotor = bswap32(o->fs_cgrotor); /* Unused */
usr.sbin/makefs/ffs/ffs_bswap.c
85
n->fs_old_cpc = bswap32(o->fs_old_cpc);
usr.sbin/makefs/ffs/ffs_bswap.c
92
n->fs_maxbsize = bswap32(o->fs_maxbsize);
usr.sbin/makefs/ffs/ffs_bswap.c
93
n->fs_sblockloc = bswap64(o->fs_sblockloc);
usr.sbin/makefs/ffs/ffs_bswap.c
95
ffs_csumtotal_swap(&o->fs_cstotal, &n->fs_cstotal);
usr.sbin/makefs/ffs/ffs_bswap.c
96
n->fs_time = bswap64(o->fs_time);
usr.sbin/makefs/ffs/ffs_bswap.c
97
n->fs_size = bswap64(o->fs_size);
usr.sbin/makefs/ffs/ffs_bswap.c
98
n->fs_dsize = bswap64(o->fs_dsize);
usr.sbin/makefs/ffs/ffs_bswap.c
99
n->fs_csaddr = bswap64(o->fs_csaddr);
usr.sbin/makefs/ffs/mkfs.c
874
int n;
usr.sbin/makefs/ffs/mkfs.c
881
n = read(fsopts->fd, bf, size);
usr.sbin/makefs/ffs/mkfs.c
882
if (n == -1) {
usr.sbin/makefs/ffs/mkfs.c
887
else if (n != size)
usr.sbin/makefs/ffs/mkfs.c
898
int n;
usr.sbin/makefs/ffs/mkfs.c
905
n = write(fsopts->fd, bf, size);
usr.sbin/makefs/ffs/mkfs.c
906
if (n == -1)
usr.sbin/makefs/ffs/mkfs.c
909
else if (n != size)
usr.sbin/makefs/ffs/mkfs.c
929
u_int n;
usr.sbin/makefs/ffs/mkfs.c
931
for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
usr.sbin/makefs/ffs/mkfs.c
932
if (1 << n == val)
usr.sbin/makefs/ffs/mkfs.c
933
return (n);
usr.sbin/makefs/hammer2.c
1276
size_t n;
usr.sbin/makefs/hammer2.c
1291
n = strlen(p);
usr.sbin/makefs/hammer2.c
1293
for (i = 0; i < n; i++) {
usr.sbin/makefs/hammer2.c
1309
n = strlen(p);
usr.sbin/makefs/hammer2.c
1311
for (i = 0; i < n; i++) {
usr.sbin/makefs/hammer2.c
2230
size_t resid, n;
usr.sbin/makefs/hammer2.c
2266
n = resid >= HAMMER2_PBUFSIZE ? HAMMER2_PBUFSIZE : resid;
usr.sbin/makefs/hammer2.c
2267
error = write(fd, buf, n);
usr.sbin/makefs/hammer2.c
2270
else if (error != n)
usr.sbin/makefs/hammer2.c
2273
resid -= n;
usr.sbin/makefs/hammer2.c
542
size_t n;
usr.sbin/makefs/hammer2.c
548
n = strlen(p);
usr.sbin/makefs/hammer2.c
550
n = 0;
usr.sbin/makefs/hammer2.c
556
if (n == 0 || n > NAME_MAX)
usr.sbin/makefs/hammer2.c
560
if (n == 0 || n > NAME_MAX)
usr.sbin/makefs/hammer2.c
564
if (n == 0 || n > NAME_MAX)
usr.sbin/makefs/hammer2.c
568
if (n > NAME_MAX)
usr.sbin/makefs/hammer2.c
576
if (n > 0)
usr.sbin/makefs/hammer2.c
587
size_t n;
usr.sbin/makefs/hammer2.c
593
n = strlen(p);
usr.sbin/makefs/hammer2.c
595
n = 0;
usr.sbin/makefs/hammer2.c
599
if (n == 0 || n > PATH_MAX)
usr.sbin/makefs/hammer2.c
603
if (n == 0 || n > PATH_MAX - 10)
usr.sbin/makefs/hammer2.c
607
if (n == 0 || n > PATH_MAX - 10)
usr.sbin/makefs/hammer2.c
615
if (n > 0)
usr.sbin/makefs/hammer2/hammer2.h
2062
int uiomove(caddr_t cp, size_t n, struct uio *uio);
usr.sbin/makefs/hammer2/hammer2.h
2063
int uiomovebp(struct m_buf *bp, caddr_t cp, size_t n, struct uio *uio);
usr.sbin/makefs/hammer2/hammer2_buf.c
125
uiomove(caddr_t cp, size_t n, struct uio *uio)
usr.sbin/makefs/hammer2/hammer2_buf.c
134
while (n > 0 && uio->uio_resid) {
usr.sbin/makefs/hammer2/hammer2_buf.c
142
if (cnt > n)
usr.sbin/makefs/hammer2/hammer2_buf.c
143
cnt = n;
usr.sbin/makefs/hammer2/hammer2_buf.c
171
n -= cnt;
usr.sbin/makefs/hammer2/hammer2_buf.c
178
uiomovebp(struct m_buf *bp, caddr_t cp, size_t n, struct uio *uio)
usr.sbin/makefs/hammer2/hammer2_buf.c
180
return (uiomove(cp, n, uio));
usr.sbin/makefs/hammer2/hammer2_bulkfree.c
1379
int n;
usr.sbin/makefs/hammer2/hammer2_bulkfree.c
1382
n = hammer2_icrc32(&bref->data_off, sizeof(bref->data_off));
usr.sbin/makefs/hammer2/hammer2_bulkfree.c
1383
dedup = cbinfo->dedup + (n & (HAMMER2_DEDUP_HEUR_MASK & ~7));
usr.sbin/makefs/hammer2/hammer2_compat.h
71
#define ksnprintf(s, n, ...) snprintf(s, n, ## __VA_ARGS__)
usr.sbin/makefs/hammer2/hammer2_freemap.c
369
int n;
usr.sbin/makefs/hammer2/hammer2_freemap.c
392
n = start + count;
usr.sbin/makefs/hammer2/hammer2_freemap.c
393
bmap = &chain->data->bmdata[n];
usr.sbin/makefs/hammer2/hammer2_freemap.c
395
if (n >= HAMMER2_FREEMAP_COUNT) {
usr.sbin/makefs/hammer2/hammer2_freemap.c
414
base_key = key + n * l0size;
usr.sbin/makefs/hammer2/hammer2_freemap.c
416
class, n,
usr.sbin/makefs/hammer2/hammer2_freemap.c
436
n = start - count;
usr.sbin/makefs/hammer2/hammer2_freemap.c
437
bmap = &chain->data->bmdata[n];
usr.sbin/makefs/hammer2/hammer2_freemap.c
438
if (n < 0) {
usr.sbin/makefs/hammer2/hammer2_freemap.c
457
base_key = key + n * l0size;
usr.sbin/makefs/hammer2/hammer2_freemap.c
459
class, n,
usr.sbin/makefs/hammer2/hammer2_freemap.c
550
uint16_t class, int n, int sub_key,
usr.sbin/makefs/hammer2/hammer2_freemap.c
65
int n, int sub_key, int radix, hammer2_key_t *basep);
usr.sbin/makefs/hammer2/hammer2_freemap.c
748
if (n & 1) {
usr.sbin/makefs/hammer2/hammer2_vnops.c
1113
int n;
usr.sbin/makefs/hammer2/hammer2_vnops.c
1175
n = lblksize - loff;
usr.sbin/makefs/hammer2/hammer2_vnops.c
1176
if (n > uio->uio_resid)
usr.sbin/makefs/hammer2/hammer2_vnops.c
1177
n = uio->uio_resid;
usr.sbin/makefs/hammer2/hammer2_vnops.c
1178
if (n > size - uio->uio_offset)
usr.sbin/makefs/hammer2/hammer2_vnops.c
1179
n = (int)(size - uio->uio_offset);
usr.sbin/makefs/hammer2/hammer2_vnops.c
1181
uiomovebp(bp, bp->b_data + loff, n, uio);
usr.sbin/makefs/hammer2/hammer2_vnops.c
1250
int n;
usr.sbin/makefs/hammer2/hammer2_vnops.c
1276
n = lblksize - loff;
usr.sbin/makefs/hammer2/hammer2_vnops.c
1277
if (n > uio->uio_resid) {
usr.sbin/makefs/hammer2/hammer2_vnops.c
1278
n = uio->uio_resid;
usr.sbin/makefs/hammer2/hammer2_vnops.c
1279
if (loff == lbase && uio->uio_offset + n == new_eof)
usr.sbin/makefs/hammer2/hammer2_vnops.c
1347
error = uiomovebp(bp, bp->b_data + loff, n, uio);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_adler32.c
108
n = NMAX / 16; /* NMAX is divisible by 16 */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_adler32.c
112
} while (--n);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_adler32.c
72
unsigned n;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
805
register unsigned n, m;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
844
n = s->hash_size;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
845
p = &s->head[n];
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
849
} while (--n);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
851
n = wsize;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
853
p = &s->prev[n];
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
860
} while (--n);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
879
n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_deflate.c
880
s->lookahead += n;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
449
#define NEEDBITS(n) \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
451
while (bits < (unsigned)(n)) \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
456
#define BITS(n) \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
457
((unsigned)hold & ((1U << (n)) - 1))
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
460
#define DROPBITS(n) \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
462
hold >>= (n); \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_inflate.c
463
bits -= (unsigned)(n); \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
1134
int n;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
1137
for (n = 0; n <= 31; n++, black_mask >>= 1)
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
1138
if ((black_mask & 1) && (s->dyn_ltree[n].Freq != 0))
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
1145
for (n = 32; n < LITERALS; n++)
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
1146
if (s->dyn_ltree[n].Freq != 0)
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
239
int n; /* iterates over tree elements */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
262
for (n = 0; n < (1<<extra_lbits[code]); n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
277
for (n = 0; n < (1<<extra_dbits[code]); n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
285
for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
293
n = 0;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
294
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
295
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
296
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
297
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
305
for (n = 0; n < D_CODES; n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
306
static_dtree[n].Len = 5;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
307
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
416
int n; /* iterates over tree elements */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
419
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
420
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
421
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
447
#define smaller(tree, n, m, depth) \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
448
(tree[n].Freq < tree[m].Freq || \
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
449
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
502
int n, m; /* iterate over the tree elements */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
516
n = s->heap[h];
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
517
bits = tree[tree[n].Dad].Len + 1;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
519
tree[n].Len = (ush)bits;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
522
if (n > max_code) continue; /* not a leaf node */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
526
if (n >= base) xbits = extra[n-base];
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
527
f = tree[n].Freq;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
529
if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
555
n = s->bl_count[bits];
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
556
while (n != 0) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
565
n--;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
588
int n; /* code index */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
603
for (n = 0; n <= max_code; n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
604
int len = tree[n].Len;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
607
tree[n].Code = bi_reverse(next_code[len]++, len);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
610
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
629
int n, m; /* iterate over heap elements */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
639
for (n = 0; n < elems; n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
640
if (tree[n].Freq != 0) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
641
s->heap[++(s->heap_len)] = max_code = n;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
642
s->depth[n] = 0;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
644
tree[n].Len = 0;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
665
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
672
pqremove(s, tree, n); /* n = node of least frequency */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
675
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
679
tree[node].Freq = tree[n].Freq + tree[m].Freq;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
680
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
681
s->depth[n] : s->depth[m]) + 1);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
682
tree[n].Dad = tree[m].Dad = (ush)node;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
686
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
716
int n; /* iterates over all tree elements */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
727
for (n = 0; n <= max_code; n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
728
curlen = nextlen; nextlen = tree[n+1].Len;
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
760
int n; /* iterates over all tree elements */
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
771
for (n = 0; n <= max_code; n++) {
usr.sbin/makefs/hammer2/zlib/hammer2_zlib_trees.c
772
curlen = nextlen; nextlen = tree[n+1].Len;
usr.sbin/makefs/msdos/msdosfs_conv.c
451
char8ucs2str(const uint8_t *in, int n, uint16_t *out, int m)
usr.sbin/makefs/msdos/msdosfs_conv.c
456
while (n > 0 && in[0] != 0) {
usr.sbin/makefs/msdos/msdosfs_conv.c
464
n -= 1;
usr.sbin/makefs/msdos/msdosfs_conv.c
486
char8match(uint16_t *w1, uint16_t *w2, int n)
usr.sbin/makefs/msdos/msdosfs_conv.c
490
while (n > 0) {
usr.sbin/makefs/msdos/msdosfs_conv.c
503
--n;
usr.sbin/makefs/msdos/msdosfs_conv.c
67
static int char8ucs2str(const uint8_t *in, int n, uint16_t *out, int m);
usr.sbin/makefs/msdos/msdosfs_conv.c
69
static int char8match(uint16_t *w1, uint16_t *w2, int n);
usr.sbin/makefs/msdos/msdosfs_fat.c
686
u_long cl, n;
usr.sbin/makefs/msdos/msdosfs_fat.c
690
for (cl = start, n = count; n-- > 0;)
usr.sbin/makefs/msdos/msdosfs_fat.c
698
for (cl = start, n = count; n-- > 0;)
usr.sbin/makefs/mtree.c
428
fsnode *n;
usr.sbin/makefs/mtree.c
430
n = ecalloc(1, sizeof(*n));
usr.sbin/makefs/mtree.c
431
n->name = estrdup(name);
usr.sbin/makefs/mtree.c
432
n->type = (type == 0) ? global->type : type;
usr.sbin/makefs/mtree.c
433
n->parent = parent;
usr.sbin/makefs/mtree.c
435
n->inode = ecalloc(1, sizeof(*n->inode));
usr.sbin/makefs/mtree.c
438
memcpy(n->inode, global->inode, sizeof(*n->inode));
usr.sbin/makefs/mtree.c
439
n->inode->st.st_mode = (n->inode->st.st_mode & ~S_IFMT) | n->type;
usr.sbin/makefs/mtree.c
441
if (n->type == S_IFLNK)
usr.sbin/makefs/mtree.c
442
n->symlink = global->symlink;
usr.sbin/makefs/mtree.c
443
else if (n->type == S_IFREG)
usr.sbin/makefs/mtree.c
444
n->contents = global->contents;
usr.sbin/makefs/mtree.c
446
return (n);
usr.sbin/makefs/mtree.c
450
destroy_node(fsnode *n)
usr.sbin/makefs/mtree.c
453
assert(n != NULL);
usr.sbin/makefs/mtree.c
454
assert(n->name != NULL);
usr.sbin/makefs/mtree.c
455
assert(n->inode != NULL);
usr.sbin/makefs/mtree.c
457
free(n->inode);
usr.sbin/makefs/mtree.c
458
free(n->name);
usr.sbin/makefs/mtree.c
459
free(n);
usr.sbin/makefs/walk.c
491
#define ASEPRINT(t, b, o, n) \
usr.sbin/makefs/walk.c
494
t, o, n)
usr.sbin/mixer/mixer.c
115
int ch, i, bar, baz, dev, m, n, t;
usr.sbin/mixer/mixer.c
120
n = strtol(name + 5, &eptr, 10) - 1;
usr.sbin/mixer/mixer.c
121
if (n > 0 && *eptr == '\0')
usr.sbin/mixer/mixer.c
122
snprintf(mixer, PATH_MAX - 1, "/dev/mixer%d", n);
usr.sbin/mixer/mixer.c
127
n = 1;
usr.sbin/mixer/mixer.c
129
if (n >= argc || *argv[n] != '-')
usr.sbin/mixer/mixer.c
131
if (strlen(argv[n]) != 2) {
usr.sbin/mixer/mixer.c
132
if (strcmp(argv[n] + 1, "rec") != 0)
usr.sbin/mixer/mixer.c
136
ch = *(argv[n] + 1);
usr.sbin/mixer/mixer.c
137
if (ch == 'f' && n < argc - 1) {
usr.sbin/mixer/mixer.c
138
name = argv[n + 1];
usr.sbin/mixer/mixer.c
139
n += 2;
usr.sbin/mixer/mixer.c
142
n++;
usr.sbin/mixer/mixer.c
145
n++;
usr.sbin/mixer/mixer.c
154
argc -= n - 1;
usr.sbin/mixer/mixer.c
155
argv += n - 1;
usr.sbin/mixer/mixer.c
168
for (i = 0, n = 0; i < SOUND_MIXER_NRDEVICES; i++) {
usr.sbin/mixer/mixer.c
176
printf("%s%s%c%d:%d", n ? " " : "",
usr.sbin/mixer/mixer.c
179
n++;
usr.sbin/mixer/mixer.c
185
if (n && recmask)
usr.sbin/mixer/mixer.c
194
n = 0;
usr.sbin/mixer/mixer.c
270
printf("%s%s%c%d:%d", n ? " " : "",
usr.sbin/mixer/mixer.c
273
n++;
usr.sbin/mixer/mixer.c
35
int i, n;
usr.sbin/mixer/mixer.c
42
for (i = 0, n = 0; i < SOUND_MIXER_NRDEVICES; i++) {
usr.sbin/mixer/mixer.c
44
if (n)
usr.sbin/mixer/mixer.c
47
n++;
usr.sbin/mixer/mixer.c
53
for (i = 0, n = 0; i < SOUND_MIXER_NRDEVICES; i++) {
usr.sbin/mixer/mixer.c
55
if (n)
usr.sbin/mixer/mixer.c
58
n++;
usr.sbin/mixer/mixer.c
84
int i, n;
usr.sbin/mixer/mixer.c
92
for (i = 0, n = 0; i < SOUND_MIXER_NRDEVICES; i++) {
usr.sbin/mixer/mixer.c
95
printf("%srec ", n ? " +" : "=");
usr.sbin/mixer/mixer.c
96
else if (n)
usr.sbin/mixer/mixer.c
99
n++;
usr.sbin/mpsutil/mpsutil.c
215
int n, tmp, retval = 0;
usr.sbin/mpsutil/mpsutil.c
223
n = *q++;
usr.sbin/mpsutil/mpsutil.c
224
if (num & (1 << (n - 1))) {
usr.sbin/mpsutil/mpsutil.c
226
for (; (n = *q) > ' '; ++q)
usr.sbin/mpsutil/mpsutil.c
227
PCHAR(n);
usr.sbin/mtest/mtest.c
106
if( (n = sscanf( lineptr, "%s %x.%x.%x.%x.%x.%x",
usr.sbin/mtest/mtest.c
138
if( (n = sscanf( lineptr, "%s %x.%x.%x.%x.%x.%x",
usr.sbin/mtest/mtest.c
168
if( (n = sscanf( lineptr, "%s %u", ifr.ifr_name, &f )) != 2 )
usr.sbin/mtest/mtest.c
192
if( (n = sscanf( lineptr, "%s %u", ifr.ifr_name, &f )) != 2 )
usr.sbin/mtest/mtest.c
29
int n, f;
usr.sbin/mtest/mtest.c
62
if( (n = sscanf( lineptr, "%u.%u.%u.%u %u.%u.%u.%u",
usr.sbin/mtest/mtest.c
83
if( (n = sscanf( lineptr, "%u.%u.%u.%u %u.%u.%u.%u",
usr.sbin/mtree/excludes.c
100
#define MATCH(g, n) (fnmatch((g), (n), FNM_PATHNAME) == 0)
usr.sbin/mtree/pack_dev.c
101
if (n == 2) {
usr.sbin/mtree/pack_dev.c
119
pack_8_8(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
123
if (n == 2) {
usr.sbin/mtree/pack_dev.c
141
pack_12_20(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
145
if (n == 2) {
usr.sbin/mtree/pack_dev.c
163
pack_14_18(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
167
if (n == 2) {
usr.sbin/mtree/pack_dev.c
185
pack_8_24(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
189
if (n == 2) {
usr.sbin/mtree/pack_dev.c
209
pack_bsdos(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
213
if (n == 2) {
usr.sbin/mtree/pack_dev.c
219
} else if (n == 3) {
usr.sbin/mtree/pack_dev.c
58
pack_native(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
62
if (n == 2) {
usr.sbin/mtree/pack_dev.c
75
pack_netbsd(int n, u_long numbers[], const char **error)
usr.sbin/mtree/pack_dev.c
79
if (n == 2) {
usr.sbin/mtree/pack_dev.c
97
pack_freebsd(int n, u_long numbers[], const char **error)
usr.sbin/mtree/specspec.c
49
shownode(NODE *n, int f, char const *path)
usr.sbin/mtree/specspec.c
54
printf("%s%s %s", path, n->name, inotype(nodetoino(n->type)));
usr.sbin/mtree/specspec.c
56
printf(" cksum=%lu", n->cksum);
usr.sbin/mtree/specspec.c
58
printf(" gid=%d", n->st_gid);
usr.sbin/mtree/specspec.c
60
gr = getgrgid(n->st_gid);
usr.sbin/mtree/specspec.c
62
printf(" gid=%d", n->st_gid);
usr.sbin/mtree/specspec.c
67
printf(" mode=%o", n->st_mode);
usr.sbin/mtree/specspec.c
69
printf(" nlink=%ju", (uintmax_t)n->st_nlink);
usr.sbin/mtree/specspec.c
71
printf(" size=%jd", (intmax_t)n->st_size);
usr.sbin/mtree/specspec.c
73
printf(" uid=%d", n->st_uid);
usr.sbin/mtree/specspec.c
75
pw = getpwuid(n->st_uid);
usr.sbin/mtree/specspec.c
77
printf(" uid=%d", n->st_uid);
usr.sbin/mtree/specspec.c
82
printf(" %s=%s", MD5KEY, n->md5digest);
usr.sbin/mtree/specspec.c
84
printf(" %s=%s", SHA1KEY, n->sha1digest);
usr.sbin/mtree/specspec.c
86
printf(" %s=%s", RMD160KEY, n->rmd160digest);
usr.sbin/mtree/specspec.c
88
printf(" %s=%s", SHA256KEY, n->sha256digest);
usr.sbin/mtree/specspec.c
90
printf(" %s=%s", SHA384KEY, n->sha384digest);
usr.sbin/mtree/specspec.c
92
printf(" %s=%s", SHA512KEY, n->sha512digest);
usr.sbin/mtree/specspec.c
94
printf(" flags=%s", flags_to_string(n->st_flags, "none"));
usr.sbin/ndp/ndp.c
1118
struct in6_prefix *p, *ep, *n;
usr.sbin/ndp/ndp.c
1146
for (p = (struct in6_prefix *)buf; p < ep; p = n) {
usr.sbin/ndp/ndp.c
1148
n = (struct in6_prefix *)&advrtr[p->advrtrs];
usr.sbin/ndp/ndp.c
809
ndp_ether_aton(char *a, u_char *n)
usr.sbin/ndp/ndp.c
820
n[i] = o[i];
usr.sbin/pfctl/parse.y
1396
struct node_host *n;
usr.sbin/pfctl/parse.y
1399
for (n = $3; n != NULL; n = n->next) {
usr.sbin/pfctl/parse.y
1400
switch (n->addr.type) {
usr.sbin/pfctl/parse.y
1424
n->addr.type);
usr.sbin/pfctl/parse.y
2632
struct node_host *n;
usr.sbin/pfctl/parse.y
2645
if ((n = ifa_exists($1)) != NULL)
usr.sbin/pfctl/parse.y
2646
$$->ifa_flags = n->ifa_flags;
usr.sbin/pfctl/parse.y
2809
struct node_host *n;
usr.sbin/pfctl/parse.y
2811
for (n = $2; n != NULL; n = n->next)
usr.sbin/pfctl/parse.y
2812
n->not = $1;
usr.sbin/pfctl/parse.y
2908
struct node_host *n;
usr.sbin/pfctl/parse.y
2915
for (n = $1; n != NULL; n = n->next)
usr.sbin/pfctl/parse.y
2916
set_ipmask(n, $3);
usr.sbin/pfctl/parse.y
4617
#define LOOP_THROUGH(T,n,r,C) \
usr.sbin/pfctl/parse.y
4619
T *n; \
usr.sbin/pfctl/parse.y
4626
n = r; \
usr.sbin/pfctl/parse.y
4627
while (n != NULL) { \
usr.sbin/pfctl/parse.y
4631
n = n->next; \
usr.sbin/pfctl/parse.y
4760
char n[4];
usr.sbin/pfctl/parse.y
4767
snprintf(n, sizeof(n), "%u", proto);
usr.sbin/pfctl/parse.y
4768
expand_label_str(label, len, name, n);
usr.sbin/pfctl/parse.y
4776
char n[11];
usr.sbin/pfctl/parse.y
4779
snprintf(n, sizeof(n), "%u", pf->anchor->match);
usr.sbin/pfctl/parse.y
4780
expand_label_str(label, len, name, n);
usr.sbin/pfctl/parse.y
4806
struct node_queue *n;
usr.sbin/pfctl/parse.y
4875
n = calloc(1, sizeof(struct node_queue));
usr.sbin/pfctl/parse.y
4876
if (n == NULL)
usr.sbin/pfctl/parse.y
4881
if (strlcpy(n->parent, qname,
usr.sbin/pfctl/parse.y
4882
sizeof(n->parent)) >=
usr.sbin/pfctl/parse.y
4883
sizeof(n->parent))
usr.sbin/pfctl/parse.y
4885
if (strlcpy(n->queue, queue->queue,
usr.sbin/pfctl/parse.y
4886
sizeof(n->queue)) >= sizeof(n->queue))
usr.sbin/pfctl/parse.y
4888
if (strlcpy(n->ifname, interface->ifname,
usr.sbin/pfctl/parse.y
4889
sizeof(n->ifname)) >= sizeof(n->ifname))
usr.sbin/pfctl/parse.y
4891
n->scheduler = pa.scheduler;
usr.sbin/pfctl/parse.y
4892
n->next = NULL;
usr.sbin/pfctl/parse.y
4893
n->tail = n;
usr.sbin/pfctl/parse.y
4895
queues = n;
usr.sbin/pfctl/parse.y
4897
queues->tail->next = n;
usr.sbin/pfctl/parse.y
4898
queues->tail = n;
usr.sbin/pfctl/parse.y
4914
struct node_queue *n, *nq;
usr.sbin/pfctl/parse.y
4990
n = calloc(1,
usr.sbin/pfctl/parse.y
4992
if (n == NULL)
usr.sbin/pfctl/parse.y
4994
if (strlcpy(n->parent, a->qname,
usr.sbin/pfctl/parse.y
4995
sizeof(n->parent)) >=
usr.sbin/pfctl/parse.y
4996
sizeof(n->parent))
usr.sbin/pfctl/parse.y
4998
if (strlcpy(n->queue, nq->queue,
usr.sbin/pfctl/parse.y
4999
sizeof(n->queue)) >=
usr.sbin/pfctl/parse.y
5000
sizeof(n->queue))
usr.sbin/pfctl/parse.y
5002
if (strlcpy(n->ifname, tqueue->ifname,
usr.sbin/pfctl/parse.y
5003
sizeof(n->ifname)) >=
usr.sbin/pfctl/parse.y
5004
sizeof(n->ifname))
usr.sbin/pfctl/parse.y
5006
n->scheduler = tqueue->scheduler;
usr.sbin/pfctl/parse.y
5007
n->next = NULL;
usr.sbin/pfctl/parse.y
5008
n->tail = n;
usr.sbin/pfctl/parse.y
5010
queues = n;
usr.sbin/pfctl/parse.y
5012
queues->tail->next = n;
usr.sbin/pfctl/parse.y
5013
queues->tail = n;
usr.sbin/pfctl/parse.y
5943
decide_address_family(struct node_host *n, sa_family_t *af)
usr.sbin/pfctl/parse.y
5945
if (*af != 0 || n == NULL)
usr.sbin/pfctl/parse.y
5947
*af = n->af;
usr.sbin/pfctl/parse.y
5948
while ((n = n->next) != NULL) {
usr.sbin/pfctl/parse.y
5949
if (n->af != *af) {
usr.sbin/pfctl/parse.y
5959
struct node_host *n = *nh, *prev = NULL;
usr.sbin/pfctl/parse.y
5961
while (n != NULL) {
usr.sbin/pfctl/parse.y
5962
if (*af && n->af && n->af != *af) {
usr.sbin/pfctl/parse.y
5964
struct node_host *next = n->next;
usr.sbin/pfctl/parse.y
5967
if (n == (*nh)->tail)
usr.sbin/pfctl/parse.y
5975
if (n->ifname != NULL)
usr.sbin/pfctl/parse.y
5976
free(n->ifname);
usr.sbin/pfctl/parse.y
5977
free(n);
usr.sbin/pfctl/parse.y
5978
n = next;
usr.sbin/pfctl/parse.y
5980
if (n->af && !*af)
usr.sbin/pfctl/parse.y
5981
*af = n->af;
usr.sbin/pfctl/parse.y
5982
prev = n;
usr.sbin/pfctl/parse.y
5983
n = n->next;
usr.sbin/pfctl/parse.y
5992
struct node_host *n;
usr.sbin/pfctl/parse.y
5995
for (n = nh; n != NULL; n = n->next) {
usr.sbin/pfctl/parse.y
5996
if (n->addr.type != PF_ADDR_TABLE &&
usr.sbin/pfctl/parse.y
5997
n->addr.type != PF_ADDR_DYNIFTL) {
usr.sbin/pfctl/parse.y
6030
getservice(char *n)
usr.sbin/pfctl/parse.y
6035
if (atoul(n, &ulval) == 0) {
usr.sbin/pfctl/parse.y
6042
s = getservbyname(n, "tcp");
usr.sbin/pfctl/parse.y
6044
s = getservbyname(n, "udp");
usr.sbin/pfctl/parse.y
6046
yyerror("unknown port %s", n);
usr.sbin/pfctl/pfctl_osfp.c
149
#define GET_INT(v, mod, n, ty, mx) \
usr.sbin/pfctl/pfctl_osfp.c
150
get_int(&line, &len, &v, mod, n, ty, mx, fp_filename, lineno)
usr.sbin/pfctl/pfctl_osfp.c
151
#define GET_STR(v, n, mn) \
usr.sbin/pfctl/pfctl_osfp.c
152
get_str(&line, &len, &v, n, mn, fp_filename, lineno)
usr.sbin/pfctl/pfctl_parser.c
1089
struct pf_addr *m, *n;
usr.sbin/pfctl/pfctl_parser.c
1105
n = &h->addr.v.a.addr;
usr.sbin/pfctl/pfctl_parser.c
1108
n->addr32[i] = n->addr32[i] & m->addr32[i];
usr.sbin/pfctl/pfctl_parser.c
1114
struct node_host *n = NULL;
usr.sbin/pfctl/pfctl_parser.c
1117
for (n = h; n != NULL; n = n->next) {
usr.sbin/pfctl/pfctl_parser.c
1124
set_ipmask(n, 32);
usr.sbin/pfctl/pfctl_parser.c
1144
struct node_host *n = NULL, *h = NULL;
usr.sbin/pfctl/pfctl_parser.c
1154
n = calloc(1, sizeof(struct node_host));
usr.sbin/pfctl/pfctl_parser.c
1155
if (n == NULL)
usr.sbin/pfctl/pfctl_parser.c
1157
n->af = ifa->ifa_addr->sa_family;
usr.sbin/pfctl/pfctl_parser.c
1158
n->ifa_flags = ifa->ifa_flags;
usr.sbin/pfctl/pfctl_parser.c
1160
if (n->af == AF_INET6 &&
usr.sbin/pfctl/pfctl_parser.c
1174
n->ifindex = 0;
usr.sbin/pfctl/pfctl_parser.c
1175
if (n->af == AF_INET) {
usr.sbin/pfctl/pfctl_parser.c
1176
memcpy(&n->addr.v.a.addr, &((struct sockaddr_in *)
usr.sbin/pfctl/pfctl_parser.c
1179
memcpy(&n->addr.v.a.mask, &((struct sockaddr_in *)
usr.sbin/pfctl/pfctl_parser.c
1183
memcpy(&n->bcast, &((struct sockaddr_in *)
usr.sbin/pfctl/pfctl_parser.c
1187
memcpy(&n->peer, &((struct sockaddr_in *)
usr.sbin/pfctl/pfctl_parser.c
1190
} else if (n->af == AF_INET6) {
usr.sbin/pfctl/pfctl_parser.c
1191
memcpy(&n->addr.v.a.addr, &((struct sockaddr_in6 *)
usr.sbin/pfctl/pfctl_parser.c
1194
memcpy(&n->addr.v.a.mask, &((struct sockaddr_in6 *)
usr.sbin/pfctl/pfctl_parser.c
1198
memcpy(&n->bcast, &((struct sockaddr_in6 *)
usr.sbin/pfctl/pfctl_parser.c
1202
memcpy(&n->peer, &((struct sockaddr_in6 *)
usr.sbin/pfctl/pfctl_parser.c
1205
n->ifindex = ((struct sockaddr_in6 *)
usr.sbin/pfctl/pfctl_parser.c
1208
if ((n->ifname = strdup(ifa->ifa_name)) == NULL)
usr.sbin/pfctl/pfctl_parser.c
1210
n->next = NULL;
usr.sbin/pfctl/pfctl_parser.c
1211
n->tail = n;
usr.sbin/pfctl/pfctl_parser.c
1213
h = n;
usr.sbin/pfctl/pfctl_parser.c
1215
h->tail->next = n;
usr.sbin/pfctl/pfctl_parser.c
1216
h->tail = n;
usr.sbin/pfctl/pfctl_parser.c
1227
struct node_host *n;
usr.sbin/pfctl/pfctl_parser.c
1241
if ((n = calloc(1, sizeof(*n))) == NULL)
usr.sbin/pfctl/pfctl_parser.c
1243
if ((n->ifname = strdup(ifa_name)) == NULL)
usr.sbin/pfctl/pfctl_parser.c
1246
return (n);
usr.sbin/pfctl/pfctl_parser.c
1250
for (n = iftab; n; n = n->next) {
usr.sbin/pfctl/pfctl_parser.c
1251
if (n->af == AF_LINK && !strncmp(n->ifname, ifa_name, IFNAMSIZ))
usr.sbin/pfctl/pfctl_parser.c
1252
return (n);
usr.sbin/pfctl/pfctl_parser.c
1265
struct node_host *n, *h = NULL;
usr.sbin/pfctl/pfctl_parser.c
1285
if ((n = ifa_lookup(ifg->ifgrq_member, flags)) == NULL)
usr.sbin/pfctl/pfctl_parser.c
1288
h = n;
usr.sbin/pfctl/pfctl_parser.c
1290
h->tail->next = n;
usr.sbin/pfctl/pfctl_parser.c
1291
h->tail = n->tail;
usr.sbin/pfctl/pfctl_parser.c
1303
struct node_host *p = NULL, *h = NULL, *n = NULL;
usr.sbin/pfctl/pfctl_parser.c
1343
n = calloc(1, sizeof(struct node_host));
usr.sbin/pfctl/pfctl_parser.c
1344
if (n == NULL)
usr.sbin/pfctl/pfctl_parser.c
1346
n->af = p->af;
usr.sbin/pfctl/pfctl_parser.c
1348
memcpy(&n->addr.v.a.addr, &p->bcast,
usr.sbin/pfctl/pfctl_parser.c
1351
memcpy(&n->addr.v.a.addr, &p->peer,
usr.sbin/pfctl/pfctl_parser.c
1354
memcpy(&n->addr.v.a.addr, &p->addr.v.a.addr,
usr.sbin/pfctl/pfctl_parser.c
1357
set_ipmask(n, unmask(&p->addr.v.a.mask, n->af));
usr.sbin/pfctl/pfctl_parser.c
1359
if (n->af == AF_INET) {
usr.sbin/pfctl/pfctl_parser.c
1362
memcpy(&n->addr.v.a.mask,
usr.sbin/pfctl/pfctl_parser.c
1366
set_ipmask(n, 32);
usr.sbin/pfctl/pfctl_parser.c
1368
set_ipmask(n, 128);
usr.sbin/pfctl/pfctl_parser.c
1370
n->ifindex = p->ifindex;
usr.sbin/pfctl/pfctl_parser.c
1372
n->next = NULL;
usr.sbin/pfctl/pfctl_parser.c
1373
n->tail = n;
usr.sbin/pfctl/pfctl_parser.c
1375
h = n;
usr.sbin/pfctl/pfctl_parser.c
1377
h->tail->next = n;
usr.sbin/pfctl/pfctl_parser.c
1378
h->tail = n;
usr.sbin/pfctl/pfctl_parser.c
1387
int n;
usr.sbin/pfctl/pfctl_parser.c
1395
n = strlen(filter);
usr.sbin/pfctl/pfctl_parser.c
1396
if (n < 1 || n >= IFNAMSIZ)
usr.sbin/pfctl/pfctl_parser.c
1398
if (filter[n-1] >= '0' && filter[n-1] <= '9')
usr.sbin/pfctl/pfctl_parser.c
1400
if (strncmp(p->ifname, filter, n))
usr.sbin/pfctl/pfctl_parser.c
1402
return (p->ifname[n] < '0' || p->ifname[n] > '9');
usr.sbin/pfctl/pfctl_parser.c
1458
struct node_host *n, *h = NULL;
usr.sbin/pfctl/pfctl_parser.c
1493
for (n = h; n != NULL && mask > -1; n = n->next)
usr.sbin/pfctl/pfctl_parser.c
1494
set_ipmask(n, mask);
usr.sbin/pfctl/pfctl_parser.c
1564
struct node_host *n, *h = NULL;
usr.sbin/pfctl/pfctl_parser.c
1599
n = calloc(1, sizeof(struct node_host));
usr.sbin/pfctl/pfctl_parser.c
1600
if (n == NULL)
usr.sbin/pfctl/pfctl_parser.c
1602
n->ifname = NULL;
usr.sbin/pfctl/pfctl_parser.c
1603
n->af = res->ai_family;
usr.sbin/pfctl/pfctl_parser.c
1605
memcpy(&n->addr.v.a.addr,
usr.sbin/pfctl/pfctl_parser.c
1609
set_ipmask(n, v4mask);
usr.sbin/pfctl/pfctl_parser.c
1611
memcpy(&n->addr.v.a.addr,
usr.sbin/pfctl/pfctl_parser.c
1615
n->ifindex =
usr.sbin/pfctl/pfctl_parser.c
1618
set_ipmask(n, v6mask);
usr.sbin/pfctl/pfctl_parser.c
1620
n->next = NULL;
usr.sbin/pfctl/pfctl_parser.c
1621
n->tail = n;
usr.sbin/pfctl/pfctl_parser.c
1623
h = n;
usr.sbin/pfctl/pfctl_parser.c
1625
h->tail->next = n;
usr.sbin/pfctl/pfctl_parser.c
1626
h->tail = n;
usr.sbin/pfctl/pfctl_parser.c
1644
struct node_host *h, *n;
usr.sbin/pfctl/pfctl_parser.c
1649
if ((n = host(r)) == NULL) {
usr.sbin/pfctl/pfctl_parser.c
1653
rv = append_addr_host(b, n, test, not);
usr.sbin/pfctl/pfctl_parser.c
1655
h = n;
usr.sbin/pfctl/pfctl_parser.c
1656
n = n->next;
usr.sbin/pfctl/pfctl_parser.c
1658
} while (n != NULL);
usr.sbin/pfctl/pfctl_parser.c
1669
append_addr_host(struct pfr_buffer *b, struct node_host *n, int test, int not)
usr.sbin/pfctl/pfctl_parser.c
1676
addr.pfra_not = n->not ^ not;
usr.sbin/pfctl/pfctl_parser.c
1677
addr.pfra_af = n->af;
usr.sbin/pfctl/pfctl_parser.c
1678
addr.pfra_net = unmask(&n->addr.v.a.mask, n->af);
usr.sbin/pfctl/pfctl_parser.c
1679
switch (n->af) {
usr.sbin/pfctl/pfctl_parser.c
1681
addr.pfra_ip4addr.s_addr = n->addr.v.a.addr.addr32[0];
usr.sbin/pfctl/pfctl_parser.c
1685
memcpy(&addr.pfra_ip6addr, &n->addr.v.a.addr.v6,
usr.sbin/pfctl/pfctl_parser.c
1700
} while ((n = n->next) != NULL);
usr.sbin/pfctl/pfctl_qstats.c
395
int n;
usr.sbin/pfctl/pfctl_qstats.c
401
n = qs->avgn;
usr.sbin/pfctl/pfctl_qstats.c
426
if (n == 0) {
usr.sbin/pfctl/pfctl_qstats.c
434
qs->avg_bytes = ((qs->avg_bytes * (n - 1)) +
usr.sbin/pfctl/pfctl_qstats.c
435
(b - qs->prev_bytes)) / n;
usr.sbin/pfctl/pfctl_qstats.c
438
qs->avg_packets = ((qs->avg_packets * (n - 1)) +
usr.sbin/pfctl/pfctl_qstats.c
439
(p - qs->prev_packets)) / n;
usr.sbin/pfctl/pfctl_qstats.c
443
if (n < AVGN_MAX)
usr.sbin/pflogd/pflogd.c
121
size_t len = 0, n;
usr.sbin/pflogd/pflogd.c
127
for (n = 0; argv[n]; n++)
usr.sbin/pflogd/pflogd.c
128
len += strlen(argv[n])+1;
usr.sbin/pflogd/pflogd.c
137
for (n = 1; argv[n]; n++) {
usr.sbin/pflogd/pflogd.c
139
strlcat(buf, argv[n], len);
usr.sbin/pflogd/privsep.c
305
may_read(int fd, void *buf, size_t n)
usr.sbin/pflogd/privsep.c
311
while (n > pos) {
usr.sbin/pflogd/privsep.c
312
res = read(fd, s + pos, n - pos);
usr.sbin/pflogd/privsep.c
330
must_read(int fd, void *buf, size_t n)
usr.sbin/pflogd/privsep.c
336
while (n > pos) {
usr.sbin/pflogd/privsep.c
337
res = read(fd, s + pos, n - pos);
usr.sbin/pflogd/privsep.c
354
must_write(int fd, void *buf, size_t n)
usr.sbin/pflogd/privsep.c
360
while (n > pos) {
usr.sbin/pflogd/privsep.c
361
res = write(fd, s + pos, n - pos);
usr.sbin/pflogd/privsep_fdpass.c
104
if ((n = recvmsg(sock, &msg, 0)) == -1)
usr.sbin/pflogd/privsep_fdpass.c
106
if (n != sizeof(int))
usr.sbin/pflogd/privsep_fdpass.c
108
__func__, (long)n);
usr.sbin/pflogd/privsep_fdpass.c
57
ssize_t n;
usr.sbin/pflogd/privsep_fdpass.c
78
if ((n = sendmsg(sock, &msg, 0)) == -1)
usr.sbin/pflogd/privsep_fdpass.c
80
if (n != sizeof(int))
usr.sbin/pflogd/privsep_fdpass.c
82
__func__, (long)n);
usr.sbin/pflogd/privsep_fdpass.c
92
ssize_t n;
usr.sbin/powerd/powerd.c
1372
int n;
usr.sbin/powerd/powerd.c
1374
for (n = 0; ; ++n) {
usr.sbin/powerd/powerd.c
1377
"hw.sensors.cpu_node%d.temp0", n);
usr.sbin/powerd/powerd.c
1388
if (n)
usr.sbin/powerd/powerd.c
1394
for (n = 0; ; ++n) {
usr.sbin/powerd/powerd.c
1397
"hw.sensors.cpu%d.temp0", n);
usr.sbin/powerd/powerd.c
445
int n, i, ncpu = 0, dom_id;
usr.sbin/powerd/powerd.c
487
n = -1;
usr.sbin/powerd/powerd.c
488
sscanf(str, "cpu%d", &n);
usr.sbin/powerd/powerd.c
489
if (n >= 0) {
usr.sbin/powerd/powerd.c
492
CPUMASK_ORBIT(dom->dom_cpumask, n);
usr.sbin/powerd/powerd.c
493
cpu2pwrdom[n] = dom->dom_id;
usr.sbin/ppp/auth.c
126
int n, lineno;
usr.sbin/ppp/auth.c
140
if ((n = MakeArgs(buff, vector, VECSIZE(vector), PARSE_REDUCE)) < 0)
usr.sbin/ppp/auth.c
142
if (n < 5)
usr.sbin/ppp/auth.c
171
int n, lineno;
usr.sbin/ppp/auth.c
201
if ((n = MakeArgs(buff, vector, VECSIZE(vector), PARSE_REDUCE)) < 0)
usr.sbin/ppp/auth.c
203
if (n < 2)
usr.sbin/ppp/auth.c
210
if (n > 2 && *vector[2] && strcmp(vector[2], "*") &&
usr.sbin/ppp/auth.c
217
if (n > 3 && *vector[3] && strcmp(vector[3], "*"))
usr.sbin/ppp/auth.c
254
int n, lineno;
usr.sbin/ppp/auth.c
268
if ((n = MakeArgs(buff, vector, VECSIZE(vector), PARSE_REDUCE)) < 0)
usr.sbin/ppp/auth.c
270
if (n < 2)
usr.sbin/ppp/auth.c
305
int n, lineno;
usr.sbin/ppp/auth.c
320
n = strlen(buff) - 1;
usr.sbin/ppp/auth.c
321
if (buff[n] == '\n')
usr.sbin/ppp/auth.c
322
buff[n] = '\0'; /* Trim the '\n' */
usr.sbin/ppp/auth.c
324
if ((n = MakeArgs(buff, vector, VECSIZE(vector), PARSE_REDUCE)) < 0)
usr.sbin/ppp/auth.c
326
if (n < 2)
usr.sbin/ppp/bundle.c
451
bundle_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w, fd_set *e, int *n)
usr.sbin/ppp/bundle.c
478
if (*n < bundle->dev.fd + 1)
usr.sbin/ppp/bundle.c
479
*n = bundle->dev.fd + 1;
usr.sbin/ppp/bundle.c
493
result += descriptor_UpdateSet(&bundle->radius.desc, r, w, e, n);
usr.sbin/ppp/bundle.c
498
result += descriptor_UpdateSet(&dl->desc, r, w, e, n);
usr.sbin/ppp/bundle.c
505
result += descriptor_UpdateSet(&bundle->ncp.mp.server.desc, r, w, e, n);
usr.sbin/ppp/bundle.c
553
int n, pri;
usr.sbin/ppp/bundle.c
567
n = read(bundle->dev.fd, data, sz);
usr.sbin/ppp/bundle.c
568
if (n < 0) {
usr.sbin/ppp/bundle.c
574
n -= sz - sizeof tun.data;
usr.sbin/ppp/bundle.c
575
if (n <= 0) {
usr.sbin/ppp/bundle.c
577
bundle->dev.Name, n);
usr.sbin/ppp/bundle.c
595
pri = PacketCheck(bundle, af, tun.data, n, &bundle->filter.in,
usr.sbin/ppp/bundle.c
598
n += sz - sizeof tun.data;
usr.sbin/ppp/bundle.c
599
write(bundle->dev.fd, data, n);
usr.sbin/ppp/bundle.c
617
pri = PacketCheck(bundle, af, tun.data, n, &bundle->filter.dial,
usr.sbin/ppp/bundle.c
633
pri = PacketCheck(bundle, af, tun.data, n, &bundle->filter.out,
usr.sbin/ppp/bundle.c
638
ncp_Enqueue(&bundle->ncp, af, pri, (char *)&tun, n + sizeof tun.header);
usr.sbin/ppp/chap.c
397
fd_set *e __unused, int *n)
usr.sbin/ppp/chap.c
403
if (*n < chap->child.fd + 1)
usr.sbin/ppp/chap.c
404
*n = chap->child.fd + 1;
usr.sbin/ppp/chat.c
141
chat_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w, fd_set *e, int *n)
usr.sbin/ppp/chat.c
269
return chat_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/chat.c
304
return chat_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/chat.c
319
return physical_doUpdateSet(&c->physical->desc, r, NULL, e, n, 1);
usr.sbin/ppp/chat.c
321
return physical_doUpdateSet(&c->physical->desc, NULL, w, e, n, 1);
usr.sbin/ppp/chat.c
382
int n;
usr.sbin/ppp/chat.c
466
for (n = c->abort.num - 1; n >= 0; n--) {
usr.sbin/ppp/chat.c
467
if (begin + c->abort.string[n].len > c->bufend)
usr.sbin/ppp/chat.c
469
if (!strncmp(begin, c->abort.string[n].data,
usr.sbin/ppp/chat.c
470
c->abort.string[n].len)) {
usr.sbin/ppp/chat.c
471
if (memchr(begin + c->abort.string[n].len - 1, '\n',
usr.sbin/ppp/chat.c
472
c->bufend - begin - c->abort.string[n].len + 1) == NULL) {
usr.sbin/ppp/chat.c
475
c->bufend = begin + c->abort.string[n].len;
usr.sbin/ppp/chat.c
479
c->bufstart = begin + c->abort.string[n].len;
usr.sbin/ppp/command.c
1136
arghidden(char const *const *argv, int n)
usr.sbin/ppp/command.c
1142
if (n == 2 && !strncasecmp(argv[0], "se", 2) &&
usr.sbin/ppp/command.c
1147
if (n == 1 && !strncasecmp(argv[0], "p", 1))
usr.sbin/ppp/command.c
1151
if (n == 3 && !strncasecmp(argv[0], "se", 2) &&
usr.sbin/ppp/command.c
1166
size_t n;
usr.sbin/ppp/command.c
1172
n = strlen(buf);
usr.sbin/ppp/command.c
1175
n = 0;
usr.sbin/ppp/command.c
1180
if (n < sizeof buf - 1 && f)
usr.sbin/ppp/command.c
1181
buf[n++] = ' ';
usr.sbin/ppp/command.c
1183
strncpy(buf+n, "********", sizeof buf - n - 1);
usr.sbin/ppp/command.c
1185
strncpy(buf+n, argv[f], sizeof buf - n - 1);
usr.sbin/ppp/command.c
1186
n += strlen(buf+n);
usr.sbin/ppp/command.c
207
int n, cmax, dmax, cols, cxlen;
usr.sbin/ppp/command.c
229
if ((n = strlen(cmd->name) + strlen(showcx(cmd))) > cmax)
usr.sbin/ppp/command.c
230
cmax = n;
usr.sbin/ppp/command.c
231
if ((n = strlen(cmd->helpmes)) > dmax)
usr.sbin/ppp/command.c
232
dmax = n;
usr.sbin/ppp/command.c
236
n = 0;
usr.sbin/ppp/command.c
243
if (n % cols != 0)
usr.sbin/ppp/command.c
247
if (++n % cols == 0)
usr.sbin/ppp/command.c
250
if (n % cols != 0)
usr.sbin/ppp/command.c
2948
int n;
usr.sbin/ppp/command.c
2954
for (n = arg->argn; n < arg->argc; n++) {
usr.sbin/ppp/command.c
2955
argv[1] = arg->argv[n];
usr.sbin/ppp/command.c
3059
int n, how;
usr.sbin/ppp/command.c
3069
n = 1;
usr.sbin/ppp/command.c
3082
n = 2;
usr.sbin/ppp/command.c
3086
if (!ncpaddr_aton(&peer, NULL, arg->argv[arg->argn + n]))
usr.sbin/ppp/command.c
328
int n, mode;
usr.sbin/ppp/command.c
333
for (n = arg->argn; n < arg->argc; n++)
usr.sbin/ppp/command.c
334
if ((err = system_IsValid(arg->argv[n], arg->prompt, mode)) != NULL) {
usr.sbin/ppp/command.c
335
log_Printf(LogWARN, "%s: %s\n", arg->argv[n], err);
usr.sbin/ppp/command.c
339
for (n = arg->argn; n < arg->argc; n++) {
usr.sbin/ppp/command.c
341
system_Select(arg->bundle, arg->argv[n], CONFFILE, arg->prompt, arg->cx);
usr.sbin/ppp/datalink.c
1429
int f, n;
usr.sbin/ppp/datalink.c
1432
n = strlen(dl->name);
usr.sbin/ppp/datalink.c
1433
name = (char *)malloc(n+3);
usr.sbin/ppp/datalink.c
1434
for (f = n - 1; f >= 0; f--)
usr.sbin/ppp/datalink.c
1437
n = sprintf(name, "%.*s-", dl->name[f] == '-' ? f : f + 1, dl->name);
usr.sbin/ppp/datalink.c
1438
sprintf(name + n, "%d", atoi(dl->name + f + 1) + 1);
usr.sbin/ppp/datalink.c
251
int *n)
usr.sbin/ppp/datalink.c
294
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
339
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
347
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
358
result = descriptor_UpdateSet(&dl->chat.desc, r, w, e, n);
usr.sbin/ppp/datalink.c
368
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
374
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
378
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
395
return datalink_UpdateSet(d, r, w, e, n);
usr.sbin/ppp/datalink.c
406
result = descriptor_UpdateSet(&dl->chap.desc, r, w, e, n) +
usr.sbin/ppp/datalink.c
407
descriptor_UpdateSet(&dl->physical->desc, r, w, e, n);
usr.sbin/ppp/defs.c
406
int i, n;
usr.sbin/ppp/defs.c
411
n = snprintf(buf + pos, sz - pos, "%s%s", i ? " " : "", argv[i]);
usr.sbin/ppp/defs.c
412
if (n < 0) {
usr.sbin/ppp/defs.c
416
if ((pos += n) >= sz)
usr.sbin/ppp/defs.c
77
fullread(int fd, void *v, size_t n)
usr.sbin/ppp/defs.c
81
for (total = 0; total < n; total += got)
usr.sbin/ppp/defs.c
82
switch ((got = read(fd, (char *)v + total, n - total))) {
usr.sbin/ppp/descriptor.h
51
#define descriptor_UpdateSet(d, r, w, e, n) ((*(d)->UpdateSet)(d, r, w, e, n))
usr.sbin/ppp/ether.c
128
ether_Write(struct physical *p, const void *v, size_t n)
usr.sbin/ppp/ether.c
132
return NgSendData(p->fd, dev->hook, v, n) == -1 ? -1 : (ssize_t)n;
usr.sbin/ppp/ether.c
136
ether_Read(struct physical *p, void *v, size_t n)
usr.sbin/ppp/ether.c
140
return NgRecvData(p->fd, v, n, hook);
usr.sbin/ppp/ether.c
383
ether_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w, fd_set *e, int *n)
usr.sbin/ppp/ether.c
396
result += physical_doUpdateSet(d, r, w, e, n, 0);
usr.sbin/ppp/filter.c
454
int n;
usr.sbin/ppp/filter.c
456
for (n = 0; n < MAXFILTERS; n++, fp++) {
usr.sbin/ppp/filter.c
458
prompt_Printf(prompt, " %2d %s", n, filter_Action2Nam(fp->f_action));
usr.sbin/ppp/filter.c
565
int n;
usr.sbin/ppp/filter.c
567
for (fp = filter->rule, n = 0; n < MAXFILTERS; fp++, n++)
usr.sbin/ppp/hdlc.c
357
hdlc_Detect(u_char const **cp, unsigned n, int issync)
usr.sbin/ppp/hdlc.c
363
while (n) {
usr.sbin/ppp/hdlc.c
367
cmp = n >= len ? len : n;
usr.sbin/ppp/hdlc.c
371
n--;
usr.sbin/ppp/id.h
69
#define ID0bind_un(s, n) bind(s, (const struct sockaddr *)(n), sizeof *(n))
usr.sbin/ppp/id.h
70
#define ID0connect_un(s, n) \
usr.sbin/ppp/id.h
71
connect(s, (const struct sockaddr *)(n), sizeof *(n))
usr.sbin/ppp/iface.c
377
unsigned n;
usr.sbin/ppp/iface.c
382
for (n = 0; n < iface->addrs; n++) {
usr.sbin/ppp/iface.c
383
af = ncprange_family(&iface->addr[n].ifa);
usr.sbin/ppp/iface.c
385
if (!iface->addr[n].system && (how & IFACE_SYSTEM))
usr.sbin/ppp/iface.c
411
else if (iface_addr_Zap(iface->name, iface->addr + n, *s)) {
usr.sbin/ppp/iface.c
412
ncp_IfaceAddrDeleted(ncp, iface->addr + n);
usr.sbin/ppp/iface.c
413
bcopy(iface->addr + n + 1, iface->addr + n,
usr.sbin/ppp/iface.c
414
(iface->addrs - n - 1) * sizeof *iface->addr);
usr.sbin/ppp/iface.c
416
n--;
usr.sbin/ppp/iface.c
435
unsigned n;
usr.sbin/ppp/iface.c
446
for (n = 0; n < iface->addrs; n++) {
usr.sbin/ppp/iface.c
447
if (ncprange_contains(&iface->addr[n].ifa, &ncplocal) ||
usr.sbin/ppp/iface.c
448
ncpaddr_equal(&iface->addr[n].peer, peer)) {
usr.sbin/ppp/iface.c
455
if (ncprange_equal(&iface->addr[n].ifa, ifa) &&
usr.sbin/ppp/iface.c
456
ncpaddr_equal(&iface->addr[n].peer, peer)) {
usr.sbin/ppp/iface.c
461
removed = iface_addr_Zap(iface->name, iface->addr + n, s);
usr.sbin/ppp/iface.c
463
ncp_IfaceAddrDeleted(ncp, iface->addr + n);
usr.sbin/ppp/iface.c
464
ncprange_copy(&iface->addr[n].ifa, ifa);
usr.sbin/ppp/iface.c
465
ncpaddr_copy(&iface->addr[n].peer, peer);
usr.sbin/ppp/iface.c
466
if (!iface_addr_Add(iface->name, iface->addr + n, s)) {
usr.sbin/ppp/iface.c
468
bcopy(iface->addr + n + 1, iface->addr + n,
usr.sbin/ppp/iface.c
469
(iface->addrs - n - 1) * sizeof *iface->addr);
usr.sbin/ppp/iface.c
471
n--;
usr.sbin/ppp/iface.c
477
ncp_IfaceAddrAdded(ncp, iface->addr + n);
usr.sbin/ppp/iface.c
501
n = 0;
usr.sbin/ppp/iface.c
504
n = iface->addrs;
usr.sbin/ppp/iface.c
507
memcpy(iface->addr + n, &newaddr, sizeof(*iface->addr));
usr.sbin/ppp/iface.c
510
ncp_IfaceAddrAdded(ncp, iface->addr + n);
usr.sbin/ppp/iface.c
519
unsigned n;
usr.sbin/ppp/iface.c
527
for (n = res = 0; n < iface->addrs; n++) {
usr.sbin/ppp/iface.c
528
ncprange_getaddr(&iface->addr[n].ifa, &found);
usr.sbin/ppp/iface.c
530
if (iface_addr_Zap(iface->name, iface->addr + n, s)) {
usr.sbin/ppp/iface.c
531
ncp_IfaceAddrDeleted(ncp, iface->addr + n);
usr.sbin/ppp/iface.c
532
bcopy(iface->addr + n + 1, iface->addr + n,
usr.sbin/ppp/iface.c
533
(iface->addrs - n - 1) * sizeof *iface->addr);
usr.sbin/ppp/ip.c
197
int n; /* filter rule to process */
usr.sbin/ppp/ip.c
257
for (n = 0; n < MAXFILTERS; ) {
usr.sbin/ppp/ip.c
259
n++;
usr.sbin/ppp/ip.c
399
n, fp->f_proto, dbuff, filter_Action2Nam(fp->f_action));
usr.sbin/ppp/ip.c
415
log_Printf(LogDEBUG, " rule = %d: Address match, action = %s\n", n,
usr.sbin/ppp/ip.c
420
log_Printf(LogDEBUG, " rule = %d: Address mismatch\n", n);
usr.sbin/ppp/ip.c
425
fp = &filter->rule[n = fp->f_action];
usr.sbin/ppp/ip.c
435
"src = %s:%d dst = %s:%d\n", filter->name, n,
usr.sbin/ppp/ip.c
446
filter->name, n, toprototxt(cproto),
usr.sbin/ppp/ip.c
453
n++;
usr.sbin/ppp/ip.c
495
char namewithdot[MAXHOSTNAMELEN + 1], *n;
usr.sbin/ppp/ip.c
499
n = namewithdot;
usr.sbin/ppp/ip.c
507
if (n != namewithdot)
usr.sbin/ppp/ip.c
508
*n++ = '.';
usr.sbin/ppp/ip.c
509
memcpy(n, ptr, len);
usr.sbin/ppp/ip.c
511
n += len;
usr.sbin/ppp/ip.c
513
*n = '\0';
usr.sbin/ppp/ip.c
548
int cproto, mask, len, n, pri, logit, result, datalen, frag;
usr.sbin/ppp/ip.c
804
n = 0;
usr.sbin/ppp/ip.c
807
snprintf(logbuf + loglen, sizeof logbuf - loglen, " %s", TcpFlags[n]);
usr.sbin/ppp/ip.c
810
n++;
usr.sbin/ppp/ipcp.c
1018
for (n = 0; n < iface->addrs; n++)
usr.sbin/ppp/ipcp.c
1019
if (ncprange_contains(&ipcp->cfg.peer_range, &iface->addr[n].peer)) {
usr.sbin/ppp/ipcp.c
1021
ncpaddr_getip4addr(&iface->addr[n].peer, (u_int32_t *)dec->nakend);
usr.sbin/ppp/ipcp.c
1025
if (n == iface->addrs)
usr.sbin/ppp/ipcp.c
161
ipcp_AddInOctets(struct ipcp *ipcp, int n)
usr.sbin/ppp/ipcp.c
163
throughput_addin(&ipcp->throughput, n);
usr.sbin/ppp/ipcp.c
167
ipcp_AddOutOctets(struct ipcp *ipcp, int n)
usr.sbin/ppp/ipcp.c
169
throughput_addout(&ipcp->throughput, n);
usr.sbin/ppp/ipcp.c
217
int n;
usr.sbin/ppp/ipcp.c
224
n = 0;
usr.sbin/ppp/ipcp.c
246
if (n < 2 && inet_aton(cp, ipcp->ns.dns))
usr.sbin/ppp/ipcp.c
247
n++;
usr.sbin/ppp/ipcp.c
259
if (n == 2 && ipcp->ns.dns[0].s_addr == INADDR_ANY) {
usr.sbin/ppp/ipcp.c
514
unsigned n;
usr.sbin/ppp/ipcp.c
521
for (n = 0; n < iface->addrs; n++) {
usr.sbin/ppp/ipcp.c
522
if (!ncpaddr_getip4(&iface->addr[n].peer, &peer))
usr.sbin/ppp/ipcp.c
529
if (n == iface->addrs)
usr.sbin/ppp/ipcp.c
557
for (n = 0; n < iface->addrs; n++) {
usr.sbin/ppp/ipcp.c
558
ncprange_getaddr(&iface->addr[n].ifa, &ipaddr);
usr.sbin/ppp/ipcp.c
564
if (n == iface->addrs)
usr.sbin/ppp/ipcp.c
592
int n;
usr.sbin/ppp/ipcp.c
596
n = 1;
usr.sbin/ppp/ipcp.c
600
n <<= 1;
usr.sbin/ppp/ipcp.c
603
return n;
usr.sbin/ppp/ipcp.c
613
int n, ret;
usr.sbin/ppp/ipcp.c
626
if ((n = numaddresses(mask)) > 256) {
usr.sbin/ppp/ipcp.c
632
if (n >= 4) {
usr.sbin/ppp/ipcp.c
634
n -= 2;
usr.sbin/ppp/ipcp.c
636
while (n) {
usr.sbin/ppp/ipcp.c
640
n--;
usr.sbin/ppp/ipcp.c
644
ret = !n;
usr.sbin/ppp/ipcp.c
969
unsigned n;
usr.sbin/ppp/ipcp.c
983
for (n = 0; n < iface->addrs; n++) {
usr.sbin/ppp/ipcp.c
984
if (!ncpaddr_getip4(&iface->addr[n].peer, &peer))
usr.sbin/ppp/ipcp.c
992
if (n == iface->addrs) {
usr.sbin/ppp/ipv6cp.c
269
int n;
usr.sbin/ppp/ipv6cp.c
284
n = 100;
usr.sbin/ppp/ipv6cp.c
285
while (n &&
usr.sbin/ppp/ipv6cp.c
288
n--;
usr.sbin/ppp/ipv6cp.c
290
} while (n
usr.sbin/ppp/ipv6cp.c
366
ipv6cp_AddInOctets(struct ipv6cp *ipv6cp, int n)
usr.sbin/ppp/ipv6cp.c
368
throughput_addin(&ipv6cp->throughput, n);
usr.sbin/ppp/ipv6cp.c
372
ipv6cp_AddOutOctets(struct ipv6cp *ipv6cp, int n)
usr.sbin/ppp/ipv6cp.c
374
throughput_addout(&ipv6cp->throughput, n);
usr.sbin/ppp/ipv6cp.c
650
int n;
usr.sbin/ppp/ipv6cp.c
688
n = 100;
usr.sbin/ppp/ipv6cp.c
689
while (n && !ipcp_SetIPv6address(ipv6cp, ifid, ipv6cp->his_ifid)) {
usr.sbin/ppp/ipv6cp.c
691
n--;
usr.sbin/ppp/ipv6cp.c
693
} while (n && memcmp(ifid, ipv6cp->his_ifid, IPV6CP_IFIDLEN) == 0);
usr.sbin/ppp/ipv6cp.c
696
if (n == 0) {
usr.sbin/ppp/lcp.h
41
#define CALLBACK_BIT(n) ((n) < 0 ? 0 : 1 << (n))
usr.sbin/ppp/libradius/radlib.c
1226
int n;
usr.sbin/ppp/libradius/radlib.c
1228
n = rad_init_send_request(h, &fd, &tv);
usr.sbin/ppp/libradius/radlib.c
1230
if (n != 0)
usr.sbin/ppp/libradius/radlib.c
1231
return n;
usr.sbin/ppp/libradius/radlib.c
1242
n = select(fd + 1, &readfds, NULL, NULL, &tv);
usr.sbin/ppp/libradius/radlib.c
1244
if (n == -1) {
usr.sbin/ppp/libradius/radlib.c
1258
n = rad_continue_send_request(h, n, &fd, &tv);
usr.sbin/ppp/libradius/radlib.c
1260
if (n != 0)
usr.sbin/ppp/libradius/radlib.c
1261
return n;
usr.sbin/ppp/libradius/radlib.c
673
int n, cur_srv;
usr.sbin/ppp/libradius/radlib.c
770
n = sendto(h->fd, h->out, h->out_len, 0,
usr.sbin/ppp/libradius/radlib.c
773
if (n != h->out_len)
usr.sbin/ppp/libradius/radlib.c
789
int n;
usr.sbin/ppp/libradius/radlib.c
803
for (n = 0; n < h->num_servers; n++) {
usr.sbin/ppp/libradius/radlib.c
804
if (h->servers[n].addr.sin_addr.s_addr == from.sin_addr.s_addr) {
usr.sbin/ppp/libradius/radlib.c
805
h->servers[n].addr.sin_port = from.sin_port;
usr.sbin/ppp/libradius/radlib.c
806
h->srv = n;
usr.sbin/ppp/libradius/radlib.c
824
int n;
usr.sbin/ppp/libradius/radlib.c
839
n = sendto(h->fd, h->out, h->out_len, 0,
usr.sbin/ppp/libradius/radlib.c
842
if (n != h->out_len) {
usr.sbin/ppp/libradius/radlib.c
843
if (n == -1)
usr.sbin/ppp/link.c
77
link_AddInOctets(struct link *l, int n)
usr.sbin/ppp/link.c
80
throughput_addin(&l->stats.total, n);
usr.sbin/ppp/link.c
82
throughput_addin(l->stats.parent, n);
usr.sbin/ppp/link.c
87
link_AddOutOctets(struct link *l, int n)
usr.sbin/ppp/link.c
90
throughput_addout(&l->stats.total, n);
usr.sbin/ppp/link.c
92
throughput_addout(l->stats.parent, n);
usr.sbin/ppp/log.c
393
log_DumpBuff(int lev, const char *hdr, const u_char *ptr, int n)
usr.sbin/ppp/log.c
401
while (n > 0) {
usr.sbin/ppp/log.c
404
for (b = buf; b != buf + 48 && n--; b += 3, ptr++) {
usr.sbin/ppp/log.c
74
#define MSK(n) (1<<((n)-1))
usr.sbin/ppp/lqr.c
131
unsigned n;
usr.sbin/ppp/lqr.c
135
for (n = 0; n < sizeof(struct lqrdata) / sizeof(u_int32_t); n++, sp++, dp++)
usr.sbin/ppp/mbuf.c
272
m_adj(struct mbuf *bp, ssize_t n)
usr.sbin/ppp/mbuf.c
274
if (n > 0) {
usr.sbin/ppp/mbuf.c
276
if ((size_t)n < bp->m_len) {
usr.sbin/ppp/mbuf.c
277
bp->m_len = n;
usr.sbin/ppp/mbuf.c
278
bp->m_offset += n;
usr.sbin/ppp/mbuf.c
281
n -= bp->m_len;
usr.sbin/ppp/mbuf.c
285
if ((n = m_length(bp) + n) <= 0) {
usr.sbin/ppp/mbuf.c
289
for (; bp; bp = bp->m_next, n -= bp->m_len)
usr.sbin/ppp/mbuf.c
290
if ((size_t)n < bp->m_len) {
usr.sbin/ppp/mbuf.c
291
bp->m_len = n;
usr.sbin/ppp/mp.c
1042
int *n)
usr.sbin/ppp/mp.c
1061
if (*n < s->fd + 1)
usr.sbin/ppp/mp.c
1062
*n = s->fd + 1;
usr.sbin/ppp/mppe.c
247
int dictinit, flushed, ilen, len, n;
usr.sbin/ppp/mppe.c
295
n = (prefix >> MPPE_HEADER_FLAGSHIFT) -
usr.sbin/ppp/mppe.c
297
if (n < 0)
usr.sbin/ppp/mppe.c
298
n += MPPE_HEADER_STATEFUL_KEYCHANGES;
usr.sbin/ppp/mppe.c
299
while (n--) {
usr.sbin/ppp/mppe.c
388
int len, n;
usr.sbin/ppp/mppe.c
392
if ((n = snprintf(buf, sizeof buf, "value 0x%08x ", (unsigned)val)) > 0)
usr.sbin/ppp/mppe.c
393
len += n;
usr.sbin/ppp/mppe.c
395
if ((n = snprintf(buf + len, sizeof buf - len, "(0")) > 0)
usr.sbin/ppp/mppe.c
396
len += n;
usr.sbin/ppp/mppe.c
400
if ((n = snprintf(buf + len, sizeof buf - len, "%c128", ch)) > 0)
usr.sbin/ppp/mppe.c
401
len += n;
usr.sbin/ppp/mppe.c
405
if ((n = snprintf(buf + len, sizeof buf - len, "%c56", ch)) > 0)
usr.sbin/ppp/mppe.c
406
len += n;
usr.sbin/ppp/mppe.c
410
if ((n = snprintf(buf + len, sizeof buf - len, "%c40", ch)) > 0)
usr.sbin/ppp/mppe.c
411
len += n;
usr.sbin/ppp/mppe.c
416
if ((n = snprintf(buf + len, sizeof buf - len, " bits, state%s",
usr.sbin/ppp/mppe.c
418
len += n;
usr.sbin/ppp/mppe.c
421
if ((n = snprintf(buf + len, sizeof buf - len, ", compressed")) > 0)
usr.sbin/ppp/mppe.c
422
len += n;
usr.sbin/ppp/ncp.c
480
int n;
usr.sbin/ppp/ncp.c
482
n = !!(ncp->ipcp.fsm.state == ST_OPENED);
usr.sbin/ppp/ncp.c
484
n += !!(ncp->ipv6cp.fsm.state == ST_OPENED);
usr.sbin/ppp/ncp.c
487
return n;
usr.sbin/ppp/ncp.c
493
int n = 0;
usr.sbin/ppp/ncp.c
497
n++;
usr.sbin/ppp/ncp.c
502
n++;
usr.sbin/ppp/ncp.c
505
return n;
usr.sbin/ppp/netgraph.c
228
ng_Write(struct physical *p, const void *v, size_t n)
usr.sbin/ppp/netgraph.c
235
return ng_MessageOut(dev, v) ? (ssize_t)n : -1;
usr.sbin/ppp/netgraph.c
237
return NgSendData(p->fd, dev->hook, v, n) == -1 ? -1 : (ssize_t)n;
usr.sbin/ppp/netgraph.c
241
ng_Read(struct physical *p, void *v, size_t n)
usr.sbin/ppp/netgraph.c
249
return ng_MessageIn(p, v, n);
usr.sbin/ppp/netgraph.c
252
return NgRecvData(p->fd, v, n, hook);
usr.sbin/ppp/netgraph.c
360
ng_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w, fd_set *e, int *n)
usr.sbin/ppp/netgraph.c
378
result = physical_doUpdateSet(d, r, w, e, n, 0);
usr.sbin/ppp/physical.c
138
int *n)
usr.sbin/ppp/physical.c
140
return physical_doUpdateSet(d, r, w, e, n, 0);
usr.sbin/ppp/physical.c
424
int n, slot;
usr.sbin/ppp/physical.c
453
if (p->fd >= 0 && ioctl(p->fd, TIOCOUTQ, &n) >= 0)
usr.sbin/ppp/physical.c
454
prompt_Printf(arg->prompt, " Physical outq: %d\n", n);
usr.sbin/ppp/physical.c
465
for (n = 0; n < p->cfg.ndev; n++) {
usr.sbin/ppp/physical.c
466
if (n)
usr.sbin/ppp/physical.c
521
int n, found;
usr.sbin/ppp/physical.c
526
n = physical_Read(p, rbuff, sizeof p->input.buf - p->input.sz);
usr.sbin/ppp/physical.c
528
p->link.name, n, (int)(sizeof p->input.buf - p->input.sz), p->fd);
usr.sbin/ppp/physical.c
529
if (n <= 0) {
usr.sbin/ppp/physical.c
530
if (n < 0)
usr.sbin/ppp/physical.c
541
n += p->input.sz;
usr.sbin/ppp/physical.c
545
found = hdlc_Detect((u_char const **)(void *)&rbuff, n, physical_IsSync(p));
usr.sbin/ppp/physical.c
549
p->input.sz = n - (rbuff - p->input.buf);
usr.sbin/ppp/physical.c
564
} else if (n > 0)
usr.sbin/ppp/physical.c
565
link_PullPacket(&p->link, rbuff, n, bundle);
usr.sbin/ppp/physical.c
647
unsigned biggest, sz, n;
usr.sbin/ppp/physical.c
650
for (n = 0; n < NDEVICES; n++)
usr.sbin/ppp/physical.c
651
if (devices[n].DeviceSize) {
usr.sbin/ppp/physical.c
652
sz = (*devices[n].DeviceSize)();
usr.sbin/ppp/physical.c
824
int *n, int force)
usr.sbin/ppp/physical.c
846
if (sets && *n < p->fd + 1)
usr.sbin/ppp/physical.c
847
*n = p->fd + 1;
usr.sbin/ppp/prompt.c
133
prompt_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w __unused, fd_set *e, int *n)
usr.sbin/ppp/prompt.c
154
if (sets && *n < p->fd_in + 1)
usr.sbin/ppp/prompt.c
155
*n = p->fd_in + 1;
usr.sbin/ppp/prompt.c
187
int n;
usr.sbin/ppp/prompt.c
192
n = read(p->fd_in, linebuff, sizeof linebuff - 1);
usr.sbin/ppp/prompt.c
193
if (n > 0) {
usr.sbin/ppp/prompt.c
194
if (linebuff[n-1] == '\n')
usr.sbin/ppp/prompt.c
195
linebuff[--n] = '\0';
usr.sbin/ppp/prompt.c
197
linebuff[n] = '\0';
usr.sbin/ppp/prompt.c
200
if (n) {
usr.sbin/ppp/prompt.c
203
if (!command_Decode(bundle, linebuff, n, p, p->src.from))
usr.sbin/ppp/prompt.c
207
} else if (n <= 0) {
usr.sbin/ppp/prompt.c
242
n = read(p->fd_in, &ch, 1);
usr.sbin/ppp/prompt.c
243
log_Printf(LogDEBUG, "Got %d bytes (reading from the terminal)\n", n);
usr.sbin/ppp/prompt.c
245
if (n > 0) {
usr.sbin/ppp/prompt.c
251
if (physical_Write(p->TermMode->physical, &ch, n) < 0) {
usr.sbin/ppp/prompt.c
291
if (physical_Write(p->TermMode->physical, &ch, n) < 0) {
usr.sbin/ppp/radius.c
571
radius_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w __unused, fd_set *e __unused, int *n)
usr.sbin/ppp/radius.c
577
if (*n < rad->cx.fd + 1)
usr.sbin/ppp/radius.c
578
*n = rad->cx.fd + 1;
usr.sbin/ppp/server.c
52
server_UpdateSet(struct fdescriptor *d, fd_set *r, fd_set *w, fd_set *e, int *n)
usr.sbin/ppp/server.c
60
if (*n < s->fd + 1)
usr.sbin/ppp/server.c
61
*n = s->fd + 1;
usr.sbin/ppp/server.c
68
sets += descriptor_UpdateSet(&p->desc, r, w, e, n);
usr.sbin/ppp/slcompress.c
101
#define ENCODEZ(n) { \
usr.sbin/ppp/slcompress.c
102
if ((u_short)(n) >= 256 || (u_short)(n) == 0) { \
usr.sbin/ppp/slcompress.c
104
cp[1] = (n); \
usr.sbin/ppp/slcompress.c
105
cp[0] = (n) >> 8; \
usr.sbin/ppp/slcompress.c
108
*cp++ = (n); \
usr.sbin/ppp/slcompress.c
91
#define ENCODE(n) { \
usr.sbin/ppp/slcompress.c
92
if ((u_short)(n) >= 256) { \
usr.sbin/ppp/slcompress.c
94
cp[1] = (n); \
usr.sbin/ppp/slcompress.c
95
cp[0] = (n) >> 8; \
usr.sbin/ppp/slcompress.c
98
*cp++ = (n); \
usr.sbin/ppp/systems.c
289
int len, n;
usr.sbin/ppp/systems.c
291
n = 0;
usr.sbin/ppp/systems.c
293
n++;
usr.sbin/ppp/systems.c
306
return n;
usr.sbin/ppp/systems.c
343
int n, len;
usr.sbin/ppp/systems.c
366
while ((n = xgets(line, sizeof line, fp))) {
usr.sbin/ppp/systems.c
367
linenum += n;
usr.sbin/ppp/systems.c
381
n = ReadSystem(bundle, name, arg, prompt, cx, how);
usr.sbin/ppp/systems.c
383
if (!n) {
usr.sbin/ppp/systems.c
404
while ((n = xgets(line, sizeof line, fp))) {
usr.sbin/ppp/systems.c
405
linenum += n;
usr.sbin/ppp/throughput.c
242
throughput_addin(struct pppThroughput *t, long long n)
usr.sbin/ppp/throughput.c
244
t->OctetsIn += n;
usr.sbin/ppp/throughput.c
249
throughput_addout(struct pppThroughput *t, long long n)
usr.sbin/ppp/throughput.c
251
t->OctetsOut += n;
usr.sbin/ppp/timer.c
198
time_t n = time(NULL);
usr.sbin/ppp/timer.c
200
if (n > t)
usr.sbin/ppp/timer.c
202
t = n;
usr.sbin/ppp/tty.c
415
tty_Write(struct physical *p, const void *v, size_t n)
usr.sbin/ppp/tty.c
420
return NgSendData(p->fd, dev->hook, v, n) == -1 ? -1 : (ssize_t)n;
usr.sbin/ppp/tty.c
422
return write(p->fd, v, n);
usr.sbin/ppp/tty.c
426
tty_Read(struct physical *p, void *v, size_t n)
usr.sbin/ppp/tty.c
432
return NgRecvData(p->fd, v, n, hook);
usr.sbin/ppp/tty.c
434
return read(p->fd, v, n);
usr.sbin/ppp/udp.c
103
ret = write(p->fd, v, n);
usr.sbin/ppp/udp.c
112
udp_Recvfrom(struct physical *p, void *v, size_t n)
usr.sbin/ppp/udp.c
118
return read(p->fd, v, n);
usr.sbin/ppp/udp.c
121
ret = recvfrom(p->fd, v, n, 0, (struct sockaddr *)&dev->sock, &sz);
usr.sbin/ppp/udp.c
84
udp_Sendto(struct physical *p, const void *v, size_t n)
usr.sbin/ppp/udp.c
91
ret = write(p->fd, v, n);
usr.sbin/ppp/udp.c
96
ret = sendto(p->fd, v, n, 0, (struct sockaddr *)&dev->sock,
usr.sbin/pppctl/pppctl.c
204
int n, socksz, arg, fd, len, verbose, save_errno, hide1, hide1off, hide2;
usr.sbin/pppctl/pppctl.c
259
n = snprintf(title + pos, sizeof title - pos, "%s%s",
usr.sbin/pppctl/pppctl.c
262
n = snprintf(title + pos, sizeof title - pos, " %.*s",
usr.sbin/pppctl/pppctl.c
265
n = 0;
usr.sbin/pppctl/pppctl.c
266
if (n < 0 || n >= sizeof title - pos)
usr.sbin/pppctl/pppctl.c
268
pos += n;
usr.sbin/pstat/pstat.c
924
int n;
usr.sbin/pstat/pstat.c
929
n = kvm_getswapinfo(
usr.sbin/pstat/pstat.c
951
for (i = 0; i < n; ++i) {
usr.sbin/pstat/pstat.c
961
CONVERTB(kswap[n].ksw_used),
usr.sbin/pstat/pstat.c
966
CONVERTB(kswap[n].ksw_total),
usr.sbin/pstat/pstat.c
974
CONVERT(kswap[n].ksw_used),
usr.sbin/pstat/pstat.c
975
CONVERT(kswap[n].ksw_total));
usr.sbin/pstat/pstat.c
977
} else if (n > 1) {
usr.sbin/pstat/pstat.c
978
Output("Total", hlen, &kswap[n], 0);
usr.sbin/pw/pw_group.c
190
struct termios n = t;
usr.sbin/pw/pw_group.c
193
n.c_lflag &= ~(ECHO);
usr.sbin/pw/pw_group.c
194
tcsetattr(fd, TCSANOW, &n);
usr.sbin/pw/pw_user.c
622
struct termios n = t;
usr.sbin/pw/pw_user.c
625
n.c_lflag &= ~(ECHO);
usr.sbin/pw/pw_user.c
626
tcsetattr(fd, TCSANOW, &n);
usr.sbin/quot/quot.c
408
int n;
usr.sbin/quot/quot.c
427
for (usr = usrs, n = nusers; --n >= 0 && usr->count; usr++) {
usr.sbin/quot/quot.c
91
#define SIZE(n) (n)
usr.sbin/quot/quot.c
93
#define SIZE(n) ((int)(((quad_t)(n) * 512 + blocksize - 1)/blocksize))
usr.sbin/rarpd/rarpd.c
344
int n = 0;
usr.sbin/rarpd/rarpd.c
351
sprintf(device, "/dev/bpf%d", n++);
usr.sbin/rarpd/rarpd.c
795
u_int n;
usr.sbin/rarpd/rarpd.c
819
n = write(ii->ii_fd, (char *)ep, len);
usr.sbin/rarpd/rarpd.c
820
if (n != len)
usr.sbin/rarpd/rarpd.c
821
logmsg(LOG_ERR, "write: only %d of %d bytes written", n, len);
usr.sbin/rarpd/rarpd.c
854
int n;
usr.sbin/rarpd/rarpd.c
860
n = 4;
usr.sbin/rarpd/rarpd.c
873
} while (--n > 0);
usr.sbin/resident/resident.c
162
int n;
usr.sbin/resident/resident.c
175
if ((n = read(fd, &hdr, sizeof hdr)) == -1) {
usr.sbin/resident/resident.c
184
if ((size_t)n >= sizeof hdr.elf && IS_ELF(hdr.elf)) {
usr.sbin/rip6query/rip6query.c
163
n = (len - sizeof(struct rip6) + sizeof(struct netinfo6)) /
usr.sbin/rip6query/rip6query.c
166
for (i = 0; i < n; i++, np++) {
usr.sbin/rip6query/rip6query.c
68
#define RIPSIZE(n) (sizeof(struct rip6) + (n-1) * sizeof(struct netinfo6))
usr.sbin/rip6query/rip6query.c
79
int i, n, len, flen;
usr.sbin/rmt/rmt.c
123
n = atoi(count);
usr.sbin/rmt/rmt.c
125
record = checkbuf(record, n);
usr.sbin/rmt/rmt.c
126
for (i = 0; i < n; i += cc) {
usr.sbin/rmt/rmt.c
127
cc = read(0, &record[i], n - i);
usr.sbin/rmt/rmt.c
133
rval = write(tape, record, n);
usr.sbin/rmt/rmt.c
141
n = atoi(count);
usr.sbin/rmt/rmt.c
142
record = checkbuf(record, n);
usr.sbin/rmt/rmt.c
143
rval = read(tape, record, n);
usr.sbin/rmt/rmt.c
72
int n, i, cc;
usr.sbin/route6d/route6d.c
301
#define FLAG(c, flag, n) case c: do { flag = n; break; } while(0)
usr.sbin/route6d/route6d.c
3132
plen2mask(int n)
usr.sbin/route6d/route6d.c
3140
for (i = 0; i < 16; i++, p++, n -= 8) {
usr.sbin/route6d/route6d.c
3141
if (n >= 8) {
usr.sbin/route6d/route6d.c
3145
*p = pl2m[n];
usr.sbin/route6d/route6d.c
3269
int n;
usr.sbin/route6d/route6d.c
3282
n = nindex2ifc;
usr.sbin/route6d/route6d.c
3285
if (n != nindex2ifc) {
usr.sbin/route6d/route6d.c
3292
memset(p + n, 0, sizeof(*index2ifc) * (nindex2ifc - n));
usr.sbin/route6d/route6d.c
649
#define RIPSIZE(n) \
usr.sbin/route6d/route6d.c
650
(sizeof(struct rip6) + ((n)-1) * sizeof(struct netinfo6))
usr.sbin/rpcbind/rpcb_svc_com.c
1100
int n;
usr.sbin/rpcbind/rpcb_svc_com.c
1109
for (n = 0; n <= svc_maxfd; n++) {
usr.sbin/rpcbind/rpcb_svc_com.c
1110
if (FD_ISSET(n, &svc_fdset)) {
usr.sbin/rpcbind/rpcb_svc_com.c
1111
p->fd = n;
usr.sbin/rtadvd/control.c
101
if (n != sizeof(*cm)) {
usr.sbin/rtadvd/control.c
147
n = read(fd, msg, msglen);
usr.sbin/rtadvd/control.c
148
if (n < 0 && errno == EAGAIN) {
usr.sbin/rtadvd/control.c
156
if (n != msglen) {
usr.sbin/rtadvd/control.c
62
int n;
usr.sbin/rtadvd/control.c
91
n = read(fd, cm, sizeof(*cm));
usr.sbin/rtadvd/control.c
92
if (n < 0 && errno == EAGAIN) {
usr.sbin/rtadvd/rtadvd.c
463
int n, type, ifindex = 0, plen;
usr.sbin/rtadvd/rtadvd.c
480
n = read(s->si_fd, msg, sizeof(msg));
usr.sbin/rtadvd/rtadvd.c
483
"(type = %d, len = %d)", __func__, rtm->rtm_type, n);
usr.sbin/rtadvd/rtadvd.c
485
if (n > rtm->rtm_msglen) {
usr.sbin/rtadvd/rtadvd.c
494
__func__, n, rtm->rtm_msglen);
usr.sbin/rtadvd/rtadvd.c
497
n = rtm->rtm_msglen;
usr.sbin/rtadvd/rtadvd.c
501
lim = msg + n;
usr.sbin/rtsold/rtsock.c
85
ssize_t n;
usr.sbin/rtsold/rtsock.c
95
n = read(s, msg, sizeof(msg));
usr.sbin/rtsold/rtsock.c
97
lim = msg + n;
usr.sbin/rwhod/rwhod.c
284
int n;
usr.sbin/rwhod/rwhod.c
286
n = poll(pfd, 1, 1000);
usr.sbin/rwhod/rwhod.c
293
if (n == 1)
usr.sbin/rwhod/rwhod.c
362
int i, n = (cc - WHDRSIZE)/sizeof(struct whoent);
usr.sbin/rwhod/rwhod.c
371
for (i = 0; i < n; i++) {
usr.sbin/sdpd/server.c
293
int32_t n, fd;
usr.sbin/sdpd/server.c
299
n = select(srv->maxfd + 1, &fdset, NULL, NULL, NULL);
usr.sbin/sdpd/server.c
300
if (n < 0) {
usr.sbin/sdpd/server.c
311
for (fd = 0; fd < srv->maxfd + 1 && n > 0; fd ++) {
usr.sbin/sdpd/server.c
316
n --;
usr.sbin/sdpd/server.c
647
int n;
usr.sbin/sdpd/server.c
669
for (n = 0 ; n < cred->cmcred_ngroups ; n++) {
usr.sbin/sdpd/server.c
670
if (cred->cmcred_groups[n] == grp->gr_gid)
usr.sbin/sensorsd/sensorsd.c
485
int i = 0, n = 0, r;
usr.sbin/sensorsd/sensorsd.c
491
for (i = n = 0; n < len; ++i) {
usr.sbin/sensorsd/sensorsd.c
493
buf[n++] = '\0';
usr.sbin/sensorsd/sensorsd.c
497
buf[n++] = limit->command[i];
usr.sbin/sensorsd/sensorsd.c
502
buf[n++] = '\0';
usr.sbin/sensorsd/sensorsd.c
508
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
512
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
516
r = snprintf(&buf[n], len - n, "%d",
usr.sbin/sensorsd/sensorsd.c
539
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
562
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
567
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
572
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
577
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
582
r = snprintf(&buf[n], len - n, "%%%c",
usr.sbin/sensorsd/sensorsd.c
586
if (r < 0 || (r >= len - n)) {
usr.sbin/sensorsd/sensorsd.c
592
n += r;
usr.sbin/sliplogin/sliplogin.c
146
int i, j, n;
usr.sbin/sliplogin/sliplogin.c
163
n = sscanf(loginargs, "%15s%*[ \t]%15s%*[ \t]%15s%*[ \t]%15s%*[ \t]%15s%*[ \t]%15s%*[ \t]%15s%*[ \t]%15s%*[ \t]%15s\n",
usr.sbin/sliplogin/sliplogin.c
166
if (n < 4) {
usr.sbin/sliplogin/sliplogin.c
176
for (i = 0; i < n - 4; i++) {
usr.sbin/sliplogin/sliplogin.c
218
n = 0;
usr.sbin/sliplogin/sliplogin.c
224
n = sscanf(buf, "%d %d %d", &keepal, &outfill, &slunit);
usr.sbin/sliplogin/sliplogin.c
225
if (n < 1) {
usr.sbin/sliplogin/sliplogin.c
233
if (n == 0)
usr.sbin/sliplogin/sliplogin.c
360
int n;
usr.sbin/sliplogin/sliplogin.c
470
for (n = strlen(devnam); n > 0; n--)
usr.sbin/sliplogin/sliplogin.c
471
if (devnam[n] == '/') {
usr.sbin/sliplogin/sliplogin.c
472
n++;
usr.sbin/sliplogin/sliplogin.c
475
sprintf(iffilename, "%s%s.if", _PATH_VARRUN, &devnam[n]);
usr.sbin/syslogd/syslogd.c
716
long n;
usr.sbin/syslogd/syslogd.c
725
n = strtol(p + 1, &q, 10);
usr.sbin/syslogd/syslogd.c
726
if (*q == '>' && n >= 0 && n < INT_MAX && errno == 0) {
usr.sbin/syslogd/syslogd.c
728
pri = n;
usr.sbin/syslogd/syslogd.c
816
long n;
usr.sbin/syslogd/syslogd.c
825
n = strtol(p + 1, &q, 10);
usr.sbin/syslogd/syslogd.c
826
if (*q == '>' && n >= 0 && n < INT_MAX && errno == 0) {
usr.sbin/syslogd/syslogd.c
828
pri = n;
usr.sbin/sysvipcd/perm.c
43
int n;
usr.sbin/sysvipcd/perm.c
48
for (n = 0 ; n < cred->cmcred_ngroups ; n++) {
usr.sbin/sysvipcd/perm.c
49
if (cred->cmcred_groups[n] == gid)
usr.sbin/usbconfig/dump.c
302
uint8_t n;
usr.sbin/usbconfig/dump.c
318
for (n = 0; n != 255; n++) {
usr.sbin/usbconfig/dump.c
319
if (libusb20_dev_get_iface_desc(pdev, n, buf, sizeof(buf)))
usr.sbin/usbconfig/dump.c
325
libusb20_dev_get_address(pdev), n, buf);
usr.sbin/usbconfig/dump.c
41
#define DUMP0(n,type,field,...) dump_field(pdev, " ", #field, n->field);
usr.sbin/usbconfig/dump.c
42
#define DUMP1(n,type,field,...) dump_field(pdev, " ", #field, n->field);
usr.sbin/usbconfig/dump.c
43
#define DUMP2(n,type,field,...) dump_field(pdev, " ", #field, n->field);
usr.sbin/usbconfig/dump.c
44
#define DUMP3(n,type,field,...) dump_field(pdev, " ", #field, n->field);
usr.sbin/usbconfig/dump.c
452
uint8_t n;
usr.sbin/usbconfig/dump.c
467
for (n = 0; n != len; n++) {
usr.sbin/usbconfig/dump.c
468
printf("0x%02x%s", (uint8_t)pbuf[n],
usr.sbin/usbconfig/dump.c
469
(n != (len-1)) ? ", " : "");
usr.sbin/usbconfig/usbconfig.c
210
uint8_t n;
usr.sbin/usbconfig/usbconfig.c
212
for (n = 0; n != (sizeof(token) / sizeof(token[0])); n++) {
usr.sbin/usbconfig/usbconfig.c
213
if (strcasecmp(str, token[n].name) == 0) {
usr.sbin/usbconfig/usbconfig.c
214
if (token[n].narg > narg) {
usr.sbin/usbconfig/usbconfig.c
218
return (token[n].value);
usr.sbin/usbconfig/usbconfig.c
535
int n;
usr.sbin/usbconfig/usbconfig.c
545
for (n = 1; n != argc; n++) {
usr.sbin/usbconfig/usbconfig.c
548
t = (argc - n - 1);
usr.sbin/usbconfig/usbconfig.c
551
switch (get_token(argv[n], t)) {
usr.sbin/usbconfig/usbconfig.c
556
opt->quirkname = argv[n + 1];
usr.sbin/usbconfig/usbconfig.c
557
n++;
usr.sbin/usbconfig/usbconfig.c
567
opt->quirkname = argv[n + 1];
usr.sbin/usbconfig/usbconfig.c
568
n++;
usr.sbin/usbconfig/usbconfig.c
578
opt->vid = num_id(argv[n + 1], "Vendor ID");
usr.sbin/usbconfig/usbconfig.c
579
opt->pid = num_id(argv[n + 2], "Product ID");
usr.sbin/usbconfig/usbconfig.c
580
opt->lo_rev = num_id(argv[n + 3], "Low Revision");
usr.sbin/usbconfig/usbconfig.c
581
opt->hi_rev = num_id(argv[n + 4], "High Revision");
usr.sbin/usbconfig/usbconfig.c
582
opt->quirkname = argv[n + 5];
usr.sbin/usbconfig/usbconfig.c
583
n += 5;
usr.sbin/usbconfig/usbconfig.c
593
opt->vid = num_id(argv[n + 1], "Vendor ID");
usr.sbin/usbconfig/usbconfig.c
594
opt->pid = num_id(argv[n + 2], "Product ID");
usr.sbin/usbconfig/usbconfig.c
595
opt->lo_rev = num_id(argv[n + 3], "Low Revision");
usr.sbin/usbconfig/usbconfig.c
596
opt->hi_rev = num_id(argv[n + 4], "High Revision");
usr.sbin/usbconfig/usbconfig.c
597
opt->quirkname = argv[n + 5];
usr.sbin/usbconfig/usbconfig.c
598
n += 5;
usr.sbin/usbconfig/usbconfig.c
605
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
612
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
626
ptr = argv[n + 1];
usr.sbin/usbconfig/usbconfig.c
639
"parse '%s'", argv[n + 1]);
usr.sbin/usbconfig/usbconfig.c
645
n++;
usr.sbin/usbconfig/usbconfig.c
653
opt->bus = num_id(argv[n + 1], "busnum");
usr.sbin/usbconfig/usbconfig.c
655
n++;
usr.sbin/usbconfig/usbconfig.c
658
opt->addr = num_id(argv[n + 1], "addr");
usr.sbin/usbconfig/usbconfig.c
660
n++;
usr.sbin/usbconfig/usbconfig.c
663
opt->iface = num_id(argv[n + 1], "iface");
usr.sbin/usbconfig/usbconfig.c
665
n++;
usr.sbin/usbconfig/usbconfig.c
669
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
670
opt->config_index = num_id(argv[n + 1], "cfg_index");
usr.sbin/usbconfig/usbconfig.c
673
n++;
usr.sbin/usbconfig/usbconfig.c
677
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
678
opt->alt_index = num_id(argv[n + 1], "cfg_index");
usr.sbin/usbconfig/usbconfig.c
681
n++;
usr.sbin/usbconfig/usbconfig.c
685
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
686
opt->template = get_int(argv[n + 1]);
usr.sbin/usbconfig/usbconfig.c
689
n++;
usr.sbin/usbconfig/usbconfig.c
693
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
699
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
705
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
711
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
717
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
723
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
724
opt->string_index = num_id(argv[n + 1], "str_index");
usr.sbin/usbconfig/usbconfig.c
727
n++;
usr.sbin/usbconfig/usbconfig.c
731
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
737
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
743
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
749
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
755
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
761
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
767
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
773
duplicate_option(argv[n]);
usr.sbin/usbconfig/usbconfig.c
775
opt->setup.bmRequestType = num_id(argv[n + 1], "bmReqTyp");
usr.sbin/usbconfig/usbconfig.c
776
opt->setup.bRequest = num_id(argv[n + 2], "bReq");
usr.sbin/usbconfig/usbconfig.c
777
opt->setup.wValue = num_id(argv[n + 3], "wVal");
usr.sbin/usbconfig/usbconfig.c
778
opt->setup.wIndex = num_id(argv[n + 4], "wIndex");
usr.sbin/usbconfig/usbconfig.c
779
opt->setup.wLength = num_id(argv[n + 5], "wLen");
usr.sbin/usbconfig/usbconfig.c
786
n += 5;
usr.sbin/usbconfig/usbconfig.c
791
t = (argc - n - 1);
usr.sbin/usbconfig/usbconfig.c
798
num_id(argv[n + t + 1], "req_data");
usr.sbin/usbconfig/usbconfig.c
800
n += opt->setup.wLength;
usr.sbin/vidcontrol/decode.c
39
int n, pos = 0, tpos;
usr.sbin/vidcontrol/decode.c
50
sscanf(temp, "begin %o %s", &n, temp);
usr.sbin/vidcontrol/decode.c
55
if ((n = DEC(*p)) <= 0)
usr.sbin/vidcontrol/decode.c
57
for (++p; n > 0; p += 4, n -= 3) {
usr.sbin/vidcontrol/decode.c
59
if (n >= 3) {
usr.sbin/vidcontrol/decode.c
65
if (n >= 1) {
usr.sbin/vidcontrol/decode.c
69
if (n >= 2) {
usr.sbin/vidcontrol/decode.c
73
if (n >= 3) {
usr.sbin/vidcontrol/vidcontrol.c
727
int n;
usr.sbin/vidcontrol/vidcontrol.c
734
n = atoi(arg);
usr.sbin/vidcontrol/vidcontrol.c
736
if (n < 1 || n > 16) {
usr.sbin/vidcontrol/vidcontrol.c
739
} else if (ioctl(0, VT_ACTIVATE, (caddr_t) (long) n) == -1) {
usr.sbin/vnconfig/vnconfig.c
389
int n = (st.st_size > ZBUFSIZE) ?
usr.sbin/vnconfig/vnconfig.c
391
if (write(fd, buf, n) != n) {
usr.sbin/vnconfig/vnconfig.c
397
st.st_size -= (off_t)n;
usr.sbin/ypserv/yp_dnslookup.c
168
int n;
usr.sbin/ypserv/yp_dnslookup.c
176
n = res_mkquery(QUERY,name,C_IN,type,NULL,0,NULL,buf,sizeof(buf));
usr.sbin/ypserv/yp_dnslookup.c
178
if (n <= 0) {
usr.sbin/ypserv/yp_dnslookup.c
187
rval = sendto(resfd, buf, n, 0,
usr.sbin/ypserv/yp_dnslookup.c
319
struct circleq_dnsentry *q, *n;
usr.sbin/ypserv/yp_dnslookup.c
324
n = TAILQ_NEXT(q, links);
usr.sbin/ypserv/yp_dnslookup.c
331
q = n;
usr.sbin/ypserv/yp_dnslookup.c
475
int type, n;
usr.sbin/ypserv/yp_dnslookup.c
507
for (n = IN6ADDRSZ - 1; n >= 0; n--) {
usr.sbin/ypserv/yp_dnslookup.c
508
qp += (size_t)sprintf(qp, "%x.%x.", uaddr[n] & 0xf,
usr.sbin/ypserv/yp_dnslookup.c
509
(uaddr[n] >> 4) & 0xf);
