bin/csh/alloc.c
43
xmalloc(size_t n)
bin/csh/alloc.c
47
if ((ptr = malloc(n)) == NULL) {
bin/csh/alloc.c
55
xreallocarray(void * p, size_t c, size_t n)
bin/csh/alloc.c
59
if ((ptr = reallocarray(p, c, n)) == NULL) {
bin/csh/alloc.c
67
xcalloc(size_t s, size_t n)
bin/csh/alloc.c
71
if ((ptr = calloc(s, n)) == NULL) {
bin/csh/alloc.c
82
char *n;
bin/csh/alloc.c
86
if ((n = strdup(s)) == NULL) {
bin/csh/alloc.c
90
return (n);
bin/csh/dir.c
151
Char **n = *v, *s;
bin/csh/dir.c
154
for (n++; *n != NULL && (*n)[0] == '-'; n++)
bin/csh/dir.c
155
for (s = &((*n)[1]); *s; s++)
bin/csh/dir.c
170
*v = n;
bin/csh/file.c
163
ssize_t n;
bin/csh/file.c
167
n = read(cl->fdin, &c, 1);
bin/csh/file.c
168
switch (n) {
bin/csh/func.c
905
Char **ep, *p, *n, *name;
bin/csh/func.c
923
for (n = name, p = *ep; *p && *p != '='; *n++ = *p++)
bin/csh/func.c
925
*n = '\0';
bin/csh/glob.c
854
int n;
bin/csh/glob.c
860
n = (p - s1) + (q - s2) - 1;
bin/csh/glob.c
866
p = gargv[gargc - 1] = xreallocarray(NULL, n, sizeof(Char));
bin/csh/hist.c
106
int n, rflg = 0, hflg = 0;
bin/csh/hist.c
135
n = getn(*v);
bin/csh/hist.c
137
n = getn(value(STRhistory));
bin/csh/hist.c
139
dohist1(Histlist.Hnext, &n, rflg, hflg);
bin/csh/parse.c
468
int n, c;
bin/csh/parse.c
493
n = 0;
bin/csh/parse.c
500
n++;
bin/csh/parse.c
506
n++;
bin/csh/parse.c
514
n++;
bin/csh/parse.c
521
n--;
bin/csh/parse.c
527
n++;
bin/csh/parse.c
530
if (n < 0)
bin/csh/parse.c
531
n = 0;
bin/csh/parse.c
533
av = xcalloc(n + 1, sizeof(*av));
bin/csh/parse.c
535
n = 0;
bin/csh/parse.c
618
av[n] = Strsave(p->word);
bin/csh/parse.c
619
n++;
bin/csh/parse.c
624
if (n != 0)
bin/csh/parse.c
630
if (n == 0)
bin/csh/set.c
324
putn(int n)
bin/csh/set.c
329
i = snprintf(number, sizeof(number), "%d", n);
bin/csh/set.c
338
int n;
bin/csh/set.c
350
n = 0;
bin/csh/set.c
352
n = n * 10 + *cp++ - '0';
bin/csh/set.c
355
return (sign ? -n : n);
bin/csh/str.c
149
size_t n = siz;
bin/csh/str.c
152
if (n != 0 && --n != 0) {
bin/csh/str.c
156
} while (--n != 0);
bin/csh/str.c
160
if (n == 0) {
bin/csh/str.c
175
size_t n = siz;
bin/csh/str.c
179
while (n-- != 0 && *d != '\0')
bin/csh/str.c
182
n = siz - dlen;
bin/csh/str.c
184
if (n == 0)
bin/csh/str.c
187
if (n != 1) {
bin/csh/str.c
189
n--;
bin/csh/str.c
226
size_t n;
bin/csh/str.c
228
for (n = 0; *str++; n++)
bin/csh/str.c
230
return (n);
bin/csh/str.c
254
Strncmp(Char *str1, Char *str2, size_t n)
bin/csh/str.c
256
if (n == 0)
bin/csh/str.c
276
} while (--n != 0);
bin/csh/str.c
283
Char *n;
bin/csh/str.c
290
n = p = xreallocarray(NULL, p - s, sizeof(Char));
bin/csh/str.c
293
return (n);
bin/csh/str.c
389
size_t n;
bin/csh/str.c
397
n = ((dp - cp) << 2) + 1; /* 4 times + NUL */
bin/csh/str.c
398
if (dstsize < n) {
bin/csh/str.c
399
sdst = xreallocarray(sdst, n, sizeof(char));
bin/csh/str.c
400
dstsize = n;
bin/csh/str.c
50
size_t n;
bin/csh/str.c
56
for (n = 0; src[n] != NULL; n++)
bin/csh/str.c
58
sdst = dst = xreallocarray(NULL, n + 1, sizeof(Char *));
bin/csh/str.c
69
size_t n;
bin/csh/str.c
75
for (n = 0; src[n] != NULL; n++)
bin/csh/str.c
77
sdst = dst = xreallocarray(NULL, n + 1, sizeof(char *));
bin/dd/dd.c
236
ssize_t n;
bin/dd/dd.c
253
n = read(in.fd, in.dbp, in.dbsz);
bin/dd/dd.c
254
if (n == 0) {
bin/dd/dd.c
260
if (n == -1) {
bin/dd/dd.c
289
} else if (n == in.dbsz) {
bin/dd/dd.c
290
in.dbcnt += in.dbrcnt = n;
bin/dd/dd.c
299
in.dbcnt += in.dbrcnt = n;
bin/dd/dd.c
316
if ((n = in.dbrcnt) & 1) {
bin/dd/dd.c
318
--n;
bin/dd/dd.c
320
swapbytes(in.dbp, n);
bin/dd/dd.c
360
size_t cnt, n;
bin/dd/dd.c
381
for (n = force ? out.dbcnt : out.dbsz;; n = out.dbsz) {
bin/dd/dd.c
382
for (cnt = n;; cnt -= nw) {
bin/dd/dd.c
393
if (nw == n) {
bin/dd/dd.c
394
if (n != out.dbsz)
bin/dd/dd.c
411
if ((out.dbcnt -= n) < out.dbsz)
bin/dd/position.c
119
ssize_t n;
bin/dd/position.c
144
if ((n = read(out.fd, out.db, out.dbsz)) > 0)
bin/dd/position.c
147
if (n == -1)
bin/dd/position.c
161
if ((n = write(out.fd, out.db, out.dbsz)) != out.dbsz)
bin/echo/echo.c
135
for (n = 0; n < 3 && *s >= '0' && *s <= '7'; n++)
bin/echo/echo.c
143
for (n = 0;
bin/echo/echo.c
144
n < 2 && isxdigit(*s); n++) {
bin/echo/echo.c
91
int ch, n;
bin/ed/buf.c
150
int n = 0;
bin/ed/buf.c
153
n++;
bin/ed/buf.c
154
if (n && cp == &buffer_head) {
bin/ed/buf.c
158
return n;
bin/ed/buf.c
164
get_addressed_line_node(int n)
bin/ed/buf.c
170
if (n > on) {
bin/ed/buf.c
171
if (n <= (on + addr_last) >> 1)
bin/ed/buf.c
172
for (; on < n; on++)
bin/ed/buf.c
176
for (on = addr_last; on > n; on--)
bin/ed/buf.c
180
if (n >= on >> 1)
bin/ed/buf.c
181
for (; on > n; on--)
bin/ed/buf.c
185
for (on = 0; on < n; on++)
bin/ed/buf.c
239
quit(int n)
bin/ed/buf.c
245
exit(n);
bin/ed/ed.h
108
#define REALLOC(b,n,i,err) \
bin/ed/ed.h
109
if ((i) > (n)) { \
bin/ed/ed.h
110
int ti = (n); \
bin/ed/ed.h
119
(n) = ti; \
bin/ed/glbl.c
101
while ((n = get_tty_line()) > 0 &&
bin/ed/glbl.c
102
ibuf[n - 1] != '\n')
bin/ed/glbl.c
104
if (n < 0)
bin/ed/glbl.c
106
else if (n == 0) {
bin/ed/glbl.c
109
} else if (n == 1 && !strcmp(ibuf, "\n"))
bin/ed/glbl.c
111
else if (n == 2 && !strcmp(ibuf, "&\n")) {
bin/ed/glbl.c
116
} else if ((cmd = get_extended_line(&n, 0)) == NULL)
bin/ed/glbl.c
119
REALLOC(ocmd, ocmdsz, n + 1, ERR);
bin/ed/glbl.c
120
memcpy(ocmd, cmd, n + 1);
bin/ed/glbl.c
48
int n;
bin/ed/glbl.c
61
for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) {
bin/ed/glbl.c
84
int n;
bin/ed/glbl.c
90
else if ((cmd = get_extended_line(&n, 0)) == NULL)
bin/ed/io.c
149
write_file(char *fn, char *mode, int n, int m)
bin/ed/io.c
159
} else if ((size = write_stream(fp, n, m)) < 0)
bin/ed/io.c
168
return n ? m - n + 1 : 0;
bin/ed/io.c
174
write_stream(FILE *fp, int n, int m)
bin/ed/io.c
176
line_t *lp = get_addressed_line_node(n);
bin/ed/io.c
181
for (; n && n <= m; n++, lp = lp->q_forw) {
bin/ed/io.c
185
if (n != addr_last || !isbinary || !newline_added)
bin/ed/io.c
217
int l, n;
bin/ed/io.c
233
if ((n = get_tty_line()) < 0)
bin/ed/io.c
235
else if (n == 0 || ibuf[n - 1] != '\n') {
bin/ed/io.c
239
REALLOC(cvbuf, cvbufsz, l + n, NULL);
bin/ed/io.c
240
memcpy(cvbuf + l, ibuf, n);
bin/ed/io.c
241
l += n;
bin/ed/io.c
242
if (n < 2 || !has_trailing_escape(cvbuf, cvbuf + l - 1))
bin/ed/io.c
309
put_tty_line(char *s, int l, int n, int gflag)
bin/ed/io.c
315
printf("%d\t", n);
bin/ed/io.c
46
read_file(char *fn, int n)
bin/ed/io.c
57
} else if ((size = read_stream(fp, n)) < 0)
bin/ed/io.c
66
return current_addr - n;
bin/ed/io.c
76
read_stream(FILE *fp, int n)
bin/ed/io.c
78
line_t *lp = get_addressed_line_node(n);
bin/ed/io.c
83
int appended = (n == addr_last);
bin/ed/io.c
87
for (current_addr = n; (len = get_stream_line(fp)) > 0; size += len) {
bin/ed/main.c
1003
REALLOC(buf, n, i + j, ERR);
bin/ed/main.c
1023
append_lines(int n)
bin/ed/main.c
1030
for (current_addr = n;;) {
bin/ed/main.c
1075
static int n;
bin/ed/main.c
1086
REALLOC(buf, n, size + bp->len, ERR);
bin/ed/main.c
1090
REALLOC(buf, n, size + 2, ERR);
bin/ed/main.c
1112
int n = INC_MOD(second_addr, addr_last);
bin/ed/main.c
1118
a2 = get_addressed_line_node(n);
bin/ed/main.c
1121
} else if (push_undo_stack(UMOV, p, n) == NULL ||
bin/ed/main.c
1126
a1 = get_addressed_line_node(n);
bin/ed/main.c
1157
int n = second_addr - first_addr + 1;
bin/ed/main.c
1162
n = addr - first_addr + 1;
bin/ed/main.c
1165
for (; n > 0; n=m, m=0, np = get_addressed_line_node(current_addr + 1))
bin/ed/main.c
1166
for (; n-- > 0; np = np->q_forw) {
bin/ed/main.c
1191
line_t *n, *p;
bin/ed/main.c
1198
n = get_addressed_line_node(INC_MOD(to, addr_last));
bin/ed/main.c
1202
unset_active_nodes(p->q_forw, n);
bin/ed/main.c
1203
REQUE(p, n);
bin/ed/main.c
1243
mark_line_node(line_t *lp, int n)
bin/ed/main.c
1245
if (!islower(n)) {
bin/ed/main.c
1248
} else if (mark[n - 'a'] == NULL)
bin/ed/main.c
1250
mark[n - 'a'] = lp;
bin/ed/main.c
1257
get_marked_node_addr(int n)
bin/ed/main.c
1259
if (!islower(n)) {
bin/ed/main.c
1263
return get_line_node_addr(mark[n - 'a']);
bin/ed/main.c
127
int c, n;
bin/ed/main.c
212
if ((n = get_tty_line()) < 0) {
bin/ed/main.c
215
} else if (n == 0) {
bin/ed/main.c
232
} else if (ibuf[n - 1] != '\n') {
bin/ed/main.c
334
int n;
bin/ed/main.c
349
STRTOI(n, ibufp);
bin/ed/main.c
350
addr += (c == '-' || c == '^') ? -n : n;
bin/ed/main.c
484
int n = 0;
bin/ed/main.c
568
else if ((n = (c == 'G' || c == 'V')))
bin/ed/main.c
571
if (exec_global(n, gflag) < 0)
bin/ed/main.c
770
n++;
bin/ed/main.c
772
} while (!n);
bin/ed/main.c
800
if ((n = *ibufp) == 'q' || n == 'Q') {
bin/ed/main.c
819
else if (modified && !scripted && n == 'q')
bin/ed/main.c
874
check_addr_range(int n, int m)
bin/ed/main.c
877
first_addr = n;
bin/ed/main.c
896
int n = current_addr;
bin/ed/main.c
901
if ((n = dir ? INC_MOD(n, addr_last) : DEC_MOD(n, addr_last))) {
bin/ed/main.c
902
lp = get_addressed_line_node(n);
bin/ed/main.c
908
return n;
bin/ed/main.c
910
} while (n != current_addr);
bin/ed/main.c
922
int n;
bin/ed/main.c
929
} else if ((ibufp = get_extended_line(&n, 1)) == NULL)
bin/ed/main.c
933
if ((n = get_shell_command()) < 0)
bin/ed/main.c
935
if (n) printf("%s\n", shcmd + 1);
bin/ed/main.c
937
} else if (n >= PATH_MAX - 1) {
bin/ed/main.c
950
for (n = 0; *ibufp != '\n';)
bin/ed/main.c
951
p[n++] = *ibufp++;
bin/ed/main.c
952
p[n] = '\0';
bin/ed/main.c
963
static int n = 0;
bin/ed/main.c
971
REALLOC(buf, n, j + 1, ERR);
bin/ed/main.c
976
REALLOC(buf, n, i + 2, ERR);
bin/ed/main.c
983
REALLOC(buf, n, i + 1, ERR);
bin/ed/main.c
991
REALLOC(buf, n, i + shcmdi, ERR);
bin/ed/re.c
55
int n;
bin/ed/re.c
75
if ((n = regcomp(exp, exps, 0)) != 0) {
bin/ed/re.c
76
regerror(n, exp, errbuf, sizeof errbuf);
bin/ed/sub.c
103
while ((n = get_tty_line()) == 0 ||
bin/ed/sub.c
104
(n > 0 && ibuf[n - 1] != '\n'))
bin/ed/sub.c
106
if (n < 0)
bin/ed/sub.c
242
int n;
bin/ed/sub.c
253
(n = *sub - '0') <= re_nsub) {
bin/ed/sub.c
254
j = rm[n].rm_so;
bin/ed/sub.c
255
k = rm[n].rm_eo;
bin/ed/sub.c
82
int n = 0;
bin/ed/undo.c
103
REQUE(ustack[n - 1].h, ustack[n].h->q_forw);
bin/ed/undo.c
104
REQUE(ustack[n].t->q_back, ustack[n - 1].t);
bin/ed/undo.c
105
REQUE(ustack[n].h, ustack[n].t);
bin/ed/undo.c
106
n--;
bin/ed/undo.c
112
ustack[n].type ^= 1;
bin/ed/undo.c
115
for (n = u_p; n-- > (u_p + 1)/ 2;)
bin/ed/undo.c
116
USWAP(ustack[n], ustack[u_p - 1 - n]);
bin/ed/undo.c
81
int n;
bin/ed/undo.c
92
for (n = u_p; n-- > 0;) {
bin/ed/undo.c
93
switch(ustack[n].type) {
bin/ed/undo.c
95
REQUE(ustack[n].h->q_back, ustack[n].t->q_forw);
bin/ed/undo.c
98
REQUE(ustack[n].h->q_back, ustack[n].h);
bin/ed/undo.c
99
REQUE(ustack[n].t, ustack[n].t->q_forw);
bin/kill/kill.c
140
int n;
bin/kill/kill.c
144
for (n = 1; n < NSIG; n++) {
bin/kill/kill.c
145
if (!strcasecmp(sys_signame[n], sig))
bin/kill/kill.c
146
return (n);
bin/kill/kill.c
163
int n;
bin/kill/kill.c
165
for (n = 1; n < NSIG; n++) {
bin/kill/kill.c
166
(void)fprintf(fp, "%s", sys_signame[n]);
bin/kill/kill.c
167
if (n == (NSIG / 2) || n == (NSIG - 1))
bin/ksh/c_ksh.c
1151
int i, n, rv, sig;
bin/ksh/c_ksh.c
1192
if (!bi_getn(wp[i], &n))
bin/ksh/c_ksh.c
1194
if (n > 128 && n < 128 + NSIG)
bin/ksh/c_ksh.c
1195
n -= 128;
bin/ksh/c_ksh.c
1196
if (n > 0 && n < NSIG && sigtraps[n].name)
bin/ksh/c_ksh.c
1197
shprintf("%s\n", sigtraps[n].name);
bin/ksh/c_ksh.c
1199
shprintf("%d\n", n);
bin/ksh/c_ksh.c
1240
} else if (!getn(p, &n)) {
bin/ksh/c_ksh.c
1248
if ((n < -1 ? killpg(-n, sig) : kill(n, sig)) == -1) {
bin/ksh/c_ksh.c
363
int n, len = Xlength(xs, xp);
bin/ksh/c_ksh.c
376
n = write(fd, s, len);
bin/ksh/c_ksh.c
377
if (n == -1) {
bin/ksh/c_ksh.c
395
s += n;
bin/ksh/c_ksh.c
396
len -= n;
bin/ksh/c_sh.c
35
int n;
bin/ksh/c_sh.c
45
n = val;
bin/ksh/c_sh.c
47
n = 1;
bin/ksh/c_sh.c
48
if (n < 0) {
bin/ksh/c_sh.c
519
int n;
bin/ksh/c_sh.c
52
if (l->argc < n) {
bin/ksh/c_sh.c
527
if (!getn(arg, &n)) {
bin/ksh/c_sh.c
531
exstat = n;
bin/ksh/c_sh.c
56
l->argv[n] = l->argv[0];
bin/ksh/c_sh.c
560
int n, quit;
bin/ksh/c_sh.c
569
n = 1;
bin/ksh/c_sh.c
57
l->argv += n;
bin/ksh/c_sh.c
570
else if (!bi_getn(arg, &n))
bin/ksh/c_sh.c
572
quit = n;
bin/ksh/c_sh.c
58
l->argc -= n;
bin/ksh/c_sh.c
593
if (n == quit) {
bin/ksh/c_sh.c
604
wp[0], wp[0], n - quit);
bin/ksh/edit.c
121
int n;
bin/ksh/edit.c
123
while ((n = blocking_read(STDIN_FILENO, &c, 1)) < 0 && errno == EINTR)
bin/ksh/edit.c
129
if (n != 1)
bin/ksh/edit.c
268
int n = 1;
bin/ksh/edit.c
273
n++;
bin/ksh/edit.c
274
if (len + n >= bsize)
bin/ksh/edit.c
277
for (i = len, j = len + n; --i >= 0; ) {
bin/ksh/edit.c
283
*lenp += n;
bin/ksh/edit.c
347
int i, n;
bin/ksh/edit.c
349
for (n = 0, nwidth = 0, pp = ap; *pp; n++, pp++) {
bin/ksh/edit.c
353
print_columns(shl_out, n, plain_fmt_entry, (void *) ap, nwidth + 1, 0);
bin/ksh/edit.c
355
return n;
bin/ksh/edit.c
646
int cmdlen, n, i, slen;
bin/ksh/edit.c
671
n = 1;
bin/ksh/edit.c
674
n++;
bin/ksh/edit.c
678
if (asprintf(&name, "complete_%.*s_%d", cmdlen, cmd, n) == -1)
bin/ksh/emacs.c
1952
int n = 0;
bin/ksh/emacs.c
1956
n = n * 10 + (c - '0');
bin/ksh/emacs.c
1963
x_arg = n;
bin/ksh/eval.c
762
int n = 0;
bin/ksh/eval.c
769
n++;
bin/ksh/eval.c
770
c = n; /* ksh88/ksh93 go for number, not max index */
bin/ksh/exec.c
1310
int i, n;
bin/ksh/exec.c
1321
for (n = 0, nwidth = 0, pp = ap; *pp; n++, pp++) {
bin/ksh/exec.c
1331
for (i = n, dwidth = 1; i >= 10; i /= 10)
bin/ksh/exec.c
1337
print_columns(shl_out, n, select_fmt_entry, (void *) &smi,
bin/ksh/exec.c
1340
return n;
bin/ksh/expand.h
48
#define XcheckN(xs, xp, n) do { \
bin/ksh/expand.h
49
ptrdiff_t more = ((xp) + (n)) - (xs).end; \
bin/ksh/expand.h
69
#define Xrestpos(xs, xp, n) ((xs).beg + (n))
bin/ksh/expand.h
82
#define XPinit(x, n) do { \
bin/ksh/expand.h
84
vp__ = areallocarray(NULL, n, sizeof(void *), ATEMP); \
bin/ksh/expand.h
86
(x).end = vp__ + n; \
bin/ksh/expand.h
91
int n = XPsize(x); \
bin/ksh/expand.h
92
(x).beg = areallocarray((x).beg, n, \
bin/ksh/expand.h
94
(x).cur = (x).beg + n; \
bin/ksh/expand.h
95
(x).end = (x).cur + n; \
bin/ksh/history.c
247
int n;
bin/ksh/history.c
254
n = fstat(shf->fd, &statb) == -1 ? 128 :
bin/ksh/history.c
256
Xinit(xs, xp, n, hist_source->areap);
bin/ksh/history.c
257
while ((n = shf_read(xp, Xnleft(xs, xp), shf)) > 0) {
bin/ksh/history.c
258
xp += n;
bin/ksh/history.c
262
if (n < 0) {
bin/ksh/history.c
371
int n;
bin/ksh/history.c
373
if (getn(str, &n)) {
bin/ksh/history.c
374
hp = histptr + (n < 0 ? n : (n - hist_source->line));
bin/ksh/history.c
397
n = findhist(histptr - history - 1, 0, str, anchored);
bin/ksh/history.c
398
if (n < 0) {
bin/ksh/history.c
402
hp = &history[n];
bin/ksh/history.c
469
histnum(int n)
bin/ksh/history.c
473
if (n < 0 || n >= last) {
bin/ksh/history.c
477
current = &history[n];
bin/ksh/history.c
478
return n;
bin/ksh/history.c
552
sethistsize(int n)
bin/ksh/history.c
554
if (n > 0 && (uint32_t)n != histsize) {
bin/ksh/history.c
559
if (offset > n - 1) {
bin/ksh/history.c
562
offset = n - 1;
bin/ksh/history.c
565
memmove(history, histptr - offset, n * sizeof(char *));
bin/ksh/history.c
568
tmp = reallocarray(histbase, n + 1, sizeof(char *));
bin/ksh/history.c
571
histsize = n;
bin/ksh/lex.c
1214
int len, c, n, totlen = 0, indelimit = 0, counting = 1, delimitthis;
bin/ksh/lex.c
1381
n = strlen(str_val(global("HOME")));
bin/ksh/lex.c
1387
} else if (strncmp(p, str_val(global("HOME")), n)
bin/ksh/lex.c
1388
== 0 && p[n] == '/') {
bin/ksh/lex.c
1390
str_val(global("PWD")) + n + 1);
bin/ksh/lex.c
1424
n = (cp[0] - '0') * 8 * 8 + (cp[1] - '0') * 8 +
bin/ksh/lex.c
1426
snprintf(strbuf, sizeof strbuf, "%c", n);
bin/ksh/misc.c
100
if (n < 0)
bin/ksh/misc.c
1008
print_columns(struct shf *shf, int n, char *(*func) (void *, int, char *, int),
bin/ksh/misc.c
102
ns = alloc(n + 1, ap);
bin/ksh/misc.c
1025
rows = (n + cols - 1) / cols;
bin/ksh/misc.c
1026
if (prefcol && n && cols > rows) {
bin/ksh/misc.c
1031
if (rows > n)
bin/ksh/misc.c
1032
rows = n;
bin/ksh/misc.c
104
return strncat(ns, s, n);
bin/ksh/misc.c
1044
if (i < n) {
bin/ksh/misc.c
176
option(const char *n)
bin/ksh/misc.c
181
if (sh_options[ele].name && strcmp(sh_options[ele].name, n) == 0)
bin/ksh/misc.c
217
unsigned int n;
bin/ksh/misc.c
223
for (ele = n = oi.opt_width = 0; ele < NELEM(sh_options); ele++) {
bin/ksh/misc.c
226
oi.opts[n].name = sh_options[ele].name;
bin/ksh/misc.c
227
oi.opts[n++].flag = ele;
bin/ksh/misc.c
232
print_columns(shl_stdout, n, options_fmt_entry, &oi,
bin/ksh/misc.c
461
long n;
bin/ksh/misc.c
463
n = strtol(as, &p, 10);
bin/ksh/misc.c
465
if (!*as || *p || INT_MIN >= n || n >= INT_MAX)
bin/ksh/misc.c
468
*ai = (int)n;
bin/ksh/misc.c
63
u64ton(uint64_t n, int base)
bin/ksh/misc.c
71
*--p = "0123456789ABCDEF"[n%base];
bin/ksh/misc.c
72
n /= base;
bin/ksh/misc.c
73
} while (n != 0);
bin/ksh/misc.c
825
size_t n, /* elements */
bin/ksh/misc.c
828
qsort(base, n, sizeof(char *), f);
bin/ksh/misc.c
96
str_nsave(const char *s, int n, Area *ap)
bin/ksh/shf.c
349
int n;
bin/ksh/shf.c
352
n = write(shf->fd, buf, ntowrite);
bin/ksh/shf.c
353
if (n == -1) {
bin/ksh/shf.c
369
buf += n;
bin/ksh/shf.c
370
ntowrite -= n;
bin/ksh/shf.c
576
int n;
bin/ksh/shf.c
584
while ((n = write(shf->fd, &cc, 1)) != 1)
bin/ksh/shf.c
585
if (n == -1) {
bin/ksh/shf.c
621
int n;
bin/ksh/shf.c
651
n = write(shf->fd, buf, ncopy);
bin/ksh/shf.c
652
if (n == -1) {
bin/ksh/shf.c
663
buf += n;
bin/ksh/shf.c
664
ncopy -= n;
bin/ksh/shf.c
681
int n;
bin/ksh/shf.c
684
n = shf_vfprintf(shf, fmt, args);
bin/ksh/shf.c
687
return n;
bin/ksh/shf.c
695
int n;
bin/ksh/shf.c
703
n = shf_vfprintf(&shf, fmt, args);
bin/ksh/shf.c
706
return n;
bin/ksh/table.c
111
ktenter(struct table *tp, const char *n, unsigned int h)
bin/ksh/table.c
121
if (*p->name == *n && strcmp(p->name, n) == 0)
bin/ksh/table.c
136
len = strlen(n) + 1;
bin/ksh/table.c
144
memcpy(p->name, n, len);
bin/ksh/table.c
212
char *n;
bin/ksh/table.c
225
h = hash(n = te->name);
bin/ksh/table.c
231
if (*p->name == *n && strcmp(p->name, n) == 0 &&
bin/ksh/table.c
237
shellf(" %4d %s\n", ncmp, n);
bin/ksh/table.c
33
hash(const char *n)
bin/ksh/table.c
37
while (*n != '\0')
bin/ksh/table.c
38
h = 33*h + (unsigned char)(*n++);
bin/ksh/table.c
88
ktsearch(struct table *tp, const char *n, unsigned int h)
bin/ksh/table.c
97
if (*p->name == *n && strcmp(p->name, n) == 0 &&
bin/ksh/trap.c
89
int n;
bin/ksh/trap.c
91
if (getn(name, &n) && 0 <= n && n < NSIG)
bin/ksh/trap.c
92
return &sigtraps[n];
bin/ksh/tree.c
347
snptreef(char *s, int n, const char *fmt, ...)
bin/ksh/tree.c
352
shf_sopen(s, n, SHF_WR | (s ? 0 : SHF_DYNAMIC), &shf);
bin/ksh/tree.c
368
int64_t n;
bin/ksh/tree.c
377
n = va_arg(va, int);
bin/ksh/tree.c
378
neg = n < 0;
bin/ksh/tree.c
379
p = u64ton(neg ? -n : n, 10);
bin/ksh/var.c
138
array_index_calc(const char *n, bool *arrayp, int *valp)
bin/ksh/var.c
144
p = skip_varname(n, false);
bin/ksh/var.c
145
if (p != n && *p == '[' && (len = array_ref_len(p))) {
bin/ksh/var.c
154
n = str_nsave(n, p - n, ATEMP);
bin/ksh/var.c
158
n, rval);
bin/ksh/var.c
162
return n;
bin/ksh/var.c
169
global(const char *n)
bin/ksh/var.c
180
n = array_index_calc(n, &array, &val);
bin/ksh/var.c
181
h = hash(n);
bin/ksh/var.c
182
c = (unsigned char)n[0];
bin/ksh/var.c
193
num = strtol(n, NULL, 10);
bin/ksh/var.c
201
if (n[1] != '\0')
bin/ksh/var.c
229
vp = ktsearch(&l->vars, n, h);
bin/ksh/var.c
239
vp = ktenter(&l->vars, n, h);
bin/ksh/var.c
243
if (special(n))
bin/ksh/var.c
252
local(const char *n, bool copy)
bin/ksh/var.c
261
n = array_index_calc(n, &array, &val);
bin/ksh/var.c
262
h = hash(n);
bin/ksh/var.c
263
if (!letter(*n)) {
bin/ksh/var.c
270
vp = ktenter(&l->vars, n, h);
bin/ksh/var.c
275
while ((ll = ll->next) && !(vq = ktsearch(&ll->vars, n, h)))
bin/ksh/var.c
289
if (special(n))
bin/ksh/var.c
313
uint64_t n;
bin/ksh/var.c
318
n = (uint64_t) vp->val.i;
bin/ksh/var.c
320
n = (vp->val.i < 0) ? -vp->val.i : vp->val.i;
bin/ksh/var.c
327
*--s = digits[n % base];
bin/ksh/var.c
328
n /= base;
bin/ksh/var.c
329
} while (n != 0);
bin/ksh/var.c
405
setint(struct tbl *vq, int64_t n)
bin/ksh/var.c
412
vp->val.i = n;
bin/ksh/var.c
416
vq->val.i = n;
bin/ksh/vi.c
1677
grabhist(int save, int n)
bin/ksh/vi.c
1681
if (n < 0 || n > hlast)
bin/ksh/vi.c
1683
if (n == hlast) {
bin/ksh/vi.c
1685
ohnum = n;
bin/ksh/vi.c
1688
(void) histnum(n);
bin/ksh/vi.c
1699
ohnum = n;
bin/ksh/vi.c
416
int n = srchlen;
bin/ksh/vi.c
418
new_es.cursor = n;
bin/ksh/vi.c
423
n = backword(1);
bin/ksh/vi.c
426
for (i = srchlen; --i >= n; )
bin/ksh/vi.c
428
srchlen = n;
bin/ln/ln.c
121
int exists, n;
bin/ln/ln.c
144
n = snprintf(path, sizeof(path), "%s/%s", source, p);
bin/ln/ln.c
145
if (n < 0 || n >= sizeof(path)) {
bin/pax/options.c
898
size_t n = nincfiles + 3;
bin/pax/options.c
901
p = reallocarray(incfiles, n,
bin/pax/options.c
909
incfiles_max = n;
bin/pax/tar.c
990
int n;
bin/pax/tar.c
992
n = snprintf(frac, sizeof(frac), ".%09ld",
bin/pax/tar.c
994
if (n <= 0)
bin/pax/tar.c
998
for (n--; n > 1 && frac[n] == '0'; n--)
bin/pax/tar.c
999
frac[n] = '\0';
bin/ps/print.c
233
int n = MINIMUM(v->width, LOGIN_NAME_MAX);
bin/ps/print.c
234
mbswprint(kp->p_login, n, ve->next != NULL);
bin/ps/print.c
236
while (n++ < v->width)
bin/ps/print.c
789
#define CHK_INF127(n) (((n) > 127) && (v->flag & INF127) ? 127 : (n))
bin/ps/ps.c
527
int dst, lvl, maxlvl, n, ndst, nsrc, siblings, src;
bin/ps/ps.c
562
for (n = src; n < src + nsrc; n++) {
bin/ps/ps.c
563
ki[n].level += ki[dst].level + 1;
bin/ps/ps.c
564
if (maxlvl < ki[n].level)
bin/ps/ps.c
565
maxlvl = ki[n].level;
bin/ps/ps.c
609
for (n = 0; n < lvl - 2; n++) {
bin/ps/ps.c
610
ki[src].prefix[n * 2] =
bin/ps/ps.c
611
path[n / 8] & 1 << (n % 8) ? '|' : ' ';
bin/ps/ps.c
612
ki[src].prefix[n * 2 + 1] = ' ';
bin/ps/ps.c
615
if (n == lvl - 2) {
bin/ps/ps.c
625
path[n / 8] |= 1 << (n % 8);
bin/ps/ps.c
627
path[n / 8] &= ~(1 << (n % 8));
bin/ps/ps.c
628
ki[src].prefix[n * 2] = siblings ? '|' : '`';
bin/ps/ps.c
629
ki[src].prefix[n * 2 + 1] = '-';
bin/ps/ps.c
630
n++;
bin/ps/ps.c
632
strlcpy(ki[src].prefix + n * 2, "- ", (lvl - n) * 2 + 1);
bin/stty/print.c
87
#define put(n, f, d) \
bin/stty/print.c
89
bput(n, on(f));
bin/test/test.c
144
static int oexpr(enum token n);
bin/test/test.c
145
static int aexpr(enum token n);
bin/test/test.c
146
static int nexpr(enum token n);
bin/test/test.c
148
static int primary(enum token n);
bin/test/test.c
223
oexpr(enum token n)
bin/test/test.c
227
res = aexpr(n);
bin/test/test.c
235
aexpr(enum token n)
bin/test/test.c
239
res = nexpr(n);
bin/test/test.c
247
nexpr(enum token n)
bin/test/test.c
249
if (n == UNOT)
bin/test/test.c
251
return primary(n);
bin/test/test.c
255
primary(enum token n)
bin/test/test.c
259
if (n == EOI)
bin/test/test.c
261
if (n == LPAREN) {
bin/test/test.c
281
switch (n) {
bin/test/test.c
289
return filstat(*t_wp, n);
distrib/special/libstubs/mbrtowc_sb.c
37
mbrtowc(wchar_t *pwc, const char *s, size_t n, mbstate_t *ps)
distrib/special/libstubs/mbrtowc_sb.c
46
if (n == 0)
distrib/special/libstubs/mbrtowc_sb.c
54
mbtowc(wchar_t *pwc, const char *s, size_t n)
distrib/special/libstubs/mbrtowc_sb.c
60
return mbrtowc(pwc, s, n, NULL);
distrib/special/more/curses.h
145
#define addbytes(s, n) __waddbytes(stdscr, s, n, 0)
distrib/special/more/curses.h
147
#define addnstr(s, n) waddnstr(stdscr, s, n)
distrib/special/more/curses.h
164
#define waddbytes(w, s, n) __waddbytes(w, s, n, 0)
distrib/special/more/curses.h
168
#define mvaddbytes(y, x, s, n) mvwaddbytes(stdscr, y, x, s, n)
distrib/special/more/curses.h
170
#define mvaddnstr(y, x, s, n) mvwaddnstr(stdscr, y, x, s, n)
distrib/special/more/curses.h
177
#define mvwaddbytes(w, y, x, s, n) \
distrib/special/more/curses.h
178
(wmove(w, y, x) == ERR ? ERR : __waddbytes(w, s, n, 0))
distrib/special/more/curses.h
181
#define mvwaddnstr(w, y, x, s, n) \
distrib/special/more/curses.h
182
(wmove(w, y, x) == ERR ? ERR : waddnstr(w, s, n))
distrib/special/more/more.c
1171
search(char *buf, FILE *file, int n)
distrib/special/more/more.c
1206
if (--n == 0) {
distrib/special/more/more.c
1261
skiplns(int n, FILE *f)
distrib/special/more/more.c
1265
while (n > 0) {
distrib/special/more/more.c
1270
n--;
distrib/special/more/more.c
797
prbuf(char *s, int n)
distrib/special/more/more.c
801
#define wouldul(s,n) ((n) >= 2 && (((s)[0] == '_' && (s)[1] == '\b') || ((s)[1] == '\b' && (s)[2] == '_')))
distrib/special/more/more.c
803
while (--n >= 0) {
distrib/special/more/more.c
808
wouldul(s + 1, n - 1)) {
distrib/special/more/more.c
812
if ((state = wouldul(s, n))) {
distrib/special/more/more.c
814
n -= 2;
distrib/special/more/more.c
820
wouldul(s, n - 1))
distrib/special/sysctl/sysctl.c
77
int n;
distrib/special/sysctl/sysctl.c
78
size_t len = sizeof(n);
distrib/special/sysctl/sysctl.c
80
if (sysctl(v->mib, v->nmib, &n, &len, NULL, 0) != -1) {
distrib/special/sysctl/sysctl.c
83
printf("%d\n", n);
games/adventure/init.c
120
snake = vocab(DECR(s,n,a,k,e), 1, 0);
games/adventure/init.c
127
knife = vocab(DECR(k,n,i,f,e), 1, 0);
games/adventure/init.c
132
plant = vocab(DECR(p,l,a,n,t), 1, 0);
games/adventure/init.c
142
vend = vocab(DECR(v,e,n,d,i), 1, 0);
games/adventure/init.c
146
coins = vocab(DECR(c,o,i,n,s), 1, 0);
games/adventure/init.c
155
chain = vocab(DECR(c,h,a,i,n), 1, 0);
games/adventure/init.c
160
null = vocab(DECR(n,u,l,l,\0),0, 0);
games/adventure/init.c
161
entrnc= vocab(DECR(e,n,t,r,a), 0, 0);
games/adventure/init.c
163
enter = vocab(DECR(e,n,t,e,r), 0, 0);
games/adventure/init.c
169
find = vocab(DECR(f,i,n,d,\0),2, 0);
games/adventure/init.c
170
invent= vocab(DECR(i,n,v,e,n), 2, 0);
games/adventure/init.c
205
trapdel(int n) /* come here if he hits a del */
games/adventure/io.c
340
int len, m, n, entries;
games/adventure/io.c
366
n = atoi(buf); /* newloc mod 1000 = newloc */
games/adventure/io.c
368
n = atoi(buf + len - 3);
games/adventure/io.c
382
t->tloc = n; /* table entry mod 1000 */
games/adventure/subr.c
102
bitset(int l, int n)
games/adventure/subr.c
104
if (cond[l] & setbit[n])
games/adventure/subr.c
126
pct(int n)
games/adventure/subr.c
128
if (ran(100) < n)
games/adventure/subr.c
474
bug(int n)
games/adventure/subr.c
478
"Please use sendbug to report that bug %d happened in adventure.\n", n);
games/adventure/subr.c
479
exit(n);
games/atc/update.c
386
findplane(int n)
games/atc/update.c
391
if (pp->plane_no == n)
games/atc/update.c
394
if (pp->plane_no == n)
games/backgammon/backgammon/extra.c
101
int n; /* accumulated judgment */
games/backgammon/backgammon/extra.c
113
n = eval() * cturn;
games/backgammon/backgammon/extra.c
118
fprintf(ftrace, "\n\tpip = %d, ", n);
games/backgammon/backgammon/extra.c
128
n +=((OFFC - OFFO) * 7) / 2;
games/backgammon/backgammon/extra.c
131
n -= OFFO * 7 / 2;
games/backgammon/backgammon/extra.c
134
n += OFFC * 7 / 2;
games/backgammon/backgammon/extra.c
137
n -= 7;
games/backgammon/backgammon/extra.c
139
n -= 7;
games/backgammon/backgammon/extra.c
141
n -= 7;
games/backgammon/backgammon/extra.c
143
n += 7;
games/backgammon/backgammon/extra.c
145
n += 7;
games/backgammon/backgammon/extra.c
147
n += 7;
games/backgammon/backgammon/extra.c
148
n += ((OFFC - OFFO) * 7) / 2;
games/backgammon/backgammon/extra.c
152
fprintf(ftrace, "off = %d, ", n);
games/backgammon/backgammon/extra.c
156
n -= freemen(bar);
games/backgammon/backgammon/extra.c
157
n += freemen(home);
games/backgammon/backgammon/extra.c
158
n += trapped(home, -cturn);
games/backgammon/backgammon/extra.c
159
n -= trapped(bar, cturn);
games/backgammon/backgammon/extra.c
162
fprintf(ftrace, "free = %d\n", n);
games/backgammon/backgammon/extra.c
168
if (n > (int)(10 + rnum(7)))
games/backgammon/backgammon/extra.c
192
trapped(int n, int inc)
games/backgammon/backgammon/extra.c
198
l = n + 7 * inc;
games/backgammon/backgammon/extra.c
199
for (i = n + inc; i != l; i += inc) {
games/backgammon/backgammon/pubeval.c
107
int i, j, jm1, n;
games/backgammon/backgammon/pubeval.c
125
n = pos[25 - j];
games/backgammon/backgammon/pubeval.c
126
if (n != 0) {
games/backgammon/backgammon/pubeval.c
127
if (n == -1)
games/backgammon/backgammon/pubeval.c
129
else if (n == 1)
games/backgammon/backgammon/pubeval.c
131
else if (n == 3)
games/backgammon/backgammon/pubeval.c
133
if (n >= 4)
games/backgammon/backgammon/pubeval.c
134
x[5 * jm1 + 4] = (float) (n - 3) / 2.0;
games/backgammon/backgammon/pubeval.c
135
if (n >= 2)
games/backgammon/common_source/fancy.c
124
int n; /* number of men on position */
games/backgammon/common_source/fancy.c
129
n = abs(b); /* initialize n and pc */
games/backgammon/common_source/fancy.c
132
if (n < 6 && cpos < 54) /* position cursor at start */
games/backgammon/common_source/fancy.c
140
if (n > j + k)
games/backgammon/common_source/fancy.c
144
if (n < 6) { /* stop if none left */
games/backgammon/common_source/fancy.c
145
if (j + 1 == n)
games/backgammon/common_source/fancy.c
149
if (n < 11) { /* two columns */
games/backgammon/common_source/fancy.c
151
if (j + 5 >= n)
games/backgammon/common_source/fancy.c
156
if (j + 6 >= n)
games/backgammon/common_source/fancy.c
162
if (j + 10 >= n)
games/backgammon/common_source/fancy.c
226
int o, n, nv;
games/backgammon/common_source/fancy.c
236
n = (nv - 1) / 5;
games/backgammon/common_source/fancy.c
237
if (o == n) {
games/backgammon/common_source/fancy.c
245
fixcol(r + inc * (nv - n * 5), nc, abs(ov - nv), ' ', inc);
games/backgammon/common_source/fancy.c
251
if (o + n == 1) {
games/backgammon/common_source/fancy.c
252
if (n) {
games/backgammon/common_source/fancy.c
263
if (n == 2) {
games/backgammon/common_source/fancy.c
274
if (n > o) {
games/backgammon/common_source/fancy.c
275
fixcol(r+inc*(ov%5), c+o, abs(5*n-ov), col, inc);
games/backgammon/common_source/fancy.c
276
if (nv != 5 * n)
games/backgammon/common_source/fancy.c
277
fixcol(r, c+n, abs(5*n-nv), col, inc);
games/backgammon/common_source/fancy.c
279
fixcol(r+inc*(nv%5), c+n, abs(5*n-nv), ' ', inc);
games/backgammon/common_source/one.c
37
int n, d;
games/backgammon/common_source/one.c
41
n = abs(g[i] - p[i]);
games/backgammon/common_source/one.c
48
if (n == max ? D1 < n : D1 != n)
games/backgammon/common_source/one.c
51
if (n == max ? D0 < n && D1 < n : D0 != n && D1 != n)
games/backgammon/common_source/one.c
53
if (n == max ? D0 < n : D0 != n)
games/backgammon/common_source/save.c
49
save(int n)
games/backgammon/common_source/save.c
56
if (n) {
games/backgammon/common_source/table.c
101
n = rsetbrd();
games/backgammon/common_source/table.c
102
if (n == 0) {
games/backgammon/common_source/table.c
103
n = -1;
games/backgammon/common_source/table.c
106
if ((ist = n) > 0)
games/backgammon/common_source/table.c
124
n = dotable(c, ist);
games/backgammon/common_source/table.c
125
if (n >= 0) {
games/backgammon/common_source/table.c
127
if (n > 2)
games/backgammon/common_source/table.c
130
ist = n;
games/backgammon/common_source/table.c
131
if (n)
games/backgammon/common_source/table.c
136
if (n == -1 && mvl >= mvlim)
games/backgammon/common_source/table.c
138
if (n == -1 && mvl < mvlim-1)
games/backgammon/common_source/table.c
140
if (n == -6) {
games/backgammon/common_source/table.c
146
ist = n = rsetbrd();
games/backgammon/common_source/table.c
149
if (n != -5)
games/backgammon/common_source/table.c
150
return(n);
games/backgammon/common_source/table.c
238
int i, j, n;
games/backgammon/common_source/table.c
240
n = 0;
games/backgammon/common_source/table.c
245
if ((n = dotable(cin[j], n)) < 0)
games/backgammon/common_source/table.c
246
return (n);
games/backgammon/common_source/table.c
247
return(n);
games/backgammon/common_source/table.c
76
int j, n;
games/battlestar/command1.c
201
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/command1.c
202
if (injuries[n] == 1) {
games/battlestar/command1.c
203
injuries[n] = 2;
games/battlestar/command1.c
95
int n;
games/battlestar/command2.c
178
int n;
games/battlestar/command2.c
182
for (n = 0; n < NUMOFOBJECTS &&
games/battlestar/command2.c
183
!((n == SWORD || n == KNIFE || n == TWO_HANDED || n == MACE ||
games/battlestar/command2.c
184
n == CLEAVER || n == BROAD || n == CHAIN || n == SHOVEL ||
games/battlestar/command2.c
185
n == HALBERD) && TestBit(inven, n)); n++)
games/battlestar/command2.c
187
if (n == NUMOFOBJECTS) {
games/battlestar/command2.c
214
printf("Your %s should do the trick.\n", objsht[n]);
games/battlestar/command3.c
169
int n;
games/battlestar/command3.c
178
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/command3.c
179
injuries[n] = 0;
games/battlestar/command3.c
64
int n;
games/battlestar/command3.c
91
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/command3.c
92
if (TestBit(inven, n)) {
games/battlestar/command3.c
93
ClearBit(inven, n);
games/battlestar/command3.c
94
SetBit(location[position].objects, n);
games/battlestar/command4.c
185
unsigned int n;
games/battlestar/command4.c
226
for (n = 0; n < NUMOFWORDS; n++)
games/battlestar/command4.c
227
location[deposit].objects[n] = 0;
games/battlestar/command5.c
114
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/command5.c
115
injuries[n] = 0;
games/battlestar/command5.c
160
int n;
games/battlestar/command5.c
166
for (n = 0; n < ourtime - oldtime; n++)
games/battlestar/command5.c
183
n = rnd(NUMOFOBJECTS);
games/battlestar/command5.c
184
while (!TestBit(inven, n))
games/battlestar/command5.c
185
n = rnd(NUMOFOBJECTS);
games/battlestar/command5.c
186
ClearBit(inven, n);
games/battlestar/command5.c
187
if (n != AMULET && n != MEDALION && n != TALISMAN)
games/battlestar/command5.c
188
SetBit(location[position].objects, n);
games/battlestar/command5.c
189
carrying -= objwt[n];
games/battlestar/command5.c
190
encumber -= objcumber[n];
games/battlestar/command5.c
93
int n;
games/battlestar/cypher.c
160
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
161
if (TestBit(location[position].objects, n) && objsht[n]) {
games/battlestar/cypher.c
163
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
171
switch (n) {
games/battlestar/cypher.c
200
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
201
if (TestBit(inven, n)) {
games/battlestar/cypher.c
203
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
221
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
222
if (TestBit(inven, n) ||
games/battlestar/cypher.c
223
(TestBit(location[position].objects, n) && objsht[n])) {
games/battlestar/cypher.c
225
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
262
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
263
if (TestBit(inven, n))
games/battlestar/cypher.c
264
printf("\t%s\n", objsht[n]);
games/battlestar/cypher.c
282
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
283
if (TestBit(wear, n))
games/battlestar/cypher.c
284
printf("\t%s\n", objsht[n]);
games/battlestar/cypher.c
289
for (n = 0; n < NUMOFINJURIES; n++)
games/battlestar/cypher.c
290
if (injuries[n])
games/battlestar/cypher.c
291
printf("\t%s\n", ouch[n]);
games/battlestar/cypher.c
493
int things, n;
games/battlestar/cypher.c
497
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/cypher.c
498
if (TestBit(testarray, n) &&
games/battlestar/cypher.c
499
(objsht[n] || (objflg & objflags[n]))) {
games/battlestar/cypher.c
501
wordvalue[wordnumber + 1] = n;
games/battlestar/cypher.c
503
if (objsht[n])
games/battlestar/cypher.c
56
int n;
games/battlestar/cypher.c
69
n = strtonum(buffer, INT_MIN, INT_MAX, &errstr);
games/battlestar/cypher.c
74
*value = n;
games/battlestar/cypher.c
84
int n;
games/battlestar/extern.h
49
#define A_OR_AN(n) (objflags[(n)] & OBJ_AN ? "an " : "a ")
games/battlestar/extern.h
50
#define IS_PLURAL(n) (objflags[(n)] & OBJ_PLURAL)
games/battlestar/extern.h
51
#define A_OR_AN_OR_THE(n) (IS_PLURAL((n)) ? "the " : A_OR_AN((n)))
games/battlestar/extern.h
52
#define A_OR_AN_OR_BLANK(n) (IS_PLURAL((n)) ? "" : A_OR_AN((n)))
games/battlestar/extern.h
53
#define IS_OR_ARE(n) (IS_PLURAL((n)) ? "are " : "is ")
games/battlestar/fly.c
184
int r, c, n;
games/battlestar/fly.c
189
for (n = 0; n < i; n++) {
games/battlestar/fly.c
201
int n;
games/battlestar/fly.c
205
for (n = MIDR - 4; n < MIDR - 1; n++) {
games/battlestar/fly.c
206
mvaddch(n, MIDC, '|');
games/battlestar/fly.c
207
mvaddch(n + 6, MIDC, '|');
games/battlestar/fly.c
214
int n;
games/battlestar/fly.c
218
for (n = MIDR - 4; n < MIDR - 1; n++) {
games/battlestar/fly.c
219
mvaddch(n, MIDC, ' ');
games/battlestar/fly.c
220
mvaddch(n + 6, MIDC, ' ');
games/battlestar/fly.c
227
int n;
games/battlestar/fly.c
232
for(n = LINES - 1 - 2; n >= MIDR + 1; n--) {
games/battlestar/fly.c
233
mvaddch(n, MIDC + MIDR - n, '/');
games/battlestar/fly.c
234
mvaddch(n, MIDC - MIDR + n, '\\');
games/battlestar/fly.c
238
for (n = LINES - 1 - 2; n >= MIDR + 1; n--) {
games/battlestar/fly.c
239
mvaddch(n, MIDC + MIDR - n, ' ');
games/battlestar/fly.c
240
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
102
for (n = 0; n <= wordcount; n++) {
games/battlestar/parse.c
103
if ((wp = lookup(words[n])) == NULL) {
games/battlestar/parse.c
104
wordvalue[n] = -1;
games/battlestar/parse.c
105
wordtype[n] = -1;
games/battlestar/parse.c
107
wordvalue[n] = wp->value;
games/battlestar/parse.c
108
wordtype[n] = wp->article;
games/battlestar/parse.c
114
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
115
if (wordtype[n] == ADJS) {
games/battlestar/parse.c
117
for (i = n + 1; i <= wordcount; i++) {
games/battlestar/parse.c
123
n--;
games/battlestar/parse.c
126
for (n = 0; n < wordcount; n++)
games/battlestar/parse.c
127
if (wordvalue[n] == AND && words[n][0] == ','
games/battlestar/parse.c
128
&& wordtype[n + 1] == VERB) {
games/battlestar/parse.c
129
wordvalue[n] = -1;
games/battlestar/parse.c
130
wordtype[n] = -1;
games/battlestar/parse.c
135
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
136
if (wordvalue[n - 1] == AND && wordvalue[n] == AND) {
games/battlestar/parse.c
138
for (i = n + 1; i <= wordcount; i++) {
games/battlestar/parse.c
154
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
155
if ((wordtype[n - 1] == NOUNS || wordtype[n - 1] == OBJECT) &&
games/battlestar/parse.c
156
wordvalue[n] == AND && wordvalue[n + 1] == EVERYTHING) {
games/battlestar/parse.c
158
wordvalue[n + 1] = wordvalue[n - 1];
games/battlestar/parse.c
159
wordvalue[n - 1] = EVERYTHING;
games/battlestar/parse.c
160
wordtype[n + 1] = wordtype[n - 1];
games/battlestar/parse.c
161
wordtype[n - 1] = OBJECT;
games/battlestar/parse.c
162
strlcpy(tmpword, words[n - 1], WORDLEN);
games/battlestar/parse.c
163
strlcpy(words[n - 1], words[n + 1], WORDLEN);
games/battlestar/parse.c
164
strlcpy(words[n + 1], tmpword, WORDLEN);
games/battlestar/parse.c
168
for (n = 1; n < wordcount; n++)
games/battlestar/parse.c
169
if (wordvalue[n - 1] == EVERYTHING &&
games/battlestar/parse.c
170
wordvalue[n] == AND && wordvalue[n + 1] == EVERYTHING) {
games/battlestar/parse.c
172
for (i = n + 1; i < wordcount; i++) {
games/battlestar/parse.c
98
int n;
games/battlestar/room.c
65
int n;
games/battlestar/room.c
68
for (n = 0; n < NUMOFOBJECTS; n++)
games/battlestar/room.c
69
if (TestBit(p, n) && objdes[n])
games/battlestar/room.c
70
puts(objdes[n]);
games/battlestar/save.c
109
for (n = 1; n <= NUMOFROOMS; n++) {
games/battlestar/save.c
110
fwrite(location[n].link, sizeof location[n].link, 1, fp);
games/battlestar/save.c
111
fwrite(location[n].objects, sizeof location[n].objects, 1, fp);
games/battlestar/save.c
43
int n;
games/battlestar/save.c
56
for (n = 1; n <= NUMOFROOMS; n++) {
games/battlestar/save.c
57
fread(location[n].link, sizeof location[n].link, 1, fp);
games/battlestar/save.c
58
fread(location[n].objects, sizeof location[n].objects, 1, fp);
games/battlestar/save.c
94
int n;
games/boggle/boggle/mach.c
361
int n;
games/boggle/boggle/mach.c
372
if ((n = strlen(w)) > maxw)
games/boggle/boggle/mach.c
373
maxw = n;
games/boggle/boggle/mach.c
395
showword(int n)
games/boggle/boggle/mach.c
399
row = LIST_LINE + n % (lastline - LIST_LINE + 1);
games/boggle/boggle/mach.c
400
col = colstarts[n / (lastline - LIST_LINE + 1)];
games/boggle/boggle/mach.c
403
printw("%s", pword[n]);
games/boggle/boggle/mach.c
409
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
103
if (argc == 2 && nwords % n)
games/boggle/mkdict/mkdict.c
59
int ch, common, n, nwords;
games/boggle/mkdict/mkdict.c
70
n = strtonum(argv[1], 1, INT_MAX, &errstr);
games/bs/bs.c
1038
int navail, x, y, d, n, hit = S_MISS;
games/bs/bs.c
1074
for (d = 0, n = rnd(navail) + 1; n; n--,d++)
games/bs/bs.c
315
prompt(int n, const char *f, ...)
games/bs/bs.c
319
(void) move(PROMPTLINE + n, 0);
games/bs/bs.c
360
rnd(int n)
games/bs/bs.c
362
return(arc4random_uniform(n));
games/cribbage/cards.c
102
for (i = j = 0; i < n; i++)
games/cribbage/cards.c
105
if (j < n)
games/cribbage/cards.c
114
sorthand(CARD h[], int n)
games/cribbage/cards.c
119
for (endp = &h[n]; h < endp - 1; h++)
games/cribbage/cards.c
84
isone(CARD a, CARD b[], int n)
games/cribbage/cards.c
88
for (i = 0; i < n; i++)
games/cribbage/cards.c
98
cremove(CARD a, CARD d[], int n)
games/cribbage/io.c
137
prhand(CARD h[], int n, WINDOW *win, bool blank)
games/cribbage/io.c
142
for (i = 0; i < n; i++)
games/cribbage/io.c
153
infrom(CARD hand[], int n, char *prompt)
games/cribbage/io.c
158
if (n < 1) {
games/cribbage/io.c
160
printf("\nINFROM: %d = n < 1!!\n", n);
games/cribbage/io.c
166
if (!isone(crd, hand, n))
games/cribbage/io.c
169
for (i = 0; i < n; i++)
games/cribbage/io.c
173
if (i >= n) {
games/cribbage/io.c
182
for (i = 0; i < n; i++)
games/cribbage/io.c
185
if (i >= n)
games/cribbage/io.c
188
for (j = i + 1; j < n; j++)
games/cribbage/io.c
191
if (j < n)
games/cribbage/score.c
111
for (i = 0; i < n; i++) { /* check for flush */
games/cribbage/score.c
122
if (flag && n >= CINHAND) {
games/cribbage/score.c
140
h[n] = starter;
games/cribbage/score.c
141
sorthand(h, n + 1); /* sort by rank */
games/cribbage/score.c
142
i = 2 * fifteens(h, n + 1);
games/cribbage/score.c
152
i = pairuns(h, n + 1);
games/cribbage/score.c
171
fifteens(CARD hand[], int n)
games/cribbage/score.c
185
for (endp = &hand[n]; hand < endp; hand++) {
games/cribbage/score.c
212
pairuns(CARD h[], int n)
games/cribbage/score.c
226
for (i = 1; i < n; i++) {
games/cribbage/score.c
244
if (i == (n - 1) && run) {
games/cribbage/score.c
279
pegscore(CARD crd, CARD tbl[], int n, int sum)
games/cribbage/score.c
292
if (!n)
games/cribbage/score.c
295
while ((j <= n) && (crd.rank == tbl[n - j].rank))
games/cribbage/score.c
299
if (n < 2)
games/cribbage/score.c
306
for (i = n - 1; i >= 0; --i) {
games/cribbage/score.c
99
scorehand(CARD hand[], CARD starter, int n, bool crb, bool do_explain)
games/cribbage/support.c
109
errx(1, "cchose internal error %d %d", j, n);
games/cribbage/support.c
285
anymove(CARD hand[], int n, int sum)
games/cribbage/support.c
289
if (n < 1)
games/cribbage/support.c
292
for (i = 1; i < n; i++) {
games/cribbage/support.c
304
anysumto(CARD hand[], int n, int s, int t)
games/cribbage/support.c
308
for (i = 0; i < n; i++) {
games/cribbage/support.c
319
numofval(CARD h[], int n, int v)
games/cribbage/support.c
324
for (i = 0; i < n; i++) {
games/cribbage/support.c
335
makeknown(CARD h[], int n)
games/cribbage/support.c
339
for (i = 0; i < n; i++)
games/cribbage/support.c
49
cchose(CARD h[], int n, int s)
games/cribbage/support.c
53
if (n <= 1)
games/cribbage/support.c
56
if ((j = anysumto(h, n, s, 4)) >= 0)
games/cribbage/support.c
58
if ((j = anysumto(h, n, s, 3)) >= 0 && s == 0)
games/cribbage/support.c
64
if ((j = anysumto(h, n, s, 21 - i)) >= 0) {
games/cribbage/support.c
65
if ((l = numofval(h, n, i)) > 0) {
games/cribbage/support.c
75
if ((j = anysumto(h, n, s, tv[i])) >= 0) {
games/cribbage/support.c
76
if ((l = numofval(h, n, 15 - tv[i])) > 0) {
games/cribbage/support.c
86
for (i = n - 1; i >= 0; --i) {
games/cribbage/support.c
97
for (i = n - 1; i >= 0; --i) {
games/factor/factor.c
288
usqrt(u_int64_t n)
games/factor/factor.c
292
if (n == 0 || n == 1)
games/factor/factor.c
293
return n;
games/factor/factor.c
297
x = n / x;
games/fish/fish.c
142
int n;
games/fish/fish.c
178
n = p - cards;
games/fish/fish.c
179
if (userhand[n]) {
games/fish/fish.c
180
userasked[n] = 1;
games/fish/fish.c
181
return(n);
games/fish/fish.c
186
(void)printf("You don't have any %s's!\n", cards[n]);
games/fish/fish.c
415
nrandom(int n)
games/fish/fish.c
417
return(arc4random_uniform(n));
games/gomoku/bdinit.c
169
int i, f, r, n, d1, d2;
games/gomoku/bdinit.c
203
n = sp2->s_frame[r] - frames;
games/gomoku/bdinit.c
204
ip[n] = vertex;
games/gomoku/bdinit.c
205
str[n] |= (f == 5) ? mask & 0xA : mask;
games/gomoku/bdinit.c
211
str[n] |= 0xA0;
games/gomoku/bdinit.c
213
str[n] |= 0xF0;
games/gomoku/bdinit.c
217
str[n] |= 0xA0;
games/gomoku/bdinit.c
219
str[n] |= 0xF0;
games/gomoku/bdinit.c
223
str[n] |= 0xC0;
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
234
str[n] |= 0xF0;
games/gomoku/main.c
344
int i, pnum, n, s1, s2, d1, d2;
games/gomoku/main.c
408
n = 0;
games/gomoku/main.c
416
n = (sp->s_frame[d1] - frames) * FAREA;
games/gomoku/main.c
426
n += sp->s_frame[d2] - frames;
games/gomoku/main.c
432
"%s%c = %x", stoc(s2), pdir[d2], overlap[n]);
games/gomoku/main.c
458
n = *str++ - '0';
games/gomoku/main.c
460
n = 0;
games/gomoku/main.c
464
if (n) {
games/gomoku/main.c
465
if (cbp->c_nframes > n)
games/gomoku/main.c
467
if (cbp->c_nframes != n)
games/gomoku/makemove.c
114
n = 0;
games/gomoku/makemove.c
117
n++;
games/gomoku/makemove.c
135
if (n == 5)
games/gomoku/makemove.c
143
cp->c.a = 4 - n;
games/gomoku/makemove.c
146
cp->c.a = 5 - n;
games/gomoku/makemove.c
149
val = weight[n];
games/gomoku/makemove.c
212
int i, f, r, r1, d, d1, n;
games/gomoku/makemove.c
244
n = 0;
games/gomoku/makemove.c
249
n++;
games/gomoku/makemove.c
253
if (n == 0) {
games/gomoku/makemove.c
257
intersect[a * FAREA + b] = n = sp - board;
games/gomoku/makemove.c
258
intersect[b * FAREA + a] = n;
games/gomoku/makemove.c
263
} else if (n == 1) {
games/gomoku/makemove.c
271
intersect[a * FAREA + b] = n = esp - board;
games/gomoku/makemove.c
272
intersect[b * FAREA + a] = n;
games/gomoku/makemove.c
59
int i, f, r, d, n;
games/gomoku/pickmove.c
1060
int i, n, mask, flg, verts, idx, fcnt;
games/gomoku/pickmove.c
1070
n = (fcbp - frames) * FAREA;
games/gomoku/pickmove.c
1071
str = &overlap[n];
games/gomoku/pickmove.c
1072
ip = &intersect[n];
games/gomoku/pickmove.c
1086
n = i + ((flg & C_OPEN_1) != 0);
games/gomoku/pickmove.c
1087
if (mask & (1 << n)) {
games/gomoku/pickmove.c
1093
if (tcbp->c_dir == fcbp->c_dir && (mask & (0x10 << n)))
games/gomoku/pickmove.c
1100
n = ip[tcbp - frames];
games/gomoku/pickmove.c
1101
if (osp != &board[n]) {
games/gomoku/pickmove.c
1113
(n == tcbp->c_vertex ||
games/gomoku/pickmove.c
1114
n == tcbp->c_vertex + 5 * dd[tcbp->c_dir]))
games/gomoku/pickmove.c
1117
(n == fcbp->c_vertex ||
games/gomoku/pickmove.c
1118
n == fcbp->c_vertex + 5 * dd[fcbp->c_dir]))
games/gomoku/pickmove.c
1121
vertices->o_intersect = n;
games/gomoku/pickmove.c
1124
vertices->o_off = (n - tcbp->c_vertex) /
games/gomoku/pickmove.c
1130
n = i + ((flg & C_OPEN_0) != 0);
games/gomoku/pickmove.c
1137
if (mask & (1 << n)) {
games/gomoku/pickmove.c
1143
if (cbp->c_dir == fcbp->c_dir && (mask & (0x10 << n)))
games/gomoku/pickmove.c
1150
n = ip[cbp - frames];
games/gomoku/pickmove.c
1151
if (osp != &board[n]) {
games/gomoku/pickmove.c
1163
(n == cbp->c_vertex ||
games/gomoku/pickmove.c
1164
n == cbp->c_vertex + 5 * dd[cbp->c_dir]))
games/gomoku/pickmove.c
1167
(n == fcbp->c_vertex ||
games/gomoku/pickmove.c
1168
n == fcbp->c_vertex + 5 * dd[fcbp->c_dir]))
games/gomoku/pickmove.c
1171
vertices->o_intersect = n;
games/gomoku/pickmove.c
1174
vertices->o_off = (n - cbp->c_vertex) /
games/gomoku/pickmove.c
1195
int n, inx;
games/gomoku/pickmove.c
1217
n = curlevel + 1;
games/gomoku/pickmove.c
1218
spp = scbpp + n;
games/gomoku/pickmove.c
1250
cpp = cbpp + n;
games/gomoku/pickmove.c
1251
spp = scbpp + n;
games/gomoku/pickmove.c
1262
snprintf(fmtbuf, sizeof fmtbuf, "sort1: n%d", n);
games/gomoku/pickmove.c
1265
for (cpp = scbpp; cpp < scbpp + n; cpp++) {
games/gomoku/pickmove.c
1276
for (cpp = cbpp; cpp < cbpp + n; cpp++) {
games/gomoku/pickmove.c
1332
int r, n, flg, cmask, omask;
games/gomoku/pickmove.c
1443
int d, n, mask;
games/gomoku/pickmove.c
1450
d = dd[n = cbp->c_dir];
games/gomoku/pickmove.c
1451
mask = ~((IFLAG | CFLAG) << n);
games/gomoku/pickmove.c
1452
n = open ? 6 : 5;
games/gomoku/pickmove.c
1453
for (; --n >= 0; sp += d)
games/gomoku/pickmove.c
1458
list_eq(struct combostr **scbpp, struct combostr **cbpp, int n)
games/gomoku/pickmove.c
1462
spp = scbpp + n;
games/gomoku/pickmove.c
1463
cpp = cbpp + n;
games/gomoku/pickmove.c
221
int i, r, d, n;
games/gomoku/pickmove.c
250
n = combolen;
games/gomoku/pickmove.c
292
n = sp - board;
games/gomoku/pickmove.c
293
BIT_SET(tmpmap, n);
games/gomoku/pickmove.c
319
while (d <= ((unsigned)(movenum + 1) >> 1) && combolen > n) {
games/gomoku/pickmove.c
323
d, combolen - n, combocnt, elistcnt);
games/gomoku/pickmove.c
327
n = combolen;
games/gomoku/pickmove.c
407
int baseB, fcnt, emask, bmask, n;
games/gomoku/pickmove.c
454
n = fcb.c.a + fcb.c.b - 1;
games/gomoku/pickmove.c
455
if (baseB < n)
games/gomoku/pickmove.c
456
n = baseB;
games/gomoku/pickmove.c
472
ncbp->c_combo.c.b = n;
games/gomoku/pickmove.c
637
int n, c;
games/gomoku/pickmove.c
691
n = ep->e_fval.c.a + ep->e_fval.c.b - 1;
games/gomoku/pickmove.c
692
if (baseB < n)
games/gomoku/pickmove.c
693
n = baseB;
games/gomoku/pickmove.c
708
ncbp->c_combo.c.b = n;
games/gomoku/pickmove.c
729
n = (vertices[0].o_intersect - ocbp->c_vertex) /
games/gomoku/pickmove.c
731
ncbp->c_emask[1] = emask & ~(1 << n);
games/grdc/grdc.c
108
n = strtonum(*argv, 1, UINT_MAX, &errstr);
games/grdc/grdc.c
147
if (n) {
games/grdc/grdc.c
149
alarm(n);
games/grdc/grdc.c
291
set(int t, int n)
games/grdc/grdc.c
295
m = 7 << n;
games/grdc/grdc.c
297
next[i] |= ((disp[t] >> (4 - i) * 3) & 07) << n;
games/grdc/grdc.c
74
unsigned int n = 0;
games/hack/config.h
180
#define Bitfield(x,n) unsigned x:n
games/hack/hack.c
817
losehp(int n, char *knam)
games/hack/hack.c
819
u.uhp -= n;
games/hack/hack.c
830
losehp_m(int n, struct monst *mtmp)
games/hack/hack.c
832
u.uhp -= n;
games/hack/hack.end.c
572
ordin(int n)
games/hack/hack.end.c
574
int d = n%10;
games/hack/hack.end.c
576
return((d==0 || d>3 || n/10==1) ? "th" : (d==1) ? "st" :
games/hack/hack.engrave.c
103
int n;
games/hack/hack.engrave.c
110
n = strlen(s);
games/hack/hack.engrave.c
112
if(!strncmp(s,t,n)) return(1);
games/hack/hack.invent.c
279
sobj_at(int n, int x, int y)
games/hack/hack.invent.c
284
if(otmp->ox == x && otmp->oy == y && otmp->otyp == n)
games/hack/hack.rip.c
128
int n = strlen(text)/2;
games/hack/hack.rip.c
129
printf(ripmid, 8+n, text, 8-n, "");
games/hack/hack.topl.c
214
int n,n0;
games/hack/hack.topl.c
240
for(n = 0; n < CO; n++) if(bp[n] == ' ')
games/hack/hack.topl.c
241
n0 = n;
games/hack/hack.topl.c
242
if(!n0) for(n = 0; n < CO-1; n++)
games/hack/hack.topl.c
243
if(!letter(bp[n])) n0 = n;
games/hack/makedefs.c
139
int n = read(fd, lp0, (line+LINSZ)-lp0);
games/hack/makedefs.c
141
if(n == -1){
games/hack/makedefs.c
145
if(n == 0) eof++;
games/hack/makedefs.c
146
lpe = lp0+n;
games/hack/rnd.c
87
d(int n, int x)
games/hack/rnd.c
89
int tmp = n;
games/hack/rnd.c
91
while(n--) tmp += RND(x);
games/hunt/huntd/makemaze.c
42
# define ODD(n) ((n) & 01)
games/hunt/huntd/shots.c
455
int n, dir = -1;
games/hunt/huntd/shots.c
518
n = rand_num(count);
games/hunt/huntd/shots.c
519
if (n >= 0 && mask & NORTH)
games/hunt/huntd/shots.c
520
dir = NORTH, n--;
games/hunt/huntd/shots.c
521
if (n >= 0 && mask & SOUTH)
games/hunt/huntd/shots.c
522
dir = SOUTH, n--;
games/hunt/huntd/shots.c
523
if (n >= 0 && mask & EAST)
games/hunt/huntd/shots.c
524
dir = EAST, n--;
games/hunt/huntd/shots.c
525
if (n >= 0 && mask & WEST)
games/hunt/huntd/shots.c
526
dir = WEST, n--;
games/monop/initdeck.c
123
for (n = 0 ; n < CC_D.num_cards ; n++) {
games/monop/initdeck.c
124
CC_D.offsets[n] = htonl(CC_D.offsets[n]);
games/monop/initdeck.c
125
fwrite(&CC_D.offsets[n], sizeof(CC_D.offsets[n]), 1, outf);
games/monop/initdeck.c
127
for (n = 0 ; n < CH_D.num_cards ; n++) {
games/monop/initdeck.c
128
CH_D.offsets[n] = htonl(CH_D.offsets[n]);
games/monop/initdeck.c
129
fwrite(&CH_D.offsets[n], sizeof(CH_D.offsets[n]), 1, outf);
games/monop/initdeck.c
70
int n;
games/robots/move_robs.c
124
sign(int n)
games/robots/move_robs.c
126
if (n < 0)
games/robots/move_robs.c
128
else if (n > 0)
games/sail/assorted.c
48
int n;
games/sail/assorted.c
81
for (n = 0; n < 3; n++)
games/sail/assorted.c
82
if (chits > crew[n]) {
games/sail/assorted.c
83
chits -= crew[n];
games/sail/assorted.c
84
crew[n] = 0;
games/sail/assorted.c
86
crew[n] -= chits;
games/sail/assorted.c
89
for (n = 0; n < 3; n++)
games/sail/assorted.c
90
if (rhits > rigg[n]){
games/sail/assorted.c
91
rhits -= rigg[n];
games/sail/assorted.c
92
rigg[n] = 0;
games/sail/assorted.c
94
rigg[n] -= rhits;
games/sail/dr_1.c
266
int n;
games/sail/dr_1.c
280
for (n = 0; n < 3; n++) {
games/sail/dr_1.c
281
if (sp->file->OBP[n].turnsent)
games/sail/dr_1.c
282
men += sp->file->OBP[n].mensent;
games/sail/dr_1.c
284
for (n = 0; n < 3; n++) {
games/sail/dr_1.c
285
if (sp->file->DBP[n].turnsent)
games/sail/dr_1.c
286
men += sp->file->DBP[n].mensent;
games/sail/dr_1.c
355
for (n = 0; n < 3 && sp->file->captured == 0; n++)
games/sail/dr_1.c
356
if (!crew[n]) {
games/sail/dr_2.c
225
int new, n;
games/sail/dr_2.c
229
if ((n = str_end(temp)) < '1' || n > '9')
games/sail/dr_2.c
230
for (n = 1; vma - n >= 0; n++) {
games/sail/dr_2.c
231
(void) snprintf(st, sizeof st, "%d", n);
games/sail/dr_2.c
238
try(command, commandl, temp, templ, ma-n, ta, af, vma-n,
games/sail/dr_2.c
242
if ((ma > 0 && ta > 0 && (n = str_end(temp)) != 'l' && n != 'r') || !strlen(temp)) {
games/sail/dr_2.c
252
if ((ma > 0 && ta > 0 && (n = str_end(temp)) != 'l' && n != 'r') || !strlen(temp)){
games/sail/dr_3.c
105
n = 0;
games/sail/dr_3.c
110
step(sp->file->movebuf[k], sp, &moved[n]);
games/sail/dr_3.c
111
n++;
games/sail/dr_3.c
116
n = 0;
games/sail/dr_3.c
138
Write(W_FOUL, sq, n, 0, 0, 0);
games/sail/dr_3.c
158
n++;
games/sail/dr_3.c
164
n = 0;
games/sail/dr_3.c
168
if (row[n] != sp->file->row)
games/sail/dr_3.c
170
if (col[n] != sp->file->col)
games/sail/dr_3.c
172
if (dir[n] != sp->file->dir)
games/sail/dr_3.c
174
if (drift[n] != sp->file->drift)
games/sail/dr_3.c
177
n++;
games/sail/dr_3.c
261
int n;
games/sail/dr_3.c
265
for (n = 0; n < NBP && bp[n].turnsent; n++)
games/sail/dr_3.c
267
if (n < NBP && sections) {
games/sail/dr_3.c
269
n, turn, to->file->index, sections);
games/sail/dr_3.c
282
int n, OBP = 0, DBP = 0, dbp = 0;
games/sail/dr_3.c
287
for (n = 0; n < NBP; n++, bp++) {
games/sail/dr_3.c
45
int n; /* r9 */
games/sail/dr_3.c
80
n = 0;
games/sail/dr_3.c
89
row[n] = sp->file->row;
games/sail/dr_3.c
90
col[n] = sp->file->col;
games/sail/dr_3.c
91
dir[n] = sp->file->dir;
games/sail/dr_3.c
92
drift[n] = sp->file->drift;
games/sail/dr_3.c
93
moved[n] = 0;
games/sail/dr_3.c
94
n++;
games/sail/dr_5.c
39
int n;
games/sail/dr_5.c
42
for (n = 0; n < 3; n++) {
games/sail/dr_5.c
43
if (totalfrom > crewfrom[n]) {
games/sail/dr_5.c
44
totalfrom -= crewfrom[n];
games/sail/dr_5.c
45
crewfrom[n] = 0;
games/sail/dr_5.c
47
crewfrom[n] -= totalfrom;
games/sail/dr_5.c
65
int n;
games/sail/dr_5.c
75
for (n=0; n < NBP; n++, bp++) {
games/sail/dr_main.c
45
int n;
games/sail/dr_main.c
59
for (n = 0; n < NNATION; n++)
games/sail/dr_main.c
60
nat[n] = 0;
games/sail/lo_main.c
57
int n = 0, people;
games/sail/lo_main.c
85
title[n++], sbuf, ship->shipname, log.l_netpoints,
games/sail/misc.c
194
int n;
games/sail/misc.c
211
n = fread((char *)log, sizeof(struct logs), NLOG, fp);
games/sail/misc.c
212
for (lp = &log[n]; lp < &log[NLOG]; lp++)
games/sail/parties.c
63
int n;
games/sail/parties.c
65
for (n = 0; n < NBP; p++, n++)
games/sail/parties.c
67
Write(isdefense ? W_DBP : W_OBP, ship, n, 0, 0, 0);
games/sail/pl_1.c
119
choke(int n __attribute__((unused)))
games/sail/pl_1.c
125
child(int n __attribute__((unused)))
games/sail/pl_3.c
145
for (n = 0; n < 3 && mf->captured == 0; n++)
games/sail/pl_3.c
146
if (!crew[n]) {
games/sail/pl_3.c
45
int n, r;
games/sail/pl_3.c
57
for (n = 0; n < 3; n++) {
games/sail/pl_3.c
58
if (mf->OBP[n].turnsent)
games/sail/pl_3.c
59
men += mf->OBP[n].mensent;
games/sail/pl_3.c
61
for (n = 0; n < 3; n++) {
games/sail/pl_3.c
62
if (mf->DBP[n].turnsent)
games/sail/pl_3.c
63
men += mf->DBP[n].mensent;
games/sail/pl_5.c
149
int n;
games/sail/pl_5.c
157
for (n = 0; n < NBP; n++) {
games/sail/pl_5.c
158
if (mf->OBP[n].turnsent)
games/sail/pl_5.c
159
men += mf->OBP[n].mensent;
games/sail/pl_5.c
161
for (n = 0; n < NBP; n++) {
games/sail/pl_5.c
162
if (mf->DBP[n].turnsent)
games/sail/pl_5.c
163
men += mf->DBP[n].mensent;
games/sail/pl_7.c
100
newturn(int n)
games/sail/pl_7.c
237
sgetstr(const char *pr, char *buf, int n)
games/sail/pl_7.c
263
if (c >= ' ' && c < 0x7f && p < buf + n - 1) {
games/sail/pl_7.c
422
int n;
games/sail/pl_7.c
434
for (n = 0; n < BOX_X; n++)
games/sail/pl_7.c
437
for (n = 0; n < BOX_X; n++)
games/sail/pl_7.c
439
for (n = BOX_T+1; n < BOX_B; n++) {
games/sail/pl_7.c
440
(void) mvaddch(n, BOX_L, '|');
games/sail/pl_7.c
441
(void) mvaddch(n, BOX_R, '|');
games/sail/pl_main.c
199
for (n = 0; n < 2; n++) {
games/sail/pl_main.c
203
n ? "right" : "left");
games/sail/pl_main.c
222
if (n) {
games/sail/pl_main.c
59
int n;
games/sail/pl_main.c
66
for (n = 0; n < NSCENE; n++) {
games/sail/pl_main.c
68
printf("\t%d):\t%d\t%s\t%s\n", n, scene[n].vessels,
games/sail/pl_main.c
69
sync_exists(n) ? "YES" : "no",
games/sail/pl_main.c
70
scene[n].name);
games/sail/pl_main.c
84
for (n = 0; n < NNATION; n++)
games/sail/pl_main.c
85
nat[n] = 0;
games/sail/sync.c
204
int n;
games/sail/sync.c
213
for (n = TIMEOUT; --n >= 0;) {
games/sail/sync.c
231
if (n <= 0)
games/tetris/scores.c
330
int i, n, c;
games/tetris/scores.c
362
for (i = 0, sp = scores; i < nscores; sp += n) {
games/tetris/scores.c
363
n = 20;
games/tetris/scores.c
364
if (i + n > nscores)
games/tetris/scores.c
365
n = nscores - i;
games/tetris/scores.c
366
printem(level, i + 1, sp, n, me);
games/tetris/scores.c
367
if ((i += n) < nscores) {
games/tetris/scores.c
382
printem(int level, int offset, struct highscore *hs, int n, const char *me)
games/tetris/scores.c
394
for (row = 0; row < n; row++) {
games/trek/getpar.c
49
int i, n;
games/trek/getpar.c
55
i = scanf("%d", &n);
games/trek/getpar.c
59
return (n);
games/trek/klmove.c
63
int n;
games/trek/klmove.c
78
for (n = 0; n < Etc.nkling; n++)
games/trek/klmove.c
80
k = &Etc.klingon[n];
games/trek/move.c
126
n = xn + 0.5;
games/trek/move.c
129
printf("dx = %.2f, dy = %.2f, xn = %.2f, n = %d\n", dx, dy, xn, n);
games/trek/move.c
133
for (i = 0; i < n; i++)
games/trek/move.c
176
n = 0;
games/trek/move.c
197
n = 0;
games/trek/move.c
204
if (n > 0)
games/trek/move.c
77
int n, i;
games/trek/phaser.c
220
n = Etc.nkling;
games/trek/phaser.c
221
if (n > NBANKS)
games/trek/phaser.c
222
n = NBANKS;
games/trek/phaser.c
223
tot = n * (n + 1) / 2;
games/trek/phaser.c
224
for (i = 0; i < n; i++)
games/trek/phaser.c
238
b->units = ((n - i) / tot) * extra;
games/trek/phaser.c
259
for (i = 0; i < n; i++)
games/trek/phaser.c
305
n = Etc.nkling;
games/trek/phaser.c
307
for (j = 0; j < n; j++)
games/trek/phaser.c
96
int n;
games/trek/snova.c
64
int f, n;
games/trek/snova.c
84
n = ranf(q->stars);
games/trek/snova.c
89
if ((n -= 1) <= 0)
games/trek/snova.c
91
if (n <= 0)
games/trek/torped.c
124
n = -1;
games/trek/torped.c
127
n = 1;
games/trek/torped.c
130
for (; n && n <= 3; n++)
games/trek/torped.c
133
course2 = course + randcourse(n);
games/trek/torped.c
148
if (n > 0)
games/trek/torped.c
149
printf(", torpedo number %d", n);
games/trek/torped.c
224
randcourse(int n)
games/trek/torped.c
233
if (n < 0)
games/trek/torped.c
236
printf(" on torpedo %d\n", n);
games/trek/torped.c
71
int burst, n;
games/worms/worms.c
171
int x, y, h, n;
games/worms/worms.c
247
for (n = 0; n < LI; ++n) {
games/worms/worms.c
248
ref[n] = ip;
games/worms/worms.c
251
for (ip = ref[0], n = LI * CO; --n >= 0;)
games/worms/worms.c
253
for (n = number, w = &worm[0]; --n >= 0; w++) {
games/worms/worms.c
297
for (n = 0, w = &worm[0]; n < number; n++, w++) {
games/worms/worms.c
301
flavor[n % sizeof(flavor)]);
games/worms/worms.c
353
flavor[n % sizeof(flavor)]);
games/wump/wump.c
73
#define plural(n) (n == 1 ? "" : "s")
include/stdlib.h
267
#define alloca(n) __builtin_alloca(n)
lib/csu/boot.h
107
for (n = 0; n <= AUX_entry; n++)
lib/csu/boot.h
108
dl_data[n] = 0;
lib/csu/boot.h
83
int n, argc;
lib/csu/hppa/boot_md.h
104
for (n = 0; n <= AUX_entry; n++)
lib/csu/hppa/boot_md.h
105
dl_data[n] = 0;
lib/csu/hppa/boot_md.h
76
int n, argc;
lib/csu/mips64/boot_md.h
116
for (n = 0; n <= AUX_entry; n++)
lib/csu/mips64/boot_md.h
117
dl_data[n] = 0;
lib/csu/mips64/boot_md.h
55
#define DT_PROC(n) ((n) - DT_LOPROC)
lib/csu/mips64/boot_md.h
94
int n, argc;
lib/libc/arch/alpha/SYS.h
90
#define __LEAF(p,n,e) \
lib/libc/arch/alpha/SYS.h
91
LEAF(___CONCAT(p,n),e)
lib/libc/arch/alpha/SYS.h
92
#define __END(p,n) \
lib/libc/arch/alpha/SYS.h
93
END(___CONCAT(p,n)); \
lib/libc/arch/alpha/SYS.h
94
_HIDDEN_FALIAS(n,___CONCAT(p,n)); \
lib/libc/arch/alpha/SYS.h
95
_END(_HIDDEN(n))
lib/libc/arch/m88k/SYS.h
55
bsr.n .Lpic; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
100
type n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
102
a = (u_int *)&n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
107
return (n); \
lib/libc/arch/sparc64/fpu/fpu_qp.c
119
type n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
121
a = (u_int *)&n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
126
return (n); \
lib/libc/arch/sparc64/fpu/fpu_qp.c
57
void _Qp_ ## qname ## toq(u_int *c, ntype n); \
lib/libc/arch/sparc64/fpu/fpu_qp.c
60
_Qp_ ## qname ## toq(u_int *c, ntype n) \
lib/libc/arch/sparc64/fpu/fpu_qp.c
65
a = (atype *)&n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
81
type n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
83
a = (u_int *)&n; \
lib/libc/arch/sparc64/fpu/fpu_qp.c
88
return (n); \
lib/libc/asr/asr.c
516
int n;
lib/libc/asr/asr.c
518
for (n = 0; *s; s++)
lib/libc/asr/asr.c
520
n += 1;
lib/libc/asr/asr.c
522
return (n);
lib/libc/asr/asr.c
598
pass0(char **tok, int n, struct asr_ctx *ac)
lib/libc/asr/asr.c
607
if (n != 2)
lib/libc/asr/asr.c
617
if (n != 2)
lib/libc/asr/asr.c
625
for (i = 1; i < n; i++)
lib/libc/asr/asr.c
626
for (j = i + 1; j < n; j++)
lib/libc/asr/asr.c
630
for (i = 1; i < n && ac->ac_dbcount < ASR_MAXDB; i++) {
lib/libc/asr/asr.c
645
for (i = 1; i < n; i++)
lib/libc/asr/asr.c
649
if (n == 1 || n > 3)
lib/libc/asr/asr.c
651
for (i = 1; i < n; i++)
lib/libc/asr/asr.c
654
for (i = 1; i < n; i++)
lib/libc/asr/asr.c
660
for (i = 1; i < n; i++) {
lib/libc/asr/asr_debug.c
174
int i, an, ns, ar, n;
lib/libc/asr/asr_debug.c
199
n = ar + h.arcount;
lib/libc/asr/asr_debug.c
201
for (i = 0; i < n; i++) {
lib/libc/asr/asr_debug.c
276
#define PRINTOPT(flag, n) if (o & (flag)) { fprintf(f, " " n); o &= ~(flag); }
lib/libc/asr/asr_debug.c
309
#define CASE(n) case n: return #n
lib/libc/asr/asr_private.h
329
#define DPRINT_PACKET(n, p, s) do { if(_asr_debug) { \
lib/libc/asr/asr_private.h
330
fprintf(_asr_debug, "----- %s -----\n", n); \
lib/libc/asr/asr_utils.c
101
dst += n;
lib/libc/asr/asr_utils.c
115
size_t n, count, end, ptr, start;
lib/libc/asr/asr_utils.c
124
for (; (n = data[offset]); ) {
lib/libc/asr/asr_utils.c
125
if ((n & 0xc0) == 0xc0) {
lib/libc/asr/asr_utils.c
128
ptr = 256 * (n & ~0xc0) + data[offset + 1];
lib/libc/asr/asr_utils.c
136
if (offset + n + 1 >= len)
lib/libc/asr/asr_utils.c
139
if (dname_check_label(data + offset + 1, n) == -1)
lib/libc/asr/asr_utils.c
144
count = (max < n + 1) ? (max) : (n + 1);
lib/libc/asr/asr_utils.c
149
res += n + 1;
lib/libc/asr/asr_utils.c
150
offset += n + 1;
lib/libc/asr/asr_utils.c
65
size_t l, n;
lib/libc/asr/asr_utils.c
95
n = (l > max) ? max : l;
lib/libc/asr/asr_utils.c
96
memmove(dst, str, n);
lib/libc/asr/asr_utils.c
97
max -= n;
lib/libc/asr/getaddrinfo_async.c
605
int n, i;
lib/libc/asr/getaddrinfo_async.c
613
n = _asr_parse_namedb_line(f, tokens, MAXTOKEN, buf, sizeof(buf));
lib/libc/asr/getaddrinfo_async.c
614
if (n == -1)
lib/libc/asr/getaddrinfo_async.c
617
for (i = 1; i < n; i++) {
lib/libc/asr/getaddrinfo_async.c
624
if (i == n)
lib/libc/asr/gethostnamadr.c
45
size_t n, i;
lib/libc/asr/gethostnamadr.c
74
n = strlcpy(pos, h->h_name, end - pos);
lib/libc/asr/gethostnamadr.c
75
if (n >= end - pos)
lib/libc/asr/gethostnamadr.c
78
pos += n + 1;
lib/libc/asr/gethostnamadr.c
81
n = strlcpy(pos, h->h_aliases[i], end - pos);
lib/libc/asr/gethostnamadr.c
82
if (n >= end - pos)
lib/libc/asr/gethostnamadr.c
85
pos += n + 1;
lib/libc/asr/gethostnamadr_async.c
447
int n, i;
lib/libc/asr/gethostnamadr_async.c
450
n = _asr_parse_namedb_line(f, tokens, MAXTOKEN, buf, sizeof(buf));
lib/libc/asr/gethostnamadr_async.c
451
if (n == -1) {
lib/libc/asr/gethostnamadr_async.c
457
if (n < 2)
lib/libc/asr/gethostnamadr_async.c
461
for (i = 1; i < n; i++) {
lib/libc/asr/gethostnamadr_async.c
479
for (i = 2; i < n; i ++)
lib/libc/asr/gethostnamadr_async.c
49
struct netent n;
lib/libc/asr/gethostnamadr_async.c
592
size_t n;
lib/libc/asr/gethostnamadr_async.c
605
n = strlen(name) + 1;
lib/libc/asr/gethostnamadr_async.c
606
if (h->pos + n >= h->end)
lib/libc/asr/gethostnamadr_async.c
610
memmove(h->pos, name, n);
lib/libc/asr/gethostnamadr_async.c
611
h->pos += n;
lib/libc/asr/gethostnamadr_async.c
619
size_t i, n;
lib/libc/asr/gethostnamadr_async.c
635
n = strlen(name) + 1;
lib/libc/asr/gethostnamadr_async.c
636
if (h->pos + n >= h->end)
lib/libc/asr/gethostnamadr_async.c
640
memmove(h->pos, name, n);
lib/libc/asr/gethostnamadr_async.c
641
h->pos += n;
lib/libc/asr/gethostnamadr_async.c
669
struct netent_ext *n;
lib/libc/asr/gethostnamadr_async.c
675
if ((n = calloc(1, sizeof(*n) + 1024)) == NULL) {
lib/libc/asr/gethostnamadr_async.c
680
n->pos = (char *)(n) + sizeof(*n);
lib/libc/asr/gethostnamadr_async.c
681
n->end = n->pos + 1024;
lib/libc/asr/gethostnamadr_async.c
682
n->n.n_name = n->pos;
lib/libc/asr/gethostnamadr_async.c
683
n->n.n_aliases = n->aliases;
lib/libc/asr/gethostnamadr_async.c
688
n->n.n_net = ntohl(addr->s_addr);
lib/libc/asr/gethostnamadr_async.c
689
n->n.n_addrtype = h->h.h_addrtype;
lib/libc/asr/gethostnamadr_async.c
693
memcpy(n->pos, h->h.h_name, sz);
lib/libc/asr/gethostnamadr_async.c
694
n->pos += sz;
lib/libc/asr/gethostnamadr_async.c
701
na = n->aliases;
lib/libc/asr/gethostnamadr_async.c
704
memcpy(n->pos, *ha, sz);
lib/libc/asr/gethostnamadr_async.c
705
*na++ = n->pos;
lib/libc/asr/gethostnamadr_async.c
706
n->pos += sz;
lib/libc/asr/gethostnamadr_async.c
711
ar->ar_netent = &n->n;
lib/libc/asr/getnameinfo.c
115
size_t n;
lib/libc/asr/getnameinfo.c
134
n = strlcpy(buf, s.s_name, buflen);
lib/libc/asr/getnameinfo.c
138
return (n);
lib/libc/asr/getnameinfo_async.c
216
size_t n, buflen = as->as.ni.servnamelen;
lib/libc/asr/getnameinfo_async.c
231
n = strlcpy(buf, s.s_name, buflen);
lib/libc/asr/getnameinfo_async.c
234
if (n >= buflen)
lib/libc/asr/getnetnamadr.c
42
size_t n, i;
lib/libc/asr/getnetnamadr.c
67
n = strlcpy(pos, e->n_name, end - pos);
lib/libc/asr/getnetnamadr.c
68
if (n >= end - pos)
lib/libc/asr/getnetnamadr.c
71
pos += n + 1;
lib/libc/asr/getnetnamadr.c
74
n = strlcpy(pos, e->n_aliases[i], end - pos);
lib/libc/asr/getnetnamadr.c
75
if (n >= end - pos)
lib/libc/asr/getnetnamadr.c
78
pos += n + 1;
lib/libc/asr/getrrsetbyname_async.c
612
int n = 0;
lib/libc/asr/getrrsetbyname_async.c
616
n++;
lib/libc/asr/getrrsetbyname_async.c
620
return (n);
lib/libc/asr/res_mkquery.c
102
if (domain && ((n = strlen(domain)) == 0 || domain[n - 1 ] != '.')) {
lib/libc/asr/res_mkquery.c
99
size_t n;
lib/libc/asr/res_send_async.c
429
ssize_t n;
lib/libc/asr/res_send_async.c
442
n = send(as->as_fd, as->as.dns.obuf, as->as.dns.obuflen, 0);
lib/libc/asr/res_send_async.c
443
if (n == -1) {
lib/libc/asr/res_send_async.c
462
ssize_t n;
lib/libc/asr/res_send_async.c
473
n = recv(as->as_fd, as->as.dns.ibuf, as->as.dns.ibufsize, 0);
lib/libc/asr/res_send_async.c
478
if (n == -1)
lib/libc/asr/res_send_async.c
481
as->as.dns.ibuflen = n;
lib/libc/asr/res_send_async.c
503
ssize_t n;
lib/libc/asr/res_send_async.c
542
n = sendmsg(as->as_fd, &msg, MSG_NOSIGNAL);
lib/libc/asr/res_send_async.c
543
if (n == -1) {
lib/libc/asr/res_send_async.c
549
as->as.dns.datalen += n;
lib/libc/asr/res_send_async.c
575
ssize_t n;
lib/libc/asr/res_send_async.c
588
n = read(as->as_fd, pos, len);
lib/libc/asr/res_send_async.c
589
if (n == -1) {
lib/libc/asr/res_send_async.c
594
if (n == 0) {
lib/libc/asr/res_send_async.c
598
as->as.dns.datalen += n;
lib/libc/asr/res_send_async.c
624
n = read(as->as_fd, pos, len);
lib/libc/asr/res_send_async.c
625
if (n == -1) {
lib/libc/asr/res_send_async.c
630
if (n == 0) {
lib/libc/asr/res_send_async.c
634
as->as.dns.datalen += n;
lib/libc/asr/res_send_async.c
659
ensure_ibuf(struct asr_query *as, size_t n)
lib/libc/asr/res_send_async.c
663
if (as->as.dns.ibufsize >= n)
lib/libc/asr/res_send_async.c
666
t = recallocarray(as->as.dns.ibuf, as->as.dns.ibufsize, n, 1);
lib/libc/asr/res_send_async.c
670
as->as.dns.ibufsize = n;
lib/libc/citrus/citrus_none.c
56
const char * __restrict s, size_t n)
lib/libc/citrus/citrus_none.c
60
if (n == 0)
lib/libc/citrus/citrus_utf8.c
125
for (i = (us->want == 0) ? 1 : 0; i < want && (size_t)i < n; i++) {
lib/libc/citrus/citrus_utf8.c
45
const char * __restrict s, size_t n, mbstate_t * __restrict ps)
lib/libc/citrus/citrus_utf8.c
60
n = 1;
lib/libc/citrus/citrus_utf8.c
64
if (n == 0)
lib/libc/compat-43/sigcompat.c
52
int omask, n;
lib/libc/compat-43/sigcompat.c
54
n = WRAP(sigprocmask)(SIG_SETMASK, (sigset_t *) &mask,
lib/libc/compat-43/sigcompat.c
56
if (n)
lib/libc/compat-43/sigcompat.c
57
return (n);
lib/libc/compat-43/sigcompat.c
64
int omask, n;
lib/libc/compat-43/sigcompat.c
66
n = WRAP(sigprocmask)(SIG_BLOCK, (sigset_t *) &mask,
lib/libc/compat-43/sigcompat.c
68
if (n)
lib/libc/compat-43/sigcompat.c
69
return (n);
lib/libc/crypt/arc4random.c
148
_rs_random_buf(void *_buf, size_t n)
lib/libc/crypt/arc4random.c
154
_rs_stir_if_needed(n);
lib/libc/crypt/arc4random.c
155
while (n > 0) {
lib/libc/crypt/arc4random.c
157
m = minimum(n, rs->rs_have);
lib/libc/crypt/arc4random.c
163
n -= m;
lib/libc/crypt/arc4random.c
198
arc4random_buf(void *buf, size_t n)
lib/libc/crypt/arc4random.c
201
_rs_random_buf(buf, n);
lib/libc/crypt/arc4random.c
73
_rs_init(u_char *buf, size_t n)
lib/libc/crypt/arc4random.c
75
if (n < KEYSZ + IVSZ)
lib/libc/crypt/blowfish.c
54
#define BLFRND(s,p,i,j,n) (i ^= F(s,j) ^ (p)[n])
lib/libc/crypt/chacha_private.h
23
#define ROTL32(v, n) \
lib/libc/crypt/chacha_private.h
24
(U32V((v) << (n)) | ((v) >> (32 - (n))))
lib/libc/db/btree/bt_split.c
184
n = NBINTERNAL(nksize);
lib/libc/db/btree/bt_split.c
185
if (n < nbytes) {
lib/libc/db/btree/bt_split.c
187
bt_pfxsaved += nbytes - n;
lib/libc/db/btree/bt_split.c
189
nbytes = n;
lib/libc/db/btree/bt_split.c
83
u_int32_t n, nbytes, nksize;
lib/libc/db/btree/btree.h
106
#define LALIGN(n) (((n) + sizeof(pgno_t) - 1) & ~(sizeof(pgno_t) - 1))
lib/libc/db/hash/hash.c
567
int n, ndx, off, size;
lib/libc/db/hash/hash.c
585
for (bp = (u_int16_t *)rbufp->page, n = *bp++, ndx = 1; ndx < n;)
lib/libc/db/hash/hash.c
605
n = *bp++;
lib/libc/db/hash/hash.c
627
n = *bp++;
lib/libc/db/hash/hash.c
850
int n, bucket;
lib/libc/db/hash/hash.c
852
n = hashp->hash(k, len);
lib/libc/db/hash/hash.c
853
bucket = n & hashp->HIGH_MASK;
lib/libc/db/hash/hash_bigkey.c
105
n = p[0];
lib/libc/db/hash/hash_bigkey.c
106
p[++n] = off;
lib/libc/db/hash/hash_bigkey.c
107
p[0] = ++n;
lib/libc/db/hash/hash_bigkey.c
108
FREESPACE(p) = off - PAGE_META(n);
lib/libc/db/hash/hash_bigkey.c
110
p[n] = PARTIAL_KEY;
lib/libc/db/hash/hash_bigkey.c
114
n = p[0];
lib/libc/db/hash/hash_bigkey.c
132
p[n] = off;
lib/libc/db/hash/hash_bigkey.c
133
p[n - 2] = FULL_KEY_DATA;
lib/libc/db/hash/hash_bigkey.c
138
p[n - 2] = FULL_KEY;
lib/libc/db/hash/hash_bigkey.c
160
n = p[0];
lib/libc/db/hash/hash_bigkey.c
161
p[++n] = off;
lib/libc/db/hash/hash_bigkey.c
162
p[0] = ++n;
lib/libc/db/hash/hash_bigkey.c
163
FREESPACE(p) = off - PAGE_META(n);
lib/libc/db/hash/hash_bigkey.c
166
p[n] = FULL_KEY;
lib/libc/db/hash/hash_bigkey.c
173
p[n] = FULL_KEY_DATA;
lib/libc/db/hash/hash_bigkey.c
195
int key_done, n;
lib/libc/db/hash/hash_bigkey.c
233
n = bp[0];
lib/libc/db/hash/hash_bigkey.c
234
pageno = bp[n - 1];
lib/libc/db/hash/hash_bigkey.c
238
if (n > 2) {
lib/libc/db/hash/hash_bigkey.c
246
n -= 2;
lib/libc/db/hash/hash_bigkey.c
247
bp[0] = n;
lib/libc/db/hash/hash_bigkey.c
248
FREESPACE(bp) = hashp->BSIZE - PAGE_META(n);
lib/libc/db/hash/hash_bigkey.c
319
int n;
lib/libc/db/hash/hash_bigkey.c
324
n = bp[0];
lib/libc/db/hash/hash_bigkey.c
332
((n == 2) || (bp[n] == OVFLPAGE) || (FREESPACE(bp))))
lib/libc/db/hash/hash_bigkey.c
335
pageno = bp[n - 1];
lib/libc/db/hash/hash_bigkey.c
556
u_int16_t free_space, n, off, *tp;
lib/libc/db/hash/hash_bigkey.c
592
n = tp[0];
lib/libc/db/hash/hash_bigkey.c
595
tp[++n] = (u_int16_t)addr;
lib/libc/db/hash/hash_bigkey.c
596
tp[++n] = OVFLPAGE;
lib/libc/db/hash/hash_bigkey.c
597
tp[0] = n;
lib/libc/db/hash/hash_bigkey.c
621
n = tp[4];
lib/libc/db/hash/hash_bigkey.c
630
tp[4] = n;
lib/libc/db/hash/hash_bigkey.c
85
int key_size, n, val_size;
lib/libc/db/hash/hash_page.c
104
bp[++n] = off;
lib/libc/db/hash/hash_page.c
107
bp[0] = n;
lib/libc/db/hash/hash_page.c
108
bp[n + 1] = off - ((n + 3) * sizeof(u_int16_t));
lib/libc/db/hash/hash_page.c
109
bp[n + 2] = off;
lib/libc/db/hash/hash_page.c
121
int n;
lib/libc/db/hash/hash_page.c
124
n = bp[0];
lib/libc/db/hash/hash_page.c
134
if (ndx != (n - 1)) {
lib/libc/db/hash/hash_page.c
142
for (i = ndx + 2; i <= n; i += 2) {
lib/libc/db/hash/hash_page.c
161
bp[n] = OFFSET(bp) + pairlen;
lib/libc/db/hash/hash_page.c
162
bp[n - 1] = bp[n + 1] + pairlen + 2 * sizeof(u_int16_t);
lib/libc/db/hash/hash_page.c
163
bp[0] = n - 2;
lib/libc/db/hash/hash_page.c
181
int n, ndx, retval;
lib/libc/db/hash/hash_page.c
202
for (n = 1, ndx = 1; n < ino[0]; n += 2) {
lib/libc/db/hash/hash_page.c
203
if (ino[n + 1] < REAL_KEY) {
lib/libc/db/hash/hash_page.c
211
key.data = (u_char *)op + ino[n];
lib/libc/db/hash/hash_page.c
212
key.size = off - ino[n];
lib/libc/db/hash/hash_page.c
218
copyto = ino[n + 1] + diff;
lib/libc/db/hash/hash_page.c
219
memmove(op + copyto, op + ino[n + 1],
lib/libc/db/hash/hash_page.c
220
off - ino[n + 1]);
lib/libc/db/hash/hash_page.c
221
ino[ndx] = copyto + ino[n] - ino[n + 1];
lib/libc/db/hash/hash_page.c
224
copyto = ino[n + 1];
lib/libc/db/hash/hash_page.c
228
val.data = (u_char *)op + ino[n + 1];
lib/libc/db/hash/hash_page.c
229
val.size = ino[n] - ino[n + 1];
lib/libc/db/hash/hash_page.c
234
off = ino[n + 1];
lib/libc/db/hash/hash_page.c
284
u_int16_t n, off, ov_addr, scopyto;
lib/libc/db/hash/hash_page.c
294
n = ino[0] - 1;
lib/libc/db/hash/hash_page.c
295
while (n < ino[0]) {
lib/libc/db/hash/hash_page.c
314
} else if (ino[n + 1] == OVFLPAGE) {
lib/libc/db/hash/hash_page.c
315
ov_addr = ino[n];
lib/libc/db/hash/hash_page.c
330
n = 1;
lib/libc/db/hash/hash_page.c
340
for (n = 1; (n < ino[0]) && (ino[n + 1] >= REAL_KEY); n += 2) {
lib/libc/db/hash/hash_page.c
342
key.data = (u_char *)cino + ino[n];
lib/libc/db/hash/hash_page.c
343
key.size = off - ino[n];
lib/libc/db/hash/hash_page.c
344
val.data = (u_char *)cino + ino[n + 1];
lib/libc/db/hash/hash_page.c
345
val.size = ino[n] - ino[n + 1];
lib/libc/db/hash/hash_page.c
346
off = ino[n + 1];
lib/libc/db/hash/hash_page.c
873
u_int16_t free_space, n, off, pageno;
lib/libc/db/hash/hash_page.c
876
n = sp[0];
lib/libc/db/hash/hash_page.c
880
pageno = sp[n - 1];
lib/libc/db/hash/hash_page.c
882
sp[n - 1] = off;
lib/libc/db/hash/hash_page.c
885
sp[n] = off;
lib/libc/db/hash/hash_page.c
887
sp[0] = n + 2;
lib/libc/db/hash/hash_page.c
888
sp[n + 1] = pageno;
lib/libc/db/hash/hash_page.c
889
sp[n + 2] = OVFLPAGE;
lib/libc/db/hash/hash_page.c
90
u_int16_t *bp, n, off;
lib/libc/db/hash/hash_page.c
95
n = bp[0];
lib/libc/db/hash/hash_page.c
99
bp[++n] = off;
lib/libc/gdtoa/dmisc.c
117
int n;
lib/libc/gdtoa/dmisc.c
128
n = S->wds;
lib/libc/gdtoa/dmisc.c
130
/*debug*/ if (b->wds > n)
lib/libc/gdtoa/dmisc.c
133
if (b->wds < n)
lib/libc/gdtoa/dmisc.c
136
sxe = sx + --n;
lib/libc/gdtoa/dmisc.c
138
bxe = bx + n;
lib/libc/gdtoa/dmisc.c
178
--n;
lib/libc/gdtoa/dmisc.c
179
b->wds = n;
lib/libc/gdtoa/dmisc.c
217
bxe = bx + n;
lib/libc/gdtoa/dmisc.c
220
--n;
lib/libc/gdtoa/dmisc.c
221
b->wds = n;
lib/libc/gdtoa/dmisc.c
69
nrv_alloc(s, rve, n) char *s, **rve; int n;
lib/libc/gdtoa/dmisc.c
71
nrv_alloc(char *s, char **rve, int n)
lib/libc/gdtoa/dmisc.c
76
t = rv = rv_alloc(n);
lib/libc/gdtoa/gdtoaimp.h
462
#define ACQUIRE_DTOA_LOCK(n) /*nothing*/
lib/libc/gdtoa/gdtoaimp.h
463
#define FREE_DTOA_LOCK(n) /*nothing*/
lib/libc/gdtoa/gdtoaimp.h
466
#define ACQUIRE_DTOA_LOCK(n) _MUTEX_LOCK(&__dtoa_locks[n])
lib/libc/gdtoa/gdtoaimp.h
467
#define FREE_DTOA_LOCK(n) _MUTEX_UNLOCK(&__dtoa_locks[n])
lib/libc/gdtoa/gethex.c
133
if ((n = hexdig[*s]) == 0 || n > 0x19) {
lib/libc/gdtoa/gethex.c
137
e1 = n - 0x10;
lib/libc/gdtoa/gethex.c
138
while((n = hexdig[*++s]) !=0 && n <= 0x19) {
lib/libc/gdtoa/gethex.c
141
e1 = 10*e1 + n - 0x10;
lib/libc/gdtoa/gethex.c
187
n0 = n = nbits >> kshift;
lib/libc/gdtoa/gethex.c
189
++n;
lib/libc/gdtoa/gethex.c
190
for(j = n, k = 0; j >>= 1; ++k);
lib/libc/gdtoa/gethex.c
194
b->wds = n;
lib/libc/gdtoa/gethex.c
197
if (n > n0)
lib/libc/gdtoa/gethex.c
202
n = s1 - s0 - 1;
lib/libc/gdtoa/gethex.c
203
for(k = 0; n > (1 << (kshift-2)) - 1; n >>= 1)
lib/libc/gdtoa/gethex.c
209
n = 0;
lib/libc/gdtoa/gethex.c
224
if (n == ULbits) {
lib/libc/gdtoa/gethex.c
227
n = 0;
lib/libc/gdtoa/gethex.c
229
L |= (hexdig[*s1] & 0x0f) << n;
lib/libc/gdtoa/gethex.c
230
n += 4;
lib/libc/gdtoa/gethex.c
233
b->wds = n = x - b->x;
lib/libc/gdtoa/gethex.c
234
n = ULbits*n - hi0bits(L);
lib/libc/gdtoa/gethex.c
238
if (n > nbits) {
lib/libc/gdtoa/gethex.c
239
n -= nbits;
lib/libc/gdtoa/gethex.c
240
if (any_on(b,n)) {
lib/libc/gdtoa/gethex.c
242
k = n - 1;
lib/libc/gdtoa/gethex.c
249
rshift(b, n);
lib/libc/gdtoa/gethex.c
250
e += n;
lib/libc/gdtoa/gethex.c
252
else if (n < nbits) {
lib/libc/gdtoa/gethex.c
253
n = nbits - n;
lib/libc/gdtoa/gethex.c
254
b = lshift(b, n);
lib/libc/gdtoa/gethex.c
257
e -= n;
lib/libc/gdtoa/gethex.c
272
n = fpi->emin - e;
lib/libc/gdtoa/gethex.c
273
if (n >= nbits) {
lib/libc/gdtoa/gethex.c
276
if (n == nbits && (n < 2 || any_on(b,n-1)))
lib/libc/gdtoa/gethex.c
304
k = n - 1;
lib/libc/gdtoa/gethex.c
311
nbits -= n;
lib/libc/gdtoa/gethex.c
312
rshift(b,n);
lib/libc/gdtoa/gethex.c
343
|| ((n = nbits & kmask) !=0
lib/libc/gdtoa/gethex.c
344
&& hi0bits(x[k-1]) < 32-n)) {
lib/libc/gdtoa/gethex.c
48
int big, esign, havedig, irv, j, k, n, n0, nbits, up, zret;
lib/libc/gdtoa/gmisc.c
42
int n;
lib/libc/gdtoa/gmisc.c
45
n = k >> kshift;
lib/libc/gdtoa/gmisc.c
46
if (n < b->wds) {
lib/libc/gdtoa/gmisc.c
48
x += n;
lib/libc/gdtoa/gmisc.c
50
n = ULbits - k;
lib/libc/gdtoa/gmisc.c
53
*x1++ = (y | (*x << n)) & ALL_ON;
lib/libc/gdtoa/gmisc.c
75
int n = 0;
lib/libc/gdtoa/gmisc.c
79
for(n = 0; x < xe && !*x; x++)
lib/libc/gdtoa/gmisc.c
80
n += ULbits;
lib/libc/gdtoa/gmisc.c
83
n += lo0bits(&L);
lib/libc/gdtoa/gmisc.c
85
return n;
lib/libc/gdtoa/misc.c
469
int i, k1, n, n1;
lib/libc/gdtoa/misc.c
473
n = k >> kshift;
lib/libc/gdtoa/misc.c
475
n1 = n + b->wds + 1;
lib/libc/gdtoa/misc.c
482
for(i = 0; i < n; i++)
lib/libc/gdtoa/smisc.c
145
copybits(c, n, b) ULong *c; int n; Bigint *b;
lib/libc/gdtoa/smisc.c
147
copybits(ULong *c, int n, Bigint *b)
lib/libc/gdtoa/smisc.c
155
ce = c + ((n-1) >> kshift) + 1;
lib/libc/gdtoa/smisc.c
180
int n, nwds;
lib/libc/gdtoa/smisc.c
185
n = k >> kshift;
lib/libc/gdtoa/smisc.c
186
if (n > nwds)
lib/libc/gdtoa/smisc.c
187
n = nwds;
lib/libc/gdtoa/smisc.c
188
else if (n < nwds && (k &= kmask)) {
lib/libc/gdtoa/smisc.c
189
x1 = x2 = x[n];
lib/libc/gdtoa/smisc.c
196
x += n;
lib/libc/gdtoa/strtodg.c
128
all_on(b, n) Bigint *b; int n;
lib/libc/gdtoa/strtodg.c
130
all_on(Bigint *b, int n)
lib/libc/gdtoa/strtodg.c
136
xe = x + (n >> kshift);
lib/libc/gdtoa/strtodg.c
140
if (n &= kmask)
lib/libc/gdtoa/strtodg.c
141
return ((*x | (ALL_ON << n)) & ALL_ON) == ALL_ON;
lib/libc/gdtoa/strtodg.c
147
set_ones(b, n) Bigint *b; int n;
lib/libc/gdtoa/strtodg.c
149
set_ones(Bigint *b, int n)
lib/libc/gdtoa/strtodg.c
155
k = (n + ((1 << kshift) - 1)) >> kshift;
lib/libc/gdtoa/strtodg.c
162
k = n >> kshift;
lib/libc/gdtoa/strtodg.c
163
if (n &= kmask)
lib/libc/gdtoa/strtodg.c
170
if (n)
lib/libc/gdtoa/strtodg.c
171
x[-1] >>= ULbits - n;
lib/libc/gen/auth_subr.c
527
auth_setoption(auth_session_t *as, char *n, char *v)
lib/libc/gen/auth_subr.c
530
size_t len = strlen(n) + strlen(v) + 2;
lib/libc/gen/auth_subr.c
538
ret = snprintf(opt->opt, len, "%s=%s", n, v);
lib/libc/gen/auth_subr.c
668
int n, len;
lib/libc/gen/auth_subr.c
712
n = *line - '0';
lib/libc/gen/auth_subr.c
715
n <<= 3;
lib/libc/gen/auth_subr.c
716
n |= *line-'0';
lib/libc/gen/auth_subr.c
720
n <<= 3;
lib/libc/gen/auth_subr.c
721
n |= *line-'0';
lib/libc/gen/exec.c
100
n = 1;
lib/libc/gen/exec.c
102
while ((argv[n] = va_arg(ap, char *)) != NULL)
lib/libc/gen/exec.c
103
n++;
lib/libc/gen/exec.c
120
int save_errno, n, error;
lib/libc/gen/exec.c
123
n = 1;
lib/libc/gen/exec.c
125
n++;
lib/libc/gen/exec.c
128
maplen = (n + 1) * sizeof(*argv);
lib/libc/gen/exec.c
135
n = 1;
lib/libc/gen/exec.c
137
while ((argv[n] = va_arg(ap, char *)) != NULL)
lib/libc/gen/exec.c
138
n++;
lib/libc/gen/exec.c
50
int save_errno, n, error;
lib/libc/gen/exec.c
53
n = 1;
lib/libc/gen/exec.c
55
n++;
lib/libc/gen/exec.c
58
maplen = (n + 1) * sizeof(*argv);
lib/libc/gen/exec.c
65
n = 1;
lib/libc/gen/exec.c
67
while ((argv[n] = va_arg(ap, char *)) != NULL)
lib/libc/gen/exec.c
68
n++;
lib/libc/gen/exec.c
85
int save_errno, n, error;
lib/libc/gen/exec.c
88
n = 1;
lib/libc/gen/exec.c
90
n++;
lib/libc/gen/exec.c
93
maplen = (n + 1) * sizeof(*argv);
lib/libc/gen/getbsize.c
40
long n, max, mul, blocksize;
lib/libc/gen/getbsize.c
49
if ((n = strtol(p, &ep, 10)) < 0)
lib/libc/gen/getbsize.c
51
if (n == 0)
lib/libc/gen/getbsize.c
52
n = 1;
lib/libc/gen/getbsize.c
77
n = 512;
lib/libc/gen/getbsize.c
82
if (n > max) {
lib/libc/gen/getbsize.c
84
n = max;
lib/libc/gen/getbsize.c
86
if ((blocksize = n * mul) < 512) {
lib/libc/gen/getbsize.c
89
blocksize = n = 512;
lib/libc/gen/getbsize.c
92
blocksize = n = 512;
lib/libc/gen/getbsize.c
94
*headerlenp = snprintf(header, sizeof(header), "%ld%s-blocks", n, form);
lib/libc/gen/getcap.c
1027
long n;
lib/libc/gen/getcap.c
1057
n = 0;
lib/libc/gen/getcap.c
1071
n = n * base + digit;
lib/libc/gen/getcap.c
1078
*num = n;
lib/libc/gen/getcap.c
314
size_t n;
lib/libc/gen/getcap.c
316
n = fread(buf, 1, sizeof(buf), fp);
lib/libc/gen/getcap.c
317
if (n == 0) {
lib/libc/gen/getcap.c
328
b_end = buf+n;
lib/libc/gen/getcap.c
715
size_t n;
lib/libc/gen/getcap.c
717
n = fread(buf, 1, sizeof(buf), pfp);
lib/libc/gen/getcap.c
718
if (n == 0) {
lib/libc/gen/getcap.c
732
b_end = buf + n;
lib/libc/gen/getcap.c
856
int n, i;
lib/libc/gen/getcap.c
858
n = 0;
lib/libc/gen/getcap.c
861
n = n * 8 + (*bp++ - '0');
lib/libc/gen/getcap.c
863
*mp++ = n;
lib/libc/gen/glob.c
412
g_strncmp(const Char *s1, const char *s2, size_t n)
lib/libc/gen/glob.c
416
while (n--) {
lib/libc/gen/glob.c
560
size_t n = pglob->gl_pathc - oldpathc;
lib/libc/gen/glob.c
563
if ((path_stat = calloc(n, sizeof(*path_stat))) == NULL)
lib/libc/gen/glob.c
565
for (i = 0; i < n; i++) {
lib/libc/gen/glob.c
569
qsort(path_stat, n, sizeof(*path_stat), compare_gps);
lib/libc/gen/glob.c
570
for (i = 0; i < n; i++) {
lib/libc/gen/ldexp.c
107
if (n< -50000) return tiny*x; /*underflow*/
lib/libc/gen/ldexp.c
110
k = k+n;
lib/libc/gen/ldexp.c
115
if (n > 50000) /* in case integer overflow in n+k */
lib/libc/gen/ldexp.c
97
ldexp(double x, int n)
lib/libc/gen/login_cap.c
1087
size_t n, olen, nlen, ulen, dlen;
lib/libc/gen/login_cap.c
1168
n = 3;
lib/libc/gen/login_cap.c
1171
} while (--n && *op >= '0' && *op <= '7');
lib/libc/gen/nlist.c
293
int fd, n;
lib/libc/gen/nlist.c
298
n = __fdnlist(fd, list);
lib/libc/gen/nlist.c
300
return (n);
lib/libc/hash/rmd160.c
69
#define ROL(n, x) (((x) << (n)) | ((x) >> (32-(n))))
lib/libc/hash/sha2.c
137
#define ADDINC128(w,n) do { \
lib/libc/hash/sha2.c
138
(w)[0] += (u_int64_t)(n); \
lib/libc/hash/sha2.c
139
if ((w)[0] < (n)) { \
lib/libc/include/thread_private.h
154
#define _MALLOC_LOCK(n) do {} while (0)
lib/libc/include/thread_private.h
155
#define _MALLOC_UNLOCK(n) do {} while (0)
lib/libc/include/thread_private.h
206
#define _MALLOC_LOCK(n) \
lib/libc/include/thread_private.h
209
_thread_cb.tc_malloc_lock(n); \
lib/libc/include/thread_private.h
211
#define _MALLOC_UNLOCK(n) \
lib/libc/include/thread_private.h
214
_thread_cb.tc_malloc_unlock(n); \
lib/libc/include/thread_private.h
488
int __thrwakeup(const volatile void *, int n);
lib/libc/locale/mblen.c
34
mblen(const char *s, size_t n)
lib/libc/locale/mblen.c
44
rval = mbrtowc(NULL, s, n, &mbs);
lib/libc/locale/mbrlen.c
32
mbrlen(const char * __restrict s, size_t n, mbstate_t * __restrict ps)
lib/libc/locale/mbrlen.c
38
return (mbrtowc(NULL, s, n, ps));
lib/libc/locale/mbrtoc16.c
35
mbrtoc16(char16_t *pc16, const char *s, size_t n, mbstate_t *ps)
lib/libc/locale/mbrtoc16.c
61
n = 1;
lib/libc/locale/mbrtoc16.c
86
rv = mbrtowc(&wc, s, n, ps);
lib/libc/locale/mbrtoc32.c
11
mbrtoc32(char32_t *pc32, const char *s, size_t n, mbstate_t *ps)
lib/libc/locale/mbrtoc32.c
17
return mbrtowc(pc32, s, n, ps);
lib/libc/locale/mbstowcs.c
36
mbstowcs(wchar_t * __restrict pwcs, const char * __restrict s, size_t n)
lib/libc/locale/mbstowcs.c
43
return (mbsrtowcs(pwcs, &sp, n, &mbs));
lib/libc/locale/mbtowc.c
36
mbtowc(wchar_t * __restrict pwc, const char * __restrict s, size_t n)
lib/libc/locale/mbtowc.c
46
rval = mbrtowc(pwc, s, n, &mbs);
lib/libc/locale/multibyte_citrus.c
47
mbrtowc(wchar_t *pwc, const char *s, size_t n, mbstate_t *ps)
lib/libc/locale/multibyte_citrus.c
54
return _citrus_none_ctype_mbrtowc(pwc, s, n);
lib/libc/locale/multibyte_citrus.c
55
return _citrus_utf8_ctype_mbrtowc(pwc, s, n, ps);
lib/libc/locale/wcstombs.c
35
wcstombs(char * __restrict s, const wchar_t * __restrict pwcs, size_t n)
lib/libc/locale/wcstombs.c
42
return (wcsrtombs(s, &pwcsp, n, &mbs));
lib/libc/locale/wcsxfrm.c
36
wcsxfrm(wchar_t *dest, const wchar_t *src, size_t n)
lib/libc/locale/wcsxfrm.c
38
if (n == 0)
lib/libc/locale/wcsxfrm.c
40
return wcslcpy(dest, src, n);
lib/libc/locale/wcsxfrm_l.c
10
wcsxfrm_l(wchar_t *dest, const wchar_t *src, size_t n,
lib/libc/locale/wcsxfrm_l.c
13
return wcsxfrm(dest, src, n);
lib/libc/locale/wctoint.h
36
int n;
lib/libc/locale/wctoint.h
39
case L'0': n = 0; break;
lib/libc/locale/wctoint.h
40
case L'1': n = 1; break;
lib/libc/locale/wctoint.h
41
case L'2': n = 2; break;
lib/libc/locale/wctoint.h
42
case L'3': n = 3; break;
lib/libc/locale/wctoint.h
43
case L'4': n = 4; break;
lib/libc/locale/wctoint.h
44
case L'5': n = 5; break;
lib/libc/locale/wctoint.h
45
case L'6': n = 6; break;
lib/libc/locale/wctoint.h
46
case L'7': n = 7; break;
lib/libc/locale/wctoint.h
47
case L'8': n = 8; break;
lib/libc/locale/wctoint.h
48
case L'9': n = 9; break;
lib/libc/locale/wctoint.h
49
case L'A': case L'a': n = 10; break;
lib/libc/locale/wctoint.h
50
case L'B': case L'b': n = 11; break;
lib/libc/locale/wctoint.h
51
case L'C': case L'c': n = 12; break;
lib/libc/locale/wctoint.h
52
case L'D': case L'd': n = 13; break;
lib/libc/locale/wctoint.h
53
case L'E': case L'e': n = 14; break;
lib/libc/locale/wctoint.h
54
case L'F': case L'f': n = 15; break;
lib/libc/locale/wctoint.h
55
case L'G': case L'g': n = 16; break;
lib/libc/locale/wctoint.h
56
case L'H': case L'h': n = 17; break;
lib/libc/locale/wctoint.h
57
case L'I': case L'i': n = 18; break;
lib/libc/locale/wctoint.h
58
case L'J': case L'j': n = 19; break;
lib/libc/locale/wctoint.h
59
case L'K': case L'k': n = 20; break;
lib/libc/locale/wctoint.h
60
case L'L': case L'l': n = 21; break;
lib/libc/locale/wctoint.h
61
case L'M': case L'm': n = 22; break;
lib/libc/locale/wctoint.h
62
case L'N': case L'n': n = 23; break;
lib/libc/locale/wctoint.h
63
case L'O': case L'o': n = 24; break;
lib/libc/locale/wctoint.h
64
case L'P': case L'p': n = 25; break;
lib/libc/locale/wctoint.h
65
case L'Q': case L'q': n = 26; break;
lib/libc/locale/wctoint.h
66
case L'R': case L'r': n = 27; break;
lib/libc/locale/wctoint.h
67
case L'S': case L's': n = 28; break;
lib/libc/locale/wctoint.h
68
case L'T': case L't': n = 29; break;
lib/libc/locale/wctoint.h
69
case L'U': case L'u': n = 30; break;
lib/libc/locale/wctoint.h
70
case L'V': case L'v': n = 31; break;
lib/libc/locale/wctoint.h
71
case L'W': case L'w': n = 32; break;
lib/libc/locale/wctoint.h
72
case L'X': case L'x': n = 33; break;
lib/libc/locale/wctoint.h
73
case L'Y': case L'y': n = 34; break;
lib/libc/locale/wctoint.h
74
case L'Z': case L'z': n = 35; break;
lib/libc/locale/wctoint.h
75
default: n = -1; break; /* error */
lib/libc/locale/wctoint.h
78
return n;
lib/libc/net/ethers.c
162
size_t n;
lib/libc/net/ethers.c
173
n = strcspn(p, " \t\n");
lib/libc/net/ethers.c
174
if (n >= HOST_NAME_MAX+1)
lib/libc/net/ethers.c
176
strlcpy(hostname, p, n + 1);
lib/libc/net/ethers.c
87
static struct ether_addr n;
lib/libc/net/ethers.c
89
return (_ether_aton(s, &n) ? &n : NULL);
lib/libc/net/inet_addr.c
144
n = pp - parts + 1;
lib/libc/net/inet_addr.c
145
switch (n) {
lib/libc/net/inet_addr.c
84
int base, n;
lib/libc/net/inet_net_pton.c
100
n = strchr(xdigits, ch) - xdigits;
lib/libc/net/inet_net_pton.c
101
assert(n >= 0 && n <= 15);
lib/libc/net/inet_net_pton.c
103
tmp = n;
lib/libc/net/inet_net_pton.c
105
tmp = (tmp << 4) | n;
lib/libc/net/inet_net_pton.c
123
n = strchr(digits, ch) - digits;
lib/libc/net/inet_net_pton.c
124
assert(n >= 0 && n <= 9);
lib/libc/net/inet_net_pton.c
126
tmp += n;
lib/libc/net/inet_net_pton.c
152
n = strchr(digits, ch) - digits;
lib/libc/net/inet_net_pton.c
153
assert(n >= 0 && n <= 9);
lib/libc/net/inet_net_pton.c
155
bits += n;
lib/libc/net/inet_net_pton.c
85
int n, ch, tmp, dirty, bits;
lib/libc/net/inet_network.c
44
in_addr_t val, base, n;
lib/libc/net/inet_network.c
77
n = pp - parts;
lib/libc/net/inet_network.c
80
if (i < n)
lib/libc/net/inet_pton.c
198
const int n = tp - colonp;
lib/libc/net/inet_pton.c
203
for (i = 1; i <= n; i++) {
lib/libc/net/inet_pton.c
204
endp[- i] = colonp[n - i];
lib/libc/net/inet_pton.c
205
colonp[n - i] = 0;
lib/libc/net/rcmdsh.c
156
int n;
lib/libc/net/rcmdsh.c
157
for (n = 7; (p = strchr(++p, ' ')) != NULL; n++)
lib/libc/net/rcmdsh.c
160
ap = argv = calloc(sizeof(char *), n);
lib/libc/net/res_comp.c
103
switch (n & INDIR_MASK) {
lib/libc/net/res_comp.c
110
if (dn+n >= eom)
lib/libc/net/res_comp.c
112
checked += n + 1;
lib/libc/net/res_comp.c
113
while (--n >= 0) {
lib/libc/net/res_comp.c
115
if (dn + n + 2 >= eom)
lib/libc/net/res_comp.c
128
cp = msg + (((n & 0x3f) << 8) | (*cp & 0xff));
lib/libc/net/res_comp.c
246
int n;
lib/libc/net/res_comp.c
249
while (cp < eom && (n = *cp++)) {
lib/libc/net/res_comp.c
253
switch (n & INDIR_MASK) {
lib/libc/net/res_comp.c
255
cp += n;
lib/libc/net/res_comp.c
280
int n;
lib/libc/net/res_comp.c
286
while ((n = *cp++)) {
lib/libc/net/res_comp.c
290
switch (n & INDIR_MASK) {
lib/libc/net/res_comp.c
292
while (--n >= 0) {
lib/libc/net/res_comp.c
301
if ((n = *dn++) == '\0' && *cp == '\0')
lib/libc/net/res_comp.c
303
if (n == '.')
lib/libc/net/res_comp.c
308
cp = msg + (((n & 0x3f) << 8) | *cp);
lib/libc/net/res_comp.c
81
int n, c;
lib/libc/net/res_comp.c
96
while ((n = *cp++)) {
lib/libc/net/res_random.c
261
int i, n;
lib/libc/net/res_random.c
273
n = argc > 1 ? atoi(argv[1]) : 60001;
lib/libc/net/res_random.c
274
for (i=0;i<n;i++) {
lib/libc/quad/qdivrem.c
119
for (n = 4; v[1] == 0; v++) {
lib/libc/quad/qdivrem.c
120
if (--n == 1) {
lib/libc/quad/qdivrem.c
153
for (m = 4 - n; u[1] == 0; u++)
lib/libc/quad/qdivrem.c
169
shl(&u[0], m + n, d); /* u <<= d */
lib/libc/quad/qdivrem.c
170
shl(&v[1], n - 1, d); /* v <<= d */
lib/libc/quad/qdivrem.c
213
for (t = 0, i = n; i > 0; i--) {
lib/libc/quad/qdivrem.c
228
for (t = 0, i = n; i > 0; i--) { /* D6: add back. */
lib/libc/quad/qdivrem.c
245
for (i = m + n; i > m; --i)
lib/libc/quad/qdivrem.c
71
int m, n, d, j, i;
lib/libc/regex/regcomp.c
1140
int n = 0;
lib/libc/regex/regcomp.c
1144
n++;
lib/libc/regex/regcomp.c
1145
return(n);
lib/libc/regex/regcomp.c
118
#define NEXTn(n) (p->next += (n))
lib/libc/regex/regcomp.c
129
#define DROP(n) (p->slen -= (n))
lib/libc/regex/regcomp.c
937
# define MAP(n) (((n) <= 1) ? (n) : ((n) == INFINITY) ? INF : N)
lib/libc/regex/regex2.h
67
#define OP(n) ((n)&OPRMASK)
lib/libc/regex/regex2.h
68
#define OPND(n) ((n)&OPDMASK)
lib/libc/regex/regexec.c
106
#define SET0(v, n) ((v)[n] = 0)
lib/libc/regex/regexec.c
107
#define SET1(v, n) ((v)[n] = 1)
lib/libc/regex/regexec.c
108
#define ISSET(v, n) ((v)[n])
lib/libc/regex/regexec.c
119
#define INIT(o, n) ((o) = (n))
lib/libc/regex/regexec.c
124
#define FWD(dst, src, n) ((dst)[here+(n)] |= (src)[here])
lib/libc/regex/regexec.c
125
#define BACK(dst, src, n) ((dst)[here-(n)] |= (src)[here])
lib/libc/regex/regexec.c
126
#define ISSETBACK(v, n) ((v)[here - (n)])
lib/libc/regex/regexec.c
59
#define SET0(v, n) ((v) &= ~((unsigned long)1 << (n)))
lib/libc/regex/regexec.c
60
#define SET1(v, n) ((v) |= (unsigned long)1 << (n))
lib/libc/regex/regexec.c
61
#define ISSET(v, n) (((v) & ((unsigned long)1 << (n))) != 0)
lib/libc/regex/regexec.c
65
#define STATESETUP(m, n) /* nothing */
lib/libc/regex/regexec.c
69
#define INIT(o, n) ((o) = (unsigned long)1 << (n))
lib/libc/regex/regexec.c
74
#define FWD(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) << (n))
lib/libc/regex/regexec.c
75
#define BACK(dst, src, n) ((dst) |= ((unsigned long)(src)&(here)) >> (n))
lib/libc/regex/regexec.c
76
#define ISSETBACK(v, n) (((v) & ((unsigned long)here >> (n))) != 0)
lib/libc/rpc/pmap_rmt.c
160
int i = 0, n = 0;
lib/libc/rpc/pmap_rmt.c
173
n++;
lib/libc/rpc/pmap_rmt.c
177
addrs = calloc(n, sizeof(*addrs));
lib/libc/rpc/svc.c
541
int i, n;
lib/libc/rpc/svc.c
543
for (n = nready, i = 0; n > 0; i++) {
lib/libc/rpc/svc.c
547
n--;
lib/libc/rpc/xdr_rec.c
516
ssize_t n;
lib/libc/rpc/xdr_rec.c
520
n = rstrm->readit(rstrm->tcp_handle, rstrm->in_hdrp,
lib/libc/rpc/xdr_rec.c
522
if (n == 0) {
lib/libc/rpc/xdr_rec.c
526
if (n < 0) {
lib/libc/rpc/xdr_rec.c
530
rstrm->in_hdrp += n;
lib/libc/rpc/xdr_rec.c
531
rstrm->in_hdrlen += n;
lib/libc/rpc/xdr_rec.c
552
n = rstrm->readit(rstrm->tcp_handle,
lib/libc/rpc/xdr_rec.c
556
if (n < 0) {
lib/libc/rpc/xdr_rec.c
561
if (n == 0) {
lib/libc/rpc/xdr_rec.c
566
rstrm->in_received += n;
lib/libc/stdio/fflush.c
59
int n, t;
lib/libc/stdio/fflush.c
66
n = fp->_p - p; /* write this much */
lib/libc/stdio/fflush.c
76
for (; n > 0; n -= t, p += t) {
lib/libc/stdio/fflush.c
77
t = (*fp->_write)(fp->_cookie, (char *)p, n);
lib/libc/stdio/fgets.c
100
n -= len;
lib/libc/stdio/fgets.c
46
fgets(char *buf, int n, FILE *fp)
lib/libc/stdio/fgets.c
52
if (n <= 0) { /* sanity check */
lib/libc/stdio/fgets.c
60
n--; /* leave space for NUL */
lib/libc/stdio/fgets.c
61
while (n != 0) {
lib/libc/stdio/fgets.c
84
if (len > n)
lib/libc/stdio/fgets.c
85
len = n;
lib/libc/stdio/fgetws.c
40
fgetws(wchar_t * __restrict ws, int n, FILE * __restrict fp)
lib/libc/stdio/fgetws.c
48
if (n <= 0) {
lib/libc/stdio/fgetws.c
54
while (n-- > 1) {
lib/libc/stdio/findfp.c
106
for (fp = g->iobs, n = g->niobs; --n >= 0; fp++)
lib/libc/stdio/findfp.c
76
moreglue(int n)
lib/libc/stdio/findfp.c
81
data = calloc(1, sizeof(*g) + ALIGNBYTES + n * sizeof(FILE));
lib/libc/stdio/findfp.c
86
g->niobs = n;
lib/libc/stdio/findfp.c
98
int n;
lib/libc/stdio/fseek.c
175
n = fp->_up - fp->_bf._base;
lib/libc/stdio/fseek.c
176
curoff -= n;
lib/libc/stdio/fseek.c
177
n += fp->_ur;
lib/libc/stdio/fseek.c
179
n = fp->_p - fp->_bf._base;
lib/libc/stdio/fseek.c
180
curoff -= n;
lib/libc/stdio/fseek.c
181
n += fp->_r;
lib/libc/stdio/fseek.c
191
target >= curoff && target < curoff + n) {
lib/libc/stdio/fseek.c
195
fp->_r = n - o;
lib/libc/stdio/fseek.c
219
n = target - curoff;
lib/libc/stdio/fseek.c
220
if (n) {
lib/libc/stdio/fseek.c
221
if (__srefill(fp) || fp->_r < n)
lib/libc/stdio/fseek.c
223
fp->_p += n;
lib/libc/stdio/fseek.c
224
fp->_r -= n;
lib/libc/stdio/fseek.c
53
size_t n;
lib/libc/stdio/fvwrite.c
65
#define COPY(n) (void)memcpy(fp->_p, p, n)
lib/libc/stdio/fwalk.c
43
int n, ret;
lib/libc/stdio/fwalk.c
48
for (fp = g->iobs, n = g->niobs; --n >= 0; fp++) {
lib/libc/stdio/fwrite.c
50
size_t n;
lib/libc/stdio/fwrite.c
68
if ((n = count * size) == 0)
lib/libc/stdio/fwrite.c
72
uio.uio_resid = iov.iov_len = n;
lib/libc/stdio/fwrite.c
87
return ((n - uio.uio_resid) / size);
lib/libc/stdio/snprintf.c
41
snprintf(char *str, size_t n, const char *fmt, ...)
lib/libc/stdio/snprintf.c
49
if (n > INT_MAX)
lib/libc/stdio/snprintf.c
50
n = INT_MAX;
lib/libc/stdio/snprintf.c
52
if (n == 0) {
lib/libc/stdio/snprintf.c
54
n = 1;
lib/libc/stdio/snprintf.c
57
f._bf._size = f._w = n - 1;
lib/libc/stdio/stdio.c
43
__sread(void *cookie, char *buf, int n)
lib/libc/stdio/stdio.c
48
ret = read(fp->_file, buf, n);
lib/libc/stdio/stdio.c
58
__swrite(void *cookie, const char *buf, int n)
lib/libc/stdio/stdio.c
65
return (write(fp->_file, 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/vdprintf.c
44
__dwrite(void *cookie, const char *buf, int n)
lib/libc/stdio/vdprintf.c
47
return (write(*fdp, buf, n));
lib/libc/stdio/vfprintf.c
1148
int n, n2; /* handy integer (short term usage) */
lib/libc/stdio/vfprintf.c
1248
n = 0;
lib/libc/stdio/vfprintf.c
1250
APPEND_DIGIT(n ,ch);
lib/libc/stdio/vfprintf.c
1254
nextarg = n;
lib/libc/stdio/vfprintf.c
1380
for (n = 1; n <= tablemax; n++) {
lib/libc/stdio/vfprintf.c
1381
switch (typetable[n]) {
lib/libc/stdio/vfprintf.c
1388
(*argtable)[n].intarg = va_arg(ap, int);
lib/libc/stdio/vfprintf.c
1391
(*argtable)[n].pshortarg = va_arg(ap, short *);
lib/libc/stdio/vfprintf.c
1394
(*argtable)[n].uintarg = va_arg(ap, unsigned int);
lib/libc/stdio/vfprintf.c
1397
(*argtable)[n].pintarg = va_arg(ap, int *);
lib/libc/stdio/vfprintf.c
1400
(*argtable)[n].longarg = va_arg(ap, long);
lib/libc/stdio/vfprintf.c
1403
(*argtable)[n].ulongarg = va_arg(ap, unsigned long);
lib/libc/stdio/vfprintf.c
1406
(*argtable)[n].plongarg = va_arg(ap, long *);
lib/libc/stdio/vfprintf.c
1409
(*argtable)[n].longlongarg = va_arg(ap, long long);
lib/libc/stdio/vfprintf.c
1412
(*argtable)[n].ulonglongarg = va_arg(ap, unsigned long long);
lib/libc/stdio/vfprintf.c
1415
(*argtable)[n].plonglongarg = va_arg(ap, long long *);
lib/libc/stdio/vfprintf.c
1419
(*argtable)[n].doublearg = va_arg(ap, double);
lib/libc/stdio/vfprintf.c
1422
(*argtable)[n].longdoublearg = va_arg(ap, long double);
lib/libc/stdio/vfprintf.c
1426
(*argtable)[n].pchararg = va_arg(ap, char *);
lib/libc/stdio/vfprintf.c
1429
(*argtable)[n].pvoidarg = va_arg(ap, void *);
lib/libc/stdio/vfprintf.c
1432
(*argtable)[n].ptrdiffarg = va_arg(ap, ptrdiff_t);
lib/libc/stdio/vfprintf.c
1435
(*argtable)[n].pptrdiffarg = va_arg(ap, ptrdiff_t *);
lib/libc/stdio/vfprintf.c
1438
(*argtable)[n].sizearg = va_arg(ap, size_t);
lib/libc/stdio/vfprintf.c
1441
(*argtable)[n].ssizearg = va_arg(ap, ssize_t);
lib/libc/stdio/vfprintf.c
1444
(*argtable)[n].pssizearg = va_arg(ap, ssize_t *);
lib/libc/stdio/vfprintf.c
1447
(*argtable)[n].intmaxarg = va_arg(ap, intmax_t);
lib/libc/stdio/vfprintf.c
1450
(*argtable)[n].uintmaxarg = va_arg(ap, uintmax_t);
lib/libc/stdio/vfprintf.c
1453
(*argtable)[n].pintmaxarg = va_arg(ap, intmax_t *);
lib/libc/stdio/vfprintf.c
1457
(*argtable)[n].wintarg = va_arg(ap, wint_t);
lib/libc/stdio/vfprintf.c
1460
(*argtable)[n].pwchararg = va_arg(ap, wchar_t *);
lib/libc/stdio/vfprintf.c
251
#define to_char(n) ((n) + '0')
lib/libc/stdio/vfprintf.c
286
int n, n2; /* handy integers (short term usage) */
lib/libc/stdio/vfprintf.c
375
if ((n = (howmany)) > 0) { \
lib/libc/stdio/vfprintf.c
376
while (n > PADSIZE) { \
lib/libc/stdio/vfprintf.c
378
n -= PADSIZE; \
lib/libc/stdio/vfprintf.c
380
PRINT(with, n); \
lib/libc/stdio/vfprintf.c
558
GETASTER(n);
lib/libc/stdio/vfprintf.c
559
prec = n < 0 ? -1 : n;
lib/libc/stdio/vfprintf.c
562
n = 0;
lib/libc/stdio/vfprintf.c
564
APPEND_DIGIT(n, ch);
lib/libc/stdio/vfprintf.c
568
nextarg = n;
lib/libc/stdio/vfprintf.c
579
prec = n;
lib/libc/stdio/vfprintf.c
591
n = 0;
lib/libc/stdio/vfprintf.c
593
APPEND_DIGIT(n, ch);
lib/libc/stdio/vfprintf.c
597
nextarg = n;
lib/libc/stdio/vfprintf.c
608
width = n;
lib/libc/stdio/vfscanf.c
106
int n; /* handy integer */
lib/libc/stdio/vfscanf.c
348
n = 0;
lib/libc/stdio/vfscanf.c
350
if (n == MB_CUR_MAX) {
lib/libc/stdio/vfscanf.c
354
buf[n++] = *fp->_p;
lib/libc/stdio/vfscanf.c
358
nconv = mbrtowc(wcp, buf, n, &mbs);
lib/libc/stdio/vfscanf.c
366
nread += n;
lib/libc/stdio/vfscanf.c
370
n = 0;
lib/libc/stdio/vfscanf.c
373
if (n != 0) {
lib/libc/stdio/vfscanf.c
387
if ((n = fp->_r) < width) {
lib/libc/stdio/vfscanf.c
388
sum += n;
lib/libc/stdio/vfscanf.c
389
width -= n;
lib/libc/stdio/vfscanf.c
390
fp->_p += n;
lib/libc/stdio/vfscanf.c
429
n = 0;
lib/libc/stdio/vfscanf.c
432
if (n == MB_CUR_MAX) {
lib/libc/stdio/vfscanf.c
436
buf[n++] = *fp->_p;
lib/libc/stdio/vfscanf.c
440
nconv = mbrtowc(wcp, buf, n, &mbs);
lib/libc/stdio/vfscanf.c
450
while (n != 0) {
lib/libc/stdio/vfscanf.c
451
n--;
lib/libc/stdio/vfscanf.c
452
ungetc(buf[n],
lib/libc/stdio/vfscanf.c
457
nread += n;
lib/libc/stdio/vfscanf.c
462
n = 0;
lib/libc/stdio/vfscanf.c
465
if (n != 0) {
lib/libc/stdio/vfscanf.c
472
if (n != 0) {
lib/libc/stdio/vfscanf.c
476
n = nchars;
lib/libc/stdio/vfscanf.c
477
if (n == 0)
lib/libc/stdio/vfscanf.c
487
n = 0;
lib/libc/stdio/vfscanf.c
489
n++, fp->_r--, fp->_p++;
lib/libc/stdio/vfscanf.c
493
if (n == 0)
lib/libc/stdio/vfscanf.c
498
if (n == 0)
lib/libc/stdio/vfscanf.c
513
n = p - p0;
lib/libc/stdio/vfscanf.c
514
if (n == 0)
lib/libc/stdio/vfscanf.c
519
nread += n;
lib/libc/stdio/vfscanf.c
534
n = 0;
lib/libc/stdio/vfscanf.c
536
if (n == MB_CUR_MAX) {
lib/libc/stdio/vfscanf.c
540
buf[n++] = *fp->_p;
lib/libc/stdio/vfscanf.c
544
nconv = mbrtowc(wcp, buf, n, &mbs);
lib/libc/stdio/vfscanf.c
553
while (n != 0) {
lib/libc/stdio/vfscanf.c
554
n--;
lib/libc/stdio/vfscanf.c
555
ungetc(buf[n],
lib/libc/stdio/vfscanf.c
560
nread += n;
lib/libc/stdio/vfscanf.c
564
n = 0;
lib/libc/stdio/vfscanf.c
567
if (n != 0) {
lib/libc/stdio/vfscanf.c
581
n = 0;
lib/libc/stdio/vfscanf.c
583
n++, fp->_r--, fp->_p++;
lib/libc/stdio/vfscanf.c
589
nread += n;
lib/libc/stdio/vfscanf.c
874
int c, n, v;
lib/libc/stdio/vfscanf.c
884
for (n = 0; n < 256; n++)
lib/libc/stdio/vfscanf.c
885
tab[n] = v;
lib/libc/stdio/vfscanf.c
900
n = *fmt++; /* and examine the next */
lib/libc/stdio/vfscanf.c
901
switch (n) {
lib/libc/stdio/vfscanf.c
925
n = *fmt;
lib/libc/stdio/vfscanf.c
926
if (n == ']' || n < c) {
lib/libc/stdio/vfscanf.c
933
} while (c < n);
lib/libc/stdio/vfscanf.c
954
c = n;
lib/libc/stdio/vfwprintf.c
1134
int n, n2; /* handy integer (short term usage) */
lib/libc/stdio/vfwprintf.c
1234
n = 0;
lib/libc/stdio/vfwprintf.c
1236
APPEND_DIGIT(n ,ch);
lib/libc/stdio/vfwprintf.c
1240
nextarg = n;
lib/libc/stdio/vfwprintf.c
1369
for (n = 1; n <= tablemax; n++) {
lib/libc/stdio/vfwprintf.c
1370
switch (typetable[n]) {
lib/libc/stdio/vfwprintf.c
1377
(*argtable)[n].intarg = va_arg(ap, int);
lib/libc/stdio/vfwprintf.c
1380
(*argtable)[n].pshortarg = va_arg(ap, short *);
lib/libc/stdio/vfwprintf.c
1383
(*argtable)[n].uintarg = va_arg(ap, unsigned int);
lib/libc/stdio/vfwprintf.c
1386
(*argtable)[n].pintarg = va_arg(ap, int *);
lib/libc/stdio/vfwprintf.c
1389
(*argtable)[n].longarg = va_arg(ap, long);
lib/libc/stdio/vfwprintf.c
1392
(*argtable)[n].ulongarg = va_arg(ap, unsigned long);
lib/libc/stdio/vfwprintf.c
1395
(*argtable)[n].plongarg = va_arg(ap, long *);
lib/libc/stdio/vfwprintf.c
1398
(*argtable)[n].longlongarg = va_arg(ap, long long);
lib/libc/stdio/vfwprintf.c
1401
(*argtable)[n].ulonglongarg = va_arg(ap, unsigned long long);
lib/libc/stdio/vfwprintf.c
1404
(*argtable)[n].plonglongarg = va_arg(ap, long long *);
lib/libc/stdio/vfwprintf.c
1408
(*argtable)[n].doublearg = va_arg(ap, double);
lib/libc/stdio/vfwprintf.c
1411
(*argtable)[n].longdoublearg = va_arg(ap, long double);
lib/libc/stdio/vfwprintf.c
1415
(*argtable)[n].pchararg = va_arg(ap, char *);
lib/libc/stdio/vfwprintf.c
1418
(*argtable)[n].pvoidarg = va_arg(ap, void *);
lib/libc/stdio/vfwprintf.c
1421
(*argtable)[n].ptrdiffarg = va_arg(ap, ptrdiff_t);
lib/libc/stdio/vfwprintf.c
1424
(*argtable)[n].pptrdiffarg = va_arg(ap, ptrdiff_t *);
lib/libc/stdio/vfwprintf.c
1427
(*argtable)[n].sizearg = va_arg(ap, size_t);
lib/libc/stdio/vfwprintf.c
1430
(*argtable)[n].ssizearg = va_arg(ap, ssize_t);
lib/libc/stdio/vfwprintf.c
1433
(*argtable)[n].pssizearg = va_arg(ap, ssize_t *);
lib/libc/stdio/vfwprintf.c
1436
(*argtable)[n].intmaxarg = va_arg(ap, intmax_t);
lib/libc/stdio/vfwprintf.c
1439
(*argtable)[n].wintarg = va_arg(ap, wint_t);
lib/libc/stdio/vfwprintf.c
1442
(*argtable)[n].pwchararg = va_arg(ap, wchar_t *);
lib/libc/stdio/vfwprintf.c
257
#define to_char(n) ((wchar_t)((n) + '0'))
lib/libc/stdio/vfwprintf.c
280
int n, n2, n3; /* handy integers (short term usage) */
lib/libc/stdio/vfwprintf.c
358
if ((n = (howmany)) > 0) { \
lib/libc/stdio/vfwprintf.c
359
while (n > PADSIZE) { \
lib/libc/stdio/vfwprintf.c
361
n -= PADSIZE; \
lib/libc/stdio/vfwprintf.c
363
PRINT(with, n); \
lib/libc/stdio/vfwprintf.c
528
GETASTER(n);
lib/libc/stdio/vfwprintf.c
529
prec = n < 0 ? -1 : n;
lib/libc/stdio/vfwprintf.c
532
n = 0;
lib/libc/stdio/vfwprintf.c
534
APPEND_DIGIT(n, ch);
lib/libc/stdio/vfwprintf.c
538
nextarg = n;
lib/libc/stdio/vfwprintf.c
549
prec = n;
lib/libc/stdio/vfwprintf.c
561
n = 0;
lib/libc/stdio/vfwprintf.c
563
APPEND_DIGIT(n, ch);
lib/libc/stdio/vfwprintf.c
567
nextarg = n;
lib/libc/stdio/vfwprintf.c
578
width = n;
lib/libc/stdio/vfwscanf.c
108
int n; /* handy integer */
lib/libc/stdio/vfwscanf.c
359
n = 0;
lib/libc/stdio/vfwscanf.c
364
n++;
lib/libc/stdio/vfwscanf.c
366
if (n == 0)
lib/libc/stdio/vfwscanf.c
368
nread += n;
lib/libc/stdio/vfwscanf.c
374
n = 0;
lib/libc/stdio/vfwscanf.c
399
n++;
lib/libc/stdio/vfwscanf.c
401
if (n == 0)
lib/libc/stdio/vfwscanf.c
403
nread += n;
lib/libc/stdio/vfwscanf.c
416
n = 0;
lib/libc/stdio/vfwscanf.c
419
n++;
lib/libc/stdio/vfwscanf.c
422
if (n == 0)
lib/libc/stdio/vfwscanf.c
431
n = p - p0;
lib/libc/stdio/vfwscanf.c
432
if (n == 0)
lib/libc/stdio/vfwscanf.c
439
n = 0;
lib/libc/stdio/vfwscanf.c
462
n++;
lib/libc/stdio/vfwscanf.c
471
nread += n;
lib/libc/stdio/vsnprintf.c
40
vsnprintf(char *str, size_t n, const char *fmt, __va_list ap)
lib/libc/stdio/vsnprintf.c
47
if (n > INT_MAX)
lib/libc/stdio/vsnprintf.c
48
n = INT_MAX;
lib/libc/stdio/vsnprintf.c
50
if (n == 0) {
lib/libc/stdio/vsnprintf.c
52
n = 1;
lib/libc/stdio/vsnprintf.c
55
f._bf._size = f._w = n - 1;
lib/libc/stdio/vswprintf.c
40
vswprintf(wchar_t * __restrict s, size_t n, const wchar_t * __restrict fmt,
lib/libc/stdio/vswprintf.c
49
if (n == 0) {
lib/libc/stdio/vswprintf.c
79
nwc = mbsrtowcs(s, (const char **)&mbp, n, &mbs);
lib/libc/stdio/vswprintf.c
85
if (nwc == n) {
lib/libc/stdio/vswprintf.c
86
s[n - 1] = L'\0';
lib/libc/stdio/wbuf.c
45
int n;
lib/libc/stdio/wbuf.c
69
n = fp->_p - fp->_bf._base;
lib/libc/stdio/wbuf.c
70
if (n >= fp->_bf._size) {
lib/libc/stdio/wbuf.c
73
n = 0;
lib/libc/stdio/wbuf.c
77
if (++n == fp->_bf._size || (fp->_flags & __SLBF && c == '\n'))
lib/libc/stdlib/atexit.c
149
int n, pgsize = getpagesize();
lib/libc/stdlib/atexit.c
161
for (n = p->ind; --n >= 0;) {
lib/libc/stdlib/atexit.c
162
if (p->fns[n].fn_ptr == NULL)
lib/libc/stdlib/atexit.c
164
if (dso != NULL && dso != p->fns[n].fn_dso)
lib/libc/stdlib/atexit.c
171
fn = p->fns[n];
lib/libc/stdlib/atexit.c
173
p->fns[n].fn_ptr = NULL;
lib/libc/stdlib/malloc.c
230
#define CHUNK_FREE(i, n) ((i)->bits[(n) / MALLOC_BITS] & \
lib/libc/stdlib/malloc.c
231
(1U << ((n) % MALLOC_BITS)))
lib/libc/stdlib/merge.c
251
setup(u_char *list1, u_char *list2, size_t n, size_t size,
lib/libc/stdlib/merge.c
258
if (n <= 5) {
lib/libc/stdlib/merge.c
259
insertionsort(list1, n, size, cmp);
lib/libc/stdlib/merge.c
260
*EVAL(list2) = (u_char*) list2 + n*size;
lib/libc/stdlib/merge.c
267
i = 4 + (n & 1);
lib/libc/stdlib/merge.c
268
insertionsort(list1 + (n - i) * size, i, size, cmp);
lib/libc/stdlib/merge.c
269
last = list1 + size * (n - i);
lib/libc/stdlib/merge.c
270
*EVAL(list2 + (last - list1)) = list2 + n * size;
lib/libc/stdlib/merge.c
306
p2 = *EVAL(p2) = list2 + n*size;
lib/libc/stdlib/merge.c
323
insertionsort(u_char *a, size_t n, size_t size,
lib/libc/stdlib/merge.c
329
for (ai = a+size; --n >= 1; ai += size)
lib/libc/stdlib/qsort.c
114
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
lib/libc/stdlib/qsort.c
125
introsort(char *a, size_t n, size_t es, size_t maxdepth, int swaptype,
lib/libc/stdlib/qsort.c
132
loop: if (n < 7) {
lib/libc/stdlib/qsort.c
133
for (pm = a + es; pm < a + n * es; pm += es)
lib/libc/stdlib/qsort.c
140
if (heapsort(a, n, es, cmp) == 0)
lib/libc/stdlib/qsort.c
144
pm = a + (n / 2) * es;
lib/libc/stdlib/qsort.c
145
if (n > 7) {
lib/libc/stdlib/qsort.c
147
pn = a + (n - 1) * es;
lib/libc/stdlib/qsort.c
148
if (n > 40) {
lib/libc/stdlib/qsort.c
149
s = (n / 8) * es;
lib/libc/stdlib/qsort.c
158
pc = pd = a + (n - 1) * es;
lib/libc/stdlib/qsort.c
181
pn = a + n * es;
lib/libc/stdlib/qsort.c
200
n = s / es;
lib/libc/stdlib/qsort.c
210
n = r / es;
lib/libc/stdlib/qsort.c
217
qsort(void *a, size_t n, size_t es, int (*cmp)(const void *, const void *))
lib/libc/stdlib/qsort.c
223
for (i = n; i > 0; i >>= 1)
lib/libc/stdlib/qsort.c
234
introsort(a, n, es, maxdepth, swaptype, cmp);
lib/libc/stdlib/qsort.c
66
#define swapcode(TYPE, parmi, parmj, n) { \
lib/libc/stdlib/qsort.c
67
size_t i = (n) / sizeof (TYPE); \
lib/libc/stdlib/qsort.c
78
swapfunc(char *a, char *b, size_t n, int swaptype)
lib/libc/stdlib/qsort.c
83
swapcode(int, a, b, n);
lib/libc/stdlib/qsort.c
87
swapcode(long, a, b, n);
lib/libc/stdlib/qsort.c
90
swapcode(char, a, b, n);
lib/libc/stdlib/radixsort.c
104
if (n < THRESHOLD)
lib/libc/stdlib/radixsort.c
105
simplesort(a, n, 0, tr, endch);
lib/libc/stdlib/radixsort.c
107
if ((ta = calloc(n, sizeof(a))) == NULL)
lib/libc/stdlib/radixsort.c
109
r_sort_b(a, ta, n, 0, tr, endch);
lib/libc/stdlib/radixsort.c
116
#define pop(a, n, i) a = (--sp)->sa, n = sp->sn, i = sp->si
lib/libc/stdlib/radixsort.c
117
#define push(a, n, i) sp->sa = a, sp->sn = n, (sp++)->si = i
lib/libc/stdlib/radixsort.c
122
r_sort_a(const u_char **a, int n, int i, const u_char *tr, u_int endch)
lib/libc/stdlib/radixsort.c
133
push(a, n, i);
lib/libc/stdlib/radixsort.c
135
pop(a, n, i);
lib/libc/stdlib/radixsort.c
136
if (n < THRESHOLD) {
lib/libc/stdlib/radixsort.c
137
simplesort(a, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
140
an = a + n;
lib/libc/stdlib/radixsort.c
154
r_sort_a(a, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
209
r_sort_b(const u_char **a, const u_char **ta, int n, int i, const u_char *tr,
lib/libc/stdlib/radixsort.c
220
push(a, n, i);
lib/libc/stdlib/radixsort.c
222
pop(a, n, i);
lib/libc/stdlib/radixsort.c
223
if (n < THRESHOLD) {
lib/libc/stdlib/radixsort.c
224
simplesort(a, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
230
for (ak = a + n; --ak >= a;) {
lib/libc/stdlib/radixsort.c
239
r_sort_b(a, ta, n, i, tr, endch);
lib/libc/stdlib/radixsort.c
251
top[255] = a + n;
lib/libc/stdlib/radixsort.c
270
for (ak = ta + n, ai = a+n; ak > ta;) /* Copy to temp. */
lib/libc/stdlib/radixsort.c
272
for (ak = ta+n; --ak >= ta;) /* Deal to piles. */
lib/libc/stdlib/radixsort.c
278
simplesort(const u_char **a, int n, int b, const u_char *tr, u_int endch)
lib/libc/stdlib/radixsort.c
284
for (ak = a+1; --n >= 1; ak++)
lib/libc/stdlib/radixsort.c
85
radixsort(const u_char **a, int n, const u_char *tab, u_int endch)
lib/libc/stdlib/radixsort.c
92
r_sort_a(a, n, 0, tr, endch);
lib/libc/stdlib/radixsort.c
97
sradixsort(const u_char **a, int n, const u_char *tab, u_int endch)
lib/libc/stdlib/random.c
268
initstate(u_int seed, char *arg_state, size_t n)
lib/libc/stdlib/random.c
278
if (n < BREAK_0) {
lib/libc/stdlib/random.c
282
if (n < BREAK_1) {
lib/libc/stdlib/random.c
286
} else if (n < BREAK_2) {
lib/libc/stdlib/random.c
290
} else if (n < BREAK_3) {
lib/libc/stdlib/random.c
294
} else if (n < BREAK_4) {
lib/libc/string/memccpy.c
35
memccpy(void *t, const void *f, int c, size_t n)
lib/libc/string/memccpy.c
38
if (n) {
lib/libc/string/memccpy.c
45
} while (--n != 0);
lib/libc/string/memchr.c
37
memchr(const void *s, int c, size_t n)
lib/libc/string/memchr.c
39
if (n != 0) {
lib/libc/string/memchr.c
45
} while (--n != 0);
lib/libc/string/memcmp.c
40
memcmp(const void *s1, const void *s2, size_t n)
lib/libc/string/memcmp.c
42
if (n != 0) {
lib/libc/string/memcmp.c
48
} while (--n != 0);
lib/libc/string/memmem.c
103
if (n[ip+k] == n[jp+k]) {
lib/libc/string/memmem.c
108
} else if (n[ip+k] < n[jp+k]) {
lib/libc/string/memmem.c
121
if (memcmp(n, n+p, ms+1)) {
lib/libc/string/memmem.c
148
for (k=MAX(ms+1,mem); k<l && n[k] == h[k]; k++);
lib/libc/string/memmem.c
155
for (k=ms+1; k>mem && n[k-1] == h[k-1]; k--);
lib/libc/string/memmem.c
165
const unsigned char *h = h0, *n = n0;
lib/libc/string/memmem.c
174
h = memchr(h0, *n, k);
lib/libc/string/memmem.c
178
if (l==2) return twobyte_memmem(h, k, n);
lib/libc/string/memmem.c
179
if (l==3) return threebyte_memmem(h, k, n);
lib/libc/string/memmem.c
180
if (l==4) return fourbyte_memmem(h, k, n);
lib/libc/string/memmem.c
182
return twoway_memmem(h, h+k, n, l);
lib/libc/string/memmem.c
30
twobyte_memmem(const unsigned char *h, size_t k, const unsigned char *n)
lib/libc/string/memmem.c
32
uint16_t nw = n[0]<<8 | n[1], hw = h[0]<<8 | h[1];
lib/libc/string/memmem.c
39
threebyte_memmem(const unsigned char *h, size_t k, const unsigned char *n)
lib/libc/string/memmem.c
41
uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8;
lib/libc/string/memmem.c
49
fourbyte_memmem(const unsigned char *h, size_t k, const unsigned char *n)
lib/libc/string/memmem.c
51
uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8 | n[3];
lib/libc/string/memmem.c
70
const unsigned char *n, size_t l)
lib/libc/string/memmem.c
78
BITOP(byteset, n[i], |=), shift[n[i]] = i+1;
lib/libc/string/memmem.c
83
if (n[ip+k] == n[jp+k]) {
lib/libc/string/memmem.c
88
} else if (n[ip+k] > n[jp+k]) {
lib/libc/string/memrchr.c
26
memrchr(const void *s, int c, size_t n)
lib/libc/string/memrchr.c
30
if (n != 0) {
lib/libc/string/memrchr.c
31
cp = (unsigned char *)s + n;
lib/libc/string/memrchr.c
35
} while (--n != 0);
lib/libc/string/memset.c
37
memset(void *dst, int c, size_t n)
lib/libc/string/memset.c
39
if (n != 0) {
lib/libc/string/memset.c
44
while (--n != 0);
lib/libc/string/stpncpy.c
38
stpncpy(char *dst, const char *src, size_t n)
lib/libc/string/stpncpy.c
40
if (n != 0) {
lib/libc/string/stpncpy.c
44
dst = &dst[n];
lib/libc/string/stpncpy.c
49
while (--n != 0)
lib/libc/string/stpncpy.c
53
} while (--n != 0);
lib/libc/string/strcasecmp.c
103
} while (--n != 0);
lib/libc/string/strcasecmp.c
91
strncasecmp(const char *s1, const char *s2, size_t n)
lib/libc/string/strcasecmp.c
93
if (n != 0) {
lib/libc/string/strcasecmp_l.c
17
strncasecmp_l(const char *s1, const char *s2, size_t n,
lib/libc/string/strcasecmp_l.c
20
return strncasecmp(s1, s2, n);
lib/libc/string/strlcat.c
34
size_t n = dsize;
lib/libc/string/strlcat.c
38
while (n-- != 0 && *dst != '\0')
lib/libc/string/strlcat.c
41
n = dsize - dlen;
lib/libc/string/strlcat.c
43
if (n-- == 0)
lib/libc/string/strlcat.c
46
if (n != 0) {
lib/libc/string/strlcat.c
48
n--;
lib/libc/string/strncat.c
41
strncat(char *dst, const char *src, size_t n)
lib/libc/string/strncat.c
43
if (n != 0) {
lib/libc/string/strncat.c
53
} while (--n != 0);
lib/libc/string/strncmp.c
35
strncmp(const char *s1, const char *s2, size_t n)
lib/libc/string/strncmp.c
38
if (n == 0)
lib/libc/string/strncmp.c
45
} while (--n != 0);
lib/libc/string/strncpy.c
42
strncpy(char *dst, const char *src, size_t n)
lib/libc/string/strncpy.c
44
if (n != 0) {
lib/libc/string/strncpy.c
51
while (--n != 0)
lib/libc/string/strncpy.c
55
} while (--n != 0);
lib/libc/string/strstr.c
101
if (n[ip+k] == n[jp+k]) {
lib/libc/string/strstr.c
106
} else if (n[ip+k] < n[jp+k]) {
lib/libc/string/strstr.c
119
if (memcmp(n, n+p, ms+1)) {
lib/libc/string/strstr.c
157
for (k=MAX(ms+1,mem); n[k] && n[k] == h[k]; k++);
lib/libc/string/strstr.c
158
if (n[k]) {
lib/libc/string/strstr.c
164
for (k=ms+1; k>mem && n[k-1] == h[k-1]; k--);
lib/libc/string/strstr.c
172
strstr(const char *h, const char *n)
lib/libc/string/strstr.c
175
if (!n[0]) return (char *)h;
lib/libc/string/strstr.c
178
h = strchr(h, *n);
lib/libc/string/strstr.c
179
if (!h || !n[1]) return (char *)h;
lib/libc/string/strstr.c
181
if (!n[2]) return twobyte_strstr((void *)h, (void *)n);
lib/libc/string/strstr.c
183
if (!n[3]) return threebyte_strstr((void *)h, (void *)n);
lib/libc/string/strstr.c
185
if (!n[4]) return fourbyte_strstr((void *)h, (void *)n);
lib/libc/string/strstr.c
187
return twoway_strstr((void *)h, (void *)n);
lib/libc/string/strstr.c
30
twobyte_strstr(const unsigned char *h, const unsigned char *n)
lib/libc/string/strstr.c
32
uint16_t nw = n[0]<<8 | n[1], hw = h[0]<<8 | h[1];
lib/libc/string/strstr.c
38
threebyte_strstr(const unsigned char *h, const unsigned char *n)
lib/libc/string/strstr.c
40
uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8;
lib/libc/string/strstr.c
47
fourbyte_strstr(const unsigned char *h, const unsigned char *n)
lib/libc/string/strstr.c
49
uint32_t nw = n[0]<<24 | n[1]<<16 | n[2]<<8 | n[3];
lib/libc/string/strstr.c
66
twoway_strstr(const unsigned char *h, const unsigned char *n)
lib/libc/string/strstr.c
74
for (l=0; n[l] && h[l]; l++)
lib/libc/string/strstr.c
75
BITOP(byteset, n[l], |=), shift[n[l]] = l+1;
lib/libc/string/strstr.c
76
if (n[l]) return 0; /* hit the end of h */
lib/libc/string/strstr.c
81
if (n[ip+k] == n[jp+k]) {
lib/libc/string/strstr.c
86
} else if (n[ip+k] > n[jp+k]) {
lib/libc/string/strxfrm.c
42
strxfrm(char *dst, const char *src, size_t n)
lib/libc/string/strxfrm.c
48
if (n == 0)
lib/libc/string/strxfrm.c
50
return (strlcpy(dst, src, n));
lib/libc/string/strxfrm_l.c
10
strxfrm_l(char *dst, const char *src, size_t n,
lib/libc/string/strxfrm_l.c
13
return strxfrm(dst, src, 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/wcscasecmp.c
47
wcsncasecmp(const wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wcscasecmp.c
51
if (n == 0)
lib/libc/string/wcscasecmp.c
60
} while (--n != 0);
lib/libc/string/wcscasecmp_l.c
47
wcsncasecmp_l(const wchar_t *s1, const wchar_t *s2, size_t n, locale_t locale)
lib/libc/string/wcscasecmp_l.c
51
if (n == 0)
lib/libc/string/wcscasecmp_l.c
61
} while (--n != 0);
lib/libc/string/wcslcat.c
34
size_t n = dsize;
lib/libc/string/wcslcat.c
38
while (n-- != 0 && *dst != L'\0')
lib/libc/string/wcslcat.c
41
n = dsize - dlen;
lib/libc/string/wcslcat.c
43
if (n-- == 0)
lib/libc/string/wcslcat.c
46
if (n != 0) {
lib/libc/string/wcslcat.c
48
n--;
lib/libc/string/wcsncat.c
35
wcsncat(wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wcsncat.c
46
while (*r && n) {
lib/libc/string/wcsncat.c
48
n--;
lib/libc/string/wcsncmp.c
37
wcsncmp(const wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wcsncmp.c
40
if (n == 0)
lib/libc/string/wcsncmp.c
50
} while (--n != 0);
lib/libc/string/wcsncpy.c
35
wcsncpy(wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wcsncpy.c
40
while (n && *s2) {
lib/libc/string/wcsncpy.c
42
n--;
lib/libc/string/wcsncpy.c
44
while (n) {
lib/libc/string/wcsncpy.c
46
n--;
lib/libc/string/wcswidth.c
35
wcswidth(const wchar_t *s, size_t n)
lib/libc/string/wcswidth.c
40
while (n && *s) {
lib/libc/string/wcswidth.c
46
n--;
lib/libc/string/wmemchr.c
35
wmemchr(const wchar_t *s, wchar_t c, size_t n)
lib/libc/string/wmemchr.c
39
for (i = 0; i < n; i++) {
lib/libc/string/wmemcmp.c
36
wmemcmp(const wchar_t *s1, const wchar_t *s2, size_t n)
lib/libc/string/wmemcmp.c
40
for (i = 0; i < n; i++) {
lib/libc/string/wmemcpy.c
36
wmemcpy(wchar_t *d, const wchar_t *s, size_t n)
lib/libc/string/wmemcpy.c
39
return (wchar_t *)memcpy(d, s, n * sizeof(wchar_t));
lib/libc/string/wmemmove.c
36
wmemmove(wchar_t *d, const wchar_t *s, size_t n)
lib/libc/string/wmemmove.c
39
return (wchar_t *)memmove(d, s, n * sizeof(wchar_t));
lib/libc/string/wmemset.c
35
wmemset(wchar_t *s, wchar_t c, size_t n)
lib/libc/string/wmemset.c
41
for (i = 0; i < n; i++) {
lib/libc/thread/rthread_libc.c
156
#define MALLOC_LOCK_INITIALIZER(n) { \
lib/libc/thread/rthread_libc.c
158
TAILQ_HEAD_INITIALIZER(malloc_lock[n].lockers), \
lib/libc/thread/rthread_libc.c
164
#define MALLOC_LOCK_INITIALIZER(n) { \
lib/libc/thread/synch.h
23
_wake(volatile uint32_t *p, int n)
lib/libc/thread/synch.h
25
return futex(p, FUTEX_WAKE_PRIVATE, n, NULL, NULL);
lib/libc/thread/synch.h
60
_requeue(volatile uint32_t *p, int n, int m, volatile uint32_t *q)
lib/libc/thread/synch.h
62
return futex(p, FUTEX_REQUEUE_PRIVATE, n, (void *)(long)m, q);
lib/libc/time/strftime.c
498
_conv(int n, const char *format, char *pt, const char *ptlim)
lib/libc/time/strftime.c
502
(void) snprintf(buf, sizeof buf, format, n);
lib/libc/time/wcsftime.c
492
_conv(int n, const wchar_t *format, wchar_t *pt, const wchar_t *ptlim)
lib/libc/time/wcsftime.c
496
(void) swprintf(buf, sizeof buf/sizeof buf[0], format, n);
lib/libc/uuid/uuid_from_string.c
100
if ((n & 0x80) != 0x00 && /* variant 0? */
lib/libc/uuid/uuid_from_string.c
101
(n & 0xc0) != 0x80 && /* variant 1? */
lib/libc/uuid/uuid_from_string.c
102
(n & 0xe0) != 0xc0) { /* variant 2? */
lib/libc/uuid/uuid_from_string.c
50
int n;
lib/libc/uuid/uuid_from_string.c
72
for (n = 0; n < UUID_STR_LEN; n++) {
lib/libc/uuid/uuid_from_string.c
73
switch (n) {
lib/libc/uuid/uuid_from_string.c
78
if (s[n] != '-')
lib/libc/uuid/uuid_from_string.c
82
if (!isxdigit((unsigned char)(s[n])))
lib/libc/uuid/uuid_from_string.c
88
n = sscanf(s,
lib/libc/uuid/uuid_from_string.c
95
if (n != 11)
lib/libc/uuid/uuid_from_string.c
99
n = u->clock_seq_hi_and_reserved;
lib/libcrypto/aes/aes.c
368
size_t n;
lib/libcrypto/aes/aes.c
383
for (n = 0; n < N_WORDS; ++n)
lib/libcrypto/aes/aes.c
384
tmp2.data[n] = tmp.data[n] ^ iv.data[n];
lib/libcrypto/aes/aes.c
387
for (n = 0; n < N_WORDS; ++n)
lib/libcrypto/aes/aes.c
388
tmp2.data[n] ^= iv2.data[n];
lib/libcrypto/aes/aes.c
400
for (n = 0; n < N_WORDS; ++n)
lib/libcrypto/aes/aes.c
401
tmp.data[n] ^= iv2.data[n];
lib/libcrypto/aes/aes.c
404
for (n = 0; n < N_WORDS; ++n)
lib/libcrypto/aes/aes.c
405
tmp.data[n] ^= iv.data[n];
lib/libcrypto/asn1/a_bitstr.c
154
ASN1_BIT_STRING_set_bit(ASN1_BIT_STRING *a, int n, int value)
lib/libcrypto/asn1/a_bitstr.c
161
if (n < 0)
lib/libcrypto/asn1/a_bitstr.c
164
w = n / 8;
lib/libcrypto/asn1/a_bitstr.c
165
v = 1 << (7 - (n & 0x07));
lib/libcrypto/asn1/a_bitstr.c
194
ASN1_BIT_STRING_get_bit(const ASN1_BIT_STRING *a, int n)
lib/libcrypto/asn1/a_bitstr.c
200
if (n < 0)
lib/libcrypto/asn1/a_bitstr.c
203
w = n / 8;
lib/libcrypto/asn1/a_bitstr.c
204
v = 1 << (7 - (n & 0x07));
lib/libcrypto/asn1/a_enum.c
235
int i, n = 0;
lib/libcrypto/asn1/a_enum.c
245
n = 2;
lib/libcrypto/asn1/a_enum.c
251
n += 2;
lib/libcrypto/asn1/a_enum.c
257
n += 2;
lib/libcrypto/asn1/a_enum.c
260
return (n);
lib/libcrypto/asn1/a_enum.c
271
int i, j,k, m,n, again, bufsize;
lib/libcrypto/asn1/a_enum.c
325
for (n = 0; n < 2; n++) {
lib/libcrypto/asn1/a_enum.c
326
m = bufp[k + n];
lib/libcrypto/asn1/a_int.c
400
int i, n = 0;
lib/libcrypto/asn1/a_int.c
410
n = 1;
lib/libcrypto/asn1/a_int.c
416
n += 2;
lib/libcrypto/asn1/a_int.c
422
n += 2;
lib/libcrypto/asn1/a_int.c
428
n += 2;
lib/libcrypto/asn1/a_int.c
431
return (n);
lib/libcrypto/asn1/a_int.c
442
int i, j,k, m,n, again, bufsize;
lib/libcrypto/asn1/a_int.c
494
for (n = 0; n < 2; n++) {
lib/libcrypto/asn1/a_int.c
495
m = bufp[k + n];
lib/libcrypto/asn1/a_object.c
178
int n;
lib/libcrypto/asn1/a_object.c
182
n = snprintf(s, sizeof(s), fmt, (unsigned long long)arc);
lib/libcrypto/asn1/a_object.c
183
if (n < 0 || (size_t)n >= sizeof(s))
lib/libcrypto/asn1/a_object.c
185
if (!CBB_add_bytes(cbb, s, n))
lib/libcrypto/asn1/a_strex.c
429
do_name_ex(char_io *io_ch, void *arg, const X509_NAME *n, int indent,
lib/libcrypto/asn1/a_strex.c
495
cnt = X509_NAME_entry_count(n);
lib/libcrypto/asn1/a_strex.c
498
ent = X509_NAME_get_entry(n, cnt - i - 1);
lib/libcrypto/asn1/a_strex.c
500
ent = X509_NAME_get_entry(n, i);
lib/libcrypto/asn1/a_string.c
251
int i, n;
lib/libcrypto/asn1/a_string.c
258
n = 0;
lib/libcrypto/asn1/a_string.c
263
buf[n] = '.';
lib/libcrypto/asn1/a_string.c
265
buf[n] = p[i];
lib/libcrypto/asn1/a_string.c
266
n++;
lib/libcrypto/asn1/a_string.c
267
if (n >= 80) {
lib/libcrypto/asn1/a_string.c
268
if (BIO_write(bp, buf, n) <= 0)
lib/libcrypto/asn1/a_string.c
270
n = 0;
lib/libcrypto/asn1/a_string.c
273
if (n > 0) {
lib/libcrypto/asn1/a_string.c
274
if (BIO_write(bp, buf, n) <= 0)
lib/libcrypto/asn1/a_string.c
328
int i, n = 0;
lib/libcrypto/asn1/a_string.c
338
n = 1;
lib/libcrypto/asn1/a_string.c
344
n += 2;
lib/libcrypto/asn1/a_string.c
350
n += 2;
lib/libcrypto/asn1/a_string.c
353
return n;
lib/libcrypto/asn1/a_string.c
364
int i, j, k, m, n, again, bufsize;
lib/libcrypto/asn1/a_string.c
416
for (n = 0; n < 2; n++) {
lib/libcrypto/asn1/a_string.c
417
m = bufp[k + n];
lib/libcrypto/asn1/asn1.h
537
void ASN1_STRING_length_set(ASN1_STRING *x, int n);
lib/libcrypto/asn1/asn1.h
548
int ASN1_BIT_STRING_set_bit(ASN1_BIT_STRING *a, int n, int value);
lib/libcrypto/asn1/asn1.h
549
int ASN1_BIT_STRING_get_bit(const ASN1_BIT_STRING *a, int n);
lib/libcrypto/asn1/asn1_item.c
658
int i, j = 0, n, ret = 1;
lib/libcrypto/asn1/asn1_item.c
660
n = ASN1_item_i2d(x, &b, it);
lib/libcrypto/asn1/asn1_item.c
667
i = BIO_write(out, &(b[j]), n);
lib/libcrypto/asn1/asn1_item.c
668
if (i == n)
lib/libcrypto/asn1/asn1_item.c
675
n -= i;
lib/libcrypto/asn1/asn1_old.c
157
int i, j = 0, n, ret = 1;
lib/libcrypto/asn1/asn1_old.c
159
n = i2d(x, NULL);
lib/libcrypto/asn1/asn1_old.c
160
b = malloc(n);
lib/libcrypto/asn1/asn1_old.c
170
i = BIO_write(out, &(b[j]), n);
lib/libcrypto/asn1/asn1_old.c
171
if (i == n)
lib/libcrypto/asn1/asn1_old.c
178
n -= i;
lib/libcrypto/asn1/t_spki.c
105
n = spki->signature->length;
lib/libcrypto/asn1/t_spki.c
107
for (i = 0; i < n; i++) {
lib/libcrypto/asn1/t_spki.c
111
((i + 1) == n) ? "" : ":");
lib/libcrypto/asn1/t_spki.c
83
int i, n;
lib/libcrypto/asn1/t_x509.c
348
int i, n;
lib/libcrypto/asn1/t_x509.c
350
n = sig->length;
lib/libcrypto/asn1/t_x509.c
352
for (i = 0; i < n; i++) {
lib/libcrypto/asn1/t_x509.c
360
((i + 1) == n) ? "" : ":") <= 0)
lib/libcrypto/bf/bf_local.h
65
#define n2ln(c,l1,l2,n) { \
lib/libcrypto/bf/bf_local.h
66
c+=n; \
lib/libcrypto/bf/bf_local.h
68
switch (n) { \
lib/libcrypto/bf/bf_local.h
81
#define l2nn(l1,l2,c,n) { \
lib/libcrypto/bf/bf_local.h
82
c+=n; \
lib/libcrypto/bf/bf_local.h
83
switch (n) { \
lib/libcrypto/bf/blowfish.c
516
int n= *num;
lib/libcrypto/bf/blowfish.c
524
if (n == 0) {
lib/libcrypto/bf/blowfish.c
537
c= *(in++)^iv[n];
lib/libcrypto/bf/blowfish.c
539
iv[n] = c;
lib/libcrypto/bf/blowfish.c
540
n = (n + 1)&0x07;
lib/libcrypto/bf/blowfish.c
544
if (n == 0) {
lib/libcrypto/bf/blowfish.c
558
c = iv[n];
lib/libcrypto/bf/blowfish.c
559
iv[n] = cc;
lib/libcrypto/bf/blowfish.c
561
n = (n + 1)&0x07;
lib/libcrypto/bf/blowfish.c
565
*num = n;
lib/libcrypto/bf/blowfish.c
601
int n= *num;
lib/libcrypto/bf/blowfish.c
618
if (n == 0) {
lib/libcrypto/bf/blowfish.c
627
*(out++)= *(in++)^d[n];
lib/libcrypto/bf/blowfish.c
628
n = (n + 1)&0x07;
lib/libcrypto/bf/blowfish.c
638
*num = n;
lib/libcrypto/bio/bf_nbio.c
137
unsigned char n;
lib/libcrypto/bio/bf_nbio.c
146
arc4random_buf(&n, 1);
lib/libcrypto/bio/bf_nbio.c
147
num = (n & 0x07);
lib/libcrypto/bio/bf_nbio.c
169
unsigned char n;
lib/libcrypto/bio/bf_nbio.c
183
arc4random_buf(&n, 1);
lib/libcrypto/bio/bf_nbio.c
184
num = (n&7);
lib/libcrypto/bio/bio.h
387
#define BIO_set_nbio(b,n) BIO_ctrl(b,BIO_C_SET_NBIO,(n),NULL)
lib/libcrypto/bio/bio.h
393
#define BIO_set_nbio_accept(b,n) BIO_ctrl(b,BIO_C_SET_ACCEPT,1,(n)?(void *)"a":NULL)
lib/libcrypto/bio/bss_acpt.c
435
int n, ret;
lib/libcrypto/bio/bss_acpt.c
437
n = strlen(str);
lib/libcrypto/bio/bss_acpt.c
438
ret = acpt_write(bp, str, n);
lib/libcrypto/bio/bss_conn.c
576
int n, ret;
lib/libcrypto/bio/bss_conn.c
578
n = strlen(str);
lib/libcrypto/bio/bss_conn.c
579
ret = conn_write(bp, str, n);
lib/libcrypto/bio/bss_dgram.c
627
int n, ret;
lib/libcrypto/bio/bss_dgram.c
629
n = strlen(str);
lib/libcrypto/bio/bss_dgram.c
630
ret = dgram_write(bp, str, n);
lib/libcrypto/bio/bss_fd.c
221
int n, ret;
lib/libcrypto/bio/bss_fd.c
223
n = strlen(str);
lib/libcrypto/bio/bss_fd.c
224
ret = fd_write(bp, str, n);
lib/libcrypto/bio/bss_file.c
317
int n, ret;
lib/libcrypto/bio/bss_file.c
319
n = strlen(str);
lib/libcrypto/bio/bss_file.c
320
ret = file_write(bp, str, n);
lib/libcrypto/bio/bss_sock.c
209
int n, ret;
lib/libcrypto/bio/bss_sock.c
211
n = strlen(str);
lib/libcrypto/bio/bss_sock.c
212
ret = sock_write(bp, str, n);
lib/libcrypto/bn/arch/aarch64/bn_arch.h
32
BN_ULONG n;
lib/libcrypto/bn/arch/aarch64/bn_arch.h
35
: [n]"=r"(n)
lib/libcrypto/bn/arch/aarch64/bn_arch.h
38
return n;
lib/libcrypto/bn/arch/amd64/bn_arch.c
38
bn_add_words(BN_ULONG *rd, const BN_ULONG *ad, const BN_ULONG *bd, int n)
lib/libcrypto/bn/arch/amd64/bn_arch.c
40
return bignum_add(n, (uint64_t *)rd, n, (const uint64_t *)ad, n,
lib/libcrypto/bn/arch/amd64/bn_arch.c
57
bn_sub_words(BN_ULONG *rd, const BN_ULONG *ad, const BN_ULONG *bd, int n)
lib/libcrypto/bn/arch/amd64/bn_arch.c
59
return bignum_sub(n, (uint64_t *)rd, n, (const uint64_t *)ad, n,
lib/libcrypto/bn/arch/amd64/bn_arch.c
67
const BN_ULONG *m, size_t n)
lib/libcrypto/bn/arch/amd64/bn_arch.c
69
bignum_modadd(n, (uint64_t *)r, (const uint64_t *)a,
lib/libcrypto/bn/arch/amd64/bn_arch.c
77
const BN_ULONG *m, size_t n)
lib/libcrypto/bn/arch/amd64/bn_arch.c
79
bignum_modsub(n, (uint64_t *)r, (const uint64_t *)a,
lib/libcrypto/bn/bn.h
164
void BN_set_flags(BIGNUM *b, int n);
lib/libcrypto/bn/bn.h
165
int BN_get_flags(const BIGNUM *b, int n);
lib/libcrypto/bn/bn.h
309
void BN_set_negative(BIGNUM *b, int n);
lib/libcrypto/bn/bn.h
327
int BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx);
lib/libcrypto/bn/bn.h
328
int BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m);
lib/libcrypto/bn/bn.h
340
int BN_is_bit_set(const BIGNUM *a, int n);
lib/libcrypto/bn/bn.h
341
int BN_lshift(BIGNUM *r, const BIGNUM *a, int n);
lib/libcrypto/bn/bn.h
352
int BN_mask_bits(BIGNUM *a, int n);
lib/libcrypto/bn/bn.h
355
int BN_rshift(BIGNUM *r, const BIGNUM *a, int n);
lib/libcrypto/bn/bn.h
360
int BN_set_bit(BIGNUM *a, int n);
lib/libcrypto/bn/bn.h
361
int BN_clear_bit(BIGNUM *a, int n);
lib/libcrypto/bn/bn.h
370
const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
lib/libcrypto/bn/bn.h
372
const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
lib/libcrypto/bn/bn_add_sub.c
100
while (n > 0) {
lib/libcrypto/bn/bn_add_sub.c
104
n--;
lib/libcrypto/bn/bn_add_sub.c
118
BN_ULONG mask, size_t n)
lib/libcrypto/bn/bn_add_sub.c
124
while (n >= 4) {
lib/libcrypto/bn/bn_add_sub.c
131
n -= 4;
lib/libcrypto/bn/bn_add_sub.c
133
while (n > 0) {
lib/libcrypto/bn/bn_add_sub.c
138
n--;
lib/libcrypto/bn/bn_add_sub.c
152
BN_ULONG mask, size_t n)
lib/libcrypto/bn/bn_add_sub.c
159
while (n >= 4) {
lib/libcrypto/bn/bn_add_sub.c
166
n -= 4;
lib/libcrypto/bn/bn_add_sub.c
168
while (n > 0) {
lib/libcrypto/bn/bn_add_sub.c
173
n--;
lib/libcrypto/bn/bn_add_sub.c
28
bn_add_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
lib/libcrypto/bn/bn_add_sub.c
32
while (n >= 4) {
lib/libcrypto/bn/bn_add_sub.c
38
n -= 4;
lib/libcrypto/bn/bn_add_sub.c
40
while (n > 0) {
lib/libcrypto/bn/bn_add_sub.c
45
n--;
lib/libcrypto/bn/bn_add_sub.c
59
bn_sub_words(BN_ULONG *r, const BN_ULONG *a, const BN_ULONG *b, int n)
lib/libcrypto/bn/bn_add_sub.c
63
while (n >= 4) {
lib/libcrypto/bn/bn_add_sub.c
69
n -= 4;
lib/libcrypto/bn/bn_add_sub.c
71
while (n > 0) {
lib/libcrypto/bn/bn_add_sub.c
76
n--;
lib/libcrypto/bn/bn_add_sub.c
88
bn_sub_words_borrow(const BN_ULONG *a, const BN_ULONG *b, size_t n)
lib/libcrypto/bn/bn_add_sub.c
93
while (n >= 4) {
lib/libcrypto/bn/bn_add_sub.c
98
n -= 4;
lib/libcrypto/bn/bn_bpsw.c
100
if (!bn_div_by_two_mod_odd_n(U, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
106
if (!bn_div_by_two_mod_odd_n(V, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
124
const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_bpsw.c
142
if (!bn_lucas_step(U, V, digit, D, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
159
bn_strong_lucas_test(int *is_pseudoprime, const BIGNUM *n, const BIGNUM *D,
lib/libcrypto/bn/bn_bpsw.c
181
while (BN_is_bit_set(n, s))
lib/libcrypto/bn/bn_bpsw.c
183
if (!BN_rshift(k, n, s))
lib/libcrypto/bn/bn_bpsw.c
193
if (!bn_lucas(U, V, k, D, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
207
if (!bn_lucas_step(U, V, 0, D, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
238
bn_strong_lucas_selfridge(int *is_pseudoprime, const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_bpsw.c
247
if (!bn_is_perfect_square(&is_perfect_square, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
272
if ((jacobi_symbol = BN_kronecker(D, n, ctx)) == -2)
lib/libcrypto/bn/bn_bpsw.c
291
if (!bn_strong_lucas_test(is_pseudoprime, n, D, ctx))
lib/libcrypto/bn/bn_bpsw.c
30
bn_div_by_two_mod_odd_n(BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_bpsw.c
32
if (!BN_is_odd(n))
lib/libcrypto/bn/bn_bpsw.c
321
bn_fermat(int *is_pseudoprime, const BIGNUM *n, const BIGNUM *n_minus_one,
lib/libcrypto/bn/bn_bpsw.c
337
if (!BN_mod_exp_mont_ct(power, base, k, n, ctx, mctx))
lib/libcrypto/bn/bn_bpsw.c
347
if (!BN_mod_sqr(power, power, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
36
if (!BN_add(a, a, n))
lib/libcrypto/bn/bn_bpsw.c
384
bn_miller_rabin(int *is_pseudoprime, const BIGNUM *n, BN_CTX *ctx,
lib/libcrypto/bn/bn_bpsw.c
402
if (BN_is_word(n, 2) || BN_is_word(n, 3)) {
lib/libcrypto/bn/bn_bpsw.c
407
if (BN_cmp(n, BN_value_one()) <= 0 || !BN_is_odd(n)) {
lib/libcrypto/bn/bn_bpsw.c
41
if (!BN_mod_ct(a, a, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
412
if (!BN_sub(n_minus_one, n, BN_value_one()))
lib/libcrypto/bn/bn_bpsw.c
429
if ((mctx = BN_MONT_CTX_create(n, ctx)) == NULL)
lib/libcrypto/bn/bn_bpsw.c
439
if (!bn_fermat(is_pseudoprime, n, n_minus_one, k, s, base, ctx, mctx))
lib/libcrypto/bn/bn_bpsw.c
453
if (!bn_fermat(is_pseudoprime, n, n_minus_one, k, s, base, ctx,
lib/libcrypto/bn/bn_bpsw.c
482
bn_is_prime_bpsw(int *is_pseudoprime, const BIGNUM *n, BN_CTX *in_ctx,
lib/libcrypto/bn/bn_bpsw.c
490
if (BN_is_word(n, 2)) {
lib/libcrypto/bn/bn_bpsw.c
495
if (BN_cmp(n, BN_value_one()) <= 0 || !BN_is_odd(n)) {
lib/libcrypto/bn/bn_bpsw.c
502
if ((mod = BN_mod_word(n, primes[i])) == (BN_ULONG)-1)
lib/libcrypto/bn/bn_bpsw.c
505
*is_pseudoprime = BN_is_word(n, primes[i]);
lib/libcrypto/bn/bn_bpsw.c
515
if (!bn_miller_rabin(is_pseudoprime, n, ctx, rounds))
lib/libcrypto/bn/bn_bpsw.c
520
if (!bn_strong_lucas_selfridge(is_pseudoprime, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
64
const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_bpsw.c
81
if (!BN_mod_mul(U, U, V, n, ctx))
lib/libcrypto/bn/bn_bpsw.c
89
if (!bn_div_by_two_mod_odd_n(V, n, ctx))
lib/libcrypto/bn/bn_convert.c
100
if (out_len < n)
lib/libcrypto/bn/bn_convert.c
728
BN_mpi2bn(const unsigned char *d, int n, BIGNUM *bn_in)
lib/libcrypto/bn/bn_convert.c
736
if (n < 0)
lib/libcrypto/bn/bn_convert.c
739
CBS_init(&cbs, d, n);
lib/libcrypto/bn/bn_convert.c
94
int b, n;
lib/libcrypto/bn/bn_convert.c
96
n = BN_num_bytes(bn);
lib/libcrypto/bn/bn_convert.c
99
out_len = n;
lib/libcrypto/bn/bn_gcd.c
204
BN_gcd_no_branch(BIGNUM *in, const BIGNUM *a, const BIGNUM *n,
lib/libcrypto/bn/bn_gcd.c
241
if (!bn_copy(A, n))
lib/libcrypto/bn/bn_gcd.c
354
BN_mod_inverse_no_branch(BIGNUM *in, const BIGNUM *a, const BIGNUM *n,
lib/libcrypto/bn/bn_gcd.c
394
if (!bn_copy(A, n))
lib/libcrypto/bn/bn_gcd.c
489
if (!BN_sub(Y, n, Y))
lib/libcrypto/bn/bn_gcd.c
499
if (!BN_nnmod(Y, Y, n, ctx))
lib/libcrypto/bn/bn_gcd.c
515
BN_mod_inverse_internal(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
lib/libcrypto/bn/bn_gcd.c
523
return BN_mod_inverse_no_branch(in, a, n, ctx);
lib/libcrypto/bn/bn_gcd.c
553
if (!bn_copy(A, n))
lib/libcrypto/bn/bn_gcd.c
568
if (BN_is_odd(n) && (BN_num_bits(n) <= (BN_BITS <= 32 ? 450 : 2048))) {
lib/libcrypto/bn/bn_gcd.c
592
if (!BN_uadd(X, X, n))
lib/libcrypto/bn/bn_gcd.c
611
if (!BN_uadd(Y, Y, n))
lib/libcrypto/bn/bn_gcd.c
776
if (!BN_sub(Y, n, Y))
lib/libcrypto/bn/bn_gcd.c
786
if (!BN_nnmod(Y, Y, n, ctx))
lib/libcrypto/bn/bn_gcd.c
801
BN_mod_inverse(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_gcd.c
804
(BN_get_flags(n, BN_FLG_CONSTTIME) != 0));
lib/libcrypto/bn/bn_gcd.c
805
return BN_mod_inverse_internal(in, a, n, ctx, ct);
lib/libcrypto/bn/bn_gcd.c
810
BN_mod_inverse_nonct(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_gcd.c
812
return BN_mod_inverse_internal(in, a, n, ctx, 0);
lib/libcrypto/bn/bn_gcd.c
816
BN_mod_inverse_ct(BIGNUM *in, const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_gcd.c
818
return BN_mod_inverse_internal(in, a, n, ctx, 1);
lib/libcrypto/bn/bn_internal.h
34
BN_ULONG bn_sub_words_borrow(const BN_ULONG *a, const BN_ULONG *b, size_t n);
lib/libcrypto/bn/bn_internal.h
36
BN_ULONG mask, size_t n);
lib/libcrypto/bn/bn_internal.h
38
BN_ULONG mask, size_t n);
lib/libcrypto/bn/bn_internal.h
40
const BN_ULONG *m, size_t n);
lib/libcrypto/bn/bn_internal.h
42
const BN_ULONG *m, size_t n);
lib/libcrypto/bn/bn_internal.h
44
const BN_ULONG *m, BN_ULONG *t, BN_ULONG m0, size_t n);
lib/libcrypto/bn/bn_internal.h
46
BN_ULONG *t, BN_ULONG m0, size_t n);
lib/libcrypto/bn/bn_internal.h
51
void bn_montgomery_reduce_words(BN_ULONG *r, BN_ULONG *a, const BN_ULONG *n,
lib/libcrypto/bn/bn_isqrt.c
107
if (!BN_rshift(b, n, 2 * c - d - e + 1))
lib/libcrypto/bn/bn_isqrt.c
130
if ((cmp = BN_cmp(b, n)) > 0) {
lib/libcrypto/bn/bn_isqrt.c
200
bn_is_perfect_square(int *out_perfect, const BIGNUM *n, BN_CTX *ctx)
lib/libcrypto/bn/bn_isqrt.c
206
if (BN_is_negative(n))
lib/libcrypto/bn/bn_isqrt.c
220
r = BN_lsw(n) & 0x3f;
lib/libcrypto/bn/bn_isqrt.c
225
if ((r = BN_mod_word(n, 11 * 63 * 65)) == (BN_ULONG)-1)
lib/libcrypto/bn/bn_isqrt.c
233
return bn_isqrt(NULL, out_perfect, n, ctx);
lib/libcrypto/bn/bn_isqrt.c
43
bn_isqrt(BIGNUM *out_sqrt, int *out_perfect, const BIGNUM *n, BN_CTX *in_ctx)
lib/libcrypto/bn/bn_isqrt.c
56
if (BN_is_negative(n)) {
lib/libcrypto/bn/bn_isqrt.c
73
if (BN_is_zero(n)) {
lib/libcrypto/bn/bn_isqrt.c
82
c = (BN_num_bits(n) - 1) / 2;
lib/libcrypto/bn/bn_lib.c
127
BN_set_flags(BIGNUM *b, int n)
lib/libcrypto/bn/bn_lib.c
129
b->flags |= n;
lib/libcrypto/bn/bn_lib.c
134
BN_get_flags(const BIGNUM *b, int n)
lib/libcrypto/bn/bn_lib.c
136
return b->flags & n;
lib/libcrypto/bn/bn_lib.c
278
bn_copy_words(BN_ULONG *ap, const BN_ULONG *bp, int n)
lib/libcrypto/bn/bn_lib.c
280
while (n > 0) {
lib/libcrypto/bn/bn_lib.c
284
n--;
lib/libcrypto/bn/bn_lib.c
413
BN_set_bit(BIGNUM *a, int n)
lib/libcrypto/bn/bn_lib.c
417
if (n < 0)
lib/libcrypto/bn/bn_lib.c
420
i = n / BN_BITS2;
lib/libcrypto/bn/bn_lib.c
421
j = n % BN_BITS2;
lib/libcrypto/bn/bn_lib.c
436
BN_clear_bit(BIGNUM *a, int n)
lib/libcrypto/bn/bn_lib.c
440
if (n < 0)
lib/libcrypto/bn/bn_lib.c
443
i = n / BN_BITS2;
lib/libcrypto/bn/bn_lib.c
444
j = n % BN_BITS2;
lib/libcrypto/bn/bn_lib.c
458
BN_is_bit_set(const BIGNUM *a, int n)
lib/libcrypto/bn/bn_lib.c
462
if (n < 0)
lib/libcrypto/bn/bn_lib.c
464
i = n / BN_BITS2;
lib/libcrypto/bn/bn_lib.c
465
j = n % BN_BITS2;
lib/libcrypto/bn/bn_lib.c
473
BN_mask_bits(BIGNUM *a, int n)
lib/libcrypto/bn/bn_lib.c
477
if (n < 0)
lib/libcrypto/bn/bn_lib.c
480
w = n / BN_BITS2;
lib/libcrypto/bn/bn_lib.c
481
b = n % BN_BITS2;
lib/libcrypto/bn/bn_local.h
249
#define BN_lsw(n) (((n)->top == 0) ? (BN_ULONG) 0 : (n)->d[0])
lib/libcrypto/bn/bn_local.h
309
int BN_div_nonct(BIGNUM *q, BIGNUM *r, const BIGNUM *n, const BIGNUM *d,
lib/libcrypto/bn/bn_local.h
311
int BN_div_ct(BIGNUM *q, BIGNUM *r, const BIGNUM *n, const BIGNUM *d,
lib/libcrypto/bn/bn_local.h
325
BIGNUM *BN_mod_inverse_ct(BIGNUM *ret, const BIGNUM *a, const BIGNUM *n,
lib/libcrypto/bn/bn_local.h
327
BIGNUM *BN_mod_inverse_nonct(BIGNUM *ret, const BIGNUM *a, const BIGNUM *n,
lib/libcrypto/bn/bn_local.h
335
int bn_isqrt(BIGNUM *out_sqrt, int *out_perfect, const BIGNUM *n, BN_CTX *ctx);
lib/libcrypto/bn/bn_local.h
336
int bn_is_perfect_square(int *out_perfect, const BIGNUM *n, BN_CTX *ctx);
lib/libcrypto/bn/bn_local.h
338
int bn_is_prime_bpsw(int *is_prime, const BIGNUM *n, BN_CTX *ctx, size_t rounds);
lib/libcrypto/bn/bn_mod.c
295
BN_mod_lshift(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m, BN_CTX *ctx)
lib/libcrypto/bn/bn_mod.c
318
if (!BN_mod_lshift_quick(r, r, n, m))
lib/libcrypto/bn/bn_mod.c
334
BN_mod_lshift_quick(BIGNUM *r, const BIGNUM *a, int n, const BIGNUM *m)
lib/libcrypto/bn/bn_mod.c
346
while (n > 0) {
lib/libcrypto/bn/bn_mod.c
353
if (max_shift > n)
lib/libcrypto/bn/bn_mod.c
354
max_shift = n;
lib/libcrypto/bn/bn_mod.c
358
n -= max_shift;
lib/libcrypto/bn/bn_mod_sqrt.c
115
BIGNUM *n;
lib/libcrypto/bn/bn_mod_sqrt.c
120
if ((n = BN_CTX_get(ctx)) == NULL)
lib/libcrypto/bn/bn_mod_sqrt.c
124
if (!BN_uadd(n, p, BN_value_one()))
lib/libcrypto/bn/bn_mod_sqrt.c
126
if (!BN_rshift(n, n, 2))
lib/libcrypto/bn/bn_mod_sqrt.c
130
if (!BN_mod_exp_ct(out_sqrt, a, n, p, ctx))
lib/libcrypto/bn/bn_mod_sqrt.c
149
BIGNUM *b, *i, *n, *tmp;
lib/libcrypto/bn/bn_mod_sqrt.c
158
if ((n = BN_CTX_get(ctx)) == NULL)
lib/libcrypto/bn/bn_mod_sqrt.c
164
if (!BN_rshift(n, p, 3))
lib/libcrypto/bn/bn_mod_sqrt.c
166
BN_set_negative(n, 0);
lib/libcrypto/bn/bn_mod_sqrt.c
173
if (!BN_mod_exp_ct(b, tmp, n, p, ctx))
lib/libcrypto/bn/bn_mod_sqrt.c
208
bn_mod_sqrt_n_is_non_residue(int *is_non_residue, const BIGNUM *n,
lib/libcrypto/bn/bn_mod_sqrt.c
211
switch (BN_kronecker(n, p, ctx)) {
lib/libcrypto/bn/bn_mod_sqrt.c
239
BIGNUM *n, *p_abs;
lib/libcrypto/bn/bn_mod_sqrt.c
245
if ((n = BN_CTX_get(ctx)) == NULL)
lib/libcrypto/bn/bn_mod_sqrt.c
251
if (!BN_set_word(n, i))
lib/libcrypto/bn/bn_mod_sqrt.c
253
if (!bn_mod_sqrt_n_is_non_residue(&is_non_residue, n, p, ctx))
lib/libcrypto/bn/bn_mod_sqrt.c
264
if (!bn_rand_interval(n, 32, p_abs))
lib/libcrypto/bn/bn_mod_sqrt.c
266
if (!bn_mod_sqrt_n_is_non_residue(&is_non_residue, n, p, ctx))
lib/libcrypto/bn/bn_mod_sqrt.c
285
if (!BN_mod_exp_ct(out_generator, n, q, p, ctx))
lib/libcrypto/bn/bn_mod_words.c
101
} else if (n == 6) {
lib/libcrypto/bn/bn_mod_words.c
103
} else if (n == 8) {
lib/libcrypto/bn/bn_mod_words.c
106
bn_sqr_words(t, a, n);
lib/libcrypto/bn/bn_mod_words.c
108
bn_montgomery_reduce_words(r, t, m, m0, n);
lib/libcrypto/bn/bn_mod_words.c
28
const BN_ULONG *m, size_t n)
lib/libcrypto/bn/bn_mod_words.c
38
carry = bn_add_words(r, a, b, n);
lib/libcrypto/bn/bn_mod_words.c
39
mask = ~(carry - bn_sub_words_borrow(r, m, n));
lib/libcrypto/bn/bn_mod_words.c
40
bn_sub_words_masked(r, r, m, mask, n);
lib/libcrypto/bn/bn_mod_words.c
51
const BN_ULONG *m, size_t n)
lib/libcrypto/bn/bn_mod_words.c
60
borrow = bn_sub_words(r, a, b, n);
lib/libcrypto/bn/bn_mod_words.c
62
bn_add_words_masked(r, r, m, mask, n);
lib/libcrypto/bn/bn_mod_words.c
74
const BN_ULONG *m, BN_ULONG *t, BN_ULONG m0, size_t n)
lib/libcrypto/bn/bn_mod_words.c
76
if (n == 4) {
lib/libcrypto/bn/bn_mod_words.c
78
} else if (n == 6) {
lib/libcrypto/bn/bn_mod_words.c
80
} else if (n == 8) {
lib/libcrypto/bn/bn_mod_words.c
83
bn_mul_words(t, a, n, b, n);
lib/libcrypto/bn/bn_mod_words.c
85
bn_montgomery_reduce_words(r, t, m, m0, n);
lib/libcrypto/bn/bn_mod_words.c
97
BN_ULONG *t, BN_ULONG m0, size_t n)
lib/libcrypto/bn/bn_mod_words.c
99
if (n == 4) {
lib/libcrypto/bn/bn_mont.c
326
bn_montgomery_reduce_words(BN_ULONG *r, BN_ULONG *a, const BN_ULONG *n,
lib/libcrypto/bn/bn_mont.c
335
v = bn_mulw_add_words(&a[i], n, n_len, a[i] * n0);
lib/libcrypto/bn/bn_mont.c
348
mask = carry - bn_sub_words(r, a, n, n_len);
lib/libcrypto/bn/bn_mont.c
366
BIGNUM *n;
lib/libcrypto/bn/bn_mont.c
369
n = &mctx->N;
lib/libcrypto/bn/bn_mont.c
392
bn_montgomery_reduce_words(r->d, a->d, n->d, mctx->n0[0], n_len);
lib/libcrypto/bn/bn_mont.c
398
BN_set_negative(r, a->neg ^ n->neg);
lib/libcrypto/bn/bn_primitives.c
51
BN_ULONG n = 0, x = 0;
lib/libcrypto/bn/bn_primitives.c
58
n = ((BN_ULONG)i & mask) | (n & ~mask);
lib/libcrypto/bn/bn_primitives.c
63
return (n + 1) * BN_BITS2 - bn_clzw(x);
lib/libcrypto/bn/bn_rand.c
228
int n;
lib/libcrypto/bn/bn_rand.c
236
n = BN_num_bits(range); /* n > 0 */
lib/libcrypto/bn/bn_rand.c
240
if (n == 1)
lib/libcrypto/bn/bn_rand.c
242
else if (!BN_is_bit_set(range, n - 2) && !BN_is_bit_set(range, n - 3)) {
lib/libcrypto/bn/bn_rand.c
246
if (!bn_rand(r, n + 1, -1, 0))
lib/libcrypto/bn/bn_rand.c
270
if (!bn_rand(r, n, -1, 0))
lib/libcrypto/bn/bn_shift.c
102
if (n < 0) {
lib/libcrypto/bn/bn_shift.c
106
shift_bits = n;
lib/libcrypto/bn/bn_shift.c
157
BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
lib/libcrypto/bn/bn_shift.c
159
return bn_lshift(r, a, n);
lib/libcrypto/bn/bn_shift.c
171
BN_rshift(BIGNUM *r, const BIGNUM *a, int n)
lib/libcrypto/bn/bn_shift.c
173
return bn_rshift(r, a, n);
lib/libcrypto/bn/bn_shift.c
24
bn_lshift(BIGNUM *r, const BIGNUM *a, int n)
lib/libcrypto/bn/bn_shift.c
31
if (n < 0) {
lib/libcrypto/bn/bn_shift.c
35
shift_bits = n;
lib/libcrypto/bn/bn_shift.c
94
bn_rshift(BIGNUM *r, const BIGNUM *a, int n)
lib/libcrypto/bn/bn_sqr.c
211
bn_sqr_add_words(BN_ULONG *r, const BN_ULONG *a, int n)
lib/libcrypto/bn/bn_sqr.c
216
assert(n >= 0);
lib/libcrypto/bn/bn_sqr.c
217
if (n <= 0)
lib/libcrypto/bn/bn_sqr.c
220
while (n & ~3) {
lib/libcrypto/bn/bn_sqr.c
232
n -= 4;
lib/libcrypto/bn/bn_sqr.c
234
while (n) {
lib/libcrypto/bn/bn_sqr.c
239
n--;
lib/libcrypto/bn/bn_sqr.c
253
int n;
lib/libcrypto/bn/bn_sqr.c
268
n = a_len - 1;
lib/libcrypto/bn/bn_sqr.c
269
if (n > 0) {
lib/libcrypto/bn/bn_sqr.c
270
rp[n] = bn_mulw_words(rp, ap, n, w);
lib/libcrypto/bn/bn_sqr.c
273
n--;
lib/libcrypto/bn/bn_sqr.c
276
while (n > 0) {
lib/libcrypto/bn/bn_sqr.c
280
rp[n] = bn_mulw_add_words(rp, ap, n, w);
lib/libcrypto/bn/bn_sqr.c
282
n--;
lib/libcrypto/bn/s2n_bignum.h
100
extern uint64_t bignum_bitfield (uint64_t k, const uint64_t *x, uint64_t n, uint64_t l);
lib/libcrypto/bn/s2n_bignum.h
108
extern uint64_t bignum_cdiv (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x, uint64_t m);
lib/libcrypto/bn/s2n_bignum.h
112
extern void bignum_cdiv_exact (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x, uint64_t m);
lib/libcrypto/bn/s2n_bignum.h
124
extern uint64_t bignum_cmadd (uint64_t k, uint64_t *z, uint64_t c, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
128
extern uint64_t bignum_cmnegadd (uint64_t k, uint64_t *z, uint64_t c, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
136
extern uint64_t bignum_cmul (uint64_t k, uint64_t *z, uint64_t c, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
170
extern uint64_t bignum_coprime (uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y, uint64_t *t);
lib/libcrypto/bn/s2n_bignum.h
174
extern void bignum_copy (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x);
lib/libcrypto/bn/s2n_bignum.h
268
extern uint64_t bignum_digit (uint64_t k, const uint64_t *x, uint64_t n);
lib/libcrypto/bn/s2n_bignum.h
316
extern uint64_t bignum_eq (uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
344
extern uint64_t bignum_ge (uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
348
extern uint64_t bignum_gt (uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
417
extern uint64_t bignum_le (uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
429
extern uint64_t bignum_lt (uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
433
extern uint64_t bignum_madd (uint64_t k, uint64_t *z, uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
48
extern uint64_t bignum_add (uint64_t p, uint64_t *z, uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
601
extern void bignum_montredc (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x, const uint64_t *m, uint64_t p);
lib/libcrypto/bn/s2n_bignum.h
634
extern void bignum_mul (uint64_t k, uint64_t *z, uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
736
extern void bignum_of_word (uint64_t k, uint64_t *z, uint64_t n);
lib/libcrypto/bn/s2n_bignum.h
780
extern void bignum_pow2 (uint64_t k, uint64_t *z, uint64_t n);
lib/libcrypto/bn/s2n_bignum.h
784
extern uint64_t bignum_shl_small (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x, uint64_t c);
lib/libcrypto/bn/s2n_bignum.h
788
extern uint64_t bignum_shr_small (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x, uint64_t c);
lib/libcrypto/bn/s2n_bignum.h
792
extern void bignum_sqr (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x);
lib/libcrypto/bn/s2n_bignum.h
831
extern uint64_t bignum_sub (uint64_t p, uint64_t *z, uint64_t m, const uint64_t *x, uint64_t n, const uint64_t *y);
lib/libcrypto/bn/s2n_bignum.h
84
extern void bignum_amontredc (uint64_t k, uint64_t *z, uint64_t n, const uint64_t *x, const uint64_t *m, uint64_t p);
lib/libcrypto/buffer/buffer.c
110
size_t n;
lib/libcrypto/buffer/buffer.c
124
n = (len + 3) / 3 * 4;
lib/libcrypto/buffer/buffer.c
125
if ((ret = recallocarray(str->data, str->max, n, 1)) == NULL) {
lib/libcrypto/buffer/buffer.c
130
str->max = n;
lib/libcrypto/bytestring/bs_cbs.c
40
cbs_get(CBS *cbs, const uint8_t **p, size_t n)
lib/libcrypto/bytestring/bs_cbs.c
42
if (cbs->len < n)
lib/libcrypto/bytestring/bs_cbs.c
46
cbs->data += n;
lib/libcrypto/bytestring/bs_cbs.c
47
cbs->len -= n;
lib/libcrypto/bytestring/bs_cbs.c
52
cbs_peek(CBS *cbs, const uint8_t **p, size_t n)
lib/libcrypto/bytestring/bs_cbs.c
54
if (cbs->len < n)
lib/libcrypto/cast/cast.c
662
#define CAST_exp(l,A,a,n) \
lib/libcrypto/cast/cast.c
663
A[n/4]=l; \
lib/libcrypto/cast/cast.c
664
a[n+3]=(l )&0xff; \
lib/libcrypto/cast/cast.c
665
a[n+2]=(l>> 8)&0xff; \
lib/libcrypto/cast/cast.c
666
a[n+1]=(l>>16)&0xff; \
lib/libcrypto/cast/cast.c
667
a[n+0]=(l>>24)&0xff;
lib/libcrypto/cast/cast.c
858
int n= *num;
lib/libcrypto/cast/cast.c
866
if (n == 0) {
lib/libcrypto/cast/cast.c
879
c= *(in++)^iv[n];
lib/libcrypto/cast/cast.c
881
iv[n] = c;
lib/libcrypto/cast/cast.c
882
n = (n + 1)&0x07;
lib/libcrypto/cast/cast.c
886
if (n == 0) {
lib/libcrypto/cast/cast.c
900
c = iv[n];
lib/libcrypto/cast/cast.c
901
iv[n] = cc;
lib/libcrypto/cast/cast.c
903
n = (n + 1)&0x07;
lib/libcrypto/cast/cast.c
907
*num = n;
lib/libcrypto/cast/cast.c
944
int n= *num;
lib/libcrypto/cast/cast.c
961
if (n == 0) {
lib/libcrypto/cast/cast.c
970
*(out++)= *(in++)^d[n];
lib/libcrypto/cast/cast.c
971
n = (n + 1)&0x07;
lib/libcrypto/cast/cast.c
981
*num = n;
lib/libcrypto/cast/cast_local.h
108
#define n2ln(c,l1,l2,n) { \
lib/libcrypto/cast/cast_local.h
109
c+=n; \
lib/libcrypto/cast/cast_local.h
111
switch (n) { \
lib/libcrypto/cast/cast_local.h
124
#define l2nn(l1,l2,c,n) { \
lib/libcrypto/cast/cast_local.h
125
c+=n; \
lib/libcrypto/cast/cast_local.h
126
switch (n) { \
lib/libcrypto/cast/cast_local.h
151
#define ROTL(a,n) ((((a)<<(n))&0xffffffffL)|((a)>>((32-(n))&31)))
lib/libcrypto/cast/cast_local.h
161
#define E_CAST(n,key,L,R,OP1,OP2,OP3) \
lib/libcrypto/cast/cast_local.h
164
t=(key[n*2] OP1 R)&0xffffffffL; \
lib/libcrypto/cast/cast_local.h
165
i=key[n*2+1]; \
lib/libcrypto/cast/cast_local.h
177
#define E_CAST(n,key,L,R,OP1,OP2,OP3) \
lib/libcrypto/cast/cast_local.h
181
w=(key[n*2] OP1 R)&0xffffffffL; \
lib/libcrypto/cast/cast_local.h
182
i=key[n*2+1]; \
lib/libcrypto/cast/cast_local.h
199
#define E_CAST(n,key,L,R,OP1,OP2,OP3) \
lib/libcrypto/cast/cast_local.h
202
t=(key[n*2] OP1 R)&0xffffffff; \
lib/libcrypto/cast/cast_local.h
203
t=ROTL(t,(key[n*2+1])); \
lib/libcrypto/cast/cast_local.h
70
#define c2ln(c,l1,l2,n) { \
lib/libcrypto/cast/cast_local.h
71
c+=n; \
lib/libcrypto/cast/cast_local.h
73
switch (n) { \
lib/libcrypto/cast/cast_local.h
93
#define l2cn(l1,l2,c,n) { \
lib/libcrypto/cast/cast_local.h
94
c+=n; \
lib/libcrypto/cast/cast_local.h
95
switch (n) { \
lib/libcrypto/chacha/chacha-merged.c
44
#define ROTL32(v, n) \
lib/libcrypto/chacha/chacha-merged.c
45
(U32V((v) << (n)) | ((v) >> (32 - (n))))
lib/libcrypto/chacha/chacha.c
45
uint64_t n;
lib/libcrypto/chacha/chacha.c
59
if ((n = len) > UINT32_MAX)
lib/libcrypto/chacha/chacha.c
60
n = UINT32_MAX;
lib/libcrypto/chacha/chacha.c
62
chacha_encrypt_bytes((chacha_ctx *)ctx, in, out, (uint32_t)n);
lib/libcrypto/chacha/chacha.c
64
in += n;
lib/libcrypto/chacha/chacha.c
65
out += n;
lib/libcrypto/chacha/chacha.c
66
len -= n;
lib/libcrypto/chacha/chacha.c
76
uint64_t n;
lib/libcrypto/chacha/chacha.c
91
if ((n = len) > UINT32_MAX)
lib/libcrypto/chacha/chacha.c
92
n = UINT32_MAX;
lib/libcrypto/chacha/chacha.c
94
chacha_encrypt_bytes(&ctx, in, out, (uint32_t)n);
lib/libcrypto/chacha/chacha.c
96
in += n;
lib/libcrypto/chacha/chacha.c
97
out += n;
lib/libcrypto/chacha/chacha.c
98
len -= n;
lib/libcrypto/conf/conf.h
125
#define NCONF_get_number(c,g,n,r) NCONF_get_number_e(c,g,n,r)
lib/libcrypto/des/des.c
150
int n = *num;
lib/libcrypto/des/des.c
157
if (n == 0) {
lib/libcrypto/des/des.c
172
c = *(in++) ^ iv[n];
lib/libcrypto/des/des.c
174
iv[n] = c;
lib/libcrypto/des/des.c
175
n = (n + 1) & 0x07;
lib/libcrypto/des/des.c
179
if (n == 0) {
lib/libcrypto/des/des.c
195
c = iv[n];
lib/libcrypto/des/des.c
196
iv[n] = cc;
lib/libcrypto/des/des.c
198
n = (n + 1) & 0x07;
lib/libcrypto/des/des.c
202
*num = n;
lib/libcrypto/des/des.c
217
unsigned long l = length, n = ((unsigned int)numbits + 7)/8;
lib/libcrypto/des/des.c
229
while (l >= n) {
lib/libcrypto/des/des.c
230
l -= n;
lib/libcrypto/des/des.c
234
c2ln(in, d0, d1, n);
lib/libcrypto/des/des.c
235
in += n;
lib/libcrypto/des/des.c
238
l2cn(d0, d1, out, n);
lib/libcrypto/des/des.c
239
out += n;
lib/libcrypto/des/des.c
271
while (l >= n) {
lib/libcrypto/des/des.c
272
l -= n;
lib/libcrypto/des/des.c
276
c2ln(in, d0, d1, n);
lib/libcrypto/des/des.c
277
in += n;
lib/libcrypto/des/des.c
309
l2cn(d0, d1, out, n);
lib/libcrypto/des/des.c
310
out += n;
lib/libcrypto/des/des.c
332
int n = *num;
lib/libcrypto/des/des.c
339
if (n == 0) {
lib/libcrypto/des/des.c
352
c = *(in++) ^ iv[n];
lib/libcrypto/des/des.c
354
iv[n] = c;
lib/libcrypto/des/des.c
355
n = (n + 1) & 0x07;
lib/libcrypto/des/des.c
359
if (n == 0) {
lib/libcrypto/des/des.c
373
c = iv[n];
lib/libcrypto/des/des.c
374
iv[n] = cc;
lib/libcrypto/des/des.c
376
n = (n + 1) & 0x07;
lib/libcrypto/des/des.c
380
*num = n;
lib/libcrypto/des/des.c
399
int num = numbits/8, n = (numbits + 7)/8, i, rem = numbits % 8;
lib/libcrypto/des/des.c
415
while (l >= (unsigned long)n) {
lib/libcrypto/des/des.c
416
l -= n;
lib/libcrypto/des/des.c
420
c2ln(in, d0, d1, n);
lib/libcrypto/des/des.c
421
in += n;
lib/libcrypto/des/des.c
424
l2cn(d0, d1, out, n);
lib/libcrypto/des/des.c
425
out += n;
lib/libcrypto/des/des.c
461
while (l >= (unsigned long)n) {
lib/libcrypto/des/des.c
462
l -= n;
lib/libcrypto/des/des.c
466
c2ln(in, d0, d1, n);
lib/libcrypto/des/des.c
467
in += n;
lib/libcrypto/des/des.c
503
l2cn(d0, d1, out, n);
lib/libcrypto/des/des.c
504
out += n;
lib/libcrypto/des/des.c
703
int n = *num;
lib/libcrypto/des/des.c
720
if (n == 0) {
lib/libcrypto/des/des.c
732
*(out++) = *(in++) ^ d[n];
lib/libcrypto/des/des.c
733
n = (n + 1) & 0x07;
lib/libcrypto/des/des.c
741
*num = n;
lib/libcrypto/des/des.c
755
int n = *num;
lib/libcrypto/des/des.c
772
if (n == 0) {
lib/libcrypto/des/des.c
781
*(out++) = *(in++) ^ d[n];
lib/libcrypto/des/des.c
782
n = (n + 1) & 0x07;
lib/libcrypto/des/des.c
792
*num = n;
lib/libcrypto/des/des.c
807
DES_LONG d0, d1, vv0, vv1, v0, v1, n = (numbits + 7)/8;
lib/libcrypto/des/des.c
841
c2ln(in, d0, d1, n);
lib/libcrypto/des/des.c
842
in += n;
lib/libcrypto/des/des.c
845
l2cn(d0, d1, out, n);
lib/libcrypto/des/des.c
846
out += n;
lib/libcrypto/des/des.h
106
#define DES_ede2_cfb64_encrypt(i,o,l,k1,k2,iv,n,e) \
lib/libcrypto/des/des.h
107
DES_ede3_cfb64_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(n),(e))
lib/libcrypto/des/des.h
109
#define DES_ede2_ofb64_encrypt(i,o,l,k1,k2,iv,n) \
lib/libcrypto/des/des.h
110
DES_ede3_ofb64_encrypt((i),(o),(l),(k1),(k2),(k1),(iv),(n))
lib/libcrypto/des/des_fcrypt.c
79
#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)), \
lib/libcrypto/des/des_fcrypt.c
81
(a)^=((t)<<(n)))
lib/libcrypto/des/des_fcrypt.c
84
#define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)), \
lib/libcrypto/des/des_fcrypt.c
85
(a)=(a)^(t)^(t>>(16-(n)))) \
lib/libcrypto/des/des_key.c
160
#define HPERM_OP(a,t,n,m) ((t)=((((a)<<(16-(n)))^(a))&(m)), \
lib/libcrypto/des/des_key.c
161
(a)=(a)^(t)^(t>>(16-(n))))
lib/libcrypto/des/des_local.h
104
#define l2cn(l1,l2,c,n) { \
lib/libcrypto/des/des_local.h
105
c+=n; \
lib/libcrypto/des/des_local.h
106
switch (n) { \
lib/libcrypto/des/des_local.h
119
ROTATE(uint32_t a, uint32_t n)
lib/libcrypto/des/des_local.h
121
return (a >> n) + (a << (32 - n));
lib/libcrypto/des/des_local.h
194
#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)), \
lib/libcrypto/des/des_local.h
196
(a)^=((t)<<(n)))
lib/libcrypto/des/des_local.h
83
#define c2ln(c,l1,l2,n) { \
lib/libcrypto/des/des_local.h
84
c+=n; \
lib/libcrypto/des/des_local.h
86
switch (n) { \
lib/libcrypto/dsa/dsa_gen.c
114
int i, k, n = 0, m = 0, qsize = qbits >> 3;
lib/libcrypto/dsa/dsa_gen.c
235
n = (bits - 1) / 160;
lib/libcrypto/dsa/dsa_gen.c
244
for (k = 0; k <= n; k++) {
lib/libcrypto/ec/ec.h
203
int EC_POINT_mul(const EC_GROUP *group, EC_POINT *r, const BIGNUM *n,
lib/libcrypto/ec/ec_field.c
113
if (!bn_wexpand(bn, fm->n))
lib/libcrypto/ec/ec_field.c
117
for (i = 0; i < fm->n; i++)
lib/libcrypto/ec/ec_field.c
120
bn_montgomery_reduce_words(bn->d, t, fm->m.w, fm->minv0, fm->n);
lib/libcrypto/ec/ec_field.c
122
bn->top = fm->n;
lib/libcrypto/ec/ec_field.c
143
for (i = 0; i < fm->n; i++)
lib/libcrypto/ec/ec_field.c
154
for (i = 0; i < fm->n; i++)
lib/libcrypto/ec/ec_field.c
166
for (i = 0; i < fm->n; i++)
lib/libcrypto/ec/ec_field.c
176
bn_mod_add_words(r->w, a->w, b->w, m->m.w, m->n);
lib/libcrypto/ec/ec_field.c
183
bn_mod_sub_words(r->w, a->w, b->w, m->m.w, m->n);
lib/libcrypto/ec/ec_field.c
192
bn_mod_mul_words(r->w, a->w, b->w, m->m.w, t, m->minv0, m->n);
lib/libcrypto/ec/ec_field.c
201
bn_mod_sqr_words(r->w, a->w, m->m.w, t, m->minv0, m->n);
lib/libcrypto/ec/ec_field.c
41
fm->n = (BN_num_bits(bn) + BN_BITS2 - 1) / BN_BITS2;
lib/libcrypto/ec/ec_field.c
96
bn_mod_mul_words(fe->w, fe->w, fm->rr.w, fm->m.w, t, fm->minv0, fm->n);
lib/libcrypto/ec/ec_internal.h
34
size_t n;
lib/libcrypto/ec/ecp_hp_methods.c
610
for (i = 0; i < group->fm.n; i++)
lib/libcrypto/evp/bio_b64.c
155
int ret = 0, i, ii, j, k, x, n, num, ret_code = 0;
lib/libcrypto/evp/bio_b64.c
280
n = q - p;
lib/libcrypto/evp/bio_b64.c
281
for (ii = 0; ii < n; ii++)
lib/libcrypto/evp/bio_b64.c
283
ctx->tmp_len = n;
lib/libcrypto/evp/bio_b64.c
358
int n;
lib/libcrypto/evp/bio_b64.c
376
n = ctx->buf_len - ctx->buf_off;
lib/libcrypto/evp/bio_b64.c
377
while (n > 0) {
lib/libcrypto/evp/bio_b64.c
378
i = BIO_write(b->next_bio, &(ctx->buf[ctx->buf_off]), n);
lib/libcrypto/evp/bio_b64.c
383
OPENSSL_assert(i <= n);
lib/libcrypto/evp/bio_b64.c
387
n -= i;
lib/libcrypto/evp/bio_b64.c
397
n = (inl > B64_BLOCK_SIZE) ? B64_BLOCK_SIZE : inl;
lib/libcrypto/evp/bio_b64.c
402
n = 3 - ctx->tmp_len;
lib/libcrypto/evp/bio_b64.c
404
if (n > inl)
lib/libcrypto/evp/bio_b64.c
405
n = inl;
lib/libcrypto/evp/bio_b64.c
406
memcpy(&(ctx->tmp[ctx->tmp_len]), in, n);
lib/libcrypto/evp/bio_b64.c
407
ctx->tmp_len += n;
lib/libcrypto/evp/bio_b64.c
408
ret += n;
lib/libcrypto/evp/bio_b64.c
421
if (n < 3) {
lib/libcrypto/evp/bio_b64.c
422
memcpy(ctx->tmp, in, n);
lib/libcrypto/evp/bio_b64.c
423
ctx->tmp_len = n;
lib/libcrypto/evp/bio_b64.c
424
ret += n;
lib/libcrypto/evp/bio_b64.c
427
n -= n % 3;
lib/libcrypto/evp/bio_b64.c
430
(const unsigned char *)in, n);
lib/libcrypto/evp/bio_b64.c
434
ret += n;
lib/libcrypto/evp/bio_b64.c
439
(unsigned char *)in, n))
lib/libcrypto/evp/bio_b64.c
443
ret += n;
lib/libcrypto/evp/bio_b64.c
445
inl -= n;
lib/libcrypto/evp/bio_b64.c
446
in += n;
lib/libcrypto/evp/bio_b64.c
449
n = ctx->buf_len;
lib/libcrypto/evp/bio_b64.c
450
while (n > 0) {
lib/libcrypto/evp/bio_b64.c
451
i = BIO_write(b->next_bio, &(ctx->buf[ctx->buf_off]), n);
lib/libcrypto/evp/bio_b64.c
456
OPENSSL_assert(i <= n);
lib/libcrypto/evp/bio_b64.c
457
n -= i;
lib/libcrypto/evp/bio_enc.c
250
int ret = 0, n, i;
lib/libcrypto/evp/bio_enc.c
256
n = ctx->buf_len - ctx->buf_off;
lib/libcrypto/evp/bio_enc.c
257
while (n > 0) {
lib/libcrypto/evp/bio_enc.c
258
i = BIO_write(bio->next_bio, &(ctx->buf[ctx->buf_off]), n);
lib/libcrypto/evp/bio_enc.c
264
n -= i;
lib/libcrypto/evp/bio_enc.c
273
n = inl > ENC_BLOCK_SIZE ? ENC_BLOCK_SIZE : inl;
lib/libcrypto/evp/bio_enc.c
276
(unsigned char *)in, n);
lib/libcrypto/evp/bio_enc.c
277
inl -= n;
lib/libcrypto/evp/bio_enc.c
278
in += n;
lib/libcrypto/evp/bio_enc.c
281
n = ctx->buf_len;
lib/libcrypto/evp/bio_enc.c
282
while (n > 0) {
lib/libcrypto/evp/bio_enc.c
283
i = BIO_write(bio->next_bio, &ctx->buf[ctx->buf_off], n);
lib/libcrypto/evp/bio_enc.c
288
n -= i;
lib/libcrypto/evp/e_aes.c
651
int n = 8;
lib/libcrypto/evp/e_aes.c
655
--n;
lib/libcrypto/evp/e_aes.c
656
c = counter[n];
lib/libcrypto/evp/e_aes.c
658
counter[n] = c;
lib/libcrypto/evp/e_aes.c
661
} while (n);
lib/libcrypto/evp/e_des.c
181
size_t n;
lib/libcrypto/evp/e_des.c
187
for (n = 0; n < chunk*8; ++n) {
lib/libcrypto/evp/e_des.c
188
c[0] = (in[n / 8] & (1 << (7 - n % 8))) ? 0x80 : 0;
lib/libcrypto/evp/e_des.c
191
out[n / 8] = (out[n / 8] &
lib/libcrypto/evp/e_des.c
192
~(0x80 >> (unsigned int)(n % 8))) |
lib/libcrypto/evp/e_des.c
193
((d[0] & 0x80) >> (unsigned int)(n % 8));
lib/libcrypto/evp/e_des3.c
218
size_t n;
lib/libcrypto/evp/e_des3.c
223
for (n = 0; n < inl; ++n) {
lib/libcrypto/evp/e_des3.c
224
c[0] = (in[n/8]&(1 << (7 - n % 8))) ? 0x80 : 0;
lib/libcrypto/evp/e_des3.c
228
out[n / 8] = (out[n / 8] & ~(0x80 >> (unsigned int)(n % 8))) |
lib/libcrypto/evp/e_des3.c
229
((d[0] & 0x80) >> (unsigned int)(n % 8));
lib/libcrypto/evp/evp.h
539
int EVP_EncodeBlock(unsigned char *t, const unsigned char *f, int n);
lib/libcrypto/evp/evp.h
545
int EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n);
lib/libcrypto/evp/evp_encode.c
262
int seof = 0, eof = 0, rv = -1, ret = 0, i, v, tmp, n, decoded_len;
lib/libcrypto/evp/evp_encode.c
265
n = ctx->num;
lib/libcrypto/evp/evp_encode.c
268
if (n > 0 && d[n - 1] == '=') {
lib/libcrypto/evp/evp_encode.c
270
if (n > 1 && d[n - 2] == '=')
lib/libcrypto/evp/evp_encode.c
308
if (n >= 64) {
lib/libcrypto/evp/evp_encode.c
319
OPENSSL_assert(n < (int)sizeof(ctx->enc_data));
lib/libcrypto/evp/evp_encode.c
320
d[n++] = tmp;
lib/libcrypto/evp/evp_encode.c
323
if (n == 64) {
lib/libcrypto/evp/evp_encode.c
324
decoded_len = EVP_DecodeBlock(out, d, n);
lib/libcrypto/evp/evp_encode.c
325
n = 0;
lib/libcrypto/evp/evp_encode.c
342
if (n > 0) {
lib/libcrypto/evp/evp_encode.c
343
if ((n & 3) == 0) {
lib/libcrypto/evp/evp_encode.c
344
decoded_len = EVP_DecodeBlock(out, d, n);
lib/libcrypto/evp/evp_encode.c
345
n = 0;
lib/libcrypto/evp/evp_encode.c
358
rv = seof || (n == 0 && eof) ? 0 : 1;
lib/libcrypto/evp/evp_encode.c
362
ctx->num = n;
lib/libcrypto/evp/evp_encode.c
368
EVP_DecodeBlock(unsigned char *t, const unsigned char *f, int n)
lib/libcrypto/evp/evp_encode.c
374
while ((conv_ascii2bin(*f) == B64_WS) && (n > 0)) {
lib/libcrypto/evp/evp_encode.c
376
n--;
lib/libcrypto/evp/evp_encode.c
381
while ((n > 3) && (B64_NOT_BASE64(conv_ascii2bin(f[n - 1]))))
lib/libcrypto/evp/evp_encode.c
382
n--;
lib/libcrypto/evp/evp_encode.c
384
if (n % 4 != 0)
lib/libcrypto/evp/evp_encode.c
387
for (i = 0; i < n; i += 4) {
lib/libcrypto/hkdf/hkdf.c
110
if ((n = remaining) > digest_len)
lib/libcrypto/hkdf/hkdf.c
111
n = digest_len;
lib/libcrypto/hkdf/hkdf.c
113
if (!CBB_add_bytes(&cbb, out_hmac, n))
lib/libcrypto/hkdf/hkdf.c
116
remaining -= n;
lib/libcrypto/hkdf/hkdf.c
79
size_t n, remaining;
lib/libcrypto/hmac/hmac.c
254
size_t n, unsigned char *md, unsigned int *md_len)
lib/libcrypto/hmac/hmac.c
266
if (!HMAC_Update(&c, d, n))
lib/libcrypto/hmac/hmac.h
88
const unsigned char *d, size_t n, unsigned char *md, unsigned int *md_len)
lib/libcrypto/idea/idea.c
189
int n = *num;
lib/libcrypto/idea/idea.c
197
if (n == 0) {
lib/libcrypto/idea/idea.c
210
c = *(in++) ^ iv[n];
lib/libcrypto/idea/idea.c
212
iv[n] = c;
lib/libcrypto/idea/idea.c
213
n = (n + 1) & 0x07;
lib/libcrypto/idea/idea.c
217
if (n == 0) {
lib/libcrypto/idea/idea.c
231
c = iv[n];
lib/libcrypto/idea/idea.c
232
iv[n] = cc;
lib/libcrypto/idea/idea.c
234
n = (n + 1) & 0x07;
lib/libcrypto/idea/idea.c
238
*num = n;
lib/libcrypto/idea/idea.c
272
int n = *num;
lib/libcrypto/idea/idea.c
289
if (n == 0) {
lib/libcrypto/idea/idea.c
298
*(out++) = *(in++) ^ d[n];
lib/libcrypto/idea/idea.c
299
n = (n + 1) & 0x07;
lib/libcrypto/idea/idea.c
309
*num = n;
lib/libcrypto/idea/idea_local.h
102
#define l2nn(l1,l2,c,n) { \
lib/libcrypto/idea/idea_local.h
103
c+=n; \
lib/libcrypto/idea/idea_local.h
104
switch (n) { \
lib/libcrypto/idea/idea_local.h
86
#define n2ln(c,l1,l2,n) { \
lib/libcrypto/idea/idea_local.h
87
c+=n; \
lib/libcrypto/idea/idea_local.h
89
switch (n) { \
lib/libcrypto/lhash/lhash.c
127
n = reallocarray(lh->b, j, sizeof(LHASH_NODE *));
lib/libcrypto/lhash/lhash.c
128
if (n == NULL) {
lib/libcrypto/lhash/lhash.c
136
n[i] = NULL; /* 02/03/92 eay */
lib/libcrypto/lhash/lhash.c
140
lh->b = n;
lib/libcrypto/lhash/lhash.c
147
LHASH_NODE **n, *n1, *np;
lib/libcrypto/lhash/lhash.c
152
n = reallocarray(lh->b, lh->pmax, sizeof(LHASH_NODE *));
lib/libcrypto/lhash/lhash.c
153
if (n == NULL) {
lib/libcrypto/lhash/lhash.c
161
lh->b = n;
lib/libcrypto/lhash/lhash.c
234
LHASH_NODE *n, *nn;
lib/libcrypto/lhash/lhash.c
240
n = lh->b[i];
lib/libcrypto/lhash/lhash.c
241
while (n != NULL) {
lib/libcrypto/lhash/lhash.c
242
nn = n->next;
lib/libcrypto/lhash/lhash.c
243
free(n);
lib/libcrypto/lhash/lhash.c
244
n = nn;
lib/libcrypto/lhash/lhash.c
346
LHASH_NODE *a, *n;
lib/libcrypto/lhash/lhash.c
370
n = a->next;
lib/libcrypto/lhash/lhash.c
375
a = n;
lib/libcrypto/lhash/lhash.c
408
unsigned long n, v;
lib/libcrypto/lhash/lhash.c
414
n = 0x100;
lib/libcrypto/lhash/lhash.c
416
v = n | *c;
lib/libcrypto/lhash/lhash.c
417
n += 0x100;
lib/libcrypto/lhash/lhash.c
99
LHASH_NODE **n, **n1, **n2, *np;
lib/libcrypto/md4/md4.c
247
size_t n;
lib/libcrypto/md4/md4.c
260
n = c->num;
lib/libcrypto/md4/md4.c
261
if (n != 0) {
lib/libcrypto/md4/md4.c
264
if (len >= MD4_CBLOCK || len + n >= MD4_CBLOCK) {
lib/libcrypto/md4/md4.c
265
memcpy (p + n, data, MD4_CBLOCK - n);
lib/libcrypto/md4/md4.c
267
n = MD4_CBLOCK - n;
lib/libcrypto/md4/md4.c
268
data += n;
lib/libcrypto/md4/md4.c
269
len -= n;
lib/libcrypto/md4/md4.c
273
memcpy(p + n, data, len);
lib/libcrypto/md4/md4.c
279
n = len / MD4_CBLOCK;
lib/libcrypto/md4/md4.c
280
if (n > 0) {
lib/libcrypto/md4/md4.c
281
md4_block_data_order(c, data, n);
lib/libcrypto/md4/md4.c
282
n *= MD4_CBLOCK;
lib/libcrypto/md4/md4.c
283
data += n;
lib/libcrypto/md4/md4.c
284
len -= n;
lib/libcrypto/md4/md4.c
307
size_t n = c->num;
lib/libcrypto/md4/md4.c
309
p[n] = 0x80; /* there is always room for one */
lib/libcrypto/md4/md4.c
310
n++;
lib/libcrypto/md4/md4.c
312
if (n > (MD4_CBLOCK - 8)) {
lib/libcrypto/md4/md4.c
313
memset(p + n, 0, MD4_CBLOCK - n);
lib/libcrypto/md4/md4.c
314
n = 0;
lib/libcrypto/md4/md4.c
318
memset(p + n, 0, MD4_CBLOCK - 8 - n);
lib/libcrypto/md4/md4.c
336
MD4(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/md4/md4.c
342
MD4_Update(&c, d, n);
lib/libcrypto/md4/md4.h
97
unsigned char *MD4(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/md5/md5.c
280
size_t n;
lib/libcrypto/md5/md5.c
288
n = c->num;
lib/libcrypto/md5/md5.c
289
if (n != 0) {
lib/libcrypto/md5/md5.c
292
if (len >= MD5_CBLOCK || len + n >= MD5_CBLOCK) {
lib/libcrypto/md5/md5.c
293
memcpy(p + n, data, MD5_CBLOCK - n);
lib/libcrypto/md5/md5.c
295
n = MD5_CBLOCK - n;
lib/libcrypto/md5/md5.c
296
data += n;
lib/libcrypto/md5/md5.c
297
len -= n;
lib/libcrypto/md5/md5.c
301
memcpy(p + n, data, len);
lib/libcrypto/md5/md5.c
307
n = len/MD5_CBLOCK;
lib/libcrypto/md5/md5.c
308
if (n > 0) {
lib/libcrypto/md5/md5.c
309
md5_block_data_order(c, data, n);
lib/libcrypto/md5/md5.c
310
n *= MD5_CBLOCK;
lib/libcrypto/md5/md5.c
311
data += n;
lib/libcrypto/md5/md5.c
312
len -= n;
lib/libcrypto/md5/md5.c
335
size_t n = c->num;
lib/libcrypto/md5/md5.c
337
p[n] = 0x80; /* there is always room for one */
lib/libcrypto/md5/md5.c
338
n++;
lib/libcrypto/md5/md5.c
340
if (n > (MD5_CBLOCK - 8)) {
lib/libcrypto/md5/md5.c
341
memset(p + n, 0, MD5_CBLOCK - n);
lib/libcrypto/md5/md5.c
342
n = 0;
lib/libcrypto/md5/md5.c
346
memset(p + n, 0, MD5_CBLOCK - 8 - n);
lib/libcrypto/md5/md5.c
364
MD5(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/md5/md5.c
370
MD5_Update(&c, d, n);
lib/libcrypto/md5/md5.h
91
unsigned char *MD5(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/modes/cbc128.c
100
out[n] = iv[n];
lib/libcrypto/modes/cbc128.c
118
size_t n;
lib/libcrypto/modes/cbc128.c
132
for (n = 0; n < 16; ++n)
lib/libcrypto/modes/cbc128.c
133
out[n] ^= iv[n];
lib/libcrypto/modes/cbc128.c
145
for (n = 0; n < 16/sizeof(size_t); n++)
lib/libcrypto/modes/cbc128.c
146
out_t[n] ^= iv_t[n];
lib/libcrypto/modes/cbc128.c
161
for (n = 0; n < 16; ++n) {
lib/libcrypto/modes/cbc128.c
162
c = in[n];
lib/libcrypto/modes/cbc128.c
163
out[n] = tmp.c[n] ^ ivec[n];
lib/libcrypto/modes/cbc128.c
164
ivec[n] = c;
lib/libcrypto/modes/cbc128.c
177
for (n = 0; n < 16/sizeof(size_t); n++) {
lib/libcrypto/modes/cbc128.c
178
c = in_t[n];
lib/libcrypto/modes/cbc128.c
179
out_t[n] = tmp.t[n] ^ ivec_t[n];
lib/libcrypto/modes/cbc128.c
180
ivec_t[n] = c;
lib/libcrypto/modes/cbc128.c
191
for (n = 0; n < 16 && n < len; ++n) {
lib/libcrypto/modes/cbc128.c
192
c = in[n];
lib/libcrypto/modes/cbc128.c
193
out[n] = tmp.c[n] ^ ivec[n];
lib/libcrypto/modes/cbc128.c
194
ivec[n] = c;
lib/libcrypto/modes/cbc128.c
197
for (; n < 16; ++n)
lib/libcrypto/modes/cbc128.c
198
ivec[n] = in[n];
lib/libcrypto/modes/cbc128.c
70
size_t n;
lib/libcrypto/modes/cbc128.c
76
for (n = 0; n < 16; ++n)
lib/libcrypto/modes/cbc128.c
77
out[n] = in[n] ^ iv[n];
lib/libcrypto/modes/cbc128.c
86
for (n = 0; n < 16; n += sizeof(size_t))
lib/libcrypto/modes/cbc128.c
87
*(size_t *)(out + n) =
lib/libcrypto/modes/cbc128.c
88
*(size_t *)(in + n) ^ *(size_t *)(iv + n);
lib/libcrypto/modes/cbc128.c
97
for (n = 0; n < 16 && n < len; ++n)
lib/libcrypto/modes/cbc128.c
98
out[n] = in[n] ^ iv[n];
lib/libcrypto/modes/cbc128.c
99
for (; n < 16; ++n)
lib/libcrypto/modes/ccm128.c
162
unsigned int n = 8;
lib/libcrypto/modes/ccm128.c
167
--n;
lib/libcrypto/modes/ccm128.c
168
c = counter[n];
lib/libcrypto/modes/ccm128.c
170
counter[n] = c;
lib/libcrypto/modes/ccm128.c
173
} while (n);
lib/libcrypto/modes/ccm128.c
181
size_t n;
lib/libcrypto/modes/ccm128.c
196
for (n = 0, i = 15 - L; i < 15; ++i) {
lib/libcrypto/modes/ccm128.c
197
n |= ctx->nonce.c[i];
lib/libcrypto/modes/ccm128.c
199
n <<= 8;
lib/libcrypto/modes/ccm128.c
201
n |= ctx->nonce.c[15]; /* reconstructed length */
lib/libcrypto/modes/ccm128.c
204
if (n != len)
lib/libcrypto/modes/ccm128.c
268
size_t n;
lib/libcrypto/modes/ccm128.c
282
for (n = 0, i = 15 - L; i < 15; ++i) {
lib/libcrypto/modes/ccm128.c
283
n |= ctx->nonce.c[i];
lib/libcrypto/modes/ccm128.c
285
n <<= 8;
lib/libcrypto/modes/ccm128.c
287
n |= ctx->nonce.c[15]; /* reconstructed length */
lib/libcrypto/modes/ccm128.c
290
if (n != len)
lib/libcrypto/modes/ccm128.c
343
size_t n = 8, val = 0;
lib/libcrypto/modes/ccm128.c
347
--n;
lib/libcrypto/modes/ccm128.c
348
val += counter[n] + (inc & 0xff);
lib/libcrypto/modes/ccm128.c
349
counter[n] = (unsigned char)val;
lib/libcrypto/modes/ccm128.c
352
} while (n && (inc || val));
lib/libcrypto/modes/ccm128.c
360
size_t n;
lib/libcrypto/modes/ccm128.c
375
for (n = 0, i = 15 - L; i < 15; ++i) {
lib/libcrypto/modes/ccm128.c
376
n |= ctx->nonce.c[i];
lib/libcrypto/modes/ccm128.c
378
n <<= 8;
lib/libcrypto/modes/ccm128.c
380
n |= ctx->nonce.c[15]; /* reconstructed length */
lib/libcrypto/modes/ccm128.c
383
if (n != len)
lib/libcrypto/modes/ccm128.c
390
if ((n = len/16)) {
lib/libcrypto/modes/ccm128.c
391
(*stream)(inp, out, n, key, ctx->nonce.c, ctx->cmac.c);
lib/libcrypto/modes/ccm128.c
392
n *= 16;
lib/libcrypto/modes/ccm128.c
393
inp += n;
lib/libcrypto/modes/ccm128.c
394
out += n;
lib/libcrypto/modes/ccm128.c
395
len -= n;
lib/libcrypto/modes/ccm128.c
397
ctr64_add(ctx->nonce.c, n/16);
lib/libcrypto/modes/ccm128.c
427
size_t n;
lib/libcrypto/modes/ccm128.c
441
for (n = 0, i = 15 - L; i < 15; ++i) {
lib/libcrypto/modes/ccm128.c
442
n |= ctx->nonce.c[i];
lib/libcrypto/modes/ccm128.c
444
n <<= 8;
lib/libcrypto/modes/ccm128.c
446
n |= ctx->nonce.c[15]; /* reconstructed length */
lib/libcrypto/modes/ccm128.c
449
if (n != len)
lib/libcrypto/modes/ccm128.c
452
if ((n = len/16)) {
lib/libcrypto/modes/ccm128.c
453
(*stream)(inp, out, n, key, ctx->nonce.c, ctx->cmac.c);
lib/libcrypto/modes/ccm128.c
454
n *= 16;
lib/libcrypto/modes/ccm128.c
455
inp += n;
lib/libcrypto/modes/ccm128.c
456
out += n;
lib/libcrypto/modes/ccm128.c
457
len -= n;
lib/libcrypto/modes/ccm128.c
459
ctr64_add(ctx->nonce.c, n/16);
lib/libcrypto/modes/cfb128.c
101
out[n] = ivec[n] ^= in[n];
lib/libcrypto/modes/cfb128.c
102
++n;
lib/libcrypto/modes/cfb128.c
105
*num = n;
lib/libcrypto/modes/cfb128.c
110
if (n == 0) {
lib/libcrypto/modes/cfb128.c
113
out[l] = ivec[n] ^= in[l];
lib/libcrypto/modes/cfb128.c
115
n = (n + 1) % 16;
lib/libcrypto/modes/cfb128.c
117
*num = n;
lib/libcrypto/modes/cfb128.c
121
while (n && len) {
lib/libcrypto/modes/cfb128.c
123
*(out++) = ivec[n] ^ (c = *(in++));
lib/libcrypto/modes/cfb128.c
124
ivec[n] = c;
lib/libcrypto/modes/cfb128.c
126
n = (n + 1) % 16;
lib/libcrypto/modes/cfb128.c
135
for (; n < 16; n += sizeof(size_t)) {
lib/libcrypto/modes/cfb128.c
136
size_t t = *(size_t *)(in + n);
lib/libcrypto/modes/cfb128.c
137
*(size_t *)(out + n) = *(size_t *)(ivec +
lib/libcrypto/modes/cfb128.c
138
n) ^ t;
lib/libcrypto/modes/cfb128.c
139
*(size_t *)(ivec + n) = t;
lib/libcrypto/modes/cfb128.c
144
n = 0;
lib/libcrypto/modes/cfb128.c
150
out[n] = ivec[n] ^ (c = in[n]);
lib/libcrypto/modes/cfb128.c
151
ivec[n] = c;
lib/libcrypto/modes/cfb128.c
152
++n;
lib/libcrypto/modes/cfb128.c
155
*num = n;
lib/libcrypto/modes/cfb128.c
161
if (n == 0) {
lib/libcrypto/modes/cfb128.c
164
out[l] = ivec[n] ^ (c = in[l]);
lib/libcrypto/modes/cfb128.c
165
ivec[n] = c;
lib/libcrypto/modes/cfb128.c
167
n = (n + 1) % 16;
lib/libcrypto/modes/cfb128.c
169
*num = n;
lib/libcrypto/modes/cfb128.c
182
int n, rem, num;
lib/libcrypto/modes/cfb128.c
194
for (n = 0; n < num; ++n)
lib/libcrypto/modes/cfb128.c
195
out[n] = (ovec[16 + n] = in[n] ^ ivec[n]);
lib/libcrypto/modes/cfb128.c
197
for (n = 0; n < num; ++n)
lib/libcrypto/modes/cfb128.c
198
out[n] = (ovec[16 + n] = in[n]) ^ ivec[n];
lib/libcrypto/modes/cfb128.c
205
for (n = 0; n < 16; ++n)
lib/libcrypto/modes/cfb128.c
206
ivec[n] = ovec[n + num] << rem |
lib/libcrypto/modes/cfb128.c
207
ovec[n + num + 1] >> (8 - rem);
lib/libcrypto/modes/cfb128.c
219
size_t n;
lib/libcrypto/modes/cfb128.c
222
for (n = 0; n < bits; ++n)
lib/libcrypto/modes/cfb128.c
224
c[0] = (in[n/8] & (1 << (7 - n % 8))) ? 0x80 : 0;
lib/libcrypto/modes/cfb128.c
226
out[n/8] = (out[n/8] & ~(1 << (unsigned int)(7 - n % 8))) |
lib/libcrypto/modes/cfb128.c
227
((d[0] & 0x80) >> (unsigned int)(n % 8));
lib/libcrypto/modes/cfb128.c
238
size_t n;
lib/libcrypto/modes/cfb128.c
240
for (n = 0; n < length; ++n)
lib/libcrypto/modes/cfb128.c
241
cfbr_encrypt_block(&in[n], &out[n], 8, key, ivec, enc, block);
lib/libcrypto/modes/cfb128.c
68
unsigned int n;
lib/libcrypto/modes/cfb128.c
71
n = *num;
lib/libcrypto/modes/cfb128.c
76
while (n && len) {
lib/libcrypto/modes/cfb128.c
77
*(out++) = ivec[n] ^= *(in++);
lib/libcrypto/modes/cfb128.c
79
n = (n + 1) % 16;
lib/libcrypto/modes/cfb128.c
88
for (; n < 16; n += sizeof(size_t)) {
lib/libcrypto/modes/cfb128.c
89
*(size_t *)(out + n) =
lib/libcrypto/modes/cfb128.c
90
*(size_t *)(ivec + n) ^= *(size_t *)(in +
lib/libcrypto/modes/cfb128.c
91
n);
lib/libcrypto/modes/cfb128.c
96
n = 0;
lib/libcrypto/modes/ctr128.c
118
unsigned int n = *num;
lib/libcrypto/modes/ctr128.c
121
OPENSSL_assert(n < 16);
lib/libcrypto/modes/ctr128.c
125
while (n && len) {
lib/libcrypto/modes/ctr128.c
126
*(out++) = *(in++) ^ ecount_buf[n];
lib/libcrypto/modes/ctr128.c
128
n = (n + 1) % 16;
lib/libcrypto/modes/ctr128.c
139
for (; n < 16; n += sizeof(size_t))
lib/libcrypto/modes/ctr128.c
140
*(size_t *)(out + n) =
lib/libcrypto/modes/ctr128.c
141
*(size_t *)(in + n) ^ *(size_t *)(ecount_buf +
lib/libcrypto/modes/ctr128.c
142
n);
lib/libcrypto/modes/ctr128.c
146
n = 0;
lib/libcrypto/modes/ctr128.c
152
out[n] = in[n] ^ ecount_buf[n];
lib/libcrypto/modes/ctr128.c
153
++n;
lib/libcrypto/modes/ctr128.c
156
*num = n;
lib/libcrypto/modes/ctr128.c
161
if (n == 0) {
lib/libcrypto/modes/ctr128.c
165
out[l] = in[l] ^ ecount_buf[n];
lib/libcrypto/modes/ctr128.c
167
n = (n + 1) % 16;
lib/libcrypto/modes/ctr128.c
170
*num = n;
lib/libcrypto/modes/ctr128.c
178
uint32_t n = 12;
lib/libcrypto/modes/ctr128.c
182
--n;
lib/libcrypto/modes/ctr128.c
183
c = counter[n];
lib/libcrypto/modes/ctr128.c
185
counter[n] = c;
lib/libcrypto/modes/ctr128.c
188
} while (n);
lib/libcrypto/modes/ctr128.c
197
unsigned int n = *num;
lib/libcrypto/modes/ctr128.c
200
OPENSSL_assert(n < 16);
lib/libcrypto/modes/ctr128.c
202
while (n && len) {
lib/libcrypto/modes/ctr128.c
203
*(out++) = *(in++) ^ ecount_buf[n];
lib/libcrypto/modes/ctr128.c
205
n = (n + 1) % 16;
lib/libcrypto/modes/ctr128.c
250
out[n] = in[n] ^ ecount_buf[n];
lib/libcrypto/modes/ctr128.c
251
++n;
lib/libcrypto/modes/ctr128.c
255
*num = n;
lib/libcrypto/modes/ctr128.c
66
uint32_t n = 16;
lib/libcrypto/modes/ctr128.c
70
--n;
lib/libcrypto/modes/ctr128.c
71
c = counter[n];
lib/libcrypto/modes/ctr128.c
73
counter[n] = c;
lib/libcrypto/modes/ctr128.c
76
} while (n);
lib/libcrypto/modes/ctr128.c
85
size_t *data, c, n;
lib/libcrypto/modes/ctr128.c
87
n = 16 / sizeof(size_t);
lib/libcrypto/modes/ctr128.c
89
--n;
lib/libcrypto/modes/ctr128.c
90
c = data[n];
lib/libcrypto/modes/ctr128.c
92
data[n] = c;
lib/libcrypto/modes/ctr128.c
95
} while (n);
lib/libcrypto/modes/gcm128.c
307
unsigned int n;
lib/libcrypto/modes/gcm128.c
319
if ((n = ctx->ares) > 0) {
lib/libcrypto/modes/gcm128.c
320
while (n > 0 && len > 0) {
lib/libcrypto/modes/gcm128.c
321
ctx->Xi.c[n] ^= *(aad++);
lib/libcrypto/modes/gcm128.c
322
n = (n + 1) % 16;
lib/libcrypto/modes/gcm128.c
325
if (n > 0) {
lib/libcrypto/modes/gcm128.c
326
ctx->ares = n;
lib/libcrypto/modes/gcm128.c
338
n = (unsigned int)len;
lib/libcrypto/modes/gcm128.c
342
ctx->ares = n;
lib/libcrypto/modes/gcm128.c
352
unsigned int n, ctr;
lib/libcrypto/modes/gcm128.c
369
n = ctx->mres;
lib/libcrypto/modes/gcm128.c
372
if (n == 0) {
lib/libcrypto/modes/gcm128.c
376
ctx->Xi.c[n] ^= out[i] = in[i] ^ ctx->EKi.c[n];
lib/libcrypto/modes/gcm128.c
377
n = (n + 1) % 16;
lib/libcrypto/modes/gcm128.c
378
if (n == 0)
lib/libcrypto/modes/gcm128.c
382
ctx->mres = n;
lib/libcrypto/modes/gcm128.c
392
unsigned int n, ctr;
lib/libcrypto/modes/gcm128.c
410
n = ctx->mres;
lib/libcrypto/modes/gcm128.c
413
if (n == 0) {
lib/libcrypto/modes/gcm128.c
418
out[i] = c ^ ctx->EKi.c[n];
lib/libcrypto/modes/gcm128.c
419
ctx->Xi.c[n] ^= c;
lib/libcrypto/modes/gcm128.c
420
n = (n + 1) % 16;
lib/libcrypto/modes/gcm128.c
421
if (n == 0)
lib/libcrypto/modes/gcm128.c
425
ctx->mres = n;
lib/libcrypto/modes/gcm128.c
435
unsigned int n, ctr;
lib/libcrypto/modes/gcm128.c
452
if ((n = ctx->mres) > 0) {
lib/libcrypto/modes/gcm128.c
453
while (n > 0 && len > 0) {
lib/libcrypto/modes/gcm128.c
454
ctx->Xi.c[n] ^= *(out++) = *(in++) ^ ctx->EKi.c[n];
lib/libcrypto/modes/gcm128.c
455
n = (n + 1) % 16;
lib/libcrypto/modes/gcm128.c
458
if (n > 0) {
lib/libcrypto/modes/gcm128.c
459
ctx->mres = n;
lib/libcrypto/modes/gcm128.c
478
ctx->Xi.c[n] ^= out[n] = in[n] ^ ctx->EKi.c[n];
lib/libcrypto/modes/gcm128.c
479
n++;
lib/libcrypto/modes/gcm128.c
483
ctx->mres = n;
lib/libcrypto/modes/gcm128.c
493
unsigned int n, ctr;
lib/libcrypto/modes/gcm128.c
511
if ((n = ctx->mres) > 0) {
lib/libcrypto/modes/gcm128.c
512
while (n > 0 && len > 0) {
lib/libcrypto/modes/gcm128.c
514
*(out++) = c ^ ctx->EKi.c[n];
lib/libcrypto/modes/gcm128.c
515
ctx->Xi.c[n] ^= c;
lib/libcrypto/modes/gcm128.c
516
n = (n + 1) % 16;
lib/libcrypto/modes/gcm128.c
519
if (n > 0) {
lib/libcrypto/modes/gcm128.c
520
ctx->mres = n;
lib/libcrypto/modes/gcm128.c
539
c = in[n];
lib/libcrypto/modes/gcm128.c
540
ctx->Xi.c[n] ^= c;
lib/libcrypto/modes/gcm128.c
541
out[n] = c ^ ctx->EKi.c[n];
lib/libcrypto/modes/gcm128.c
542
n++;
lib/libcrypto/modes/gcm128.c
546
ctx->mres = n;
lib/libcrypto/modes/ofb128.c
100
++n;
lib/libcrypto/modes/ofb128.c
103
*num = n;
lib/libcrypto/modes/ofb128.c
108
if (n == 0) {
lib/libcrypto/modes/ofb128.c
111
out[l] = in[l] ^ ivec[n];
lib/libcrypto/modes/ofb128.c
113
n = (n + 1) % 16;
lib/libcrypto/modes/ofb128.c
116
*num = n;
lib/libcrypto/modes/ofb128.c
68
unsigned int n;
lib/libcrypto/modes/ofb128.c
71
n = *num;
lib/libcrypto/modes/ofb128.c
75
while (n && len) {
lib/libcrypto/modes/ofb128.c
76
*(out++) = *(in++) ^ ivec[n];
lib/libcrypto/modes/ofb128.c
78
n = (n + 1) % 16;
lib/libcrypto/modes/ofb128.c
87
for (; n < 16; n += sizeof(size_t))
lib/libcrypto/modes/ofb128.c
88
*(size_t *)(out + n) =
lib/libcrypto/modes/ofb128.c
89
*(size_t *)(in + n) ^ *(size_t *)(ivec +
lib/libcrypto/modes/ofb128.c
90
n);
lib/libcrypto/modes/ofb128.c
94
n = 0;
lib/libcrypto/modes/ofb128.c
99
out[n] = in[n] ^ ivec[n];
lib/libcrypto/objects/objects.h
95
ASN1_OBJECT * OBJ_nid2obj(int n);
lib/libcrypto/objects/objects.h
96
const char * OBJ_nid2ln(int n);
lib/libcrypto/objects/objects.h
97
const char * OBJ_nid2sn(int n);
lib/libcrypto/ocsp/ocsp.h
270
X509_EXTENSION *OCSP_crlID_new(const char *url, long *n, char *tim);
lib/libcrypto/ocsp/ocsp_ext.c
483
OCSP_crlID_new(const char *url, long *n, char *tim)
lib/libcrypto/ocsp/ocsp_ext.c
496
if (n) {
lib/libcrypto/ocsp/ocsp_ext.c
499
if (!(ASN1_INTEGER_set(cid->crlNum, *n)))
lib/libcrypto/ocsp/ocsp_ht.c
271
int i, n;
lib/libcrypto/ocsp/ocsp_ht.c
276
n = BIO_read(rctx->io, rctx->iobuf, rctx->iobuflen);
lib/libcrypto/ocsp/ocsp_ht.c
278
if (n <= 0) {
lib/libcrypto/ocsp/ocsp_ht.c
285
if (BIO_write(rctx->mem, rctx->iobuf, n) != n)
lib/libcrypto/ocsp/ocsp_ht.c
291
n = BIO_get_mem_data(rctx->mem, &p);
lib/libcrypto/ocsp/ocsp_ht.c
293
p + (n - rctx->asn1_len), rctx->asn1_len);
lib/libcrypto/ocsp/ocsp_ht.c
334
n = BIO_get_mem_data(rctx->mem, &p);
lib/libcrypto/ocsp/ocsp_ht.c
335
if ((n <= 0) || !memchr(p, '\n', n)) {
lib/libcrypto/ocsp/ocsp_ht.c
336
if (n >= rctx->iobuflen) {
lib/libcrypto/ocsp/ocsp_ht.c
342
n = BIO_gets(rctx->mem, (char *)rctx->iobuf, rctx->iobuflen);
lib/libcrypto/ocsp/ocsp_ht.c
343
if (n <= 0) {
lib/libcrypto/ocsp/ocsp_ht.c
351
if (n == rctx->iobuflen) {
lib/libcrypto/ocsp/ocsp_ht.c
383
n = BIO_get_mem_data(rctx->mem, &p);
lib/libcrypto/ocsp/ocsp_ht.c
384
if (n < 2)
lib/libcrypto/ocsp/ocsp_ht.c
398
if (n < 6)
lib/libcrypto/ocsp/ocsp_ht.c
400
n = *p & 0x7F;
lib/libcrypto/ocsp/ocsp_ht.c
402
if (!n || (n > 4)) {
lib/libcrypto/ocsp/ocsp_ht.c
408
for (i = 0; i < n; i++) {
lib/libcrypto/ocsp/ocsp_ht.c
418
rctx->asn1_len += n + 2;
lib/libcrypto/ocsp/ocsp_ht.c
427
n = BIO_get_mem_data(rctx->mem, &p);
lib/libcrypto/ocsp/ocsp_ht.c
428
if (n < (int)rctx->asn1_len)
lib/libcrypto/pem/pem_lib.c
601
int nlen, n, i, j, outl;
lib/libcrypto/pem/pem_lib.c
628
n = (int)((len > (PEM_BUFSIZE * 5)) ? (PEM_BUFSIZE * 5) : len);
lib/libcrypto/pem/pem_lib.c
629
if (!EVP_EncodeUpdate(&ctx, buf, &outl, &(data[j]), n))
lib/libcrypto/pem/pem_lib.c
634
len -= n;
lib/libcrypto/pem/pem_lib.c
635
j += n;
lib/libcrypto/pem/pvkfmt.c
383
if (!read_lebn(&p, nbyte, &rsa->n))
lib/libcrypto/pem/pvkfmt.c
583
bitlen = BN_num_bits(rsa->n);
lib/libcrypto/pem/pvkfmt.c
584
nbyte = BN_num_bytes(rsa->n);
lib/libcrypto/pem/pvkfmt.c
585
hnbyte = (BN_num_bits(rsa->n) + 15) >> 4;
lib/libcrypto/pem/pvkfmt.c
615
nbyte = BN_num_bytes(rsa->n);
lib/libcrypto/pem/pvkfmt.c
616
hnbyte = (BN_num_bits(rsa->n) + 15) >> 4;
lib/libcrypto/pem/pvkfmt.c
618
write_lebn(out, rsa->n, -1);
lib/libcrypto/pkcs12/p12_key.c
100
int saltlen, int id, int iter, int n, unsigned char *out,
lib/libcrypto/pkcs12/p12_key.c
162
memcpy(out, Ai, min(n, u));
lib/libcrypto/pkcs12/p12_key.c
163
if (u >= n) {
lib/libcrypto/pkcs12/p12_key.c
167
n -= u;
lib/libcrypto/pkcs12/p12_key.c
76
int saltlen, int id, int iter, int n, unsigned char *out,
lib/libcrypto/pkcs12/p12_key.c
91
id, iter, n, out, md_type);
lib/libcrypto/pkcs12/pkcs12.h
186
int saltlen, int id, int iter, int n, unsigned char *out,
lib/libcrypto/pkcs12/pkcs12_local.h
154
int saltlen, int id, int iter, int n, unsigned char *out,
lib/libcrypto/rand/randfile.c
118
n = RAND_DATA;
lib/libcrypto/rand/randfile.c
120
i = (n > BUFSIZE) ? BUFSIZE : n;
lib/libcrypto/rand/randfile.c
121
n -= BUFSIZE;
lib/libcrypto/rand/randfile.c
129
if (n <= 0)
lib/libcrypto/rand/randfile.c
96
int n, fd;
lib/libcrypto/rc2/rc2.c
147
int i, n;
lib/libcrypto/rc2/rc2.c
159
n = 3;
lib/libcrypto/rc2/rc2.c
174
if (--n == 0)
lib/libcrypto/rc2/rc2.c
176
i = (n == 2) ? 6 : 5;
lib/libcrypto/rc2/rc2.c
195
int i, n;
lib/libcrypto/rc2/rc2.c
207
n = 3;
lib/libcrypto/rc2/rc2.c
223
if (--n == 0)
lib/libcrypto/rc2/rc2.c
225
i = (n == 2) ? 6 : 5;
lib/libcrypto/rc2/rc2.c
330
int n = *num;
lib/libcrypto/rc2/rc2.c
338
if (n == 0) {
lib/libcrypto/rc2/rc2.c
351
c = *(in++) ^ iv[n];
lib/libcrypto/rc2/rc2.c
353
iv[n] = c;
lib/libcrypto/rc2/rc2.c
354
n = (n + 1) & 0x07;
lib/libcrypto/rc2/rc2.c
358
if (n == 0) {
lib/libcrypto/rc2/rc2.c
372
c = iv[n];
lib/libcrypto/rc2/rc2.c
373
iv[n] = cc;
lib/libcrypto/rc2/rc2.c
375
n = (n + 1) & 0x07;
lib/libcrypto/rc2/rc2.c
379
*num = n;
lib/libcrypto/rc2/rc2.c
422
int n = *num;
lib/libcrypto/rc2/rc2.c
439
if (n == 0) {
lib/libcrypto/rc2/rc2.c
448
*(out++) = *(in++) ^ d[n];
lib/libcrypto/rc2/rc2.c
449
n = (n + 1) & 0x07;
lib/libcrypto/rc2/rc2.c
459
*num = n;
lib/libcrypto/rc2/rc2_local.h
107
#define C_RC2(n) \
lib/libcrypto/rc2/rc2_local.h
70
#define c2ln(c,l1,l2,n) { \
lib/libcrypto/rc2/rc2_local.h
71
c+=n; \
lib/libcrypto/rc2/rc2_local.h
73
switch (n) { \
lib/libcrypto/rc2/rc2_local.h
93
#define l2cn(l1,l2,c,n) { \
lib/libcrypto/rc2/rc2_local.h
94
c+=n; \
lib/libcrypto/rc2/rc2_local.h
95
switch (n) { \
lib/libcrypto/ripemd/ripemd.c
396
size_t n;
lib/libcrypto/ripemd/ripemd.c
409
n = c->num;
lib/libcrypto/ripemd/ripemd.c
410
if (n != 0) {
lib/libcrypto/ripemd/ripemd.c
413
if (len >= RIPEMD160_CBLOCK || len + n >= RIPEMD160_CBLOCK) {
lib/libcrypto/ripemd/ripemd.c
414
memcpy(p + n, data, RIPEMD160_CBLOCK - n);
lib/libcrypto/ripemd/ripemd.c
416
n = RIPEMD160_CBLOCK - n;
lib/libcrypto/ripemd/ripemd.c
417
data += n;
lib/libcrypto/ripemd/ripemd.c
418
len -= n;
lib/libcrypto/ripemd/ripemd.c
422
memcpy(p + n, data, len);
lib/libcrypto/ripemd/ripemd.c
428
n = len/RIPEMD160_CBLOCK;
lib/libcrypto/ripemd/ripemd.c
429
if (n > 0) {
lib/libcrypto/ripemd/ripemd.c
430
ripemd160_block_data_order(c, data, n);
lib/libcrypto/ripemd/ripemd.c
431
n *= RIPEMD160_CBLOCK;
lib/libcrypto/ripemd/ripemd.c
432
data += n;
lib/libcrypto/ripemd/ripemd.c
433
len -= n;
lib/libcrypto/ripemd/ripemd.c
456
size_t n = c->num;
lib/libcrypto/ripemd/ripemd.c
458
p[n] = 0x80; /* there is always room for one */
lib/libcrypto/ripemd/ripemd.c
459
n++;
lib/libcrypto/ripemd/ripemd.c
461
if (n > (RIPEMD160_CBLOCK - 8)) {
lib/libcrypto/ripemd/ripemd.c
462
memset(p + n, 0, RIPEMD160_CBLOCK - n);
lib/libcrypto/ripemd/ripemd.c
463
n = 0;
lib/libcrypto/ripemd/ripemd.c
467
memset(p + n, 0, RIPEMD160_CBLOCK - 8 - n);
lib/libcrypto/ripemd/ripemd.c
486
RIPEMD160(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/ripemd/ripemd.c
492
RIPEMD160_Update(&c, d, n);
lib/libcrypto/ripemd/ripemd.h
98
unsigned char *RIPEMD160(const unsigned char *d, size_t n,
lib/libcrypto/rsa/rsa.h
366
void RSA_get0_key(const RSA *r, const BIGNUM **n, const BIGNUM **e,
lib/libcrypto/rsa/rsa.h
368
int RSA_set0_key(RSA *r, BIGNUM *n, BIGNUM *e, BIGNUM *d);
lib/libcrypto/rsa/rsa_ameth.c
203
if (BN_cmp(b->pkey.rsa->n, a->pkey.rsa->n) != 0 ||
lib/libcrypto/rsa/rsa_ameth.c
306
return BN_num_bits(pkey->pkey.rsa->n);
lib/libcrypto/rsa/rsa_ameth.c
453
if (x->n != NULL)
lib/libcrypto/rsa/rsa_ameth.c
454
mod_len = BN_num_bits(x->n);
lib/libcrypto/rsa/rsa_ameth.c
474
if (!bn_printf(bp, x->n, off, "%s", str))
lib/libcrypto/rsa/rsa_asn1.c
104
.offset = offsetof(RSA, n),
lib/libcrypto/rsa/rsa_asn1.c
183
.offset = offsetof(RSA, n),
lib/libcrypto/rsa/rsa_blinding.c
231
BN_BLINDING_convert(BIGNUM *n, BIGNUM *inv, BN_BLINDING *b, BN_CTX *ctx)
lib/libcrypto/rsa/rsa_blinding.c
243
ret = BN_mod_mul(n, n, b->A, b->mod, ctx);
lib/libcrypto/rsa/rsa_blinding.c
250
BN_BLINDING_invert(BIGNUM *n, const BIGNUM *inv, BN_BLINDING *b, BN_CTX *ctx)
lib/libcrypto/rsa/rsa_blinding.c
255
return BN_mod_mul(n, n, inv, b->mod, ctx);
lib/libcrypto/rsa/rsa_blinding.c
298
BIGNUM n;
lib/libcrypto/rsa/rsa_blinding.c
316
BN_init(&n);
lib/libcrypto/rsa/rsa_blinding.c
317
BN_with_flags(&n, rsa->n, BN_FLG_CONSTTIME);
lib/libcrypto/rsa/rsa_blinding.c
319
if ((ret = BN_BLINDING_new(e, &n, ctx, rsa->meth->bn_mod_exp,
lib/libcrypto/rsa/rsa_chk.c
118
if (BN_cmp(i, key->n) != 0) {
lib/libcrypto/rsa/rsa_chk.c
66
if (!key->p || !key->q || !key->n || !key->e || !key->d) {
lib/libcrypto/rsa/rsa_eay.c
133
if (BN_num_bits(rsa->n) > OPENSSL_RSA_MAX_MODULUS_BITS) {
lib/libcrypto/rsa/rsa_eay.c
138
if (BN_ucmp(rsa->n, rsa->e) <= 0) {
lib/libcrypto/rsa/rsa_eay.c
144
if (BN_num_bits(rsa->n) > OPENSSL_RSA_SMALL_MODULUS_BITS) {
lib/libcrypto/rsa/rsa_eay.c
157
num = BN_num_bytes(rsa->n);
lib/libcrypto/rsa/rsa_eay.c
187
if (BN_ucmp(f, rsa->n) >= 0) {
lib/libcrypto/rsa/rsa_eay.c
195
CRYPTO_LOCK_RSA, rsa->n, ctx))
lib/libcrypto/rsa/rsa_eay.c
199
if (!rsa->meth->bn_mod_exp(ret, f, rsa->e, rsa->n, ctx,
lib/libcrypto/rsa/rsa_eay.c
327
num = BN_num_bytes(rsa->n);
lib/libcrypto/rsa/rsa_eay.c
355
if (BN_ucmp(f, rsa->n) >= 0) {
lib/libcrypto/rsa/rsa_eay.c
363
CRYPTO_LOCK_RSA, rsa->n, ctx))
lib/libcrypto/rsa/rsa_eay.c
395
if (!rsa->meth->bn_mod_exp(ret, f, &d, rsa->n, ctx,
lib/libcrypto/rsa/rsa_eay.c
406
if (!BN_sub(f, rsa->n, ret))
lib/libcrypto/rsa/rsa_eay.c
456
num = BN_num_bytes(rsa->n);
lib/libcrypto/rsa/rsa_eay.c
475
if (BN_ucmp(f, rsa->n) >= 0) {
lib/libcrypto/rsa/rsa_eay.c
482
CRYPTO_LOCK_RSA, rsa->n, ctx))
lib/libcrypto/rsa/rsa_eay.c
515
if (!rsa->meth->bn_mod_exp(ret, f, &d, rsa->n, ctx,
lib/libcrypto/rsa/rsa_eay.c
567
if (BN_num_bits(rsa->n) > OPENSSL_RSA_MAX_MODULUS_BITS) {
lib/libcrypto/rsa/rsa_eay.c
572
if (BN_ucmp(rsa->n, rsa->e) <= 0) {
lib/libcrypto/rsa/rsa_eay.c
578
if (BN_num_bits(rsa->n) > OPENSSL_RSA_SMALL_MODULUS_BITS) {
lib/libcrypto/rsa/rsa_eay.c
591
num = BN_num_bytes(rsa->n);
lib/libcrypto/rsa/rsa_eay.c
609
if (BN_ucmp(f, rsa->n) >= 0) {
lib/libcrypto/rsa/rsa_eay.c
616
CRYPTO_LOCK_RSA, rsa->n, ctx))
lib/libcrypto/rsa/rsa_eay.c
620
if (!rsa->meth->bn_mod_exp(ret, f, rsa->e, rsa->n, ctx,
lib/libcrypto/rsa/rsa_eay.c
625
if (!BN_sub(ret, rsa->n, ret))
lib/libcrypto/rsa/rsa_eay.c
697
CRYPTO_LOCK_RSA, rsa->n, ctx))
lib/libcrypto/rsa/rsa_eay.c
768
if (rsa->e && rsa->n) {
lib/libcrypto/rsa/rsa_eay.c
769
if (!rsa->meth->bn_mod_exp(vrfy, r0, rsa->e, rsa->n, ctx,
lib/libcrypto/rsa/rsa_eay.c
780
if (!BN_mod_ct(vrfy, vrfy, rsa->n, ctx))
lib/libcrypto/rsa/rsa_eay.c
783
if (!BN_add(vrfy, vrfy, rsa->n))
lib/libcrypto/rsa/rsa_eay.c
796
if (!rsa->meth->bn_mod_exp(r0, I, &d, rsa->n, ctx,
lib/libcrypto/rsa/rsa_eay.c
854
return BN_num_bits(r->n);
lib/libcrypto/rsa/rsa_eay.c
861
return BN_num_bytes(r->n);
lib/libcrypto/rsa/rsa_gen.c
120
if (!rsa->n && ((rsa->n = BN_new()) == NULL))
lib/libcrypto/rsa/rsa_gen.c
150
if (!BN_GENCB_call(cb, 2, n++))
lib/libcrypto/rsa/rsa_gen.c
180
if (!BN_GENCB_call(cb, 2, n++))
lib/libcrypto/rsa/rsa_gen.c
192
if (!BN_mul(rsa->n, rsa->p, rsa->q, ctx))
lib/libcrypto/rsa/rsa_gen.c
85
int bitsp, bitsq, ok = -1, n = 0;
lib/libcrypto/rsa/rsa_lib.c
177
BN_free(r->n);
lib/libcrypto/rsa/rsa_lib.c
230
RSA_get0_key(const RSA *r, const BIGNUM **n, const BIGNUM **e, const BIGNUM **d)
lib/libcrypto/rsa/rsa_lib.c
232
if (n != NULL)
lib/libcrypto/rsa/rsa_lib.c
233
*n = r->n;
lib/libcrypto/rsa/rsa_lib.c
242
RSA_set0_key(RSA *r, BIGNUM *n, BIGNUM *e, BIGNUM *d)
lib/libcrypto/rsa/rsa_lib.c
244
if ((r->n == NULL && n == NULL) || (r->e == NULL && e == NULL))
lib/libcrypto/rsa/rsa_lib.c
247
if (n != NULL) {
lib/libcrypto/rsa/rsa_lib.c
248
BN_free(r->n);
lib/libcrypto/rsa/rsa_lib.c
249
r->n = n;
lib/libcrypto/rsa/rsa_lib.c
334
return r->n;
lib/libcrypto/rsa/rsa_local.h
105
BIGNUM *n;
lib/libcrypto/rsa/rsa_local.h
152
int BN_BLINDING_convert(BIGNUM *n, BIGNUM *r, BN_BLINDING *b, BN_CTX *);
lib/libcrypto/rsa/rsa_local.h
153
int BN_BLINDING_invert(BIGNUM *n, const BIGNUM *r, BN_BLINDING *b, BN_CTX *);
lib/libcrypto/rsa/rsa_pss.c
119
MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
lib/libcrypto/rsa/rsa_pss.c
229
MSBits = (BN_num_bits(rsa->n) - 1) & 0x7;
lib/libcrypto/sha/sha.h
100
unsigned char *SHA1(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha.h
124
unsigned char *SHA224(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha.h
131
unsigned char *SHA256(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha.h
173
unsigned char *SHA384(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha.h
180
unsigned char *SHA512(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha1.c
413
size_t n;
lib/libcrypto/sha/sha1.c
426
n = c->num;
lib/libcrypto/sha/sha1.c
427
if (n != 0) {
lib/libcrypto/sha/sha1.c
430
if (len >= SHA_CBLOCK || len + n >= SHA_CBLOCK) {
lib/libcrypto/sha/sha1.c
431
memcpy(p + n, data, SHA_CBLOCK - n);
lib/libcrypto/sha/sha1.c
433
n = SHA_CBLOCK - n;
lib/libcrypto/sha/sha1.c
434
data += n;
lib/libcrypto/sha/sha1.c
435
len -= n;
lib/libcrypto/sha/sha1.c
439
memcpy(p + n, data, len);
lib/libcrypto/sha/sha1.c
445
n = len/SHA_CBLOCK;
lib/libcrypto/sha/sha1.c
446
if (n > 0) {
lib/libcrypto/sha/sha1.c
447
sha1_block_data_order(c, data, n);
lib/libcrypto/sha/sha1.c
448
n *= SHA_CBLOCK;
lib/libcrypto/sha/sha1.c
449
data += n;
lib/libcrypto/sha/sha1.c
450
len -= n;
lib/libcrypto/sha/sha1.c
473
size_t n = c->num;
lib/libcrypto/sha/sha1.c
475
p[n] = 0x80; /* there is always room for one */
lib/libcrypto/sha/sha1.c
476
n++;
lib/libcrypto/sha/sha1.c
478
if (n > (SHA_CBLOCK - 8)) {
lib/libcrypto/sha/sha1.c
479
memset(p + n, 0, SHA_CBLOCK - n);
lib/libcrypto/sha/sha1.c
480
n = 0;
lib/libcrypto/sha/sha1.c
484
memset(p + n, 0, SHA_CBLOCK - 8 - n);
lib/libcrypto/sha/sha1.c
503
SHA1(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha1.c
509
SHA1_Update(&c, d, n);
lib/libcrypto/sha/sha256.c
324
SHA224(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha256.c
329
SHA256_Update(&c, d, n);
lib/libcrypto/sha/sha256.c
364
size_t n;
lib/libcrypto/sha/sha256.c
377
n = c->num;
lib/libcrypto/sha/sha256.c
378
if (n != 0) {
lib/libcrypto/sha/sha256.c
381
if (len >= SHA_CBLOCK || len + n >= SHA_CBLOCK) {
lib/libcrypto/sha/sha256.c
382
memcpy(p + n, data, SHA_CBLOCK - n);
lib/libcrypto/sha/sha256.c
384
n = SHA_CBLOCK - n;
lib/libcrypto/sha/sha256.c
385
data += n;
lib/libcrypto/sha/sha256.c
386
len -= n;
lib/libcrypto/sha/sha256.c
390
memcpy(p + n, data, len);
lib/libcrypto/sha/sha256.c
396
n = len/SHA_CBLOCK;
lib/libcrypto/sha/sha256.c
397
if (n > 0) {
lib/libcrypto/sha/sha256.c
398
sha256_block_data_order(c, data, n);
lib/libcrypto/sha/sha256.c
399
n *= SHA_CBLOCK;
lib/libcrypto/sha/sha256.c
400
data += n;
lib/libcrypto/sha/sha256.c
401
len -= n;
lib/libcrypto/sha/sha256.c
424
size_t n = c->num;
lib/libcrypto/sha/sha256.c
427
p[n] = 0x80; /* there is always room for one */
lib/libcrypto/sha/sha256.c
428
n++;
lib/libcrypto/sha/sha256.c
430
if (n > (SHA_CBLOCK - 8)) {
lib/libcrypto/sha/sha256.c
431
memset(p + n, 0, SHA_CBLOCK - n);
lib/libcrypto/sha/sha256.c
432
n = 0;
lib/libcrypto/sha/sha256.c
436
memset(p + n, 0, SHA_CBLOCK - 8 - n);
lib/libcrypto/sha/sha256.c
482
SHA256(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha256.c
487
SHA256_Update(&c, d, n);
lib/libcrypto/sha/sha512.c
351
SHA384(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha512.c
356
SHA512_Update(&c, d, n);
lib/libcrypto/sha/sha512.c
410
size_t n = sizeof(c->u) - c->num;
lib/libcrypto/sha/sha512.c
412
if (len < n) {
lib/libcrypto/sha/sha512.c
417
memcpy(p + c->num, data, n);
lib/libcrypto/sha/sha512.c
419
len -= n;
lib/libcrypto/sha/sha512.c
420
data += n;
lib/libcrypto/sha/sha512.c
445
size_t n = c->num;
lib/libcrypto/sha/sha512.c
447
p[n]=0x80; /* There always is a room for one */
lib/libcrypto/sha/sha512.c
448
n++;
lib/libcrypto/sha/sha512.c
449
if (n > (sizeof(c->u) - 16)) {
lib/libcrypto/sha/sha512.c
450
memset(p + n, 0, sizeof(c->u) - n);
lib/libcrypto/sha/sha512.c
451
n = 0;
lib/libcrypto/sha/sha512.c
455
memset(p + n, 0, sizeof(c->u) - 16 - n);
lib/libcrypto/sha/sha512.c
467
for (n = 0; n < SHA512_224_DIGEST_LENGTH/8; n++) {
lib/libcrypto/sha/sha512.c
468
crypto_store_htobe64(md, c->h[n]);
lib/libcrypto/sha/sha512.c
471
crypto_store_htobe32(md, c->h[n] >> 32);
lib/libcrypto/sha/sha512.c
474
for (n = 0; n < SHA512_256_DIGEST_LENGTH/8; n++) {
lib/libcrypto/sha/sha512.c
475
crypto_store_htobe64(md, c->h[n]);
lib/libcrypto/sha/sha512.c
480
for (n = 0; n < SHA384_DIGEST_LENGTH/8; n++) {
lib/libcrypto/sha/sha512.c
481
crypto_store_htobe64(md, c->h[n]);
lib/libcrypto/sha/sha512.c
486
for (n = 0; n < SHA512_DIGEST_LENGTH/8; n++) {
lib/libcrypto/sha/sha512.c
487
crypto_store_htobe64(md, c->h[n]);
lib/libcrypto/sha/sha512.c
500
SHA512(const unsigned char *d, size_t n, unsigned char *md)
lib/libcrypto/sha/sha512.c
505
SHA512_Update(&c, d, n);
lib/libcrypto/sm3/sm3.c
276
size_t n;
lib/libcrypto/sm3/sm3.c
289
n = c->num;
lib/libcrypto/sm3/sm3.c
290
if (n != 0) {
lib/libcrypto/sm3/sm3.c
293
if (len >= SM3_CBLOCK || len + n >= SM3_CBLOCK) {
lib/libcrypto/sm3/sm3.c
294
memcpy(p + n, data, SM3_CBLOCK - n);
lib/libcrypto/sm3/sm3.c
296
n = SM3_CBLOCK - n;
lib/libcrypto/sm3/sm3.c
297
data += n;
lib/libcrypto/sm3/sm3.c
298
len -= n;
lib/libcrypto/sm3/sm3.c
302
memcpy(p + n, data, len);
lib/libcrypto/sm3/sm3.c
308
n = len / SM3_CBLOCK;
lib/libcrypto/sm3/sm3.c
309
if (n > 0) {
lib/libcrypto/sm3/sm3.c
310
sm3_block_data_order(c, data, n);
lib/libcrypto/sm3/sm3.c
311
n *= SM3_CBLOCK;
lib/libcrypto/sm3/sm3.c
312
data += n;
lib/libcrypto/sm3/sm3.c
313
len -= n;
lib/libcrypto/sm3/sm3.c
329
size_t n = c->num;
lib/libcrypto/sm3/sm3.c
331
p[n] = 0x80; /* there is always room for one */
lib/libcrypto/sm3/sm3.c
332
n++;
lib/libcrypto/sm3/sm3.c
334
if (n > (SM3_CBLOCK - 8)) {
lib/libcrypto/sm3/sm3.c
335
memset(p + n, 0, SM3_CBLOCK - n);
lib/libcrypto/sm3/sm3.c
336
n = 0;
lib/libcrypto/sm3/sm3.c
340
memset(p + n, 0, SM3_CBLOCK - 8 - n);
lib/libcrypto/stack/stack.h
69
#define M_sk_value(sk,n) ((sk) ? (sk)->data[n] : NULL)
lib/libcrypto/ts/ts_lib.c
116
int i, critical, n;
lib/libcrypto/ts/ts_lib.c
121
n = X509v3_get_ext_count(extensions);
lib/libcrypto/ts/ts_lib.c
122
for (i = 0; i < n; i++) {
lib/libcrypto/txt_db/txt_db.c
132
n = 0;
lib/libcrypto/txt_db/txt_db.c
133
pp[n++] = p;
lib/libcrypto/txt_db/txt_db.c
147
if (n >= num)
lib/libcrypto/txt_db/txt_db.c
149
pp[n++] = p;
lib/libcrypto/txt_db/txt_db.c
157
if ((n != num) || (*f != '\0')) {
lib/libcrypto/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);
lib/libcrypto/txt_db/txt_db.c
162
pp[n] = p;
lib/libcrypto/txt_db/txt_db.c
216
int i, n;
lib/libcrypto/txt_db/txt_db.c
227
n = sk_OPENSSL_PSTRING_num(db->data);
lib/libcrypto/txt_db/txt_db.c
228
for (i = 0; i < n; i++) {
lib/libcrypto/txt_db/txt_db.c
251
long i, j,n, nn, l, tot = 0;
lib/libcrypto/txt_db/txt_db.c
258
n = sk_OPENSSL_PSTRING_num(db->data);
lib/libcrypto/txt_db/txt_db.c
260
for (i = 0; i < n; i++) {
lib/libcrypto/txt_db/txt_db.c
341
int i, n;
lib/libcrypto/txt_db/txt_db.c
362
for (n = 0; n < db->num_fields; n++)
lib/libcrypto/txt_db/txt_db.c
363
free(p[n]);
lib/libcrypto/txt_db/txt_db.c
365
for (n = 0; n < db->num_fields; n++) {
lib/libcrypto/txt_db/txt_db.c
366
if (((p[n] < (char *)p) ||
lib/libcrypto/txt_db/txt_db.c
367
(p[n] > max)) &&
lib/libcrypto/txt_db/txt_db.c
368
(p[n] != NULL))
lib/libcrypto/txt_db/txt_db.c
369
free(p[n]);
lib/libcrypto/txt_db/txt_db.c
76
int i, add, n;
lib/libcrypto/x509/x509.h
328
const char *X509_verify_cert_error_string(long n);
lib/libcrypto/x509/x509_addr.c
602
int i, n;
lib/libcrypto/x509/x509_addr.c
616
for (n = 16;
lib/libcrypto/x509/x509_addr.c
617
n > 1 && addr[n - 1] == 0x00 && addr[n - 2] == 0x00; n -= 2)
lib/libcrypto/x509/x509_addr.c
619
for (i = 0; i < n; i += 2)
lib/libcrypto/x509/x509_att.c
86
int n;
lib/libcrypto/x509/x509_att.c
94
n = sk_X509_ATTRIBUTE_num(sk);
lib/libcrypto/x509/x509_att.c
95
for (; lastpos < n; lastpos++) {
lib/libcrypto/x509/x509_txt.c
62
X509_verify_cert_error_string(long n)
lib/libcrypto/x509/x509_txt.c
64
switch ((int)n) {
lib/libcrypto/x509/x509_vfy.c
179
int i, n;
lib/libcrypto/x509/x509_vfy.c
1815
int n = sk_X509_num(ctx->chain) - 1;
lib/libcrypto/x509/x509_vfy.c
1816
X509 *xi = sk_X509_value(ctx->chain, n);
lib/libcrypto/x509/x509_vfy.c
182
n = sk_OPENSSL_STRING_num(vpm->hosts);
lib/libcrypto/x509/x509_vfy.c
1826
if (n <= 0)
lib/libcrypto/x509/x509_vfy.c
1829
n--;
lib/libcrypto/x509/x509_vfy.c
1830
ctx->error_depth = n;
lib/libcrypto/x509/x509_vfy.c
1831
xs = sk_X509_value(ctx->chain, n);
lib/libcrypto/x509/x509_vfy.c
1839
while (n >= 0) {
lib/libcrypto/x509/x509_vfy.c
1853
if (!verify_cb_cert(ctx, xi, xi != xs ? n+1 : n,
lib/libcrypto/x509/x509_vfy.c
1857
if (!verify_cb_cert(ctx, xs, n,
lib/libcrypto/x509/x509_vfy.c
186
for (i = 0; i < n; ++i) {
lib/libcrypto/x509/x509_vfy.c
1867
if (!chain_verified && !x509_check_cert_time(ctx, xs, n))
lib/libcrypto/x509/x509_vfy.c
1876
ctx->error_depth = n;
lib/libcrypto/x509/x509_vfy.c
1880
if (--n >= 0) {
lib/libcrypto/x509/x509_vfy.c
1882
xs = sk_X509_value(ctx->chain, n);
lib/libcrypto/x509/x509_vfy.c
192
return n == 0;
lib/libcrypto/x509/x509name.c
149
int n;
lib/libcrypto/x509/x509name.c
158
n = sk_X509_NAME_ENTRY_num(sk);
lib/libcrypto/x509/x509name.c
159
for (lastpos++; lastpos < n; lastpos++) {
lib/libcrypto/x509/x509name.c
183
int i, n, set_prev, set_next;
lib/libcrypto/x509/x509name.c
191
n = sk_X509_NAME_ENTRY_num(sk);
lib/libcrypto/x509/x509name.c
193
if (loc == n)
lib/libcrypto/x509/x509name.c
212
for (i = loc; i < n; i++)
lib/libcrypto/x509/x509name.c
273
int n, i, inc;
lib/libcrypto/x509/x509name.c
279
n = sk_X509_NAME_ENTRY_num(sk);
lib/libcrypto/x509/x509name.c
280
if (loc > n)
lib/libcrypto/x509/x509name.c
281
loc = n;
lib/libcrypto/x509/x509name.c
283
loc = n;
lib/libcrypto/x509/x509name.c
294
if (loc >= n) {
lib/libcrypto/x509/x509name.c
312
n = sk_X509_NAME_ENTRY_num(sk);
lib/libcrypto/x509/x509name.c
313
for (i = loc + 1; i < n; i++)
lib/libcurses/base/lib_addstr.c
101
n = 0;
lib/libcurses/base/lib_addstr.c
103
n++;
lib/libcurses/base/lib_addstr.c
105
if (n > win->_maxx - x + 1)
lib/libcurses/base/lib_addstr.c
106
n = win->_maxx - x + 1;
lib/libcurses/base/lib_addstr.c
107
if (n == 0)
lib/libcurses/base/lib_addstr.c
111
for (i = 0; i < n && ChCharOf(astr[i]) != '\0'; ++i) {
lib/libcurses/base/lib_addstr.c
114
CHANGED_RANGE(line, x, (NCURSES_SIZE_T) (x + n - 1));
lib/libcurses/base/lib_addstr.c
135
wadd_wchnstr(WINDOW *win, const cchar_t *astr, int n)
lib/libcurses/base/lib_addstr.c
146
_nc_viscbuf(astr, n),
lib/libcurses/base/lib_addstr.c
147
n));
lib/libcurses/base/lib_addstr.c
154
if (n < 0) {
lib/libcurses/base/lib_addstr.c
155
n = _nc_wchstrlen(astr);
lib/libcurses/base/lib_addstr.c
157
if (n > win->_maxx - x + 1)
lib/libcurses/base/lib_addstr.c
158
n = win->_maxx - x + 1;
lib/libcurses/base/lib_addstr.c
159
if (n == 0)
lib/libcurses/base/lib_addstr.c
164
end = x + n - 1;
lib/libcurses/base/lib_addstr.c
186
for (i = 0; i < n && CharOf(astr[i]) != L'\0' && x <= win->_maxx; ++i) {
lib/libcurses/base/lib_addstr.c
227
waddnwstr(WINDOW *win, const wchar_t *str, int n)
lib/libcurses/base/lib_addstr.c
231
T((T_CALLED("waddnwstr(%p,%s,%d)"), (void *) win, _nc_viswbufn(str, n), n));
lib/libcurses/base/lib_addstr.c
239
((n > 0) ? n : (int) wcslen(str))));
lib/libcurses/base/lib_addstr.c
240
if (n < 0)
lib/libcurses/base/lib_addstr.c
241
n = INT_MAX;
lib/libcurses/base/lib_addstr.c
242
while ((*str != L('\0')) && (n-- > 0)) {
lib/libcurses/base/lib_addstr.c
53
waddnstr(WINDOW *win, const char *astr, int n)
lib/libcurses/base/lib_addstr.c
58
T((T_CALLED("waddnstr(%p,%s,%d)"), (void *) win, _nc_visbufn(astr, n), n));
lib/libcurses/base/lib_addstr.c
66
((n > 0) ? n : (int) strlen(str))));
lib/libcurses/base/lib_addstr.c
67
if (n < 0)
lib/libcurses/base/lib_addstr.c
68
n = INT_MAX;
lib/libcurses/base/lib_addstr.c
69
while ((*str != '\0') && (n-- > 0)) {
lib/libcurses/base/lib_addstr.c
85
waddchnstr(WINDOW *win, const chtype *astr, int n)
lib/libcurses/base/lib_addstr.c
92
T((T_CALLED("waddchnstr(%p,%p,%d)"), (void *) win, (const void *) astr, n));
lib/libcurses/base/lib_addstr.c
99
if (n < 0) {
lib/libcurses/base/lib_chgat.c
52
int n,
lib/libcurses/base/lib_chgat.c
62
n,
lib/libcurses/base/lib_chgat.c
73
for (i = win->_curx; i <= win->_maxx && (n == -1 || (n-- > 0)); i++) {
lib/libcurses/base/lib_color.c
101
#define OkColorHi(n) (((n) < COLORS) && ((n) < maxcolors))
lib/libcurses/base/lib_color.c
102
#define InPalette(n) ((n) >= 0 && (n) < MAX_PALETTE)
lib/libcurses/base/lib_color.c
227
int n;
lib/libcurses/base/lib_color.c
231
for (n = 0; n < COLORS; n++) {
lib/libcurses/base/lib_color.c
232
if (InPalette(n)) {
lib/libcurses/base/lib_color.c
233
SP_PARM->_color_table[n] = tp[n];
lib/libcurses/base/lib_color.c
235
SP_PARM->_color_table[n] = tp[n % MAX_PALETTE];
lib/libcurses/base/lib_color.c
237
SP_PARM->_color_table[n].green = 100;
lib/libcurses/base/lib_color.c
239
if (SP_PARM->_color_table[n].red)
lib/libcurses/base/lib_color.c
240
SP_PARM->_color_table[n].red = 1000;
lib/libcurses/base/lib_color.c
241
if (SP_PARM->_color_table[n].green)
lib/libcurses/base/lib_color.c
242
SP_PARM->_color_table[n].green = 1000;
lib/libcurses/base/lib_color.c
243
if (SP_PARM->_color_table[n].blue)
lib/libcurses/base/lib_color.c
244
SP_PARM->_color_table[n].blue = 1000;
lib/libcurses/base/lib_color.c
260
int n;
lib/libcurses/base/lib_color.c
270
n = (width + 2) / 3;
lib/libcurses/base/lib_color.c
271
result->bits.red = UChar(n);
lib/libcurses/base/lib_color.c
272
result->bits.green = UChar(n);
lib/libcurses/base/lib_color.c
273
result->bits.blue = UChar(width - (2 * n));
lib/libcurses/base/lib_color.c
274
} else if ((n = tigetnum(name)) > 0) {
lib/libcurses/base/lib_color.c
275
result->bits.red = UChar(n);
lib/libcurses/base/lib_color.c
276
result->bits.green = UChar(n);
lib/libcurses/base/lib_color.c
277
result->bits.blue = UChar(n);
lib/libcurses/base/lib_color.c
279
int red = n;
lib/libcurses/base/lib_color.c
280
int green = n;
lib/libcurses/base/lib_color.c
281
int blue = width - (2 * n);
lib/libcurses/base/lib_color.c
285
blue = width - (2 * n);
lib/libcurses/base/lib_color.c
288
green = n;
lib/libcurses/base/lib_color.c
291
red = n;
lib/libcurses/base/lib_color.c
705
#define okRGB(n) ((n) >= 0 && (n) <= 1000)
lib/libcurses/base/lib_getch.c
245
int n;
lib/libcurses/base/lib_getch.c
278
n = 1;
lib/libcurses/base/lib_getch.c
286
n = 1;
lib/libcurses/base/lib_getch.c
291
n = 1;
lib/libcurses/base/lib_getch.c
299
n = 1;
lib/libcurses/base/lib_getch.c
305
n = (ch == -1) ? -1 : 1;
lib/libcurses/base/lib_getch.c
315
n = _nc_console_read(sp,
lib/libcurses/base/lib_getch.c
322
n = _nc_mingw_console_read(sp,
lib/libcurses/base/lib_getch.c
327
n = CallDriver_1(sp, td_read, &buf);
lib/libcurses/base/lib_getch.c
337
n = _nc_console_read(sp,
lib/libcurses/base/lib_getch.c
342
n = (int) read(sp->_ifd, &c2, (size_t) 1);
lib/libcurses/base/lib_getch.c
349
if ((n == -1) || (n == 0)) {
lib/libcurses/base/lib_getch.c
350
TR(TRACE_IEVENT, ("read(%d,&ch,1)=%d, errno=%d", sp->_ifd, n, errno));
lib/libcurses/base/lib_getch.c
353
TR(TRACE_IEVENT, ("read %d characters", n));
lib/libcurses/base/lib_hline.c
51
whline(WINDOW *win, chtype ch, int n)
lib/libcurses/base/lib_hline.c
55
T((T_CALLED("whline(%p,%s,%d)"), (void *) win, _tracechtype(ch), n));
lib/libcurses/base/lib_hline.c
61
int end = start + n - 1;
lib/libcurses/base/lib_inchstr.c
50
winchnstr(WINDOW *win, chtype *str, int n)
lib/libcurses/base/lib_inchstr.c
54
T((T_CALLED("winchnstr(%p,%p,%d)"), (void *) win, (void *) str, n));
lib/libcurses/base/lib_inchstr.c
63
for (; (n < 0 || (i < n)) && (col + i <= win->_maxx); i++) {
lib/libcurses/base/lib_insdel.c
51
winsdelln(WINDOW *win, int n)
lib/libcurses/base/lib_insdel.c
55
T((T_CALLED("winsdelln(%p,%d)"), (void *) win, n));
lib/libcurses/base/lib_insdel.c
58
if (n != 0) {
lib/libcurses/base/lib_insdel.c
59
_nc_scroll_window(win, -n, win->_cury, win->_maxy,
lib/libcurses/base/lib_insnstr.c
49
winsnstr(WINDOW *win, const char *s, int n)
lib/libcurses/base/lib_insnstr.c
54
T((T_CALLED("winsnstr(%p,%s,%d)"), (void *) win, _nc_visbufn(s, n), n));
lib/libcurses/base/lib_insnstr.c
67
size_t nn = (n > 0) ? (size_t) n : strlen(s);
lib/libcurses/base/lib_insnstr.c
88
for (cp = str; (n <= 0 || (cp - str) < n) && *cp; cp++) {
lib/libcurses/base/lib_instr.c
50
winnstr(WINDOW *win, char *str, int n)
lib/libcurses/base/lib_instr.c
54
T((T_CALLED("winnstr(%p,%p,%d)"), (void *) win, str, n));
lib/libcurses/base/lib_instr.c
63
if (n < 0)
lib/libcurses/base/lib_instr.c
64
n = win->_maxx - col + 1;
lib/libcurses/base/lib_instr.c
66
for (; i < n;) {
lib/libcurses/base/lib_instr.c
93
if (have > n || (int) need <= 0) {
lib/libcurses/base/lib_mouse.c
1172
int n;
lib/libcurses/base/lib_mouse.c
1174
for (n = 0; n < 2; ++n) {
lib/libcurses/base/lib_mouse.c
1179
rc = _nc_conv_to_utf32(&coords[n], kbuf + check, (unsigned)
lib/libcurses/base/lib_mouse.c
1185
if (n >= 2)
lib/libcurses/base/lib_mouse.c
1510
int n;
lib/libcurses/base/lib_mouse.c
1548
for (n = runcount; n < EV_MAX; n++) {
lib/libcurses/base/lib_mouse.c
940
#define PRESS_POSITION(n) \
lib/libcurses/base/lib_mouse.c
942
eventp->bstate = MASK_PRESS(n); \
lib/libcurses/base/lib_mouse.c
943
sp->_mouse_bstate |= MASK_PRESS(n); \
lib/libcurses/base/lib_mouse.c
945
eventp->bstate = MASK_RELEASE(n); \
lib/libcurses/base/lib_mouse.c
946
sp->_mouse_bstate &= ~MASK_PRESS(n); \
lib/libcurses/base/lib_mouse.c
950
#define PRESS_POSITION(n) \
lib/libcurses/base/lib_mouse.c
952
eventp->bstate = (mmask_t) ((sp->_mouse_bstate & MASK_PRESS(n)) \
lib/libcurses/base/lib_mouse.c
954
: MASK_PRESS(n)); \
lib/libcurses/base/lib_mouse.c
955
sp->_mouse_bstate |= MASK_PRESS(n); \
lib/libcurses/base/lib_pad.c
134
int m, n;
lib/libcurses/base/lib_pad.c
232
for (j = pmincol, n = smincol; j <= pmaxcol; j++, n++) {
lib/libcurses/base/lib_pad.c
245
if (!CharEq(ch, nline->text[n])) {
lib/libcurses/base/lib_pad.c
246
nline->text[n] = ch;
lib/libcurses/base/lib_pad.c
247
CHANGED_CELL(nline, n);
lib/libcurses/base/lib_screen.c
227
size_t n;
lib/libcurses/base/lib_screen.c
249
for (n = 0; n < SIZEOF(scr_attrs); ++n) {
lib/libcurses/base/lib_screen.c
250
if ((size_t) (next - source) == strlen(scr_attrs[n].name)) {
lib/libcurses/base/lib_screen.c
251
if (scr_attrs[n].attr) {
lib/libcurses/base/lib_screen.c
252
*target |= scr_attrs[n].attr;
lib/libcurses/base/lib_screen.c
378
size_t n;
lib/libcurses/base/lib_screen.c
404
for (n = 0; n < SIZEOF(scr_params); ++n) {
lib/libcurses/base/lib_screen.c
405
if (!strcmp(name, scr_params[n].name)) {
lib/libcurses/base/lib_screen.c
406
void *data = (void *) ((char *) win + scr_params[n].offset);
lib/libcurses/base/lib_screen.c
408
switch (scr_params[n].type) {
lib/libcurses/base/lib_screen.c
453
int n;
lib/libcurses/base/lib_screen.c
456
for (n = 1; n < len; ++n) {
lib/libcurses/base/lib_screen.c
457
target[n] = target[0];
lib/libcurses/base/lib_screen.c
458
SetWidecExt(CHDEREF(target), n);
lib/libcurses/base/lib_screen.c
561
int n;
lib/libcurses/base/lib_screen.c
595
for (n = 0; n <= nwin->_maxy; n++) {
lib/libcurses/base/lib_screen.c
596
if (read_block(nwin->_line[n].text, linesize, filep) < 0) {
lib/libcurses/base/lib_screen.c
609
for (n = 0; n <= nwin->_maxy; n++) {
lib/libcurses/base/lib_screen.c
614
T(("...failed to read string for row %d", n + 1));
lib/libcurses/base/lib_screen.c
619
if (row != (n + 1) || *next != ':') {
lib/libcurses/base/lib_screen.c
620
T(("...failed to read row-number %d", n + 1));
lib/libcurses/base/lib_screen.c
625
if (read_row(++next, &prior, nwin->_line[n].text, tmp._maxx
lib/libcurses/base/lib_screen.c
627
T(("...failed to read cells for row %d", n + 1));
lib/libcurses/base/lib_screen.c
671
size_t n;
lib/libcurses/base/lib_screen.c
677
for (n = 0; n < SIZEOF(scr_attrs); ++n) {
lib/libcurses/base/lib_screen.c
678
if ((source & scr_attrs[n].attr) != 0 ||
lib/libcurses/base/lib_screen.c
680
(scr_attrs[n].attr == A_NORMAL))) {
lib/libcurses/base/lib_screen.c
686
_nc_STRCPY(target, scr_attrs[n].name, limit);
lib/libcurses/base/lib_screen.c
709
size_t n;
lib/libcurses/base/lib_screen.c
728
for (n = 0; n < SIZEOF(source->chars); ++n) {
lib/libcurses/base/lib_screen.c
729
unsigned uch = (unsigned) source->chars[n];
lib/libcurses/base/lib_screen.c
732
if (n) {
lib/libcurses/base/lib_scroll.c
106
if (n > 0) {
lib/libcurses/base/lib_scroll.c
107
limit = bottom - n;
lib/libcurses/base/lib_scroll.c
110
win->_line[line + n].text,
lib/libcurses/base/lib_scroll.c
113
win->_line[line + n].oldindex);
lib/libcurses/base/lib_scroll.c
125
int next = WINDOW_EXT(win, addch_y) + n;
lib/libcurses/base/lib_scroll.c
141
wscrl(WINDOW *win, int n)
lib/libcurses/base/lib_scroll.c
143
T((T_CALLED("wscrl(%p,%d)"), (void *) win, n));
lib/libcurses/base/lib_scroll.c
150
if (n != 0) {
lib/libcurses/base/lib_scroll.c
151
_nc_scroll_window(win, n, win->_regtop, win->_regbottom, win->_nc_bkgd);
lib/libcurses/base/lib_scroll.c
53
int const n,
lib/libcurses/base/lib_scroll.c
64
(void *) win, n, (long) top, (long) bottom));
lib/libcurses/base/lib_scroll.c
83
#define BottomLimit(n) ((n) >= 0 && (n) >= top)
lib/libcurses/base/lib_scroll.c
84
#define TopLimit(n) ((n) <= win->_maxy && (n) <= bottom)
lib/libcurses/base/lib_scroll.c
87
if (n < 0) {
lib/libcurses/base/lib_scroll.c
88
limit = top - n;
lib/libcurses/base/lib_scroll.c
90
TR(TRACE_MOVE, ("...copying %d to %d", line + n, line));
lib/libcurses/base/lib_scroll.c
92
win->_line[line + n].text,
lib/libcurses/base/lib_scroll.c
95
win->_line[line + n].oldindex);
lib/libcurses/base/lib_slklab.c
49
NCURSES_SP_NAME(slk_label) (NCURSES_SP_DCLx int n)
lib/libcurses/base/lib_slklab.c
51
T((T_CALLED("slk_label(%p,%d)"), (void *) SP_PARM, n));
lib/libcurses/base/lib_slklab.c
53
if (SP_PARM == 0 || SP_PARM->_slk == 0 || n < 1 || n > SP_PARM->_slk->labcnt)
lib/libcurses/base/lib_slklab.c
55
returnPtr(SP_PARM->_slk->ent[n - 1].ent_text);
lib/libcurses/base/lib_slklab.c
60
slk_label(int n)
lib/libcurses/base/lib_slklab.c
62
return NCURSES_SP_NAME(slk_label) (CURRENT_SCREEN, n);
lib/libcurses/base/lib_touch.c
82
wtouchln(WINDOW *win, int y, int n, int changed)
lib/libcurses/base/lib_touch.c
86
T((T_CALLED("wtouchln(%p,%d,%d,%d)"), (void *) win, y, n, changed));
lib/libcurses/base/lib_touch.c
88
if (!win || (n < 0) || (y < 0) || (y > win->_maxy))
lib/libcurses/base/lib_touch.c
91
for (i = y; i < y + n; i++) {
lib/libcurses/base/lib_vline.c
51
wvline(WINDOW *win, chtype ch, int n)
lib/libcurses/base/lib_vline.c
55
T((T_CALLED("wvline(%p,%s,%d)"), (void *) win, _tracechtype(ch), n));
lib/libcurses/base/lib_vline.c
61
int end = row + n - 1;
lib/libcurses/base/new_pair.c
105
int n;
lib/libcurses/base/new_pair.c
109
for (n = 0; n < sp->_pair_alloc; ++n) {
lib/libcurses/base/new_pair.c
110
if (list[n].mode != cpFREE) {
lib/libcurses/base/new_pair.c
116
n, n == pair ? '@' : ':', list[n].next, list[n].prev);
lib/libcurses/base/new_pair.c
184
int n;
lib/libcurses/base/new_pair.c
185
for (n = 0; n < sp->_pair_alloc; ++n) {
lib/libcurses/base/new_pair.c
186
tdelete(&sp->_color_pairs[n], &sp->_ordered_pairs, compare_data);
lib/libcurses/base/new_pair.c
253
int n;
lib/libcurses/base/new_pair.c
254
for (n = 0; n < length; ++n) {
lib/libcurses/base/new_pair.c
255
void *find = tfind(source + n, &sp->_ordered_pairs, compare_data);
lib/libcurses/base/new_pair.c
257
tdelete(source + n, &sp->_ordered_pairs, compare_data);
lib/libcurses/base/new_pair.c
258
tsearch(target + n, &sp->_ordered_pairs, compare_data);
lib/libcurses/base/vsscanf.c
219
unsigned n;
lib/libcurses/base/vsscanf.c
238
for (n = 0; format[n] != 0 && state != sFinal; ++n) {
lib/libcurses/base/vsscanf.c
239
my_fmt[n] = format[n];
lib/libcurses/base/vsscanf.c
242
if (format[n] == '%')
lib/libcurses/base/vsscanf.c
246
if (format[n] == '%') {
lib/libcurses/base/vsscanf.c
248
} else if (format[n] == L_SQUARE) {
lib/libcurses/base/vsscanf.c
252
--n;
lib/libcurses/base/vsscanf.c
257
if (format[n] == '^') {
lib/libcurses/base/vsscanf.c
258
++n;
lib/libcurses/base/vsscanf.c
259
my_fmt[n] = format[n];
lib/libcurses/base/vsscanf.c
263
if (format[n] == R_SQUARE) {
lib/libcurses/base/vsscanf.c
269
if (format[n] == '*') {
lib/libcurses/base/vsscanf.c
272
if ((ctest = final_ch(format[n], other)) != cUnknown) {
lib/libcurses/base/vsscanf.c
275
} else if ((otest = other_ch(format[n])) != oUnknown) {
lib/libcurses/base/vsscanf.c
277
} else if (isalpha(UChar(format[n]))) {
lib/libcurses/base/vsscanf.c
287
my_fmt[n] = '\0';
lib/libcurses/base/vsscanf.c
288
format += n;
lib/libcurses/curses.h
1187
#define getnstr(s, n) wgetnstr(stdscr, s, (n))
lib/libcurses/curses.h
1244
#define hline(ch, n) whline(stdscr, ch, (n))
lib/libcurses/curses.h
1245
#define vline(ch, n) wvline(stdscr, ch, (n))
lib/libcurses/curses.h
1261
#define COLOR_PAIR(n) (NCURSES_BITS((n), 0) & A_COLOR)
lib/libcurses/curses.h
1269
#define addchnstr(str,n) waddchnstr(stdscr,(str),(n))
lib/libcurses/curses.h
1271
#define addnstr(str,n) waddnstr(stdscr,(str),(n))
lib/libcurses/curses.h
1282
#define chgat(n,a,c,o) wchgat(stdscr,(n),(a),(c),(o))
lib/libcurses/curses.h
1294
#define inchnstr(s,n) winchnstr(stdscr,(s),(n))
lib/libcurses/curses.h
1296
#define innstr(s,n) winnstr(stdscr,(s),(n))
lib/libcurses/curses.h
1298
#define insdelln(n) winsdelln(stdscr,(n))
lib/libcurses/curses.h
1300
#define insnstr(s,n) winsnstr(stdscr,(s),(n))
lib/libcurses/curses.h
1305
#define scrl(n) wscrl(stdscr,(n))
lib/libcurses/curses.h
1318
#define mvwaddchnstr(win,y,x,str,n) (wmove((win),(y),(x)) == ERR ? ERR : waddchnstr((win),(str),(n)))
lib/libcurses/curses.h
1320
#define mvwaddnstr(win,y,x,str,n) (wmove((win),(y),(x)) == ERR ? ERR : waddnstr((win),(str),(n)))
lib/libcurses/curses.h
1322
#define mvwchgat(win,y,x,n,a,c,o) (wmove((win),(y),(x)) == ERR ? ERR : wchgat((win),(n),(a),(c),(o)))
lib/libcurses/curses.h
1325
#define mvwgetnstr(win,y,x,str,n) (wmove((win),(y),(x)) == ERR ? ERR : wgetnstr((win),(str),(n)))
lib/libcurses/curses.h
1327
#define mvwhline(win,y,x,c,n) (wmove((win),(y),(x)) == ERR ? ERR : whline((win),(c),(n)))
lib/libcurses/curses.h
1329
#define mvwinchnstr(win,y,x,s,n) (wmove((win),(y),(x)) == ERR ? ERR : winchnstr((win),(s),(n)))
lib/libcurses/curses.h
1331
#define mvwinnstr(win,y,x,s,n) (wmove((win),(y),(x)) == ERR ? ERR : winnstr((win),(s),(n)))
lib/libcurses/curses.h
1333
#define mvwinsnstr(win,y,x,s,n) (wmove((win),(y),(x)) == ERR ? ERR : winsnstr((win),(s),(n)))
lib/libcurses/curses.h
1336
#define mvwvline(win,y,x,c,n) (wmove((win),(y),(x)) == ERR ? ERR : wvline((win),(c),(n)))
lib/libcurses/curses.h
1339
#define mvaddchnstr(y,x,str,n) mvwaddchnstr(stdscr,(y),(x),(str),(n))
lib/libcurses/curses.h
1341
#define mvaddnstr(y,x,str,n) mvwaddnstr(stdscr,(y),(x),(str),(n))
lib/libcurses/curses.h
1343
#define mvchgat(y,x,n,a,c,o) mvwchgat(stdscr,(y),(x),(n),(a),(c),(o))
lib/libcurses/curses.h
1346
#define mvgetnstr(y,x,str,n) mvwgetnstr(stdscr,(y),(x),(str),(n))
lib/libcurses/curses.h
1348
#define mvhline(y,x,c,n) mvwhline(stdscr,(y),(x),(c),(n))
lib/libcurses/curses.h
1350
#define mvinchnstr(y,x,s,n) mvwinchnstr(stdscr,(y),(x),(s),(n))
lib/libcurses/curses.h
1352
#define mvinnstr(y,x,s,n) mvwinnstr(stdscr,(y),(x),(s),(n))
lib/libcurses/curses.h
1354
#define mvinsnstr(y,x,s,n) mvwinsnstr(stdscr,(y),(x),(s),(n))
lib/libcurses/curses.h
1357
#define mvvline(y,x,c,n) mvwvline(stdscr,(y),(x),(c),(n))
lib/libcurses/curses.h
1534
#define KEY_F(n) (KEY_F0+(n)) /* Value of function key n */
lib/libcurses/curses.h
1856
#define add_wchnstr(str,n) wadd_wchnstr(stdscr,(str),(n))
lib/libcurses/curses.h
1858
#define addnwstr(wstr,n) waddnwstr(stdscr,(wstr),(n))
lib/libcurses/curses.h
1868
#define getn_wstr(t,n) wgetn_wstr(stdscr,(t),(n))
lib/libcurses/curses.h
1869
#define hline_set(c,n) whline_set(stdscr,(c),(n))
lib/libcurses/curses.h
1871
#define in_wchnstr(c,n) win_wchnstr(stdscr,(c),(n))
lib/libcurses/curses.h
1873
#define innwstr(c,n) winnwstr(stdscr,(c),(n))
lib/libcurses/curses.h
1874
#define ins_nwstr(t,n) wins_nwstr(stdscr,(t),(n))
lib/libcurses/curses.h
1878
#define vline_set(c,n) wvline_set(stdscr,(c),(n))
lib/libcurses/curses.h
1890
#define mvadd_wchnstr(y,x,s,n) mvwadd_wchnstr(stdscr,(y),(x),(s),(n))
lib/libcurses/curses.h
1892
#define mvaddnwstr(y,x,wstr,n) mvwaddnwstr(stdscr,(y),(x),(wstr),(n))
lib/libcurses/curses.h
1896
#define mvgetn_wstr(y,x,t,n) mvwgetn_wstr(stdscr,(y),(x),(t),(n))
lib/libcurses/curses.h
1897
#define mvhline_set(y,x,c,n) mvwhline_set(stdscr,(y),(x),(c),(n))
lib/libcurses/curses.h
1899
#define mvin_wchnstr(y,x,c,n) mvwin_wchnstr(stdscr,(y),(x),(c),(n))
lib/libcurses/curses.h
1901
#define mvinnwstr(y,x,c,n) mvwinnwstr(stdscr,(y),(x),(c),(n))
lib/libcurses/curses.h
1902
#define mvins_nwstr(y,x,t,n) mvwins_nwstr(stdscr,(y),(x),(t),(n))
lib/libcurses/curses.h
1906
#define mvvline_set(y,x,c,n) mvwvline_set(stdscr,(y),(x),(c),(n))
lib/libcurses/curses.h
1909
#define mvwadd_wchnstr(win,y,x,s,n) (wmove(win,(y),(x)) == ERR ? ERR : wadd_wchnstr((win),(s),(n)))
lib/libcurses/curses.h
1911
#define mvwaddnwstr(win,y,x,wstr,n) (wmove(win,(y),(x)) == ERR ? ERR : waddnwstr((win),(wstr),(n)))
lib/libcurses/curses.h
1915
#define mvwgetn_wstr(win,y,x,t,n) (wmove(win,(y),(x)) == ERR ? ERR : wgetn_wstr((win),(t),(n)))
lib/libcurses/curses.h
1916
#define mvwhline_set(win,y,x,c,n) (wmove(win,(y),(x)) == ERR ? ERR : whline_set((win),(c),(n)))
lib/libcurses/curses.h
1918
#define mvwin_wchnstr(win,y,x,c,n) (wmove(win,(y),(x)) == ERR ? ERR : win_wchnstr((win),(c),(n)))
lib/libcurses/curses.h
1920
#define mvwinnwstr(win,y,x,c,n) (wmove(win,(y),(x)) == ERR ? ERR : winnwstr((win),(c),(n)))
lib/libcurses/curses.h
1921
#define mvwins_nwstr(win,y,x,t,n) (wmove(win,(y),(x)) == ERR ? ERR : wins_nwstr((win),(t),(n)))
lib/libcurses/curses.h
1925
#define mvwvline_set(win,y,x,c,n) (wmove(win,(y),(x)) == ERR ? ERR : wvline_set((win),(c),(n)))
lib/libcurses/curses.priv.h
1349
#define COUNT_OUTCHARS(n) _nc_count_outchars(n);
lib/libcurses/curses.priv.h
1351
#define COUNT_OUTCHARS(n) _nc_outchars += (n);
lib/libcurses/curses.priv.h
1354
#define COUNT_OUTCHARS(n) /* nothing */
lib/libcurses/curses.priv.h
149
# define CASTxPTR(n) (unsigned long)(intptr_t)(void*)(n)
lib/libcurses/curses.priv.h
151
# define CASTxPTR(n) (intptr_t)(void*)(n)
lib/libcurses/curses.priv.h
156
# define CASTxPTR(n) (long)(void*)(n)
lib/libcurses/curses.priv.h
1669
#define TR(n, a) if (USE_TRACEF(n)) _nc_locked_tracef a
lib/libcurses/curses.priv.h
1754
#define TR(n, a)
lib/libcurses/curses.priv.h
2151
extern NCURSES_EXPORT(void) _nc_scroll_oldhash (int n, int top, int bot);
lib/libcurses/curses.priv.h
2235
#define wcrtomb(s,wc,n) _nc_wctomb(s,wc)
lib/libcurses/curses.priv.h
2238
#define mbtowc(pwc,s,n) _nc_mbtowc(pwc,s,n)
lib/libcurses/curses.priv.h
2241
#define mblen(s,n) _nc_mblen(s, n)
lib/libcurses/curses.priv.h
247
#define memmove(d,s,n) bcopy(s,d,n)
lib/libcurses/curses.priv.h
249
#define memmove(d,s,n) _nc_memmove(d,s,n)
lib/libcurses/curses.priv.h
2604
extern NCURSES_EXPORT(void) NCURSES_SP_NAME(_nc_scroll_oldhash)(SCREEN*, int n, int top, int bot);
lib/libcurses/curses.priv.h
507
#define ColorPair(n) (NCURSES_BITS(n, 0) & A_COLOR)
lib/libcurses/curses.priv.h
514
#define unColor(n) unColor2(AttrOf(n))
lib/libcurses/curses.priv.h
924
#define _nc_getstr_limit(n) \
lib/libcurses/curses.priv.h
925
(((n) < 0) \
lib/libcurses/curses.priv.h
927
: (((n) > my_getstr_limit) \
lib/libcurses/curses.priv.h
929
: (n)))
lib/libcurses/nc_string.h
63
#define _nc_STRCAT(d,s,n) NCURSES_VOID strlcat((d),(s),NCURSES_CAST(size_t,n))
lib/libcurses/nc_string.h
64
#define _nc_STRNCAT(d,s,m,n) NCURSES_VOID strlcat((d),(s),NCURSES_CAST(size_t,m))
lib/libcurses/nc_string.h
66
#define _nc_STRCAT(d,s,n) NCURSES_VOID strcat((d),(s))
lib/libcurses/nc_string.h
67
#define _nc_STRNCAT(d,s,m,n) NCURSES_VOID strncat((d),(s),(n))
lib/libcurses/nc_string.h
71
#define _nc_STRCPY(d,s,n) NCURSES_VOID strlcpy((d),(s),NCURSES_CAST(size_t,n))
lib/libcurses/nc_string.h
72
#define _nc_STRNCPY(d,s,n) NCURSES_VOID strlcpy((d),(s),NCURSES_CAST(size_t,n))
lib/libcurses/nc_string.h
74
#define _nc_STRCPY(d,s,n) NCURSES_VOID strcpy((d),(s))
lib/libcurses/nc_string.h
75
#define _nc_STRNCPY(d,s,n) NCURSES_VOID strncpy((d),(s),(n))
lib/libcurses/nc_string.h
84
#define _nc_SLIMIT(n) NCURSES_CAST(size_t,n),
lib/libcurses/nc_string.h
87
#define _nc_SLIMIT(n) /* nothing */
lib/libcurses/nc_tparm.h
56
#define TPARM_N(n) (TPARM_ARG)(n)
lib/libcurses/new_pair.h
53
#define LIMIT_TYPED(n,t) \
lib/libcurses/new_pair.h
54
(t)(((n) > MAX_OF_TYPE(t)) \
lib/libcurses/new_pair.h
56
: ((n) < -MAX_OF_TYPE(t)) \
lib/libcurses/new_pair.h
58
: (n))
lib/libcurses/new_pair.h
60
#define limit_COLOR(n) LIMIT_TYPED(n,NCURSES_COLOR_T)
lib/libcurses/new_pair.h
61
#define limit_PAIRS(n) LIMIT_TYPED(n,NCURSES_PAIRS_T)
lib/libcurses/report_hashing.c
42
int n;
lib/libcurses/report_hashing.c
47
for (n = 0; table[n] != NULL; ++n) {
lib/libcurses/report_hashing.c
48
entry_ptr = _nc_find_entry(table[n], hash_table);
lib/libcurses/report_hashing.c
50
printf(" %s\n", table[n]);
lib/libcurses/term_entry.h
72
#define for_each_boolean(n,tp) for(n = 0; n < NUM_BOOLEANS(tp); n++)
lib/libcurses/term_entry.h
73
#define for_each_number(n,tp) for(n = 0; n < NUM_NUMBERS(tp); n++)
lib/libcurses/term_entry.h
74
#define for_each_string(n,tp) for(n = 0; n < NUM_STRINGS(tp); n++)
lib/libcurses/term_entry.h
77
#define for_each_ext_boolean(n,tp) for(n = BOOLCOUNT; (int) n < (int) NUM_BOOLEANS(tp); n++)
lib/libcurses/term_entry.h
78
#define for_each_ext_number(n,tp) for(n = NUMCOUNT; (int) n < (int) NUM_NUMBERS(tp); n++)
lib/libcurses/term_entry.h
79
#define for_each_ext_string(n,tp) for(n = STRCOUNT; (int) n < (int) NUM_STRINGS(tp); n++)
lib/libcurses/tic.h
137
#define DEBUG_LEVEL(n) ((n) << TRACE_SHIFT)
lib/libcurses/tic.h
139
#define set_trace_level(n) \
lib/libcurses/tic.h
141
_nc_tracing |= DEBUG_LEVEL(n)
lib/libcurses/tic.h
144
#define DEBUG(n, a) if (_nc_tracing >= DEBUG_LEVEL(n)) _tracef a
lib/libcurses/tic.h
146
#define DEBUG(n, a) /*nothing*/
lib/libcurses/tic.h
91
#define BYTE(p,n) (unsigned char)((p)[n])
lib/libcurses/tinfo/alloc_entry.c
146
unsigned i, n;
lib/libcurses/tinfo/alloc_entry.c
179
n = (unsigned) (tp->term_names - stringbuf);
lib/libcurses/tinfo/alloc_entry.c
202
tp->term_names = tp->str_table + n;
lib/libcurses/tinfo/alloc_entry.c
217
if ((n = (unsigned) NUM_EXT_NAMES(tp)) != 0) {
lib/libcurses/tinfo/alloc_entry.c
218
if (n < SIZEOF(offsets)) {
lib/libcurses/tinfo/alloc_entry.c
221
for (i = 0; i < n; i++) {
lib/libcurses/tinfo/alloc_entry.c
226
for (i = 0, offset = 0; i < n; i++) {
lib/libcurses/tinfo/alloc_ttype.c
113
int n, m, base;
lib/libcurses/tinfo/alloc_ttype.c
133
for (n = to->ext_Booleans - 1,
lib/libcurses/tinfo/alloc_ttype.c
137
to->Booleans[base + m] = to->Booleans[base + n--];
lib/libcurses/tinfo/alloc_ttype.c
151
for (n = to->ext_Numbers - 1,
lib/libcurses/tinfo/alloc_ttype.c
155
to->Numbers[base + m] = to->Numbers[base + n--];
lib/libcurses/tinfo/alloc_ttype.c
169
for (n = to->ext_Strings - 1,
lib/libcurses/tinfo/alloc_ttype.c
173
to->Strings[base + m] = to->Strings[base + n--];
lib/libcurses/tinfo/alloc_ttype.c
253
_nc_ext_data_index(TERMTYPE2 *tp, int n, int token_type)
lib/libcurses/tinfo/alloc_ttype.c
257
n += (tp->num_Booleans - tp->ext_Booleans);
lib/libcurses/tinfo/alloc_ttype.c
260
n += (tp->num_Numbers - tp->ext_Numbers)
lib/libcurses/tinfo/alloc_ttype.c
265
n += (tp->num_Strings - tp->ext_Strings)
lib/libcurses/tinfo/alloc_ttype.c
268
return n;
lib/libcurses/tinfo/alloc_ttype.c
446
int n;
lib/libcurses/tinfo/alloc_ttype.c
449
for (n = 0, same = TRUE; n < na; n++) {
lib/libcurses/tinfo/alloc_ttype.c
450
if (strcmp(to->ext_Names[n], from->ext_Names[n])) {
lib/libcurses/tinfo/alloc_ttype.c
58
int n = 0;
lib/libcurses/tinfo/alloc_ttype.c
62
dst[n++] = *a++;
lib/libcurses/tinfo/alloc_ttype.c
65
dst[n++] = *b++;
lib/libcurses/tinfo/alloc_ttype.c
68
dst[n++] = *a;
lib/libcurses/tinfo/alloc_ttype.c
74
dst[n++] = *a++;
lib/libcurses/tinfo/alloc_ttype.c
77
dst[n++] = *b++;
lib/libcurses/tinfo/alloc_ttype.c
79
DEBUG(4, ("merge_names -> %d", n));
lib/libcurses/tinfo/alloc_ttype.c
80
return n;
lib/libcurses/tinfo/alloc_ttype.c
86
int n;
lib/libcurses/tinfo/alloc_ttype.c
89
for (n = item; n < length; ++n) {
lib/libcurses/tinfo/alloc_ttype.c
90
if (!strcmp(table[n], name)) {
lib/libcurses/tinfo/alloc_ttype.c
91
DEBUG(4, ("found name '%s' @%d", name, n));
lib/libcurses/tinfo/alloc_ttype.c
92
result = n;
lib/libcurses/tinfo/captoinfo.c
252
getparm(int parm, int n)
lib/libcurses/tinfo/captoinfo.c
264
for (nn = 0; nn < n; ++nn) {
lib/libcurses/tinfo/captoinfo.c
270
if (n > 1) {
lib/libcurses/tinfo/captoinfo.c
273
while (n-- > 0) {
lib/libcurses/tinfo/captoinfo.c
614
#define octal_fixup(n, c) fixups[n].ch = ((fixups[n].ch << 3) | ((c) - '0'))
lib/libcurses/tinfo/captoinfo.c
740
int n;
lib/libcurses/tinfo/captoinfo.c
741
for (n = 0; n < fix; ++n) {
lib/libcurses/tinfo/captoinfo.c
743
fixups[myfix].ch |= (str[n] - '0');
lib/libcurses/tinfo/captoinfo.c
787
int n;
lib/libcurses/tinfo/captoinfo.c
791
for (n = 0; n < 3; ++n) {
lib/libcurses/tinfo/captoinfo.c
792
if (isoctal(str[n])) {
lib/libcurses/tinfo/captoinfo.c
793
octal_fixup(myfix, str[n]);
lib/libcurses/tinfo/comp_parse.c
290
unsigned n;
lib/libcurses/tinfo/comp_parse.c
292
for (n = 0; n < num_names; ++n) {
lib/libcurses/tinfo/comp_parse.c
293
if (!strcmp(p->ext_Names[n], name))
lib/libcurses/tinfo/comp_parse.c
297
n = num_names + 1;
lib/libcurses/tinfo/comp_parse.c
299
return n;
lib/libcurses/tinfo/comp_parse.c
364
unsigned n;
lib/libcurses/tinfo/comp_parse.c
366
for (n = 0; n < num_names; ++n) {
lib/libcurses/tinfo/comp_parse.c
367
const char *capname = from->ext_Names[n];
lib/libcurses/tinfo/comp_parse.c
369
int tf = extended_captype(from, n);
lib/libcurses/tinfo/comp_parse.c
378
from->ext_Names[n],
lib/libcurses/tinfo/comp_parse.c
384
from->ext_Names[n],
lib/libcurses/tinfo/comp_parse.c
579
int n = (int) (qp->nuses - 1);
lib/libcurses/tinfo/comp_parse.c
580
validate_merge(&merged, qp->uses[n].link);
lib/libcurses/tinfo/comp_parse.c
581
_nc_merge_entry(&merged, qp->uses[n].link);
lib/libcurses/tinfo/comp_parse.c
582
free(qp->uses[n].name);
lib/libcurses/tinfo/db_iterator.c
188
DBDIRS n;
lib/libcurses/tinfo/db_iterator.c
189
for (n = (DBDIRS) 0; n < dbdLAST; ++n) {
lib/libcurses/tinfo/db_iterator.c
190
if (my_vars[n].name != 0
lib/libcurses/tinfo/db_iterator.c
191
&& update_getenv(my_vars[n].name, n)) {
lib/libcurses/tinfo/init_keytry.c
105
n - STRCOUNT + KEY_MAX);
lib/libcurses/tinfo/init_keytry.c
78
unsigned n;
lib/libcurses/tinfo/init_keytry.c
80
for (n = 0; _nc_tinfo_fkeys[n].code; n++) {
lib/libcurses/tinfo/init_keytry.c
81
if (_nc_tinfo_fkeys[n].offset < STRCOUNT) {
lib/libcurses/tinfo/init_keytry.c
83
CUR Strings[_nc_tinfo_fkeys[n].offset],
lib/libcurses/tinfo/init_keytry.c
84
_nc_tinfo_fkeys[n].code);
lib/libcurses/tinfo/init_keytry.c
95
for (n = STRCOUNT; n < NUM_STRINGS(tp); ++n) {
lib/libcurses/tinfo/init_keytry.c
96
const char *name = ExtStrname(tp, (int) n, strnames);
lib/libcurses/tinfo/init_keytry.c
97
char *value = tp->Strings[n];
lib/libcurses/tinfo/lib_acs.c
227
size_t n, m;
lib/libcurses/tinfo/lib_acs.c
229
for (n = 1, m = 0; n < ACS_LEN; n++) {
lib/libcurses/tinfo/lib_acs.c
230
if (real_map[n] != 0) {
lib/libcurses/tinfo/lib_acs.c
231
show[m++] = (char) n;
lib/libcurses/tinfo/lib_acs.c
232
show[m++] = (char) ChCharOf(real_map[n]);
lib/libcurses/tinfo/lib_setup.c
507
unsigned n;
lib/libcurses/tinfo/lib_setup.c
508
for_each_boolean(n, tp) {
lib/libcurses/tinfo/lib_setup.c
509
if (!VALID_BOOLEAN(tp->Booleans[n]))
lib/libcurses/tinfo/lib_setup.c
510
tp->Booleans[n] = FALSE;
lib/libcurses/tinfo/lib_setup.c
512
for_each_string(n, tp) {
lib/libcurses/tinfo/lib_setup.c
513
if (tp->Strings[n] == CANCELLED_STRING)
lib/libcurses/tinfo/lib_setup.c
514
tp->Strings[n] = ABSENT_STRING;
lib/libcurses/tinfo/lib_setup.c
89
# define WINSIZE_ROWS(n) (int)n.ts_lines
lib/libcurses/tinfo/lib_setup.c
90
# define WINSIZE_COLS(n) (int)n.ts_cols
lib/libcurses/tinfo/lib_setup.c
95
# define WINSIZE_ROWS(n) (int)n.ws_row
lib/libcurses/tinfo/lib_setup.c
96
# define WINSIZE_COLS(n) (int)n.ws_col
lib/libcurses/tinfo/lib_termcap.c
126
for (n = 0; n < TGETENT_MAX; ++n) {
lib/libcurses/tinfo/lib_termcap.c
127
bool same_result = (MyCache[n].last_used && MyCache[n].last_bufp == bufp);
lib/libcurses/tinfo/lib_termcap.c
129
CacheInx = n;
lib/libcurses/tinfo/lib_termcap.c
142
CacheInx = n;
lib/libcurses/tinfo/lib_termcap.c
97
int n;
lib/libcurses/tinfo/lib_tparm.c
646
int n;
lib/libcurses/tinfo/lib_tparm.c
654
for (n = 0; n < result->num_actual; ++n) {
lib/libcurses/tinfo/lib_tparm.c
655
if (result->p_is_s[n])
lib/libcurses/tinfo/lib_tparm.c
656
result->tparm_type |= (1 << n);
lib/libcurses/tinfo/lib_tparm.c
841
int n;
lib/libcurses/tinfo/lib_tparm.c
842
for (n = 0; n < rc; ++n) {
lib/libcurses/tinfo/lib_tparm.c
843
save_char(tps, target[n]);
lib/libcurses/tinfo/lib_win32con.c
889
DWORD n = 0;
lib/libcurses/tinfo/lib_win32con.c
896
f = PeekConsoleInput(hdl, pInpRec, nRead, &n);
lib/libcurses/tinfo/lib_win32con.c
898
for (i = 0; i < n; i++) {
lib/libcurses/tinfo/make_hash.c
211
#define SetType(n,t) \
lib/libcurses/tinfo/make_hash.c
213
name_table[n].ute_type |= (int)(1 << (t)); \
lib/libcurses/tinfo/make_hash.c
215
name_table[n].ute_type = (t)
lib/libcurses/tinfo/make_hash.c
217
#define GetType(n) \
lib/libcurses/tinfo/make_hash.c
219
? get_type(name_table[n].ute_type) \
lib/libcurses/tinfo/make_hash.c
220
: typenames[name_table[n].ute_type])
lib/libcurses/tinfo/make_hash.c
226
unsigned n;
lib/libcurses/tinfo/make_hash.c
228
for (n = 0; n < 3; ++n) {
lib/libcurses/tinfo/make_hash.c
229
if ((1 << n) & type_mask) {
lib/libcurses/tinfo/make_hash.c
230
size_t want = 5 + strlen(typenames[n]);
lib/libcurses/tinfo/make_hash.c
233
result, typenames[n]);
lib/libcurses/tinfo/make_hash.c
239
_nc_STRCAT(result, typenames[n], sizeof(result));
lib/libcurses/tinfo/make_hash.c
256
unsigned n;
lib/libcurses/tinfo/make_hash.c
286
for (n = 0; (n < tablesize) && fgets(buffer, BUFSIZ, stdin);) {
lib/libcurses/tinfo/make_hash.c
349
n++;
lib/libcurses/tinfo/make_hash.c
363
for (n = 0; n < tablesize; n++) {
lib/libcurses/tinfo/make_hash.c
364
nxt = (int) strlen(name_table[n].ute_name) + 5;
lib/libcurses/tinfo/make_hash.c
369
printf("\"%s\\0\" ", name_table[n].ute_name);
lib/libcurses/tinfo/make_hash.c
379
for (n = 0; n < tablesize; n++) {
lib/libcurses/tinfo/make_hash.c
380
printf("\t%s %15d,\t%10s,", L_BRACE, len, GetType(n));
lib/libcurses/tinfo/make_hash.c
383
name_table[n].ute_argc,
lib/libcurses/tinfo/make_hash.c
384
name_table[n].ute_args);
lib/libcurses/tinfo/make_hash.c
386
name_table[n].ute_index,
lib/libcurses/tinfo/make_hash.c
387
name_table[n].ute_link,
lib/libcurses/tinfo/make_hash.c
389
n < tablesize - 1 ? ',' : ' ');
lib/libcurses/tinfo/make_hash.c
390
len += (int) strlen(name_table[n].ute_name) + 1;
lib/libcurses/tinfo/make_hash.c
402
for (n = 0; n < tablesize; n++) {
lib/libcurses/tinfo/make_hash.c
404
name_table[n].ute_name);
lib/libcurses/tinfo/make_hash.c
405
printf("\t%s %15s,\t%10s,", L_BRACE, buffer, GetType(n));
lib/libcurses/tinfo/make_hash.c
408
name_table[n].ute_argc,
lib/libcurses/tinfo/make_hash.c
409
name_table[n].ute_args);
lib/libcurses/tinfo/make_hash.c
411
name_table[n].ute_index,
lib/libcurses/tinfo/make_hash.c
412
name_table[n].ute_link,
lib/libcurses/tinfo/make_hash.c
414
n < tablesize - 1 ? ',' : ' ');
lib/libcurses/tinfo/make_hash.c
423
for (n = 0; n < HASHTABSIZE; n++) {
lib/libcurses/tinfo/make_hash.c
424
printf("\t%3d,\n", hash_table[n]);
lib/libcurses/tinfo/make_hash.c
438
for (n = 0; (n < tablesize); ++n) {
lib/libcurses/tinfo/make_hash.c
439
free((void *) name_table[n].ute_name);
lib/libcurses/tinfo/make_keys.c
156
int n;
lib/libcurses/tinfo/make_keys.c
157
for (n = 1; n < argc; n++) {
lib/libcurses/tinfo/make_keys.c
158
FILE *fp = fopen(argv[n], "r");
lib/libcurses/tinfo/make_keys.c
55
unsigned n;
lib/libcurses/tinfo/make_keys.c
56
for (n = 0; strnames[n] != 0; n++) {
lib/libcurses/tinfo/make_keys.c
59
for (n = 0; strfnames[n] != 0; n++) {
lib/libcurses/tinfo/make_keys.c
69
unsigned n;
lib/libcurses/tinfo/make_keys.c
71
for (n = 0; strnames[n] != 0; n++) {
lib/libcurses/tinfo/make_keys.c
72
if (!strcmp(name, strnames[n])) {
lib/libcurses/tinfo/make_keys.c
78
for (n = 0; strfnames[n] != 0; n++) {
lib/libcurses/tinfo/make_keys.c
79
if (!strcmp(name, strfnames[n])) {
lib/libcurses/tinfo/make_keys.c
85
return found ? n : unknown();
lib/libcurses/tinfo/name_match.c
76
unsigned n;
lib/libcurses/tinfo/name_match.c
81
for (n = 0; n < MAX_NAME_SIZE; n++) {
lib/libcurses/tinfo/name_match.c
82
if ((FirstName[n] = src[n]) == '\0'
lib/libcurses/tinfo/name_match.c
83
|| (FirstName[n] == '|'))
lib/libcurses/tinfo/name_match.c
86
FirstName[n] = '\0';
lib/libcurses/tinfo/obsolete.c
109
#define CH(n) UChar((source) >> ((n) * 8))
lib/libcurses/tinfo/obsolete.c
183
#define CH(n) UChar((*target) >> ((n) * 8))
lib/libcurses/tinfo/obsolete.c
83
_nc_memmove(void *s1, const void *s2, size_t n)
lib/libcurses/tinfo/obsolete.c
85
if (n != 0) {
lib/libcurses/tinfo/obsolete.c
86
if ((DST + n > SRC) && (SRC + n > DST)) {
lib/libcurses/tinfo/obsolete.c
90
if (length < n) {
lib/libcurses/tinfo/obsolete.c
91
length = (n * 3) / 2;
lib/libcurses/tinfo/obsolete.c
94
for (j = 0; j < n; j++)
lib/libcurses/tinfo/obsolete.c
98
while (n-- != 0)
lib/libcurses/tinfo/obsolete.c
99
DST[n] = SRC[n];
lib/libcurses/tinfo/parse_entry.c
100
for (n = 0; n < actual; n++) {
lib/libcurses/tinfo/parse_entry.c
101
if (!strcmp(name, tp->ext_Names[n])) {
lib/libcurses/tinfo/parse_entry.c
102
if (n > (unsigned) (tp->ext_Booleans + tp->ext_Numbers)) {
lib/libcurses/tinfo/parse_entry.c
104
} else if (n > tp->ext_Booleans) {
lib/libcurses/tinfo/parse_entry.c
121
for (n = first, found = FALSE; n < last; n++) {
lib/libcurses/tinfo/parse_entry.c
122
int cmp = strcmp(tp->ext_Names[n], name);
lib/libcurses/tinfo/parse_entry.c
126
offset = n;
lib/libcurses/tinfo/parse_entry.c
127
tindex = n - first;
lib/libcurses/tinfo/parse_entry.c
586
int n = entry_ptr->nte_index;
lib/libcurses/tinfo/parse_entry.c
589
(n < (int) SIZEOF(parametrized))
lib/libcurses/tinfo/parse_entry.c
590
? parametrized[n]
lib/libcurses/tinfo/parse_entry.c
76
unsigned first, last, n;
lib/libcurses/tinfo/parse_entry.c
941
size_t n;
lib/libcurses/tinfo/parse_entry.c
944
for (n = 0; n < SIZEOF(ko_xlate); ++n) {
lib/libcurses/tinfo/parse_entry.c
945
if (len == strlen(ko_xlate[n].from)
lib/libcurses/tinfo/parse_entry.c
946
&& strncmp(ko_xlate[n].from, base, len) == 0) {
lib/libcurses/tinfo/parse_entry.c
947
ap = ko_xlate + n;
lib/libcurses/tinfo/read_entry.c
267
int n;
lib/libcurses/tinfo/read_entry.c
268
for (n = 0; n < limit; ++n) {
lib/libcurses/tinfo/read_entry.c
269
if (MyNumber(buffer + (n * 2)) > 0) {
lib/libcurses/tinfo/read_entry.c
49
#define MyNumber(n) (short) LOW_MSB(n)
lib/libcurses/tinfo/read_termcap.c
368
int n;
lib/libcurses/tinfo/read_termcap.c
370
n = (int) read(fd, buf, sizeof(buf));
lib/libcurses/tinfo/read_termcap.c
371
if (n <= 0) {
lib/libcurses/tinfo/read_termcap.c
374
if (n < 0) {
lib/libcurses/tinfo/read_termcap.c
382
b_end = buf + n;
lib/libcurses/tinfo/read_termcap.c
876
size_t n, count = 0;
lib/libcurses/tinfo/read_termcap.c
883
for (n = 1; n < count; n++) {
lib/libcurses/tinfo/read_termcap.c
884
char *s = list[n];
lib/libcurses/tinfo/tinfo_driver.c
1133
size_t n, m;
lib/libcurses/tinfo/tinfo_driver.c
1135
for (n = 1, m = 0; n < ACS_LEN; n++) {
lib/libcurses/tinfo/tinfo_driver.c
1136
if (real_map[n] != 0) {
lib/libcurses/tinfo/tinfo_driver.c
1137
show[m++] = (char) n;
lib/libcurses/tinfo/tinfo_driver.c
1138
show[m++] = (char) ChCharOf(real_map[n]);
lib/libcurses/tinfo/tinfo_driver.c
1276
int n;
lib/libcurses/tinfo/tinfo_driver.c
1287
n = _nc_console_read(sp,
lib/libcurses/tinfo/tinfo_driver.c
1291
n = (int) read(sp->_ifd, &c2, (size_t) 1);
lib/libcurses/tinfo/tinfo_driver.c
1297
return n;
lib/libcurses/tinfo/tinfo_driver.c
64
# define WINSIZE_ROWS(n) (int)n.ts_lines
lib/libcurses/tinfo/tinfo_driver.c
65
# define WINSIZE_COLS(n) (int)n.ts_cols
lib/libcurses/tinfo/tinfo_driver.c
70
# define WINSIZE_ROWS(n) (int)n.ws_row
lib/libcurses/tinfo/tinfo_driver.c
71
# define WINSIZE_COLS(n) (int)n.ws_col
lib/libcurses/tinfo/tinfo_driver.c
763
#define InPalette(n) ((n) >= 0 && (n) < MAX_PALETTE)
lib/libcurses/tinfo/trim_sgr0.c
116
unsigned n;
lib/libcurses/tinfo/trim_sgr0.c
118
for (n = 0; n < len_s - len_a; ++n) {
lib/libcurses/tinfo/trim_sgr0.c
119
s[n] = s[n + len_a];
lib/libcurses/tinfo/trim_sgr0.c
121
_nc_STRCPY(s + n, attr, strlen(s) + 1);
lib/libcurses/tinfo/write_entry.c
51
#define TRACE_NUM(n) if (VALID_NUMERIC(Numbers[n])) { \
lib/libcurses/tinfo/write_entry.c
52
TRACE_OUT(("put Numbers[%u]=%d", (unsigned) (n), Numbers[n])); }
lib/libcurses/tinfo/write_entry.c
55
#define TRACE_NUM(n) /* nothing */
lib/libcurses/trace/lib_trace.c
282
int n;
lib/libcurses/trace/lib_trace.c
283
for (n = 1; n < MyLevel; n++)
lib/libcurses/trace/lib_trace.c
390
size_t n;
lib/libcurses/trace/lib_trace.c
404
for (n = 0; n < size; ++n) {
lib/libcurses/trace/lib_trace.c
406
? UChar(source[size - n - 1])
lib/libcurses/trace/lib_trace.c
407
: UChar(source[n]));
lib/libcurses/trace/lib_trace.c
408
if (ch != 0 || (n + 1) >= size)
lib/libcurses/trace/visbuf.c
265
unsigned n;
lib/libcurses/trace/visbuf.c
267
for (n = 0; buf[n] != 0; ++n) {
lib/libcurses/trace/visbuf.c
270
if (mylen < ++n) {
lib/libcurses/trace/visbuf.c
271
mylen = n + 80;
lib/libcurses/trace/visbuf.c
278
for (n = 0; buf[n] != 0; ++n) {
lib/libcurses/trace/visbuf.c
279
mybuf[n] = (wchar_t) buf[n];
lib/libcurses/trace/visbuf.c
281
mybuf[n] = L'\0';
lib/libcurses/tty/hardscroll.c
161
# define OLDNUM(sp,n) oldnums[n]
lib/libcurses/tty/hardscroll.c
164
# define TR(n, a) if (_nc_tracing & (n)) { _tracef a ; putchar('\n'); }
lib/libcurses/tty/hardscroll.c
178
# define OLDNUM(sp,n) oldnums(sp)[n]
lib/libcurses/tty/hardscroll.c
180
# define OLDNUM(sp,n) NewScreen(sp)->_line[n].oldindex
lib/libcurses/tty/hardscroll.c
318
int n;
lib/libcurses/tty/hardscroll.c
321
for (n = 0; n < screen_lines(SP_PARM); n++) {
lib/libcurses/tty/hardscroll.c
322
int number = OLDNUM(SP_PARM, n);
lib/libcurses/tty/hardscroll.c
357
int n;
lib/libcurses/tty/hardscroll.c
359
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hardscroll.c
360
oldnums[n] = _NEWINDEX;
lib/libcurses/tty/hardscroll.c
367
n = 0;
lib/libcurses/tty/hardscroll.c
374
oldnums[n++] = atoi(st);
lib/libcurses/tty/hashmap.c
103
# define OLDNUM(sp,n) (sp)->_oldnum_list[n]
lib/libcurses/tty/hashmap.c
104
# define OLDTEXT(sp,n) CurScreen(sp)->_line[n].text
lib/libcurses/tty/hashmap.c
107
# define PENDING(sp,n) (NewScreen(sp)->_line[n].firstchar != _NOCHANGE)
lib/libcurses/tty/hashmap.c
447
NCURSES_SP_NAME(_nc_scroll_oldhash) (NCURSES_SP_DCLx int n, int top, int bot)
lib/libcurses/tty/hashmap.c
455
size = sizeof(*(oldhash(SP_PARM))) * (size_t) (bot - top + 1 - abs(n));
lib/libcurses/tty/hashmap.c
456
if (n > 0) {
lib/libcurses/tty/hashmap.c
457
memmove(oldhash(SP_PARM) + top, oldhash(SP_PARM) + top + n, size);
lib/libcurses/tty/hashmap.c
458
for (i = bot; i > bot - n; i--)
lib/libcurses/tty/hashmap.c
461
memmove(oldhash(SP_PARM) + top - n, oldhash(SP_PARM) + top, size);
lib/libcurses/tty/hashmap.c
462
for (i = top; i < top - n; i++)
lib/libcurses/tty/hashmap.c
469
_nc_scroll_oldhash(int n, int top, int bot)
lib/libcurses/tty/hashmap.c
471
NCURSES_SP_NAME(_nc_scroll_oldhash) (CURRENT_SCREEN, n, top, bot);
lib/libcurses/tty/hashmap.c
491
size_t n;
lib/libcurses/tty/hashmap.c
492
for (n = 0; n < sizeof(table) / sizeof(table[0]); n++)
lib/libcurses/tty/hashmap.c
493
fprintf(stderr, "%s\n", table[n]);
lib/libcurses/tty/hashmap.c
500
int n;
lib/libcurses/tty/hashmap.c
506
for (n = 0; n < screen_lines(sp); n++) {
lib/libcurses/tty/hashmap.c
507
reallines[n] = n;
lib/libcurses/tty/hashmap.c
508
oldnums[n] = _NEWINDEX;
lib/libcurses/tty/hashmap.c
509
CharOf(oldtext[n][0]) = CharOf(newtext[n][0]) = '.';
lib/libcurses/tty/hashmap.c
529
for (n = 0; n < screen_lines(sp); n++) {
lib/libcurses/tty/hashmap.c
530
reallines[n] = n;
lib/libcurses/tty/hashmap.c
531
oldnums[n] = _NEWINDEX;
lib/libcurses/tty/hashmap.c
533
n = 0;
lib/libcurses/tty/hashmap.c
536
oldnums[n++] = atoi(st);
lib/libcurses/tty/hashmap.c
542
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hashmap.c
543
CharOf(newtext[n][0]) = '.';
lib/libcurses/tty/hashmap.c
544
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hashmap.c
545
if (line[n + 1] == '\n')
lib/libcurses/tty/hashmap.c
548
CharOf(newtext[n][0]) = line[n + 1];
lib/libcurses/tty/hashmap.c
552
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hashmap.c
553
CharOf(oldtext[n][0]) = '.';
lib/libcurses/tty/hashmap.c
554
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hashmap.c
555
if (line[n + 1] == '\n')
lib/libcurses/tty/hashmap.c
558
CharOf(oldtext[n][0]) = line[n + 1];
lib/libcurses/tty/hashmap.c
566
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hashmap.c
567
putchar(CharOf(oldtext[n][0]));
lib/libcurses/tty/hashmap.c
571
for (n = 0; n < screen_lines(sp); n++)
lib/libcurses/tty/hashmap.c
572
putchar(CharOf(newtext[n][0]));
lib/libcurses/tty/hashmap.c
86
# define TR(n, a) if (_nc_tracing & (n)) { _tracef a ; putchar('\n'); }
lib/libcurses/tty/hashmap.c
88
# define TR(n, a) { _tracef a ; putchar('\n'); }
lib/libcurses/tty/hashmap.c
96
# define OLDNUM(sp,n) oldnums[n]
lib/libcurses/tty/hashmap.c
97
# define OLDTEXT(sp,n) oldtext[n]
lib/libcurses/tty/hashmap.c
99
# define PENDING(sp,n) 1
lib/libcurses/tty/lib_mvcur.c
1182
roll(int n)
lib/libcurses/tty/lib_mvcur.c
1186
i = (RAND_MAX / n) * n;
lib/libcurses/tty/lib_mvcur.c
1189
return (j % n);
lib/libcurses/tty/lib_mvcur.c
1208
int fy, fx, ty, tx, n, i;
lib/libcurses/tty/lib_mvcur.c
1323
else if (sscanf(buf, "t %d", &n) == 1) {
lib/libcurses/tty/lib_mvcur.c
1331
for (i = 0; i < n; i++) {
lib/libcurses/tty/lib_mvcur.c
1359
perchar = cumtime / n;
lib/libcurses/tty/lib_mvcur.c
1362
n, xmits, (int) cumtime, perchar);
lib/libcurses/tty/lib_mvcur.c
559
int n, vcost = 0, hcost = 0;
lib/libcurses/tty/lib_mvcur.c
572
n = (to_y - from_y);
lib/libcurses/tty/lib_mvcur.c
577
TIPARM_1(parm_down_cursor, n))) {
lib/libcurses/tty/lib_mvcur.c
583
&& (n * SP_PARM->_cud1_cost < vcost)) {
lib/libcurses/tty/lib_mvcur.c
585
SP_PARM->_cud1_cost, n, cursor_down);
lib/libcurses/tty/lib_mvcur.c
588
n = (from_y - to_y);
lib/libcurses/tty/lib_mvcur.c
593
TIPARM_1(parm_up_cursor, n))) {
lib/libcurses/tty/lib_mvcur.c
597
if (cursor_up && (n * SP_PARM->_cuu1_cost < vcost)) {
lib/libcurses/tty/lib_mvcur.c
599
SP_PARM->_cuu1_cost, n, cursor_up);
lib/libcurses/tty/lib_mvcur.c
622
n = to_x - from_x;
lib/libcurses/tty/lib_mvcur.c
627
TIPARM_1(parm_right_cursor, n))) {
lib/libcurses/tty/lib_mvcur.c
648
n = to_x - fr;
lib/libcurses/tty/lib_mvcur.c
653
if (n <= 0 || n >= (int) check.s_size)
lib/libcurses/tty/lib_mvcur.c
663
&& n > 0
lib/libcurses/tty/lib_mvcur.c
664
&& n < (int) check.s_size
lib/libcurses/tty/lib_mvcur.c
683
for (i = 0; i < n; i++) {
lib/libcurses/tty/lib_mvcur.c
698
for (i = 0; i < n; i++)
lib/libcurses/tty/lib_mvcur.c
702
check.s_size -= (size_t) n;
lib/libcurses/tty/lib_mvcur.c
703
lhcost += n * SP_PARM->_char_padding;
lib/libcurses/tty/lib_mvcur.c
706
n, cursor_right);
lib/libcurses/tty/lib_mvcur.c
715
n = from_x - to_x;
lib/libcurses/tty/lib_mvcur.c
720
TIPARM_1(parm_left_cursor, n))) {
lib/libcurses/tty/lib_mvcur.c
741
n = fr - to_x;
lib/libcurses/tty/lib_mvcur.c
747
n, cursor_left);
lib/libcurses/tty/lib_twait.c
126
int n;
lib/libcurses/tty/lib_twait.c
128
for (n = 0; n < evl->count; ++n) {
lib/libcurses/tty/lib_twait.c
129
_nc_event *ev = evl->events[n];
lib/libcurses/tty/lib_twait.c
188
int n;
lib/libcurses/tty/lib_twait.c
265
for (n = 0; n < evl->count; ++n) {
lib/libcurses/tty/lib_twait.c
266
_nc_event *ev = evl->events[n];
lib/libcurses/tty/lib_twait.c
287
for (n = 0; n < evl->count; ++n) {
lib/libcurses/tty/lib_twait.c
288
_nc_event *ev = evl->events[n];
lib/libcurses/tty/lib_twait.c
324
int n, howmany;
lib/libcurses/tty/lib_twait.c
330
n = 0;
lib/libcurses/tty/lib_twait.c
331
howmany = ioctl(0, 'ichr', &n);
lib/libcurses/tty/lib_twait.c
332
if (howmany >= 0 && n > 0) {
lib/libcurses/tty/lib_twait.c
369
for (n = 0; n < evl->count; ++n) {
lib/libcurses/tty/lib_twait.c
370
_nc_event *ev = evl->events[n];
lib/libcurses/tty/lib_twait.c
419
for (n = 0; n < evl->count; ++n) {
lib/libcurses/tty/lib_twait.c
420
_nc_event *ev = evl->events[n];
lib/libcurses/tty/lib_twait.c
446
for (n = 0; n < evl->count; ++n) {
lib/libcurses/tty/lib_twait.c
447
_nc_event *ev = evl->events[n];
lib/libcurses/tty/lib_vidattr.c
156
unsigned n;
lib/libcurses/tty/lib_vidattr.c
169
for (n = 0; n < SIZEOF(table); ++n) {
lib/libcurses/tty/lib_vidattr.c
170
if ((table[n] & SP_PARM->_ok_attributes) == 0) {
lib/libcurses/tty/lib_vidattr.c
171
newmode &= ~table[n];
lib/libcurses/tty/lib_vidattr.c
172
} else if ((table[n] & newmode) != 0) {
lib/libcurses/tty/lib_vidattr.c
174
newmode &= ~table[n];
lib/libcurses/tty/tty_update.c
1311
int n;
lib/libcurses/tty/tty_update.c
1330
for (n = 0; n < screen_columns(SP_PARM); n++) {
lib/libcurses/tty/tty_update.c
1331
if (!CharEq(newLine[n], oldLine[n])) {
lib/libcurses/tty/tty_update.c
1332
oldPair = GetPair(oldLine[n]);
lib/libcurses/tty/tty_update.c
1333
newPair = GetPair(newLine[n]);
lib/libcurses/tty/tty_update.c
1335
&& unColor(oldLine[n]) == unColor(newLine[n])) {
lib/libcurses/tty/tty_update.c
1340
SetPair(oldLine[n], GetPair(newLine[n]));
lib/libcurses/tty/tty_update.c
1383
for (n = 0; n < screen_columns(SP_PARM); n++) {
lib/libcurses/tty/tty_update.c
1384
int m = n + magic_cookie_glitch;
lib/libcurses/tty/tty_update.c
1390
if (ISBLANK(newLine[n])
lib/libcurses/tty/tty_update.c
1391
&& ((n > 0
lib/libcurses/tty/tty_update.c
1392
&& xmc_turn_on(SP_PARM, newLine[n - 1], newLine[n]))
lib/libcurses/tty/tty_update.c
1393
|| (n == 0
lib/libcurses/tty/tty_update.c
1398
newLine[n])))) {
lib/libcurses/tty/tty_update.c
1399
n = m;
lib/libcurses/tty/tty_update.c
1402
PutChar(NCURSES_SP_ARGx CHREF(newLine[n]));
lib/libcurses/tty/tty_update.c
1408
if (!ISBLANK(newLine[n])
lib/libcurses/tty/tty_update.c
1409
&& ((n + 1 < screen_columns(SP_PARM)
lib/libcurses/tty/tty_update.c
1410
&& xmc_turn_off(SP_PARM, newLine[n], newLine[n + 1]))
lib/libcurses/tty/tty_update.c
1411
|| (n + 1 >= screen_columns(SP_PARM)
lib/libcurses/tty/tty_update.c
1414
newLine[n],
lib/libcurses/tty/tty_update.c
1416
n = m;
lib/libcurses/tty/tty_update.c
1536
n = max(nLastChar, oLastChar);
lib/libcurses/tty/tty_update.c
1542
n);
lib/libcurses/tty/tty_update.c
1561
n = min(oLastChar, nLastChar);
lib/libcurses/tty/tty_update.c
1562
if (n >= firstChar) {
lib/libcurses/tty/tty_update.c
1569
n);
lib/libcurses/tty/tty_update.c
1575
if (n) {
lib/libcurses/tty/tty_update.c
1576
while (isWidecExt(newLine[n + 1]) && n) {
lib/libcurses/tty/tty_update.c
1577
--n;
lib/libcurses/tty/tty_update.c
1580
} else if (n >= firstChar &&
lib/libcurses/tty/tty_update.c
1581
isWidecBase(newLine[n])) {
lib/libcurses/tty/tty_update.c
1582
while (isWidecExt(newLine[n + 1])) {
lib/libcurses/tty/tty_update.c
1583
++n;
lib/libcurses/tty/tty_update.c
1588
GoTo(NCURSES_SP_ARGx lineno, n + 1);
lib/libcurses/tty/tty_update.c
1590
|| InsCharCost(SP_PARM, nLastChar - oLastChar) > (m - n)) {
lib/libcurses/tty/tty_update.c
1595
n + 1,
lib/libcurses/tty/tty_update.c
1598
InsStr(NCURSES_SP_ARGx &newLine[n + 1], nLastChar - oLastChar);
lib/libcurses/tty/tty_update.c
1601
GoTo(NCURSES_SP_ARGx lineno, n + 1);
lib/libcurses/tty/tty_update.c
1603
> SP_PARM->_el_cost + nLastNonblank - (n + 1)) {
lib/libcurses/tty/tty_update.c
1605
n + 1, nLastNonblank)) {
lib/libcurses/tty/tty_update.c
1785
int n;
lib/libcurses/tty/tty_update.c
1787
for (n = 0; n < count; n++) {
lib/libcurses/tty/tty_update.c
1828
int n,
lib/libcurses/tty/tty_update.c
1837
if (n == 1 && scroll_forward && top == miny && bot == maxy) {
lib/libcurses/tty/tty_update.c
1841
} else if (n == 1 && delete_line && bot == maxy) {
lib/libcurses/tty/tty_update.c
1850
TIPARM_1(parm_index, n),
lib/libcurses/tty/tty_update.c
1851
n,
lib/libcurses/tty/tty_update.c
1858
TIPARM_1(parm_delete_line, n),
lib/libcurses/tty/tty_update.c
1859
n,
lib/libcurses/tty/tty_update.c
1864
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1870
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1879
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1893
int n,
lib/libcurses/tty/tty_update.c
1902
if (n == 1 && scroll_reverse && top == miny && bot == maxy) {
lib/libcurses/tty/tty_update.c
1906
} else if (n == 1 && insert_line && bot == maxy) {
lib/libcurses/tty/tty_update.c
1915
TIPARM_1(parm_rindex, n),
lib/libcurses/tty/tty_update.c
1916
n,
lib/libcurses/tty/tty_update.c
1923
TIPARM_1(parm_insert_line, n),
lib/libcurses/tty/tty_update.c
1924
n,
lib/libcurses/tty/tty_update.c
1929
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1935
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1944
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1957
scroll_idl(NCURSES_SP_DCLx int n, int del, int ins, NCURSES_CH_T blank)
lib/libcurses/tty/tty_update.c
1966
if (n == 1 && delete_line) {
lib/libcurses/tty/tty_update.c
1971
TIPARM_1(parm_delete_line, n),
lib/libcurses/tty/tty_update.c
1972
n,
lib/libcurses/tty/tty_update.c
1975
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
1982
if (n == 1 && insert_line) {
lib/libcurses/tty/tty_update.c
1987
TIPARM_1(parm_insert_line, n),
lib/libcurses/tty/tty_update.c
1988
n,
lib/libcurses/tty/tty_update.c
1991
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
2009
int n,
lib/libcurses/tty/tty_update.c
2021
(void *) SP_PARM, n, top, bot, maxy));
lib/libcurses/tty/tty_update.c
2037
if (n > 0) { /* scroll up (forward) */
lib/libcurses/tty/tty_update.c
2042
res = scroll_csr_forward(NCURSES_SP_ARGx n, top, bot, 0, maxy, blank);
lib/libcurses/tty/tty_update.c
2045
if ((((n == 1 && scroll_forward) || parm_index)
lib/libcurses/tty/tty_update.c
2059
res = scroll_csr_forward(NCURSES_SP_ARGx n, top, bot, top, bot, blank);
lib/libcurses/tty/tty_update.c
2067
res = scroll_idl(NCURSES_SP_ARGx n, top, bot - n + 1, blank);
lib/libcurses/tty/tty_update.c
2076
GoTo(NCURSES_SP_ARGx bot - n + 1, 0);
lib/libcurses/tty/tty_update.c
2079
for (i = 0; i < n; i++) {
lib/libcurses/tty/tty_update.c
2087
res = scroll_csr_backward(NCURSES_SP_ARGx -n, top, bot, 0, maxy, blank);
lib/libcurses/tty/tty_update.c
2106
-n, top, bot, top, bot, blank);
lib/libcurses/tty/tty_update.c
2114
res = scroll_idl(NCURSES_SP_ARGx -n, bot + n + 1, top, blank);
lib/libcurses/tty/tty_update.c
2122
for (i = 0; i < -n; i++) {
lib/libcurses/tty/tty_update.c
2132
_nc_scroll_window(CurScreen(SP_PARM), n,
lib/libcurses/tty/tty_update.c
2138
NCURSES_SP_NAME(_nc_scroll_oldhash) (NCURSES_SP_ARGx n, top, bot);
lib/libcurses/tty/tty_update.c
2145
_nc_scrolln(int n, int top, int bot, int maxy)
lib/libcurses/tty/tty_update.c
2147
return NCURSES_SP_NAME(_nc_scrolln) (CURRENT_SCREEN, n, top, bot, maxy);
lib/libcurses/tty/tty_update.c
2166
int n;
lib/libcurses/tty/tty_update.c
2168
for (n = 0; n < SP_PARM->_color_defs; ++n) {
lib/libcurses/tty/tty_update.c
2169
if (SP_PARM->_color_table[n].init) {
lib/libcurses/tty/tty_update.c
2171
n,
lib/libcurses/tty/tty_update.c
2172
SP_PARM->_color_table[n].r,
lib/libcurses/tty/tty_update.c
2173
SP_PARM->_color_table[n].g,
lib/libcurses/tty/tty_update.c
2174
SP_PARM->_color_table[n].b);
lib/libcurses/tty/tty_update.c
400
int n = 0;
lib/libcurses/tty/tty_update.c
401
int howmany = ioctl(0, 'ichr', &n);
lib/libcurses/tty/tty_update.c
402
if (howmany >= 0 && n > 0) {
lib/libcurses/tty/tty_update.c
894
int m, n = j;
lib/libcurses/tty/tty_update.c
898
for (; n < screen_columns(SP_PARM); n++) {
lib/libcurses/tty/tty_update.c
900
AttrOf(NewScreen(SP_PARM)->_line[m].text[n]);
lib/libcurses/tty/tty_update.c
905
_traceattr(turnon), m, n));
lib/libcurses/tty/tty_update.c
909
n = 0;
lib/libcurses/tty/tty_update.c
925
while (n >= 0
lib/libcurses/tty/tty_update.c
926
&& ISBLANK(lastline[n])
lib/libcurses/tty/tty_update.c
927
&& SAFE(SP_PARM, AttrOf(lastline[n]))) {
lib/libcurses/tty/tty_update.c
928
RemAttr(lastline[n--], turnon);
lib/libcurses/tty/tty_update.c
933
if (n + k >= screen_columns(SP_PARM)
lib/libcurses/tty/tty_update.c
934
|| !ISBLANK(lastline[n + k])
lib/libcurses/tty/tty_update.c
935
|| !SAFE(SP_PARM, AttrOf(lastline[n + k]))) {
lib/libcurses/tty/tty_update.c
940
(ISBLANK(lastline[n + k])
lib/libcurses/tty/tty_update.c
943
(SAFE(SP_PARM, AttrOf(lastline[n + k]))
lib/libcurses/wcwidth.h
220
NCURSES_EXPORT(int) mk_wcswidth(const wchar_t *pwcs, size_t n)
lib/libcurses/wcwidth.h
224
for (;*pwcs && n-- > 0; pwcs++)
lib/libcurses/wcwidth.h
311
NCURSES_EXPORT(int) mk_wcswidth_cjk(const wchar_t *pwcs, size_t n)
lib/libcurses/wcwidth.h
315
for (;*pwcs && n-- > 0; pwcs++)
lib/libcurses/widechar/lib_get_wstr.c
71
int n;
lib/libcurses/widechar/lib_get_wstr.c
74
for (n = 0; first[n] != 0; ++n) {
lib/libcurses/widechar/lib_get_wstr.c
75
wadd_wint(win, first + n);
lib/libcurses/widechar/lib_hline_set.c
48
whline_set(WINDOW *win, const cchar_t *ch, int n)
lib/libcurses/widechar/lib_hline_set.c
52
T((T_CALLED("whline_set(%p,%s,%d)"), (void *) win, _tracecchar_t(ch), n));
lib/libcurses/widechar/lib_hline_set.c
58
int end = start + n - 1;
lib/libcurses/widechar/lib_in_wchnstr.c
48
win_wchnstr(WINDOW *win, cchar_t *wchstr, int n)
lib/libcurses/widechar/lib_in_wchnstr.c
52
T((T_CALLED("win_wchnstr(%p,%p,%d)"), (void *) win, (void *) wchstr, n));
lib/libcurses/widechar/lib_in_wchnstr.c
63
if (n < 0) {
lib/libcurses/widechar/lib_in_wchnstr.c
64
n = limit;
lib/libcurses/widechar/lib_in_wchnstr.c
65
} else if (n > limit) {
lib/libcurses/widechar/lib_in_wchnstr.c
66
n = limit;
lib/libcurses/widechar/lib_in_wchnstr.c
68
for (j = k = 0; j < n; ++j) {
lib/libcurses/widechar/lib_in_wchnstr.c
74
T(("result = %s", _nc_viscbuf(wchstr, n)));
lib/libcurses/widechar/lib_ins_wch.c
106
wins_nwstr(WINDOW *win, const wchar_t *wstr, int n)
lib/libcurses/widechar/lib_ins_wch.c
111
(void *) win, _nc_viswbufn(wstr, n), n));
lib/libcurses/widechar/lib_ins_wch.c
115
if (n < 1)
lib/libcurses/widechar/lib_ins_wch.c
116
n = INT_MAX;
lib/libcurses/widechar/lib_ins_wch.c
119
if (n > 0) {
lib/libcurses/widechar/lib_ins_wch.c
125
for (cp = wstr; (*cp != L'\0') && ((cp - wstr) < n); cp++) {
lib/libcurses/widechar/lib_inwstr.c
48
winnwstr(WINDOW *win, wchar_t *wstr, int n)
lib/libcurses/widechar/lib_inwstr.c
53
T((T_CALLED("winnwstr(%p,%p,%d)"), (void *) win, (void *) wstr, n));
lib/libcurses/widechar/lib_inwstr.c
63
while (count < n && !done && count != ERR) {
lib/libcurses/widechar/lib_inwstr.c
72
if (count + 1 > n) {
lib/libcurses/widechar/lib_unget_wch.c
87
int n;
lib/libcurses/widechar/lib_unget_wch.c
93
for (n = (int) (length - 1); n >= 0; --n) {
lib/libcurses/widechar/lib_unget_wch.c
95
UChar(string[n])) !=OK) {
lib/libcurses/widechar/lib_vline_set.c
48
wvline_set(WINDOW *win, const cchar_t *ch, int n)
lib/libcurses/widechar/lib_vline_set.c
52
T((T_CALLED("wvline(%p,%s,%d)"), (void *) win, _tracecchar_t(ch), n));
lib/libcurses/widechar/lib_vline_set.c
58
int end = row + n - 1;
lib/libcurses/widechar/lib_wacs.c
125
unsigned n;
lib/libcurses/widechar/lib_wacs.c
127
for (n = 0; n < SIZEOF(table); ++n) {
lib/libcurses/widechar/lib_wacs.c
130
int wide = wcwidth((wchar_t) table[n].value[active]);
lib/libcurses/widechar/lib_wacs.c
135
m = table[n].map;
lib/libcurses/widechar/lib_wacs.c
137
SetChar(_nc_wacs[m], table[n].value[1], A_NORMAL);
lib/libcurses/widechar/lib_wacs.c
141
SetChar(_nc_wacs[m], table[n].value[0], A_NORMAL);
lib/libcurses/widechar/lib_wacs.c
145
n, wide, m,
lib/libcurses/widechar/lib_wacs.c
146
_tracechar(table[n].value[active]),
lib/libcurses/widechar/widechars.c
100
count = _nc_mbtowc(&temp, s, n);
lib/libcurses/widechar/widechars.c
111
if (check > 0 && (size_t) check <= n) {
lib/libcurses/widechar/widechars.c
42
_nc_mbtowc(wchar_t *pwc, const char *s, size_t n)
lib/libcurses/widechar/widechars.c
48
if (s != 0 && n != 0) {
lib/libcurses/widechar/widechars.c
55
for (try = 1; try <= (int) n; ++try) {
lib/libcurses/widechar/widechars.c
93
_nc_mblen(const char *s, size_t n)
lib/libcurses/widechar/widechars.c
99
if (s != 0 && n != 0) {
lib/libedit/chared.c
233
c__prev_word(wchar_t *p, wchar_t *low, int n, int (*wtest)(wint_t))
lib/libedit/chared.c
237
while (n--) {
lib/libedit/chared.c
257
c__next_word(wchar_t *p, wchar_t *high, int n, int (*wtest)(wint_t))
lib/libedit/chared.c
259
while (n--) {
lib/libedit/chared.c
275
cv_next_word(EditLine *el, wchar_t *p, wchar_t *high, int n,
lib/libedit/chared.c
280
while (n--) {
lib/libedit/chared.c
288
if (n || el->el_chared.c_vcmd.action != (DELETE|INSERT))
lib/libedit/chared.c
305
cv_prev_word(wchar_t *p, wchar_t *low, int n, int (*wtest)(wint_t))
lib/libedit/chared.c
310
while (n--) {
lib/libedit/chared.c
369
cv__endword(wchar_t *p, wchar_t *high, int n, int (*wtest)(wint_t))
lib/libedit/chared.c
375
while (n--) {
lib/libedit/chared.c
596
el_deletestr(EditLine *el, int n)
lib/libedit/chared.c
598
if (n <= 0)
lib/libedit/chared.c
601
if (el->el_line.cursor < &el->el_line.buffer[n])
lib/libedit/chared.c
604
c_delbefore(el, n); /* delete before dot */
lib/libedit/chared.c
605
el->el_line.cursor -= n;
lib/libedit/history.c
117
#define HSET(h, ev, n) (*(h)->h_set)((h)->h_ref, ev, n)
lib/libedit/history.c
121
#define HDEL(h, ev, n) (*(h)->h_del)((h)->h_ref, ev, n)
lib/libedit/history.c
355
history_def_set(void *p, TYPE(HistEvent) *ev, const int n)
lib/libedit/history.c
363
if (h->cursor == &h->list || h->cursor->ev.num != n) {
lib/libedit/history.c
366
if (h->cursor->ev.num == n)
lib/libedit/history.c
382
history_set_nth(void *p, TYPE(HistEvent) *ev, int n)
lib/libedit/history.c
392
if (n-- <= 0)
lib/libedit/history.c
549
history_def_init(void **p, TYPE(HistEvent) *ev __attribute__((__unused__)), int n)
lib/libedit/history.c
555
if (n <= 0)
lib/libedit/history.c
556
n = 0;
lib/libedit/history.c
559
h->max = n;
lib/libedit/history.c
67
#define Strncmp(d, s, n) strncmp(d, s, n)
lib/libedit/history.c
68
#define Strncpy(d, s, n) strncpy(d, s, n)
lib/libedit/history.c
69
#define Strncat(d, s, n) strncat(d, s, n)
lib/libedit/history.c
85
#define Strncmp(d, s, n) wcsncmp(d, s, n)
lib/libedit/history.c
86
#define Strncpy(d, s, n) wcsncpy(d, s, n)
lib/libedit/history.c
87
#define Strncat(d, s, n) wcsncat(d, s, n)
lib/libedit/keymacro.c
647
ssize_t n = ct_encode_char(b, (size_t)(eb - b), *p2++);
lib/libedit/keymacro.c
648
if (n == -1) /* ran out of space */
lib/libedit/keymacro.c
651
b += n;
lib/libedit/parse.c
239
int n;
lib/libedit/parse.c
249
if ((n = parse__escape(&in)) == -1)
lib/libedit/parse.c
251
*out++ = (wchar_t)n;
lib/libedit/readline.c
2074
int n;
lib/libedit/readline.c
2084
if (ioctl(el->el_infd, FIONREAD, &n) == -1)
lib/libedit/readline.c
2086
if (n)
lib/libedit/readline.c
2091
if ((n = fcntl(el->el_infd, F_GETFL)) == -1)
lib/libedit/readline.c
2093
if (fcntl(el->el_infd, F_SETFL, n|O_NDELAY) == -1)
lib/libedit/readline.c
2096
if (fcntl(el->el_infd, F_SETFL, n))
lib/libedit/refresh.c
1133
ssize_t i, n =
lib/libedit/refresh.c
1135
for (i = 0; n-- > 0; ++i)
lib/libedit/refresh.c
143
ssize_t i, n =
lib/libedit/refresh.c
145
for (i = 0; n-- > 0; ++i)
lib/libedit/refresh.c
438
re__strncopy(wchar_t *a, wchar_t *b, size_t n)
lib/libedit/refresh.c
441
while (n-- && *b)
lib/libedit/refresh.c
499
wchar_t *o, *n, *p, c;
lib/libedit/refresh.c
508
for (o = old, n = new; *o && (*o == *n); o++, n++)
lib/libedit/refresh.c
511
nfd = n;
lib/libedit/refresh.c
530
while (*n)
lib/libedit/refresh.c
531
n++;
lib/libedit/refresh.c
534
while (nfd < n) {
lib/libedit/refresh.c
535
if (n[-1] != ' ')
lib/libedit/refresh.c
537
n--;
lib/libedit/refresh.c
539
ne = n;
lib/libedit/refresh.c
552
while ((o > ofd) && (n > nfd) && (*--o == *--n))
lib/libedit/refresh.c
555
nls = ++n;
lib/libedit/refresh.c
569
for (c = *ofd, n = nfd; n < nls; n++) {
lib/libedit/refresh.c
570
if (c == *n) {
lib/libedit/refresh.c
571
for (o = ofd, p = n;
lib/libedit/refresh.c
579
if (((nse - nsb) < (p - n)) &&
lib/libedit/refresh.c
580
(2 * (p - n) > n - nfd)) {
lib/libedit/refresh.c
581
nsb = n;
lib/libedit/refresh.c
595
for (n = nfd, p = o;
lib/libedit/refresh.c
596
p < ols && n < nls && *p == *n;
lib/libedit/refresh.c
597
p++, n++)
lib/libedit/refresh.c
606
nse = n;
lib/libedit/terminal.c
1161
size_t n;
lib/libedit/terminal.c
1166
for (n = 0; n < VISUAL_WIDTH_MAX && p[n]; ++n)
lib/libedit/terminal.c
1167
wt_str[n] = p[n];
lib/libedit/terminal.c
1168
while (n < VISUAL_WIDTH_MAX)
lib/libedit/terminal.c
1169
wt_str[n++] = '\0';
lib/libedit/terminal.c
642
terminal_overwrite(EditLine *el, const wchar_t *cp, size_t n)
lib/libedit/terminal.c
644
if (n == 0)
lib/libedit/terminal.c
647
if (n > (size_t)el->el_terminal.t_size.h) {
lib/libedit/terminal.c
650
"terminal_overwrite: n is riduculous: %zu\r\n", n);
lib/libedit/terminal.c
659
} while (--n);
lib/libelf/elf_getarsym.c
36
size_t n;
lib/libelf/elf_getarsym.c
39
n = 0;
lib/libelf/elf_getarsym.c
45
n = ar->e_u.e_ar.e_symtabsz;
lib/libelf/elf_getarsym.c
48
_libelf_ar_process_svr4_symtab(ar, &n) :
lib/libelf/elf_getarsym.c
49
_libelf_ar_process_bsd_symtab(ar, &n);
lib/libelf/elf_getarsym.c
54
*ptr = n;
lib/libelf/libelf_ar.c
114
size_t n, nlen;
lib/libelf/libelf_ar.c
153
&n) == 0)
lib/libelf/libelf_ar.c
155
eh->ar_uid = (uid_t) n;
lib/libelf/libelf_ar.c
158
&n) == 0)
lib/libelf/libelf_ar.c
160
eh->ar_gid = (gid_t) n;
lib/libelf/libelf_ar.c
163
&n) == 0)
lib/libelf/libelf_ar.c
165
eh->ar_mode = (mode_t) n;
lib/libelf/libelf_ar.c
168
&n) == 0)
lib/libelf/libelf_ar.c
180
n -= nlen;
lib/libelf/libelf_ar.c
183
eh->ar_size = n;
lib/libelf/libelf_ar.c
320
unsigned int n;
lib/libelf/libelf_ar.c
373
for (n = 0, sym = symtab; n < nentries; n++, sym++) {
lib/libelf/libelf_ar.c
434
size_t n, nentries;
lib/libelf/libelf_ar.c
464
for (n = nentries, sym = symtab; n > 0; n--) {
lib/libevent/buffer.c
428
int n = EVBUFFER_MAX_READ;
lib/libevent/buffer.c
430
if (ioctl(fd, FIONREAD, &n) == -1 || n <= 0) {
lib/libevent/buffer.c
431
n = EVBUFFER_MAX_READ;
lib/libevent/buffer.c
432
} else if (n > EVBUFFER_MAX_READ && n > howmuch) {
lib/libevent/buffer.c
440
if ((size_t)n > buf->totallen << 2)
lib/libevent/buffer.c
441
n = buf->totallen << 2;
lib/libevent/buffer.c
442
if (n < EVBUFFER_MAX_READ)
lib/libevent/buffer.c
443
n = EVBUFFER_MAX_READ;
lib/libevent/buffer.c
445
if (howmuch < 0 || howmuch > n)
lib/libevent/buffer.c
446
howmuch = n;
lib/libevent/buffer.c
455
n = read(fd, p, howmuch);
lib/libevent/buffer.c
456
if (n == -1)
lib/libevent/buffer.c
458
if (n == 0)
lib/libevent/buffer.c
461
buf->off += n;
lib/libevent/buffer.c
467
return (n);
lib/libevent/buffer.c
473
int n;
lib/libevent/buffer.c
475
n = write(fd, buffer->buffer, buffer->off);
lib/libevent/buffer.c
476
if (n == -1)
lib/libevent/buffer.c
478
if (n == 0)
lib/libevent/buffer.c
480
evbuffer_drain(buffer, n);
lib/libevent/buffer.c
482
return (n);
lib/libevent/min_heap.h
103
if (s->n) {
lib/libevent/min_heap.h
105
min_heap_shift_down_(s, 0, s->p[--s->n]);
lib/libevent/min_heap.h
116
struct event *last = s->p[--s->n];
lib/libevent/min_heap.h
136
min_heap_reserve(min_heap_t * s, size_t n)
lib/libevent/min_heap.h
138
if (s->a < n) {
lib/libevent/min_heap.h
141
if (a < n)
lib/libevent/min_heap.h
142
a = n;
lib/libevent/min_heap.h
169
while (min_child <= s->n) {
lib/libevent/min_heap.h
170
if (min_child == s->n ||
lib/libevent/min_heap.h
36
size_t n, a;
lib/libevent/min_heap.h
46
static inline int min_heap_reserve(min_heap_t * s, size_t n);
lib/libevent/min_heap.h
63
s->n = 0;
lib/libevent/min_heap.h
78
return 0 == s->n;
lib/libevent/min_heap.h
83
return s->n;
lib/libevent/min_heap.h
88
return s->n ? *s->p : 0;
lib/libevent/min_heap.h
94
if (min_heap_reserve(s, s->n + 1))
lib/libevent/min_heap.h
96
min_heap_shift_up_(s, s->n++, e);
lib/libevent/signal.c
58
ssize_t n;
lib/libevent/signal.c
60
n = recv(fd, signals, sizeof(signals), 0);
lib/libevent/signal.c
61
if (n == -1) {
lib/libexpat/lib/xmlparse.c
212
#define ROUND_UP(n, sz) (((n) + ((sz) - 1)) & ~((sz) - 1))
lib/libexpat/lib/xmlparse.c
3650
int n = XmlCharRefNumber(enc, s);
lib/libexpat/lib/xmlparse.c
3651
if (n < 0)
lib/libexpat/lib/xmlparse.c
3656
XmlEncode(n, (ICHAR *)buf));
lib/libexpat/lib/xmlparse.c
3839
int n;
lib/libexpat/lib/xmlparse.c
3862
n = XmlGetAttributes(enc, attStr, parser->m_attsSize, parser->m_atts);
lib/libexpat/lib/xmlparse.c
3865
if (n > INT_MAX - nDefaultAtts) {
lib/libexpat/lib/xmlparse.c
3869
if (n + nDefaultAtts > parser->m_attsSize) {
lib/libexpat/lib/xmlparse.c
3878
|| (n > INT_MAX - (nDefaultAtts + INIT_ATTS_SIZE))) {
lib/libexpat/lib/xmlparse.c
3882
parser->m_attsSize = n + nDefaultAtts + INIT_ATTS_SIZE;
lib/libexpat/lib/xmlparse.c
3922
if (n > oldAttsSize)
lib/libexpat/lib/xmlparse.c
3923
XmlGetAttributes(enc, attStr, n, parser->m_atts);
lib/libexpat/lib/xmlparse.c
3927
for (i = 0; i < n; i++) {
lib/libexpat/lib/xmlparse.c
4254
n = i + binding->uriLen + prefixLen;
lib/libexpat/lib/xmlparse.c
4255
if (n > binding->uriAlloc) {
lib/libexpat/lib/xmlparse.c
4259
if (n > INT_MAX - EXPAND_SPARE) {
lib/libexpat/lib/xmlparse.c
4267
if ((unsigned)(n + EXPAND_SPARE) > SIZE_MAX / sizeof(XML_Char)) {
lib/libexpat/lib/xmlparse.c
4272
uri = MALLOC(parser, (n + EXPAND_SPARE) * sizeof(XML_Char));
lib/libexpat/lib/xmlparse.c
4275
binding->uriAlloc = n + EXPAND_SPARE;
lib/libexpat/lib/xmlparse.c
596
int n);
lib/libexpat/lib/xmlparse.c
6624
int n = XmlCharRefNumber(enc, ptr);
lib/libexpat/lib/xmlparse.c
6625
if (n < 0) {
lib/libexpat/lib/xmlparse.c
6630
if (! isCdata && n == 0x20 /* space */
lib/libexpat/lib/xmlparse.c
6633
n = XmlEncode(n, (ICHAR *)buf);
lib/libexpat/lib/xmlparse.c
6643
for (i = 0; i < n; i++) {
lib/libexpat/lib/xmlparse.c
6908
int n = XmlCharRefNumber(enc, entityTextPtr);
lib/libexpat/lib/xmlparse.c
6909
if (n < 0) {
lib/libexpat/lib/xmlparse.c
6915
n = XmlEncode(n, (ICHAR *)buf);
lib/libexpat/lib/xmlparse.c
6925
for (i = 0; i < n; i++) {
lib/libexpat/lib/xmlparse.c
8083
poolCopyStringN(STRING_POOL *pool, const XML_Char *s, int n) {
lib/libexpat/lib/xmlparse.c
8098
for (; n > 0; --n, s++) {
lib/libexpat/lib/xmltok.c
1356
int n;
lib/libexpat/lib/xmltok.c
1360
n = *utf8++;
lib/libexpat/lib/xmltok.c
1361
if (n == 0) {
lib/libexpat/lib/xmltok.c
1363
n = XmlUtf8Encode(c, buf);
lib/libexpat/lib/xmltok.c
1364
if (n > toLim - *toP)
lib/libexpat/lib/xmltok.c
1370
if (n > toLim - *toP)
lib/libexpat/lib/xmltok.c
1374
memcpy(*toP, utf8, n);
lib/libexpat/lib/xmltok.c
1375
*toP += n;
lib/libexpat/lib/xmltok.c
271
#define IS_NAME_CHAR(enc, p, n) (AS_NORMAL_ENCODING(enc)->isName##n(enc, p))
lib/libexpat/lib/xmltok.c
272
#define IS_NMSTRT_CHAR(enc, p, n) (AS_NORMAL_ENCODING(enc)->isNmstrt##n(enc, p))
lib/libexpat/lib/xmltok.c
274
# define IS_INVALID_CHAR(enc, p, n) \
lib/libexpat/lib/xmltok.c
275
(AS_NORMAL_ENCODING(enc)->isInvalid##n \
lib/libexpat/lib/xmltok.c
276
&& AS_NORMAL_ENCODING(enc)->isInvalid##n(enc, p))
lib/libexpat/lib/xmltok.c
278
# define IS_INVALID_CHAR(enc, p, n) \
lib/libexpat/lib/xmltok.c
279
(AS_NORMAL_ENCODING(enc)->isInvalid##n(enc, p))
lib/libexpat/lib/xmltok.c
431
unsigned long n;
lib/libexpat/lib/xmltok.c
440
n = ((from[0] & 0x7) << 18) | ((from[1] & 0x3f) << 12)
lib/libexpat/lib/xmltok.c
442
n -= 0x10000;
lib/libexpat/lib/xmltok.c
443
to[0] = (unsigned short)((n >> 10) | 0xD800);
lib/libexpat/lib/xmltok.c
444
to[1] = (unsigned short)((n & 0x3FF) | 0xDC00);
lib/libexpat/lib/xmltok.c
790
# define IS_NAME_CHAR(enc, p, n) 0
lib/libexpat/lib/xmltok.c
792
# define IS_NMSTRT_CHAR(enc, p, n) (0)
lib/libexpat/lib/xmltok.c
923
# define IS_NAME_CHAR(enc, p, n) 0
lib/libexpat/lib/xmltok.c
925
# define IS_NMSTRT_CHAR(enc, p, n) (0)
lib/libexpat/lib/xmltok_impl.c
100
if ((end) - (ptr) < (n)) \
lib/libexpat/lib/xmltok_impl.c
102
if (IS_INVALID_CHAR(enc, ptr, n) || ! IS_NMSTRT_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
1023
size_t n = end - ptr;
lib/libexpat/lib/xmltok_impl.c
1024
if (n & (MINBPC(enc) - 1)) {
lib/libexpat/lib/xmltok_impl.c
1025
n &= ~(MINBPC(enc) - 1);
lib/libexpat/lib/xmltok_impl.c
1026
if (n == 0)
lib/libexpat/lib/xmltok_impl.c
1028
end = ptr + n;
lib/libexpat/lib/xmltok_impl.c
106
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
1143
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
1144
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
1145
if (end - ptr < n) \
lib/libexpat/lib/xmltok_impl.c
1147
if (IS_INVALID_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
1151
if (IS_NMSTRT_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
1152
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
1156
if (IS_NAME_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
1157
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
1277
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
1278
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
1279
ptr += n; /* NOTE: The encoding has already been validated. */ \
lib/libexpat/lib/xmltok_impl.c
1346
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
1347
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
1348
ptr += n; /* NOTE: The encoding has already been validated. */ \
lib/libexpat/lib/xmltok_impl.c
1401
size_t n = end - ptr;
lib/libexpat/lib/xmltok_impl.c
1402
if (n & (MINBPC(enc) - 1)) {
lib/libexpat/lib/xmltok_impl.c
1403
n &= ~(MINBPC(enc) - 1);
lib/libexpat/lib/xmltok_impl.c
1404
end = ptr + n;
lib/libexpat/lib/xmltok_impl.c
1526
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
1527
case BT_LEAD##n: /* NOTE: The encoding has already been validated. */ \
lib/libexpat/lib/xmltok_impl.c
1528
START_NAME ptr += (n - MINBPC(enc)); \
lib/libexpat/lib/xmltok_impl.c
1737
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
1738
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
1739
ptr += n; /* NOTE: The encoding has already been validated. */ \
lib/libexpat/lib/xmltok_impl.c
1782
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
1783
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
1784
ptr += n; /* NOTE: The encoding has already been validated. */ \
lib/libexpat/lib/xmltok_impl.c
360
size_t n = end - ptr;
lib/libexpat/lib/xmltok_impl.c
361
if (n & (MINBPC(enc) - 1)) {
lib/libexpat/lib/xmltok_impl.c
362
n &= ~(MINBPC(enc) - 1);
lib/libexpat/lib/xmltok_impl.c
363
if (n == 0)
lib/libexpat/lib/xmltok_impl.c
365
end = ptr + n;
lib/libexpat/lib/xmltok_impl.c
399
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
400
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
401
if (end - ptr < n || IS_INVALID_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
405
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
45
# define IS_INVALID_CHAR(enc, ptr, n) (0)
lib/libexpat/lib/xmltok_impl.c
48
# define INVALID_LEAD_CASE(n, ptr, nextTokPtr) \
lib/libexpat/lib/xmltok_impl.c
49
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
50
if (end - ptr < n) \
lib/libexpat/lib/xmltok_impl.c
52
if (IS_INVALID_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
56
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
69
# define CHECK_NAME_CASE(n, enc, ptr, end, nextTokPtr) \
lib/libexpat/lib/xmltok_impl.c
70
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
71
if (end - ptr < n) \
lib/libexpat/lib/xmltok_impl.c
73
if (IS_INVALID_CHAR(enc, ptr, n) || ! IS_NAME_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
77
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
828
size_t n = end - ptr;
lib/libexpat/lib/xmltok_impl.c
829
if (n & (MINBPC(enc) - 1)) {
lib/libexpat/lib/xmltok_impl.c
830
n &= ~(MINBPC(enc) - 1);
lib/libexpat/lib/xmltok_impl.c
831
if (n == 0)
lib/libexpat/lib/xmltok_impl.c
833
end = ptr + n;
lib/libexpat/lib/xmltok_impl.c
874
# define LEAD_CASE(n) \
lib/libexpat/lib/xmltok_impl.c
875
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_impl.c
876
if (end - ptr < n || IS_INVALID_CHAR(enc, ptr, n)) { \
lib/libexpat/lib/xmltok_impl.c
880
ptr += n; \
lib/libexpat/lib/xmltok_impl.c
98
# define CHECK_NMSTRT_CASE(n, enc, ptr, end, nextTokPtr) \
lib/libexpat/lib/xmltok_impl.c
99
case BT_LEAD##n: \
lib/libexpat/lib/xmltok_ns.c
52
const short n = 1;
lib/libexpat/lib/xmltok_ns.c
53
return (*(const char *)&n ? &ns(internal_little2_encoding).enc
lib/libexpat/tests/common.c
315
portable_strndup(const char *s, size_t n) {
lib/libexpat/tests/common.c
316
if ((s == NULL) || (n == SIZE_MAX)) {
lib/libexpat/tests/common.c
321
n = portable_strnlen(s, n);
lib/libexpat/tests/common.c
323
char *const buffer = (char *)malloc(n + 1);
lib/libexpat/tests/common.c
331
memcpy(buffer, s, n);
lib/libexpat/tests/common.c
333
buffer[n] = '\0';
lib/libexpat/tests/common.h
149
extern char *portable_strndup(const char *s, size_t n);
lib/libexpat/tests/common.h
66
# define xcstrncmp(s, t, n) wcsncmp((s), (t), (n))
lib/libexpat/tests/common.h
76
# define xcstrncmp(s, t, n) strncmp((s), (t), (n))
lib/libfido2/src/assert.c
1003
fido_assert_set_count(fido_assert_t *assert, size_t n)
lib/libfido2/src/assert.c
1008
if (n > UINT8_MAX) {
lib/libfido2/src/assert.c
1014
new_stmt = recallocarray(assert->stmt, assert->stmt_cnt, n,
lib/libfido2/src/assert.c
1020
assert->stmt_cnt = n;
lib/libfido2/src/assert.c
1021
assert->stmt_len = n;
lib/libfido2/src/assert.c
18
uint64_t n;
lib/libfido2/src/assert.c
28
if (cbor_decode_uint64(val, &n) < 0 || n > SIZE_MAX) {
lib/libfido2/src/assert.c
34
(size_t)n < assert->stmt_cnt) {
lib/libfido2/src/assert.c
36
__func__, assert->stmt_len, assert->stmt_cnt, (size_t)n);
lib/libfido2/src/assert.c
40
if (fido_assert_set_count(assert, (size_t)n) != FIDO_OK) {
lib/libfido2/src/cbor.c
100
size_t n;
lib/libfido2/src/cbor.c
107
n = cbor_array_size(item);
lib/libfido2/src/cbor.c
109
for (size_t i = 0; i < n; i++)
lib/libfido2/src/cbor.c
1470
cbor_decode_uint64(const cbor_item_t *item, uint64_t *n)
lib/libfido2/src/cbor.c
1477
*n = cbor_get_int(item);
lib/libfido2/src/cbor.c
1639
size_t n;
lib/libfido2/src/cbor.c
1642
(n = cbor_array_size(*array)) == SIZE_MAX ||
lib/libfido2/src/cbor.c
1643
(ret = cbor_new_definite_array(n + 1)) == NULL)
lib/libfido2/src/cbor.c
1645
for (size_t i = 0; i < n; i++) {
lib/libfido2/src/cbor.c
1665
size_t n;
lib/libfido2/src/cbor.c
1668
(n = cbor_array_size(*array)) == 0 || idx >= n ||
lib/libfido2/src/cbor.c
1669
(ret = cbor_new_definite_array(n - 1)) == NULL)
lib/libfido2/src/cbor.c
1671
for (size_t i = 0; i < n; i++) {
lib/libfido2/src/cbor.c
343
cbor_add_arg(cbor_item_t *item, uint8_t n, cbor_item_t *arg)
lib/libfido2/src/cbor.c
353
if ((pair.key = cbor_build_uint8(n)) == NULL) {
lib/libfido2/src/cbor.c
66
size_t n;
lib/libfido2/src/cbor.c
73
n = cbor_map_size(item);
lib/libfido2/src/cbor.c
75
for (size_t i = 0; i < n; i++) {
lib/libfido2/src/config.c
212
size_t n, const char *pin)
lib/libfido2/src/config.c
219
if (fido_str_array_pack(&sa, rpid, n) < 0) {
lib/libfido2/src/credman.c
101
if (cbor_build_frame(cmd, param_cbor, n, hmac_data) < 0) {
lib/libfido2/src/credman.c
22
credman_grow_array(void **ptr, size_t *n_alloc, size_t *n_rx, size_t n,
lib/libfido2/src/credman.c
28
if (n > UINT8_MAX) {
lib/libfido2/src/credman.c
301
uint64_t n;
lib/libfido2/src/credman.c
311
if (cbor_decode_uint64(val, &n) < 0 || n > SIZE_MAX) {
lib/libfido2/src/credman.c
317
(size_t)n, sizeof(*rk->ptr)) < 0) {
lib/libfido2/src/credman.c
34
if (n < *n_alloc)
lib/libfido2/src/credman.c
38
if (*n_rx > 0 || *n_rx > *n_alloc || n < *n_alloc) {
lib/libfido2/src/credman.c
39
fido_log_debug("%s: n=%zu, n_rx=%zu, n_alloc=%zu", __func__, n,
lib/libfido2/src/credman.c
44
if ((new_ptr = recallocarray(*ptr, *n_alloc, n, size)) == NULL)
lib/libfido2/src/credman.c
48
*n_alloc = n;
lib/libfido2/src/credman.c
510
uint64_t n;
lib/libfido2/src/credman.c
520
if (cbor_decode_uint64(val, &n) < 0 || n > SIZE_MAX) {
lib/libfido2/src/credman.c
526
(size_t)n, sizeof(*rp->ptr)) < 0) {
lib/libfido2/src/credman.c
59
size_t n;
lib/libfido2/src/credman.c
69
n = 1;
lib/libfido2/src/credman.c
76
n = 2;
lib/libfido2/src/credman.c
83
n = 3;
lib/libfido2/src/credman.c
97
if ((*param = cbor_flatten_vector(param_cbor, n)) == NULL) {
lib/libfido2/src/err.c
10
fido_strerr(int n)
lib/libfido2/src/err.c
12
switch (n) {
lib/libfido2/src/es256.c
228
int n;
lib/libfido2/src/es256.c
247
(n = BN_num_bytes(d)) < 0 || (size_t)n > sizeof(key->d) ||
lib/libfido2/src/es256.c
248
(n = BN_bn2bin(d, key->d)) < 0 || (size_t)n > sizeof(key->d)) {
lib/libfido2/src/fido/types.h
78
unsigned char n[256];
lib/libfido2/src/hid.c
119
fido_dev_info_new(size_t n)
lib/libfido2/src/hid.c
121
return (calloc(n, sizeof(fido_dev_info_t)));
lib/libfido2/src/hid.c
134
fido_dev_info_free(fido_dev_info_t **devlist_p, size_t n)
lib/libfido2/src/hid.c
141
for (size_t i = 0; i < n; i++)
lib/libfido2/src/hid_openbsd.c
100
int i, n;
lib/libfido2/src/hid_openbsd.c
124
if ((n = poll(&pfd, 1, 100)) == -1) {
lib/libfido2/src/hid_openbsd.c
127
} else if (n == 0) {
lib/libfido2/src/io.c
102
int n;
lib/libfido2/src/io.c
114
if (len > sizeof(pkt) || (n = tx_pkt(d, pkt, len, ms)) < 0 ||
lib/libfido2/src/io.c
115
(size_t)n != len)
lib/libfido2/src/io.c
124
size_t n, sent;
lib/libfido2/src/io.c
131
for (uint8_t seq = 0; sent < count; sent += n) {
lib/libfido2/src/io.c
136
if ((n = tx_frame(d, seq++, buf + sent, count - sent,
lib/libfido2/src/io.c
150
int n;
lib/libfido2/src/io.c
155
n = d->transport.tx(d, cmd, buf, count);
lib/libfido2/src/io.c
160
return (n);
lib/libfido2/src/io.c
183
int n;
lib/libfido2/src/io.c
190
if (d->rx_len > sizeof(*fp) || (n = d->io.read(d->io_handle,
lib/libfido2/src/io.c
191
(unsigned char *)fp, d->rx_len, *ms)) < 0 || (size_t)n != d->rx_len)
lib/libfido2/src/io.c
298
int n;
lib/libfido2/src/io.c
303
n = d->transport.rx(d, cmd, buf, count, *ms);
lib/libfido2/src/io.c
308
return (n);
lib/libfido2/src/io.c
314
int n;
lib/libfido2/src/io.c
325
if ((n = rx(d, cmd, buf, count, ms)) >= 0)
lib/libfido2/src/io.c
326
fido_log_xxd(buf, (size_t)n, "%s", __func__);
lib/libfido2/src/io.c
328
return (n);
lib/libfido2/src/io.c
36
int n;
lib/libfido2/src/io.c
41
n = d->io.write(d->io_handle, pkt, len);
lib/libfido2/src/io.c
46
return (n);
lib/libfido2/src/io.c
55
int n;
lib/libfido2/src/io.c
62
if (len > sizeof(pkt) || (n = tx_pkt(d, pkt, len, ms)) < 0 ||
lib/libfido2/src/io.c
63
(size_t)n != len)
lib/libfido2/src/io.c
75
int n;
lib/libfido2/src/io.c
89
if (len > sizeof(pkt) || (n = tx_pkt(d, pkt, len, ms)) < 0 ||
lib/libfido2/src/io.c
90
(size_t)n != len)
lib/libfido2/src/largeblob.c
425
size_t n;
lib/libfido2/src/largeblob.c
429
if ((n = get_chunklen(dev)) == 0)
lib/libfido2/src/largeblob.c
435
if ((r = largeblob_get_tx(dev, array->len, n, ms)) != FIDO_OK ||
lib/libfido2/src/largeblob.c
438
__func__, array->len, n);
lib/libfido2/src/largeblob.c
446
} while (chunk->len == n);
lib/libfido2/src/nfc.c
150
int n;
lib/libfido2/src/nfc.c
159
if ((n = d->io.read(d->io_handle, f, sizeof(f), ms)) < 2 ||
lib/libfido2/src/nfc.c
160
(f[n - 2] << 8 | f[n - 1]) != SW_NO_ERROR) {
lib/libfido2/src/nfc.c
165
n -= 2;
lib/libfido2/src/nfc.c
167
if (n == sizeof(v_u2f) && memcmp(f, v_u2f, sizeof(v_u2f)) == 0)
lib/libfido2/src/nfc.c
169
else if (n == sizeof(v_fido) && memcmp(f, v_fido, sizeof(v_fido)) == 0)
lib/libfido2/src/nfc.c
207
int n, ok = -1;
lib/libfido2/src/nfc.c
212
if ((n = d->io.read(d->io_handle, f, sizeof(f), *ms)) < 2) {
lib/libfido2/src/nfc.c
220
if (fido_buf_write(buf, count, f, (size_t)(n - 2)) < 0) {
lib/libfido2/src/nfc.c
225
memcpy(sw, f + n - 2, 2);
lib/libfido2/src/pin.c
517
uint64_t n;
lib/libfido2/src/pin.c
526
if (cbor_decode_uint64(val, &n) < 0 || n > INT_MAX) {
lib/libfido2/src/pin.c
531
*retries = (int)n;
lib/libfido2/src/rs256.c
121
BIGNUM *n = NULL;
lib/libfido2/src/rs256.c
125
if ((n = BN_new()) == NULL || (e = BN_new()) == NULL)
lib/libfido2/src/rs256.c
128
if (BN_bin2bn(k->n, sizeof(k->n), n) == NULL ||
lib/libfido2/src/rs256.c
134
if ((rsa = RSA_new()) == NULL || RSA_set0_key(rsa, n, e, NULL) == 0) {
lib/libfido2/src/rs256.c
140
n = NULL;
lib/libfido2/src/rs256.c
158
if (n != NULL)
lib/libfido2/src/rs256.c
159
BN_free(n);
lib/libfido2/src/rs256.c
175
const BIGNUM *n = NULL;
lib/libfido2/src/rs256.c
185
RSA_get0_key(rsa, &n, &e, &d);
lib/libfido2/src/rs256.c
187
if (n == NULL || e == NULL) {
lib/libfido2/src/rs256.c
192
if ((k = BN_num_bytes(n)) < 0 || (size_t)k > sizeof(pk->n) ||
lib/libfido2/src/rs256.c
198
if ((k = BN_bn2bin(n, pk->n)) < 0 || (size_t)k > sizeof(pk->n) ||
lib/libfido2/src/rs256.c
57
return (decode_bignum(val, &k->n, sizeof(k->n)));
lib/libfido2/src/tpm.c
250
memcpy(&expected.key.body, &pk->n, sizeof(expected.key.body));
lib/libfido2/src/types.c
61
fido_str_array_pack(fido_str_array_t *sa, const char * const *v, size_t n)
lib/libfido2/src/types.c
63
if ((sa->ptr = calloc(n, sizeof(char *))) == NULL) {
lib/libfido2/src/types.c
67
for (size_t i = 0; i < n; i++) {
lib/libform/fld_def.c
386
int n;
lib/libform/fld_def.c
388
for (n = 0; n <= field->nbuf; ++n)
lib/libform/fld_def.c
390
FreeIfNeeded(field->expanded[n]);
lib/libform/form.priv.h
266
int n; \
lib/libform/form.priv.h
271
for (n = 0; n < len; ++n) \
lib/libform/form.priv.h
275
if (list[n] != ' ') \
lib/libform/form.priv.h
281
else if (list[n] == ' ') \
lib/libform/form.priv.h
284
result = (n + 1 >= width); \
lib/libform/form.priv.h
286
else if (!ccheck(list[n], NULL)) \
lib/libform/frm_driver.c
104
#define myADDNSTR(w, s, n) wide_waddnstr(w, s, n)
lib/libform/frm_driver.c
105
#define myINSNSTR(w, s, n) wide_winsnstr(w, s, n)
lib/libform/frm_driver.c
106
#define myINNSTR(w, s, n) wide_winnstr(w, s, n)
lib/libform/frm_driver.c
109
#define myADDNSTR(w, s, n) waddnstr(w, s, n)
lib/libform/frm_driver.c
110
#define myINSNSTR(w, s, n) winsnstr(w, s, n)
lib/libform/frm_driver.c
111
#define myINNSTR(w, s, n) winnstr(w, s, n)
lib/libform/frm_driver.c
247
wide_waddnstr(WINDOW *w, const cchar_t *s, int n)
lib/libform/frm_driver.c
251
while (n-- > 0)
lib/libform/frm_driver.c
266
wide_winsnstr(WINDOW *w, const cchar_t *s, int n)
lib/libform/frm_driver.c
270
while (n-- > 0)
lib/libform/frm_driver.c
289
wide_winnstr(WINDOW *w, cchar_t *s, int n)
lib/libform/frm_driver.c
293
win_wchnstr(w, s, n);
lib/libform/frm_driver.c
299
for (x = 0; x < n; ++x)
lib/libform/frm_driver.c
304
return n;
lib/libform/frm_driver.c
4880
int n;
lib/libform/frm_driver.c
4883
for (n = 0; n < size; ++n)
lib/libform/frm_driver.c
4885
if (!isWidecExt(data[n]) && data[n].chars[0] != L'\0')
lib/libform/frm_driver.c
4891
next = _nc_wcrtomb(0, data[n].chars[0], &state);
lib/libform/frm_driver.c
4914
for (n = 0; n < size; ++n)
lib/libform/frm_driver.c
4916
if (!isWidecExt(data[n]) && data[n].chars[0] != L'\0')
lib/libform/frm_driver.c
4917
wadd_wch(field->working, &data[n]);
lib/libform/fty_int.c
191
int n;
lib/libform/fty_int.c
194
for (n = 0; n < len; ++n)
lib/libform/fty_int.c
198
if (list[n] != ' ')
lib/libform/fty_int.c
204
else if (list[n] == ' ')
lib/libform/fty_int.c
208
else if (!isDigit(list[n]))
lib/libform/fty_num.c
211
int n;
lib/libform/fty_num.c
214
for (n = 0; n < len; ++n)
lib/libform/fty_num.c
218
if (list[n] != ' ')
lib/libform/fty_num.c
224
else if (list[n] == ' ')
lib/libform/fty_num.c
228
else if (isDecimalPoint(list[n]))
lib/libform/fty_num.c
236
else if (!isDigit(list[n]))
lib/libform/fty_regex.c
71
#define regcomp(r,s,n) PCRE2regcomp(r,s,n)
lib/libform/fty_regex.c
72
#define regexec(r,s,n,m,x) PCRE2regexec(r,s,n,m,x)
lib/libfuse/debug.h
22
#define DPRINTFN(n, ...) \
lib/libfuse/debug.h
24
if (ifuse_debug >= (n)) \
lib/libfuse/fuse_chan.c
39
ssize_t n;
lib/libfuse/fuse_chan.c
56
n = readv(ch->fd, iov, 2);
lib/libfuse/fuse_chan.c
57
if (n == -1)
lib/libfuse/fuse_chan.c
60
return (n);
lib/libfuse/fuse_chan.c
67
ssize_t n;
lib/libfuse/fuse_chan.c
69
n = writev(ch->fd, iov, count);
lib/libfuse/fuse_chan.c
70
if (n == -1) {
lib/libkeynote/keynote-keygen.c
58
print_space(FILE *fp, int n)
lib/libkeynote/keynote-keygen.c
60
while (n--)
lib/libkeynote/keynote-sigver.c
101
if (n == 0)
lib/libkeynote/keynote-sigver.c
110
for (j = 0; j < n; j++)
lib/libkeynote/keynote-sigver.c
49
int fd, i, n, j;
lib/libkeynote/keynote-sigver.c
93
assertlist = kn_read_asserts(buf, sb.st_size, &n);
lib/libkvm/kvm.c
141
size_t n;
lib/libkvm/kvm.c
152
n = strlen(cp);
lib/libkvm/kvm.c
153
(void)snprintf(&cp[n], sizeof(kd->errbuf) - n, ": %s",
lib/libkvm/kvm.c
160
_kvm_malloc(kvm_t *kd, size_t n)
lib/libkvm/kvm.c
164
if ((p = malloc(n)) == NULL)
lib/libkvm/kvm.c
170
_kvm_realloc(kvm_t *kd, void *p, size_t n)
lib/libkvm/kvm.c
172
if ((p = realloc(p, n)) == NULL)
lib/libkvm/kvm_file2.c
204
int n = 0;
lib/libkvm/kvm_file2.c
254
n++;
lib/libkvm/kvm_file2.c
256
if (n != nfiles) {
lib/libkvm/kvm_file2.c
260
*cnt = n;
lib/libkvm/kvm_file2.c
269
int n = 0, matched = 0;
lib/libkvm/kvm_file2.c
391
n++;
lib/libkvm/kvm_file2.c
402
n++;
lib/libkvm/kvm_file2.c
413
n++;
lib/libkvm/kvm_file2.c
424
n++;
lib/libkvm/kvm_file2.c
451
n++;
lib/libkvm/kvm_file2.c
459
*cnt = n;
lib/libkvm/kvm_proc.c
248
_kvm_reallocarray(kvm_t *kd, void *p, size_t i, size_t n)
lib/libkvm/kvm_proc.c
250
void *np = reallocarray(p, i, n);
lib/libkvm/kvm_proc.c
391
ps_str_a(struct ps_strings *p, u_long *addr, int *n)
lib/libkvm/kvm_proc.c
394
*n = p->ps_nargvstr;
lib/libkvm/kvm_proc.c
398
ps_str_e(struct ps_strings *p, u_long *addr, int *n)
lib/libkvm/kvm_proc.c
401
*n = p->ps_nenvstr;
lib/libm/src/e_fmod.c
117
n = -1022 - iy;
lib/libm/src/e_fmod.c
118
if(n<=20) {
lib/libm/src/e_fmod.c
119
lx = (lx>>n)|((u_int32_t)hx<<(32-n));
lib/libm/src/e_fmod.c
120
hx >>= n;
lib/libm/src/e_fmod.c
121
} else if (n<=31) {
lib/libm/src/e_fmod.c
122
lx = (hx<<(32-n))|(lx>>n); hx = sx;
lib/libm/src/e_fmod.c
124
lx = hx>>(n-32); hx = sx;
lib/libm/src/e_fmod.c
29
int32_t n,hx,hy,hz,ix,iy,sx,i;
lib/libm/src/e_fmod.c
70
n = -1022-ix;
lib/libm/src/e_fmod.c
71
if(n<=31) {
lib/libm/src/e_fmod.c
72
hx = (hx<<n)|(lx>>(32-n));
lib/libm/src/e_fmod.c
73
lx <<= n;
lib/libm/src/e_fmod.c
75
hx = lx<<(n-32);
lib/libm/src/e_fmod.c
82
n = -1022-iy;
lib/libm/src/e_fmod.c
83
if(n<=31) {
lib/libm/src/e_fmod.c
84
hy = (hy<<n)|(ly>>(32-n));
lib/libm/src/e_fmod.c
85
ly <<= n;
lib/libm/src/e_fmod.c
87
hy = ly<<(n-32);
lib/libm/src/e_fmod.c
93
n = ix - iy;
lib/libm/src/e_fmod.c
94
while(n--) {
lib/libm/src/e_fmodf.c
30
int32_t n,hx,hy,hz,ix,iy,sx,i;
lib/libm/src/e_fmodf.c
60
n = -126-ix;
lib/libm/src/e_fmodf.c
61
hx = hx<<n;
lib/libm/src/e_fmodf.c
66
n = -126-iy;
lib/libm/src/e_fmodf.c
67
hy = hy<<n;
lib/libm/src/e_fmodf.c
71
n = ix - iy;
lib/libm/src/e_fmodf.c
72
while(n--) {
lib/libm/src/e_fmodf.c
95
n = -126 - iy;
lib/libm/src/e_fmodf.c
96
hx >>= n;
lib/libm/src/e_jn.c
100
for(i=1;i<n;i++){
lib/libm/src/e_jn.c
111
if(n>33) /* underflow */
lib/libm/src/e_jn.c
115
for (a=one,i=2;i<=n;i++) {
lib/libm/src/e_jn.c
153
w = (n+n)/(double)x; h = 2.0/(double)x;
lib/libm/src/e_jn.c
161
m = n+n;
lib/libm/src/e_jn.c
162
for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t);
lib/libm/src/e_jn.c
173
tmp = n;
lib/libm/src/e_jn.c
177
for(i=n-1,di=(double)(i+i);i>0;i--){
lib/libm/src/e_jn.c
185
for(i=n-1,di=(double)(i+i);i>0;i--){
lib/libm/src/e_jn.c
206
yn(int n, double x)
lib/libm/src/e_jn.c
219
if(n<0){
lib/libm/src/e_jn.c
220
n = -n;
lib/libm/src/e_jn.c
221
sign = 1 - ((n&1)<<1);
lib/libm/src/e_jn.c
223
if(n==0) return(y0(x));
lib/libm/src/e_jn.c
224
if(n==1) return(sign*y1(x));
lib/libm/src/e_jn.c
240
switch(n&3) {
lib/libm/src/e_jn.c
253
for(i=1;i<n&&high!=0xfff00000;i++){
lib/libm/src/e_jn.c
50
jn(int n, double x)
lib/libm/src/e_jn.c
63
if(n<0){
lib/libm/src/e_jn.c
64
n = -n;
lib/libm/src/e_jn.c
68
if(n==0) return(j0(x));
lib/libm/src/e_jn.c
69
if(n==1) return(j1(x));
lib/libm/src/e_jn.c
70
sgn = (n&1)&(hx>>31); /* even n -- 0, odd n -- sign(x) */
lib/libm/src/e_jn.c
74
else if((double)n<=x) {
lib/libm/src/e_jn.c
90
switch(n&3) {
lib/libm/src/e_jnf.c
106
w = (n+n)/(float)x; h = (float)2.0/(float)x;
lib/libm/src/e_jnf.c
114
m = n+n;
lib/libm/src/e_jnf.c
115
for(t=zero, i = 2*(n+k); i>=m; i -= 2) t = one/(i/x-t);
lib/libm/src/e_jnf.c
126
tmp = n;
lib/libm/src/e_jnf.c
130
for(i=n-1,di=(float)(i+i);i>0;i--){
lib/libm/src/e_jnf.c
138
for(i=n-1,di=(float)(i+i);i>0;i--){
lib/libm/src/e_jnf.c
159
ynf(int n, float x)
lib/libm/src/e_jnf.c
172
if(n<0){
lib/libm/src/e_jnf.c
173
n = -n;
lib/libm/src/e_jnf.c
174
sign = 1 - ((n&1)<<1);
lib/libm/src/e_jnf.c
176
if(n==0) return(y0f(x));
lib/libm/src/e_jnf.c
177
if(n==1) return(sign*y1f(x));
lib/libm/src/e_jnf.c
184
for(i=1;i<n&&ib!=0xff800000;i++){
lib/libm/src/e_jnf.c
26
jnf(int n, float x)
lib/libm/src/e_jnf.c
39
if(n<0){
lib/libm/src/e_jnf.c
40
n = -n;
lib/libm/src/e_jnf.c
44
if(n==0) return(j0f(x));
lib/libm/src/e_jnf.c
45
if(n==1) return(j1f(x));
lib/libm/src/e_jnf.c
46
sgn = (n&1)&(hx>>31); /* even n -- 0, odd n -- sign(x) */
lib/libm/src/e_jnf.c
50
else if((float)n<=x) {
lib/libm/src/e_jnf.c
54
for(i=1;i<n;i++){
lib/libm/src/e_jnf.c
64
if(n>33) /* underflow */
lib/libm/src/e_jnf.c
68
for (a=one,i=2;i<=n;i++) {
lib/libm/src/e_lgamma_r.c
157
int n,ix;
lib/libm/src/e_lgamma_r.c
173
n = (int) (y*4.0);
lib/libm/src/e_lgamma_r.c
176
y = zero; n = 0; /* y must be even */
lib/libm/src/e_lgamma_r.c
179
GET_LOW_WORD(n,z);
lib/libm/src/e_lgamma_r.c
180
n &= 1;
lib/libm/src/e_lgamma_r.c
181
y = n;
lib/libm/src/e_lgamma_r.c
182
n<<= 2;
lib/libm/src/e_lgamma_r.c
185
switch (n) {
lib/libm/src/e_lgammaf_r.c
109
n = (int) (y*(float)4.0);
lib/libm/src/e_lgammaf_r.c
112
y = zero; n = 0; /* y must be even */
lib/libm/src/e_lgammaf_r.c
115
GET_FLOAT_WORD(n,z);
lib/libm/src/e_lgammaf_r.c
116
n &= 1;
lib/libm/src/e_lgammaf_r.c
117
y = n;
lib/libm/src/e_lgammaf_r.c
118
n<<= 2;
lib/libm/src/e_lgammaf_r.c
121
switch (n) {
lib/libm/src/e_lgammaf_r.c
93
int n,ix;
lib/libm/src/e_pow.c
101
int32_t i,j,k,yisint,n;
lib/libm/src/e_pow.c
176
n = (hx>>31)+1;
lib/libm/src/e_pow.c
179
if((n|yisint)==0) return (x-x)/(x-x);
lib/libm/src/e_pow.c
182
if((n|(yisint-1))==0) s = -one;/* (-ve)**(odd int) */
lib/libm/src/e_pow.c
204
n = 0;
lib/libm/src/e_pow.c
207
{ax *= two53; n -= 53; GET_HIGH_WORD(ix,ax); }
lib/libm/src/e_pow.c
208
n += ((ix)>>20)-0x3ff;
lib/libm/src/e_pow.c
214
else {k=0;n+=1;ix -= 0x00100000;}
lib/libm/src/e_pow.c
246
t = (double)n;
lib/libm/src/e_pow.c
277
n = 0;
lib/libm/src/e_pow.c
279
n = j+(0x00100000>>(k+1));
lib/libm/src/e_pow.c
280
k = ((n&0x7fffffff)>>20)-0x3ff; /* new k for n */
lib/libm/src/e_pow.c
282
SET_HIGH_WORD(t,n&~(0x000fffff>>k));
lib/libm/src/e_pow.c
283
n = ((n&0x000fffff)|0x00100000)>>(20-k);
lib/libm/src/e_pow.c
284
if(j<0) n = -n;
lib/libm/src/e_pow.c
298
j += (n<<20);
lib/libm/src/e_pow.c
299
if((j>>20)<=0) z = scalbn(z,n); /* subnormal output */
lib/libm/src/e_powf.c
142
n = 0;
lib/libm/src/e_powf.c
145
{ax *= two24; n -= 24; GET_FLOAT_WORD(ix,ax); }
lib/libm/src/e_powf.c
146
n += ((ix)>>23)-0x7f;
lib/libm/src/e_powf.c
152
else {k=0;n+=1;ix -= 0x00800000;}
lib/libm/src/e_powf.c
186
t = (float)n;
lib/libm/src/e_powf.c
219
n = 0;
lib/libm/src/e_powf.c
221
n = j+(0x00800000>>(k+1));
lib/libm/src/e_powf.c
222
k = ((n&0x7fffffff)>>23)-0x7f; /* new k for n */
lib/libm/src/e_powf.c
223
SET_FLOAT_WORD(t,n&~(0x007fffff>>k));
lib/libm/src/e_powf.c
224
n = ((n&0x007fffff)|0x00800000)>>(23-k);
lib/libm/src/e_powf.c
225
if(j<0) n = -n;
lib/libm/src/e_powf.c
240
j += (n<<23);
lib/libm/src/e_powf.c
241
if((j>>23)<=0) z = scalbnf(z,n); /* subnormal output */
lib/libm/src/e_powf.c
57
int32_t i,j,k,yisint,n;
lib/libm/src/e_rem_pio2.c
122
if(hx<0) {y[0] = -y[0]; y[1] = -y[1]; return -n;}
lib/libm/src/e_rem_pio2.c
123
else return n;
lib/libm/src/e_rem_pio2.c
143
n = __kernel_rem_pio2(tx,y,e0,nx,2);
lib/libm/src/e_rem_pio2.c
144
if(hx<0) {y[0] = -y[0]; y[1] = -y[1]; return -n;}
lib/libm/src/e_rem_pio2.c
145
return n;
lib/libm/src/e_rem_pio2.c
58
int32_t e0,i,j,nx,n,ix,hx;
lib/libm/src/e_rem_pio2.c
92
n = (int32_t) (t*invpio2+half);
lib/libm/src/e_rem_pio2.c
93
fn = (double)n;
lib/libm/src/e_rem_pio2.c
96
if(n<32&&ix!=npio2_hw[n-1]) {
lib/libm/src/e_rem_pio2f.c
124
n = (int32_t) (t*invpio2+half);
lib/libm/src/e_rem_pio2f.c
125
fn = (float)n;
lib/libm/src/e_rem_pio2f.c
128
if(n<32&&(ix&0xffffff00)!=npio2_hw[n-1]) {
lib/libm/src/e_rem_pio2f.c
154
if(hx<0) {y[0] = -y[0]; y[1] = -y[1]; return -n;}
lib/libm/src/e_rem_pio2f.c
155
else return n;
lib/libm/src/e_rem_pio2f.c
173
n = __kernel_rem_pio2f(tx,y,e0,nx,2,two_over_pi);
lib/libm/src/e_rem_pio2f.c
174
if(hx<0) {y[0] = -y[0]; y[1] = -y[1]; return -n;}
lib/libm/src/e_rem_pio2f.c
175
return n;
lib/libm/src/e_rem_pio2f.c
91
int32_t e0,i,j,nx,n,ix,hx;
lib/libm/src/k_rem_pio2.c
287
int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
lib/libm/src/k_rem_pio2.c
320
n = (int32_t) z;
lib/libm/src/k_rem_pio2.c
321
z -= (double)n;
lib/libm/src/k_rem_pio2.c
324
i = (iq[jz-1]>>(24-q0)); n += i;
lib/libm/src/k_rem_pio2.c
332
n += 1; carry = 0;
lib/libm/src/k_rem_pio2.c
433
return n&7;
lib/libm/src/k_rem_pio2f.c
193
return n&7;
lib/libm/src/k_rem_pio2f.c
48
int32_t jz,jx,jv,jp,jk,carry,n,iq[20],i,j,k,m,q0,ih;
lib/libm/src/k_rem_pio2f.c
81
n = (int32_t) z;
lib/libm/src/k_rem_pio2f.c
82
z -= (float)n;
lib/libm/src/k_rem_pio2f.c
85
i = (iq[jz-1]>>(8-q0)); n += i;
lib/libm/src/k_rem_pio2f.c
93
n += 1; carry = 0;
lib/libm/src/ld128/e_expl.c
117
int n;
lib/libm/src/ld128/e_expl.c
130
n = px;
lib/libm/src/ld128/e_expl.c
143
x = ldexpl( x, n );
lib/libm/src/ld128/e_fmodl.c
116
n = -16382 - iy;
lib/libm/src/ld128/e_fmodl.c
117
if(n<=48) {
lib/libm/src/ld128/e_fmodl.c
118
lx = (lx>>n)|((u_int64_t)hx<<(64-n));
lib/libm/src/ld128/e_fmodl.c
119
hx >>= n;
lib/libm/src/ld128/e_fmodl.c
120
} else if (n<=63) {
lib/libm/src/ld128/e_fmodl.c
121
lx = (hx<<(64-n))|(lx>>n); hx = sx;
lib/libm/src/ld128/e_fmodl.c
123
lx = hx>>(n-64); hx = sx;
lib/libm/src/ld128/e_fmodl.c
28
int64_t n,hx,hy,hz,ix,iy,sx,i;
lib/libm/src/ld128/e_fmodl.c
69
n = -16382-ix;
lib/libm/src/ld128/e_fmodl.c
70
if(n<=63) {
lib/libm/src/ld128/e_fmodl.c
71
hx = (hx<<n)|(lx>>(64-n));
lib/libm/src/ld128/e_fmodl.c
72
lx <<= n;
lib/libm/src/ld128/e_fmodl.c
74
hx = lx<<(n-64);
lib/libm/src/ld128/e_fmodl.c
81
n = -16382-iy;
lib/libm/src/ld128/e_fmodl.c
82
if(n<=63) {
lib/libm/src/ld128/e_fmodl.c
83
hy = (hy<<n)|(ly>>(64-n));
lib/libm/src/ld128/e_fmodl.c
84
ly <<= n;
lib/libm/src/ld128/e_fmodl.c
86
hy = ly<<(n-64);
lib/libm/src/ld128/e_fmodl.c
92
n = ix - iy;
lib/libm/src/ld128/e_fmodl.c
93
while(n--) {
lib/libm/src/ld128/e_lgammal.c
726
neval (long double x, const long double *p, int n)
lib/libm/src/ld128/e_lgammal.c
730
p += n;
lib/libm/src/ld128/e_lgammal.c
736
while (--n > 0);
lib/libm/src/ld128/e_lgammal.c
744
deval (long double x, const long double *p, int n)
lib/libm/src/ld128/e_lgammal.c
748
p += n;
lib/libm/src/ld128/e_lgammal.c
754
while (--n > 0);
lib/libm/src/ld128/e_log10l.c
145
neval (long double x, const long double *p, int n)
lib/libm/src/ld128/e_log10l.c
149
p += n;
lib/libm/src/ld128/e_log10l.c
155
while (--n > 0);
lib/libm/src/ld128/e_log10l.c
163
deval (long double x, const long double *p, int n)
lib/libm/src/ld128/e_log10l.c
167
p += n;
lib/libm/src/ld128/e_log10l.c
173
while (--n > 0);
lib/libm/src/ld128/e_log2l.c
139
neval (long double x, const long double *p, int n)
lib/libm/src/ld128/e_log2l.c
143
p += n;
lib/libm/src/ld128/e_log2l.c
149
while (--n > 0);
lib/libm/src/ld128/e_log2l.c
157
deval (long double x, const long double *p, int n)
lib/libm/src/ld128/e_log2l.c
161
p += n;
lib/libm/src/ld128/e_log2l.c
167
while (--n > 0);
lib/libm/src/ld128/e_powl.c
149
int32_t i, j, k, yisint, n;
lib/libm/src/ld128/e_powl.c
281
n = 0;
lib/libm/src/ld128/e_powl.c
286
n -= 113;
lib/libm/src/ld128/e_powl.c
290
n += ((ix) >> 16) - 0x3fff;
lib/libm/src/ld128/e_powl.c
301
n += 1;
lib/libm/src/ld128/e_powl.c
353
t = (long double) n;
lib/libm/src/ld128/e_powl.c
405
n = 0;
lib/libm/src/ld128/e_powl.c
408
n = floorl (z + 0.5L);
lib/libm/src/ld128/e_powl.c
409
t = n;
lib/libm/src/ld128/e_powl.c
430
j += (n << 16);
lib/libm/src/ld128/e_powl.c
432
z = scalbnl (z, n); /* subnormal output */
lib/libm/src/ld128/s_erfl.c
101
neval (long double x, const long double *p, int n)
lib/libm/src/ld128/s_erfl.c
105
p += n;
lib/libm/src/ld128/s_erfl.c
111
while (--n > 0);
lib/libm/src/ld128/s_erfl.c
119
deval (long double x, const long double *p, int n)
lib/libm/src/ld128/s_erfl.c
123
p += n;
lib/libm/src/ld128/s_erfl.c
129
while (--n > 0);
lib/libm/src/ld128/s_remquol.c
117
n = ix - iy;
lib/libm/src/ld128/s_remquol.c
120
while(n--) {
lib/libm/src/ld128/s_remquol.c
62
int ix,iy,n,q;
lib/libm/src/ld80/e_expl.c
100
int n;
lib/libm/src/ld80/e_expl.c
115
n = px;
lib/libm/src/ld80/e_expl.c
129
x = ldexpl( x, n );
lib/libm/src/ld80/e_fmodl.c
111
n = ix - iy;
lib/libm/src/ld80/e_fmodl.c
113
while(n--) {
lib/libm/src/ld80/e_fmodl.c
63
int ix,iy,n,sx;
lib/libm/src/ld80/e_lgammal.c
205
int n, ix;
lib/libm/src/ld80/e_lgammal.c
224
n = (int) (y*4.0);
lib/libm/src/ld80/e_lgammal.c
230
y = zero; n = 0; /* y must be even */
lib/libm/src/ld80/e_lgammal.c
237
n = i1 & 1;
lib/libm/src/ld80/e_lgammal.c
238
y = n;
lib/libm/src/ld80/e_lgammal.c
239
n <<= 2;
lib/libm/src/ld80/e_lgammal.c
243
switch (n)
lib/libm/src/ld80/e_powl.c
524
int n, e, sign, asign, lx;
lib/libm/src/ld80/e_powl.c
552
n = -nn;
lib/libm/src/ld80/e_powl.c
557
n = nn;
lib/libm/src/ld80/e_powl.c
565
e = (lx - 1)*n;
lib/libm/src/ld80/e_powl.c
592
if( n & 1 )
lib/libm/src/ld80/e_powl.c
602
n >>= 1;
lib/libm/src/ld80/e_powl.c
603
while( n )
lib/libm/src/ld80/e_powl.c
606
if( n & 1 ) /* if that bit is set, then include in product */
lib/libm/src/ld80/e_powl.c
608
n >>= 1;
lib/libm/src/ld80/s_remquol.c
117
n = ix - iy;
lib/libm/src/ld80/s_remquol.c
120
while(n--) {
lib/libm/src/ld80/s_remquol.c
63
int ix,iy,n,q,sx,sxy;
lib/libm/src/polevll.c
101
} while (--n);
lib/libm/src/polevll.c
72
__polevll(long double x, void *PP, int n)
lib/libm/src/polevll.c
81
} while (--n);
lib/libm/src/polevll.c
91
__p1evll(long double x, void *PP, int n)
lib/libm/src/polevll.c
97
n -= 1;
lib/libm/src/s_casinl.c
102
cn *= n;
lib/libm/src/s_casinl.c
103
n += 1.0L;
lib/libm/src/s_casinl.c
104
cn /= n;
lib/libm/src/s_casinl.c
105
n += 1.0L;
lib/libm/src/s_casinl.c
106
b = cn/n;
lib/libm/src/s_casinl.c
91
long double n, cn;
lib/libm/src/s_casinl.c
95
n = 1.0L;
lib/libm/src/s_cos.c
53
int32_t n, ix;
lib/libm/src/s_cos.c
71
n = __ieee754_rem_pio2(x,y);
lib/libm/src/s_cos.c
72
switch(n&3) {
lib/libm/src/s_cosf.c
23
int32_t n,ix;
lib/libm/src/s_cosf.c
41
n = __ieee754_rem_pio2f(x,y);
lib/libm/src/s_cosf.c
42
switch(n&3) {
lib/libm/src/s_remquo.c
101
n = ix - iy;
lib/libm/src/s_remquo.c
103
while(n--) {
lib/libm/src/s_remquo.c
124
n = -1022 - iy;
lib/libm/src/s_remquo.c
125
if(n<=20) {
lib/libm/src/s_remquo.c
126
lx = (lx>>n)|((u_int32_t)hx<<(32-n));
lib/libm/src/s_remquo.c
127
hx >>= n;
lib/libm/src/s_remquo.c
128
} else if (n<=31) {
lib/libm/src/s_remquo.c
129
lx = (hx<<(32-n))|(lx>>n); hx = sx;
lib/libm/src/s_remquo.c
131
lx = hx>>(n-32); hx = sx;
lib/libm/src/s_remquo.c
31
int32_t n,hx,hy,hz,ix,iy,sx,i;
lib/libm/src/s_remquo.c
78
n = -1022-ix;
lib/libm/src/s_remquo.c
79
if(n<=31) {
lib/libm/src/s_remquo.c
80
hx = (hx<<n)|(lx>>(32-n));
lib/libm/src/s_remquo.c
81
lx <<= n;
lib/libm/src/s_remquo.c
83
hx = lx<<(n-32);
lib/libm/src/s_remquo.c
90
n = -1022-iy;
lib/libm/src/s_remquo.c
91
if(n<=31) {
lib/libm/src/s_remquo.c
92
hy = (hy<<n)|(ly>>(32-n));
lib/libm/src/s_remquo.c
93
ly <<= n;
lib/libm/src/s_remquo.c
95
hy = ly<<(n-32);
lib/libm/src/s_remquof.c
29
int32_t n,hx,hy,hz,ix,iy,sx,i;
lib/libm/src/s_remquof.c
64
n = -126-ix;
lib/libm/src/s_remquof.c
65
hx <<= n;
lib/libm/src/s_remquof.c
70
n = -126-iy;
lib/libm/src/s_remquof.c
71
hy <<= n;
lib/libm/src/s_remquof.c
75
n = ix - iy;
lib/libm/src/s_remquof.c
77
while(n--) {
lib/libm/src/s_remquof.c
98
n = -126 - iy;
lib/libm/src/s_remquof.c
99
hx >>= n;
lib/libm/src/s_scalbln.c
11
scalbln(double x, long n)
lib/libm/src/s_scalbln.c
13
if (n < INT_MIN)
lib/libm/src/s_scalbln.c
15
else if (n > INT_MAX)
lib/libm/src/s_scalbln.c
18
return scalbn(x, (int)n);
lib/libm/src/s_scalbln.c
22
scalblnf(float x, long n)
lib/libm/src/s_scalbln.c
24
if (n < INT_MIN)
lib/libm/src/s_scalbln.c
26
else if (n > INT_MAX)
lib/libm/src/s_scalbln.c
29
return scalbnf(x, (int)n);
lib/libm/src/s_scalbln.c
33
scalblnl(long double x, long n)
lib/libm/src/s_scalbln.c
35
if (n < INT_MIN)
lib/libm/src/s_scalbln.c
37
else if (n > INT_MAX)
lib/libm/src/s_scalbln.c
40
return scalbnl(x, (int)n);
lib/libm/src/s_scalbn.c
24
scalbn (double x, int n)
lib/libm/src/s_scalbn.c
26
return ldexp(x, n);
lib/libm/src/s_scalbnf.c
26
scalbnf(float x, int n)
lib/libm/src/s_scalbnf.c
36
if (n< -50000) return tiny*x; /*underflow*/
lib/libm/src/s_scalbnf.c
39
k = k+n;
lib/libm/src/s_scalbnf.c
44
if (n > 50000) /* in case integer overflow in n+k */
lib/libm/src/s_scalbnf.c
54
ldexpf(float x, int n)
lib/libm/src/s_scalbnf.c
56
return scalbnf(x, n);
lib/libm/src/s_scalbnl.c
41
scalbnl (long double x, int n)
lib/libm/src/s_scalbnl.c
61
if (n< -50000) return tiny*x; /*underflow*/
lib/libm/src/s_scalbnl.c
64
k = k+n;
lib/libm/src/s_scalbnl.c
69
if (n > 50000) /* in case integer overflow in n+k */
lib/libm/src/s_scalbnl.c
80
ldexpl(long double x, int n)
lib/libm/src/s_scalbnl.c
82
return scalbnl(x, n);
lib/libm/src/s_sin.c
53
int32_t n, ix;
lib/libm/src/s_sin.c
71
n = __ieee754_rem_pio2(x,y);
lib/libm/src/s_sin.c
72
switch(n&3) {
lib/libm/src/s_sincos.c
25
int32_t n, ix;
lib/libm/src/s_sincos.c
52
n = __ieee754_rem_pio2(x, y);
lib/libm/src/s_sincos.c
54
switch(n & 3) {
lib/libm/src/s_sincosf.c
103
switch(n & 3) {
lib/libm/src/s_sincosf.c
36
int32_t n, hx, ix;
lib/libm/src/s_sincosf.c
99
n = __ieee754_rem_pio2f(x, y);
lib/libm/src/s_sinf.c
23
int32_t n, ix;
lib/libm/src/s_sinf.c
40
n = __ieee754_rem_pio2f(x,y);
lib/libm/src/s_sinf.c
41
switch(n&3) {
lib/libm/src/s_tan.c
52
int32_t n, ix;
lib/libm/src/s_tan.c
66
n = __ieee754_rem_pio2(x,y);
lib/libm/src/s_tan.c
67
return __kernel_tan(y[0],y[1],1-((n&1)<<1)); /* 1 -- n even
lib/libm/src/s_tanf.c
23
int32_t n, ix;
lib/libm/src/s_tanf.c
36
n = __ieee754_rem_pio2f(x,y);
lib/libm/src/s_tanf.c
37
return __kernel_tanf(y[0],y[1],1-((n&1)<<1)); /* 1 -- n even
lib/libmenu/m_global.c
269
int n;
lib/libmenu/m_global.c
273
for (n = 0; n < count; ++n)
lib/libmenu/m_global.c
275
int test = wcwidth(temp[n]);
lib/libmenu/m_item_new.c
76
int n;
lib/libmenu/m_item_new.c
79
for (n = 0; n < count; ++n)
lib/libmenu/m_item_new.c
80
if (!iswprint((wint_t)temp[n]))
lib/libossaudio/ossaudio.c
227
int v, n;
lib/libossaudio/ossaudio.c
235
n = sioctl_pollfd(hdl, pfds, POLLIN);
lib/libossaudio/ossaudio.c
236
if (n > 0) {
lib/libossaudio/ossaudio.c
237
n = poll(pfds, n, 0);
lib/libossaudio/ossaudio.c
238
if (n == -1)
lib/libossaudio/ossaudio.c
240
if (n > 0)
lib/libossaudio/ossaudio.c
292
n = GET_DEV(com);
lib/libossaudio/ossaudio.c
294
if (c->type != n)
lib/libossaudio/ossaudio.c
302
__func__, n, idat);
lib/libossaudio/ossaudio.c
309
n = GET_DEV(com);
lib/libossaudio/ossaudio.c
311
if (c->type != n)
lib/libossaudio/ossaudio.c
322
__func__, n, v);
lib/libpanel/panel.c
62
_nc_my_visbuf(const void *ptr, int n)
lib/libpanel/panel.c
70
return _nc_visbuf2(n, temp);
lib/libpanel/panel.priv.h
56
# define USER_PTR(ptr,n) _nc_visbuf2(n, (const char *)ptr)
lib/libpanel/panel.priv.h
58
# define USER_PTR(ptr,n) _nc_my_visbuf((const char *)ptr, n)
lib/libpcap/bpf_image.c
141
v = n + 1 + p->k;
lib/libpcap/bpf_image.c
285
n, op, operand, n + 1 + p->jt, n + 1 + p->jf);
lib/libpcap/bpf_image.c
37
bpf_image(const struct bpf_insn *p, int n)
lib/libpcap/fad-getad.c
65
int n;
lib/libpcap/fad-getad.c
80
n = strtonum(cp, 0, INT_MAX, &errstr);
lib/libpcap/fad-getad.c
83
return n;
lib/libpcap/gencode.c
175
newchunk(size_t n)
lib/libpcap/gencode.c
194
p = calloc(1, n);
lib/libpcap/gencode.c
224
int n = strlen(s) + 1;
lib/libpcap/gencode.c
225
char *cp = newchunk(n);
lib/libpcap/gencode.c
227
strlcpy(cp, s, n);
lib/libpcap/gencode.c
2443
bpf_u_int32 n, m;
lib/libpcap/gencode.c
2445
nlen = __pcap_atoin(s1, &n);
lib/libpcap/gencode.c
2447
n <<= 32 - nlen;
lib/libpcap/gencode.c
2453
if ((n & ~m) != 0)
lib/libpcap/gencode.c
2461
if ((n & ~m) != 0)
lib/libpcap/gencode.c
2469
return gen_host(n, m, q.proto, q.dir);
lib/libpcap/gencode.c
2916
int n = BPF_MEMWORDS;
lib/libpcap/gencode.c
2918
while (--n >= 0) {
lib/libpcap/gencode.c
2935
free_reg(int n)
lib/libpcap/gencode.c
2937
regused[n] = 0;
lib/libpcap/gencode.c
2941
gen_len(int jmp, int n)
lib/libpcap/gencode.c
2949
b->s.k = n;
lib/libpcap/gencode.c
2955
gen_greater(int n)
lib/libpcap/gencode.c
2957
return gen_len(BPF_JGE, n);
lib/libpcap/gencode.c
2961
gen_less(int n)
lib/libpcap/gencode.c
2965
b = gen_len(BPF_JGT, n);
lib/libpcap/gencode.h
95
#define ATOMMASK(n) (1 << (n))
lib/libpcap/gencode.h
96
#define ATOMELEM(d, n) (d & ATOMMASK(n))
lib/libpcap/inet.c
117
int n, minunit;
lib/libpcap/inet.c
137
n = strtonum(cp, 0, INT_MAX, &errstr);
lib/libpcap/inet.c
140
if (n < minunit) {
lib/libpcap/inet.c
141
minunit = n;
lib/libpcap/inet.c
156
int fd, minunit, n;
lib/libpcap/inet.c
188
n = ifrp->ifr_addr.sa_len + sizeof(ifrp->ifr_name);
lib/libpcap/inet.c
189
if (n < sizeof(*ifrp))
lib/libpcap/inet.c
192
ifnext = (struct ifreq *)((char *)ifrp + n);
lib/libpcap/inet.c
224
n = strtonum(cp, 0, INT_MAX, &errstr);
lib/libpcap/inet.c
227
if (n < minunit) {
lib/libpcap/inet.c
228
minunit = n;
lib/libpcap/nametoaddr.c
271
u_int n;
lib/libpcap/nametoaddr.c
277
n = 0;
lib/libpcap/nametoaddr.c
279
n = n * 10 + *s++ - '0';
lib/libpcap/nametoaddr.c
281
*addr |= n & 0xff;
lib/libpcap/optimize.c
166
#define SET_INTERSECT(a, b, n)\
lib/libpcap/optimize.c
1684
int n = 0;
lib/libpcap/optimize.c
1688
++n;
lib/libpcap/optimize.c
1689
return n;
lib/libpcap/optimize.c
169
int _n = n;\
lib/libpcap/optimize.c
1712
int n;
lib/libpcap/optimize.c
1718
n = n_blocks++;
lib/libpcap/optimize.c
1719
p->id = n;
lib/libpcap/optimize.c
1720
blocks[n] = p;
lib/libpcap/optimize.c
1733
int n;
lib/libpcap/optimize.c
1738
n = count_stmts(JT(p)) + count_stmts(JF(p));
lib/libpcap/optimize.c
1739
return slength(p->stmts) + n + 1 + p->longjt + p->longjf;
lib/libpcap/optimize.c
1751
int i, n, max_stmts;
lib/libpcap/optimize.c
1759
n = count_blocks(root);
lib/libpcap/optimize.c
176
#define SET_SUBTRACT(a, b, n)\
lib/libpcap/optimize.c
1760
blocks = reallocarray(NULL, n, sizeof(*blocks));
lib/libpcap/optimize.c
179
int _n = n;\
lib/libpcap/optimize.c
1817
for (i = 0; i < n; ++i) {
lib/libpcap/optimize.c
1822
for (i = 0; i < n; ++i) {
lib/libpcap/optimize.c
1828
for (i = 0; i < n; ++i) {
lib/libpcap/optimize.c
1843
for (i = 0; i < n; ++i)
lib/libpcap/optimize.c
186
#define SET_UNION(a, b, n)\
lib/libpcap/optimize.c
189
int _n = n;\
lib/libpcap/optimize.c
2036
int n;
lib/libpcap/optimize.c
2045
n = *lenp = count_stmts(root);
lib/libpcap/optimize.c
2047
fp = calloc(n, sizeof(*fp));
lib/libpcap/optimize.c
2052
ftail = fp + n;
lib/libpcap/pcap-bpf.c
161
if (n == 0) {
lib/libpcap/pcap-bpf.c
165
return (n);
lib/libpcap/pcap-bpf.c
175
if (++n >= cnt && cnt > 0) {
lib/libpcap/pcap-bpf.c
178
return (n);
lib/libpcap/pcap-bpf.c
183
return (n);
lib/libpcap/pcap-bpf.c
72
int n = 0;
lib/libpcap/pcap.c
65
int n;
lib/libpcap/pcap.c
69
n = pcap_offline_read(p, cnt, callback, user);
lib/libpcap/pcap.c
76
n = pcap_read(p, cnt, callback, user);
lib/libpcap/pcap.c
77
} while (n == 0);
lib/libpcap/pcap.c
79
if (n <= 0)
lib/libpcap/pcap.c
80
return (n);
lib/libpcap/pcap.c
82
cnt -= n;
lib/libpcap/savefile.c
363
int n = 0;
lib/libpcap/savefile.c
378
if (n == 0) {
lib/libpcap/savefile.c
382
return (n);
lib/libpcap/savefile.c
395
if (++n >= cnt && cnt > 0)
lib/libpcap/savefile.c
400
return (n);
lib/libradius/radius.c
325
ssize_t n;
lib/libradius/radius.c
327
n = recvfrom(s, buf, sizeof(buf), flags, sa, slen);
lib/libradius/radius.c
328
if (n <= 0)
lib/libradius/radius.c
331
return (radius_convert_packet(buf, (size_t) n));
lib/libradius/radius.c
338
ssize_t n;
lib/libradius/radius.c
340
n = sendto(s, packet->pdata, radius_get_length(packet), flags, sa,
lib/libradius/radius.c
342
if (n != radius_get_length(packet))
lib/libradius/radius.c
352
ssize_t n;
lib/libradius/radius.c
354
n = recv(s, buf, sizeof(buf), flags);
lib/libradius/radius.c
355
if (n <= 0)
lib/libradius/radius.c
358
return (radius_convert_packet(buf, (size_t) n));
lib/libradius/radius.c
364
ssize_t n;
lib/libradius/radius.c
366
n = send(s, packet->pdata, radius_get_length(packet), flags);
lib/libradius/radius.c
367
if (n != radius_get_length(packet))
lib/libradius/radius.c
378
ssize_t n;
lib/libradius/radius.c
387
n = recvmsg(s, msg, flags);
lib/libradius/radius.c
390
if (n <= 0)
lib/libradius/radius.c
393
return (radius_convert_packet(buf, (size_t) n));
lib/libradius/radius.c
402
ssize_t n;
lib/libradius/radius.c
412
n = sendmsg(s, &msg0, flags);
lib/libradius/radius.c
413
if (n != radius_get_length(packet))
lib/librthread/synch.h
23
_wake(volatile uint32_t *p, int n)
lib/librthread/synch.h
25
return futex(p, FUTEX_WAKE, n, NULL, NULL);
lib/librthread/synch.h
60
_requeue(volatile uint32_t *p, int n, int m, volatile uint32_t *q)
lib/librthread/synch.h
62
return futex(p, FUTEX_REQUEUE, n, (void *)(long)m, q);
lib/libskey/skey.h
28
unsigned int n;
lib/libskey/skeylogin.c
158
mp->n = strtonum(cp, 0, UINT_MAX, &errstr);
lib/libskey/skeylogin.c
304
mp->n--;
lib/libskey/skeylogin.c
307
skey_get_algorithm(), mp->n, mp->seed, mp->val);
lib/libskey/skeylogin.c
385
return (skey.n);
lib/libskey/skeylogin.c
533
if (skey.n < 5) {
lib/libskey/skeylogin.c
536
skey.n);
lib/libskey/skeylogin.c
569
int n;
lib/libskey/skeylogin.c
587
while ((n = poll(pfd, 1, timeout)) == -1 &&
lib/libskey/skeylogin.c
590
if (n <= 0 ||
lib/libskey/skeylogin.c
62
skey_get_algorithm(), mp->n - 1,
lib/libskey/skeysubr.c
176
readpass(char *buf, int n)
lib/libskey/skeysubr.c
186
if (fgets(buf, n, stdin) == NULL)
lib/libskey/skeysubr.c
205
readskey(char *buf, int n)
lib/libskey/skeysubr.c
207
if (fgets(buf, n, stdin) == NULL)
lib/libsndio/aucat.c
101
while ((n = write(hdl->fd, data, hdl->wtodo)) == -1) {
lib/libsndio/aucat.c
110
hdl->wtodo -= n;
lib/libsndio/aucat.c
125
ssize_t n;
lib/libsndio/aucat.c
133
while ((n = read(hdl->fd, buf, len)) == -1) {
lib/libsndio/aucat.c
142
if (n == 0) {
lib/libsndio/aucat.c
147
hdl->rtodo -= n;
lib/libsndio/aucat.c
152
DPRINTFN(2, "_aucat_rdata: read: n = %zd\n", n);
lib/libsndio/aucat.c
153
return n;
lib/libsndio/aucat.c
160
ssize_t n;
lib/libsndio/aucat.c
186
while ((n = write(hdl->fd, buf, len)) == -1) {
lib/libsndio/aucat.c
195
DPRINTFN(2, "_aucat_wdata: write: n = %zd\n", n);
lib/libsndio/aucat.c
196
hdl->wtodo -= n;
lib/libsndio/aucat.c
201
return n;
lib/libsndio/aucat.c
45
ssize_t n;
lib/libsndio/aucat.c
513
ssize_t n;
lib/libsndio/aucat.c
526
n = read(hdl->fd, dummy, sizeof(dummy));
lib/libsndio/aucat.c
527
if (n == -1) {
lib/libsndio/aucat.c
532
if (n == 0)
lib/libsndio/aucat.c
55
while ((n = read(hdl->fd, data, hdl->rtodo)) == -1) {
lib/libsndio/aucat.c
64
if (n == 0) {
lib/libsndio/aucat.c
69
hdl->rtodo -= n;
lib/libsndio/aucat.c
87
ssize_t n;
lib/libsndio/debug.h
23
#define DPRINTFN(n, ...) \
lib/libsndio/debug.h
25
if (_sndio_debug >= (n)) \
lib/libsndio/mio.c
118
unsigned int n;
lib/libsndio/mio.c
132
n = hdl->ops->read(hdl, data, todo);
lib/libsndio/mio.c
133
if (n == 0 && hdl->eof)
lib/libsndio/mio.c
135
data += n;
lib/libsndio/mio.c
136
todo -= n;
lib/libsndio/mio.c
137
if (n > 0 || hdl->nbio)
lib/libsndio/mio.c
148
unsigned int n;
lib/libsndio/mio.c
162
n = hdl->ops->write(hdl, data, todo);
lib/libsndio/mio.c
163
if (n == 0) {
lib/libsndio/mio.c
170
data += n;
lib/libsndio/mio.c
171
todo -= n;
lib/libsndio/mio_aucat.c
133
size_t n;
lib/libsndio/mio_aucat.c
139
n = _aucat_wdata(&hdl->aucat, buf, len, 1, &hdl->mio.eof);
lib/libsndio/mio_aucat.c
140
hdl->aucat.maxwrite -= n;
lib/libsndio/mio_aucat.c
141
return n;
lib/libsndio/mio_rmidi.c
154
ssize_t n;
lib/libsndio/mio_rmidi.c
156
while ((n = read(hdl->fd, buf, len)) == -1) {
lib/libsndio/mio_rmidi.c
165
if (n == 0) {
lib/libsndio/mio_rmidi.c
170
return n;
lib/libsndio/mio_rmidi.c
177
ssize_t n;
lib/libsndio/mio_rmidi.c
179
while ((n = write(hdl->fd, buf, len)) == -1) {
lib/libsndio/mio_rmidi.c
188
return n;
lib/libsndio/sio.c
278
ssize_t n, todo;
lib/libsndio/sio.c
284
n = hdl->ops->read(hdl, dummy, todo);
lib/libsndio/sio.c
285
if (n == 0)
lib/libsndio/sio.c
287
hdl->rdrop -= n;
lib/libsndio/sio.c
288
DPRINTF("sio_rdrop: dropped %zu bytes\n", n);
lib/libsndio/sio.c
298
ssize_t n, todo;
lib/libsndio/sio.c
304
n = hdl->ops->write(hdl, zero, todo);
lib/libsndio/sio.c
305
if (n == 0)
lib/libsndio/sio.c
307
hdl->wsil -= n;
lib/libsndio/sio.c
308
DPRINTF("sio_wsil: inserted %zu bytes\n", n);
lib/libsndio/sio.c
316
unsigned int n;
lib/libsndio/sio.c
335
n = maxread > 0 ? hdl->ops->read(hdl, data, maxread) : 0;
lib/libsndio/sio.c
336
if (n == 0) {
lib/libsndio/sio.c
343
data += n;
lib/libsndio/sio.c
344
todo -= n;
lib/libsndio/sio.c
345
hdl->rused -= n;
lib/libsndio/sio.c
353
unsigned int n;
lib/libsndio/sio.c
373
n = maxwrite > 0 ? hdl->ops->write(hdl, data, maxwrite) : 0;
lib/libsndio/sio.c
374
if (n == 0) {
lib/libsndio/sio.c
381
data += n;
lib/libsndio/sio.c
382
todo -= n;
lib/libsndio/sio.c
383
hdl->wused += n;
lib/libsndio/sio_aucat.c
216
unsigned int n, count;
lib/libsndio/sio_aucat.c
233
n = sio_aucat_write(&hdl->sio, zero, count);
lib/libsndio/sio_aucat.c
234
if (n == 0)
lib/libsndio/sio_aucat.c
429
size_t n;
lib/libsndio/sio_aucat.c
441
n = _aucat_wdata(&hdl->aucat, buf, len, hdl->wbpf, &hdl->sio.eof);
lib/libsndio/sio_aucat.c
442
hdl->aucat.maxwrite -= n;
lib/libsndio/sio_aucat.c
443
hdl->walign -= n;
lib/libsndio/sio_aucat.c
446
return n;
lib/libsndio/sio_sun.c
475
ssize_t n;
lib/libsndio/sio_sun.c
477
while ((n = read(hdl->fd, buf, len)) == -1) {
lib/libsndio/sio_sun.c
486
if (n == 0) {
lib/libsndio/sio_sun.c
491
return n;
lib/libsndio/sio_sun.c
499
ssize_t n, todo;
lib/libsndio/sio_sun.c
502
while ((n = write(hdl->fd, data, todo)) == -1) {
lib/libsndio/sio_sun.c
513
hdl->prime -= n;
lib/libsndio/sio_sun.c
524
return n;
lib/libsndio/sioctl_aucat.c
64
int n;
lib/libsndio/sioctl_aucat.c
71
n = _aucat_rdata(&hdl->aucat,
lib/libsndio/sioctl_aucat.c
75
if (n == 0 || hdl->sioctl.eof)
lib/libsndio/sioctl_aucat.c
77
hdl->buf_wpos += n;
lib/libsndio/sioctl_sun.c
495
int idx, n;
lib/libsndio/sioctl_sun.c
502
n = read(hdl->fd, &idx, sizeof(int));
lib/libsndio/sioctl_sun.c
503
if (n == -1) {
lib/libsndio/sioctl_sun.c
510
if (n < sizeof(int)) {
lib/libssl/bio_ssl.c
491
int n, ret;
lib/libssl/bio_ssl.c
493
n = strlen(str);
lib/libssl/bio_ssl.c
494
ret = BIO_write(bp, str, n);
lib/libssl/bs_cbs.c
40
cbs_get(CBS *cbs, const uint8_t **p, size_t n)
lib/libssl/bs_cbs.c
42
if (cbs->len < n)
lib/libssl/bs_cbs.c
46
cbs->data += n;
lib/libssl/bs_cbs.c
47
cbs->len -= n;
lib/libssl/bs_cbs.c
52
cbs_peek(CBS *cbs, const uint8_t **p, size_t n)
lib/libssl/bs_cbs.c
54
if (cbs->len < n)
lib/libssl/d1_pkt.c
414
int ret, n;
lib/libssl/d1_pkt.c
435
n = ssl3_packet_read(s, DTLS1_RT_HEADER_LENGTH);
lib/libssl/d1_pkt.c
436
if (n <= 0)
lib/libssl/d1_pkt.c
437
return (n);
lib/libssl/d1_pkt.c
440
if (n != DTLS1_RT_HEADER_LENGTH)
lib/libssl/d1_pkt.c
487
n = ssl3_packet_extend(s, DTLS1_RT_HEADER_LENGTH + rr->length);
lib/libssl/d1_pkt.c
488
if (n <= 0)
lib/libssl/d1_pkt.c
489
return (n);
lib/libssl/d1_pkt.c
492
if (n != DTLS1_RT_HEADER_LENGTH + rr->length)
lib/libssl/s3_cbc.c
283
#define u32toLE(n, p) \
lib/libssl/s3_cbc.c
284
(*((p)++)=(unsigned char)(n), \
lib/libssl/s3_cbc.c
285
*((p)++)=(unsigned char)(n>>8), \
lib/libssl/s3_cbc.c
286
*((p)++)=(unsigned char)(n>>16), \
lib/libssl/s3_cbc.c
287
*((p)++)=(unsigned char)(n>>24))
lib/libssl/s3_lib.c
1400
_SSL_get_shared_group(SSL *s, long n)
lib/libssl/s3_lib.c
1409
if (n == -1) {
lib/libssl/s3_lib.c
1420
if (n == -2)
lib/libssl/s3_lib.c
1421
n = 0;
lib/libssl/s3_lib.c
1423
if (n < 0)
lib/libssl/s3_lib.c
1426
if (!tls1_get_shared_group_by_index(s, n, &nid))
lib/libssl/ssl.h
1029
#define SSL_get_shared_group(s, n) \
lib/libssl/ssl.h
1030
SSL_ctrl((s), SSL_CTRL_GET_SHARED_GROUP, (n), NULL)
lib/libssl/ssl.h
1125
const char * SSL_get_cipher_list(const SSL *s, int n);
lib/libssl/ssl_both.c
257
long n;
lib/libssl/ssl_both.c
348
n = s->s3->hs.tls12.message_size - s->init_num;
lib/libssl/ssl_both.c
349
while (n > 0) {
lib/libssl/ssl_both.c
351
&p[s->init_num], n, 0);
lib/libssl/ssl_both.c
357
n -= i;
lib/libssl/ssl_lib.c
1610
SSL_get_cipher_list(const SSL *s, int n)
lib/libssl/ssl_lib.c
1617
if ((cipher = sk_SSL_CIPHER_value(ciphers, n)) == NULL)
lib/libssl/ssl_pkt.c
153
ssl3_read_n(SSL *s, int n, int max, int extend)
lib/libssl/ssl_pkt.c
160
if (n <= 0)
lib/libssl/ssl_pkt.c
161
return n;
lib/libssl/ssl_pkt.c
204
if (left > 0 && n > left)
lib/libssl/ssl_pkt.c
205
n = left;
lib/libssl/ssl_pkt.c
209
if (left >= n) {
lib/libssl/ssl_pkt.c
210
s->packet_length += n;
lib/libssl/ssl_pkt.c
211
rb->left = left - n;
lib/libssl/ssl_pkt.c
212
rb->offset += n;
lib/libssl/ssl_pkt.c
213
return (n);
lib/libssl/ssl_pkt.c
230
if (n > (int)(rb->len - rb->offset)) {
lib/libssl/ssl_pkt.c
237
if (max < n)
lib/libssl/ssl_pkt.c
238
max = n;
lib/libssl/ssl_pkt.c
243
max = n;
lib/libssl/ssl_pkt.c
246
while (left < n) {
lib/libssl/ssl_pkt.c
277
if (n > left)
lib/libssl/ssl_pkt.c
278
n = left; /* makes the while condition false */
lib/libssl/ssl_pkt.c
283
rb->offset += n;
lib/libssl/ssl_pkt.c
284
rb->left = left - n;
lib/libssl/ssl_pkt.c
285
s->packet_length += n;
lib/libssl/ssl_pkt.c
288
return (n);
lib/libssl/ssl_pkt.c
294
int n;
lib/libssl/ssl_pkt.c
296
n = ssl3_read_n(s, plen, s->s3->rbuf.len, 0);
lib/libssl/ssl_pkt.c
297
if (n <= 0)
lib/libssl/ssl_pkt.c
298
return n;
lib/libssl/ssl_pkt.c
308
int rlen, n;
lib/libssl/ssl_pkt.c
314
n = ssl3_read_n(s, rlen, rlen, 1);
lib/libssl/ssl_pkt.c
315
if (n <= 0)
lib/libssl/ssl_pkt.c
316
return n;
lib/libssl/ssl_pkt.c
338
int al, n;
lib/libssl/ssl_pkt.c
349
n = ssl3_packet_read(s, SSL3_RT_HEADER_LENGTH);
lib/libssl/ssl_pkt.c
350
if (n <= 0)
lib/libssl/ssl_pkt.c
351
return (n);
lib/libssl/ssl_pkt.c
392
n = ssl3_packet_extend(s, SSL3_RT_HEADER_LENGTH + rr->length);
lib/libssl/ssl_pkt.c
393
if (n <= 0)
lib/libssl/ssl_pkt.c
394
return (n);
lib/libssl/ssl_pkt.c
395
if (n != SSL3_RT_HEADER_LENGTH + rr->length)
lib/libssl/ssl_pkt.c
396
return (n);
lib/libssl/ssl_pkt.c
471
unsigned int tot, n, nw;
lib/libssl/ssl_pkt.c
495
n = (len - tot);
lib/libssl/ssl_pkt.c
497
if (n > s->max_send_fragment)
lib/libssl/ssl_pkt.c
500
nw = n;
lib/libssl/ssl_pkt.c
508
if ((i == (int)n) || (type == SSL3_RT_APPLICATION_DATA &&
lib/libssl/ssl_pkt.c
512
n -= i;
lib/libssl/ssl_pkt.c
636
ssl3_read_cb(void *buf, size_t n, void *cb_arg)
lib/libssl/ssl_pkt.c
640
return tls_content_read(s->s3->rcontent, buf, n);
lib/libssl/t1_lib.c
541
tls1_group_by_index(const SSL *ssl, size_t n, int *out_nid,
lib/libssl/t1_lib.c
558
if (count++ == n)
lib/libssl/tls13_handshake_msg.c
114
tls13_handshake_msg_read_cb(void *buf, size_t n, void *cb_arg)
lib/libssl/tls13_handshake_msg.c
118
return tls13_read_handshake_data(rl, buf, n);
lib/libssl/tls13_internal.h
224
ssize_t tls13_read_handshake_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n);
lib/libssl/tls13_internal.h
226
size_t n);
lib/libssl/tls13_internal.h
228
ssize_t tls13_peek_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n);
lib/libssl/tls13_internal.h
229
ssize_t tls13_read_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n);
lib/libssl/tls13_internal.h
231
size_t n);
lib/libssl/tls13_internal.h
331
ssize_t tls13_legacy_wire_read_cb(void *buf, size_t n, void *arg);
lib/libssl/tls13_internal.h
332
ssize_t tls13_legacy_wire_write_cb(const void *buf, size_t n, void *arg);
lib/libssl/tls13_legacy.c
26
int n;
lib/libssl/tls13_legacy.c
262
size_t n, sent;
lib/libssl/tls13_legacy.c
300
n = len - sent;
lib/libssl/tls13_legacy.c
302
if (n == 0) {
lib/libssl/tls13_legacy.c
307
&buf[sent], n)) <= 0) {
lib/libssl/tls13_legacy.c
312
n -= ret;
lib/libssl/tls13_legacy.c
36
if ((n = BIO_read(ssl->rbio, buf, len)) <= 0) {
lib/libssl/tls13_legacy.c
39
if (n == 0)
lib/libssl/tls13_legacy.c
48
if (n == len)
lib/libssl/tls13_legacy.c
51
return n;
lib/libssl/tls13_legacy.c
55
tls13_legacy_wire_read_cb(void *buf, size_t n, void *arg)
lib/libssl/tls13_legacy.c
59
return tls13_legacy_wire_read(ctx->ssl, buf, n);
lib/libssl/tls13_legacy.c
65
int n;
lib/libssl/tls13_legacy.c
75
if ((n = BIO_write(ssl->wbio, buf, len)) <= 0) {
lib/libssl/tls13_legacy.c
85
if (n == len)
lib/libssl/tls13_legacy.c
88
return n;
lib/libssl/tls13_legacy.c
92
tls13_legacy_wire_write_cb(const void *buf, size_t n, void *arg)
lib/libssl/tls13_legacy.c
96
return tls13_legacy_wire_write(ctx->ssl, buf, n);
lib/libssl/tls13_quic.c
22
tls13_quic_wire_read_cb(void *buf, size_t n, void *arg)
lib/libssl/tls13_quic.c
32
tls13_quic_wire_write_cb(const void *buf, size_t n, void *arg)
lib/libssl/tls13_quic.c
56
tls13_quic_handshake_read_cb(void *buf, size_t n, void *arg)
lib/libssl/tls13_quic.c
63
return tls_buffer_read(ctx->hs->tls13.quic_read_buffer, buf, n);
lib/libssl/tls13_quic.c
67
tls13_quic_handshake_write_cb(const void *buf, size_t n, void *arg)
lib/libssl/tls13_quic.c
73
ctx->hs->tls13.quic_write_level, buf, n)) {
lib/libssl/tls13_quic.c
78
return n;
lib/libssl/tls13_record_layer.c
1003
return tls_content_peek(rl->rcontent, buf, n);
lib/libssl/tls13_record_layer.c
1005
return tls_content_read(rl->rcontent, buf, n);
lib/libssl/tls13_record_layer.c
1010
uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1015
ret = tls13_record_layer_read_internal(rl, content_type, buf, n, 1);
lib/libssl/tls13_record_layer.c
1026
uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1031
ret = tls13_record_layer_read_internal(rl, content_type, buf, n, 0);
lib/libssl/tls13_record_layer.c
1102
uint8_t content_type, const uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1104
if (n > TLS13_RECORD_MAX_PLAINTEXT_LEN)
lib/libssl/tls13_record_layer.c
1105
n = TLS13_RECORD_MAX_PLAINTEXT_LEN;
lib/libssl/tls13_record_layer.c
1107
return tls13_record_layer_write_record(rl, content_type, buf, n);
lib/libssl/tls13_record_layer.c
1112
const uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1123
ret = tls13_record_layer_write_chunk(rl, content_type, buf, n);
lib/libssl/tls13_record_layer.c
1155
tls13_read_handshake_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1158
return rl->cb.handshake_read(buf, n, rl->cb_arg);
lib/libssl/tls13_record_layer.c
1160
return tls13_record_layer_read(rl, SSL3_RT_HANDSHAKE, buf, n);
lib/libssl/tls13_record_layer.c
1165
size_t n)
lib/libssl/tls13_record_layer.c
1168
return rl->cb.handshake_write(buf, n, rl->cb_arg);
lib/libssl/tls13_record_layer.c
1170
return tls13_record_layer_write(rl, SSL3_RT_HANDSHAKE, buf, n);
lib/libssl/tls13_record_layer.c
1183
tls13_peek_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1188
return tls13_record_layer_peek(rl, SSL3_RT_APPLICATION_DATA, buf, n);
lib/libssl/tls13_record_layer.c
1192
tls13_read_application_data(struct tls13_record_layer *rl, uint8_t *buf, size_t n)
lib/libssl/tls13_record_layer.c
1197
return tls13_record_layer_read(rl, SSL3_RT_APPLICATION_DATA, buf, n);
lib/libssl/tls13_record_layer.c
1202
size_t n)
lib/libssl/tls13_record_layer.c
1207
return tls13_record_layer_write(rl, SSL3_RT_APPLICATION_DATA, buf, n);
lib/libssl/tls13_record_layer.c
23
uint8_t content_type, const uint8_t *buf, size_t n);
lib/libssl/tls13_record_layer.c
958
uint8_t content_type, uint8_t *buf, size_t n, int peek)
lib/libssl/tls_buffer.c
168
tls_buffer_read(struct tls_buffer *buf, uint8_t *rbuf, size_t n)
lib/libssl/tls_buffer.c
176
if (n > buf->len - buf->offset)
lib/libssl/tls_buffer.c
177
n = buf->len - buf->offset;
lib/libssl/tls_buffer.c
179
memcpy(rbuf, &buf->data[buf->offset], n);
lib/libssl/tls_buffer.c
181
buf->offset += n;
lib/libssl/tls_buffer.c
183
return n;
lib/libssl/tls_buffer.c
187
tls_buffer_write(struct tls_buffer *buf, const uint8_t *wbuf, size_t n)
lib/libssl/tls_buffer.c
209
if (buf->len > SIZE_MAX - n)
lib/libssl/tls_buffer.c
211
if (!tls_buffer_grow(buf, buf->len + n))
lib/libssl/tls_buffer.c
214
memcpy(&buf->data[buf->len], wbuf, n);
lib/libssl/tls_buffer.c
216
buf->len += n;
lib/libssl/tls_buffer.c
218
return n;
lib/libssl/tls_buffer.c
222
tls_buffer_append(struct tls_buffer *buf, const uint8_t *wbuf, size_t n)
lib/libssl/tls_buffer.c
224
return tls_buffer_write(buf, wbuf, n) == n;
lib/libssl/tls_content.c
137
tls_content_read_internal(struct tls_content *content, uint8_t *buf, size_t n,
lib/libssl/tls_content.c
140
if (n > CBS_len(&content->cbs))
lib/libssl/tls_content.c
141
n = CBS_len(&content->cbs);
lib/libssl/tls_content.c
144
memcpy(buf, CBS_data(&content->cbs), n);
lib/libssl/tls_content.c
147
if (!CBS_skip(&content->cbs, n))
lib/libssl/tls_content.c
151
return n;
lib/libssl/tls_content.c
155
tls_content_peek(struct tls_content *content, uint8_t *buf, size_t n)
lib/libssl/tls_content.c
157
return tls_content_read_internal(content, buf, n, 1);
lib/libssl/tls_content.c
161
tls_content_read(struct tls_content *content, uint8_t *buf, size_t n)
lib/libssl/tls_content.c
163
return tls_content_read_internal(content, buf, n, 0);
lib/libssl/tls_content.c
64
tls_content_equal(struct tls_content *content, const uint8_t *buf, size_t n)
lib/libssl/tls_content.c
66
return CBS_mem_equal(&content->cbs, buf, n);
lib/libssl/tls_content.h
32
int tls_content_equal(struct tls_content *content, const uint8_t *buf, size_t n);
lib/libssl/tls_content.h
45
ssize_t tls_content_peek(struct tls_content *content, uint8_t *buf, size_t n);
lib/libssl/tls_content.h
46
ssize_t tls_content_read(struct tls_content *content, uint8_t *buf, size_t n);
lib/libssl/tls_internal.h
68
ssize_t tls_buffer_read(struct tls_buffer *buf, uint8_t *rbuf, size_t n);
lib/libssl/tls_internal.h
69
ssize_t tls_buffer_write(struct tls_buffer *buf, const uint8_t *wbuf, size_t n);
lib/libssl/tls_internal.h
70
int tls_buffer_append(struct tls_buffer *buf, const uint8_t *wbuf, size_t n);
lib/libtls/tls_client.c
177
ssize_t n;
lib/libtls/tls_client.c
199
n = pread(sfd, session, session_len, 0);
lib/libtls/tls_client.c
200
if (n < 0 || (size_t)n != session_len) {
lib/libtls/tls_client.c
241
ssize_t n;
lib/libtls/tls_client.c
269
if ((n = pwrite(sfd, data + offset, len, offset)) == -1) {
lib/libtls/tls_client.c
274
offset += n;
lib/libtls/tls_client.c
275
len -= n;
lib/libtls/tls_config.c
46
ssize_t n;
lib/libtls/tls_config.c
73
n = read(fd, *buf, *len);
lib/libtls/tls_config.c
74
if (n < 0 || (size_t)n != *len) {
lib/libtls/tls_util.c
161
ssize_t n;
lib/libtls/tls_util.c
177
n = read(fd, buf, size);
lib/libtls/tls_util.c
178
if (n < 0 || (size_t)n != size)
lib/libusbhid/usage.c
112
n = strdup(name);
lib/libusbhid/usage.c
113
if (!n)
lib/libusbhid/usage.c
120
free(n);
lib/libusbhid/usage.c
134
free(n);
lib/libusbhid/usage.c
140
curpage->page_contents[curpage->pagesize].name = n;
lib/libusbhid/usage.c
157
free(n);
lib/libusbhid/usage.c
166
free(n);
lib/libusbhid/usage.c
172
curpage->name = n;
lib/libusbhid/usage.c
80
char line[100], name[100], *p, *n;
lib/libutil/ber.c
1217
u_char u, n;
lib/libutil/ber.c
1240
n = u & ~BER_TAG_MORE;
lib/libutil/ber.c
1244
if (sizeof(int32_t) < n) {
lib/libutil/ber.c
1248
r = n + 1;
lib/libutil/ber.c
1250
for (s = 0; n > 0; n--) {
lib/libutil/ber.c
211
ober_get_integer(struct ber_element *elm, long long *n)
lib/libutil/ber.c
216
if (n != NULL)
lib/libutil/ber.c
217
*n = elm->be_numeric;
lib/libutil/ber.c
222
ober_get_enumerated(struct ber_element *elm, long long *n)
lib/libutil/ber.c
227
if (n != NULL)
lib/libutil/ber.c
228
*n = elm->be_numeric;
lib/libutil/ber.c
527
ober_add_noid(struct ber_element *prev, struct ber_oid *o, int n)
lib/libutil/ber.c
531
if (n > BER_MAX_OID_LEN)
lib/libutil/ber.c
533
no.bo_n = n;
lib/libutil/ber.c
709
size_t *len, ret = 0, n = strlen(fmt);
lib/libutil/ber.c
836
return (ret == n ? 0 : -1);
lib/libutil/imsg-buffer.c
253
size_t n;
lib/libutil/imsg-buffer.c
258
n = strlcpy(b, str, len);
lib/libutil/imsg-buffer.c
259
if (n >= len) {
lib/libutil/imsg-buffer.c
264
memset(b + n, 0, len - n);
lib/libutil/imsg-buffer.c
717
ssize_t n;
lib/libutil/imsg-buffer.c
731
if ((n = writev(fd, iov, i)) == -1) {
lib/libutil/imsg-buffer.c
740
msgbuf_drain(msgbuf, n);
lib/libutil/imsg-buffer.c
750
ssize_t n;
lib/libutil/imsg-buffer.c
790
if ((n = sendmsg(fd, &msg, 0)) == -1) {
lib/libutil/imsg-buffer.c
808
msgbuf_drain(msgbuf, n);
lib/libutil/imsg-buffer.c
868
ssize_t n;
lib/libutil/imsg-buffer.c
879
if ((n = readv(fd, &iov, 1)) == -1) {
lib/libutil/imsg-buffer.c
887
if (n == 0) /* connection closed */
lib/libutil/imsg-buffer.c
890
msgbuf->roff += n;
lib/libutil/imsg-buffer.c
905
ssize_t n;
lib/libutil/imsg-buffer.c
924
if ((n = recvmsg(fd, &msg, 0)) == -1) {
lib/libutil/imsg-buffer.c
939
if (n == 0) /* connection closed */
lib/libutil/imsg-buffer.c
942
msgbuf->roff += n;
lib/libutil/imsg-buffer.c
973
msgbuf_drain(struct msgbuf *msgbuf, size_t n)
lib/libutil/imsg-buffer.c
978
if (n >= ibuf_size(buf)) {
lib/libutil/imsg-buffer.c
979
n -= ibuf_size(buf);
lib/libutil/imsg-buffer.c
984
buf->rpos += n;
lib/libutil/login_fbtab.c
129
size_t n;
lib/libutil/login_fbtab.c
145
for (n = 0; n < g.gl_matchc; n++) {
lib/libutil/login_fbtab.c
146
gpath = g.gl_pathv[n];
lib/libutil/ohash.c
101
while (n[i].p != NULL) {
lib/libutil/ohash.c
106
n[i].hv = h->t[j].hv;
lib/libutil/ohash.c
107
n[i].p = h->t[j].p;
lib/libutil/ohash.c
111
h->t = n;
lib/libutil/ohash.c
72
struct _ohash_record *n;
lib/libutil/ohash.c
93
n = (h->info.calloc)(ns, sizeof(struct _ohash_record), h->info.data);
lib/libutil/ohash.c
94
if (!n)
lib/libz/adler32.c
101
} while (--n);
lib/libz/adler32.c
61
unsigned n;
lib/libz/adler32.c
97
n = NMAX / 16; /* NMAX is divisible by 16 */
lib/libz/crc32.c
182
local uLong x2nmodp(z_off64_t n, unsigned k) {
lib/libz/crc32.c
186
while (n) {
lib/libz/crc32.c
187
if (n & 1)
lib/libz/crc32.c
189
n >>= 1;
lib/libz/crc32.c
242
unsigned i, j, n;
lib/libz/crc32.c
259
for (n = 1; n < 32; n++)
lib/libz/crc32.c
260
x2n_table[n] = p = (z_crc_t)multmodp(p, p);
lib/libz/crc32.c
279
int k, n;
lib/libz/crc32.c
324
for (n = 1; n <= 6; n++) {
lib/libz/crc32.c
327
"#if N == %d\n", n);
lib/libz/crc32.c
330
braid(ltl, big, n, 8);
lib/libz/crc32.c
356
braid(ltl, big, n, 4);
lib/libz/crc32.c
409
int n;
lib/libz/crc32.c
411
for (n = 0; n < k; n++)
lib/libz/crc32.c
412
fprintf(out, "%s0x%08lx%s", n == 0 || n % 5 ? "" : " ",
lib/libz/crc32.c
413
(unsigned long)(table[n]),
lib/libz/crc32.c
414
n == k - 1 ? "" : (n % 5 == 4 ? ",\n" : ", "));
lib/libz/crc32.c
422
int n;
lib/libz/crc32.c
424
for (n = 0; n < k; n++)
lib/libz/crc32.c
425
fprintf(out, "%s0x%08lx%s", n == 0 || n % 5 ? "" : " ",
lib/libz/crc32.c
426
(unsigned long)(table[n] >> 32),
lib/libz/crc32.c
427
n == k - 1 ? "" : (n % 5 == 4 ? ",\n" : ", "));
lib/libz/crc32.c
438
int n;
lib/libz/crc32.c
440
for (n = 0; n < k; n++)
lib/libz/crc32.c
441
fprintf(out, "%s0x%016llx%s", n == 0 || n % 3 ? "" : " ",
lib/libz/crc32.c
442
(unsigned long long)(table[n]),
lib/libz/crc32.c
443
n == k - 1 ? "" : (n % 3 == 2 ? ",\n" : ", "));
lib/libz/crc32.c
459
local void braid(z_crc_t ltl[][256], z_word_t big[][256], int n, int w) {
lib/libz/crc32.c
463
p = (z_crc_t)x2nmodp((n * w + 3 - k) << 3, 0);
lib/libz/deflate.c
184
unsigned n, m;
lib/libz/deflate.c
188
n = s->hash_size;
lib/libz/deflate.c
189
p = &s->head[n];
lib/libz/deflate.c
193
} while (--n);
lib/libz/deflate.c
195
n = wsize;
lib/libz/deflate.c
196
p = &s->prev[n];
lib/libz/deflate.c
203
} while (--n);
lib/libz/deflate.c
249
unsigned n;
lib/libz/deflate.c
307
n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
lib/libz/deflate.c
308
s->lookahead += n;
lib/libz/deflate.c
558
uInt str, n;
lib/libz/deflate.c
595
n = s->lookahead - (MIN_MATCH-1);
lib/libz/deflate.c
603
} while (--n);
lib/libz/gzlib.c
368
unsigned n;
lib/libz/gzlib.c
424
n = GT_OFF(state->x.have) || (z_off64_t)state->x.have > offset ?
lib/libz/gzlib.c
426
state->x.have -= n;
lib/libz/gzlib.c
427
state->x.next += n;
lib/libz/gzlib.c
428
state->x.pos += n;
lib/libz/gzlib.c
429
offset -= n;
lib/libz/gzread.c
282
unsigned n;
lib/libz/gzread.c
288
n = GT_OFF(state->x.have) ||
lib/libz/gzread.c
291
state->x.have -= n;
lib/libz/gzread.c
292
state->x.next += n;
lib/libz/gzread.c
293
state->x.pos += n;
lib/libz/gzread.c
294
state->skip -= n;
lib/libz/gzread.c
319
unsigned n;
lib/libz/gzread.c
335
n = (unsigned)-1;
lib/libz/gzread.c
336
if (n > len)
lib/libz/gzread.c
337
n = (unsigned)len;
lib/libz/gzread.c
341
if (state->x.have < n)
lib/libz/gzread.c
342
n = state->x.have;
lib/libz/gzread.c
343
memcpy(buf, state->x.next, n);
lib/libz/gzread.c
344
state->x.next += n;
lib/libz/gzread.c
345
state->x.have -= n;
lib/libz/gzread.c
357
else if (state->how == LOOK || n < (state->size << 1)) {
lib/libz/gzread.c
369
err = gz_load(state, (unsigned char *)buf, n, &n);
lib/libz/gzread.c
373
state->strm.avail_out = n;
lib/libz/gzread.c
376
n = state->x.have;
lib/libz/gzread.c
381
len -= n;
lib/libz/gzread.c
382
buf = (char *)buf + n;
lib/libz/gzread.c
383
got += n;
lib/libz/gzread.c
384
state->x.pos += n;
lib/libz/gzread.c
567
unsigned left, n;
lib/libz/gzread.c
603
n = state->x.have > left ? left : state->x.have;
lib/libz/gzread.c
604
eol = (unsigned char *)memchr(state->x.next, '\n', n);
lib/libz/gzread.c
606
n = (unsigned)(eol - state->x.next) + 1;
lib/libz/gzread.c
609
memcpy(buf, state->x.next, n);
lib/libz/gzread.c
610
state->x.have -= n;
lib/libz/gzread.c
611
state->x.next += n;
lib/libz/gzread.c
612
state->x.pos += n;
lib/libz/gzread.c
613
left -= n;
lib/libz/gzread.c
614
buf += n;
lib/libz/gzread.c
68
unsigned n = strm->avail_in;
lib/libz/gzread.c
72
} while (--n);
lib/libz/gzwrite.c
156
unsigned n;
lib/libz/gzwrite.c
166
n = GT_OFF(state->size) || (z_off64_t)state->size > state->skip ?
lib/libz/gzwrite.c
169
memset(state->in, 0, n);
lib/libz/gzwrite.c
172
strm->avail_in = n;
lib/libz/gzwrite.c
175
n -= strm->avail_in;
lib/libz/gzwrite.c
176
state->x.pos += n;
lib/libz/gzwrite.c
177
state->skip -= n;
lib/libz/gzwrite.c
236
unsigned n = (unsigned)-1;
lib/libz/gzwrite.c
238
if (n > len)
lib/libz/gzwrite.c
239
n = (unsigned)len;
lib/libz/gzwrite.c
240
state->strm.avail_in = n;
lib/libz/gzwrite.c
242
n -= state->strm.avail_in;
lib/libz/gzwrite.c
243
state->x.pos += n;
lib/libz/gzwrite.c
244
len -= n;
lib/libz/infback.c
124
#define NEEDBITS(n) \
lib/libz/infback.c
126
while (bits < (unsigned)(n)) \
lib/libz/infback.c
131
#define BITS(n) \
lib/libz/infback.c
132
((unsigned)hold & ((1U << (n)) - 1))
lib/libz/infback.c
135
#define DROPBITS(n) \
lib/libz/infback.c
137
hold >>= (n); \
lib/libz/infback.c
138
bits -= (unsigned)(n); \
lib/libz/inflate.c
368
#define NEEDBITS(n) \
lib/libz/inflate.c
370
while (bits < (unsigned)(n)) \
lib/libz/inflate.c
375
#define BITS(n) \
lib/libz/inflate.c
376
((unsigned)hold & ((1U << (n)) - 1))
lib/libz/inflate.c
379
#define DROPBITS(n) \
lib/libz/inflate.c
381
hold >>= (n); \
lib/libz/inflate.c
382
bits -= (unsigned)(n); \
lib/libz/trees.c
205
int n; /* code index */
lib/libz/trees.c
221
for (n = 0; n <= max_code; n++) {
lib/libz/trees.c
222
int len = tree[n].Len;
lib/libz/trees.c
225
tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
lib/libz/trees.c
228
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
lib/libz/trees.c
296
int n; /* iterates over tree elements */
lib/libz/trees.c
319
for (n = 0; n < (1 << extra_lbits[code]); n++) {
lib/libz/trees.c
334
for (n = 0; n < (1 << extra_dbits[code]); n++) {
lib/libz/trees.c
342
for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
lib/libz/trees.c
350
n = 0;
lib/libz/trees.c
351
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
lib/libz/trees.c
352
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
lib/libz/trees.c
353
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
lib/libz/trees.c
354
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
lib/libz/trees.c
362
for (n = 0; n < D_CODES; n++) {
lib/libz/trees.c
363
static_dtree[n].Len = 5;
lib/libz/trees.c
364
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
lib/libz/trees.c
439
int n; /* iterates over tree elements */
lib/libz/trees.c
442
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
lib/libz/trees.c
443
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
lib/libz/trees.c
444
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
lib/libz/trees.c
497
#define smaller(tree, n, m, depth) \
lib/libz/trees.c
498
(tree[n].Freq < tree[m].Freq || \
lib/libz/trees.c
499
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
lib/libz/trees.c
546
int n, m; /* iterate over the tree elements */
lib/libz/trees.c
560
n = s->heap[h];
lib/libz/trees.c
561
bits = tree[tree[n].Dad].Len + 1;
lib/libz/trees.c
563
tree[n].Len = (ush)bits;
lib/libz/trees.c
566
if (n > max_code) continue; /* not a leaf node */
lib/libz/trees.c
570
if (n >= base) xbits = extra[n - base];
lib/libz/trees.c
571
f = tree[n].Freq;
lib/libz/trees.c
573
if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);
lib/libz/trees.c
599
n = s->bl_count[bits];
lib/libz/trees.c
600
while (n != 0) {
lib/libz/trees.c
608
n--;
lib/libz/trees.c
629
int n, m; /* iterate over heap elements */
lib/libz/trees.c
639
for (n = 0; n < elems; n++) {
lib/libz/trees.c
640
if (tree[n].Freq != 0) {
lib/libz/trees.c
641
s->heap[++(s->heap_len)] = max_code = n;
lib/libz/trees.c
642
s->depth[n] = 0;
lib/libz/trees.c
644
tree[n].Len = 0;
lib/libz/trees.c
665
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
lib/libz/trees.c
672
pqremove(s, tree, n); /* n = node of least frequency */
lib/libz/trees.c
675
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
lib/libz/trees.c
679
tree[node].Freq = tree[n].Freq + tree[m].Freq;
lib/libz/trees.c
680
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
lib/libz/trees.c
681
s->depth[n] : s->depth[m]) + 1);
lib/libz/trees.c
682
tree[n].Dad = tree[m].Dad = (ush)node;
lib/libz/trees.c
686
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
lib/libz/trees.c
711
int n; /* iterates over all tree elements */
lib/libz/trees.c
722
for (n = 0; n <= max_code; n++) {
lib/libz/trees.c
723
curlen = nextlen; nextlen = tree[n + 1].Len;
lib/libz/trees.c
752
int n; /* iterates over all tree elements */
lib/libz/trees.c
763
for (n = 0; n <= max_code; n++) {
lib/libz/trees.c
764
curlen = nextlen; nextlen = tree[n + 1].Len;
lib/libz/trees.c
970
int n;
lib/libz/trees.c
973
for (n = 0; n <= 31; n++, block_mask >>= 1)
lib/libz/trees.c
974
if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
lib/libz/trees.c
981
for (n = 32; n < LITERALS; n++)
lib/libz/trees.c
982
if (s->dyn_ltree[n].Freq != 0)
lib/libz/zutil.c
151
void ZLIB_INTERNAL zmemcpy(void FAR *dst, const void FAR *src, z_size_t n) {
lib/libz/zutil.c
154
while (n) {
lib/libz/zutil.c
156
n--;
lib/libz/zutil.c
160
int ZLIB_INTERNAL zmemcmp(const void FAR *s1, const void FAR *s2, z_size_t n) {
lib/libz/zutil.c
162
while (n) {
lib/libz/zutil.c
165
n--;
lib/libz/zutil.c
240
int n;
lib/libz/zutil.c
249
for (n = 0; n < next_ptr; n++) {
lib/libz/zutil.c
250
if (ptr != table[n].new_ptr) continue;
lib/libz/zutil.c
252
farfree(table[n].org_ptr);
lib/libz/zutil.c
253
while (++n < next_ptr) {
lib/libz/zutil.c
254
table[n-1] = table[n];
libexec/comsat/comsat.c
179
int n;
libexec/comsat/comsat.c
205
n = pread(uf, utmp, statbf.st_size, 0);
libexec/comsat/comsat.c
206
if (n == -1)
libexec/comsat/comsat.c
207
n = 0;
libexec/comsat/comsat.c
208
nutmp = n / sizeof(struct utmp);
libexec/ftpd/ftpcmd.y
1095
get_line(char *s, int n)
libexec/ftpd/ftpcmd.y
1102
for (c = 0; tmpline[c] != '\0' && --n > 0; ++c) {
libexec/ftpd/ftpcmd.y
1140
if (--n <= 0) {
libexec/ftpd/ftpcmd.y
1197
int n;
libexec/ftpd/ftpcmd.y
1205
n = get_line(cbuf, sizeof(cbuf)-1);
libexec/ftpd/ftpcmd.y
1206
if (n == -1) {
libexec/ftpd/ftpcmd.y
1209
} else if (n == -2) {
libexec/ftpd/ftpcmd.y
1299
n = strlen(cp);
libexec/ftpd/ftpcmd.y
1300
cpos += n - 1;
libexec/ftpd/ftpcmd.y
1304
if (n > 1 && cbuf[cpos] == '\n') {
libexec/ftpd/ftpd.c
1143
off_t i, n;
libexec/ftpd/ftpd.c
1146
n = restart_point;
libexec/ftpd/ftpd.c
1148
while (i++ < n) {
libexec/ftpd/ftpd.c
1219
off_t i, n;
libexec/ftpd/ftpd.c
1222
n = restart_point;
libexec/ftpd/ftpd.c
1224
while (i++ < n) {
libexec/ftpd/ftpd.c
1893
reply(int n, const char *fmt, ...)
libexec/ftpd/ftpd.c
1909
printf("%d%s %s\r\n", n, (next != NULL) ? "-" : "", p);
libexec/ftpd/ftpd.c
1911
syslog(LOG_DEBUG, "<--- %d%s %s", n,
libexec/ftpd/ftpd.c
1920
reply_r(int n, const char *fmt, ...)
libexec/ftpd/ftpd.c
1936
snprintf(buf, sizeof(buf), "%d%s %s\r\n", n,
libexec/ftpd/ftpd.c
1947
lreply(int n, const char *fmt, ...)
libexec/ftpd/ftpd.c
1952
(void)printf("%d- ", n);
libexec/ftpd/ftpd.c
1959
syslog(LOG_DEBUG, "<--- %d- ", n);
libexec/ftpd/ftpd.c
395
nfds_t n, i;
libexec/ftpd/ftpd.c
418
n = 0;
libexec/ftpd/ftpd.c
420
n++;
libexec/ftpd/ftpd.c
422
fds = calloc(n, sizeof(int));
libexec/ftpd/ftpd.c
423
pfds = calloc(n, sizeof(struct pollfd));
libexec/ftpd/ftpd.c
433
n = 0;
libexec/ftpd/ftpd.c
435
fds[n] = socket(res->ai_family, res->ai_socktype,
libexec/ftpd/ftpd.c
437
if (fds[n] == -1)
libexec/ftpd/ftpd.c
440
if (setsockopt(fds[n], SOL_SOCKET, SO_KEEPALIVE,
libexec/ftpd/ftpd.c
442
close(fds[n]);
libexec/ftpd/ftpd.c
443
fds[n] = -1;
libexec/ftpd/ftpd.c
447
if (setsockopt(fds[n], SOL_SOCKET, SO_REUSEADDR,
libexec/ftpd/ftpd.c
449
close(fds[n]);
libexec/ftpd/ftpd.c
450
fds[n] = -1;
libexec/ftpd/ftpd.c
454
if (bind(fds[n], res->ai_addr, res->ai_addrlen) == -1) {
libexec/ftpd/ftpd.c
455
close(fds[n]);
libexec/ftpd/ftpd.c
456
fds[n] = -1;
libexec/ftpd/ftpd.c
459
if (listen(fds[n], 32) == -1) {
libexec/ftpd/ftpd.c
460
close(fds[n]);
libexec/ftpd/ftpd.c
461
fds[n] = -1;
libexec/ftpd/ftpd.c
465
pfds[n].fd = fds[n];
libexec/ftpd/ftpd.c
466
pfds[n].events = POLLIN;
libexec/ftpd/ftpd.c
467
n++;
libexec/ftpd/ftpd.c
471
if (n == 0) {
libexec/ftpd/ftpd.c
481
if (poll(pfds, n, INFTIM) == -1) {
libexec/ftpd/ftpd.c
487
for (i = 0; i < n; i++)
libexec/ftpd/ftpd.c
505
for (i = 0; i < n; i++)
libexec/ftpd/monitor.c
105
ssize_t n;
libexec/ftpd/monitor.c
110
switch (n = read(sock, ptr + pos, len - pos)) {
libexec/ftpd/monitor.c
120
pos += n;
libexec/ftpd/monitor.c
79
ssize_t n;
libexec/ftpd/monitor.c
84
switch (n = write(sock, ptr + pos, len - pos)) {
libexec/ftpd/monitor.c
94
pos += n;
libexec/ftpd/monitor_fdpass.c
42
ssize_t n;
libexec/ftpd/monitor_fdpass.c
62
if ((n = sendmsg(sock, &msg, 0)) == -1)
libexec/ftpd/monitor_fdpass.c
64
if (n != sizeof(int))
libexec/ftpd/monitor_fdpass.c
66
n);
libexec/ftpd/monitor_fdpass.c
79
ssize_t n;
libexec/ftpd/monitor_fdpass.c
91
if ((n = recvmsg(sock, &msg, 0)) == -1) {
libexec/ftpd/monitor_fdpass.c
95
if (n != sizeof(int))
libexec/ftpd/monitor_fdpass.c
97
"recv_fd: recvmsg: expected received 1 got %zd", n);
libexec/getty/subr.c
170
setflags(int n)
libexec/getty/subr.c
174
switch (n) {
libexec/getty/subr.c
263
if (n == 1) { /* read mode flags */
libexec/getty/subr.c
276
if (n == 0)
libexec/getty/subr.c
57
long n;
libexec/getty/subr.c
68
if (cgetnum(buf, np->field, &n) == -1)
libexec/getty/subr.c
72
np->value = n;
libexec/ld.so/aarch64/SYS.h
46
#define DL_SYSCALL(n) \
libexec/ld.so/aarch64/SYS.h
47
.global __CONCAT(_dl_,n) ;\
libexec/ld.so/aarch64/SYS.h
48
.type __CONCAT(_dl_,n)%function ;\
libexec/ld.so/aarch64/SYS.h
49
__CONCAT(_dl_,n): ;\
libexec/ld.so/aarch64/SYS.h
50
RETGUARD_SETUP(__CONCAT(_dl_,n), x15) ;\
libexec/ld.so/aarch64/SYS.h
51
SYSTRAP(n) ;\
libexec/ld.so/aarch64/SYS.h
53
RETGUARD_CHECK(__CONCAT(_dl_,n), x15) ;\
libexec/ld.so/alpha/rtld_machine.c
44
#define DT_PROC(n) ((n) - DT_LOPROC + DT_NUM)
libexec/ld.so/amd64/SYS.h
40
#define DL_SYSCALL(n) \
libexec/ld.so/amd64/SYS.h
41
.global __CONCAT(_dl_,n) ;\
libexec/ld.so/amd64/SYS.h
42
.type __CONCAT(_dl_,n), @function ;\
libexec/ld.so/amd64/SYS.h
44
__CONCAT(_dl_,n): ;\
libexec/ld.so/amd64/SYS.h
46
RETGUARD_SETUP(_dl_##n, r11) ;\
libexec/ld.so/amd64/SYS.h
48
movl $(__CONCAT(SYS_,n)), %eax ;\
libexec/ld.so/amd64/SYS.h
51
PINSYSCALL(__CONCAT(SYS_,n), 99b) ;\
libexec/ld.so/amd64/SYS.h
55
RETGUARD_CHECK(_dl_##n, r11) ;\
libexec/ld.so/arm/SYS.h
46
#define DL_SYSCALL(n) \
libexec/ld.so/arm/SYS.h
47
.global __CONCAT(_dl_,n) ;\
libexec/ld.so/arm/SYS.h
48
.type __CONCAT(_dl_,n)%function ;\
libexec/ld.so/arm/SYS.h
49
__CONCAT(_dl_,n): ;\
libexec/ld.so/arm/SYS.h
50
SYSTRAP(n) ;\
libexec/ld.so/boot.c
64
int n, argc;
libexec/ld.so/boot.c
86
for (n = 0; n <= AUX_entry; n++)
libexec/ld.so/boot.c
87
dl_data[n] = 0;
libexec/ld.so/chacha_private.h
23
#define ROTL32(v, n) \
libexec/ld.so/chacha_private.h
24
(U32V((v) << (n)) | ((v) >> (32 - (n))))
libexec/ld.so/dl_printf.c
150
int set, n;
libexec/ld.so/dl_printf.c
159
for (set = 0; (n = *p++);) {
libexec/ld.so/dl_printf.c
160
if (ul & (1 << (n - 1))) {
libexec/ld.so/dl_printf.c
162
for (; (n = *p) > ' '; ++p)
libexec/ld.so/dl_printf.c
163
putcharfd(n, fd);
libexec/ld.so/dlfcn.c
262
struct dep_node *n, *m;
libexec/ld.so/dlfcn.c
268
TAILQ_FOREACH(n, &_dlopened_child_list, next_sib) {
libexec/ld.so/dlfcn.c
269
obj = n->data;
libexec/ld.so/hppa/boot_md.c
56
int n, argc;
libexec/ld.so/hppa/boot_md.c
82
for (n = 0; n <= AUX_entry; n++)
libexec/ld.so/hppa/boot_md.c
83
dl_data[n] = 0;
libexec/ld.so/i386/SYS.h
40
#define DL_SYSCALL(n) \
libexec/ld.so/i386/SYS.h
43
.global __CONCAT(_dl_,n) ;\
libexec/ld.so/i386/SYS.h
44
.type __CONCAT(_dl_,n),@function ;\
libexec/ld.so/i386/SYS.h
45
__CONCAT(_dl_,n): ;\
libexec/ld.so/i386/SYS.h
46
movl $__CONCAT(SYS_, n),%eax; ;\
libexec/ld.so/i386/SYS.h
48
PINSYSCALL(__CONCAT(SYS_, n), 99b) ;\
libexec/ld.so/ldconfig/ldconfig.c
190
size_t n;
libexec/ld.so/ldconfig/ldconfig.c
201
n = strlen(name);
libexec/ld.so/ldconfig/ldconfig.c
202
if (n < 4)
libexec/ld.so/ldconfig/ldconfig.c
206
for (cp = name + n - 4; cp > name; --cp) {
libexec/ld.so/ldconfig/ldconfig.c
305
size_t n;
libexec/ld.so/ldconfig/ldconfig.c
317
n = hdr.hh_nbucket * sizeof(struct hints_bucket);
libexec/ld.so/ldconfig/ldconfig.c
319
hdr.hh_strtab = hdr.hh_hashtab + n;
libexec/ld.so/ldconfig/ldconfig.c
330
blist = (struct hints_bucket *)xmalloc(n);
libexec/ld.so/ldconfig/ldconfig.c
331
bzero(blist, n);
libexec/ld.so/ldconfig/shlib.c
126
int i, n;
libexec/ld.so/ldconfig/shlib.c
129
n = sizeof standard_search_dirs / sizeof standard_search_dirs[0];
libexec/ld.so/ldconfig/shlib.c
130
for (i = 0; i < n; i++)
libexec/ld.so/ldconfig/shlib.c
143
int i, n;
libexec/ld.so/ldconfig/shlib.c
145
for (n = 0, i = 0; i < MAXDEWEY; i++) {
libexec/ld.so/ldconfig/shlib.c
157
dewey[n++] = strtol(cp, &cp, 10);
libexec/ld.so/ldconfig/shlib.c
159
return n;
libexec/ld.so/library.c
62
struct dep_node *n;
libexec/ld.so/library.c
89
TAILQ_FOREACH(n, &object->grpref_list, next_sib)
libexec/ld.so/library.c
90
_dl_unload_shlib(n->data);
libexec/ld.so/library_mquery.c
66
struct dep_node *n;
libexec/ld.so/library_mquery.c
93
TAILQ_FOREACH(n, &object->grpref_list, next_sib)
libexec/ld.so/library_mquery.c
94
_dl_unload_shlib(n->data);
libexec/ld.so/library_subr.c
437
struct dep_node *n;
libexec/ld.so/library_subr.c
444
n = _dl_malloc(sizeof *n);
libexec/ld.so/library_subr.c
445
if (n == NULL)
libexec/ld.so/library_subr.c
448
n->data = dep;
libexec/ld.so/library_subr.c
449
TAILQ_INSERT_TAIL(&_dlopened_child_list, n, next_sib);
libexec/ld.so/library_subr.c
470
struct dep_node *n;
libexec/ld.so/library_subr.c
478
while ((n = TAILQ_FIRST(&object->grpref_list)) != NULL) {
libexec/ld.so/library_subr.c
479
TAILQ_REMOVE(&object->grpref_list, n, next_sib);
libexec/ld.so/library_subr.c
480
n->data->grprefcount--;
libexec/ld.so/library_subr.c
481
_dl_notify_unload_shlib(n->data);
libexec/ld.so/library_subr.c
482
_dl_free(n);
libexec/ld.so/library_subr.c
508
struct dep_node *n;
libexec/ld.so/library_subr.c
510
n = _dl_malloc(sizeof *n);
libexec/ld.so/library_subr.c
511
if (n == NULL)
libexec/ld.so/library_subr.c
513
n->data = load_group;
libexec/ld.so/library_subr.c
514
TAILQ_INSERT_TAIL(&load_object->grpref_list, n, next_sib);
libexec/ld.so/loader.c
525
struct dep_node *n;
libexec/ld.so/loader.c
640
n = _dl_malloc(sizeof *n);
libexec/ld.so/loader.c
641
if (n == NULL)
libexec/ld.so/loader.c
643
n->data = exe_obj;
libexec/ld.so/loader.c
644
TAILQ_INSERT_TAIL(&_dlopened_child_list, n, next_sib);
libexec/ld.so/m88k/SYS.h
68
#define DL_SYSCALL(n) \
libexec/ld.so/m88k/SYS.h
69
__ENTRY(_dl_,n) ;\
libexec/ld.so/m88k/SYS.h
70
__DO_SYSCALL(n) ;\
libexec/ld.so/m88k/SYS.h
73
END(_dl_##n)
libexec/ld.so/mips64/archdep.h
57
int i, n; \
libexec/ld.so/mips64/archdep.h
62
n = __dynld->dt_proc[DT_MIPS_LOCAL_GOTNO - DT_LOPROC]; \
libexec/ld.so/mips64/archdep.h
64
for (i = 2; i < n; i++) { \
libexec/ld.so/mips64/archdep.h
67
gotp += n; \
libexec/ld.so/mips64/archdep.h
70
n = __dynld->dt_proc[DT_MIPS_SYMTABNO - DT_LOPROC] - \
libexec/ld.so/mips64/archdep.h
75
while (n--) { \
libexec/ld.so/mips64/boot_md.c
58
int n, argc;
libexec/ld.so/mips64/boot_md.c
84
for (n = 0; n <= AUX_entry; n++)
libexec/ld.so/mips64/boot_md.c
85
dl_data[n] = 0;
libexec/ld.so/mips64/rtld_machine.c
154
int i, n;
libexec/ld.so/mips64/rtld_machine.c
166
n = object->Dyn.info[DT_MIPS_LOCAL_GOTNO - DT_LOPROC + DT_NUM];
libexec/ld.so/mips64/rtld_machine.c
176
for (i = 2; i < n; i++) {
libexec/ld.so/mips64/rtld_machine.c
180
gotp += n;
libexec/ld.so/mips64/rtld_machine.c
184
n = object->Dyn.info[DT_MIPS_SYMTABNO - DT_LOPROC + DT_NUM] -
libexec/ld.so/mips64/rtld_machine.c
191
while (n--) {
libexec/ld.so/mips64/rtld_machine.c
246
int n;
libexec/ld.so/mips64/rtld_machine.c
251
n = object->Dyn.info[DT_MIPS_LOCAL_GOTNO - DT_LOPROC + DT_NUM] -
libexec/ld.so/mips64/rtld_machine.c
264
buf.param.kb_addr = &gotp[n + symidx];
libexec/ld.so/powerpc/SYS.h
39
#define DL_SYSCALL(n) \
libexec/ld.so/powerpc/SYS.h
40
ENTRY(_dl_##n) \
libexec/ld.so/powerpc/SYS.h
41
RETGUARD_SETUP(_dl_##n, %r11, %r12) ;\
libexec/ld.so/powerpc/SYS.h
42
li 0, SYS_##n ;\
libexec/ld.so/powerpc/SYS.h
44
PINSYSCALL(SYS_##n, 99b) ;\
libexec/ld.so/powerpc/SYS.h
46
beq+ .L_end##n ;\
libexec/ld.so/powerpc/SYS.h
48
.L_end##n: ;\
libexec/ld.so/powerpc/SYS.h
49
RETGUARD_CHECK(_dl_##n, %r11, %r12) ;\
libexec/ld.so/powerpc/rtld_machine.c
42
#define DT_PROC(n) ((n) - DT_LOPROC + DT_NUM)
libexec/ld.so/powerpc64/SYS.h
39
#define DL_SYSCALL(n) \
libexec/ld.so/powerpc64/SYS.h
40
ENTRY(_dl_##n) \
libexec/ld.so/powerpc64/SYS.h
41
RETGUARD_SETUP(_dl_##n, %r11) ;\
libexec/ld.so/powerpc64/SYS.h
42
li %r0, SYS_##n ;\
libexec/ld.so/powerpc64/SYS.h
44
PINSYSCALL(SYS_##n, 99b) ;\
libexec/ld.so/powerpc64/SYS.h
46
beq .L_end##n ;\
libexec/ld.so/powerpc64/SYS.h
48
.L_end##n: ;\
libexec/ld.so/powerpc64/SYS.h
49
RETGUARD_CHECK(_dl_##n, %r11) ;\
libexec/ld.so/powerpc64/rtld_machine.c
279
int numplt, n;
libexec/ld.so/powerpc64/rtld_machine.c
289
for (n = 0; n < numplt; n++) {
libexec/ld.so/powerpc64/rtld_machine.c
290
plt[n + 2] = object->Dyn.info[DT_PROC(DT_PPC64_GLINK)] +
libexec/ld.so/powerpc64/rtld_machine.c
291
n * 4 + 32;
libexec/ld.so/powerpc64/rtld_machine.c
41
#define DT_PROC(n) ((n) - DT_LOPROC + DT_NUM)
libexec/ld.so/resolve.c
403
Elf_Word n;
libexec/ld.so/resolve.c
405
for (n = 0; n < nbuckets; n++) {
libexec/ld.so/resolve.c
406
Elf_Word bkt = object->buckets_gnu[n];
libexec/ld.so/resolve.c
473
_dl_tailq_free(struct dep_node *n)
libexec/ld.so/resolve.c
477
while (n != NULL) {
libexec/ld.so/resolve.c
478
next = TAILQ_NEXT(n, next_sib);
libexec/ld.so/resolve.c
479
_dl_free(n);
libexec/ld.so/resolve.c
480
n = next;
libexec/ld.so/resolve.c
490
struct dep_node *n, *next;
libexec/ld.so/resolve.c
492
n = TAILQ_FIRST(&_dlopened_child_list);
libexec/ld.so/resolve.c
493
while (n != NULL) {
libexec/ld.so/resolve.c
494
next = TAILQ_NEXT(n, next_sib);
libexec/ld.so/resolve.c
495
if (OBJECT_DLREF_CNT(n->data) == 0) {
libexec/ld.so/resolve.c
496
TAILQ_REMOVE(&_dlopened_child_list, n, next_sib);
libexec/ld.so/resolve.c
497
_dl_free(n);
libexec/ld.so/resolve.c
499
n = next;
libexec/ld.so/resolve.c
685
struct dep_node *n;
libexec/ld.so/resolve.c
696
TAILQ_FOREACH(n, &_dlopened_child_list, next_sib) {
libexec/ld.so/resolve.c
697
if (((n->data->obj_flags & DF_1_GLOBAL) == 0) &&
libexec/ld.so/resolve.c
698
(n->data != req_obj->load_object))
libexec/ld.so/resolve.c
701
vec = n->data->grpsym_vec;
libexec/ld.so/riscv64/SYS.h
45
#define DL_SYSCALL(n) \
libexec/ld.so/riscv64/SYS.h
46
.global __CONCAT(_dl_,n) ;\
libexec/ld.so/riscv64/SYS.h
47
.type __CONCAT(_dl_,n)%function ;\
libexec/ld.so/riscv64/SYS.h
48
__CONCAT(_dl_,n): ;\
libexec/ld.so/riscv64/SYS.h
49
RETGUARD_SETUP(__CONCAT(_dl_,n), x15) ;\
libexec/ld.so/riscv64/SYS.h
50
SYSTRAP(n) ;\
libexec/ld.so/riscv64/SYS.h
54
RETGUARD_CHECK(__CONCAT(_dl_,n), x15) ;\
libexec/ld.so/sh/SYS.h
66
#define DL_SYSCALL(n) \
libexec/ld.so/sh/SYS.h
67
.global __CONCAT(_dl_,n) ;\
libexec/ld.so/sh/SYS.h
68
.type __CONCAT(_dl_,n)%function ;\
libexec/ld.so/sh/SYS.h
69
__CONCAT(_dl_,n): ;\
libexec/ld.so/sh/SYS.h
70
SYSTRAP(n) ;\
libexec/ld.so/sparc64/SYS.h
80
#define DL_SYSCALL(n) \
libexec/ld.so/sparc64/SYS.h
81
_ENTRY(__CONCAT(_dl_,n)) \
libexec/ld.so/sparc64/SYS.h
82
mov __CONCAT(SYS_,n) | SYSCALL_G2RFLAG, %g1 ;\
libexec/ld.so/sparc64/SYS.h
85
PINSYSCALL(__CONCAT(SYS_,n), 99b) ;\
libexec/ld.so/util.h
117
size_t n = siz;
libexec/ld.so/util.h
120
if (n != 0 && --n != 0) {
libexec/ld.so/util.h
124
} while (--n != 0);
libexec/ld.so/util.h
128
if (n == 0) {
libexec/ld.so/util.h
139
_dl_strncmp(const char *s1, const char *s2, size_t n)
libexec/ld.so/util.h
141
if (n == 0)
libexec/ld.so/util.h
148
} while (--n != 0);
libexec/ld.so/util.h
89
_dl_memset(void *dst, const int c, size_t n)
libexec/ld.so/util.h
91
if (n != 0) {
libexec/ld.so/util.h
96
while (--n != 0);
libexec/login_ldap/login_ldap.c
138
int n;
libexec/login_ldap/login_ldap.c
149
n = read(3, backbuf, sizeof(backbuf));
libexec/login_ldap/login_ldap.c
150
if (n == -1) {
libexec/login_radius/login_radius.c
166
n = 0;
libexec/login_radius/login_radius.c
169
if (challenge[c] == '\0' && ++n == 2)
libexec/login_radius/login_radius.c
171
if (challenge[c] == '\0' && n == 1)
libexec/login_radius/login_radius.c
174
if (n < 2) {
libexec/login_radius/login_radius.c
91
int c, n;
libexec/login_skey/login_skey.c
226
if (skey.n <= 1)
libexec/login_skey/login_skey.c
229
else if (skey.n < 5)
libexec/snmpd/snmpd_metrics/kroute.c
1300
ssize_t n;
libexec/snmpd/snmpd_metrics/kroute.c
1302
if ((n = read(fd, &buf, sizeof(buf))) == -1) {
libexec/snmpd/snmpd_metrics/kroute.c
1307
if (n == 0) {
libexec/snmpd/snmpd_metrics/kroute.c
1312
rtmsg_process(buf, n);
libexec/snmpd/snmpd_metrics/mib.c
2025
u_int32_t idx = 0, n;
libexec/snmpd/snmpd_metrics/mib.c
2044
for (i = 0, n = 1; ; i++) {
libexec/snmpd/snmpd_metrics/mib.c
2071
if (n == idx)
libexec/snmpd/snmpd_metrics/mib.c
2073
n++;
libexec/snmpd/snmpd_metrics/mib.c
2083
agentx_varbind_integer(vb, (int32_t)n);
libexec/snmpd/snmpd_metrics/timer.c
58
int mib[3] = { CTL_KERN, KERN_CPTIME2, 0 }, n;
libexec/snmpd/snmpd_metrics/timer.c
63
for (n = 0; n < snmpd_env->sc_ncpu; n++) {
libexec/snmpd/snmpd_metrics/timer.c
64
mib[2] = n;
libexec/snmpd/snmpd_metrics/timer.c
65
cptime2 = snmpd_env->sc_cpustates + (CPUSTATES * n);
libexec/snmpd/snmpd_metrics/timer.c
66
if (sysctl(mib, 3, cp_time[n], &len, NULL, 0) == -1)
libexec/snmpd/snmpd_metrics/timer.c
68
(void)percentages(CPUSTATES, cptime2, cp_time[n],
libexec/snmpd/snmpd_metrics/timer.c
69
cp_old[n], cp_diff[n]);
libexec/snmpd/snmpd_metrics/timer.c
71
log_debug("timer_cpu: cpu%d %lld%% idle in %llds", n,
libexec/spamd-setup/spamd-setup.c
398
ssize_t n;
libexec/spamd-setup/spamd-setup.c
426
n = read(fd, buf + bu, bs - bu);
libexec/spamd-setup/spamd-setup.c
427
if (n == 0) {
libexec/spamd-setup/spamd-setup.c
429
} else if (n == -1) {
libexec/spamd-setup/spamd-setup.c
432
bu += n;
libexec/spamd-setup/spamd-setup.c
470
int i, n, start, bu = 0, bs = 0, serrno = 0;
libexec/spamd-setup/spamd-setup.c
489
n = gzread(gzf, buf + bu, bs - bu);
libexec/spamd-setup/spamd-setup.c
490
if (n == 0)
libexec/spamd-setup/spamd-setup.c
492
else if (n == -1) {
libexec/spamd-setup/spamd-setup.c
496
bu += n;
libexec/spamd/sdl.c
162
struct in_addr *m, *n;
libexec/spamd/sdl.c
165
n = &blacklists[idx].v4.addrs[i].sda;
libexec/spamd/sdl.c
178
j = inet_pton(AF_INET, astring, n);
libexec/spamd/sdl.c
189
n->s_addr = n->s_addr & m->s_addr;
libexec/spamd/sdl.c
204
struct sdaddr_v6 *m, *n;
libexec/spamd/sdl.c
206
n = &blacklists[idx].v6.addrs[i].sda;
libexec/spamd/sdl.c
219
j = inet_pton(AF_INET6, astring, n);
libexec/spamd/sdl.c
240
n->addr32[j] = n->addr32[j] & m->addr32[j];
libexec/spamd/spamd.c
1083
ssize_t n;
libexec/spamd/spamd.c
1088
n = tls_read(cp->cctx, cp->ip, cp->il);
libexec/spamd/spamd.c
1089
if (n == TLS_WANT_POLLIN)
libexec/spamd/spamd.c
1091
if (n == TLS_WANT_POLLOUT)
libexec/spamd/spamd.c
1096
n = read(cp->pfd->fd, cp->ip, cp->il);
libexec/spamd/spamd.c
1098
if (n == 0)
libexec/spamd/spamd.c
1100
else if (n == -1) {
libexec/spamd/spamd.c
1107
cp->ip[n] = '\0';
libexec/spamd/spamd.c
1111
cp->ip += n;
libexec/spamd/spamd.c
1112
cp->il -= n;
libexec/spamd/spamd.c
1128
ssize_t n;
libexec/spamd/spamd.c
1140
n = tls_write(cp->cctx, "\r", 1);
libexec/spamd/spamd.c
1141
if (n == TLS_WANT_POLLIN)
libexec/spamd/spamd.c
1144
if (n == TLS_WANT_POLLOUT)
libexec/spamd/spamd.c
1150
n = write(cp->pfd->fd, "\r", 1);
libexec/spamd/spamd.c
1152
if (n == 0) {
libexec/spamd/spamd.c
1155
} else if (n == -1) {
libexec/spamd/spamd.c
1170
n = tls_write(cp->cctx, cp->op, cp->ol);
libexec/spamd/spamd.c
1171
if (n == TLS_WANT_POLLIN)
libexec/spamd/spamd.c
1173
if (n == TLS_WANT_POLLOUT)
libexec/spamd/spamd.c
1178
n = write(cp->pfd->fd, cp->op,
libexec/spamd/spamd.c
1181
if (n == 0)
libexec/spamd/spamd.c
1183
else if (n == -1) {
libexec/spamd/spamd.c
1190
cp->op += n;
libexec/spamd/spamd.c
1191
cp->ol -= n;
libexec/spamd/spamd.c
1578
int numcon = 0, n, timeout, writers;
libexec/spamd/spamd.c
1632
n = poll(pfd, PFD_FIRSTCON + numcon, timeout);
libexec/spamd/spamd.c
1633
if (n == -1) {
libexec/spamd/spamd.c
377
int n;
libexec/spamd/spamd.c
396
n = read(conffd, cb + cbu, cbs - cbu);
libexec/spamd/spamd.c
398
printf("read %d config bytes\n", n);
libexec/spamd/spamd.c
399
if (n == 0) {
libexec/spamd/spamd.c
403
} else if (n == -1) {
libexec/spamd/spamd.c
408
cbu += n;
libexec/tradcpp/main.c
222
unsigned n = 1;
libexec/tradcpp/main.c
224
apply_magic_macro(n++, "__FILE__");
libexec/tradcpp/main.c
225
apply_magic_macro(n++, "__LINE__");
libexec/tradcpp/main.c
228
apply_builtin_macro(n++, CONFIG_OS, "1");
libexec/tradcpp/main.c
231
apply_builtin_macro(n++, CONFIG_OS_2, "1");
libexec/tradcpp/main.c
235
apply_builtin_macro(n++, CONFIG_CPU, "1");
libexec/tradcpp/main.c
238
apply_builtin_macro(n++, CONFIG_CPU_2, "1");
libexec/tradcpp/main.c
242
apply_builtin_macro(n++, CONFIG_SIZE, "1");
libexec/tradcpp/main.c
245
apply_builtin_macro(n++, CONFIG_BINFMT, "1");
libexec/tradcpp/main.c
249
apply_builtin_macro(n++, CONFIG_COMPILER, VERSION_MAJOR);
libexec/tradcpp/main.c
250
apply_builtin_macro(n++, CONFIG_COMPILER_MINOR, VERSION_MINOR);
libexec/tradcpp/main.c
251
apply_builtin_macro(n++, "__VERSION__", VERSION_LONG);
regress/bin/ksh/edit/edit.c
127
n = read(ptyfd, out + nread, sizeof(out) - 1 - nread);
regress/bin/ksh/edit/edit.c
128
if (n == -1)
regress/bin/ksh/edit/edit.c
130
nread += n;
regress/bin/ksh/edit/edit.c
134
(n = findprompt(out + nprompt, prompt)) > 0) {
regress/bin/ksh/edit/edit.c
135
nprompt += n;
regress/bin/ksh/edit/edit.c
142
n = write(ptyfd, in + nwrite, 1);
regress/bin/ksh/edit/edit.c
143
if (n == -1)
regress/bin/ksh/edit/edit.c
145
nwrite += n;
regress/bin/ksh/edit/edit.c
49
ssize_t n;
regress/bin/ksh/edit/edit.c
72
n = read(0, in + nin, sizeof(in) - nin);
regress/bin/ksh/edit/edit.c
73
if (n == -1)
regress/bin/ksh/edit/edit.c
75
if (n == 0)
regress/bin/ksh/edit/edit.c
78
nin += n;
regress/include/bitstring/bitstring_test.c
31
clearbits(bitstr_t *b, int n)
regress/include/bitstring/bitstring_test.c
33
register int i = bitstr_size(n);
regress/include/bitstring/bitstring_test.c
40
printbits(bitstr_t *b, int n)
regress/include/bitstring/bitstring_test.c
45
bit_ffc(b, n, &jc);
regress/include/bitstring/bitstring_test.c
46
bit_ffs(b, n, &js);
regress/include/bitstring/bitstring_test.c
48
for (i = 0; i < n; i++) {
regress/lib/csu/init_priority/init_priority_test.cc
23
#define TEST(n) Test test_##n __attribute__((init_priority (n))) (n)
regress/lib/libc/asr/bin/common.c
39
gethostarg(char *n)
regress/lib/libc/asr/bin/common.c
41
if (n == NULL)
regress/lib/libc/asr/bin/common.c
42
return (n);
regress/lib/libc/asr/bin/common.c
429
size_t n, count, end, ptr, start;
regress/lib/libc/asr/bin/common.c
43
if (!strcmp(n, "NULL"))
regress/lib/libc/asr/bin/common.c
438
for(; (n = data[offset]); ) {
regress/lib/libc/asr/bin/common.c
439
if ((n & 0xc0) == 0xc0) {
regress/lib/libc/asr/bin/common.c
442
ptr = 256 * (n & ~0xc0) + data[offset + 1];
regress/lib/libc/asr/bin/common.c
45
if (!strcmp(n, "EMPTY"))
regress/lib/libc/asr/bin/common.c
450
if (offset + n + 1 > len)
regress/lib/libc/asr/bin/common.c
456
count = (max < n + 1) ? (max) : (n + 1);
regress/lib/libc/asr/bin/common.c
461
res += n + 1;
regress/lib/libc/asr/bin/common.c
462
offset += n + 1;
regress/lib/libc/asr/bin/common.c
47
return (n);
regress/lib/libc/asr/bin/getnetnamadr.c
44
struct netent *n;
regress/lib/libc/asr/bin/getnetnamadr.c
79
n = getnetbyname(host);
regress/lib/libc/asr/bin/getnetnamadr.c
81
n = getnetbyaddr(inet_network(host), AF_INET);
regress/lib/libc/asr/bin/getnetnamadr.c
82
if (n)
regress/lib/libc/asr/bin/getnetnamadr.c
83
print_netent(n);
regress/lib/libc/asr/bin/res_mkquery.c
135
int i, an, ns, ar, n;
regress/lib/libc/asr/bin/res_mkquery.c
157
n = ar + h.arcount;
regress/lib/libc/asr/bin/res_mkquery.c
159
for (i = 0; i < n; i++) {
regress/lib/libc/asr/bin/res_query.c
171
int i, an, ns, ar, n;
regress/lib/libc/asr/bin/res_query.c
193
n = ar + h.arcount;
regress/lib/libc/asr/bin/res_query.c
195
for (i = 0; i < n; i++) {
regress/lib/libc/asr/bin/threads.c
123
for (n = 0; n < LOOP; n ++) {
regress/lib/libc/asr/bin/threads.c
134
task(&n);
regress/lib/libc/asr/bin/threads.c
55
struct addrinfo *ai, *n;
regress/lib/libc/asr/bin/threads.c
59
n = NULL; c =0;
regress/lib/libc/asr/bin/threads.c
91
int n, LOOP;
regress/lib/libc/cephes/etanh.c
33
short i, n;
regress/lib/libc/cephes/etanh.c
54
n = NBITS/8; /* Number of terms to do in the continued fraction */
regress/lib/libc/cephes/etanh.c
55
lj = 2 * n + 1;
regress/lib/libc/cephes/etanh.c
62
for( i=0; i<n; i++)
regress/lib/libc/cephes/ieee.c
3992
int i, n;
regress/lib/libc/cephes/ieee.c
3999
n = 8;
regress/lib/libc/cephes/ieee.c
4004
n = 6;
regress/lib/libc/cephes/ieee.c
4009
n = 4;
regress/lib/libc/cephes/ieee.c
4014
n = 2;
regress/lib/libc/cephes/ieee.c
4038
for (i=0; i < n; i++)
regress/lib/libc/cephes/ieee.c
4053
int i, j, k, n, nlups;
regress/lib/libc/cephes/ieee.c
4107
n = 8; /* get 8 bits of result per inner loop */
regress/lib/libc/cephes/ieee.c
4118
n = nlups + 1;
regress/lib/libc/cephes/ieee.c
4119
for( i=0; i<n; i++ )
regress/lib/libc/cephes/ieee.c
4138
nlups -= n;
regress/lib/libc/cephes/ieetst.c
123
n = 13; /* max power of ten for correct rounding */
regress/lib/libc/cephes/ieetst.c
137
n = 27;
regress/lib/libc/cephes/ieetst.c
149
n = 27;
regress/lib/libc/cephes/ieetst.c
163
n = 34;
regress/lib/libc/cephes/ieetst.c
205
printf( "2. Checking powers of 10 from 10^-%d to 10^%d.\n", n, n );
regress/lib/libc/cephes/ieetst.c
207
for( count=0; count<=n; count++ )
regress/lib/libc/cephes/ieetst.c
224
printf( "3. Checking (10^%d-1)*10^n from n = -%d to %d.\n", m, n, n );
regress/lib/libc/cephes/ieetst.c
226
for( count= -n; count<=n; count++ )
regress/lib/libc/cephes/ieetst.c
305
printf(" 1 <= M <= 10^%d - 1 and -%d <= N <= +%d.\n", m, n, n );
regress/lib/libc/cephes/ieetst.c
512
void pvec( x, n )
regress/lib/libc/cephes/ieetst.c
514
int n;
regress/lib/libc/cephes/ieetst.c
518
for( i=0; i<n; i++ )
regress/lib/libc/cephes/ieetst.c
70
int m, n, k2, mprec, SPREC;
regress/lib/libc/env/envtest.c
102
n = count_instances("USER");
regress/lib/libc/env/envtest.c
103
if (n != 1) {
regress/lib/libc/env/envtest.c
105
n, 1);
regress/lib/libc/env/envtest.c
114
n = count_instances("USER");
regress/lib/libc/env/envtest.c
115
if (n != 1) {
regress/lib/libc/env/envtest.c
117
n, 1);
regress/lib/libc/env/envtest.c
63
int n, failures = 0;
regress/lib/libc/env/envtest.c
67
n = count_instances("USER");
regress/lib/libc/env/envtest.c
68
if (n != 2) {
regress/lib/libc/env/envtest.c
70
n, 2);
regress/lib/libc/env/envtest.c
78
n = count_instances("USER");
regress/lib/libc/env/envtest.c
79
if (n != 0) {
regress/lib/libc/env/envtest.c
81
n, 0);
regress/lib/libc/env/envtest.c
90
n = count_instances("USER");
regress/lib/libc/env/envtest.c
91
if (n != 2) {
regress/lib/libc/env/envtest.c
93
n, 2);
regress/lib/libc/locale/check_isw/check_isw.c
103
while ((n = mbrtowc(&c, s+j, 256-j, &state)) == 1) {
regress/lib/libc/locale/check_isw/check_isw.c
133
if (n != 0 || j != 255) {
regress/lib/libc/locale/check_isw/check_isw.c
81
size_t n;
regress/lib/libc/netdb/netdb.c
15
checkp(int n, struct protoent *p, int proto, const char *name, ...)
regress/lib/libc/netdb/netdb.c
22
warnx("%d proto struct is NULL", n);
regress/lib/libc/netdb/netdb.c
27
warnx("%d proto num mismatch %d %d", n, p->p_proto, proto);
regress/lib/libc/netdb/netdb.c
31
warnx("%d proto name mismatch %s %s", n, p->p_name, name);
regress/lib/libc/netdb/netdb.c
39
warnx("%d proto alias mismatch %s %s", n,
regress/lib/libc/netdb/netdb.c
47
warnx("%d proto alias list does not end with NULL", n);
regress/lib/libc/netdb/netdb.c
55
checks(int n, struct servent *s, int port, const char *proto,
regress/lib/libc/netdb/netdb.c
63
warnx("%d serv struct is NULL", n);
regress/lib/libc/netdb/netdb.c
68
warnx("%d port num mismatch %d %d", n, s->s_port, port);
regress/lib/libc/netdb/netdb.c
72
warnx("%d serv name mismatch %s %s", n, s->s_name, name);
regress/lib/libc/netdb/netdb.c
76
warnx("%d serv proto mismatch %s %s", n, s->s_proto, proto);
regress/lib/libc/netdb/netdb.c
84
warnx("%d serv alias mismatch %s %s", n,
regress/lib/libc/netdb/netdb.c
92
warnx("%d serv alias list does not end with NULL", n);
regress/lib/libc/qsort/antiqsort.c
45
antiqsort(int n, int *a, int *ptr)
regress/lib/libc/qsort/antiqsort.c
50
gas = n - 1;
regress/lib/libc/qsort/antiqsort.c
52
for (i = 0; i < n; i++) {
regress/lib/libc/qsort/antiqsort.c
56
qsort(ptr, n, sizeof(*ptr), cmp);
regress/lib/libc/qsort/qsort_test.c
126
int m, int n)
regress/lib/libc/qsort/qsort_test.c
134
"max %zu(%zu)", d->name, sub, m, n,
regress/lib/libc/qsort/qsort_test.c
138
"max %zu(%zu)", d->name, sub, n,
regress/lib/libc/qsort/qsort_test.c
144
"max %zu(%zu)", d->name, m, n,
regress/lib/libc/qsort/qsort_test.c
148
"max %zu(%zu)", d->name, n,
regress/lib/libc/qsort/qsort_test.c
154
for (i = 0; i < n; i++) {
regress/lib/libc/qsort/qsort_test.c
160
if (i == n)
regress/lib/libc/qsort/qsort_test.c
165
d->name, sub, i, m, n);
regress/lib/libc/qsort/qsort_test.c
168
d->name, i, m, n);
regress/lib/libc/qsort/qsort_test.c
173
#define FILL_SAWTOOTH(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
176
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
181
fill_sawtooth_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
184
FILL_SAWTOOTH(x, n, m);
regress/lib/libc/qsort/qsort_test.c
188
fill_sawtooth_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
191
FILL_SAWTOOTH(x, n, m);
regress/lib/libc/qsort/qsort_test.c
195
fill_sawtooth_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
198
FILL_SAWTOOTH(x, n, m);
regress/lib/libc/qsort/qsort_test.c
201
#define FILL_RANDOM(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
204
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
210
fill_random_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
213
FILL_RANDOM(x, n, m);
regress/lib/libc/qsort/qsort_test.c
217
fill_random_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
220
FILL_RANDOM(x, n, m);
regress/lib/libc/qsort/qsort_test.c
224
fill_random_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
227
FILL_RANDOM(x, n, m);
regress/lib/libc/qsort/qsort_test.c
230
#define FILL_STAGGER(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
233
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
234
x[i] = (i * m + i) % n; \
regress/lib/libc/qsort/qsort_test.c
239
fill_stagger_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
242
FILL_STAGGER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
246
fill_stagger_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
249
FILL_STAGGER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
253
fill_stagger_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
256
FILL_STAGGER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
259
#define FILL_PLATEAU(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
262
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
267
fill_plateau_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
270
FILL_PLATEAU(x, n, m);
regress/lib/libc/qsort/qsort_test.c
274
fill_plateau_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
277
FILL_PLATEAU(x, n, m);
regress/lib/libc/qsort/qsort_test.c
281
fill_plateau_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
284
FILL_PLATEAU(x, n, m);
regress/lib/libc/qsort/qsort_test.c
287
#define FILL_SHUFFLE(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
290
for (i = 0, j = 0, k = 1; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
295
fill_shuffle_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
298
FILL_SHUFFLE(x, n, m);
regress/lib/libc/qsort/qsort_test.c
302
fill_shuffle_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
305
FILL_SHUFFLE(x, n, m);
regress/lib/libc/qsort/qsort_test.c
309
fill_shuffle_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
312
FILL_SHUFFLE(x, n, m);
regress/lib/libc/qsort/qsort_test.c
315
#define FILL_BSD_KILLER(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
319
k = n / 2; \
regress/lib/libc/qsort/qsort_test.c
320
for (i = 0; i < n; i++) { \
regress/lib/libc/qsort/qsort_test.c
324
x[i] = n + k + 1 - i; \
regress/lib/libc/qsort/qsort_test.c
331
fill_bsd_killer_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
334
FILL_BSD_KILLER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
339
fill_bsd_killer_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
342
FILL_BSD_KILLER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
347
fill_bsd_killer_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
350
FILL_BSD_KILLER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
354
#define FILL_MED3_KILLER(x, n, m) do { \
regress/lib/libc/qsort/qsort_test.c
361
if (n & 1) { \
regress/lib/libc/qsort/qsort_test.c
363
x[n - 1] = n; \
regress/lib/libc/qsort/qsort_test.c
364
n--; \
regress/lib/libc/qsort/qsort_test.c
366
k = n / 2; \
regress/lib/libc/qsort/qsort_test.c
367
for (i = 0; i < n; i++) { \
regress/lib/libc/qsort/qsort_test.c
377
fill_med3_killer_i(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
380
FILL_MED3_KILLER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
384
fill_med3_killer_ll(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
387
FILL_MED3_KILLER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
391
fill_med3_killer_double(void *v, int n, int m)
regress/lib/libc/qsort/qsort_test.c
394
FILL_MED3_KILLER(x, n, m);
regress/lib/libc/qsort/qsort_test.c
398
print_timing(struct test_distribution *d, char *sub, int m, int n, double elapsed)
regress/lib/libc/qsort/qsort_test.c
403
d->name, sub, m, n, elapsed);
regress/lib/libc/qsort/qsort_test.c
406
d->name, sub, n, elapsed);
regress/lib/libc/qsort/qsort_test.c
411
d->name, m, n, elapsed);
regress/lib/libc/qsort/qsort_test.c
414
d->name, n, elapsed);
regress/lib/libc/qsort/qsort_test.c
420
do_test(struct test_distribution *d, char *sub, int m, int n, size_t es, void *y, void *z)
regress/lib/libc/qsort/qsort_test.c
429
d->name, sub, compares, m, n);
regress/lib/libc/qsort/qsort_test.c
432
d->name, compares, m, n);
regress/lib/libc/qsort/qsort_test.c
438
qsort(y, n, es, d->cmp_checked);
regress/lib/libc/qsort/qsort_test.c
44
void (*fill)(void *x, int n, int m);
regress/lib/libc/qsort/qsort_test.c
444
print_timing(d, sub, m, n, elapsed);
regress/lib/libc/qsort/qsort_test.c
446
if (check_result(sub, es, y, z, d, m, n) != 0)
regress/lib/libc/qsort/qsort_test.c
45
int (*test)(struct test_distribution *d, int n, void *x, void *y, void *z);
regress/lib/libc/qsort/qsort_test.c
452
#define TEST_PERTURBED(d, n, x, y, z) do { \
regress/lib/libc/qsort/qsort_test.c
456
for (m = 1; m < 2 * n; m *= 2) { \
regress/lib/libc/qsort/qsort_test.c
458
d->fill(x, n, m); \
regress/lib/libc/qsort/qsort_test.c
461
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
463
if (mergesort(z, n, es, d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
465
if (do_test(d, "copy", m, n, es, y, z) != 0) \
regress/lib/libc/qsort/qsort_test.c
469
for (i = 0, j = n - 1; i < n; i++, j--) \
regress/lib/libc/qsort/qsort_test.c
471
if (mergesort(z, n, es, d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
473
if (do_test(d, "reversed", m, n, es, y, z) != 0) \
regress/lib/libc/qsort/qsort_test.c
477
for (i = 0, j = (n / 2) - 1; i < n / 2; i++, j--) \
regress/lib/libc/qsort/qsort_test.c
479
for (; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
481
if (mergesort(z, n, es, d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
483
if (do_test(d, "front reversed", m, n, es, y, z) != 0) \
regress/lib/libc/qsort/qsort_test.c
487
for (i = 0; i < n / 2; i++) \
regress/lib/libc/qsort/qsort_test.c
489
for (j = n - 1; i < n; i++, j--) \
regress/lib/libc/qsort/qsort_test.c
491
if (mergesort(z, n, es, d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
493
if (do_test(d, "back reversed", m, n, es, y, z) != 0) \
regress/lib/libc/qsort/qsort_test.c
497
if (mergesort(x, n, es, d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
499
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
501
if (do_test(d, "sorted", m, n, es, y, x) != 0) \
regress/lib/libc/qsort/qsort_test.c
505
for (i = 0, j = n - 1; i < n; i++, j--) \
regress/lib/libc/qsort/qsort_test.c
507
if (mergesort(z, n, es, d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
509
if (do_test(d, "dithered", m, n, es, y, z) != 0) \
regress/lib/libc/qsort/qsort_test.c
515
test_perturbed_i(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
522
TEST_PERTURBED(d, n, x, y, z);
regress/lib/libc/qsort/qsort_test.c
527
test_perturbed_ll(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
534
TEST_PERTURBED(d, n, x, y, z);
regress/lib/libc/qsort/qsort_test.c
539
test_perturbed_double(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
546
TEST_PERTURBED(d, n, x, y, z);
regress/lib/libc/qsort/qsort_test.c
554
#define TEST_SIMPLE(d, n, x, y, z) do { \
regress/lib/libc/qsort/qsort_test.c
558
d->fill(x, n, 0); \
regress/lib/libc/qsort/qsort_test.c
561
for (i = 0; i < n; i++) \
regress/lib/libc/qsort/qsort_test.c
563
if (mergesort(z, n, sizeof(z[0]), d->cmp) != 0) \
regress/lib/libc/qsort/qsort_test.c
565
if (do_test(d, NULL, 0, n, sizeof(x[0]), y, z) != 0) \
regress/lib/libc/qsort/qsort_test.c
570
test_simple_i(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
577
TEST_SIMPLE(d, n, x, y, z);
regress/lib/libc/qsort/qsort_test.c
582
test_simple_ll(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
589
TEST_SIMPLE(d, n, x, y, z);
regress/lib/libc/qsort/qsort_test.c
59
extern int antiqsort(int n, int *a, int *ptr);
regress/lib/libc/qsort/qsort_test.c
594
test_simple_double(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
601
TEST_SIMPLE(d, n, x, y, z);
regress/lib/libc/qsort/qsort_test.c
610
test_antiqsort(struct test_distribution *d, int n, void *vx, void *vy, void *vz)
regress/lib/libc/qsort/qsort_test.c
623
i = antiqsort(n, x, y);
regress/lib/libc/qsort/qsort_test.c
629
printf("/* %d items, %d compares */\n", n, i);
regress/lib/libc/qsort/qsort_test.c
630
printf("static const int table_%d[] = {", n);
regress/lib/libc/qsort/qsort_test.c
631
for (i = 0; i < n - 1; i++) {
regress/lib/libc/qsort/qsort_test.c
642
print_timing(d, NULL, 0, n, elapsed);
regress/lib/libc/qsort/qsort_test.c
646
d->name, n, i, max_compares, abrt_compares);
regress/lib/libc/qsort/qsort_test.c
680
run_tests(int n, const char *name)
regress/lib/libc/qsort/qsort_test.c
693
for (i = n - 1; i > 0; i >>= 1)
regress/lib/libc/qsort/qsort_test.c
695
nlgn *= n;
regress/lib/libc/qsort/qsort_test.c
701
x = reallocarray(NULL, n, es);
regress/lib/libc/qsort/qsort_test.c
702
y = reallocarray(NULL, n, es);
regress/lib/libc/qsort/qsort_test.c
703
z = reallocarray(NULL, n, es);
regress/lib/libc/qsort/qsort_test.c
710
if (d->test(d, n, x, y, z) != 0)
regress/lib/libc/qsort/qsort_test.c
732
int ch, n, ret = 0;
regress/lib/libc/qsort/qsort_test.c
769
n = atoi(*argv);
regress/lib/libc/qsort/qsort_test.c
770
if (run_tests(n, name) != 0)
regress/lib/libc/regex/split.c
157
register int n;
regress/lib/libc/regex/split.c
162
for (n = atoi(argv[3]); n > 0; n--) {
regress/lib/libc/regex/split.c
166
for (n = atoi(argv[3]); n > 0; n--) {
regress/lib/libc/regex/split.c
281
register int n;
regress/lib/libc/regex/split.c
288
for (n = 0; tests[n].str != NULL; n++) {
regress/lib/libc/regex/split.c
289
(void) strlcpy(buf, tests[n].str, sizeof buf);
regress/lib/libc/regex/split.c
291
nf = split(buf, fields, RNF, tests[n].seps);
regress/lib/libc/regex/split.c
293
if (nf != tests[n].nf) {
regress/lib/libc/regex/split.c
295
tests[n].str, tests[n].seps, nf, tests[n].nf);
regress/lib/libc/regex/split.c
305
if (strcmp(f, tests[n].fi[i]) != 0) {
regress/lib/libc/regex/split.c
307
tests[n].str, tests[n].seps,
regress/lib/libc/regex/split.c
308
i, fields[i], tests[n].fi[i]);
regress/lib/libc/strtol/strtoltest.c
59
long n;
regress/lib/libc/strtol/strtoltest.c
64
n = strtol(test->input, &end, test->base);
regress/lib/libc/strtol/strtoltest.c
65
if (n != test->output) {
regress/lib/libc/strtol/strtoltest.c
67
i, test->input, test->base, n);
regress/lib/libc/sys/macros.h
56
#define reallocarr(pp, n, s) ((*pp = reallocarray(*pp, n, s)), *pp == NULL)
regress/lib/libc/sys/macros.h
76
#define __BIT(n) (1 << (n))
regress/lib/libc/sys/t_clock_gettime.c
164
int quality, n;
regress/lib/libc/sys/t_clock_gettime.c
179
for (p = ctrbuf, n = 0; sscanf(p, "%127[^(](q=%d, f=%*u Hz)%*[ ]%n",
regress/lib/libc/sys/t_clock_gettime.c
180
name, &quality, &n) == 2; p += n) {
regress/lib/libc/sys/t_dup.c
294
size_t i, n;
regress/lib/libc/sys/t_dup.c
315
n = 10;
regress/lib/libc/sys/t_dup.c
316
res.rlim_cur = res.rlim_max = n;
regress/lib/libc/sys/t_dup.c
320
buf = calloc(n, sizeof(int));
regress/lib/libc/sys/t_dup.c
335
for (i = 1; i < n - (STDERR_FILENO + 1); i++) {
regress/lib/libc/sys/t_dup.c
337
for (i = 1; i < n; i++) {
regress/lib/libc/sys/t_getgroups.c
106
int i, n, rv, sta;
regress/lib/libc/sys/t_getgroups.c
113
n = getgroups(NGROUPS_MAX, gidset);
regress/lib/libc/sys/t_getgroups.c
114
ATF_REQUIRE(n >= 0);
regress/lib/libc/sys/t_getgroups.c
116
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_getgroups.c
79
int i, n;
regress/lib/libc/sys/t_getgroups.c
85
n = getgroups(NGROUPS_MAX, gidset);
regress/lib/libc/sys/t_getgroups.c
87
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_getrusage.c
110
const long n = 5;
regress/lib/libc/sys/t_getrusage.c
118
for (i = 0; i < n; i++)
regress/lib/libc/sys/t_getrusage.c
124
if (n != ru.ru_nsignals)
regress/lib/libc/sys/t_getrusage.c
64
size_t n = UINT16_MAX * 10;
regress/lib/libc/sys/t_getrusage.c
66
while (n > 0) {
regress/lib/libc/sys/t_getrusage.c
76
n--;
regress/lib/libc/sys/t_minherit.c
117
segv(int n) {
regress/lib/libc/sys/t_minherit.c
118
_exit(n);
regress/lib/libc/sys/t_msgrcv.c
249
const ssize_t n = 10;
regress/lib/libc/sys/t_msgrcv.c
257
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_recvmmsg.c
101
for (off = 0, n = 0; n < mmsgcnt; n++) {
regress/lib/libc/sys/t_recvmmsg.c
102
iov[n].iov_base = buf + off;
regress/lib/libc/sys/t_recvmmsg.c
103
iov[n].iov_len = sizeof(DGRAM);
regress/lib/libc/sys/t_recvmmsg.c
104
off += iov[n].iov_len;
regress/lib/libc/sys/t_recvmmsg.c
105
mmsghdr[n].msg_hdr.msg_iov = &iov[n];
regress/lib/libc/sys/t_recvmmsg.c
106
mmsghdr[n].msg_hdr.msg_iovlen = 1;
regress/lib/libc/sys/t_recvmmsg.c
107
mmsghdr[n].msg_hdr.msg_name = NULL;
regress/lib/libc/sys/t_recvmmsg.c
108
mmsghdr[n].msg_hdr.msg_namelen = 0;
regress/lib/libc/sys/t_recvmmsg.c
125
n = NPKTS;
regress/lib/libc/sys/t_recvmmsg.c
127
printf("waiting for %u messages (max %u per syscall)\n", n,
regress/lib/libc/sys/t_recvmmsg.c
129
while (n > 0) {
regress/lib/libc/sys/t_recvmmsg.c
131
cnt = recvmmsg(fd[1], mmsghdr, min(mmsgcnt, n),
regress/lib/libc/sys/t_recvmmsg.c
150
NPKTS - n + i, "packet contents");
regress/lib/libc/sys/t_recvmmsg.c
152
n -= cnt;
regress/lib/libc/sys/t_recvmmsg.c
161
for (n = 0; n < NPKTS; n++) {
regress/lib/libc/sys/t_recvmmsg.c
163
printf("sending packet %u/%u...\n", (n+1),
regress/lib/libc/sys/t_recvmmsg.c
168
DGRAM[0] = n;
regress/lib/libc/sys/t_recvmmsg.c
82
unsigned int mmsgcnt, n;
regress/lib/libc/sys/t_revoke.c
59
size_t i, n;
regress/lib/libc/sys/t_revoke.c
65
if ((n = res.rlim_cur / 10) == 0)
regress/lib/libc/sys/t_revoke.c
66
n = 10;
regress/lib/libc/sys/t_revoke.c
68
buf = calloc(n, sizeof(int));
regress/lib/libc/sys/t_revoke.c
74
for (i = 1; i < n; i++) {
regress/lib/libc/sys/t_revoke.c
81
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_select.c
64
xtoa(uint8_t n)
regress/lib/libc/sys/t_select.c
67
assert(n < sizeof(xarray));
regress/lib/libc/sys/t_select.c
68
return xarray[n];
regress/lib/libc/sys/t_sendmmsg.c
109
for (off = 0, n = 0; n < mmsgcnt; n++) {
regress/lib/libc/sys/t_sendmmsg.c
110
iov[n].iov_base = buf + off;
regress/lib/libc/sys/t_sendmmsg.c
111
memcpy(iov[n].iov_base, DGRAM, sizeof(DGRAM));
regress/lib/libc/sys/t_sendmmsg.c
112
*(buf + off) = n;
regress/lib/libc/sys/t_sendmmsg.c
113
iov[n].iov_len = sizeof(DGRAM);
regress/lib/libc/sys/t_sendmmsg.c
114
off += iov[n].iov_len;
regress/lib/libc/sys/t_sendmmsg.c
115
mmsghdr[n].msg_hdr.msg_iov = &iov[n];
regress/lib/libc/sys/t_sendmmsg.c
116
mmsghdr[n].msg_hdr.msg_iovlen = 1;
regress/lib/libc/sys/t_sendmmsg.c
117
mmsghdr[n].msg_hdr.msg_name = NULL;
regress/lib/libc/sys/t_sendmmsg.c
118
mmsghdr[n].msg_hdr.msg_namelen = 0;
regress/lib/libc/sys/t_sendmmsg.c
136
printf("sending %u messages (max %u per syscall)\n", n,
regress/lib/libc/sys/t_sendmmsg.c
138
for (n = 0; n < mmsgcnt;) {
regress/lib/libc/sys/t_sendmmsg.c
140
printf("sending packet %u/%u...\n", n,
regress/lib/libc/sys/t_sendmmsg.c
143
int npkt = min(1024, mmsgcnt - n);
regress/lib/libc/sys/t_sendmmsg.c
147
int npkt = min(3, mmsgcnt - n), a;
regress/lib/libc/sys/t_sendmmsg.c
156
cnt = sendmmsg(fd[1], mmsghdr + n, npkt, 0);
regress/lib/libc/sys/t_sendmmsg.c
170
n, strerror(errno));
regress/lib/libc/sys/t_sendmmsg.c
173
n += cnt;
regress/lib/libc/sys/t_sendmmsg.c
183
for (n = 0; n < mmsgcnt; n++) {
regress/lib/libc/sys/t_sendmmsg.c
185
printf("receiving packet %u/%u...\n", n,
regress/lib/libc/sys/t_sendmmsg.c
195
ATF_CHECK_EQ_MSG(rgram[0], n,
regress/lib/libc/sys/t_sendmmsg.c
196
"number %u != %u", rgram[0], n);
regress/lib/libc/sys/t_sendmmsg.c
86
unsigned int mmsgcnt, n;
regress/lib/libc/sys/t_sendrecv.c
104
if (n == 0)
regress/lib/libc/sys/t_sendrecv.c
106
ATF_REQUIRE_EQ(n, -1);
regress/lib/libc/sys/t_sendrecv.c
69
ssize_t n;
regress/lib/libc/sys/t_sendrecv.c
72
for (; (n = send(sd, &p, sizeof(p), 0)) == sizeof(p);
regress/lib/libc/sys/t_sendrecv.c
86
ssize_t n;
regress/lib/libc/sys/t_sendrecv.c
92
while ((n = recv(sd, &p, sizeof(p), 0), sizeof(p))
regress/lib/libc/sys/t_stat.c
288
const size_t n = 10;
regress/lib/libc/sys/t_stat.c
295
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_unlink.c
54
const size_t n = 512;
regress/lib/libc/sys/t_unlink.c
58
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_wait_noproc.c
139
size_t n;
regress/lib/libc/sys/t_wait_noproc.c
163
for (n = 0; n < __arraycount(matrix); n++) {
regress/lib/libc/sys/t_wait_noproc.c
164
if (pos & __BIT(n))
regress/lib/libc/sys/t_wait_noproc.c
165
rv |= matrix[n];
regress/lib/libc/sys/t_wait_noproc.c
179
size_t n;
regress/lib/libc/sys/t_wait_noproc.c
216
for (n = 0; n < __arraycount(special); n++) {
regress/lib/libc/sys/t_wait_noproc.c
217
if (pos & __BIT(n))
regress/lib/libc/sys/t_wait_noproc.c
218
rv |= matrix[n];
regress/lib/libc/sys/t_write.c
140
const size_t n = 123;
regress/lib/libc/sys/t_write.c
147
for (i = 0; i < n; i++) {
regress/lib/libc/sys/t_write.c
169
const size_t n = 99;
regress/lib/libc/sys/t_write.c
179
for (i = j = 0; i < n; i++)
regress/lib/libc/sys/t_write.c
182
if (j != n * 123)
regress/lib/libcrypto/bn/bn_general.c
31
benchmark_bn_copy_setup(BIGNUM *dst, BIGNUM *src, int n)
regress/lib/libcrypto/bn/bn_general.c
33
if (!BN_set_bit(dst, n - 1))
regress/lib/libcrypto/bn/bn_general.c
35
if (!BN_set_bit(src, n - 1))
regress/lib/libcrypto/bn/bn_isqrt.c
169
BIGNUM *n, *n_sqr, *lower, *upper, *testcase, *isqrt;
regress/lib/libcrypto/bn/bn_isqrt.c
182
if ((n = BN_CTX_get(ctx)) == NULL)
regress/lib/libcrypto/bn/bn_isqrt.c
197
if (!bn_rand_in_range(n, lower, upper))
regress/lib/libcrypto/bn/bn_isqrt.c
201
if (!BN_sqr(n_sqr, n, ctx))
regress/lib/libcrypto/bn/bn_isqrt.c
207
if ((cmp = BN_cmp(n, isqrt)) != 0 || !is_perfect_square) {
regress/lib/libcrypto/bn/bn_isqrt.c
209
BN_print_fp(stderr, n);
regress/lib/libcrypto/bn/bn_isqrt.c
216
if (!BN_lshift1(upper, n))
regress/lib/libcrypto/bn/bn_isqrt.c
235
if ((cmp = BN_cmp(n, isqrt)) != 0 || !is_perfect_square) {
regress/lib/libcrypto/bn/bn_isqrt.c
237
BN_print_fp(stderr, n);
regress/lib/libcrypto/bn/bn_isqrt.c
255
if ((cmp = BN_cmp(n, isqrt)) != 0 ||
regress/lib/libcrypto/bn/bn_isqrt.c
258
BN_print_fp(stderr, n);
regress/lib/libcrypto/bn/bn_isqrt.c
281
if ((cmp = BN_cmp(n, isqrt)) != 0 || is_perfect_square) {
regress/lib/libcrypto/bn/bn_isqrt.c
283
BN_print_fp(stderr, n);
regress/lib/libcrypto/bn/bn_primes.c
29
BIGNUM *n = NULL;
regress/lib/libcrypto/bn/bn_primes.c
42
if ((n = BN_new()) == NULL) {
regress/lib/libcrypto/bn/bn_primes.c
51
if (!BN_set_word(n, i)) {
regress/lib/libcrypto/bn/bn_primes.c
61
ret = BN_is_prime_fasttest_ex(n, BN_prime_checks, NULL,
regress/lib/libcrypto/bn/bn_primes.c
78
BN_free(n);
regress/lib/libcrypto/bn/bn_shift.c
376
benchmark_bn_lshift(BIGNUM *bn, int n)
regress/lib/libcrypto/bn/bn_shift.c
380
if (!BN_set_bit(bn, 8192 * n))
regress/lib/libcrypto/bn/bn_shift.c
387
if (!BN_lshift(bn, bn, n))
regress/lib/libcrypto/bn/bn_shift.c
452
benchmark_bn_rshift(BIGNUM *bn, int n)
regress/lib/libcrypto/bn/bn_shift.c
459
if (!BN_set_bit(bn, 8192 * n))
regress/lib/libcrypto/bn/bn_shift.c
463
if (!BN_rshift(bn, bn, n))
regress/lib/libcrypto/bn/bn_test.c
1216
BIGNUM *b, *n, *c;
regress/lib/libcrypto/bn/bn_test.c
1235
if ((n = BN_CTX_get(ctx)) == NULL)
regress/lib/libcrypto/bn/bn_test.c
1265
len = BN_hex2bn(&n,
regress/lib/libcrypto/bn/bn_test.c
1271
CHECK_GOTO(BN_MONT_CTX_set(mont, n, ctx));
regress/lib/libcrypto/bn/bn_test.c
1280
len = BN_hex2bn(&n,
regress/lib/libcrypto/bn/bn_test.c
1317
CHECK_GOTO(BN_MONT_CTX_set(mont, n, ctx));
regress/lib/libcrypto/bn/bn_test.c
1423
genprime_cb(int p, int n, BN_GENCB *arg)
regress/lib/libcrypto/bn/bn_test.c
781
BIGNUM *a, *b, *c, *d, *A, *B, *n;
regress/lib/libcrypto/bn/bn_test.c
799
if ((n = BN_CTX_get(ctx)) == NULL)
regress/lib/libcrypto/bn/bn_test.c
805
BN_zero(n);
regress/lib/libcrypto/bn/bn_test.c
806
if (BN_MONT_CTX_set(mont, n, ctx)) {
regress/lib/libcrypto/bn/bn_test.c
812
CHECK_GOTO(BN_set_word(n, 16));
regress/lib/libcrypto/bn/bn_test.c
813
if (BN_MONT_CTX_set(mont, n, ctx)) {
regress/lib/libcrypto/bn/bn_test.c
826
CHECK_GOTO(BN_bntest_rand(n, bits, 0, 1));
regress/lib/libcrypto/bn/bn_test.c
827
CHECK_GOTO(BN_MONT_CTX_set(mont, n, ctx));
regress/lib/libcrypto/bn/bn_test.c
829
CHECK_GOTO(BN_nnmod(a, a, n, ctx));
regress/lib/libcrypto/bn/bn_test.c
830
CHECK_GOTO(BN_nnmod(b, b, n, ctx));
regress/lib/libcrypto/bn/bn_test.c
844
CHECK_GOTO(BN_print(bp, n));
regress/lib/libcrypto/bn/bn_test.c
850
CHECK_GOTO(BN_mod_mul(d, a, b, n, ctx));
regress/lib/libcrypto/des/destest.c
356
unsigned int n;
regress/lib/libcrypto/des/destest.c
359
for(n=0 ; n < i ; ++n)
regress/lib/libcrypto/des/destest.c
360
printf(" %02x",cbc_data[n]);
regress/lib/libcrypto/des/destest.c
362
for(n=0 ; n < i ; ++n)
regress/lib/libcrypto/des/destest.c
363
printf(" %02x",cbc_in[n]);
regress/lib/libcrypto/des/destest.c
501
unsigned int n;
regress/lib/libcrypto/des/destest.c
504
for(n=0 ; n < i ; ++n)
regress/lib/libcrypto/des/destest.c
505
printf(" %02x",cbc_out[n]);
regress/lib/libcrypto/des/destest.c
507
for(n=0 ; n < i ; ++n)
regress/lib/libcrypto/des/destest.c
508
printf(" %02x",cbc3_ok[n]);
regress/lib/libcrypto/des/destest.c
517
unsigned int n;
regress/lib/libcrypto/des/destest.c
520
for(n=0 ; n < i ; ++n)
regress/lib/libcrypto/des/destest.c
521
printf(" %02x",cbc_data[n]);
regress/lib/libcrypto/des/destest.c
523
for(n=0 ; n < i ; ++n)
regress/lib/libcrypto/des/destest.c
524
printf(" %02x",cbc_in[n]);
regress/lib/libcrypto/des/destest.c
807
int err=0,i,n;
regress/lib/libcrypto/des/destest.c
811
n=0;
regress/lib/libcrypto/des/destest.c
812
DES_cfb64_encrypt(plain,cfb_buf1,12,&ks,&cfb_tmp,&n,DES_ENCRYPT);
regress/lib/libcrypto/des/destest.c
814
&cfb_tmp,&n,DES_ENCRYPT);
regress/lib/libcrypto/des/destest.c
823
n=0;
regress/lib/libcrypto/des/destest.c
824
DES_cfb64_encrypt(cfb_buf1,cfb_buf2,17,&ks,&cfb_tmp,&n,DES_DECRYPT);
regress/lib/libcrypto/des/destest.c
826
sizeof(plain)-17,&ks,&cfb_tmp,&n,DES_DECRYPT);
regress/lib/libcrypto/des/destest.c
840
int err=0,i,n;
regress/lib/libcrypto/des/destest.c
844
n=0;
regress/lib/libcrypto/des/destest.c
845
DES_ede3_cfb64_encrypt(plain,cfb_buf1,12,&ks,&ks,&ks,&cfb_tmp,&n,
regress/lib/libcrypto/des/destest.c
849
&cfb_tmp,&n,DES_ENCRYPT);
regress/lib/libcrypto/des/destest.c
858
n=0;
regress/lib/libcrypto/des/destest.c
860
&cfb_tmp,&n,DES_DECRYPT);
regress/lib/libcrypto/des/destest.c
863
&cfb_tmp,&n,DES_DECRYPT);
regress/lib/libcrypto/dh/dhtest.c
72
cb(int p, int n, BN_GENCB *arg)
regress/lib/libcrypto/dsa/dsatest.c
206
dsa_cb(int p, int n, BN_GENCB *arg)
regress/lib/libcrypto/dsa/dsatest.c
73
static int dsa_cb(int p, int n, BN_GENCB *arg);
regress/lib/libcrypto/ecdsa/ecdsatest.c
126
for (n = 0; n < num_curves; n++) {
regress/lib/libcrypto/ecdsa/ecdsatest.c
129
nid = curves[n].nid;
regress/lib/libcrypto/ecdsa/ecdsatest.c
90
size_t num_curves = 0, n = 0;
regress/lib/libcrypto/evp/evptest.c
65
int n = 0;
regress/lib/libcrypto/evp/evptest.c
68
for (; n < l; ++n) {
regress/lib/libcrypto/evp/evptest.c
69
if ((n % 16) == 0)
regress/lib/libcrypto/evp/evptest.c
70
fprintf(f, "\n%04x",n);
regress/lib/libcrypto/evp/evptest.c
71
fprintf(f, " %02x",s[n]);
regress/lib/libcrypto/evp/evptest.c
82
unsigned int n;
regress/lib/libcrypto/evp/evptest.c
88
if (sscanf((char *)s, "%2x", &n) != 1) {
regress/lib/libcrypto/evp/evptest.c
93
*d = (unsigned char)n;
regress/lib/libcrypto/idea/ideatest.c
169
int err=0,i,n;
regress/lib/libcrypto/idea/ideatest.c
174
n=0;
regress/lib/libcrypto/idea/ideatest.c
176
cfb_tmp,&n,IDEA_ENCRYPT);
regress/lib/libcrypto/idea/ideatest.c
179
cfb_tmp,&n,IDEA_ENCRYPT);
regress/lib/libcrypto/idea/ideatest.c
188
n=0;
regress/lib/libcrypto/idea/ideatest.c
190
cfb_tmp,&n,IDEA_DECRYPT);
regress/lib/libcrypto/idea/ideatest.c
193
cfb_tmp,&n,IDEA_DECRYPT);
regress/lib/libcrypto/ige/igetest.c
124
unsigned int n;
regress/lib/libcrypto/ige/igetest.c
127
for(n=0 ; n < sizeof(ige_test_vectors)/sizeof(ige_test_vectors[0]) ; ++n)
regress/lib/libcrypto/ige/igetest.c
129
const struct ige_test * const v = &ige_test_vectors[n];
regress/lib/libcrypto/ige/igetest.c
145
printf("IGE test vector %d failed\n", n);
regress/lib/libcrypto/ige/igetest.c
162
printf("IGE test vector %d failed (with in == out)\n", n);
regress/lib/libcrypto/ige/igetest.c
188
unsigned int n;
regress/lib/libcrypto/ige/igetest.c
279
for(n=0 ; n < sizeof checktext ; ++n)
regress/lib/libcrypto/ige/igetest.c
280
if(checktext[n] == plaintext[n])
regress/lib/libcrypto/ige/igetest.c
309
for(n=0 ; n < sizeof checktext ; ++n)
regress/lib/libcrypto/ige/igetest.c
310
if(checktext[n] == plaintext[n])
regress/lib/libcrypto/ige/igetest.c
333
for(n=0 ; n < sizeof checktext ; ++n)
regress/lib/libcrypto/ige/igetest.c
334
if(checktext[n] == plaintext[n])
regress/lib/libcrypto/ige/igetest.c
357
for(n=0 ; n < sizeof checktext ; ++n)
regress/lib/libcrypto/ige/igetest.c
358
if(checktext[n] == plaintext[n])
regress/lib/libcrypto/ige/igetest.c
64
int n=0;
regress/lib/libcrypto/ige/igetest.c
67
for( ; n < l ; ++n)
regress/lib/libcrypto/ige/igetest.c
69
if((n%16) == 0)
regress/lib/libcrypto/ige/igetest.c
70
fprintf(f,"\n%04x",n);
regress/lib/libcrypto/ige/igetest.c
71
fprintf(f," %02x",s[n]);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
121
unsigned int n;
regress/lib/libcrypto/pbkdf2/pbkdf2.c
124
if (sscanf((char *)src, "%2x", &n) != 1)
regress/lib/libcrypto/pbkdf2/pbkdf2.c
126
*dst++ = (unsigned char)n;
regress/lib/libcrypto/pbkdf2/pbkdf2.c
132
test_p5_pbkdf2(unsigned int n, const char *digestname, const testdata *test,
regress/lib/libcrypto/pbkdf2/pbkdf2.c
149
fprintf(stderr, "odd hex string %s, digest %u\n", digestname, n);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
160
fprintf(stderr, "invalid hex string %s, digest %u\n", hex, n);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
170
digestname, n);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
176
digestname, n);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
188
unsigned int n;
regress/lib/libcrypto/pbkdf2/pbkdf2.c
193
for (n = 0; test->pass != NULL; n++, test++) {
regress/lib/libcrypto/pbkdf2/pbkdf2.c
194
test_p5_pbkdf2(n, "sha1", test, sha1_results[n]);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
195
test_p5_pbkdf2(n, "sha256", test, sha256_results[n]);
regress/lib/libcrypto/pbkdf2/pbkdf2.c
196
test_p5_pbkdf2(n, "sha512", test, sha512_results[n]);
regress/lib/libcrypto/rsa/rsa_test.c
131
static unsigned char n[] =
regress/lib/libcrypto/rsa/rsa_test.c
175
bn_n = BN_bin2bn(n, sizeof(n) - 1, NULL);
regress/lib/libcrypto/rsa/rsa_test.c
225
static unsigned char n[] =
regress/lib/libcrypto/rsa/rsa_test.c
296
bn_n = BN_bin2bn(n, sizeof(n) - 1, NULL);
regress/lib/libcrypto/rsa/rsa_test.c
33
static unsigned char n[] =
regress/lib/libcrypto/rsa/rsa_test.c
367
int n;
regress/lib/libcrypto/rsa/rsa_test.c
443
for (n = 0; n < clen; ++n) {
regress/lib/libcrypto/rsa/rsa_test.c
444
ctext[n] ^= 1;
regress/lib/libcrypto/rsa/rsa_test.c
452
ctext[n] ^= 1;
regress/lib/libcrypto/rsa/rsa_test.c
456
for (n = -1; n < clen; ++n) {
regress/lib/libcrypto/rsa/rsa_test.c
457
num = RSA_private_decrypt(n, ctext, ptext, key,
regress/lib/libcrypto/rsa/rsa_test.c
81
bn_n = BN_bin2bn(n, sizeof(n) - 1, NULL);
regress/lib/libcrypto/x509/x509_asn1.c
147
X509_CRL **xc, const unsigned char *n)
regress/lib/libcrypto/x509/x509_asn1.c
153
if (!X509_NAME_add_entry_by_txt(xn, "C", MBSTRING_ASC, n, -1, -1, 0))
regress/lib/libcrypto/x509/x509_asn1.c
72
const unsigned char *n)
regress/lib/libcrypto/x509/x509_asn1.c
78
if (!X509_NAME_add_entry_by_txt(xn, "C", MBSTRING_ASC, n, -1, -1, 0))
regress/lib/libevent/test-time.c
36
rand_int(int n)
regress/lib/libevent/test-time.c
39
return (int)(rand() * n);
regress/lib/libevent/test-time.c
41
return (int)(random() % n);
regress/lib/libm/cephes/polevll.c
159
long double polevll( x, p, n )
regress/lib/libm/cephes/polevll.c
162
int n;
regress/lib/libm/cephes/polevll.c
172
while( --n );
regress/lib/libm/cephes/polevll.c
181
long double p1evll( x, p, n )
regress/lib/libm/cephes/polevll.c
184
int n;
regress/lib/libm/cephes/polevll.c
189
n -= 1;
regress/lib/libm/cephes/polevll.c
195
while( --n );
regress/lib/libm/fpaccuracy/header.h
68
double scalb( double x, double n );
regress/lib/libpthread/blocked_close/blocked_close.c
49
int n, remote_addr_len = sizeof(struct sockaddr);
regress/lib/libpthread/blocked_close/blocked_close.c
51
n = recvfrom(fd, &readBuf, 1, 0, &remote_addr, &remote_addr_len);
regress/lib/libpthread/blocked_close/blocked_close.c
53
if (n == -1)
regress/lib/libpthread/blocked_dup2/blocked_dup2.c
49
int n, remote_addr_len = sizeof(struct sockaddr);
regress/lib/libpthread/blocked_dup2/blocked_dup2.c
51
n = recvfrom(fd, &readBuf, 1, 0, &remote_addr, &remote_addr_len);
regress/lib/libpthread/blocked_dup2/blocked_dup2.c
53
if (n == -1)
regress/lib/libpthread/blocked_shutdown/blocked_shutdown.c
49
int n, remote_addr_len = sizeof(struct sockaddr);
regress/lib/libpthread/blocked_shutdown/blocked_shutdown.c
51
n = recvfrom(fd, &readBuf, 1, 0, &remote_addr, &remote_addr_len);
regress/lib/libpthread/blocked_shutdown/blocked_shutdown.c
53
if (n == -1)
regress/lib/libpthread/group/group.c
164
int *n = (int *)malloc(sizeof(int));
regress/lib/libpthread/group/group.c
165
*n = gid;
regress/lib/libpthread/group/group.c
167
CHECKr(pthread_create(&thread[gid], NULL, test, (void *)n));
regress/lib/libpthread/select/select.c
104
CHECKe(n = select(maxfd + 1, &r, (fd_set *) 0, (fd_set *) 0,
regress/lib/libpthread/select/select.c
107
if (n > 0) {
regress/lib/libpthread/select/select.c
109
printf("select returned %d\n", n);
regress/lib/libpthread/select/select.c
58
int n;
regress/lib/libpthread/select/select.c
67
n = NLOOPS;
regress/lib/libpthread/select/select.c
68
while (n-- > 0)
regress/lib/libpthread/select/select.c
77
int n;
regress/lib/libsndio/cap/cap.c
27
unsigned n, i;
regress/lib/libsndio/cap/cap.c
29
for (n = 0; n < cap->nconf; n++) {
regress/lib/libsndio/cap/cap.c
30
fprintf(stderr, "config %d\n", n);
regress/lib/libsndio/cap/cap.c
33
if (cap->confs[n].enc & (1 << i)) {
regress/lib/libsndio/cap/cap.c
40
if (cap->confs[n].pchan & (1 << i))
regress/lib/libsndio/cap/cap.c
45
if (cap->confs[n].rchan & (1 << i))
regress/lib/libsndio/cap/cap.c
50
if (cap->confs[n].rate & (1 << i))
regress/lib/libsndio/fd/fd.c
109
int n;
regress/lib/libsndio/fd/fd.c
121
n = sio_read(hdl, buf->data + end, count);
regress/lib/libsndio/fd/fd.c
122
if (n == 0) {
regress/lib/libsndio/fd/fd.c
129
if (n % bpf) {
regress/lib/libsndio/fd/fd.c
130
fprintf(stderr, "rec: bad align: %u bytes\n", n);
regress/lib/libsndio/fd/fd.c
133
rlat -= n / bpf;
regress/lib/libsndio/fd/fd.c
134
buf->used += n;
regress/lib/libsndio/fd/fd.c
135
done += n;
regress/lib/libsndio/fd/fd.c
148
int n;
regress/lib/libsndio/fd/fd.c
156
n = sio_write(hdl, buf->data + buf->start, count);
regress/lib/libsndio/fd/fd.c
157
if (n == 0) {
regress/lib/libsndio/fd/fd.c
164
if (n % bpf) {
regress/lib/libsndio/fd/fd.c
165
fprintf(stderr, "play: bad align: %u bytes\n", n);
regress/lib/libsndio/fd/fd.c
168
plat += n / bpf;
regress/lib/libsndio/fd/fd.c
170
buf->used -= n;
regress/lib/libsndio/fd/fd.c
171
buf->start += n;
regress/lib/libsndio/fd/fd.c
174
done += n;
regress/lib/libsndio/fd/fd.c
51
int n;
regress/lib/libsndio/fd/fd.c
63
n = read(fd, buf->data + end, count);
regress/lib/libsndio/fd/fd.c
64
if (n < 0) {
regress/lib/libsndio/fd/fd.c
68
if (n == 0) {
regress/lib/libsndio/fd/fd.c
70
n = count;
regress/lib/libsndio/fd/fd.c
72
buf->used += n;
regress/lib/libsndio/fd/fd.c
83
int n;
regress/lib/libsndio/fd/fd.c
89
n = write(fd, buf->data + buf->start, count);
regress/lib/libsndio/fd/fd.c
90
if (n < 0) {
regress/lib/libsndio/fd/fd.c
94
buf->used -= n;
regress/lib/libsndio/fd/fd.c
95
buf->start += n;
regress/lib/libsndio/play/play.c
129
n = sio_write(hdl, buf, len);
regress/lib/libsndio/play/play.c
130
if (n == 0) {
regress/lib/libsndio/play/play.c
134
playpos += n;
regress/lib/libsndio/play/play.c
45
ssize_t n, len;
regress/lib/libsndio/rec/rec.c
110
n = sio_read(hdl, buf, BUFSZ);
regress/lib/libsndio/rec/rec.c
111
if (n == 0) {
regress/lib/libsndio/rec/rec.c
115
rlat -= n / (int)(par.bps * par.rchan);
regress/lib/libsndio/rec/rec.c
116
if (write(STDOUT_FILENO, buf, n) < 0) {
regress/lib/libsndio/rec/rec.c
42
ssize_t n;
regress/lib/libsndio/vol/vol.c
153
n = sio_write(hdl, buf, len);
regress/lib/libsndio/vol/vol.c
154
if (n == 0) {
regress/lib/libsndio/vol/vol.c
41
ssize_t n, len;
regress/lib/libssl/buffer/buffertest.c
279
ssize_t n;
regress/lib/libssl/buffer/buffertest.c
311
if ((n = tls_buffer_write(buf, wbuf, rwt->write)) !=
regress/lib/libssl/buffer/buffertest.c
315
i, n, rwt->want);
regress/lib/libssl/buffer/buffertest.c
324
if ((n = tls_buffer_read(buf, rbuf, rwt->read)) !=
regress/lib/libssl/buffer/buffertest.c
328
i, n, rwt->want);
regress/lib/libssl/buffer/buffertest.c
40
ssize_t n;
regress/lib/libssl/buffer/buffertest.c
45
if ((size_t)(n = buflen) > (rs->len - rs->offset))
regress/lib/libssl/buffer/buffertest.c
46
n = rs->len - rs->offset;
regress/lib/libssl/buffer/buffertest.c
48
if (n == 0)
regress/lib/libssl/buffer/buffertest.c
51
memcpy(buf, &rs->buf[rs->offset], n);
regress/lib/libssl/buffer/buffertest.c
52
rs->offset += n;
regress/lib/libssl/buffer/buffertest.c
54
return n;
regress/lib/libssl/interop/botan/client.cpp
211
ssize_t n;
regress/lib/libssl/interop/botan/client.cpp
213
n = recv(s, buf, sizeof(buf), 0);
regress/lib/libssl/interop/botan/client.cpp
214
if (n < 0)
regress/lib/libssl/interop/botan/client.cpp
216
if (n == 0)
regress/lib/libssl/interop/botan/client.cpp
218
client.received_data((uint8_t *)&buf, n);
regress/lib/libssl/interop/botan/client.cpp
79
ssize_t n;
regress/lib/libssl/interop/botan/client.cpp
81
n = send(m_socket, data + off, len, 0);
regress/lib/libssl/interop/botan/client.cpp
82
if (n < 0)
regress/lib/libssl/interop/botan/client.cpp
84
off += n;
regress/lib/libssl/interop/botan/client.cpp
85
len -= n;
regress/lib/libssl/record/recordtest.c
104
if ((size_t)(n = buflen) > (ws->len - ws->offset))
regress/lib/libssl/record/recordtest.c
105
n = ws->len - ws->offset;
regress/lib/libssl/record/recordtest.c
107
if (n == 0)
regress/lib/libssl/record/recordtest.c
110
memcpy(&ws->buf[ws->offset], buf, n);
regress/lib/libssl/record/recordtest.c
111
ws->offset += n;
regress/lib/libssl/record/recordtest.c
113
return n;
regress/lib/libssl/record/recordtest.c
78
ssize_t n;
regress/lib/libssl/record/recordtest.c
83
if ((size_t)(n = buflen) > (rs->len - rs->offset))
regress/lib/libssl/record/recordtest.c
84
n = rs->len - rs->offset;
regress/lib/libssl/record/recordtest.c
86
if (n == 0)
regress/lib/libssl/record/recordtest.c
89
memcpy(buf, &rs->buf[rs->offset], n);
regress/lib/libssl/record/recordtest.c
90
rs->offset += n;
regress/lib/libssl/record/recordtest.c
92
return n;
regress/lib/libssl/record/recordtest.c
99
ssize_t n;
regress/lib/libtls/keypair/keypairtest.c
42
ssize_t n;
regress/lib/libtls/keypair/keypairtest.c
54
n = read(fd, buf, len);
regress/lib/libtls/keypair/keypairtest.c
55
if (n < 0 || (size_t)n != len)
regress/lib/libtls/signer/signertest.c
62
ssize_t n;
regress/lib/libtls/signer/signertest.c
76
n = read(fd, buf, len);
regress/lib/libtls/signer/signertest.c
77
if (n < 0 || (size_t)n != len)
regress/lib/libtls/tls/tlstest.c
53
size_t n = 0;
regress/lib/libtls/tls/tlstest.c
55
while (n < outlen) {
regress/lib/libtls/tls/tlstest.c
62
n++;
regress/lib/libtls/tls/tlstest.c
65
if (debug && n > 0)
regress/lib/libtls/tls/tlstest.c
66
fprintf(stderr, "%s buffer: read %zi bytes\n", name, n);
regress/lib/libtls/tls/tlstest.c
68
return (n > 0 ? (ssize_t)n : TLS_WANT_POLLIN);
regress/lib/libtls/tls/tlstest.c
78
size_t n = 0;
regress/lib/libtls/tls/tlstest.c
80
while (n < inlen) {
regress/lib/libtls/tls/tlstest.c
88
n++;
regress/lib/libtls/tls/tlstest.c
91
if (debug && n > 0)
regress/lib/libtls/tls/tlstest.c
92
fprintf(stderr, "%s buffer: wrote %zi bytes\n", name, n);
regress/lib/libtls/tls/tlstest.c
94
return (n > 0 ? (ssize_t)n : TLS_WANT_POLLOUT);
regress/lib/libz/example.c
39
static void *myalloc(void *q, unsigned n, unsigned m) {
regress/lib/libz/example.c
41
return calloc(n, m);
regress/lib/libz/minigzip.c
152
static void *myalloc(void *q, unsigned n, unsigned m) {
regress/lib/libz/minigzip.c
154
return calloc(n, m);
regress/libexec/ld.so/randomdata/ld.so-cookie/test.c
11
nonzero(char *s, size_t n)
regress/libexec/ld.so/randomdata/ld.so-cookie/test.c
15
for (i = 0; i < n; i++)
regress/sbin/ifconfig/ifaddr.c
1573
int n = 0;
regress/sbin/ifconfig/ifaddr.c
1585
return n;
regress/sbin/ifconfig/ifaddr.c
1591
n += sizeof (*out);
regress/sbin/iked/test_helper/fuzz.c
70
fuzz_ntop(u_int n)
regress/sbin/iked/test_helper/fuzz.c
72
switch (n) {
regress/sbin/iked/test_helper/test_helper.c
164
test_start(const char *n)
regress/sbin/iked/test_helper/test_helper.c
167
assert((active_test_name = strdup(n)) != NULL);
regress/sbin/iked/test_helper/test_helper.h
40
void test_start(const char *n);
regress/sbin/iked/test_helper/test_helper.h
83
#define TEST_START(n) test_start(n)
regress/sys/arch/amd64/ddb/stubs.c
75
int n = 0;
regress/sys/arch/amd64/ddb/stubs.c
80
n = snprintf(&ctx->act.buf[ctx->act.len], ctx->act.siz, " ");
regress/sys/arch/amd64/ddb/stubs.c
85
n = vsnprintf(&ctx->act.buf[ctx->act.len], ctx->act.siz, fmt,
regress/sys/arch/amd64/ddb/stubs.c
89
if (n < 0 || (size_t)n >= ctx->act.siz)
regress/sys/arch/amd64/ddb/stubs.c
91
ctx->act.len += n;
regress/sys/arch/amd64/ddb/stubs.c
92
ctx->act.siz -= n;
regress/sys/arch/amd64/vmmcall/vmmcall.c
49
int n;
regress/sys/arch/amd64/vmmcall/vmmcall.c
55
n = 0;
regress/sys/arch/amd64/vmmcall/vmmcall.c
57
n = 1;
regress/sys/arch/amd64/vmmcall/vmmcall.c
67
switch (n) {
regress/sys/arch/hppa/probe/probe.c
51
#define test_probe(n,a,r) \
regress/sys/arch/hppa/probe/probe.c
52
label = #n; \
regress/sys/arch/hppa/probe/probe.c
53
n(rv, a); \
regress/sys/dev/wscons/sigio.c
101
ssize_t n;
regress/sys/dev/wscons/sigio.c
158
n = read(fd, &ev, len);
regress/sys/dev/wscons/sigio.c
159
if (n == -1)
regress/sys/dev/wscons/sigio.c
161
if (n != len)
regress/sys/dev/wscons/sigio.c
162
errx(1, "read: expected %d bytes, got %ld", len, n);
regress/sys/ffs/fstest.c
326
#define NUM(n) (args[(n)].num)
regress/sys/ffs/fstest.c
327
#define STR(n) (args[(n)].str)
regress/sys/ffs/fstest.c
460
unsigned int n;
regress/sys/ffs/fstest.c
543
n = call_syscall(scall, argv);
regress/sys/ffs/fstest.c
544
argc += n;
regress/sys/ffs/fstest.c
545
argv += n;
regress/sys/kern/flock/util.c
100
if (n == -1 || n >= (int)sizeof(path))
regress/sys/kern/flock/util.c
39
int fd, n;
regress/sys/kern/flock/util.c
42
n = snprintf(template, sizeof(template), "%sflock.XXXXXX", dir);
regress/sys/kern/flock/util.c
43
if (n == -1 || n >= (int)sizeof(template))
regress/sys/kern/flock/util.c
88
int n;
regress/sys/kern/flock/util.c
99
n = snprintf(path, sizeof(path), "%s%s", p, nosuffix ? "/" : "");
regress/sys/kern/futex/futex.h
19
futex_wake(volatile uint32_t *p, int n, int priv)
regress/sys/kern/futex/futex.h
21
return futex(p, FUTEX_WAKE | priv, n, NULL, NULL);
regress/sys/kern/futex/futex.h
39
futex_requeue(volatile uint32_t *p, int n, int m, volatile uint32_t *q)
regress/sys/kern/futex/futex.h
41
return futex(p, FUTEX_REQUEUE, n, (void *)(long)m, q);
regress/sys/kern/kqueue/kqueue-pipe.c
48
int n;
regress/sys/kern/kqueue/kqueue-pipe.c
66
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-pipe.c
67
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-pipe.c
70
while ((n = write(fd[1], buf, sizeof(buf))) == sizeof(buf))
regress/sys/kern/kqueue/kqueue-pipe.c
75
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-pipe.c
76
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-pipe.c
82
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-pipe.c
83
ASSX(n != -1 && n != 0);
regress/sys/kern/kqueue/kqueue-pty.c
124
int kq, massa, n, slave;
regress/sys/kern/kqueue/kqueue-pty.c
141
n = kevent(kq, NULL, 0, ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-pty.c
142
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-pty.c
150
do_pty(int n)
regress/sys/kern/kqueue/kqueue-pty.c
152
switch (n) {
regress/sys/kern/kqueue/kqueue-pty.c
158
errx(1, "unknown pty test number %d", n);
regress/sys/kern/kqueue/kqueue-pty.c
20
pty_check(int kq, struct kevent *ev, int n, int rm, int rs, int wm, int ws)
regress/sys/kern/kqueue/kqueue-pty.c
27
if ((n = kevent(kq, NULL, 0, ev, n, &ts)) < 0)
regress/sys/kern/kqueue/kqueue-pty.c
30
ASSX(n != 0);
regress/sys/kern/kqueue/kqueue-pty.c
32
for (i = 0; i < n; i++, ev++) {
regress/sys/kern/kqueue/kqueue-random.c
22
int n, fd, kq;
regress/sys/kern/kqueue/kqueue-random.c
39
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-random.c
40
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-random.c
44
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-random.c
45
ASSX(n >= 0);
regress/sys/kern/kqueue/kqueue-random.c
47
n = MINIMUM((ev.data + 7) / 8, sizeof(buf));
regress/sys/kern/kqueue/kqueue-random.c
48
ASSX(read(fd, buf, n) > 0);
regress/sys/kern/kqueue/kqueue-regress.c
35
do_regress(int n)
regress/sys/kern/kqueue/kqueue-regress.c
37
switch (n) {
regress/sys/kern/kqueue/kqueue-regress.c
51
errx(1, "unknown regress test number %d", n);
regress/sys/kern/kqueue/kqueue-timer.c
100
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
101
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
131
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
132
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
137
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
138
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-timer.c
174
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
175
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
177
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
178
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-timer.c
191
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
192
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-timer.c
201
int i, kq, n;
regress/sys/kern/kqueue/kqueue-timer.c
213
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
214
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
217
n = kevent(kq, NULL, 0, &ev, 1, &invalid_ts[i]);
regress/sys/kern/kqueue/kqueue-timer.c
218
ASS(n == -1 && errno == EINVAL,
regress/sys/kern/kqueue/kqueue-timer.c
231
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
232
ASSX(n == -1 && errno == EINVAL);
regress/sys/kern/kqueue/kqueue-timer.c
240
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
241
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-timer.c
251
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
252
ASSX(n == -1 && errno == EINVAL);
regress/sys/kern/kqueue/kqueue-timer.c
260
int kq, msecs, n;
regress/sys/kern/kqueue/kqueue-timer.c
274
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
275
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
282
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
283
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
288
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
289
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-timer.c
296
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
297
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
300
n = kevent(kq, NULL, 0, &ev, 1, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
301
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-timer.c
41
int i, kq, n;
regress/sys/kern/kqueue/kqueue-timer.c
51
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
52
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
57
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
58
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-timer.c
67
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
68
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
73
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
74
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-timer.c
85
n = kevent(kq, &ev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-timer.c
86
ASSX(n != -1);
regress/sys/kern/kqueue/kqueue-timer.c
91
n = kevent(kq, NULL, 0, &ev, 1, &ts);
regress/sys/kern/kqueue/kqueue-timer.c
92
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-user.c
100
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
101
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
104
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
105
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-user.c
111
n = kevent(kq, NULL, 0, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
112
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
115
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
116
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-user.c
123
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
124
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
128
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
129
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
131
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
132
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
135
n = kevent(kq, kev, 1, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
136
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-user.c
145
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
146
if (n == -1) {
regress/sys/kern/kqueue/kqueue-user.c
150
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
156
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
157
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
161
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
162
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
165
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
166
ASSX(n == -1);
regress/sys/kern/kqueue/kqueue-user.c
34
int dummy, dummy2, i, kq, n;
regress/sys/kern/kqueue/kqueue-user.c
44
n = kevent(kq, NULL, 0, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
45
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
50
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
51
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
54
n = kevent(kq, NULL, 0, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
55
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-user.c
63
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
64
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
67
n = kevent(kq, NULL, 0, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
68
ASSX(n == 2);
regress/sys/kern/kqueue/kqueue-user.c
80
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
81
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
83
n = kevent(kq, NULL, 0, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
84
ASSX(n == 1);
regress/sys/kern/kqueue/kqueue-user.c
92
n = kevent(kq, kev, 1, NULL, 0, NULL);
regress/sys/kern/kqueue/kqueue-user.c
93
ASSX(n == 0);
regress/sys/kern/kqueue/kqueue-user.c
95
n = kevent(kq, NULL, 0, kev, 2, &ts);
regress/sys/kern/kqueue/kqueue-user.c
96
ASSX(n == 0);
regress/sys/kern/kqueue/main.c
17
int n, ret, c;
regress/sys/kern/kqueue/main.c
53
n = strtonum(optarg, 1, INT_MAX, NULL);
regress/sys/kern/kqueue/main.c
54
ret |= do_regress(n);
regress/sys/kern/kqueue/main.c
63
n = strtonum(optarg, 1, INT_MAX, NULL);
regress/sys/kern/kqueue/main.c
64
ret |= do_pty(n);
regress/sys/kern/mmap/mmaptest.c
46
ssize_t n;
regress/sys/kern/mmap/mmaptest.c
73
n = read(fd, &i, sizeof i);
regress/sys/kern/mmap/mmaptest.c
74
if (n == -1)
regress/sys/kern/mmap/mmaptest.c
76
if (n != sizeof i)
regress/sys/kern/pipe/test-kqueue.c
124
ssize_t n;
regress/sys/kern/pipe/test-kqueue.c
128
n = write(ctx.c_pipe[1], ctx.c_buf, ctx.c_bufsiz);
regress/sys/kern/pipe/test-kqueue.c
129
if (n == -1)
regress/sys/kern/pipe/test-kqueue.c
131
if ((size_t)n != ctx.c_bufsiz)
regress/sys/kern/pipe/test-kqueue.c
132
errx(1, "write: %ld != %zu", n, ctx.c_bufsiz);
regress/sys/kern/pipe/test-kqueue.c
139
n = read(ctx.c_pipe[0], &c, 1);
regress/sys/kern/pipe/test-kqueue.c
140
if (n == -1)
regress/sys/kern/pipe/test-kqueue.c
142
if (n == 0)
regress/sys/kern/pipe/test-kqueue.c
144
if (n != 1)
regress/sys/kern/pipe/test-kqueue.c
145
errx(1, "read: %ld != 1", n);
regress/sys/kern/pipe/test-kqueue.c
74
ssize_t n;
regress/sys/kern/pipe/test-kqueue.c
76
n = write(ctx.c_pipe[1], &ctx.c_buf[0], 1);
regress/sys/kern/pipe/test-kqueue.c
77
if (n == -1) {
regress/sys/kern/pipe/test-kqueue.c
84
if (n != 1)
regress/sys/kern/pipe/test-kqueue.c
85
errx(1, "write: %ld != 1", n);
regress/sys/kern/pipe/test-ping-pong.c
103
n = write(wp, ping, sizeof(ping));
regress/sys/kern/pipe/test-ping-pong.c
104
if (n == -1)
regress/sys/kern/pipe/test-ping-pong.c
106
if (n != sizeof(ping))
regress/sys/kern/pipe/test-ping-pong.c
108
n, sizeof(ping));
regress/sys/kern/pipe/test-ping-pong.c
110
n = read(rp, buf, sizeof(buf));
regress/sys/kern/pipe/test-ping-pong.c
111
if (n == -1)
regress/sys/kern/pipe/test-ping-pong.c
113
if (n != sizeof(buf))
regress/sys/kern/pipe/test-ping-pong.c
114
errx(1, "[p] read: %ld < %zu", n, sizeof(buf));
regress/sys/kern/pipe/test-ping-pong.c
41
ssize_t n;
regress/sys/kern/pipe/test-ping-pong.c
60
n = read(rp, buf, sizeof(buf));
regress/sys/kern/pipe/test-ping-pong.c
61
if (n == -1)
regress/sys/kern/pipe/test-ping-pong.c
63
if (n == 0)
regress/sys/kern/pipe/test-ping-pong.c
65
if (n != sizeof(buf))
regress/sys/kern/pipe/test-ping-pong.c
66
errx(1, "[c] read: %ld < %zu", n, sizeof(buf));
regress/sys/kern/pipe/test-ping-pong.c
70
n = write(wp, pong, sizeof(pong));
regress/sys/kern/pipe/test-ping-pong.c
71
if (n == -1)
regress/sys/kern/pipe/test-ping-pong.c
73
if (n != sizeof(pong))
regress/sys/kern/pipe/test-ping-pong.c
75
n, sizeof(pong));
regress/sys/kern/pipe/test-ping-pong.c
86
n = write(wp, pong, sizeof(pong));
regress/sys/kern/pipe/test-ping-pong.c
87
if (n != -1)
regress/sys/kern/pipe/test-ping-pong.c
88
errx(1, "[c] write: %ld != -1", n);
regress/sys/kern/pipe/test-run-down.c
192
ssize_t n;
regress/sys/kern/pipe/test-run-down.c
194
n = write(ctx->c_pipe[1], ctx->c_buf, ctx->c_bufsiz);
regress/sys/kern/pipe/test-run-down.c
195
if (n == -1) {
regress/sys/kern/pipe/test-select.c
34
ssize_t n;
regress/sys/kern/pipe/test-select.c
50
n = write(pip[1], &c, sizeof(c));
regress/sys/kern/pipe/test-select.c
51
if (n != -1)
regress/sys/kern/pipe/test-select.c
52
errx(1, "read: want -1, got %zd", n);
regress/sys/kern/pipe/test-thundering-herd.c
115
n = write(ctx.c_pipe[1], &c, 1);
regress/sys/kern/pipe/test-thundering-herd.c
117
n = read(ctx.c_pipe[0], &c, 1);
regress/sys/kern/pipe/test-thundering-herd.c
118
if (n == -1)
regress/sys/kern/pipe/test-thundering-herd.c
120
if (n != 1)
regress/sys/kern/pipe/test-thundering-herd.c
121
errx(1, "%s: %ld != 1", ctx.c_ident, n);
regress/sys/kern/pipe/test-thundering-herd.c
174
ssize_t n;
regress/sys/kern/pipe/test-thundering-herd.c
178
n = read(rp, ctx->c_buf, ctx->c_bufsiz);
regress/sys/kern/pipe/test-thundering-herd.c
180
n = write(wp, ctx->c_buf, ctx->c_bufsiz);
regress/sys/kern/pipe/test-thundering-herd.c
183
ctx->c_id, ctx->c_ident, n);
regress/sys/kern/pipe/test-thundering-herd.c
184
if (n == -1) {
regress/sys/kern/pipe/test-thundering-herd.c
189
if (n == 0)
regress/sys/kern/pipe/test-thundering-herd.c
89
ssize_t n;
regress/sys/kern/pledge/generic/pty.c
84
ssize_t n;
regress/sys/kern/pledge/generic/pty.c
86
n = read(pty->master, buf, bufsize);
regress/sys/kern/pledge/generic/pty.c
87
if (n == -1) {
regress/sys/kern/pledge/generic/pty.c
91
if (n == 0)
regress/sys/kern/pledge/generic/pty.c
95
if ((size_t)n >= bufsize) {
regress/sys/kern/pledge/generic/pty.c
99
pty->buf.len += n;
regress/sys/kern/pty/ptyhog.c
101
nwritten += n;
regress/sys/kern/pty/ptyhog.c
50
ssize_t n;
regress/sys/kern/pty/ptyhog.c
76
n = read(sfd, buf + nread, sizeof(buf) - nread);
regress/sys/kern/pty/ptyhog.c
77
if (n == -1) {
regress/sys/kern/pty/ptyhog.c
82
nread += n;
regress/sys/kern/pty/ptyhog.c
98
n = write(mfd, buf + nwritten, sizeof(buf) - nwritten);
regress/sys/kern/pty/ptyhog.c
99
if (n == -1)
regress/sys/kern/recvwait/mcontrol-stream.c
49
ssize_t n;
regress/sys/kern/recvwait/mcontrol-stream.c
55
if ((n = recv(s[1], buf, sizeof(buf), MSG_WAITALL)) == -1)
regress/sys/kern/recvwait/mcontrol-stream.c
57
if ((size_t)n != strlen(str))
regress/sys/kern/recvwait/mcontrol-stream.c
58
errx(1, "recv 1: len %zd", n);
regress/sys/kern/recvwait/mcontrol-stream.c
59
if ((n = recv(s[1], buf, sizeof(buf), 0)) == -1)
regress/sys/kern/recvwait/mcontrol-stream.c
61
if ((size_t)n != strlen(str))
regress/sys/kern/recvwait/mcontrol-stream.c
62
errx(1, "recv 2: len %zd", n);
regress/sys/kern/signal/sigio/sigio_common.c
224
ssize_t n;
regress/sys/kern/signal/sigio/sigio_common.c
236
while ((n = write(fds[0], buf, sizeof(buf))) > 0)
regress/sys/kern/signal/sigio/sigio_common.c
238
assert(n == -1);
regress/sys/kern/signal/sigio/sigio_common.c
248
while ((n = read(fds[1], buf, sizeof(buf))) > 0)
regress/sys/kern/signal/sigio/sigio_common.c
250
assert(n == -1);
regress/sys/kern/unixsockets/unconacc.c
71
int n;
regress/sys/kern/unixsockets/unconacc.c
73
if ((n = accept(s, NULL, NULL)) < 0) {
regress/sys/kern/unixsockets/unconacc.c
83
close(n);
regress/sys/net/pflow/gen_traffic.c
203
size_t n;
regress/sys/net/pflow/gen_traffic.c
208
n = read(fd, buf, 4096);
regress/sys/net/pflow/gen_traffic.c
210
switch (n) {
regress/sys/net/pflow/gen_traffic.c
224
total += n;
regress/sys/netinet/bindconnect/bindconnect.c
251
#define ADVANCE(x, n) \
regress/sys/netinet/bindconnect/bindconnect.c
252
(x += ROUNDUP((n)->sa_len))
regress/sys/netinet/bindconnect/bindconnect.c
296
unsigned int n;
regress/sys/netinet/bindconnect/bindconnect.c
442
for (n = 0; n < socket_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
443
errno = pthread_create(&tsocket[n], NULL, thread_socket, &run);
regress/sys/netinet/bindconnect/bindconnect.c
445
err(1, "pthread_create socket %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
451
for (n = 0; n < close_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
452
errno = pthread_create(&tclose[n], NULL, thread_close, &run);
regress/sys/netinet/bindconnect/bindconnect.c
454
err(1, "pthread_create close %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
460
for (n = 0; n < bind_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
461
errno = pthread_create(&tbind[n], NULL, thread_bind, &run);
regress/sys/netinet/bindconnect/bindconnect.c
463
err(1, "pthread_create bind %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
469
for (n = 0; n < connect_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
470
errno = pthread_create(&tconnect[n], NULL, thread_connect,
regress/sys/netinet/bindconnect/bindconnect.c
473
err(1, "pthread_create connect %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
479
for (n = 0; n < delroute_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
480
errno = pthread_create(&tdelroute[n], NULL, thread_delroute,
regress/sys/netinet/bindconnect/bindconnect.c
483
err(1, "pthread_create delroute %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
493
for (n = 0; n < socket_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
496
errno = pthread_join(tsocket[n], (void **)&count);
regress/sys/netinet/bindconnect/bindconnect.c
498
err(1, "pthread_join socket %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
504
for (n = 0; n < close_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
507
errno = pthread_join(tclose[n], (void **)&count);
regress/sys/netinet/bindconnect/bindconnect.c
509
err(1, "pthread_join close %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
515
for (n = 0; n < bind_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
518
errno = pthread_join(tbind[n], (void **)&count);
regress/sys/netinet/bindconnect/bindconnect.c
520
err(1, "pthread_join bind %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
526
for (n = 0; n < connect_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
529
errno = pthread_join(tconnect[n], (void **)&count);
regress/sys/netinet/bindconnect/bindconnect.c
531
err(1, "pthread_join connect %u", n);
regress/sys/netinet/bindconnect/bindconnect.c
537
for (n = 0; n < delroute_num; n++) {
regress/sys/netinet/bindconnect/bindconnect.c
540
errno = pthread_join(tdelroute[n], (void **)&count);
regress/sys/netinet/bindconnect/bindconnect.c
542
err(1, "pthread_join delroute %u", n);
regress/sys/netinet/mcast/mcrecv.c
148
n = recv(s, msg, sizeof(msg) - 1, 0);
regress/sys/netinet/mcast/mcrecv.c
149
if (n == -1)
regress/sys/netinet/mcast/mcrecv.c
151
msg[n] = '\0';
regress/sys/netinet/mcast/mcrecv.c
59
ssize_t n;
regress/sys/netinet/mcast/mcsend.c
147
n = send(s, msg, len, 0);
regress/sys/netinet/mcast/mcsend.c
148
if (n == -1)
regress/sys/netinet/mcast/mcsend.c
150
if ((size_t)n != len)
regress/sys/netinet/mcast/mcsend.c
151
errx(1, "send %zd", n);
regress/sys/netinet/mcast/mcsend.c
53
ssize_t n;
regress/sys/netinet/recvmsg/recvmsg.c
38
ssize_t n;
regress/sys/netinet/recvmsg/recvmsg.c
69
n = recvmsg(s, &msg, MSG_OOB);
regress/sys/netinet/recvmsg/recvmsg.c
70
assert(n == -1);
regress/sys/netinet/tcpthread/tcpthread.c
147
unsigned int n;
regress/sys/netinet/tcpthread/tcpthread.c
152
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
157
if (!connect_socket(&connect_socks[n], addr))
regress/sys/netinet/tcpthread/tcpthread.c
178
unsigned int n;
regress/sys/netinet/tcpthread/tcpthread.c
186
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
189
sock = accept4(listens[n], sa, &len, SOCK_NONBLOCK);
regress/sys/netinet/tcpthread/tcpthread.c
199
err(1, "%s: accept %d", __func__, listens[n]);
regress/sys/netinet/tcpthread/tcpthread.c
201
sa = &addrs[n].su_sa;
regress/sys/netinet/tcpthread/tcpthread.c
226
unsigned int n;
regress/sys/netinet/tcpthread/tcpthread.c
231
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
232
if (!accept_socket(&accept_socks[n], listen_socks,
regress/sys/netinet/tcpthread/tcpthread.c
233
&accept_tims[n], listen_addrs))
regress/sys/netinet/tcpthread/tcpthread.c
354
unsigned int n;
regress/sys/netinet/tcpthread/tcpthread.c
361
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
362
if (!accept_socket(&splice_accept_socks[n],
regress/sys/netinet/tcpthread/tcpthread.c
364
&splice_accept_tims[n], splice_listen_addrs))
regress/sys/netinet/tcpthread/tcpthread.c
367
sock = atomic_swap_uint(&splice_connect_socks[n], -1);
regress/sys/netinet/tcpthread/tcpthread.c
374
if (!connect_socket(&splice_connect_socks[n], addr)) {
regress/sys/netinet/tcpthread/tcpthread.c
377
&splice_accept_socks[n], -1);
regress/sys/netinet/tcpthread/tcpthread.c
388
accept_splice.sp_fd = splice_accept_socks[n];
regress/sys/netinet/tcpthread/tcpthread.c
389
connect_splice.sp_fd = splice_connect_socks[n];
regress/sys/netinet/tcpthread/tcpthread.c
410
&splice_accept_socks[n], -1);
regress/sys/netinet/tcpthread/tcpthread.c
418
&splice_connect_socks[n], -1);
regress/sys/netinet/tcpthread/tcpthread.c
515
unsigned int n;
regress/sys/netinet/tcpthread/tcpthread.c
611
for (n = 0; n < sock_num; n++)
regress/sys/netinet/tcpthread/tcpthread.c
612
listen_socks[n] = connect_socks[n] = accept_socks[n] = -1;
regress/sys/netinet/tcpthread/tcpthread.c
630
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
631
splice_listen_socks[n] = splice_accept_socks[n] =
regress/sys/netinet/tcpthread/tcpthread.c
632
splice_connect_socks[n] = -1;
regress/sys/netinet/tcpthread/tcpthread.c
644
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
650
listen_socks[n] = socket(af, SOCK_STREAM | SOCK_NONBLOCK,
regress/sys/netinet/tcpthread/tcpthread.c
652
if (listen_socks[n] < 0)
regress/sys/netinet/tcpthread/tcpthread.c
658
if (bind(listen_socks[n], sa, sa->sa_len) < 0)
regress/sys/netinet/tcpthread/tcpthread.c
660
len = sizeof(listen_addrs[n]);
regress/sys/netinet/tcpthread/tcpthread.c
661
if (getsockname(listen_socks[n], &listen_addrs[n].su_sa, &len)
regress/sys/netinet/tcpthread/tcpthread.c
664
if (listen(listen_socks[n], 128) < 0)
regress/sys/netinet/tcpthread/tcpthread.c
670
splice_listen_socks[n] = socket(af,
regress/sys/netinet/tcpthread/tcpthread.c
672
if (splice_listen_socks[n] < 0)
regress/sys/netinet/tcpthread/tcpthread.c
678
if (bind(splice_listen_socks[n], sa, sa->sa_len) < 0)
regress/sys/netinet/tcpthread/tcpthread.c
680
len = sizeof(splice_listen_addrs[n]);
regress/sys/netinet/tcpthread/tcpthread.c
681
if (getsockname(splice_listen_socks[n],
regress/sys/netinet/tcpthread/tcpthread.c
682
&splice_listen_addrs[n].su_sa, &len) < 0)
regress/sys/netinet/tcpthread/tcpthread.c
684
if (listen(splice_listen_socks[n], 128) < 0)
regress/sys/netinet/tcpthread/tcpthread.c
694
for (n = 0; n < connect_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
695
errno = pthread_create(&connect_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
698
err(1, "pthread_create connect %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
704
for (n = 0; n < accept_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
705
errno = pthread_create(&accept_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
708
err(1, "pthread_create accept %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
714
for (n = 0; n < send_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
715
errno = pthread_create(&send_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
718
err(1, "pthread_create send %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
724
for (n = 0; n < recv_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
725
errno = pthread_create(&recv_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
728
err(1, "pthread_create recv %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
734
for (n = 0; n < close_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
735
errno = pthread_create(&close_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
738
err(1, "pthread_create close %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
745
for (n = 0; n < splice_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
746
errno = pthread_create(&splice_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
749
err(1, "pthread_create splice %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
755
for (n = 0; n < unsplice_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
756
errno = pthread_create(&unsplice_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
759
err(1, "pthread_create unsplice %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
765
for (n = 0; n < drop_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
766
errno = pthread_create(&drop_thread[n], NULL,
regress/sys/netinet/tcpthread/tcpthread.c
769
err(1, "pthread_create drop %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
779
for (n = 0; n < connect_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
782
errno = pthread_join(connect_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
784
err(1, "pthread_join connect %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
790
for (n = 0; n < accept_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
793
errno = pthread_join(accept_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
795
err(1, "pthread_join accept %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
801
for (n = 0; n < send_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
804
errno = pthread_join(send_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
806
err(1, "pthread_join send %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
812
for (n = 0; n < recv_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
815
errno = pthread_join(recv_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
817
err(1, "pthread_join recv %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
823
for (n = 0; n < close_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
826
errno = pthread_join(close_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
828
err(1, "pthread_join close %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
835
for (n = 0; n < splice_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
838
errno = pthread_join(splice_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
840
err(1, "pthread_join splice %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
846
for (n = 0; n < unsplice_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
849
errno = pthread_join(unsplice_thread[n],
regress/sys/netinet/tcpthread/tcpthread.c
852
err(1, "pthread_join unsplice %u", n);
regress/sys/netinet/tcpthread/tcpthread.c
858
for (n = 0; n < drop_num; n++) {
regress/sys/netinet/tcpthread/tcpthread.c
861
errno = pthread_join(drop_thread[n], (void **)&count);
regress/sys/netinet/tcpthread/tcpthread.c
863
err(1, "pthread_join drop %u", n);
regress/sys/netinet/udpthread/udpthread.c
164
unsigned int n;
regress/sys/netinet/udpthread/udpthread.c
169
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
174
if (!connect_socket(&connect_socks[n], addr))
regress/sys/netinet/udpthread/udpthread.c
233
unsigned int n;
regress/sys/netinet/udpthread/udpthread.c
242
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
245
if (recvfrom(listens[n], buf, sizeof(buf), 0, sa, &len) < 0) {
regress/sys/netinet/udpthread/udpthread.c
250
err(1, "%s: recvfrom %d", __func__, listens[n]);
regress/sys/netinet/udpthread/udpthread.c
252
sock = bindconnect_socket(&addrs[n], &faddr);
regress/sys/netinet/udpthread/udpthread.c
277
unsigned int n;
regress/sys/netinet/udpthread/udpthread.c
282
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
283
if (!accept_socket(&accept_socks[n], listen_socks,
regress/sys/netinet/udpthread/udpthread.c
405
unsigned int n;
regress/sys/netinet/udpthread/udpthread.c
412
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
413
if (!accept_socket(&splice_accept_socks[n],
regress/sys/netinet/udpthread/udpthread.c
417
sock = atomic_swap_uint(&splice_connect_socks[n], -1);
regress/sys/netinet/udpthread/udpthread.c
424
if (!connect_socket(&splice_connect_socks[n], addr)) {
regress/sys/netinet/udpthread/udpthread.c
427
&splice_accept_socks[n], -1);
regress/sys/netinet/udpthread/udpthread.c
438
accept_splice.sp_fd = splice_accept_socks[n];
regress/sys/netinet/udpthread/udpthread.c
439
connect_splice.sp_fd = splice_connect_socks[n];
regress/sys/netinet/udpthread/udpthread.c
460
&splice_accept_socks[n], -1);
regress/sys/netinet/udpthread/udpthread.c
468
&splice_connect_socks[n], -1);
regress/sys/netinet/udpthread/udpthread.c
529
unsigned int n;
regress/sys/netinet/udpthread/udpthread.c
620
for (n = 0; n < sock_num; n++)
regress/sys/netinet/udpthread/udpthread.c
621
listen_socks[n] = connect_socks[n] = accept_socks[n] = -1;
regress/sys/netinet/udpthread/udpthread.c
636
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
637
splice_listen_socks[n] = splice_accept_socks[n] =
regress/sys/netinet/udpthread/udpthread.c
638
splice_connect_socks[n] = -1;
regress/sys/netinet/udpthread/udpthread.c
646
for (n = 0; n < sock_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
652
listen_socks[n] = socket(af, SOCK_DGRAM | SOCK_NONBLOCK,
regress/sys/netinet/udpthread/udpthread.c
654
if (listen_socks[n] < 0)
regress/sys/netinet/udpthread/udpthread.c
660
if (bind(listen_socks[n], sa, sa->sa_len) < 0)
regress/sys/netinet/udpthread/udpthread.c
662
len = sizeof(listen_addrs[n]);
regress/sys/netinet/udpthread/udpthread.c
663
if (getsockname(listen_socks[n], &listen_addrs[n].su_sa, &len)
regress/sys/netinet/udpthread/udpthread.c
672
if (setsockopt(listen_socks[n], SOL_SOCKET, SO_REUSEPORT,
regress/sys/netinet/udpthread/udpthread.c
679
splice_listen_socks[n] = socket(af,
regress/sys/netinet/udpthread/udpthread.c
681
if (splice_listen_socks[n] < 0)
regress/sys/netinet/udpthread/udpthread.c
687
if (bind(splice_listen_socks[n], sa, sa->sa_len) < 0)
regress/sys/netinet/udpthread/udpthread.c
689
len = sizeof(splice_listen_addrs[n]);
regress/sys/netinet/udpthread/udpthread.c
690
if (getsockname(splice_listen_socks[n],
regress/sys/netinet/udpthread/udpthread.c
691
&splice_listen_addrs[n].su_sa, &len) < 0)
regress/sys/netinet/udpthread/udpthread.c
695
if (setsockopt(splice_listen_socks[n], SOL_SOCKET,
regress/sys/netinet/udpthread/udpthread.c
707
for (n = 0; n < connect_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
708
errno = pthread_create(&connect_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
711
err(1, "pthread_create connect %u", n);
regress/sys/netinet/udpthread/udpthread.c
717
for (n = 0; n < accept_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
718
errno = pthread_create(&accept_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
721
err(1, "pthread_create accept %u", n);
regress/sys/netinet/udpthread/udpthread.c
727
for (n = 0; n < send_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
728
errno = pthread_create(&send_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
731
err(1, "pthread_create send %u", n);
regress/sys/netinet/udpthread/udpthread.c
737
for (n = 0; n < recv_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
738
errno = pthread_create(&recv_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
741
err(1, "pthread_create recv %u", n);
regress/sys/netinet/udpthread/udpthread.c
747
for (n = 0; n < close_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
748
errno = pthread_create(&close_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
751
err(1, "pthread_create close %u", n);
regress/sys/netinet/udpthread/udpthread.c
758
for (n = 0; n < splice_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
759
errno = pthread_create(&splice_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
762
err(1, "pthread_create splice %u", n);
regress/sys/netinet/udpthread/udpthread.c
768
for (n = 0; n < unsplice_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
769
errno = pthread_create(&unsplice_thread[n], NULL,
regress/sys/netinet/udpthread/udpthread.c
772
err(1, "pthread_create unsplice %u", n);
regress/sys/netinet/udpthread/udpthread.c
783
for (n = 0; n < connect_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
786
errno = pthread_join(connect_thread[n], (void **)&count);
regress/sys/netinet/udpthread/udpthread.c
788
err(1, "pthread_join connect %u", n);
regress/sys/netinet/udpthread/udpthread.c
794
for (n = 0; n < accept_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
797
errno = pthread_join(accept_thread[n], (void **)&count);
regress/sys/netinet/udpthread/udpthread.c
799
err(1, "pthread_join accept %u", n);
regress/sys/netinet/udpthread/udpthread.c
805
for (n = 0; n < send_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
808
errno = pthread_join(send_thread[n], (void **)&count);
regress/sys/netinet/udpthread/udpthread.c
810
err(1, "pthread_join send %u", n);
regress/sys/netinet/udpthread/udpthread.c
816
for (n = 0; n < recv_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
819
errno = pthread_join(recv_thread[n], (void **)&count);
regress/sys/netinet/udpthread/udpthread.c
821
err(1, "pthread_join recv %u", n);
regress/sys/netinet/udpthread/udpthread.c
827
for (n = 0; n < close_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
830
errno = pthread_join(close_thread[n], (void **)&count);
regress/sys/netinet/udpthread/udpthread.c
832
err(1, "pthread_join close %u", n);
regress/sys/netinet/udpthread/udpthread.c
839
for (n = 0; n < splice_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
842
errno = pthread_join(splice_thread[n], (void **)&count);
regress/sys/netinet/udpthread/udpthread.c
844
err(1, "pthread_join splice %u", n);
regress/sys/netinet/udpthread/udpthread.c
850
for (n = 0; n < unsplice_num; n++) {
regress/sys/netinet/udpthread/udpthread.c
853
errno = pthread_join(unsplice_thread[n],
regress/sys/netinet/udpthread/udpthread.c
856
err(1, "pthread_join unsplice %u", n);
regress/sys/netinet6/mcast6/mc6recv.c
155
n = recv(s, msg, sizeof(msg) - 1, 0);
regress/sys/netinet6/mcast6/mc6recv.c
156
if (n == -1)
regress/sys/netinet6/mcast6/mc6recv.c
158
msg[n] = '\0';
regress/sys/netinet6/mcast6/mc6recv.c
60
ssize_t n;
regress/sys/netinet6/mcast6/mc6send.c
150
n = send(s, msg, len, 0);
regress/sys/netinet6/mcast6/mc6send.c
151
if (n == -1)
regress/sys/netinet6/mcast6/mc6send.c
153
if ((size_t)n != len)
regress/sys/netinet6/mcast6/mc6send.c
154
errx(1, "send %zd", n);
regress/sys/netinet6/mcast6/mc6send.c
54
ssize_t n;
regress/sys/netinet6/rip6cksum/rip6cksum.c
142
int n;
regress/sys/netinet6/rip6cksum/rip6cksum.c
154
n = select(s + 1, &fds, NULL, NULL, &to);
regress/sys/netinet6/rip6cksum/rip6cksum.c
155
switch (n) {
regress/sys/netinet6/rip6cksum/rip6cksum.c
161
printf("selected %d\n", n);
regress/sys/nfs/mmap-sysctl-copyout.c
36
ssize_t n;
regress/sys/nfs/mmap-sysctl-copyout.c
46
if ((n = write(fd, &stats, len)) == -1)
regress/sys/nfs/mmap-sysctl-copyout.c
48
if ((size_t)n != len)
regress/sys/nfs/mmap-sysctl-copyout.c
49
errx(1, "write not %zu: %zd", len, n);
regress/sys/nfs/mmap-sysctl-copyout.c
75
if ((n = read(fd, &stats, len)) == -1)
regress/sys/nfs/mmap-sysctl-copyout.c
77
if ((size_t)n != len)
regress/sys/nfs/mmap-sysctl-copyout.c
78
errx(1, "read not %zu: %zd", len, n);
regress/sys/sys/tree/rb-linux/rb-linux.c
51
struct keynode *n = container_of(tmp, struct keynode, node);
regress/sys/sys/tree/rb-linux/rb-linux.c
52
if (elm->key < n->key)
regress/sys/sys/tree/rb-linux/rb-linux.c
54
else if (elm->key > n->key)
regress/sys/sys/tree/rb-linux/rb-linux.c
57
return n;
regress/sys/sys/tree/rb-linux/rb-linux.c
70
struct keynode *n = container_of(*tmp, struct keynode, node);
regress/sys/sys/tree/rb-linux/rb-linux.c
72
if (elm->key < n->key)
regress/sys/sys/tree/rb-linux/rb-linux.c
74
else if (elm->key > n->key)
regress/sys/sys/tree/rb-linux/rb-linux.c
77
return n;
regress/sys/sys/tree/rb/rb-test.c
880
print_helper(const struct node *n, int indent)
regress/sys/sys/tree/rb/rb-test.c
882
if (RB_RIGHT(n, node_link))
regress/sys/sys/tree/rb/rb-test.c
883
print_helper(RB_RIGHT(n, node_link), indent + 4);
regress/sys/sys/tree/rb/rb-test.c
885
indent, "", n->key, n->size, RB_RANK(tree, n),
regress/sys/sys/tree/rb/rb-test.c
886
_RB_GET_RDIFF(n, _RB_LDIR, node_link),
regress/sys/sys/tree/rb/rb-test.c
887
_RB_GET_RDIFF(n, _RB_RDIR, node_link));
regress/sys/sys/tree/rb/rb-test.c
888
if (RB_LEFT(n, node_link))
regress/sys/sys/tree/rb/rb-test.c
889
print_helper(RB_LEFT(n, node_link), indent + 4);
regress/sys/sys/tree/rb/rbt-test.c
879
print_helper(const struct node *n, int indent)
regress/sys/sys/tree/rb/rbt-test.c
881
if (RBT_RIGHT(n, node_link))
regress/sys/sys/tree/rb/rbt-test.c
882
print_helper(RBT_RIGHT(n, node_link), indent + 4);
regress/sys/sys/tree/rb/rbt-test.c
884
indent, "", n->key, n->size, RBT_RANK(tree, n),
regress/sys/sys/tree/rb/rbt-test.c
885
_RBT_GET_RDIFF(n, _RBT_LDIR, node_link),
regress/sys/sys/tree/rb/rbt-test.c
886
_RBT_GET_RDIFF(n, _RBT_RDIR, node_link));
regress/sys/sys/tree/rb/rbt-test.c
887
if (RBT_LEFT(n, node_link))
regress/sys/sys/tree/rb/rbt-test.c
888
print_helper(RBT_LEFT(n, node_link), indent + 4);
regress/sys/uvm/minherit_zero/minherit_zero.c
32
ismemset(const void *s, int c, size_t n)
regress/sys/uvm/minherit_zero/minherit_zero.c
37
for (i = 0; i < n; i++)
regress/sys/uvm/mmap_noreplace/mmap_noreplace.c
29
ismemset(void *b, int c, size_t n)
regress/sys/uvm/mmap_noreplace/mmap_noreplace.c
33
for (i = 0; i < n; i++)
regress/sys/uvm/vnode/vnode.c
107
int n;
regress/sys/uvm/vnode/vnode.c
109
n = snprintf(p, siz, "[%d] ", getpid());
regress/sys/uvm/vnode/vnode.c
110
if (n < 0 || n >= siz)
regress/sys/uvm/vnode/vnode.c
112
p += n;
regress/sys/uvm/vnode/vnode.c
113
siz -= n;
regress/sys/uvm/vnode/vnode.c
116
n = vsnprintf(p, siz, fmt, ap);
regress/sys/uvm/vnode/vnode.c
118
if (n < 0 || n >= siz)
regress/sys/uvm/vnode/vnode.c
120
p += n;
regress/sys/uvm/vnode/vnode.c
121
siz -= n;
regress/usr.bin/nc/util.c
118
ssize_t n;
regress/usr.bin/nc/util.c
120
n = recv(s, buf, sizeof(buf) - 1, 0);
regress/usr.bin/nc/util.c
121
if (n == -1)
regress/usr.bin/nc/util.c
123
if (n == 0) {
regress/usr.bin/nc/util.c
127
len = n;
regress/usr.bin/nc/util.c
147
ssize_t n;
regress/usr.bin/nc/util.c
152
n = recv(s, buf + off, sizeof(buf) - 1 - off, 0);
regress/usr.bin/nc/util.c
153
if (n == -1)
regress/usr.bin/nc/util.c
155
if (n == 0) {
regress/usr.bin/nc/util.c
159
len += n;
regress/usr.bin/nc/util.c
182
ssize_t n;
regress/usr.bin/nc/util.c
197
n = send(s, buf + off, len - off, 0);
regress/usr.bin/nc/util.c
198
if (n == -1)
regress/usr.bin/nc/util.c
200
off += n;
regress/usr.bin/ssh/modpipe.c
48
int n, m1, m2;
regress/usr.bin/ssh/modpipe.c
51
if ((n = sscanf(s, "%16[^:]%*[:]%llu%*[:]%i%*[:]%i",
regress/usr.bin/ssh/modpipe.c
55
if (n > 3)
regress/usr.bin/ssh/modpipe.c
62
if (n != 4)
regress/usr.bin/ssh/unittests/authopt/tests.c
68
size_t n;
regress/usr.bin/ssh/unittests/authopt/tests.c
72
for (n = 0; (cp2 = strsep(&cp, ",")) != NULL;) {
regress/usr.bin/ssh/unittests/authopt/tests.c
73
ret = recallocarray(ret, n, n + 1, sizeof(*ret));
regress/usr.bin/ssh/unittests/authopt/tests.c
77
ret[n++] = cp2;
regress/usr.bin/ssh/unittests/authopt/tests.c
80
*np = n;
regress/usr.bin/ssh/unittests/bitmap/tests.c
100
for (n = 0; n < ntests; n++) {
regress/usr.bin/ssh/unittests/bitmap/tests.c
101
ASSERT_INT_EQ(BN_is_bit_set(bn, n),
regress/usr.bin/ssh/unittests/bitmap/tests.c
102
bitmap_test_bit(b, n));
regress/usr.bin/ssh/unittests/bitmap/tests.c
108
for (n = 0; n < ntests; n++) {
regress/usr.bin/ssh/unittests/bitmap/tests.c
109
ASSERT_INT_EQ(bitmap_set_bit(b, n), 0);
regress/usr.bin/ssh/unittests/bitmap/tests.c
110
ASSERT_INT_EQ(BN_set_bit(bn, n), 1);
regress/usr.bin/ssh/unittests/bitmap/tests.c
124
for (n = 0; n < ntests; n++) {
regress/usr.bin/ssh/unittests/bitmap/tests.c
125
ASSERT_INT_EQ(BN_is_bit_set(bn, n),
regress/usr.bin/ssh/unittests/bitmap/tests.c
126
bitmap_test_bit(b, n));
regress/usr.bin/ssh/unittests/bitmap/tests.c
28
int i, j, k, n, ntests = DEFAULT_NTESTS;
regress/usr.bin/ssh/unittests/bitmap/tests.c
68
for (n = 0; n < ntests; n++) {
regress/usr.bin/ssh/unittests/bitmap/tests.c
69
ASSERT_INT_EQ(BN_is_bit_set(bn, n),
regress/usr.bin/ssh/unittests/bitmap/tests.c
70
bitmap_test_bit(b, n));
regress/usr.bin/ssh/unittests/bitmap/tests.c
87
for (n = len; n < (int)sizeof(bbuf); n++)
regress/usr.bin/ssh/unittests/bitmap/tests.c
88
ASSERT_U8_EQ(bbuf[n], 0xfc);
regress/usr.bin/ssh/unittests/hostkeys/test_iterate.c
129
prepare_expected(struct expected *expected, size_t n)
regress/usr.bin/ssh/unittests/hostkeys/test_iterate.c
133
for (i = 0; i < n; i++) {
regress/usr.bin/ssh/unittests/hostkeys/test_iterate.c
143
cleanup_expected(struct expected *expected, size_t n)
regress/usr.bin/ssh/unittests/hostkeys/test_iterate.c
147
for (i = 0; i < n; i++) {
regress/usr.bin/ssh/unittests/sshkey/common.c
77
const BIGNUM *n = NULL;
regress/usr.bin/ssh/unittests/sshkey/common.c
81
RSA_get0_key(EVP_PKEY_get0_RSA(k->pkey), &n, NULL, NULL);
regress/usr.bin/ssh/unittests/sshkey/common.c
82
return n;
regress/usr.bin/ssh/unittests/sshkey/test_sshkey.c
221
get_private(const char *n)
regress/usr.bin/ssh/unittests/sshkey/test_sshkey.c
226
b = load_file(n);
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
106
snprintf(s, n, "%s case %zu of %zu (bit: %zu)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
111
snprintf(s, n, "%s case %llu of %llu (bits: %zu, %zu)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
118
snprintf(s, n, "%s case %zu of %zu (byte: %zu)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
123
snprintf(s, n, "%s case %llu of %llu (bytes: %zu, %zu)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
130
snprintf(s, n, "%s case %zu of %zu (offset: %zu)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
135
snprintf(s, n, "%s case %zu of %zu (offset: %zu)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
141
snprintf(s, n, "%s case %llu of %llu (offset: %zu char: %c)\n",
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
74
fuzz_ntop(u_int n)
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
76
switch (n) {
regress/usr.bin/ssh/unittests/test_helper/fuzz.c
99
fuzz_fmt(struct fuzz *fuzz, char *s, size_t n)
regress/usr.bin/ssh/unittests/test_helper/test_helper.c
251
test_start(const char *n)
regress/usr.bin/ssh/unittests/test_helper/test_helper.c
254
assert((active_test_name = strdup(n)) != NULL);
regress/usr.bin/ssh/unittests/test_helper/test_helper.h
100
#define TEST_START(n) test_start(n)
regress/usr.bin/ssh/unittests/test_helper/test_helper.h
39
void test_start(const char *n);
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
36
ssize_t n;
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
72
n = read(0, buf, sizeof(buf));
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
73
if (n == -1)
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
75
if (n > 2 && strncmp(buf + n - 2, "\n\n", 2) == 0)
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
76
n--;
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
77
if (write(2, buf, n) != n)
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
79
if (n > 8 && strncmp(buf, "shutdown", 8) == 0)
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
83
n = read(fd, buf, sizeof(buf));
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
84
if (n == -1)
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
86
if (n > 0) {
regress/usr.sbin/bgpd/integrationtests/api-exabgp.c
87
if (write(1, buf, n) != n)
regress/usr.sbin/bgpd/unittests/rde_decide_test.c
229
size_t i, j, n;
regress/usr.sbin/bgpd/unittests/rde_decide_test.c
250
for (n = j = 0; j < nin; j++) {
regress/usr.sbin/bgpd/unittests/rde_decide_test.c
253
next[n++] = in[j];
regress/usr.sbin/bgpd/unittests/rde_decide_test.c
255
r |= test_evaluate(orig, next, n);
regress/usr.sbin/snmpd/agentx.c
1005
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1007
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
1014
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1015
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1021
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1022
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1035
size_t n;
regress/usr.sbin/snmpd/agentx.c
1053
n = agentx_read(s2, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1055
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN,
regress/usr.sbin/snmpd/agentx.c
1062
n = agentx_read(s1, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1063
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1069
n = agentx_read(s2, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1070
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1084
size_t n;
regress/usr.sbin/snmpd/agentx.c
1098
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1100
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
1112
size_t n;
regress/usr.sbin/snmpd/agentx.c
1128
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1130
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
1142
size_t n;
regress/usr.sbin/snmpd/agentx.c
1156
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1157
agentx_close_validate(__func__, repl, n, 0, REASONPROTOCOLERROR);
regress/usr.sbin/snmpd/agentx.c
1169
size_t n;
regress/usr.sbin/snmpd/agentx.c
1184
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1186
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1198
size_t n;
regress/usr.sbin/snmpd/agentx.c
1213
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1215
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1227
size_t n;
regress/usr.sbin/snmpd/agentx.c
1242
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1244
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
1256
size_t n;
regress/usr.sbin/snmpd/agentx.c
1271
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1273
agentx_response_validate(__func__, repl, n, NETWORK_BYTE_ORDER,
regress/usr.sbin/snmpd/agentx.c
1285
size_t n;
regress/usr.sbin/snmpd/agentx.c
129
size_t n;
regress/usr.sbin/snmpd/agentx.c
1299
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1301
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
1313
size_t n;
regress/usr.sbin/snmpd/agentx.c
1331
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1333
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
1345
size_t n;
regress/usr.sbin/snmpd/agentx.c
1363
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1365
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR, 0,
regress/usr.sbin/snmpd/agentx.c
1377
size_t n;
regress/usr.sbin/snmpd/agentx.c
1396
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1398
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
141
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1410
size_t n;
regress/usr.sbin/snmpd/agentx.c
1428
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
143
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
1430
agentx_close_validate(__func__, repl, n, 0, REASONPROTOCOLERROR);
regress/usr.sbin/snmpd/agentx.c
1441
size_t n;
regress/usr.sbin/snmpd/agentx.c
1459
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1461
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1473
size_t n;
regress/usr.sbin/snmpd/agentx.c
1491
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1493
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1505
size_t n;
regress/usr.sbin/snmpd/agentx.c
1523
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1525
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1537
size_t n;
regress/usr.sbin/snmpd/agentx.c
1553
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1554
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
156
size_t n;
regress/usr.sbin/snmpd/agentx.c
1566
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1567
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1580
size_t n;
regress/usr.sbin/snmpd/agentx.c
1601
n = agentx_read(s1, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1602
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1614
n = agentx_read(s2, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1615
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1629
size_t n;
regress/usr.sbin/snmpd/agentx.c
1645
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1646
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1659
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1660
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1673
size_t n;
regress/usr.sbin/snmpd/agentx.c
169
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1690
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1691
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1704
size_t n;
regress/usr.sbin/snmpd/agentx.c
171
agentx_response_validate(__func__, repl, n, NETWORK_BYTE_ORDER,
regress/usr.sbin/snmpd/agentx.c
1721
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1722
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1735
size_t n;
regress/usr.sbin/snmpd/agentx.c
1752
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1753
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1766
size_t n;
regress/usr.sbin/snmpd/agentx.c
1782
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1783
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1797
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1798
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1811
size_t n;
regress/usr.sbin/snmpd/agentx.c
1828
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1829
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1842
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1843
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1856
size_t n;
regress/usr.sbin/snmpd/agentx.c
1873
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1874
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1888
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1889
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
189
size_t n;
regress/usr.sbin/snmpd/agentx.c
1902
size_t n;
regress/usr.sbin/snmpd/agentx.c
1918
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1919
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1931
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1932
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1945
size_t n;
regress/usr.sbin/snmpd/agentx.c
1961
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1962
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1974
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
1975
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
1988
size_t n;
regress/usr.sbin/snmpd/agentx.c
2004
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2005
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2018
size_t n;
regress/usr.sbin/snmpd/agentx.c
2032
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2034
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
2046
size_t n;
regress/usr.sbin/snmpd/agentx.c
2064
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2066
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
2078
size_t n;
regress/usr.sbin/snmpd/agentx.c
2096
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2098
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2110
size_t n;
regress/usr.sbin/snmpd/agentx.c
213
size_t n;
regress/usr.sbin/snmpd/agentx.c
2130
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2132
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2144
size_t n;
regress/usr.sbin/snmpd/agentx.c
2168
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2170
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2182
size_t n;
regress/usr.sbin/snmpd/agentx.c
2204
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2206
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2218
size_t n;
regress/usr.sbin/snmpd/agentx.c
2238
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2240
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2252
size_t n;
regress/usr.sbin/snmpd/agentx.c
2274
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2276
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
228
n = agentx_read(s1, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2288
size_t n;
regress/usr.sbin/snmpd/agentx.c
229
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
2311
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2313
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2325
size_t n;
regress/usr.sbin/snmpd/agentx.c
2348
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2350
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
2362
size_t n;
regress/usr.sbin/snmpd/agentx.c
2389
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2391
agentx_response_validate(__func__, repl, n, 0, packetid,
regress/usr.sbin/snmpd/agentx.c
244
n = agentx_read(s2, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
246
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
263
size_t n;
regress/usr.sbin/snmpd/agentx.c
276
if ((n = agentx_read(s, repl, sizeof(repl), 1000)) != 0)
regress/usr.sbin/snmpd/agentx.c
2818
size_t n;
regress/usr.sbin/snmpd/agentx.c
2830
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2832
agentx_response_validate(__func__, repl, n,
regress/usr.sbin/snmpd/agentx.c
2846
size_t n;
regress/usr.sbin/snmpd/agentx.c
2856
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2858
agentx_response_validate(__func__, repl, n, 0, packetid, 0, 0, NULL, 0);
regress/usr.sbin/snmpd/agentx.c
2870
size_t n;
regress/usr.sbin/snmpd/agentx.c
2886
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
2888
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR, 0,
regress/usr.sbin/snmpd/agentx.c
290
size_t n;
regress/usr.sbin/snmpd/agentx.c
2900
size_t n;
regress/usr.sbin/snmpd/agentx.c
2921
message_add_uint8(struct message *msg, uint8_t n)
regress/usr.sbin/snmpd/agentx.c
2923
message_add(msg, &n, 1);
regress/usr.sbin/snmpd/agentx.c
2927
message_add_uint16(struct message *msg, uint16_t n)
regress/usr.sbin/snmpd/agentx.c
2930
n = htobe16(n);
regress/usr.sbin/snmpd/agentx.c
2932
n = htole16(n);
regress/usr.sbin/snmpd/agentx.c
2934
message_add(msg, &n, sizeof(n));
regress/usr.sbin/snmpd/agentx.c
2938
message_add_uint32(struct message *msg, uint32_t n)
regress/usr.sbin/snmpd/agentx.c
2941
n = htobe32(n);
regress/usr.sbin/snmpd/agentx.c
2943
n = htole32(n);
regress/usr.sbin/snmpd/agentx.c
2945
message_add(msg, &n, sizeof(n));
regress/usr.sbin/snmpd/agentx.c
2949
message_add_uint64(struct message *msg, uint64_t n)
regress/usr.sbin/snmpd/agentx.c
2952
n = htobe64(n);
regress/usr.sbin/snmpd/agentx.c
2954
n = htole64(n);
regress/usr.sbin/snmpd/agentx.c
2956
message_add(msg, &n, sizeof(n));
regress/usr.sbin/snmpd/agentx.c
304
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
306
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
3111
ssize_t n;
regress/usr.sbin/snmpd/agentx.c
3123
if ((n = read(s, buf, len)) == -1)
regress/usr.sbin/snmpd/agentx.c
3126
if (verbose && n != 0) {
regress/usr.sbin/snmpd/agentx.c
3128
for (i = 0; i < n; i++) {
regress/usr.sbin/snmpd/agentx.c
3137
return n;
regress/usr.sbin/snmpd/agentx.c
3158
ssize_t n;
regress/usr.sbin/snmpd/agentx.c
3179
if ((n = write(s, buf, len)) == -1)
regress/usr.sbin/snmpd/agentx.c
3181
buf += n;
regress/usr.sbin/snmpd/agentx.c
3182
len -= n;
regress/usr.sbin/snmpd/agentx.c
319
size_t n;
regress/usr.sbin/snmpd/agentx.c
332
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
334
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
347
size_t n;
regress/usr.sbin/snmpd/agentx.c
361
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
363
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
376
size_t n;
regress/usr.sbin/snmpd/agentx.c
389
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
391
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
404
size_t n;
regress/usr.sbin/snmpd/agentx.c
417
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
419
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
432
size_t n;
regress/usr.sbin/snmpd/agentx.c
445
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
447
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR, 0,
regress/usr.sbin/snmpd/agentx.c
459
size_t n;
regress/usr.sbin/snmpd/agentx.c
467
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
469
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
481
size_t n;
regress/usr.sbin/snmpd/agentx.c
493
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
495
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
507
size_t n;
regress/usr.sbin/snmpd/agentx.c
519
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
521
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
533
size_t n;
regress/usr.sbin/snmpd/agentx.c
546
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
548
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
560
size_t n;
regress/usr.sbin/snmpd/agentx.c
572
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
574
agentx_close_validate(__func__, repl, n, 0, REASONPROTOCOLERROR);
regress/usr.sbin/snmpd/agentx.c
585
size_t n;
regress/usr.sbin/snmpd/agentx.c
597
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
599
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
611
size_t n;
regress/usr.sbin/snmpd/agentx.c
623
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
625
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
637
size_t n;
regress/usr.sbin/snmpd/agentx.c
649
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
651
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
663
size_t n;
regress/usr.sbin/snmpd/agentx.c
675
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
677
agentx_response_validate(__func__, repl, n, 0,
regress/usr.sbin/snmpd/agentx.c
689
size_t n;
regress/usr.sbin/snmpd/agentx.c
701
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
703
agentx_response_validate(__func__, repl, n, NETWORK_BYTE_ORDER,
regress/usr.sbin/snmpd/agentx.c
727
size_t n;
regress/usr.sbin/snmpd/agentx.c
754
size_t n;
regress/usr.sbin/snmpd/agentx.c
765
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
767
agentx_response_validate(__func__, repl, n, 0, packetid, NOTOPEN, 0,
regress/usr.sbin/snmpd/agentx.c
779
size_t n;
regress/usr.sbin/snmpd/agentx.c
795
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
797
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
809
size_t n;
regress/usr.sbin/snmpd/agentx.c
825
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
827
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
839
size_t n;
regress/usr.sbin/snmpd/agentx.c
855
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
857
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
869
size_t n;
regress/usr.sbin/snmpd/agentx.c
885
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
887
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
899
size_t n;
regress/usr.sbin/snmpd/agentx.c
915
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
917
agentx_response_validate(__func__, repl, n, 0, packetid, NOAGENTXERROR,
regress/usr.sbin/snmpd/agentx.c
929
size_t n;
regress/usr.sbin/snmpd/agentx.c
945
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
947
agentx_response_validate(__func__, repl, n, 0, packetid, PARSEERROR,
regress/usr.sbin/snmpd/agentx.c
959
size_t n;
regress/usr.sbin/snmpd/agentx.c
975
n = agentx_read(s, repl, sizeof(repl), 1000);
regress/usr.sbin/snmpd/agentx.c
977
agentx_close_validate(__func__, repl, n, 0, REASONPROTOCOLERROR);
regress/usr.sbin/snmpd/agentx.c
988
size_t n;
regress/usr.sbin/snmpd/backend.c
1035
size_t n;
regress/usr.sbin/snmpd/backend.c
1051
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1052
agentx_get_handle(__func__, buf, n, 0, sessionid2, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1076
size_t n;
regress/usr.sbin/snmpd/backend.c
1094
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1095
agentx_get_handle(__func__, buf, n, 0, sessionid1, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1119
size_t n;
regress/usr.sbin/snmpd/backend.c
1137
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1138
agentx_get_handle(__func__, buf, n, 0, sessionid2, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
116
size_t n;
regress/usr.sbin/snmpd/backend.c
1162
size_t n;
regress/usr.sbin/snmpd/backend.c
1180
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1181
agentx_get_handle(__func__, buf, n, 0, sessionid2, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1204
size_t n;
regress/usr.sbin/snmpd/backend.c
1216
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1217
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1241
size_t n;
regress/usr.sbin/snmpd/backend.c
1260
n = agentx_read(ax_s1, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1261
agentx_get_handle(__func__, buf, n, 0, sessionid1, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1265
n = agentx_read(ax_s2, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1266
agentx_get_handle(__func__, buf, n, 0, sessionid2, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
128
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1287
size_t n;
regress/usr.sbin/snmpd/backend.c
129
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1299
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1300
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1323
size_t n;
regress/usr.sbin/snmpd/backend.c
1342
n = agentx_read(ax_s1, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1343
agentx_get_handle(__func__, buf, n, 0, sessionid1, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1347
n = agentx_read(ax_s2, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1348
agentx_get_handle(__func__, buf, n, 0, sessionid2, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1369
size_t n;
regress/usr.sbin/snmpd/backend.c
1387
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1388
agentx_get_handle(__func__, buf, n, 0, sessionid1, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1413
size_t n;
regress/usr.sbin/snmpd/backend.c
1427
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1428
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1454
size_t n;
regress/usr.sbin/snmpd/backend.c
1467
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1468
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1494
size_t n;
regress/usr.sbin/snmpd/backend.c
1506
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1507
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1533
size_t n;
regress/usr.sbin/snmpd/backend.c
154
size_t n;
regress/usr.sbin/snmpd/backend.c
1545
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1546
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1572
size_t n;
regress/usr.sbin/snmpd/backend.c
1585
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1586
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1613
size_t n;
regress/usr.sbin/snmpd/backend.c
1628
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1629
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
166
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
167
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
1670
size_t n;
regress/usr.sbin/snmpd/backend.c
1684
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1685
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
1713
size_t n;
regress/usr.sbin/snmpd/backend.c
1733
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1734
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange,
regress/usr.sbin/snmpd/backend.c
1762
size_t n;
regress/usr.sbin/snmpd/backend.c
1776
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1777
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
1805
size_t n;
regress/usr.sbin/snmpd/backend.c
1825
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1826
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange,
regress/usr.sbin/snmpd/backend.c
1854
size_t n;
regress/usr.sbin/snmpd/backend.c
1874
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1875
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange,
regress/usr.sbin/snmpd/backend.c
1903
size_t n;
regress/usr.sbin/snmpd/backend.c
191
size_t n;
regress/usr.sbin/snmpd/backend.c
1919
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1920
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
1948
size_t n;
regress/usr.sbin/snmpd/backend.c
1968
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
1969
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange,
regress/usr.sbin/snmpd/backend.c
1996
size_t n;
regress/usr.sbin/snmpd/backend.c
2010
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2011
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
203
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
204
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
2040
size_t n;
regress/usr.sbin/snmpd/backend.c
2054
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2055
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2085
size_t n;
regress/usr.sbin/snmpd/backend.c
2099
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2100
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2129
size_t n;
regress/usr.sbin/snmpd/backend.c
2144
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2145
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2179
size_t n;
regress/usr.sbin/snmpd/backend.c
2198
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2199
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange1,
regress/usr.sbin/snmpd/backend.c
2204
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2205
agentx_getnext_handle(__func__, buf, n, 0, sessionid2, &searchrange2,
regress/usr.sbin/snmpd/backend.c
2238
size_t n;
regress/usr.sbin/snmpd/backend.c
2257
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2258
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange1,
regress/usr.sbin/snmpd/backend.c
2263
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2264
agentx_getnext_handle(__func__, buf, n, 0, sessionid2, &searchrange2,
regress/usr.sbin/snmpd/backend.c
228
size_t n;
regress/usr.sbin/snmpd/backend.c
2297
size_t n;
regress/usr.sbin/snmpd/backend.c
2316
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2317
agentx_getnext_handle(__func__, buf, n, 0, sessionid2, &searchrange1,
regress/usr.sbin/snmpd/backend.c
2322
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2323
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange2,
regress/usr.sbin/snmpd/backend.c
2375
size_t n;
regress/usr.sbin/snmpd/backend.c
2387
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2388
agentx_getnext_handle(__func__, buf, n, 0, sessionid, searchrange,
regress/usr.sbin/snmpd/backend.c
240
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
241
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
2429
size_t n;
regress/usr.sbin/snmpd/backend.c
2451
n = agentx_read(ax_s1, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2452
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, &searchrange1,
regress/usr.sbin/snmpd/backend.c
2456
n = agentx_read(ax_s2, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2457
agentx_getnext_handle(__func__, buf, n, 0, sessionid2, &searchrange2,
regress/usr.sbin/snmpd/backend.c
2484
size_t n;
regress/usr.sbin/snmpd/backend.c
2501
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2502
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2529
size_t n;
regress/usr.sbin/snmpd/backend.c
2544
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2545
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2572
size_t n;
regress/usr.sbin/snmpd/backend.c
2589
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2590
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2617
size_t n;
regress/usr.sbin/snmpd/backend.c
2632
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2633
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
265
size_t n;
regress/usr.sbin/snmpd/backend.c
2662
size_t n;
regress/usr.sbin/snmpd/backend.c
2676
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2677
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2707
size_t n;
regress/usr.sbin/snmpd/backend.c
2721
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2722
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
2751
size_t n;
regress/usr.sbin/snmpd/backend.c
2766
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2767
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
277
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
278
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
2810
size_t n;
regress/usr.sbin/snmpd/backend.c
2825
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2826
agentx_getnext_handle(__func__, buf, n, 0, sessionid, searchrange,
regress/usr.sbin/snmpd/backend.c
2874
size_t n;
regress/usr.sbin/snmpd/backend.c
2889
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2890
agentx_getnext_handle(__func__, buf, n, 0, sessionid, searchrange,
regress/usr.sbin/snmpd/backend.c
2924
size_t n;
regress/usr.sbin/snmpd/backend.c
2945
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
2946
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, searchrange,
regress/usr.sbin/snmpd/backend.c
2980
size_t n;
regress/usr.sbin/snmpd/backend.c
2998
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3000
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, searchrange,
regress/usr.sbin/snmpd/backend.c
3004
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
301
size_t n;
regress/usr.sbin/snmpd/backend.c
3010
agentx_getnext_handle(__func__, buf, n, 0, sessionid2, searchrange,
regress/usr.sbin/snmpd/backend.c
3041
size_t n;
regress/usr.sbin/snmpd/backend.c
3062
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3063
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, searchrange,
regress/usr.sbin/snmpd/backend.c
3094
size_t n;
regress/usr.sbin/snmpd/backend.c
3115
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3116
agentx_getnext_handle(__func__, buf, n, 0, sessionid1, searchrange,
regress/usr.sbin/snmpd/backend.c
3144
size_t n, nvarbind = nitems(ax_request), nout;
regress/usr.sbin/snmpd/backend.c
3158
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3159
nout = agentx_getbulk_handle(__func__, buf, n, 0,
regress/usr.sbin/snmpd/backend.c
316
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
317
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3194
size_t n, nvarbind = nitems(ax_request), nout;
regress/usr.sbin/snmpd/backend.c
3208
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3209
nout = agentx_getbulk_handle(__func__, buf, n, 0,
regress/usr.sbin/snmpd/backend.c
3250
size_t n, nvarbind = nitems(ax_request), nout;
regress/usr.sbin/snmpd/backend.c
3264
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3265
nout = agentx_getbulk_handle(__func__, buf, n, 0,
regress/usr.sbin/snmpd/backend.c
3311
size_t n, nvarbind = nitems(ax_request), nout;
regress/usr.sbin/snmpd/backend.c
3325
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3326
nout = agentx_getbulk_handle(__func__, buf, n, 0,
regress/usr.sbin/snmpd/backend.c
3381
size_t n, nvarbind = nitems(ax_request), nout;
regress/usr.sbin/snmpd/backend.c
3395
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3396
nout = agentx_getbulk_handle(__func__, buf, n, 0,
regress/usr.sbin/snmpd/backend.c
3426
size_t n, nvarbind = nitems(ax_request), nout;
regress/usr.sbin/snmpd/backend.c
3461
size_t n;
regress/usr.sbin/snmpd/backend.c
3475
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3476
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
350
size_t n;
regress/usr.sbin/snmpd/backend.c
3511
size_t n;
regress/usr.sbin/snmpd/backend.c
3525
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3526
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
3531
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3532
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange,
regress/usr.sbin/snmpd/backend.c
3579
size_t n;
regress/usr.sbin/snmpd/backend.c
3594
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3595
agentx_getnext_handle(__func__, buf, n, 0, sessionid, searchrange,
regress/usr.sbin/snmpd/backend.c
3599
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3600
agentx_getnext_handle(__func__, buf, n, 0, sessionid, &searchrange[1],
regress/usr.sbin/snmpd/backend.c
362
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3622
size_t n;
regress/usr.sbin/snmpd/backend.c
363
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3634
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3635
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3657
size_t n;
regress/usr.sbin/snmpd/backend.c
3669
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3670
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3692
size_t n;
regress/usr.sbin/snmpd/backend.c
3704
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3705
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3727
size_t n;
regress/usr.sbin/snmpd/backend.c
3739
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3740
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3762
size_t n;
regress/usr.sbin/snmpd/backend.c
3774
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3775
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3797
size_t n;
regress/usr.sbin/snmpd/backend.c
3809
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3810
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3832
size_t n;
regress/usr.sbin/snmpd/backend.c
3844
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3845
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
386
size_t n;
regress/usr.sbin/snmpd/backend.c
3867
size_t n;
regress/usr.sbin/snmpd/backend.c
3879
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3880
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3902
size_t n;
regress/usr.sbin/snmpd/backend.c
3914
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3915
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3937
size_t n;
regress/usr.sbin/snmpd/backend.c
3949
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3950
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
3972
size_t n;
regress/usr.sbin/snmpd/backend.c
398
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3984
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
3985
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
399
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4007
size_t n;
regress/usr.sbin/snmpd/backend.c
4019
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4020
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4042
size_t n;
regress/usr.sbin/snmpd/backend.c
4054
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4055
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4077
size_t n;
regress/usr.sbin/snmpd/backend.c
4089
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4090
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
41
size_t n;
regress/usr.sbin/snmpd/backend.c
4112
size_t n;
regress/usr.sbin/snmpd/backend.c
4124
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4125
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4147
size_t n;
regress/usr.sbin/snmpd/backend.c
4159
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4160
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4182
size_t n;
regress/usr.sbin/snmpd/backend.c
4194
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4195
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4217
size_t n;
regress/usr.sbin/snmpd/backend.c
422
size_t n;
regress/usr.sbin/snmpd/backend.c
4229
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4230
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4252
size_t n;
regress/usr.sbin/snmpd/backend.c
4264
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4265
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4287
size_t n;
regress/usr.sbin/snmpd/backend.c
4299
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4300
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4322
size_t n;
regress/usr.sbin/snmpd/backend.c
4334
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4335
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
434
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
435
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4357
size_t n;
regress/usr.sbin/snmpd/backend.c
4369
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4370
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4392
size_t n;
regress/usr.sbin/snmpd/backend.c
4404
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4405
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4427
size_t n;
regress/usr.sbin/snmpd/backend.c
4439
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4440
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4462
size_t n;
regress/usr.sbin/snmpd/backend.c
4474
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4475
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4497
size_t n;
regress/usr.sbin/snmpd/backend.c
4509
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4510
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4532
size_t n;
regress/usr.sbin/snmpd/backend.c
4544
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4545
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4567
size_t n;
regress/usr.sbin/snmpd/backend.c
4579
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
458
size_t n;
regress/usr.sbin/snmpd/backend.c
4580
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4602
size_t n;
regress/usr.sbin/snmpd/backend.c
4614
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4615
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4637
size_t n;
regress/usr.sbin/snmpd/backend.c
4649
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4650
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4672
size_t n;
regress/usr.sbin/snmpd/backend.c
4684
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4685
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
470
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4707
size_t n;
regress/usr.sbin/snmpd/backend.c
471
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4720
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4721
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4743
size_t n;
regress/usr.sbin/snmpd/backend.c
4756
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4757
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4779
size_t n;
regress/usr.sbin/snmpd/backend.c
4792
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4793
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4815
size_t n;
regress/usr.sbin/snmpd/backend.c
4828
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4829
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4851
size_t n;
regress/usr.sbin/snmpd/backend.c
4864
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4865
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4887
size_t n;
regress/usr.sbin/snmpd/backend.c
4900
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4901
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4923
size_t n;
regress/usr.sbin/snmpd/backend.c
4936
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4937
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4959
size_t n;
regress/usr.sbin/snmpd/backend.c
4972
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
4973
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
4995
size_t n;
regress/usr.sbin/snmpd/backend.c
5008
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5009
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5031
size_t n;
regress/usr.sbin/snmpd/backend.c
5044
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5045
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5067
size_t n;
regress/usr.sbin/snmpd/backend.c
5080
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5081
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5103
size_t n;
regress/usr.sbin/snmpd/backend.c
5116
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5117
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5139
size_t n;
regress/usr.sbin/snmpd/backend.c
515
size_t n;
regress/usr.sbin/snmpd/backend.c
5152
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5153
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5175
size_t n;
regress/usr.sbin/snmpd/backend.c
5188
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5189
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5211
size_t n;
regress/usr.sbin/snmpd/backend.c
5224
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5225
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5247
size_t n;
regress/usr.sbin/snmpd/backend.c
5260
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5261
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
527
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
528
agentx_get_handle(__func__, buf, n, 0, sessionid, varbind_ax, 2);
regress/usr.sbin/snmpd/backend.c
5283
size_t n;
regress/usr.sbin/snmpd/backend.c
5296
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5297
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
53
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5319
size_t n;
regress/usr.sbin/snmpd/backend.c
5332
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5333
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5355
size_t n;
regress/usr.sbin/snmpd/backend.c
5368
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5369
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5391
size_t n;
regress/usr.sbin/snmpd/backend.c
54
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5404
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5405
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5427
size_t n;
regress/usr.sbin/snmpd/backend.c
5440
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5441
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5463
size_t n;
regress/usr.sbin/snmpd/backend.c
5476
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5477
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5499
size_t n;
regress/usr.sbin/snmpd/backend.c
5512
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5513
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5535
size_t n;
regress/usr.sbin/snmpd/backend.c
5548
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5549
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5571
size_t n;
regress/usr.sbin/snmpd/backend.c
5584
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5585
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
559
size_t n;
regress/usr.sbin/snmpd/backend.c
5607
size_t n;
regress/usr.sbin/snmpd/backend.c
5620
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5621
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5643
size_t n;
regress/usr.sbin/snmpd/backend.c
5656
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5657
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5679
size_t n;
regress/usr.sbin/snmpd/backend.c
5692
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5693
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5715
size_t n;
regress/usr.sbin/snmpd/backend.c
5728
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5729
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5751
size_t n;
regress/usr.sbin/snmpd/backend.c
5764
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5765
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5787
size_t n;
regress/usr.sbin/snmpd/backend.c
579
n = agentx_read(ax_s1, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
580
agentx_get_handle(__func__, buf, n, 0, sessionid1, varbind, 1);
regress/usr.sbin/snmpd/backend.c
5800
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5801
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5823
size_t n;
regress/usr.sbin/snmpd/backend.c
583
n = agentx_read(ax_s2, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5836
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5837
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
584
agentx_get_handle(__func__, buf, n, 0, sessionid2, varbind + 1, 1);
regress/usr.sbin/snmpd/backend.c
5860
size_t n;
regress/usr.sbin/snmpd/backend.c
5873
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5874
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
5878
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
5879
agentx_getnext_handle(__func__, buf, n, 0, sessionid, NULL, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
623
size_t n;
regress/usr.sbin/snmpd/backend.c
635
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
636
agentx_get_handle(__func__, buf, n, 0, sessionid, varbind_ax, 2);
regress/usr.sbin/snmpd/backend.c
679
size_t n;
regress/usr.sbin/snmpd/backend.c
691
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
692
agentx_get_handle(__func__, buf, n, 0, sessionid, varbind_ax, 2);
regress/usr.sbin/snmpd/backend.c
737
size_t n;
regress/usr.sbin/snmpd/backend.c
749
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
750
agentx_get_handle(__func__, buf, n, 0, sessionid, varbind_ax, 2);
regress/usr.sbin/snmpd/backend.c
772
size_t n;
regress/usr.sbin/snmpd/backend.c
784
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
785
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
79
size_t n;
regress/usr.sbin/snmpd/backend.c
808
size_t n;
regress/usr.sbin/snmpd/backend.c
839
size_t n;
regress/usr.sbin/snmpd/backend.c
878
size_t n;
regress/usr.sbin/snmpd/backend.c
91
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/backend.c
917
size_t n;
regress/usr.sbin/snmpd/backend.c
92
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/backend.c
956
size_t n;
regress/usr.sbin/snmpd/backend.c
995
size_t n;
regress/usr.sbin/snmpd/snmp.c
150
size_t n;
regress/usr.sbin/snmpd/snmp.c
162
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/snmp.c
164
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/snmp.c
314
ssize_t n;
regress/usr.sbin/snmpd/snmp.c
326
if ((n = read(s, buf + ntot, *buflen - ntot)) == -1)
regress/usr.sbin/snmpd/snmp.c
328
ntot += n;
regress/usr.sbin/snmpd/snmp.c
338
*buflen = n;
regress/usr.sbin/snmpd/transport.c
106
size_t n;
regress/usr.sbin/snmpd/transport.c
141
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/transport.c
142
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/transport.c
147
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/transport.c
148
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/transport.c
30
size_t n;
regress/usr.sbin/snmpd/transport.c
42
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/transport.c
43
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/snmpd/transport.c
67
size_t n;
regress/usr.sbin/snmpd/transport.c
81
n = agentx_read(ax_s, buf, sizeof(buf), 1000);
regress/usr.sbin/snmpd/transport.c
82
agentx_get_handle(__func__, buf, n, 0, sessionid, &varbind, 1);
regress/usr.sbin/syslogd/ttylog.c
124
while ((n = read(mfd, buf, sizeof(buf))) > 0) {
regress/usr.sbin/syslogd/ttylog.c
128
if (fwrite(buf, 1, n, lg) != (size_t)n)
regress/usr.sbin/syslogd/ttylog.c
130
if (buf[n-1] != '\n')
regress/usr.sbin/syslogd/ttylog.c
137
if (n < 0)
regress/usr.sbin/syslogd/ttylog.c
216
ssize_t n;
regress/usr.sbin/syslogd/ttylog.c
223
while ((n = read(mfd, buf, sizeof(buf))) > 0) {
regress/usr.sbin/syslogd/ttylog.c
225
if (fwrite(buf, 1, n, lg) != (size_t)n)
regress/usr.sbin/syslogd/ttylog.c
227
if (buf[n-1] != '\n')
regress/usr.sbin/syslogd/ttylog.c
230
if (n < 0 && errno != EAGAIN)
regress/usr.sbin/syslogd/ttylog.c
233
if ((n = read(0, buf, sizeof(buf))) < 0)
regress/usr.sbin/syslogd/ttylog.c
236
if (n > 0)
regress/usr.sbin/syslogd/ttylog.c
237
errx(3, "read stdin %zd bytes", n);
regress/usr.sbin/syslogd/ttylog.c
60
ssize_t n;
sbin/atactl/atactl.c
1442
int i, n, nerr;
sbin/atactl/atactl.c
1462
n = 0;
sbin/atactl/atactl.c
1464
printf("Error %d:\n", n + 1);
sbin/atactl/atactl.c
1468
} while (++n < (nerr > 5 ? 5 : nerr));
sbin/atactl/atactl.c
1472
int i, n, nerr, nsect;
sbin/atactl/atactl.c
1507
n = 0;
sbin/atactl/atactl.c
1511
printf("Error %d:\n", n + 1);
sbin/atactl/atactl.c
1518
} while (++n < nerr);
sbin/atactl/atactl.c
1521
int i, n;
sbin/atactl/atactl.c
1533
n = 0;
sbin/atactl/atactl.c
1538
printf("Test %d\n", n + 1);
sbin/atactl/atactl.c
1556
} while (++n < 21);
sbin/dhcp6leased/control.c
230
ssize_t n;
sbin/dhcp6leased/control.c
252
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
sbin/dhcp6leased/control.c
256
if (n == 0)
sbin/dhcp6leased/dhcp6leased.c
426
ssize_t n;
sbin/dhcp6leased/dhcp6leased.c
434
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcp6leased/dhcp6leased.c
436
if (n == 0) /* Connection closed. */
sbin/dhcp6leased/dhcp6leased.c
449
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcp6leased/dhcp6leased.c
451
if (n == 0) /* No more messages. */
sbin/dhcp6leased/dhcp6leased.c
506
ssize_t n;
sbin/dhcp6leased/dhcp6leased.c
512
if ((n = imsgbuf_read(ibuf)) == -1 && errno != EAGAIN)
sbin/dhcp6leased/dhcp6leased.c
514
if (n == 0) /* Connection closed. */
sbin/dhcp6leased/dhcp6leased.c
527
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcp6leased/dhcp6leased.c
529
if (n == 0) /* No more messages. */
sbin/dhcp6leased/engine.c
279
ssize_t n;
sbin/dhcp6leased/engine.c
285
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcp6leased/engine.c
287
if (n == 0) /* Connection closed. */
sbin/dhcp6leased/engine.c
300
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcp6leased/engine.c
302
if (n == 0) /* No more messages. */
sbin/dhcp6leased/engine.c
390
ssize_t n;
sbin/dhcp6leased/engine.c
394
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcp6leased/engine.c
396
if (n == 0) /* Connection closed. */
sbin/dhcp6leased/engine.c
409
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcp6leased/engine.c
411
if (n == 0) /* No more messages. */
sbin/dhcp6leased/frontend.c
244
ssize_t n;
sbin/dhcp6leased/frontend.c
248
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcp6leased/frontend.c
250
if (n == 0) /* Connection closed. */
sbin/dhcp6leased/frontend.c
263
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcp6leased/frontend.c
265
if (n == 0) /* No more messages. */
sbin/dhcp6leased/frontend.c
461
ssize_t n;
sbin/dhcp6leased/frontend.c
465
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcp6leased/frontend.c
467
if (n == 0) /* Connection closed. */
sbin/dhcp6leased/frontend.c
480
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcp6leased/frontend.c
482
if (n == 0) /* No more messages. */
sbin/dhcp6leased/frontend.c
634
ssize_t n;
sbin/dhcp6leased/frontend.c
642
if ((n = read(fd, buf, ROUTE_SOCKET_BUF_SIZE)) == -1) {
sbin/dhcp6leased/frontend.c
649
if (n == 0)
sbin/dhcp6leased/frontend.c
652
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
sbin/dhcp6leased/frontend.c
653
log_warnx("partial rtm of %zd in buffer", n);
sbin/dhcp6leased/parse.y
703
size_t n;
sbin/dhcp6leased/parse.y
713
n = strlcpy(iface->name, name, sizeof(iface->name));
sbin/dhcp6leased/parse.y
714
if (n >= sizeof(iface->name))
sbin/dhcp6leased/parse.y
728
size_t n;
sbin/dhcp6leased/parse.y
744
n = strlcpy(iface_pd->name, name, sizeof(iface_pd->name));
sbin/dhcp6leased/parse.y
745
if (n >= sizeof(iface_pd->name))
sbin/dhcpleased/control.c
230
ssize_t n;
sbin/dhcpleased/control.c
254
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
sbin/dhcpleased/control.c
258
if (n == 0)
sbin/dhcpleased/dhcpleased.c
441
ssize_t n;
sbin/dhcpleased/dhcpleased.c
451
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcpleased/dhcpleased.c
453
if (n == 0) /* Connection closed. */
sbin/dhcpleased/dhcpleased.c
466
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcpleased/dhcpleased.c
468
if (n == 0) /* No more messages. */
sbin/dhcpleased/dhcpleased.c
526
ssize_t n;
sbin/dhcpleased/dhcpleased.c
533
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcpleased/dhcpleased.c
535
if (n == 0) /* Connection closed. */
sbin/dhcpleased/dhcpleased.c
548
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcpleased/dhcpleased.c
550
if (n == 0) /* No more messages. */
sbin/dhcpleased/engine.c
290
ssize_t n;
sbin/dhcpleased/engine.c
298
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcpleased/engine.c
300
if (n == 0) /* Connection closed. */
sbin/dhcpleased/engine.c
313
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcpleased/engine.c
315
if (n == 0) /* No more messages. */
sbin/dhcpleased/engine.c
410
ssize_t n;
sbin/dhcpleased/engine.c
415
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcpleased/engine.c
417
if (n == 0) /* Connection closed. */
sbin/dhcpleased/engine.c
430
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcpleased/engine.c
432
if (n == 0) /* No more messages. */
sbin/dhcpleased/frontend.c
242
ssize_t n;
sbin/dhcpleased/frontend.c
247
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcpleased/frontend.c
249
if (n == 0) /* Connection closed. */
sbin/dhcpleased/frontend.c
262
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcpleased/frontend.c
264
if (n == 0) /* No more messages. */
sbin/dhcpleased/frontend.c
482
ssize_t n;
sbin/dhcpleased/frontend.c
487
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/dhcpleased/frontend.c
489
if (n == 0) /* Connection closed. */
sbin/dhcpleased/frontend.c
502
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/dhcpleased/frontend.c
504
if (n == 0) /* No more messages. */
sbin/dhcpleased/frontend.c
760
ssize_t n;
sbin/dhcpleased/frontend.c
768
if ((n = read(fd, buf, ROUTE_SOCKET_BUF_SIZE)) == -1) {
sbin/dhcpleased/frontend.c
775
if (n == 0)
sbin/dhcpleased/frontend.c
778
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
sbin/dhcpleased/frontend.c
779
log_warnx("partial rtm of %zd in buffer", n);
sbin/dhcpleased/parse.y
845
size_t n;
sbin/dhcpleased/parse.y
855
n = strlcpy(iface->name, name, sizeof(iface->name));
sbin/dhcpleased/parse.y
856
if (n >= sizeof(iface->name))
sbin/disklabel/disklabel.c
925
#define NXTNUM(n, field, errstr) { \
sbin/disklabel/disklabel.c
931
cp = tp, tp = word(cp), (n) = GETNUM(field, cp, 0, errstr); \
sbin/disklabel/editor.c
1932
apply_unit(double val, u_char unit, u_int64_t *n)
sbin/disklabel/editor.c
1956
*n = val;
sbin/disklabel/editor.c
2016
parse_pct(char *buf, int *n)
sbin/disklabel/editor.c
2022
*n = strtonum(buf, 0, 100, &errstr);
sbin/disklabel/editor.c
960
int n;
sbin/disklabel/editor.c
974
n = strlen(buf);
sbin/disklabel/editor.c
975
if (n > 0 && buf[n-1] == '\n')
sbin/disklabel/editor.c
976
buf[--n] = '\0';
sbin/dump/dumprmt.c
200
int n, i, cc;
sbin/dump/dumprmt.c
203
n = rmtcall("read", line);
sbin/dump/dumprmt.c
204
if (n < 0) {
sbin/dump/dumprmt.c
205
errno = n;
sbin/dump/dumprmt.c
208
for (i = 0; i < n; i += cc) {
sbin/dump/dumprmt.c
209
cc = read(rmtape, buf+i, n - i);
sbin/dump/dumprmt.c
214
return (n);
sbin/dump/main.c
446
ssize_t n = pread(diskfd, sblock, SBLOCKSIZE,
sbin/dump/main.c
448
if (n == SBLOCKSIZE && (sblock->fs_magic == FS_UFS1_MAGIC ||
sbin/dumpfs/dumpfs.c
127
ssize_t n;
sbin/dumpfs/dumpfs.c
137
n = pread(fd, &afs, SBLOCKSIZE, (off_t)sbtry[i]);
sbin/dumpfs/dumpfs.c
138
if (n == SBLOCKSIZE && (afs.fs_magic == FS_UFS1_MAGIC ||
sbin/fdisk/cmd.c
434
unsigned int i, n;
sbin/fdisk/cmd.c
436
for (i = 0, n = 0; i < nitems(mbr->mbr_prt); i++)
sbin/fdisk/cmd.c
438
n++;
sbin/fdisk/cmd.c
439
if (n > 1) {
sbin/fdisk/misc.c
130
size_t n;
sbin/fdisk/misc.c
157
n = strlen(buf);
sbin/fdisk/misc.c
158
switch (tolower((unsigned char)buf[n-1])) {
sbin/fdisk/misc.c
162
buf[--n] = '\0';
sbin/fdisk/misc.c
167
buf[--n] = '\0';
sbin/fdisk/misc.c
172
buf[--n] = '\0';
sbin/fdisk/misc.c
180
buf[--n] = '\0';
sbin/fdisk/misc.c
185
buf[--n] = '\0';
sbin/fdisk/misc.c
190
buf[--n] = '\0';
sbin/fdisk/misc.c
195
buf[--n] = '\0';
sbin/fdisk/misc.c
71
size_t n;
sbin/fdisk/misc.c
81
n = strlcpy(buf, line, buflen);
sbin/fdisk/misc.c
89
n = strlcpy(buf, line + strspn(line, WHITESPACE), buflen);
sbin/fdisk/misc.c
93
if (n >= buflen) {
sbin/fdisk/part.c
886
nth_menu_item(int (*test)(const unsigned int), unsigned int n)
sbin/fdisk/part.c
892
if (n == 0)
sbin/fdisk/part.c
894
n--;
sbin/fsck/fsutil.c
258
ereallocarray(void *p, size_t n, size_t s)
sbin/fsck/fsutil.c
262
if (n == 0 || s == 0) {
sbin/fsck/fsutil.c
266
newp = reallocarray(p, n, s);
sbin/fsck_ext2fs/dir.c
113
int dsize, n;
sbin/fsck_ext2fs/dir.c
138
if ((n = (*idesc->id_func)(idesc)) & ALTERED) {
sbin/fsck_ext2fs/dir.c
145
if (n & STOP) {
sbin/fsck_ext2fs/dir.c
147
return (n);
sbin/fsck_ext2fs/inode.c
118
long ret, n, ndb;
sbin/fsck_ext2fs/inode.c
168
for (ap = &dino.e2di_blocks[NDADDR], n = 1; n <= NIADDR; ap++, n++) {
sbin/fsck_ext2fs/inode.c
171
ret = iblock(idesc, n, remsize);
sbin/fsck_ext2fs/inode.c
205
int i, n, (*func)(struct inodesc *), nif;
sbin/fsck_ext2fs/inode.c
213
if (((n = (*func)(idesc)) & KEEPON) == 0)
sbin/fsck_ext2fs/inode.c
214
return (n);
sbin/fsck_ext2fs/inode.c
248
n = (*func)(idesc);
sbin/fsck_ext2fs/inode.c
250
n = iblock(idesc, ilevel, isize);
sbin/fsck_ext2fs/inode.c
251
if (n & STOP) {
sbin/fsck_ext2fs/inode.c
253
return (n);
sbin/fsck_ext2fs/pass2.c
196
int n, entrysize, ret = 0;
sbin/fsck_ext2fs/pass2.c
247
n = letoh16(dirp->e2d_reclen) - entrysize;
sbin/fsck_ext2fs/pass2.c
253
memset(dirp, 0, (size_t)n);
sbin/fsck_ext2fs/pass2.c
254
dirp->e2d_reclen = htole16(n);
sbin/fsck_ext2fs/pass2.c
272
n = EXT2FS_DIRSIZ(dirp->e2d_namlen);
sbin/fsck_ext2fs/pass2.c
273
if (letoh16(dirp->e2d_reclen) < n + entrysize)
sbin/fsck_ext2fs/pass2.c
275
proto.e2d_reclen = htole16(letoh16(dirp->e2d_reclen) - n);
sbin/fsck_ext2fs/pass2.c
276
dirp->e2d_reclen = htole16(n);
sbin/fsck_ext2fs/pass2.c
279
dirp = (struct ext2fs_direct *)((char *)(dirp) + n);
sbin/fsck_ext2fs/pass2.c
345
n = 0;
sbin/fsck_ext2fs/pass2.c
350
n = reply("REMOVE");
sbin/fsck_ext2fs/pass2.c
358
n = reply("REMOVE");
sbin/fsck_ext2fs/pass2.c
370
n = 1;
sbin/fsck_ext2fs/pass2.c
374
if ((n = reply("REMOVE")) == 1)
sbin/fsck_ext2fs/pass2.c
395
else if ((n = reply("REMOVE")) == 1)
sbin/fsck_ext2fs/pass2.c
425
if (n == 0)
sbin/fsck_ext2fs/pass4.c
52
int n;
sbin/fsck_ext2fs/pass4.c
65
n = lncntp[inumber];
sbin/fsck_ext2fs/pass4.c
66
if (n)
sbin/fsck_ext2fs/pass4.c
67
adjust(&idesc, (short)n);
sbin/fsck_ffs/dir.c
116
if ((n = (*idesc->id_func)(idesc)) & ALTERED) {
sbin/fsck_ffs/dir.c
123
if (n & STOP)
sbin/fsck_ffs/dir.c
124
return (n);
sbin/fsck_ffs/dir.c
97
int dsize, n;
sbin/fsck_ffs/inode.c
154
int i, n, (*func)(struct inodesc *), nif;
sbin/fsck_ffs/inode.c
162
if (((n = (*func)(idesc)) & KEEPON) == 0)
sbin/fsck_ffs/inode.c
163
return (n);
sbin/fsck_ffs/inode.c
196
n = (*func)(idesc);
sbin/fsck_ffs/inode.c
198
n = iblock(idesc, ilevel, isize);
sbin/fsck_ffs/inode.c
199
if (n & STOP) {
sbin/fsck_ffs/inode.c
201
return (n);
sbin/fsck_ffs/pass2.c
249
int n, entrysize, ret = 0;
sbin/fsck_ffs/pass2.c
293
n = dirp->d_reclen - entrysize;
sbin/fsck_ffs/pass2.c
299
memset(dirp, 0, (size_t)n);
sbin/fsck_ffs/pass2.c
300
dirp->d_reclen = n;
sbin/fsck_ffs/pass2.c
314
n = DIRSIZ(dirp);
sbin/fsck_ffs/pass2.c
315
if (dirp->d_reclen < n + entrysize)
sbin/fsck_ffs/pass2.c
317
proto.d_reclen = dirp->d_reclen - n;
sbin/fsck_ffs/pass2.c
318
dirp->d_reclen = n;
sbin/fsck_ffs/pass2.c
321
dirp = (struct direct *)((char *)(dirp) + n);
sbin/fsck_ffs/pass2.c
381
n = 0;
sbin/fsck_ffs/pass2.c
384
n = reply("REMOVE");
sbin/fsck_ffs/pass2.c
392
n = reply("REMOVE");
sbin/fsck_ffs/pass2.c
404
n = 1;
sbin/fsck_ffs/pass2.c
408
if ((n = reply("REMOVE")) == 1)
sbin/fsck_ffs/pass2.c
429
n = 1;
sbin/fsck_ffs/pass2.c
432
if ((n = reply("REMOVE")) == 1)
sbin/fsck_ffs/pass2.c
456
if (n == 0)
sbin/fsck_ffs/pass4.c
62
int n, i;
sbin/fsck_ffs/pass4.c
79
n = ILNCOUNT(inumber);
sbin/fsck_ffs/pass4.c
80
if (n) {
sbin/fsck_ffs/pass4.c
81
adjust(&idesc, (short)n);
sbin/fsck_msdos/boot.c
146
n = read(dosfs, fsinfo, fsinfosz);
sbin/fsck_msdos/boot.c
147
if (n == -1 || n != fsinfosz) {
sbin/fsck_msdos/boot.c
179
n = write(dosfs, fsinfo, fsinfosz);
sbin/fsck_msdos/boot.c
180
if (n == -1 || n != fsinfosz) {
sbin/fsck_msdos/boot.c
207
n = read(dosfs, backup, secsize);
sbin/fsck_msdos/boot.c
208
if (n == -1 || n != secsize) {
sbin/fsck_msdos/boot.c
309
ssize_t n;
sbin/fsck_msdos/boot.c
328
n = read(dosfs, fsinfo, fsinfosz);
sbin/fsck_msdos/boot.c
329
if (n == -1 || n != fsinfosz) {
sbin/fsck_msdos/boot.c
348
n = write(dosfs, fsinfo, fsinfosz);
sbin/fsck_msdos/boot.c
349
if (n == -1 || n != fsinfosz) {
sbin/fsck_msdos/boot.c
48
ssize_t n;
sbin/fsck_msdos/boot.c
70
n = read(dosfs, block, secsize);
sbin/fsck_msdos/boot.c
71
if (n == -1 || n != secsize) {
sbin/fsck_msdos/dir.c
732
struct dirTodoNode *n;
sbin/fsck_msdos/dir.c
809
if (!(n = newDirTodo())) {
sbin/fsck_msdos/dir.c
813
n->next = pendingDirectories;
sbin/fsck_msdos/dir.c
814
n->dir = d;
sbin/fsck_msdos/dir.c
815
pendingDirectories = n;
sbin/fsck_msdos/dir.c
863
struct dirTodoNode *n = pendingDirectories->next;
sbin/fsck_msdos/dir.c
870
pendingDirectories = n;
sbin/fsck_msdos/fat.c
329
cl_t head, p, h, n;
sbin/fsck_msdos/fat.c
369
(n = fat[p].next) >= CLUST_FIRST && n < boot->NumClusters;
sbin/fsck_msdos/fat.c
370
p = n) {
sbin/fsck_msdos/fat.c
372
if (fat[n].head != head || len-- < 2)
sbin/fsck_msdos/fat.c
375
if (n >= CLUST_EOFS)
sbin/fsck_msdos/fat.c
378
if (n == CLUST_FREE || n >= CLUST_RSRVD) {
sbin/fsck_msdos/fat.c
380
head, rsrvdcltype(n));
sbin/fsck_msdos/fat.c
384
if (n < CLUST_FIRST || n >= boot->NumClusters) {
sbin/fsck_msdos/fat.c
386
head, n);
sbin/fsck_msdos/fat.c
390
if (head == fat[n].head) {
sbin/fsck_msdos/fat.c
397
head, fat[n].head, n);
sbin/fsck_msdos/fat.c
399
if (ask(0, "Clear chain starting at %u", h = fat[n].head)) {
sbin/fsck_msdos/fat.c
404
for (p = n;
sbin/fsirand/fsirand.c
104
int devfd, n, i;
sbin/fsirand/fsirand.c
141
if ((n = read(devfd, sblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
143
(n < SBSIZE) ? "short read" : strerror(errno));
sbin/fsirand/fsirand.c
196
} else if ((n = read(devfd, tmpsblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
198
cg + 1, devpath, (n < SBSIZE) ? "short read"
sbin/fsirand/fsirand.c
252
if ((n = write(devfd, sblock, SBSIZE)) != SBSIZE) {
sbin/fsirand/fsirand.c
254
(n < SBSIZE) ? "short write" : strerror(errno));
sbin/fsirand/fsirand.c
269
} else if ((n = write(devfd, sblock, SBSIZE)) !=
sbin/fsirand/fsirand.c
272
cg + 1, devpath, (n < SBSIZE) ? "short write"
sbin/fsirand/fsirand.c
283
} else if ((n = read(devfd, inodebuf, ibufsize)) != ibufsize) {
sbin/fsirand/fsirand.c
285
(n < ibufsize) ? "short read" : strerror(errno));
sbin/fsirand/fsirand.c
289
for (n = 0; n < sblock->fs_ipg; n++, inumber++) {
sbin/fsirand/fsirand.c
291
dp1 = &((struct ufs1_dinode *)inodebuf)[n];
sbin/fsirand/fsirand.c
293
dp2 = &((struct ufs2_dinode *)inodebuf)[n];
sbin/fsirand/fsirand.c
313
} else if ((n = write(devfd, inodebuf, ibufsize)) !=
sbin/fsirand/fsirand.c
316
(n != ibufsize) ? "short write" :
sbin/fsirand/fsirand.c
53
int n, ex = 0;
sbin/fsirand/fsirand.c
56
while ((n = getopt(argc, argv, "bfp")) != -1) {
sbin/fsirand/fsirand.c
57
switch (n) {
sbin/fsirand/fsirand.c
82
for (n = optind; n < argc; n++) {
sbin/fsirand/fsirand.c
84
(void)puts(argv[n]);
sbin/fsirand/fsirand.c
85
ex += fsirand(argv[n]);
sbin/fsirand/fsirand.c
86
if (n < argc - 1)
sbin/growfs/growfs.c
1379
ssize_t n;
sbin/growfs/growfs.c
1387
n = read(fsi, bf, size);
sbin/growfs/growfs.c
1388
if (n != (ssize_t)size) {
sbin/growfs/growfs.c
1399
ssize_t n;
sbin/growfs/growfs.c
1406
n = write(fso, bf, size);
sbin/growfs/growfs.c
1407
if (n != (ssize_t)size)
sbin/ifconfig/ifconfig.c
5650
int i, n;
sbin/ifconfig/ifconfig.c
5692
for (i = 0, n = 0; i < IPCP_MAX_DNSSRV; i++) {
sbin/ifconfig/ifconfig.c
5695
printf("%s %s", n++ ? "" : "\tdns:",
sbin/ifconfig/ifconfig.c
5698
if (n)
sbin/ifconfig/ifconfig.c
6098
int i, n;
sbin/ifconfig/ifconfig.c
6206
n = 0;
sbin/ifconfig/ifconfig.c
6208
printf("%ssubscriber-id %s", n++ ? " " : "", sid);
sbin/ifconfig/ifconfig.c
6210
printf("%sICC-id %s", n++ ? " " : "", iccid);
sbin/ifconfig/ifconfig.c
6219
n = 0;
sbin/ifconfig/ifconfig.c
6221
printf("%sdevice %s", n++ ? " " : "", hwinfo);
sbin/ifconfig/ifconfig.c
6223
printf("%s", n++ ? " " : "");
sbin/ifconfig/ifconfig.c
6229
n = strlen(devid);
sbin/ifconfig/ifconfig.c
6230
if (n == 8 || n == 11) {
sbin/ifconfig/ifconfig.c
6233
} else if (n == 14 || n == 18) {
sbin/ifconfig/ifconfig.c
6245
printf("%sfirmware %s", n++ ? " " : "", fwinfo);
sbin/ifconfig/ifconfig.c
6253
n = 0;
sbin/ifconfig/ifconfig.c
6255
printf("%sphone# %s", n++ ? " " : "", pn);
sbin/ifconfig/ifconfig.c
6257
printf("%sAPN %s", n++ ? " " : "", apn);
sbin/ifconfig/ifconfig.c
6259
printf("%sprovider %s", n++ ? " " : "", provider);
sbin/ifconfig/ifconfig.c
6261
printf("%sprovider-id %s", n ? " " : "", providerid);
sbin/ifconfig/ifconfig.c
6265
for (i = 0, n = 0; i < UMB_MAX_DNSSRV; i++) {
sbin/ifconfig/ifconfig.c
6268
printf("%s %s", n++ ? "" : "\tdns",
sbin/ifconfig/ifconfig.c
6275
printf("%s %s", n++ ? "" : "\tdns",
sbin/ifconfig/ifconfig.c
6278
if (n)
sbin/ifconfig/ifconfig.c
6442
int n = 0;
sbin/ifconfig/ifconfig.c
6454
return n;
sbin/ifconfig/ifconfig.c
6460
n += sizeof (*out);
sbin/iked/ca.c
718
unsigned int n;
sbin/iked/ca.c
743
n = ca_chain_by_issuer(store, subj, id,
sbin/iked/ca.c
745
if (n > 0) {
sbin/iked/ca.c
747
return (n + 1);
sbin/iked/control.c
261
int n, v;
sbin/iked/control.c
282
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
sbin/iked/control.c
287
if (n == 0)
sbin/iked/iked.h
591
#define ikestat_add(env, c, n) do { env->sc_stats.c += (n); } while(0)
sbin/iked/ikev2.c
1386
struct ikev2_notify *n;
sbin/iked/ikev2.c
1451
if ((n = ibuf_reserve(buf, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
1453
n->n_protoid = IKEV2_SAPROTO_NONE;
sbin/iked/ikev2.c
1454
n->n_spisize = 0;
sbin/iked/ikev2.c
1455
n->n_type = htobe16(IKEV2_N_COOKIE);
sbin/iked/ikev2.c
1458
len = sizeof(*n) + ibuf_size(cookie);
sbin/iked/ikev2.c
2148
struct ikev2_notify *n;
sbin/iked/ikev2.c
2188
len = sizeof(*n) + sizeof(cpi) + sizeof(transform);
sbin/iked/ikev2.c
2191
n = (struct ikev2_notify *)ptr;
sbin/iked/ikev2.c
2192
n->n_protoid = 0;
sbin/iked/ikev2.c
2193
n->n_spisize = 0;
sbin/iked/ikev2.c
2194
n->n_type = htobe16(IKEV2_N_IPCOMP_SUPPORTED);
sbin/iked/ikev2.c
2195
ptr += sizeof(*n);
sbin/iked/ikev2.c
2207
struct ikev2_notify *n;
sbin/iked/ikev2.c
2214
len = sizeof(*n);
sbin/iked/ikev2.c
2215
if ((n = ibuf_reserve(e, len)) == NULL)
sbin/iked/ikev2.c
2217
n->n_protoid = 0;
sbin/iked/ikev2.c
2218
n->n_spisize = 0;
sbin/iked/ikev2.c
2219
n->n_type = htobe16(notify);
sbin/iked/ikev2.c
2257
struct ikev2_notify *n;
sbin/iked/ikev2.c
2270
len = sizeof(*n) + nitems(signature_hashes) * sizeof(hash);
sbin/iked/ikev2.c
2278
n = (struct ikev2_notify *)ptr;
sbin/iked/ikev2.c
2279
n->n_protoid = 0;
sbin/iked/ikev2.c
2280
n->n_spisize = 0;
sbin/iked/ikev2.c
2281
n->n_type = htobe16(IKEV2_N_SIGNATURE_HASH_ALGORITHMS);
sbin/iked/ikev2.c
2282
ptr += sizeof(*n);
sbin/iked/ikev2.c
2434
struct ikev2_notify *n;
sbin/iked/ikev2.c
2445
if ((n = ibuf_reserve(buf, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
2447
n->n_type = htobe16(IKEV2_N_NAT_DETECTION_SOURCE_IP);
sbin/iked/ikev2.c
2452
betoh16(n->n_type), 0)) == -1)
sbin/iked/ikev2.c
2454
len += sizeof(*n);
sbin/iked/ikev2.c
2461
if ((n = ibuf_reserve(buf, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
2463
n->n_type = htobe16(IKEV2_N_NAT_DETECTION_DESTINATION_IP);
sbin/iked/ikev2.c
2468
betoh16(n->n_type), 0)) == -1)
sbin/iked/ikev2.c
2470
len += sizeof(*n);
sbin/iked/ikev2.c
2862
struct ikev2_notify *n;
sbin/iked/ikev2.c
2901
if ((n = ibuf_reserve(buf, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
2903
n->n_protoid = IKEV2_SAPROTO_IKE;
sbin/iked/ikev2.c
2904
n->n_spisize = 0;
sbin/iked/ikev2.c
2905
n->n_type = htobe16(IKEV2_N_COOKIE2);
sbin/iked/ikev2.c
2908
len = sizeof(*n) + ibuf_size(msg->msg_cookie2);
sbin/iked/ikev2.c
3523
struct ikev2_notify *n;
sbin/iked/ikev2.c
3539
if ((n = ibuf_reserve(buf, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
3541
n->n_protoid = IKEV2_SAPROTO_IKE;
sbin/iked/ikev2.c
3542
n->n_spisize = 0;
sbin/iked/ikev2.c
3543
n->n_type = htobe16(IKEV2_N_AUTHENTICATION_FAILED);
sbin/iked/ikev2.c
3572
struct ikev2_notify *n;
sbin/iked/ikev2.c
3593
len = sizeof(*n);
sbin/iked/ikev2.c
3596
n = (struct ikev2_notify *)ptr;
sbin/iked/ikev2.c
3597
n->n_type = htobe16(msg->msg_error);
sbin/iked/ikev2.c
3619
n->n_protoid = rekey->spi_protoid;
sbin/iked/ikev2.c
3620
n->n_spisize = rekey->spi_size;
sbin/iked/ikev2.c
3627
n->n_protoid = 0;
sbin/iked/ikev2.c
3628
n->n_spisize = 0;
sbin/iked/ikev2.c
3631
n->n_protoid = 0;
sbin/iked/ikev2.c
3632
n->n_spisize = 0;
sbin/iked/ikev2.c
4143
struct ikev2_notify *n;
sbin/iked/ikev2.c
4278
if ((n = ibuf_reserve(e, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
4280
n->n_type = htobe16(IKEV2_N_REKEY_SA);
sbin/iked/ikev2.c
4281
n->n_protoid = rekey->spi_protoid;
sbin/iked/ikev2.c
4282
n->n_spisize = rekey->spi_size;
sbin/iked/ikev2.c
4288
len += sizeof(*n);
sbin/iked/ikev2.c
5325
struct ikev2_notify *n;
sbin/iked/ikev2.c
5346
if ((n = ibuf_reserve(e, sizeof(*n))) == NULL)
sbin/iked/ikev2.c
5348
n->n_protoid = IKEV2_SAPROTO_IKE; /* XXX ESP etc. */
sbin/iked/ikev2.c
5349
n->n_spisize = 0;
sbin/iked/ikev2.c
5350
n->n_type = htobe16(msg->msg_error);
sbin/iked/ikev2.c
5366
if (ikev2_next_payload(pld, sizeof(*n), IKEV2_PAYLOAD_NONE) == -1)
sbin/iked/ikev2_pld.c
1033
struct ikev2_notify *n)
sbin/iked/ikev2_pld.c
1037
if (left < sizeof(*n)) {
sbin/iked/ikev2_pld.c
1039
"(%zu < %zu)", __func__, left, sizeof(*n));
sbin/iked/ikev2_pld.c
1042
memcpy(n, msgbuf + offset, sizeof(*n));
sbin/iked/ikev2_pld.c
1051
struct ikev2_notify n;
sbin/iked/ikev2_pld.c
1060
if (ikev2_validate_notify(msg, offset, left, &n))
sbin/iked/ikev2_pld.c
1062
type = betoh16(n.n_type);
sbin/iked/ikev2_pld.c
1066
print_map(n.n_protoid, ikev2_saproto_map), n.n_spisize,
sbin/iked/ikev2_pld.c
1069
left -= sizeof(n);
sbin/iked/ikev2_pld.c
1070
if ((buf = ibuf_seek(msg->msg_data, offset + sizeof(n), left)) == NULL)
sbin/iked/ikev2_pld.c
1161
if (left != n.n_spisize) {
sbin/iked/ikev2_pld.c
1171
switch (n.n_spisize) {
sbin/iked/ikev2_pld.c
1182
n.n_spisize);
sbin/iked/ikev2_pld.c
1185
rekey->spi_size = n.n_spisize;
sbin/iked/ikev2_pld.c
1186
rekey->spi_protoid = n.n_protoid;
sbin/iked/ikev2_pld.c
1189
print_map(n.n_protoid, ikev2_saproto_map),
sbin/iked/ikev2_pld.c
1190
print_spi(rekey->spi, n.n_spisize));
sbin/iked/parse.y
2410
struct ipsec_addr_wrap *n = NULL, *h = NULL;
sbin/iked/parse.y
2423
n = calloc(1, sizeof(struct ipsec_addr_wrap));
sbin/iked/parse.y
2424
if (n == NULL)
sbin/iked/parse.y
2426
n->af = ifa->ifa_addr->sa_family;
sbin/iked/parse.y
2427
if ((n->name = strdup(ifa->ifa_name)) == NULL)
sbin/iked/parse.y
2429
if (n->af == AF_INET) {
sbin/iked/parse.y
2431
memcpy(&n->address, sa_in, sizeof(*sa_in));
sbin/iked/parse.y
2433
n->mask = mask2prefixlen((struct sockaddr *)sa_in);
sbin/iked/parse.y
2434
} else if (n->af == AF_INET6) {
sbin/iked/parse.y
2436
memcpy(&n->address, sa_in6, sizeof(*sa_in6));
sbin/iked/parse.y
2438
n->mask = mask2prefixlen6((struct sockaddr *)sa_in6);
sbin/iked/parse.y
2440
n->next = NULL;
sbin/iked/parse.y
2441
n->tail = n;
sbin/iked/parse.y
2443
h = n;
sbin/iked/parse.y
2445
h->tail->next = n;
sbin/iked/parse.y
2446
h->tail = n;
sbin/iked/parse.y
2457
struct ipsec_addr_wrap *n;
sbin/iked/parse.y
2475
for (n = iftab; n; n = n->next) {
sbin/iked/parse.y
2476
if (n->af == AF_LINK && !strncmp(n->name, ifa_name,
sbin/iked/parse.y
2491
struct ipsec_addr_wrap *n, *h = NULL, *hn;
sbin/iked/parse.y
2511
if ((n = ifa_lookup(ifg->ifgrq_member)) == NULL)
sbin/iked/parse.y
2514
h = n;
sbin/iked/parse.y
2518
hn->next = n;
sbin/iked/parse.y
2519
n->tail = hn;
sbin/iked/parse.y
2531
struct ipsec_addr_wrap *p = NULL, *h = NULL, *n = NULL;
sbin/iked/parse.y
2538
if ((n = ifa_grouplookup(ifa_name)) != NULL)
sbin/iked/parse.y
2539
return (n);
sbin/iked/parse.y
2546
n = calloc(1, sizeof(struct ipsec_addr_wrap));
sbin/iked/parse.y
2547
if (n == NULL)
sbin/iked/parse.y
2549
memcpy(n, p, sizeof(struct ipsec_addr_wrap));
sbin/iked/parse.y
2550
if ((n->name = strdup(p->name)) == NULL)
sbin/iked/parse.y
2552
switch (n->af) {
sbin/iked/parse.y
2554
set_ipmask(n, 32);
sbin/iked/parse.y
2557
in6 = (struct sockaddr_in6 *)&n->address;
sbin/iked/parse.y
2567
free(n->name);
sbin/iked/parse.y
2568
free(n);
sbin/iked/parse.y
2578
set_ipmask(n, 128);
sbin/iked/parse.y
2582
n->next = NULL;
sbin/iked/parse.y
2583
n->tail = n;
sbin/iked/parse.y
2585
h = n;
sbin/iked/parse.y
2587
h->tail->next = n;
sbin/iked/parse.y
2588
h->tail = n;
sbin/iked/parse.y
3376
struct ipsec_addr_wrap *n, *cur;
sbin/iked/parse.y
3381
for (n = head; n != NULL; ) {
sbin/iked/parse.y
3382
cur = n;
sbin/iked/parse.y
3383
n = n->next;
sbin/iked/pfkey.c
1011
if ((sa_life = pfkey_find_ext(data, n,
sbin/iked/pfkey.c
1021
if ((sa_counter = pfkey_find_ext(data, n,
sbin/iked/pfkey.c
1037
freezero(data, n);
sbin/iked/pfkey.c
1073
ssize_t n;
sbin/iked/pfkey.c
1157
if ((ret = pfkey_write(env, &smsg, iov, iov_cnt, &data, &n)) != 0)
sbin/iked/pfkey.c
1166
if ((sa_ext = pfkey_find_ext(data, n, SADB_EXT_SA)) == NULL) {
sbin/iked/pfkey.c
1177
freezero(data, n);
sbin/iked/pfkey.c
1345
ssize_t n, len = smsg->sadb_msg_len * 8;
sbin/iked/pfkey.c
1366
if ((n = writev(env->sc_pfkey, iov, iov_cnt)) == -1) {
sbin/iked/pfkey.c
1370
} else if (n != len) {
sbin/iked/pfkey.c
1390
int n;
sbin/iked/pfkey.c
1403
n = poll(pfd, 1, PFKEY_REPLY_TIMEOUT / 1000);
sbin/iked/pfkey.c
1404
if (n == -1) {
sbin/iked/pfkey.c
1408
if (n == 0) {
sbin/iked/pfkey.c
893
ssize_t n;
sbin/iked/pfkey.c
997
if ((ret = pfkey_write(env, &smsg, iov, iov_cnt, &data, &n)) != 0)
sbin/iked/proc.c
274
unsigned int n)
sbin/iked/proc.c
284
dst, n + 1);
sbin/iked/proc.c
290
if (pp->pp_pipes[dst][n] != -1) {
sbin/iked/proc.c
295
pp->pp_pipes[dst][n] = fd;
sbin/iked/proc.c
297
iev = &ps->ps_ievs[dst][n];
sbin/iked/proc.c
467
unsigned int dst, n;
sbin/iked/proc.c
479
for (n = 0; n < ps->ps_instances[dst]; n++) {
sbin/iked/proc.c
480
if (pp->pp_pipes[dst][n] == -1)
sbin/iked/proc.c
484
event_del(&(ps->ps_ievs[dst][n].ev));
sbin/iked/proc.c
485
imsgbuf_clear(&(ps->ps_ievs[dst][n].ibuf));
sbin/iked/proc.c
486
close(pp->pp_pipes[dst][n]);
sbin/iked/proc.c
487
pp->pp_pipes[dst][n] = -1;
sbin/iked/proc.c
615
ssize_t n;
sbin/iked/proc.c
624
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/iked/proc.c
626
if (n == 0) {
sbin/iked/proc.c
646
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/iked/proc.c
648
if (n == 0)
sbin/iked/proc.c
774
proc_range(struct privsep *ps, enum privsep_procid id, int *n, int *m)
sbin/iked/proc.c
776
if (*n == -1) {
sbin/iked/proc.c
778
*n = 0;
sbin/iked/proc.c
782
*m = *n + 1;
sbin/iked/proc.c
787
proc_compose_imsg(struct privsep *ps, enum privsep_procid id, int n,
sbin/iked/proc.c
792
proc_range(ps, id, &n, &m);
sbin/iked/proc.c
793
for (; n < m; n++) {
sbin/iked/proc.c
794
if (imsg_compose_event(&ps->ps_ievs[id][n],
sbin/iked/proc.c
810
proc_composev_imsg(struct privsep *ps, enum privsep_procid id, int n,
sbin/iked/proc.c
815
proc_range(ps, id, &n, &m);
sbin/iked/proc.c
816
for (; n < m; n++)
sbin/iked/proc.c
817
if (imsg_composev_event(&ps->ps_ievs[id][n],
sbin/iked/proc.c
833
enum privsep_procid id, int n)
sbin/iked/proc.c
835
return (proc_compose_imsg(ps, id, n, imsg->hdr.type,
sbin/iked/proc.c
840
proc_ibuf(struct privsep *ps, enum privsep_procid id, int n)
sbin/iked/proc.c
844
proc_range(ps, id, &n, &m);
sbin/iked/proc.c
845
return (&ps->ps_ievs[id][n].ibuf);
sbin/iked/proc.c
849
proc_iev(struct privsep *ps, enum privsep_procid id, int n)
sbin/iked/proc.c
853
proc_range(ps, id, &n, &m);
sbin/iked/proc.c
854
return (&ps->ps_ievs[id][n]);
sbin/iked/proc.c
859
proc_flush_imsg(struct privsep *ps, enum privsep_procid id, int n)
sbin/iked/proc.c
864
proc_range(ps, id, &n, &m);
sbin/iked/proc.c
865
for (; n < m; n++) {
sbin/iked/proc.c
866
if ((ibuf = proc_ibuf(ps, id, n)) == NULL)
sbin/iked/proc.c
870
imsg_event_add(&ps->ps_ievs[id][n]);
sbin/iked/radius.c
827
int code, n = 0;
sbin/iked/radius.c
913
n++;
sbin/iked/radius.c
920
n++;
sbin/iked/radius.c
932
n++;
sbin/iked/radius.c
938
if (n > 0)
sbin/iked/smult_curve25519_ref.c
248
const unsigned char *n,
sbin/iked/smult_curve25519_ref.c
254
for (i = 0;i < 32;++i) e[i] = n[i];
sbin/iked/sntrup761.c
101
static void crypto_sort_uint32(void *array,long long n)
sbin/iked/sntrup761.c
105
for (j = 0;j < n;++j) x[j] ^= 0x80000000;
sbin/iked/sntrup761.c
106
crypto_sort_int32(array,n);
sbin/iked/sntrup761.c
107
for (j = 0;j < n;++j) x[j] ^= 0x80000000;
sbin/iked/sntrup761.c
38
static void crypto_sort_int32(void *array,long long n)
sbin/iked/sntrup761.c
43
if (n < 2) return;
sbin/iked/sntrup761.c
45
while (top < n - top) top += top;
sbin/iked/sntrup761.c
49
while (i + 2 * p <= n) {
sbin/iked/sntrup761.c
54
for (j = i;j < n - p;++j)
sbin/iked/sntrup761.c
61
if (j == n - q) goto done;
sbin/iked/sntrup761.c
72
while (i + p <= n - q) {
sbin/iked/sntrup761.c
83
while (j < n - q) {
sbin/iked/vroute.c
111
ssize_t n;
sbin/iked/vroute.c
119
if ((n = read(fd, buf, ROUTE_SOCKET_BUF_SIZE)) == -1) {
sbin/iked/vroute.c
126
if (n == 0)
sbin/iked/vroute.c
129
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
sbin/iked/vroute.c
130
log_warnx("partial rtm of %zd in buffer", n);
sbin/ipsecctl/parse.y
1882
struct ipsec_addr_wrap *n = NULL, *h = NULL;
sbin/ipsecctl/parse.y
1893
n = calloc(1, sizeof(struct ipsec_addr_wrap));
sbin/ipsecctl/parse.y
1894
if (n == NULL)
sbin/ipsecctl/parse.y
1896
n->af = ifa->ifa_addr->sa_family;
sbin/ipsecctl/parse.y
1897
if ((n->name = strdup(ifa->ifa_name)) == NULL)
sbin/ipsecctl/parse.y
1899
if (n->af == AF_INET) {
sbin/ipsecctl/parse.y
1900
n->af = AF_INET;
sbin/ipsecctl/parse.y
1901
memcpy(&n->address.v4, &((struct sockaddr_in *)
sbin/ipsecctl/parse.y
1904
memcpy(&n->mask.v4, &((struct sockaddr_in *)
sbin/ipsecctl/parse.y
1907
} else if (n->af == AF_INET6) {
sbin/ipsecctl/parse.y
1908
n->af = AF_INET6;
sbin/ipsecctl/parse.y
1909
memcpy(&n->address.v6, &((struct sockaddr_in6 *)
sbin/ipsecctl/parse.y
1912
memcpy(&n->mask.v6, &((struct sockaddr_in6 *)
sbin/ipsecctl/parse.y
1916
n->next = NULL;
sbin/ipsecctl/parse.y
1917
n->tail = n;
sbin/ipsecctl/parse.y
1919
h = n;
sbin/ipsecctl/parse.y
1921
h->tail->next = n;
sbin/ipsecctl/parse.y
1922
h->tail = n;
sbin/ipsecctl/parse.y
1933
struct ipsec_addr_wrap *n;
sbin/ipsecctl/parse.y
1951
for (n = iftab; n; n = n->next) {
sbin/ipsecctl/parse.y
1952
if (n->af == AF_LINK && !strncmp(n->name, ifa_name,
sbin/ipsecctl/parse.y
1967
struct ipsec_addr_wrap *n, *h = NULL, *hn;
sbin/ipsecctl/parse.y
1987
if ((n = ifa_lookup(ifg->ifgrq_member)) == NULL)
sbin/ipsecctl/parse.y
1990
h = n;
sbin/ipsecctl/parse.y
1994
hn->next = n;
sbin/ipsecctl/parse.y
1995
n->tail = hn;
sbin/ipsecctl/parse.y
2007
struct ipsec_addr_wrap *p = NULL, *h = NULL, *n = NULL;
sbin/ipsecctl/parse.y
2012
if ((n = ifa_grouplookup(ifa_name)) != NULL)
sbin/ipsecctl/parse.y
2013
return (n);
sbin/ipsecctl/parse.y
2020
n = calloc(1, sizeof(struct ipsec_addr_wrap));
sbin/ipsecctl/parse.y
2021
if (n == NULL)
sbin/ipsecctl/parse.y
2023
memcpy(n, p, sizeof(struct ipsec_addr_wrap));
sbin/ipsecctl/parse.y
2024
if ((n->name = strdup(p->name)) == NULL)
sbin/ipsecctl/parse.y
2026
switch (n->af) {
sbin/ipsecctl/parse.y
2028
set_ipmask(n, 32);
sbin/ipsecctl/parse.y
2032
if (IN6_IS_ADDR_LINKLOCAL(&n->address.v6)) {
sbin/ipsecctl/parse.y
2037
free(n);
sbin/ipsecctl/parse.y
2040
memcpy(&tmp16, &n->address.v6.s6_addr[2],
sbin/ipsecctl/parse.y
2045
n->address.v6.s6_addr[2] = 0;
sbin/ipsecctl/parse.y
2046
n->address.v6.s6_addr[3] = 0;
sbin/ipsecctl/parse.y
2048
set_ipmask(n, 128);
sbin/ipsecctl/parse.y
2052
n->next = NULL;
sbin/ipsecctl/parse.y
2053
n->tail = n;
sbin/ipsecctl/parse.y
2055
h = n;
sbin/ipsecctl/parse.y
2057
h->tail->next = n;
sbin/ipsecctl/parse.y
2058
h->tail = n;
sbin/ipsecctl/pfkdump.c
273
int i, comma = 0, n;
sbin/ipsecctl/pfkdump.c
282
n = snprintf(fstr + len, sizeof(fstr) - len - 1,
sbin/ipsecctl/pfkdump.c
284
if (n < 0 || (size_t)n >= sizeof(fstr) - len - 1)
sbin/ipsecctl/pfkdump.c
286
len += n;
sbin/ipsecctl/pfkdump.c
455
#define plural(n) ((n) != 1 ? "s" : "")
sbin/ipsecctl/pfkey.c
1260
ssize_t n;
sbin/ipsecctl/pfkey.c
1278
if ((n = writev(fd, iov, iov_cnt)) == -1) {
sbin/ipsecctl/pfkey.c
1282
if (n != len) {
sbin/ipsecctl/pfkey.c
1320
int n;
sbin/ipsecctl/pfkey.c
1333
if ((n = poll(pfd, 1, -1)) == -1)
sbin/ipsecctl/pfkey.c
1335
if (n == 0)
sbin/ipsecctl/pfkey.c
376
n = writev(sd, iov, iov_cnt);
sbin/ipsecctl/pfkey.c
377
} while (n == -1 && (errno == EAGAIN || errno == EINTR));
sbin/ipsecctl/pfkey.c
378
if (n == -1) {
sbin/ipsecctl/pfkey.c
403
ssize_t n;
sbin/ipsecctl/pfkey.c
629
if ((n = writev(sd, iov, iov_cnt)) == -1) {
sbin/ipsecctl/pfkey.c
632
} else if (n != len) {
sbin/ipsecctl/pfkey.c
651
ssize_t n;
sbin/ipsecctl/pfkey.c
763
if ((n = writev(sd, iov, iov_cnt)) == -1) {
sbin/ipsecctl/pfkey.c
766
} else if (n != len) {
sbin/ipsecctl/pfkey.c
78
ssize_t n;
sbin/isakmpd/cert.c
156
cert_free_subjects(int n, u_int8_t **id, u_int32_t *len)
sbin/isakmpd/cert.c
160
for (i = 0; i < n; i++)
sbin/isakmpd/conf.c
704
int val, min, max, n;
sbin/isakmpd/conf.c
708
n = sscanf(value, "%d,%d:%d", &val, &min, &max);
sbin/isakmpd/conf.c
709
switch (n) {
sbin/isakmpd/dnssec.c
275
rsa->n = BN_bin2bn(key + key_offset, keylen - key_offset, NULL);
sbin/isakmpd/dnssec.c
280
BN_num_bits(rsa->n)));
sbin/isakmpd/ike_auth.c
571
int found = 0, n, i, id_found;
sbin/isakmpd/ike_auth.c
677
if (!handler->cert_get_subjects(cert, &n, &id_cert,
sbin/isakmpd/ike_auth.c
685
for (i = 0; i < n; i++)
sbin/isakmpd/ike_auth.c
700
cert_free_subjects(n, id_cert, id_cert_len);
sbin/isakmpd/isakmpd.c
279
int n;
sbin/isakmpd/isakmpd.c
281
for (n = 1; n < _NSIG; n++)
sbin/isakmpd/isakmpd.c
282
signal(n, SIG_DFL);
sbin/isakmpd/isakmpd.c
389
int n, m;
sbin/isakmpd/isakmpd.c
439
n = getdtablesize();
sbin/isakmpd/isakmpd.c
440
mask_size = howmany(n, NFDBITS) * sizeof(fd_mask);
sbin/isakmpd/isakmpd.c
483
n = transport_fd_set(rfds);
sbin/isakmpd/isakmpd.c
485
if (ui_socket + 1 > n)
sbin/isakmpd/isakmpd.c
486
n = ui_socket + 1;
sbin/isakmpd/isakmpd.c
495
if (app_socket + 1 > n)
sbin/isakmpd/isakmpd.c
496
n = app_socket + 1;
sbin/isakmpd/isakmpd.c
501
if (m > n)
sbin/isakmpd/isakmpd.c
502
n = m;
sbin/isakmpd/isakmpd.c
508
n = pselect(n, rfds, wfds, NULL, timeout, NULL);
sbin/isakmpd/isakmpd.c
509
if (n == -1) {
sbin/isakmpd/isakmpd.c
521
} else if (n) {
sbin/isakmpd/message.c
1681
} n;
sbin/isakmpd/message.c
1716
args.u.n.msg_type = notify;
sbin/isakmpd/message.c
1717
args.u.n.spi = proto ? proto->spi[incoming] : 0;
sbin/isakmpd/message.c
1838
SET_ISAKMP_NOTIFY_MSG_TYPE(buf, args->u.n.msg_type);
sbin/isakmpd/message.c
1839
memcpy(buf + ISAKMP_NOTIFY_SPI_OFF, args->u.n.spi,
sbin/isakmpd/monitor.c
400
int n;
sbin/isakmpd/monitor.c
402
for (n = 1; n < _NSIG; n++)
sbin/isakmpd/monitor.c
403
signal(n, SIG_DFL);
sbin/isakmpd/monitor.c
645
must_read(void *buf, size_t n)
sbin/isakmpd/monitor.c
651
while (n > pos) {
sbin/isakmpd/monitor.c
652
res = read(m_state.s, s + pos, n - pos);
sbin/isakmpd/monitor.c
670
must_write(const void *buf, size_t n)
sbin/isakmpd/monitor.c
676
while (n > pos) {
sbin/isakmpd/monitor.c
677
res = write(m_state.s, s + pos, n - pos);
sbin/isakmpd/monitor_fdpass.c
102
if (n != 1) {
sbin/isakmpd/monitor_fdpass.c
104
n);
sbin/isakmpd/monitor_fdpass.c
49
ssize_t n;
sbin/isakmpd/monitor_fdpass.c
65
if ((n = sendmsg(socket, &msg, 0)) == -1) {
sbin/isakmpd/monitor_fdpass.c
69
if (n != 1) {
sbin/isakmpd/monitor_fdpass.c
70
log_error("mm_send_fd: sendmsg: expected sent 1 got %zd", n);
sbin/isakmpd/monitor_fdpass.c
87
ssize_t n;
sbin/isakmpd/monitor_fdpass.c
98
if ((n = recvmsg(socket, &msg, 0)) == -1) {
sbin/isakmpd/nat_traversal.c
107
for (i = 0; i < n; i++) {
sbin/isakmpd/nat_traversal.c
132
for (i = 0; i < n; i++)
sbin/isakmpd/nat_traversal.c
94
int n = NUMNATTCAP;
sbin/isakmpd/pf_key_v2.c
1472
int n;
sbin/isakmpd/pf_key_v2.c
1474
bit_ffc(mask, 128, &n);
sbin/isakmpd/pf_key_v2.c
1475
return n == -1 ? 128 : n;
sbin/isakmpd/pf_key_v2.c
200
ssize_t n;
sbin/isakmpd/pf_key_v2.c
220
n = poll(pfd, 1, PF_KEY_REPLY_TIMEOUT / 1000);
sbin/isakmpd/pf_key_v2.c
221
if (n == -1) {
sbin/isakmpd/pf_key_v2.c
225
if (!n) {
sbin/isakmpd/pf_key_v2.c
231
n = recv(pf_key_v2_socket, &hdr, sizeof hdr, MSG_PEEK);
sbin/isakmpd/pf_key_v2.c
232
if (n == -1) {
sbin/isakmpd/pf_key_v2.c
237
if (n != sizeof hdr) {
sbin/isakmpd/pf_key_v2.c
240
pf_key_v2_socket, (unsigned long) n);
sbin/isakmpd/pf_key_v2.c
249
n = hdr.sadb_msg_len * PF_KEY_V2_CHUNK;
sbin/isakmpd/pf_key_v2.c
251
n = read(pf_key_v2_socket, buf, n);
sbin/isakmpd/pf_key_v2.c
252
if (n == -1) {
sbin/isakmpd/pf_key_v2.c
257
if (n != hdr.sadb_msg_len * PF_KEY_V2_CHUNK) {
sbin/isakmpd/pf_key_v2.c
260
pf_key_v2_socket, (unsigned long) n);
sbin/isakmpd/pf_key_v2.c
263
LOG_DBG_BUF((LOG_SYSDEP, 80, "pf_key_v2_read: msg", buf, n));
sbin/isakmpd/pf_key_v2.c
3205
int n;
sbin/isakmpd/pf_key_v2.c
321
ssize_t n;
sbin/isakmpd/pf_key_v2.c
3212
if (ioctl(pf_key_v2_socket, FIONREAD, &n) == -1) {
sbin/isakmpd/pf_key_v2.c
3217
if (!n)
sbin/isakmpd/pf_key_v2.c
364
n = writev(pf_key_v2_socket, iov, cnt);
sbin/isakmpd/pf_key_v2.c
365
} while (n == -1 && (errno == EAGAIN || errno == EINTR));
sbin/isakmpd/pf_key_v2.c
366
if (n == -1) {
sbin/isakmpd/pf_key_v2.c
371
if ((size_t) n != len) {
sbin/isakmpd/pf_key_v2.c
374
pf_key_v2_socket, (unsigned long) n);
sbin/isakmpd/policy.c
2223
keynote_cert_get_subjects(void *scert, int *n, u_int8_t ***id,
sbin/isakmpd/timer.c
100
n && timespeccmp(expiration, &n->expiration, >=);
sbin/isakmpd/timer.c
101
n = TAILQ_NEXT(n, link))
sbin/isakmpd/timer.c
103
if (n) {
sbin/isakmpd/timer.c
106
"expiration in %llds", name, arg, n->name, n->arg,
sbin/isakmpd/timer.c
108
TAILQ_INSERT_BEFORE(n, ev, link);
sbin/isakmpd/timer.c
69
struct event *n;
sbin/isakmpd/timer.c
72
for (n = TAILQ_FIRST(&events);
sbin/isakmpd/timer.c
73
n && timespeccmp(&now, &n->expiration, >=);
sbin/isakmpd/timer.c
74
n = TAILQ_FIRST(&events)) {
sbin/isakmpd/timer.c
76
"timer_handle_expirations: event %s(%p)", n->name,
sbin/isakmpd/timer.c
77
n->arg));
sbin/isakmpd/timer.c
78
TAILQ_REMOVE(&events, n, link);
sbin/isakmpd/timer.c
79
(*n->func)(n->arg);
sbin/isakmpd/timer.c
80
free(n);
sbin/isakmpd/timer.c
89
struct event *n;
sbin/isakmpd/timer.c
99
for (n = TAILQ_FIRST(&events);
sbin/isakmpd/transport.c
182
int n;
sbin/isakmpd/transport.c
187
n = t->vtbl->fd_set(t, fds, 1);
sbin/isakmpd/transport.c
188
if (n > max)
sbin/isakmpd/transport.c
189
max = n;
sbin/isakmpd/transport.c
193
t->virtual, n));
sbin/isakmpd/transport.c
208
int n;
sbin/isakmpd/transport.c
214
n = t->vtbl->fd_set(t, fds, 1);
sbin/isakmpd/transport.c
218
t->virtual, n));
sbin/isakmpd/transport.c
219
if (n > max)
sbin/isakmpd/transport.c
220
max = n;
sbin/isakmpd/udp.c
413
ssize_t n;
sbin/isakmpd/udp.c
416
n = recvfrom(u->s, buf, UDP_SIZE, 0, (struct sockaddr *)&from, &len);
sbin/isakmpd/udp.c
417
if (n == -1) {
sbin/isakmpd/udp.c
443
msg = message_alloc(t, buf, n);
sbin/isakmpd/udp.c
458
ssize_t n;
sbin/isakmpd/udp.c
472
n = sendmsg(u->s, &m, 0);
sbin/isakmpd/udp.c
473
if (n == -1) {
sbin/isakmpd/udp_encap.c
353
ssize_t n;
sbin/isakmpd/udp_encap.c
356
n = recvfrom(u->s, buf, UDP_SIZE, 0, (struct sockaddr *)&from, &len);
sbin/isakmpd/udp_encap.c
357
if (n == -1) {
sbin/isakmpd/udp_encap.c
384
if (n < (ssize_t)sizeof(u_int32_t) || *(u_int32_t *)buf != 0) {
sbin/isakmpd/udp_encap.c
392
n -= sizeof(u_int32_t);
sbin/isakmpd/udp_encap.c
393
if (n == 1 && buf[sizeof(u_int32_t)] == 0xFF)
sbin/isakmpd/udp_encap.c
396
msg = message_alloc(t, buf + sizeof (u_int32_t), n);
sbin/isakmpd/udp_encap.c
418
ssize_t n;
sbin/isakmpd/udp_encap.c
451
n = sendmsg (u->s, &m, 0);
sbin/isakmpd/udp_encap.c
454
if (n == -1) {
sbin/isakmpd/ui.c
577
ssize_t n;
sbin/isakmpd/ui.c
607
n = read(ui_socket, p, resid);
sbin/isakmpd/ui.c
608
if (n == -1) {
sbin/isakmpd/ui.c
613
if (!n)
sbin/isakmpd/ui.c
615
resid -= n;
sbin/isakmpd/ui.c
616
while (n--) {
sbin/isakmpd/ui.c
624
memmove(buf, p + 1, n);
sbin/isakmpd/ui.c
626
resid = sz - n;
sbin/isakmpd/vendor.c
114
int i, n = NUMVIDS;
sbin/isakmpd/vendor.c
123
for (i = 0; i < n; i++) {
sbin/isakmpd/vendor.c
38
int i, n = NUMVIDS;
sbin/isakmpd/vendor.c
46
for (i = 0; i < n; i++) {
sbin/isakmpd/vendor.c
70
for (i = 0; i < n; i++)
sbin/isakmpd/vendor.c
86
int i, n = NUMVIDS;
sbin/isakmpd/vendor.c
88
for (i = 0; i < n; i++) {
sbin/isakmpd/x509.c
537
int n, i, id_found;
sbin/isakmpd/x509.c
541
if (!x509_cert_get_subjects(cert->cert, &n, &cid, &clen))
sbin/isakmpd/x509.c
545
for (i = 0; i < n; i++) {
sbin/isakmpd/x509.c
559
cert_free_subjects(n, cid, clen);
sbin/isakmpd/x509.c
580
int n, i;
sbin/isakmpd/x509.c
582
if (!x509_cert_get_subjects(cert, &n, &id, &len)) {
sbin/isakmpd/x509.c
586
for (i = 0; i < n; i++) {
sbin/isakmpd/x509.c
589
cert_free_subjects(n, id, len);
sbin/isakmpd/x509.c
603
cert_free_subjects(n, id, len);
sbin/kbd/kbd_wscons.c
105
for (n = &kbdenc_tab[0]; n->value; n++) {
sbin/kbd/kbd_wscons.c
106
if (n->value == KB_ENCODING(encoding)) {
sbin/kbd/kbd_wscons.c
107
printf("%s", n->name);
sbin/kbd/kbd_wscons.c
115
for (n = &kbdvar_tab[0]; n->value; n++) {
sbin/kbd/kbd_wscons.c
116
if ((n->value & KB_VARIANT(encoding)) == n->value) {
sbin/kbd/kbd_wscons.c
117
printf(".%s", n->name);
sbin/kbd/kbd_wscons.c
118
variant &= ~n->value;
sbin/kbd/kbd_wscons.c
236
struct nameint *n;
sbin/kbd/kbd_wscons.c
243
n = &kbdenc_tab[0];
sbin/kbd/kbd_wscons.c
244
while (n->value) {
sbin/kbd/kbd_wscons.c
245
if (strcmp(n->name, buf) == 0)
sbin/kbd/kbd_wscons.c
246
map = n->value;
sbin/kbd/kbd_wscons.c
247
n++;
sbin/kbd/kbd_wscons.c
258
for (n = &kbdvar_tab[0]; n->value; n++) {
sbin/kbd/kbd_wscons.c
259
if (strcmp(n->name, buf) == 0)
sbin/kbd/kbd_wscons.c
260
v = n->value;
sbin/kbd/kbd_wscons.c
96
struct nameint *n;
sbin/ldattach/atomicio.c
44
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
sbin/ldattach/atomicio.c
53
while (n > pos) {
sbin/ldattach/atomicio.c
54
res = (f) (fd, s + pos, n - pos);
sbin/ldattach/ldattach.c
102
n ? "pty" : "device");
sbin/ldattach/ldattach.c
105
atomicio(vwrite, pfd[1 - n].fd, buf, nread);
sbin/ldattach/ldattach.c
68
int nfds, n, nread;
sbin/ldattach/ldattach.c
90
for (n = 0; n < 2; n++) {
sbin/ldattach/ldattach.c
91
if (!(pfd[n].revents & POLLRDNORM))
sbin/ldattach/ldattach.c
94
nread = read(pfd[n].fd, buf, sizeof(buf));
sbin/ldattach/ldattach.c
97
n ? "pty" : "device");
sbin/mknod/mknod.c
106
node[n].mode = mode;
sbin/mknod/mknod.c
107
node[n].mflag = mflag;
sbin/mknod/mknod.c
108
node[n].name = argv[0];
sbin/mknod/mknod.c
115
node[n].mode |= S_IFIFO;
sbin/mknod/mknod.c
116
node[n].dev = 0;
sbin/mknod/mknod.c
121
node[n].mode |= S_IFBLK;
sbin/mknod/mknod.c
124
node[n].mode |= S_IFCHR;
sbin/mknod/mknod.c
126
node[n].dev = compute_device(argc, argv);
sbin/mknod/mknod.c
133
n++;
sbin/mknod/mknod.c
139
if (n == 0)
sbin/mknod/mknod.c
142
return (domakenodes(node, n));
sbin/mknod/mknod.c
178
domakenodes(struct node *node, int n)
sbin/mknod/mknod.c
184
for (i = 0; i != n; i++) {
sbin/mknod/mknod.c
51
int n = 0;
sbin/mknod/mknod.c
94
node[n].mode = mode | S_IFIFO;
sbin/mknod/mknod.c
95
node[n].mflag = mflag;
sbin/mknod/mknod.c
96
node[n].name = *argv;
sbin/mknod/mknod.c
97
node[n].dev = 0;
sbin/mknod/mknod.c
98
n++;
sbin/ncheck_ffs/ncheck_ffs.c
509
ssize_t n;
sbin/ncheck_ffs/ncheck_ffs.c
599
n = pread(diskfd, sblock, SBLOCKSIZE, (off_t)sblock_try[i]);
sbin/ncheck_ffs/ncheck_ffs.c
600
if (n == SBLOCKSIZE && (sblock->fs_magic == FS_UFS1_MAGIC ||
sbin/newfs/mkfs.c
1016
int n;
sbin/newfs/mkfs.c
1022
n = pread(fsi, bf, size, (off_t)bno * DEV_BSIZE);
sbin/newfs/mkfs.c
1023
if (n != size) {
sbin/newfs/mkfs.c
1034
int n;
sbin/newfs/mkfs.c
1042
n = pwrite(fso, bf, size, (off_t)bno * DEV_BSIZE);
sbin/newfs/mkfs.c
1043
if (n != size) {
sbin/newfs/mkfs.c
1162
int n;
sbin/newfs/mkfs.c
1164
for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
sbin/newfs/mkfs.c
1165
if (1 << n == val)
sbin/newfs/mkfs.c
1166
return (n);
sbin/newfs/newfs.c
177
int fsi = -1, oflagset = 0, fso, len, n;
sbin/newfs/newfs.c
385
n = getmntinfo(&mp, MNT_NOWAIT);
sbin/newfs/newfs.c
386
if (n == 0)
sbin/newfs/newfs.c
394
while (--n >= 0) {
sbin/newfs/newfs.c
795
size_t n;
sbin/newfs/newfs.c
808
n = strlcpy(mountpoint, tmp, len);
sbin/newfs/newfs.c
809
if (n >= len)
sbin/newfs/newfs.c
811
if (mountpoint[n - 1] != '/')
sbin/newfs/newfs.c
813
n = strlcat(mountpoint, "mntXXXXXXXXXX", len);
sbin/newfs/newfs.c
814
if (n >= len)
sbin/newfs_ext2fs/mke2fs.c
1034
uint nblock, i, cylno, n;
sbin/newfs_ext2fs/mke2fs.c
1181
for (n = 0, cylno = 1; cylno < sblock.e2fs_ncg; cylno++) {
sbin/newfs_ext2fs/mke2fs.c
1188
if (n >= NINDIR(&sblock))
sbin/newfs_ext2fs/mke2fs.c
1195
reserved_gdb[n++] = htole32(cgbase(&sblock, cylno) +
sbin/newfs_ext2fs/mke2fs.c
1199
for (; n < NINDIR(&sblock); n++)
sbin/newfs_ext2fs/mke2fs.c
1200
reserved_gdb[n] = 0;
sbin/newfs_ext2fs/mke2fs.c
1364
int n;
sbin/newfs_ext2fs/mke2fs.c
1368
n = pread(fd, bf, size, offset * sectorsize);
sbin/newfs_ext2fs/mke2fs.c
1369
if (n != size)
sbin/newfs_ext2fs/mke2fs.c
1380
int n;
sbin/newfs_ext2fs/mke2fs.c
1386
n = pwrite(fd, bf, size, offset * sectorsize);
sbin/newfs_ext2fs/mke2fs.c
1387
if (n != size)
sbin/newfs_ext2fs/newfs_ext2fs.c
117
int ch, fd, len, n, Fflag, Iflag, Zflag;
sbin/newfs_ext2fs/newfs_ext2fs.c
255
n = getmntinfo(&mp, MNT_NOWAIT);
sbin/newfs_ext2fs/newfs_ext2fs.c
256
if (n == 0)
sbin/newfs_ext2fs/newfs_ext2fs.c
264
while (--n >= 0) {
sbin/newfs_msdos/newfs_msdos.c
249
ssize_t n;
sbin/newfs_msdos/newfs_msdos.c
569
if ((n = read(fd1, img, bpb.bps)) == -1)
sbin/newfs_msdos/newfs_msdos.c
571
if (n != bpb.bps)
sbin/newfs_msdos/newfs_msdos.c
657
if ((n = write(fd, img, bpb.bps)) == -1)
sbin/newfs_msdos/newfs_msdos.c
659
if (n != bpb.bps)
sbin/newfs_msdos/newfs_msdos.c
675
int n, r;
sbin/newfs_msdos/newfs_msdos.c
677
if (!(n = getmntinfo(&mp, MNT_NOWAIT)))
sbin/newfs_msdos/newfs_msdos.c
684
for (; n--; mp++) {
sbin/pfctl/parse.y
1355
struct node_host *n;
sbin/pfctl/parse.y
1358
for (n = $3; n != NULL; n = n->next) {
sbin/pfctl/parse.y
1359
switch (n->addr.type) {
sbin/pfctl/parse.y
1383
n->addr.type);
sbin/pfctl/parse.y
1408
struct node_host *n;
sbin/pfctl/parse.y
1409
for (n = $1; n != NULL; n = n->next)
sbin/pfctl/parse.y
1410
n->weight = $2;
sbin/pfctl/parse.y
1426
struct node_host *n;
sbin/pfctl/parse.y
1433
((n = ifa_exists($3->ifname)) == NULL ||
sbin/pfctl/parse.y
1434
n->af != AF_LINK)) {
sbin/pfctl/parse.y
2909
struct node_host *n;
sbin/pfctl/parse.y
2922
if ((n = ifa_exists($1)) != NULL)
sbin/pfctl/parse.y
2923
$$->ifa_flags = n->ifa_flags;
sbin/pfctl/parse.y
3107
struct node_host *n;
sbin/pfctl/parse.y
3109
for (n = $2; n != NULL; n = n->next)
sbin/pfctl/parse.y
3110
n->not = $1;
sbin/pfctl/parse.y
3217
struct node_host *n;
sbin/pfctl/parse.y
3224
for (n = $1; n != NULL; n = n->next)
sbin/pfctl/parse.y
3225
set_ipmask(n, $3);
sbin/pfctl/parse.y
4037
struct node_host *n;
sbin/pfctl/parse.y
4038
for (n = $1; n != NULL; n = n->next)
sbin/pfctl/parse.y
4039
n->weight = $2;
sbin/pfctl/parse.y
4054
struct node_host *n;
sbin/pfctl/parse.y
4055
for (n = $1; n != NULL; n = n->next)
sbin/pfctl/parse.y
4056
n->weight = $2;
sbin/pfctl/parse.y
4064
struct node_host *n;
sbin/pfctl/parse.y
4065
for (n = $3; n != NULL; n = n->next)
sbin/pfctl/parse.y
4066
n->weight = $4;
sbin/pfctl/parse.y
4589
#define LOOP_THROUGH(T,n,r,C) \
sbin/pfctl/parse.y
4591
T *n; \
sbin/pfctl/parse.y
4598
n = r; \
sbin/pfctl/parse.y
4599
while (n != NULL) { \
sbin/pfctl/parse.y
4603
n = n->next; \
sbin/pfctl/parse.y
4732
char n[4];
sbin/pfctl/parse.y
4739
snprintf(n, sizeof(n), "%u", proto);
sbin/pfctl/parse.y
4740
expand_label_str(label, len, name, n);
sbin/pfctl/parse.y
4748
char n[11];
sbin/pfctl/parse.y
4750
snprintf(n, sizeof(n), "%u", rno);
sbin/pfctl/parse.y
4753
expand_label_str(r->label, PF_RULE_LABEL_SIZE, "$nr", n);
sbin/pfctl/parse.y
4756
expand_label_str(r->tagname, PF_TAG_NAME_SIZE, "$nr", n);
sbin/pfctl/parse.y
4759
expand_label_str(r->match_tagname, PF_TAG_NAME_SIZE, "$nr", n);
sbin/pfctl/parse.y
4845
struct node_host *n;
sbin/pfctl/parse.y
4856
for (n = ds->addr; n != NULL; n = n->next)
sbin/pfctl/parse.y
4857
if (n->af == r->af)
sbin/pfctl/parse.y
4859
if (n == NULL) {
sbin/pfctl/parse.y
4863
r->divert.addr = n->addr.v.a.addr;
sbin/pfctl/parse.y
5461
struct node_host *n;
sbin/pfctl/parse.y
5463
for (n = h; n != NULL; n = n->next)
sbin/pfctl/parse.y
5464
if (n->ifname)
sbin/pfctl/parse.y
5465
free(n->ifname);
sbin/pfctl/parse.y
6172
decide_address_family(struct node_host *n, sa_family_t *af)
sbin/pfctl/parse.y
6174
if (*af != 0 || n == NULL)
sbin/pfctl/parse.y
6176
*af = n->af;
sbin/pfctl/parse.y
6177
while ((n = n->next) != NULL) {
sbin/pfctl/parse.y
6178
if (n->af != *af) {
sbin/pfctl/parse.y
6189
struct node_host *n;
sbin/pfctl/parse.y
6192
for (n = nh; n != NULL; n = n->next) {
sbin/pfctl/parse.y
6193
if (n->addr.type != PF_ADDR_TABLE &&
sbin/pfctl/parse.y
6194
n->addr.type != PF_ADDR_DYNIFTL) {
sbin/pfctl/parse.y
6227
getservice(char *n)
sbin/pfctl/parse.y
6232
if (atoul(n, &ulval) == 0) {
sbin/pfctl/parse.y
6239
s = getservbyname(n, "tcp");
sbin/pfctl/parse.y
6241
s = getservbyname(n, "udp");
sbin/pfctl/parse.y
6243
yyerror("unknown port %s", n);
sbin/pfctl/pfctl.c
1676
struct pfctl_qsitem *n, *p, *q;
sbin/pfctl/pfctl.c
1689
if ((n = calloc(1, sizeof(*n))) == NULL)
sbin/pfctl/pfctl.c
1691
TAILQ_INIT(&n->children);
sbin/pfctl/pfctl.c
1692
bcopy(&p->qs, &n->qs, sizeof(n->qs));
sbin/pfctl/pfctl.c
1693
TAILQ_INSERT_TAIL(&qi->children, n, entries);
sbin/pfctl/pfctl.c
2821
char *n;
sbin/pfctl/pfctl.c
2828
n = dirname(anchorbuf);
sbin/pfctl/pfctl.c
2829
if (n[0] != '.' && n[1] != '\0')
sbin/pfctl/pfctl.c
2830
strlcpy(pr.path, n, sizeof(pr.path));
sbin/pfctl/pfctl.c
2832
n = basename(anchorbuf);
sbin/pfctl/pfctl.c
2833
if (n != NULL)
sbin/pfctl/pfctl.c
2834
strlcpy(pr.name, n, sizeof(pr.name));
sbin/pfctl/pfctl.c
2960
size_t n, len = 0;
sbin/pfctl/pfctl.c
2989
n = ps.ps_len / sizeof(struct pfsync_state);
sbin/pfctl/pfctl.c
2990
if (fwrite(inbuf, sizeof(struct pfsync_state), n, f) < n)
sbin/pfctl/pfctl_osfp.c
140
#define GET_INT(v, mod, n, ty, mx) \
sbin/pfctl/pfctl_osfp.c
141
get_int(&line, &len, &v, mod, n, ty, mx, fp_filename, lineno)
sbin/pfctl/pfctl_osfp.c
142
#define GET_STR(v, n, mn) \
sbin/pfctl/pfctl_osfp.c
143
get_str(&line, &len, &v, n, mn, fp_filename, lineno)
sbin/pfctl/pfctl_parser.c
1348
struct pf_addr *m, *n;
sbin/pfctl/pfctl_parser.c
1370
n = &h->addr.v.a.addr;
sbin/pfctl/pfctl_parser.c
1373
n->addr32[i] = n->addr32[i] & m->addr32[i];
sbin/pfctl/pfctl_parser.c
1379
struct node_host *n = NULL;
sbin/pfctl/pfctl_parser.c
1382
for (n = h; n != NULL; n = n->next) {
sbin/pfctl/pfctl_parser.c
1400
struct node_host *n;
sbin/pfctl/pfctl_parser.c
1405
if ((n = calloc(1, sizeof(*n))) == NULL)
sbin/pfctl/pfctl_parser.c
1407
bcopy(h, n, sizeof(*n));
sbin/pfctl/pfctl_parser.c
1408
n->ifname = NULL;
sbin/pfctl/pfctl_parser.c
1409
n->next = NULL;
sbin/pfctl/pfctl_parser.c
1410
n->tail = NULL;
sbin/pfctl/pfctl_parser.c
1413
if (af == AF_INET && unmask(&n->addr.v.a.mask) > 32)
sbin/pfctl/pfctl_parser.c
1414
set_ipmask(n, 32);
sbin/pfctl/pfctl_parser.c
1416
return (n);
sbin/pfctl/pfctl_parser.c
1427
struct node_host *n = NULL, *h = NULL;
sbin/pfctl/pfctl_parser.c
1438
n = calloc(1, sizeof(struct node_host));
sbin/pfctl/pfctl_parser.c
1439
if (n == NULL)
sbin/pfctl/pfctl_parser.c
1441
n->af = ifa->ifa_addr->sa_family;
sbin/pfctl/pfctl_parser.c
1442
n->ifa_flags = ifa->ifa_flags;
sbin/pfctl/pfctl_parser.c
1444
if (n->af == AF_INET6 &&
sbin/pfctl/pfctl_parser.c
1458
n->ifindex = 0;
sbin/pfctl/pfctl_parser.c
1459
if (n->af == AF_LINK)
sbin/pfctl/pfctl_parser.c
1460
n->ifindex = ((struct sockaddr_dl *)
sbin/pfctl/pfctl_parser.c
1463
copy_satopfaddr(&n->addr.v.a.addr, ifa->ifa_addr);
sbin/pfctl/pfctl_parser.c
1465
copy_satopfaddr(&n->addr.v.a.mask, ifa->ifa_netmask);
sbin/pfctl/pfctl_parser.c
1471
copy_satopfaddr(&n->bcast, ifa->ifa_broadaddr);
sbin/pfctl/pfctl_parser.c
1477
copy_satopfaddr(&n->peer, ifa->ifa_dstaddr);
sbin/pfctl/pfctl_parser.c
1479
if (n->af == AF_INET6)
sbin/pfctl/pfctl_parser.c
1480
n->ifindex = ((struct sockaddr_in6 *)
sbin/pfctl/pfctl_parser.c
1483
if ((n->ifname = strdup(ifa->ifa_name)) == NULL)
sbin/pfctl/pfctl_parser.c
1485
n->next = NULL;
sbin/pfctl/pfctl_parser.c
1486
n->tail = n;
sbin/pfctl/pfctl_parser.c
1488
h = n;
sbin/pfctl/pfctl_parser.c
1490
h->tail->next = n;
sbin/pfctl/pfctl_parser.c
1491
h->tail = n;
sbin/pfctl/pfctl_parser.c
1530
struct node_host *n;
sbin/pfctl/pfctl_parser.c
1544
if ((n = calloc(1, sizeof(*n))) == NULL)
sbin/pfctl/pfctl_parser.c
1546
if ((n->ifname = strdup(ifa_name)) == NULL)
sbin/pfctl/pfctl_parser.c
1549
return (n);
sbin/pfctl/pfctl_parser.c
1553
for (n = iftab; n; n = n->next) {
sbin/pfctl/pfctl_parser.c
1554
if (n->af == AF_LINK && !strncmp(n->ifname, ifa_name, IFNAMSIZ))
sbin/pfctl/pfctl_parser.c
1555
return (n);
sbin/pfctl/pfctl_parser.c
1567
struct node_host *n, *h = NULL;
sbin/pfctl/pfctl_parser.c
1587
if ((n = ifa_lookup(ifg->ifgrq_member, flags)) == NULL)
sbin/pfctl/pfctl_parser.c
1590
h = n;
sbin/pfctl/pfctl_parser.c
1592
h->tail->next = n;
sbin/pfctl/pfctl_parser.c
1593
h->tail = n->tail;
sbin/pfctl/pfctl_parser.c
1605
struct node_host *p = NULL, *h = NULL, *n = NULL;
sbin/pfctl/pfctl_parser.c
1644
n = calloc(1, sizeof(struct node_host));
sbin/pfctl/pfctl_parser.c
1645
if (n == NULL)
sbin/pfctl/pfctl_parser.c
1647
n->af = p->af;
sbin/pfctl/pfctl_parser.c
1649
memcpy(&n->addr.v.a.addr, &p->bcast,
sbin/pfctl/pfctl_parser.c
1652
memcpy(&n->addr.v.a.addr, &p->peer,
sbin/pfctl/pfctl_parser.c
1655
memcpy(&n->addr.v.a.addr, &p->addr.v.a.addr,
sbin/pfctl/pfctl_parser.c
1658
set_ipmask(n, unmask(&p->addr.v.a.mask));
sbin/pfctl/pfctl_parser.c
1660
set_ipmask(n, -1);
sbin/pfctl/pfctl_parser.c
1661
n->ifindex = p->ifindex;
sbin/pfctl/pfctl_parser.c
1663
n->next = NULL;
sbin/pfctl/pfctl_parser.c
1664
n->tail = n;
sbin/pfctl/pfctl_parser.c
1666
h = n;
sbin/pfctl/pfctl_parser.c
1668
h->tail->next = n;
sbin/pfctl/pfctl_parser.c
1669
h->tail = n;
sbin/pfctl/pfctl_parser.c
1678
int n;
sbin/pfctl/pfctl_parser.c
1686
n = strlen(filter);
sbin/pfctl/pfctl_parser.c
1687
if (n < 1 || n >= IFNAMSIZ)
sbin/pfctl/pfctl_parser.c
1689
if (filter[n-1] >= '0' && filter[n-1] <= '9')
sbin/pfctl/pfctl_parser.c
1691
if (strncmp(p->ifname, filter, n))
sbin/pfctl/pfctl_parser.c
1693
return (p->ifname[n] < '0' || p->ifname[n] > '9');
sbin/pfctl/pfctl_parser.c
1699
struct node_host *h = NULL, *n;
sbin/pfctl/pfctl_parser.c
1723
for (n = h; n != NULL; n = n->next) {
sbin/pfctl/pfctl_parser.c
1724
n->addr.type = PF_ADDR_ADDRMASK;
sbin/pfctl/pfctl_parser.c
1725
n->weight = 0;
sbin/pfctl/pfctl_parser.c
1736
struct node_host *n, *h = NULL;
sbin/pfctl/pfctl_parser.c
1768
for (n = h; n != NULL; n = n->next)
sbin/pfctl/pfctl_parser.c
1769
set_ipmask(n, mask);
sbin/pfctl/pfctl_parser.c
1822
struct node_host *n, *h = NULL;
sbin/pfctl/pfctl_parser.c
1855
n = calloc(1, sizeof(struct node_host));
sbin/pfctl/pfctl_parser.c
1856
if (n == NULL)
sbin/pfctl/pfctl_parser.c
1858
n->ifname = NULL;
sbin/pfctl/pfctl_parser.c
1859
n->af = res->ai_family;
sbin/pfctl/pfctl_parser.c
1860
copy_satopfaddr(&n->addr.v.a.addr, res->ai_addr);
sbin/pfctl/pfctl_parser.c
1862
n->ifindex =
sbin/pfctl/pfctl_parser.c
1864
set_ipmask(n, mask);
sbin/pfctl/pfctl_parser.c
1865
n->next = NULL;
sbin/pfctl/pfctl_parser.c
1866
n->tail = n;
sbin/pfctl/pfctl_parser.c
1868
h = n;
sbin/pfctl/pfctl_parser.c
1870
h->tail->next = n;
sbin/pfctl/pfctl_parser.c
1871
h->tail = n;
sbin/pfctl/pfctl_parser.c
1892
struct node_host *h, *n;
sbin/pfctl/pfctl_parser.c
1926
if ((n = host(r, opts)) == NULL) {
sbin/pfctl/pfctl_parser.c
1930
rv = append_addr_host(b, n, test, not);
sbin/pfctl/pfctl_parser.c
1933
h = n;
sbin/pfctl/pfctl_parser.c
1934
n = n->next;
sbin/pfctl/pfctl_parser.c
1936
} while (n != NULL);
sbin/pfctl/pfctl_parser.c
1947
append_addr_host(struct pfr_buffer *b, struct node_host *n, int test, int not)
sbin/pfctl/pfctl_parser.c
1954
addr.pfra_not = n->not ^ not;
sbin/pfctl/pfctl_parser.c
1955
addr.pfra_af = n->af;
sbin/pfctl/pfctl_parser.c
1956
addr.pfra_net = unmask(&n->addr.v.a.mask);
sbin/pfctl/pfctl_parser.c
1957
if (n->ifname) {
sbin/pfctl/pfctl_parser.c
1958
if (strlcpy(addr.pfra_ifname, n->ifname,
sbin/pfctl/pfctl_parser.c
1963
if (n->weight > 0) {
sbin/pfctl/pfctl_parser.c
1964
addr.pfra_weight = n->weight;
sbin/pfctl/pfctl_parser.c
1967
switch (n->af) {
sbin/pfctl/pfctl_parser.c
1969
addr.pfra_ip4addr.s_addr = n->addr.v.a.addr.addr32[0];
sbin/pfctl/pfctl_parser.c
1973
memcpy(&addr.pfra_ip6addr, &n->addr.v.a.addr.v6,
sbin/pfctl/pfctl_parser.c
1988
} while ((n = n->next) != NULL);
sbin/pflogd/pflogd.c
114
size_t len = 0, n;
sbin/pflogd/pflogd.c
120
for (n = 0; argv[n]; n++)
sbin/pflogd/pflogd.c
121
len += strlen(argv[n])+1;
sbin/pflogd/pflogd.c
130
for (n = 1; argv[n]; n++) {
sbin/pflogd/pflogd.c
132
strlcat(buf, argv[n], len);
sbin/pflogd/privsep.c
327
may_read(int fd, void *buf, size_t n)
sbin/pflogd/privsep.c
332
while (n > pos) {
sbin/pflogd/privsep.c
333
res = read(fd, s + pos, n - pos);
sbin/pflogd/privsep.c
350
must_read(int fd, void *buf, size_t n)
sbin/pflogd/privsep.c
355
while (n > pos) {
sbin/pflogd/privsep.c
356
res = read(fd, s + pos, n - pos);
sbin/pflogd/privsep.c
372
must_write(int fd, void *buf, size_t n)
sbin/pflogd/privsep.c
377
while (n > pos) {
sbin/pflogd/privsep.c
378
res = write(fd, s + pos, n - pos);
sbin/pflogd/privsep_fdpass.c
110
if ((n = recvmsg(sock, &msg, 0)) == -1) {
sbin/pflogd/privsep_fdpass.c
114
if (n != sizeof(int))
sbin/pflogd/privsep_fdpass.c
116
__func__, (long)n);
sbin/pflogd/privsep_fdpass.c
60
ssize_t n;
sbin/pflogd/privsep_fdpass.c
81
if ((n = sendmsg(sock, &msg, 0)) == -1)
sbin/pflogd/privsep_fdpass.c
83
if (n != sizeof(int))
sbin/pflogd/privsep_fdpass.c
85
__func__, (long)n);
sbin/pflogd/privsep_fdpass.c
98
ssize_t n;
sbin/resolvd/resolvd.c
313
ssize_t n;
sbin/resolvd/resolvd.c
315
n = read(unwindsock, buf, sizeof(buf));
sbin/resolvd/resolvd.c
316
if (n == -1) {
sbin/resolvd/resolvd.c
320
if (n == 0 || n == -1) {
sbin/resolvd/resolvd.c
321
if (n == -1)
sbin/resolvd/resolvd.c
329
lwarnx("read %ld from unwind ctl", n);
sbin/resolvd/resolvd.c
356
ssize_t n;
sbin/resolvd/resolvd.c
359
if ((n = read(fd, rsock_buf, sizeof(rsock_buf))) == -1) {
sbin/resolvd/resolvd.c
366
if (n == 0)
sbin/resolvd/resolvd.c
369
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
sbin/resolvd/resolvd.c
370
lwarnx("partial rtm of %zd in buffer", n);
sbin/route/route.c
1140
int n;
sbin/route/route.c
1147
if ((n = read(s, msg, sizeof(msg))) == -1) {
sbin/route/route.c
1155
printf("got message of size %d on %s", n, ct);
sbin/route/route.c
1157
printf("got message of size %d on %lld\n", n, now);
sbin/route/route.c
1158
print_rtmsg((struct rt_msghdr *)msg, n);
sbin/route/route.c
148
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
sbin/route/show.c
63
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
sbin/scan_ffs/scan_ffs.c
100
if (((blk+(n/512)) - lastblk) == (SBSIZE/512)) {
sbin/scan_ffs/scan_ffs.c
102
(long long)(blk + (n/512) -
sbin/scan_ffs/scan_ffs.c
108
if ((n + size) < (SBSIZE * SBCOUNT))
sbin/scan_ffs/scan_ffs.c
109
n += size;
sbin/scan_ffs/scan_ffs.c
119
lastblk = blk + (n/512);
sbin/scan_ffs/scan_ffs.c
79
int n;
sbin/scan_ffs/scan_ffs.c
91
for (n = 0; n < (SBSIZE * SBCOUNT); n += 512){
sbin/scan_ffs/scan_ffs.c
92
sb = (struct fs*)(&buf[n]);
sbin/scan_ffs/scan_ffs.c
96
(long long)(blk + (n/512)),
sbin/slaacd/control.c
231
ssize_t n;
sbin/slaacd/control.c
255
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
sbin/slaacd/control.c
259
if (n == 0)
sbin/slaacd/engine.c
462
ssize_t n;
sbin/slaacd/engine.c
470
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/slaacd/engine.c
472
if (n == 0) /* Connection closed. */
sbin/slaacd/engine.c
485
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/slaacd/engine.c
487
if (n == 0) /* No more messages. */
sbin/slaacd/engine.c
633
ssize_t n;
sbin/slaacd/engine.c
638
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/slaacd/engine.c
640
if (n == 0) /* Connection closed. */
sbin/slaacd/engine.c
653
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/slaacd/engine.c
655
if (n == 0) /* No more messages. */
sbin/slaacd/frontend.c
286
ssize_t n;
sbin/slaacd/frontend.c
291
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/slaacd/frontend.c
293
if (n == 0) /* Connection closed. */
sbin/slaacd/frontend.c
306
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/slaacd/frontend.c
308
if (n == 0) /* No more messages. */
sbin/slaacd/frontend.c
399
ssize_t n;
sbin/slaacd/frontend.c
404
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/slaacd/frontend.c
406
if (n == 0) /* Connection closed. */
sbin/slaacd/frontend.c
419
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/slaacd/frontend.c
421
if (n == 0) /* No more messages. */
sbin/slaacd/frontend.c
679
ssize_t n;
sbin/slaacd/frontend.c
687
if ((n = read(fd, buf, ROUTE_SOCKET_BUF_SIZE)) == -1) {
sbin/slaacd/frontend.c
694
if (n == 0)
sbin/slaacd/frontend.c
697
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
sbin/slaacd/frontend.c
698
log_warnx("partial rtm of %zd in buffer", n);
sbin/slaacd/slaacd.c
393
ssize_t n;
sbin/slaacd/slaacd.c
404
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/slaacd/slaacd.c
406
if (n == 0) /* Connection closed. */
sbin/slaacd/slaacd.c
419
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/slaacd/slaacd.c
421
if (n == 0) /* No more messages. */
sbin/slaacd/slaacd.c
477
ssize_t n;
sbin/slaacd/slaacd.c
484
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/slaacd/slaacd.c
486
if (n == 0) /* Connection closed. */
sbin/slaacd/slaacd.c
499
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/slaacd/slaacd.c
501
if (n == 0) /* No more messages. */
sbin/tunefs/tunefs.c
245
int n;
sbin/tunefs/tunefs.c
248
n = strtonum(num, min, max, &errstr);
sbin/tunefs/tunefs.c
251
return (n);
sbin/umount/umount.c
123
int n;
sbin/umount/umount.c
126
n = getmntinfo(&fs, MNT_NOWAIT);
sbin/umount/umount.c
127
if (n == 0)
sbin/umount/umount.c
131
while (--n >= 0) {
sbin/umount/umount.c
133
if (strncmp(fs[n].f_mntonname, "/", MNAMELEN) == 0)
sbin/umount/umount.c
135
if (!selected(fs[n].f_fstypename))
sbin/umount/umount.c
137
if (umountfs(fs[n].f_mntonname))
sbin/umount/umount.c
260
int n;
sbin/umount/umount.c
262
if ((n = getmntinfo(&mntbuf, MNT_NOWAIT)) == 0) {
sbin/umount/umount.c
266
while (--n >= 0) {
sbin/umount/umount.c
268
(strncmp(mntbuf[n].f_mntfromname, name, MNAMELEN) == 0 ||
sbin/umount/umount.c
269
strncmp(mntbuf[n].f_mntfromspec, name, MNAMELEN) == 0)) {
sbin/umount/umount.c
271
memcpy(type, mntbuf[n].f_fstypename,
sbin/umount/umount.c
272
sizeof(mntbuf[n].f_fstypename));
sbin/umount/umount.c
273
return (mntbuf[n].f_mntonname);
sbin/umount/umount.c
276
(strncmp(mntbuf[n].f_mntonname, name, MNAMELEN) == 0)) {
sbin/umount/umount.c
278
memcpy(type, mntbuf[n].f_fstypename,
sbin/umount/umount.c
279
sizeof(mntbuf[n].f_fstypename));
sbin/umount/umount.c
280
return (mntbuf[n].f_mntfromname);
sbin/unwind/control.c
230
ssize_t n;
sbin/unwind/control.c
259
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
sbin/unwind/control.c
263
if (n == 0)
sbin/unwind/frontend.c
1285
ssize_t n;
sbin/unwind/frontend.c
1293
if ((n = read(fd, buf, ROUTE_SOCKET_BUF_SIZE)) == -1) {
sbin/unwind/frontend.c
1300
if (n == 0)
sbin/unwind/frontend.c
1303
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
sbin/unwind/frontend.c
1304
log_warnx("partial rtm of %zd in buffer", n);
sbin/unwind/frontend.c
1450
ssize_t n, sz;
sbin/unwind/frontend.c
1457
while ((n = read(fd, buf, sizeof(buf))) > 0) {
sbin/unwind/frontend.c
1458
p = recallocarray(str, sz, sz + n, 1);
sbin/unwind/frontend.c
1464
memcpy(str + sz, buf, n);
sbin/unwind/frontend.c
1465
sz += n;
sbin/unwind/frontend.c
1468
if (n == -1) {
sbin/unwind/frontend.c
1514
ssize_t n;
sbin/unwind/frontend.c
1523
if ((n = asprintf(&str, "%s\n", ta->ta)) == -1) {
sbin/unwind/frontend.c
1528
len += n;
sbin/unwind/frontend.c
1529
if (write(fd, str, n) != n) {
sbin/unwind/frontend.c
1603
struct bl_node *n, *nxt;
sbin/unwind/frontend.c
1605
RB_FOREACH_SAFE(n, bl_tree, &bl_head, nxt) {
sbin/unwind/frontend.c
1606
RB_REMOVE(bl_tree, &bl_head, n);
sbin/unwind/frontend.c
1607
free(n->domain);
sbin/unwind/frontend.c
1608
free(n);
sbin/unwind/frontend.c
1706
ssize_t n;
sbin/unwind/frontend.c
1710
n = read(fd, sldns_buffer_current(pq->qbuf),
sbin/unwind/frontend.c
1713
switch (n) {
sbin/unwind/frontend.c
1730
sldns_buffer_skip(pq->qbuf, n);
sbin/unwind/frontend.c
1769
ssize_t n;
sbin/unwind/frontend.c
1773
n = write(fd, sldns_buffer_current(pq->abuf),
sbin/unwind/frontend.c
1776
if (n == -1) {
sbin/unwind/frontend.c
1782
sldns_buffer_skip(pq->abuf, n);
sbin/unwind/frontend.c
316
int n, shut = 0;
sbin/unwind/frontend.c
319
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/unwind/frontend.c
321
if (n == 0) /* Connection closed. */
sbin/unwind/frontend.c
334
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/unwind/frontend.c
336
if (n == 0) /* No more messages. */
sbin/unwind/frontend.c
498
int n, shut = 0, chg;
sbin/unwind/frontend.c
501
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/unwind/frontend.c
503
if (n == 0) /* Connection closed. */
sbin/unwind/frontend.c
516
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/unwind/frontend.c
518
if (n == 0) /* No more messages. */
sbin/unwind/libunbound/config.h
1427
void *memmove(void *dest, const void *src, size_t n);
sbin/unwind/libunbound/config.h
1491
int memcmp(const void *x, const void *y, size_t n);
sbin/unwind/libunbound/config.h
1556
void arc4random_buf(void* buf, size_t n);
sbin/unwind/libunbound/config.h
1604
# define calloc(n,s) unbound_stat_calloc_log(n, s, __FILE__, __LINE__, __func__)
sbin/unwind/libunbound/config.h
1609
# define reallocarray(p,n,s) unbound_stat_reallocarray_log(p, n, s, __FILE__, __LINE__, __func__)
sbin/unwind/libunbound/daemon/worker.h
153
struct worker* worker_create(struct daemon* daemon, int id, int* ports, int n);
sbin/unwind/libunbound/dns64/dns64.c
177
uitoa(unsigned n, char* s)
sbin/unwind/libunbound/dns64/dns64.c
181
*ss++ = '0' + n % 10;
sbin/unwind/libunbound/dns64/dns64.c
182
} while (n /= 10);
sbin/unwind/libunbound/dns64/dns64.c
423
struct name_tree_node* n = (struct name_tree_node*)node;
sbin/unwind/libunbound/dns64/dns64.c
424
if(!n) return;
sbin/unwind/libunbound/dns64/dns64.c
425
free(n->name);
sbin/unwind/libunbound/dns64/dns64.c
426
free(n);
sbin/unwind/libunbound/iterator/iter_delegpt.c
379
size_t n = 0;
sbin/unwind/libunbound/iterator/iter_delegpt.c
381
n++;
sbin/unwind/libunbound/iterator/iter_delegpt.c
382
return n;
sbin/unwind/libunbound/iterator/iter_delegpt.c
389
size_t n = 0, nlame = 0;
sbin/unwind/libunbound/iterator/iter_delegpt.c
392
n++;
sbin/unwind/libunbound/iterator/iter_delegpt.c
395
if(alllame && n == nlame) *alllame = 1;
sbin/unwind/libunbound/iterator/iter_delegpt.c
396
return n;
sbin/unwind/libunbound/iterator/iter_delegpt.c
611
struct delegpt_ns* n, *nn;
sbin/unwind/libunbound/iterator/iter_delegpt.c
615
n = dp->nslist;
sbin/unwind/libunbound/iterator/iter_delegpt.c
616
while(n) {
sbin/unwind/libunbound/iterator/iter_delegpt.c
617
nn = n->next;
sbin/unwind/libunbound/iterator/iter_delegpt.c
618
free(n->name);
sbin/unwind/libunbound/iterator/iter_delegpt.c
619
free(n->tls_auth_name);
sbin/unwind/libunbound/iterator/iter_delegpt.c
620
free(n);
sbin/unwind/libunbound/iterator/iter_delegpt.c
621
n = nn;
sbin/unwind/libunbound/iterator/iter_fwd.c
488
rbnode_type* n;
sbin/unwind/libunbound/iterator/iter_fwd.c
492
n = rbtree_first(fwd->tree);
sbin/unwind/libunbound/iterator/iter_fwd.c
493
if(n == RBTREE_NULL)
sbin/unwind/libunbound/iterator/iter_fwd.c
495
p = (struct iter_forward_zone*)n;
sbin/unwind/libunbound/iterator/iter_fwd.c
512
n = NULL;
sbin/unwind/libunbound/iterator/iter_fwd.c
513
if(rbtree_find_less_equal(fwd->tree, &key, &n)) {
sbin/unwind/libunbound/iterator/iter_fwd.c
518
if(!n || n == RBTREE_NULL)
sbin/unwind/libunbound/iterator/iter_fwd.c
520
n = rbtree_next(n);
sbin/unwind/libunbound/iterator/iter_fwd.c
521
if(n == RBTREE_NULL)
sbin/unwind/libunbound/iterator/iter_fwd.c
523
p = (struct iter_forward_zone*)n;
sbin/unwind/libunbound/iterator/iter_fwd.c
78
static void fwd_zone_free(struct iter_forward_zone* n)
sbin/unwind/libunbound/iterator/iter_fwd.c
80
if(!n) return;
sbin/unwind/libunbound/iterator/iter_fwd.c
81
delegpt_free_mlc(n->dp);
sbin/unwind/libunbound/iterator/iter_fwd.c
82
free(n->name);
sbin/unwind/libunbound/iterator/iter_fwd.c
83
free(n);
sbin/unwind/libunbound/iterator/iter_fwd.c
86
static void delfwdnode(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/iterator/iter_fwd.c
88
struct iter_forward_zone* node = (struct iter_forward_zone*)n;
sbin/unwind/libunbound/iterator/iter_hints.c
72
static void delhintnode(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/iterator/iter_hints.c
74
struct iter_hints_stub* node = (struct iter_hints_stub*)n;
sbin/unwind/libunbound/iterator/iter_priv.c
100
if(!addr_tree_insert(&priv->a, n, &addr, addrlen, net)) {
sbin/unwind/libunbound/iterator/iter_priv.c
113
struct name_tree_node* n;
sbin/unwind/libunbound/iterator/iter_priv.c
132
n = (struct name_tree_node*)regional_alloc(priv->region,
sbin/unwind/libunbound/iterator/iter_priv.c
133
sizeof(*n));
sbin/unwind/libunbound/iterator/iter_priv.c
134
if(!n) {
sbin/unwind/libunbound/iterator/iter_priv.c
138
if(!name_tree_insert(&priv->n, n, nmr, nm_len, nm_labs,
sbin/unwind/libunbound/iterator/iter_priv.c
152
name_tree_init(&priv->n);
sbin/unwind/libunbound/iterator/iter_priv.c
162
name_tree_init_parents(&priv->n);
sbin/unwind/libunbound/iterator/iter_priv.c
201
return name_tree_lookup(&priv->n, decomp, len, labs, dclass) != NULL;
sbin/unwind/libunbound/iterator/iter_priv.c
66
name_tree_init(&priv->n);
sbin/unwind/libunbound/iterator/iter_priv.c
82
struct addr_tree_node* n;
sbin/unwind/libunbound/iterator/iter_priv.c
94
n = (struct addr_tree_node*)regional_alloc(priv->region,
sbin/unwind/libunbound/iterator/iter_priv.c
95
sizeof(*n));
sbin/unwind/libunbound/iterator/iter_priv.c
96
if(!n) {
sbin/unwind/libunbound/iterator/iter_priv.h
70
rbtree_type n;
sbin/unwind/libunbound/iterator/iter_utils.c
129
caps_free(struct rbnode_type* n, void* ATTR_UNUSED(d))
sbin/unwind/libunbound/iterator/iter_utils.c
131
if(n) {
sbin/unwind/libunbound/iterator/iter_utils.c
132
free(((struct name_tree_node*)n)->name);
sbin/unwind/libunbound/iterator/iter_utils.c
133
free(n);
sbin/unwind/libunbound/iterator/iter_utils.c
151
struct name_tree_node* n;
sbin/unwind/libunbound/iterator/iter_utils.c
158
n = (struct name_tree_node*)calloc(1, sizeof(*n));
sbin/unwind/libunbound/iterator/iter_utils.c
159
if(!n) {
sbin/unwind/libunbound/iterator/iter_utils.c
164
n->node.key = n;
sbin/unwind/libunbound/iterator/iter_utils.c
165
n->name = nm;
sbin/unwind/libunbound/iterator/iter_utils.c
166
n->len = len;
sbin/unwind/libunbound/iterator/iter_utils.c
167
n->labs = dname_count_labels(nm);
sbin/unwind/libunbound/iterator/iter_utils.c
168
n->dclass = LDNS_RR_CLASS_IN;
sbin/unwind/libunbound/iterator/iter_utils.c
169
if(!name_tree_insert(ntree, n, nm, len, n->labs, n->dclass)) {
sbin/unwind/libunbound/iterator/iter_utils.c
171
free(n->name);
sbin/unwind/libunbound/iterator/iter_utils.c
172
free(n);
sbin/unwind/libunbound/iterator/iter_utils.c
403
nth_rtt(struct delegpt_addr* result_list, size_t num_results, size_t n)
sbin/unwind/libunbound/iterator/iter_utils.c
409
if(num_results < 1 || n >= num_results) {
sbin/unwind/libunbound/iterator/iter_utils.c
429
log_assert(n > 0);
sbin/unwind/libunbound/iterator/iter_utils.c
430
rtt_band = rtt_list[n-1];
sbin/unwind/libunbound/iterator/iter_utils.c
447
struct delegpt_addr* a, *n, *prev=NULL;
sbin/unwind/libunbound/iterator/iter_utils.c
499
n = a->next_result;
sbin/unwind/libunbound/iterator/iter_utils.c
500
prev->next_result = n;
sbin/unwind/libunbound/iterator/iter_utils.c
503
a = n;
sbin/unwind/libunbound/iterator/iter_utils.c
552
n = a->next_result;
sbin/unwind/libunbound/iterator/iter_utils.c
553
prev->next_result = n;
sbin/unwind/libunbound/iterator/iter_utils.c
556
a = n;
sbin/unwind/libunbound/iterator/iter_utils.c
610
n = a->next_result;
sbin/unwind/libunbound/iterator/iter_utils.c
611
prev->next_result = n;
sbin/unwind/libunbound/iterator/iter_utils.c
614
a = n;
sbin/unwind/libunbound/iterator/iter_utils.c
748
iter_ns_probability(struct ub_randstate* rnd, int n, int m)
sbin/unwind/libunbound/iterator/iter_utils.c
751
if(n == m) /* 100% chance */
sbin/unwind/libunbound/iterator/iter_utils.c
756
return (sel < n);
sbin/unwind/libunbound/iterator/iter_utils.h
166
int iter_ns_probability(struct ub_randstate* rnd, int n, int m);
sbin/unwind/libunbound/iterator/iterator.c
3977
size_t n = from->rep->rrset_count+to->rep->rrset_count;
sbin/unwind/libunbound/iterator/iterator.c
3988
dest = regional_alloc(forq->region, sizeof(dest[0])*n);
sbin/unwind/libunbound/iterator/iterator.c
4022
to->rep->rrset_count = n;
sbin/unwind/libunbound/libunbound/libunbound.c
256
delq(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/libunbound/libunbound.c
258
struct ctx_query* q = (struct ctx_query*)n;
sbin/unwind/libunbound/respip/respip.c
75
resp_addr_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/respip/respip.c
77
struct resp_addr* r = (struct resp_addr*)n->key;
sbin/unwind/libunbound/services/authzone.c
1587
char* n = sldns_wire2str_dname(z->name, z->namelen);
sbin/unwind/libunbound/services/authzone.c
1591
zfilename, n?n:"error");
sbin/unwind/libunbound/services/authzone.c
1592
free(n);
sbin/unwind/libunbound/services/authzone.c
1596
zfilename, n?n:"error", strerror(errno));
sbin/unwind/libunbound/services/authzone.c
1597
free(n);
sbin/unwind/libunbound/services/authzone.c
1618
char* n = sldns_wire2str_dname(z->name, z->namelen);
sbin/unwind/libunbound/services/authzone.c
1620
zfilename, n?n:"error");
sbin/unwind/libunbound/services/authzone.c
1621
free(n);
sbin/unwind/libunbound/services/authzone.c
1707
auth_zone_write_domain(struct auth_zone* z, struct auth_data* n, FILE* out)
sbin/unwind/libunbound/services/authzone.c
1711
if(z->namelen == n->namelen) {
sbin/unwind/libunbound/services/authzone.c
1712
struct auth_rrset* soa = az_domain_rrset(n, LDNS_RR_TYPE_SOA);
sbin/unwind/libunbound/services/authzone.c
1714
if(!auth_zone_write_rrset(z, n, soa, out))
sbin/unwind/libunbound/services/authzone.c
1719
for(r = n->rrsets; r; r = r->next) {
sbin/unwind/libunbound/services/authzone.c
1720
if(z->namelen == n->namelen &&
sbin/unwind/libunbound/services/authzone.c
1723
if(!auth_zone_write_rrset(z, n, r, out))
sbin/unwind/libunbound/services/authzone.c
1732
struct auth_data* n;
sbin/unwind/libunbound/services/authzone.c
1738
RBTREE_FOR(n, struct auth_data*, &z->data) {
sbin/unwind/libunbound/services/authzone.c
1739
if(!auth_zone_write_domain(z, n, out)) {
sbin/unwind/libunbound/services/authzone.c
2297
struct auth_addr *n;
sbin/unwind/libunbound/services/authzone.c
2299
n = list->next;
sbin/unwind/libunbound/services/authzone.c
2301
list = n;
sbin/unwind/libunbound/services/authzone.c
2309
struct auth_master* n;
sbin/unwind/libunbound/services/authzone.c
2311
n = list->next;
sbin/unwind/libunbound/services/authzone.c
2316
list = n;
sbin/unwind/libunbound/services/authzone.c
2351
auth_zone_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
2353
struct auth_zone* z = (struct auth_zone*)n->key;
sbin/unwind/libunbound/services/authzone.c
2359
auth_xfer_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
2361
struct auth_xfer* z = (struct auth_xfer*)n->key;
sbin/unwind/libunbound/services/authzone.c
2377
domain_has_only_nsec3(struct auth_data* n)
sbin/unwind/libunbound/services/authzone.c
2379
struct auth_rrset* rrset = n->rrsets;
sbin/unwind/libunbound/services/authzone.c
2430
struct auth_data* n)
sbin/unwind/libunbound/services/authzone.c
2434
if(n) {
sbin/unwind/libunbound/services/authzone.c
2435
nm = dname_get_shared_topdomain(qinfo->qname, n->name);
sbin/unwind/libunbound/services/authzone.c
2440
n = az_find_name(z, nm, nmlen);
sbin/unwind/libunbound/services/authzone.c
2442
while(!n) {
sbin/unwind/libunbound/services/authzone.c
2445
n = az_find_name(z, nm, nmlen);
sbin/unwind/libunbound/services/authzone.c
2447
return n;
sbin/unwind/libunbound/services/authzone.c
2452
az_domain_go_up(struct auth_zone* z, struct auth_data* n)
sbin/unwind/libunbound/services/authzone.c
2454
uint8_t* nm = n->name;
sbin/unwind/libunbound/services/authzone.c
2455
size_t nmlen = n->namelen;
sbin/unwind/libunbound/services/authzone.c
2457
if((n=az_find_name(z, nm, nmlen)) != NULL)
sbin/unwind/libunbound/services/authzone.c
2458
return n;
sbin/unwind/libunbound/services/authzone.c
2480
struct auth_data* n = node;
sbin/unwind/libunbound/services/authzone.c
2486
n = az_find_candidate_ce(z, qinfo, n);
sbin/unwind/libunbound/services/authzone.c
2489
*ce = n;
sbin/unwind/libunbound/services/authzone.c
2493
if(n && domain_has_only_nsec3(n)) {
sbin/unwind/libunbound/services/authzone.c
2500
while(n) {
sbin/unwind/libunbound/services/authzone.c
2503
if(n->namelen != z->namelen &&
sbin/unwind/libunbound/services/authzone.c
2504
(lookrrset=az_domain_rrset(n, LDNS_RR_TYPE_NS)) &&
sbin/unwind/libunbound/services/authzone.c
2507
n->namelen != qinfo->qname_len)) {
sbin/unwind/libunbound/services/authzone.c
2510
*ce = n;
sbin/unwind/libunbound/services/authzone.c
2515
if(n->namelen != qinfo->qname_len &&
sbin/unwind/libunbound/services/authzone.c
2516
(lookrrset=az_domain_rrset(n, LDNS_RR_TYPE_DNAME))) {
sbin/unwind/libunbound/services/authzone.c
2518
*ce = n;
sbin/unwind/libunbound/services/authzone.c
2523
if(*ce == NULL && !domain_has_only_nsec3(n)) {
sbin/unwind/libunbound/services/authzone.c
2526
*ce = n;
sbin/unwind/libunbound/services/authzone.c
2530
n = az_domain_go_up(z, n);
sbin/unwind/libunbound/services/authzone.c
367
auth_data_delete(struct auth_data* n)
sbin/unwind/libunbound/services/authzone.c
370
if(!n) return;
sbin/unwind/libunbound/services/authzone.c
371
p = n->rrsets;
sbin/unwind/libunbound/services/authzone.c
377
free(n->name);
sbin/unwind/libunbound/services/authzone.c
378
free(n);
sbin/unwind/libunbound/services/authzone.c
383
auth_data_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/authzone.c
385
struct auth_data* z = (struct auth_data*)n->key;
sbin/unwind/libunbound/services/authzone.c
592
struct auth_data* n = (struct auth_data*)malloc(sizeof(*n));
sbin/unwind/libunbound/services/authzone.c
593
if(!n) return NULL;
sbin/unwind/libunbound/services/authzone.c
594
memset(n, 0, sizeof(*n));
sbin/unwind/libunbound/services/authzone.c
595
n->node.key = n;
sbin/unwind/libunbound/services/authzone.c
596
n->name = memdup(nm, nmlen);
sbin/unwind/libunbound/services/authzone.c
597
if(!n->name) {
sbin/unwind/libunbound/services/authzone.c
598
free(n);
sbin/unwind/libunbound/services/authzone.c
601
n->namelen = nmlen;
sbin/unwind/libunbound/services/authzone.c
602
n->namelabs = dname_count_labels(nm);
sbin/unwind/libunbound/services/authzone.c
603
if(!rbtree_insert(&z->data, &n->node)) {
sbin/unwind/libunbound/services/authzone.c
605
free(n->name);
sbin/unwind/libunbound/services/authzone.c
606
free(n);
sbin/unwind/libunbound/services/authzone.c
609
return n;
sbin/unwind/libunbound/services/authzone.c
643
struct auth_data* n = az_find_name(z, dname, dname_len);
sbin/unwind/libunbound/services/authzone.c
644
if(!n) {
sbin/unwind/libunbound/services/authzone.c
645
n = az_domain_create(z, dname, dname_len);
sbin/unwind/libunbound/services/authzone.c
647
return n;
sbin/unwind/libunbound/services/authzone.c
652
az_domain_rrset(struct auth_data* n, uint16_t t)
sbin/unwind/libunbound/services/authzone.c
655
if(!n) return NULL;
sbin/unwind/libunbound/services/authzone.c
656
rrset = n->rrsets;
sbin/unwind/libunbound/services/authzone.c
7713
struct auth_data* n;
sbin/unwind/libunbound/services/authzone.c
7714
RBTREE_FOR(n, struct auth_data*, &z->data) {
sbin/unwind/libunbound/services/authzone.c
7715
if(!zonemd_simple_domain(z, hashalgo, h, n, region, buf,
sbin/unwind/libunbound/services/authzone.c
8661
struct auth_master* n;
sbin/unwind/libunbound/services/authzone.c
8662
for(n = list; n; n = n->next) {
sbin/unwind/libunbound/services/authzone.c
8663
m += sizeof(*n);
sbin/unwind/libunbound/services/authzone.c
8664
m += auth_addrs_get_mem(n->list);
sbin/unwind/libunbound/services/authzone.c
8665
if(n->host)
sbin/unwind/libunbound/services/authzone.c
8666
m += strlen(n->host)+1;
sbin/unwind/libunbound/services/authzone.c
8667
if(n->file)
sbin/unwind/libunbound/services/authzone.c
8668
m += strlen(n->file)+1;
sbin/unwind/libunbound/services/cache/infra.c
396
static void domain_limit_free(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/cache/infra.c
398
if(n) {
sbin/unwind/libunbound/services/cache/infra.c
399
free(((struct domain_limit_data*)n)->node.name);
sbin/unwind/libunbound/services/cache/infra.c
400
free(n);
sbin/unwind/libunbound/services/cache/infra.c
413
static void wait_limit_netblock_del(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/cache/infra.c
415
free(n);
sbin/unwind/libunbound/services/localzone.c
113
lzdel(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/localzone.c
115
struct local_zone* z = (struct local_zone*)n->key;
sbin/unwind/libunbound/services/localzone.c
2130
struct local_data* n = (struct local_data*)rbtree_next(&d->node);
sbin/unwind/libunbound/services/localzone.c
2131
if(n == (struct local_data*)RBTREE_NULL)
sbin/unwind/libunbound/services/localzone.c
2133
if(dname_strict_subdomain(n->name, n->namelabs, d->name, d->namelabs))
sbin/unwind/libunbound/services/localzone.c
761
struct local_zone_override* n;
sbin/unwind/libunbound/services/localzone.c
762
n = (struct local_zone_override*)regional_alloc_zero(
sbin/unwind/libunbound/services/localzone.c
763
z->region, sizeof(*n));
sbin/unwind/libunbound/services/localzone.c
764
if(!n) {
sbin/unwind/libunbound/services/localzone.c
769
n->type = t;
sbin/unwind/libunbound/services/localzone.c
771
(struct addr_tree_node*)n, &addr, addrlen, net)) {
sbin/unwind/libunbound/services/mesh.c
1170
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
1176
n =
sbin/unwind/libunbound/services/mesh.c
1181
log_assert(n != NULL); /* must have been present */
sbin/unwind/libunbound/services/mesh.c
1206
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
1216
n =
sbin/unwind/libunbound/services/mesh.c
1221
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
1226
n =
sbin/unwind/libunbound/services/mesh.c
1231
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
1263
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
1287
n =
sbin/unwind/libunbound/services/mesh.c
1292
log_assert(n != NULL); /* we checked above if statement, the reverse
sbin/unwind/libunbound/services/mesh.c
2329
struct mesh_reply* n, *prev = NULL;
sbin/unwind/libunbound/services/mesh.c
2330
n = m->reply_list;
sbin/unwind/libunbound/services/mesh.c
2333
if(!n) return; /* nothing to remove, also no accounting needed */
sbin/unwind/libunbound/services/mesh.c
2334
while(n) {
sbin/unwind/libunbound/services/mesh.c
2335
if(n->query_reply.c == cp) {
sbin/unwind/libunbound/services/mesh.c
2337
if(prev) prev->next = n->next;
sbin/unwind/libunbound/services/mesh.c
2338
else m->reply_list = n->next;
sbin/unwind/libunbound/services/mesh.c
2343
&n->query_reply, mesh->env->cfg);
sbin/unwind/libunbound/services/mesh.c
2346
n = n->next;
sbin/unwind/libunbound/services/mesh.c
2349
prev = n;
sbin/unwind/libunbound/services/mesh.c
2350
n = n->next;
sbin/unwind/libunbound/services/mesh.c
248
mesh_delete_helper(rbnode_type* n)
sbin/unwind/libunbound/services/mesh.c
250
struct mesh_state* mstate = (struct mesh_state*)n->key;
sbin/unwind/libunbound/services/mesh.c
475
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
512
n =
sbin/unwind/libunbound/services/mesh.c
517
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
619
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
640
n =
sbin/unwind/libunbound/services/mesh.c
645
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
708
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
732
n =
sbin/unwind/libunbound/services/mesh.c
737
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
761
n =
sbin/unwind/libunbound/services/mesh.c
766
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
785
struct rbnode_type* n;
sbin/unwind/libunbound/services/mesh.c
819
n =
sbin/unwind/libunbound/services/mesh.c
824
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
848
n =
sbin/unwind/libunbound/services/mesh.c
853
log_assert(n != NULL);
sbin/unwind/libunbound/services/mesh.c
896
struct config_strlist* n = regional_alloc_zero(region,
sbin/unwind/libunbound/services/mesh.c
897
sizeof(*n));
sbin/unwind/libunbound/services/mesh.c
898
if(!n)
sbin/unwind/libunbound/services/mesh.c
900
n->str = regional_strdup(region, s->str);
sbin/unwind/libunbound/services/mesh.c
901
if(!n->str)
sbin/unwind/libunbound/services/mesh.c
904
last->next = n;
sbin/unwind/libunbound/services/mesh.c
905
else result = n;
sbin/unwind/libunbound/services/mesh.c
906
last = n;
sbin/unwind/libunbound/services/outside_network.c
471
rbnode_type* n;
sbin/unwind/libunbound/services/outside_network.c
475
n = rbtree_search(&reuse->tree_by_id, &key_w);
sbin/unwind/libunbound/services/outside_network.c
476
if(!n) return NULL;
sbin/unwind/libunbound/services/outside_network.c
477
return (struct waiting_tcp*)n->key;
sbin/unwind/libunbound/services/rpz.c
361
rpz_clientip_synthesized_rr_delete(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/rpz.c
363
struct clientip_synthesized_rr* r = (struct clientip_synthesized_rr*)n->key;
sbin/unwind/libunbound/services/view.c
83
delviewnode(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/services/view.c
85
struct view* v = (struct view*)n;
sbin/unwind/libunbound/sldns/keyraw.c
378
sldns_key_rsa_buf_bignum(unsigned char* key, size_t len, BIGNUM** n,
sbin/unwind/libunbound/sldns/keyraw.c
409
*n = BN_new();
sbin/unwind/libunbound/sldns/keyraw.c
410
if(!*n) {
sbin/unwind/libunbound/sldns/keyraw.c
415
(void) BN_bin2bn(key+offset, (int)(len - offset), *n);
sbin/unwind/libunbound/sldns/keyraw.c
437
rsa->n = modulus;
sbin/unwind/libunbound/sldns/keyraw.c
459
BIGNUM *n=NULL, *e=NULL;
sbin/unwind/libunbound/sldns/keyraw.c
463
if(!sldns_key_rsa_buf_bignum(key, len, &n, &e)) {
sbin/unwind/libunbound/sldns/keyraw.c
469
BN_free(n);
sbin/unwind/libunbound/sldns/keyraw.c
473
if(!OSSL_PARAM_BLD_push_BN(param_bld, "n", n)) {
sbin/unwind/libunbound/sldns/keyraw.c
475
BN_free(n);
sbin/unwind/libunbound/sldns/keyraw.c
481
BN_free(n);
sbin/unwind/libunbound/sldns/keyraw.c
491
BN_free(n);
sbin/unwind/libunbound/sldns/keyraw.c
498
BN_free(n);
sbin/unwind/libunbound/sldns/keyraw.c
505
BN_free(n);
sbin/unwind/libunbound/sldns/keyraw.c
512
BN_free(n);
sbin/unwind/libunbound/sldns/str2wire.c
1936
int n;
sbin/unwind/libunbound/sldns/str2wire.c
1943
n = sldns_b64_pton(str, rd, *len);
sbin/unwind/libunbound/sldns/str2wire.c
1944
if(n < 0)
sbin/unwind/libunbound/sldns/str2wire.c
1946
*len = (size_t)n;
sbin/unwind/libunbound/sldns/str2wire.c
1954
int n;
sbin/unwind/libunbound/sldns/str2wire.c
1958
n = sldns_b32_pton_extended_hex(str, slen, rd+1, *len-1);
sbin/unwind/libunbound/sldns/str2wire.c
1959
if(n < 0)
sbin/unwind/libunbound/sldns/str2wire.c
1961
*len = (size_t)n+1;
sbin/unwind/libunbound/sldns/str2wire.c
2877
int n;
sbin/unwind/libunbound/sldns/str2wire.c
2878
n = strtol(str, &s, 10);
sbin/unwind/libunbound/sldns/str2wire.c
2879
if(n < 0) /* negative number not allowed */
sbin/unwind/libunbound/sldns/str2wire.c
2881
if(*len < ((size_t)n)+2)
sbin/unwind/libunbound/sldns/str2wire.c
2883
if(n > 65535)
sbin/unwind/libunbound/sldns/str2wire.c
2886
if(n == 0) {
sbin/unwind/libunbound/sldns/str2wire.c
2897
n = sldns_b64_pton(s, rd+2, (*len)-2);
sbin/unwind/libunbound/sldns/str2wire.c
2898
if(n < 0)
sbin/unwind/libunbound/sldns/str2wire.c
2900
sldns_write_uint16(rd, (uint16_t)n);
sbin/unwind/libunbound/sldns/str2wire.c
2901
*len = ((size_t)n)+2;
sbin/unwind/libunbound/sldns/wire2str.c
1992
uint16_t n;
sbin/unwind/libunbound/sldns/wire2str.c
1995
n = sldns_read_uint16(*d);
sbin/unwind/libunbound/sldns/wire2str.c
1996
if(*dl < 2+(size_t)n)
sbin/unwind/libunbound/sldns/wire2str.c
2000
if(n == 0) {
sbin/unwind/libunbound/sldns/wire2str.c
2003
w = sldns_str_print(s, sl, "%u ", (unsigned)n);
sbin/unwind/libunbound/sldns/wire2str.c
2004
w += sldns_wire2str_b64_scan_num(d, dl, s, sl, n);
sbin/unwind/libunbound/sldns/wire2str.c
2074
size_t i, n;
sbin/unwind/libunbound/sldns/wire2str.c
2078
n = (size_t)((*d)[0]);
sbin/unwind/libunbound/sldns/wire2str.c
2079
if(*dl < 1+n)
sbin/unwind/libunbound/sldns/wire2str.c
2081
for(i=0; i<n; i++)
sbin/unwind/libunbound/sldns/wire2str.c
2084
for(i=0; i<n; i++)
sbin/unwind/libunbound/sldns/wire2str.c
2086
(*d)+=n+1;
sbin/unwind/libunbound/sldns/wire2str.c
2087
(*dl)-=(n+1);
sbin/unwind/libunbound/sldns/wire2str.c
782
int w = 0, n;
sbin/unwind/libunbound/sldns/wire2str.c
799
n = sldns_wire2str_rdf_scan(d, dlen, s, slen, rdftype,
sbin/unwind/libunbound/sldns/wire2str.c
801
if(n == -1) {
sbin/unwind/libunbound/sldns/wire2str.c
809
w += n;
sbin/unwind/libunbound/util/alloc.c
661
char* n = (char*)unbound_stat_malloc_lite(l, file, line, func);
sbin/unwind/libunbound/util/alloc.c
662
if(!n) return NULL;
sbin/unwind/libunbound/util/alloc.c
663
memmove(n, s, l);
sbin/unwind/libunbound/util/alloc.c
664
return n;
sbin/unwind/libunbound/util/alloc.c
669
char* n = unbound_strdup_lite(s, __FILE__, __LINE__, __func__);
sbin/unwind/libunbound/util/alloc.c
671
return n;
sbin/unwind/libunbound/util/alloc.c
698
unsigned char* n = NULL;
sbin/unwind/libunbound/util/alloc.c
699
int r= i2d_DSA_SIG(dsasig, &n);
sbin/unwind/libunbound/util/alloc.c
700
if(n) {
sbin/unwind/libunbound/util/alloc.c
704
memcpy(*sig, n, (size_t)r);
sbin/unwind/libunbound/util/alloc.c
705
free(n);
sbin/unwind/libunbound/util/alloc.h
194
# define calloc(n,s) unbound_stat_calloc_lite(n, s, __FILE__, __LINE__, __func__)
sbin/unwind/libunbound/util/configlexer.c
175
#define YY_LESS_LINENO(n)
sbin/unwind/libunbound/util/configlexer.c
179
#define yyless(n) \
sbin/unwind/libunbound/util/configlexer.c
183
int yyless_macro_arg = (n); \
sbin/unwind/libunbound/util/configlexer.c
3901
size_t n; \
sbin/unwind/libunbound/util/configlexer.c
3902
for ( n = 0; n < max_size && \
sbin/unwind/libunbound/util/configlexer.c
3903
(c = getc( yyin )) != EOF && c != '\n'; ++n ) \
sbin/unwind/libunbound/util/configlexer.c
3904
buf[n] = (char) c; \
sbin/unwind/libunbound/util/configlexer.c
3906
buf[n++] = (char) c; \
sbin/unwind/libunbound/util/configlexer.c
3909
result = n; \
sbin/unwind/libunbound/util/configlexer.c
7007
yy_size_t n;
sbin/unwind/libunbound/util/configlexer.c
7011
n = _yybytes_len + 2;
sbin/unwind/libunbound/util/configlexer.c
7012
buf = (char *) yyalloc(n );
sbin/unwind/libunbound/util/configlexer.c
7021
b = yy_scan_buffer(buf,n );
sbin/unwind/libunbound/util/configlexer.c
7046
#define yyless(n) \
sbin/unwind/libunbound/util/configlexer.c
7050
int yyless_macro_arg = (n); \
sbin/unwind/libunbound/util/configlexer.c
7195
static void yy_flex_strncpy (char* s1, yyconst char * s2, int n )
sbin/unwind/libunbound/util/configlexer.c
7198
for ( i = 0; i < n; ++i )
sbin/unwind/libunbound/util/configlexer.c
7206
int n;
sbin/unwind/libunbound/util/configlexer.c
7207
for ( n = 0; s[n]; ++n )
sbin/unwind/libunbound/util/configlexer.c
7210
return n;
sbin/unwind/libunbound/util/data/dname.c
760
dname_remove_labels(uint8_t** dname, size_t* len, int n)
sbin/unwind/libunbound/util/data/dname.c
763
for(i=0; i<n; i++)
sbin/unwind/libunbound/util/data/dname.h
290
void dname_remove_labels(uint8_t** dname, size_t* len, int n);
sbin/unwind/libunbound/util/data/msgencode.c
115
int c, n, closen=0;
sbin/unwind/libunbound/util/data/msgencode.c
120
if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n))
sbin/unwind/libunbound/util/data/msgencode.c
122
*matchlabels = n;
sbin/unwind/libunbound/util/data/msgencode.c
130
closen = n;
sbin/unwind/libunbound/util/data/msgencode.c
185
struct compress_tree_node* n = (struct compress_tree_node*)
sbin/unwind/libunbound/util/data/msgencode.c
187
if(!n) return 0;
sbin/unwind/libunbound/util/data/msgencode.c
188
n->left = 0;
sbin/unwind/libunbound/util/data/msgencode.c
189
n->right = 0;
sbin/unwind/libunbound/util/data/msgencode.c
190
n->parent = 0;
sbin/unwind/libunbound/util/data/msgencode.c
191
n->dname = dname;
sbin/unwind/libunbound/util/data/msgencode.c
192
n->labs = labs;
sbin/unwind/libunbound/util/data/msgencode.c
193
n->offset = offset;
sbin/unwind/libunbound/util/data/msgencode.c
194
return n;
sbin/unwind/libunbound/util/data/msgreply.c
1422
struct edns_option* n;
sbin/unwind/libunbound/util/data/msgreply.c
1425
n = list->next;
sbin/unwind/libunbound/util/data/msgreply.c
1427
list = n;
sbin/unwind/libunbound/util/net_help.c
1815
size_t n;
sbin/unwind/libunbound/util/net_help.c
1829
n = fread(data, 1, 80, f);
sbin/unwind/libunbound/util/net_help.c
1832
if(n != 80) {
sbin/unwind/libunbound/util/net_help.c
1833
log_err("tls-session-ticket-key %s is %d bytes, must be 80 bytes", p->str, (int)n);
sbin/unwind/libunbound/util/netevent.c
90
# define CMSG_ALIGN(n) __CMSG_ALIGN(n)
sbin/unwind/libunbound/util/storage/dnstree.c
271
rbnode_type* n;
sbin/unwind/libunbound/util/storage/dnstree.c
275
n = rbtree_first(tree);
sbin/unwind/libunbound/util/storage/dnstree.c
276
if(n == RBTREE_NULL)
sbin/unwind/libunbound/util/storage/dnstree.c
278
p = (struct name_tree_node*)n;
sbin/unwind/libunbound/util/storage/dnstree.c
295
n = NULL;
sbin/unwind/libunbound/util/storage/dnstree.c
296
if(rbtree_find_less_equal(tree, &key, &n)) {
sbin/unwind/libunbound/util/storage/dnstree.c
301
if(!n || n == RBTREE_NULL)
sbin/unwind/libunbound/util/storage/dnstree.c
303
n = rbtree_next(n);
sbin/unwind/libunbound/util/storage/dnstree.c
304
if(n == RBTREE_NULL)
sbin/unwind/libunbound/util/storage/dnstree.c
306
p = (struct name_tree_node*)n;
sbin/unwind/libunbound/util/storage/lookup3.c
116
#define hashsize(n) ((uint32_t)1<<(n))
sbin/unwind/libunbound/util/storage/lookup3.c
117
#define hashmask(n) (hashsize(n)-1)
sbin/unwind/libunbound/util/storage/lruhash.c
355
struct lruhash_entry* n = reclaimlist->overflow_next;
sbin/unwind/libunbound/util/storage/lruhash.c
359
reclaimlist = n;
sbin/unwind/libunbound/util/storage/lruhash.c
557
struct lruhash_entry* n = reclaimlist->overflow_next;
sbin/unwind/libunbound/util/storage/lruhash.c
561
reclaimlist = n;
sbin/unwind/libunbound/util/storage/lruhash.c
587
struct lruhash_entry* n = reclaimlist->overflow_next;
sbin/unwind/libunbound/util/storage/lruhash.c
591
reclaimlist = n;
sbin/unwind/libunbound/util/storage/lruhash.c
696
struct lruhash_entry* n = reclaimlist->overflow_next;
sbin/unwind/libunbound/util/storage/lruhash.c
700
reclaimlist = n;
sbin/unwind/libunbound/util/tcp_conn_limit.c
68
struct tcl_addr* n = (struct tcl_addr*) node;
sbin/unwind/libunbound/util/tcp_conn_limit.c
69
lock_quick_destroy(&n->lock);
sbin/unwind/libunbound/util/tcp_conn_limit.c
71
(void)n;
sbin/unwind/libunbound/util/ub_event.h
68
void ub_get_event_sys(struct ub_event_base*, const char** n, const char** s,
sbin/unwind/libunbound/util/ub_event_pluggable.c
437
ub_get_event_sys(struct ub_event_base* ub_base, const char** n, const char** s,
sbin/unwind/libunbound/util/ub_event_pluggable.c
442
*n = "pluggable-event";
sbin/unwind/libunbound/util/ub_event_pluggable.c
447
*n = "pluggable-event";
sbin/unwind/libunbound/util/ub_event_pluggable.c
457
*n = "pluggable-event";
sbin/unwind/libunbound/util/ub_event_pluggable.c
460
*n = "pluggable-libev";
sbin/unwind/libunbound/util/ub_event_pluggable.c
467
*n = "pluggable-libevent";
sbin/unwind/libunbound/validator/val_anchor.c
201
rbnode_type* n;
sbin/unwind/libunbound/validator/val_anchor.c
209
n = rbtree_search(anchors->tree, &key);
sbin/unwind/libunbound/validator/val_anchor.c
210
if(n) {
sbin/unwind/libunbound/validator/val_anchor.c
211
lock_basic_lock(&((struct trust_anchor*)n->key)->lock);
sbin/unwind/libunbound/validator/val_anchor.c
214
if(!n)
sbin/unwind/libunbound/validator/val_anchor.c
216
return (struct trust_anchor*)n->key;
sbin/unwind/libunbound/validator/val_neg.c
114
neg_clear_datas(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/validator/val_neg.c
116
struct val_neg_data* d = (struct val_neg_data*)n;
sbin/unwind/libunbound/validator/val_neg.c
123
neg_clear_zones(rbnode_type* n, void* ATTR_UNUSED(arg))
sbin/unwind/libunbound/validator/val_neg.c
125
struct val_neg_zone* z = (struct val_neg_zone*)n;
sbin/unwind/libunbound/validator/val_nsec3.c
663
rbnode_type* n;
sbin/unwind/libunbound/validator/val_nsec3.c
692
n =
sbin/unwind/libunbound/validator/val_nsec3.c
697
log_assert(n); /* cannot be duplicate, just did lookup */
sbin/unwind/libunbound/validator/val_secalgo.c
1879
nettle_mpz_set_str_256_u(pubkey.n, pubkey.size, &key[mod_offset]);
sbin/unwind/libunbound/validator/val_sigcrypt.c
437
void algo_needs_init_dnskey_add(struct algo_needs* n,
sbin/unwind/libunbound/validator/val_sigcrypt.c
441
size_t i, total = n->num;
sbin/unwind/libunbound/validator/val_sigcrypt.c
448
if(n->needs[algo] == 0) {
sbin/unwind/libunbound/validator/val_sigcrypt.c
449
n->needs[algo] = 1;
sbin/unwind/libunbound/validator/val_sigcrypt.c
455
n->num = total;
sbin/unwind/libunbound/validator/val_sigcrypt.c
458
void algo_needs_init_list(struct algo_needs* n, uint8_t* sigalg)
sbin/unwind/libunbound/validator/val_sigcrypt.c
463
memset(n->needs, 0, sizeof(uint8_t)*ALGO_NEEDS_MAX);
sbin/unwind/libunbound/validator/val_sigcrypt.c
466
log_assert(n->needs[algo] == 0);
sbin/unwind/libunbound/validator/val_sigcrypt.c
467
n->needs[algo] = 1;
sbin/unwind/libunbound/validator/val_sigcrypt.c
470
n->num = total;
sbin/unwind/libunbound/validator/val_sigcrypt.c
473
void algo_needs_init_ds(struct algo_needs* n, struct ub_packed_rrset_key* ds,
sbin/unwind/libunbound/validator/val_sigcrypt.c
480
memset(n->needs, 0, sizeof(uint8_t)*ALGO_NEEDS_MAX);
sbin/unwind/libunbound/validator/val_sigcrypt.c
488
if(n->needs[algo] == 0) {
sbin/unwind/libunbound/validator/val_sigcrypt.c
489
n->needs[algo] = 1;
sbin/unwind/libunbound/validator/val_sigcrypt.c
495
n->num = total;
sbin/unwind/libunbound/validator/val_sigcrypt.c
498
int algo_needs_set_secure(struct algo_needs* n, uint8_t algo)
sbin/unwind/libunbound/validator/val_sigcrypt.c
500
if(n->needs[algo]) {
sbin/unwind/libunbound/validator/val_sigcrypt.c
501
n->needs[algo] = 0;
sbin/unwind/libunbound/validator/val_sigcrypt.c
502
n->num --;
sbin/unwind/libunbound/validator/val_sigcrypt.c
503
if(n->num == 0) /* done! */
sbin/unwind/libunbound/validator/val_sigcrypt.c
509
void algo_needs_set_bogus(struct algo_needs* n, uint8_t algo)
sbin/unwind/libunbound/validator/val_sigcrypt.c
511
if(n->needs[algo]) n->needs[algo] = 2; /* need it, but bogus */
sbin/unwind/libunbound/validator/val_sigcrypt.c
514
size_t algo_needs_num_missing(struct algo_needs* n)
sbin/unwind/libunbound/validator/val_sigcrypt.c
516
return n->num;
sbin/unwind/libunbound/validator/val_sigcrypt.c
519
int algo_needs_missing(struct algo_needs* n)
sbin/unwind/libunbound/validator/val_sigcrypt.c
526
if(n->needs[i] == 2)
sbin/unwind/libunbound/validator/val_sigcrypt.c
528
if(n->needs[i] == 1 && miss == -1)
sbin/unwind/libunbound/validator/val_sigcrypt.h
100
void algo_needs_init_ds(struct algo_needs* n, struct ub_packed_rrset_key* ds,
sbin/unwind/libunbound/validator/val_sigcrypt.h
109
int algo_needs_set_secure(struct algo_needs* n, uint8_t algo);
sbin/unwind/libunbound/validator/val_sigcrypt.h
117
void algo_needs_set_bogus(struct algo_needs* n, uint8_t algo);
sbin/unwind/libunbound/validator/val_sigcrypt.h
124
size_t algo_needs_num_missing(struct algo_needs* n);
sbin/unwind/libunbound/validator/val_sigcrypt.h
133
int algo_needs_missing(struct algo_needs* n);
sbin/unwind/libunbound/validator/val_sigcrypt.h
82
void algo_needs_init_dnskey_add(struct algo_needs* n,
sbin/unwind/libunbound/validator/val_sigcrypt.h
90
void algo_needs_init_list(struct algo_needs* n, uint8_t* sigalg);
sbin/unwind/parse.y
328
struct force_tree_entry *n, *nxt;
sbin/unwind/parse.y
331
RB_FOREACH_SAFE(n, force_tree, &$5, nxt) {
sbin/unwind/parse.y
332
n->acceptbogus = $2;
sbin/unwind/parse.y
333
n->type = $3;
sbin/unwind/parse.y
336
RB_REMOVE(force_tree, &$5, n);
sbin/unwind/parse.y
338
n)) {
sbin/unwind/parse.y
340
"list", n->domain);
sbin/unwind/resolver.c
1951
int i, tas, n;
sbin/unwind/resolver.c
1996
n = sldns_wire2str_rdata_buf(result->data[i], result->len[i],
sbin/unwind/resolver.c
1999
if (n < 0 || (size_t)n >= sizeof(rdata_buf)) {
sbin/unwind/resolver.c
2154
struct force_tree_entry *n, e;
sbin/unwind/resolver.c
2166
n = RB_FIND(force_tree, tree, &e);
sbin/unwind/resolver.c
2167
if (n != NULL) {
sbin/unwind/resolver.c
2169
uw_resolver_type_str[n->type]);
sbin/unwind/resolver.c
2171
*res = resolvers[n->type];
sbin/unwind/resolver.c
2172
return n->acceptbogus;
sbin/unwind/resolver.c
493
ssize_t n;
sbin/unwind/resolver.c
500
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/unwind/resolver.c
502
if (n == 0) /* Connection closed. */
sbin/unwind/resolver.c
515
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/unwind/resolver.c
517
if (n == 0) /* No more messages. */
sbin/unwind/resolver.c
635
ssize_t n;
sbin/unwind/resolver.c
641
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/unwind/resolver.c
643
if (n == 0) /* Connection closed. */
sbin/unwind/resolver.c
656
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/unwind/resolver.c
658
if (n == 0) /* No more messages. */
sbin/unwind/unwind.c
399
ssize_t n;
sbin/unwind/unwind.c
405
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/unwind/unwind.c
407
if (n == 0) /* Connection closed. */
sbin/unwind/unwind.c
420
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/unwind/unwind.c
422
if (n == 0) /* No more messages. */
sbin/unwind/unwind.c
464
ssize_t n;
sbin/unwind/unwind.c
470
if ((n = imsgbuf_read(ibuf)) == -1)
sbin/unwind/unwind.c
472
if (n == 0) /* Connection closed. */
sbin/unwind/unwind.c
485
if ((n = imsg_get(ibuf, &imsg)) == -1)
sbin/unwind/unwind.c
487
if (n == 0) /* No more messages. */
sbin/unwind/unwind.c
652
struct force_tree_entry *n, *nxt;
sbin/unwind/unwind.c
667
RB_FOREACH_SAFE(n, force_tree, &conf->force, nxt) {
sbin/unwind/unwind.c
668
RB_REMOVE(force_tree, &conf->force, n);
sbin/unwind/unwind.c
669
free(n);
sbin/unwind/unwind.c
690
RB_FOREACH_SAFE(n, force_tree, &xconf->force, nxt) {
sbin/unwind/unwind.c
691
RB_REMOVE(force_tree, &xconf->force, n);
sbin/unwind/unwind.c
692
RB_INSERT(force_tree, &conf->force, n);
sbin/wsconsctl/display.c
76
#define fillioctl(n) { cmd = n; cmd_str = #n; }
sbin/wsconsctl/keysym.c
149
name2ksym(char *n)
sbin/wsconsctl/keysym.c
158
key.name = n;
sbin/wsconsctl/keysym.c
164
else if (sscanf(n, "unknown_%d", &res) == 1)
sbin/wsconsctl/mousecfg.c
177
int i, n;
sbin/wsconsctl/mousecfg.c
179
for (i = 0, n = 0; i < nitems(range); i++) {
sbin/wsconsctl/mousecfg.c
181
return (key - range[i][0] + n);
sbin/wsconsctl/mousecfg.c
183
n += range[i][1] - range[i][0] + 1;
sbin/wsconsctl/mousecfg.c
184
if (!cfg_touchpad && n >= BASESIZE)
sbin/wsconsctl/mousecfg.c
194
int i, n;
sbin/wsconsctl/mousecfg.c
197
if ((n = index_of(field->params[i].key)) >= 0)
sbin/wsconsctl/mousecfg.c
198
field->params[i].value = cfg_buffer[n].value;
sbin/wsconsctl/mousecfg.c
208
int i, n, d, err;
sbin/wsconsctl/mousecfg.c
212
if ((n = index_of(field->params[i].key)) < 0)
sbin/wsconsctl/mousecfg.c
215
d |= (cfg_buffer[n].value != field->params[i].value);
sbin/wsconsctl/mousecfg.c
226
n = index_of(field->params[i].key);
sbin/wsconsctl/mousecfg.c
227
cfg_buffer[n].value = field->params[i].value;
sbin/wsconsctl/mousecfg.c
312
int i, j, n;
sbin/wsconsctl/mousecfg.c
314
n = sscanf(val, "%d:%d,%d:%d,%d:%d,%d:%d",
sbin/wsconsctl/mousecfg.c
319
if (n > 0 && (n & 1) == 0) {
sbin/wsconsctl/mousecfg.c
320
n /= 2;
sbin/wsconsctl/mousecfg.c
321
for (i = 0; i < n; i++) {
sbin/wsconsctl/mousecfg.c
325
field->nparams = n;
sbin/wsconsctl/mousecfg.c
328
n = sscanf(val, "%d,%d,%d,%d",
sbin/wsconsctl/mousecfg.c
331
if (n > 0) {
sbin/wsconsctl/mousecfg.c
332
for (i = 0; i < n; i++) {
sbin/wsconsctl/mousecfg.c
337
field->nparams = n;
sbin/wsconsctl/mousecfg.c
381
int i, n;
sbin/wsconsctl/mousecfg.c
399
n = (int) (f * 4096);
sbin/wsconsctl/mousecfg.c
400
set_value(field, WSMOUSECFG_DX_SCALE, n);
sbin/wsconsctl/mousecfg.c
402
n = n * cfg_horiz_res / cfg_vert_res;
sbin/wsconsctl/mousecfg.c
403
set_value(field, WSMOUSECFG_DY_SCALE, n);
sbin/wsconsctl/mousecfg.c
418
if (sscanf(s, (i > 0 ? ",%d" : "%d"), &n) != 1)
sbin/wsconsctl/mousecfg.c
420
field->params[i].value = abs(n);
sbin/wsconsctl/util.c
251
int i, n;
sbin/wsconsctl/util.c
270
n = pc->cur - pc->min;
sbin/wsconsctl/util.c
271
printf("%u.%02u%%", n * 100 / i, ((n * 100) % i) * 100 / i);
sys/arch/alpha/alpha/autoconf.c
185
int n, neg;
sys/arch/alpha/alpha/autoconf.c
187
n = 0;
sys/arch/alpha/alpha/autoconf.c
199
n = (10 * n) + (*s - '0');
sys/arch/alpha/alpha/autoconf.c
203
return (neg ? -n : n);
sys/arch/alpha/alpha/interrupt.c
433
u_int64_t n, i;
sys/arch/alpha/alpha/interrupt.c
439
while ((n = atomic_loadlatch_ulong(&ssir, 0)) != 0) {
sys/arch/alpha/alpha/interrupt.c
441
if ((n & (1 << i)) == 0)
sys/arch/alpha/alpha/machdep.c
1044
u_long i, n;
sys/arch/alpha/alpha/machdep.c
1046
n = 0;
sys/arch/alpha/alpha/machdep.c
1048
n += atop(mem_clusters[i].size);
sys/arch/alpha/alpha/machdep.c
1049
return (n);
sys/arch/alpha/alpha/machdep.c
1139
u_long totalbytesleft, bytes, i, n, memcl;
sys/arch/alpha/alpha/machdep.c
1189
for (i = 0; i < bytes; i += n, totalbytesleft -= n) {
sys/arch/alpha/alpha/machdep.c
1196
n = bytes - i;
sys/arch/alpha/alpha/machdep.c
1197
if (n > BYTES_PER_DUMP)
sys/arch/alpha/alpha/machdep.c
1198
n = BYTES_PER_DUMP;
sys/arch/alpha/alpha/machdep.c
1201
(caddr_t)ALPHA_PHYS_TO_K0SEG(maddr), n);
sys/arch/alpha/alpha/machdep.c
1204
maddr += n;
sys/arch/alpha/alpha/machdep.c
1205
blkno += btodb(n); /* XXX? */
sys/arch/alpha/alpha/machdep.c
1721
delay(unsigned long n)
sys/arch/alpha/alpha/machdep.c
1725
if (n == 0)
sys/arch/alpha/alpha/machdep.c
1732
while (usec <= n) {
sys/arch/alpha/dev/shared_intr.c
66
alpha_shared_intr_alloc(unsigned int n)
sys/arch/alpha/dev/shared_intr.c
71
intr = mallocarray(n, sizeof(struct alpha_shared_intr), M_DEVBUF,
sys/arch/alpha/dev/shared_intr.c
76
for (i = 0; i < n; i++) {
sys/arch/alpha/include/bus.h
605
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/alpha/include/bus.h
606
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/alpha/include/bus.h
615
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/alpha/include/bus.h
616
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/alpha/include/bus.h
623
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/alpha/include/bus.h
624
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/alpha/include/bus.h
625
#define bus_dmamem_free(t, sg, n) \
sys/arch/alpha/include/bus.h
626
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/alpha/include/bus.h
627
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/alpha/include/bus.h
628
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/alpha/include/bus.h
631
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/alpha/include/bus.h
632
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/alpha/include/fpu.h
42
#define _FP_C_DEF(n) (1UL << (n))
sys/arch/alpha/include/param.h
79
#define DELAY(n) delay(n)
sys/arch/alpha/pci/tsc.c
221
tsp_init(int mallocsafe, int n) /* hose number */
sys/arch/alpha/pci/tsc.c
226
KASSERT(n >= 0 && n < nitems(tsp_configuration));
sys/arch/alpha/pci/tsc.c
227
pcp = &tsp_configuration[n];
sys/arch/alpha/pci/tsc.c
228
pcp->pc_pslot = n;
sys/arch/alpha/pci/tsc.c
229
pcp->pc_iobase = TS_Pn(n, 0);
sys/arch/alpha/pci/tsc.c
230
pcp->pc_csr = S_PAGE(TS_Pn(n & 1, P_CSRBASE));
sys/arch/alpha/pci/tsc.c
231
if (n & 2) {
sys/arch/alpha/pci/tsc.c
242
"tsp%d_bus_io", n);
sys/arch/alpha/pci/tsc.c
244
"tsp%d_bus_mem", n);
sys/arch/alpha/pci/tsreg.h
194
#define TS_Pn(n, offs) (0x100##0000##0000UL + 0x2##0000##0000UL * (n) + (offs))
sys/arch/alpha/stand/bootxx.c
102
for (i = 0, cksum = 0; i < n; i++)
sys/arch/alpha/stand/bootxx.c
81
int i, n, fd, rv;
sys/arch/alpha/stand/bootxx.c
94
n = bbinfop->nblocks +
sys/arch/alpha/stand/bootxx.c
96
if ((long)&_end - (long)&start + sizeof(bbinfop->blocks[0]) * n >
sys/arch/amd64/amd64/conf.c
102
#define cdev_psp_init(c,n) { \
sys/arch/amd64/amd64/conf.c
103
dev_init(c,n,open), dev_init(c,n,close), \
sys/arch/amd64/amd64/conf.c
106
dev_init(c,n,ioctl), \
sys/arch/amd64/amd64/conf.c
79
#define cdev_ocis_init(c,n) { \
sys/arch/amd64/amd64/conf.c
80
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/amd64/amd64/conf.c
81
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/amd64/amd64/conf.c
86
#define cdev_nvram_init(c,n) { \
sys/arch/amd64/amd64/conf.c
87
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/arch/amd64/amd64/conf.c
93
#define cdev_vmm_init(c,n) { \
sys/arch/amd64/amd64/conf.c
94
dev_init(c,n,open), dev_init(c,n,close), \
sys/arch/amd64/amd64/conf.c
97
dev_init(c,n,ioctl), \
sys/arch/amd64/amd64/efifb.c
530
unsigned i, n = size / 2;
sys/arch/amd64/amd64/efifb.c
533
for (i = 0; i < n; i++)
sys/arch/amd64/amd64/est.c
258
acpilist->n = nstates;
sys/arch/amd64/amd64/est.c
427
fake_fqlist->n = 2;
sys/arch/amd64/amd64/est.c
441
fake_fqlist->n = 3;
sys/arch/amd64/amd64/est.c
452
if (est_fqlist->n < 2)
sys/arch/amd64/amd64/est.c
455
low = est_fqlist->table[est_fqlist->n - 1].mhz;
sys/arch/amd64/amd64/est.c
468
for (i = 0; i < est_fqlist->n; i++)
sys/arch/amd64/amd64/est.c
469
printf("%d%s", est_fqlist->table[i].mhz, i < est_fqlist->n - 1
sys/arch/amd64/amd64/est.c
491
for (i = 0; i < est_fqlist->n; i++) {
sys/arch/amd64/amd64/est.c
92
unsigned n : 5;
sys/arch/amd64/amd64/k1x-pstate.c
125
int j, n;
sys/arch/amd64/amd64/k1x-pstate.c
128
for (n = 0; n < cstate->n_states; n++) {
sys/arch/amd64/amd64/k1x-pstate.c
129
ctrl = pss[n].pss_ctrl;
sys/arch/amd64/amd64/k1x-pstate.c
131
state.freq = pss[n].pss_core_freq;
sys/arch/amd64/amd64/k1x-pstate.c
132
j = n;
sys/arch/amd64/amd64/machdep.c
1087
u_long totalbytesleft, bytes, i, n, memseg;
sys/arch/amd64/amd64/machdep.c
1133
for (i = 0; i < bytes; i += n, totalbytesleft -= n) {
sys/arch/amd64/amd64/machdep.c
1139
n = bytes - i;
sys/arch/amd64/amd64/machdep.c
1140
if (n > BYTES_PER_DUMP)
sys/arch/amd64/amd64/machdep.c
1141
n = BYTES_PER_DUMP;
sys/arch/amd64/amd64/machdep.c
1144
if (n > dumpmem_sz)
sys/arch/amd64/amd64/machdep.c
1145
n = dumpmem_sz;
sys/arch/amd64/amd64/machdep.c
1146
memcpy(va, (void *)PMAP_DIRECT_MAP(maddr), n);
sys/arch/amd64/amd64/machdep.c
1151
error = (*dump)(dumpdev, blkno, va, n);
sys/arch/amd64/amd64/machdep.c
1154
maddr += n;
sys/arch/amd64/amd64/machdep.c
1155
blkno += btodb(n); /* XXX? */
sys/arch/amd64/amd64/machdep.c
1936
u_long i, n;
sys/arch/amd64/amd64/machdep.c
1938
n = 0;
sys/arch/amd64/amd64/machdep.c
1940
n += atop(mem_clusters[i].size);
sys/arch/amd64/amd64/machdep.c
1941
return (n);
sys/arch/amd64/amd64/pmap.c
217
#define pmap_pte_set(p, n) atomic_swap_64(p, n)
sys/arch/amd64/amd64/powernow-k8.c
284
int i, j, n;
sys/arch/amd64/amd64/powernow-k8.c
286
for (n = 0, i = 0; i < cstate->n_states; i++) {
sys/arch/amd64/amd64/powernow-k8.c
295
j = n;
sys/arch/amd64/amd64/powernow-k8.c
304
n++;
sys/arch/amd64/amd64/powernow-k8.c
316
int j, k, n;
sys/arch/amd64/amd64/powernow-k8.c
321
for (n = 0; n < cstate->n_states; n++) {
sys/arch/amd64/amd64/powernow-k8.c
322
if ((PN8_STA_CFID(status) == PN8_PSS_CFID(pss[n].pss_status)) &&
sys/arch/amd64/amd64/powernow-k8.c
323
(PN8_STA_CVID(status) == PN8_PSS_CVID(pss[n].pss_status)))
sys/arch/amd64/amd64/powernow-k8.c
324
k = n;
sys/arch/amd64/amd64/powernow-k8.c
325
ctrl = pss[n].pss_ctrl;
sys/arch/amd64/amd64/powernow-k8.c
329
state.freq = pss[n].pss_core_freq;
sys/arch/amd64/amd64/powernow-k8.c
330
j = n;
sys/arch/amd64/amd64/tsc.c
190
uint64_t n, tsc1, tsc2;
sys/arch/amd64/amd64/tsc.c
195
n = (tc->tc_get_timecount(tc) & tc->tc_counter_mask);
sys/arch/amd64/amd64/tsc.c
199
*count = n;
sys/arch/amd64/amd64/ucode.c
281
int n = 0;
sys/arch/amd64/amd64/ucode.c
289
__func__, n, left));
sys/arch/amd64/amd64/ucode.c
303
__func__, n, total_size, left));
sys/arch/amd64/amd64/ucode.c
307
DPRINTF(("%s:%d: broken data\n", __func__, n));
sys/arch/amd64/amd64/ucode.c
312
n++;
sys/arch/amd64/amd64/ucode.c
34
#define DPRINTFN(n, x) do { if (cpu_ucode_debug >= (n)) printf x; } while (0)
sys/arch/amd64/amd64/ucode.c
38
#define DPRINTFN(n, x) do { ; } while (0)
sys/arch/amd64/include/atomic.h
104
_atomic_swap_ulong(volatile unsigned long *p, unsigned long n)
sys/arch/amd64/include/atomic.h
107
: "=a" (n), "=m" (*p)
sys/arch/amd64/include/atomic.h
108
: "0" (n), "m" (*p));
sys/arch/amd64/include/atomic.h
110
return (n);
sys/arch/amd64/include/atomic.h
115
_atomic_swap_64(volatile uint64_t *p, uint64_t n)
sys/arch/amd64/include/atomic.h
118
: "=a" (n), "=m" (*p)
sys/arch/amd64/include/atomic.h
119
: "0" (n), "m" (*p));
sys/arch/amd64/include/atomic.h
121
return (n);
sys/arch/amd64/include/atomic.h
126
_atomic_swap_ptr(volatile void *p, void *n)
sys/arch/amd64/include/atomic.h
129
: "=a" (n), "=m" (*(unsigned long *)p)
sys/arch/amd64/include/atomic.h
130
: "0" (n), "m" (*(unsigned long *)p));
sys/arch/amd64/include/atomic.h
132
return (n);
sys/arch/amd64/include/atomic.h
59
_atomic_cas_uint(volatile unsigned int *p, unsigned int e, unsigned int n)
sys/arch/amd64/include/atomic.h
62
: "=a" (n), "=m" (*p)
sys/arch/amd64/include/atomic.h
63
: "r" (n), "a" (e), "m" (*p));
sys/arch/amd64/include/atomic.h
65
return (n);
sys/arch/amd64/include/atomic.h
70
_atomic_cas_ulong(volatile unsigned long *p, unsigned long e, unsigned long n)
sys/arch/amd64/include/atomic.h
73
: "=a" (n), "=m" (*p)
sys/arch/amd64/include/atomic.h
74
: "r" (n), "a" (e), "m" (*p));
sys/arch/amd64/include/atomic.h
76
return (n);
sys/arch/amd64/include/atomic.h
81
_atomic_cas_ptr(volatile void *p, void *e, void *n)
sys/arch/amd64/include/atomic.h
84
: "=a" (n), "=m" (*(unsigned long *)p)
sys/arch/amd64/include/atomic.h
85
: "r" (n), "a" (e), "m" (*(unsigned long *)p));
sys/arch/amd64/include/atomic.h
87
return (n);
sys/arch/amd64/include/atomic.h
92
_atomic_swap_uint(volatile unsigned int *p, unsigned int n)
sys/arch/amd64/include/atomic.h
95
: "=a" (n), "=m" (*p)
sys/arch/amd64/include/atomic.h
96
: "0" (n), "m" (*p));
sys/arch/amd64/include/atomic.h
98
return (n);
sys/arch/amd64/include/biosvar.h
231
#define DOINT(n) int $0x20+(n)
sys/arch/amd64/include/biosvar.h
233
#define DOINT(n) "int $0x20+(" #n ")"
sys/arch/amd64/include/bus.h
613
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/amd64/include/bus.h
614
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/amd64/include/bus.h
623
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/amd64/include/bus.h
624
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/amd64/include/bus.h
630
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/amd64/include/bus.h
631
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/amd64/include/bus.h
632
#define bus_dmamem_alloc_range(t, s, a, b, sg, n, r, f, l, h) \
sys/arch/amd64/include/bus.h
634
(n), (r), (f), (l), (h))
sys/arch/amd64/include/bus.h
635
#define bus_dmamem_free(t, sg, n) \
sys/arch/amd64/include/bus.h
636
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/amd64/include/bus.h
637
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/amd64/include/bus.h
638
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/amd64/include/bus.h
641
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/amd64/include/bus.h
642
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/amd64/include/conf.h
46
#define cdev_acpi_init(c,n) {\
sys/arch/amd64/include/conf.h
47
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/amd64/include/conf.h
48
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/amd64/include/conf.h
50
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/arch/amd64/include/conf.h
62
#define cdev_kexec_init(c,n) { \
sys/arch/amd64/include/conf.h
63
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/amd64/include/conf.h
64
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/amd64/include/specialreg.h
1623
#define PATENTRY(n, type) (type << ((n) * 8))
sys/arch/amd64/isa/clock.c
232
i8254_delay(int n)
sys/arch/amd64/isa/clock.c
247
if (n <= 25)
sys/arch/amd64/isa/clock.c
248
n = delaytab[n];
sys/arch/amd64/isa/clock.c
251
n = (int64_t)n * TIMER_FREQ / 1000000;
sys/arch/amd64/isa/clock.c
256
while (n > 0) {
sys/arch/amd64/isa/clock.c
259
n -= limit - (tick - otick);
sys/arch/amd64/isa/clock.c
261
n -= otick - tick;
sys/arch/amd64/isa/clock.c
347
bcdtobin(int n)
sys/arch/amd64/isa/clock.c
349
return (((n >> 4) & 0x0f) * 10 + (n & 0x0f));
sys/arch/amd64/isa/clock.c
353
bintobcd(int n)
sys/arch/amd64/isa/clock.c
355
return ((u_char)(((n / 10) << 4) & 0xf0) | ((n % 10) & 0x0f));
sys/arch/amd64/stand/efiboot/diskprobe.c
107
n = atapi;
sys/arch/amd64/stand/efiboot/diskprobe.c
118
printf(" %cd%d", (type == 6)? 'c' : 'h', n);
sys/arch/amd64/stand/efiboot/diskprobe.c
121
dip->bios_info.bios_number = 0x80 | n;
sys/arch/amd64/stand/efiboot/diskprobe.c
123
dip->bios_info.bios_number = 0xe0 | n;
sys/arch/amd64/stand/efiboot/diskprobe.c
133
n++;
sys/arch/amd64/stand/efiboot/diskprobe.c
72
int n;
sys/arch/amd64/stand/efiboot/diskprobe.c
79
n = 0;
sys/arch/amd64/stand/efiboot/diskprobe.c
82
n = scsi + ide;
sys/arch/amd64/stand/efiboot/diskprobe.c
87
printf(" hd%d*", n);
sys/arch/amd64/stand/efiboot/efiboot.c
304
u_int n = 0;
sys/arch/amd64/stand/efiboot/efiboot.c
321
if (n++ != 0)
sys/arch/amd64/stand/efiboot/efiboot.c
370
int i, n, error = 0;
sys/arch/amd64/stand/efiboot/efiboot.c
376
n = bios_efiinfo.mmap_size / bios_efiinfo.mmap_desc_size;
sys/arch/amd64/stand/efiboot/efiboot.c
378
i < n;
sys/arch/amd64/stand/efiboot/efiboot.c
615
#define divrnd(n, q) (((n)*2/(q)+1)/2) /* divide and round off */
sys/arch/amd64/stand/libsa/bioscons.c
123
register int i, n;
sys/arch/amd64/stand/libsa/bioscons.c
126
__asm volatile(DOINT(0x11) : "=a" (n) : : "%ecx", "%edx", "cc");
sys/arch/amd64/stand/libsa/bioscons.c
127
n >>= 9;
sys/arch/amd64/stand/libsa/bioscons.c
128
n &= 7;
sys/arch/amd64/stand/libsa/bioscons.c
129
for (i = 0; i < n; i++)
sys/arch/amd64/stand/libsa/bioscons.c
203
#define divrnd(n, q) (((n)*2/(q)+1)/2) /* divide and round off */
sys/arch/amd64/stand/libsa/biosdev.c
289
size_t i, n;
sys/arch/amd64/stand/libsa/biosdev.c
294
i += n, off += n, p += n * DEV_BSIZE) {
sys/arch/amd64/stand/libsa/biosdev.c
300
n = bd->bios_sectors - sect;
sys/arch/amd64/stand/libsa/biosdev.c
302
n = nsect - i;
sys/arch/amd64/stand/libsa/biosdev.c
304
error = CHS_rw(rw, dev, cyl, head, sect, n, p);
sys/arch/amd64/stand/libsa/biosdev.c
349
int n, ret;
sys/arch/amd64/stand/libsa/biosdev.c
357
n = nsect >= MAXSECTS ? MAXSECTS : nsect;
sys/arch/amd64/stand/libsa/biosdev.c
358
ret = biosd_io(rw, &dip->bios_info, off, n, dest);
sys/arch/amd64/stand/rdboot/cmd.c
255
readline(char *buf, size_t n, int to)
sys/arch/amd64/stand/rdboot/cmd.c
298
if (fgets(buf, n, stdin) == NULL)
sys/arch/amd64/stand/rdboot/rdboot.c
172
ssize_t n;
sys/arch/amd64/stand/rdboot/rdboot.c
210
n = gzread(gzfd, kimg + pos, kimgsz - pos);
sys/arch/amd64/stand/rdboot/rdboot.c
211
if (n == -1)
sys/arch/amd64/stand/rdboot/rdboot.c
213
if (n < (kimgsz - pos)) {
sys/arch/amd64/stand/rdboot/rdboot.c
214
pos += n;
sys/arch/amd64/stand/rdboot/rdboot.c
217
pos += n;
sys/arch/arm/include/atomic.h
17
_f(volatile _t *p, _t e, _t n) \
sys/arch/arm/include/atomic.h
32
: "r" (n), "r" (e), "r" (p) \
sys/arch/arm/include/atomic.h
45
_atomic_cas_ptr(volatile void *p, void *e, void *n)
sys/arch/arm/include/atomic.h
61
: "r" (n), "r" (e), "r" (p)
sys/arch/arm/include/bus.h
715
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/arm/include/bus.h
716
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/arm/include/bus.h
725
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/arm/include/bus.h
726
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/arm/include/bus.h
733
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/arm/include/bus.h
734
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/arm/include/bus.h
735
#define bus_dmamem_alloc_range(t, s, a, b, sg, n, r, f, l, h) \
sys/arch/arm/include/bus.h
737
(n), (r), (f), (l), (h))
sys/arch/arm/include/bus.h
738
#define bus_dmamem_free(t, sg, n) \
sys/arch/arm/include/bus.h
739
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/arm/include/bus.h
740
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/arm/include/bus.h
741
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/arm/include/bus.h
744
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/arm/include/bus.h
745
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/arm/include/conf.h
61
#define cdev_apm_init(c,n) { \
sys/arch/arm/include/conf.h
62
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/arm/include/conf.h
63
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/arm/include/conf.h
65
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/arch/arm/include/conf.h
74
#define cdev_openprom_init(c,n) { \
sys/arch/arm/include/conf.h
75
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/arm/include/conf.h
76
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/arm64/arm64/disasm.c
1129
OP6FUNC(op_and_imm, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
1131
if (!ValidBitMasks(sf, n, imms, immr)) {
sys/arch/arm64/arm64/disasm.c
1139
DecodeBitMasks(sf, n, imms, immr));
sys/arch/arm64/arm64/disasm.c
1148
OP6FUNC(op_ands_imm, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
1150
if (!ValidBitMasks(sf, n, imms, immr)) {
sys/arch/arm64/arm64/disasm.c
1159
DecodeBitMasks(sf, n, imms, immr));
sys/arch/arm64/arm64/disasm.c
1164
DecodeBitMasks(sf, n, imms, immr));
sys/arch/arm64/arm64/disasm.c
1175
OP6FUNC(op_sbfm, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
1340
OP6FUNC(op_bfi, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
136
#define ZREGNAME(s, n) (z_wxregs[(s) & 1][(n) & 31])
sys/arch/arm64/arm64/disasm.c
137
#define SREGNAME(s, n) (s_wxregs[(s) & 1][(n) & 31])
sys/arch/arm64/arm64/disasm.c
1598
OP6FUNC(op_eor_imm, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
1600
if (!ValidBitMasks(sf, n, imms, immr)) {
sys/arch/arm64/arm64/disasm.c
1608
DecodeBitMasks(sf, n, imms, immr));
sys/arch/arm64/arm64/disasm.c
1622
OP6FUNC(op_ror_imm, sf, n, Rm, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
1624
if (((sf ^ n) != 0) || (n == 0 && imms >= 0x20)) {
sys/arch/arm64/arm64/disasm.c
176
#define FREGNAME(s, n) (simdregs[(s)][(n) & 31])
sys/arch/arm64/arm64/disasm.c
184
#define VREGNAME(n) vecregs[(n) & 31]
sys/arch/arm64/arm64/disasm.c
190
#define CREGNAME(n) cregs[(n) & 15]
sys/arch/arm64/arm64/disasm.c
2283
OP6FUNC(op_ubfm, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
2377
OP6FUNC(op_orr_imm, sf, n, immr, imms, Rn, Rd)
sys/arch/arm64/arm64/disasm.c
2379
if (!ValidBitMasks(sf, n, imms, immr)) {
sys/arch/arm64/arm64/disasm.c
2387
if ((Rn == 31) && !MoveWidePreferred(sf, n, imms, immr)) {
sys/arch/arm64/arm64/disasm.c
2395
DecodeBitMasks(sf, n, imms, immr));
sys/arch/arm64/arm64/disasm.c
2400
DecodeBitMasks(sf, n, imms, immr));
sys/arch/arm64/arm64/disasm.c
611
rotate(int bitwidth, uint64_t v, int n)
sys/arch/arm64/arm64/disasm.c
615
n &= (bitwidth - 1);
sys/arch/arm64/arm64/disasm.c
616
result = (((v << (bitwidth - n)) | (v >> n)));
sys/arch/arm64/arm64/disasm.c
623
ValidBitMasks(uint64_t sf, uint64_t n, uint64_t imms, uint64_t immr)
sys/arch/arm64/arm64/disasm.c
627
if ((sf == 0) && (n != 0))
sys/arch/arm64/arm64/disasm.c
630
len = fls64((n << 6) + (~imms & 0x3f)) - 1;
sys/arch/arm64/arm64/disasm.c
643
DecodeBitMasks(uint64_t sf, uint64_t n, uint64_t imms, uint64_t immr)
sys/arch/arm64/arm64/disasm.c
649
len = fls64((n << 6) + (~imms & 0x3f)) - 1;
sys/arch/arm64/arm64/disasm.c
664
MoveWidePreferred(uint64_t sf, uint64_t n, uint64_t imms, uint64_t immr)
sys/arch/arm64/arm64/disasm.c
667
uint64_t x = DecodeBitMasks(sf, n, imms, immr);
sys/arch/arm64/arm64/disasm.c
690
if ((sf != 0) && (n == 0))
sys/arch/arm64/arm64/disasm.c
692
if ((sf == 0) && ((n != 0) || (immr > 0x1f)))
sys/arch/arm64/arm64/machdep.c
110
int n, neg;
sys/arch/arm64/arm64/machdep.c
112
n = 0;
sys/arch/arm64/arm64/machdep.c
124
n = (10 * n) + (*s - '0');
sys/arch/arm64/arm64/machdep.c
128
return (neg ? -n : n);
sys/arch/arm64/arm64/machdep.c
612
u_long totalbytesleft, bytes, i, n, memseg;
sys/arch/arm64/arm64/machdep.c
651
bytes = n = i = memseg = 0;
sys/arch/arm64/arm64/machdep.c
659
for (i = 0; i < bytes; i += n, totalbytesleft -= n) {
sys/arch/arm64/arm64/machdep.c
665
n = bytes - i;
sys/arch/arm64/arm64/machdep.c
666
if (n > BYTES_PER_DUMP)
sys/arch/arm64/arm64/machdep.c
667
n = BYTES_PER_DUMP;
sys/arch/arm64/arm64/machdep.c
670
if (n > dumpmem_sz)
sys/arch/arm64/arm64/machdep.c
671
n = dumpmem_sz;
sys/arch/arm64/arm64/machdep.c
672
memcpy(va, (void *)PMAP_DIRECT_MAP(maddr), n);
sys/arch/arm64/arm64/machdep.c
677
error = (*dump)(dumpdev, blkno, va, n);
sys/arch/arm64/arm64/machdep.c
680
maddr += n;
sys/arch/arm64/arm64/machdep.c
681
blkno += btodb(n); /* XXX? */
sys/arch/arm64/dev/bcm2836_intr.c
50
#define ARM_LOCAL_INT_TIMER(n) (0x40 + (n) * 4)
sys/arch/arm64/dev/bcm2836_intr.c
51
#define ARM_LOCAL_INT_MAILBOX(n) (0x50 + (n) * 4)
sys/arch/arm64/dev/bcm2836_intr.c
52
#define ARM_LOCAL_INT_PENDING(n) (0x60 + (n) * 4)
sys/arch/arm64/dev/bcm2836_intr.c
54
#define ARM_LOCAL_INT_MAILBOX_SET(n) (0x80 + (n) * 16)
sys/arch/arm64/dev/bcm2836_intr.c
55
#define ARM_LOCAL_INT_MAILBOX_CLR(n) (0xc0 + (n) * 16)
sys/arch/arm64/dev/bcm2836_intr.c
66
#define IS_IRQ_BANK0(n) (((n) >= BANK0_START) && ((n) <= BANK0_END))
sys/arch/arm64/dev/bcm2836_intr.c
67
#define IS_IRQ_BANK1(n) (((n) >= BANK1_START) && ((n) <= BANK1_END))
sys/arch/arm64/dev/bcm2836_intr.c
68
#define IS_IRQ_BANK2(n) (((n) >= BANK2_START) && ((n) <= BANK2_END))
sys/arch/arm64/dev/bcm2836_intr.c
69
#define IS_IRQ_LOCAL(n) (((n) >= LOCAL_START) && ((n) <= LOCAL_END))
sys/arch/arm64/dev/bcm2836_intr.c
70
#define IRQ_BANK0(n) ((n) - BANK0_START)
sys/arch/arm64/dev/bcm2836_intr.c
71
#define IRQ_BANK1(n) ((n) - BANK1_START)
sys/arch/arm64/dev/bcm2836_intr.c
72
#define IRQ_BANK2(n) ((n) - BANK2_START)
sys/arch/arm64/dev/bcm2836_intr.c
73
#define IRQ_LOCAL(n) ((n) - LOCAL_START)
sys/arch/arm64/dev/bcm2836_intr.c
75
#define ARM_LOCAL_IRQ_MAILBOX(n) (4 + (n))
sys/arch/arm64/include/armreg.h
805
#define MAIR_ATTR_MASK(idx) (0xff << ((n)* 8))
sys/arch/arm64/include/bus.h
144
#define bus_space_read_multi(n,m) \
sys/arch/arm64/include/bus.h
146
CAT(bus_space_read_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/arm64/include/bus.h
150
*x++ = CAT(bus_space_read_,n)(bst, bsh, o); \
sys/arch/arm64/include/bus.h
159
#define bus_space_read_region(n,m) \
sys/arch/arm64/include/bus.h
161
CAT(bus_space_read_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/arm64/include/bus.h
165
*x++ = CAT(bus_space_read_,n)(bst, bsh, ba); \
sys/arch/arm64/include/bus.h
166
ba += (n); \
sys/arch/arm64/include/bus.h
176
#define bus_space_read_raw_region(n,m) \
sys/arch/arm64/include/bus.h
178
CAT(bus_space_read_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/arm64/include/bus.h
182
cnt >>= ((n) >> 1); \
sys/arch/arm64/include/bus.h
184
CAT(bus_space_read_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/arm64/include/bus.h
185
ba += (n); \
sys/arch/arm64/include/bus.h
186
x += (n); \
sys/arch/arm64/include/bus.h
195
#define bus_space_write_multi(n,m) \
sys/arch/arm64/include/bus.h
197
CAT(bus_space_write_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/arm64/include/bus.h
201
CAT(bus_space_write_,n)(bst, bsh, o, *x++); \
sys/arch/arm64/include/bus.h
210
#define bus_space_write_region(n,m) \
sys/arch/arm64/include/bus.h
212
CAT(bus_space_write_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/arm64/include/bus.h
216
CAT(bus_space_write_,n)(bst, bsh, ba, *x++); \
sys/arch/arm64/include/bus.h
217
ba += (n); \
sys/arch/arm64/include/bus.h
227
#define bus_space_write_raw_region(n,m) \
sys/arch/arm64/include/bus.h
229
CAT(bus_space_write_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/arm64/include/bus.h
233
cnt >>= ((n) >> 1); \
sys/arch/arm64/include/bus.h
235
CAT(bus_space_write_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/arm64/include/bus.h
236
ba += (n); \
sys/arch/arm64/include/bus.h
237
x += (n); \
sys/arch/arm64/include/bus.h
246
#define bus_space_set_region(n,m) \
sys/arch/arm64/include/bus.h
248
CAT(bus_space_set_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/arm64/include/bus.h
252
CAT(bus_space_write_,n)(bst, bsh, ba, x); \
sys/arch/arm64/include/bus.h
253
ba += (n); \
sys/arch/arm64/include/bus.h
422
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/arm64/include/bus.h
423
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/arm64/include/bus.h
432
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/arm64/include/bus.h
433
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/arm64/include/bus.h
440
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/arm64/include/bus.h
441
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/arm64/include/bus.h
442
#define bus_dmamem_alloc_range(t, s, a, b, sg, n, r, f, l, h) \
sys/arch/arm64/include/bus.h
444
(n), (r), (f), (l), (h))
sys/arch/arm64/include/bus.h
445
#define bus_dmamem_free(t, sg, n) \
sys/arch/arm64/include/bus.h
446
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/arm64/include/bus.h
447
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/arm64/include/bus.h
448
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/arm64/include/bus.h
451
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/arm64/include/bus.h
452
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/arm64/include/conf.h
43
#define cdev_openprom_init(c,n) { \
sys/arch/arm64/include/conf.h
44
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/arm64/include/conf.h
45
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/arm64/include/conf.h
52
#define cdev_acpiapm_init(c,n) { \
sys/arch/arm64/include/conf.h
53
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/arm64/include/conf.h
54
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/arm64/include/conf.h
56
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/arch/arm64/stand/efiboot/efiacpi.c
29
#define fdt_node_add_string_property(n, p, s) \
sys/arch/arm64/stand/efiboot/efiacpi.c
30
fdt_node_add_property((n), (p), (s), strlen((s)) + 1)
sys/arch/arm64/stand/efiboot/efiacpi.c
31
#define fdt_node_set_string_property(n, p, s) \
sys/arch/arm64/stand/efiboot/efiacpi.c
32
fdt_node_set_property((n), (p), (s), strlen((s)) + 1)
sys/arch/arm64/stand/efiboot/efiboot.c
1038
int n;
sys/arch/arm64/stand/efiboot/efiboot.c
1050
n = siz / mmsiz;
sys/arch/arm64/stand/efiboot/efiboot.c
1053
mmap_ndesc = n;
sys/arch/armv7/armv7/armv7_machdep.c
922
int n, neg;
sys/arch/armv7/armv7/armv7_machdep.c
924
n = 0;
sys/arch/armv7/armv7/armv7_machdep.c
936
n = (10 * n) + (*s - '0');
sys/arch/armv7/armv7/armv7_machdep.c
940
return (neg ? -n : n);
sys/arch/armv7/broadcom/bcm2836_intr.c
50
#define ARM_LOCAL_INT_TIMER(n) (0x40 + (n) * 4)
sys/arch/armv7/broadcom/bcm2836_intr.c
51
#define ARM_LOCAL_INT_MAILBOX(n) (0x50 + (n) * 4)
sys/arch/armv7/broadcom/bcm2836_intr.c
52
#define ARM_LOCAL_INT_PENDING(n) (0x60 + (n) * 4)
sys/arch/armv7/broadcom/bcm2836_intr.c
64
#define IS_IRQ_BANK0(n) (((n) >= BANK0_START) && ((n) <= BANK0_END))
sys/arch/armv7/broadcom/bcm2836_intr.c
65
#define IS_IRQ_BANK1(n) (((n) >= BANK1_START) && ((n) <= BANK1_END))
sys/arch/armv7/broadcom/bcm2836_intr.c
66
#define IS_IRQ_BANK2(n) (((n) >= BANK2_START) && ((n) <= BANK2_END))
sys/arch/armv7/broadcom/bcm2836_intr.c
67
#define IS_IRQ_LOCAL(n) (((n) >= LOCAL_START) && ((n) <= LOCAL_END))
sys/arch/armv7/broadcom/bcm2836_intr.c
68
#define IRQ_BANK0(n) ((n) - BANK0_START)
sys/arch/armv7/broadcom/bcm2836_intr.c
69
#define IRQ_BANK1(n) ((n) - BANK1_START)
sys/arch/armv7/broadcom/bcm2836_intr.c
70
#define IRQ_BANK2(n) ((n) - BANK2_START)
sys/arch/armv7/broadcom/bcm2836_intr.c
71
#define IRQ_LOCAL(n) ((n) - LOCAL_START)
sys/arch/armv7/exynos/crosec_kbd.c
54
#define KC(n) KS_KEYCODE(n)
sys/arch/armv7/marvell/mvpcie.c
44
#define PCIE_BAR_LO(n) (0x0010 + ((n) << 3))
sys/arch/armv7/marvell/mvpcie.c
45
#define PCIE_BAR_HI(n) (0x0014 + ((n) << 3))
sys/arch/armv7/marvell/mvpcie.c
46
#define PCIE_BAR_CTRL(n) (0x1804 + (((n) - 1) * 4))
sys/arch/armv7/marvell/mvpcie.c
47
#define PCIE_WIN04_CTRL(n) (0x1820 + ((n) << 4))
sys/arch/armv7/marvell/mvpcie.c
48
#define PCIE_WIN04_BASE(n) (0x1824 + ((n) << 4))
sys/arch/armv7/marvell/mvpcie.c
49
#define PCIE_WIN04_REMAP(n) (0x182c + ((n) << 4))
sys/arch/armv7/omap/amdisplay.c
41
#define DPRINTF(n,s) do { if ((n) <= lcd_dbg_thresh) printf s; } while (0)
sys/arch/armv7/omap/amdisplay.c
43
#define DPRINTF(n,s) do {} while (0)
sys/arch/armv7/omap/if_cpsw.c
219
cpsw_set_txdesc_next(struct cpsw_softc * const sc, const u_int i, uint32_t n)
sys/arch/armv7/omap/if_cpsw.c
222
bus_space_write_4(sc->sc_bst, sc->sc_bsh_txdescs, o, n);
sys/arch/armv7/omap/if_cpsw.c
226
cpsw_set_rxdesc_next(struct cpsw_softc * const sc, const u_int i, uint32_t n)
sys/arch/armv7/omap/if_cpsw.c
229
bus_space_write_4(sc->sc_bst, sc->sc_bsh_rxdescs, o, n);
sys/arch/armv7/omap/nxphdmi.c
104
#define VIP_CNTRL_5_SP_CNT(n) (((n) & 3) << 1)
sys/arch/armv7/omap/nxphdmi.c
256
#define DPRINTF(n,s) do { if ((n) <= nxphdmi_debug) printf s; } while (0)
sys/arch/armv7/omap/nxphdmi.c
258
#define DPRINTF(n,s) do {} while (0)
sys/arch/armv7/omap/ommmc.c
251
#define DPRINTF(n,s) do { if ((n) <= ommmcdebug) printf s; } while (0)
sys/arch/armv7/omap/ommmc.c
254
#define DPRINTF(n,s) do {} while(0)
sys/arch/armv7/omap/ommmc.c
478
int n, i;
sys/arch/armv7/stand/efiboot/efiboot.c
911
int n;
sys/arch/armv7/stand/efiboot/efiboot.c
923
n = siz / mmsiz;
sys/arch/armv7/stand/efiboot/efiboot.c
926
mmap_ndesc = n;
sys/arch/armv7/stand/efiboot/exec.c
38
#define CLIDR_CTYPE(x, n) ((x >> (n * 3)) & 0x7)
sys/arch/armv7/sunxi/sxiintc.c
36
#define DPRINTFN(n,x) do { if (sxiintcdebug>(n)) printf x; } while (0)
sys/arch/armv7/sunxi/sxiintc.c
55
#define DPRINTFN(n,x)
sys/arch/hppa/dev/astro.c
590
iommu_iomap_create(int n)
sys/arch/hppa/dev/astro.c
595
n += 4;
sys/arch/hppa/dev/astro.c
596
if (n < 16)
sys/arch/hppa/dev/astro.c
597
n = 16;
sys/arch/hppa/dev/astro.c
599
ims = malloc(sizeof(*ims) + (n - 1) * sizeof(ims->ims_map.ipm_map[0]),
sys/arch/hppa/dev/astro.c
605
ims->ims_map.ipm_maxpage = n;
sys/arch/hppa/dev/mongoose.c
475
#define R(n) bt->__CONCAT(hbt_,n) = &__CONCAT(mg_isa_,n)
sys/arch/hppa/gsc/harmony.c
1019
int i, n, selected = -1;
sys/arch/hppa/gsc/harmony.c
1021
n = sizeof(harmony_speeds) / sizeof(harmony_speeds[0]);
sys/arch/hppa/gsc/harmony.c
1025
else if ((*speedp) >= harmony_speeds[n - 1].speed)
sys/arch/hppa/gsc/harmony.c
1026
selected = n - 1;
sys/arch/hppa/gsc/harmony.c
1028
for (i = 1; selected == -1 && i < n; i++) {
sys/arch/hppa/hppa/db_disasm.c
244
#define DeclBitfR(s,l,n) struct n { int:(HOSTWDSZ-(s)-(l)); unsigned n:l;};
sys/arch/hppa/hppa/db_disasm.c
246
#define DeclBitfR(s,l,n) struct n { int:((s)+(HOSTWDSZ-32)); unsigned n:l;};
sys/arch/hppa/hppa/db_disasm.c
261
#define BitfR(i,s,l,n) (((struct n *)&i)->n)
sys/arch/hppa/hppa/machdep.c
1018
int psize, bytes, i, n;
sys/arch/hppa/hppa/machdep.c
1049
for (i = 0; i < bytes; i += n) {
sys/arch/hppa/hppa/machdep.c
1052
n = bytes - i;
sys/arch/hppa/hppa/machdep.c
1053
if (n && (n % (1024*1024)) == 0)
sys/arch/hppa/hppa/machdep.c
1054
printf("%d ", n / (1024 * 1024));
sys/arch/hppa/hppa/machdep.c
1058
if (n > BYTES_PER_DUMP)
sys/arch/hppa/hppa/machdep.c
1059
n = BYTES_PER_DUMP;
sys/arch/hppa/hppa/machdep.c
1061
if ((error = (*dump)(dumpdev, blkno, maddr, n)))
sys/arch/hppa/hppa/machdep.c
1063
maddr += n;
sys/arch/hppa/hppa/machdep.c
1064
blkno += btodb(n);
sys/arch/hppa/hppa/machdep.c
675
u_int start, end, n;
sys/arch/hppa/hppa/machdep.c
679
n = min(1000, us);
sys/arch/hppa/hppa/machdep.c
680
end = start + n * cpu_ticksnum / cpu_ticksdenom;
sys/arch/hppa/hppa/machdep.c
692
us -= n;
sys/arch/hppa/hppa/mainbus.c
1238
cpu_gethpa(int n)
sys/arch/hppa/hppa/mainbus.c
669
#define crr(n) ((void (*)(void *, bus_space_handle_t, bus_size_t, u_int8_t *, bus_size_t))(n))
sys/arch/hppa/hppa/mainbus.c
670
#define cwr(n) ((void (*)(void *, bus_space_handle_t, bus_size_t, const u_int8_t *, bus_size_t))(n))
sys/arch/hppa/include/asm.h
258
#define ENTRY(x,n) ! .text ! .align 4 !\
sys/arch/hppa/include/asm.h
260
.callinfo frame=n,calls, save_rp, save_sp !\
sys/arch/hppa/include/asm.h
266
#define BSS(n,s) ! .data ! .label n ! .comm s
sys/arch/hppa/include/atomic.h
103
*uip = n;
sys/arch/hppa/include/atomic.h
111
_atomic_cas_ptr(volatile void *uip, void *o, void *n)
sys/arch/hppa/include/atomic.h
120
*uipp = n;
sys/arch/hppa/include/atomic.h
128
_atomic_swap_uint(volatile unsigned int *uip, unsigned int n)
sys/arch/hppa/include/atomic.h
135
*uip = n;
sys/arch/hppa/include/atomic.h
143
_atomic_swap_ulong(volatile unsigned long *uip, unsigned long n)
sys/arch/hppa/include/atomic.h
150
*uip = n;
sys/arch/hppa/include/atomic.h
158
_atomic_swap_ptr(volatile void *uip, void *n)
sys/arch/hppa/include/atomic.h
166
*uipp = n;
sys/arch/hppa/include/atomic.h
79
_atomic_cas_uint(volatile unsigned int *uip, unsigned int o, unsigned int n)
sys/arch/hppa/include/atomic.h
87
*uip = n;
sys/arch/hppa/include/atomic.h
95
_atomic_cas_ulong(volatile unsigned long *uip, unsigned long o, unsigned long n)
sys/arch/hppa/include/bus.h
373
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/hppa/include/bus.h
374
(*(t)->_dmamap_create)((t)->_cookie, (s), (n), (m), (b), (f), (p))
sys/arch/hppa/include/bus.h
383
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/hppa/include/bus.h
384
(*(t)->_dmamap_load_raw)((t)->_cookie, (m), (sg), (n), (s), (f))
sys/arch/hppa/include/bus.h
391
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/hppa/include/bus.h
392
(*(t)->_dmamem_alloc)((t)->_cookie, (s), (a), (b), (sg), (n), (r), (f))
sys/arch/hppa/include/bus.h
393
#define bus_dmamem_free(t, sg, n) \
sys/arch/hppa/include/bus.h
394
(*(t)->_dmamem_free)((t)->_cookie, (sg), (n))
sys/arch/hppa/include/bus.h
395
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/hppa/include/bus.h
396
(*(t)->_dmamem_map)((t)->_cookie, (sg), (n), (s), (k), (f))
sys/arch/hppa/include/bus.h
399
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/hppa/include/bus.h
400
(*(t)->_dmamem_mmap)((t)->_cookie, (sg), (n), (o), (p), (f))
sys/arch/hppa/include/cpufunc.h
215
hppa_hpa_t cpu_gethpa(int n);
sys/arch/hppa/include/frame.h
38
#define HPPA_FRAME_ARG(n) (-(32 + 4*((n) + 1)))
sys/arch/hppa/include/frame.h
39
#define HPPA_FRAME_CARG(n,sp) ((register_t *)((sp) + HPPA_FRAME_ARG(n)))
sys/arch/hppa/stand/mkboot/mkboot.c
143
n = btolifs(putfile(argv[optind], to));
sys/arch/hppa/stand/mkboot/mkboot.c
146
lifv->ipl_size = htobe32(lifstob(n));
sys/arch/hppa/stand/mkboot/mkboot.c
156
lifd[optind].dir_length = htobe32(n);
sys/arch/hppa/stand/mkboot/mkboot.c
160
lifv->vol_length += n;
sys/arch/hppa/stand/mkboot/mkboot.c
161
pos += lifstob(n);
sys/arch/hppa/stand/mkboot/mkboot.c
182
register int n, total;
sys/arch/hppa/stand/mkboot/mkboot.c
190
n = read(from, &ex, sizeof(ex));
sys/arch/hppa/stand/mkboot/mkboot.c
191
if (n != sizeof(ex))
sys/arch/hppa/stand/mkboot/mkboot.c
203
n = read(from, &elf_header, sizeof(elf_header));
sys/arch/hppa/stand/mkboot/mkboot.c
204
if (n != sizeof (elf_header))
sys/arch/hppa/stand/mkboot/mkboot.c
213
n = read(from, elf_segments, memory_needed);
sys/arch/hppa/stand/mkboot/mkboot.c
214
if (n != memory_needed)
sys/arch/hppa/stand/mkboot/mkboot.c
239
n = sizeof(buf) - sizeof(load);
sys/arch/hppa/stand/mkboot/mkboot.c
241
for (lseek(from, 0, 0); ; n = sizeof(buf)) {
sys/arch/hppa/stand/mkboot/mkboot.c
243
if ((n = read(from, buf, n)) < 0)
sys/arch/hppa/stand/mkboot/mkboot.c
245
else if (n == 0)
sys/arch/hppa/stand/mkboot/mkboot.c
248
if (write(to, buf, n) != n)
sys/arch/hppa/stand/mkboot/mkboot.c
251
total += n;
sys/arch/hppa/stand/mkboot/mkboot.c
252
check_sum = cksum(check_sum, (int *)buf, n);
sys/arch/hppa/stand/mkboot/mkboot.c
272
n = sizeof(int) - total % sizeof(int);
sys/arch/hppa/stand/mkboot/mkboot.c
274
if (write(to, buf, n) != n)
sys/arch/hppa/stand/mkboot/mkboot.c
277
total += n;
sys/arch/hppa/stand/mkboot/mkboot.c
281
n = sizeof(buf) - total % sizeof(buf);
sys/arch/hppa/stand/mkboot/mkboot.c
283
if (n < sizeof(int)) {
sys/arch/hppa/stand/mkboot/mkboot.c
284
n += sizeof(buf);
sys/arch/hppa/stand/mkboot/mkboot.c
287
total += n;
sys/arch/hppa/stand/mkboot/mkboot.c
298
n -= sizeof(int);
sys/arch/hppa/stand/mkboot/mkboot.c
300
if (write(to, buf, n) != n)
sys/arch/hppa/stand/mkboot/mkboot.c
85
register int n, pos, c;
sys/arch/i386/i386/conf.c
79
#define cdev_joy_init(c,n) { \
sys/arch/i386/i386/conf.c
80
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/arch/i386/i386/conf.c
81
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/i386/i386/conf.c
86
#define cdev_ocis_init(c,n) { \
sys/arch/i386/i386/conf.c
87
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/i386/i386/conf.c
88
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/i386/i386/conf.c
93
#define cdev_nvram_init(c,n) { \
sys/arch/i386/i386/conf.c
94
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/arch/i386/i386/esm.c
38
#define DPRINTFN(n,x...) do { if (esmdebug > (n)) printf(x); } while (0)
sys/arch/i386/i386/esm.c
42
#define DPRINTFN(n,x...) /* n: x */
sys/arch/i386/i386/est.c
1116
&& idlo == fql->table[fql->n - 1].ctrl) {
sys/arch/i386/i386/est.c
1179
fake_fqlist->n = 2;
sys/arch/i386/i386/est.c
1193
fake_fqlist->n = 3;
sys/arch/i386/i386/est.c
1204
if (est_fqlist->n < 2)
sys/arch/i386/i386/est.c
1207
low = est_fqlist->table[est_fqlist->n - 1].mhz;
sys/arch/i386/i386/est.c
1220
for (i = 0; i < est_fqlist->n; i++)
sys/arch/i386/i386/est.c
1221
printf("%d%s", est_fqlist->table[i].mhz, i < est_fqlist->n - 1
sys/arch/i386/i386/est.c
1247
for (i = 0; i < est_fqlist->n; i++) {
sys/arch/i386/i386/est.c
860
unsigned n : 5;
sys/arch/i386/i386/est.c
994
acpilist->n = nstates;
sys/arch/i386/i386/k1x-pstate.c
124
int j, n;
sys/arch/i386/i386/k1x-pstate.c
127
for (n = 0; n < cstate->n_states; n++) {
sys/arch/i386/i386/k1x-pstate.c
128
ctrl = pss[n].pss_ctrl;
sys/arch/i386/i386/k1x-pstate.c
130
state.freq = pss[n].pss_core_freq;
sys/arch/i386/i386/k1x-pstate.c
131
j = n;
sys/arch/i386/i386/powernow-k7.c
214
int i, j, n;
sys/arch/i386/i386/powernow-k7.c
217
for (n = 0, i = 0; i < npst; ++i) {
sys/arch/i386/i386/powernow-k7.c
225
j = n;
sys/arch/i386/i386/powernow-k7.c
234
++n;
sys/arch/i386/i386/powernow-k7.c
240
cstate->n_states = n;
sys/arch/i386/i386/powernow-k7.c
303
int j, k, n;
sys/arch/i386/i386/powernow-k7.c
307
for (n = 0; n < cstate->n_states; n++) {
sys/arch/i386/i386/powernow-k7.c
308
if (status == pss[n].pss_status)
sys/arch/i386/i386/powernow-k7.c
309
k = n;
sys/arch/i386/i386/powernow-k7.c
310
ctrl = pss[n].pss_ctrl;
sys/arch/i386/i386/powernow-k7.c
318
state.freq = pss[n].pss_core_freq;
sys/arch/i386/i386/powernow-k7.c
319
j = n;
sys/arch/i386/i386/powernow-k8.c
286
int i, j, n;
sys/arch/i386/i386/powernow-k8.c
289
for (n = 0, i = 0; i < cstate->n_states; i++) {
sys/arch/i386/i386/powernow-k8.c
298
j = n;
sys/arch/i386/i386/powernow-k8.c
307
n++;
sys/arch/i386/i386/powernow-k8.c
369
int j, k, n;
sys/arch/i386/i386/powernow-k8.c
374
for (n = 0; n < cstate->n_states; n++) {
sys/arch/i386/i386/powernow-k8.c
375
if ((PN8_STA_CFID(status) == PN8_PSS_CFID(pss[n].pss_status)) &&
sys/arch/i386/i386/powernow-k8.c
376
(PN8_STA_CVID(status) == PN8_PSS_CVID(pss[n].pss_status)))
sys/arch/i386/i386/powernow-k8.c
377
k = n;
sys/arch/i386/i386/powernow-k8.c
378
ctrl = pss[n].pss_ctrl;
sys/arch/i386/i386/powernow-k8.c
382
state.freq = pss[n].pss_core_freq;
sys/arch/i386/i386/powernow-k8.c
383
j = n;
sys/arch/i386/i386/ucode.c
304
int n = 0;
sys/arch/i386/i386/ucode.c
312
__func__, n, left));
sys/arch/i386/i386/ucode.c
326
__func__, n, total_size, left));
sys/arch/i386/i386/ucode.c
330
DPRINTF(("%s:%d: broken data\n", __func__, n));
sys/arch/i386/i386/ucode.c
335
n++;
sys/arch/i386/i386/ucode.c
34
#define DPRINTFN(n, x) do { if (cpu_ucode_debug >= (n)) printf x; } while (0)
sys/arch/i386/i386/ucode.c
38
#define DPRINTFN(n, x) do { ; } while (0)
sys/arch/i386/include/atomic.h
102
: "=a" (n), "=m" (*p)
sys/arch/i386/include/atomic.h
103
: "0" (n), "m" (*p));
sys/arch/i386/include/atomic.h
105
return (n);
sys/arch/i386/include/atomic.h
110
_atomic_swap_ptr(volatile void *p, void *n)
sys/arch/i386/include/atomic.h
113
: "=a" (n), "=m" (*(unsigned long *)p)
sys/arch/i386/include/atomic.h
114
: "0" (n), "m" (*(unsigned long *)p));
sys/arch/i386/include/atomic.h
116
return (n);
sys/arch/i386/include/atomic.h
54
_atomic_cas_uint(volatile unsigned int *p, unsigned int e, unsigned int n)
sys/arch/i386/include/atomic.h
57
: "=a" (n), "=m" (*p)
sys/arch/i386/include/atomic.h
58
: "r" (n), "a" (e), "m" (*p));
sys/arch/i386/include/atomic.h
60
return (n);
sys/arch/i386/include/atomic.h
65
_atomic_cas_ulong(volatile unsigned long *p, unsigned long e, unsigned long n)
sys/arch/i386/include/atomic.h
68
: "=a" (n), "=m" (*p)
sys/arch/i386/include/atomic.h
69
: "r" (n), "a" (e), "m" (*p));
sys/arch/i386/include/atomic.h
71
return (n);
sys/arch/i386/include/atomic.h
76
_atomic_cas_ptr(volatile void *p, void *e, void *n)
sys/arch/i386/include/atomic.h
79
: "=a" (n), "=m" (*(unsigned long *)p)
sys/arch/i386/include/atomic.h
80
: "r" (n), "a" (e), "m" (*(unsigned long *)p));
sys/arch/i386/include/atomic.h
82
return (n);
sys/arch/i386/include/atomic.h
87
_atomic_swap_uint(volatile unsigned int *p, unsigned int n)
sys/arch/i386/include/atomic.h
90
: "=a" (n), "=m" (*p)
sys/arch/i386/include/atomic.h
91
: "0" (n), "m" (*p));
sys/arch/i386/include/atomic.h
93
return (n);
sys/arch/i386/include/atomic.h
99
_atomic_swap_ulong(volatile unsigned long *p, unsigned long n)
sys/arch/i386/include/biosvar.h
250
#define DOINT(n) int $0x20+(n)
sys/arch/i386/include/biosvar.h
252
#define DOINT(n) "int $0x20+(" #n ")"
sys/arch/i386/include/bus.h
613
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/i386/include/bus.h
614
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/i386/include/bus.h
623
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/i386/include/bus.h
624
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/i386/include/bus.h
630
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/i386/include/bus.h
631
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/i386/include/bus.h
632
#define bus_dmamem_alloc_range(t, s, a, b, sg, n, r, f, l, h) \
sys/arch/i386/include/bus.h
634
(n), (r), (f), (l), (h))
sys/arch/i386/include/bus.h
635
#define bus_dmamem_free(t, sg, n) \
sys/arch/i386/include/bus.h
636
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/i386/include/bus.h
637
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/i386/include/bus.h
638
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/i386/include/bus.h
641
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/i386/include/bus.h
642
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/i386/include/conf.h
42
#define cdev_acpiapm_init(c,n) {\
sys/arch/i386/include/conf.h
43
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/i386/include/conf.h
44
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/i386/include/conf.h
46
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/arch/i386/include/specialreg.h
798
#define PATENTRY(n, type) ((uint64_t)type << ((n) * 8))
sys/arch/i386/isa/clock.c
312
i8254_delay(int n)
sys/arch/i386/isa/clock.c
328
n -= 5;
sys/arch/i386/isa/clock.c
329
if (n < 0)
sys/arch/i386/isa/clock.c
332
: "=a" (n)
sys/arch/i386/isa/clock.c
333
: "0" (n), "r" (TIMER_FREQ), "r" (1000000)
sys/arch/i386/isa/clock.c
340
n -= 20;
sys/arch/i386/isa/clock.c
342
int sec = n / 1000000,
sys/arch/i386/isa/clock.c
343
usec = n % 1000000;
sys/arch/i386/isa/clock.c
344
n = sec * TIMER_FREQ +
sys/arch/i386/isa/clock.c
353
while (n > 0) {
sys/arch/i386/isa/clock.c
356
n -= limit - (tick - otick);
sys/arch/i386/isa/clock.c
358
n -= otick - tick;
sys/arch/i386/isa/clock.c
490
bcdtobin(int n)
sys/arch/i386/isa/clock.c
492
return (((n >> 4) & 0x0f) * 10 + (n & 0x0f));
sys/arch/i386/isa/clock.c
496
bintobcd(int n)
sys/arch/i386/isa/clock.c
498
return ((u_char)(((n / 10) << 4) & 0xf0) | ((n % 10) & 0x0f));
sys/arch/i386/pci/amd756reg.h
61
#define AMD756_SET_EDGESEL(ph, n) \
sys/arch/i386/pci/amd756reg.h
64
& 0xffff0000) | (n))
sys/arch/i386/pci/amd756reg.h
66
#define AMD756_SET_PIIRQSEL(ph, n) \
sys/arch/i386/pci/amd756reg.h
69
& 0x000000ff) | ((n) << 16))
sys/arch/i386/pci/via8231reg.h
114
#define VIA8231_SET_ROUTING(ph, n) \
sys/arch/i386/pci/via8231reg.h
117
& ~VIA8231_ROUTING_CNFG_MASK) | ((n) << VIA8231_ROUTING_CNFG_SHFT))
sys/arch/i386/pci/via8231reg.h
118
#define VIA8237_SET_ROUTING(ph, n) \
sys/arch/i386/pci/via8231reg.h
122
((n) << VIA8237_ROUTING_CNFG_SHFT) | VIA8237_TRIGGER_CNFG_ENA)
sys/arch/i386/pci/via8231reg.h
91
#define VIA8231_SET_TRIGGER(ph, n) \
sys/arch/i386/pci/via8231reg.h
94
& ~VIA8231_TRIGGER_CNFG_MASK) | ((n) << VIA8231_TRIGGER_CNFG_SHFT))
sys/arch/i386/pci/via8231reg.h
95
#define VIA8237_SET_TRIGGER(ph, n) \
sys/arch/i386/pci/via8231reg.h
98
& ~VIA8237_TRIGGER_CNFG_MASK) | ((n) << VIA8237_TRIGGER_CNFG_SHFT))
sys/arch/i386/stand/libsa/bioscons.c
121
register int i, n;
sys/arch/i386/stand/libsa/bioscons.c
124
__asm volatile(DOINT(0x11) : "=a" (n) : : "%ecx", "%edx", "cc");
sys/arch/i386/stand/libsa/bioscons.c
125
n >>= 9;
sys/arch/i386/stand/libsa/bioscons.c
126
n &= 7;
sys/arch/i386/stand/libsa/bioscons.c
127
for (i = 0; i < n; i++)
sys/arch/i386/stand/libsa/bioscons.c
200
#define divrnd(n, q) (((n)*2/(q)+1)/2) /* divide and round off */
sys/arch/i386/stand/libsa/biosdev.c
290
size_t i, n;
sys/arch/i386/stand/libsa/biosdev.c
295
i += n, off += n, p += n * DEV_BSIZE) {
sys/arch/i386/stand/libsa/biosdev.c
301
n = bd->bios_sectors - sect;
sys/arch/i386/stand/libsa/biosdev.c
303
n = nsect - i;
sys/arch/i386/stand/libsa/biosdev.c
305
error = CHS_rw(rw, dev, cyl, head, sect, n, p);
sys/arch/i386/stand/libsa/biosdev.c
350
int n, ret;
sys/arch/i386/stand/libsa/biosdev.c
358
n = nsect >= MAXSECTS ? MAXSECTS : nsect;
sys/arch/i386/stand/libsa/biosdev.c
359
ret = biosd_io(rw, &dip->bios_info, off, n, dest);
sys/arch/i386/stand/libsa/debug.c
89
dump_mem(char *l, void *p, size_t n)
sys/arch/i386/stand/libsa/debug.c
93
printf("%s [%p]:%s", l, p, (n > 6? "\n":" "));
sys/arch/i386/stand/libsa/debug.c
94
for (i = 1; i <= n; i++)
sys/arch/i386/stand/libsa/debug.c
96
if (n % 8)
sys/arch/i386/stand/libsa/diskprobe.c
189
int n;
sys/arch/i386/stand/libsa/diskprobe.c
196
n = 0;
sys/arch/i386/stand/libsa/diskprobe.c
199
printf(" hd%u", n);
sys/arch/i386/stand/libsa/diskprobe.c
201
dip->bios_info.bios_number = 0x80 | n;
sys/arch/i386/stand/libsa/diskprobe.c
237
n++;
sys/arch/landisk/include/bus.h
515
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/landisk/include/bus.h
516
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/landisk/include/bus.h
525
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/landisk/include/bus.h
526
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/landisk/include/bus.h
533
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/landisk/include/bus.h
534
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/landisk/include/bus.h
535
#define bus_dmamem_free(t, sg, n) \
sys/arch/landisk/include/bus.h
536
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/landisk/include/bus.h
537
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/landisk/include/bus.h
538
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/landisk/include/bus.h
541
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/landisk/include/bus.h
542
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/landisk/stand/boot/scifcons.c
126
#define divrnd(n, q) (((n)*2/(q)+1)/2) /* divide and round off */
sys/arch/loongson/dev/radeonfb.c
498
radeonfb_wait_fifo(struct radeonfb *fb, int n)
sys/arch/loongson/dev/radeonfb.c
504
RADEON_RBBM_STATUS) & RADEON_RBBM_FIFOCNT_MASK) >= n)
sys/arch/loongson/include/bus.h
127
#define bus_space_read_multi(n,m) \
sys/arch/loongson/include/bus.h
129
CAT(bus_space_read_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/loongson/include/bus.h
133
*x++ = CAT(bus_space_read_,n)(bst, bsh, o); \
sys/arch/loongson/include/bus.h
142
#define bus_space_read_region(n,m) \
sys/arch/loongson/include/bus.h
144
CAT(bus_space_read_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/loongson/include/bus.h
148
*x++ = CAT(bus_space_read_,n)(bst, bsh, ba); \
sys/arch/loongson/include/bus.h
149
ba += (n); \
sys/arch/loongson/include/bus.h
159
#define bus_space_read_raw_region(n,m) \
sys/arch/loongson/include/bus.h
161
CAT(bus_space_read_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/loongson/include/bus.h
165
cnt >>= ((n) >> 1); \
sys/arch/loongson/include/bus.h
167
CAT(bus_space_read_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/loongson/include/bus.h
168
ba += (n); \
sys/arch/loongson/include/bus.h
169
x += (n); \
sys/arch/loongson/include/bus.h
178
#define bus_space_write_multi(n,m) \
sys/arch/loongson/include/bus.h
180
CAT(bus_space_write_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/loongson/include/bus.h
184
CAT(bus_space_write_,n)(bst, bsh, o, *x++); \
sys/arch/loongson/include/bus.h
193
#define bus_space_write_region(n,m) \
sys/arch/loongson/include/bus.h
195
CAT(bus_space_write_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/loongson/include/bus.h
199
CAT(bus_space_write_,n)(bst, bsh, ba, *x++); \
sys/arch/loongson/include/bus.h
200
ba += (n); \
sys/arch/loongson/include/bus.h
210
#define bus_space_write_raw_region(n,m) \
sys/arch/loongson/include/bus.h
212
CAT(bus_space_write_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/loongson/include/bus.h
216
cnt >>= ((n) >> 1); \
sys/arch/loongson/include/bus.h
218
CAT(bus_space_write_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/loongson/include/bus.h
219
ba += (n); \
sys/arch/loongson/include/bus.h
220
x += (n); \
sys/arch/loongson/include/bus.h
229
#define bus_space_set_region(n,m) \
sys/arch/loongson/include/bus.h
231
CAT(bus_space_set_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/loongson/include/bus.h
235
CAT(bus_space_write_,n)(bst, bsh, ba, x); \
sys/arch/loongson/include/bus.h
236
ba += (n); \
sys/arch/loongson/include/bus.h
434
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/loongson/include/bus.h
435
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/loongson/include/bus.h
444
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/loongson/include/bus.h
445
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/loongson/include/bus.h
452
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/loongson/include/bus.h
453
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/loongson/include/bus.h
454
#define bus_dmamem_free(t, sg, n) \
sys/arch/loongson/include/bus.h
455
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/loongson/include/bus.h
456
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/loongson/include/bus.h
457
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/loongson/include/bus.h
460
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/loongson/include/bus.h
461
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/loongson/include/conf.h
36
#define cdev_apm_init(c,n) { \
sys/arch/loongson/include/conf.h
37
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/loongson/include/conf.h
38
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/loongson/include/conf.h
40
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/arch/loongson/include/isa_machdep.h
41
#define isa_intr_establish(c, i, t, l, f, a, n) \
sys/arch/loongson/include/isa_machdep.h
42
(*(c)->ic_intr_establish)((c)->ic_v, (i), (t), (l), (f), (a), (n))
sys/arch/luna88k/cbus/cbus.c
331
int n;
sys/arch/luna88k/cbus/cbus.c
353
while ((n = ff1(intr_status)) != 32) {
sys/arch/luna88k/cbus/cbus.c
354
cbus_isrdispatch(6 - n);
sys/arch/luna88k/cbus/cbus.c
355
*cbus_isreg = (u_int8_t)n;
sys/arch/luna88k/cbus/cbus.c
356
intr_status &= ~(1 << n);
sys/arch/luna88k/dev/maskbits.h
100
*(dp) = (*(dp) & ~n) | (OMFB_MBR(sw, x) & n); \
sys/arch/luna88k/dev/maskbits.h
104
*(dp + 1) = (*(dp + 1) & rasops_lmask[n]) \
sys/arch/luna88k/dev/maskbits.h
105
| (OMFB_MBL(sw, 32-(x)) & rasops_rmask[n]); \
sys/arch/luna88k/dev/maskbits.h
96
int n = (x) + (w) - 32; \
sys/arch/luna88k/dev/maskbits.h
98
if (n <= 0) { \
sys/arch/luna88k/dev/maskbits.h
99
n = rasops_pmask[x & 31][w & 31]; \
sys/arch/luna88k/dev/mb89352.c
1105
SPC_MISC(("n=%d imess=0x%02x ", n, sc->sc_imess[0]));
sys/arch/luna88k/dev/mb89352.c
1119
int n;
sys/arch/luna88k/dev/mb89352.c
1146
n = sc->sc_omp - sc->sc_omess;
sys/arch/luna88k/dev/mb89352.c
1167
n = 1;
sys/arch/luna88k/dev/mb89352.c
1179
n = 5;
sys/arch/luna88k/dev/mb89352.c
1191
n = 4;
sys/arch/luna88k/dev/mb89352.c
1198
n = 1;
sys/arch/luna88k/dev/mb89352.c
1203
n = 1;
sys/arch/luna88k/dev/mb89352.c
1208
n = 1;
sys/arch/luna88k/dev/mb89352.c
1213
n = 1;
sys/arch/luna88k/dev/mb89352.c
1219
n = 1;
sys/arch/luna88k/dev/mb89352.c
1227
n = 1;
sys/arch/luna88k/dev/mb89352.c
1230
sc->sc_omp = &sc->sc_omess[n];
sys/arch/luna88k/dev/mb89352.c
1235
bus_space_write_1(iot, ioh, TCH, n >> 16);
sys/arch/luna88k/dev/mb89352.c
1236
bus_space_write_1(iot, ioh, TCM, n >> 8);
sys/arch/luna88k/dev/mb89352.c
1237
bus_space_write_1(iot, ioh, TCL, n);
sys/arch/luna88k/dev/mb89352.c
1279
if (n == 1 && sc->sc_msgpriq == 0)
sys/arch/luna88k/dev/mb89352.c
1287
--n;
sys/arch/luna88k/dev/mb89352.c
1296
if (n == 0)
sys/arch/luna88k/dev/mb89352.c
1328
spc_dataout_pio(struct spc_softc *sc, u_char *p, int n)
sys/arch/luna88k/dev/mb89352.c
1338
bus_space_write_1(iot, ioh, TCH, n >> 16);
sys/arch/luna88k/dev/mb89352.c
1339
bus_space_write_1(iot, ioh, TCM, n >> 8);
sys/arch/luna88k/dev/mb89352.c
1340
bus_space_write_1(iot, ioh, TCL, n);
sys/arch/luna88k/dev/mb89352.c
1360
while (n > 0) {
sys/arch/luna88k/dev/mb89352.c
1374
xfer = min(DOUTAMOUNT, n);
sys/arch/luna88k/dev/mb89352.c
1378
n -= xfer;
sys/arch/luna88k/dev/mb89352.c
1454
spc_datain_pio(struct spc_softc *sc, u_char *p, int n)
sys/arch/luna88k/dev/mb89352.c
1464
bus_space_write_1(iot, ioh, TCH, n >> 16);
sys/arch/luna88k/dev/mb89352.c
1465
bus_space_write_1(iot, ioh, TCM, n >> 8);
sys/arch/luna88k/dev/mb89352.c
1466
bus_space_write_1(iot, ioh, TCL, n);
sys/arch/luna88k/dev/mb89352.c
1486
while (n > 0) {
sys/arch/luna88k/dev/mb89352.c
1508
xfer = min(DINAMOUNT, n);
sys/arch/luna88k/dev/mb89352.c
1514
n -= xfer;
sys/arch/luna88k/dev/mb89352.c
1584
int n;
sys/arch/luna88k/dev/mb89352.c
1894
n = spc_dataout_pio(sc, sc->sc_cp, sc->sc_cleft);
sys/arch/luna88k/dev/mb89352.c
1895
sc->sc_cp += n;
sys/arch/luna88k/dev/mb89352.c
1896
sc->sc_cleft -= n;
sys/arch/luna88k/dev/mb89352.c
1904
n = spc_dataout_pio(sc, sc->sc_dp, sc->sc_dleft);
sys/arch/luna88k/dev/mb89352.c
1905
sc->sc_dp += n;
sys/arch/luna88k/dev/mb89352.c
1906
sc->sc_dleft -= n;
sys/arch/luna88k/dev/mb89352.c
1914
n = spc_datain_pio(sc, sc->sc_dp, sc->sc_dleft);
sys/arch/luna88k/dev/mb89352.c
1915
sc->sc_dp += n;
sys/arch/luna88k/dev/mb89352.c
1916
sc->sc_dleft -= n;
sys/arch/luna88k/dev/mb89352.c
812
int n;
sys/arch/luna88k/dev/mb89352.c
818
n = sc->sc_imp - sc->sc_imess;
sys/arch/luna88k/dev/mb89352.c
826
n = 0;
sys/arch/luna88k/dev/mb89352.c
827
sc->sc_imp = &sc->sc_imess[n];
sys/arch/luna88k/dev/mb89352.c
888
if (n >= SPC_MAX_MSG_LEN) {
sys/arch/luna88k/dev/mb89352.c
894
n++;
sys/arch/luna88k/dev/mb89352.c
901
if (n == 1 && IS1BYTEMSG(sc->sc_imess[0]))
sys/arch/luna88k/dev/mb89352.c
903
if (n == 2 && IS2BYTEMSG(sc->sc_imess[0]))
sys/arch/luna88k/dev/mb89352.c
905
if (n >= 3 && ISEXTMSG(sc->sc_imess[0]) &&
sys/arch/luna88k/dev/mb89352.c
906
n == sc->sc_imess[1] + 2)
sys/arch/luna88k/dev/mb89352.c
925
SPC_MISC(("n=%d imess=0x%02x ", n, sc->sc_imess[0]));
sys/arch/luna88k/dev/omkbdmap.c
180
#define KC(n) KS_KEYCODE(n)
sys/arch/luna88k/dev/omrasops.c
341
om_copyrows(void *cookie, int src, int dst, int n)
sys/arch/luna88k/dev/omrasops.c
345
n *= ri->ri_font->fontheight;
sys/arch/luna88k/dev/omrasops.c
351
ri->ri_emuwidth, n, RR_COPY, 0xff);
sys/arch/luna88k/dev/omrasops.c
357
om_copycols(void *cookie, int row, int src, int dst, int n)
sys/arch/luna88k/dev/omrasops.c
361
n *= ri->ri_font->fontwidth;
sys/arch/luna88k/dev/omrasops.c
368
n, ri->ri_font->fontheight, RR_COPY, 0xff);
sys/arch/luna88k/include/conf.h
52
#define cdev_lcd_init(c,n) { \
sys/arch/luna88k/include/conf.h
53
dev_init(c,n,open), dev_init(c,n,close), \
sys/arch/luna88k/include/conf.h
54
(dev_type_read((*))) enodev, dev_init(c,n,write), \
sys/arch/luna88k/include/conf.h
55
dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/arch/luna88k/include/conf.h
59
#define cdev_pcex_init(c,n) { \
sys/arch/luna88k/include/conf.h
60
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/luna88k/include/conf.h
61
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/luna88k/include/conf.h
63
dev_init(c,n,mmap) }
sys/arch/luna88k/include/conf.h
66
#define cdev_xp_init(c,n) { \
sys/arch/luna88k/include/conf.h
67
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/luna88k/include/conf.h
68
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/luna88k/include/conf.h
70
dev_init(c,n,mmap) }
sys/arch/luna88k/stand/boot/rcvbuf.h
100
rcvbuf[n].rb_pop = &rcvbuf[n].rb_buf[RBUF_SIZE]; \
sys/arch/luna88k/stand/boot/rcvbuf.h
103
#define PEEK_RBUF(n, c) \
sys/arch/luna88k/stand/boot/rcvbuf.h
105
c= *(rcvbuf[n].rb_pop - 1); \
sys/arch/luna88k/stand/boot/rcvbuf.h
108
#define RBUF_EMPTY(n) (rcvbuf[n].rb_push == rcvbuf[n].rb_pop ? 1: 0)
sys/arch/luna88k/stand/boot/rcvbuf.h
87
#define RBUF_INIT(n) rcvbuf[n].rb_pop = rcvbuf[n].rb_push = &rcvbuf[n].rb_buf[RBUF_SIZE]
sys/arch/luna88k/stand/boot/rcvbuf.h
89
#define PUSH_RBUF(n, c) \
sys/arch/luna88k/stand/boot/rcvbuf.h
91
*(--rcvbuf[n].rb_push) = c ; \
sys/arch/luna88k/stand/boot/rcvbuf.h
92
if (rcvbuf[n].rb_push == rcvbuf[n].rb_buf) \
sys/arch/luna88k/stand/boot/rcvbuf.h
93
rcvbuf[n].rb_push = &rcvbuf[n].rb_buf[RBUF_SIZE]; \
sys/arch/luna88k/stand/boot/rcvbuf.h
96
#define POP_RBUF(n, c) \
sys/arch/luna88k/stand/boot/rcvbuf.h
98
c= *(--rcvbuf[n].rb_pop); \
sys/arch/luna88k/stand/boot/rcvbuf.h
99
if (rcvbuf[n].rb_pop == rcvbuf[n].rb_buf) \
sys/arch/luna88k/stand/boot/samachdep.h
132
#define DELAY(n) delay(n)
sys/arch/m88k/include/atomic.h
137
#define atomic_cas_ulong(p,o,n) \
sys/arch/m88k/include/atomic.h
139
(unsigned int)n))
sys/arch/m88k/include/atomic.h
140
#define atomic_cas_ptr(p,o,n) \
sys/arch/m88k/include/atomic.h
141
((void *)atomic_cas_uint((void *)p, (unsigned int)o, (unsigned int)n))
sys/arch/m88k/include/atomic.h
84
atomic_cas_uint_sp(volatile unsigned int *p, unsigned int o, unsigned int n)
sys/arch/m88k/include/atomic.h
93
*p = n;
sys/arch/m88k/include/m8820x.h
142
#define CMMU_CSSP_VV(n,v) (((v) & 0x03) << (12 + 2 * (n)))
sys/arch/m88k/include/m8820x.h
77
#define CMMU_BWP(n) (CMMU_BWP0 + (n))
sys/arch/m88k/include/m8820x.h
87
#define CMMU_CSSP(n) ((0x880 + (n * 0x10)) / 4)
sys/arch/macppc/dev/awacs.c
1065
size_t n, i;
sys/arch/macppc/dev/awacs.c
1067
n = sizeof(awacs_speeds)/sizeof(awacs_speeds[0]);
sys/arch/macppc/dev/awacs.c
1071
if (p->sample_rate > awacs_speeds[n - 1].rate)
sys/arch/macppc/dev/awacs.c
1072
selected = n - 1;
sys/arch/macppc/dev/awacs.c
1074
for (i = 1; selected == -1 && i < n; i++) {
sys/arch/macppc/dev/i2s.c
458
int n = 0;
sys/arch/macppc/dev/i2s.c
467
strlcpy(dip->un.s.member[n].label.name, AudioNspeaker,
sys/arch/macppc/dev/i2s.c
468
sizeof(dip->un.s.member[n].label.name));
sys/arch/macppc/dev/i2s.c
469
dip->un.s.member[n++].mask = I2S_SELECT_SPEAKER;
sys/arch/macppc/dev/i2s.c
471
strlcpy(dip->un.s.member[n].label.name,
sys/arch/macppc/dev/i2s.c
473
sizeof(dip->un.s.member[n].label.name));
sys/arch/macppc/dev/i2s.c
474
dip->un.s.member[n++].mask = I2S_SELECT_HEADPHONE;
sys/arch/macppc/dev/i2s.c
477
strlcpy(dip->un.s.member[n].label.name, AudioNline,
sys/arch/macppc/dev/i2s.c
478
sizeof(dip->un.s.member[n].label.name));
sys/arch/macppc/dev/i2s.c
479
dip->un.s.member[n++].mask = I2S_SELECT_LINEOUT;
sys/arch/macppc/dev/i2s.c
481
dip->un.s.num_mem = n;
sys/arch/macppc/dev/if_bm.c
504
int i, n;
sys/arch/macppc/dev/if_bm.c
511
for (n = 0; n < BMAC_RXBUFS; n++, i++) {
sys/arch/macppc/dev/if_bm.c
657
struct mbuf *n;
sys/arch/macppc/dev/if_bm.c
660
for (; m; m = n) {
sys/arch/macppc/dev/if_bm.c
663
n = m_free(m);
sys/arch/macppc/dev/if_bm.c
669
n = m_free(m);
sys/arch/macppc/dev/if_mc.c
832
struct mbuf *n;
sys/arch/macppc/dev/if_mc.c
838
for (; m; m = n) {
sys/arch/macppc/dev/if_mc.c
844
n = m_free(m);
sys/arch/macppc/dev/if_mc.c
966
int i, n, count;
sys/arch/macppc/dev/if_mc.c
972
for (n = 0; n < MC_RXDMABUFS; n++, i++) {
sys/arch/macppc/include/bus.h
105
#define bus_space_write(n,m) \
sys/arch/macppc/include/bus.h
107
CAT(bus_space_write_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/macppc/include/bus.h
119
#define bus_space_read_raw(n,m) \
sys/arch/macppc/include/bus.h
121
CAT(bus_space_read_raw_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/macppc/include/bus.h
133
#define bus_space_write_raw(n,m) \
sys/arch/macppc/include/bus.h
135
CAT(bus_space_write_raw_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/macppc/include/bus.h
147
#define bus_space_read_multi(n, m) \
sys/arch/macppc/include/bus.h
149
CAT(bus_space_read_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/macppc/include/bus.h
153
*buf++ = CAT(bus_space_read_,n)(bst, bsh, ba); \
sys/arch/macppc/include/bus.h
165
#define bus_space_write_multi(n, m) \
sys/arch/macppc/include/bus.h
167
CAT(bus_space_write_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/macppc/include/bus.h
171
CAT(bus_space_write_,n)(bst, bsh, ba, *buf++); \
sys/arch/macppc/include/bus.h
562
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/macppc/include/bus.h
563
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/macppc/include/bus.h
572
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/macppc/include/bus.h
573
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/macppc/include/bus.h
580
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/macppc/include/bus.h
581
(*(t)->_dmamem_alloc)((t)->_cookie, (s), (a), (b), (sg), (n), (r), (f))
sys/arch/macppc/include/bus.h
582
#define bus_dmamem_alloc_range(t, s, a, b, sg, n, r, f, l, h) \
sys/arch/macppc/include/bus.h
584
(n), (r), (f), (l), (h))
sys/arch/macppc/include/bus.h
585
#define bus_dmamem_free(t, sg, n) \
sys/arch/macppc/include/bus.h
586
(*(t)->_dmamem_free)((t)->_cookie, (sg), (n))
sys/arch/macppc/include/bus.h
587
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/macppc/include/bus.h
588
(*(t)->_dmamem_map)((t)->_cookie, (sg), (n), (s), (k), (f))
sys/arch/macppc/include/bus.h
591
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/macppc/include/bus.h
592
(*(t)->_dmamem_mmap)((t)->_cookie, (sg), (n), (o), (p), (f))
sys/arch/macppc/include/bus.h
91
#define bus_space_read(n,m) \
sys/arch/macppc/include/bus.h
93
CAT(bus_space_read_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/macppc/include/conf.h
40
#define cdev_apm_init(c,n) { \
sys/arch/macppc/include/conf.h
41
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/macppc/include/conf.h
42
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/macppc/include/conf.h
44
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/arch/macppc/include/conf.h
50
#define cdev_openprom_init(c,n) { \
sys/arch/macppc/include/conf.h
51
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/macppc/include/conf.h
52
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/macppc/include/pci_machdep.h
62
#define PCITAG_CREATE(n,b,d,f) (((uint64_t)(n)<<32)|((b)<<16)|((d)<<11)|((f)<<8))
sys/arch/macppc/macppc/clock.c
156
int calibrate = 0, n;
sys/arch/macppc/macppc/clock.c
159
for (n = 0; n < sizeof(calibrate_tc_models) /
sys/arch/macppc/macppc/clock.c
160
sizeof(calibrate_tc_models[0]); n++) {
sys/arch/macppc/macppc/clock.c
161
if (!strcmp(calibrate_tc_models[n], hw_prod)) {
sys/arch/macppc/macppc/clock.c
220
delay(unsigned n)
sys/arch/macppc/macppc/clock.c
225
tb += (n * 1000 + ns_per_tick - 1) / ns_per_tick;
sys/arch/macppc/macppc/disksubr.c
104
int error, i, part_cnt, n, hfspartoff = -1;
sys/arch/macppc/macppc/disksubr.c
119
n = 8;
sys/arch/macppc/macppc/disksubr.c
150
if (n >= MAXPARTITIONS || partoffp)
sys/arch/macppc/macppc/disksubr.c
155
pp = &lp->d_partitions[n];
sys/arch/macppc/macppc/disksubr.c
159
n++;
sys/arch/macppc/macppc/opendev.c
106
for (ip = args.args_n_results + nargs + (n = args.nreturns);
sys/arch/macppc/macppc/opendev.c
107
--n > 0;)
sys/arch/macppc/macppc/opendev.c
132
int *ip, n, ret;
sys/arch/macppc/macppc/opendev.c
141
for (ip = args.args_n_results + (n = nargs); --n >= 0;)
sys/arch/macppc/macppc/opendev.c
89
int *ip, n, ret;
sys/arch/macppc/macppc/opendev.c
99
for (ip = args.args_n_results + (n = nargs); --n >= 0;)
sys/arch/macppc/stand/Locore.c
456
int *ip, n;
sys/arch/macppc/stand/Locore.c
465
for (ip = args.args_n_results + (n = nargs); --n >= 0;)
sys/arch/macppc/stand/Locore.c
476
for (ip = args.args_n_results + nargs + (n = args.nreturns); --n > 0;)
sys/arch/macppc/stand/ofdev.c
106
n = OF_read(dev->handle, buf, size);
sys/arch/macppc/stand/ofdev.c
107
if (n == -2)
sys/arch/macppc/stand/ofdev.c
109
if (n < 0)
sys/arch/macppc/stand/ofdev.c
111
*rsize = n;
sys/arch/macppc/stand/ofdev.c
94
int n;
sys/arch/mips64/include/atomic.h
112
: "r" (n), "Ir" (o));
sys/arch/mips64/include/atomic.h
158
_atomic_swap_ptr(volatile void *uipp, void *n)
sys/arch/mips64/include/atomic.h
170
: "r" (n));
sys/arch/mips64/include/atomic.h
61
_atomic_cas_uint(volatile unsigned int *p, unsigned int o, unsigned int n)
sys/arch/mips64/include/atomic.h
73
: "r" (n), "Ir" (o));
sys/arch/mips64/include/atomic.h
80
_atomic_cas_ulong(volatile unsigned long *p, unsigned long o, unsigned long n)
sys/arch/mips64/include/atomic.h
92
: "r" (n), "Ir" (o));
sys/arch/mips64/include/atomic.h
99
_atomic_cas_ptr(volatile void *pp, void *o, void *n)
sys/arch/mips64/include/loongson3.h
102
#define LS3_HT1_MEM_BASE(n) (LS3_MEM_BASE(n)+0x00000e0000000000ull)
sys/arch/mips64/include/loongson3.h
103
#define LS3_HT1_CFG_BASE(n) (LS3_MEM_BASE(n)+0x00000efdfb000000ull)
sys/arch/mips64/include/loongson3.h
29
#define LS3_IPI_BASE(n, c) (LS3_CFG_BASE(n) + 0x1000 + 0x100*(c))
sys/arch/mips64/include/param.h
76
#define DELAY(n) delay(n)
sys/arch/mips64/mips64/mips64_machdep.c
232
delay(int n)
sys/arch/mips64/mips64/mips64_machdep.c
243
dly = (delayconst / 1000000) * n;
sys/arch/mips64/mips64/pmap.c
231
pmap_pte_cas(pt_entry_t *pte, pt_entry_t o, pt_entry_t n)
sys/arch/mips64/mips64/pmap.c
234
return atomic_cas_ulong((unsigned long *)pte, o, n);
sys/arch/mips64/mips64/pmap.c
236
return atomic_cas_uint((unsigned int *)pte, o, n);
sys/arch/octeon/dev/cn30xxgmxreg.h
651
#define GMX0_BASE_IF_SIZE(n) (GMX0_BASE_PORT_SIZE * (n))
sys/arch/octeon/dev/if_cnmac.c
1092
cnmac_mbuf_alloc(int n)
sys/arch/octeon/dev/if_cnmac.c
1097
while (n > 0) {
sys/arch/octeon/dev/if_cnmac.c
1114
n--;
sys/arch/octeon/dev/if_cnmac.c
1116
return n;
sys/arch/octeon/dev/if_cnmac.c
1395
#define KVE(n, t) \
sys/arch/octeon/dev/if_cnmac.c
1396
KSTAT_KV_UNIT_INITIALIZER((n), KSTAT_KV_T_COUNTER64, (t))
sys/arch/octeon/dev/if_ogx.c
1181
ogx_load_mbufs(struct ogx_softc *sc, unsigned int n)
sys/arch/octeon/dev/if_ogx.c
1186
for ( ; n > 0; n--) {
sys/arch/octeon/dev/if_ogx.c
1199
return n;
sys/arch/octeon/dev/if_ogx.c
1207
unsigned int n = 0;
sys/arch/octeon/dev/if_ogx.c
1215
n++;
sys/arch/octeon/dev/if_ogx.c
1217
return n;
sys/arch/octeon/dev/octcrypto.c
44
#define ndwords(n) (roundup(n, 8) / (8))
sys/arch/octeon/dev/octiic.c
444
int m, n, thp;
sys/arch/octeon/dev/octiic.c
450
#define TCLK(ioclk, thp, n, m) \
sys/arch/octeon/dev/octiic.c
451
((ioclk) / (20 * ((thp) + 1) * (1 << (n)) * ((m) + 1)))
sys/arch/octeon/dev/octiic.c
453
for (n = 7; n > 0; n--) {
sys/arch/octeon/dev/octiic.c
454
if (TCLK(ioclk, thp, n, 16) > freq)
sys/arch/octeon/dev/octiic.c
458
if (TCLK(ioclk, thp, n, m - 1) > freq)
sys/arch/octeon/dev/octiic.c
462
tclk = TCLK(ioclk, thp, n, m);
sys/arch/octeon/dev/octiic.c
467
best_n = n;
sys/arch/octeon/dev/octmmc.c
68
#define divround(n, d) (((n) + (d) / 2) / (d))
sys/arch/octeon/dev/octxctlreg.h
78
#define DWC3_GUSB2PHYCFG(n) (0xc200 + ((n) * 0x04))
sys/arch/octeon/dev/octxctlreg.h
81
#define DWC3_GUSB3PIPECTL(n) (0xc2c0 + ((n) * 0x04))
sys/arch/octeon/include/bus.h
125
#define bus_space_read_multi(n,m) \
sys/arch/octeon/include/bus.h
127
CAT(bus_space_read_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/octeon/include/bus.h
131
*x++ = CAT(bus_space_read_,n)(bst, bsh, o); \
sys/arch/octeon/include/bus.h
140
#define bus_space_read_region(n,m) \
sys/arch/octeon/include/bus.h
142
CAT(bus_space_read_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/octeon/include/bus.h
146
*x++ = CAT(bus_space_read_,n)(bst, bsh, ba); \
sys/arch/octeon/include/bus.h
147
ba += (n); \
sys/arch/octeon/include/bus.h
157
#define bus_space_read_raw_region(n,m) \
sys/arch/octeon/include/bus.h
159
CAT(bus_space_read_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/octeon/include/bus.h
163
cnt >>= ((n) >> 1); \
sys/arch/octeon/include/bus.h
165
CAT(bus_space_read_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/octeon/include/bus.h
166
ba += (n); \
sys/arch/octeon/include/bus.h
167
x += (n); \
sys/arch/octeon/include/bus.h
176
#define bus_space_write_multi(n,m) \
sys/arch/octeon/include/bus.h
178
CAT(bus_space_write_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/octeon/include/bus.h
182
CAT(bus_space_write_,n)(bst, bsh, o, *x++); \
sys/arch/octeon/include/bus.h
191
#define bus_space_write_region(n,m) \
sys/arch/octeon/include/bus.h
193
CAT(bus_space_write_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/octeon/include/bus.h
197
CAT(bus_space_write_,n)(bst, bsh, ba, *x++); \
sys/arch/octeon/include/bus.h
198
ba += (n); \
sys/arch/octeon/include/bus.h
208
#define bus_space_write_raw_region(n,m) \
sys/arch/octeon/include/bus.h
210
CAT(bus_space_write_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/octeon/include/bus.h
214
cnt >>= ((n) >> 1); \
sys/arch/octeon/include/bus.h
216
CAT(bus_space_write_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/octeon/include/bus.h
217
ba += (n); \
sys/arch/octeon/include/bus.h
218
x += (n); \
sys/arch/octeon/include/bus.h
227
#define bus_space_set_region(n,m) \
sys/arch/octeon/include/bus.h
229
CAT(bus_space_set_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/octeon/include/bus.h
233
CAT(bus_space_write_,n)(bst, bsh, ba, x); \
sys/arch/octeon/include/bus.h
234
ba += (n); \
sys/arch/octeon/include/bus.h
400
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/octeon/include/bus.h
401
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/octeon/include/bus.h
410
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/octeon/include/bus.h
411
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/octeon/include/bus.h
418
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/octeon/include/bus.h
419
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/octeon/include/bus.h
420
#define bus_dmamem_free(t, sg, n) \
sys/arch/octeon/include/bus.h
421
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/octeon/include/bus.h
422
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/octeon/include/bus.h
423
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/octeon/include/bus.h
426
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/octeon/include/bus.h
427
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/octeon/include/conf.h
39
#define cdev_octboot_init(c,n) { \
sys/arch/octeon/include/conf.h
40
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/octeon/include/conf.h
41
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/octeon/include/conf.h
46
#define cdev_openprom_init(c,n) { \
sys/arch/octeon/include/conf.h
47
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/octeon/include/conf.h
48
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/octeon/include/octeonvar.h
118
#define OCTEON_CVMSEG_ETHER_OFFSET(n, entry) \
sys/arch/octeon/include/octeonvar.h
120
sizeof(struct octeon_cvmseg_ether_map) * (n) + \
sys/arch/octeon/octeon/machdep.c
165
int n, neg;
sys/arch/octeon/octeon/machdep.c
167
n = 0;
sys/arch/octeon/octeon/machdep.c
179
n = (10 * n) + (*s - '0');
sys/arch/octeon/octeon/machdep.c
183
return (neg ? -n : n);
sys/arch/octeon/stand/rdboot/cmd.c
251
readline(char *buf, size_t n, int to)
sys/arch/octeon/stand/rdboot/cmd.c
294
if (fgets(buf, n, stdin) == NULL)
sys/arch/octeon/stand/rdboot/rdboot.c
175
ssize_t n;
sys/arch/octeon/stand/rdboot/rdboot.c
206
n = read(fd, kimg + pos, sb.st_size - pos);
sys/arch/octeon/stand/rdboot/rdboot.c
207
if (n == -1)
sys/arch/octeon/stand/rdboot/rdboot.c
209
pos += n;
sys/arch/powerpc/include/atomic.h
107
: "r" (p), "r" (n), "r" (o)
sys/arch/powerpc/include/atomic.h
54
_atomic_cas_uint(volatile unsigned int *p, unsigned int o, unsigned int n)
sys/arch/powerpc/include/atomic.h
66
: "r" (p), "r" (n), "r" (o)
sys/arch/powerpc/include/atomic.h
74
_atomic_cas_ulong(volatile unsigned long *p, unsigned long o, unsigned long n)
sys/arch/powerpc/include/atomic.h
86
: "r" (p), "r" (n), "r" (o)
sys/arch/powerpc/include/atomic.h
94
_atomic_cas_ptr(volatile void *pp, void *o, void *n)
sys/arch/powerpc/include/cpu.h
183
#define DELAY(n) delay(n)
sys/arch/powerpc/include/cpu.h
261
#define FUNC_SPR(n, name) \
sys/arch/powerpc/include/cpu.h
265
__asm volatile ("mfspr %0," # n : "=r" (ret)); \
sys/arch/powerpc/include/cpu.h
270
__asm volatile ("mtspr "# n ",%0" :: "r" (val)); \
sys/arch/powerpc/powerpc/in_cksum.c
135
n = mlen >> 6;
sys/arch/powerpc/powerpc/in_cksum.c
176
: "r"(n), "b"(w - 4)
sys/arch/powerpc/powerpc/in_cksum.c
179
w += n * 64;
sys/arch/powerpc/powerpc/in_cksum.c
180
mlen -= n * 64;
sys/arch/powerpc/powerpc/in_cksum.c
184
n = mlen >> 3;
sys/arch/powerpc/powerpc/in_cksum.c
197
: "r"(n), "b"(w - 4)
sys/arch/powerpc/powerpc/in_cksum.c
199
w += n * 8;
sys/arch/powerpc/powerpc/in_cksum.c
200
mlen -= n * 8;
sys/arch/powerpc/powerpc/in_cksum.c
67
int n;
sys/arch/powerpc64/include/atomic.h
107
: "r" (p), "r" (n), "r" (o)
sys/arch/powerpc64/include/atomic.h
54
_atomic_cas_uint(volatile unsigned int *p, unsigned int o, unsigned int n)
sys/arch/powerpc64/include/atomic.h
66
: "r" (p), "r" (n), "r" (o)
sys/arch/powerpc64/include/atomic.h
74
_atomic_cas_ulong(volatile unsigned long *p, unsigned long o, unsigned long n)
sys/arch/powerpc64/include/atomic.h
86
: "r" (p), "r" (n), "r" (o)
sys/arch/powerpc64/include/atomic.h
94
_atomic_cas_ptr(volatile void *pp, void *o, void *n)
sys/arch/powerpc64/include/bus.h
137
#define bus_space_read_multi(n,m) \
sys/arch/powerpc64/include/bus.h
139
CAT(bus_space_read_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/powerpc64/include/bus.h
143
*x++ = CAT(bus_space_read_,n)(bst, bsh, o); \
sys/arch/powerpc64/include/bus.h
152
#define bus_space_read_region(n,m) \
sys/arch/powerpc64/include/bus.h
154
CAT(bus_space_read_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/powerpc64/include/bus.h
158
*x++ = CAT(bus_space_read_,n)(bst, bsh, ba); \
sys/arch/powerpc64/include/bus.h
159
ba += (n); \
sys/arch/powerpc64/include/bus.h
169
#define bus_space_read_raw_region(n,m) \
sys/arch/powerpc64/include/bus.h
171
CAT(bus_space_read_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/powerpc64/include/bus.h
175
cnt >>= ((n) >> 1); \
sys/arch/powerpc64/include/bus.h
177
CAT(bus_space_read_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/powerpc64/include/bus.h
178
ba += (n); \
sys/arch/powerpc64/include/bus.h
179
x += (n); \
sys/arch/powerpc64/include/bus.h
188
#define bus_space_write_multi(n,m) \
sys/arch/powerpc64/include/bus.h
190
CAT(bus_space_write_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/powerpc64/include/bus.h
194
CAT(bus_space_write_,n)(bst, bsh, o, *x++); \
sys/arch/powerpc64/include/bus.h
203
#define bus_space_write_region(n,m) \
sys/arch/powerpc64/include/bus.h
205
CAT(bus_space_write_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/powerpc64/include/bus.h
209
CAT(bus_space_write_,n)(bst, bsh, ba, *x++); \
sys/arch/powerpc64/include/bus.h
210
ba += (n); \
sys/arch/powerpc64/include/bus.h
220
#define bus_space_write_raw_region(n,m) \
sys/arch/powerpc64/include/bus.h
222
CAT(bus_space_write_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/powerpc64/include/bus.h
226
cnt >>= ((n) >> 1); \
sys/arch/powerpc64/include/bus.h
228
CAT(bus_space_write_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/powerpc64/include/bus.h
229
ba += (n); \
sys/arch/powerpc64/include/bus.h
230
x += (n); \
sys/arch/powerpc64/include/bus.h
239
#define bus_space_set_region(n,m) \
sys/arch/powerpc64/include/bus.h
241
CAT(bus_space_set_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/powerpc64/include/bus.h
245
CAT(bus_space_write_,n)(bst, bsh, ba, x); \
sys/arch/powerpc64/include/bus.h
246
ba += (n); \
sys/arch/powerpc64/include/bus.h
411
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/powerpc64/include/bus.h
412
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/powerpc64/include/bus.h
421
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/powerpc64/include/bus.h
422
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/powerpc64/include/bus.h
429
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/powerpc64/include/bus.h
430
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/powerpc64/include/bus.h
431
#define bus_dmamem_free(t, sg, n) \
sys/arch/powerpc64/include/bus.h
432
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/powerpc64/include/bus.h
433
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/powerpc64/include/bus.h
434
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/powerpc64/include/bus.h
437
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/powerpc64/include/bus.h
438
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/powerpc64/include/conf.h
10
#define cdev_kexec_init(c,n) { \
sys/arch/powerpc64/include/conf.h
11
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/powerpc64/include/conf.h
12
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/powerpc64/include/conf.h
17
#define cdev_openprom_init(c,n) { \
sys/arch/powerpc64/include/conf.h
18
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/powerpc64/include/conf.h
19
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/powerpc64/powerpc64/fpu.c
36
#define STXVVSR(n) \
sys/arch/powerpc64/powerpc64/fpu.c
37
__asm volatile ("stxvd2x %%vs" #n ", 0, %0" :: "b"(&fp->fp_vsx[(n)]));
sys/arch/powerpc64/powerpc64/fpu.c
84
#define LXVVSR(n) \
sys/arch/powerpc64/powerpc64/fpu.c
85
__asm volatile ("lxvd2x %%vs" #n ", 0, %0" :: "b"(&fp->fp_vsx[(n)]));
sys/arch/powerpc64/powerpc64/machdep.c
115
int n, neg;
sys/arch/powerpc64/powerpc64/machdep.c
117
n = 0;
sys/arch/powerpc64/powerpc64/machdep.c
129
n = (10 * n) + (*s - '0');
sys/arch/powerpc64/powerpc64/machdep.c
133
return (neg ? -n : n);
sys/arch/powerpc64/stand/rdboot/cmd.c
249
readline(char *buf, size_t n, int to)
sys/arch/powerpc64/stand/rdboot/cmd.c
292
if (fgets(buf, n, stdin) == NULL)
sys/arch/powerpc64/stand/rdboot/rdboot.c
171
ssize_t n;
sys/arch/powerpc64/stand/rdboot/rdboot.c
202
n = read(fd, kimg + pos, sb.st_size - pos);
sys/arch/powerpc64/stand/rdboot/rdboot.c
203
if (n == -1)
sys/arch/powerpc64/stand/rdboot/rdboot.c
205
pos += n;
sys/arch/riscv64/dev/plic.c
61
#define PLIC_PRIORITY(n) (PLIC_PRIORITY_BASE + (n) * sizeof(uint32_t))
sys/arch/riscv64/dev/plic.c
62
#define PLIC_ENABLE(sc, n, h) \
sys/arch/riscv64/dev/plic.c
63
(sc->sc_contexts[h].enable_offset + ((n) / 32) * sizeof(uint32_t))
sys/arch/riscv64/dev/stfpcie.c
71
#define ATR_AXI4_SLV0_SRCADDR_PARAM(n) (0x800 + (n) * 0x20)
sys/arch/riscv64/dev/stfpcie.c
74
#define ATR_AXI4_SLV0_SRC_ADDR(n) (0x804 + (n) * 0x20)
sys/arch/riscv64/dev/stfpcie.c
75
#define ATR_AXI4_SLV0_TRSL_ADDR_LSB(n) (0x808 + (n) * 0x20)
sys/arch/riscv64/dev/stfpcie.c
76
#define ATR_AXI4_SLV0_TRSL_ADDR_UDW(n) (0x80c + (n) * 0x20)
sys/arch/riscv64/dev/stfpcie.c
77
#define ATR_AXI4_SLV0_TRSL_PARAM(n) (0x810 + (n) * 0x20)
sys/arch/riscv64/include/bus.h
144
#define bus_space_read_multi(n,m) \
sys/arch/riscv64/include/bus.h
146
CAT(bus_space_read_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/riscv64/include/bus.h
150
*x++ = CAT(bus_space_read_,n)(bst, bsh, o); \
sys/arch/riscv64/include/bus.h
159
#define bus_space_read_region(n,m) \
sys/arch/riscv64/include/bus.h
161
CAT(bus_space_read_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/riscv64/include/bus.h
165
*x++ = CAT(bus_space_read_,n)(bst, bsh, ba); \
sys/arch/riscv64/include/bus.h
166
ba += (n); \
sys/arch/riscv64/include/bus.h
176
#define bus_space_read_raw_region(n,m) \
sys/arch/riscv64/include/bus.h
178
CAT(bus_space_read_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/riscv64/include/bus.h
182
cnt >>= ((n) >> 1); \
sys/arch/riscv64/include/bus.h
184
CAT(bus_space_read_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/riscv64/include/bus.h
185
ba += (n); \
sys/arch/riscv64/include/bus.h
186
x += (n); \
sys/arch/riscv64/include/bus.h
195
#define bus_space_write_multi(n,m) \
sys/arch/riscv64/include/bus.h
197
CAT(bus_space_write_multi_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/riscv64/include/bus.h
201
CAT(bus_space_write_,n)(bst, bsh, o, *x++); \
sys/arch/riscv64/include/bus.h
210
#define bus_space_write_region(n,m) \
sys/arch/riscv64/include/bus.h
212
CAT(bus_space_write_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/riscv64/include/bus.h
216
CAT(bus_space_write_,n)(bst, bsh, ba, *x++); \
sys/arch/riscv64/include/bus.h
217
ba += (n); \
sys/arch/riscv64/include/bus.h
227
#define bus_space_write_raw_region(n,m) \
sys/arch/riscv64/include/bus.h
229
CAT(bus_space_write_raw_region_,n)(bus_space_tag_t bst, \
sys/arch/riscv64/include/bus.h
233
cnt >>= ((n) >> 1); \
sys/arch/riscv64/include/bus.h
235
CAT(bus_space_write_raw_multi_,n)(bst, bsh, ba, x, (n)); \
sys/arch/riscv64/include/bus.h
236
ba += (n); \
sys/arch/riscv64/include/bus.h
237
x += (n); \
sys/arch/riscv64/include/bus.h
246
#define bus_space_set_region(n,m) \
sys/arch/riscv64/include/bus.h
248
CAT(bus_space_set_region_,n)(bus_space_tag_t bst, bus_space_handle_t bsh, \
sys/arch/riscv64/include/bus.h
252
CAT(bus_space_write_,n)(bst, bsh, ba, x); \
sys/arch/riscv64/include/bus.h
253
ba += (n); \
sys/arch/riscv64/include/bus.h
430
#define bus_dmamap_create(t, s, n, m, b, f, p) \
sys/arch/riscv64/include/bus.h
431
(*(t)->_dmamap_create)((t), (s), (n), (m), (b), (f), (p))
sys/arch/riscv64/include/bus.h
440
#define bus_dmamap_load_raw(t, m, sg, n, s, f) \
sys/arch/riscv64/include/bus.h
441
(*(t)->_dmamap_load_raw)((t), (m), (sg), (n), (s), (f))
sys/arch/riscv64/include/bus.h
448
#define bus_dmamem_alloc(t, s, a, b, sg, n, r, f) \
sys/arch/riscv64/include/bus.h
449
(*(t)->_dmamem_alloc)((t), (s), (a), (b), (sg), (n), (r), (f))
sys/arch/riscv64/include/bus.h
450
#define bus_dmamem_alloc_range(t, s, a, b, sg, n, r, f, l, h) \
sys/arch/riscv64/include/bus.h
452
(n), (r), (f), (l), (h))
sys/arch/riscv64/include/bus.h
453
#define bus_dmamem_free(t, sg, n) \
sys/arch/riscv64/include/bus.h
454
(*(t)->_dmamem_free)((t), (sg), (n))
sys/arch/riscv64/include/bus.h
455
#define bus_dmamem_map(t, sg, n, s, k, f) \
sys/arch/riscv64/include/bus.h
456
(*(t)->_dmamem_map)((t), (sg), (n), (s), (k), (f))
sys/arch/riscv64/include/bus.h
459
#define bus_dmamem_mmap(t, sg, n, o, p, f) \
sys/arch/riscv64/include/bus.h
460
(*(t)->_dmamem_mmap)((t), (sg), (n), (o), (p), (f))
sys/arch/riscv64/include/conf.h
42
#define cdev_openprom_init(c,n) { \
sys/arch/riscv64/include/conf.h
43
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/riscv64/include/conf.h
44
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/riscv64/include/cpufunc.h
47
#define rdhpmcounter(n) csr_read(hpmcounter##n)
sys/arch/riscv64/riscv64/machdep.c
111
int n, neg;
sys/arch/riscv64/riscv64/machdep.c
113
n = 0;
sys/arch/riscv64/riscv64/machdep.c
125
n = (10 * n) + (*s - '0');
sys/arch/riscv64/riscv64/machdep.c
129
return (neg ? -n : n);
sys/arch/riscv64/riscv64/trap.c
43
int n;
sys/arch/riscv64/riscv64/trap.c
46
n = (sizeof(frame->tf_t) / sizeof(frame->tf_t[0]));
sys/arch/riscv64/riscv64/trap.c
47
for (i = 0; i < n; i++)
sys/arch/riscv64/riscv64/trap.c
50
n = (sizeof(frame->tf_s) / sizeof(frame->tf_s[0]));
sys/arch/riscv64/riscv64/trap.c
51
for (i = 0; i < n; i++)
sys/arch/riscv64/riscv64/trap.c
54
n = (sizeof(frame->tf_a) / sizeof(frame->tf_a[0]));
sys/arch/riscv64/riscv64/trap.c
55
for (i = 0; i < n; i++)
sys/arch/riscv64/stand/efiboot/efiboot.c
916
int n;
sys/arch/riscv64/stand/efiboot/efiboot.c
928
n = siz / mmsiz;
sys/arch/riscv64/stand/efiboot/efiboot.c
931
mmap_ndesc = n;
sys/arch/sh/dev/scif.c
1283
int n;
sys/arch/sh/dev/scif.c
1287
n = sc->sc_tbc;
sys/arch/sh/dev/scif.c
1290
if (n > maxchars)
sys/arch/sh/dev/scif.c
1291
n = maxchars;
sys/arch/sh/dev/scif.c
1293
for (i = 0; i < n; i++) {
sys/arch/sh/dev/scif.c
1297
sc->sc_tbc -= n;
sys/arch/sh/dev/scif.c
224
#define divrnd(n, q) (((n)*2/(q)+1)/2) /* divide and round off */
sys/arch/sh/dev/scif.c
508
int n;
sys/arch/sh/dev/scif.c
512
n = sc->sc_tbc;
sys/arch/sh/dev/scif.c
515
if (n > maxchars)
sys/arch/sh/dev/scif.c
516
n = maxchars;
sys/arch/sh/dev/scif.c
518
for (i = 0; i < n; i++) {
sys/arch/sh/dev/scif.c
522
sc->sc_tbc -= n;
sys/arch/sh/include/atomic.h
101
*uip = n;
sys/arch/sh/include/atomic.h
109
_atomic_swap_ptr(volatile void *uip, void *n)
sys/arch/sh/include/atomic.h
117
*uipp = n;
sys/arch/sh/include/atomic.h
30
_atomic_cas_uint(volatile unsigned int *uip, unsigned int o, unsigned int n)
sys/arch/sh/include/atomic.h
38
*uip = n;
sys/arch/sh/include/atomic.h
46
_atomic_cas_ulong(volatile unsigned long *uip, unsigned long o, unsigned long n)
sys/arch/sh/include/atomic.h
54
*uip = n;
sys/arch/sh/include/atomic.h
62
_atomic_cas_ptr(volatile void *uip, void *o, void *n)
sys/arch/sh/include/atomic.h
71
*uipp = n;
sys/arch/sh/include/atomic.h
79
_atomic_swap_uint(volatile unsigned int *uip, unsigned int n)
sys/arch/sh/include/atomic.h
86
*uip = n;
sys/arch/sh/include/atomic.h
94
_atomic_swap_ulong(volatile unsigned long *uip, unsigned long n)
sys/arch/sh/sh/cache_sh3.c
136
cache_sh3_op_line_16_nway(int n, vaddr_t va, uint32_t bits)
sys/arch/sh/sh/cache_sh3.c
145
for (way = 0; way < n; way++) {
sys/arch/sh/sh/cache_sh3.c
158
cache_sh3_op_8lines_16_nway(int n, vaddr_t va, uint32_t bits)
sys/arch/sh/sh/cache_sh3.c
167
for (way = 0; way < n; way++) {
sys/arch/sh/sh/clock.c
218
delay(int n)
sys/arch/sh/sh/clock.c
220
_cpu_spin(sh_clock.cpucycle_1us * n);
sys/arch/sh/sh/db_trace.c
219
int8_t n = inst & 0xff;
sys/arch/sh/sh/db_trace.c
221
if (n >= 0) {
sys/arch/sh/sh/db_trace.c
226
depth += -n/4;
sys/arch/sh/sh/pmap.c
1054
int i, j, k, n, map, asid;
sys/arch/sh/sh/pmap.c
1058
n = i + 8;
sys/arch/sh/sh/pmap.c
1059
for (; i < n; i++) {
sys/arch/sh/sh/pmap.c
165
int i, n;
sys/arch/sh/sh/pmap.c
172
n = __PMAP_PTP_INDEX(__pmap_kve - VM_MIN_KERNEL_ADDRESS);
sys/arch/sh/sh/pmap.c
175
for (;i < n; i++) {
sys/arch/sparc64/dev/beep.c
163
int i, n, selected = -1;
sys/arch/sparc64/dev/beep.c
165
n = sizeof(sc->sc_freqs)/sizeof(sc->sc_freqs[0]);
sys/arch/sparc64/dev/beep.c
169
if (freq > sc->sc_freqs[n - 1].freq)
sys/arch/sparc64/dev/beep.c
170
selected = n - 1;
sys/arch/sparc64/dev/beep.c
172
for (i = 1; selected == -1 && i < n; i++) {
sys/arch/sparc64/dev/ce4231.c
1246
vaddr_t n;
sys/arch/sparc64/dev/ce4231.c
1259
n = (char *)end - (char *)start;
sys/arch/sparc64/dev/ce4231.c
1267
chdma->segsz = n;
sys/arch/sparc64/dev/ce4231.c
1269
if (n > chdma->blksz)
sys/arch/sparc64/dev/ce4231.c
1270
n = chdma->blksz;
sys/arch/sparc64/dev/ce4231.c
1272
chdma->count = n;
sys/arch/sparc64/dev/ce4231.c
1276
P_WRITE(sc, EBDMA_DCNT, (u_long)n);
sys/arch/sparc64/dev/ce4231.c
1283
P_WRITE(sc, EBDMA_DCNT, (u_long)n);
sys/arch/sparc64/dev/ce4231.c
1295
chdma->lastaddr = p->dmamap->dm_segs[0].ds_addr + n;
sys/arch/sparc64/dev/ce4231.c
1308
vaddr_t n;
sys/arch/sparc64/dev/ce4231.c
1321
n = (char *)end - (char *)start;
sys/arch/sparc64/dev/ce4231.c
1329
chdma->segsz = n;
sys/arch/sparc64/dev/ce4231.c
1331
if (n > chdma->blksz)
sys/arch/sparc64/dev/ce4231.c
1332
n = chdma->blksz;
sys/arch/sparc64/dev/ce4231.c
1334
chdma->count = n;
sys/arch/sparc64/dev/ce4231.c
1338
C_WRITE(sc, EBDMA_DCNT, (u_long)n);
sys/arch/sparc64/dev/ce4231.c
1345
C_WRITE(sc, EBDMA_DCNT, (u_long)n);
sys/arch/sparc64/dev/ce4231.c
1357
chdma->lastaddr = p->dmamap->dm_segs[0].ds_addr + n;
sys/arch/sparc64/dev/ce4231.c
350
int i, n, selected = -1;
sys/arch/sparc64/dev/ce4231.c
352
n = sizeof(speed_table) / sizeof(speed_struct);
sys/arch/sparc64/dev/ce4231.c
356
if (arg > speed_table[n - 1].speed)
sys/arch/sparc64/dev/ce4231.c
357
selected = n - 1;
sys/arch/sparc64/dev/ce4231.c
359
for (i = 1; selected == -1 && i < n; i++) {
sys/arch/sparc64/dev/creator.c
533
creator_ras_fifo_wait(struct creator_softc *sc, int n)
sys/arch/sparc64/dev/creator.c
537
if (cache < n) {
sys/arch/sparc64/dev/creator.c
541
} while (cache < n);
sys/arch/sparc64/dev/creator.c
543
sc->sc_fifo_cache = cache - n;
sys/arch/sparc64/dev/creator.c
581
creator_ras_eraserows(void *cookie, int row, int n, uint32_t attr)
sys/arch/sparc64/dev/creator.c
588
n += row;
sys/arch/sparc64/dev/creator.c
591
if (row + n > ri->ri_rows)
sys/arch/sparc64/dev/creator.c
592
n = ri->ri_rows - row;
sys/arch/sparc64/dev/creator.c
593
if (n <= 0)
sys/arch/sparc64/dev/creator.c
600
if ((n == ri->ri_rows) && (ri->ri_flg & RI_FULLCLEAR)) {
sys/arch/sparc64/dev/creator.c
609
FBC_WRITE(sc, FFB_FBC_BH, n * ri->ri_font->fontheight);
sys/arch/sparc64/dev/creator.c
618
creator_ras_erasecols(void *cookie, int row, int col, int n, uint32_t attr)
sys/arch/sparc64/dev/creator.c
627
n += col;
sys/arch/sparc64/dev/creator.c
630
if (col + n > ri->ri_cols)
sys/arch/sparc64/dev/creator.c
631
n = ri->ri_cols - col;
sys/arch/sparc64/dev/creator.c
632
if (n <= 0)
sys/arch/sparc64/dev/creator.c
634
n *= ri->ri_font->fontwidth;
sys/arch/sparc64/dev/creator.c
645
FBC_WRITE(sc, FFB_FBC_BW, n - 1);
sys/arch/sparc64/dev/creator.c
661
creator_ras_copyrows(void *cookie, int src, int dst, int n)
sys/arch/sparc64/dev/creator.c
669
n += src;
sys/arch/sparc64/dev/creator.c
672
if ((src + n) > ri->ri_rows)
sys/arch/sparc64/dev/creator.c
673
n = ri->ri_rows - src;
sys/arch/sparc64/dev/creator.c
675
n += dst;
sys/arch/sparc64/dev/creator.c
678
if ((dst + n) > ri->ri_rows)
sys/arch/sparc64/dev/creator.c
679
n = ri->ri_rows - dst;
sys/arch/sparc64/dev/creator.c
680
if (n <= 0)
sys/arch/sparc64/dev/creator.c
682
n *= ri->ri_font->fontheight;
sys/arch/sparc64/dev/creator.c
693
FBC_WRITE(sc, FFB_FBC_BH, n);
sys/arch/sparc64/dev/ebus.c
228
int n, rv;
sys/arch/sparc64/dev/ebus.c
231
rv = getprop(node, "name", 1, &n, (void **)&ea->ea_name);
sys/arch/sparc64/dev/ebus.c
234
ea->ea_name[n] = '\0';
sys/arch/sparc64/dev/fd.c
1037
int n;
sys/arch/sparc64/dev/fd.c
1040
n = fdc->sc_nstat;
sys/arch/sparc64/dev/fd.c
1043
if (n == 0) {
sys/arch/sparc64/dev/fd.c
1046
n = 2;
sys/arch/sparc64/dev/fd.c
1053
switch (n) {
sys/arch/sparc64/dev/fd.c
1071
printf(" fdcstatus: weird size: %d\n", n);
sys/arch/sparc64/dev/fd.c
561
int n, ok;
sys/arch/sparc64/dev/fd.c
578
for (n = 0; n < 10000; n++) {
sys/arch/sparc64/dev/fd.c
598
n = fdc->sc_nstat;
sys/arch/sparc64/dev/fd.c
602
printf("fdprobe: %d stati:", n);
sys/arch/sparc64/dev/fd.c
603
for (i = 0; i < n; i++)
sys/arch/sparc64/dev/fd.c
608
ok = (n == 2 && (fdc->sc_status[0] & 0xf8) == 0x20) ? 1 : 0;
sys/arch/sparc64/dev/fd.c
828
int n;
sys/arch/sparc64/dev/fd.c
834
for (n = 0; n < 4; n++)
sys/arch/sparc64/dev/fd.c
835
if ((fd = fdc->sc_fd[n]) && (fd->sc_flags & FD_MOTOR))
sys/arch/sparc64/dev/fd.c
836
status |= FDO_MOEN(n);
sys/arch/sparc64/dev/fd.c
877
int j, n = 0;
sys/arch/sparc64/dev/fd.c
883
return (fdc->sc_nstat = n);
sys/arch/sparc64/dev/fd.c
885
if (n >= sizeof(fdc->sc_status)) {
sys/arch/sparc64/dev/fd.c
889
fdc->sc_status[n++] =
sys/arch/sparc64/dev/fdreg.h
68
#define FDO_MOEN(n) ((1 << n) << 4) /* motor enable */
sys/arch/sparc64/dev/gfxp.c
577
gfxp_wait_fifo(struct gfxp_softc *sc, int n)
sys/arch/sparc64/dev/gfxp.c
583
PM2_IN_FIFO_SPACE) >= n)
sys/arch/sparc64/dev/iommu.c
1671
iommu_iomap_create(int n)
sys/arch/sparc64/dev/iommu.c
1678
n += 4;
sys/arch/sparc64/dev/iommu.c
1679
if (n < 16)
sys/arch/sparc64/dev/iommu.c
1680
n = 16;
sys/arch/sparc64/dev/iommu.c
1682
ims = malloc(sizeof(*ims) + (n - 1) * sizeof(ims->ims_map.ipm_map[0]),
sys/arch/sparc64/dev/iommu.c
1688
ims->ims_map.ipm_maxpage = n;
sys/arch/sparc64/dev/pcons.c
398
#define ENCODE_STATE(c, n) (short)(((c)&0x1ff)|(((n)&0x7f)<<9))
sys/arch/sparc64/dev/pcons.c
419
unsigned int i, c, n;
sys/arch/sparc64/dev/pcons.c
424
n = *magic ? i+1 : CNS_TERM;
sys/arch/sparc64/dev/pcons.c
443
n = *magic ? i+1 : CNS_TERM;
sys/arch/sparc64/dev/pcons.c
461
printf("mag %d %x:%x\n", i, c, n);
sys/arch/sparc64/dev/pcons.c
463
m[i] = ENCODE_STATE(c, n);
sys/arch/sparc64/dev/psycho.c
250
int psycho_br[2], n;
sys/arch/sparc64/dev/psycho.c
337
for (n = 0; n < psycho_cd.cd_ndevs; n++) {
sys/arch/sparc64/dev/psycho.c
339
(struct psycho_softc *)psycho_cd.cd_devs[n];
sys/arch/sparc64/dev/psycho.c
724
int n, error;
sys/arch/sparc64/dev/psycho.c
726
error = getprop(node, "bus-range", sizeof(*brp), &n, (void **)&brp);
sys/arch/sparc64/dev/psycho.c
729
if (n != 2)
sys/arch/sparc64/dev/radeonfb.c
543
radeonfb_wait_fifo(struct radeonfb_softc *sc, int n)
sys/arch/sparc64/dev/radeonfb.c
549
RADEON_RBBM_STATUS) & RADEON_RBBM_FIFOCNT_MASK) >= n)
sys/arch/sparc64/dev/sab.c
1158
r = sabtty_baudtable[i].n |
sys/arch/sparc64/dev/sab.c
181
int n, m;
sys/arch/sparc64/dev/sbus.c
440
int n;
sys/arch/sparc64/dev/sbus.c
443
error = getprop(node, "name", 1, &n, (void **)&sa->sa_name);
sys/arch/sparc64/dev/sbus.c
446
sa->sa_name[n] = '\0';
sys/arch/sparc64/dev/sbus.c
463
for (n = 0; n < sa->sa_nreg; n++) {
sys/arch/sparc64/dev/sbus.c
465
u_int32_t base = sa->sa_reg[n].sbr_offset;
sys/arch/sparc64/dev/sbus.c
467
sa->sa_reg[n].sbr_slot = SBUS_ABS_TO_SLOT(base);
sys/arch/sparc64/dev/sbus.c
468
sa->sa_reg[n].sbr_offset = SBUS_ABS_TO_OFFSET(base);
sys/arch/sparc64/dev/sbus.c
580
int n, i;
sys/arch/sparc64/dev/sbus.c
623
for (n = 0; n < *np; n++) {
sys/arch/sparc64/dev/sbus.c
632
ip[n].sbi_pri = pri | ipl[n];
sys/arch/sparc64/dev/sbus.c
633
ip[n].sbi_vec = ipl[n];
sys/arch/sparc64/dev/viommu.c
928
viommu_iomap_create(int n)
sys/arch/sparc64/dev/viommu.c
933
n += 4;
sys/arch/sparc64/dev/viommu.c
934
if (n < 16)
sys/arch/sparc64/dev/viommu.c
935
n = 16;
sys/arch/sparc64/dev/viommu.c
937
ims = malloc(sizeof(*ims) + (n - 1) * sizeof(ims->ims_map.ipm_map[0]),
sys/arch/sparc64/dev/viommu.c
943
ims->ims_map.ipm_maxpage = n;
sys/arch/sparc64/include/atomic.h
22
_atomic_cas_uint(volatile unsigned int *p, unsigned int e, unsigned int n)
sys/arch/sparc64/include/atomic.h
25
: "+r" (n), "=m" (*p)
sys/arch/sparc64/include/atomic.h
28
return (n);
sys/arch/sparc64/include/atomic.h
33
_atomic_cas_ulong(volatile unsigned long *p, unsigned long e, unsigned long n)
sys/arch/sparc64/include/atomic.h
36
: "+r" (n), "=m" (*p)
sys/arch/sparc64/include/atomic.h
39
return (n);
sys/arch/sparc64/include/atomic.h
44
_atomic_cas_ptr(volatile void *p, void *e, void *n)
sys/arch/sparc64/include/atomic.h
47
: "+r" (n), "=m" (*(volatile unsigned long *)p)
sys/arch/sparc64/include/atomic.h
50
return (n);
sys/arch/sparc64/include/bus.h
104
#define BUS_SPACE_ASSERT(t, h, o, n) do { \
sys/arch/sparc64/include/bus.h
106
bus_space_assert(t, &(h), o, n); \
sys/arch/sparc64/include/bus.h
116
#define BUS_SPACE_ASSERT(t, h, o, n)
sys/arch/sparc64/include/bus.h
484
bus_dmamap_create(bus_dma_tag_t t, bus_size_t s, int n, bus_size_t m,
sys/arch/sparc64/include/bus.h
490
r = _BD_CALL(t, _dmamap_create)(t, t0, s, n, m, b, f, p);
sys/arch/sparc64/include/bus.h
536
int n, bus_size_t s, int f)
sys/arch/sparc64/include/bus.h
541
r = _BD_CALL(t, _dmamap_load_raw)(t, t0, m, sg, n, s, f);
sys/arch/sparc64/include/bus.h
564
bus_dma_segment_t *sg, int n, int *r, int f)
sys/arch/sparc64/include/bus.h
569
ret = _BD_CALL(t, _dmamem_alloc)(t, t0, s, a, b, sg, n, r, f);
sys/arch/sparc64/include/bus.h
574
bus_dmamem_free(bus_dma_tag_t t, bus_dma_segment_t *sg, int n)
sys/arch/sparc64/include/bus.h
578
_BD_CALL(t, _dmamem_free)(t, t0, sg, n);
sys/arch/sparc64/include/bus.h
582
bus_dmamem_map(bus_dma_tag_t t, bus_dma_segment_t *sg, int n, size_t s,
sys/arch/sparc64/include/bus.h
588
r = _BD_CALL(t, _dmamem_map)(t, t0, sg, n, s, k, f);
sys/arch/sparc64/include/bus.h
601
bus_dmamem_mmap(bus_dma_tag_t t, bus_dma_segment_t *sg, int n, off_t o, int p,
sys/arch/sparc64/include/bus.h
607
r = _BD_CALL(t, _dmamem_mmap)(t, t0, sg, n, o, p, f);
sys/arch/sparc64/include/conf.h
100
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) nullop, \
sys/arch/sparc64/include/conf.h
40
#define cdev_openprom_init(c,n) { \
sys/arch/sparc64/include/conf.h
41
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/arch/sparc64/include/conf.h
42
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/sparc64/include/conf.h
49
#define cdev_uperf_init(c,n) { \
sys/arch/sparc64/include/conf.h
50
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/sparc64/include/conf.h
51
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/sparc64/include/conf.h
58
#define cdev_vdsp_init(c,n) { \
sys/arch/sparc64/include/conf.h
59
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/sparc64/include/conf.h
60
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/arch/sparc64/include/conf.h
64
#define cdev_gen_init(c,n) { \
sys/arch/sparc64/include/conf.h
65
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/arch/sparc64/include/conf.h
66
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) nullop, \
sys/arch/sparc64/include/conf.h
68
0, 0, dev_init(c,n,kqfilter) }
sys/arch/sparc64/include/conf.h
98
#define cdev_bpp_init(c,n) { \
sys/arch/sparc64/include/conf.h
99
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/arch/sparc64/include/db_machdep.h
90
vaddr_t n = (regs)->ddb_tf.tf_npc; \
sys/arch/sparc64/include/db_machdep.h
91
(regs)->ddb_tf.tf_pc = n; \
sys/arch/sparc64/include/db_machdep.h
92
(regs)->ddb_tf.tf_npc = n + 4; \
sys/arch/sparc64/include/param.h
147
#define DELAY(n) delay(n)
sys/arch/sparc64/include/pci_machdep.h
73
#define PCITAG_CREATE(n,b,d,f) (((u_int64_t)(n)<<32)|((b)<<16)|((d)<<11)|((f)<<8))
sys/arch/sparc64/include/pci_machdep.h
74
#define PCITAG_SETNODE(t,n) ((t)&0xffffffff)|(((n)<<32)
sys/arch/sparc64/sparc64/clock.c
422
int node, n;
sys/arch/sparc64/sparc64/clock.c
425
if (getprop(node, "idprom", sizeof(*idp), &n, (void **)&idp) != 0)
sys/arch/sparc64/sparc64/clock.c
427
if (n != 1) {
sys/arch/sparc64/sparc64/clock.c
443
int node, n;
sys/arch/sparc64/sparc64/clock.c
446
if (getprop(node, "idprom", sizeof *idp, &n, (void **)&idp) ||
sys/arch/sparc64/sparc64/clock.c
447
n != 1) {
sys/arch/sparc64/sparc64/db_interface.c
747
long i, j, k, n;
sys/arch/sparc64/sparc64/db_interface.c
750
n = 0;
sys/arch/sparc64/sparc64/machdep.c
1952
int n)
sys/arch/sparc64/sparc64/machdep.c
1971
if (o & (n - 1)) {
sys/arch/sparc64/sparc64/machdep.c
1975
"(%llx) incorrect alignment (%d) ", t, buf, o, n);
sys/arch/sparc64/sparc64/machdep.c
751
u_int64_t i = 0, n;
sys/arch/sparc64/sparc64/machdep.c
763
for (; i < mp->size; i += n) {
sys/arch/sparc64/sparc64/machdep.c
764
n = mp->size - i;
sys/arch/sparc64/sparc64/machdep.c
765
if (n > BYTES_PER_DUMP)
sys/arch/sparc64/sparc64/machdep.c
766
n = BYTES_PER_DUMP;
sys/arch/sparc64/sparc64/machdep.c
775
(caddr_t)dumpspace, (int)n);
sys/arch/sparc64/sparc64/machdep.c
776
pmap_remove(pmap_kernel(), dumpspace, dumpspace + n);
sys/arch/sparc64/sparc64/machdep.c
780
maddr += n;
sys/arch/sparc64/sparc64/machdep.c
781
blkno += btodb(n);
sys/arch/sparc64/sparc64/mem.c
111
int n;
sys/arch/sparc64/sparc64/mem.c
122
n = uio->uio_resid;
sys/arch/sparc64/sparc64/mem.c
180
if (n == uio->uio_resid)
sys/arch/sparc64/sparc64/openfirm.c
313
long *ip, n;
sys/arch/sparc64/sparc64/openfirm.c
323
for (ip = (long *)(args.args_n_results + (n = nargs)); --n >= 0;)
sys/arch/sparc64/sparc64/openfirm.c
333
for (ip = (long *)(args.args_n_results + nargs + (n = args.nreturns)); --n > 0;)
sys/arch/sparc64/sparc64/openfirm.c
351
long *ip, n;
sys/arch/sparc64/sparc64/openfirm.c
361
for (ip = (long *)(args.args_n_results + (n = nargs)); --n >= 0;)
sys/arch/sparc64/sparc64/pmap.c
2030
#define EXPEDITE(p,n) do { \
sys/arch/sparc64/sparc64/pmap.c
2032
int sz = (n); \
sys/arch/sparc64/sparc64/pmap.c
225
#define BDPRINTF(n, f) if (pmapdebug & (n)) prom_printf f
sys/arch/sparc64/sparc64/pmap.c
227
#define BDPRINTF(n, f)
sys/arch/sparc64/sparc64/trap.c
324
int64_t n;
sys/arch/sparc64/sparc64/trap.c
330
#define ADVANCE (n = tf->tf_npc, tf->tf_pc = n, tf->tf_npc = n + 4)
sys/arch/sparc64/stand/ofwboot/ofdev.c
129
int n;
sys/arch/sparc64/stand/ofwboot/ofdev.c
153
n = OF_read(dev->handle, buf, size);
sys/arch/sparc64/stand/ofwboot/ofdev.c
155
n = OF_write(dev->handle, buf, size);
sys/arch/sparc64/stand/ofwboot/ofdev.c
156
if (n == -2)
sys/arch/sparc64/stand/ofwboot/ofdev.c
158
if (n < 0)
sys/arch/sparc64/stand/ofwboot/ofdev.c
161
*rsize = n;
sys/arch/sparc64/stand/ofwboot/ofdev.h
41
#define DNPRINTF(n,x...) do { if (boot_debug & n) printf(x); } while(0)
sys/arch/sparc64/stand/ofwboot/ofdev.h
46
#define DNPRINTF(n,x...)
sys/crypto/aes.c
419
unsigned u, v, n;
sys/crypto/aes.c
421
n = (num_rounds + 1) << 2;
sys/crypto/aes.c
422
for (u = 0, v = 0; u < n; u ++, v += 2) {
sys/crypto/blf.c
52
#define BLFRND(s,p,i,j,n) (i ^= F(s,j) ^ (p)[n])
sys/crypto/cast.c
22
#define ROL(x, n) ( ((x)<<(n)) | ((x)>>(32-(n))) )
sys/crypto/chacha_private.h
24
#define ROTL32(v, n) \
sys/crypto/chacha_private.h
25
(U32V((v) << (n)) | ((v) >> (32 - (n))))
sys/crypto/des_locl.h
138
#define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
sys/crypto/des_locl.h
140
(a)^=((t)<<(n)))
sys/crypto/key_wrap.c
46
aes_key_wrap(aes_key_wrap_ctx *ctx, const u_int8_t *P, size_t n, u_int8_t *C)
sys/crypto/key_wrap.c
53
memmove(C + 8, P, n * 8); /* P and C may overlap */
sys/crypto/key_wrap.c
59
for (i = 1; i <= n; i++, t++) {
sys/crypto/key_wrap.c
79
aes_key_unwrap(aes_key_wrap_ctx *ctx, const u_int8_t *C, u_int8_t *P, size_t n)
sys/crypto/key_wrap.c
87
memmove(P, C + 8, n * 8); /* P and C may overlap */
sys/crypto/key_wrap.c
89
for (j = 5, t = 6 * n; j >= 0; j--) {
sys/crypto/key_wrap.c
90
R = P + (n - 1) * 8;
sys/crypto/key_wrap.c
91
for (i = n; i >= 1; i--, t--) {
sys/crypto/michael.c
30
#define ROL(n, x) (((x) << (n)) | ((x) >> (32 - (n))))
sys/crypto/michael.c
31
#define ROR(n, x) (((x) >> (n)) | ((x) << (32 - (n))))
sys/crypto/rmd160.c
70
#define ROL(n, x) (((x) << (n)) | ((x) >> (32-(n))))
sys/crypto/set_key.c
130
#define HPERM_OP(a, t, n, m) ((t) = ((((a) << (16 - (n)))^(a)) & (m)),\
sys/crypto/set_key.c
131
(a) = (a)^(t)^(t >> (16 - (n))))
sys/crypto/sha2.c
104
#define ADDINC128(w,n) { \
sys/crypto/sha2.c
105
(w)[0] += (u_int64_t)(n); \
sys/crypto/sha2.c
106
if ((w)[0] < (n)) { \
sys/ddb/db_dwarf.c
141
size_t n = end - d->buf + 1;
sys/ddb/db_dwarf.c
143
d->buf += n;
sys/ddb/db_dwarf.c
144
d->len -= n;
sys/ddb/db_dwarf.c
149
read_buf(struct dwbuf *d, struct dwbuf *v, size_t n)
sys/ddb/db_dwarf.c
151
if (d->len < n)
sys/ddb/db_dwarf.c
154
v->len = n;
sys/ddb/db_dwarf.c
155
d->buf += n;
sys/ddb/db_dwarf.c
156
d->len -= n;
sys/ddb/db_dwarf.c
161
skip_bytes(struct dwbuf *d, size_t n)
sys/ddb/db_dwarf.c
163
if (d->len < n)
sys/ddb/db_dwarf.c
165
d->buf += n;
sys/ddb/db_dwarf.c
166
d->len -= n;
sys/ddb/db_dwarf.c
62
read_bytes(struct dwbuf *d, void *v, size_t n)
sys/ddb/db_dwarf.c
64
if (d->len < n)
sys/ddb/db_dwarf.c
66
memcpy(v, d->buf, n);
sys/ddb/db_dwarf.c
67
d->buf += n;
sys/ddb/db_dwarf.c
68
d->len -= n;
sys/ddb/db_examine.c
301
size_t n = siz;
sys/ddb/db_examine.c
304
if (n != 0 && --n != 0) {
sys/ddb/db_examine.c
308
} while (--n != 0);
sys/ddb/db_examine.c
312
if (n == 0) {
sys/ddb/db_hangman.c
183
size_t n;
sys/ddb/db_hangman.c
186
for (n = 0, p = word; *p ; p++)
sys/ddb/db_hangman.c
188
n++;
sys/ddb/db_hangman.c
190
if (n) {
sys/ddb/db_hangman.c
192
len -= n;
sys/ddb/db_input.c
103
db_lc -= n;
sys/ddb/db_input.c
104
db_putnchars(BACKUP, n);
sys/ddb/db_input.c
106
for (p = db_lc; p < db_le-n; p++) {
sys/ddb/db_input.c
107
*p = *(p+n);
sys/ddb/db_input.c
110
db_putnchars(BLANK, n);
sys/ddb/db_input.c
112
db_le -= n;
sys/ddb/db_input.c
98
db_delete(int n, int bwd)
sys/dev/acpi/acpibat.c
354
int n = 0;
sys/dev/acpi/acpibat.c
387
sc->sc_bix.bix_revision = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
389
sc->sc_bix.bix_power_unit = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
390
sc->sc_bix.bix_capacity = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
391
sc->sc_bix.bix_last_capacity = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
392
sc->sc_bix.bix_technology = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
393
sc->sc_bix.bix_voltage = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
394
sc->sc_bix.bix_warning = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
395
sc->sc_bix.bix_low = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
398
sc->sc_bix.bix_cycle_count = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
399
sc->sc_bix.bix_accuracy = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
400
sc->sc_bix.bix_max_sample = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
401
sc->sc_bix.bix_min_sample = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
402
sc->sc_bix.bix_max_avg = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
403
sc->sc_bix.bix_min_avg = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
406
sc->sc_bix.bix_cap_granu1 = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
407
sc->sc_bix.bix_cap_granu2 = aml_val2int(res.v_package[n++]);
sys/dev/acpi/acpibat.c
409
strlcpy(sc->sc_bix.bix_model, aml_val_to_string(res.v_package[n++]),
sys/dev/acpi/acpibat.c
411
strlcpy(sc->sc_bix.bix_serial, aml_val_to_string(res.v_package[n++]),
sys/dev/acpi/acpibat.c
413
strlcpy(sc->sc_bix.bix_type, aml_val_to_string(res.v_package[n++]),
sys/dev/acpi/acpibat.c
415
strlcpy(sc->sc_bix.bix_oem, aml_val_to_string(res.v_package[n++]),
sys/dev/acpi/acpidmar.c
1216
int n;
sys/dev/acpi/acpidmar.c
1231
for (n = 0; n < 1000; n++) {
sys/dev/acpi/acpidmar.c
1253
for (n = 0; n < 1000; n++) {
sys/dev/acpi/acpidmar.c
1368
int n;
sys/dev/acpi/acpidmar.c
1397
for (n = 0; n < 5; n++) {
sys/dev/acpi/acpidmar.c
1436
int n;
sys/dev/acpi/acpidmar.c
1483
for (n = 0; n < 5; n++) {
sys/dev/acpi/acpidmar.c
1530
int i, n;
sys/dev/acpi/acpidmar.c
1599
for (n = 0; ; n++) {
sys/dev/acpi/acpidmar.c
1611
if (n >= 1000) {
sys/dev/acpi/acpidmar.c
1650
for (n = 0; n < 1000; n++) {
sys/dev/acpi/acpidmar.c
1687
for (n = 0; n < 5; n++) {
sys/dev/acpi/acpidmar.c
1712
int n;
sys/dev/acpi/acpidmar.c
1738
for (n = 0; n < 5; n++) {
sys/dev/acpi/acpidmar.c
1754
int n;
sys/dev/acpi/acpidmar.c
1774
for (n = 0; n < 100; n++) {
sys/dev/acpi/acpidmar.c
1797
for (n = 0; n < 100; n++) {
sys/dev/acpi/acpidmar.c
1816
int n = 0;
sys/dev/acpi/acpidmar.c
1835
} while (n++ < 5 && !(sts & GSTS_TES));
sys/dev/acpi/acpidmar.c
1837
DPRINTF(2, "iommu%d: translation enable loops=%d\n", iommu->id, n);
sys/dev/acpi/acpidmar.c
1839
if (n >= 5) {
sys/dev/acpi/acpidmar.c
1864
} while (n++ < 5 && (sts & GSTS_TES));
sys/dev/acpi/acpidmar.c
1866
DPRINTF(2, "iommu%d: translation disable loops=%d\n", iommu->id, n);
sys/dev/acpi/acpidmar.c
2871
int sz, n;
sys/dev/acpi/acpidmar.c
2877
for (n = 0; ; n++) {
sys/dev/acpi/acpidmar.c
2885
if (n >= 1000) {
sys/dev/acpi/acpidock.c
213
struct aml_nodelist *n;
sys/dev/acpi/acpidock.c
223
TAILQ_FOREACH_REVERSE(n, &sc->sc_deps_h, aml_nodelisth, entries)
sys/dev/acpi/acpidock.c
224
aml_notify(n->node, 0x00);
sys/dev/acpi/acpidock.c
231
TAILQ_FOREACH(n, &sc->sc_deps_h, entries)
sys/dev/acpi/acpidock.c
232
acpidock_eject(sc, n->node);
sys/dev/acpi/acpidock.c
262
struct aml_nodelist *n;
sys/dev/acpi/acpidock.c
265
n = malloc(sizeof *n, M_DEVBUF, M_WAITOK | M_ZERO);
sys/dev/acpi/acpidock.c
266
n->node = node;
sys/dev/acpi/acpidock.c
269
TAILQ_INSERT_TAIL(&sc->sc_deps_h, n, entries);
sys/dev/acpi/acpivar.h
40
#define dnprintf(n,x...) do { if (acpi_debug > (n)) printf(x); } while (0)
sys/dev/acpi/acpivar.h
43
#define dnprintf(n,x...)
sys/dev/acpi/amltypes.h
400
#define aml_bitmask(n) (1L << ((n) & 0x7))
sys/dev/acpi/amltypes.h
401
#define aml_bitpos(n) ((n)&0x7)
sys/dev/acpi/amltypes.h
402
#define aml_bytepos(n) ((n)>>3)
sys/dev/acpi/amltypes.h
403
#define aml_bytelen(n) (((n)+7)>>3)
sys/dev/acpi/atk0110.c
178
int i, n;
sys/dev/acpi/atk0110.c
212
n = v[0]->v_integer;
sys/dev/acpi/atk0110.c
213
if (res.length - 1 < n) {
sys/dev/acpi/atk0110.c
217
} else if (res.length - 1 > n) {
sys/dev/acpi/atk0110.c
219
DEVNAME(sc), name, n, res.length - 1);
sys/dev/acpi/atk0110.c
221
n = res.length - 1;
sys/dev/acpi/atk0110.c
223
printf(", assume %i\n", n);
sys/dev/acpi/atk0110.c
225
if (n < 1) {
sys/dev/acpi/atk0110.c
232
for (i = 0, v++; i < n; i++, v++) {
sys/dev/acpi/atk0110.c
419
struct aml_node *n = sc->sc_gitmnode;
sys/dev/acpi/atk0110.c
435
n = sc->sc_rtmpnode;
sys/dev/acpi/atk0110.c
438
n = sc->sc_rfannode;
sys/dev/acpi/atk0110.c
441
n = sc->sc_rvltnode;
sys/dev/acpi/atk0110.c
450
if (aml_evalnode(sc->sc_acpi, n, 1, &req, &res)) {
sys/dev/acpi/atk0110.c
452
DEVNAME(sc), n->name, i);
sys/dev/acpi/atk0110.c
458
DEVNAME(sc), n->name, i, res.type);
sys/dev/acpi/atk0110.c
466
DEVNAME(sc), n->name, i);
sys/dev/acpi/atk0110.c
473
DEVNAME(sc), n->name, i);
sys/dev/acpi/atk0110.c
487
aibs_getpack(struct aibs_softc *sc, struct aml_node *n, int64_t i,
sys/dev/acpi/atk0110.c
495
if (aml_evalnode(sc->sc_acpi, n, 1, &req, res)) {
sys/dev/acpi/atk0110.c
497
DEVNAME(sc), n->name, i);
sys/dev/acpi/atk0110.c
503
DEVNAME(sc), n->name, i, res->type);
sys/dev/acpi/dsdt.c
2356
int n, reg;
sys/dev/acpi/dsdt.c
2359
n = 0;
sys/dev/acpi/dsdt.c
2361
path[n] = pcidev;
sys/dev/acpi/dsdt.c
2363
if (pcidev == NULL || n == nitems(path) - 1)
sys/dev/acpi/dsdt.c
2365
n++;
sys/dev/acpi/dsdt.c
2370
for (; n >= 0; n--) {
sys/dev/acpi/dsdt.c
2371
if (aml_evalinteger(acpi_softc, path[n], "_ADR", 0, NULL,
sys/dev/acpi/dsdt.c
2375
} else if (__aml_search(path[n], "_HID", 0)) {
sys/dev/acpi/dsdt.c
2377
if (aml_evalinteger(acpi_softc, path[n], "_SEG", 0,
sys/dev/acpi/dsdt.c
2393
if (n == 0)
sys/dev/acpi/tpm.c
747
int rv, n, bcnt;
sys/dev/acpi/tpm.c
758
n = MIN(len, bcnt);
sys/dev/acpi/tpm.c
760
for (; n--; len--) {
sys/dev/adb/akbdmap.h
170
#define KC(n) KS_KEYCODE(n)
sys/dev/audio.c
47
#define DPRINTFN(n, ...) \
sys/dev/audio.c
49
if (audio_debug > (n)) \
sys/dev/audio.c
54
#define DPRINTFN(n, ...) do {} while(0)
sys/dev/audio.c
58
#define AUDIO_UNIT(n) (minor(n) & 0x0f)
sys/dev/audio.c
59
#define AUDIO_DEV(n) (minor(n) & 0xf0)
sys/dev/cons.h
100
dev_decl(n,cnprobe); dev_decl(n,cninit); dev_decl(n,cngetc); \
sys/dev/cons.h
101
dev_decl(n,cnputc); dev_decl(n,cnpollc); dev_decl(n,cnbell);
sys/dev/cons.h
103
#define cons_init(n) { \
sys/dev/cons.h
104
dev_init(1,n,cnprobe), dev_init(1,n,cninit), dev_init(1,n,cngetc), \
sys/dev/cons.h
105
dev_init(1,n,cnputc), dev_init(1,n,cnpollc), NULL, \
sys/dev/cons.h
108
#define cons_init_bell(n) { \
sys/dev/cons.h
109
dev_init(1,n,cnprobe), dev_init(1,n,cninit), dev_init(1,n,cngetc), \
sys/dev/cons.h
110
dev_init(1,n,cnputc), dev_init(1,n,cnpollc), dev_init(1,n,cnbell), \
sys/dev/cons.h
92
#define dev_type_cnprobe(n) void n(struct consdev *)
sys/dev/cons.h
93
#define dev_type_cninit(n) void n(struct consdev *)
sys/dev/cons.h
94
#define dev_type_cngetc(n) int n(dev_t)
sys/dev/cons.h
95
#define dev_type_cnputc(n) void n(dev_t, int)
sys/dev/cons.h
96
#define dev_type_cnpollc(n) void n(dev_t, int)
sys/dev/cons.h
97
#define dev_type_cnbell(n) void n(dev_t, u_int, u_int, u_int)
sys/dev/cons.h
99
#define cons_decl(n) \
sys/dev/dt/dt_dev.c
448
size_t size, n, t;
sys/dev/dt/dt_dev.c
476
for (n = 0; n < dtp->dtp_nargs; n++) {
sys/dev/dt/dt_dev.c
481
if (n >= DTMAXARGTYPES || dtp->dtp_argtype[n] == NULL)
sys/dev/dt/dt_dev.c
486
strlcpy(info.dtai_argtype, dtp->dtp_argtype[n],
sys/dev/dt/dtvar.h
285
#define _DT_STATIC_PROBEN(func, name, arg0, arg1, arg2, arg3, arg4, n) \
sys/dev/dt/dtvar.h
295
.dtp_nargs = n, \
sys/dev/fdt/amlclock.c
376
uint32_t m, n = 1;
sys/dev/fdt/amlclock.c
400
reg |= (n << HHI_SYS_DPLL_N_SHIFT);
sys/dev/fdt/amlclock.c
421
uint32_t m, n;
sys/dev/fdt/amlclock.c
428
n = HHI_SYS_DPLL_N(reg);
sys/dev/fdt/amlclock.c
429
return (((uint64_t)sc->sc_xtal * m) / n) / div;
sys/dev/fdt/amlclock.c
434
n = HHI_SYS_DPLL_N(reg);
sys/dev/fdt/amlclock.c
435
return (((uint64_t)sc->sc_xtal * m) / n) / div;
sys/dev/fdt/amltemp.c
184
const uint32_t n = 324;
sys/dev/fdt/amltemp.c
188
tmp2 = (code * n) / 100;
sys/dev/fdt/bcm2835_gpio.c
36
#define GPFSEL(n) (0x00 + ((n) * 4))
sys/dev/fdt/bcm2835_gpio.c
46
#define GPSET(n) (0x1c + ((n) * 4))
sys/dev/fdt/bcm2835_gpio.c
47
#define GPCLR(n) (0x28 + ((n) * 4))
sys/dev/fdt/bcm2835_gpio.c
48
#define GPLEV(n) (0x34 + ((n) * 4))
sys/dev/fdt/bcm2835_gpio.c
54
#define GPPUDCLK(n) (0x98 + ((n) * 4))
sys/dev/fdt/bcm2835_gpio.c
55
#define GPPULL(n) (0xe4 + ((n) * 4))
sys/dev/fdt/cdpcie.c
47
#define PCIE_AT_OB_ADDR0_NBITS(n) ((n) - 1)
sys/dev/fdt/cwfg.c
149
int n;
sys/dev/fdt/cwfg.c
168
for (n = 0; n < BATINFO_SIZE; n++)
sys/dev/fdt/cwfg.c
169
sc->sc_batinfo[n] = be32toh(batinfo[n]);
sys/dev/fdt/cwfg.c
259
int error, n;
sys/dev/fdt/cwfg.c
272
for (n = 0; n < BATINFO_SIZE; n++) {
sys/dev/fdt/cwfg.c
273
if ((error = cwfg_read(sc, BATINFO_REG(n), &val)) != 0)
sys/dev/fdt/cwfg.c
275
if (sc->sc_batinfo[n] != val) {
sys/dev/fdt/cwfg.c
285
for (n = 0; n < BATINFO_SIZE; n++) {
sys/dev/fdt/cwfg.c
286
val = sc->sc_batinfo[n];
sys/dev/fdt/cwfg.c
287
if ((error = cwfg_write(sc, BATINFO_REG(n), val)) != 0)
sys/dev/fdt/cwfg.c
318
int error, n;
sys/dev/fdt/cwfg.c
338
for (n = 0; n < 3; n++) {
sys/dev/fdt/cwfg.c
69
#define BATINFO_REG(n) (0x10 + (n))
sys/dev/fdt/exuart.c
534
int i, n;
sys/dev/fdt/exuart.c
536
n = q_to_b(&tp->t_outq, buffer, sizeof buffer);
sys/dev/fdt/exuart.c
537
for (i = 0; i < n; i++)
sys/dev/fdt/exuart.c
539
bzero(buffer, n);
sys/dev/fdt/if_dwge.c
1433
int n;
sys/dev/fdt/if_dwge.c
1440
for (n = 0; n < 30000; n++) {
sys/dev/fdt/if_dwge.c
863
int n;
sys/dev/fdt/if_dwge.c
870
for (n = 0; n < 1000; n++) {
sys/dev/fdt/if_dwge.c
884
int n;
sys/dev/fdt/if_dwge.c
892
for (n = 0; n < 1000; n++) {
sys/dev/fdt/if_dwxe.c
1310
int n;
sys/dev/fdt/if_dwxe.c
1316
for (n = 0; n < 1000; n++) {
sys/dev/fdt/if_dwxe.c
773
int n;
sys/dev/fdt/if_dwxe.c
780
for (n = 0; n < 1000; n++) {
sys/dev/fdt/if_dwxe.c
795
int n;
sys/dev/fdt/if_dwxe.c
804
for (n = 0; n < 1000; n++) {
sys/dev/fdt/if_mvneta.c
77
#define DPRINTFN(n,x) if (mvneta_debug >= (n)) printf x
sys/dev/fdt/if_mvneta.c
81
#define DPRINTFN(n,x)
sys/dev/fdt/if_mvnetareg.h
128
#define MVNETA_CRDP(n) (0x260c + ((n) << 4))
sys/dev/fdt/if_mvnetareg.h
439
#define MVNETA_RQC_ENQ(n) (1 << (0 + (n)))
sys/dev/fdt/if_mvnetareg.h
441
#define MVNETA_RQC_DISQ(n) (1 << (8 + (n)))
sys/dev/fdt/if_mvnetareg.h
445
#define MVNETA_DF(n, x) ((x) << (8 * (n)))
sys/dev/fdt/if_mvnetareg.h
484
#define MVNETA_RXHWFWDTH_DROPRNDGENBITS(n) (((n) & 0x3ff) << 0)
sys/dev/fdt/if_mvnetareg.h
485
#define MVNETA_RXHWFWDTH_DROPTHRESHOLD(n) (((n) & 0xf) << 16)
sys/dev/fdt/if_mvnetareg.h
55
#define MVNETA_RXHWFWD(n) (0x1d10 + (((n) & ~0x1) << 1))
sys/dev/fdt/if_mvnetareg.h
82
#define MVNETA_BASEADDR(n) (0x2200 + ((n) << 3)) /* Base Address */
sys/dev/fdt/if_mvnetareg.h
83
#define MVNETA_S(n) (0x2204 + ((n) << 3)) /* Size */
sys/dev/fdt/if_mvnetareg.h
84
#define MVNETA_HA(n) (0x2280 + ((n) << 2)) /* High Address Remap */
sys/dev/fdt/if_mvnetareg.h
97
#define MVNETA_DSCP(n) (0x2420 + ((n) << 2))
sys/dev/fdt/if_mvppreg.h
944
#define MV_SMI_PHY_ADDRESS_REG(n) (0xC + 0x4 * (n))
sys/dev/fdt/imxesdhc.c
250
#define DPRINTF(n,s) do { if ((n) <= imxesdhcdebug) printf s; } while (0)
sys/dev/fdt/imxesdhc.c
252
#define DPRINTF(n,s) do {} while(0)
sys/dev/fdt/imxuart.c
374
int n = q_to_b(&tp->t_outq, buf, 32/*XXX*/);
sys/dev/fdt/imxuart.c
376
for (i = 0; i < n; i++)
sys/dev/fdt/mvuart.c
307
int i, n, s;
sys/dev/fdt/mvuart.c
328
n = q_to_b(&tp->t_outq, &buf, 1);
sys/dev/fdt/mvuart.c
329
if (n < 1)
sys/dev/fdt/qctsens.c
35
#define TSENS_Sn_STATUS(n) (0xa0 + (4 * (n)))
sys/dev/fdt/rkclock.c
2851
uint16_t n, d;
sys/dev/fdt/rkclock.c
2854
n = frac >> 16;
sys/dev/fdt/rkclock.c
2856
if (n == 0 || d == 0)
sys/dev/fdt/rkclock.c
2857
n = d = 1;
sys/dev/fdt/rkclock.c
2859
return ((uint64_t)parent_freq * n) / d;
sys/dev/fdt/rkclock.c
2866
uint32_t n, d;
sys/dev/fdt/rkclock.c
2871
n = freq;
sys/dev/fdt/rkclock.c
2878
if (n == 0 || d == 0 || d < 20 * n)
sys/dev/fdt/rkclock.c
2896
a = n / d;
sys/dev/fdt/rkclock.c
2897
d = n % d;
sys/dev/fdt/rkclock.c
2898
n = tmp;
sys/dev/fdt/rkiis.c
128
#define RXFIFOLR_RFL_MASK(n) (0x3f << ((n) * 6))
sys/dev/fdt/rkiis.c
129
#define RXFIFOLR_RFL_SHIFT(n) ((n) * 6)
sys/dev/fdt/rkiis.c
94
#define TXFIFOLR_TFL_MASK(n) (0x3f << ((n) * 6))
sys/dev/fdt/rkiis.c
95
#define TXFIFOLR_TFL_SHIFT(n) ((n) * 6)
sys/dev/fdt/rktemp.c
587
const int n = sc->sc_ntemps;
sys/dev/fdt/rktemp.c
594
if (temp >= sc->sc_temps[n - 1].temp)
sys/dev/fdt/rktemp.c
595
return sc->sc_temps[n - 1].code;
sys/dev/fdt/rktemp.c
597
for (i = 1; i < n; i++) {
sys/dev/fdt/rktemp.c
613
const int n = sc->sc_ntemps;
sys/dev/fdt/rktemp.c
622
if (code <= sc->sc_temps[n - 1].code)
sys/dev/fdt/rktemp.c
623
return sc->sc_temps[n - 1].temp;
sys/dev/fdt/rktemp.c
625
for (i = 1; i < n; i++) {
sys/dev/fdt/rktemp.c
632
if (code >= sc->sc_temps[n - 1].code)
sys/dev/fdt/rktemp.c
633
return sc->sc_temps[n - 1].temp;
sys/dev/fdt/rktemp.c
635
for (i = 1; i < n; i++) {
sys/dev/fdt/rktemp.c
652
const int n = sc->sc_ntemps;
sys/dev/fdt/rktemp.c
657
if (code < sc->sc_temps[n - 1].code)
sys/dev/fdt/rktemp.c
662
if (code > sc->sc_temps[n - 1].code)
sys/dev/fdt/sxiccmu.c
1009
uint32_t k, m, n, p;
sys/dev/fdt/sxiccmu.c
1020
n = A10_PLL1_FACTOR_N(reg);
sys/dev/fdt/sxiccmu.c
1022
return (24000000 * n * k) / (m * p);
sys/dev/fdt/sxiccmu.c
1139
uint32_t k, m, n, p;
sys/dev/fdt/sxiccmu.c
1146
n = A64_PLL_CPUX_FACTOR_N(reg) + 1;
sys/dev/fdt/sxiccmu.c
1148
return (24000000 * n * k) / (m * p);
sys/dev/fdt/sxiccmu.c
1277
uint32_t m, n;
sys/dev/fdt/sxiccmu.c
1285
n = D1_PLL_CPU_FACTOR_N(reg) + 1;
sys/dev/fdt/sxiccmu.c
1286
return (24000000 * n) / m;
sys/dev/fdt/sxiccmu.c
1312
n = 1 << D1_PSI_CLK_FACTOR_N(reg);
sys/dev/fdt/sxiccmu.c
1313
return freq / (m * n);
sys/dev/fdt/sxiccmu.c
1349
uint32_t k, m, n, p;
sys/dev/fdt/sxiccmu.c
1360
n = H3_PLL_CPUX_FACTOR_N(reg) + 1;
sys/dev/fdt/sxiccmu.c
1362
return (24000000 * n * k) / (m * p);
sys/dev/fdt/sxiccmu.c
1483
uint32_t reg, m, n;
sys/dev/fdt/sxiccmu.c
1497
n = 1 << H6_AHB3_CLK_FACTOR_N(reg);
sys/dev/fdt/sxiccmu.c
1498
return freq / (m * n);
sys/dev/fdt/sxiccmu.c
1529
uint32_t reg, m, n;
sys/dev/fdt/sxiccmu.c
1543
n = 1 << H616_AHB3_CLK_FACTOR_N(reg);
sys/dev/fdt/sxiccmu.c
1544
return freq / (m * n);
sys/dev/fdt/sxiccmu.c
1692
int k, n;
sys/dev/fdt/sxiccmu.c
1697
k = 1; n = 32;
sys/dev/fdt/sxiccmu.c
1698
while (k <= 4 && (24000000 * n * k) < freq)
sys/dev/fdt/sxiccmu.c
1700
while (n >= 1 && (24000000 * n * k) > freq)
sys/dev/fdt/sxiccmu.c
1701
n--;
sys/dev/fdt/sxiccmu.c
1708
reg |= (n << A10_PLL1_FACTOR_N_SHIFT);
sys/dev/fdt/sxiccmu.c
1753
int k, n;
sys/dev/fdt/sxiccmu.c
1758
k = 1; n = 32;
sys/dev/fdt/sxiccmu.c
1759
while (k <= 4 && (24000000 * n * k) < freq)
sys/dev/fdt/sxiccmu.c
1761
while (n >= 1 && (24000000 * n * k) > freq)
sys/dev/fdt/sxiccmu.c
1762
n--;
sys/dev/fdt/sxiccmu.c
1769
reg |= (n << A10_PLL1_FACTOR_N_SHIFT);
sys/dev/fdt/sxiccmu.c
1834
int k, n;
sys/dev/fdt/sxiccmu.c
1839
k = 1; n = 32;
sys/dev/fdt/sxiccmu.c
1840
while (k <= 4 && (24000000 * n * k) < freq)
sys/dev/fdt/sxiccmu.c
1842
while (n >= 1 && (24000000 * n * k) > freq)
sys/dev/fdt/sxiccmu.c
1843
n--;
sys/dev/fdt/sxiccmu.c
1850
reg |= ((n - 1) << A64_PLL_CPUX_FACTOR_N_SHIFT);
sys/dev/fdt/sxiccmu.c
1929
uint32_t reg, m, n;
sys/dev/fdt/sxiccmu.c
1934
n = 2, m = 15;
sys/dev/fdt/sxiccmu.c
1942
n = 0, m = 0;
sys/dev/fdt/sxiccmu.c
1946
while ((parent_freq / (1 << n) / 16) > freq)
sys/dev/fdt/sxiccmu.c
1947
n++;
sys/dev/fdt/sxiccmu.c
1948
while ((parent_freq / (1 << n) / (m + 1)) > freq)
sys/dev/fdt/sxiccmu.c
1959
reg |= n << D1_SMHC_FACTOR_N_SHIFT;
sys/dev/fdt/sxiccmu.c
1989
int k, n;
sys/dev/fdt/sxiccmu.c
1994
k = 1; n = 32;
sys/dev/fdt/sxiccmu.c
1995
while (k <= 4 && (24000000 * n * k) < freq)
sys/dev/fdt/sxiccmu.c
1997
while (n >= 1 && (24000000 * n * k) > freq)
sys/dev/fdt/sxiccmu.c
1998
n--;
sys/dev/fdt/sxiccmu.c
2010
reg |= ((n - 1) << H3_PLL_CPUX_FACTOR_N_SHIFT);
sys/dev/fdt/sxiccmu.c
2072
uint32_t reg, m, n;
sys/dev/fdt/sxiccmu.c
2077
n = 2, m = 15;
sys/dev/fdt/sxiccmu.c
2085
n = 0, m = 0;
sys/dev/fdt/sxiccmu.c
2087
while ((parent_freq / (1 << n) / 16) > freq)
sys/dev/fdt/sxiccmu.c
2088
n++;
sys/dev/fdt/sxiccmu.c
2089
while ((parent_freq / (1 << n) / (m + 1)) > freq)
sys/dev/fdt/sxiccmu.c
2100
reg |= n << H6_SMHC_FACTOR_N_SHIFT;
sys/dev/fdt/sxiccmu.c
663
uint32_t reg, k, m, n, freq;
sys/dev/fdt/sxiccmu.c
670
n = CCU_PLL6_FACTOR_N(reg);
sys/dev/fdt/sxiccmu.c
675
return (freq * n * k) / m / 6; /* pll6_sata */
sys/dev/fdt/sxiccmu.c
677
return (freq * n * k) / 2; /* pll6_other */
sys/dev/fdt/sxiccmu.c
679
return (freq * n * k); /* pll6 */
sys/dev/fdt/sxiccmu.c
681
return (freq * n * k) / 4; /* pll6_div_4 */
sys/dev/fdt/sxiccmu.c
723
uint32_t reg, m, n, freq;
sys/dev/fdt/sxiccmu.c
728
n = CCU_APB1_CLK_RAT_N(reg);
sys/dev/fdt/sxiccmu.c
732
return freq / (1 << n) / (m + 1);
sys/dev/fdt/sxiccmu.c
809
uint32_t reg, m, n;
sys/dev/fdt/sxiccmu.c
814
n = 2, m = 15;
sys/dev/fdt/sxiccmu.c
822
n = 0, m = 0;
sys/dev/fdt/sxiccmu.c
824
while ((parent_freq / (1 << n) / 16) > freq)
sys/dev/fdt/sxiccmu.c
825
n++;
sys/dev/fdt/sxiccmu.c
826
while ((parent_freq / (1 << n) / (m + 1)) > freq)
sys/dev/fdt/sxiccmu.c
837
reg |= n << CCU_SDx_CLK_DIV_RATIO_N_SHIFT;
sys/dev/fdt/sxiccmu.c
950
uint32_t k, m, n, p;
sys/dev/fdt/sxiccmu.c
961
n = A10_PLL1_FACTOR_N(reg);
sys/dev/fdt/sxiccmu.c
963
return (24000000 * n * k) / (m * p);
sys/dev/fdt/sxisid.c
34
#define SID_PRCTL_OFFSET(n) (((n) & 0x1ff) << 16)
sys/dev/fdt/sxitwi.c
187
uint32_t m, n, nbase;
sys/dev/fdt/sxitwi.c
227
n = 0, m = 0;
sys/dev/fdt/sxitwi.c
228
while ((freq * (nbase << n) * 16 * 10) < parent_freq)
sys/dev/fdt/sxitwi.c
229
n++;
sys/dev/fdt/sxitwi.c
230
while ((freq * (nbase << n) * (m + 1) * 10) < parent_freq)
sys/dev/fdt/sxitwi.c
232
if (n > 8 || m > 16) {
sys/dev/fdt/sxitwi.c
274
sxitwi_write_4(sc, TWSI_CLOCK, (m << 3) | (n << 0));
sys/dev/fdt/xhci_fdt.c
270
#define USB3_GUSB2PHYCFG0_USBTRDTIM(n) ((n) << 10)
sys/dev/gpio/gpiodcf.c
33
#define DPRINTFN(n, x) do { if (gpiodcfdebug > (n)) printf x; } while (0)
sys/dev/gpio/gpiodcf.c
36
#define DPRINTFN(n, x)
sys/dev/hid/hid.c
581
uint8_t n;
sys/dev/hid/hid.c
594
n = (hsize + 7) / 8;
sys/dev/hid/hid.c
595
rpos += n;
sys/dev/hid/hid.c
596
while (n--) {
sys/dev/hid/hid.c
599
data |= buf[rpos] << (8 * n);
sys/dev/hid/hid.c
604
n = 32 - hsize;
sys/dev/hid/hid.c
608
data = (int32_t)((int32_t)data << n) >> n;
sys/dev/hid/hid.c
610
data = (uint32_t)((uint32_t)data << n) >> n;
sys/dev/hid/hidkbd.c
56
#define DPRINTFN(n,x) do { if (hidkbddebug>(n)) printf x; } while (0)
sys/dev/hid/hidkbd.c
60
#define DPRINTFN(n,x)
sys/dev/hid/hidms.c
52
#define DPRINTFN(n,x) do { if (hidmsdebug>(n)) printf x; } while (0)
sys/dev/hid/hidms.c
56
#define DPRINTFN(n,x)
sys/dev/hil/hilkbdmap.c
173
#define KC(n) KS_KEYCODE(n)
sys/dev/i2c/w83l784r.c
270
w83l784r_refresh_volt(struct wbenv_softc *sc, int n)
sys/dev/i2c/w83l784r.c
272
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/i2c/w83l784r.c
273
int data, reg = sc->sc_wbenv_sensors[n].reg;
sys/dev/i2c/w83l784r.c
277
sensor->value *= sc->sc_wbenv_sensors[n].rfact;
sys/dev/i2c/w83l784r.c
282
w83l785r_refresh_volt(struct wbenv_softc *sc, int n)
sys/dev/i2c/w83l784r.c
284
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/i2c/w83l784r.c
285
int data, reg = sc->sc_wbenv_sensors[n].reg;
sys/dev/i2c/w83l784r.c
289
sensor->value *= sc->sc_wbenv_sensors[n].rfact;
sys/dev/i2c/w83l784r.c
294
wbenv_refresh_temp(struct wbenv_softc *sc, int n)
sys/dev/i2c/w83l784r.c
296
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/i2c/w83l784r.c
299
sdata = wbenv_readreg(sc, sc->sc_wbenv_sensors[n].reg);
sys/dev/i2c/w83l784r.c
306
w83l784r_refresh_temp(struct wbenv_softc *sc, int n)
sys/dev/i2c/w83l784r.c
308
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/i2c/w83l784r.c
313
sc->sc_addr[sc->sc_wbenv_sensors[n].reg],
sys/dev/i2c/w83l784r.c
319
w83l784r_refresh_fanrpm(struct wbenv_softc *sc, int n)
sys/dev/i2c/w83l784r.c
321
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/i2c/w83l784r.c
325
if (sc->sc_wbenv_sensors[n].reg == W83L784R_FAN1)
sys/dev/i2c/w83l784r.c
330
data = wbenv_readreg(sc, sc->sc_wbenv_sensors[n].reg);
sys/dev/i2c/w83l784r.c
341
w83l785r_refresh_fanrpm(struct wbenv_softc *sc, int n)
sys/dev/i2c/w83l784r.c
343
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/i2c/w83l784r.c
347
if (sc->sc_wbenv_sensors[n].reg == W83L784R_FAN1)
sys/dev/i2c/w83l784r.c
352
data = wbenv_readreg(sc, sc->sc_wbenv_sensors[n].reg);
sys/dev/ic/ac97.c
493
#define cl(n) n, nitems(n)
sys/dev/ic/ac97.c
586
#define DPRINTFN(n,x) if (ac97debug>(n)) printf x
sys/dev/ic/ac97.c
594
#define DPRINTFN(n,x)
sys/dev/ic/acx.c
2297
struct acx_tmplt_null_data n;
sys/dev/ic/acx.c
2300
bzero(&n, sizeof(n));
sys/dev/ic/acx.c
2302
wh = &n.data;
sys/dev/ic/acx.c
2310
return (acx_set_tmplt(sc, ACXCMD_TMPLT_NULL_DATA, &n, sizeof(n)));
sys/dev/ic/acxvar.h
59
#define DPRINTFN(n,x) do { if (acxdebug >= (n)) printf x; } while (0)
sys/dev/ic/acxvar.h
62
#define DPRINTFN(n,x)
sys/dev/ic/advlib.c
3173
DvcSleepMilliSecond(u_int32_t n)
sys/dev/ic/advlib.c
3175
DELAY(n * 1000);
sys/dev/ic/advlib.c
3180
DvcDelayMicroSecond(u_int32_t n)
sys/dev/ic/advlib.c
3182
DELAY(n);
sys/dev/ic/advlib.c
3187
DvcDelayNanoSecond(u_int32_t n)
sys/dev/ic/advlib.c
3189
DELAY((n + 999) / 1000);
sys/dev/ic/adwlib.c
2348
AdwSleepMilliSecond(u_int32_t n)
sys/dev/ic/adwlib.c
2351
DELAY(n * 1000);
sys/dev/ic/adwlib.c
2356
AdwDelayMicroSecond(u_int32_t n)
sys/dev/ic/adwlib.c
2359
DELAY(n);
sys/dev/ic/ahci.c
2749
u_int32_t target, int n)
sys/dev/ic/ahci.c
2753
for (i = 0; i < n * 1000; i++) {
sys/dev/ic/aic6360.c
1117
AIC_MISC(("n=%d imess=0x%02x ", n, sc->sc_imess[0]));
sys/dev/ic/aic6360.c
1132
int n;
sys/dev/ic/aic6360.c
1163
n = sc->sc_omp - sc->sc_omess;
sys/dev/ic/aic6360.c
1184
n = 1;
sys/dev/ic/aic6360.c
1196
n = 5;
sys/dev/ic/aic6360.c
1208
n = 4;
sys/dev/ic/aic6360.c
1215
n = 1;
sys/dev/ic/aic6360.c
1220
n = 1;
sys/dev/ic/aic6360.c
1225
n = 1;
sys/dev/ic/aic6360.c
1230
n = 1;
sys/dev/ic/aic6360.c
1236
n = 1;
sys/dev/ic/aic6360.c
1244
n = 1;
sys/dev/ic/aic6360.c
1247
sc->sc_omp = &sc->sc_omess[n];
sys/dev/ic/aic6360.c
1275
if (n == 1 && sc->sc_msgpriq == 0)
sys/dev/ic/aic6360.c
1279
--n;
sys/dev/ic/aic6360.c
1286
if (n == 0)
sys/dev/ic/aic6360.c
1316
aic_dataout_pio(struct aic_softc *sc, u_char *p, int n)
sys/dev/ic/aic6360.c
1341
while (n > 0) {
sys/dev/ic/aic6360.c
1351
if (n >= DOUTAMOUNT) {
sys/dev/ic/aic6360.c
1352
n -= DOUTAMOUNT;
sys/dev/ic/aic6360.c
1367
xfer = n;
sys/dev/ic/aic6360.c
1370
n -= xfer;
sys/dev/ic/aic6360.c
1458
aic_datain_pio(struct aic_softc *sc, u_char *p, int n)
sys/dev/ic/aic6360.c
1483
while (n > 0) {
sys/dev/ic/aic6360.c
1492
n -= DINAMOUNT;
sys/dev/ic/aic6360.c
1507
xfer = min(bus_space_read_1(iot, ioh, FIFOSTAT), n);
sys/dev/ic/aic6360.c
1510
n -= xfer;
sys/dev/ic/aic6360.c
1588
int n;
sys/dev/ic/aic6360.c
1885
n = aic_dataout_pio(sc, sc->sc_cp, sc->sc_cleft);
sys/dev/ic/aic6360.c
1886
sc->sc_cp += n;
sys/dev/ic/aic6360.c
1887
sc->sc_cleft -= n;
sys/dev/ic/aic6360.c
1895
n = aic_dataout_pio(sc, sc->sc_dp, sc->sc_dleft);
sys/dev/ic/aic6360.c
1896
sc->sc_dp += n;
sys/dev/ic/aic6360.c
1897
sc->sc_dleft -= n;
sys/dev/ic/aic6360.c
1905
n = aic_datain_pio(sc, sc->sc_dp, sc->sc_dleft);
sys/dev/ic/aic6360.c
1906
sc->sc_dp += n;
sys/dev/ic/aic6360.c
1907
sc->sc_dleft -= n;
sys/dev/ic/aic6360.c
850
int n;
sys/dev/ic/aic6360.c
856
n = sc->sc_imp - sc->sc_imess;
sys/dev/ic/aic6360.c
864
n = 0;
sys/dev/ic/aic6360.c
865
sc->sc_imp = &sc->sc_imess[n];
sys/dev/ic/aic6360.c
897
if (n >= AIC_MAX_MSG_LEN) {
sys/dev/ic/aic6360.c
904
n++;
sys/dev/ic/aic6360.c
911
if (n == 1 && IS1BYTEMSG(sc->sc_imess[0]))
sys/dev/ic/aic6360.c
913
if (n == 2 && IS2BYTEMSG(sc->sc_imess[0]))
sys/dev/ic/aic6360.c
915
if (n >= 3 && ISEXTMSG(sc->sc_imess[0]) &&
sys/dev/ic/aic6360.c
916
n == sc->sc_imess[1] + 2)
sys/dev/ic/aic6360.c
935
AIC_MISC(("n=%d imess=0x%02x ", n, sc->sc_imess[0]));
sys/dev/ic/ami.c
652
u_int32_t i, n;
sys/dev/ic/ami.c
682
for (n = 0; n < nstat; n++) {
sys/dev/ic/ami.c
685
while ((completed[n] = sc->sc_mbox->acc_cmplidl[n]) == 0xff) {
sys/dev/ic/ami.c
690
sc->sc_mbox->acc_cmplidl[n] = 0xff;
sys/dev/ic/ami.c
707
for (n = 0; n < nstat; n++)
sys/dev/ic/ami.c
708
mbox->acc_cmplidl[n] = completed[n];
sys/dev/ic/ar5008.c
1448
struct mbuf *n;
sys/dev/ic/ar5008.c
1453
n = m_makespace(m, hdrlen, IEEE80211_CCMP_HDRLEN, &off);
sys/dev/ic/ar5008.c
1454
if (n == NULL) {
sys/dev/ic/ar5008.c
1458
ivp = mtod(n, uint8_t *) + off;
sys/dev/ic/ar5210reg.h
290
#define AR5K_AR5210_GPIOCR_IN(n) (0 << ((n) * 2))
sys/dev/ic/ar5210reg.h
291
#define AR5K_AR5210_GPIOCR_OUT0(n) (1 << ((n) * 2))
sys/dev/ic/ar5210reg.h
292
#define AR5K_AR5210_GPIOCR_OUT1(n) (2 << ((n) * 2))
sys/dev/ic/ar5210reg.h
293
#define AR5K_AR5210_GPIOCR_OUT(n) (3 << ((n) * 2))
sys/dev/ic/ar5210reg.h
294
#define AR5K_AR5210_GPIOCR_ALL(n) (3<< ((n) * 2))
sys/dev/ic/ar5210reg.h
295
#define AR5K_AR5210_GPIOCR_INT_SEL(n) ((n) << 12)
sys/dev/ic/ar5210reg.h
602
#define AR5K_AR5210_KEYTABLE(n) (AR5K_AR5210_KEYTABLE_0 + ((n) << 5))
sys/dev/ic/ar5211reg.h
614
#define AR5K_AR5211_GPIOCR_NONE(n) (0 << ((n) * 2))
sys/dev/ic/ar5211reg.h
615
#define AR5K_AR5211_GPIOCR_OUT0(n) (1 << ((n) * 2))
sys/dev/ic/ar5211reg.h
616
#define AR5K_AR5211_GPIOCR_OUT1(n) (2 << ((n) * 2))
sys/dev/ic/ar5211reg.h
617
#define AR5K_AR5211_GPIOCR_ALL(n) (3 << ((n) * 2))
sys/dev/ic/ar5211reg.h
618
#define AR5K_AR5211_GPIOCR_INT_SEL(n) ((n) << 12)
sys/dev/ic/ar5211reg.h
896
#define AR5K_AR5211_KEYTABLE(n) (AR5K_AR5211_KEYTABLE_0 + ((n) * 32))
sys/dev/ic/ar5212reg.h
628
#define AR5K_AR5212_GPIOCR_NONE(n) (0 << ((n) * 2))
sys/dev/ic/ar5212reg.h
629
#define AR5K_AR5212_GPIOCR_OUT0(n) (1 << ((n) * 2))
sys/dev/ic/ar5212reg.h
630
#define AR5K_AR5212_GPIOCR_OUT1(n) (2 << ((n) * 2))
sys/dev/ic/ar5212reg.h
631
#define AR5K_AR5212_GPIOCR_ALL(n) (3 << ((n) * 2))
sys/dev/ic/ar5212reg.h
632
#define AR5K_AR5212_GPIOCR_INT_SEL(n) ((n) << 12)
sys/dev/ic/ar5xxx.c
1803
int i, min, max, n;
sys/dev/ic/ar5xxx.c
1823
n = nitems(hal->ah_txpower.txp_pcdac);
sys/dev/ic/ar5xxx.c
1826
for (i = 0; i < n; i += AR5K_EEPROM_PCDAC_STEP)
sys/dev/ic/ar5xxx.c
1829
min + ((i * (max - min)) / n);
sys/dev/ic/ar5xxx.c
1837
size_t n, HAL_BOOL change_channel)
sys/dev/ic/ar5xxx.c
1841
for (i = 0; i < n; i++) {
sys/dev/ic/ar5xxx.c
1862
size_t n, u_int mode)
sys/dev/ic/ar5xxx.c
1866
for (i = 0; i < n; i++) {
sys/dev/ic/athn.c
1304
int i, cur, n;
sys/dev/ic/athn.c
1311
for (n = 0; n < sc->nf_hist_nvalid; n++) {
sys/dev/ic/athn.c
1312
nf_vals[n] = sc->nf_hist[cur].nf[i];
sys/dev/ic/athn.c
1313
nf_ext_vals[n] = sc->nf_hist[cur].nf_ext[i];
sys/dev/ic/athnvar.h
25
#define DPRINTFN(n, x) do { if (athn_debug >= (n)) printf x; } while (0)
sys/dev/ic/athnvar.h
29
#define DPRINTFN(n, x)
sys/dev/ic/atwvar.h
357
#define ATW_CDTXSYNC(sc, x, n, ops) \
sys/dev/ic/atwvar.h
362
__n = (n); \
sys/dev/ic/bcm2835_dmac.h
49
#define DMAC_CS(n) (0x00 + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
65
#define DMAC_CONBLK_AD(n) (0x04 + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
66
#define DMAC_TI(n) (0x08 + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
67
#define DMAC_SOURCE_AD(n) (0x0c + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
68
#define DMAC_DEST_AD(n) (0x10 + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
69
#define DMAC_TXFR_LEN(n) (0x14 + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
70
#define DMAC_STRIDE(n) (0x18 + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
71
#define DMAC_NEXTCONBK(n) (0x1c + (0x100 * (n)))
sys/dev/ic/bcm2835_dmac.h
72
#define DMAC_DEBUG(n) (0x20 + (0x100 * (n)))
sys/dev/ic/bcmgenet.c
380
genet_setup_rxfilter_mdf(struct genet_softc *sc, u_int n, const uint8_t *ea)
sys/dev/ic/bcmgenet.c
385
WR4(sc, GENET_UMAC_MDF_ADDR0(n), addr0);
sys/dev/ic/bcmgenet.c
386
WR4(sc, GENET_UMAC_MDF_ADDR1(n), addr1);
sys/dev/ic/bcmgenet.c
397
u_int n;
sys/dev/ic/bcmgenet.c
407
for (n = 2; enm != NULL; n++)
sys/dev/ic/bcmgenet.c
410
if (n > GENET_MAX_MDF_FILTER || ac->ac_multirangecnt > 0)
sys/dev/ic/bcmgenet.c
423
for (n = 2; enm != NULL; n++) {
sys/dev/ic/bcmgenet.c
424
genet_setup_rxfilter_mdf(sc, n, enm->enm_addrlo);
sys/dev/ic/bcmgenet.c
428
GENET_MAX_MDF_FILTER - n);
sys/dev/ic/bcmgenet.c
686
int index, len, n;
sys/dev/ic/bcmgenet.c
69
#define TX_SKIP(n, o) (((n) + (o)) & (GENET_DMA_DESC_COUNT - 1))
sys/dev/ic/bcmgenet.c
695
for (n = 0; n < total; n++) {
sys/dev/ic/bcmgenet.c
70
#define TX_NEXT(n) TX_SKIP(n, 1)
sys/dev/ic/bcmgenet.c
707
n, index, status, len, len - ETHER_ALIGN);
sys/dev/ic/bcmgenet.c
71
#define RX_NEXT(n) (((n) + 1) & (GENET_DMA_DESC_COUNT - 1))
sys/dev/ic/bcmgenetreg.h
96
#define GENET_UMAC_MDF_ADDR0(n) (0xe54 + (n) * 0x8)
sys/dev/ic/bcmgenetreg.h
97
#define GENET_UMAC_MDF_ADDR1(n) (0xe58 + (n) * 0x8)
sys/dev/ic/bwfm.c
54
#define DPRINTFN(n, x) do { if (bwfm_debug >= (n)) printf x; } while (0)
sys/dev/ic/bwfm.c
58
#define DPRINTFN(n, x) do { ; } while (0)
sys/dev/ic/bwi.c
1975
int n, i, iv_img_size;
sys/dev/ic/bwi.c
1979
n = betoh32(hdr->fw_iv_cnt);
sys/dev/ic/bwi.c
1980
DPRINTF(1, "%s: IV count %d\n", sc->sc_dev.dv_xname, n);
sys/dev/ic/bwi.c
1988
for (i = 0; i < n; ++i) {
sys/dev/ic/bwi.c
3425
int i, n;
sys/dev/ic/bwi.c
3480
n = nitems(bwi_phy_noise_scale_11g_rev2);
sys/dev/ic/bwi.c
3483
n = nitems(bwi_phy_noise_scale_11g_rev7);
sys/dev/ic/bwi.c
3486
n = nitems(bwi_phy_noise_scale_11g);
sys/dev/ic/bwi.c
3488
for (i = 0; i < n; ++i)
sys/dev/ic/bwi.c
3496
n = nitems(bwi_phy_sigma_sq_11g_rev2);
sys/dev/ic/bwi.c
3499
n = nitems(bwi_phy_sigma_sq_11g_rev7);
sys/dev/ic/bwi.c
3502
n = 0;
sys/dev/ic/bwi.c
3504
for (i = 0; i < n; ++i)
sys/dev/ic/bwi.c
3711
int n;
sys/dev/ic/bwi.c
3713
n = rf_atten + (14 * (bbp_atten / 2));
sys/dev/ic/bwi.c
3714
KASSERT(n < BWI_RFLO_MAX);
sys/dev/ic/bwi.c
3716
return (&mac->mac_rf.rf_lo[n]);
sys/dev/ic/bwi.c
444
#define SAVE_RF_REG(mac, regs, n) (regs)->rf_##n = RF_READ((mac), 0x##n)
sys/dev/ic/bwi.c
445
#define RESTORE_RF_REG(mac, regs, n) RF_WRITE((mac), 0x##n, (regs)->rf_##n)
sys/dev/ic/bwi.c
447
#define SAVE_PHY_REG(mac, regs, n) (regs)->phy_##n = PHY_READ((mac), 0x##n)
sys/dev/ic/bwi.c
448
#define RESTORE_PHY_REG(mac, regs, n) PHY_WRITE((mac), 0x##n, (regs)->phy_##n)
sys/dev/ic/bwi.c
9401
int n, i;
sys/dev/ic/bwi.c
9411
n = sizeof(buf) / sizeof(val);
sys/dev/ic/bwi.c
9413
for (i = 0; i < n; ++i) {
sys/dev/ic/com.c
122
#define divrnd(n, q) (((n)*2/(q)+1)/2) /* divide and round off */
sys/dev/ic/com.c
945
int i, n;
sys/dev/ic/com.c
947
n = q_to_b(&tp->t_outq, buffer,
sys/dev/ic/com.c
949
for (i = 0; i < n; i++) {
sys/dev/ic/com.c
952
bzero(buffer, n);
sys/dev/ic/dc21040reg.h
607
#define TULIP_SROM_2114X_CMDBITS(n) (((n) & 0x0071) << 18)
sys/dev/ic/dp8390.c
191
int n = 5000;
sys/dev/ic/dp8390.c
205
ED_P0_ISR) & ED_ISR_RST) == 0) && --n)
sys/dev/ic/dwhdmi.c
271
int off, n, retry;
sys/dev/ic/dwhdmi.c
299
for (n = 0; n < len; n++) {
sys/dev/ic/dwhdmi.c
300
dwhdmi_write(sc, HDMI_I2CM_ADDRESS, n + off);
sys/dev/ic/dwhdmi.c
318
pbuf[n] = dwhdmi_read(sc, HDMI_I2CM_DATAI);
sys/dev/ic/dwhdmi.c
405
u_int n;
sys/dev/ic/dwhdmi.c
407
for (n = 0; n < nitems(match); n++)
sys/dev/ic/dwhdmi.c
408
if (match[n] == vic)
sys/dev/ic/dwhdmi.c
474
u_int n, iter;
sys/dev/ic/dwhdmi.c
493
for (n = 0; n < iter; n++)
sys/dev/ic/dwhdmi.c
508
u_int n;
sys/dev/ic/dwhdmi.c
513
n = 6864;
sys/dev/ic/dwhdmi.c
516
n = 11648;
sys/dev/ic/dwhdmi.c
519
n = 5824;
sys/dev/ic/dwhdmi.c
522
n = 6144;
sys/dev/ic/dwhdmi.c
532
dwhdmi_write(sc, HDMI_AUD_N1, n & 0xff);
sys/dev/ic/dwhdmi.c
533
dwhdmi_write(sc, HDMI_AUD_N2, (n >> 8) & 0xff);
sys/dev/ic/dwhdmi.c
534
dwhdmi_write(sc, HDMI_AUD_N3, (n >> 16) & 0xff);
sys/dev/ic/dwqe.c
1289
int n;
sys/dev/ic/dwqe.c
1294
for (n = 0; n < 30000; n++) {
sys/dev/ic/dwqe.c
510
int n;
sys/dev/ic/dwqe.c
519
for (n = 0; n < 2000; n++) {
sys/dev/ic/dwqe.c
533
int n;
sys/dev/ic/dwqe.c
543
for (n = 0; n < 2000; n++) {
sys/dev/ic/gem.c
1291
int n;
sys/dev/ic/gem.c
1304
for (n = 0; n < 100; n++) {
sys/dev/ic/gem.c
1321
int n;
sys/dev/ic/gem.c
1337
for (n = 0; n < 100; n++) {
sys/dev/ic/gemvar.h
231
#define GEM_CDTXSYNC(sc, x, n, ops) \
sys/dev/ic/gemvar.h
236
__n = (n); \
sys/dev/ic/hme.c
1027
int n;
sys/dev/ic/hme.c
1057
for (n = 0; n < 100; n++) {
sys/dev/ic/hme.c
377
int n;
sys/dev/ic/hme.c
398
for (n = 0; n < 20; n++) {
sys/dev/ic/hme.c
404
if (n >= 20)
sys/dev/ic/hme.c
408
for (n = 0; n < HME_TX_RING_SIZE; n++) {
sys/dev/ic/hme.c
409
if (sc->sc_txd[n].sd_mbuf != NULL) {
sys/dev/ic/hme.c
410
bus_dmamap_sync(sc->sc_dmatag, sc->sc_txd[n].sd_map,
sys/dev/ic/hme.c
411
0, sc->sc_txd[n].sd_map->dm_mapsize,
sys/dev/ic/hme.c
413
bus_dmamap_unload(sc->sc_dmatag, sc->sc_txd[n].sd_map);
sys/dev/ic/hme.c
414
m_freem(sc->sc_txd[n].sd_mbuf);
sys/dev/ic/hme.c
415
sc->sc_txd[n].sd_mbuf = NULL;
sys/dev/ic/hme.c
420
for (n = 0; n < HME_RX_RING_SIZE; n++) {
sys/dev/ic/hme.c
421
if (sc->sc_rxd[n].sd_mbuf != NULL) {
sys/dev/ic/hme.c
422
bus_dmamap_sync(sc->sc_dmatag, sc->sc_rxd[n].sd_map,
sys/dev/ic/hme.c
423
0, sc->sc_rxd[n].sd_map->dm_mapsize,
sys/dev/ic/hme.c
425
bus_dmamap_unload(sc->sc_dmatag, sc->sc_rxd[n].sd_map);
sys/dev/ic/hme.c
426
m_freem(sc->sc_rxd[n].sd_mbuf);
sys/dev/ic/hme.c
427
sc->sc_rxd[n].sd_mbuf = NULL;
sys/dev/ic/hme.c
971
int n;
sys/dev/ic/hme.c
999
for (n = 0; n < 100; n++) {
sys/dev/ic/i82596.c
1426
int n, r, ptr = sc->buf_area; /* memory pool */
sys/dev/ic/i82596.c
1461
n = sc->buf_area_sz - (ptr - sc->buf_area);
sys/dev/ic/i82596.c
1466
sc->nframes = n / r;
sys/dev/ic/i82596.c
1495
for (n = 0; n < sc->nframes; n++) {
sys/dev/ic/i82596.c
1496
int m = (n == sc->nframes - 1) ? 0 : n + 1;
sys/dev/ic/i82596.c
1499
sc->ie_bus_write16(sc, IE_RFRAME_STATUS(sc->rframes,n), 0);
sys/dev/ic/i82596.c
1502
sc->ie_bus_write16(sc, IE_RFRAME_BUFDESC(sc->rframes,n),
sys/dev/ic/i82596.c
1506
sc->ie_bus_write16(sc, IE_RFRAME_NEXT(sc->rframes,n),
sys/dev/ic/i82596.c
1510
sc->ie_bus_write16(sc, IE_RFRAME_LAST(sc->rframes,n),
sys/dev/ic/i82596.c
1517
for (n = 0; n < sc->nrxbuf; n++) {
sys/dev/ic/i82596.c
1518
int m = (n == sc->nrxbuf - 1) ? 0 : n + 1;
sys/dev/ic/i82596.c
1521
sc->ie_bus_write16(sc, IE_RBD_STATUS(sc->rbds,n), 0);
sys/dev/ic/i82596.c
1524
sc->ie_bus_write16(sc, IE_RBD_NEXT(sc->rbds,n),
sys/dev/ic/i82596.c
1528
sc->ie_bus_write24(sc, IE_RBD_BUFADDR(sc->rbds, n),
sys/dev/ic/i82596.c
1529
sc->sc_maddr + IE_RBUF_ADDR(sc, n));
sys/dev/ic/i82596.c
1530
sc->ie_bus_write16(sc, IE_RBD_BUFLEN(sc->rbds,n),
sys/dev/ic/i82596.c
1537
for (n = 0; n < NTXBUF; n++) {
sys/dev/ic/i82596.c
1538
(sc->ie_bus_write16)(sc, IE_CMD_NOP_STATUS(sc->nop_cmds, n), 0);
sys/dev/ic/i82596.c
1540
(sc->ie_bus_write16)(sc, IE_CMD_NOP_CMD(sc->nop_cmds, n),
sys/dev/ic/i82596.c
1543
(sc->ie_bus_write16)(sc, IE_CMD_NOP_LINK(sc->nop_cmds, n),
sys/dev/ic/i82596.c
1544
IE_CMD_NOP_ADDR(sc->nop_cmds, n));
sys/dev/ic/i82596.c
1945
print_rbd(struct ie_softc *sc, int n)
sys/dev/ic/i82596.c
1949
"length/EOL %04x\n", IE_RBD_ADDR(sc->rbds,n),
sys/dev/ic/i82596.c
1950
sc->ie_bus_read16(sc, IE_RBD_STATUS(sc->rbds,n)), IE_STAT_BITS,
sys/dev/ic/i82596.c
1951
sc->ie_bus_read16(sc, IE_RBD_NEXT(sc->rbds,n)),
sys/dev/ic/i82596.c
1953
sc->ie_bus_read16(sc, IE_RBD_BUFLEN(sc->rbds,n)));
sys/dev/ic/i82596.c
900
int n, off, val;
sys/dev/ic/i82596.c
902
for (n = 0; n < sc->nrxbuf; n++) {
sys/dev/ic/i82596.c
903
off = IE_RBD_BUFLEN(sc->rbds, n);
sys/dev/ic/i82596.c
905
if ((n == sc->rbtail) ^ ((val & IE_RBD_EOL) != 0)) {
sys/dev/ic/i82596.c
909
sc->sc_dev.dv_xname, n);
sys/dev/ic/i82596.c
916
for (n = 0; n < sc->nframes; n++) {
sys/dev/ic/i82596.c
917
off = IE_RFRAME_LAST(sc->rframes, n);
sys/dev/ic/i82596.c
919
if ((n == sc->rftail) ^ ((val & (IE_FD_EOL|IE_FD_SUSP)) != 0)) {
sys/dev/ic/i82596.c
923
sc->sc_dev.dv_xname, n);
sys/dev/ic/if_wi_hostap.c
1184
int s, error = 0, n, flag;
sys/dev/ic/if_wi_hostap.c
1280
n = 0;
sys/dev/ic/if_wi_hostap.c
1283
while (sta && reqall.size >= n+sizeof(struct hostap_sta)) {
sys/dev/ic/if_wi_hostap.c
1292
error = copyout(&stabuf, (caddr_t) reqall.addr + n,
sys/dev/ic/if_wi_hostap.c
1298
n += sizeof(struct hostap_sta);
sys/dev/ic/if_wi_hostap.c
1309
na->na_nodes = n = 0;
sys/dev/ic/if_wi_hostap.c
1313
n + sizeof(struct ieee80211_nodereq)) {
sys/dev/ic/if_wi_hostap.c
1334
error = copyout(&nr, (caddr_t)na->na_node + n,
sys/dev/ic/if_wi_hostap.c
1338
n += sizeof(struct ieee80211_nodereq);
sys/dev/ic/lance.c
330
struct mbuf *n;
sys/dev/ic/lance.c
333
for (; m; m = n) {
sys/dev/ic/lance.c
336
n = m_free(m);
sys/dev/ic/lance.c
342
n = m_free(m);
sys/dev/ic/lm78.c
699
lm_refresh_volt(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
701
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
704
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
706
sensor->value *= sc->lm_sensors[n].rfact;
sys/dev/ic/lm78.c
711
lm_refresh_temp(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
713
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
720
sdata = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
733
lm_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
735
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
745
if (sc->lm_sensors[n].reg == LM_FAN1 ||
sys/dev/ic/lm78.c
746
sc->lm_sensors[n].reg == LM_FAN2) {
sys/dev/ic/lm78.c
748
if (sc->lm_sensors[n].reg == LM_FAN1)
sys/dev/ic/lm78.c
754
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
785
wb_w83637hf_refresh_vcore(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
787
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
790
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
805
wb_refresh_nvolt(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
807
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
810
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
812
sensor->value *= sc->lm_sensors[n].rfact;
sys/dev/ic/lm78.c
818
wb_w83627ehf_refresh_nvolt(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
820
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
823
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
831
wb_refresh_temp(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
833
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
843
sdata = sc->lm_readreg(sc, sc->lm_sensors[n].reg) << 1;
sys/dev/ic/lm78.c
844
sdata += sc->lm_readreg(sc, sc->lm_sensors[n].reg + 1) >> 7;
sys/dev/ic/lm78.c
857
wb_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
859
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
867
if (sc->lm_sensors[n].reg == LM_FAN1 ||
sys/dev/ic/lm78.c
868
sc->lm_sensors[n].reg == LM_FAN2 ||
sys/dev/ic/lm78.c
869
sc->lm_sensors[n].reg == LM_FAN3) {
sys/dev/ic/lm78.c
871
fan = (sc->lm_sensors[n].reg - LM_FAN1);
sys/dev/ic/lm78.c
876
if (sc->lm_sensors[n].reg == LM_FAN1 ||
sys/dev/ic/lm78.c
877
sc->lm_sensors[n].reg == LM_FAN2) {
sys/dev/ic/lm78.c
879
if (sc->lm_sensors[n].reg == LM_FAN1)
sys/dev/ic/lm78.c
883
} else if (sc->lm_sensors[n].reg == LM_FAN3) {
sys/dev/ic/lm78.c
886
} else if (sc->lm_sensors[n].reg == WB_BANK0_FAN4 ||
sys/dev/ic/lm78.c
887
sc->lm_sensors[n].reg == WB_BANK0_FAN5) {
sys/dev/ic/lm78.c
889
if (sc->lm_sensors[n].reg == WB_BANK0_FAN4)
sys/dev/ic/lm78.c
895
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
906
wb_nct6776f_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
908
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
911
datah = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
912
datal = sc->lm_readreg(sc, sc->lm_sensors[n].reg + 1);
sys/dev/ic/lm78.c
924
wb_w83792d_refresh_fanrpm(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
926
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
929
switch (sc->lm_sensors[n].reg) {
sys/dev/ic/lm78.c
956
data = sc->lm_readreg(sc, sc->lm_sensors[n].reg);
sys/dev/ic/lm78.c
969
as_refresh_temp(struct lm_softc *sc, int n)
sys/dev/ic/lm78.c
971
struct ksensor *sensor = &sc->sensors[n];
sys/dev/ic/lm78.c
978
sdata = sc->lm_readreg(sc, sc->lm_sensors[n].reg) << 1;
sys/dev/ic/lm78.c
979
sdata += sc->lm_readreg(sc, sc->lm_sensors[n].reg + 1) >> 7;
sys/dev/ic/lpt.c
359
size_t n;
sys/dev/ic/lpt.c
362
while ((n = ulmin(LPT_BSIZE, uio->uio_resid)) != 0) {
sys/dev/ic/lpt.c
364
error = uiomove(sc->sc_cp, n, uio);
sys/dev/ic/lpt.c
367
sc->sc_count = n;
sys/dev/ic/mfivar.h
25
#define DNPRINTF(n,x...) do { if (mfi_debug & n) printf(x); } while(0)
sys/dev/ic/mfivar.h
36
#define DNPRINTF(n,x...)
sys/dev/ic/mpivar.h
26
#define DNPRINTF(n,x...) do { if (mpi_debug & (n)) printf(x); } while(0)
sys/dev/ic/mpivar.h
40
#define DNPRINTF(n,x...)
sys/dev/ic/ncr53c9x.c
1234
int i, n;
sys/dev/ic/ncr53c9x.c
1254
n = NCR_READ_REG(sc, NCR_FFLAG) & NCRFIFO_FF;
sys/dev/ic/ncr53c9x.c
1257
n *= 2;
sys/dev/ic/ncr53c9x.c
1259
for (i = 0; i < n; i++)
sys/dev/ic/ncr53c9x.c
1272
for (i = 0; i < n; i++)
sys/dev/ic/ncr53c9xvar.h
125
int n = strlen((ecb)->trace); \
sys/dev/ic/ncr53c9xvar.h
126
if (n < (sizeof((ecb)->trace)-100)) \
sys/dev/ic/ncr53c9xvar.h
127
snprintf((ecb)->trace + n, sizeof((ecb)->trace) - n, f, a, b); \
sys/dev/ic/oosiop.c
470
int i, n, off;
sys/dev/ic/oosiop.c
487
n = 0;
sys/dev/ic/oosiop.c
489
xfer->datain_scr[n * 2 + 0] =
sys/dev/ic/oosiop.c
492
xfer->datain_scr[n * 2 + 1] =
sys/dev/ic/oosiop.c
495
n++;
sys/dev/ic/oosiop.c
499
xfer->datain_scr[n * 2 + 0] = htole32(0x80080000);
sys/dev/ic/oosiop.c
500
xfer->datain_scr[n * 2 + 1] =
sys/dev/ic/oosiop.c
504
n = 0;
sys/dev/ic/oosiop.c
506
xfer->dataout_scr[n * 2 + 0] =
sys/dev/ic/oosiop.c
509
xfer->dataout_scr[n * 2 + 1] =
sys/dev/ic/oosiop.c
512
n++;
sys/dev/ic/oosiop.c
516
xfer->dataout_scr[n * 2 + 0] = htole32(0x80080000);
sys/dev/ic/oosiop.c
517
xfer->dataout_scr[n * 2 + 1] =
sys/dev/ic/oosiop.c
596
u_int32_t dsp, dbc, n, i, len;
sys/dev/ic/oosiop.c
607
n = dsp - cb->xferdma->dm_segs[0].ds_addr - 8;
sys/dev/ic/oosiop.c
608
if (n >= offsetof(struct oosiop_xfer, datain_scr[0]) &&
sys/dev/ic/oosiop.c
609
n < offsetof(struct oosiop_xfer, datain_scr[OOSIOP_NSG * 2])) {
sys/dev/ic/oosiop.c
610
n -= offsetof(struct oosiop_xfer, datain_scr[0]);
sys/dev/ic/oosiop.c
611
n >>= 3;
sys/dev/ic/oosiop.c
614
for (i = 0; i <= n; i++)
sys/dev/ic/oosiop.c
620
} else if (n >= offsetof(struct oosiop_xfer, dataout_scr[0]) &&
sys/dev/ic/oosiop.c
621
n < offsetof(struct oosiop_xfer, dataout_scr[OOSIOP_NSG * 2])) {
sys/dev/ic/oosiop.c
622
n -= offsetof(struct oosiop_xfer, dataout_scr[0]);
sys/dev/ic/oosiop.c
623
n >>= 3;
sys/dev/ic/oosiop.c
626
for (i = 0; i <= n; i++)
sys/dev/ic/osiop.c
1379
long n = osiop_read_4(sc, OSIOP_TEMP) - scraddr;
sys/dev/ic/osiop.c
1385
sc->sc_dev.dv_xname, n,
sys/dev/ic/osiop.c
1388
if (n < Ent_datain)
sys/dev/ic/osiop.c
1389
n = (n - Ent_dataout) / 16;
sys/dev/ic/osiop.c
1391
n = (n - Ent_datain) / 16;
sys/dev/ic/osiop.c
1392
if (n < 0 || n >= OSIOP_NSG)
sys/dev/ic/osiop.c
1393
printf("TEMP invalid %ld\n", n);
sys/dev/ic/osiop.c
1395
acb->curaddr = ds->data[n].addr;
sys/dev/ic/osiop.c
1396
acb->curlen = ds->data[n].count;
sys/dev/ic/osiop.c
1401
sc->sc_dev.dv_xname, n);
sys/dev/ic/pcdisplay_subr.c
281
bus_size_t off, count, n;
sys/dev/ic/pcdisplay_subr.c
294
for (n = 0; n < count; n++)
sys/dev/ic/pcdisplay_subr.c
295
scr->mem[off + n] = val;
sys/dev/ic/pgt.c
2385
unsigned int i, n;
sys/dev/ic/pgt.c
2397
n = 0;
sys/dev/ic/pgt.c
2402
ap.wi_srates[n++] = ap.wi_rate = rs->rs_rates[i];
sys/dev/ic/pgt.c
2403
if (n >= sizeof(ap.wi_srates) / sizeof(ap.wi_srates[0]))
sys/dev/ic/pgt.c
910
unsigned int n;
sys/dev/ic/pgt.c
989
n = ieee80211_mhz2ieee(letoh32(pha->pra_frequency), 0);
sys/dev/ic/pgt.c
990
if (n <= IEEE80211_CHAN_MAX)
sys/dev/ic/pgt.c
991
chan = &ic->ic_channels[n];
sys/dev/ic/qla.c
2152
qla_dump_iocb_segs(struct qla_softc *sc, void *segs, int n)
sys/dev/ic/qla.c
2161
for (s = 0; s < n; s++) {
sys/dev/ic/qlw.c
1252
qlw_dump_iocb_segs(struct qlw_softc *sc, void *segs, int n)
sys/dev/ic/qlw.c
1260
for (s = 0; s < n; s++) {
sys/dev/ic/qwx.c
20440
int i, j, n;
sys/dev/ic/qwx.c
20443
n = qwx_dp_process_rx_err(sc, 1);
sys/dev/ic/qwx.c
20444
} while (n > 0);
sys/dev/ic/qwx.c
20447
n = qwx_dp_rx_process_wbm_err(sc, 1);
sys/dev/ic/qwx.c
20448
} while (n > 0);
sys/dev/ic/qwx.c
20451
n = qwx_dp_process_reo_status(sc, 1);
sys/dev/ic/qwx.c
20452
} while (n > 0);
sys/dev/ic/qwx.c
20456
n = qwx_dp_process_rx(sc, i, 1);
sys/dev/ic/qwx.c
20457
} while (n > 0);
sys/dev/ic/qwx.c
20465
n = qwx_dp_process_rxdma_err(sc, mac_id, 1);
sys/dev/ic/qwx.c
20466
} while (n > 0);
sys/dev/ic/qwx.c
20468
n = qwx_dp_rx_reap_mon_status_ring(sc,
sys/dev/ic/qwx.c
20471
} while (n > 0);
sys/dev/ic/qwx.c
26316
int i, n;
sys/dev/ic/qwx.c
26366
for (i = 0, n = 0, max_nss = 0; i < nitems(ni->ni_rxmcs) * 8; i++)
sys/dev/ic/qwx.c
26370
arg->peer_ht_rates.rates[n++] = i;
sys/dev/ic/qwx.c
26381
if (n == 0) {
sys/dev/ic/qwx.c
26386
arg->peer_ht_rates.num_rates = n;
sys/dev/ic/qwxvar.h
38
#define DNPRINTF(n,x...) do { if (qwx_debug & n) printf(x); } while(0)
sys/dev/ic/qwxvar.h
51
#define DNPRINTF(n,x...)
sys/dev/ic/qwzvar.h
38
#define DNPRINTF(n,x...) do { if (qwz_debug & n) printf(x); } while(0)
sys/dev/ic/qwzvar.h
51
#define DNPRINTF(n,x...)
sys/dev/ic/rt2560.c
61
#define DPRINTFN(n, x) do { if (rt2560_debug >= (n)) printf x; } while (0)
sys/dev/ic/rt2560.c
65
#define DPRINTFN(n, x)
sys/dev/ic/rt2560.c
820
int n;
sys/dev/ic/rt2560.c
840
n = (RAL_READ(sc, RT2560_CSR21) & RT2560_93C46) ? 5 : 7;
sys/dev/ic/rt2560.c
841
for (; n >= 0; n--) {
sys/dev/ic/rt2560.c
843
(((addr >> n) & 1) << RT2560_SHIFT_D));
sys/dev/ic/rt2560.c
845
(((addr >> n) & 1) << RT2560_SHIFT_D) | RT2560_C);
sys/dev/ic/rt2560.c
852
for (n = 15; n >= 0; n--) {
sys/dev/ic/rt2560.c
855
val |= ((tmp & RT2560_Q) >> RT2560_SHIFT_Q) << n;
sys/dev/ic/rt2661.c
1013
n = (RAL_READ(sc, RT2661_E2PROM_CSR) & RT2661_93C46) ? 5 : 7;
sys/dev/ic/rt2661.c
1014
for (; n >= 0; n--) {
sys/dev/ic/rt2661.c
1016
(((addr >> n) & 1) << RT2661_SHIFT_D));
sys/dev/ic/rt2661.c
1018
(((addr >> n) & 1) << RT2661_SHIFT_D) | RT2661_C);
sys/dev/ic/rt2661.c
1025
for (n = 15; n >= 0; n--) {
sys/dev/ic/rt2661.c
1028
val |= ((tmp & RT2661_Q) >> RT2661_SHIFT_Q) << n;
sys/dev/ic/rt2661.c
65
#define DPRINTFN(n, x) do { if (rt2661_debug >= (n)) printf x; } while (0)
sys/dev/ic/rt2661.c
69
#define DPRINTFN(n, x)
sys/dev/ic/rt2661.c
993
int n;
sys/dev/ic/rt2860.c
1093
int n;
sys/dev/ic/rt2860.c
1113
n = ((RAL_READ(sc, RT2860_PCI_EECTRL) & 0x30) == 0) ? 5 : 7;
sys/dev/ic/rt2860.c
1114
for (; n >= 0; n--) {
sys/dev/ic/rt2860.c
1116
(((addr >> n) & 1) << RT2860_SHIFT_D));
sys/dev/ic/rt2860.c
1118
(((addr >> n) & 1) << RT2860_SHIFT_D) | RT2860_C);
sys/dev/ic/rt2860.c
1125
for (n = 15; n >= 0; n--) {
sys/dev/ic/rt2860.c
1128
val |= ((tmp & RT2860_Q) >> RT2860_SHIFT_Q) << n;
sys/dev/ic/rt2860.c
192
uint8_t n, r, k;
sys/dev/ic/rt2860.c
2292
rt3090_rf_write(sc, 2, rt3090_freqs[i].n);
sys/dev/ic/rt2860.c
2358
rt3090_rf_write(sc, 8, rt3090_freqs[i].n);
sys/dev/ic/rt2860.c
64
#define DPRINTFN(n, x) do { if (rt2860_debug >= (n)) printf x; } while (0)
sys/dev/ic/rt2860.c
68
#define DPRINTFN(n, x)
sys/dev/ic/rtsx.c
145
#define DPRINTF(n,s) do { if ((n) <= rtsxdebug) printf s; } while (0)
sys/dev/ic/rtsx.c
147
#define DPRINTF(n,s) do {} while(0)
sys/dev/ic/rtsx.c
583
rtsx_switch_sd_clock(struct rtsx_softc *sc, u_int8_t n, int div, int mcu)
sys/dev/ic/rtsx.c
597
RTSX_WRITE(sc, RTSX_SSC_DIV_N_0, n);
sys/dev/ic/rtsx.c
663
u_int8_t n;
sys/dev/ic/rtsx.c
688
n = 80; /* minimum */
sys/dev/ic/rtsx.c
694
n = 100;
sys/dev/ic/rtsx.c
700
n = 100;
sys/dev/ic/rtsx.c
713
error = rtsx_switch_sd_clock(sc, n, div, mcu);
sys/dev/ic/rtsx.c
890
rtsx_hostcmd(u_int32_t *cmdbuf, int *n, u_int8_t cmd, u_int16_t reg,
sys/dev/ic/rtsx.c
893
KASSERT(*n < RTSX_HOSTCMD_MAX);
sys/dev/ic/rtsx.c
895
cmdbuf[(*n)++] = htole32((u_int32_t)(cmd & 0x3) << 30) |
sys/dev/ic/rtw.c
4232
int n = freq / 4, nf = (freq % 4) * 2;
sys/dev/ic/rtw.c
4234
syna = LSHIFT(nf, SA2400_SYNA_NF_MASK) | LSHIFT(n, SA2400_SYNA_N_MASK);
sys/dev/ic/rtwn.c
2647
rtwn_iq_calib_run(struct rtwn_softc *sc, int n, uint16_t tx[2][2],
sys/dev/ic/rtwn.c
2676
if (n == 0) {
sys/dev/ic/rtwn.c
2695
if (n == 0) {
sys/dev/ic/rtwn.c
2809
"tx[1]=0x%x rx[0]=0x%x rx[1]=0x%x\n", __func__, n, chain,
sys/dev/ic/rtwn.c
2821
if (n != 0) {
sys/dev/ic/rtwn.c
2979
int n, valid;
sys/dev/ic/rtwn.c
2984
for (n = 0; n < RTWN_IQ_CAL_NRUN; n++) {
sys/dev/ic/rtwn.c
2985
rtwn_iq_calib_run(sc, n, tx[n], rx[n], ®s);
sys/dev/ic/rtwn.c
2987
if (n == 0)
sys/dev/ic/rtwn.c
2991
valid = rtwn_iq_calib_compare_results(tx[n - 1], rx[n - 1],
sys/dev/ic/rtwn.c
2992
tx[n], rx[n], sc->ntxchains);
sys/dev/ic/rtwn.c
2998
rtwn_iq_calib_write_results(sc, tx[n][0], rx[n][0], 0);
sys/dev/ic/rtwn.c
3000
rtwn_iq_calib_write_results(sc, tx[n][1], rx[n][1], 1);
sys/dev/ic/rtwn.c
86
#define DPRINTFN(n, x) do { if (rtwn_debug >= (n)) printf x; } while (0)
sys/dev/ic/rtwn.c
90
#define DPRINTFN(n, x)
sys/dev/ic/stireg.h
258
#define STI_DEP(n) \
sys/dev/ic/stireg.h
259
typedef int (*sti_##n##_t)( \
sys/dev/ic/stireg.h
260
sti_##n##flags_t, sti_##n##in_t, sti_##n##out_t, sti_cfg_t);
sys/dev/ic/tcic2reg.h
186
#define TCIC_PWR_VCC_N(n) (1<<((n))) /* VCCSEL for socket n */
sys/dev/ic/tcic2reg.h
187
#define TCIC_PWR_VPP_N(n) (1<<(3+(n))) /* VPPSEL for socket n */
sys/dev/ic/tcic2reg.h
80
#define TCIC_WR_MEXT_N(n) ((TCIC_WR_MEM_BASE+((n)<<TCIC_WR_MEM_SHFT))+0)
sys/dev/ic/tcic2reg.h
81
#define TCIC_WR_MBASE_N(n) ((TCIC_WR_MEM_BASE+((n)<<TCIC_WR_MEM_SHFT))+2)
sys/dev/ic/tcic2reg.h
82
#define TCIC_WR_MMAP_N(n) ((TCIC_WR_MEM_BASE+((n)<<TCIC_WR_MEM_SHFT))+4)
sys/dev/ic/tcic2reg.h
83
#define TCIC_WR_MCTL_N(n) ((TCIC_WR_MEM_BASE+((n)<<TCIC_WR_MEM_SHFT))+6)
sys/dev/ic/tcic2reg.h
87
#define TCIC_WR_IBASE_N(n) ((TCIC_WR_IO_BASE+((n)<<TCIC_WR_IO_SHFT))+0)
sys/dev/ic/tcic2reg.h
88
#define TCIC_WR_ICTL_N(n) ((TCIC_WR_IO_BASE+((n)<<TCIC_WR_IO_SHFT))+2)
sys/dev/ic/tcic2reg.h
92
#define TCIC_IR_SCF1_N(n) ((TCIC_IR_SCF_BASE+((n)<<TCIC_IR_SCF_SHFT))+0)
sys/dev/ic/tcic2reg.h
93
#define TCIC_IR_SCF2_N(n) ((TCIC_IR_SCF_BASE+((n)<<TCIC_IR_SCF_SHFT))+2)
sys/dev/ic/w83l518dreg.h
159
#define WB_INDEX_RESP(n) (0x1f + (n))
sys/dev/ic/xl.c
1026
int i, n;
sys/dev/ic/xl.c
1036
n = 0;
sys/dev/ic/xl.c
1038
n = i + 1;
sys/dev/ic/xl.c
1039
cd->xl_rx_chain[i].xl_next = &cd->xl_rx_chain[n];
sys/dev/ic/xl.c
1041
offsetof(struct xl_list_data, xl_rx_list[n]);
sys/dev/ic/xl.c
2413
u_int16_t n;
sys/dev/ic/xl.c
2416
n = CSR_READ_2(sc, 12);
sys/dev/ic/xl.c
2419
n |= 0x0010;
sys/dev/ic/xl.c
2422
n |= 0x4000;
sys/dev/ic/xl.c
2424
CSR_WRITE_2(sc, 12, n);
sys/dev/isa/ad1848.c
1237
int i, n, selected = -1;
sys/dev/isa/ad1848.c
1239
n = sizeof(speed_table) / sizeof(speed_struct);
sys/dev/isa/ad1848.c
1243
if (arg > speed_table[n - 1].speed)
sys/dev/isa/ad1848.c
1244
selected = n - 1;
sys/dev/isa/ad1848.c
1246
for (i = 1 /*really*/ ; selected == -1 && i < n; i++) {
sys/dev/isa/aps.c
177
int bp, stat, n;
sys/dev/isa/aps.c
183
for (n = 0; n < 100; n++) {
sys/dev/isa/aps.c
196
if (n == 100) {
sys/dev/isa/aps.c
206
for (n = 1, bp = 2; n < 16; bp <<= 1, n++) {
sys/dev/isa/aps.c
208
bus_space_write_1(iot, ioh, APS_TWR_BASE + n, buf[n]);
sys/dev/isa/aps.c
209
DPRINTF(("aps_do_io: write %2d 0x%02x\n", n, buf[n]));
sys/dev/isa/aps.c
213
for (n = 0; n < 100; n++) {
sys/dev/isa/aps.c
220
if (n == 100) {
sys/dev/isa/aps.c
229
for (n = 0, bp = 1; n < 16; bp <<= 1, n++) {
sys/dev/isa/aps.c
231
buf[n] = bus_space_read_1(iot, ioh, APS_TWR_BASE + n);
sys/dev/isa/aps.c
232
DPRINTF(("aps_do_io: read %2d 0x%02x\n", n, buf[n]));
sys/dev/isa/ast.c
188
#define TRY(n) \
sys/dev/isa/ast.c
189
if (bits & (1 << (n))) \
sys/dev/isa/ast.c
190
comintr(sc->sc_slaves[n]);
sys/dev/isa/boca.c
185
#define TRY(n) \
sys/dev/isa/boca.c
186
if (bits & (1 << (n))) \
sys/dev/isa/boca.c
187
comintr(sc->sc_slaves[n]);
sys/dev/isa/ess.c
94
#define DPRINTFN(n,x) if (essdebug>(n)) printf x
sys/dev/isa/ess.c
98
#define DPRINTFN(n,x)
sys/dev/isa/fd.c
192
int n;
sys/dev/isa/fd.c
218
n = fdcresult(fdc);
sys/dev/isa/fd.c
223
for (i = 0; i < n; i++)
sys/dev/isa/fd.c
234
if (!(fa->fa_flags & 0x20) && (n != 2 || (fdc->sc_status[0] & 0xf8) != 0x20))
sys/dev/isa/fd.c
521
int n;
sys/dev/isa/fd.c
529
for (n = 0; n < 4; n++)
sys/dev/isa/fd.c
530
if ((fd = fdc->sc_link.fdlink.sc_fd[n])
sys/dev/isa/fd.c
532
status |= FDO_MOEN(n);
sys/dev/isa/fdc.c
238
int j = 100000, n = 0;
sys/dev/isa/fdc.c
244
return n;
sys/dev/isa/fdc.c
246
if (n >= sizeof(fdc->sc_status)) {
sys/dev/isa/fdc.c
250
fdc->sc_status[n++] =
sys/dev/isa/fdc.c
289
fdcstatus(struct device *dv, int n, char *s)
sys/dev/isa/fdc.c
293
if (n == 0) {
sys/dev/isa/fdc.c
296
n = 2;
sys/dev/isa/fdc.c
301
switch (n) {
sys/dev/isa/fdreg.h
47
#define FDO_MOEN(n) ((1 << n) * 0x10) /* motor enable */
sys/dev/isa/fins.c
431
fins_get_volt(struct fins_softc *sc, int n)
sys/dev/isa/fins.c
433
struct ksensor *sensor = &sc->fins_ksensors[n];
sys/dev/isa/fins.c
434
const struct fins_sensor *fs = &sc->fins_sensors[n];
sys/dev/isa/fins.c
449
fins_get_temp(struct fins_softc *sc, int n)
sys/dev/isa/fins.c
451
struct ksensor *sensor = &sc->fins_ksensors[n];
sys/dev/isa/fins.c
452
const struct fins_sensor *fs = &sc->fins_sensors[n];
sys/dev/isa/fins.c
477
fins_refresh_offset(struct fins_softc *sc, int n)
sys/dev/isa/fins.c
479
struct ksensor *sensor = &sc->fins_ksensors[n];
sys/dev/isa/fins.c
480
const struct fins_sensor *fs = &sc->fins_sensors[n];
sys/dev/isa/fins.c
492
fins_get_rpm(struct fins_softc *sc, int n)
sys/dev/isa/fins.c
494
struct ksensor *sensor = &sc->fins_ksensors[n];
sys/dev/isa/fins.c
495
const struct fins_sensor *fs = &sc->fins_sensors[n];
sys/dev/isa/hsq.c
232
#define TRY(n) \
sys/dev/isa/hsq.c
233
if ( sc->sc_slaves[n] && bits & (1 << (n)) ) \
sys/dev/isa/hsq.c
234
comintr(sc->sc_slaves[n]);
sys/dev/isa/if_ie.c
1733
#define _ALLOC(p, n) (bzero(p, n), p += n, p - n)
sys/dev/isa/if_ie.c
1734
#define ALLOC(p, n) _ALLOC(p, ALIGN(n))
sys/dev/isa/isapnp.c
418
struct isa_attach_args *l = NULL, *n = NULL, *d;
sys/dev/isa/isapnp.c
427
if (n)
sys/dev/isa/isapnp.c
428
n->ipa_sibling = c;
sys/dev/isa/isapnp.c
432
n = c;
sys/dev/isa/isapnp.c
471
isapnp_print_region(const char *str, struct isapnp_region *r, size_t n)
sys/dev/isa/isapnp.c
475
if (n == 0)
sys/dev/isa/isapnp.c
479
for (i = 0; i < n; i++, r++) {
sys/dev/isa/isapnp.c
483
if (i != n - 1)
sys/dev/isa/isapnp.c
493
isapnp_print_pin(const char *str, struct isapnp_pin *p, size_t n)
sys/dev/isa/isapnp.c
497
if (n == 0)
sys/dev/isa/isapnp.c
501
for (i = 0; i < n; i++, p++) {
sys/dev/isa/isapnp.c
503
if (i != n - 1)
sys/dev/isa/mpu401.c
54
#define DPRINTFN(n,x) if (mpu401debug >= (n)) printf x
sys/dev/isa/mpu401.c
58
#define DPRINTFN(n,x)
sys/dev/isa/sbdsp.c
75
#define DPRINTFN(n,x) if (sbdspdebug >= (n)) printf x
sys/dev/isa/sbdsp.c
79
#define DPRINTFN(n,x)
sys/dev/isa/spkr.c
423
size_t n;
sys/dev/isa/spkr.c
433
n = ulmin(DEV_BSIZE, uio->uio_resid);
sys/dev/isa/spkr.c
434
error = uiomove(spkr_inbuf, n, uio);
sys/dev/isa/spkr.c
436
playstring((char *)spkr_inbuf, n);
sys/dev/isa/uguru.c
863
uguru_refresh_temp(struct uguru_softc *sc, int n)
sys/dev/isa/uguru.c
865
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/isa/uguru.c
869
ret = sc->read(sc, n);
sys/dev/isa/uguru.c
890
uguru_refresh_volt(struct uguru_softc *sc, int n)
sys/dev/isa/uguru.c
894
if (sc->read(sc, n))
sys/dev/isa/uguru.c
901
sc->sc_sensors[n].value =
sys/dev/isa/uguru.c
902
sc->cs.reading * sc->uguru_sensors[n].rfact;
sys/dev/isa/uguru.c
903
sc->sc_sensors[n].status = status;
sys/dev/isa/uguru.c
907
uguru_refresh_fan(struct uguru_softc *sc, int n)
sys/dev/isa/uguru.c
909
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/isa/uguru.c
912
ret = sc->read(sc, n);
sys/dev/isa/uguru.c
931
uguru_read_sensor(struct uguru_softc *sc, int n)
sys/dev/isa/uguru.c
933
struct ksensor *sensor = &sc->sc_sensors[n];
sys/dev/isa/uguru.c
936
uint8_t reg = sc->uguru_sensors[n].reg;
sys/dev/isa/uguru.c
972
uguru_ac5_read_sensor(struct uguru_softc *sc, int n)
sys/dev/isa/uguru.c
978
reg = sc->uguru_sensors[n].reg | 0x0880;
sys/dev/isa/viasioreg.h
157
#define VT1211_HM_UCHCONF_ISTEMP(v, n) (((v) & (1 << ((n) + 1))) != 0)
sys/dev/isa/viasioreg.h
162
#define VT1211_HM_ETR_UCH(v, n) (((v) >> (((n) - 2) * 2)) & 0x03)
sys/dev/microcode/siop/ncr53cxxx.c
788
int n;
sys/dev/microcode/siop/ncr53cxxx.c
809
n = *s++;
sys/dev/microcode/siop/ncr53cxxx.c
810
if (n >= '0' && n <= '9')
sys/dev/microcode/siop/ncr53cxxx.c
811
n -= '0';
sys/dev/microcode/siop/ncr53cxxx.c
812
else if (n >= 'a' && n <= 'f')
sys/dev/microcode/siop/ncr53cxxx.c
813
n -= 'a' - 10;
sys/dev/microcode/siop/ncr53cxxx.c
814
else if (n >= 'A' && n <= 'F')
sys/dev/microcode/siop/ncr53cxxx.c
815
n -= 'A' - 10;
sys/dev/microcode/siop/ncr53cxxx.c
819
n = 0;
sys/dev/microcode/siop/ncr53cxxx.c
821
if (n >= radix)
sys/dev/microcode/siop/ncr53cxxx.c
824
value = value * radix + n;
sys/dev/mii/urlphy.c
54
#define DPRINTFN(n,x) if (urlphydebug>(n)) printf x
sys/dev/mii/urlphy.c
58
#define DPRINTFN(n,x)
sys/dev/pci/arc.c
55
#define DNPRINTF(n, p...) do { if ((n) & arcdebug) printf(p); } while (0)
sys/dev/pci/arc.c
59
#define DNPRINTF(n, p...) /* n, p */
sys/dev/pci/autri.c
62
# define DPRINTFN(n,x) if (autridebug > (n)) printf x
sys/dev/pci/autri.c
66
# define DPRINTFN(n,x)
sys/dev/pci/azalia.c
1533
int err, addr, n, i, nspdif, nhdmi;
sys/dev/pci/azalia.c
1566
n = COP_START_NID(result);
sys/dev/pci/azalia.c
1568
XNAME(this->az), n, this->nfunctions));
sys/dev/pci/azalia.c
1571
err = azalia_comresp(this, n + i, CORB_GET_PARAMETER,
sys/dev/pci/azalia.c
1577
this->audiofunc = n + i;
sys/dev/pci/azalia.c
3538
int i, n;
sys/dev/pci/azalia.c
3542
for (n = 0; n < this->dacs.groups[i].nconv; n++) {
sys/dev/pci/azalia.c
3543
printf(" %2.2x", this->dacs.groups[i].conv[n]);
sys/dev/pci/azalia.c
3549
for (n = 0; n < this->adcs.groups[i].nconv; n++) {
sys/dev/pci/azalia.c
3550
printf(" %2.2x", this->adcs.groups[i].conv[n]);
sys/dev/pci/azalia.c
80
# define DPRINTFN(n,x) do { if (az_debug > (n)) printf x; } while (0/*CONSTCOND*/)
sys/dev/pci/azalia.c
83
# define DPRINTFN(n,x) do {} while (0/*CONSTCOND*/)
sys/dev/pci/azalia.c
834
int i, n;
sys/dev/pci/azalia.c
851
for (i = 0, n = 0; i < HDA_MAX_CODECS; i++) {
sys/dev/pci/azalia.c
854
n++;
sys/dev/pci/azalia.c
857
az->ncodecs = n;
sys/dev/pci/azalia.c
868
for (i = 0, n = 0; n < az->ncodecs; i++) {
sys/dev/pci/azalia.c
870
az->codecs[n].address = i;
sys/dev/pci/azalia.c
871
az->codecs[n++].az = az;
sys/dev/pci/azalia_codec.c
1693
nid_t n;
sys/dev/pci/azalia_codec.c
1721
n = this->w[nid].connections[MI_TARGET_INAMP(target)];
sys/dev/pci/azalia_codec.c
1722
if (!azalia_widget_enabled(this, n)) {
sys/dev/pci/azalia_codec.c
1725
n = nid;
sys/dev/pci/azalia_codec.c
1728
n = nid;
sys/dev/pci/azalia_codec.c
1729
mc->un.value.num_channels = WIDGET_CHANNELS(&this->w[n]);
sys/dev/pci/azalia_codec.c
42
#define MIXER_DELTA(n) (AUDIO_MAX_GAIN / (n))
sys/dev/pci/cmpci.c
1108
struct cmpci_dmanode *n;
sys/dev/pci/cmpci.c
1111
n = malloc(sizeof(struct cmpci_dmanode), type, flags);
sys/dev/pci/cmpci.c
1112
if (n == NULL) {
sys/dev/pci/cmpci.c
1120
n->cd_tag = sc->sc_dmat;
sys/dev/pci/cmpci.c
1121
n->cd_size = size;
sys/dev/pci/cmpci.c
1122
error = bus_dmamem_alloc(n->cd_tag, n->cd_size,
sys/dev/pci/cmpci.c
1123
CMPCI_DMABUF_ALIGN, CMPCI_DMABUF_BOUNDARY, n->cd_segs,
sys/dev/pci/cmpci.c
1124
nitems(n->cd_segs), &n->cd_nsegs, w);
sys/dev/pci/cmpci.c
1127
error = bus_dmamem_map(n->cd_tag, n->cd_segs, n->cd_nsegs, n->cd_size,
sys/dev/pci/cmpci.c
1128
&n->cd_addr, w | BUS_DMA_COHERENT);
sys/dev/pci/cmpci.c
1131
error = bus_dmamap_create(n->cd_tag, n->cd_size, 1, n->cd_size, 0,
sys/dev/pci/cmpci.c
1132
w, &n->cd_map);
sys/dev/pci/cmpci.c
1135
error = bus_dmamap_load(n->cd_tag, n->cd_map, n->cd_addr, n->cd_size,
sys/dev/pci/cmpci.c
1140
n->cd_next = sc->sc_dmap;
sys/dev/pci/cmpci.c
1141
sc->sc_dmap = n;
sys/dev/pci/cmpci.c
1142
*r_addr = KVADDR(n);
sys/dev/pci/cmpci.c
1146
bus_dmamap_destroy(n->cd_tag, n->cd_map);
sys/dev/pci/cmpci.c
1148
bus_dmamem_unmap(n->cd_tag, n->cd_addr, n->cd_size);
sys/dev/pci/cmpci.c
1150
bus_dmamem_free(n->cd_tag,
sys/dev/pci/cmpci.c
1151
n->cd_segs, nitems(n->cd_segs));
sys/dev/pci/cmpci.c
1153
free(n, type, 0);
sys/dev/pci/cmpci.c
1165
struct cmpci_dmanode *n = *nnp;
sys/dev/pci/cmpci.c
1166
bus_dmamap_unload(n->cd_tag, n->cd_map);
sys/dev/pci/cmpci.c
1167
bus_dmamap_destroy(n->cd_tag, n->cd_map);
sys/dev/pci/cmpci.c
1168
bus_dmamem_unmap(n->cd_tag, n->cd_addr, n->cd_size);
sys/dev/pci/cmpci.c
1169
bus_dmamem_free(n->cd_tag, n->cd_segs,
sys/dev/pci/cmpci.c
1170
nitems(n->cd_segs));
sys/dev/pci/cmpci.c
1171
free(n, type, 0);
sys/dev/pci/cmpci.c
279
#define _RATE(n) { n, CMPCI_REG_RATE_ ## n }
sys/dev/pci/com_pci.c
121
m = n = HREAD4(sc, LPSS_CLK);
sys/dev/pci/com_pci.c
123
n = (n >> LPSS_CLK_NDIV_SHIFT) & LPSS_CLK_NDIV_MASK;
sys/dev/pci/com_pci.c
124
if (m && n) {
sys/dev/pci/com_pci.c
126
freq /= n;
sys/dev/pci/com_pci.c
83
uint64_t freq, m, n;
sys/dev/pci/cs4280.c
1395
int n;
sys/dev/pci/cs4280.c
1452
n = 0;
sys/dev/pci/cs4280.c
1455
if (++n > 1000) {
sys/dev/pci/cs4280.c
1466
n = 0;
sys/dev/pci/cs4280.c
1470
if (++n > 1000) {
sys/dev/pci/cs4280.c
1487
int n;
sys/dev/pci/cs4280.c
1519
n = 0;
sys/dev/pci/cs4280.c
1522
if (++n > 1000) {
sys/dev/pci/cs4280.c
1528
n = 0;
sys/dev/pci/cs4280.c
1531
if (++n > 1000) {
sys/dev/pci/cs4280.c
1595
int pd = 0, cnt, n;
sys/dev/pci/cs4280.c
1610
n = 0;
sys/dev/pci/cs4280.c
1613
if (++n > 1000) {
sys/dev/pci/cs4280.c
278
int n;
sys/dev/pci/cs4280.c
300
n = 0;
sys/dev/pci/cs4280.c
303
while (++n > 1000) {
sys/dev/pci/cs4280.c
336
int n;
sys/dev/pci/cs4280.c
338
n = 0;
sys/dev/pci/cs4280.c
341
if (++n > 1000)
sys/dev/pci/cs4280.c
61
#define DPRINTFN(n,x) if (cs4280debug>(n)) printf x
sys/dev/pci/cs4280.c
65
#define DPRINTFN(n,x)
sys/dev/pci/cs4280.c
922
int n;
sys/dev/pci/cs4280.c
941
n = 0;
sys/dev/pci/cs4280.c
944
if (++n > 1000) {
sys/dev/pci/cs4281.c
1008
n = 0;
sys/dev/pci/cs4281.c
1011
if (++n > 1000) {
sys/dev/pci/cs4281.c
1019
n = 0;
sys/dev/pci/cs4281.c
1022
if (++n > 1000)
sys/dev/pci/cs4281.c
1031
n = 0;
sys/dev/pci/cs4281.c
1034
if (++n > 1000) {
sys/dev/pci/cs4281.c
1046
n = 0;
sys/dev/pci/cs4281.c
1049
if (++n > 1000) {
sys/dev/pci/cs4281.c
1062
n = 0;
sys/dev/pci/cs4281.c
1065
if (++n > 1000) {
sys/dev/pci/cs4281.c
1201
int n;
sys/dev/pci/cs4281.c
1226
n = 0;
sys/dev/pci/cs4281.c
1229
while (++n > 1000) {
sys/dev/pci/cs4281.c
1324
int n;
sys/dev/pci/cs4281.c
1326
n = 0;
sys/dev/pci/cs4281.c
1329
if (++n > 1000)
sys/dev/pci/cs4281.c
186
#define DPRINTFN(n,x) if (cs4281_debug>(n)) printf x
sys/dev/pci/cs4281.c
190
#define DPRINTFN(n,x)
sys/dev/pci/cs4281.c
679
int n;
sys/dev/pci/cs4281.c
729
n = 0;
sys/dev/pci/cs4281.c
733
if (++n > 1000)
sys/dev/pci/cs4281.c
741
n = 0;
sys/dev/pci/cs4281.c
744
if (++n > 1000)
sys/dev/pci/cs4281.c
750
n = 0;
sys/dev/pci/cs4281.c
753
if (++n > 1000)
sys/dev/pci/cs4281.c
763
n = 0;
sys/dev/pci/cs4281.c
766
if (++n > 1000) {
sys/dev/pci/cs4281.c
778
n = 0;
sys/dev/pci/cs4281.c
781
if (++n > 1000) {
sys/dev/pci/cs4281.c
794
n = 0;
sys/dev/pci/cs4281.c
797
if (++n > 1000) {
sys/dev/pci/cs4281.c
818
for (n = 0; n < 32; ++n) {
sys/dev/pci/cs4281.c
832
for (n = 0; n < 32; ++n) {
sys/dev/pci/cs4281.c
985
int n;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
205
static void amdgpu_atif_parse_notification(struct amdgpu_atif_notifications *n, u32 mask)
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
207
n->thermal_state = mask & ATIF_THERMAL_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
208
n->forced_power_state = mask & ATIF_FORCED_POWER_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
209
n->system_power_state = mask & ATIF_SYSTEM_POWER_SOURCE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
210
n->brightness_change = mask & ATIF_PANEL_BRIGHTNESS_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
211
n->dgpu_display_event = mask & ATIF_DGPU_DISPLAY_EVENT_SUPPORTED;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
212
n->gpu_package_power_limit = mask & ATIF_GPU_PACKAGE_POWER_LIMIT_REQUEST_SUPPORTED;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
294
struct amdgpu_atif_notification_cfg *n = &atif->notification_cfg;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
321
n->enabled = false;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
322
n->command_code = 0;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
324
n->enabled = true;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
325
n->command_code = 0x81;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
331
n->enabled = true;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
332
n->command_code = params.command_code;
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
337
(n->enabled ? "enabled" : "disabled"),
sys/dev/pci/drm/amd/amdgpu/amdgpu_acpi.c
338
n->command_code);
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
53
int n, cts;
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
57
n = 128 * freq;
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
61
div = gcd(n, cts);
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
63
n /= div;
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
70
mul = ((128*freq/1000) + (n-1))/n;
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
72
n *= mul;
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
76
if (n < (128*freq/1500))
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
78
if (n > (128*freq/300))
sys/dev/pci/drm/amd/amdgpu/amdgpu_afmt.c
81
*N = n;
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
102
r = amdgpu_benchmark_do_move(adev, size, saddr, daddr, n, &time_ms);
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
106
amdgpu_benchmark_log_results(adev, n, size, time_ms,
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
32
uint64_t saddr, uint64_t daddr, int n, s64 *time_ms)
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
39
for (i = 0; i < n; i++) {
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
60
int n, unsigned size,
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
65
s64 throughput = (n * (size >> 10));
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
71
kind, n, size >> 10, sdomain, ddomain, time_ms,
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
82
int r, n;
sys/dev/pci/drm/amd/amdgpu/amdgpu_benchmark.c
84
n = AMDGPU_BENCHMARK_ITERATIONS;
sys/dev/pci/drm/amd/amdgpu/amdgpu_connectors.c
401
int n;
sys/dev/pci/drm/amd/amdgpu/amdgpu_connectors.c
420
n = ARRAY_SIZE(common_modes);
sys/dev/pci/drm/amd/amdgpu/amdgpu_connectors.c
422
for (i = 0; i < n; i++) {
sys/dev/pci/drm/amd/amdgpu/amdgpu_device.c
403
struct attribute *attr, int n)
sys/dev/pci/drm/amd/amdgpu/amdgpu_kms.c
841
unsigned int n, alloc_size;
sys/dev/pci/drm/amd/amdgpu/amdgpu_kms.c
897
n = copy_to_user(out, regs, min(size, alloc_size));
sys/dev/pci/drm/amd/amdgpu/amdgpu_kms.c
899
ret = (n ? -EFAULT : 0);
sys/dev/pci/drm/amd/amdgpu/amdgpu_xcp.c
1024
struct attribute *attr, int n)
sys/dev/pci/drm/amd/amdgpu/amdgpu_xcp.c
1052
static void amdgpu_xcp_sysfs_entries_fini(struct amdgpu_xcp_mgr *xcp_mgr, int n)
sys/dev/pci/drm/amd/amdgpu/amdgpu_xcp.c
1056
for (n--; n >= 0; n--) {
sys/dev/pci/drm/amd/amdgpu/amdgpu_xcp.c
1057
xcp = &xcp_mgr->xcp[n];
sys/dev/pci/drm/amd/amdgpu/amdgpu_xgmi.c
319
u32 i, n;
sys/dev/pci/drm/amd/amdgpu/amdgpu_xgmi.c
324
n = ARRAY_SIZE(smn_xgmi_6_4_pcs_state_hist1);
sys/dev/pci/drm/amd/amdgpu/amdgpu_xgmi.c
325
addr = smn_xgmi_6_4_pcs_state_hist1[global_link_num % n];
sys/dev/pci/drm/amd/amdgpu/amdgpu_xgmi.c
328
n = ARRAY_SIZE(smn_xgmi_6_4_1_pcs_state_hist1);
sys/dev/pci/drm/amd/amdgpu/amdgpu_xgmi.c
329
addr = smn_xgmi_6_4_1_pcs_state_hist1[global_link_num % n];
sys/dev/pci/drm/amd/amdgpu/amdgpu_xgmi.c
335
i = global_link_num / n;
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
622
int aer_cap, r, n;
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
647
for (n = 0; n < num_regs; n++) {
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
648
aqua_read_smn(adev, reg_data, start_addr + n * incrx);
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
713
int inst = 0, i, j, r, n;
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
745
for (n = 0; n < num_regs; n++) {
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
749
n * incrx,
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
787
int inst = 0, i, j, r, n;
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
818
for (n = 0; n < num_regs; n++) {
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
822
n * incrx,
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
900
int inst = 0, i, n, r, arr_size;
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
941
for (n = 0; n < num_regs; n++) {
sys/dev/pci/drm/amd/amdgpu/aqua_vanjaram.c
943
start_addr + n * incrx, i);
sys/dev/pci/drm/amd/amdgpu/atom.c
97
static void debug_print_spaces(int n)
sys/dev/pci/drm/amd/amdgpu/atom.c
99
while (n--)
sys/dev/pci/drm/amd/amdgpu/cikd.h
220
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/amd/amdgpu/cikd.h
222
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/cikd.h
229
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/amd/amdgpu/cikd.h
231
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/cikd.h
233
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/amd/amdgpu/nvd.h
39
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/amd/amdgpu/nvd.h
41
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/nvd.h
48
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/amd/amdgpu/nvd.h
50
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/nvd.h
52
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/amd/amdgpu/sid.h
327
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/amd/amdgpu/sid.h
329
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/sid.h
336
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/amd/amdgpu/sid.h
338
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/sid.h
340
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/amd/amdgpu/sid.h
557
#define DMA_PACKET(cmd, b, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/amd/amdgpu/sid.h
561
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/amd/amdgpu/sid.h
563
#define DMA_IB_PACKET(cmd, vmid, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/amd/amdgpu/sid.h
565
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/amd/amdgpu/sid.h
567
#define DMA_PTE_PDE_PACKET(n) ((2 << 28) | \
sys/dev/pci/drm/amd/amdgpu/sid.h
570
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/amd/amdgpu/soc15d.h
41
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/amd/amdgpu/soc15d.h
43
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/soc15d.h
50
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/amd/amdgpu/soc15d.h
52
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/soc15d.h
54
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/amd/amdgpu/vid.h
105
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/amd/amdgpu/vid.h
107
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdgpu/vid.h
109
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/amd/amdgpu/vid.h
96
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/amd/amdgpu/vid.h
98
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/amd/amdkfd/kfd_device_queue_manager.c
1397
struct device_process_node *n;
sys/dev/pci/drm/amd/amdkfd/kfd_device_queue_manager.c
1402
n = kzalloc(sizeof(*n), GFP_KERNEL);
sys/dev/pci/drm/amd/amdkfd/kfd_device_queue_manager.c
1403
if (!n)
sys/dev/pci/drm/amd/amdkfd/kfd_device_queue_manager.c
1406
n->qpd = qpd;
sys/dev/pci/drm/amd/amdkfd/kfd_device_queue_manager.c
1413
list_add(&n->list, &dqm->queues);
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
2812
struct cec_notifier *n = aconnector->notifier;
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
2814
if (!n)
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
2817
cec_notifier_phys_addr_invalidate(n);
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
2823
struct cec_notifier *n = aconnector->notifier;
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
2825
if (!n)
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
2828
cec_notifier_set_phys_addr(n,
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
8474
int n;
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
8497
n = ARRAY_SIZE(common_modes);
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm.c
8499
for (i = 0; i < n; i++) {
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
443
int n;
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
461
n = vsnprintf(NULL, 0, msg, args);
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
464
if (n <= 0)
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
468
total = log_ctx->pos + n + 1;
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
487
n = vscnprintf(
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
494
if (n > 0)
sys/dev/pci/drm/amd/display/amdgpu_dm/amdgpu_dm_helpers.c
495
log_ctx->pos += n;
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
225
int n = 27;
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
250
n * (n - 1)));
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
252
n -= 2;
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
253
} while (n > 2);
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
278
int n = 26;
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
287
(long long)n * (n - 1)));
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
289
n -= 2;
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
290
} while (n != 0);
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
304
unsigned int n = 9;
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
307
n + 2,
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
308
n + 1);
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
320
n));
sys/dev/pci/drm/amd/display/dc/basics/fixpt31_32.c
321
while (--n != 1);
sys/dev/pci/drm/amd/display/dc/dc_helper.c
107
uint32_t addr, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
118
while (i < n) {
sys/dev/pci/drm/amd/display/dc/dc_helper.c
222
uint32_t addr, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
232
set_reg_field_values(&field_value_mask, addr, n, shift1, mask1,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
250
uint32_t addr, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
259
set_reg_field_values(&field_value_mask, addr, n, shift1, mask1,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
507
uint32_t index, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
522
while (i < n) {
sys/dev/pci/drm/amd/display/dc/dc_helper.c
538
uint32_t index, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
551
while (i < n) {
sys/dev/pci/drm/amd/display/dc/dc_helper.c
568
uint32_t index, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
581
while (i < n) {
sys/dev/pci/drm/amd/display/dc/dc_helper.c
597
uint32_t index, int n,
sys/dev/pci/drm/amd/display/dc/dc_helper.c
612
while (i < n) {
sys/dev/pci/drm/amd/display/dc/dce120/dce120_timing_generator.c
42
#define CRTC_REG_UPDATE_N(reg_name, n, ...) \
sys/dev/pci/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/pci/drm/amd/display/dc/dce120/dce120_timing_generator.c
45
#define CRTC_REG_SET_N(reg_name, n, ...) \
sys/dev/pci/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/pci/drm/amd/display/dc/dio/dcn10/dcn10_link_encoder.c
1372
#define HPD_REG_UPDATE_N(reg_name, n, ...) \
sys/dev/pci/drm/amd/display/dc/dio/dcn10/dcn10_link_encoder.c
1375
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/dio/dcn10/dcn10_link_encoder.c
1403
#define AUX_REG_UPDATE_N(reg_name, n, ...) \
sys/dev/pci/drm/amd/display/dc/dio/dcn10/dcn10_link_encoder.c
1406
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/dm_services.h
120
uint32_t addr, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dc/dm_services.h
124
uint32_t addr, int n,
sys/dev/pci/drm/amd/display/dc/dm_services.h
157
#define generic_reg_update_soc15(ctx, inst_offset, reg_name, n, ...)\
sys/dev/pci/drm/amd/display/dc/dm_services.h
159
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/dm_services.h
161
#define generic_reg_set_soc15(ctx, inst_offset, reg_name, n, ...)\
sys/dev/pci/drm/amd/display/dc/dm_services.h
163
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
12884
unsigned int n;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
12891
for (n = 0; n < out->num_mcaches_plane0; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
12892
out->mcache_x_offsets_plane0[n] = dml_get_plane_array_mcache_offsets_plane0(mode_lib, plane_idx, n);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
12894
for (n = 0; n < out->num_mcaches_plane1; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
12895
out->mcache_x_offsets_plane1[n] = dml_get_plane_array_mcache_offsets_plane1(mode_lib, plane_idx, n);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
12975
unsigned int k, n;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
13290
for (n = 0; n < out->informative.non_optimized_mcache_allocation[k].num_mcaches_plane0; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
13291
out->informative.non_optimized_mcache_allocation[k].mcache_x_offsets_plane0[n] = dml_get_plane_array_mcache_offsets_plane0(mode_lib, k, n);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
13292
out->informative.non_optimized_mcache_allocation[k].global_mcache_ids_plane0[n] = k;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
13298
for (n = 0; n < out->informative.non_optimized_mcache_allocation[k].num_mcaches_plane1; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
13299
out->informative.non_optimized_mcache_allocation[k].mcache_x_offsets_plane1[n] = dml_get_plane_array_mcache_offsets_plane1(mode_lib, k, n);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
13300
out->informative.non_optimized_mcache_allocation[k].global_mcache_ids_plane1[n] = k;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2419
unsigned int n;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2581
for (n = 0; n < *p->num_mcaches_l - 1; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2582
p->mcache_offsets_l[n] = (unsigned int)(math_floor2((n + 1) * l->avg_mcache_element_size_l / l->mvmpg_access_width_l, 1)) * l->mvmpg_access_width_l;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2587
for (n = 0; n < *p->num_mcaches_c - 1; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2588
p->mcache_offsets_c[n] = (unsigned int)(math_floor2((n + 1) * l->avg_mcache_element_size_c / l->mvmpg_access_width_c, 1)) * l->mvmpg_access_width_c;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2593
for (n = 0; n < *p->num_mcaches_l; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2594
DML_LOG_VERBOSE("DML::%s: mcache_offsets_l[%u] = %u\n", __func__, n, p->mcache_offsets_l[n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2597
for (n = 0; n < *p->num_mcaches_c; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2598
DML_LOG_VERBOSE("DML::%s: mcache_offsets_c[%u] = %u\n", __func__, n, p->mcache_offsets_c[n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2605
for (n = 0; n < *p->num_mcaches_l - 1; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2606
p->mcache_offsets_l[n] = (n + 1) * l->mvmpg_per_mcache_lb_l * l->mvmpg_access_width_l;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2609
for (n = 0; n < *p->num_mcaches_c - 1; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2610
p->mcache_offsets_c[n] = (n + 1) * l->mvmpg_per_mcache_lb_c * l->mvmpg_access_width_c;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2614
for (n = 0; n < *p->num_mcaches_l; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2615
DML_LOG_VERBOSE("DML::%s: mcache_offsets_l[%u] = %u\n", __func__, n, p->mcache_offsets_l[n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2617
for (n = 0; n < *p->num_mcaches_c; n++)
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2618
DML_LOG_VERBOSE("DML::%s: mcache_offsets_c[%u] = %u\n", __func__, n, p->mcache_offsets_c[n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2758
unsigned int n, m;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2766
for (n = 0; n < dml2_core_internal_bw_max; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2767
avg_bandwidth_available[m][n] = dml_get_return_bandwidth_available(soc,
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2769
n, // bw_type
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2777
urg_bandwidth_available[m][n] = dml_get_return_bandwidth_available(soc, m, n, 0, HostVMEnable, 0, dcfclk_mhz, fclk_mhz, dram_bw_mbps);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2781
DML_LOG_VERBOSE("DML::%s: avg_bandwidth_available[%s][%s]=%f\n", __func__, dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n), avg_bandwidth_available[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2782
DML_LOG_VERBOSE("DML::%s: urg_bandwidth_available[%s][%s]=%f\n", __func__, dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n), urg_bandwidth_available[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2786
if (n == dml2_core_internal_bw_dram) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2787
urg_bandwidth_available_vm_only[m] = dml_get_return_bandwidth_available(soc, m, n, 0, HostVMEnable, 1, dcfclk_mhz, fclk_mhz, dram_bw_mbps);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2788
urg_bandwidth_available_pixel_and_vm[m] = dml_get_return_bandwidth_available(soc, m, n, 0, HostVMEnable, 0, dcfclk_mhz, fclk_mhz, dram_bw_mbps);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2798
DML_LOG_VERBOSE("DML::%s: urg_bandwidth_available_vm_only[%s]=%f\n", __func__, dml2_core_internal_soc_state_type_str(m), urg_bandwidth_available_vm_only[n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2817
unsigned int n, m, k;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2824
for (n = 0; n < dml2_core_internal_bw_max; n++) { // sdp, dram
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
2825
avg_bandwidth_required[m][n] = 0;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6096
unsigned int n;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6114
for (n = 0; n < dml2_core_internal_bw_max; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6119
n,
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6149
p->surface_avg_vactive_required_bw[m][n],
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6150
p->surface_peak_required_bw[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6152
p->urg_vactive_bandwidth_required[m][n] = get_urgent_bandwidth_required(
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6156
n,
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6187
p->surface_peak_required_bw[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6189
p->urg_bandwidth_required[m][n] = get_urgent_bandwidth_required(
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6193
n,
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6224
p->surface_peak_required_bw[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6226
p->urg_bandwidth_required_qual[m][n] = get_urgent_bandwidth_required(
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6230
n,
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6261
p->surface_peak_required_bw[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6263
p->non_urg_bandwidth_required[m][n] = get_urgent_bandwidth_required(
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6267
n,
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6298
p->surface_peak_required_bw[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6301
DML_LOG_VERBOSE("DML::%s: urg_vactive_bandwidth_required%s[%s][%s]=%f\n", __func__, (p->inc_flip_bw ? "_flip" : ""), dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n), p->urg_vactive_bandwidth_required[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6302
DML_LOG_VERBOSE("DML::%s: urg_bandwidth_required%s[%s][%s]=%f\n", __func__, (p->inc_flip_bw ? "_flip" : ""), dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n), p->urg_bandwidth_required[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6303
DML_LOG_VERBOSE("DML::%s: urg_bandwidth_required_qual[%s][%s]=%f\n", __func__, dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n), p->urg_bandwidth_required[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6304
DML_LOG_VERBOSE("DML::%s: non_urg_bandwidth_required%s[%s][%s]=%f\n", __func__, (p->inc_flip_bw ? "_flip" : ""), dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n), p->non_urg_bandwidth_required[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6306
DML_ASSERT(p->urg_bandwidth_required[m][n] >= p->non_urg_bandwidth_required[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6378
for (unsigned int n = 0; n < dml2_core_internal_bw_max; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6380
__func__, dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n),
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6381
urg_bandwidth_available[m][n], (urg_bandwidth_available[m][n] < urg_bandwidth_required[m][n]) ? "<" : ">=", urg_bandwidth_required[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6428
for (unsigned int n = 0; n < dml2_core_internal_bw_max; n++) { // check sdp and dram
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6429
*flip_bandwidth_support_ok &= urg_bandwidth_available[eval_state][n] >= urg_bandwidth_required_flip[eval_state][n];
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6432
DML_LOG_VERBOSE("DML::%s: n = %s\n", __func__, dml2_core_internal_bw_type_str(n));
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6433
DML_LOG_VERBOSE("DML::%s: urg_bandwidth_available = %f\n", __func__, urg_bandwidth_available[eval_state][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6434
DML_LOG_VERBOSE("DML::%s: non_urg_bandwidth_required_flip = %f\n", __func__, non_urg_bandwidth_required_flip[eval_state][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6435
DML_LOG_VERBOSE("DML::%s: urg_bandwidth_required_flip = %f\n", __func__, urg_bandwidth_required_flip[eval_state][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6438
DML_ASSERT(urg_bandwidth_required_flip[eval_state][n] >= non_urg_bandwidth_required_flip[eval_state][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6452
for (unsigned int n = 0; n < dml2_core_internal_bw_max; n++) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6454
__func__, dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n),
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
6455
urg_bandwidth_available[m][n], (urg_bandwidth_available[m][n] < urg_bandwidth_required_flip[m][n]) ? "<" : ">=", urg_bandwidth_required_flip[m][n]);
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
7941
unsigned int k, m, n;
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
9452
for (n = 0; n < dml2_core_internal_bw_max; n++) { // check sdp and dram
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
9453
if (!mode_lib->ms.support.avg_bandwidth_support_ok[m][n] && (m == dml2_core_internal_soc_state_sys_active || mode_lib->soc.mall_allocated_for_dcn_mbytes > 0)) {
sys/dev/pci/drm/amd/display/dc/dml2/dml21/src/dml2_core/dml2_core_dcn4_calcs.c
9456
DML_LOG_VERBOSE("DML::%s: avg_bandwidth_support_ok[%s][%s] not ok\n", __func__, dml2_core_internal_soc_state_type_str(m), dml2_core_internal_bw_type_str(n));
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
225
#define REG_UPDATE_N(reg_name, n, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
228
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
446
#define IX_REG_SET_N(index_reg_name, data_reg_name, index, n, initial_val, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
450
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
461
#define IX_REG_GET_N(index_reg_name, data_reg_name, index, n, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
464
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
470
#define IX_REG_UPDATE_N(index_reg_name, data_reg_name, index, n, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
474
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
491
uint32_t index, int n,
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
497
uint32_t index, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
505
#define IX_REG_SET_N_SYNC(index, n, initial_val, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
509
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
520
#define IX_REG_GET_N_SYNC(index, n, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
523
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
530
uint32_t index, int n,
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
535
uint32_t index, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
54
#define REG_SET_N(reg_name, n, initial_val, ...) \
sys/dev/pci/drm/amd/display/dc/inc/reg_helper.h
58
n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
208
int n = 27;
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
233
n * (n - 1)));
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
235
n -= 2;
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
236
} while (n > 2);
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
261
int n = 26;
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
270
n * (n - 1)));
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
272
n -= 2;
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
273
} while (n != 0);
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
287
unsigned int n = 9;
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
290
n + 2,
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
291
n + 1);
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
303
n));
sys/dev/pci/drm/amd/display/dc/sspl/spl_fixpt31_32.c
304
while (--n != 1);
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.c
44
uint32_t addr, int n, uint8_t shift1,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.c
55
while (i < n) {
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.c
72
void dmub_reg_update(struct dmub_srv *srv, uint32_t addr, int n, uint8_t shift1,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.c
80
set_reg_field_values(&field_value_mask, addr, n, shift1, mask1,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.c
89
void dmub_reg_set(struct dmub_srv *srv, uint32_t addr, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.c
96
set_reg_field_values(&field_value_mask, addr, n, shift1, mask1,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.h
114
void dmub_reg_set(struct dmub_srv *srv, uint32_t addr, uint32_t reg_val, int n,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.h
117
void dmub_reg_update(struct dmub_srv *srv, uint32_t addr, int n, uint8_t shift1,
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.h
58
#define REG_SET_N(reg_name, n, initial_val, ...) \
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.h
59
dmub_reg_set(CTX, REG(reg_name), initial_val, n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.h
85
#define REG_UPDATE_N(reg_name, n, ...)\
sys/dev/pci/drm/amd/display/dmub/src/dmub_reg.h
86
dmub_reg_update(CTX, REG(reg_name), n, __VA_ARGS__)
sys/dev/pci/drm/amd/display/modules/hdcp/hdcp1_execution.c
30
uint64_t n = 0;
sys/dev/pci/drm/amd/display/modules/hdcp/hdcp1_execution.c
32
u8 bksv[sizeof(n)] = { };
sys/dev/pci/drm/amd/display/modules/hdcp/hdcp1_execution.c
35
n = *(uint64_t *)bksv;
sys/dev/pci/drm/amd/display/modules/hdcp/hdcp1_execution.c
37
while (n) {
sys/dev/pci/drm/amd/display/modules/hdcp/hdcp1_execution.c
39
n &= (n - 1);
sys/dev/pci/drm/amd/include/kgd_pp_interface.h
457
int (*set_power_limit)(void *handle, uint32_t n);
sys/dev/pci/drm/amd/pm/amdgpu_pm.c
2313
static umode_t amdgpu_board_attr_visible(struct kobject *kobj, struct attribute *attr, int n)
sys/dev/pci/drm/amd/pm/amdgpu_pm.c
2482
struct attribute *attr, int n)
sys/dev/pci/drm/amd/pm/legacy-dpm/kv_dpm.c
142
u32 n = 0;
sys/dev/pci/drm/amd/pm/legacy-dpm/kv_dpm.c
147
sclk_voltage_mapping_table->entries[n].sclk_frequency =
sys/dev/pci/drm/amd/pm/legacy-dpm/kv_dpm.c
149
sclk_voltage_mapping_table->entries[n].vid_2bit =
sys/dev/pci/drm/amd/pm/legacy-dpm/kv_dpm.c
152
n++;
sys/dev/pci/drm/amd/pm/legacy-dpm/kv_dpm.c
156
sclk_voltage_mapping_table->num_max_dpm_entries = n;
sys/dev/pci/drm/amd/pm/legacy-dpm/si_dpm.c
2358
u64 pwr_efficiency_ratio, n, d;
sys/dev/pci/drm/amd/pm/legacy-dpm/si_dpm.c
2363
n = div64_u64((u64)1024 * curr_vddc * curr_vddc * ((u64)1000 + margin), (u64)1000);
sys/dev/pci/drm/amd/pm/legacy-dpm/si_dpm.c
2365
pwr_efficiency_ratio = div64_u64(n, d);
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/smu7_powertune.c
1125
int smu7_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n)
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/smu7_powertune.c
1133
n<<8,
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/smu7_powertune.h
57
int smu7_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/vega10_powertune.c
1276
int vega10_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n)
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/vega10_powertune.c
1282
PPSMC_MSG_SetPptLimit, n,
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/vega10_powertune.h
74
int vega10_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/vega20_powertune.c
32
int vega20_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n)
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/vega20_powertune.c
39
PPSMC_MSG_SetPptLimit, n,
sys/dev/pci/drm/amd/pm/powerplay/hwmgr/vega20_powertune.h
26
int vega20_set_power_limit(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/pci/drm/amd/pm/powerplay/inc/hwmgr.h
344
int (*set_power_limit)(struct pp_hwmgr *hwmgr, uint32_t n);
sys/dev/pci/drm/amd/pm/powerplay/inc/pp_debug.h
58
#define GET_FLEXIBLE_ARRAY_MEMBER_ADDR(type, member, ptr, n) \
sys/dev/pci/drm/amd/pm/powerplay/inc/pp_debug.h
59
(type *)((char *)&(ptr)->member + (sizeof(type) * (n)))
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_12_ppt.c
275
int ret, i, n;
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_12_ppt.c
317
n = ARRAY_SIZE(static_metrics->PublicSerialNumber_AID);
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_12_ppt.c
318
for (i = 0; i < n; i++) {
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_12_ppt.c
323
n = ARRAY_SIZE(static_metrics->PublicSerialNumber_XCD);
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_12_ppt.c
324
for (i = 0; i < n; i++) {
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_6_ppt.c
863
int ret, i, retry = 100, n;
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_6_ppt.c
927
n = ARRAY_SIZE(metrics_v0->PublicSerialNumber_AID);
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_6_ppt.c
928
for (i = 0; i < n; i++) {
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_6_ppt.c
934
n = ARRAY_SIZE(metrics_v0->PublicSerialNumber_XCD);
sys/dev/pci/drm/amd/pm/swsmu/smu13/smu_v13_0_6_ppt.c
935
for (i = 0; i < n; i++) {
sys/dev/pci/drm/display/drm_dp_mst_topology.c
1548
uint n;
sys/dev/pci/drm/display/drm_dp_mst_topology.c
1551
n = stack_trace_save(stack_entries, ARRAY_SIZE(stack_entries), 1);
sys/dev/pci/drm/display/drm_dp_mst_topology.c
1552
backtrace = stack_depot_save(stack_entries, n, GFP_KERNEL);
sys/dev/pci/drm/display/drm_hdmi_helper.c
262
unsigned int n;
sys/dev/pci/drm/display/drm_hdmi_helper.c
276
.n_cts_32k = { .n = 4096, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
277
.n_cts_44k1 = { .n = 6272, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
278
.n_cts_48k = { .n = 6144, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
281
.n_cts_32k = { .n = 4576, .cts = 28125, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
282
.n_cts_44k1 = { .n = 7007, .cts = 31250, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
283
.n_cts_48k = { .n = 6864, .cts = 28125, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
286
.n_cts_32k = { .n = 4096, .cts = 25200, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
287
.n_cts_44k1 = { .n = 6272, .cts = 28000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
288
.n_cts_48k = { .n = 6144, .cts = 25200, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
291
.n_cts_32k = { .n = 4096, .cts = 27000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
292
.n_cts_44k1 = { .n = 6272, .cts = 30000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
293
.n_cts_48k = { .n = 6144, .cts = 27000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
296
.n_cts_32k = { .n = 4096, .cts = 27027, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
297
.n_cts_44k1 = { .n = 6272, .cts = 30030, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
298
.n_cts_48k = { .n = 6144, .cts = 27027, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
301
.n_cts_32k = { .n = 4096, .cts = 54000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
302
.n_cts_44k1 = { .n = 6272, .cts = 60000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
303
.n_cts_48k = { .n = 6144, .cts = 54000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
306
.n_cts_32k = { .n = 4096, .cts = 54054, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
307
.n_cts_44k1 = { .n = 6272, .cts = 60060, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
308
.n_cts_48k = { .n = 6144, .cts = 54054, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
311
.n_cts_32k = { .n = 11648, .cts = 210937, }, /* and 210938 */
sys/dev/pci/drm/display/drm_hdmi_helper.c
312
.n_cts_44k1 = { .n = 17836, .cts = 234375, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
313
.n_cts_48k = { .n = 11648, .cts = 140625, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
316
.n_cts_32k = { .n = 4096, .cts = 74250, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
317
.n_cts_44k1 = { .n = 6272, .cts = 82500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
318
.n_cts_48k = { .n = 6144, .cts = 74250, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
321
.n_cts_32k = { .n = 11648, .cts = 421875, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
322
.n_cts_44k1 = { .n = 8918, .cts = 234375, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
323
.n_cts_48k = { .n = 5824, .cts = 140625, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
326
.n_cts_32k = { .n = 4096, .cts = 148500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
327
.n_cts_44k1 = { .n = 6272, .cts = 165000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
328
.n_cts_48k = { .n = 6144, .cts = 148500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
331
.n_cts_32k = { .n = 5824, .cts = 421875, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
332
.n_cts_44k1 = { .n = 4459, .cts = 234375, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
333
.n_cts_48k = { .n = 5824, .cts = 281250, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
336
.n_cts_32k = { .n = 3072, .cts = 222750, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
337
.n_cts_44k1 = { .n = 4704, .cts = 247500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
338
.n_cts_48k = { .n = 5120, .cts = 247500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
341
.n_cts_32k = { .n = 5824, .cts = 843750, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
342
.n_cts_44k1 = { .n = 8918, .cts = 937500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
343
.n_cts_48k = { .n = 5824, .cts = 562500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
346
.n_cts_32k = { .n = 3072, .cts = 445500, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
347
.n_cts_44k1 = { .n = 9408, .cts = 990000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
348
.n_cts_48k = { .n = 6144, .cts = 594000, },
sys/dev/pci/drm/display/drm_hdmi_helper.c
389
unsigned int n, cts, mult;
sys/dev/pci/drm/display/drm_hdmi_helper.c
412
n = entry->n * mult;
sys/dev/pci/drm/display/drm_hdmi_helper.c
416
n = 128 * sample_rate / 1000;
sys/dev/pci/drm/display/drm_hdmi_helper.c
421
cts = DIV_ROUND_CLOSEST_ULL(tmds_char_rate * n,
sys/dev/pci/drm/display/drm_hdmi_helper.c
424
*out_n = n;
sys/dev/pci/drm/drm_blend.c
456
int i, n = 0;
sys/dev/pci/drm/drm_blend.c
477
states[n++] = plane_state;
sys/dev/pci/drm/drm_blend.c
482
sort(states, n, sizeof(*states), drm_atomic_state_zpos_cmp, NULL);
sys/dev/pci/drm/drm_blend.c
484
for (i = 0; i < n; i++) {
sys/dev/pci/drm/drm_client_modeset.c
549
int n, int width, int height)
sys/dev/pci/drm/drm_client_modeset.c
557
if (n == connector_count)
sys/dev/pci/drm/drm_client_modeset.c
560
connector = connectors[n];
sys/dev/pci/drm/drm_client_modeset.c
562
best_crtcs[n] = NULL;
sys/dev/pci/drm/drm_client_modeset.c
564
best_crtcs, modes, n + 1, width, height);
sys/dev/pci/drm/drm_client_modeset.c
565
if (modes[n] == NULL)
sys/dev/pci/drm/drm_client_modeset.c
591
for (o = 0; o < n; o++)
sys/dev/pci/drm/drm_client_modeset.c
595
if (o < n) {
sys/dev/pci/drm/drm_client_modeset.c
600
if (!drm_mode_equal(modes[o], modes[n]))
sys/dev/pci/drm/drm_client_modeset.c
604
crtcs[n] = crtc;
sys/dev/pci/drm/drm_client_modeset.c
605
memcpy(crtcs, best_crtcs, n * sizeof(*crtcs));
sys/dev/pci/drm/drm_client_modeset.c
607
crtcs, modes, n + 1, width, height);
sys/dev/pci/drm/drm_color_mgmt.c
136
u64 drm_color_ctm_s31_32_to_qm_n(u64 user_input, u32 m, u32 n)
sys/dev/pci/drm/drm_color_mgmt.c
138
u64 mag = (user_input & ~BIT_ULL(63)) >> (32 - n);
sys/dev/pci/drm/drm_color_mgmt.c
142
WARN_ON(m > 32 || n > 32);
sys/dev/pci/drm/drm_color_mgmt.c
145
BIT_ULL(n + m - 1) : BIT_ULL(n + m - 1) - 1);
sys/dev/pci/drm/drm_connector.c
207
struct drm_connector *connector, *n;
sys/dev/pci/drm/drm_connector.c
218
llist_for_each_entry_safe(connector, n, freed, free_node) {
sys/dev/pci/drm/drm_edid.c
3127
int i, n;
sys/dev/pci/drm/drm_edid.c
3134
n = (127 - d) / 18;
sys/dev/pci/drm/drm_edid.c
3135
for (i = 0; i < n; i++)
sys/dev/pci/drm/drm_edid.c
3142
unsigned int i, n = min((int)ext[0x02], 6);
sys/dev/pci/drm/drm_edid.c
3148
for (i = 0; i < n; i++)
sys/dev/pci/drm/drm_format_helper.c
258
#define ALIGN_DOWN_PIXELS(end, n, a) \
sys/dev/pci/drm/drm_format_helper.c
259
((end) - ((n) & ((a) - 1)))
sys/dev/pci/drm/drm_gpuvm.c
2223
struct drm_gpuva_op_map n = {
sys/dev/pci/drm/drm_gpuvm.c
2234
ret = op_remap_cb(ops, priv, NULL, &n, &u);
sys/dev/pci/drm/drm_gpuvm.c
2286
struct drm_gpuva_op_map n = {
sys/dev/pci/drm/drm_gpuvm.c
2294
ret = op_remap_cb(ops, priv, &p, &n, &u);
sys/dev/pci/drm/drm_gpuvm.c
2324
struct drm_gpuva_op_map n = {
sys/dev/pci/drm/drm_gpuvm.c
2335
ret = op_remap_cb(ops, priv, NULL, &n, &u);
sys/dev/pci/drm/drm_ioc32.c
333
#define DRM_IOCTL32_DEF(n, f) [DRM_IOCTL_NR(n##32)] = {.fn = f, .name = #n}
sys/dev/pci/drm/drm_linux.c
3077
bitmap_zalloc(u_int n, gfp_t flags)
sys/dev/pci/drm/drm_linux.c
3079
return kcalloc(BITS_TO_LONGS(n), sizeof(long), flags);
sys/dev/pci/drm/drm_linux.c
740
vmemdup_array_user(const void *src, size_t n, size_t size)
sys/dev/pci/drm/drm_linux.c
742
void *p = kvmalloc_array(n, size, GFP_KERNEL);
sys/dev/pci/drm/drm_linux.c
746
if (copyin(src, p, n * size) != 0) {
sys/dev/pci/drm/drm_linux.c
747
free(p, M_DRM, n * size);
sys/dev/pci/drm/drm_linux.c
772
memchr_inv(const void *s, int c, size_t n)
sys/dev/pci/drm/drm_linux.c
774
if (n != 0) {
sys/dev/pci/drm/drm_linux.c
780
} while (--n != 0);
sys/dev/pci/drm/drm_managed.c
142
struct drmm_node *n, *t;
sys/dev/pci/drm/drm_managed.c
143
list_for_each_entry_safe(n, t, &dev->managed.resources, list) {
sys/dev/pci/drm/drm_managed.c
144
list_del(&n->list);
sys/dev/pci/drm/drm_managed.c
145
if (n->func)
sys/dev/pci/drm/drm_managed.c
146
n->func(dev, n->p);
sys/dev/pci/drm/drm_managed.c
148
free(n->p, M_DRM, n->size);
sys/dev/pci/drm/drm_managed.c
149
free(n, M_DRM, sizeof(*n));
sys/dev/pci/drm/drm_managed.c
40
drmm_kcalloc(struct drm_device *dev, size_t n, size_t size, int flags)
sys/dev/pci/drm/drm_managed.c
46
p = kcalloc(n, size, flags);
sys/dev/pci/drm/drm_managed.c
53
node->size = n * size;
sys/dev/pci/drm/drm_managed.c
84
struct drmm_node *n, *m = NULL;
sys/dev/pci/drm/drm_managed.c
90
list_for_each_entry(n, &dev->managed.resources, list) {
sys/dev/pci/drm/drm_managed.c
91
if (n->p == p) {
sys/dev/pci/drm/drm_managed.c
92
list_del(&n->list);
sys/dev/pci/drm/drm_managed.c
93
m = n;
sys/dev/pci/drm/drm_mm.c
110
unsigned int n;
sys/dev/pci/drm/drm_mm.c
112
n = stack_trace_save(entries, ARRAY_SIZE(entries), 1);
sys/dev/pci/drm/drm_mm.c
115
node->stack = stack_depot_save(entries, n, GFP_NOWAIT);
sys/dev/pci/drm/drm_modeset_lock.c
87
unsigned int n;
sys/dev/pci/drm/drm_modeset_lock.c
89
n = stack_trace_save(entries, ARRAY_SIZE(entries), 1);
sys/dev/pci/drm/drm_modeset_lock.c
91
return stack_depot_save(entries, n, GFP_NOWAIT | __GFP_NOWARN);
sys/dev/pci/drm/i915/display/bxt_dpio_phy_regs.h
72
#define PORT_PLL_N(n) REG_FIELD_PREP(PORT_PLL_N_MASK, (n))
sys/dev/pci/drm/i915/display/g4x_dp.c
36
{ .dot = 162000, .p1 = 2, .p2 = 10, .n = 2, .m1 = 23, .m2 = 8, },
sys/dev/pci/drm/i915/display/g4x_dp.c
37
{ .dot = 270000, .p1 = 1, .p2 = 10, .n = 1, .m1 = 14, .m2 = 2, },
sys/dev/pci/drm/i915/display/g4x_dp.c
41
{ .dot = 162000, .p1 = 2, .p2 = 10, .n = 1, .m1 = 12, .m2 = 9, },
sys/dev/pci/drm/i915/display/g4x_dp.c
42
{ .dot = 270000, .p1 = 1, .p2 = 10, .n = 2, .m1 = 14, .m2 = 8, },
sys/dev/pci/drm/i915/display/g4x_dp.c
46
{ .dot = 162000, .p1 = 3, .p2 = 2, .n = 5, .m1 = 3, .m2 = 81, },
sys/dev/pci/drm/i915/display/g4x_dp.c
47
{ .dot = 270000, .p1 = 2, .p2 = 2, .n = 1, .m1 = 2, .m2 = 27, },
sys/dev/pci/drm/i915/display/g4x_dp.c
52
{ .dot = 162000, .p1 = 4, .p2 = 2, .n = 1, .m1 = 2, .m2 = 0x819999a /* 32.4 */ },
sys/dev/pci/drm/i915/display/g4x_dp.c
53
{ .dot = 270000, .p1 = 4, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x6c00000 /* 27.0 */ },
sys/dev/pci/drm/i915/display/intel_audio.c
249
return hdmi_ncts_table[i].n;
sys/dev/pci/drm/i915/display/intel_audio.c
356
int n, rate;
sys/dev/pci/drm/i915/display/intel_audio.c
367
n = audio_config_hdmi_get_n(crtc_state, rate);
sys/dev/pci/drm/i915/display/intel_audio.c
368
if (n != 0) {
sys/dev/pci/drm/i915/display/intel_audio.c
369
drm_dbg_kms(display->drm, "using N %d\n", n);
sys/dev/pci/drm/i915/display/intel_audio.c
372
tmp |= AUD_CONFIG_N(n);
sys/dev/pci/drm/i915/display/intel_audio.c
83
int n;
sys/dev/pci/drm/i915/display/intel_audio.c
908
u16 n;
sys/dev/pci/drm/i915/display/intel_audio.c
920
aud_ts->n = cdclk * aud_ts->m / 24000;
sys/dev/pci/drm/i915/display/intel_audio.c
931
intel_de_write(display, AUD_TS_CDCLK_N, aud_ts.n);
sys/dev/pci/drm/i915/display/intel_audio.c
934
aud_ts.m, aud_ts.n);
sys/dev/pci/drm/i915/display/intel_audio_regs.h
64
#define AUD_CONFIG_N(n) (REG_FIELD_PREP(AUD_CONFIG_UPPER_N_MASK, (n) >> 12) | \
sys/dev/pci/drm/i915/display/intel_audio_regs.h
65
REG_FIELD_PREP(AUD_CONFIG_LOWER_N_MASK, (n) & 0xfff))
sys/dev/pci/drm/i915/display/intel_display.c
2264
int n = crtc_state->splitter.link_count;
sys/dev/pci/drm/i915/display/intel_display.c
2275
mode->crtc_hdisplay = (mode->crtc_hdisplay - overlap) * n;
sys/dev/pci/drm/i915/display/intel_display.c
2276
mode->crtc_hblank_start = (mode->crtc_hblank_start - overlap) * n;
sys/dev/pci/drm/i915/display/intel_display.c
2277
mode->crtc_hblank_end = (mode->crtc_hblank_end - overlap) * n;
sys/dev/pci/drm/i915/display/intel_display.c
2278
mode->crtc_hsync_start = (mode->crtc_hsync_start - overlap) * n;
sys/dev/pci/drm/i915/display/intel_display.c
2279
mode->crtc_hsync_end = (mode->crtc_hsync_end - overlap) * n;
sys/dev/pci/drm/i915/display/intel_display.c
2280
mode->crtc_htotal = (mode->crtc_htotal - overlap) * n;
sys/dev/pci/drm/i915/display/intel_display.c
2281
mode->crtc_clock *= n;
sys/dev/pci/drm/i915/display/intel_display.c
2502
u32 m, u32 n, u32 constant_n)
sys/dev/pci/drm/i915/display/intel_display.c
2507
*ret_n = min_t(unsigned int, roundup_pow_of_two(n), DATA_LINK_N_MAX);
sys/dev/pci/drm/i915/display/intel_display.c
2509
*ret_m = div_u64(mul_u32_u32(m, *ret_n), n);
sys/dev/pci/drm/i915/display/intel_display.c
8242
.n = 2,
sys/dev/pci/drm/i915/display/intel_display_regs.h
2337
#define DDI_BUF_TRANS_SELECT(n) REG_FIELD_PREP(DDI_BUF_EMP_MASK, (n))
sys/dev/pci/drm/i915/display/intel_display_types.h
584
int n;
sys/dev/pci/drm/i915/display/intel_dp.c
3323
int n = intel_dp->mso_link_count;
sys/dev/pci/drm/i915/display/intel_dp.c
3327
pipe_config->splitter.link_count = n;
sys/dev/pci/drm/i915/display/intel_dp.c
3332
n, overlap);
sys/dev/pci/drm/i915/display/intel_dp.c
3334
adjusted_mode->crtc_hdisplay = adjusted_mode->crtc_hdisplay / n + overlap;
sys/dev/pci/drm/i915/display/intel_dp.c
3335
adjusted_mode->crtc_hblank_start = adjusted_mode->crtc_hblank_start / n + overlap;
sys/dev/pci/drm/i915/display/intel_dp.c
3336
adjusted_mode->crtc_hblank_end = adjusted_mode->crtc_hblank_end / n + overlap;
sys/dev/pci/drm/i915/display/intel_dp.c
3337
adjusted_mode->crtc_hsync_start = adjusted_mode->crtc_hsync_start / n + overlap;
sys/dev/pci/drm/i915/display/intel_dp.c
3338
adjusted_mode->crtc_hsync_end = adjusted_mode->crtc_hsync_end / n + overlap;
sys/dev/pci/drm/i915/display/intel_dp.c
3339
adjusted_mode->crtc_htotal = adjusted_mode->crtc_htotal / n + overlap;
sys/dev/pci/drm/i915/display/intel_dp.c
3340
adjusted_mode->crtc_clock /= n;
sys/dev/pci/drm/i915/display/intel_dp.c
4259
int n = intel_dp->mso_link_count;
sys/dev/pci/drm/i915/display/intel_dp.c
4262
if (!mode || !n)
sys/dev/pci/drm/i915/display/intel_dp.c
4265
mode->hdisplay = (mode->hdisplay - overlap) * n;
sys/dev/pci/drm/i915/display/intel_dp.c
4266
mode->hsync_start = (mode->hsync_start - overlap) * n;
sys/dev/pci/drm/i915/display/intel_dp.c
4267
mode->hsync_end = (mode->hsync_end - overlap) * n;
sys/dev/pci/drm/i915/display/intel_dp.c
4268
mode->htotal = (mode->htotal - overlap) * n;
sys/dev/pci/drm/i915/display/intel_dp.c
4269
mode->clock *= n;
sys/dev/pci/drm/i915/display/intel_dpll.c
100
.n = { .min = 1, .max = 6 },
sys/dev/pci/drm/i915/display/intel_dpll.c
114
.n = { .min = 1, .max = 4 },
sys/dev/pci/drm/i915/display/intel_dpll.c
1252
return dpll->m < factor * dpll->n;
sys/dev/pci/drm/i915/display/intel_dpll.c
129
.n = { .min = 1, .max = 4 },
sys/dev/pci/drm/i915/display/intel_dpll.c
142
.n = { .min = 1, .max = 3 },
sys/dev/pci/drm/i915/display/intel_dpll.c
156
.n = { .min = 1, .max = 3 },
sys/dev/pci/drm/i915/display/intel_dpll.c
171
.n = { .min = 3, .max = 6 },
sys/dev/pci/drm/i915/display/intel_dpll.c
185
.n = { .min = 3, .max = 6 },
sys/dev/pci/drm/i915/display/intel_dpll.c
1935
DPIO_N_DIV(clock->n) |
sys/dev/pci/drm/i915/display/intel_dpll.c
203
.n = { .min = 1, .max = 5 },
sys/dev/pci/drm/i915/display/intel_dpll.c
216
.n = { .min = 1, .max = 3 },
sys/dev/pci/drm/i915/display/intel_dpll.c
229
.n = { .min = 1, .max = 3 },
sys/dev/pci/drm/i915/display/intel_dpll.c
243
.n = { .min = 1, .max = 2 },
sys/dev/pci/drm/i915/display/intel_dpll.c
256
.n = { .min = 1, .max = 3 },
sys/dev/pci/drm/i915/display/intel_dpll.c
275
.n = { .min = 1, .max = 7 },
sys/dev/pci/drm/i915/display/intel_dpll.c
291
.n = { .min = 1, .max = 1 },
sys/dev/pci/drm/i915/display/intel_dpll.c
301
.n = { .min = 1, .max = 1 },
sys/dev/pci/drm/i915/display/intel_dpll.c
323
clock->vco = clock->n == 0 ? 0 :
sys/dev/pci/drm/i915/display/intel_dpll.c
324
DIV_ROUND_CLOSEST(refclk * clock->m, clock->n);
sys/dev/pci/drm/i915/display/intel_dpll.c
341
clock->vco = clock->n + 2 == 0 ? 0 :
sys/dev/pci/drm/i915/display/intel_dpll.c
342
DIV_ROUND_CLOSEST(refclk * clock->m, clock->n + 2);
sys/dev/pci/drm/i915/display/intel_dpll.c
354
clock->vco = clock->n == 0 ? 0 :
sys/dev/pci/drm/i915/display/intel_dpll.c
355
DIV_ROUND_CLOSEST(refclk * clock->m, clock->n);
sys/dev/pci/drm/i915/display/intel_dpll.c
367
clock->vco = clock->n == 0 ? 0 :
sys/dev/pci/drm/i915/display/intel_dpll.c
368
DIV_ROUND_CLOSEST_ULL(mul_u32_u32(refclk, clock->m), clock->n << 22);
sys/dev/pci/drm/i915/display/intel_dpll.c
38
} dot, vco, n, m, m1, m2, p, p1;
sys/dev/pci/drm/i915/display/intel_dpll.c
441
clock.n = ffs((fp & FP_N_PINEVIEW_DIV_MASK) >> FP_N_DIV_SHIFT) - 1;
sys/dev/pci/drm/i915/display/intel_dpll.c
444
clock.n = (fp & FP_N_DIV_MASK) >> FP_N_DIV_SHIFT;
sys/dev/pci/drm/i915/display/intel_dpll.c
48
.n = { .min = 2, .max = 16 },
sys/dev/pci/drm/i915/display/intel_dpll.c
536
clock.n = REG_FIELD_GET(DPIO_N_DIV_MASK, tmp);
sys/dev/pci/drm/i915/display/intel_dpll.c
570
clock.n = REG_FIELD_GET(DPIO_CHV_N_DIV_MASK, pll_dw1);
sys/dev/pci/drm/i915/display/intel_dpll.c
585
if (clock->n < limit->n.min || limit->n.max < clock->n)
sys/dev/pci/drm/i915/display/intel_dpll.c
61
.n = { .min = 2, .max = 16 },
sys/dev/pci/drm/i915/display/intel_dpll.c
674
for (clock.n = limit->n.min;
sys/dev/pci/drm/i915/display/intel_dpll.c
675
clock.n <= limit->n.max; clock.n++) {
sys/dev/pci/drm/i915/display/intel_dpll.c
730
for (clock.n = limit->n.min;
sys/dev/pci/drm/i915/display/intel_dpll.c
731
clock.n <= limit->n.max; clock.n++) {
sys/dev/pci/drm/i915/display/intel_dpll.c
74
.n = { .min = 2, .max = 16 },
sys/dev/pci/drm/i915/display/intel_dpll.c
785
max_n = limit->n.max;
sys/dev/pci/drm/i915/display/intel_dpll.c
787
for (clock.n = limit->n.min; clock.n <= max_n; clock.n++) {
sys/dev/pci/drm/i915/display/intel_dpll.c
807
max_n = clock.n;
sys/dev/pci/drm/i915/display/intel_dpll.c
87
.n = { .min = 1, .max = 6 },
sys/dev/pci/drm/i915/display/intel_dpll.c
872
int max_n = min(limit->n.max, refclk / 19200);
sys/dev/pci/drm/i915/display/intel_dpll.c
878
for (clock.n = limit->n.min; clock.n <= max_n; clock.n++) {
sys/dev/pci/drm/i915/display/intel_dpll.c
887
clock.m2 = DIV_ROUND_CLOSEST(target * clock.p * clock.n,
sys/dev/pci/drm/i915/display/intel_dpll.c
939
clock.n = 1;
sys/dev/pci/drm/i915/display/intel_dpll.c
950
m2 = DIV_ROUND_CLOSEST_ULL(mul_u32_u32(target, clock.p * clock.n) << 22,
sys/dev/pci/drm/i915/display/intel_dpll.c
989
return dpll->n << 16 | dpll->m1 << 8 | dpll->m2;
sys/dev/pci/drm/i915/display/intel_dpll.c
994
return (1 << dpll->n) << 16 | dpll->m2;
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
1004
int n, p, r;
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
1033
n = (wrpll & WRPLL_DIVIDER_FB_MASK) >> WRPLL_DIVIDER_FB_SHIFT;
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
1036
return (refclk * n / 10) / (p * r) * 2;
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2254
{ .dot = 162000, .p1 = 4, .p2 = 2, .n = 1, .m1 = 2, .m2 = 0x819999a /* 32.4 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2255
{ .dot = 270000, .p1 = 4, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x6c00000 /* 27.0 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2256
{ .dot = 540000, .p1 = 2, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x6c00000 /* 27.0 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2257
{ .dot = 216000, .p1 = 3, .p2 = 2, .n = 1, .m1 = 2, .m2 = 0x819999a /* 32.4 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2258
{ .dot = 243000, .p1 = 4, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x6133333 /* 24.3 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2259
{ .dot = 324000, .p1 = 4, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x819999a /* 32.4 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2260
{ .dot = 432000, .p1 = 3, .p2 = 1, .n = 1, .m1 = 2, .m2 = 0x819999a /* 32.4 */ },
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2346
hw_state->pll1 = PORT_PLL_N(clk_div->n);
sys/dev/pci/drm/i915/display/intel_dpll_mgr.c
2382
clock.n = REG_FIELD_GET(PORT_PLL_N_MASK, hw_state->pll1);
sys/dev/pci/drm/i915/display/intel_hdmi.c
2625
struct cec_notifier *n = intel_attached_hdmi(connector)->cec_notifier;
sys/dev/pci/drm/i915/display/intel_hdmi.c
2627
cec_notifier_conn_unregister(n);
sys/dev/pci/drm/i915/display/intel_sdvo.c
1295
clock->n = 3;
sys/dev/pci/drm/i915/display/intel_sdvo.c
1301
clock->n = 6;
sys/dev/pci/drm/i915/display/intel_vbt_defs.h
693
u8 n;
sys/dev/pci/drm/i915/display/intel_vbt_defs.h
859
u8 n;
sys/dev/pci/drm/i915/display/vlv_dpio_phy_regs.h
193
#define DPIO_CHV_N_DIV(n) REG_FIELD_PREP(DPIO_CHV_N_DIV_MASK, (n))
sys/dev/pci/drm/i915/display/vlv_dpio_phy_regs.h
40
#define DPIO_N_DIV(n) REG_FIELD_PREP(DPIO_N_DIV_MASK, (n))
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
112
(ffs(n) - 1) << DSI_PLL_N1_DIV_SHIFT |
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
126
u32 m = 0, p = 0, n;
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
138
n = (pll_div & DSI_PLL_N1_DIV_MASK) >> DSI_PLL_N1_DIV_SHIFT;
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
139
n = 1 << n; /* register has log2(N1) */
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
166
dsi_clock = (m * refclk) / (p * n);
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
67
unsigned int m, n, p;
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
79
n = 4;
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
84
n = 1;
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
91
delta = abs(target_dsi_clk - (m_min * ref_clk) / (p_min * n));
sys/dev/pci/drm/i915/display/vlv_dsi_pll.c
99
int calc_dsi_clk = (m * ref_clk) / (p * n);
sys/dev/pci/drm/i915/display/vlv_dsi_regs.h
463
#define COMMAND_LENGTH_SHIFT(n) (8 * (n)) /* n: 0...3 */
sys/dev/pci/drm/i915/display/vlv_dsi_regs.h
464
#define COMMAND_LENGTH_MASK(n) (0xff << (8 * (n)))
sys/dev/pci/drm/i915/display/vlv_dsi_regs.h
468
#define MIPI_READ_DATA_RETURN(display, port, n) _MMIO_MIPI(_MIPI_MMIO_BASE(display) + 4 * (n), port, _MIPIA_READ_DATA_RETURN0, _MIPIC_READ_DATA_RETURN0) /* n: 0...7 */
sys/dev/pci/drm/i915/display/vlv_dsi_regs.h
473
#define READ_DATA_VALID(n) (1 << (n))
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1211
unsigned int n;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1218
for (n = 0; n < num_engines; n++) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1222
switch (pe[n].type) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1224
ce = intel_context_create(pe[n].engine);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1228
ce = intel_engine_create_virtual(pe[n].siblings,
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1229
pe[n].num_siblings, 0);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1233
ce = intel_engine_create_parallel(pe[n].siblings,
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1234
pe[n].num_siblings,
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1235
pe[n].width);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1240
GEM_WARN_ON(pe[n].type != I915_GEM_ENGINE_TYPE_INVALID);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1249
e->engines[n] = ce;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
1273
if (pe[n].type == I915_GEM_ENGINE_TYPE_PARALLEL) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
416
unsigned int n;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
456
for (n = 0; n < num_siblings; n++) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
459
if (copy_from_user(&ci, &ext->engines[n], sizeof(ci))) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
464
siblings[n] = intel_engine_lookup_user(i915,
sys/dev/pci/drm/i915/gem/i915_gem_context.c
467
if (!siblings[n]) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
470
n, ci.engine_class, ci.engine_instance);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
504
int err, n;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
539
for (n = 0; n < ARRAY_SIZE(ext->mbz64); n++) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
540
err = check_user_mbz(&ext->mbz64[n]);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
566
for (n = 0; n < num_bonds; n++) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
569
if (copy_from_user(&ci, &ext->engines[n], sizeof(ci)))
sys/dev/pci/drm/i915/gem/i915_gem_context.c
578
n, ci.engine_class, ci.engine_instance);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
596
int err = 0, n, i, j;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
637
for (n = 0; n < ARRAY_SIZE(ext->mbz64); n++) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
638
err = check_user_mbz(&ext->mbz64[n]);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
667
n = i * num_siblings + j;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
668
if (copy_from_user(&ci, &ext->engines[n], sizeof(ci))) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
673
siblings[n] =
sys/dev/pci/drm/i915/gem/i915_gem_context.c
676
if (!siblings[n]) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
679
n, ci.engine_class, ci.engine_instance);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
688
if (siblings[n]->class == RENDER_CLASS ||
sys/dev/pci/drm/i915/gem/i915_gem_context.c
689
siblings[n]->class == COMPUTE_CLASS) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
694
if (n) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
707
current_mask |= siblings[n]->logical_mask;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
750
unsigned int n;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
775
for (n = 0; n < set.num_engines; n++) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
779
if (copy_from_user(&ci, &user->engines[n], sizeof(ci))) {
sys/dev/pci/drm/i915/gem/i915_gem_context.c
784
memset(&set.engines[n], 0, sizeof(set.engines[n]));
sys/dev/pci/drm/i915/gem/i915_gem_context.c
796
n, ci.engine_class, ci.engine_instance);
sys/dev/pci/drm/i915/gem/i915_gem_context.c
801
set.engines[n].type = I915_GEM_ENGINE_TYPE_PHYSICAL;
sys/dev/pci/drm/i915/gem/i915_gem_context.c
802
set.engines[n].engine = engine;
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
2778
__free_fence_array(struct eb_fence *fences, unsigned int n)
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
2780
while (n--) {
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
2781
drm_syncobj_put(ptr_mask_bits(fences[n].syncobj, 2));
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
2782
dma_fence_put(fences[n].dma_fence);
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
2783
dma_fence_chain_free(fences[n].chain_fence);
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3028
unsigned int n;
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3031
for (n = 0; n < eb->num_fences; n++) {
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3032
if (!eb->fences[n].dma_fence)
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3035
err = i915_request_await_dma_fence(rq, eb->fences[n].dma_fence);
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3046
unsigned int n;
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3048
for (n = 0; n < eb->num_fences; n++) {
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3052
syncobj = ptr_unpack_bits(eb->fences[n].syncobj, &flags, 2);
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3056
if (eb->fences[n].chain_fence) {
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3058
eb->fences[n].chain_fence,
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3060
eb->fences[n].value);
sys/dev/pci/drm/i915/gem/i915_gem_execbuffer.c
3065
eb->fences[n].chain_fence = NULL;
sys/dev/pci/drm/i915/gem/i915_gem_lmem.c
15
unsigned long n,
sys/dev/pci/drm/i915/gem/i915_gem_lmem.c
22
offset = i915_gem_object_get_dma_address(obj, n);
sys/dev/pci/drm/i915/gem/i915_gem_lmem.h
17
unsigned long n,
sys/dev/pci/drm/i915/gem/i915_gem_object.h
377
pgoff_t n,
sys/dev/pci/drm/i915/gem/i915_gem_object.h
400
#define i915_gem_object_page_iter_get_sg(obj, it, n, offset) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
401
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
402
__i915_gem_object_page_iter_get_sg(obj, it, n, offset); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
424
__i915_gem_object_get_sg(struct drm_i915_gem_object *obj, pgoff_t n,
sys/dev/pci/drm/i915/gem/i915_gem_object.h
427
return __i915_gem_object_page_iter_get_sg(obj, &obj->mm.get_page, n, offset);
sys/dev/pci/drm/i915/gem/i915_gem_object.h
445
#define i915_gem_object_get_sg(obj, n, offset) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
446
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
447
__i915_gem_object_get_sg(obj, n, offset); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
469
__i915_gem_object_get_sg_dma(struct drm_i915_gem_object *obj, pgoff_t n,
sys/dev/pci/drm/i915/gem/i915_gem_object.h
472
return __i915_gem_object_page_iter_get_sg(obj, &obj->mm.get_dma_page, n, offset);
sys/dev/pci/drm/i915/gem/i915_gem_object.h
490
#define i915_gem_object_get_sg_dma(obj, n, offset) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
491
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
492
__i915_gem_object_get_sg_dma(obj, n, offset); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
511
__i915_gem_object_get_page(struct drm_i915_gem_object *obj, pgoff_t n);
sys/dev/pci/drm/i915/gem/i915_gem_object.h
526
#define i915_gem_object_get_page(obj, n) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
527
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
528
__i915_gem_object_get_page(obj, n); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
546
__i915_gem_object_get_dirty_page(struct drm_i915_gem_object *obj, pgoff_t n);
sys/dev/pci/drm/i915/gem/i915_gem_object.h
561
#define i915_gem_object_get_dirty_page(obj, n) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
562
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
563
__i915_gem_object_get_dirty_page(obj, n); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
580
__i915_gem_object_get_dma_address_len(struct drm_i915_gem_object *obj, pgoff_t n,
sys/dev/pci/drm/i915/gem/i915_gem_object.h
599
#define i915_gem_object_get_dma_address_len(obj, n, len) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
600
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
601
__i915_gem_object_get_dma_address_len(obj, n, len); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
617
__i915_gem_object_get_dma_address(struct drm_i915_gem_object *obj, pgoff_t n);
sys/dev/pci/drm/i915/gem/i915_gem_object.h
634
#define i915_gem_object_get_dma_address(obj, n) ({ \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
635
static_assert(castable_to_type(n, pgoff_t)); \
sys/dev/pci/drm/i915/gem/i915_gem_object.h
636
__i915_gem_object_get_dma_address(obj, n); \
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
647
pgoff_t n,
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
657
GEM_BUG_ON(n >= obj->base.size >> PAGE_SHIFT);
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
670
if (n < READ_ONCE(iter->sg_idx))
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
684
while (idx + count <= n) {
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
719
if (unlikely(n < idx)) /* insertion completed by another thread */
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
725
while (idx + count <= n) {
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
731
*offset = n - idx;
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
737
sg = radix_tree_lookup(&iter->radix, n);
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
753
*offset = n - base;
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
762
__i915_gem_object_get_page(struct drm_i915_gem_object *obj, pgoff_t n)
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
769
sg = i915_gem_object_get_sg(obj, n, &offset);
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
775
__i915_gem_object_get_dirty_page(struct drm_i915_gem_object *obj, pgoff_t n)
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
779
page = i915_gem_object_get_page(obj, n);
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
788
pgoff_t n, unsigned int *len)
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
793
sg = i915_gem_object_get_sg_dma(obj, n, &offset);
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
802
__i915_gem_object_get_dma_address(struct drm_i915_gem_object *obj, pgoff_t n)
sys/dev/pci/drm/i915/gem/i915_gem_pages.c
804
return i915_gem_object_get_dma_address_len(obj, n, NULL);
sys/dev/pci/drm/i915/gem/i915_gem_wait.c
180
static inline unsigned long nsecs_to_jiffies_timeout(const u64 n)
sys/dev/pci/drm/i915/gem/i915_gem_wait.c
184
div_u64(n, NSEC_PER_SEC) >= MAX_JIFFY_OFFSET / HZ)
sys/dev/pci/drm/i915/gem/i915_gem_wait.c
187
return min_t(u64, MAX_JIFFY_OFFSET, nsecs_to_jiffies64(n) + 1);
sys/dev/pci/drm/i915/gem/selftests/huge_gem_object.c
35
unsigned long n;
sys/dev/pci/drm/i915/gem/selftests/huge_gem_object.c
51
for (n = 0; n < nreal; n++) {
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1076
unsigned long n;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1084
for (n = 0; n < obj->base.size >> PAGE_SHIFT; ++n) {
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1085
u32 *ptr = kmap_local_page(i915_gem_object_get_page(obj, n));
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1092
n, dword, ptr[dword], val);
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1110
unsigned long n = obj->base.size >> PAGE_SHIFT;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1123
while (n--) {
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1208
int i, n;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1228
n = 0;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1237
n++;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1240
if (!n)
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1629
int n, err;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1693
n = 0;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1700
n++;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1703
if (!n)
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1841
unsigned int n;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1894
n = 0;
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1900
err = gpu_write(ce, vma, n++, 0xdeadbeaf);
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1946
while (n--) {
sys/dev/pci/drm/i915/gem/selftests/huge_pages.c
1947
err = cpu_check(obj, n, 0xdeadbeaf);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
311
unsigned long count, n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
369
for (n = 0; n < count; n++)
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
370
values[n] = prandom_u32_state(&prng);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
372
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
373
err = over->set(&ctx, offsets[n], ~values[n]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
376
n, count, over->name, err);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
381
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
382
err = write->set(&ctx, offsets[n], values[n]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
385
n, count, write->name, err);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
390
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
393
err = read->get(&ctx, offsets[n], &found);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
396
n, count, read->name, err);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
400
if (found != values[n]) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
402
n, count, over->name,
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
403
write->name, values[n],
sys/dev/pci/drm/i915/gem/selftests/i915_gem_coherency.c
405
~values[n], offsets[n]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
117
for (n = 0; n < prime; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
120
this = igt_request_alloc(ctx[n % nctx], engine);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
201
int n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
203
for (n = 0; !arg->result && n < ARRAY_SIZE(arg->ce); n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
206
rq = i915_request_create(arg->ce[n]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
246
int n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
251
for (n = 0; !arg->result && n < ARRAY_SIZE(arg->ce); n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
254
rq = i915_request_create(arg->ce[n]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
297
int n, m, count;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
339
for (n = 1; n < ARRAY_SIZE(data->ce); n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
362
data[m].ce[n] = ce;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
366
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
369
if (!data[n].ce[0])
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
373
data[n].ce[0]->engine->name);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
379
data[n].worker = worker;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
389
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
390
if (!data[n].ce[0])
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
393
data[n].result = 0;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
394
kthread_init_work(&data[n].work, *fn);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
395
kthread_queue_work(data[n].worker, &data[n].work);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
398
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
399
if (data[n].ce[0]) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
400
kthread_flush_work(&data[n].work);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
401
if (data[n].result && !err)
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
402
err = data[n].result;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
41
unsigned long n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
413
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
415
if (!data[n].ce[m])
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
418
intel_context_unpin(data[n].ce[m]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
419
intel_context_put(data[n].ce[m]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
422
if (data[n].worker)
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
423
kthread_destroy_worker(data[n].worker);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
481
unsigned long n, m;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
489
for (n = 0; n < real_page_count(obj); n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
492
map = kmap_local_page(i915_gem_object_get_page(obj, n));
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
512
unsigned long n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
520
for (n = 0; n < real_page_count(obj); n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
523
map = kmap_local_page(i915_gem_object_get_page(obj, n));
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
531
n, real_page_count(obj), m, max,
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
541
__builtin_return_address(0), idx, n, m,
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
65
for (n = 0; n < nctx; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
66
ctx[n] = live_context(i915, file);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
67
if (IS_ERR(ctx[n])) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
68
err = PTR_ERR(ctx[n]);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
79
for (n = 0; n < nctx; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_context.c
82
this = igt_request_alloc(ctx[n], engine);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
104
unsigned int n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
136
n = page - view.partial.offset;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
137
GEM_BUG_ON(n >= view.partial.size);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
148
iowrite32(page, io + n * PAGE_SIZE / sizeof(*io));
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
162
page, n,
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
220
unsigned int n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
233
n = page - view.partial.offset;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
234
GEM_BUG_ON(n >= view.partial.size);
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
244
iowrite32(page, io + n * PAGE_SIZE / sizeof(*io));
sys/dev/pci/drm/i915/gem/selftests/i915_gem_mman.c
258
page, n,
sys/dev/pci/drm/i915/gem/selftests/i915_gem_object.c
39
unsigned long n;
sys/dev/pci/drm/i915/gem/selftests/i915_gem_object.c
57
for (n = 0; n < obj->base.size / PAGE_SIZE; n++) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_object.c
58
if (i915_gem_object_get_page(obj, n) !=
sys/dev/pci/drm/i915/gem/selftests/i915_gem_object.c
59
i915_gem_object_get_page(obj, n % nreal)) {
sys/dev/pci/drm/i915/gem/selftests/i915_gem_object.c
61
n, n % nreal);
sys/dev/pci/drm/i915/gem/selftests/igt_gem_utils.c
49
unsigned long n, size;
sys/dev/pci/drm/i915/gem/selftests/igt_gem_utils.c
68
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gt/intel_engine_regs.h
190
#define GEN8_RING_PDP_UDW(base, n) _MMIO((base) + 0x270 + (n) * 8 + 4)
sys/dev/pci/drm/i915/gt/intel_engine_regs.h
191
#define GEN8_RING_PDP_LDW(base, n) _MMIO((base) + 0x270 + (n) * 8)
sys/dev/pci/drm/i915/gt/intel_engine_regs.h
238
#define GEN8_RING_CS_GPR(base, n) _MMIO((base) + 0x600 + (n) * 8)
sys/dev/pci/drm/i915/gt/intel_engine_regs.h
239
#define GEN8_RING_CS_GPR_UDW(base, n) _MMIO((base) + 0x600 + (n) * 8 + 4)
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
1050
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
1065
for (n = 1; n < ve->num_siblings; n++) {
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
1066
if (ve->siblings[n] == engine) {
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
1067
swap(ve->siblings[n], ve->siblings[0]);
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3612
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3642
for (n = 0; n < ve->num_siblings; n++) {
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3643
struct intel_engine_cs *sibling = ve->siblings[n];
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3742
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3744
for (n = 0; n < ve->num_siblings; n++)
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3745
intel_engine_pm_get(ve->siblings[n]);
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3753
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3757
for (n = 0; n < ve->num_siblings; n++)
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3758
intel_engine_pm_put(ve->siblings[n]);
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3824
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3832
for (n = 0; n < ve->num_siblings; n++) {
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3833
struct intel_engine_cs *sibling = READ_ONCE(ve->siblings[n]);
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
3944
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
4005
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
4006
struct intel_engine_cs *sibling = siblings[n];
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
909
unsigned int n;
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
929
for (n = execlists_num_ports(execlists); n--; ) {
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
930
struct i915_request *rq = execlists->pending[n];
sys/dev/pci/drm/i915/gt/intel_execlists_submission.c
934
n);
sys/dev/pci/drm/i915/gt/intel_gpu_commands.h
74
#define MI_DISPLAY_FLIP_PLANE(n) ((n) << 20)
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
17
int n;
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
224
int n;
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
227
for (n = 0; n < ARRAY_SIZE(pool->cache_list); n++)
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
228
INIT_LIST_HEAD(&pool->cache_list[n]);
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
24
n = fls(sz >> PAGE_SHIFT) - 1;
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
245
int n;
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
247
for (n = 0; n < ARRAY_SIZE(pool->cache_list); n++)
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
248
GEM_BUG_ON(!list_empty(&pool->cache_list[n]));
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
25
if (n >= ARRAY_SIZE(pool->cache_list))
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
26
n = ARRAY_SIZE(pool->cache_list) - 1;
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
28
return &pool->cache_list[n];
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
42
int n;
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
45
for (n = 0; n < ARRAY_SIZE(pool->cache_list); n++) {
sys/dev/pci/drm/i915/gt/intel_gt_buffer_pool.c
46
struct list_head *list = &pool->cache_list[n];
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
1631
#define GEN12_SFC_DONE(n) _MMIO(0x1cc000 + (n) * 0x1000)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
411
#define GEN7_SO_NUM_PRIMS_WRITTEN(n) _MMIO(0x5200 + (n) * 8)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
412
#define GEN7_SO_NUM_PRIMS_WRITTEN_UDW(n) _MMIO(0x5200 + (n) * 8 + 4)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
414
#define GEN7_SO_PRIM_STORAGE_NEEDED(n) _MMIO(0x5240 + (n) * 8)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
415
#define GEN7_SO_PRIM_STORAGE_NEEDED_UDW(n) _MMIO(0x5240 + (n) * 8 + 4)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
54
#define FORCEWAKE_ACK_MEDIA_VDBOX_GEN11(n) _MMIO(0xd50 + (n) * 4)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
55
#define FORCEWAKE_ACK_MEDIA_VEBOX_GEN11(n) _MMIO(0xd70 + (n) * 4)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
873
#define VDN_HCP_POWERGATE_ENABLE(n) REG_BIT(3 + 2 * (n))
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
874
#define VDN_MFX_POWERGATE_ENABLE(n) REG_BIT(4 + 2 * (n))
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
921
#define FORCEWAKE_MEDIA_VDBOX_GEN11(n) _MMIO(0xa540 + (n) * 4)
sys/dev/pci/drm/i915/gt/intel_gt_regs.h
922
#define FORCEWAKE_MEDIA_VEBOX_GEN11(n) _MMIO(0xa560 + (n) * 4)
sys/dev/pci/drm/i915/gt/intel_gtt.h
568
const unsigned short n)
sys/dev/pci/drm/i915/gt/intel_gtt.h
570
return pd->entry[n];
sys/dev/pci/drm/i915/gt/intel_gtt.h
575
const unsigned short n)
sys/dev/pci/drm/i915/gt/intel_gtt.h
577
return pdp->entry[n];
sys/dev/pci/drm/i915/gt/intel_gtt.h
581
i915_page_dir_dma_addr(const struct i915_ppgtt *ppgtt, const unsigned int n)
sys/dev/pci/drm/i915/gt/intel_gtt.h
583
struct i915_page_table *pt = ppgtt->pd->entry[n];
sys/dev/pci/drm/i915/gt/intel_lrc_reg.h
33
#define ASSIGN_CTX_PDP(ppgtt, reg_state, n) do { \
sys/dev/pci/drm/i915/gt/intel_lrc_reg.h
35
const u64 addr__ = i915_page_dir_dma_addr((ppgtt), (n)); \
sys/dev/pci/drm/i915/gt/intel_lrc_reg.h
36
(reg_state__)[CTX_PDP ## n ## _UDW] = upper_32_bits(addr__); \
sys/dev/pci/drm/i915/gt/intel_lrc_reg.h
37
(reg_state__)[CTX_PDP ## n ## _LDW] = lower_32_bits(addr__); \
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
228
int shift, n, pt_sz;
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
256
for (n = 1; n < vm->top; n++) {
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
280
int n, err;
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
282
for (n = 0; n < ARRAY_SIZE(stash->pt); n++) {
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
283
for (pt = stash->pt[n]; pt; pt = pt->stash) {
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
297
int n;
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
299
for (n = 0; n < ARRAY_SIZE(stash->pt); n++) {
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
300
while ((pt = stash->pt[n])) {
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
301
stash->pt[n] = pt->stash;
sys/dev/pci/drm/i915/gt/intel_ppgtt.c
302
free_px(vm, pt, n);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
184
int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
198
for (n = 0; n < ARRAY_SIZE(ce); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
222
ce[n] = tmp;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
24
#define CS_GPR(engine, n) ((engine)->mmio_base + 0x600 + (n) * 4)
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2804
int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2809
for (n = 0; n < ARRAY_SIZE(ce); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2830
ce[n] = tmp;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2851
n = 0;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2864
n++;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2868
engine->name, queue_sz, n,
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2902
for (n = 0; n < ARRAY_SIZE(ce); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2903
if (IS_ERR_OR_NULL(ce[n]))
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2906
intel_context_unpin(ce[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2907
intel_context_put(ce[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2932
int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2942
for (n = 0; n <= 3; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
2944
n * SZ_4K / 4, SZ_4K);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
296
for (n = 0; n < ARRAY_SIZE(ce); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
297
if (IS_ERR_OR_NULL(ce[n]))
sys/dev/pci/drm/i915/gt/selftest_execlists.c
300
intel_context_unpin(ce[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
301
intel_context_put(ce[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3018
struct i915_request *n = list_next_entry(rq, mock.link);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3034
rq = n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
346
int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
360
for (n = 0; n < ARRAY_SIZE(ce); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3646
int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3666
for (n = 0; n < PAGE_SIZE / sizeof(*cs) - 1; n++)
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3667
cs[n] = MI_ARB_CHECK;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3668
cs[n] = MI_BATCH_BUFFER_END;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3677
for (n = 0; n < smoke.ncontext; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3678
smoke.contexts[n] = kernel_context(smoke.gt->i915, NULL);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3679
if (!smoke.contexts[n])
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3683
for (n = 0; n < ARRAY_SIZE(phase); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3684
err = smoke_crescendo(&smoke, phase[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3688
err = smoke_random(&smoke, phase[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3697
for (n = 0; n < smoke.ncontext; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3698
if (!smoke.contexts[n])
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3700
kernel_context_close(smoke.contexts[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3721
unsigned long n, prime, nc;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3728
for (n = 0; n < nctx; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3729
ve[n] = intel_engine_create_virtual(siblings, nsibling, 0);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3730
if (IS_ERR(ve[n])) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3731
err = PTR_ERR(ve[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3732
nctx = n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3736
err = intel_context_pin(ve[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3738
intel_context_put(ve[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3739
nctx = n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3753
for (n = 0; n < prime; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3769
for (n = 0; n < prime; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
379
ce[n] = tmp;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3843
unsigned int n = 0;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3853
siblings[n++] = gt->engine_class[class][inst];
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3856
return n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3889
int nsibling, n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3895
for (n = 1; n <= nsibling + 1; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3897
n, 0);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3902
err = nop_virtual_engine(gt, siblings, nsibling, n, CHAIN);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3917
unsigned int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3939
for (n = 0; n < nsibling; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3940
request[n] = i915_request_create(ve);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3941
if (IS_ERR(request[n])) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3942
err = PTR_ERR(request[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3943
nsibling = n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3948
request[n]->execution_mask = siblings[nsibling - n - 1]->mask;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3950
i915_request_get(request[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3951
i915_request_add(request[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3954
for (n = 0; n < nsibling; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3955
if (i915_request_wait(request[n], 0, HZ / 10) < 0) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3958
request[n]->fence.context,
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3959
request[n]->fence.seqno);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3963
request[n]->fence.context,
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3964
request[n]->fence.seqno);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3971
if (request[n]->engine != siblings[nsibling - n - 1]) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3973
request[n]->engine->name,
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3974
siblings[nsibling - n - 1]->name);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3985
for (n = 0; n < nsibling; n++)
sys/dev/pci/drm/i915/gt/selftest_execlists.c
3986
i915_request_put(request[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
401
n = 0;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4029
unsigned int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4039
for (n = 0; n < nsibling; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4040
ce = intel_context_create(siblings[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4096
unsigned int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4107
for (n = 0; n < nsibling; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4124
for (n = 0; !err && n < nsibling; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4125
ce = intel_context_create(siblings[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4142
__func__, siblings[n]->name);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
416
n++;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4196
unsigned int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
420
engine->name, n,
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4224
for (n = 0; n < NUM_GPR_DW; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4225
struct intel_engine_cs *engine = siblings[n % nsibling];
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4245
*cs++ = CS_GPR(engine, n);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4246
*cs++ = i915_ggtt_offset(scratch) + n * sizeof(u32);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4250
*cs++ = CS_GPR(engine, (n + 1) % NUM_GPR_DW);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4251
*cs++ = n + 1;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4272
for (n = 0; n < NUM_GPR_DW; n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4273
if (cs[n] != n) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4275
cs[n], n);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4338
unsigned int n;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4356
for (n = 0; n < nsibling; n++)
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4357
st_engine_heartbeat_disable(siblings[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4422
for (n = 0; n < nsibling; n++)
sys/dev/pci/drm/i915/gt/selftest_execlists.c
4423
st_engine_heartbeat_enable(siblings[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
457
for (n = 0; n < ARRAY_SIZE(ce); n++) {
sys/dev/pci/drm/i915/gt/selftest_execlists.c
458
if (IS_ERR_OR_NULL(ce[n]))
sys/dev/pci/drm/i915/gt/selftest_execlists.c
461
intel_context_unpin(ce[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
462
intel_context_put(ce[n]);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
935
int err, i, n = 0;
sys/dev/pci/drm/i915/gt/selftest_execlists.c
937
head = semaphore_queue(outer, vma, n++);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
948
rq = semaphore_queue(engine, vma, n++);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
958
err = release_queue(outer, vma, n, I915_PRIORITY_BARRIER);
sys/dev/pci/drm/i915/gt/selftest_execlists.c
965
outer->name, count, n);
sys/dev/pci/drm/i915/gt/selftest_lrc.c
27
#define CS_GPR(engine, n) ((engine)->mmio_base + 0x600 + (n) * 4)
sys/dev/pci/drm/i915/gt/selftest_lrc.c
417
int n;
sys/dev/pci/drm/i915/gt/selftest_lrc.c
477
for (n = 0; n < MAX_IDX; n++) {
sys/dev/pci/drm/i915/gt/selftest_lrc.c
478
if (cs[n] != expected[n]) {
sys/dev/pci/drm/i915/gt/selftest_lrc.c
480
engine->name, n, cs[n], expected[n]);
sys/dev/pci/drm/i915/gt/selftest_lrc.c
537
int n;
sys/dev/pci/drm/i915/gt/selftest_lrc.c
550
for (n = 0; n < NUM_GPR_DW; n++) {
sys/dev/pci/drm/i915/gt/selftest_lrc.c
551
*cs++ = CS_GPR(ce->engine, n);
sys/dev/pci/drm/i915/gt/selftest_lrc.c
573
int n;
sys/dev/pci/drm/i915/gt/selftest_lrc.c
596
for (n = 0; n < NUM_GPR_DW; n++) {
sys/dev/pci/drm/i915/gt/selftest_lrc.c
598
*cs++ = CS_GPR(ce->engine, n);
sys/dev/pci/drm/i915/gt/selftest_lrc.c
599
*cs++ = i915_ggtt_offset(scratch) + n * sizeof(u32);
sys/dev/pci/drm/i915/gt/selftest_lrc.c
624
int n;
sys/dev/pci/drm/i915/gt/selftest_lrc.c
675
for (n = 0; n < NUM_GPR_DW; n++) {
sys/dev/pci/drm/i915/gt/selftest_lrc.c
676
if (cs[n]) {
sys/dev/pci/drm/i915/gt/selftest_lrc.c
679
n / 2, n & 1 ? "udw" : "ldw",
sys/dev/pci/drm/i915/gt/selftest_lrc.c
680
cs[n]);
sys/dev/pci/drm/i915/gt/selftest_rc6.c
196
int n;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
198
n = 0;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
200
n++;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
201
if (!n)
sys/dev/pci/drm/i915/gt/selftest_rc6.c
204
engines = kmalloc_array(n, sizeof(*engines), GFP_KERNEL);
sys/dev/pci/drm/i915/gt/selftest_rc6.c
208
n = 0;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
210
engines[n++] = engine;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
212
i915_prandom_shuffle(engines, sizeof(*engines), n, prng);
sys/dev/pci/drm/i915/gt/selftest_rc6.c
214
*count = n;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
222
unsigned int n, count;
sys/dev/pci/drm/i915/gt/selftest_rc6.c
234
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gt/selftest_rc6.c
235
struct intel_engine_cs *engine = engines[n];
sys/dev/pci/drm/i915/gt/selftest_timeline.c
531
unsigned long count, n;
sys/dev/pci/drm/i915/gt/selftest_timeline.c
552
for (n = 0; n < NUM_TIMELINES; n++) {
sys/dev/pci/drm/i915/gt/selftest_timeline.c
581
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gt/selftest_timeline.c
582
struct intel_timeline *tl = timelines[n];
sys/dev/pci/drm/i915/gt/selftest_timeline.c
584
if (!err && READ_ONCE(*tl->hwsp_seqno) != n) {
sys/dev/pci/drm/i915/gt/selftest_timeline.c
586
n, tl->fence_context, tl->hwsp_offset, *tl->hwsp_seqno);
sys/dev/pci/drm/i915/gt/selftest_timeline.c
605
unsigned long count, n;
sys/dev/pci/drm/i915/gt/selftest_timeline.c
621
for (n = 0; n < NUM_TIMELINES; n++) {
sys/dev/pci/drm/i915/gt/selftest_timeline.c
653
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gt/selftest_timeline.c
654
struct intel_timeline *tl = timelines[n];
sys/dev/pci/drm/i915/gt/selftest_timeline.c
656
if (!err && READ_ONCE(*tl->hwsp_seqno) != n) {
sys/dev/pci/drm/i915/gt/selftest_timeline.c
658
n, tl->fence_context, tl->hwsp_offset, *tl->hwsp_seqno);
sys/dev/pci/drm/i915/gt/sysfs_engines.c
110
for_each_set_bit(n, &caps, show_unknown ? BITS_PER_LONG : count) {
sys/dev/pci/drm/i915/gt/sysfs_engines.c
111
if (n >= count || !repr[n]) {
sys/dev/pci/drm/i915/gt/sysfs_engines.c
113
len += sysfs_emit_at(buf, len, "[%x] ", n);
sys/dev/pci/drm/i915/gt/sysfs_engines.c
115
len += sysfs_emit_at(buf, len, "%s ", repr[n]);
sys/dev/pci/drm/i915/gt/sysfs_engines.c
88
int count, n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1536
struct __guc_capture_parsed_output *n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1551
list_for_each_entry(n, &guc->capture->outlist, link) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1552
if (n->eng_inst == GUC_ID_TO_ENGINE_INSTANCE(engine->guc_id) &&
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1553
n->eng_class == GUC_ID_TO_ENGINE_CLASS(engine->guc_id) &&
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1554
n->guc_id == ce->guc_id.id &&
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1555
(n->lrca & CTX_GTT_ADDRESS_MASK) == (ce->lrc.lrca & CTX_GTT_ADDRESS_MASK))
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1566
struct __guc_capture_parsed_output *n, *ntmp;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1583
list_for_each_entry_safe(n, ntmp, &guc->capture->outlist, link) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1584
if (n->eng_inst == GUC_ID_TO_ENGINE_INSTANCE(ee->engine->guc_id) &&
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1585
n->eng_class == GUC_ID_TO_ENGINE_CLASS(ee->engine->guc_id) &&
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1586
n->guc_id == ce->guc_id.id &&
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1587
(n->lrca & CTX_GTT_ADDRESS_MASK) == (ce->lrc.lrca & CTX_GTT_ADDRESS_MASK)) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1588
list_del(&n->link);
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
1589
ee->guc_capture_node = n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
898
struct __guc_capture_parsed_output *n, *ntmp;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
905
list_for_each_entry_safe(n, ntmp, &guc->capture->outlist, link)
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
906
guc_capture_delete_one_node(guc, n);
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
908
list_for_each_entry_safe(n, ntmp, &guc->capture->cachelist, link)
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
909
guc_capture_delete_one_node(guc, n);
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
957
struct __guc_capture_parsed_output *n, *ntmp;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
960
list_for_each_entry_safe(n, ntmp, &guc->capture->cachelist, link) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
961
found = n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
962
list_del(&n->link);
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
966
struct __guc_capture_parsed_output *n, *ntmp;
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
969
list_for_each_entry_safe(n, ntmp, &guc->capture->outlist, link) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_capture.c
970
found = n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
1006
unsigned int n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
1012
for (n = 0; n < ARRAY_SIZE(ct->requests.lost_and_found); n++) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
1013
if (ct->requests.lost_and_found[n].fence != fence)
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
1019
if (buf && stack_depot_snprint(ct->requests.lost_and_found[n].stack,
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
1022
fence, ct->requests.lost_and_found[n].action, buf);
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
1027
fence, ct->requests.lost_and_found[n].action);
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
413
unsigned int n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
415
n = stack_trace_save(entries, ARRAY_SIZE(entries), 1);
sys/dev/pci/drm/i915/gt/uc/intel_guc_ct.c
418
ct->requests.lost_and_found[lost].stack = stack_depot_save(entries, n, GFP_NOWAIT);
sys/dev/pci/drm/i915/gt/uc/intel_guc_reg.h
35
#define SOFT_SCRATCH(n) _MMIO(0xc180 + (n) * 4)
sys/dev/pci/drm/i915/gt/uc/intel_guc_reg.h
38
#define GEN11_SOFT_SCRATCH(n) _MMIO(0x190240 + (n) * 4)
sys/dev/pci/drm/i915/gt/uc/intel_guc_reg.h
39
#define MEDIA_SOFT_SCRATCH(n) _MMIO(0x190310 + (n) * 4)
sys/dev/pci/drm/i915/gt/uc/intel_guc_submission.c
5907
unsigned int n;
sys/dev/pci/drm/i915/gt/uc/intel_guc_submission.c
5945
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_submission.c
5946
struct intel_engine_cs *sibling = siblings[n];
sys/dev/pci/drm/i915/gt/uc/intel_guc_submission.c
5959
if (n != 0 && ve->base.class != sibling->class) {
sys/dev/pci/drm/i915/gt/uc/intel_guc_submission.c
5964
} else if (n == 0) {
sys/dev/pci/drm/i915/gvt/dmabuf.c
574
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/dmabuf.c
578
list_for_each_safe(pos, n, &vgpu->dmabuf_obj_list_head) {
sys/dev/pci/drm/i915/gvt/gtt.c
1487
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
1494
list_for_each_safe(pos, n, &vgpu->gtt.oos_page_list_head) {
sys/dev/pci/drm/i915/gvt/gtt.c
1600
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
1606
list_for_each_safe(pos, n, &vgpu->gtt.post_shadow_list_head) {
sys/dev/pci/drm/i915/gvt/gtt.c
1954
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
1958
list_for_each_safe(pos, n, &gvt->gtt.ppgtt_mm_lru_list_head) {
sys/dev/pci/drm/i915/gvt/gtt.c
2155
struct intel_gvt_partial_pte *partial_pte, *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
2178
list_for_each_entry_safe(pos, n,
sys/dev/pci/drm/i915/gvt/gtt.c
2425
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
2428
list_for_each_safe(pos, n, &vgpu->gtt.ppgtt_mm_list_head) {
sys/dev/pci/drm/i915/gvt/gtt.c
2477
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
2483
list_for_each_safe(pos, n, >t->oos_page_free_list_head) {
sys/dev/pci/drm/i915/gvt/gtt.c
2698
struct list_head *pos, *n;
sys/dev/pci/drm/i915/gvt/gtt.c
2701
list_for_each_safe(pos, n, &vgpu->gtt.ppgtt_mm_list_head) {
sys/dev/pci/drm/i915/gvt/handlers.c
512
int refclk, n, p, r;
sys/dev/pci/drm/i915/gvt/handlers.c
534
n = (wrpll_ctl & WRPLL_DIVIDER_FB_MASK) >> WRPLL_DIVIDER_FB_SHIFT;
sys/dev/pci/drm/i915/gvt/handlers.c
536
dp_br = (refclk * n / 10) / (p * r) * 2;
sys/dev/pci/drm/i915/gvt/handlers.c
590
clock.n = REG_FIELD_GET(PORT_PLL_N_MASK,
sys/dev/pci/drm/i915/gvt/handlers.c
599
if (clock.n == 0 || clock.p == 0) {
sys/dev/pci/drm/i915/gvt/handlers.c
604
clock.vco = DIV_ROUND_CLOSEST_ULL(mul_u32_u32(refclk, clock.m), clock.n << 22);
sys/dev/pci/drm/i915/gvt/scheduler.c
1053
struct intel_vgpu_workload *pos, *n;
sys/dev/pci/drm/i915/gvt/scheduler.c
1058
list_for_each_entry_safe(pos, n,
sys/dev/pci/drm/i915/i915_active.c
129
struct active_node *it, *n;
sys/dev/pci/drm/i915/i915_active.c
170
rbtree_postorder_for_each_entry_safe(it, n, &root, node) {
sys/dev/pci/drm/i915/i915_active.c
579
struct active_node *it, *n;
sys/dev/pci/drm/i915/i915_active.c
583
rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {
sys/dev/pci/drm/i915/i915_active.c
702
struct active_node *it, *n;
sys/dev/pci/drm/i915/i915_active.c
704
rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {
sys/dev/pci/drm/i915/i915_cmd_parser.c
1193
unsigned long x, n, remain;
sys/dev/pci/drm/i915/i915_cmd_parser.c
1216
for (n = offset >> PAGE_SHIFT; remain; n++) {
sys/dev/pci/drm/i915/i915_cmd_parser.c
1219
src = kmap_local_page(i915_gem_object_get_page(src_obj, n));
sys/dev/pci/drm/i915/i915_gpu_error.c
1120
struct vm_page *page, *n;
sys/dev/pci/drm/i915/i915_gpu_error.c
1122
list_for_each_entry_safe(page, n, &vma->page_list, lru) {
sys/dev/pci/drm/i915/i915_gpu_error.c
1300
struct vm_page *page, *n;
sys/dev/pci/drm/i915/i915_gpu_error.c
1302
list_for_each_entry_safe_reverse(page, n, &dst->page_list, lru) {
sys/dev/pci/drm/i915/i915_gpu_error.c
1499
unsigned int n = 0;
sys/dev/pci/drm/i915/i915_gpu_error.c
1502
record_request(*port++, &ee->execlist[n++]);
sys/dev/pci/drm/i915/i915_gpu_error.c
1504
ee->num_ports = n;
sys/dev/pci/drm/i915/i915_gpu_error.c
563
int n;
sys/dev/pci/drm/i915/i915_gpu_error.c
627
for (n = 0; n < ee->num_ports; n++) {
sys/dev/pci/drm/i915/i915_gpu_error.c
628
err_printf(m, " ELSP[%d]:", n);
sys/dev/pci/drm/i915/i915_gpu_error.c
629
error_print_request(m, " ", &ee->execlist[n]);
sys/dev/pci/drm/i915/i915_ptr_util.h
11
(typeof(ptr))(__v & -BIT(n)); \
sys/dev/pci/drm/i915/i915_ptr_util.h
14
#define ptr_unmask_bits(ptr, n) ((unsigned long)(ptr) & (BIT(n) - 1))
sys/dev/pci/drm/i915/i915_ptr_util.h
16
#define ptr_unpack_bits(ptr, bits, n) ({ \
sys/dev/pci/drm/i915/i915_ptr_util.h
18
*(bits) = __v & (BIT(n) - 1); \
sys/dev/pci/drm/i915/i915_ptr_util.h
19
(typeof(ptr))(__v & -BIT(n)); \
sys/dev/pci/drm/i915/i915_ptr_util.h
22
#define ptr_pack_bits(ptr, bits, n) ({ \
sys/dev/pci/drm/i915/i915_ptr_util.h
24
GEM_BUG_ON(__bits & -BIT(n)); \
sys/dev/pci/drm/i915/i915_ptr_util.h
9
#define ptr_mask_bits(ptr, n) ({ \
sys/dev/pci/drm/i915/i915_reg.h
1205
#define GEN7_SO_WRITE_OFFSET(n) _MMIO(0x5280 + (n) * 4)
sys/dev/pci/drm/i915/i915_reg_defs.h
21
#define REG_BIT(n) BIT_U32(n)
sys/dev/pci/drm/i915/i915_reg_defs.h
22
#define REG_BIT64(n) BIT_U64(n)
sys/dev/pci/drm/i915/i915_reg_defs.h
23
#define REG_BIT16(n) BIT_U16(n)
sys/dev/pci/drm/i915/i915_reg_defs.h
24
#define REG_BIT8(n) BIT_U8(n)
sys/dev/pci/drm/i915/i915_scheduler.h
22
#define priolist_for_each_request_consume(it, n, plist) \
sys/dev/pci/drm/i915/i915_scheduler.h
23
list_for_each_entry_safe(it, n, &(plist)->requests, sched.link)
sys/dev/pci/drm/i915/i915_utils.h
100
return (n != 0 && ((n & (n - 1)) == 0));
sys/dev/pci/drm/i915/i915_utils.h
98
static inline bool is_power_of_2_u64(u64 n)
sys/dev/pci/drm/i915/intel_uncore.c
413
u32 n;
sys/dev/pci/drm/i915/intel_uncore.c
418
n = fifo_free_entries(uncore);
sys/dev/pci/drm/i915/intel_uncore.c
420
n = uncore->fifo_count;
sys/dev/pci/drm/i915/intel_uncore.c
422
if (n <= GT_FIFO_NUM_RESERVED_ENTRIES) {
sys/dev/pci/drm/i915/intel_uncore.c
423
if (wait_for_atomic((n = fifo_free_entries(uncore)) >
sys/dev/pci/drm/i915/intel_uncore.c
427
"GT_FIFO timeout, entries: %u\n", n);
sys/dev/pci/drm/i915/intel_uncore.c
432
uncore->fifo_count = n - 1;
sys/dev/pci/drm/i915/selftests/i915_active.c
287
struct active_node *it, *n;
sys/dev/pci/drm/i915/selftests/i915_active.c
289
rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) {
sys/dev/pci/drm/i915/selftests/i915_active.c
335
struct active_node *it, *n;
sys/dev/pci/drm/i915/selftests/i915_active.c
340
rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node)
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1353
unsigned int *order, n;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1380
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1381
u64 offset = tmp.start + n * PAGE_SIZE;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1397
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1398
u64 offset = tmp.start + order[n] * PAGE_SIZE;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1402
iowrite32(n, vaddr + n);
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1408
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1409
u64 offset = tmp.start + order[n] * PAGE_SIZE;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1414
val = ioread32(vaddr + n);
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1417
if (val != n) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
1419
val, n);
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
262
unsigned int *order, count, n;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
311
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
312
u64 addr = hole_start + order[n] * BIT_ULL(aligned_size);
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
319
__func__, n, count)) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
367
count = n;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
370
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
371
u64 addr = hole_start + order[n] * BIT_ULL(aligned_size);
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
811
unsigned int *order, count, n;
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
857
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
858
u64 addr = hole_start + order[n] * BIT_ULL(aligned_size);
sys/dev/pci/drm/i915/selftests/i915_gem_gtt.c
886
__func__, n, count)) {
sys/dev/pci/drm/i915/selftests/i915_request.c
1053
unsigned long n, prime;
sys/dev/pci/drm/i915/selftests/i915_request.c
1078
for (n = 0; n < prime; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
1735
unsigned int n, idx;
sys/dev/pci/drm/i915/selftests/i915_request.c
1777
for (n = 0; n < smoke[0].ncontexts; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
1778
smoke[0].contexts[n] = live_context(i915, file);
sys/dev/pci/drm/i915/selftests/i915_request.c
1779
if (IS_ERR(smoke[0].contexts[n])) {
sys/dev/pci/drm/i915/selftests/i915_request.c
1780
ret = PTR_ERR(smoke[0].contexts[n]);
sys/dev/pci/drm/i915/selftests/i915_request.c
1804
for (n = 0; n < ncpus; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
1805
unsigned int i = idx * ncpus + n;
sys/dev/pci/drm/i915/selftests/i915_request.c
1808
worker = kthread_run_worker(0, "igt/%d.%d", idx, n);
sys/dev/pci/drm/i915/selftests/i915_request.c
1832
for (n = 0; n < ncpus; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
1833
unsigned int i = idx * ncpus + n;
sys/dev/pci/drm/i915/selftests/i915_request.c
344
unsigned int n, count;
sys/dev/pci/drm/i915/selftests/i915_request.c
363
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
365
t->contexts[order[n] % t->ncontexts];
sys/dev/pci/drm/i915/selftests/i915_request.c
375
count = n;
sys/dev/pci/drm/i915/selftests/i915_request.c
383
requests[n] = i915_request_get(rq);
sys/dev/pci/drm/i915/selftests/i915_request.c
394
count = n;
sys/dev/pci/drm/i915/selftests/i915_request.c
419
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
420
struct i915_request *rq = requests[n];
sys/dev/pci/drm/i915/selftests/i915_request.c
464
unsigned int n;
sys/dev/pci/drm/i915/selftests/i915_request.c
483
for (n = 0; n < t.ncontexts; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
484
t.contexts[n] = mock_context(t.engine->i915, "mock");
sys/dev/pci/drm/i915/selftests/i915_request.c
485
if (!t.contexts[n]) {
sys/dev/pci/drm/i915/selftests/i915_request.c
491
for (n = 0; n < ncpus; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
494
worker = kthread_run_worker(0, "igt/%d", n);
sys/dev/pci/drm/i915/selftests/i915_request.c
497
ncpus = n;
sys/dev/pci/drm/i915/selftests/i915_request.c
501
threads[n].worker = worker;
sys/dev/pci/drm/i915/selftests/i915_request.c
502
threads[n].t = &t;
sys/dev/pci/drm/i915/selftests/i915_request.c
503
threads[n].stop = false;
sys/dev/pci/drm/i915/selftests/i915_request.c
504
threads[n].result = 0;
sys/dev/pci/drm/i915/selftests/i915_request.c
506
kthread_init_work(&threads[n].work,
sys/dev/pci/drm/i915/selftests/i915_request.c
508
kthread_queue_work(worker, &threads[n].work);
sys/dev/pci/drm/i915/selftests/i915_request.c
513
for (n = 0; n < ncpus; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
516
WRITE_ONCE(threads[n].stop, true);
sys/dev/pci/drm/i915/selftests/i915_request.c
517
kthread_flush_work(&threads[n].work);
sys/dev/pci/drm/i915/selftests/i915_request.c
518
err = READ_ONCE(threads[n].result);
sys/dev/pci/drm/i915/selftests/i915_request.c
522
kthread_destroy_worker(threads[n].worker);
sys/dev/pci/drm/i915/selftests/i915_request.c
530
for (n = 0; n < t.ncontexts; n++) {
sys/dev/pci/drm/i915/selftests/i915_request.c
531
if (!t.contexts[n])
sys/dev/pci/drm/i915/selftests/i915_request.c
533
mock_context_close(t.contexts[n]);
sys/dev/pci/drm/i915/selftests/i915_request.c
580
unsigned long n, prime;
sys/dev/pci/drm/i915/selftests/i915_request.c
594
for (n = 0; n < prime; n++) {
sys/dev/pci/drm/i915/selftests/i915_selftest.c
100
#define param(n) __PASTE(igt__, __PASTE(__LINE__, __mock_##n))
sys/dev/pci/drm/i915/selftests/i915_selftest.c
101
#define selftest_0(n, func, id) \
sys/dev/pci/drm/i915/selftests/i915_selftest.c
102
module_param_named(id, mock_selftests[mock_##n].enabled, bool, 0400);
sys/dev/pci/drm/i915/selftests/i915_selftest.c
107
#define param(n) __PASTE(igt__, __PASTE(__LINE__, __live_##n))
sys/dev/pci/drm/i915/selftests/i915_selftest.c
108
#define selftest_0(n, func, id) \
sys/dev/pci/drm/i915/selftests/i915_selftest.c
109
module_param_named(id, live_selftests[live_##n].enabled, bool, 0400);
sys/dev/pci/drm/i915/selftests/i915_selftest.c
114
#define param(n) __PASTE(igt__, __PASTE(__LINE__, __perf_##n))
sys/dev/pci/drm/i915/selftests/i915_selftest.c
115
#define selftest_0(n, func, id) \
sys/dev/pci/drm/i915/selftests/i915_selftest.c
116
module_param_named(id, perf_selftests[perf_##n].enabled, bool, 0400);
sys/dev/pci/drm/i915/selftests/i915_selftest.c
80
#define selftest(n, f) [mock_##n] = { .name = #n, { .mock = f } },
sys/dev/pci/drm/i915/selftests/i915_selftest.c
86
#define selftest(n, f) [live_##n] = { .name = #n, { .live = f } },
sys/dev/pci/drm/i915/selftests/i915_selftest.c
92
#define selftest(n, f) [perf_##n] = { .name = #n, { .live = f } },
sys/dev/pci/drm/i915/selftests/i915_selftest.c
99
#define selftest(n, func) selftest_0(n, func, param(n))
sys/dev/pci/drm/i915/selftests/i915_vma.c
364
unsigned int n,
sys/dev/pci/drm/i915/selftests/i915_vma.c
368
return (r->plane[n].src_stride * (r->plane[n].height - y - 1) +
sys/dev/pci/drm/i915/selftests/i915_vma.c
369
r->plane[n].offset + x);
sys/dev/pci/drm/i915/selftests/i915_vma.c
374
const struct intel_rotation_info *r, unsigned int n,
sys/dev/pci/drm/i915/selftests/i915_vma.c
379
for (x = 0; x < r->plane[n].width; x++) {
sys/dev/pci/drm/i915/selftests/i915_vma.c
382
for (y = 0; y < r->plane[n].height; y++) {
sys/dev/pci/drm/i915/selftests/i915_vma.c
388
n, x, y);
sys/dev/pci/drm/i915/selftests/i915_vma.c
392
src_idx = rotated_index(r, n, x, y);
sys/dev/pci/drm/i915/selftests/i915_vma.c
411
left = (r->plane[n].dst_stride - y) * PAGE_SIZE;
sys/dev/pci/drm/i915/selftests/i915_vma.c
418
n, x, y);
sys/dev/pci/drm/i915/selftests/i915_vma.c
441
unsigned int n,
sys/dev/pci/drm/i915/selftests/i915_vma.c
445
return (r->plane[n].src_stride * y +
sys/dev/pci/drm/i915/selftests/i915_vma.c
446
r->plane[n].offset + x);
sys/dev/pci/drm/i915/selftests/i915_vma.c
451
const struct intel_remapped_info *r, unsigned int n,
sys/dev/pci/drm/i915/selftests/i915_vma.c
458
for (y = 0; y < r->plane[n].height; y++) {
sys/dev/pci/drm/i915/selftests/i915_vma.c
459
for (x = 0; x < r->plane[n].width; x++) {
sys/dev/pci/drm/i915/selftests/i915_vma.c
465
n, x, y);
sys/dev/pci/drm/i915/selftests/i915_vma.c
473
src_idx = remapped_index(r, n, x, y);
sys/dev/pci/drm/i915/selftests/i915_vma.c
504
left = (r->plane[n].dst_stride - r->plane[n].width) * PAGE_SIZE;
sys/dev/pci/drm/i915/selftests/i915_vma.c
511
n, x, y);
sys/dev/pci/drm/i915/selftests/i915_vma.c
601
unsigned int n, max_offset;
sys/dev/pci/drm/i915/selftests/i915_vma.c
674
for (n = 0; n < ARRAY_SIZE(view.rotated.plane); n++) {
sys/dev/pci/drm/i915/selftests/i915_vma.c
676
sg = assert_rotated(obj, &view.rotated, n, sg);
sys/dev/pci/drm/i915/selftests/i915_vma.c
678
sg = assert_remapped(obj, &view.remapped, n, sg);
sys/dev/pci/drm/i915/selftests/i915_vma.c
682
"rotated" : "remapped", n,
sys/dev/pci/drm/i915/selftests/intel_memory_region.c
677
unsigned long n = obj->base.size >> PAGE_SHIFT;
sys/dev/pci/drm/i915/selftests/intel_memory_region.c
690
while (n--) {
sys/dev/pci/drm/i915/selftests/intel_memory_region.c
717
int i, n;
sys/dev/pci/drm/i915/selftests/intel_memory_region.c
722
n = 0;
sys/dev/pci/drm/i915/selftests/intel_memory_region.c
730
n++;
sys/dev/pci/drm/i915/selftests/intel_memory_region.c
733
if (!n)
sys/dev/pci/drm/i915/selftests/scatterlist.c
165
static unsigned int one(unsigned long n,
sys/dev/pci/drm/i915/selftests/scatterlist.c
172
static unsigned int grow(unsigned long n,
sys/dev/pci/drm/i915/selftests/scatterlist.c
176
return n + 1;
sys/dev/pci/drm/i915/selftests/scatterlist.c
179
static unsigned int shrink(unsigned long n,
sys/dev/pci/drm/i915/selftests/scatterlist.c
183
return count - n;
sys/dev/pci/drm/i915/selftests/scatterlist.c
186
static unsigned int random(unsigned long n,
sys/dev/pci/drm/i915/selftests/scatterlist.c
193
static unsigned int random_page_size_pages(unsigned long n,
sys/dev/pci/drm/i915/selftests/scatterlist.c
221
unsigned long n, pfn;
sys/dev/pci/drm/i915/selftests/scatterlist.c
241
for (n = 0; n < count; n++) {
sys/dev/pci/drm/i915/selftests/scatterlist.c
242
unsigned long npages = npages_fn(n, count, rnd);
sys/dev/pci/drm/i915/selftests/scatterlist.c
252
if (n)
sys/dev/pci/drm/i915/selftests/scatterlist.c
263
pt->st.nents = n;
sys/dev/pci/drm/i915/selftests/scatterlist.c
37
typedef unsigned int (*npages_fn_t)(unsigned long n,
sys/dev/pci/drm/i915/selftests/scatterlist.c
48
unsigned long pfn, n;
sys/dev/pci/drm/i915/selftests/scatterlist.c
51
for_each_sg(pt->st.sgl, sg, pt->st.nents, n) {
sys/dev/pci/drm/i915/selftests/scatterlist.c
53
unsigned int npages = npages_fn(n, pt->st.nents, rnd);
sys/dev/pci/drm/include/asm/byteorder.h
33
le16_add_cpu(uint16_t *p, uint16_t n)
sys/dev/pci/drm/include/asm/byteorder.h
35
htolem16(p, lemtoh16(p) + n);
sys/dev/pci/drm/include/asm/div64.h
10
uint32_t __rem = ((uint64_t)(n)) % __base; \
sys/dev/pci/drm/include/asm/div64.h
11
(n) = ((uint64_t)(n)) / __base; \
sys/dev/pci/drm/include/asm/div64.h
8
#define do_div(n, base) ({ \
sys/dev/pci/drm/include/drm/drm_color_mgmt.h
53
u64 drm_color_ctm_s31_32_to_qm_n(u64 user_input, u32 m, u32 n);
sys/dev/pci/drm/include/drm/drm_ioctl.h
71
#define DRM_IOCTL_NR(n) _IOC_NR(n)
sys/dev/pci/drm/include/drm/drm_ioctl.h
72
#define DRM_IOCTL_TYPE(n) _IOC_TYPE(n)
sys/dev/pci/drm/include/drm/drm_ioctl.h
75
#define DRM_IOCTL_NR(n) ((n) & 0xff)
sys/dev/pci/drm/include/drm/drm_ioctl.h
76
#define DRM_IOCTL_TYPE(n) IOCGROUP(n)
sys/dev/pci/drm/include/drm/task_barrier.h
104
task_barrier_signal_turnstile(&tb->exit_turnstile, tb->n);
sys/dev/pci/drm/include/drm/task_barrier.h
40
unsigned int n;
sys/dev/pci/drm/include/drm/task_barrier.h
47
unsigned int n)
sys/dev/pci/drm/include/drm/task_barrier.h
53
for (i = 0 ; i < n; i++)
sys/dev/pci/drm/include/drm/task_barrier.h
60
tb->n = 0;
sys/dev/pci/drm/include/drm/task_barrier.h
71
tb->n++;
sys/dev/pci/drm/include/drm/task_barrier.h
76
tb->n--;
sys/dev/pci/drm/include/drm/task_barrier.h
86
if (atomic_inc_return(&tb->count) == tb->n)
sys/dev/pci/drm/include/drm/task_barrier.h
87
task_barrier_signal_turnstile(&tb->enter_turnstile, tb->n);
sys/dev/pci/drm/include/linux/atomic.h
102
} while (__sync_val_compare_and_swap(v, o, o +n) != o);
sys/dev/pci/drm/include/linux/atomic.h
137
atomic64_xchg(atomic64_t *v, int64_t n)
sys/dev/pci/drm/include/linux/atomic.h
140
return __sync_lock_test_and_set(v, n);
sys/dev/pci/drm/include/linux/atomic.h
144
atomic64_cmpxchg(atomic64_t *v, int64_t o, int64_t n)
sys/dev/pci/drm/include/linux/atomic.h
146
return __sync_val_compare_and_swap(v, o, n);
sys/dev/pci/drm/include/linux/atomic.h
149
#define atomic64_add(n, p) __sync_fetch_and_add_8(p, n)
sys/dev/pci/drm/include/linux/atomic.h
150
#define atomic64_sub(n, p) __sync_fetch_and_sub_8(p, n)
sys/dev/pci/drm/include/linux/atomic.h
152
#define atomic64_add_return(n, p) __sync_add_and_fetch_8(p, n)
sys/dev/pci/drm/include/linux/atomic.h
186
atomic64_xchg(atomic64_t *v, int64_t n)
sys/dev/pci/drm/include/linux/atomic.h
192
v->val = n;
sys/dev/pci/drm/include/linux/atomic.h
235
#define atomic_long_xchg(v, n) atomic64_xchg(v, n)
sys/dev/pci/drm/include/linux/atomic.h
236
#define atomic_long_cmpxchg(p, o, n) atomic_cmpxchg(p, o, n)
sys/dev/pci/drm/include/linux/atomic.h
242
#define atomic_long_xchg(v, n) atomic_xchg(v, n)
sys/dev/pci/drm/include/linux/atomic.h
243
#define atomic_long_cmpxchg(p, o, n) atomic_cmpxchg(p, o, n)
sys/dev/pci/drm/include/linux/atomic.h
48
#define atomic_add(n, p) __sync_fetch_and_add(p, n)
sys/dev/pci/drm/include/linux/atomic.h
49
#define atomic_sub(n, p) __sync_fetch_and_sub(p, n)
sys/dev/pci/drm/include/linux/atomic.h
50
#define atomic_and(n, p) __sync_fetch_and_and(p, n)
sys/dev/pci/drm/include/linux/atomic.h
51
#define atomic_or(n, p) atomic_setbits_int(p, n)
sys/dev/pci/drm/include/linux/atomic.h
52
#define atomic_add_return(n, p) __sync_add_and_fetch(p, n)
sys/dev/pci/drm/include/linux/atomic.h
53
#define atomic_sub_return(n, p) __sync_sub_and_fetch(p, n)
sys/dev/pci/drm/include/linux/atomic.h
54
#define atomic_sub_and_test(n, p) (atomic_sub_return(n, p) == 0)
sys/dev/pci/drm/include/linux/atomic.h
59
#define atomic_cmpxchg(p, o, n) __sync_val_compare_and_swap(p, o, n)
sys/dev/pci/drm/include/linux/atomic.h
60
#define cmpxchg(p, o, n) __sync_val_compare_and_swap(p, o, n)
sys/dev/pci/drm/include/linux/atomic.h
61
#define cmpxchg64(p, o, n) __sync_val_compare_and_swap(p, o, n)
sys/dev/pci/drm/include/linux/atomic.h
64
#define atomic_fetch_xor(n, p) __sync_fetch_and_xor(p, n)
sys/dev/pci/drm/include/linux/atomic.h
66
#define try_cmpxchg(p, op, n) \
sys/dev/pci/drm/include/linux/atomic.h
70
__typeof(*(p)) __p = __sync_val_compare_and_swap((p), (__o), (n)); \
sys/dev/pci/drm/include/linux/atomic.h
76
#define try_cmpxchg64(p, op, n) try_cmpxchg(p, op, n)
sys/dev/pci/drm/include/linux/atomic.h
79
atomic_try_cmpxchg(volatile int *p, int *op, int n)
sys/dev/pci/drm/include/linux/atomic.h
81
return try_cmpxchg(p, op, n);
sys/dev/pci/drm/include/linux/atomic.h
85
atomic_xchg(volatile int *v, int n)
sys/dev/pci/drm/include/linux/atomic.h
88
return __sync_lock_test_and_set(v, n);
sys/dev/pci/drm/include/linux/atomic.h
91
#define xchg(v, n) __sync_lock_test_and_set(v, n)
sys/dev/pci/drm/include/linux/atomic.h
94
atomic_add_unless(volatile int *v, int n, int u)
sys/dev/pci/drm/include/linux/bitmap.h
101
bitmap_intersects(const void *s1, const void *s2, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
107
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
110
if ((n % 32) != 0)
sys/dev/pci/drm/include/linux/bitmap.h
111
if ((b1[n >> 5] & b2[b >> 5]) & (0xffffffff >> (32 - (n % 32))))
sys/dev/pci/drm/include/linux/bitmap.h
118
bitmap_copy(void *d, const void *s, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
124
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
129
bitmap_to_arr32(void *d, const unsigned long *src, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
135
for (b = 0; b < n; b += 32) {
sys/dev/pci/drm/include/linux/bitmap.h
138
if (b < n)
sys/dev/pci/drm/include/linux/bitmap.h
142
bitmap_copy(d, src, n);
sys/dev/pci/drm/include/linux/bitmap.h
144
if ((n % 32) != 0)
sys/dev/pci/drm/include/linux/bitmap.h
145
dst[n >> 5] &= (0xffffffff >> (32 - (n % 32)));
sys/dev/pci/drm/include/linux/bitmap.h
149
bitmap_from_arr32(unsigned long *dst, const void *s, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
155
for (b = 0; b < n; b += 32) {
sys/dev/pci/drm/include/linux/bitmap.h
158
if (b < n)
sys/dev/pci/drm/include/linux/bitmap.h
161
if ((n % 64) != 0)
sys/dev/pci/drm/include/linux/bitmap.h
162
dst[n >> 6] &= (0xffffffffffffffffUL >> (64 - (n % 64)));
sys/dev/pci/drm/include/linux/bitmap.h
164
bitmap_copy(dst, s, n);
sys/dev/pci/drm/include/linux/bitmap.h
165
if ((n % 32) != 0)
sys/dev/pci/drm/include/linux/bitmap.h
166
dst[n >> 5] &= (0xffffffff >> (32 - (n % 32)));
sys/dev/pci/drm/include/linux/bitmap.h
171
bitmap_weight(const void *p, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
177
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
183
bitmap_find_free_region(void *p, u_int n, int o)
sys/dev/pci/drm/include/linux/bitmap.h
188
b = find_first_zero_bit(p, n);
sys/dev/pci/drm/include/linux/bitmap.h
189
if (b == n)
sys/dev/pci/drm/include/linux/bitmap.h
25
#define bitmap_empty(p, n) (find_first_bit(p, n) == n)
sys/dev/pci/drm/include/linux/bitmap.h
28
bitmap_set(void *p, int b, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
30
u_int end = b + n;
sys/dev/pci/drm/include/linux/bitmap.h
37
bitmap_clear(void *p, int b, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
39
u_int end = b + n;
sys/dev/pci/drm/include/linux/bitmap.h
46
bitmap_zero(void *p, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
51
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
56
bitmap_fill(void *p, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
61
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
66
bitmap_or(void *d, const void *s1, const void *s2, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
73
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
78
bitmap_andnot(void *d, void *s1, void *s2, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
85
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/bitmap.h
90
bitmap_complement(void *d, void *s, u_int n)
sys/dev/pci/drm/include/linux/bitmap.h
96
for (b = 0; b < n; b += 32)
sys/dev/pci/drm/include/linux/dma-mapping.h
12
#define DMA_BIT_MASK(n) (((n) == 64) ? ~0ULL : (1ULL<<(n)) -1)
sys/dev/pci/drm/include/linux/io.h
15
#define memcpy_toio(d, s, n) memcpy(d, s, n)
sys/dev/pci/drm/include/linux/io.h
16
#define memcpy_fromio(d, s, n) memcpy(d, s, n)
sys/dev/pci/drm/include/linux/io.h
17
#define memset_io(d, b, n) memset(d, b, n)
sys/dev/pci/drm/include/linux/iosys-map.h
20
iosys_map_incr(struct iosys_map *ism, size_t n)
sys/dev/pci/drm/include/linux/iosys-map.h
23
ism->vaddr_iomem += n;
sys/dev/pci/drm/include/linux/iosys-map.h
25
ism->vaddr += n;
sys/dev/pci/drm/include/linux/list.h
180
#define list_safe_reset_next(pos, n, member) \
sys/dev/pci/drm/include/linux/list.h
181
n = list_next_entry(pos, member)
sys/dev/pci/drm/include/linux/list.h
195
#define list_for_each_entry_safe_reverse(pos, n, head, member) \
sys/dev/pci/drm/include/linux/list.h
197
n = list_entry((pos)->member.prev, __typeof(*pos), member); \
sys/dev/pci/drm/include/linux/list.h
199
pos = n, n = list_entry(n->member.prev, __typeof(*n), member))
sys/dev/pci/drm/include/linux/list.h
201
#define list_for_each_entry_safe_from(pos, n, head, member) \
sys/dev/pci/drm/include/linux/list.h
202
for (n = list_entry(pos->member.next, __typeof(*pos), member); \
sys/dev/pci/drm/include/linux/list.h
204
pos = n, n = list_entry(n->member.next, __typeof(*n), member))
sys/dev/pci/drm/include/linux/list.h
243
#define list_for_each_entry_safe(pos, n, head, member) \
sys/dev/pci/drm/include/linux/list.h
245
n = list_entry(pos->member.next, __typeof(*pos), member); \
sys/dev/pci/drm/include/linux/list.h
247
pos = n, n = list_entry(n->member.next, __typeof(*n), member))
sys/dev/pci/drm/include/linux/list.h
317
size_t n = 0;
sys/dev/pci/drm/include/linux/list.h
320
n++;
sys/dev/pci/drm/include/linux/list.h
322
return n;
sys/dev/pci/drm/include/linux/list.h
379
#define hlist_for_each_entry_safe(pos, n, head, member) \
sys/dev/pci/drm/include/linux/list.h
381
pos != NULL && (n = pos->member.next, 1); \
sys/dev/pci/drm/include/linux/list.h
382
pos = hlist_entry(n, __typeof(*pos), member))
sys/dev/pci/drm/include/linux/llist.h
76
#define llist_for_each_safe(pos, n, node) \
sys/dev/pci/drm/include/linux/llist.h
79
((n) = (pos)->next, pos); \
sys/dev/pci/drm/include/linux/llist.h
80
(pos) = (n))
sys/dev/pci/drm/include/linux/llist.h
82
#define llist_for_each_entry_safe(pos, n, node, member) \
sys/dev/pci/drm/include/linux/llist.h
85
(n = llist_entry(pos->member.next, __typeof(*pos), member), pos); \
sys/dev/pci/drm/include/linux/llist.h
86
pos = n)
sys/dev/pci/drm/include/linux/math.h
6
#define mult_frac(x, n, d) (((x) * (n)) / (d))
sys/dev/pci/drm/include/linux/mm.h
24
#define nth_page(page, n) (&(page)[(n)])
sys/dev/pci/drm/include/linux/mm.h
43
kvmalloc_array(size_t n, size_t size, int flags)
sys/dev/pci/drm/include/linux/mm.h
45
if (n != 0 && SIZE_MAX / n < size)
sys/dev/pci/drm/include/linux/mm.h
47
return malloc(n * size, M_DRM, flags);
sys/dev/pci/drm/include/linux/mm.h
63
kvcalloc(size_t n, size_t size, int flags)
sys/dev/pci/drm/include/linux/mm.h
65
return kvmalloc_array(n, size, flags | M_ZERO);
sys/dev/pci/drm/include/linux/of.h
22
#define of_get_compatible_child(d, n) \
sys/dev/pci/drm/include/linux/of.h
23
__of_get_compatible_child(&(d), (n))
sys/dev/pci/drm/include/linux/of.h
26
#define of_get_child_by_name(d, n) \
sys/dev/pci/drm/include/linux/of.h
27
__of_get_child_by_name(&(d), (n))
sys/dev/pci/drm/include/linux/of.h
37
#define of_property_present(n, p) \
sys/dev/pci/drm/include/linux/of.h
38
__of_property_present(__of_node(n), (p))
sys/dev/pci/drm/include/linux/of.h
42
#define of_property_read_u32(n, p, o) \
sys/dev/pci/drm/include/linux/of.h
43
__of_property_read_variable_u32_array(__of_node(n), (p), (o), 1, 1)
sys/dev/pci/drm/include/linux/of.h
44
#define of_property_read_variable_u32_array(n, p, o, l, h) \
sys/dev/pci/drm/include/linux/of.h
45
__of_property_read_variable_u32_array(__of_node(n), (p), (o), (l), (h))
sys/dev/pci/drm/include/linux/of.h
49
#define of_property_read_u64(n, p, o) \
sys/dev/pci/drm/include/linux/of.h
50
__of_property_read_variable_u64_array(__of_node(n), (p), (o), 1, 1)
sys/dev/pci/drm/include/linux/of.h
54
#define of_property_match_string(n, a, b) \
sys/dev/pci/drm/include/linux/of.h
55
__of_property_match_string(__of_node(n), (a), (b))
sys/dev/pci/drm/include/linux/of.h
59
#define of_parse_phandle(n, a, b) \
sys/dev/pci/drm/include/linux/of.h
60
__of_parse_phandle(__of_node(n), (a), (b))
sys/dev/pci/drm/include/linux/of.h
70
#define of_parse_phandle_with_args(n, a, b, c, d) \
sys/dev/pci/drm/include/linux/of.h
71
__of_parse_phandle_with_args(__of_node(n), (a), (b), (c), (d))
sys/dev/pci/drm/include/linux/of_device.h
10
#define of_device_is_compatible(n, c) \
sys/dev/pci/drm/include/linux/of_device.h
11
__of_device_is_compatible(__of_node(n), (c))
sys/dev/pci/drm/include/linux/overflow.h
10
#define struct_size(p, member, n) \
sys/dev/pci/drm/include/linux/overflow.h
11
(sizeof(*(p)) + ((n) * (sizeof(*(p)->member))))
sys/dev/pci/drm/include/linux/slab.h
28
kmalloc_array(size_t n, size_t size, int flags)
sys/dev/pci/drm/include/linux/slab.h
30
if (n != 0 && SIZE_MAX / n < size)
sys/dev/pci/drm/include/linux/slab.h
32
return malloc(n * size, M_DRM, flags);
sys/dev/pci/drm/include/linux/slab.h
36
kcalloc(size_t n, size_t size, int flags)
sys/dev/pci/drm/include/linux/slab.h
38
if (n != 0 && SIZE_MAX / n < size)
sys/dev/pci/drm/include/linux/slab.h
40
return malloc(n * size, M_DRM, flags | M_ZERO);
sys/dev/pci/drm/include/linux/stddef.h
6
#define DECLARE_FLEX_ARRAY(t, n) \
sys/dev/pci/drm/include/linux/stddef.h
7
struct { struct{} n ## __unused; t n[]; }
sys/dev/pci/drm/include/linux/string.h
137
match_string(const char * const *array, size_t n, const char *str)
sys/dev/pci/drm/include/linux/string.h
141
for (i = 0; i < n; i++) {
sys/dev/pci/drm/include/linux/string.h
42
memset_p(void **p, void *v, size_t n)
sys/dev/pci/drm/include/linux/string.h
45
return memset64((uint64_t *)p, (uintptr_t)v, n);
sys/dev/pci/drm/include/linux/string.h
47
return memset32((uint32_t *)p, (uintptr_t)v, n);
sys/dev/pci/drm/include/linux/suspend.h
24
register_pm_notifier(struct notifier_block *n)
sys/dev/pci/drm/include/linux/suspend.h
30
unregister_pm_notifier(struct notifier_block *n)
sys/dev/pci/drm/include/linux/vmalloc.h
38
vmalloc_array(size_t n, size_t size)
sys/dev/pci/drm/include/linux/vmalloc.h
40
if (n != 0 && SIZE_MAX / n < size)
sys/dev/pci/drm/include/linux/vmalloc.h
42
return malloc(n * size, M_DRM, M_WAITOK | M_CANFAIL);
sys/dev/pci/drm/include/linux/vmalloc.h
46
vcalloc(size_t n, size_t size)
sys/dev/pci/drm/include/linux/vmalloc.h
48
if (n != 0 && SIZE_MAX / n < size)
sys/dev/pci/drm/include/linux/vmalloc.h
50
return malloc(n * size, M_DRM, M_WAITOK | M_CANFAIL | M_ZERO);
sys/dev/pci/drm/include/linux/wordpart.h
6
#define lower_32_bits(n) ((u32)(n))
sys/dev/pci/drm/include/uapi/drm/drm_mode.h
536
#define DRM_MODE_PROP_TYPE(n) ((n) << 6)
sys/dev/pci/drm/linux_sort.c
100
if (n > 7) {
sys/dev/pci/drm/linux_sort.c
102
pn = a + (n - 1) * es;
sys/dev/pci/drm/linux_sort.c
103
if (n > 40) {
sys/dev/pci/drm/linux_sort.c
104
d = (n / 8) * es;
sys/dev/pci/drm/linux_sort.c
114
pc = pd = a + (n - 1) * es;
sys/dev/pci/drm/linux_sort.c
137
pn = a + n * es;
sys/dev/pci/drm/linux_sort.c
154
n = s / es;
sys/dev/pci/drm/linux_sort.c
162
n = r / es;
sys/dev/pci/drm/linux_sort.c
169
sort(void *a, size_t n, size_t es, int (*cmp)(const void *, const void *),
sys/dev/pci/drm/linux_sort.c
173
qsort(a, n, es, cmp);
sys/dev/pci/drm/linux_sort.c
42
#define swapcode(TYPE, parmi, parmj, n) { \
sys/dev/pci/drm/linux_sort.c
43
size_t i = (n) / sizeof (TYPE); \
sys/dev/pci/drm/linux_sort.c
57
swapfunc(char *a, char *b, size_t n, int swaptype)
sys/dev/pci/drm/linux_sort.c
60
swapcode(long, a, b, n)
sys/dev/pci/drm/linux_sort.c
62
swapcode(char, a, b, n)
sys/dev/pci/drm/linux_sort.c
73
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
sys/dev/pci/drm/linux_sort.c
84
qsort(void *aa, size_t n, size_t es, int (*cmp)(const void *, const void *))
sys/dev/pci/drm/linux_sort.c
92
if (n < 7) {
sys/dev/pci/drm/linux_sort.c
93
for (pm = a + es; pm < a + n * es; pm += es)
sys/dev/pci/drm/linux_sort.c
99
pm = a + (n / 2) * es;
sys/dev/pci/drm/linux_sort_r.c
103
pm = a + (n / 2) * es;
sys/dev/pci/drm/linux_sort_r.c
104
if (n > 7) {
sys/dev/pci/drm/linux_sort_r.c
106
pn = a + (n - 1) * es;
sys/dev/pci/drm/linux_sort_r.c
107
if (n > 40) {
sys/dev/pci/drm/linux_sort_r.c
108
d = (n / 8) * es;
sys/dev/pci/drm/linux_sort_r.c
118
pc = pd = a + (n - 1) * es;
sys/dev/pci/drm/linux_sort_r.c
141
pn = a + n * es;
sys/dev/pci/drm/linux_sort_r.c
158
n = s / es;
sys/dev/pci/drm/linux_sort_r.c
166
n = r / es;
sys/dev/pci/drm/linux_sort_r.c
173
sort_r(void *a, size_t n, size_t es,
sys/dev/pci/drm/linux_sort_r.c
178
qsort_r(a, n, es, cmp, p);
sys/dev/pci/drm/linux_sort_r.c
43
#define swapcode(TYPE, parmi, parmj, n) { \
sys/dev/pci/drm/linux_sort_r.c
44
size_t i = (n) / sizeof (TYPE); \
sys/dev/pci/drm/linux_sort_r.c
58
swapfunc(char *a, char *b, size_t n, int swaptype)
sys/dev/pci/drm/linux_sort_r.c
61
swapcode(long, a, b, n)
sys/dev/pci/drm/linux_sort_r.c
63
swapcode(char, a, b, n)
sys/dev/pci/drm/linux_sort_r.c
74
#define vecswap(a, b, n) if ((n) > 0) swapfunc(a, b, n, swaptype)
sys/dev/pci/drm/linux_sort_r.c
87
qsort_r(void *aa, size_t n, size_t es,
sys/dev/pci/drm/linux_sort_r.c
96
if (n < 7) {
sys/dev/pci/drm/linux_sort_r.c
97
for (pm = a + es; pm < a + n * es; pm += es)
sys/dev/pci/drm/radeon/atom.c
96
static void debug_print_spaces(int n)
sys/dev/pci/drm/radeon/atom.c
98
while (n--)
sys/dev/pci/drm/radeon/ci_dpm.c
155
static int ci_set_power_limit(struct radeon_device *rdev, u32 n);
sys/dev/pci/drm/radeon/ci_dpm.c
1656
static int ci_dpm_force_state_sclk(struct radeon_device *rdev, u32 n)
sys/dev/pci/drm/radeon/ci_dpm.c
1662
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_SCLKDPM_SetEnabledMask, 1 << n);
sys/dev/pci/drm/radeon/ci_dpm.c
1670
static int ci_dpm_force_state_mclk(struct radeon_device *rdev, u32 n)
sys/dev/pci/drm/radeon/ci_dpm.c
1676
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_MCLKDPM_SetEnabledMask, 1 << n);
sys/dev/pci/drm/radeon/ci_dpm.c
1684
static int ci_dpm_force_state_pcie(struct radeon_device *rdev, u32 n)
sys/dev/pci/drm/radeon/ci_dpm.c
1690
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_PCIeDPM_ForceLevel, n);
sys/dev/pci/drm/radeon/ci_dpm.c
1698
static int ci_set_power_limit(struct radeon_device *rdev, u32 n)
sys/dev/pci/drm/radeon/ci_dpm.c
1704
ci_send_msg_to_smc_with_parameter(rdev, PPSMC_MSG_PkgPwrSetLimit, n);
sys/dev/pci/drm/radeon/cikd.h
1682
#define PACKET0(reg, n) ((PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/radeon/cikd.h
1684
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/cikd.h
1691
#define PACKET3(op, n) ((PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/radeon/cikd.h
1693
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/cikd.h
1695
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/radeon/evergreend.h
1416
#define DMA_PACKET(cmd, sub_cmd, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/evergreend.h
1418
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/evergreend.h
1534
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/radeon/evergreend.h
1536
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/evergreend.h
1543
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/radeon/evergreend.h
1545
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/mkregtable.c
146
unsigned nlloop, i, j, n, c, id;
sys/dev/pci/drm/radeon/mkregtable.c
153
n = 4;
sys/dev/pci/drm/radeon/mkregtable.c
154
if (n > c)
sys/dev/pci/drm/radeon/mkregtable.c
155
n = c;
sys/dev/pci/drm/radeon/mkregtable.c
156
c -= n;
sys/dev/pci/drm/radeon/mkregtable.c
157
for (j = 0; j < n; j++) {
sys/dev/pci/drm/radeon/ni_dpm.c
1395
u64 tmp, n, d;
sys/dev/pci/drm/radeon/ni_dpm.c
1420
n = ((u64)near_tdp_limit * ((u64)std_vddc_med * (u64)std_vddc_med) * 90);
sys/dev/pci/drm/radeon/ni_dpm.c
1422
tmp = div64_u64(n, d);
sys/dev/pci/drm/radeon/nid.h
1148
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/radeon/nid.h
1150
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/nid.h
1157
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/radeon/nid.h
1159
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/nid.h
1337
#define DMA_PACKET(cmd, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/nid.h
1340
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/nid.h
1342
#define DMA_IB_PACKET(cmd, vmid, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/nid.h
1344
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/nid.h
1346
#define DMA_PTE_PDE_PACKET(n) ((2 << 28) | \
sys/dev/pci/drm/radeon/nid.h
1349
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/r100.c
1396
const unsigned *auth, unsigned n,
sys/dev/pci/drm/radeon/r100.c
1411
if ((reg >> 7) > n) {
sys/dev/pci/drm/radeon/r100.c
1415
if (((reg + (pkt->count << 2)) >> 7) > n) {
sys/dev/pci/drm/radeon/r100.c
2499
static int r100_rbbm_fifo_wait_for_entry(struct radeon_device *rdev, unsigned n)
sys/dev/pci/drm/radeon/r100.c
2506
if (tmp >= n) {
sys/dev/pci/drm/radeon/r100d.h
59
#define PACKET0(reg, n) (CP_PACKET0 | \
sys/dev/pci/drm/radeon/r100d.h
61
REG_SET(PACKET0_COUNT, (n)))
sys/dev/pci/drm/radeon/r100d.h
63
#define PACKET3(op, n) (CP_PACKET3 | \
sys/dev/pci/drm/radeon/r100d.h
65
REG_SET(PACKET3_COUNT, (n)))
sys/dev/pci/drm/radeon/r300d.h
60
#define PACKET0(reg, n) (CP_PACKET0 | \
sys/dev/pci/drm/radeon/r300d.h
62
REG_SET(PACKET0_COUNT, (n)))
sys/dev/pci/drm/radeon/r300d.h
64
#define PACKET3(op, n) (CP_PACKET3 | \
sys/dev/pci/drm/radeon/r300d.h
66
REG_SET(PACKET3_COUNT, (n)))
sys/dev/pci/drm/radeon/r600d.h
1584
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/radeon/r600d.h
1586
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/r600d.h
1587
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/radeon/r600d.h
1589
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/r600d.h
645
#define DMA_PACKET(cmd, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/r600d.h
648
(((n) & 0xFFFF) << 0))
sys/dev/pci/drm/radeon/radeon.h
3003
unsigned n);
sys/dev/pci/drm/radeon/radeon_acpi.c
161
static void radeon_atif_parse_notification(struct radeon_atif_notifications *n, u32 mask)
sys/dev/pci/drm/radeon/radeon_acpi.c
163
n->display_switch = mask & ATIF_DISPLAY_SWITCH_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
164
n->expansion_mode_change = mask & ATIF_EXPANSION_MODE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
165
n->thermal_state = mask & ATIF_THERMAL_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
166
n->forced_power_state = mask & ATIF_FORCED_POWER_STATE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
167
n->system_power_state = mask & ATIF_SYSTEM_POWER_SOURCE_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
168
n->display_conf_change = mask & ATIF_DISPLAY_CONF_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
169
n->px_gfx_switch = mask & ATIF_PX_GFX_SWITCH_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
170
n->brightness_change = mask & ATIF_PANEL_BRIGHTNESS_CHANGE_REQUEST_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
171
n->dgpu_display_event = mask & ATIF_DGPU_DISPLAY_EVENT_SUPPORTED;
sys/dev/pci/drm/radeon/radeon_acpi.c
257
struct radeon_atif_notification_cfg *n)
sys/dev/pci/drm/radeon/radeon_acpi.c
285
n->enabled = false;
sys/dev/pci/drm/radeon/radeon_acpi.c
286
n->command_code = 0;
sys/dev/pci/drm/radeon/radeon_acpi.c
288
n->enabled = true;
sys/dev/pci/drm/radeon/radeon_acpi.c
289
n->command_code = 0x81;
sys/dev/pci/drm/radeon/radeon_acpi.c
295
n->enabled = true;
sys/dev/pci/drm/radeon/radeon_acpi.c
296
n->command_code = params.command_code;
sys/dev/pci/drm/radeon/radeon_acpi.c
301
(n->enabled ? "enabled" : "disabled"),
sys/dev/pci/drm/radeon/radeon_acpi.c
302
n->command_code);
sys/dev/pci/drm/radeon/radeon_asic.h
126
const unsigned *auth, unsigned n,
sys/dev/pci/drm/radeon/radeon_audio.c
496
int n, cts;
sys/dev/pci/drm/radeon/radeon_audio.c
500
n = 128 * freq;
sys/dev/pci/drm/radeon/radeon_audio.c
504
div = gcd(n, cts);
sys/dev/pci/drm/radeon/radeon_audio.c
506
n /= div;
sys/dev/pci/drm/radeon/radeon_audio.c
513
mul = ((128*freq/1000) + (n-1))/n;
sys/dev/pci/drm/radeon/radeon_audio.c
515
n *= mul;
sys/dev/pci/drm/radeon/radeon_audio.c
519
if (n < (128*freq/1500))
sys/dev/pci/drm/radeon/radeon_audio.c
521
if (n > (128*freq/300))
sys/dev/pci/drm/radeon/radeon_audio.c
524
*N = n;
sys/dev/pci/drm/radeon/radeon_benchmark.c
124
RADEON_BENCHMARK_COPY_DMA, n,
sys/dev/pci/drm/radeon/radeon_benchmark.c
129
radeon_benchmark_log_results(n, size, time,
sys/dev/pci/drm/radeon/radeon_benchmark.c
135
RADEON_BENCHMARK_COPY_BLIT, n,
sys/dev/pci/drm/radeon/radeon_benchmark.c
140
radeon_benchmark_log_results(n, size, time,
sys/dev/pci/drm/radeon/radeon_benchmark.c
37
int flag, int n,
sys/dev/pci/drm/radeon/radeon_benchmark.c
46
for (i = 0; i < n; i++) {
sys/dev/pci/drm/radeon/radeon_benchmark.c
75
static void radeon_benchmark_log_results(int n, unsigned size,
sys/dev/pci/drm/radeon/radeon_benchmark.c
80
unsigned int throughput = (n * (size >> 10)) / time;
sys/dev/pci/drm/radeon/radeon_benchmark.c
83
kind, n, size >> 10, sdomain, ddomain, time,
sys/dev/pci/drm/radeon/radeon_benchmark.c
93
int r, n;
sys/dev/pci/drm/radeon/radeon_benchmark.c
96
n = RADEON_BENCHMARK_ITERATIONS;
sys/dev/pci/drm/radeon/radeon_combios.c
1330
int i, n;
sys/dev/pci/drm/radeon/radeon_combios.c
1339
n = RBIOS8(tmds_info + 5) + 1;
sys/dev/pci/drm/radeon/radeon_combios.c
1340
if (n > 4)
sys/dev/pci/drm/radeon/radeon_combios.c
1341
n = 4;
sys/dev/pci/drm/radeon/radeon_combios.c
1342
for (i = 0; i < n; i++) {
sys/dev/pci/drm/radeon/radeon_combios.c
1353
n = RBIOS8(tmds_info + 5) + 1;
sys/dev/pci/drm/radeon/radeon_combios.c
1354
if (n > 4)
sys/dev/pci/drm/radeon/radeon_combios.c
1355
n = 4;
sys/dev/pci/drm/radeon/radeon_combios.c
1356
for (i = 0; i < n; i++) {
sys/dev/pci/drm/radeon/radeon_display.c
1099
static inline uint32_t radeon_div(uint64_t n, uint32_t d)
sys/dev/pci/drm/radeon/radeon_display.c
1101
n += d / 2;
sys/dev/pci/drm/radeon/radeon_display.c
1103
do_div(n, d);
sys/dev/pci/drm/radeon/radeon_display.c
1104
return n;
sys/dev/pci/drm/radeon/radeon_i2c.c
335
u8 n, m, loop;
sys/dev/pci/drm/radeon/radeon_i2c.c
357
n = loop - 1;
sys/dev/pci/drm/radeon/radeon_i2c.c
359
prescale = m | (n << 8);
sys/dev/pci/drm/radeon/radeon_irq_kms.c
609
bool enable, const char *name, unsigned n)
sys/dev/pci/drm/radeon/radeon_irq_kms.c
618
DRM_DEBUG("%s%d interrupts enabled\n", name, n);
sys/dev/pci/drm/radeon/radeon_irq_kms.c
621
DRM_DEBUG("%s%d interrupts disabled\n", name, n);
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
541
uint32_t m, n, p;
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
686
n = NTSC_TV_PLL_N_27;
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
690
n = NTSC_TV_PLL_N_14;
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
696
n = PAL_TV_PLL_N_27;
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
700
n = PAL_TV_PLL_N_14;
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
707
((n & RADEON_TV_N0LO_MASK) << RADEON_TV_N0LO_SHIFT) |
sys/dev/pci/drm/radeon/radeon_legacy_tv.c
708
(((n >> 9) & RADEON_TV_N0HI_MASK) << RADEON_TV_N0HI_SHIFT) |
sys/dev/pci/drm/radeon/radeon_object.c
368
struct radeon_bo *bo, *n;
sys/dev/pci/drm/radeon/radeon_object.c
374
list_for_each_entry_safe(bo, n, &rdev->gem.objects, list) {
sys/dev/pci/drm/radeon/radeon_pm.c
152
struct radeon_bo *bo, *n;
sys/dev/pci/drm/radeon/radeon_pm.c
157
list_for_each_entry_safe(bo, n, &rdev->gem.objects, list) {
sys/dev/pci/drm/radeon/radeon_test.c
40
unsigned n, size;
sys/dev/pci/drm/radeon/radeon_test.c
60
n = rdev->mc.gtt_size - rdev->gart_pin_size;
sys/dev/pci/drm/radeon/radeon_test.c
61
n /= size;
sys/dev/pci/drm/radeon/radeon_test.c
63
gtt_obj = kcalloc(n, sizeof(*gtt_obj), GFP_KERNEL);
sys/dev/pci/drm/radeon/radeon_test.c
65
DRM_ERROR("Failed to allocate %d pointers\n", n);
sys/dev/pci/drm/radeon/radeon_test.c
84
for (i = 0; i < n; i++) {
sys/dev/pci/drm/radeon/rv515d.h
200
#define PACKET0(reg, n) (CP_PACKET0 | \
sys/dev/pci/drm/radeon/rv515d.h
202
REG_SET(PACKET0_COUNT, (n)))
sys/dev/pci/drm/radeon/rv515d.h
204
#define PACKET3(op, n) (CP_PACKET3 | \
sys/dev/pci/drm/radeon/rv515d.h
206
REG_SET(PACKET3_COUNT, (n)))
sys/dev/pci/drm/radeon/rv770d.h
663
#define DMA_PACKET(cmd, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/rv770d.h
666
(((n) & 0xFFFF) << 0))
sys/dev/pci/drm/radeon/rv770d.h
985
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/radeon/rv770d.h
987
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/rv770d.h
988
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/radeon/rv770d.h
990
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/si_dpm.c
2195
u64 pwr_efficiency_ratio, n, d;
sys/dev/pci/drm/radeon/si_dpm.c
2200
n = div64_u64((u64)1024 * curr_vddc * curr_vddc * ((u64)1000 + margin), (u64)1000);
sys/dev/pci/drm/radeon/si_dpm.c
2202
pwr_efficiency_ratio = div64_u64(n, d);
sys/dev/pci/drm/radeon/sid.h
1586
#define PACKET0(reg, n) ((RADEON_PACKET_TYPE0 << 30) | \
sys/dev/pci/drm/radeon/sid.h
1588
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/sid.h
1595
#define PACKET3(op, n) ((RADEON_PACKET_TYPE3 << 30) | \
sys/dev/pci/drm/radeon/sid.h
1597
((n) & 0x3FFF) << 16)
sys/dev/pci/drm/radeon/sid.h
1599
#define PACKET3_COMPUTE(op, n) (PACKET3(op, n) | 1 << 1)
sys/dev/pci/drm/radeon/sid.h
1853
#define DMA_PACKET(cmd, b, t, s, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/sid.h
1857
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/sid.h
1859
#define DMA_IB_PACKET(cmd, vmid, n) ((((cmd) & 0xF) << 28) | \
sys/dev/pci/drm/radeon/sid.h
1861
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/sid.h
1863
#define DMA_PTE_PDE_PACKET(n) ((2 << 28) | \
sys/dev/pci/drm/radeon/sid.h
1866
(((n) & 0xFFFFF) << 0))
sys/dev/pci/drm/radeon/sumo_dpm.c
1597
u32 n = 0;
sys/dev/pci/drm/radeon/sumo_dpm.c
1602
sclk_voltage_mapping_table->entries[n].sclk_frequency =
sys/dev/pci/drm/radeon/sumo_dpm.c
1604
sclk_voltage_mapping_table->entries[n].vid_2bit =
sys/dev/pci/drm/radeon/sumo_dpm.c
1607
n++;
sys/dev/pci/drm/radeon/sumo_dpm.c
1611
sclk_voltage_mapping_table->num_max_dpm_entries = n;
sys/dev/pci/drm/radeon/trinity_dpm.h
124
int trinity_dpm_force_state(struct radeon_device *rdev, u32 n);
sys/dev/pci/drm/radeon/trinity_dpm.h
125
int trinity_dpm_n_levels_disabled(struct radeon_device *rdev, u32 n);
sys/dev/pci/drm/radeon/trinity_smc.c
73
int trinity_dpm_force_state(struct radeon_device *rdev, u32 n)
sys/dev/pci/drm/radeon/trinity_smc.c
75
WREG32_SMC(SMU_SCRATCH0, n);
sys/dev/pci/drm/radeon/trinity_smc.c
80
int trinity_dpm_n_levels_disabled(struct radeon_device *rdev, u32 n)
sys/dev/pci/drm/radeon/trinity_smc.c
82
WREG32_SMC(SMU_SCRATCH0, n);
sys/dev/pci/eap.c
685
int s, nw, n;
sys/dev/pci/eap.c
690
n = 0;
sys/dev/pci/eap.c
693
if (++n > 100) {
sys/dev/pci/eap.c
78
#define DPRINTFN(n,x) if (eapdebug>(n)) printf x
sys/dev/pci/eap.c
82
#define DPRINTFN(n,x)
sys/dev/pci/eapreg.h
136
#define ESRC_SET_TRUNC(n) ((n)<<9)
sys/dev/pci/eapreg.h
137
#define ESRC_SET_N(n) ((n)<<4)
sys/dev/pci/eapreg.h
139
#define ESRC_SET_VFI(n) ((n)<<10)
sys/dev/pci/eapreg.h
140
#define ESRC_SET_ACI(n) (n)
sys/dev/pci/eapreg.h
141
#define ESRC_SET_ADC_VOL(n) ((n)<<8)
sys/dev/pci/eapreg.h
142
#define ESRC_SET_DAC_VOLI(n) ((n)<<12)
sys/dev/pci/eapreg.h
143
#define ESRC_SET_DAC_VOLF(n) (n)
sys/dev/pci/eapreg.h
58
#define EAP_SET_PCLKDIV(n) (((n)&0x1fff)<<16)
sys/dev/pci/eapreg.h
59
#define EAP_GET_PCLKDIV(n) (((n)>>16)&0x1fff)
sys/dev/pci/envy.c
2258
int i, n, idx, ndev;
sys/dev/pci/envy.c
2289
n = 0;
sys/dev/pci/envy.c
2293
dev->un.e.member[n].ord = n;
sys/dev/pci/envy.c
2294
snprintf(dev->un.e.member[n++].label.name,
sys/dev/pci/envy.c
2297
dev->un.e.member[n].ord = n;
sys/dev/pci/envy.c
2298
snprintf(dev->un.e.member[n++].label.name,
sys/dev/pci/envy.c
2301
dev->un.e.member[n].ord = n;
sys/dev/pci/envy.c
2302
snprintf(dev->un.e.member[n++].label.name,
sys/dev/pci/envy.c
2307
dev->un.s.num_mem = n;
sys/dev/pci/envy.c
47
#define DPRINTFN(n, ...) do { if (envydebug > (n)) printf(__VA_ARGS__); } while(0)
sys/dev/pci/envy.c
51
#define DPRINTFN(n, ...) do {} while(0)
sys/dev/pci/glxpcib.c
551
int n, reg[7], val[7], nreg = 0, off = 0;
sys/dev/pci/glxpcib.c
601
for (n = 0; n < nreg; n++)
sys/dev/pci/glxpcib.c
602
bus_space_write_4(sc->sc_gpio_iot, sc->sc_gpio_ioh, reg[n],
sys/dev/pci/glxpcib.c
603
val[n]);
sys/dev/pci/if_aq_pci.c
642
#define WAIT_FOR(expr, us, n, errp) \
sys/dev/pci/if_aq_pci.c
645
for (_n = n; (!(expr)) && _n != 0; --_n) { \
sys/dev/pci/if_bce.c
152
#define DPRINTFN(n,x) do { \
sys/dev/pci/if_bce.c
153
if (bcedebug >= (n)) \
sys/dev/pci/if_bce.c
159
#define DPRINTFN(n,x)
sys/dev/pci/if_bge.c
259
#define DPRINTFN(n,x) do { if (bgedebug >= (n)) printf x; } while (0)
sys/dev/pci/if_bge.c
263
#define DPRINTFN(n,x)
sys/dev/pci/if_bge.c
3965
struct mbuf *m, *prev, *n = NULL;
sys/dev/pci/if_bge.c
4021
MGET(n, M_NOWAIT, MT_DATA);
sys/dev/pci/if_bge.c
4022
if (n == NULL)
sys/dev/pci/if_bge.c
4029
bcopy(prev->m_data + newprevlen, n->m_data, shortfall);
sys/dev/pci/if_bge.c
4035
bcopy(m->m_data, n->m_data + shortfall, m->m_len);
sys/dev/pci/if_bge.c
4038
n->m_len = shortfall + m->m_len;
sys/dev/pci/if_bge.c
4041
n->m_next = m->m_next;
sys/dev/pci/if_bge.c
4042
prev->m_next = n;
sys/dev/pci/if_bge.c
4046
m = n; /* for continuing loop */
sys/dev/pci/if_bge.c
4078
struct mbuf *n;
sys/dev/pci/if_bge.c
4080
MGET(n, M_DONTWAIT, MT_DATA);
sys/dev/pci/if_bge.c
4081
if (n == NULL)
sys/dev/pci/if_bge.c
4083
n->m_len = 0;
sys/dev/pci/if_bge.c
4084
last->m_next = n;
sys/dev/pci/if_bge.c
4085
last = n;
sys/dev/pci/if_bge.c
4603
u_int n = 0;
sys/dev/pci/if_bge.c
4608
ifr[n].ifr_size = sc->bge_rx_std_len;
sys/dev/pci/if_bge.c
4609
strlcpy(ifr[n].ifr_name, "std", sizeof(ifr[n].ifr_name));
sys/dev/pci/if_bge.c
4610
ifr[n].ifr_info = sc->bge_std_ring;
sys/dev/pci/if_bge.c
4612
n++;
sys/dev/pci/if_bge.c
4616
ifr[n].ifr_size = BGE_JLEN;
sys/dev/pci/if_bge.c
4617
strlcpy(ifr[n].ifr_name, "jumbo", sizeof(ifr[n].ifr_name));
sys/dev/pci/if_bge.c
4618
ifr[n].ifr_info = sc->bge_jumbo_ring;
sys/dev/pci/if_bge.c
4620
n++;
sys/dev/pci/if_bge.c
4623
return (if_rxr_info_ioctl(ifri, n, ifr));
sys/dev/pci/if_bwfm_pci.c
66
#define DPRINTFN(n, x) do { if (bwfm_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_bwfm_pci.c
70
#define DPRINTFN(n, x) do { ; } while (0)
sys/dev/pci/if_cas.c
1435
int n;
sys/dev/pci/if_cas.c
1448
for (n = 0; n < 100; n++) {
sys/dev/pci/if_cas.c
1465
int n;
sys/dev/pci/if_cas.c
1481
for (n = 0; n < 100; n++) {
sys/dev/pci/if_casvar.h
189
#define CAS_CDTXSYNC(sc, x, n, ops) \
sys/dev/pci/if_casvar.h
194
__n = (n); \
sys/dev/pci/if_devar.h
853
#define TULIP_PERFMERGE(s,n) do { } while (0)
sys/dev/pci/if_et.c
1155
int n;
sys/dev/pci/if_et.c
1157
for (n = 0; n < ET_RX_NRING; ++n) {
sys/dev/pci/if_et.c
1158
struct et_rxbuf_data *rbd = &sc->sc_rx_data[n];
sys/dev/pci/if_et.c
1159
struct et_rxdesc_ring *rx_ring = &sc->sc_rx_ring[n];
sys/dev/pci/if_et.c
1315
int n;
sys/dev/pci/if_et.c
1317
for (n = 0; n < ET_RX_NRING; ++n) {
sys/dev/pci/if_et.c
1318
struct et_rxbuf_data *rbd = &sc->sc_rx_data[n];
sys/dev/pci/if_et.c
1325
"%d\n", sc->sc_dev.dv_xname, n, i, error);
sys/dev/pci/if_iavf.c
3056
unsigned int n;
sys/dev/pci/if_iavf.c
3059
n = if_rxr_get(&sc->sc_arq_ring, IAVF_AQ_NUM);
sys/dev/pci/if_iavf.c
3062
while (n > 0) {
sys/dev/pci/if_iavf.c
3093
n--;
sys/dev/pci/if_iavf.c
3096
if_rxr_put(&sc->sc_arq_ring, n);
sys/dev/pci/if_ice.c
161
#define DNPRINTF(n,x...) do { if (ice_debug & n) printf(x); } while(0)
sys/dev/pci/if_ice.c
193
#define DNPRINTF(n,x...)
sys/dev/pci/if_ice.c
24355
static inline bool ice_is_pow2(uint64_t n) {
sys/dev/pci/if_ice.c
24356
if (n == 0)
sys/dev/pci/if_ice.c
24358
return powerof2(n);
sys/dev/pci/if_icevar.h
1406
#define ICE_NETLIST_LINK_TOPO_OFFSET(n) ((n) + 2)
sys/dev/pci/if_icevar.h
1415
#define ICE_NETLIST_ID_BLK_OFFSET(n) ICE_NETLIST_LINK_TOPO_OFFSET(0x0004 + 2 * (n))
sys/dev/pci/if_icevar.h
1426
#define ICE_NETLIST_ID_BLK_SHA_HASH_WORD(n) (0x0A + (n))
sys/dev/pci/if_igc.c
1229
int error, i, n = 0;
sys/dev/pci/if_igc.c
1236
ifr[n].ifr_size = sc->rx_mbuf_sz;
sys/dev/pci/if_igc.c
1237
snprintf(ifr[n].ifr_name, sizeof(ifr[n].ifr_name), "%d", i);
sys/dev/pci/if_igc.c
1238
ifr[n].ifr_info = rxr->rx_ring;
sys/dev/pci/if_igc.c
1239
n++;
sys/dev/pci/if_ipw.c
125
#define DPRINTFN(n, x) do { if (ipw_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_ipw.c
129
#define DPRINTFN(n, x)
sys/dev/pci/if_ipw.c
725
int n;
sys/dev/pci/if_ipw.c
744
for (n = 7; n >= 0; n--) {
sys/dev/pci/if_ipw.c
746
(((addr >> n) & 1) << IPW_EEPROM_SHIFT_D));
sys/dev/pci/if_ipw.c
748
(((addr >> n) & 1) << IPW_EEPROM_SHIFT_D) | IPW_EEPROM_C);
sys/dev/pci/if_ipw.c
755
for (n = 15; n >= 0; n--) {
sys/dev/pci/if_ipw.c
759
val |= ((tmp & IPW_EEPROM_Q) >> IPW_EEPROM_SHIFT_Q) << n;
sys/dev/pci/if_iwi.c
130
#define DPRINTFN(n, x) do { if (iwi_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_iwi.c
134
#define DPRINTFN(n, x)
sys/dev/pci/if_iwi.c
796
int n;
sys/dev/pci/if_iwi.c
815
for (n = 7; n >= 0; n--) {
sys/dev/pci/if_iwi.c
817
(((addr >> n) & 1) << IWI_EEPROM_SHIFT_D));
sys/dev/pci/if_iwi.c
819
(((addr >> n) & 1) << IWI_EEPROM_SHIFT_D) | IWI_EEPROM_C);
sys/dev/pci/if_iwi.c
826
for (n = 15; n >= 0; n--) {
sys/dev/pci/if_iwi.c
830
val |= ((tmp & IWI_EEPROM_Q) >> IWI_EEPROM_SHIFT_Q) << n;
sys/dev/pci/if_iwm.c
155
#define DPRINTFN(n, x) do { if (iwm_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_iwm.c
159
#define DPRINTFN(n, x) do { ; } while (0)
sys/dev/pci/if_iwm.c
3155
int n;
sys/dev/pci/if_iwm.c
3170
for (n = 3; n <= IEEE80211_VHT_NUM_SS; n++) {
sys/dev/pci/if_iwm.c
3172
IEEE80211_VHT_MCS_FOR_SS_SHIFT(n));
sys/dev/pci/if_iwmreg.h
5642
#define IWM_SCAN_CONFIG_N_CHANNELS(n) ((n) << 26)
sys/dev/pci/if_iwn.c
1616
iwn_read_eeprom_channels(struct iwn_softc *sc, int n, uint32_t addr)
sys/dev/pci/if_iwn.c
1619
const struct iwn_chan_band *band = &iwn_bands[n];
sys/dev/pci/if_iwn.c
1633
if (n == 0) { /* 2GHz band */
sys/dev/pci/if_iwn.c
1640
} else if (n < 5) { /* 5GHz band */
sys/dev/pci/if_iwn.c
1660
if (n < 5) {
sys/dev/pci/if_iwn.c
305
#define DPRINTFN(n, x) do { if (iwn_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_iwn.c
309
#define DPRINTFN(n, x)
sys/dev/pci/if_iwn.c
4112
#define fdivround(a, b, n) \
sys/dev/pci/if_iwn.c
4113
((((1 << n) * (a)) / (b) + (1 << n) / 2) / (1 << n))
sys/dev/pci/if_iwn.c
4115
#define interpolate(x, x1, y1, x2, y2, n) \
sys/dev/pci/if_iwn.c
4116
((y1) + fdivround(((int)(x) - (x1)) * ((y2) - (y1)), (x2) - (x1), n))
sys/dev/pci/if_iwx.c
139
#define DPRINTFN(n, x) do { if (iwx_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_iwx.c
143
#define DPRINTFN(n, x) do { ; } while (0)
sys/dev/pci/if_iwx.c
3284
int n;
sys/dev/pci/if_iwx.c
3317
for (n = 3; n <= IEEE80211_VHT_NUM_SS; n++) {
sys/dev/pci/if_iwx.c
3319
IEEE80211_VHT_MCS_FOR_SS_SHIFT(n));
sys/dev/pci/if_iwxreg.h
7494
#define IWX_SCAN_CONFIG_N_CHANNELS(n) ((n) << 26)
sys/dev/pci/if_ix.c
655
u_int n = 0;
sys/dev/pci/if_ix.c
665
ifr[n].ifr_size = MCLBYTES;
sys/dev/pci/if_ix.c
666
snprintf(ifr[n].ifr_name, sizeof(ifr[n].ifr_name), "%d", i);
sys/dev/pci/if_ix.c
667
ifr[n].ifr_info = rxr->rx_ring;
sys/dev/pci/if_ix.c
668
n++;
sys/dev/pci/if_ixl.c
4864
unsigned int n;
sys/dev/pci/if_ixl.c
4867
n = if_rxr_get(&sc->sc_arq_ring, IXL_AQ_NUM);
sys/dev/pci/if_ixl.c
4870
while (n > 0) {
sys/dev/pci/if_ixl.c
4900
n--;
sys/dev/pci/if_ixl.c
4903
if_rxr_put(&sc->sc_arq_ring, n);
sys/dev/pci/if_ixl.c
5353
size_t n;
sys/dev/pci/if_ixl.c
5367
for (i = 0; i < state->n; i++) {
sys/dev/pci/if_ixl.c
5388
uint64_t *ovs = state->values + (gen * state->n);
sys/dev/pci/if_ixl.c
5389
uint64_t *nvs = state->values + (!gen * state->n);
sys/dev/pci/if_ixl.c
5395
for (i = 0; i < state->n; i++) {
sys/dev/pci/if_ixl.c
5397
uint64_t n = nvs[i], o = ovs[i];
sys/dev/pci/if_ixl.c
5400
if (n < o)
sys/dev/pci/if_ixl.c
5401
n += (1ULL << c->c_width);
sys/dev/pci/if_ixl.c
5404
kstat_kv_u64(&kvs[i]) += (n - o);
sys/dev/pci/if_ixl.c
5427
const struct ixl_counter *counters, size_t n, uint32_t index)
sys/dev/pci/if_ixl.c
5441
kvs = mallocarray(n, sizeof(*kvs), M_DEVBUF, M_WAITOK|M_ZERO);
sys/dev/pci/if_ixl.c
5442
for (i = 0; i < n; i++) {
sys/dev/pci/if_ixl.c
5450
ks->ks_datalen = n * sizeof(*kvs);
sys/dev/pci/if_ixl.c
5455
state->n = n;
sys/dev/pci/if_ixl.c
5456
state->values = mallocarray(n * 2, sizeof(*state->values),
sys/dev/pci/if_lge.c
148
#define DPRINTFN(n,x) if (lgedebug >= (n)) printf x
sys/dev/pci/if_lge.c
152
#define DPRINTFN(n,x)
sys/dev/pci/if_mcx.c
8658
unsigned int i, n;
sys/dev/pci/if_mcx.c
8690
n = 0;
sys/dev/pci/if_mcx.c
8715
sc->sc_kstat_mtmp[n++] = ks;
sys/dev/pci/if_mcx.c
8716
if (n >= sc->sc_kstat_mtmp_count)
sys/dev/pci/if_msk.c
212
#define DPRINTFN(n,x) if (mskdebug >= (n)) printf x
sys/dev/pci/if_msk.c
220
#define DPRINTFN(n,x)
sys/dev/pci/if_mskvar.h
122
#define MSK_CDTXSYNC(sc, x, n, ops) \
sys/dev/pci/if_mskvar.h
127
__n = (n); \
sys/dev/pci/if_mwxreg.h
84
#define MT_TX_AGG_CNT(_band, n) MT_BAND_ADDR(_band, 0xd7dc + ((n) << 2))
sys/dev/pci/if_mwxreg.h
85
#define MT_TX_AGG_CNT2(_band, n) MT_BAND_ADDR(_band, 0xd7ec + ((n) << 2))
sys/dev/pci/if_nep.c
1114
int n, i;
sys/dev/pci/if_nep.c
1130
n = 1000;
sys/dev/pci/if_nep.c
1131
while (--n) {
sys/dev/pci/if_nep.c
1136
if (n == 0)
sys/dev/pci/if_nep.c
1187
int n, i;
sys/dev/pci/if_nep.c
1191
n = 1000;
sys/dev/pci/if_nep.c
1192
while (--n) {
sys/dev/pci/if_nep.c
1198
if (n == 0)
sys/dev/pci/if_nep.c
1228
int n, i;
sys/dev/pci/if_nep.c
1231
n = 1000;
sys/dev/pci/if_nep.c
1232
while (--n) {
sys/dev/pci/if_nep.c
1237
if (n == 0)
sys/dev/pci/if_nep.c
1277
int i, n;
sys/dev/pci/if_nep.c
1284
n = 1000;
sys/dev/pci/if_nep.c
1285
while (--n) {
sys/dev/pci/if_nep.c
1290
if (n == 0)
sys/dev/pci/if_nep.c
1349
int n;
sys/dev/pci/if_nep.c
1353
n = 1000;
sys/dev/pci/if_nep.c
1354
while (--n) {
sys/dev/pci/if_nep.c
1360
if (n == 0)
sys/dev/pci/if_nep.c
1393
int n;
sys/dev/pci/if_nep.c
1396
n = 1000;
sys/dev/pci/if_nep.c
1397
while (--n) {
sys/dev/pci/if_nep.c
1402
if (n == 0)
sys/dev/pci/if_nep.c
1416
int n;
sys/dev/pci/if_nep.c
1433
n = 1000;
sys/dev/pci/if_nep.c
1434
while (--n) {
sys/dev/pci/if_nep.c
1439
if (n == 0)
sys/dev/pci/if_nep.c
1520
int n;
sys/dev/pci/if_nep.c
1526
n = 1000;
sys/dev/pci/if_nep.c
1527
while (--n) {
sys/dev/pci/if_nep.c
1532
if (n == 0)
sys/dev/pci/if_nep.c
1539
n = 1000;
sys/dev/pci/if_nep.c
1540
while (--n) {
sys/dev/pci/if_nep.c
1545
if (n == 0)
sys/dev/pci/if_nep.c
1556
int i, n;
sys/dev/pci/if_nep.c
1620
n = 1000;
sys/dev/pci/if_nep.c
1621
while (--n) {
sys/dev/pci/if_nep.c
1626
if (n == 0)
sys/dev/pci/if_nep.c
1791
struct mbuf *n;
sys/dev/pci/if_nep.c
1795
MGET(n, M_DONTWAIT, MT_DATA);
sys/dev/pci/if_nep.c
1796
if (n == NULL) {
sys/dev/pci/if_nep.c
1800
memset(mtod(n, caddr_t), 0, padlen);
sys/dev/pci/if_nep.c
1801
n->m_len = padlen;
sys/dev/pci/if_nep.c
1802
m_cat(m, n);
sys/dev/pci/if_nep.c
807
int n;
sys/dev/pci/if_nep.c
812
for (n = 0; n < 1000; n++) {
sys/dev/pci/if_nep.c
828
int n;
sys/dev/pci/if_nep.c
834
for (n = 0; n < 1000; n++) {
sys/dev/pci/if_nfe.c
104
#define DPRINTFN(n,x) do { if (nfedebug >= (n)) printf x; } while (0)
sys/dev/pci/if_nfe.c
107
#define DPRINTFN(n,x)
sys/dev/pci/if_ngbe.c
670
int error, i, n = 0;
sys/dev/pci/if_ngbe.c
678
ifr[n].ifr_size = MCLBYTES;
sys/dev/pci/if_ngbe.c
679
snprintf(ifr[n].ifr_name, sizeof(ifr[n].ifr_name), "%d", i);
sys/dev/pci/if_ngbe.c
680
ifr[n].ifr_info = rxr->rx_ring;
sys/dev/pci/if_ngbe.c
681
n++;
sys/dev/pci/if_nge.c
173
#define DPRINTFN(n,x) if (ngedebug >= (n)) printf x
sys/dev/pci/if_nge.c
177
#define DPRINTFN(n,x)
sys/dev/pci/if_oce.c
897
u_int n = 0;
sys/dev/pci/if_oce.c
906
ifr[n].ifr_size = MCLBYTES;
sys/dev/pci/if_oce.c
907
snprintf(ifr[n].ifr_name, sizeof(ifr[n].ifr_name), "/%d", i);
sys/dev/pci/if_oce.c
908
ifr[n].ifr_info = rq->rxring;
sys/dev/pci/if_oce.c
909
n++;
sys/dev/pci/if_pcn.c
332
#define PCN_CDTXSYNC(sc, x, n, ops) \
sys/dev/pci/if_pcn.c
337
__n = (n); \
sys/dev/pci/if_rtwn.c
207
#define DPRINTFN(n, x) do { if (rtwn_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_rtwn.c
211
#define DPRINTFN(n, x)
sys/dev/pci/if_sis.c
173
sis_reverse(u_int16_t n)
sys/dev/pci/if_sis.c
175
n = ((n >> 1) & 0x5555) | ((n << 1) & 0xaaaa);
sys/dev/pci/if_sis.c
176
n = ((n >> 2) & 0x3333) | ((n << 2) & 0xcccc);
sys/dev/pci/if_sis.c
177
n = ((n >> 4) & 0x0f0f) | ((n << 4) & 0xf0f0);
sys/dev/pci/if_sis.c
178
n = ((n >> 8) & 0x00ff) | ((n << 8) & 0xff00);
sys/dev/pci/if_sis.c
180
return (n);
sys/dev/pci/if_sk.c
173
#define DPRINTFN(n,x) if (skdebug >= (n)) printf x
sys/dev/pci/if_sk.c
181
#define DPRINTFN(n,x)
sys/dev/pci/if_skvar.h
134
#define SK_CDTXSYNC(sc, x, n, ops) \
sys/dev/pci/if_skvar.h
139
__n = (n); \
sys/dev/pci/if_vge.c
166
#define DPRINTFN(n, x) if (vge_debug >= (n)) printf x
sys/dev/pci/if_vmx.c
1812
int n;
sys/dev/pci/if_vmx.c
1814
if (bus_dmamem_alloc(t, size, align, 0, segs, 1, &n,
sys/dev/pci/if_vmx.c
1930
unsigned int n, i;
sys/dev/pci/if_vmx.c
1937
n = ks->ks_datalen / sizeof(*kvs);
sys/dev/pci/if_vmx.c
1938
for (i = 0; i < n; i++)
sys/dev/pci/if_vmx.c
1948
const struct vmx_kstat_tpl *tpls, unsigned int n, uint64_t *vs)
sys/dev/pci/if_vmx.c
1959
kvs = mallocarray(n, sizeof(*kvs), M_DEVBUF, M_WAITOK|M_ZERO);
sys/dev/pci/if_vmx.c
1960
for (i = 0; i < n; i++) {
sys/dev/pci/if_vmx.c
1971
ks->ks_datalen = n * sizeof(*kvs);
sys/dev/pci/if_vte.c
573
struct mbuf *m, *n;
sys/dev/pci/if_vte.c
606
n = sc->vte_cdata.vte_txmbufs[sc->vte_cdata.vte_tx_prod];
sys/dev/pci/if_vte.c
607
m_copydata(m, 0, m->m_pkthdr.len, mtod(n, char *));
sys/dev/pci/if_vte.c
608
n->m_pkthdr.len = m->m_pkthdr.len;
sys/dev/pci/if_vte.c
609
n->m_len = m->m_pkthdr.len;
sys/dev/pci/if_vte.c
610
m = n;
sys/dev/pci/if_vte.c
848
int n;
sys/dev/pci/if_vte.c
858
for (n = 8; (status & VTE_INTRS) != 0;) {
sys/dev/pci/if_vte.c
871
if (--n > 0)
sys/dev/pci/if_wpi.c
148
#define DPRINTFN(n, x) do { if (wpi_debug >= (n)) printf x; } while (0)
sys/dev/pci/if_wpi.c
152
#define DPRINTFN(n, x)
sys/dev/pci/if_wpi.c
2281
#define fdivround(a, b, n) \
sys/dev/pci/if_wpi.c
2282
((((1 << n) * (a)) / (b) + (1 << n) / 2) / (1 << n))
sys/dev/pci/if_wpi.c
2285
#define interpolate(x, x1, y1, x2, y2, n) \
sys/dev/pci/if_wpi.c
2286
((y1) + fdivround(((x) - (x1)) * ((y2) - (y1)), (x2) - (x1), n))
sys/dev/pci/if_wpi.c
894
wpi_read_eeprom_channels(struct wpi_softc *sc, int n)
sys/dev/pci/if_wpi.c
897
const struct wpi_chan_band *band = &wpi_bands[n];
sys/dev/pci/if_wpi.c
910
if (n == 0) { /* 2GHz band */
sys/dev/pci/if_wpi.c
949
wpi_read_eeprom_group(struct wpi_softc *sc, int n)
sys/dev/pci/if_wpi.c
951
struct wpi_power_group *group = &sc->groups[n];
sys/dev/pci/if_wpi.c
955
wpi_read_prom_data(sc, WPI_EEPROM_POWER_GRP + n * 32, &rgroup,
sys/dev/pci/if_wpi.c
964
DPRINTF(("power group %d: chan=%d maxpwr=%d temp=%d\n", n,
sys/dev/pci/if_xge.c
198
#define DPRINTFN(n,x) do { if (xgedebug >= (n)) printf x ; } while (0)
sys/dev/pci/if_xge.c
202
#define DPRINTFN(n,x)
sys/dev/pci/ips.c
1963
ips_ccb_alloc(struct ips_softc *sc, int n)
sys/dev/pci/ips.c
1968
if ((ccb = mallocarray(n, sizeof(*ccb), M_DEVBUF,
sys/dev/pci/ips.c
1972
for (i = 0; i < n; i++) {
sys/dev/pci/ips.c
1989
free(ccb, M_DEVBUF, n * sizeof(*ccb));
sys/dev/pci/ips.c
1994
ips_ccb_free(struct ips_softc *sc, struct ips_ccb *ccb, int n)
sys/dev/pci/ips.c
1998
for (i = 0; i < n; i++)
sys/dev/pci/ips.c
2000
free(ccb, M_DEVBUF, n * sizeof(*ccb));
sys/dev/pci/kate.c
198
int8_t n = sc->sc_numsensors;
sys/dev/pci/kate.c
204
for (i = 0; i < n; i++) {
sys/dev/pci/maestro.c
1083
int n = ch->num;
sys/dev/pci/maestro.c
1105
wp_apu_write(sc, n, APUREG_WAVESPACE, ch->wpwa & 0xff00);
sys/dev/pci/maestro.c
1106
wp_apu_write(sc, n, APUREG_CURPTR, ch->current);
sys/dev/pci/maestro.c
1107
wp_apu_write(sc, n, APUREG_ENDPTR, ch->end);
sys/dev/pci/maestro.c
1108
wp_apu_write(sc, n, APUREG_LOOPLEN, ch->end - ch->start);
sys/dev/pci/maestro.c
1109
wp_apu_write(sc, n, APUREG_AMPLITUDE, 0xe800);
sys/dev/pci/maestro.c
1110
wp_apu_write(sc, n, APUREG_POSITION, 0x8f00
sys/dev/pci/maestro.c
1113
wp_apu_write(sc, n, APUREG_FREQ_LOBYTE, APU_plus6dB
sys/dev/pci/maestro.c
1115
wp_apu_write(sc, n, APUREG_FREQ_HIWORD, ch->dv >> 8);
sys/dev/pci/maestro.c
1116
wc_ctrl_write(sc, n, wcreg);
sys/dev/pci/maestro.c
1117
wp_apu_write(sc, n, APUREG_APUTYPE,
sys/dev/pci/maestro.c
1122
wp_apu_write(sc, n+1, APUREG_WAVESPACE, ch->wpwa & 0xff00);
sys/dev/pci/maestro.c
1123
wp_apu_write(sc, n+1, APUREG_CURPTR, ch->current);
sys/dev/pci/maestro.c
1124
wp_apu_write(sc, n+1, APUREG_ENDPTR, ch->end);
sys/dev/pci/maestro.c
1125
wp_apu_write(sc, n+1, APUREG_LOOPLEN, ch->end - ch->start);
sys/dev/pci/maestro.c
1126
wp_apu_write(sc, n+1, APUREG_AMPLITUDE, 0xe800);
sys/dev/pci/maestro.c
1127
wp_apu_write(sc, n+1, APUREG_POSITION, 0x8f00
sys/dev/pci/maestro.c
1130
wp_apu_write(sc, n+1, APUREG_FREQ_LOBYTE, APU_plus6dB
sys/dev/pci/maestro.c
1132
wp_apu_write(sc, n+1, APUREG_FREQ_HIWORD, ch->dv >> 8);
sys/dev/pci/maestro.c
1134
wp_apu_write(sc, n, APUREG_WAVESPACE,
sys/dev/pci/maestro.c
1137
wp_apu_write(sc, n, APUREG_WAVESPACE,
sys/dev/pci/maestro.c
1139
wp_apu_write(sc, n, APUREG_CURPTR, ch->current);
sys/dev/pci/maestro.c
1140
wp_apu_write(sc, n, APUREG_ENDPTR, ch->end);
sys/dev/pci/maestro.c
1141
wp_apu_write(sc, n, APUREG_LOOPLEN, ch->end - ch->start);
sys/dev/pci/maestro.c
1142
wp_apu_write(sc, n, APUREG_AMPLITUDE, 0xe800);
sys/dev/pci/maestro.c
1143
wp_apu_write(sc, n, APUREG_POSITION, 0x8f00
sys/dev/pci/maestro.c
1146
wp_apu_write(sc, n, APUREG_FREQ_LOBYTE, APU_plus6dB
sys/dev/pci/maestro.c
1148
wp_apu_write(sc, n, APUREG_FREQ_HIWORD, ch->dv >> 8);
sys/dev/pci/maestro.c
1149
wc_ctrl_write(sc, n, wcreg);
sys/dev/pci/maestro.c
1150
wc_ctrl_write(sc, n+1, wcreg);
sys/dev/pci/maestro.c
1151
wp_apu_write(sc, n, APUREG_APUTYPE,
sys/dev/pci/maestro.c
1153
wp_apu_write(sc, n+1, APUREG_APUTYPE,
sys/dev/pci/maestro.c
1461
int n, i, delta, v;
sys/dev/pci/maestro.c
1464
n = bus_space_read_1(sc->iot, sc->ioh, PORT_HWVOL_MASTER);
sys/dev/pci/maestro.c
1466
if (n & 0x11) {
sys/dev/pci/maestro.c
1482
delta = (n - MIDDLE_VOLUME)/STEP_VOLUME * 8;
sys/dev/pci/maestro.c
927
u_int n;
sys/dev/pci/maestro.c
932
n = maestro_calc_timer_freq(&sc->record);
sys/dev/pci/maestro.c
933
if (freq < n)
sys/dev/pci/maestro.c
934
freq = n;
sys/dev/pci/mbg.c
409
int n;
sys/dev/pci/mbg.c
437
for (n = 0; n < quot; n++) {
sys/dev/pci/mbg.c
445
for (n = 0; n < rem; n++)
sys/dev/pci/mbg.c
446
*buf++ = *((char *)&ul + n);
sys/dev/pci/mbg.c
462
size_t n;
sys/dev/pci/mbg.c
492
for (n = 0; n < len; n++) {
sys/dev/pci/mbg.c
497
buf[n] = bus_space_read_1(sc->sc_iot, sc->sc_ioh,
sys/dev/pci/mbg.c
498
AMCC_FIFO + (n % 4));
sys/dev/pci/mbg.c
512
size_t n;
sys/dev/pci/mbg.c
544
for (n = 0; n < len / 4; n++) {
sys/dev/pci/mbg.c
553
for (n = 0; n < len % 4; n++) {
sys/dev/pci/mfii.c
336
#define DNPRINTF(n,x...) do { if (mfii_debug & n) printf(x); } while(0)
sys/dev/pci/mfii.c
357
#define DNPRINTF(n,x...)
sys/dev/pci/mmuagp.c
239
int maxdevs, i, n;
sys/dev/pci/mmuagp.c
251
for (i = 0, n = 0; i < maxdevs && n < AMD64_MAX_MCTRL; i++) {
sys/dev/pci/mmuagp.c
256
msc->mctrl_tag[n] = tag;
sys/dev/pci/mmuagp.c
257
n++;
sys/dev/pci/mmuagp.c
260
if (n == 0) {
sys/dev/pci/mmuagp.c
264
msc->n_mctrl = n;
sys/dev/pci/mpii.c
47
#define DNPRINTF(n,x...) do { if (mpii_debug & (n)) printf(x); } while(0)
sys/dev/pci/mpii.c
79
#define DNPRINTF(n,x...)
sys/dev/pci/qle.c
2473
qle_dump_stuff(struct qle_softc *sc, void *buf, int n)
sys/dev/pci/qle.c
2483
for (l = 0; l < n; l++) {
sys/dev/pci/qle.c
2488
if (n % 16 != 0)
sys/dev/pci/qle.c
2515
qle_dump_iocb_segs(struct qle_softc *sc, void *segs, int n)
sys/dev/pci/qle.c
2525
for (s = 0; s < n; s++) {
sys/dev/pci/sv.c
622
int a, n, m, best_n, best_m, best_error = 10000000;
sys/dev/pci/sv.c
63
#define DPRINTFN(n,x) if (svdebug>(n)) printf x
sys/dev/pci/sv.c
632
for (n = 33; n > 2; n--) {
sys/dev/pci/sv.c
635
m = (goal_f_out * n * (1 << a)) / F_REF;
sys/dev/pci/sv.c
639
pll_sample = (m * F_REF) / (n * (1 << a));
sys/dev/pci/sv.c
648
best_n = n;
sys/dev/pci/sv.c
67
#define DPRINTFN(n,x)
sys/dev/pci/tga.c
174
#define DPRINTFN(n, ...) if (tgadebug > (n)) printf (__VA_ARGS__)
sys/dev/pci/tga.c
178
#define DPRINTFN(n,...)
sys/dev/pci/virtio_pci.c
43
#define DNPRINTF(n,x...) \
sys/dev/pci/virtio_pci.c
44
do { if (VIRTIO_DEBUG >= n) printf(x); } while(0)
sys/dev/pci/yds.c
200
#define YDS_DUMP_PLAY_SLOT(n,sc,bank) \
sys/dev/pci/yds.c
201
if (ydsdebug > (n)) yds_dump_play_slot(sc, bank)
sys/dev/pci/yds.c
203
#define YDS_DUMP_PLAY_SLOT(n,sc,bank)
sys/dev/pci/yds.c
67
# define DPRINTFN(n,x) if (ydsdebug>(n)) printf x
sys/dev/pci/yds.c
71
# define DPRINTFN(n,x)
sys/dev/pckbc/pms.c
2581
int id, weight, n, x, y, z;
sys/dev/pckbc/pms.c
2608
for (n = 0; n < 6; n += 3) {
sys/dev/pckbc/pms.c
2609
id = ((sc->packet[n] & 0xe0) >> 5) - 1;
sys/dev/pckbc/pms.c
2612
x = weight * (signed char)sc->packet[n + 1];
sys/dev/pckbc/pms.c
2613
y = weight * (signed char)sc->packet[n + 2];
sys/dev/pckbc/wskbdmap_mfii.c
44
#define KC(n) KS_KEYCODE(n)
sys/dev/pcmcia/if_ne_pcmcia.c
576
#define ne2000_match(card, fct, n) \
sys/dev/pcmcia/if_ne_pcmcia.c
578
((card)->manufacturer == ne2000devs[(n)].manufacturer) && \
sys/dev/pcmcia/if_ne_pcmcia.c
580
((card)->product == ne2000devs[(n)].product)) || \
sys/dev/pcmcia/if_ne_pcmcia.c
581
((ne2000devs[(n)].cis_info[0]) && (ne2000devs[(n)].cis_info[1]) && \
sys/dev/pcmcia/if_ne_pcmcia.c
583
(strcmp((card)->cis1_info[0], ne2000devs[(n)].cis_info[0]) == 0) && \
sys/dev/pcmcia/if_ne_pcmcia.c
584
(strcmp((card)->cis1_info[1], ne2000devs[(n)].cis_info[1]) == 0))) && \
sys/dev/pcmcia/if_ne_pcmcia.c
585
((fct) == ne2000devs[(n)].function))? \
sys/dev/pcmcia/if_ne_pcmcia.c
586
&ne2000devs[(n)]:NULL)
sys/dev/pcmcia/pcmciavar.h
230
#define pcmcia_tuple_read_n(tuple, n, idxn) \
sys/dev/pcmcia/pcmciavar.h
231
(((n)==1)?pcmcia_tuple_read_1((tuple), (idxn)) : \
sys/dev/pcmcia/pcmciavar.h
232
(((n)==2)?pcmcia_tuple_read_2((tuple), (idxn)) : \
sys/dev/pcmcia/pcmciavar.h
233
(((n)==3)?pcmcia_tuple_read_3((tuple), (idxn)) : \
sys/dev/pv/if_xnf.c
541
int n = 0;
sys/dev/pv/if_xnf.c
552
n++;
sys/dev/pv/if_xnf.c
553
n++;
sys/dev/pv/if_xnf.c
555
return (n);
sys/dev/pv/if_xnf.c
567
int i, flags, n, used = 0;
sys/dev/pv/if_xnf.c
605
for (n = 0; n < txb->txb_dmap->dm_nsegs; n++) {
sys/dev/pv/if_xnf.c
609
if (m == m_head && n == 0) {
sys/dev/pv/if_xnf.c
618
txb->txb_dmap->dm_segs[n].ds_len;
sys/dev/pv/if_xnf.c
621
txb->txb_dmap->dm_segs[n].ds_addr;
sys/dev/pv/if_xnf.c
622
if (n == 0)
sys/dev/pv/pvclock.c
49
uint64_t n)
sys/dev/pv/pvclock.c
51
return atomic_cas_ulong((volatile unsigned long *)p, e, n);
sys/dev/pv/pvclock.c
71
uint64_t n)
sys/dev/pv/pvclock.c
74
: "b" ((uint32_t)n), "c" ((uint32_t)(n >> 32)));
sys/dev/pv/vioblk.c
165
#define DNPRINTF(n,x...) \
sys/dev/pv/vioblk.c
166
do { if (VIRTIO_DEBUG >= n) printf(x); } while(0)
sys/dev/pv/virtio.c
1019
uint16_t n;
sys/dev/pv/virtio.c
1022
n = (uint16_t)(vq->vq_used->idx - vq->vq_used_idx);
sys/dev/pv/virtio.c
1023
VIRTIO_ASSERT(n <= vq->vq_num);
sys/dev/pv/virtio.c
1025
return n;
sys/dev/pv/virtio.c
188
int n;
sys/dev/pv/virtio.c
192
n = virtio_read_queue_size(sc, vq->vq_index);
sys/dev/pv/virtio.c
193
if (n != vq->vq_num) {
sys/dev/pv/virtio.c
362
#define VIRTQUEUE_ALIGN(n) (((n)+(VIRTIO_PAGE_SIZE-1))& \
sys/dev/pv/virtio.c
765
uint16_t n = vq->vq_avail_idx;
sys/dev/pv/virtio.c
772
if ((uint16_t)(n - t) < (uint16_t)(n - o))
sys/dev/pv/virtiovar.h
206
#define virtio_negotiate_features(sc, n) (sc)->sc_ops->neg_features(sc, n)
sys/dev/rasops/rasops15.c
64
#define STAMP_SHIFT(fb,n) ((n*4-3) >= 0 ? (fb)>>(n*4-3):(fb)<<-(n*4-3))
sys/dev/rasops/rasops24.c
66
#define STAMP_SHIFT(fb,n) ((n*4-4) >= 0 ? (fb)>>(n*4-4):(fb)<<-(n*4-4))
sys/dev/rasops/rasops8.c
63
#define STAMP_SHIFT(fb,n) ((n*4-2) >= 0 ? (fb)>>(n*4-2):(fb)<<-(n*4-2))
sys/dev/rasops/rasops_masks.h
82
int n = (x) + (w) - 32; \
sys/dev/rasops/rasops_masks.h
84
if (n <= 0) { \
sys/dev/rasops/rasops_masks.h
85
n = rasops_pmask[x & 31][w & 31]; \
sys/dev/rasops/rasops_masks.h
86
*(dp) = (*(dp) & ~n) | (MBR(sw, x) & n); \
sys/dev/rasops/rasops_masks.h
89
(dp)[1] = ((dp)[1] & rasops_rmask[n]) | \
sys/dev/rasops/rasops_masks.h
90
(MBL(sw, 32-(x)) & rasops_lmask[n]); \
sys/dev/rnd.c
210
add_entropy_words(const u_int32_t *buf, u_int n)
sys/dev/rnd.c
220
for (; n--; buf++) {
sys/dev/rnd.c
365
_rs_init(u_char *buf, size_t n)
sys/dev/rnd.c
367
KASSERT(n >= KEYSZ + IVSZ);
sys/dev/rnd.c
373
_rs_seed(u_char *buf, size_t n)
sys/dev/rnd.c
375
_rs_rekey(buf, n);
sys/dev/rnd.c
491
_rs_random_buf(void *_buf, size_t n)
sys/dev/rnd.c
496
_rs_stir_if_needed(n);
sys/dev/rnd.c
497
while (n > 0) {
sys/dev/rnd.c
499
m = MIN(n, rs_have);
sys/dev/rnd.c
503
n -= m;
sys/dev/rnd.c
538
arc4random_buf(void *buf, size_t n)
sys/dev/rnd.c
541
_rs_random_buf(buf, n);
sys/dev/rnd.c
575
arc4random_ctx_buf(struct arc4random_ctx *ctx, void *buf, size_t n)
sys/dev/rnd.c
578
memset(buf, 0, n);
sys/dev/rnd.c
580
chacha_encrypt_bytes((chacha_ctx *)ctx, buf, buf, n);
sys/dev/rnd.c
709
size_t n = ulmin(POOLBYTES, uio->uio_resid);
sys/dev/rnd.c
712
arc4random_ctx_buf(lctx, buf, n);
sys/dev/rnd.c
714
arc4random_buf(buf, n);
sys/dev/rnd.c
715
ret = uiomove(buf, n, uio);
sys/dev/rnd.c
738
size_t n = ulmin(POOLBYTES, uio->uio_resid);
sys/dev/rnd.c
740
ret = uiomove(buf, n, uio);
sys/dev/rnd.c
743
while (n % sizeof(u_int32_t))
sys/dev/rnd.c
744
((u_int8_t *)buf)[n++] = 0;
sys/dev/rnd.c
745
add_entropy_words(buf, n / 4);
sys/dev/sbus/be.c
1144
int n = 32;
sys/dev/sbus/be.c
1146
while (n--) {
sys/dev/sbus/be.c
1284
int n;
sys/dev/sbus/be.c
1290
for (n = 16; n >= 0; n--) {
sys/dev/sbus/be.c
1296
if (n == 0) {
sys/dev/sbus/be.c
447
struct mbuf *n;
sys/dev/sbus/be.c
453
for (; m; m = n) {
sys/dev/sbus/be.c
456
n = m_free(m);
sys/dev/sbus/be.c
462
n = m_free(m);
sys/dev/sbus/be.c
617
int n;
sys/dev/sbus/be.c
629
for (n = 32; n > 0; n--) {
sys/dev/sbus/be.c
637
for (n = 32; n > 0; n--) {
sys/dev/sbus/cgsix.c
794
cgsix_ras_copyrows(void *cookie, int src, int dst, int n)
sys/dev/sbus/cgsix.c
802
n += src;
sys/dev/sbus/cgsix.c
805
if (src + n > ri->ri_rows)
sys/dev/sbus/cgsix.c
806
n = ri->ri_rows - src;
sys/dev/sbus/cgsix.c
808
n += dst;
sys/dev/sbus/cgsix.c
811
if (dst + n > ri->ri_rows)
sys/dev/sbus/cgsix.c
812
n = ri->ri_rows - dst;
sys/dev/sbus/cgsix.c
813
if (n <= 0)
sys/dev/sbus/cgsix.c
815
n *= ri->ri_font->fontheight;
sys/dev/sbus/cgsix.c
831
FBC_WRITE(sc, CG6_FBC_Y1, ri->ri_yorigin + src + n - 1);
sys/dev/sbus/cgsix.c
835
FBC_WRITE(sc, CG6_FBC_Y3, ri->ri_yorigin + dst + n - 1);
sys/dev/sbus/cgsix.c
843
cgsix_ras_copycols(void *cookie, int row, int src, int dst, int n)
sys/dev/sbus/cgsix.c
853
n += src;
sys/dev/sbus/cgsix.c
856
if (src + n > ri->ri_cols)
sys/dev/sbus/cgsix.c
857
n = ri->ri_cols - src;
sys/dev/sbus/cgsix.c
859
n += dst;
sys/dev/sbus/cgsix.c
862
if (dst + n > ri->ri_cols)
sys/dev/sbus/cgsix.c
863
n = ri->ri_cols - dst;
sys/dev/sbus/cgsix.c
864
if (n <= 0)
sys/dev/sbus/cgsix.c
866
n *= ri->ri_font->fontwidth;
sys/dev/sbus/cgsix.c
882
FBC_WRITE(sc, CG6_FBC_X1, ri->ri_xorigin + src + n - 1);
sys/dev/sbus/cgsix.c
887
FBC_WRITE(sc, CG6_FBC_X3, ri->ri_xorigin + dst + n - 1);
sys/dev/sbus/cgsix.c
897
cgsix_ras_erasecols(void *cookie, int row, int col, int n, uint32_t attr)
sys/dev/sbus/cgsix.c
906
n += col;
sys/dev/sbus/cgsix.c
909
if (col + n > ri->ri_cols)
sys/dev/sbus/cgsix.c
910
n = ri->ri_cols - col;
sys/dev/sbus/cgsix.c
911
if (n <= 0)
sys/dev/sbus/cgsix.c
913
n *= ri->ri_font->fontwidth;
sys/dev/sbus/cgsix.c
933
FBC_WRITE(sc, CG6_FBC_ARECTX, ri->ri_xorigin + col + n - 1);
sys/dev/sbus/cgsix.c
941
cgsix_ras_eraserows(void *cookie, int row, int n, uint32_t attr)
sys/dev/sbus/cgsix.c
948
n += row;
sys/dev/sbus/cgsix.c
951
if (row + n > ri->ri_rows)
sys/dev/sbus/cgsix.c
952
n = ri->ri_rows - row;
sys/dev/sbus/cgsix.c
953
if (n <= 0)
sys/dev/sbus/cgsix.c
968
if ((n == ri->ri_rows) && (ri->ri_flg & RI_FULLCLEAR)) {
sys/dev/sbus/cgsix.c
978
ri->ri_yorigin + row + (n * ri->ri_font->fontheight) - 1);
sys/dev/sbus/cs4231.c
1363
u_long n;
sys/dev/sbus/cs4231.c
1383
n = (char *)end - (char *)start;
sys/dev/sbus/cs4231.c
1391
chan->cs_segsz = n;
sys/dev/sbus/cs4231.c
1393
if (n > chan->cs_blksz)
sys/dev/sbus/cs4231.c
1394
n = chan->cs_blksz;
sys/dev/sbus/cs4231.c
1396
chan->cs_cnt = n;
sys/dev/sbus/cs4231.c
1402
APC_WRITE(sc, APC_PNC, (u_long)n);
sys/dev/sbus/cs4231.c
1427
u_long n;
sys/dev/sbus/cs4231.c
1446
n = (char *)end - (char *)start;
sys/dev/sbus/cs4231.c
1454
chan->cs_segsz = n;
sys/dev/sbus/cs4231.c
1456
if (n > chan->cs_blksz)
sys/dev/sbus/cs4231.c
1457
n = chan->cs_blksz;
sys/dev/sbus/cs4231.c
1458
chan->cs_cnt = n;
sys/dev/sbus/cs4231.c
1462
APC_WRITE(sc, APC_CNC, (u_long)n);
sys/dev/sbus/cs4231.c
299
int i, n, selected = -1;
sys/dev/sbus/cs4231.c
301
n = sizeof(speed_table) / sizeof(speed_struct);
sys/dev/sbus/cs4231.c
305
if (arg > speed_table[n - 1].speed)
sys/dev/sbus/cs4231.c
306
selected = n - 1;
sys/dev/sbus/cs4231.c
308
for (i = 1; selected == -1 && i < n; i++) {
sys/dev/sbus/mgx.c
646
mgx_ras_copycols(void *v, int row, int src, int dst, int n)
sys/dev/sbus/mgx.c
652
n *= ri->ri_font->fontwidth;
sys/dev/sbus/mgx.c
663
src += n - 1;
sys/dev/sbus/mgx.c
664
dst += n - 1;
sys/dev/sbus/mgx.c
672
mgx_write_4(sc->sc_xreg, ATR_WH, ATR_DUAL(ri->ri_font->fontheight, n));
sys/dev/sbus/mgx.c
679
mgx_ras_copyrows(void *v, int src, int dst, int n)
sys/dev/sbus/mgx.c
685
n *= ri->ri_font->fontheight;
sys/dev/sbus/mgx.c
694
src += n - 1;
sys/dev/sbus/mgx.c
695
dst += n - 1;
sys/dev/sbus/mgx.c
703
mgx_write_4(sc->sc_xreg, ATR_WH, ATR_DUAL(n, ri->ri_emuwidth));
sys/dev/sbus/mgx.c
710
mgx_ras_erasecols(void *v, int row, int col, int n, uint32_t attr)
sys/dev/sbus/mgx.c
720
n *= ri->ri_font->fontwidth;
sys/dev/sbus/mgx.c
733
mgx_write_4(sc->sc_xreg, ATR_WH, ATR_DUAL(ri->ri_font->fontheight, n));
sys/dev/sbus/mgx.c
740
mgx_ras_eraserows(void *v, int row, int n, uint32_t attr)
sys/dev/sbus/mgx.c
756
if (n == ri->ri_rows && ISSET(ri->ri_flg, RI_FULLCLEAR)) {
sys/dev/sbus/mgx.c
761
n *= ri->ri_font->fontheight;
sys/dev/sbus/mgx.c
767
mgx_write_4(sc->sc_xreg, ATR_WH, ATR_DUAL(n, ri->ri_emuwidth));
sys/dev/sbus/qe.c
359
struct mbuf *n;
sys/dev/sbus/qe.c
365
for (; m; m = n) {
sys/dev/sbus/qe.c
368
n = m_free(m);
sys/dev/sbus/qe.c
374
n = m_free(m);
sys/dev/sbus/qe.c
481
int n;
sys/dev/sbus/qe.c
485
for (n = 200; n > 0; n--) {
sys/dev/sbus/qe.c
494
for (n = 200; n > 0; n--) {
sys/dev/sdmmc/if_bwfm_sdio.c
66
#define DPRINTFN(n, x) do { if (bwfm_debug >= (n)) printf x; } while (0)
sys/dev/sdmmc/if_bwfm_sdio.c
70
#define DPRINTFN(n, x) do { ; } while (0)
sys/dev/sdmmc/sdhc.c
117
#define DPRINTF(n,s) do { if ((n) <= sdhcdebug) printf s; } while (0)
sys/dev/sdmmc/sdhc.c
120
#define DPRINTF(n,s) do {} while(0)
sys/dev/sdmmc/sdhc.c
457
int n, i, rv = 0;
sys/dev/sdmmc/sdhc.c
464
for (n = 0; n < sc->sc_nhosts; n++) {
sys/dev/sdmmc/sdhc.c
465
hp = sc->sc_host[n];
sys/dev/sdmmc/sdhc.c
472
for (n = 0; n < sc->sc_nhosts; n++) {
sys/dev/sdmmc/sdhc.c
473
hp = sc->sc_host[n];
sys/dev/sdmmc/sdmmc.c
77
#define DPRINTF(n,s) do { if ((n) <= sdmmcdebug) printf s; } while (0)
sys/dev/sdmmc/sdmmc.c
79
#define DPRINTF(n,s) do {} while (0)
sys/dev/softraid_crypto.c
284
int flags, i, n;
sys/dev/softraid_crypto.c
301
n = xs->datalen >> DEV_BSHIFT;
sys/dev/softraid_crypto.c
308
KASSERT(crwu->cr_crp->crp_ndescalloc >= n);
sys/dev/softraid_crypto.c
309
crwu->cr_crp->crp_ndesc = n;
sys/dev/softraidvar.h
316
#define DNPRINTF(n,x...) do { if (sr_debug & n) printf(x); } while(0)
sys/dev/softraidvar.h
328
#define DNPRINTF(n,x...)
sys/dev/sun/sunkbdmap.c
188
#define KC(n) KS_KEYCODE(n)
sys/dev/usb/dwc2/bitmap.h
101
bitmap_clear(void *p, int b, u_int n)
sys/dev/usb/dwc2/bitmap.h
103
u_int end = b + n;
sys/dev/usb/dwc2/bitmap.h
110
bitmap_find_next_zero_area_off(void *p, u_long size, u_long start, u_long n,
sys/dev/usb/dwc2/bitmap.h
119
end = index + n;
sys/dev/usb/dwc2/bitmap.h
133
bitmap_find_next_zero_area(void *p, u_long size, u_long start, u_long n,
sys/dev/usb/dwc2/bitmap.h
136
return bitmap_find_next_zero_area_off(p, size, start, n, align_mask, 0);
sys/dev/usb/dwc2/bitmap.h
92
bitmap_set(void *p, int b, u_int n)
sys/dev/usb/dwc2/bitmap.h
94
u_int end = b + n;
sys/dev/usb/dwc2/dwc2.c
63
#define DPRINTFN(n,fmt,...) do { \
sys/dev/usb/dwc2/dwc2.c
64
if (dwc2debug >= (n)) { \
sys/dev/usb/dwc2/list.h
123
#define list_for_each_entry_safe(pos, n, head, member) \
sys/dev/usb/dwc2/list.h
125
n = list_entry(pos->member.next, __typeof(*pos), member); \
sys/dev/usb/dwc2/list.h
127
pos = n, n = list_entry(n->member.next, __typeof(*n), member))
sys/dev/usb/ehci.c
85
#define DPRINTFN(n,x) do { if (ehcidebug>(n)) printf x; } while (0)
sys/dev/usb/ehci.c
90
#define DPRINTFN(n,x)
sys/dev/usb/ehcireg.h
142
#define EHCI_PORTSC(n) (0x40+4*(n)) /* RO, RW, RWC Port Status reg */
sys/dev/usb/if_atu.c
83
#define DPRINTFN(n,x) do { if (atudebug>(n)) printf x; } while (0)
sys/dev/usb/if_atu.c
87
#define DPRINTFN(n,x)
sys/dev/usb/if_aue.c
111
#define DPRINTFN(n,x) do { if (auedebug >= (n)) printf x; } while (0)
sys/dev/usb/if_aue.c
115
#define DPRINTFN(n,x)
sys/dev/usb/if_axe.c
125
#define DPRINTFN(n,x) do { if (axedebug >= (n)) printf x; } while (0)
sys/dev/usb/if_axe.c
129
#define DPRINTFN(n,x)
sys/dev/usb/if_axen.c
59
#define DPRINTFN(n,x) do { if (axendebug >= (n)) printf x; } while (0)
sys/dev/usb/if_axen.c
63
#define DPRINTFN(n,x)
sys/dev/usb/if_bwfm_usb.c
57
#define DPRINTFN(n, x) do { if (bwfm_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_bwfm_usb.c
61
#define DPRINTFN(n, x) do { ; } while (0)
sys/dev/usb/if_cdce.c
69
#define DPRINTFN(n, x) do { if (cdcedebug > (n)) printf x; } while (0)
sys/dev/usb/if_cdce.c
72
#define DPRINTFN(n, x)
sys/dev/usb/if_cue.c
86
#define DPRINTFN(n,x) do { if (cuedebug >= (n)) printf x; } while (0)
sys/dev/usb/if_cue.c
90
#define DPRINTFN(n,x)
sys/dev/usb/if_kue.c
101
#define DPRINTFN(n,x) do { if (kuedebug >= (n)) printf x; } while (0)
sys/dev/usb/if_kue.c
105
#define DPRINTFN(n,x)
sys/dev/usb/if_mos.c
106
#define DPRINTFN(n,x) do { if (mosdebug >= (n)) printf x; } while (0)
sys/dev/usb/if_mos.c
110
#define DPRINTFN(n,x)
sys/dev/usb/if_mtw.c
61
#define DPRINTFN(n, x) do { if (mtw_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_mtw.c
65
#define DPRINTFN(n, x)
sys/dev/usb/if_mue.c
56
#define DPRINTFN(n,x) do { if (muedebug >= (n)) printf x; } while (0)
sys/dev/usb/if_mue.c
60
#define DPRINTFN(n,x)
sys/dev/usb/if_otus.c
58
#define DPRINTFN(n, x) do { if (otus_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_otus.c
62
#define DPRINTFN(n, x)
sys/dev/usb/if_ral.c
60
#define DPRINTFN(n, x) do { if (ural_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_ral.c
64
#define DPRINTFN(n, x)
sys/dev/usb/if_rsu.c
57
#define DPRINTFN(n, x) do { if (rsu_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_rsu.c
61
#define DPRINTFN(n, x)
sys/dev/usb/if_rum.c
60
#define DPRINTFN(n, x) do { if (rum_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_rum.c
64
#define DPRINTFN(n, x)
sys/dev/usb/if_run.c
2968
run_rt3070_rf_write(sc, 2, rt3070_freqs[i].n);
sys/dev/usb/if_run.c
3044
run_rt3070_rf_write(sc, 2, rt3070_freqs[i].n);
sys/dev/usb/if_run.c
3195
run_rt3070_rf_write(sc, 8, rt3070_freqs[i].n);
sys/dev/usb/if_run.c
3346
run_rt3070_rf_write(sc, 8, rt3070_freqs[i].n);
sys/dev/usb/if_run.c
3470
run_rt3070_rf_write(sc, 8, freqs->n & 0xff);
sys/dev/usb/if_run.c
3473
rf |= ((freqs->n & 0x0100) >> 8) << 4;
sys/dev/usb/if_run.c
472
uint8_t n, r, k;
sys/dev/usb/if_run.c
478
uint16_t n;
sys/dev/usb/if_run.c
61
#define DPRINTFN(n, x) do { if (run_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_run.c
65
#define DPRINTFN(n, x)
sys/dev/usb/if_uaq.c
57
#define DPRINTFN(n,x) do { if (uaqdebug >= (n)) printf x; } while (0)
sys/dev/usb/if_uaq.c
61
#define DPRINTFN(n,x)
sys/dev/usb/if_uath.c
65
#define DPRINTFN(n, x) do { if (uath_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_uath.c
69
#define DPRINTFN(n, x)
sys/dev/usb/if_udav.c
127
#define DPRINTFN(n,x) do { if (udavdebug >= (n)) printf x; } while(0)
sys/dev/usb/if_udav.c
131
#define DPRINTFN(n,x)
sys/dev/usb/if_ugl.c
145
#define DPRINTFN(n,x) do { if (ugldebug >= (n)) printf x; } while (0)
sys/dev/usb/if_ugl.c
149
#define DPRINTFN(n,x)
sys/dev/usb/if_umb.c
2051
int n, i;
sys/dev/usb/if_umb.c
2082
n = letoh32(ic->ipv4_naddr);
sys/dev/usb/if_umb.c
2085
if (n == 0 || off + sizeof (ipv4elem) > len)
sys/dev/usb/if_umb.c
2087
if (n != 1 && ifp->if_flags & IFF_DEBUG)
sys/dev/usb/if_umb.c
2089
DEVNAM(ifp->if_softc), n);
sys/dev/usb/if_umb.c
2109
n = letoh32(ic->ipv4_ndnssrv);
sys/dev/usb/if_umb.c
2112
while (n-- > 0) {
sys/dev/usb/if_umb.c
2153
n = letoh32(ic->ipv6_naddr);
sys/dev/usb/if_umb.c
2156
if (n == 0 || off + sizeof (ipv6elem) > len)
sys/dev/usb/if_umb.c
2158
if (n != 1 && ifp->if_flags & IFF_DEBUG)
sys/dev/usb/if_umb.c
2160
DEVNAM(ifp->if_softc), n);
sys/dev/usb/if_umb.c
2177
n = letoh32(ic->ipv6_ndnssrv);
sys/dev/usb/if_umb.c
2180
while (n-- > 0) {
sys/dev/usb/if_umb.c
69
#define DPRINTFN(n, x...) \
sys/dev/usb/if_umb.c
70
do { if (umb_debug >= (n)) log(LOG_DEBUG, x); } while (0)
sys/dev/usb/if_umb.c
72
#define DDUMPN(n, b, l) \
sys/dev/usb/if_umb.c
74
if (umb_debug >= (n)) \
sys/dev/usb/if_umb.c
84
#define DPRINTFN(n, x...) do { } while (0)
sys/dev/usb/if_umb.c
85
#define DDUMPN(n, b, l) do { } while (0)
sys/dev/usb/if_upgt.c
735
int offset, bsize, n, i, len;
sys/dev/usb/if_upgt.c
769
n = upgt_fw_copy(sc->sc_fw + offset, data_cmd->buf, bsize);
sys/dev/usb/if_upgt.c
772
sc->sc_dev.dv_xname, offset, n, bsize);
sys/dev/usb/if_upgt.c
781
bsize = n;
sys/dev/usb/if_upl.c
135
#define DPRINTFN(n,x) do { if (upldebug >= (n)) printf x; } while (0)
sys/dev/usb/if_upl.c
139
#define DPRINTFN(n,x)
sys/dev/usb/if_ure.c
65
#define DPRINTFN(n,x) do { if (uredebug >= (n)) printf x; } while (0)
sys/dev/usb/if_ure.c
69
#define DPRINTFN(n,x)
sys/dev/usb/if_url.c
122
#define DPRINTFN(n,x) do { if (urldebug >= (n)) printf x; } while (0)
sys/dev/usb/if_url.c
126
#define DPRINTFN(n,x)
sys/dev/usb/if_urtw.c
52
#define DPRINTFN(n, x) do { if (urtw_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_urtw.c
56
#define DPRINTFN(n, x)
sys/dev/usb/if_urtwn.c
222
#define DPRINTFN(n, x) do { if (urtwn_debug >= (n)) printf x; } while (0)
sys/dev/usb/if_urtwn.c
226
#define DPRINTFN(n, x)
sys/dev/usb/if_wi_usb.c
101
#define DPRINTFN(n,x)
sys/dev/usb/if_wi_usb.c
97
#define DPRINTFN(n,x) do { if (wi_usbdebug >= (n)) printf x; } while (0)
sys/dev/usb/if_zyd.c
58
#define DPRINTFN(n, x) do { if (zyddebug > (n)) printf x; } while (0)
sys/dev/usb/if_zyd.c
62
#define DPRINTFN(n, x)
sys/dev/usb/ohci.c
1303
struct ohci_soft_td *p, *n;
sys/dev/usb/ohci.c
1311
for (p = std; p->xfer == xfer; p = n) {
sys/dev/usb/ohci.c
1312
n = p->nexttd;
sys/dev/usb/ohci.c
2091
struct ohci_soft_td *p, *n;
sys/dev/usb/ohci.c
2160
for (; p->xfer == xfer; p = n) {
sys/dev/usb/ohci.c
2162
n = p->nexttd;
sys/dev/usb/ohci.c
60
#define DPRINTFN(n,x) do { if (ohcidebug>(n)) printf x; } while (0)
sys/dev/usb/ohci.c
65
#define DPRINTFN(n,x)
sys/dev/usb/ohcireg.h
119
#define OHCI_RH_PORT_STATUS(n) (0x50 + (n)*4) /* 1 based indexing */
sys/dev/usb/uark.c
31
#define DPRINTFN(n, x) do { if (uarkdebug > (n)) printf x; } while (0)
sys/dev/usb/uark.c
34
#define DPRINTFN(n, x)
sys/dev/usb/uaudio.c
710
struct uaudio_name *n;
sys/dev/usb/uaudio.c
720
n = sc->names;
sys/dev/usb/uaudio.c
722
if (n == NULL) {
sys/dev/usb/uaudio.c
723
n = malloc(sizeof(struct uaudio_name),
sys/dev/usb/uaudio.c
725
n->templ = templ;
sys/dev/usb/uaudio.c
726
n->unit = 0;
sys/dev/usb/uaudio.c
727
n->next = sc->names;
sys/dev/usb/uaudio.c
728
sc->names = n;
sys/dev/usb/uaudio.c
730
if (strcmp(n->templ, templ) == 0)
sys/dev/usb/uaudio.c
732
n = n->next;
sys/dev/usb/uaudio.c
734
if (n->unit == 0)
sys/dev/usb/uaudio.c
737
snprintf(res, UAUDIO_NAMEMAX, "%s%s%u", templ, sep, n->unit);
sys/dev/usb/uaudio.c
738
n->unit++;
sys/dev/usb/uaudio.c
748
unsigned int bits, n;
sys/dev/usb/uaudio.c
752
n = 0;
sys/dev/usb/uaudio.c
757
n |= bits << (2 * i);
sys/dev/usb/uaudio.c
759
return n;
sys/dev/usb/ubsa.c
75
#define DPRINTFN(n, x) do { if (ubsadebug > (n)) printf x; } while (0)
sys/dev/usb/ubsa.c
77
#define DPRINTFN(n, x)
sys/dev/usb/uchcom.c
52
#define DPRINTFN(n, x) do { if (uchcomdebug > (n)) printf x; } while (0)
sys/dev/usb/uchcom.c
55
#define DPRINTFN(n, x)
sys/dev/usb/ucom.c
61
#define DPRINTFN(n, x) do { if (ucomdebug > (n)) printf x; } while (0)
sys/dev/usb/ucom.c
64
#define DPRINTFN(n, x)
sys/dev/usb/ucycom.c
458
int n, st, s;
sys/dev/usb/ucycom.c
467
n = cp[0] & UCYCOM_LMASK;
sys/dev/usb/ucycom.c
474
n = cp[1];
sys/dev/usb/ucycom.c
487
if (n != 0) {
sys/dev/usb/ucycom.c
488
DPRINTF(("ucycom_intr: ibuf[0..%d) =", n));
sys/dev/usb/ucycom.c
489
for (i = 0; i < n; i++)
sys/dev/usb/ucycom.c
496
if (n > 0 || st != sc->sc_msr) {
sys/dev/usb/ucycom.c
499
bcopy(cp, sc->sc_ibuf, n);
sys/dev/usb/ucycom.c
500
sc->sc_icnt = n;
sys/dev/usb/ucycom.c
58
#define DPRINTFN(n, x) if (ucycomdebug > (n)) printf x
sys/dev/usb/ucycom.c
62
#define DPRINTFN(n,x)
sys/dev/usb/udcf.c
31
#define DPRINTFN(n, x) do { if (udcfdebug > (n)) printf x; } while (0)
sys/dev/usb/udcf.c
34
#define DPRINTFN(n, x)
sys/dev/usb/udl.c
1308
int len, i, n;
sys/dev/usb/udl.c
1332
n = len / 2 - 1;
sys/dev/usb/udl.c
1333
for (i = 0; i < n && i < nitems(us.bString); i++) {
sys/dev/usb/udsbr.c
56
#define DPRINTFN(n,x) do { if (udsbrdebug>(n)) printf x; } while (0)
sys/dev/usb/udsbr.c
60
#define DPRINTFN(n,x)
sys/dev/usb/uftdi.c
1223
int n = (FTDI_2232H_FREQ << 3) / speed;
sys/dev/usb/uftdi.c
1224
int s = n & 7;
sys/dev/usb/uftdi.c
1225
int result = (n >> 3) | (sub[s] << 14);
sys/dev/usb/uftdi.c
58
#define DPRINTFN(n,x) do { if (uftdidebug>(n)) printf x; } while (0)
sys/dev/usb/uftdi.c
62
#define DPRINTFN(n,x)
sys/dev/usb/uftdireg.h
128
#define FTDI_SIO_SET_DATA_BITS(n) (n)
sys/dev/usb/ugen.c
119
#define UGENUNIT(n) ((minor(n) >> 4) & 0xf)
sys/dev/usb/ugen.c
120
#define UGENENDPOINT(n) (minor(n) & 0xf)
sys/dev/usb/ugen.c
486
size_t n;
sys/dev/usb/ugen.c
541
n = ulmin(sce->q.c_cc, uio->uio_resid);
sys/dev/usb/ugen.c
542
if (n > sizeof(buffer))
sys/dev/usb/ugen.c
543
n = sizeof(buffer);
sys/dev/usb/ugen.c
546
q_to_b(&sce->q, buffer, n);
sys/dev/usb/ugen.c
547
DPRINTFN(5, ("ugenread: got %zu chars\n", n));
sys/dev/usb/ugen.c
55
#define DPRINTFN(n,x) do { if (ugendebug>(n)) printf x; } while (0)
sys/dev/usb/ugen.c
550
error = uiomove(buffer, n, uio);
sys/dev/usb/ugen.c
564
while ((n = ulmin(UGEN_BBSIZE, uio->uio_resid)) != 0) {
sys/dev/usb/ugen.c
565
DPRINTFN(1, ("ugenread: start transfer %zu bytes\n",n));
sys/dev/usb/ugen.c
566
usbd_setup_xfer(xfer, sce->pipeh, 0, buf, n,
sys/dev/usb/ugen.c
582
if (error || tn < n)
sys/dev/usb/ugen.c
59
#define DPRINTFN(n,x)
sys/dev/usb/ugen.c
612
n = ulmin(sce->fill - sce->cur, uio->uio_resid);
sys/dev/usb/ugen.c
614
n = ulmin(sce->limit - sce->cur, uio->uio_resid);
sys/dev/usb/ugen.c
616
DPRINTFN(5, ("ugenread: isoc got %zu chars\n", n));
sys/dev/usb/ugen.c
619
error = uiomove(sce->cur, n, uio);
sys/dev/usb/ugen.c
622
sce->cur += n;
sys/dev/usb/ugen.c
656
size_t n;
sys/dev/usb/ugen.c
689
while ((n = ulmin(UGEN_BBSIZE, uio->uio_resid)) != 0) {
sys/dev/usb/ugen.c
690
error = uiomove(buf, n, uio);
sys/dev/usb/ugen.c
693
DPRINTFN(1, ("ugenwrite: transfer %zu bytes\n", n));
sys/dev/usb/ugen.c
694
usbd_setup_xfer(xfer, sce->pipeh, 0, buf, n,
sys/dev/usb/ugen.c
714
while ((n = ulmin(UGETW(sce->edesc->wMaxPacketSize),
sys/dev/usb/ugen.c
716
error = uiomove(buf, n, uio);
sys/dev/usb/ugen.c
719
DPRINTFN(1, ("ugenwrite: transfer %zu bytes\n", n));
sys/dev/usb/ugen.c
720
usbd_setup_xfer(xfer, sce->pipeh, 0, buf, n,
sys/dev/usb/ugen.c
848
u_int32_t count, n;
sys/dev/usb/ugen.c
874
n = min(actlen, sce->limit - sce->fill);
sys/dev/usb/ugen.c
875
memcpy(sce->fill, buf, n);
sys/dev/usb/ugen.c
877
buf += n;
sys/dev/usb/ugen.c
878
actlen -= n;
sys/dev/usb/ugen.c
879
sce->fill += n;
sys/dev/usb/uhci.c
1216
int i, n, nframes, len;
sys/dev/usb/uhci.c
1222
n = ux->curframe;
sys/dev/usb/uhci.c
1224
std = stds[n];
sys/dev/usb/uhci.c
1231
if (++n >= UHCI_VFRAMELIST_COUNT)
sys/dev/usb/uhci.c
1232
n = 0;
sys/dev/usb/uhci.c
1358
int n;
sys/dev/usb/uhci.c
1362
for (n = 0; n < UHCI_RESET_TIMEOUT &&
sys/dev/usb/uhci.c
1363
(UREAD2(sc, UHCI_CMD) & UHCI_CMD_HCRESET); n++)
sys/dev/usb/uhci.c
1365
if (n >= UHCI_RESET_TIMEOUT)
sys/dev/usb/uhci.c
1373
int s, n, running;
sys/dev/usb/uhci.c
1385
for(n = 0; n < 10; n++) {
sys/dev/usb/uhci.c
2242
int i, n, s, nframes, maxlen, len;
sys/dev/usb/uhci.c
2258
n = ux->curframe;
sys/dev/usb/uhci.c
2261
std = stds[n];
sys/dev/usb/uhci.c
2266
if (++n >= UHCI_VFRAMELIST_COUNT)
sys/dev/usb/uhci.c
2267
n = 0;
sys/dev/usb/uhci.c
64
#define DPRINTFN(n,x) if (uhcidebug>(n)) printf x
sys/dev/usb/uhci.c
70
#define DPRINTFN(n,x)
sys/dev/usb/uhcireg.h
153
#define UHCI_TD_SET_ERRCNT(n) ((n) << 27)
sys/dev/usb/uhid.c
61
#define DPRINTFN(n,x) do { if (uhiddebug>(n)) printf x; } while (0)
sys/dev/usb/uhid.c
65
#define DPRINTFN(n,x)
sys/dev/usb/uhidev.c
72
#define DPRINTFN(n,x) do { if (uhidevdebug>(n)) printf x; } while (0)
sys/dev/usb/uhidev.c
76
#define DPRINTFN(n,x)
sys/dev/usb/uhidpp.c
1308
int len, n;
sys/dev/usb/uhidpp.c
1333
n = uhidev_set_report(sc->sc_hdev.sc_parent, UHID_OUTPUT_REPORT,
sys/dev/usb/uhidpp.c
1337
if (len != n) {
sys/dev/usb/uipaq.c
59
#define DPRINTFN(n,x) if (uipaqdebug>(n)) printf x
sys/dev/usb/uipaq.c
63
#define DPRINTFN(n,x)
sys/dev/usb/ukbd.c
80
#define DPRINTFN(n,x) do { if (ukbddebug>(n)) printf x; } while (0)
sys/dev/usb/ukbd.c
84
#define DPRINTFN(n,x)
sys/dev/usb/ukbdmap.c
52
#define KC(n) KS_KEYCODE(n)
sys/dev/usb/ulpt.c
597
size_t n;
sys/dev/usb/ulpt.c
60
#define DPRINTFN(n,x) do { if (ulptdebug>(n)) printf x; } while (0)
sys/dev/usb/ulpt.c
612
while ((n = ulmin(ULPT_BSIZE, uio->uio_resid)) != 0) {
sys/dev/usb/ulpt.c
614
error = uiomove(bufp, n, uio);
sys/dev/usb/ulpt.c
617
DPRINTFN(1, ("ulptwrite: transfer %zu bytes\n", n));
sys/dev/usb/ulpt.c
618
usbd_setup_xfer(xfer, sc->sc_out_pipe, 0, bufp, n,
sys/dev/usb/ulpt.c
64
#define DPRINTFN(n,x)
sys/dev/usb/umbg.c
31
#define DPRINTFN(n, x) do { if (umbgdebug > (n)) printf x; } while (0)
sys/dev/usb/umbg.c
34
#define DPRINTFN(n, x)
sys/dev/usb/umct.c
55
#define DPRINTFN(n, x) do { if (umctdebug > (n)) printf x; } while (0)
sys/dev/usb/umct.c
58
#define DPRINTFN(n, x)
sys/dev/usb/umidi.c
50
#define DPRINTFN(n,x) if (umididebug >= (n)) printf x
sys/dev/usb/umidi.c
54
#define DPRINTFN(n,x)
sys/dev/usb/umidi_quirks.c
45
#define DPRINTFN(n,x) if (umidiquirkdebug >= (n)) printf x
sys/dev/usb/umidi_quirks.c
49
#define DPRINTFN(n,x)
sys/dev/usb/umodem.c
62
#define DPRINTFN(n, x) do { if (umodemdebug > (n)) printf x; } while (0)
sys/dev/usb/umodem.c
65
#define DPRINTFN(n, x)
sys/dev/usb/umsm.c
38
#define DPRINTFN(n, x) do { if (umsmdebug > (n)) printf x; } while (0)
sys/dev/usb/umsm.c
40
#define DPRINTFN(n, x)
sys/dev/usb/umsm.c
699
u_int32_t n;
sys/dev/usb/umsm.c
811
n = UMASS_BBB_CBW_SIZE;
sys/dev/usb/umsm.c
813
usbd_setup_xfer(xfer, cmdpipe, 0, bufp, n,
sys/dev/usb/uoaklux.c
38
#define DPRINTFN(n, x) do { if (uoakluxdebug > (n)) printf x; } while (0)
sys/dev/usb/uoaklux.c
40
#define DPRINTFN(n, x)
sys/dev/usb/uoakrh.c
38
#define DPRINTFN(n, x) do { if (uoakrhdebug > (n)) printf x; } while (0)
sys/dev/usb/uoakrh.c
40
#define DPRINTFN(n, x)
sys/dev/usb/uoakv.c
38
#define DPRINTFN(n, x) do { if (uoakvdebug > (n)) printf x; } while (0)
sys/dev/usb/uoakv.c
40
#define DPRINTFN(n, x)
sys/dev/usb/uplcom.c
55
#define DPRINTFN(n, x) do { if (uplcomdebug > (n)) printf x; } while (0)
sys/dev/usb/uplcom.c
58
#define DPRINTFN(n, x)
sys/dev/usb/usb.c
64
#define DPRINTFN(n,x) do { if (usbdebug>(n)) printf x; } while (0)
sys/dev/usb/usb.c
82
#define DPRINTFN(n,x)
sys/dev/usb/usb_mem.c
55
#define DPRINTFN(n,x) do { if (usbdebug>(n)) printf x; } while (0)
sys/dev/usb/usb_mem.c
59
#define DPRINTFN(n,x)
sys/dev/usb/usb_subr.c
156
int i, n;
sys/dev/usb/usb_subr.c
180
n = size / 2 - 1;
sys/dev/usb/usb_subr.c
181
for (i = 0; i < n && i < buflen ; i++) {
sys/dev/usb/usb_subr.c
350
int n;
sys/dev/usb/usb_subr.c
357
n = 10;
sys/dev/usb/usb_subr.c
369
} while ((UGETW(ps.wPortChange) & UPS_C_PORT_RESET) == 0 && --n > 0);
sys/dev/usb/usb_subr.c
370
if (n == 0)
sys/dev/usb/usb_subr.c
380
int n;
sys/dev/usb/usb_subr.c
385
n = 10;
sys/dev/usb/usb_subr.c
396
} while ((UGETW(ps.wPortChange) & UPS_C_PORT_RESET) == 0 && --n > 0);
sys/dev/usb/usb_subr.c
404
if (n == 0)
sys/dev/usb/usb_subr.c
53
#define DPRINTFN(n,x) do { if (usbdebug>(n)) printf x; } while (0)
sys/dev/usb/usb_subr.c
57
#define DPRINTFN(n,x)
sys/dev/usb/usbdi.c
49
#define DPRINTFN(n,x) do { if (usbdebug>(n)) printf x; } while (0)
sys/dev/usb/usbdi.c
53
#define DPRINTFN(n,x)
sys/dev/usb/usbdi.c
705
int n;
sys/dev/usb/usbdi.c
707
for (n = 0; p < end; p += d->bLength) {
sys/dev/usb/usbdi.c
712
n++;
sys/dev/usb/usbdi.c
714
return (n);
sys/dev/usb/usbdi_util.c
49
#define DPRINTFN(n,x) do { if (usbdebug>(n)) printf x; } while (0)
sys/dev/usb/usbdi_util.c
53
#define DPRINTFN(n,x)
sys/dev/usb/usbhid.h
64
#define USB_HID_DESCRIPTOR_SIZE(n) (9+(n)*3)
sys/dev/usb/uslcom.c
31
#define DPRINTFN(n, x) do { if (uslcomdebug > (n)) printf x; } while (0)
sys/dev/usb/uslcom.c
34
#define DPRINTFN(n, x)
sys/dev/usb/usps.c
33
#define DPRINTFN(n, x) do { if (uspsdebug > (n)) printf x; } while (0)
sys/dev/usb/usps.c
35
#define DPRINTFN(n, x)
sys/dev/usb/uticom.c
46
#define DPRINTFN(n, x) do { if (uticomdebug > (n)) printf x; } while (0)
sys/dev/usb/uticom.c
48
#define DPRINTFN(n, x)
sys/dev/usb/utvfu.c
619
int n, chunk, ncopied;
sys/dev/usb/utvfu.c
639
n = min(chunk, sc->sc_audio.blksize - ncopied);
sys/dev/usb/utvfu.c
640
memcpy(dst, src, n);
sys/dev/usb/utvfu.c
641
dst += n;
sys/dev/usb/utvfu.c
642
src += n;
sys/dev/usb/utvfu.c
643
chunk -= n;
sys/dev/usb/utvfu.c
644
ncopied += n;
sys/dev/usb/uvisor.c
52
#define DPRINTFN(n,x) if (uvisordebug>(n)) printf x
sys/dev/usb/uvisor.c
56
#define DPRINTFN(n,x)
sys/dev/usb/uvscom.c
53
#define DPRINTFN(n, x) do { if (uvscomdebug > (n)) printf x; } while (0)
sys/dev/usb/uvscom.c
55
#define DPRINTFN(n, x)
sys/dev/usb/uxrcom.c
32
#define DPRINTFN(n, x) do { if (uxrcomdebug > (n)) printf x; } while (0)
sys/dev/usb/uxrcom.c
35
#define DPRINTFN(n, x)
sys/dev/usb/xhci.c
45
#define DPRINTFN(n,x) do { if (xhcidebug>(n)) printf x; } while (0)
sys/dev/usb/xhci.c
49
#define DPRINTFN(n,x)
sys/dev/usb/xhcireg.h
138
#define XHCI_DNCTRL_MASK(n) (1 << (n))
sys/dev/usb/xhcireg.h
156
#define XHCI_PORTSC(n) (0x3f0 + (0x10 * (n))) /* XHCI port status */
sys/dev/usb/xhcireg.h
183
#define XHCI_PORTPMSC(n) (0x3f4 + (0x10 * (n))) /* XHCI status & ctrl */
sys/dev/usb/xhcireg.h
192
#define XHCI_PORTLI(n) (0x3f8 + (0x10 * (n))) /* XHCI port link info */
sys/dev/usb/xhcireg.h
193
#define XHCI_PORTRSV(n) (0x3fC + (0x10 * (n))) /* XHCI port reserved */
sys/dev/usb/xhcireg.h
201
#define XHCI_IMAN(n) (0x0020 + (0x20 * (n))) /* intr.management */
sys/dev/usb/xhcireg.h
206
#define XHCI_IMOD(n) (0x0024 + (0x20 * (n)))
sys/dev/usb/xhcireg.h
215
#define XHCI_ERSTSZ(n) (0x0028 + (0x20 * (n)))
sys/dev/usb/xhcireg.h
219
#define XHCI_ERSTBA_LO(n) (0x0030 + (0x20 * (n)))
sys/dev/usb/xhcireg.h
220
#define XHCI_ERSTBA_HI(n) (0x0034 + (0x20 * (n)))
sys/dev/usb/xhcireg.h
223
#define XHCI_ERDP_LO(n) (0x0038 + (0x20 * (n)))
sys/dev/usb/xhcireg.h
225
#define XHCI_ERDP_HI(n) (0x003c + (0x20 * (n)))
sys/dev/usb/xhcireg.h
231
#define XHCI_DOORBELL(n) (0x0000 + (4 * (n)))
sys/dev/usb/xhcireg.h
330
#define XHCI_INCTX_MASK_DCI(n) (0x1 << (n))
sys/dev/videomode/edid.c
101
for (n = 0; n < edid_nvendors; n++)
sys/dev/videomode/edid.c
102
if (memcmp(edid_vendors[n].vendor, vendor, 3) == 0)
sys/dev/videomode/edid.c
103
return edid_vendors[n].name;
sys/dev/videomode/edid.c
112
int n;
sys/dev/videomode/edid.c
114
for (n = 0; n < edid_nproducts; n++)
sys/dev/videomode/edid.c
115
if (edid_products[n].product == product &&
sys/dev/videomode/edid.c
116
memcmp(edid_products[n].vendor, vendor, 3) == 0)
sys/dev/videomode/edid.c
117
return edid_products[n].name;
sys/dev/videomode/edid.c
99
int n;
sys/dev/videomode/vesagtf.c
192
print_value(int n, const char *name, unsigned val)
sys/dev/videomode/vesagtf.c
194
printf("%2d: %-27s: %u\n", n, name, val);
sys/dev/videomode/vesagtf.c
197
#define print_value(n, name, val)
sys/dev/vmm/vmm.c
862
size_t i, failed_uao = 0, n;
sys/dev/vmm/vmm.c
875
n = vm->vm_nmemranges;
sys/dev/vmm/vmm.c
878
for (i = 0; i < n; i++) {
sys/dev/vmm/vmm.c
901
for (i = 0; i < n; i++) {
sys/dev/wscons/wsdisplay.c
1445
int s, n, done, unit;
sys/dev/wscons/wsdisplay.c
1482
n = ndqb(&tp->t_outq, 0);
sys/dev/wscons/wsdisplay.c
1494
(scr->scr_dconf->wsemulcookie, buf, n, 0);
sys/dev/wscons/wsdisplay.c
1496
done = n;
sys/dev/wscons/wsdisplay.c
1499
if (done == n) {
sys/dev/wscons/wsdisplay.c
1500
if ((n = ndqb(&tp->t_outq, 0)) > 0) {
sys/dev/wscons/wsdisplay.c
1505
(scr->scr_dconf->wsemulcookie, buf, n, 0);
sys/dev/wscons/wsdisplay.c
1507
done = n;
sys/dev/wscons/wsemul_dumb.c
133
int n;
sys/dev/wscons/wsemul_dumb.c
197
n = min(8 - (edp->ccol & 7),
sys/dev/wscons/wsemul_dumb.c
200
(edp->emulcookie, edp->crow, edp->ccol, n,
sys/dev/wscons/wsemul_dumb.c
204
edp->ccol += n;
sys/dev/wscons/wsemul_dumb.c
244
n = 1; /* number of lines to scroll */
sys/dev/wscons/wsemul_dumb.c
246
(edp->emulcookie, n, 0, edp->nrows - n));
sys/dev/wscons/wsemul_dumb.c
249
(edp->emulcookie, edp->nrows - n, n,
sys/dev/wscons/wsemul_dumb.c
257
edp->crow -= n - 1;
sys/dev/wscons/wsemul_sun.c
155
#define ARG(n,c) \
sys/dev/wscons/wsemul_sun.c
156
((n) >= edp->nargs ? 0 : edp->args[(n) + MAX(0, edp->nargs - (c))])
sys/dev/wscons/wsemul_sun.c
271
u_int n;
sys/dev/wscons/wsemul_sun.c
294
n = min(8 - (edp->ccol & 7), COLS_LEFT);
sys/dev/wscons/wsemul_sun.c
295
if (n != 0) {
sys/dev/wscons/wsemul_sun.c
297
(edp->emulcookie, edp->crow, edp->ccol, n,
sys/dev/wscons/wsemul_sun.c
301
edp->ccol += n;
sys/dev/wscons/wsemul_sun.c
405
u_int n, src, dst;
sys/dev/wscons/wsemul_sun.c
412
n = min(NORMALIZE(ARG(0,1)), COLS_LEFT + 1);
sys/dev/wscons/wsemul_sun.c
414
dst = edp->ccol + n;
sys/dev/wscons/wsemul_sun.c
423
(edp->emulcookie, edp->crow, src, n, edp->bkgdattr));
sys/dev/wscons/wsemul_sun.c
467
n = min(NORMALIZE(ARG(0,1)), ROWS_LEFT + 1);
sys/dev/wscons/wsemul_sun.c
469
dst = edp->crow + n;
sys/dev/wscons/wsemul_sun.c
477
(edp->emulcookie, src, n, edp->bkgdattr));
sys/dev/wscons/wsemul_sun.c
481
n = min(NORMALIZE(ARG(0,1)), ROWS_LEFT + 1);
sys/dev/wscons/wsemul_sun.c
482
src = edp->crow + n;
sys/dev/wscons/wsemul_sun.c
491
(edp->emulcookie, dst + edp->nrows - src, n,
sys/dev/wscons/wsemul_sun.c
496
n = min(NORMALIZE(ARG(0,1)), COLS_LEFT + 1);
sys/dev/wscons/wsemul_sun.c
497
src = edp->ccol + n;
sys/dev/wscons/wsemul_sun.c
507
(edp->emulcookie, edp->crow, edp->ncols - n, n,
sys/dev/wscons/wsemul_sun.c
516
for (n = 0; n < edp->nargs; n++) {
sys/dev/wscons/wsemul_sun.c
517
switch (ARG(n,edp->nargs)) {
sys/dev/wscons/wsemul_sun.c
520
if (n == edp->nargs - 1) {
sys/dev/wscons/wsemul_sun.c
547
fgcol = ARG(n,edp->nargs) - 30;
sys/dev/wscons/wsemul_sun.c
552
bgcol = ARG(n,edp->nargs) - 40;
sys/dev/wscons/wsemul_vt100.c
427
u_int n;
sys/dev/wscons/wsemul_vt100.c
457
for (n = edp->ccol + 1; n < NCOLS - 1; n++)
sys/dev/wscons/wsemul_vt100.c
458
if (edp->tabs[n])
sys/dev/wscons/wsemul_vt100.c
461
n = edp->ccol + min(8 - (edp->ccol & 7), COLS_LEFT);
sys/dev/wscons/wsemul_vt100.c
463
edp->ccol = n;
sys/dev/wscons/wsemul_vt100_subr.c
100
edp->scrreg_startrow + n, help));
sys/dev/wscons/wsemul_vt100_subr.c
105
(edp->emulcookie, edp->scrreg_startrow, n, edp->bkgdattr));
sys/dev/wscons/wsemul_vt100_subr.c
111
memmove(&edp->dblwid[edp->scrreg_startrow + n],
sys/dev/wscons/wsemul_vt100_subr.c
113
memset(&edp->dblwid[edp->scrreg_startrow], 0, n);
sys/dev/wscons/wsemul_vt100_subr.c
127
int n;
sys/dev/wscons/wsemul_vt100_subr.c
136
n = edp->nrows - edp->crow - 1;
sys/dev/wscons/wsemul_vt100_subr.c
137
if (n > 0) {
sys/dev/wscons/wsemul_vt100_subr.c
139
(edp->emulcookie, edp->crow + 1, n, edp->bkgdattr));
sys/dev/wscons/wsemul_vt100_subr.c
144
memset(&edp->dblwid[edp->crow + 1], 0, n);
sys/dev/wscons/wsemul_vt100_subr.c
230
int n, m, help, flags, fgcol, bgcol;
sys/dev/wscons/wsemul_vt100_subr.c
256
for (n = 0; n < edp->nargs; n++)
sys/dev/wscons/wsemul_vt100_subr.c
257
vt100_ansimode(edp, ARG(n), VTMODE_SET);
sys/dev/wscons/wsemul_vt100_subr.c
260
for (n = 0; n < edp->nargs; n++) {
sys/dev/wscons/wsemul_vt100_subr.c
261
rc = vt100_decmode(edp, ARG(n), VTMODE_SET);
sys/dev/wscons/wsemul_vt100_subr.c
267
for (n = 0; n < edp->nargs; n++)
sys/dev/wscons/wsemul_vt100_subr.c
268
vt100_ansimode(edp, ARG(n), VTMODE_RESET);
sys/dev/wscons/wsemul_vt100_subr.c
271
for (n = 0; n < edp->nargs; n++) {
sys/dev/wscons/wsemul_vt100_subr.c
272
rc = vt100_decmode(edp, ARG(n), VTMODE_RESET);
sys/dev/wscons/wsemul_vt100_subr.c
382
int i, n, ps = 0;
sys/dev/wscons/wsemul_vt100_subr.c
389
n = snprintf(buf, sizeof buf, "%s%d",
sys/dev/wscons/wsemul_vt100_subr.c
391
if (n == -1)
sys/dev/wscons/wsemul_vt100_subr.c
392
n = 0;
sys/dev/wscons/wsemul_vt100_subr.c
393
else if (n >= sizeof buf)
sys/dev/wscons/wsemul_vt100_subr.c
394
n = sizeof buf - 1;
sys/dev/wscons/wsemul_vt100_subr.c
396
buf, n);
sys/dev/wscons/wsemul_vt100_subr.c
448
n = min(DEF1_ARG(0), COLS_LEFT + 1);
sys/dev/wscons/wsemul_vt100_subr.c
449
help = NCOLS - (edp->ccol + n);
sys/dev/wscons/wsemul_vt100_subr.c
452
COPYCOLS(edp->ccol, edp->ccol + n, help));
sys/dev/wscons/wsemul_vt100_subr.c
457
ERASECOLS(edp->ccol, n, edp->bkgdattr));
sys/dev/wscons/wsemul_vt100_subr.c
460
n = ROWS_ABOVE;
sys/dev/wscons/wsemul_vt100_subr.c
461
if (n > 0)
sys/dev/wscons/wsemul_vt100_subr.c
462
edp->crow -= min(DEF1_ARG(0), n);
sys/dev/wscons/wsemul_vt100_subr.c
466
n = ROWS_BELOW;
sys/dev/wscons/wsemul_vt100_subr.c
467
if (n > 0)
sys/dev/wscons/wsemul_vt100_subr.c
468
edp->crow += min(DEF1_ARG(0), n);
sys/dev/wscons/wsemul_vt100_subr.c
499
n = min(DEF1_ARG(0), ROWS_BELOW + 1);
sys/dev/wscons/wsemul_vt100_subr.c
505
rc = wsemul_vt100_scrolldown(edp, n);
sys/dev/wscons/wsemul_vt100_subr.c
507
rc = wsemul_vt100_scrollup(edp, n);
sys/dev/wscons/wsemul_vt100_subr.c
51
wsemul_vt100_scrollup(struct wsemul_vt100_emuldata *edp, int n)
sys/dev/wscons/wsemul_vt100_subr.c
513
n = min(DEF1_ARG(0), COLS_LEFT + 1);
sys/dev/wscons/wsemul_vt100_subr.c
514
help = NCOLS - (edp->ccol + n);
sys/dev/wscons/wsemul_vt100_subr.c
517
COPYCOLS(edp->ccol + n, edp->ccol, help));
sys/dev/wscons/wsemul_vt100_subr.c
522
ERASECOLS(NCOLS - n, n, edp->bkgdattr));
sys/dev/wscons/wsemul_vt100_subr.c
531
n = min(DEF1_ARG(0), COLS_LEFT + 1);
sys/dev/wscons/wsemul_vt100_subr.c
533
ERASECOLS(edp->ccol, n, edp->bkgdattr));
sys/dev/wscons/wsemul_vt100_subr.c
540
for (n = edp->ccol - 1; n > 0; n--) {
sys/dev/wscons/wsemul_vt100_subr.c
541
if (edp->tabs[n])
sys/dev/wscons/wsemul_vt100_subr.c
545
n = (edp->ccol - 1) & ~7;
sys/dev/wscons/wsemul_vt100_subr.c
546
edp->ccol = n;
sys/dev/wscons/wsemul_vt100_subr.c
547
if (n == 0)
sys/dev/wscons/wsemul_vt100_subr.c
557
n = min(DEF1_ARG(0), 65535);
sys/dev/wscons/wsemul_vt100_subr.c
559
rc = wsemul_vt100_output_normal(edp, instate, kernel, n);
sys/dev/wscons/wsemul_vt100_subr.c
56
if (n > edp->scrreg_nrows)
sys/dev/wscons/wsemul_vt100_subr.c
57
n = edp->scrreg_nrows;
sys/dev/wscons/wsemul_vt100_subr.c
589
for (n = 0; n < edp->nargs; n++) {
sys/dev/wscons/wsemul_vt100_subr.c
59
help = edp->scrreg_nrows - n;
sys/dev/wscons/wsemul_vt100_subr.c
590
switch (ARG(n)) {
sys/dev/wscons/wsemul_vt100_subr.c
592
if (n == edp->nargs - 1) {
sys/dev/wscons/wsemul_vt100_subr.c
62
(edp->emulcookie, edp->scrreg_startrow + n,
sys/dev/wscons/wsemul_vt100_subr.c
631
fgcol = ARG(n) - 30;
sys/dev/wscons/wsemul_vt100_subr.c
643
bgcol = ARG(n) - 40;
sys/dev/wscons/wsemul_vt100_subr.c
655
fgcol = ARG(n) - 82;
sys/dev/wscons/wsemul_vt100_subr.c
661
bgcol = ARG(n) - 92;
sys/dev/wscons/wsemul_vt100_subr.c
665
printf("CSI%dm unknown\n", ARG(n));
sys/dev/wscons/wsemul_vt100_subr.c
68
(edp->emulcookie, edp->scrreg_startrow + help, n, edp->bkgdattr));
sys/dev/wscons/wsemul_vt100_subr.c
700
n = snprintf(buf, sizeof buf, "\033[%d;%dR",
sys/dev/wscons/wsemul_vt100_subr.c
702
if (n == -1)
sys/dev/wscons/wsemul_vt100_subr.c
703
n = 0;
sys/dev/wscons/wsemul_vt100_subr.c
704
else if (n >= sizeof buf)
sys/dev/wscons/wsemul_vt100_subr.c
705
n = sizeof buf - 1;
sys/dev/wscons/wsemul_vt100_subr.c
706
wsdisplay_emulinput(edp->cbcookie, buf, n);
sys/dev/wscons/wsemul_vt100_subr.c
730
n = min(DEFx_ARG(1, edp->nrows), edp->nrows) - help;
sys/dev/wscons/wsemul_vt100_subr.c
731
if (n < 2) {
sys/dev/wscons/wsemul_vt100_subr.c
736
edp->scrreg_nrows = n;
sys/dev/wscons/wsemul_vt100_subr.c
75
&edp->dblwid[edp->scrreg_startrow + n], help);
sys/dev/wscons/wsemul_vt100_subr.c
76
memset(&edp->dblwid[edp->scrreg_startrow + help], 0, n);
sys/dev/wscons/wsemul_vt100_subr.c
88
wsemul_vt100_scrolldown(struct wsemul_vt100_emuldata *edp, int n)
sys/dev/wscons/wsemul_vt100_subr.c
93
if (n > edp->scrreg_nrows)
sys/dev/wscons/wsemul_vt100_subr.c
94
n = edp->scrreg_nrows;
sys/dev/wscons/wsemul_vt100_subr.c
96
help = edp->scrreg_nrows - n;
sys/dev/wscons/wsemul_vt100var.h
105
#define ARG(n) (edp->args[(n)])
sys/dev/wscons/wsemul_vt100var.h
106
#define DEF1_ARG(n) (ARG(n) ? ARG(n) : 1)
sys/dev/wscons/wsemul_vt100var.h
107
#define DEFx_ARG(n, x) (ARG(n) ? ARG(n) : (x))
sys/dev/wscons/wsemul_vt100var.h
122
#define COPYCOLS(f, t, n) (edp->emulcookie, edp->crow, (f) << edp->dw, \
sys/dev/wscons/wsemul_vt100var.h
123
(t) << edp->dw, (n) << edp->dw)
sys/dev/wscons/wsemul_vt100var.h
124
#define ERASECOLS(f, n, a) (edp->emulcookie, edp->crow, (f) << edp->dw, \
sys/dev/wscons/wsemul_vt100var.h
125
(n) << edp->dw, (a))
sys/dev/wscons/wsemul_vt100var.h
129
#define COPYCOLS(f, t, n) (edp->emulcookie, edp->crow, (f), (t), (n))
sys/dev/wscons/wsemul_vt100var.h
130
#define ERASECOLS(f, n, a) (edp->emulcookie, edp->crow, (f), (n), (a))
sys/dev/wscons/wsevent.c
159
size_t n;
sys/dev/wscons/wsevent.c
166
n = howmany(uio->uio_resid, sizeof(struct wscons_event));
sys/dev/wscons/wsevent.c
192
if (cnt > n)
sys/dev/wscons/wsevent.c
193
cnt = n;
sys/dev/wscons/wsevent.c
197
n -= cnt;
sys/dev/wscons/wsevent.c
200
if (!(ev->ws_get != 0 || n == 0 || tcnt == 0)) {
sys/dev/wscons/wsevent.c
203
if (tcnt > n)
sys/dev/wscons/wsevent.c
204
tcnt = n;
sys/dev/wscons/wsmouse.c
1106
int n;
sys/dev/wscons/wsmouse.c
1109
n = evq->evar->ws_put;
sys/dev/wscons/wsmouse.c
1112
if (n != evq->put) {
sys/dev/wscons/wsmouse.c
1114
while (n != evq->put) {
sys/dev/wscons/wsmouse.c
1115
ev = &evq->evar->ws_q[n++];
sys/dev/wscons/wsmouse.c
1116
n %= WSEVENT_QSIZE;
sys/dev/wscons/wsmouse.c
1252
wsmouse_matching(int *matrix, int m, int n, int *buffer)
sys/dev/wscons/wsmouse.c
1260
int *c2r = cs + n; /* column-to-row assignments in cs */
sys/dev/wscons/wsmouse.c
1261
int *cd = c2r + n; /* column deltas (reduction) */
sys/dev/wscons/wsmouse.c
1265
for (col = 0; col < n; col++) {
sys/dev/wscons/wsmouse.c
1268
for (i = 0, p = matrix + col; i < m; i++, p += n) {
sys/dev/wscons/wsmouse.c
1284
mc[row] -= n;
sys/dev/wscons/wsmouse.c
1286
for (i = 0, p = matrix; i < m; i++, p += n)
sys/dev/wscons/wsmouse.c
1309
j = mc[row] + n;
sys/dev/wscons/wsmouse.c
1329
int i, j, m, n, dx, dy, slot, maxdist;
sys/dev/wscons/wsmouse.c
1347
n = size;
sys/dev/wscons/wsmouse.c
1356
n = mt->num_touches;
sys/dev/wscons/wsmouse.c
1358
wsmouse_matching(mt->matrix, m, n, p);
sys/dev/wscons/wsmouse.c
1364
for (i = 0, p = mt->matrix; i < m; i++, p += n)
sys/dev/wscons/wsmouse.c
1372
p = (n == size ? c2r : r2c);
sys/dev/wscons/wsmouse.c
1383
p = (n == size ? r2c : c2r);
sys/dev/wscons/wsmouse.c
1397
int n, size;
sys/dev/wscons/wsmouse.c
1399
if ((n = input->mt.num_slots)) {
sys/dev/wscons/wsmouse.c
1400
size = n * sizeof(struct mt_slot);
sys/dev/wscons/wsmouse.c
1402
size += MATRIX_SIZE(n);
sys/dev/wscons/wsmouse.c
1415
int n, size;
sys/dev/wscons/wsmouse.c
1427
n = imin(imax(num_slots, 0), WSMOUSE_MT_SLOTS_MAX);
sys/dev/wscons/wsmouse.c
1428
if (n) {
sys/dev/wscons/wsmouse.c
1429
size = n * sizeof(struct mt_slot);
sys/dev/wscons/wsmouse.c
1431
size += MATRIX_SIZE(n);
sys/dev/wscons/wsmouse.c
1436
(input->mt.slots + n);
sys/dev/wscons/wsmouse.c
1437
input->mt.num_slots = n;
sys/dev/wscons/wsmux.c
130
wsmuxattach(int n)
sys/dev/wscons/wsmux.c
140
wsmux_getmux(int n)
sys/dev/wscons/wsmux.c
146
if (n < 0 || n >= WSMUX_MAXDEV)
sys/dev/wscons/wsmux.c
150
if (n >= nwsmux) {
sys/dev/wscons/wsmux.c
152
new = mallocarray(n + 1, sizeof (*wsmuxdevs),
sys/dev/wscons/wsmux.c
155
printf("wsmux_getmux: no memory for mux %d\n", n);
sys/dev/wscons/wsmux.c
160
for (i = nwsmux; i < (n + 1); i++)
sys/dev/wscons/wsmux.c
165
nwsmux = n + 1;
sys/dev/wscons/wsmux.c
168
sc = wsmuxdevs[n];
sys/dev/wscons/wsmux.c
170
sc = wsmux_create("wsmux", n);
sys/dev/wscons/wsmux.c
173
wsmuxdevs[n] = sc;
sys/dev/wscons/wsmux.c
388
int put, get, n;
sys/dev/wscons/wsmux.c
475
n = 0;
sys/dev/wscons/wsmux.c
478
if (n >= WSMUX_MAXDEV)
sys/dev/wscons/wsmux.c
480
l->devices[n].type = me->me_ops->type;
sys/dev/wscons/wsmux.c
481
l->devices[n].idx = me->me_dv.dv_unit;
sys/dev/wscons/wsmux.c
482
n++;
sys/dev/wscons/wsmux.c
485
l->ndevices = n;
sys/dev/wscons/wsmux.c
68
#define DPRINTFN(n,x) if (wsmuxdebug > (n)) printf x
sys/dev/wscons/wsmux.c
72
#define DPRINTFN(n,x)
sys/dev/wscons/wstpad.c
1025
printf("[wstpad] invalid cmd %d\n", n);
sys/dev/wscons/wstpad.c
1382
int mag, n, h, v;
sys/dev/wscons/wstpad.c
1391
n = imax((mag >> 12) - 4, 2);
sys/dev/wscons/wstpad.c
1392
if (n < 8) {
sys/dev/wscons/wstpad.c
1394
h = *dx * n + input->filter.h.dclr_rmdr;
sys/dev/wscons/wstpad.c
1395
v = *dy * n + input->filter.v.dclr_rmdr;
sys/dev/wscons/wstpad.c
1523
isqrt(u_int n)
sys/dev/wscons/wstpad.c
1530
if (n >= (sqbit | root)) {
sys/dev/wscons/wstpad.c
1531
n -= (sqbit | root);
sys/dev/wscons/wstpad.c
1544
int n, dclr;
sys/dev/wscons/wstpad.c
1558
n = 8;
sys/dev/wscons/wstpad.c
1560
n = 8 * 13000000 / input->intv.avg;
sys/dev/wscons/wstpad.c
1561
n = imax(imin(n, 32), 4);
sys/dev/wscons/wstpad.c
1563
input->filter.h.mag_scale = (n << 12) / dclr;
sys/dev/wscons/wstpad.c
1565
n * input->filter.ratio : n << 12) / dclr;
sys/dev/wscons/wstpad.c
36
#define BTNMASK(n) ((n) > 0 && (n) <= 32 ? 1 << ((n) - 1) : 0)
sys/dev/wscons/wstpad.c
472
int dz, dw, n = 1;
sys/dev/wscons/wstpad.c
482
n = (MAG_LOW - mag) / 4096 + 1;
sys/dev/wscons/wstpad.c
493
dz = -dy * 4096 / (tp->scroll.vdist * n);
sys/dev/wscons/wstpad.c
509
dw = dx * 4096 / (tp->scroll.hdist * n);
sys/dev/wscons/wstpad.c
755
int n = tp->tap.contacts - tp->contacts - 1;
sys/dev/wscons/wstpad.c
759
return (n >= 0 && n < TAP_BTNMAP_SIZE ? tp->tap.btnmap[n] : 0);
sys/dev/wscons/wstpad.c
975
int n;
sys/dev/wscons/wstpad.c
977
FOREACHBIT(cmds, n) {
sys/dev/wscons/wstpad.c
978
switch (n) {
sys/dev/wsfont/wsfont.c
297
int b, n, r;
sys/dev/wsfont/wsfont.c
300
for (n = 0; n < font->numchars; n++) {
sys/dev/wsfont/wsfont.c
301
char *ch = font->data + (n * font->stride * font->fontheight);
sys/dev/wsfont/wsfont.c
312
+ (n * newstride * font->fontwidth)
sys/dev/wsfont/wsfont.c
324
int b, n, r;
sys/dev/wsfont/wsfont.c
327
for (n = 0; n < font->numchars; n++) {
sys/dev/wsfont/wsfont.c
328
char *ch = font->data + (n * font->stride * font->fontheight);
sys/dev/wsfont/wsfont.c
340
+ (n * newstride * font->fontwidth)
sys/isofs/cd9660/cd9660_vnops.c
228
size_t n;
sys/isofs/cd9660/cd9660_vnops.c
241
n = ulmin(imp->logical_block_size - on, uio->uio_resid);
sys/isofs/cd9660/cd9660_vnops.c
245
if (diff < n)
sys/isofs/cd9660/cd9660_vnops.c
246
n = diff;
sys/isofs/cd9660/cd9660_vnops.c
270
n = ulmin(n, size - bp->b_resid);
sys/isofs/cd9660/cd9660_vnops.c
276
error = uiomove(bp->b_data + on, n, uio);
sys/isofs/cd9660/cd9660_vnops.c
279
} while (error == 0 && uio->uio_resid > 0 && n != 0);
sys/kern/kern_event.c
1241
int i, n, nerrors, error;
sys/kern/kern_event.c
1271
while ((n = SCARG(uap, nchanges)) > 0) {
sys/kern/kern_event.c
1272
if (n > nitems(kev))
sys/kern/kern_event.c
1273
n = nitems(kev);
sys/kern/kern_event.c
1275
n * sizeof(struct kevent));
sys/kern/kern_event.c
1280
ktrevent(p, kev, n);
sys/kern/kern_event.c
1282
for (i = 0; i < n; i++) {
sys/kern/kern_event.c
1300
SCARG(uap, nchanges) -= n;
sys/kern/kern_event.c
1301
SCARG(uap, changelist) += n;
sys/kern/kern_event.c
1317
while ((n = SCARG(uap, nevents) - total) > 0) {
sys/kern/kern_event.c
1318
if (n > nitems(kev))
sys/kern/kern_event.c
1319
n = nitems(kev);
sys/kern/kern_event.c
1320
ready = kqueue_scan(&scan, n, kev, tsp, p, &error);
sys/kern/kern_event.c
1330
if (error || ready < n)
sys/kern/kern_resource.c
196
donice(struct proc *curp, struct process *chgpr, int n)
sys/kern/kern_resource.c
205
if (n > PRIO_MAX)
sys/kern/kern_resource.c
206
n = PRIO_MAX;
sys/kern/kern_resource.c
207
if (n < PRIO_MIN)
sys/kern/kern_resource.c
208
n = PRIO_MIN;
sys/kern/kern_resource.c
209
n += NZERO;
sys/kern/kern_resource.c
210
if (n < chgpr->ps_nice && suser(curp))
sys/kern/kern_resource.c
212
chgpr->ps_nice = n;
sys/kern/kern_resource.c
216
setpriority(p, p->p_estcpu, n);
sys/kern/kern_rwlock.c
45
#define rw_cas(p, e, n) atomic_cas_ulong(p, e, n)
sys/kern/kern_rwlock.c
50
rw_cas(volatile unsigned long *p, unsigned long e, unsigned long n)
sys/kern/kern_rwlock.c
55
*p = n;
sys/kern/kern_sched.c
822
int cardinality, i, n;
sys/kern/kern_sched.c
827
for (n = cs->cs_set[i]; n != 0; n &= n - 1)
sys/kern/kern_subr.c
109
uiomove(void *cp, size_t n, struct uio *uio)
sys/kern/kern_subr.c
122
if (n > uio->uio_resid)
sys/kern/kern_subr.c
123
n = uio->uio_resid;
sys/kern/kern_subr.c
125
while (n > 0) {
sys/kern/kern_subr.c
134
if (cnt > n)
sys/kern/kern_subr.c
135
cnt = n;
sys/kern/kern_subr.c
161
n -= cnt;
sys/kern/kern_synch.c
573
wakeup_n(const volatile void *ident, int n)
sys/kern/kern_synch.c
583
for (p = TAILQ_FIRST(qp); p != NULL && n != 0; p = pnext) {
sys/kern/kern_synch.c
595
--n;
sys/kern/kern_synch.c
848
syscallarg(int) n;
sys/kern/kern_synch.c
853
int n = SCARG(uap, n);
sys/kern/kern_synch.c
887
if (++found == n)
sys/kern/kern_sysctl.c
658
int i, n = 0;
sys/kern/kern_sysctl.c
668
n++;
sys/kern/kern_sysctl.c
675
cp_time[i] /= n;
sys/kern/kern_unveil.c
143
struct unvname n, *ret = NULL;
sys/kern/kern_unveil.c
152
n.un_name = name;
sys/kern/kern_unveil.c
153
n.un_namesize = strlen(name) + 1;
sys/kern/kern_unveil.c
155
ret = RBT_FIND(unvname_rbt, &uv->uv_names, &n);
sys/kern/spec_vnops.c
197
size_t n;
sys/kern/spec_vnops.c
239
n = ulmin((bsize - on), uio->uio_resid);
sys/kern/spec_vnops.c
247
n = ulmin(n, bsize - bp->b_resid);
sys/kern/spec_vnops.c
252
error = uiomove((char *)bp->b_data + on, n, uio);
sys/kern/spec_vnops.c
254
} while (error == 0 && uio->uio_resid > 0 && n != 0);
sys/kern/spec_vnops.c
286
size_t n;
sys/kern/spec_vnops.c
328
n = ulmin((bsize - on), uio->uio_resid);
sys/kern/spec_vnops.c
330
n = ulmin(n, bsize - bp->b_resid);
sys/kern/spec_vnops.c
335
error = uiomove((char *)bp->b_data + on, n, uio);
sys/kern/spec_vnops.c
336
if (n + on == bsize)
sys/kern/spec_vnops.c
340
} while (error == 0 && uio->uio_resid > 0 && n != 0);
sys/kern/subr_blist.c
123
#define mallocarray(n,s,t,f) reallocarray(NULL, n, s)
sys/kern/subr_blist.c
575
int n = (int)(BLIST_BMAP_RADIX - count);
sys/kern/subr_blist.c
578
mask = (u_swblk_t)-1 >> n;
sys/kern/subr_blist.c
580
for (j = 0; j <= n; ++j) {
sys/kern/subr_blist.c
718
int n = blk & (BLIST_BMAP_RADIX - 1);
sys/kern/subr_blist.c
721
mask = ((u_swblk_t)-1 << n) &
sys/kern/subr_blist.c
722
((u_swblk_t)-1 >> (BLIST_BMAP_RADIX - count - n));
sys/kern/subr_blist.c
859
int n = blk & (BLIST_BMAP_RADIX - 1);
sys/kern/subr_blist.c
863
mask = ((u_swblk_t)-1 << n) &
sys/kern/subr_blist.c
864
((u_swblk_t)-1 >> (BLIST_BMAP_RADIX - count - n));
sys/kern/subr_disk.c
591
unsigned int i, n;
sys/kern/subr_disk.c
625
n = 'i' - 'a'; /* Start spoofing at 'i', a.k.a. 8. */
sys/kern/subr_disk.c
669
if (n < MAXPARTITIONS && end <= lbaend) {
sys/kern/subr_disk.c
670
pp = &lp->d_partitions[n];
sys/kern/subr_disk.c
671
n++;
sys/kern/subr_disk.c
732
unsigned int i, n, parts;
sys/kern/subr_disk.c
747
n = 'i' - 'a';
sys/kern/subr_disk.c
816
if (n < MAXPARTITIONS) {
sys/kern/subr_disk.c
817
pp = &lp->d_partitions[n++];
sys/kern/subr_hibernate.c
96
#define DNPRINTF(n,x...) do { if (hib_debug > (n)) printf(x); } while (0)
sys/kern/subr_hibernate.c
99
#define DNPRINTF(n,x...)
sys/kern/subr_percpu.c
127
counters_alloc(unsigned int n)
sys/kern/subr_percpu.c
134
KASSERT(n > 0);
sys/kern/subr_percpu.c
136
n++; /* add space for a generation number */
sys/kern/subr_percpu.c
137
cm = cpumem_malloc(n * sizeof(uint64_t), M_COUNTERS);
sys/kern/subr_percpu.c
140
for (i = 0; i < n; i++)
sys/kern/subr_percpu.c
148
counters_alloc_ncpus(struct cpumem *cm, unsigned int n)
sys/kern/subr_percpu.c
150
n++; /* the generation number */
sys/kern/subr_percpu.c
151
return (cpumem_malloc_ncpus(cm, n * sizeof(uint64_t), M_COUNTERS));
sys/kern/subr_percpu.c
155
counters_free(struct cpumem *cm, unsigned int n)
sys/kern/subr_percpu.c
157
n++; /* generation number */
sys/kern/subr_percpu.c
158
cpumem_free(cm, M_COUNTERS, n * sizeof(uint64_t));
sys/kern/subr_percpu.c
162
counters_read(struct cpumem *cm, uint64_t *output, unsigned int n,
sys/kern/subr_percpu.c
170
for (i = 0; i < n; i++)
sys/kern/subr_percpu.c
174
temp = mallocarray(n, sizeof(uint64_t), M_TEMP, M_WAITOK);
sys/kern/subr_percpu.c
189
for (i = 0; i < n; i++)
sys/kern/subr_percpu.c
201
for (i = 0; i < n; i++)
sys/kern/subr_percpu.c
208
free(temp, M_TEMP, n * sizeof(uint64_t));
sys/kern/subr_percpu.c
212
counters_zero(struct cpumem *cm, unsigned int n)
sys/kern/subr_percpu.c
221
for (i = 0; i < n; i++)
sys/kern/subr_percpu.c
290
counters_alloc(unsigned int n)
sys/kern/subr_percpu.c
292
KASSERT(n > 0);
sys/kern/subr_percpu.c
294
return (cpumem_malloc(n * sizeof(uint64_t), M_COUNTERS));
sys/kern/subr_percpu.c
298
counters_alloc_ncpus(struct cpumem *cm, unsigned int n)
sys/kern/subr_percpu.c
301
return (cpumem_malloc_ncpus(cm, n * sizeof(uint64_t), M_COUNTERS));
sys/kern/subr_percpu.c
305
counters_free(struct cpumem *cm, unsigned int n)
sys/kern/subr_percpu.c
307
cpumem_free(cm, M_COUNTERS, n * sizeof(uint64_t));
sys/kern/subr_percpu.c
311
counters_read(struct cpumem *cm, uint64_t *output, unsigned int n,
sys/kern/subr_percpu.c
321
for (i = 0; i < n; i++)
sys/kern/subr_percpu.c
327
counters_zero(struct cpumem *cm, unsigned int n)
sys/kern/subr_percpu.c
336
for (i = 0; i < n; i++)
sys/kern/subr_pool.c
1070
pool_setlowat(struct pool *pp, int n)
sys/kern/subr_pool.c
1075
pp->pr_minitems = n;
sys/kern/subr_pool.c
1076
pp->pr_minpages = (n == 0)
sys/kern/subr_pool.c
1078
: roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
sys/kern/subr_pool.c
1080
if (pp->pr_nitems < n)
sys/kern/subr_pool.c
1081
prime = n - pp->pr_nitems;
sys/kern/subr_pool.c
1089
pool_sethiwat(struct pool *pp, int n)
sys/kern/subr_pool.c
1091
pp->pr_maxpages = (n == 0)
sys/kern/subr_pool.c
1093
: roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
sys/kern/subr_pool.c
1097
pool_sethardlimit(struct pool *pp, u_int n)
sys/kern/subr_pool.c
1103
if (n < pp->pr_nout) {
sys/kern/subr_pool.c
1108
pp->pr_hardlimit = n;
sys/kern/subr_pool.c
1339
int n;
sys/kern/subr_pool.c
1351
for (pi = XSIMPLEQ_FIRST(&ph->ph_items), n = 0;
sys/kern/subr_pool.c
1353
pi = XSIMPLEQ_NEXT(&ph->ph_items, pi, pi_list), n++) {
sys/kern/subr_pool.c
1359
pp->pr_wchan, ph->ph_page, n, pi);
sys/kern/subr_pool.c
1368
pp, pp->pr_wchan, ph->ph_page, n, pi, page,
sys/kern/subr_pool.c
1382
pp->pr_wchan, ph->ph_page, n, pi,
sys/kern/subr_pool.c
1388
if (n + ph->ph_nmissing != pp->pr_itemsperpage) {
sys/kern/subr_pool.c
1391
pp->pr_wchan, ph->ph_page, n, ph->ph_nmissing,
sys/kern/subr_pool.c
1395
if (expected >= 0 && n != expected) {
sys/kern/subr_pool.c
1398
pp->pr_wchan, ph->ph_page, n, ph->ph_nmissing,
sys/kern/subr_pool.c
1432
int n;
sys/kern/subr_pool.c
1436
n = ph->ph_nmissing;
sys/kern/subr_pool.c
1438
while (n--) {
sys/kern/subr_pool.c
1446
n = ph->ph_nmissing;
sys/kern/subr_pool.c
1455
n--;
sys/kern/subr_pool.c
1459
} while (n > 0);
sys/kern/subr_pool.c
889
pool_prime(struct pool *pp, int n)
sys/kern/subr_pool.c
895
newpages = roundup(n, pp->pr_itemsperpage) / pp->pr_itemsperpage;
sys/kern/subr_pool.c
925
int n;
sys/kern/subr_pool.c
958
n = pp->pr_itemsperpage;
sys/kern/subr_pool.c
960
while (n--) {
sys/kern/subr_prf.c
1038
n = width - realsz;
sys/kern/subr_prf.c
1039
while (n-- > 0)
sys/kern/subr_prf.c
1053
n = width - realsz;
sys/kern/subr_prf.c
1054
while (n-- > 0)
sys/kern/subr_prf.c
1059
n = dprec - size;
sys/kern/subr_prf.c
1060
while (n-- > 0)
sys/kern/subr_prf.c
1068
n = width - realsz;
sys/kern/subr_prf.c
1069
while (n-- > 0)
sys/kern/subr_prf.c
641
#define to_char(n) ((n) + '0')
sys/kern/subr_prf.c
693
int n; /* handy integer (short term usage) */
sys/kern/subr_prf.c
762
while ((n = *b++) != 0) {
sys/kern/subr_prf.c
763
if (n & 0x80)
sys/kern/subr_prf.c
764
n &= 0x7f;
sys/kern/subr_prf.c
765
else if (n <= ' ')
sys/kern/subr_prf.c
766
n = n - 1;
sys/kern/subr_prf.c
767
if (_uquad & (1LL << n)) {
sys/kern/subr_prf.c
819
n = va_arg(ap, int);
sys/kern/subr_prf.c
820
prec = n < 0 ? -1 : n;
sys/kern/subr_prf.c
823
n = 0;
sys/kern/subr_prf.c
825
n = 10 * n + to_digit(ch);
sys/kern/subr_prf.c
828
prec = n < 0 ? -1 : n;
sys/kern/subr_prf.c
840
n = 0;
sys/kern/subr_prf.c
842
n = 10 * n + to_digit(ch);
sys/kern/subr_prf.c
845
width = n;
sys/kern/subr_witness.c
1392
int i, n, s;
sys/kern/subr_witness.c
1398
for (n = 0; lle != NULL; lle = lle->ll_next)
sys/kern/subr_witness.c
1400
if (n == 0)
sys/kern/subr_witness.c
1404
n++;
sys/kern/subr_witness.c
1430
int i, n;
sys/kern/subr_witness.c
1434
n = 0;
sys/kern/subr_witness.c
1447
if (n == 0) {
sys/kern/subr_witness.c
1456
n++;
sys/kern/subr_witness.c
1470
lock1->li_lock == lock && n == 0)
sys/kern/subr_witness.c
1479
n += witness_list_locks(&lock_list, printf);
sys/kern/subr_witness.c
1481
if (n > 0) {
sys/kern/subr_witness.c
1487
return (n);
sys/kern/sys_futex.c
359
futex_requeue(struct proc *p, uint32_t *uaddr, uint32_t n,
sys/kern/sys_futex.c
369
return futex_wake(p, uaddr, n, flags, retval);
sys/kern/sys_futex.c
395
if (++count == n) {
sys/kern/sys_futex.c
448
futex_wake(struct proc *p, uint32_t *uaddr, uint32_t n, int flags,
sys/kern/sys_futex.c
457
if (n == 0) {
sys/kern/sys_futex.c
477
if (++count == n)
sys/kern/tty_endrun.c
251
int fldcnt = 0, n;
sys/kern/tty_endrun.c
257
for (cs = NULL, n = 0; n < np->pos && cs == NULL; n++) {
sys/kern/tty_endrun.c
258
switch (np->cbuf[n]) {
sys/kern/tty_endrun.c
260
np->cbuf[n] = '\0';
sys/kern/tty_endrun.c
261
cs = &np->cbuf[n + 1];
sys/kern/tty_endrun.c
265
np->cbuf[n] = '\0';
sys/kern/tty_endrun.c
266
fld[fldcnt++] = &np->cbuf[n + 1];
sys/kern/tty_endrun.c
382
int n;
sys/kern/tty_endrun.c
386
for (n = 0, p = s; n < len && *p && *p >= '0' && *p <= '9'; n++, p++)
sys/kern/tty_endrun.c
388
if (n != len || *p != '\0')
sys/kern/tty_endrun.c
391
for (n = 0; *s; s++)
sys/kern/tty_endrun.c
392
n = n * 10 + *s - '0';
sys/kern/tty_endrun.c
394
return n;
sys/kern/tty_endrun.c
408
int n, i;
sys/kern/tty_endrun.c
421
if ((n = endrun_atoi(y, 4)) == -1)
sys/kern/tty_endrun.c
423
clock.dt_year = n;
sys/kern/tty_endrun.c
425
if (LEAPYEAR(n)) {
sys/kern/tty_endrun.c
430
if ((n = endrun_atoi(doy, 3)) == -1 || n == 0 || n > year_days)
sys/kern/tty_endrun.c
434
for (i = 1; n > month_days[i]; i++) {
sys/kern/tty_endrun.c
435
n -= month_days[i];
sys/kern/tty_endrun.c
438
clock.dt_day = n;
sys/kern/tty_endrun.c
440
DPRINTFN(1, ("mm/dd %d/%d\n", i, n));
sys/kern/tty_endrun.c
459
int n;
sys/kern/tty_endrun.c
467
if ((n = endrun_atoi(&s[0], 2)) == -1 || n > 23)
sys/kern/tty_endrun.c
469
clock.dt_hour = n;
sys/kern/tty_endrun.c
470
if ((n = endrun_atoi(&s[3], 2)) == -1 || n > 59)
sys/kern/tty_endrun.c
472
clock.dt_min = n;
sys/kern/tty_endrun.c
473
if ((n = endrun_atoi(&s[6], 2)) == -1 || n > 60)
sys/kern/tty_endrun.c
475
clock.dt_sec = n;
sys/kern/tty_endrun.c
494
int n;
sys/kern/tty_endrun.c
499
if ((n = endrun_atoi(&s[1], 2)) == -1)
sys/kern/tty_endrun.c
501
secs = n * 30 * 60;
sys/kern/tty_endrun.c
61
#define DPRINTFN(n, x) do { if (endrundebug > (n)) printf x; } while (0)
sys/kern/tty_endrun.c
64
#define DPRINTFN(n, x)
sys/kern/tty_msts.c
210
int fldcnt = 0, n;
sys/kern/tty_msts.c
215
for (cs = NULL, n = 0; n < np->pos && cs == NULL; n++) {
sys/kern/tty_msts.c
216
switch (np->cbuf[n]) {
sys/kern/tty_msts.c
218
np->cbuf[n] = '\0';
sys/kern/tty_msts.c
219
cs = &np->cbuf[n + 1];
sys/kern/tty_msts.c
223
np->cbuf[n] = '\0';
sys/kern/tty_msts.c
224
fld[fldcnt++] = &np->cbuf[n + 1];
sys/kern/tty_msts.c
319
int n;
sys/kern/tty_msts.c
33
#define DPRINTFN(n, x) do { if (mstsdebug > (n)) printf x; } while (0)
sys/kern/tty_msts.c
334
for (n = 0, p = s; n < 6 && *p && *p >= '0' && *p <= '9'; n++, p++)
sys/kern/tty_msts.c
336
if (n != 6 || (*p != '\0'))
sys/kern/tty_msts.c
359
int n;
sys/kern/tty_msts.c
36
#define DPRINTFN(n, x)
sys/kern/tty_msts.c
373
for (n = 0, secs = 0; fac && *s && *s >= '0' && *s <= ul; s++, n++) {
sys/kern/tty_msts.c
377
switch (n) {
sys/kern/tty_nmea.c
258
int fldcnt = 0, cksum = 0, msgcksum, n;
sys/kern/tty_nmea.c
263
for (cs = NULL, n = 0; n < np->pos && cs == NULL; n++) {
sys/kern/tty_nmea.c
264
switch (np->cbuf[n]) {
sys/kern/tty_nmea.c
266
np->cbuf[n] = '\0';
sys/kern/tty_nmea.c
267
cs = &np->cbuf[n + 1];
sys/kern/tty_nmea.c
271
cksum ^= np->cbuf[n];
sys/kern/tty_nmea.c
272
np->cbuf[n] = '\0';
sys/kern/tty_nmea.c
273
fld[fldcnt++] = &np->cbuf[n + 1];
sys/kern/tty_nmea.c
281
cksum ^= np->cbuf[n];
sys/kern/tty_nmea.c
33
#define DPRINTFN(n, x) do { if (nmeadebug > (n)) printf x; } while (0)
sys/kern/tty_nmea.c
36
#define DPRINTFN(n, x)
sys/kern/tty_nmea.c
525
int i, n;
sys/kern/tty_nmea.c
539
for (n = 0; *src && n + 2 < ppos; n++)
sys/kern/tty_nmea.c
542
for (; *src && n < ppos; n++)
sys/kern/tty_nmea.c
547
for (; *src && n < (ppos + 4); n++)
sys/kern/tty_nmea.c
550
for (i=0; i < 6 + ppos - n; i++)
sys/kern/tty_nmea.c
570
int n;
sys/kern/tty_nmea.c
573
for (n = 0, p = s; n < 6 && *p && *p >= '0' && *p <= '9'; n++, p++)
sys/kern/tty_nmea.c
575
if (n != 6 || (*p != '\0'))
sys/kern/tty_nmea.c
598
int n;
sys/kern/tty_nmea.c
600
for (n = 0, secs = 0; fac && *s && *s >= '0' && *s <= ul; s++, n++) {
sys/kern/tty_nmea.c
604
switch (n) {
sys/kern/tty_pty.c
1049
ptmattach(int n)
sys/kern/tty_pty.c
215
ptyattach(int n)
sys/kern/tty_pty.c
218
if (n <= 1)
sys/kern/tty_pty.c
219
n = NPTY_MIN;
sys/kern/tty_pty.c
220
pt_softc = ptyarralloc(n);
sys/kern/tty_pty.c
221
npty = n;
sys/kern/tty_subr.c
44
#define QMEM(n) ((((n)-1)/NBBY)+1)
sys/kern/uipc_mbuf.c
1044
struct mbuf *m, *n;
sys/kern/uipc_mbuf.c
1053
MGETHDR(n, wait, m0->m_type);
sys/kern/uipc_mbuf.c
1054
if (n == NULL)
sys/kern/uipc_mbuf.c
1056
if (m_dup_pkthdr(n, m0, wait)) {
sys/kern/uipc_mbuf.c
1057
m_freem(n);
sys/kern/uipc_mbuf.c
1060
n->m_pkthdr.len -= len0;
sys/kern/uipc_mbuf.c
1064
n->m_next = m->m_next;
sys/kern/uipc_mbuf.c
1066
n->m_len = 0;
sys/kern/uipc_mbuf.c
1067
return (n);
sys/kern/uipc_mbuf.c
1071
m_align(n, 0);
sys/kern/uipc_mbuf.c
1072
n->m_next = m_split(m, len, wait);
sys/kern/uipc_mbuf.c
1073
if (n->m_next == NULL) {
sys/kern/uipc_mbuf.c
1074
(void) m_free(n);
sys/kern/uipc_mbuf.c
1078
n->m_len = 0;
sys/kern/uipc_mbuf.c
1079
return (n);
sys/kern/uipc_mbuf.c
1083
n = m->m_next;
sys/kern/uipc_mbuf.c
1085
return (n);
sys/kern/uipc_mbuf.c
1087
MGET(n, wait, m->m_type);
sys/kern/uipc_mbuf.c
1088
if (n == NULL)
sys/kern/uipc_mbuf.c
1092
n->m_ext = m->m_ext;
sys/kern/uipc_mbuf.c
1093
MCLADDREFERENCE(m, n);
sys/kern/uipc_mbuf.c
1094
n->m_data = m->m_data + len;
sys/kern/uipc_mbuf.c
1096
m_align(n, remain);
sys/kern/uipc_mbuf.c
1097
memcpy(mtod(n, caddr_t), mtod(m, caddr_t) + len, remain);
sys/kern/uipc_mbuf.c
1099
n->m_len = remain;
sys/kern/uipc_mbuf.c
1101
n->m_next = m->m_next;
sys/kern/uipc_mbuf.c
1103
return (n);
sys/kern/uipc_mbuf.c
1149
struct mbuf *n;
sys/kern/uipc_mbuf.c
1152
MGET(n, M_DONTWAIT, m->m_type);
sys/kern/uipc_mbuf.c
1153
if (n && remain > MLEN) {
sys/kern/uipc_mbuf.c
1154
MCLGETL(n, M_DONTWAIT, remain);
sys/kern/uipc_mbuf.c
1155
if ((n->m_flags & M_EXT) == 0) {
sys/kern/uipc_mbuf.c
1156
m_free(n);
sys/kern/uipc_mbuf.c
1157
n = NULL;
sys/kern/uipc_mbuf.c
1160
if (n == NULL)
sys/kern/uipc_mbuf.c
1163
memcpy(n->m_data, mtod(m, char *) + skip, remain);
sys/kern/uipc_mbuf.c
1164
n->m_len = remain;
sys/kern/uipc_mbuf.c
1167
n->m_next = m->m_next;
sys/kern/uipc_mbuf.c
1168
m->m_next = n;
sys/kern/uipc_mbuf.c
1175
n = m_get(M_DONTWAIT, m->m_type);
sys/kern/uipc_mbuf.c
1176
if (n == NULL)
sys/kern/uipc_mbuf.c
1179
n->m_len = hlen;
sys/kern/uipc_mbuf.c
1181
n->m_next = m->m_next;
sys/kern/uipc_mbuf.c
1182
m->m_next = n;
sys/kern/uipc_mbuf.c
1185
m = n; /* ... of new mbuf */
sys/kern/uipc_mbuf.c
1584
struct mbuf *m, *n;
sys/kern/uipc_mbuf.c
1596
for (n = m; n != NULL; n = n->m_next) {
sys/kern/uipc_mbuf.c
1598
len += n->m_len;
sys/kern/uipc_mbuf.c
1599
size += M_SIZE(n);
sys/kern/uipc_mbuf.c
1685
struct mbuf *m, *n;
sys/kern/uipc_mbuf.c
1688
for (m = ml->ml_head; m != NULL; m = n) {
sys/kern/uipc_mbuf.c
1689
n = m->m_nextpkt;
sys/kern/uipc_mbuf.c
330
struct mbuf *n;
sys/kern/uipc_mbuf.c
334
for (n = m; n; n = n->m_next)
sys/kern/uipc_mbuf.c
335
plen += n->m_len;
sys/kern/uipc_mbuf.c
405
struct mbuf *n;
sys/kern/uipc_mbuf.c
415
n = m->m_next;
sys/kern/uipc_mbuf.c
419
if (n)
sys/kern/uipc_mbuf.c
420
n->m_flags |= M_ZEROIZE;
sys/kern/uipc_mbuf.c
434
return (n);
sys/kern/uipc_mbuf.c
438
m_extref(struct mbuf *o, struct mbuf *n)
sys/kern/uipc_mbuf.c
442
n->m_flags |= o->m_flags & (M_EXT|M_EXTWR);
sys/kern/uipc_mbuf.c
446
n->m_ext.ext_nextref = o->m_ext.ext_nextref;
sys/kern/uipc_mbuf.c
447
n->m_ext.ext_prevref = o;
sys/kern/uipc_mbuf.c
448
o->m_ext.ext_nextref = n;
sys/kern/uipc_mbuf.c
449
n->m_ext.ext_nextref->m_ext.ext_prevref = n;
sys/kern/uipc_mbuf.c
453
MCLREFDEBUGN((n), __FILE__, __LINE__);
sys/kern/uipc_mbuf.c
505
struct mbuf *n;
sys/kern/uipc_mbuf.c
510
n = m->m_nextpkt;
sys/kern/uipc_mbuf.c
516
return (n);
sys/kern/uipc_mbuf.c
628
struct mbuf *m, *n, **np;
sys/kern/uipc_mbuf.c
646
MGET(n, wait, m->m_type);
sys/kern/uipc_mbuf.c
647
*np = n;
sys/kern/uipc_mbuf.c
648
if (n == NULL)
sys/kern/uipc_mbuf.c
651
if (m_dup_pkthdr(n, m0, wait))
sys/kern/uipc_mbuf.c
654
n->m_pkthdr.len = len;
sys/kern/uipc_mbuf.c
657
n->m_len = min(len, m->m_len - off);
sys/kern/uipc_mbuf.c
659
n->m_data = m->m_data + off;
sys/kern/uipc_mbuf.c
660
n->m_ext = m->m_ext;
sys/kern/uipc_mbuf.c
661
MCLADDREFERENCE(m, n);
sys/kern/uipc_mbuf.c
663
n->m_data += m->m_data -
sys/kern/uipc_mbuf.c
665
n->m_data += off;
sys/kern/uipc_mbuf.c
666
memcpy(mtod(n, caddr_t), mtod(m, caddr_t) + off,
sys/kern/uipc_mbuf.c
667
n->m_len);
sys/kern/uipc_mbuf.c
670
len -= n->m_len;
sys/kern/uipc_mbuf.c
671
off += n->m_len;
sys/kern/uipc_mbuf.c
680
np = &n->m_next;
sys/kern/uipc_mbuf.c
726
struct mbuf *m = m0, *n;
sys/kern/uipc_mbuf.c
736
if ((n = m_get(wait, m->m_type)) == NULL) {
sys/kern/uipc_mbuf.c
742
MCLGETL(n, wait, off + len);
sys/kern/uipc_mbuf.c
743
if (!(n->m_flags & M_EXT)) {
sys/kern/uipc_mbuf.c
744
m_free(n);
sys/kern/uipc_mbuf.c
749
memset(mtod(n, caddr_t), 0, off);
sys/kern/uipc_mbuf.c
750
n->m_len = len + off;
sys/kern/uipc_mbuf.c
751
m->m_next = n;
sys/kern/uipc_mbuf.c
770
if ((n = m_get(wait, m->m_type)) == NULL) {
sys/kern/uipc_mbuf.c
776
MCLGETL(n, wait, len);
sys/kern/uipc_mbuf.c
777
if (!(n->m_flags & M_EXT)) {
sys/kern/uipc_mbuf.c
778
m_free(n);
sys/kern/uipc_mbuf.c
783
n->m_len = len;
sys/kern/uipc_mbuf.c
784
m->m_next = n;
sys/kern/uipc_mbuf.c
803
m_cat(struct mbuf *m, struct mbuf *n)
sys/kern/uipc_mbuf.c
807
while (n) {
sys/kern/uipc_mbuf.c
808
if (M_READONLY(m) || n->m_len > m_trailingspace(m)) {
sys/kern/uipc_mbuf.c
810
m->m_next = n;
sys/kern/uipc_mbuf.c
814
memcpy(mtod(m, caddr_t) + m->m_len, mtod(n, caddr_t),
sys/kern/uipc_mbuf.c
815
n->m_len);
sys/kern/uipc_mbuf.c
816
m->m_len += n->m_len;
sys/kern/uipc_mbuf.c
817
n = m_free(n);
sys/kern/uipc_mbuf2.c
103
sharedcluster = M_READONLY(n);
sys/kern/uipc_mbuf2.c
109
if ((off == 0 || offp) && len <= n->m_len - off && !sharedcluster)
sys/kern/uipc_mbuf2.c
118
if (len <= n->m_len - off) {
sys/kern/uipc_mbuf2.c
122
o = m_dup1(n, off, n->m_len - off, M_DONTWAIT);
sys/kern/uipc_mbuf2.c
129
n->m_len = off;
sys/kern/uipc_mbuf2.c
130
mlast->m_next = n->m_next;
sys/kern/uipc_mbuf2.c
131
n->m_next = o;
sys/kern/uipc_mbuf2.c
132
n = o;
sys/kern/uipc_mbuf2.c
142
hlen = n->m_len - off;
sys/kern/uipc_mbuf2.c
150
for (o = n->m_next; o != NULL; o = o->m_next)
sys/kern/uipc_mbuf2.c
161
if ((off == 0 || offp) && m_trailingspace(n) >= tlen &&
sys/kern/uipc_mbuf2.c
164
m_copydata(n->m_next, 0, tlen, mtod(n, caddr_t) + n->m_len);
sys/kern/uipc_mbuf2.c
165
n->m_len += tlen;
sys/kern/uipc_mbuf2.c
166
m_adj(n->m_next, tlen);
sys/kern/uipc_mbuf2.c
169
if ((off == 0 || offp) && m_leadingspace(n->m_next) >= hlen &&
sys/kern/uipc_mbuf2.c
170
!sharedcluster && n->m_next->m_len >= tlen) {
sys/kern/uipc_mbuf2.c
171
n->m_next->m_data -= hlen;
sys/kern/uipc_mbuf2.c
172
n->m_next->m_len += hlen;
sys/kern/uipc_mbuf2.c
174
memcpy(mtod(n->m_next, caddr_t), mtod(n, caddr_t) + off, hlen);
sys/kern/uipc_mbuf2.c
175
n->m_len -= hlen;
sys/kern/uipc_mbuf2.c
176
n = n->m_next;
sys/kern/uipc_mbuf2.c
204
memcpy(mtod(o, caddr_t), mtod(n, caddr_t) + off, hlen);
sys/kern/uipc_mbuf2.c
205
n->m_len -= hlen;
sys/kern/uipc_mbuf2.c
207
m_copydata(n->m_next, 0, tlen, mtod(o, caddr_t) + o->m_len);
sys/kern/uipc_mbuf2.c
209
m_adj(n->m_next, tlen);
sys/kern/uipc_mbuf2.c
210
o->m_next = n->m_next;
sys/kern/uipc_mbuf2.c
211
n->m_next = o;
sys/kern/uipc_mbuf2.c
212
n = o;
sys/kern/uipc_mbuf2.c
216
KASSERT(n->m_len >= off + len);
sys/kern/uipc_mbuf2.c
219
return (n);
sys/kern/uipc_mbuf2.c
225
struct mbuf *n;
sys/kern/uipc_mbuf2.c
231
MGETHDR(n, wait, m->m_type);
sys/kern/uipc_mbuf2.c
232
if (n == NULL)
sys/kern/uipc_mbuf2.c
234
if (m_dup_pkthdr(n, m, wait)) {
sys/kern/uipc_mbuf2.c
235
m_free(n);
sys/kern/uipc_mbuf2.c
240
MGET(n, wait, m->m_type);
sys/kern/uipc_mbuf2.c
243
if (n && len > l) {
sys/kern/uipc_mbuf2.c
244
MCLGETL(n, wait, len);
sys/kern/uipc_mbuf2.c
245
if ((n->m_flags & M_EXT) == 0) {
sys/kern/uipc_mbuf2.c
246
m_free(n);
sys/kern/uipc_mbuf2.c
247
n = NULL;
sys/kern/uipc_mbuf2.c
250
if (!n)
sys/kern/uipc_mbuf2.c
253
m_copydata(m, off, len, mtod(n, caddr_t));
sys/kern/uipc_mbuf2.c
254
n->m_len = len;
sys/kern/uipc_mbuf2.c
256
return (n);
sys/kern/uipc_mbuf2.c
90
struct mbuf *n, *o;
sys/kern/uipc_mbuf2.c
98
if ((n = m_getptr(m, off, &off)) == NULL) {
sys/kern/uipc_socket2.c
1004
sbcompress(struct sockbuf *sb, struct mbuf *m, struct mbuf *n)
sys/kern/uipc_socket2.c
1013
(((o = m->m_next) || (o = n)) &&
sys/kern/uipc_socket2.c
1020
if (n && (n->m_flags & M_EOR) == 0 &&
sys/kern/uipc_socket2.c
1022
m->m_len <= ((n->m_flags & M_EXT)? n->m_ext.ext_size :
sys/kern/uipc_socket2.c
1024
m->m_len <= m_trailingspace(n) &&
sys/kern/uipc_socket2.c
1025
n->m_type == m->m_type) {
sys/kern/uipc_socket2.c
1026
memcpy(mtod(n, caddr_t) + n->m_len, mtod(m, caddr_t),
sys/kern/uipc_socket2.c
1028
n->m_len += m->m_len;
sys/kern/uipc_socket2.c
1035
if (n)
sys/kern/uipc_socket2.c
1036
n->m_next = m;
sys/kern/uipc_socket2.c
1041
n = m;
sys/kern/uipc_socket2.c
1044
n->m_next = NULL;
sys/kern/uipc_socket2.c
1047
if (n)
sys/kern/uipc_socket2.c
1048
n->m_flags |= eor;
sys/kern/uipc_socket2.c
749
struct mbuf *n;
sys/kern/uipc_socket2.c
763
for (n = m; n != NULL; n = n->m_next)
sys/kern/uipc_socket2.c
764
printf("%p ", n);
sys/kern/uipc_socket2.c
790
struct mbuf *n;
sys/kern/uipc_socket2.c
798
if ((n = sb->sb_lastrecord) != NULL) {
sys/kern/uipc_socket2.c
805
if (n->m_flags & M_EOR) {
sys/kern/uipc_socket2.c
809
} while (n->m_next && (n = n->m_next));
sys/kern/uipc_socket2.c
817
sbcompress(sb, m, n);
sys/kern/uipc_socket2.c
845
struct mbuf *m, *n;
sys/kern/uipc_socket2.c
849
for (n = m; n; n = n->m_next) {
sys/kern/uipc_socket2.c
850
len += n->m_len;
sys/kern/uipc_socket2.c
852
if (n->m_flags & M_EXT)
sys/kern/uipc_socket2.c
853
mbcnt += n->m_ext.ext_size;
sys/kern/uipc_socket2.c
854
if (m != n && n->m_nextpkt)
sys/kern/uipc_socket2.c
907
struct mbuf *m, *n, *nlast;
sys/kern/uipc_socket2.c
916
for (n = control; n; n = n->m_next) {
sys/kern/uipc_socket2.c
917
space += n->m_len;
sys/kern/uipc_socket2.c
918
if (n->m_next == NULL) /* keep pointer to last control buf */
sys/kern/uipc_socket2.c
930
if (n)
sys/kern/uipc_socket2.c
931
n->m_next = m0; /* concatenate data to control */
sys/kern/uipc_socket2.c
938
for (n = m; n->m_next != NULL; n = n->m_next)
sys/kern/uipc_socket2.c
939
sballoc(sb, n);
sys/kern/uipc_socket2.c
940
sballoc(sb, n);
sys/kern/uipc_socket2.c
941
nlast = n;
sys/kern/uipc_socket2.c
955
struct mbuf *m, *mlast, *n;
sys/kern/uipc_socket2.c
967
n = m; /* save pointer to last control buffer */
sys/kern/uipc_socket2.c
980
n->m_next = m0; /* concatenate data to control */
sys/kern/vfs_cache.c
142
struct namecache n;
sys/kern/vfs_cache.c
160
n.nc_nlen = cnp->cn_namelen;
sys/kern/vfs_cache.c
161
memcpy(n.nc_name, cnp->cn_nameptr, n.nc_nlen);
sys/kern/vfs_cache.c
162
ncp = RBT_FIND(namecache_rb_cache, &dvp->v_nc_tree, &n);
sys/lib/libkern/arch/hppa/prefix.h
61
#define MILLI_BEN(lbl) BE,n lbl(sr7,r0)
sys/lib/libkern/arch/hppa/prefix.h
63
#define MILLI_BLEN(lbl) BLE,n lbl(sr7,r0)
sys/lib/libkern/arch/hppa/prefix.h
66
#define MILLIRETN BE,n 0(sr0,r31)
sys/lib/libkern/arch/hppa/prefix.h
68
#define MILLI_RETN BE,n 0(sr0,r31)
sys/lib/libkern/arch/hppa/prefix.h
73
#define MILLI_BEN(lbl) B,n lbl
sys/lib/libkern/arch/hppa/prefix.h
75
#define MILLI_BLEN(lbl) BL,n lbl,r31
sys/lib/libkern/arch/hppa/prefix.h
76
#define MILLIRETN BV,n 0(r31)
sys/lib/libkern/arch/hppa/prefix.h
78
#define MILLI_RETN BV,n 0(r31)
sys/lib/libkern/memchr.c
39
memchr(const void *s, int c, size_t n)
sys/lib/libkern/memchr.c
41
if (n != 0) {
sys/lib/libkern/memchr.c
47
} while (--n != 0);
sys/lib/libkern/memcmp.c
43
memcmp(const void *s1, const void *s2, size_t n)
sys/lib/libkern/memcmp.c
45
if (n != 0) {
sys/lib/libkern/memcmp.c
51
} while (--n != 0);
sys/lib/libkern/memcpy.c
41
memcpy(void *s1, const void *s2, size_t n)
sys/lib/libkern/memcpy.c
46
while (n-- > 0)
sys/lib/libkern/memmove.c
41
memmove(void *s1, const void *s2, size_t n)
sys/lib/libkern/memmove.c
47
f += n;
sys/lib/libkern/memmove.c
48
t += n;
sys/lib/libkern/memmove.c
49
while (n-- > 0)
sys/lib/libkern/memmove.c
52
while (n-- > 0)
sys/lib/libkern/qdivrem.c
118
for (n = 4; v[1] == 0; v++) {
sys/lib/libkern/qdivrem.c
119
if (--n == 1) {
sys/lib/libkern/qdivrem.c
152
for (m = 4 - n; u[1] == 0; u++)
sys/lib/libkern/qdivrem.c
168
shl(&u[0], m + n, d); /* u <<= d */
sys/lib/libkern/qdivrem.c
169
shl(&v[1], n - 1, d); /* v <<= d */
sys/lib/libkern/qdivrem.c
212
for (t = 0, i = n; i > 0; i--) {
sys/lib/libkern/qdivrem.c
227
for (t = 0, i = n; i > 0; i--) { /* D6: add back. */
sys/lib/libkern/qdivrem.c
244
for (i = m + n; i > m; --i)
sys/lib/libkern/qdivrem.c
70
int m, n, d, j, i;
sys/lib/libkern/strlcat.c
33
size_t n = dsize;
sys/lib/libkern/strlcat.c
37
while (n-- != 0 && *dst != '\0')
sys/lib/libkern/strlcat.c
40
n = dsize - dlen;
sys/lib/libkern/strlcat.c
42
if (n-- == 0)
sys/lib/libkern/strlcat.c
45
if (n != 0) {
sys/lib/libkern/strlcat.c
47
n--;
sys/lib/libkern/strncasecmp.c
36
strncasecmp(const char *s1, const char *s2, size_t n)
sys/lib/libkern/strncasecmp.c
38
if (n == 0)
sys/lib/libkern/strncasecmp.c
57
} while (--n != 0);
sys/lib/libkern/strncmp.c
35
strncmp(const char *s1, const char *s2, size_t n)
sys/lib/libkern/strncmp.c
38
if (n == 0)
sys/lib/libkern/strncmp.c
45
} while (--n != 0);
sys/lib/libkern/strncpy.c
42
strncpy(char *dst, const char *src, size_t n)
sys/lib/libkern/strncpy.c
44
if (n != 0) {
sys/lib/libkern/strncpy.c
51
while (--n != 0)
sys/lib/libkern/strncpy.c
55
} while (--n != 0);
sys/lib/libkern/timingsafe_bcmp.c
21
timingsafe_bcmp(const void *b1, const void *b2, size_t n)
sys/lib/libkern/timingsafe_bcmp.c
26
for (; n > 0; n--)
sys/lib/libsa/arp.c
164
ssize_t n;
sys/lib/libsa/arp.c
173
n = readether(d, pkt, len, tleft, &etype);
sys/lib/libsa/arp.c
175
if (n < 0 || (size_t)n < sizeof(struct ether_arp)) {
sys/lib/libsa/arp.c
178
printf("bad len=%d\n", n);
sys/lib/libsa/arp.c
238
return (n);
sys/lib/libsa/blowfish.c
55
#define BLFRND(s,p,i,j,n) (i ^= F(s,j) ^ (p)[n])
sys/lib/libsa/bootp.c
146
ssize_t n;
sys/lib/libsa/bootp.c
154
n = readudp(d, pkt, len, tleft);
sys/lib/libsa/bootp.c
155
if (n < 0 || (size_t)n < sizeof(struct bootp))
sys/lib/libsa/bootp.c
163
(unsigned)bp, n);
sys/lib/libsa/bootp.c
255
return (n);
sys/lib/libsa/cread.c
275
unsigned int n = s->stream.avail_in;
sys/lib/libsa/cread.c
277
if (n > s->stream.avail_out)
sys/lib/libsa/cread.c
278
n = s->stream.avail_out;
sys/lib/libsa/cread.c
279
if (n > 0) {
sys/lib/libsa/cread.c
280
zmemcpy(s->stream.next_out, s->stream.next_in, n);
sys/lib/libsa/cread.c
281
s->stream.next_out += n;
sys/lib/libsa/cread.c
282
s->stream.next_in += n;
sys/lib/libsa/cread.c
283
s->stream.avail_out -= n;
sys/lib/libsa/cread.c
284
s->stream.avail_in -= n;
sys/lib/libsa/cread.c
287
int n;
sys/lib/libsa/cread.c
289
n = oread(fd, s->stream.next_out,
sys/lib/libsa/cread.c
291
if (n <= 0) {
sys/lib/libsa/cread.c
298
s->stream.avail_out -= n;
sys/lib/libsa/cread.c
420
ssize_t n;
sys/lib/libsa/cread.c
424
n = read(fd, dummybuf, len);
sys/lib/libsa/cread.c
425
if (n <= 0) {
sys/lib/libsa/cread.c
426
if (n == 0)
sys/lib/libsa/cread.c
430
toskip -= n;
sys/lib/libsa/ether.c
103
n = netif_get(d, eh, len, tleft);
sys/lib/libsa/ether.c
104
if (n < 0 || (size_t)n < sizeof(*eh))
sys/lib/libsa/ether.c
119
n -= sizeof(*eh);
sys/lib/libsa/ether.c
120
return (n);
sys/lib/libsa/ether.c
60
ssize_t n;
sys/lib/libsa/ether.c
75
n = netif_put(d, eh, len);
sys/lib/libsa/ether.c
76
if (n < 0 || (size_t)n < sizeof(*eh))
sys/lib/libsa/ether.c
79
n -= sizeof(*eh);
sys/lib/libsa/ether.c
80
return (n);
sys/lib/libsa/ether.c
92
ssize_t n;
sys/lib/libsa/explicit_bzero.c
13
explicit_bzero(void *p, size_t n)
sys/lib/libsa/explicit_bzero.c
15
bzero(p, n);
sys/lib/libsa/memcmp.c
41
memcmp(const void *s1, const void *s2, size_t n)
sys/lib/libsa/memcmp.c
43
if (n != 0) {
sys/lib/libsa/memcmp.c
49
} while (--n != 0);
sys/lib/libsa/memcpy.c
42
memcpy(void *s1, const void *s2, size_t n)
sys/lib/libsa/memcpy.c
47
while (n-- > 0)
sys/lib/libsa/memmove.c
41
memmove(void *s1, const void *s2, size_t n)
sys/lib/libsa/memmove.c
47
f += n;
sys/lib/libsa/memmove.c
48
t += n;
sys/lib/libsa/memmove.c
49
while (n-- > 0)
sys/lib/libsa/memmove.c
52
while (n-- > 0)
sys/lib/libsa/memset.c
38
memset(void *s1, int c, size_t n)
sys/lib/libsa/memset.c
42
while (n--)
sys/lib/libsa/net.c
123
int n;
sys/lib/libsa/net.c
166
n = pp - parts + 1;
sys/lib/libsa/net.c
167
switch (n) {
sys/lib/libsa/net.c
208
int n;
sys/lib/libsa/net.c
215
n = 4;
sys/lib/libsa/net.c
228
} while (--n > 0);
sys/lib/libsa/net.c
234
number(const char *s, int *n)
sys/lib/libsa/net.c
236
for (*n = 0; isdigit((unsigned char)*s); s++)
sys/lib/libsa/net.c
237
*n = (*n * 10) + *s - '0';
sys/lib/libsa/net.c
245
u_int32_t addr = 0, n;
sys/lib/libsa/net.c
249
p = number(p, &n);
sys/lib/libsa/net.c
250
addr |= (n << 24) & 0xff000000;
sys/lib/libsa/net.c
253
p = number(p, &n);
sys/lib/libsa/net.c
254
addr |= (n << 16) & 0xff0000;
sys/lib/libsa/net.c
257
p = number(p, &n);
sys/lib/libsa/net.c
258
addr |= (n << 8) & 0xff00;
sys/lib/libsa/net.c
261
p = number(p, &n);
sys/lib/libsa/net.c
262
addr |= n & 0xff;
sys/lib/libsa/netudp.c
129
ssize_t n;
sys/lib/libsa/netudp.c
145
n = readether(d, ip, len + sizeof(*ip) + sizeof(*uh), tleft, &etype);
sys/lib/libsa/netudp.c
146
if (n < 0 || (size_t)n < sizeof(*ip) + sizeof(*uh))
sys/lib/libsa/netudp.c
186
if (n < ntohs(ip->ip_len)) {
sys/lib/libsa/netudp.c
190
n, ntohs(ip->ip_len));
sys/lib/libsa/netudp.c
208
n -= hlen - sizeof(*ip);
sys/lib/libsa/netudp.c
220
n = ntohs(uh->uh_ulen) + sizeof(*ip);
sys/lib/libsa/netudp.c
221
if (n > RECV_SIZE - ETHER_SIZE) {
sys/lib/libsa/netudp.c
222
printf("readudp: huge packet, udp len %ld\n", (long)n);
sys/lib/libsa/netudp.c
231
if (in_cksum(ui, n) != 0) {
sys/lib/libsa/netudp.c
250
n -= sizeof(*ip) + sizeof(*uh);
sys/lib/libsa/netudp.c
251
return (n);
sys/lib/libsa/printf.c
101
int ch, lflag, width, n;
sys/lib/libsa/printf.c
125
n = 0;
sys/lib/libsa/printf.c
127
n = 10 * n + to_digit(ch);
sys/lib/libsa/printf.c
130
width = n;
sys/lib/libsa/printf.c
137
int set, n;
sys/lib/libsa/printf.c
146
for (set = 0; (n = *p++);) {
sys/lib/libsa/printf.c
147
if (ul & (1 << (n - 1))) {
sys/lib/libsa/printf.c
149
for (; (n = *p) > ' '; ++p)
sys/lib/libsa/printf.c
150
put(n);
sys/lib/libsa/printf.c
68
#define to_char(n) ((n) + '0')
sys/lib/libsa/rarp.c
151
ssize_t n;
sys/lib/libsa/rarp.c
160
n = readether(d, pkt, len, tleft, &etype);
sys/lib/libsa/rarp.c
162
if (n < 0 || (size_t)n < sizeof(struct ether_arp)) {
sys/lib/libsa/rarp.c
165
printf("bad len=%d\n", n);
sys/lib/libsa/rarp.c
213
return (n);
sys/lib/libsa/rpc.c
232
ssize_t n;
sys/lib/libsa/rpc.c
241
n = readudp(d, pkt, len, tleft);
sys/lib/libsa/rpc.c
242
if (n <= (4 * 4))
sys/lib/libsa/rpc.c
273
return (n);
sys/lib/libsa/sha2.c
138
#define ADDINC128(w,n) do { \
sys/lib/libsa/sha2.c
139
(w)[0] += (u_int64_t)(n); \
sys/lib/libsa/sha2.c
140
if ((w)[0] < (n)) { \
sys/lib/libsa/stand.h
146
#define bzero(s,n) ((void)memset((s),0,(n)))
sys/lib/libsa/stand.h
147
#define bcmp(s1,s2,n) (memcmp((s2),(s1),(n)))
sys/lib/libsa/stand.h
148
#define bcopy(s1,s2,n) ((void)memmove((s2),(s1),(n)))
sys/lib/libsa/strncpy.c
34
strncpy(char *s1, const char *s2, size_t n)
sys/lib/libsa/strncpy.c
38
while (n-- && (*s1++ = *s2++) != '\0')
sys/lib/libsa/tftp.c
103
ssize_t n;
sys/lib/libsa/tftp.c
108
n = readudp(d, pkt, len, tleft);
sys/lib/libsa/tftp.c
110
if (n < 4)
sys/lib/libsa/tftp.c
130
return (n - (t->th_data - (char *)t));
sys/lib/libz/adler32.c
101
} while (--n);
sys/lib/libz/adler32.c
61
unsigned n;
sys/lib/libz/adler32.c
97
n = NMAX / 16; /* NMAX is divisible by 16 */
sys/lib/libz/crc32.c
182
local uLong x2nmodp(z_off64_t n, unsigned k) {
sys/lib/libz/crc32.c
186
while (n) {
sys/lib/libz/crc32.c
187
if (n & 1)
sys/lib/libz/crc32.c
189
n >>= 1;
sys/lib/libz/crc32.c
242
unsigned i, j, n;
sys/lib/libz/crc32.c
259
for (n = 1; n < 32; n++)
sys/lib/libz/crc32.c
260
x2n_table[n] = p = (z_crc_t)multmodp(p, p);
sys/lib/libz/crc32.c
279
int k, n;
sys/lib/libz/crc32.c
324
for (n = 1; n <= 6; n++) {
sys/lib/libz/crc32.c
327
"#if N == %d\n", n);
sys/lib/libz/crc32.c
330
braid(ltl, big, n, 8);
sys/lib/libz/crc32.c
356
braid(ltl, big, n, 4);
sys/lib/libz/crc32.c
409
int n;
sys/lib/libz/crc32.c
411
for (n = 0; n < k; n++)
sys/lib/libz/crc32.c
412
fprintf(out, "%s0x%08lx%s", n == 0 || n % 5 ? "" : " ",
sys/lib/libz/crc32.c
413
(unsigned long)(table[n]),
sys/lib/libz/crc32.c
414
n == k - 1 ? "" : (n % 5 == 4 ? ",\n" : ", "));
sys/lib/libz/crc32.c
422
int n;
sys/lib/libz/crc32.c
424
for (n = 0; n < k; n++)
sys/lib/libz/crc32.c
425
fprintf(out, "%s0x%08lx%s", n == 0 || n % 5 ? "" : " ",
sys/lib/libz/crc32.c
426
(unsigned long)(table[n] >> 32),
sys/lib/libz/crc32.c
427
n == k - 1 ? "" : (n % 5 == 4 ? ",\n" : ", "));
sys/lib/libz/crc32.c
438
int n;
sys/lib/libz/crc32.c
440
for (n = 0; n < k; n++)
sys/lib/libz/crc32.c
441
fprintf(out, "%s0x%016llx%s", n == 0 || n % 3 ? "" : " ",
sys/lib/libz/crc32.c
442
(unsigned long long)(table[n]),
sys/lib/libz/crc32.c
443
n == k - 1 ? "" : (n % 3 == 2 ? ",\n" : ", "));
sys/lib/libz/crc32.c
459
local void braid(z_crc_t ltl[][256], z_word_t big[][256], int n, int w) {
sys/lib/libz/crc32.c
463
p = (z_crc_t)x2nmodp((n * w + 3 - k) << 3, 0);
sys/lib/libz/deflate.c
184
unsigned n, m;
sys/lib/libz/deflate.c
188
n = s->hash_size;
sys/lib/libz/deflate.c
189
p = &s->head[n];
sys/lib/libz/deflate.c
193
} while (--n);
sys/lib/libz/deflate.c
195
n = wsize;
sys/lib/libz/deflate.c
196
p = &s->prev[n];
sys/lib/libz/deflate.c
203
} while (--n);
sys/lib/libz/deflate.c
249
unsigned n;
sys/lib/libz/deflate.c
307
n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
sys/lib/libz/deflate.c
308
s->lookahead += n;
sys/lib/libz/deflate.c
558
uInt str, n;
sys/lib/libz/deflate.c
595
n = s->lookahead - (MIN_MATCH-1);
sys/lib/libz/deflate.c
603
} while (--n);
sys/lib/libz/infback.c
124
#define NEEDBITS(n) \
sys/lib/libz/infback.c
126
while (bits < (unsigned)(n)) \
sys/lib/libz/infback.c
131
#define BITS(n) \
sys/lib/libz/infback.c
132
((unsigned)hold & ((1U << (n)) - 1))
sys/lib/libz/infback.c
135
#define DROPBITS(n) \
sys/lib/libz/infback.c
137
hold >>= (n); \
sys/lib/libz/infback.c
138
bits -= (unsigned)(n); \
sys/lib/libz/inflate.c
368
#define NEEDBITS(n) \
sys/lib/libz/inflate.c
370
while (bits < (unsigned)(n)) \
sys/lib/libz/inflate.c
375
#define BITS(n) \
sys/lib/libz/inflate.c
376
((unsigned)hold & ((1U << (n)) - 1))
sys/lib/libz/inflate.c
379
#define DROPBITS(n) \
sys/lib/libz/inflate.c
381
hold >>= (n); \
sys/lib/libz/inflate.c
382
bits -= (unsigned)(n); \
sys/lib/libz/trees.c
205
int n; /* code index */
sys/lib/libz/trees.c
221
for (n = 0; n <= max_code; n++) {
sys/lib/libz/trees.c
222
int len = tree[n].Len;
sys/lib/libz/trees.c
225
tree[n].Code = (ush)bi_reverse(next_code[len]++, len);
sys/lib/libz/trees.c
228
n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len] - 1));
sys/lib/libz/trees.c
296
int n; /* iterates over tree elements */
sys/lib/libz/trees.c
319
for (n = 0; n < (1 << extra_lbits[code]); n++) {
sys/lib/libz/trees.c
334
for (n = 0; n < (1 << extra_dbits[code]); n++) {
sys/lib/libz/trees.c
342
for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {
sys/lib/libz/trees.c
350
n = 0;
sys/lib/libz/trees.c
351
while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
sys/lib/libz/trees.c
352
while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
sys/lib/libz/trees.c
353
while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
sys/lib/libz/trees.c
354
while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
sys/lib/libz/trees.c
362
for (n = 0; n < D_CODES; n++) {
sys/lib/libz/trees.c
363
static_dtree[n].Len = 5;
sys/lib/libz/trees.c
364
static_dtree[n].Code = bi_reverse((unsigned)n, 5);
sys/lib/libz/trees.c
439
int n; /* iterates over tree elements */
sys/lib/libz/trees.c
442
for (n = 0; n < L_CODES; n++) s->dyn_ltree[n].Freq = 0;
sys/lib/libz/trees.c
443
for (n = 0; n < D_CODES; n++) s->dyn_dtree[n].Freq = 0;
sys/lib/libz/trees.c
444
for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
sys/lib/libz/trees.c
497
#define smaller(tree, n, m, depth) \
sys/lib/libz/trees.c
498
(tree[n].Freq < tree[m].Freq || \
sys/lib/libz/trees.c
499
(tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
sys/lib/libz/trees.c
546
int n, m; /* iterate over the tree elements */
sys/lib/libz/trees.c
560
n = s->heap[h];
sys/lib/libz/trees.c
561
bits = tree[tree[n].Dad].Len + 1;
sys/lib/libz/trees.c
563
tree[n].Len = (ush)bits;
sys/lib/libz/trees.c
566
if (n > max_code) continue; /* not a leaf node */
sys/lib/libz/trees.c
570
if (n >= base) xbits = extra[n - base];
sys/lib/libz/trees.c
571
f = tree[n].Freq;
sys/lib/libz/trees.c
573
if (stree) s->static_len += (ulg)f * (unsigned)(stree[n].Len + xbits);
sys/lib/libz/trees.c
599
n = s->bl_count[bits];
sys/lib/libz/trees.c
600
while (n != 0) {
sys/lib/libz/trees.c
608
n--;
sys/lib/libz/trees.c
629
int n, m; /* iterate over heap elements */
sys/lib/libz/trees.c
639
for (n = 0; n < elems; n++) {
sys/lib/libz/trees.c
640
if (tree[n].Freq != 0) {
sys/lib/libz/trees.c
641
s->heap[++(s->heap_len)] = max_code = n;
sys/lib/libz/trees.c
642
s->depth[n] = 0;
sys/lib/libz/trees.c
644
tree[n].Len = 0;
sys/lib/libz/trees.c
665
for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
sys/lib/libz/trees.c
672
pqremove(s, tree, n); /* n = node of least frequency */
sys/lib/libz/trees.c
675
s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
sys/lib/libz/trees.c
679
tree[node].Freq = tree[n].Freq + tree[m].Freq;
sys/lib/libz/trees.c
680
s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
sys/lib/libz/trees.c
681
s->depth[n] : s->depth[m]) + 1);
sys/lib/libz/trees.c
682
tree[n].Dad = tree[m].Dad = (ush)node;
sys/lib/libz/trees.c
686
node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
sys/lib/libz/trees.c
711
int n; /* iterates over all tree elements */
sys/lib/libz/trees.c
722
for (n = 0; n <= max_code; n++) {
sys/lib/libz/trees.c
723
curlen = nextlen; nextlen = tree[n + 1].Len;
sys/lib/libz/trees.c
752
int n; /* iterates over all tree elements */
sys/lib/libz/trees.c
763
for (n = 0; n <= max_code; n++) {
sys/lib/libz/trees.c
764
curlen = nextlen; nextlen = tree[n + 1].Len;
sys/lib/libz/trees.c
970
int n;
sys/lib/libz/trees.c
973
for (n = 0; n <= 31; n++, block_mask >>= 1)
sys/lib/libz/trees.c
974
if ((block_mask & 1) && (s->dyn_ltree[n].Freq != 0))
sys/lib/libz/trees.c
981
for (n = 32; n < LITERALS; n++)
sys/lib/libz/trees.c
982
if (s->dyn_ltree[n].Freq != 0)
sys/lib/libz/zutil.c
154
void ZLIB_INTERNAL zmemcpy(void FAR *dst, const void FAR *src, z_size_t n) {
sys/lib/libz/zutil.c
157
while (n) {
sys/lib/libz/zutil.c
159
n--;
sys/lib/libz/zutil.c
163
int ZLIB_INTERNAL zmemcmp(const void FAR *s1, const void FAR *s2, z_size_t n) {
sys/lib/libz/zutil.c
165
while (n) {
sys/lib/libz/zutil.c
168
n--;
sys/lib/libz/zutil.c
243
int n;
sys/lib/libz/zutil.c
252
for (n = 0; n < next_ptr; n++) {
sys/lib/libz/zutil.c
253
if (ptr != table[n].new_ptr) continue;
sys/lib/libz/zutil.c
255
farfree(table[n].org_ptr);
sys/lib/libz/zutil.c
256
while (++n < next_ptr) {
sys/lib/libz/zutil.c
257
table[n-1] = table[n];
sys/msdosfs/msdosfs_fat.c
697
uint32_t cl, n;
sys/msdosfs/msdosfs_fat.c
699
for (cl = start, n = count; n-- > 0;)
sys/msdosfs/msdosfs_vnops.c
1412
long n;
sys/msdosfs/msdosfs_vnops.c
1480
for (n = (int)offset / sizeof(struct direntry);
sys/msdosfs/msdosfs_vnops.c
1481
n < 2; n++) {
sys/msdosfs/msdosfs_vnops.c
1487
switch (n) {
sys/msdosfs/msdosfs_vnops.c
1515
n = min(pmp->pm_bpcluster - on, uio->uio_resid);
sys/msdosfs/msdosfs_vnops.c
1519
n = min(n, diff);
sys/msdosfs/msdosfs_vnops.c
1527
n = min(n, blsize - bp->b_resid);
sys/msdosfs/msdosfs_vnops.c
1534
(char *)dentp < bp->b_data + on + n;
sys/msdosfs/msdosfs_vnops.c
502
uint32_t n, diff, size, on;
sys/msdosfs/msdosfs_vnops.c
523
n = ulmin(pmp->pm_bpcluster - on, uio->uio_resid);
sys/msdosfs/msdosfs_vnops.c
531
if (diff < n)
sys/msdosfs/msdosfs_vnops.c
532
n = diff;
sys/msdosfs/msdosfs_vnops.c
551
n = min(n, pmp->pm_bpcluster - bp->b_resid);
sys/msdosfs/msdosfs_vnops.c
556
error = uiomove(bp->b_data + on, n, uio);
sys/msdosfs/msdosfs_vnops.c
558
} while (error == 0 && uio->uio_resid > 0 && n != 0);
sys/msdosfs/msdosfs_vnops.c
571
uint32_t n, croffset;
sys/msdosfs/msdosfs_vnops.c
699
n = ulmin(uio->uio_resid, pmp->pm_bpcluster - croffset);
sys/msdosfs/msdosfs_vnops.c
700
if (uio->uio_offset + n > dep->de_FileSize) {
sys/msdosfs/msdosfs_vnops.c
701
dep->de_FileSize = uio->uio_offset + n;
sys/msdosfs/msdosfs_vnops.c
713
error = uiomove(bp->b_data + croffset, n, uio);
sys/msdosfs/msdosfs_vnops.c
728
else if (n + croffset == pmp->pm_bpcluster)
sys/net/af_frame.c
53
af_frameattach(int n)
sys/net/bpf.c
1846
int n, error;
sys/net/bpf.c
1851
n = 0;
sys/net/bpf.c
1857
if (n >= bfl->bfl_len)
sys/net/bpf.c
1860
bfl->bfl_list + n, sizeof(u_int));
sys/net/bpf.c
1864
n++;
sys/net/bpf.c
1867
bfl->bfl_len = n;
sys/net/bpf.c
362
bpfilterattach(int n)
sys/net/bpf.c
821
int n;
sys/net/bpf.c
824
n = d->bd_slen;
sys/net/bpf.c
826
n += d->bd_hlen;
sys/net/bpf.c
829
*(int *)addr = n;
sys/net/bridgectl.c
323
struct bridge_rtnode *n, *p;
sys/net/bridgectl.c
331
n = LIST_FIRST(&sc->sc_rts[i]);
sys/net/bridgectl.c
332
while (n != NULL) {
sys/net/bridgectl.c
333
if ((n->brt_flags & IFBAF_TYPEMASK) == IFBAF_STATIC) {
sys/net/bridgectl.c
334
n->brt_age = !n->brt_age;
sys/net/bridgectl.c
335
if (n->brt_age)
sys/net/bridgectl.c
336
n->brt_age = 0;
sys/net/bridgectl.c
337
n = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
338
} else if (n->brt_age) {
sys/net/bridgectl.c
339
n->brt_age = 0;
sys/net/bridgectl.c
340
n = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
342
p = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
343
LIST_REMOVE(n, brt_next);
sys/net/bridgectl.c
345
free(n, M_DEVBUF, sizeof *n);
sys/net/bridgectl.c
346
n = p;
sys/net/bridgectl.c
360
struct bridge_rtnode *n;
sys/net/bridgectl.c
378
LIST_FOREACH(n, &sc->sc_rts[i], brt_next) {
sys/net/bridgectl.c
380
if (n->brt_ifidx == ifp->if_index &&
sys/net/bridgectl.c
381
n->brt_age > getuptime() + age &&
sys/net/bridgectl.c
382
(n->brt_flags & IFBAF_TYPEMASK) == IFBAF_DYNAMIC)
sys/net/bridgectl.c
383
n->brt_age = getuptime() + age;
sys/net/bridgectl.c
399
struct bridge_rtnode *p, *n;
sys/net/bridgectl.c
403
n = LIST_FIRST(&sc->sc_rts[i]);
sys/net/bridgectl.c
404
while (n != NULL) {
sys/net/bridgectl.c
406
(n->brt_flags & IFBAF_TYPEMASK) == IFBAF_DYNAMIC) {
sys/net/bridgectl.c
407
p = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
408
LIST_REMOVE(n, brt_next);
sys/net/bridgectl.c
410
free(n, M_DEVBUF, sizeof *n);
sys/net/bridgectl.c
411
n = p;
sys/net/bridgectl.c
413
n = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
451
struct bridge_rtnode *n, *p;
sys/net/bridgectl.c
459
n = LIST_FIRST(&sc->sc_rts[i]);
sys/net/bridgectl.c
460
while (n != NULL) {
sys/net/bridgectl.c
461
if (n->brt_ifidx != ifp->if_index) {
sys/net/bridgectl.c
463
n = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
467
(n->brt_flags & IFBAF_TYPEMASK) != IFBAF_DYNAMIC) {
sys/net/bridgectl.c
469
n = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
472
p = LIST_NEXT(n, brt_next);
sys/net/bridgectl.c
473
LIST_REMOVE(n, brt_next);
sys/net/bridgectl.c
475
free(n, M_DEVBUF, sizeof *n);
sys/net/bridgectl.c
476
n = p;
sys/net/bridgectl.c
489
struct bridge_rtnode *n;
sys/net/bridgectl.c
495
LIST_FOREACH(n, &sc->sc_rts[k], brt_next)
sys/net/bridgectl.c
512
LIST_FOREACH(n, &sc->sc_rts[k], brt_next) {
sys/net/bridgectl.c
521
ifp = if_get(n->brt_ifidx);
sys/net/bridgectl.c
530
bcopy(&n->brt_addr, &bareq->ifba_dst,
sys/net/bridgectl.c
532
bridge_copyaddr(&n->brt_tunnel.brtag_peer.sa,
sys/net/bridgectl.c
534
bareq->ifba_age = n->brt_age;
sys/net/bridgectl.c
535
bareq->ifba_flags = n->brt_flags;
sys/net/bridgectl.c
594
struct brl_node *n;
sys/net/bridgectl.c
599
SIMPLEQ_FOREACH(n, &bif->bif_brlin, brl_next) {
sys/net/bridgectl.c
602
SIMPLEQ_FOREACH(n, &bif->bif_brlout, brl_next) {
sys/net/bridgectl.c
615
SIMPLEQ_FOREACH(n, &bif->bif_brlin, brl_next) {
sys/net/bridgectl.c
621
req->ifbr_action = n->brl_action;
sys/net/bridgectl.c
622
req->ifbr_flags = n->brl_flags;
sys/net/bridgectl.c
623
req->ifbr_src = n->brl_src;
sys/net/bridgectl.c
624
req->ifbr_dst = n->brl_dst;
sys/net/bridgectl.c
625
req->ifbr_arpf = n->brl_arpf;
sys/net/bridgectl.c
628
if (n->brl_tag)
sys/net/bridgectl.c
629
pf_tag2tagname(n->brl_tag, req->ifbr_tagname);
sys/net/bridgectl.c
634
SIMPLEQ_FOREACH(n, &bif->bif_brlout, brl_next) {
sys/net/bridgectl.c
640
req->ifbr_action = n->brl_action;
sys/net/bridgectl.c
641
req->ifbr_flags = n->brl_flags;
sys/net/bridgectl.c
642
req->ifbr_src = n->brl_src;
sys/net/bridgectl.c
643
req->ifbr_dst = n->brl_dst;
sys/net/bridgectl.c
644
req->ifbr_arpf = n->brl_arpf;
sys/net/bridgectl.c
647
if (n->brl_tag)
sys/net/bridgectl.c
648
pf_tag2tagname(n->brl_tag, req->ifbr_tagname);
sys/net/bridgectl.c
661
bridge_arpfilter(struct brl_node *n, struct ether_header *eh, struct mbuf *m)
sys/net/bridgectl.c
665
if (!(n->brl_arpf.brla_flags & (BRLA_ARP|BRLA_RARP)))
sys/net/bridgectl.c
679
if ((n->brl_arpf.brla_flags & BRLA_ARP) &&
sys/net/bridgectl.c
683
if ((n->brl_arpf.brla_flags & BRLA_RARP) &&
sys/net/bridgectl.c
687
if (n->brl_arpf.brla_op && ntohs(ea.arp_op) != n->brl_arpf.brla_op)
sys/net/bridgectl.c
689
if (n->brl_arpf.brla_flags & BRLA_SHA &&
sys/net/bridgectl.c
690
memcmp(ea.arp_sha, &n->brl_arpf.brla_sha, ETHER_ADDR_LEN))
sys/net/bridgectl.c
692
if (n->brl_arpf.brla_flags & BRLA_THA &&
sys/net/bridgectl.c
693
memcmp(ea.arp_tha, &n->brl_arpf.brla_tha, ETHER_ADDR_LEN))
sys/net/bridgectl.c
695
if (n->brl_arpf.brla_flags & BRLA_SPA &&
sys/net/bridgectl.c
696
memcmp(ea.arp_spa, &n->brl_arpf.brla_spa, sizeof(struct in_addr)))
sys/net/bridgectl.c
698
if (n->brl_arpf.brla_flags & BRLA_TPA &&
sys/net/bridgectl.c
699
memcmp(ea.arp_tpa, &n->brl_arpf.brla_tpa, sizeof(struct in_addr)))
sys/net/bridgectl.c
708
struct brl_node *n;
sys/net/bridgectl.c
715
SIMPLEQ_FOREACH(n, h, brl_next) {
sys/net/bridgectl.c
716
if (!bridge_arpfilter(n, eh, m))
sys/net/bridgectl.c
718
flags = n->brl_flags & (BRL_FLAG_SRCVALID|BRL_FLAG_DSTVALID);
sys/net/bridgectl.c
722
if (memcmp(eh->ether_shost, &n->brl_src,
sys/net/bridgectl.c
725
if (memcmp(eh->ether_dhost, &n->brl_dst,
sys/net/bridgectl.c
731
if (memcmp(eh->ether_shost, &n->brl_src,
sys/net/bridgectl.c
737
if (memcmp(eh->ether_dhost, &n->brl_dst,
sys/net/bridgectl.c
748
pf_tag_packet(m, n->brl_tag, -1);
sys/net/bridgectl.c
750
action = n->brl_action;
sys/net/bridgectl.c
758
struct brl_node *n;
sys/net/bridgectl.c
760
n = malloc(sizeof(*n), M_DEVBUF, M_NOWAIT);
sys/net/bridgectl.c
761
if (n == NULL)
sys/net/bridgectl.c
763
bcopy(&req->ifbr_src, &n->brl_src, sizeof(struct ether_addr));
sys/net/bridgectl.c
764
bcopy(&req->ifbr_dst, &n->brl_dst, sizeof(struct ether_addr));
sys/net/bridgectl.c
765
n->brl_action = req->ifbr_action;
sys/net/bridgectl.c
766
n->brl_flags = req->ifbr_flags;
sys/net/bridgectl.c
767
n->brl_arpf = req->ifbr_arpf;
sys/net/bridgectl.c
770
n->brl_tag = pf_tagname2tag(req->ifbr_tagname, 1);
sys/net/bridgectl.c
772
n->brl_tag = 0;
sys/net/bridgectl.c
778
n->brl_flags &= ~BRL_FLAG_IN;
sys/net/bridgectl.c
779
n->brl_flags |= BRL_FLAG_OUT;
sys/net/bridgectl.c
780
SIMPLEQ_INSERT_TAIL(&bif->bif_brlout, n, brl_next);
sys/net/bridgectl.c
782
n->brl_flags &= ~BRL_FLAG_OUT;
sys/net/bridgectl.c
783
n->brl_flags |= BRL_FLAG_IN;
sys/net/bridgectl.c
784
SIMPLEQ_INSERT_TAIL(&bif->bif_brlin, n, brl_next);
sys/net/fq_codel.c
493
struct mbuf *n;
sys/net/fq_codel.c
495
n = ml_dequeue(&cd->q);
sys/net/fq_codel.c
497
KASSERT(n == m);
sys/net/fq_codel.c
498
KASSERT(n != NULL);
sys/net/fq_codel.c
499
KASSERT(cd->backlog >= n->m_pkthdr.len);
sys/net/fq_codel.c
500
cd->backlog -= n->m_pkthdr.len;
sys/net/fq_codel.c
501
return (n);
sys/net/if.c
1135
int n, t = 0;
sys/net/if.c
1139
while ((n = netisr) != 0) {
sys/net/if.c
1147
atomic_clearbits_int(&netisr, n);
sys/net/if.c
1150
if (n & (1 << NETISR_ARP))
sys/net/if.c
1153
if (n & (1 << NETISR_IP))
sys/net/if.c
1156
if (n & (1 << NETISR_IPV6))
sys/net/if.c
1160
if (n & (1 << NETISR_PPP)) {
sys/net/if.c
1167
if (n & (1 << NETISR_BRIDGE))
sys/net/if.c
1171
if (n & (1 << NETISR_PPPOE)) {
sys/net/if.c
1177
t |= n;
sys/net/if.c
3738
u_int n;
sys/net/if.c
3744
n = min(t, kifri.ifri_total);
sys/net/if.c
3747
if (n > 0) {
sys/net/if.c
3748
error = copyout(e, kifri.ifri_entries, sizeof(*e) * n);
sys/net/if_bpe.c
743
struct mbuf *n;
sys/net/if_bpe.c
777
n = m_getptr(m, sizeof(*ceh), &off);
sys/net/if_bpe.c
778
if (n == NULL) {
sys/net/if_bpe.c
783
if (!ALIGNED_POINTER(mtod(n, caddr_t) + off, uint32_t)) {
sys/net/if_bpe.c
785
n = m_dup_pkt(m, ETHER_ALIGN, M_NOWAIT);
sys/net/if_bpe.c
787
if (n == NULL)
sys/net/if_bpe.c
790
m = n;
sys/net/if_bridge.c
161
bridgeattach(int n)
sys/net/if_bridge.c
1945
struct ether_header *eh, struct mbuf *n, int hassnap, struct llc *llc,
sys/net/if_bridge.c
1955
n2 = m_copym(n, 0, M_COPYALL, M_DONTWAIT);
sys/net/if_bridge.c
1957
m_freem(n);
sys/net/if_bridge.c
1960
m = icmp_do_error(n, type, code, 0, mtu);
sys/net/if_bridge.c
1966
n = n2;
sys/net/if_bridge.c
2008
m_freem(n);
sys/net/if_bridge.c
2012
m_freem(n);
sys/net/if_gre.c
1170
struct mbuf *n;
sys/net/if_gre.c
1192
n = m_getptr(m, hlen, &off);
sys/net/if_gre.c
1193
if (n == NULL)
sys/net/if_gre.c
1195
if (n->m_data[off] >> 4 != IPVERSION)
sys/net/if_gre.c
1480
struct mbuf *n;
sys/net/if_gre.c
1494
n = m_getptr(m, sizeof(struct ether_header), &off);
sys/net/if_gre.c
1495
if (n == NULL) {
sys/net/if_gre.c
1500
if (!ALIGNED_POINTER(mtod(n, caddr_t) + off, uint32_t)) {
sys/net/if_gre.c
1501
n = m_dup_pkt(m, ETHER_ALIGN, M_NOWAIT);
sys/net/if_gre.c
1503
if (n == NULL)
sys/net/if_gre.c
1505
m = n;
sys/net/if_gre.c
1847
struct mbuf *n;
sys/net/if_gre.c
1850
n = m_getptr(m, ifp->if_hdrlen, &off);
sys/net/if_gre.c
1851
KASSERT(n != NULL);
sys/net/if_gre.c
1854
mh.mh_next = n->m_next;
sys/net/if_gre.c
1855
mh.mh_len = n->m_len - off;
sys/net/if_gre.c
1856
mh.mh_data = n->m_data + off;
sys/net/if_gre.c
627
greattach(int n)
sys/net/if_loop.c
144
loopattach(int n)
sys/net/if_mpe.c
443
struct mbuf *n;
sys/net/if_mpe.c
459
n = m;
sys/net/if_mpe.c
460
while (n->m_len == 0) {
sys/net/if_mpe.c
461
n = n->m_next;
sys/net/if_mpe.c
462
if (n == NULL)
sys/net/if_mpe.c
466
switch (*mtod(n, uint8_t *) >> 4) {
sys/net/if_mpip.c
246
struct mpip_neighbor *n, *o;
sys/net/if_mpip.c
287
n = malloc(sizeof(*n), M_DEVBUF, M_WAITOK|M_CANFAIL|M_ZERO);
sys/net/if_mpip.c
288
if (n == NULL)
sys/net/if_mpip.c
291
n->n_rshim.shim_label = MPLS_LABEL2SHIM(label);
sys/net/if_mpip.c
292
n->n_nexthop = req->addr;
sys/net/if_mpip.c
295
sc->sc_neighbor = n;
sys/net/if_mpip.c
310
struct mpip_neighbor *n = sc->sc_neighbor;
sys/net/if_mpip.c
312
if (n == NULL)
sys/net/if_mpip.c
317
smpls->smpls_label = MPLS_SHIM2LABEL(n->n_rshim.shim_label);
sys/net/if_mpip.c
318
req->addr = n->n_nexthop;
sys/net/if_mpip.c
474
struct mbuf *n;
sys/net/if_mpip.c
547
n = m;
sys/net/if_mpip.c
548
while (n->m_len == 0) {
sys/net/if_mpip.c
549
n = n->m_next;
sys/net/if_mpip.c
550
if (n == NULL)
sys/net/if_mpip.c
554
switch (*mtod(n, uint8_t *) >> 4) {
sys/net/if_mpip.c
670
struct mpip_neighbor *n = sc->sc_neighbor;
sys/net/if_mpip.c
683
if (!ISSET(ifp->if_flags, IFF_RUNNING) || n == NULL) {
sys/net/if_mpip.c
688
rt = rtalloc(sstosa(&n->n_nexthop), RT_RESOLVE, sc->sc_rdomain);
sys/net/if_mpip.c
800
shim |= n->n_rshim.shim_label;
sys/net/if_mpip.c
84
mpipattach(int n)
sys/net/if_mpw.c
193
struct mpw_neighbor *n, *o;
sys/net/if_mpw.c
239
n = malloc(sizeof(*n), M_DEVBUF, M_WAITOK|M_CANFAIL|M_ZERO);
sys/net/if_mpw.c
240
if (n == NULL)
sys/net/if_mpw.c
243
n->n_rshim.shim_label = MPLS_LABEL2SHIM(label);
sys/net/if_mpw.c
244
n->n_nexthop = *ss;
sys/net/if_mpw.c
247
sc->sc_neighbor = n;
sys/net/if_mpw.c
262
struct mpw_neighbor *n = sc->sc_neighbor;
sys/net/if_mpw.c
264
if (n == NULL)
sys/net/if_mpw.c
269
smpls->smpls_label = MPLS_SHIM2LABEL(n->n_rshim.shim_label);
sys/net/if_mpw.c
271
req->addr = n->n_nexthop;
sys/net/if_mpw.c
521
struct mbuf *n;
sys/net/if_mpw.c
594
n = m_getptr(m, sizeof(struct ether_header), &off);
sys/net/if_mpw.c
595
if (n == NULL) {
sys/net/if_mpw.c
599
if (!ALIGNED_POINTER(mtod(n, caddr_t) + off, uint32_t)) {
sys/net/if_mpw.c
600
n = m_dup_pkt(m, ETHER_ALIGN, M_NOWAIT);
sys/net/if_mpw.c
603
if (n == NULL)
sys/net/if_mpw.c
605
m = n;
sys/net/if_mpw.c
647
struct mpw_neighbor *n;
sys/net/if_mpw.c
656
n = sc->sc_neighbor;
sys/net/if_mpw.c
658
n == NULL) {
sys/net/if_mpw.c
663
rt = rtalloc(sstosa(&n->n_nexthop), RT_RESOLVE, sc->sc_rdomain);
sys/net/if_mpw.c
738
shim->shim_label |= n->n_rshim.shim_label | exp | bos;
sys/net/if_mpw.c
77
mpwattach(int n)
sys/net/if_pppoe.c
1565
struct mbuf *n;
sys/net/if_pppoe.c
1568
n = m_getptr(m, PPPOE_OVERHEAD, &off);
sys/net/if_pppoe.c
1569
KASSERT(n != NULL);
sys/net/if_pppoe.c
1572
mh.mh_next = n->m_next;
sys/net/if_pppoe.c
1573
mh.mh_len = n->m_len - off;
sys/net/if_pppoe.c
1574
mh.mh_data = n->m_data + off;
sys/net/if_pppoe.c
412
struct mbuf *n;
sys/net/if_pppoe.c
451
n = m_pulldown(m, off, sizeof(*ph), &noff);
sys/net/if_pppoe.c
452
if (n == NULL) {
sys/net/if_pppoe.c
457
ph = (struct pppoehdr *)(mtod(n, caddr_t) + noff);
sys/net/if_pppoe.c
481
n = m_pulldown(m, off, sizeof(*pt), &noff);
sys/net/if_pppoe.c
482
if (n == NULL) {
sys/net/if_pppoe.c
487
pt = (struct pppoetag *)(mtod(n, caddr_t) + noff);
sys/net/if_pppoe.c
506
n = m_pulldown(m, off, len, &noff);
sys/net/if_pppoe.c
507
if (n == NULL) {
sys/net/if_pppoe.c
512
sc = pppoe_find_softc_by_hunique(mtod(n, caddr_t) + noff,
sys/net/if_pppoe.c
519
n = m_pulldown(m, off, len,
sys/net/if_pppoe.c
521
if (n == NULL) {
sys/net/if_pppoe.c
526
ac_cookie = mtod(n, caddr_t) + noff;
sys/net/if_pppoe.c
532
n = m_pulldown(m, off, len,
sys/net/if_pppoe.c
534
if (n == NULL) {
sys/net/if_pppoe.c
539
relay_sid = mtod(n, caddr_t) + noff;
sys/net/if_pppoe.c
545
n = m_pulldown(m, off, len,
sys/net/if_pppoe.c
547
if (n == NULL || len != sizeof(max_payload)) {
sys/net/if_pppoe.c
552
memcpy(&max_payload, mtod(n, caddr_t) + noff,
sys/net/if_pppoe.c
573
n = m_pulldown(m, off, len,
sys/net/if_pppoe.c
575
if (n == NULL) {
sys/net/if_pppoe.c
578
u_int8_t *et = mtod(n, caddr_t) + noff;
sys/net/if_pppx.c
1020
pppacattach(int n)
sys/net/if_pppx.c
236
pppxattach(int n)
sys/net/if_sec.c
117
secattach(int n)
sys/net/if_tpmr.c
638
int i = 0, total = nitems(sc->sc_ports), n = 0, error = 0;
sys/net/if_tpmr.c
643
n = total;
sys/net/if_tpmr.c
662
if ((error = copyout(&breq, bifc->ifbic_req + n,
sys/net/if_tpmr.c
667
n++;
sys/net/if_tpmr.c
671
bifc->ifbic_len = n * sizeof(breq);
sys/net/if_tun.c
1031
n = m_get(M_DONTWAIT, MT_DATA);
sys/net/if_tun.c
1032
if (n == NULL) {
sys/net/if_tun.c
1040
m->m_next = n;
sys/net/if_tun.c
1041
m = n;
sys/net/if_tun.c
171
tunattach(int n)
sys/net/if_tun.c
924
struct mbuf *m0, *m, *n;
sys/net/if_veb.c
282
veb_ports_size(unsigned int n)
sys/net/if_veb.c
2853
int n = 0, error = 0;
sys/net/if_veb.c
286
n * sizeof(struct veb_port *);
sys/net/if_veb.c
2861
n += m->m_count;
sys/net/if_veb.c
2864
n += m->m_count;
sys/net/if_veb.c
2888
if ((error = copyout(&breq, bifc->ifbic_req + n,
sys/net/if_veb.c
2893
n++;
sys/net/if_veb.c
2913
if ((error = copyout(&breq, bifc->ifbic_req + n,
sys/net/if_veb.c
2918
n++;
sys/net/if_veb.c
2923
bifc->ifbic_len = n * sizeof(breq);
sys/net/if_vxlan.c
614
struct mbuf *n;
sys/net/if_vxlan.c
683
n = m_getptr(m, sizeof(*eh), &off);
sys/net/if_vxlan.c
684
if (n == NULL)
sys/net/if_vxlan.c
687
if (!ALIGNED_POINTER(mtod(n, caddr_t) + off, uint32_t)) {
sys/net/if_vxlan.c
688
n = m_dup_pkt(m, ETHER_ALIGN, M_NOWAIT);
sys/net/if_vxlan.c
690
if (n == NULL)
sys/net/if_vxlan.c
692
m = n;
sys/net/if_wg.c
96
#define WG_PKT_WITH_PADDING(n) (((n) + (16-1)) & (~(16-1)))
sys/net/ifq.c
947
struct mbuf *n = NULL;
sys/net/ifq.c
958
n = ml_dequeue(pl);
sys/net/ifq.c
973
return (n);
sys/net/pf.c
1686
int n = 0;
sys/net/pf.c
1715
if (ntohl(sp->rule) == n++)
sys/net/pf.c
2778
const u_int16_t *n = an->addr16;
sys/net/pf.c
2784
x = *cksum + o[0] + NEG(n[0]) + o[1] + NEG(n[1]);
sys/net/pf.c
2788
x = *cksum + o[0] + NEG(n[0]) + o[1] + NEG(n[1]) +\
sys/net/pf.c
2789
o[2] + NEG(n[2]) + o[3] + NEG(n[3]) +\
sys/net/pf.c
2790
o[4] + NEG(n[4]) + o[5] + NEG(n[5]) +\
sys/net/pf.c
2791
o[6] + NEG(n[6]) + o[7] + NEG(n[7]);
sys/net/pf.c
3278
struct mbuf *n = NULL;
sys/net/pf.c
3289
if ((n = m_split(m, ipoff2, M_DONTWAIT)) == NULL)
sys/net/pf.c
3298
pf_cksum_uncover(pd->pcksum, in_cksum(n, ohlen), pd->proto);
sys/net/pf.c
3299
m_adj(n, ohlen);
sys/net/pf.c
3302
if ((M_PREPEND(n, hlen, M_DONTWAIT)) == NULL)
sys/net/pf.c
3307
ip4 = mtod(n, struct ip *);
sys/net/pf.c
3321
in_hdr_cksum_out(n, NULL);
sys/net/pf.c
3324
ip6 = mtod(n, struct ip6_hdr *);
sys/net/pf.c
3344
pf_cksum_cover(pd->pcksum, in_cksum(n, hlen), pd->proto);
sys/net/pf.c
3349
int nlen = n->m_pkthdr.len;
sys/net/pf.c
3350
m_cat(m, n);
sys/net/pf.c
3815
pf_match_addr(u_int8_t n, struct pf_addr *a, struct pf_addr *m,
sys/net/pf.c
3822
return (n == 0);
sys/net/pf.c
3834
return (n == 0);
sys/net/pf.c
3839
return (n != 0);
sys/net/pf_if.c
787
int n = 0;
sys/net/pf_if.c
792
if (*size <= ++n)
sys/net/pf_if.c
798
*size = n;
sys/net/pf_if.c
805
int n;
sys/net/pf_if.c
813
n = strlen(filter);
sys/net/pf_if.c
814
if (n < 1 || n >= IFNAMSIZ)
sys/net/pf_if.c
816
if (filter[n-1] >= '0' && filter[n-1] <= '9')
sys/net/pf_if.c
829
size_t n;
sys/net/pf_if.c
836
n = strlen(name);
sys/net/pf_if.c
837
if (n < 1 || n >= IFNAMSIZ)
sys/net/pf_if.c
909
size_t n;
sys/net/pf_if.c
915
n = strlen(p->pfik_name);
sys/net/pf_ioctl.c
3745
struct pf_src_node *n, *p, *pstore;
sys/net/pf_ioctl.c
3754
RB_FOREACH(n, pf_src_tree, &tree_src_tracking)
sys/net/pf_ioctl.c
3764
RB_FOREACH(n, pf_src_tree, &tree_src_tracking) {
sys/net/pf_ioctl.c
3770
memcpy(pstore, n, sizeof(*pstore));
sys/net/pf_ioctl.c
3774
pstore->rule.nr = n->rule.ptr->nr;
sys/net/pf_ioctl.c
3782
diff = secs - n->conn_rate.last;
sys/net/pf_ioctl.c
3783
if (diff >= n->conn_rate.seconds)
sys/net/pf_ioctl.c
3787
n->conn_rate.count * diff /
sys/net/pf_ioctl.c
3788
n->conn_rate.seconds;
sys/net/pf_ioctl.c
3809
struct pf_src_node *n;
sys/net/pf_ioctl.c
3818
RB_FOREACH(n, pf_src_tree, &tree_src_tracking)
sys/net/pf_ioctl.c
3819
n->expire = 1;
sys/net/pf_table.c
1113
int rv, n = 0;
sys/net/pf_table.c
1124
++n;
sys/net/pf_table.c
1130
kt->pfrkt_cnt += n;
sys/net/pf_table.c
1185
int n = 0;
sys/net/pf_table.c
1189
++n;
sys/net/pf_table.c
1194
kt->pfrkt_cnt -= n;
sys/net/pf_table.c
1517
struct pfr_ktable *p, *q, *r, *n, *w, key;
sys/net/pf_table.c
1579
SLIST_FOREACH_SAFE(n, &auxq, pfrkt_workq, w) {
sys/net/pf_table.c
1580
p = RB_FIND(pfr_ktablehead, &pfr_ktables, n);
sys/net/pf_table.c
1582
SLIST_REMOVE(&auxq, n, pfr_ktable, pfrkt_workq);
sys/net/pf_table.c
1583
SLIST_INSERT_HEAD(&addq, n, pfrkt_workq);
sys/net/pf_table.c
1589
(n->pfrkt_flags & PFR_TFLAG_USRMASK) |
sys/net/pf_table.c
1723
int n, nn;
sys/net/pf_table.c
1728
n = nn = pfr_table_count(filter, flags);
sys/net/pf_table.c
1729
if (n < 0)
sys/net/pf_table.c
1731
if (n > *size) {
sys/net/pf_table.c
1732
*size = n;
sys/net/pf_table.c
1738
if (n-- <= 0)
sys/net/pf_table.c
1743
if (n) {
sys/net/pf_table.c
1745
"pfr_get_tables: corruption detected (%d).", n);
sys/net/pf_table.c
1758
int n, nn;
sys/net/pf_table.c
1765
n = nn = pfr_table_count(filter, flags);
sys/net/pf_table.c
1766
if (n < 0)
sys/net/pf_table.c
1768
if (n > *size) {
sys/net/pf_table.c
1769
*size = n;
sys/net/pf_table.c
1776
if (n-- <= 0)
sys/net/pf_table.c
1785
if (n) {
sys/net/pf_table.c
1787
"pfr_get_tstats: corruption detected (%d).", n);
sys/net/pf_table.c
214
pfr_gcd(int m, int n)
sys/net/pf_table.c
219
t = n % m;
sys/net/pf_table.c
220
n = m;
sys/net/pf_table.c
223
return (n);
sys/net/pfvar.h
234
#define DPFPRINTF(n, format, x...) \
sys/net/pfvar.h
236
if (pf_status.debug >= (n)) { \
sys/net/pfvar.h
237
log(n, PF_DEBUGNAME); \
sys/net/pfvar.h
244
#define DPFPRINTF(n, format, x...) \
sys/net/pfvar.h
250
#define DPFPRINTF(n, format, x...) ((void)0)
sys/net/pipex.c
2479
int pktloss, encrypt, flushed, m, n, len;
sys/net/pipex.c
2564
n = coher_cnt / 256;
sys/net/pipex.c
2565
while (m++ < n)
sys/net/pipex.c
897
struct mbuf *n;
sys/net/pipex.c
943
n = m_dup_pkt(m0, 0, M_NOWAIT);
sys/net/pipex.c
944
if (n == NULL)
sys/net/pipex.c
947
m0 = n;
sys/net/ppp-comp.h
144
#define BSD_MAKE_OPT(v, n) (((v) << 5) | (n))
sys/net/ppp_tty.c
493
int n, ndone, done, idle;
sys/net/ppp_tty.c
541
n = cp - start;
sys/net/ppp_tty.c
542
if (n) {
sys/net/ppp_tty.c
544
ndone = n - b_to_q(start, n, &tp->t_outq);
sys/net/ppp_tty.c
549
if (ndone < n)
sys/net/radix.c
158
caddr_t n = n_arg;
sys/net/radix.c
163
lim2 = lim = n + *(u_char *)n;
sys/net/radix.c
164
longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
sys/net/radix.c
167
while (n < lim) {
sys/net/radix.c
168
if (*n & ~(*m))
sys/net/radix.c
170
if (*n++ != *m++)
sys/net/radix.c
173
while (n < lim2)
sys/net/radix.c
174
if (*n++)
sys/net/rtsock.c
1411
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
sys/net/slcompress.c
117
#define ENCODE(n) { \
sys/net/slcompress.c
118
if ((u_int16_t)(n) >= 256) { \
sys/net/slcompress.c
120
cp[1] = (n); \
sys/net/slcompress.c
121
cp[0] = (n) >> 8; \
sys/net/slcompress.c
124
*cp++ = (n); \
sys/net/slcompress.c
127
#define ENCODEZ(n) { \
sys/net/slcompress.c
128
if ((u_int16_t)(n) >= 256 || (u_int16_t)(n) == 0) { \
sys/net/slcompress.c
130
cp[1] = (n); \
sys/net/slcompress.c
131
cp[0] = (n) >> 8; \
sys/net/slcompress.c
134
*cp++ = (n); \
sys/net/slcompress.c
59
#define BCMP(p1, p2, n) bcmp((char *)(p1), (char *)(p2), (int)(n))
sys/net/slcompress.c
60
#define BCOPY(p1, p2, n) bcopy((char *)(p1), (char *)(p2), (int)(n))
sys/net80211/ieee80211.h
789
#define IEEE80211_VHT_MCS_FOR_SS_MASK(n) (0x3 << (2*((n)-1)))
sys/net80211/ieee80211.h
790
#define IEEE80211_VHT_MCS_FOR_SS_SHIFT(n) (2*((n)-1))
sys/net80211/ieee80211.h
858
#define IEEE80211_HE_MCS_FOR_SS_MASK(n) (0x3 << (2 * ((n) - 1)))
sys/net80211/ieee80211.h
859
#define IEEE80211_HE_MCS_FOR_SS_SHIFT(n) (2 * ((n) - 1))
sys/net80211/ieee80211_crypto.c
538
int n;
sys/net80211/ieee80211_crypto.c
549
for (n = 31; n >= 0 && ++ic->ic_globalcnt[n] == 0; n--)
sys/net80211/ieee80211_crypto.c
565
n = (len < 16) ? 16 - len : 8 - (len & 7);
sys/net80211/ieee80211_crypto.c
567
memset(&data[len], 0, n - 1);
sys/net80211/ieee80211_crypto.c
568
len += n - 1;
sys/net80211/ieee80211_crypto_ccmp.c
174
struct mbuf *n0, *m, *n;
sys/net80211/ieee80211_crypto_ccmp.c
225
n = n0;
sys/net80211/ieee80211_crypto_ccmp.c
235
if (noff == n->m_len) {
sys/net80211/ieee80211_crypto_ccmp.c
237
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_ccmp.c
238
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_ccmp.c
240
n = n->m_next;
sys/net80211/ieee80211_crypto_ccmp.c
241
n->m_len = MLEN;
sys/net80211/ieee80211_crypto_ccmp.c
243
MCLGET(n, M_DONTWAIT);
sys/net80211/ieee80211_crypto_ccmp.c
244
if (n->m_flags & M_EXT)
sys/net80211/ieee80211_crypto_ccmp.c
245
n->m_len = n->m_ext.ext_size;
sys/net80211/ieee80211_crypto_ccmp.c
247
if (n->m_len > left)
sys/net80211/ieee80211_crypto_ccmp.c
248
n->m_len = left;
sys/net80211/ieee80211_crypto_ccmp.c
251
len = min(m->m_len - moff, n->m_len - noff);
sys/net80211/ieee80211_crypto_ccmp.c
254
dst = mtod(n, u_int8_t *) + noff;
sys/net80211/ieee80211_crypto_ccmp.c
280
if (m_trailingspace(n) < IEEE80211_CCMP_MICLEN) {
sys/net80211/ieee80211_crypto_ccmp.c
281
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_ccmp.c
282
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_ccmp.c
284
n = n->m_next;
sys/net80211/ieee80211_crypto_ccmp.c
285
n->m_len = 0;
sys/net80211/ieee80211_crypto_ccmp.c
288
mic = mtod(n, u_int8_t *) + n->m_len;
sys/net80211/ieee80211_crypto_ccmp.c
291
n->m_len += IEEE80211_CCMP_MICLEN;
sys/net80211/ieee80211_crypto_ccmp.c
353
struct mbuf *n0, *m, *n;
sys/net80211/ieee80211_crypto_ccmp.c
414
n = n0;
sys/net80211/ieee80211_crypto_ccmp.c
424
if (noff == n->m_len) {
sys/net80211/ieee80211_crypto_ccmp.c
426
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_ccmp.c
427
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_ccmp.c
429
n = n->m_next;
sys/net80211/ieee80211_crypto_ccmp.c
430
n->m_len = MLEN;
sys/net80211/ieee80211_crypto_ccmp.c
432
MCLGET(n, M_DONTWAIT);
sys/net80211/ieee80211_crypto_ccmp.c
433
if (n->m_flags & M_EXT)
sys/net80211/ieee80211_crypto_ccmp.c
434
n->m_len = n->m_ext.ext_size;
sys/net80211/ieee80211_crypto_ccmp.c
436
if (n->m_len > left)
sys/net80211/ieee80211_crypto_ccmp.c
437
n->m_len = left;
sys/net80211/ieee80211_crypto_ccmp.c
440
len = min(m->m_len - moff, n->m_len - noff);
sys/net80211/ieee80211_crypto_ccmp.c
443
dst = mtod(n, u_int8_t *) + noff;
sys/net80211/ieee80211_crypto_tkip.c
192
struct mbuf *n0, *m, *n;
sys/net80211/ieee80211_crypto_tkip.c
241
n = n0;
sys/net80211/ieee80211_crypto_tkip.c
252
if (noff == n->m_len) {
sys/net80211/ieee80211_crypto_tkip.c
254
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_tkip.c
255
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_tkip.c
257
n = n->m_next;
sys/net80211/ieee80211_crypto_tkip.c
258
n->m_len = MLEN;
sys/net80211/ieee80211_crypto_tkip.c
260
MCLGET(n, M_DONTWAIT);
sys/net80211/ieee80211_crypto_tkip.c
261
if (n->m_flags & M_EXT)
sys/net80211/ieee80211_crypto_tkip.c
262
n->m_len = n->m_ext.ext_size;
sys/net80211/ieee80211_crypto_tkip.c
264
if (n->m_len > left)
sys/net80211/ieee80211_crypto_tkip.c
265
n->m_len = left;
sys/net80211/ieee80211_crypto_tkip.c
268
len = min(m->m_len - moff, n->m_len - noff);
sys/net80211/ieee80211_crypto_tkip.c
272
mtod(n, caddr_t) + noff, len);
sys/net80211/ieee80211_crypto_tkip.c
280
if (m_trailingspace(n) < IEEE80211_TKIP_TAILLEN) {
sys/net80211/ieee80211_crypto_tkip.c
281
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_tkip.c
282
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_tkip.c
284
n = n->m_next;
sys/net80211/ieee80211_crypto_tkip.c
285
n->m_len = 0;
sys/net80211/ieee80211_crypto_tkip.c
289
mic = mtod(n, caddr_t) + n->m_len;
sys/net80211/ieee80211_crypto_tkip.c
293
n->m_len += IEEE80211_TKIP_MICLEN;
sys/net80211/ieee80211_crypto_tkip.c
296
icvp = mtod(n, caddr_t) + n->m_len;
sys/net80211/ieee80211_crypto_tkip.c
303
n->m_len += IEEE80211_WEP_CRCLEN;
sys/net80211/ieee80211_crypto_tkip.c
364
struct mbuf *n0, *m, *n;
sys/net80211/ieee80211_crypto_tkip.c
422
n = n0;
sys/net80211/ieee80211_crypto_tkip.c
433
if (noff == n->m_len) {
sys/net80211/ieee80211_crypto_tkip.c
435
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_tkip.c
436
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_tkip.c
438
n = n->m_next;
sys/net80211/ieee80211_crypto_tkip.c
439
n->m_len = MLEN;
sys/net80211/ieee80211_crypto_tkip.c
441
MCLGET(n, M_DONTWAIT);
sys/net80211/ieee80211_crypto_tkip.c
442
if (n->m_flags & M_EXT)
sys/net80211/ieee80211_crypto_tkip.c
443
n->m_len = n->m_ext.ext_size;
sys/net80211/ieee80211_crypto_tkip.c
445
if (n->m_len > left)
sys/net80211/ieee80211_crypto_tkip.c
446
n->m_len = left;
sys/net80211/ieee80211_crypto_tkip.c
449
len = min(m->m_len - moff, n->m_len - noff);
sys/net80211/ieee80211_crypto_tkip.c
452
mtod(n, caddr_t) + noff, len);
sys/net80211/ieee80211_crypto_tkip.c
453
crc = ether_crc32_le_update(crc, mtod(n, caddr_t) + noff, len);
sys/net80211/ieee80211_crypto_wep.c
132
n = n0;
sys/net80211/ieee80211_crypto_wep.c
143
if (noff == n->m_len) {
sys/net80211/ieee80211_crypto_wep.c
145
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_wep.c
146
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_wep.c
148
n = n->m_next;
sys/net80211/ieee80211_crypto_wep.c
149
n->m_len = MLEN;
sys/net80211/ieee80211_crypto_wep.c
151
MCLGET(n, M_DONTWAIT);
sys/net80211/ieee80211_crypto_wep.c
152
if (n->m_flags & M_EXT)
sys/net80211/ieee80211_crypto_wep.c
153
n->m_len = n->m_ext.ext_size;
sys/net80211/ieee80211_crypto_wep.c
155
if (n->m_len > left)
sys/net80211/ieee80211_crypto_wep.c
156
n->m_len = left;
sys/net80211/ieee80211_crypto_wep.c
159
len = min(m->m_len - moff, n->m_len - noff);
sys/net80211/ieee80211_crypto_wep.c
163
mtod(n, caddr_t) + noff, len);
sys/net80211/ieee80211_crypto_wep.c
171
if (m_trailingspace(n) < IEEE80211_WEP_CRCLEN) {
sys/net80211/ieee80211_crypto_wep.c
172
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_wep.c
173
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_wep.c
175
n = n->m_next;
sys/net80211/ieee80211_crypto_wep.c
176
n->m_len = 0;
sys/net80211/ieee80211_crypto_wep.c
180
icvp = mtod(n, caddr_t) + n->m_len;
sys/net80211/ieee80211_crypto_wep.c
187
n->m_len += IEEE80211_WEP_CRCLEN;
sys/net80211/ieee80211_crypto_wep.c
208
struct mbuf *n0, *m, *n;
sys/net80211/ieee80211_crypto_wep.c
248
n = n0;
sys/net80211/ieee80211_crypto_wep.c
259
if (noff == n->m_len) {
sys/net80211/ieee80211_crypto_wep.c
261
MGET(n->m_next, M_DONTWAIT, n->m_type);
sys/net80211/ieee80211_crypto_wep.c
262
if (n->m_next == NULL)
sys/net80211/ieee80211_crypto_wep.c
264
n = n->m_next;
sys/net80211/ieee80211_crypto_wep.c
265
n->m_len = MLEN;
sys/net80211/ieee80211_crypto_wep.c
267
MCLGET(n, M_DONTWAIT);
sys/net80211/ieee80211_crypto_wep.c
268
if (n->m_flags & M_EXT)
sys/net80211/ieee80211_crypto_wep.c
269
n->m_len = n->m_ext.ext_size;
sys/net80211/ieee80211_crypto_wep.c
271
if (n->m_len > left)
sys/net80211/ieee80211_crypto_wep.c
272
n->m_len = left;
sys/net80211/ieee80211_crypto_wep.c
275
len = min(m->m_len - moff, n->m_len - noff);
sys/net80211/ieee80211_crypto_wep.c
278
mtod(n, caddr_t) + noff, len);
sys/net80211/ieee80211_crypto_wep.c
279
crc = ether_crc32_le_update(crc, mtod(n, caddr_t) + noff, len);
sys/net80211/ieee80211_crypto_wep.c
87
struct mbuf *n0, *m, *n;
sys/net80211/ieee80211_input.c
1244
struct mbuf *n;
sys/net80211/ieee80211_input.c
1300
n = m_split(m, len, M_NOWAIT);
sys/net80211/ieee80211_input.c
1301
if (n == NULL) {
sys/net80211/ieee80211_input.c
1319
m = n;
sys/net80211/ieee80211_input.c
1325
while ((n = ml_dequeue(&subframes)) != NULL)
sys/net80211/ieee80211_input.c
1326
ieee80211_enqueue_data(ic, n, ni, mcast, ml);
sys/net80211/ieee80211_input.c
1462
u_int16_t m, n, s;
sys/net80211/ieee80211_input.c
1520
n = rsn->rsn_nakms = LE_READ_2(frm);
sys/net80211/ieee80211_input.c
1524
if (frm + n * 4 > efrm)
sys/net80211/ieee80211_input.c
1527
while (n-- > 0) {
sys/net80211/ieee80211_proto.c
623
int n;
sys/net80211/ieee80211_proto.c
652
for (n = 1; n <= IEEE80211_VHT_NUM_SS; n++) {
sys/net80211/ieee80211_proto.c
654
IEEE80211_VHT_MCS_FOR_SS_MASK(n)) >>
sys/net80211/ieee80211_proto.c
655
IEEE80211_VHT_MCS_FOR_SS_SHIFT(n);
sys/net80211/ieee80211_proto.c
657
IEEE80211_VHT_MCS_FOR_SS_MASK(n)) >>
sys/net80211/ieee80211_proto.c
658
IEEE80211_VHT_MCS_FOR_SS_SHIFT(n);
sys/net80211/ieee80211_proto.c
681
int n;
sys/net80211/ieee80211_proto.c
717
for (n = 1; n <= IEEE80211_HE_NUM_SS; n++) {
sys/net80211/ieee80211_proto.c
719
IEEE80211_HE_MCS_FOR_SS_MASK(n)) >>
sys/net80211/ieee80211_proto.c
720
IEEE80211_HE_MCS_FOR_SS_SHIFT(n);
sys/net80211/ieee80211_proto.c
722
IEEE80211_HE_MCS_FOR_SS_MASK(n)) >>
sys/net80211/ieee80211_proto.c
723
IEEE80211_HE_MCS_FOR_SS_SHIFT(n);
sys/net80211/ieee80211_ra.c
75
#define DPRINTFN(n, x) do { if (ra_debug >= (n)) printf x; } while (0)
sys/net80211/ieee80211_ra.c
79
#define DPRINTFN(n, x) do { ; } while (0)
sys/net80211/ieee80211_ra_vht.c
74
#define DPRINTFN(n, x) do { if (ra_vht_debug >= (n)) printf x; } while (0)
sys/net80211/ieee80211_ra_vht.c
78
#define DPRINTFN(n, x) do { ; } while (0)
sys/netinet/in.h
221
#define IN_RFC3021_SUBNET(n) (((u_int32_t)(n) & IN_RFC3021_NET) == \
sys/netinet/inet_ntop.c
66
size_t n;
sys/netinet/inet_ntop.c
78
n = snprintf(dst, size, "%d ", sa->sa_family);
sys/netinet/inet_ntop.c
80
int r = snprintf(dst + n, size - n, "%02x", sa->sa_data[l]);
sys/netinet/inet_ntop.c
83
n += r;
sys/netinet/inet_ntop.c
84
if (n > size)
sys/netinet/inet_ntop.c
85
n = size;
sys/netinet/ip_ah.c
981
struct mbuf *n = m_dup_pkt(m, 0, M_DONTWAIT);
sys/netinet/ip_ah.c
983
if (n == NULL) {
sys/netinet/ip_ah.c
990
m = n;
sys/netinet/ip_carp.c
1625
u_int16_t n = imo->imo_num_memberships;
sys/netinet/ip_carp.c
1628
while (n-- > 0) {
sys/netinet/ip_carp.c
1629
if (imo->imo_membership[n] != NULL) {
sys/netinet/ip_carp.c
1630
in_delmulti(imo->imo_membership[n]);
sys/netinet/ip_carp.c
1631
imo->imo_membership[n] = NULL;
sys/netinet/ip_carp.c
778
carpattach(int n)
sys/netinet/ip_esp.c
810
struct mbuf *n = m_dup_pkt(m, 0, M_DONTWAIT);
sys/netinet/ip_esp.c
812
if (n == NULL) {
sys/netinet/ip_esp.c
822
m = n;
sys/netinet/ip_icmp.c
1144
struct mbuf *n;
sys/netinet/ip_icmp.c
1184
n = m_getptr(m, hlen + off, &off);
sys/netinet/ip_icmp.c
1185
if (n == NULL)
sys/netinet/ip_icmp.c
1187
ieh = (struct icmp_ext_hdr *)(mtod(n, caddr_t) + off);
sys/netinet/ip_icmp.c
1188
ieh->ieh_cksum = in4_cksum(n, 0, off, sizeof(hdr) + len);
sys/netinet/ip_icmp.c
154
icmp_do_error(struct mbuf *n, int type, int code, u_int32_t dest, int destmtu)
sys/netinet/ip_icmp.c
156
struct ip *oip = mtod(n, struct ip *), *nip;
sys/netinet/ip_icmp.c
176
n->m_len >= oiplen + ICMP_MINLEN &&
sys/netinet/ip_icmp.c
183
if (n->m_flags & (M_BCAST|M_MCAST))
sys/netinet/ip_icmp.c
202
for (m = n; m && (mblen < icmplen); m = m->m_next)
sys/netinet/ip_icmp.c
231
m->m_pkthdr.ph_rtableid = n->m_pkthdr.ph_rtableid;
sys/netinet/ip_icmp.c
232
m->m_pkthdr.ph_ifidx = n->m_pkthdr.ph_ifidx;
sys/netinet/ip_icmp.c
234
if (n->m_pkthdr.pf.flags & PF_TAG_GENERATED)
sys/netinet/ip_icmp.c
260
m_copydata(n, 0, icmplen, &icp->icmp_ip);
sys/netinet/ip_icmp.c
281
m_freem(n);
sys/netinet/ip_icmp.c
285
m_freem(n);
sys/netinet/ip_icmp.c
296
icmp_error(struct mbuf *n, int type, int code, u_int32_t dest, int destmtu)
sys/netinet/ip_icmp.c
300
m = icmp_do_error(n, type, code, dest, destmtu);
sys/netinet/ip_ipcomp.c
417
struct mbuf *n = m_dup_pkt(m, 0, M_DONTWAIT);
sys/netinet/ip_ipcomp.c
419
if (n == NULL) {
sys/netinet/ip_ipcomp.c
429
m = n;
sys/netinet/ip_mroute.h
42
#define VIFM_SET(n, m) ((m) |= (1 << (n)))
sys/netinet/ip_mroute.h
43
#define VIFM_CLR(n, m) ((m) &= ~(1 << (n)))
sys/netinet/ip_mroute.h
44
#define VIFM_ISSET(n, m) ((m) & (1 << (n)))
sys/netinet/ip_output.c
1241
struct mbuf *n;
sys/netinet/ip_output.c
1262
if ((n = m_get(M_NOWAIT, MT_SOOPTS)) == NULL)
sys/netinet/ip_output.c
1264
p = mtod(n, struct ipoption *);
sys/netinet/ip_output.c
1266
n->m_len = sizeof(struct in_addr);
sys/netinet/ip_output.c
1334
n->m_len += off;
sys/netinet/ip_output.c
1335
if (n->m_len > sizeof(*p)) {
sys/netinet/ip_output.c
1337
m_freem(n);
sys/netinet/ip_output.c
1341
*pcbopt = n;
sys/netinet/ip_output.c
775
struct mbuf *n;
sys/netinet/ip_output.c
792
MGETHDR(n, M_DONTWAIT, MT_HEADER);
sys/netinet/ip_output.c
793
if (n == NULL)
sys/netinet/ip_output.c
795
M_MOVE_HDR(n, m);
sys/netinet/ip_output.c
796
n->m_pkthdr.len += optlen;
sys/netinet/ip_output.c
799
n->m_next = m;
sys/netinet/ip_output.c
800
m = n;
sys/netinet/raw_ip.c
192
struct mbuf *n;
sys/netinet/raw_ip.c
196
n = m_copym(m, 0, M_COPYALL, M_NOWAIT);
sys/netinet/raw_ip.c
197
if (n != NULL)
sys/netinet/raw_ip.c
198
rip_sbappend(last, n, ip, &ripsrc);
sys/netinet/udp_usrreq.c
472
struct mbuf *n;
sys/netinet/udp_usrreq.c
476
n = m_copym(m, 0, M_COPYALL, M_NOWAIT);
sys/netinet/udp_usrreq.c
477
if (n != NULL) {
sys/netinet/udp_usrreq.c
478
udp_sbappend(last, n, ip, ip6, iphlen,
sys/netinet6/icmp6.c
369
struct mbuf *n;
sys/netinet6/icmp6.c
371
n = icmp6_do_error(m, type, code, param);
sys/netinet6/icmp6.c
372
if (n != NULL) {
sys/netinet6/icmp6.c
374
if (!icmp6_reflect(&n, sizeof(struct ip6_hdr), NULL))
sys/netinet6/icmp6.c
375
ip6_send(n);
sys/netinet6/icmp6.c
389
struct mbuf *m = *mp, *n;
sys/netinet6/icmp6.c
530
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
sys/netinet6/icmp6.c
532
n = m;
sys/netinet6/icmp6.c
541
if ((n->m_flags & M_EXT) != 0 ||
sys/netinet6/icmp6.c
542
n->m_len < off + sizeof(struct icmp6_hdr)) {
sys/netinet6/icmp6.c
543
struct mbuf *n0 = n;
sys/netinet6/icmp6.c
555
MGETHDR(n, M_DONTWAIT, n0->m_type);
sys/netinet6/icmp6.c
556
if (n && maxlen >= MHLEN) {
sys/netinet6/icmp6.c
557
MCLGET(n, M_DONTWAIT);
sys/netinet6/icmp6.c
558
if ((n->m_flags & M_EXT) == 0) {
sys/netinet6/icmp6.c
559
m_free(n);
sys/netinet6/icmp6.c
560
n = NULL;
sys/netinet6/icmp6.c
563
if (n == NULL) {
sys/netinet6/icmp6.c
566
n = m;
sys/netinet6/icmp6.c
570
M_MOVE_PKTHDR(n, n0);
sys/netinet6/icmp6.c
574
nip6 = mtod(n, struct ip6_hdr *);
sys/netinet6/icmp6.c
579
n->m_len = noff + sizeof(struct icmp6_hdr);
sys/netinet6/icmp6.c
585
n->m_pkthdr.len += noff + sizeof(struct icmp6_hdr);
sys/netinet6/icmp6.c
586
n->m_pkthdr.len -= (off + sizeof(struct icmp6_hdr));
sys/netinet6/icmp6.c
588
n->m_next = n0;
sys/netinet6/icmp6.c
591
nicmp6 = ip6_exthdr_get(&n, off, sizeof(*nicmp6));
sys/netinet6/icmp6.c
594
if (n) {
sys/netinet6/icmp6.c
599
if (!icmp6_reflect(&n, noff, NULL))
sys/netinet6/icmp6.c
600
ip6_send(n);
sys/netinet6/icmp6.c
615
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
sys/netinet6/icmp6.c
621
mld6_input(n, off);
sys/netinet6/icmp6.c
652
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
sys/netinet6/icmp6.c
659
nd6_rtr_cache(n, off, icmp6len, icmp6->icmp6_type);
sys/netinet6/icmp6.c
668
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
sys/netinet6/icmp6.c
674
nd6_ns_input(n, off, icmp6len);
sys/netinet6/icmp6.c
683
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
sys/netinet6/icmp6.c
689
nd6_na_input(n, off, icmp6len);
sys/netinet6/icmp6.c
698
if ((n = m_copym(m, 0, M_COPYALL, M_DONTWAIT)) == NULL) {
sys/netinet6/icmp6.c
704
icmp6_redirect_input(n, off);
sys/netinet6/ip6_id.c
200
int i, n;
sys/netinet6/ip6_id.c
206
n = arc4random() & 0x3;
sys/netinet6/ip6_id.c
207
if (p->ru_counter + n >= p->ru_max)
sys/netinet6/ip6_id.c
210
for (i = 0; i <= n; i++) {
sys/netinet6/ip6_input.c
1226
struct mbuf *n;
sys/netinet6/ip6_input.c
1252
MGET(n, M_DONTWAIT, MT_DATA);
sys/netinet6/ip6_input.c
1253
if (n && elen >= MLEN) {
sys/netinet6/ip6_input.c
1254
MCLGET(n, M_DONTWAIT);
sys/netinet6/ip6_input.c
1255
if ((n->m_flags & M_EXT) == 0) {
sys/netinet6/ip6_input.c
1256
m_free(n);
sys/netinet6/ip6_input.c
1257
n = NULL;
sys/netinet6/ip6_input.c
1260
if (n == NULL) {
sys/netinet6/ip6_input.c
1265
n->m_len = 0;
sys/netinet6/ip6_input.c
1266
if (elen >= m_trailingspace(n)) {
sys/netinet6/ip6_input.c
1267
m_free(n);
sys/netinet6/ip6_input.c
1271
m_copydata(m, off, elen, mtod(n, caddr_t));
sys/netinet6/ip6_input.c
1272
n->m_len = elen;
sys/netinet6/ip6_input.c
1273
return n;
sys/netinet6/ip6_mroute.h
72
#define IF_SET(n, p) \
sys/netinet6/ip6_mroute.h
73
((p)->ifs_bits[(n)/__NIFBITS] |= (1U << ((n) % __NIFBITS)))
sys/netinet6/ip6_mroute.h
74
#define IF_CLR(n, p) \
sys/netinet6/ip6_mroute.h
75
((p)->ifs_bits[(n)/__NIFBITS] &= ~(1U << ((n) % __NIFBITS)))
sys/netinet6/ip6_mroute.h
76
#define IF_ISSET(n, p) \
sys/netinet6/ip6_mroute.h
77
((p)->ifs_bits[(n)/__NIFBITS] & (1U << ((n) % __NIFBITS)))
sys/netinet6/ip6_output.c
1001
for (mlast = n; mlast->m_next; mlast = mlast->m_next)
sys/netinet6/ip6_output.c
925
struct mbuf *n;
sys/netinet6/ip6_output.c
938
MGET(n, M_DONTWAIT, MT_DATA);
sys/netinet6/ip6_output.c
939
if (n) {
sys/netinet6/ip6_output.c
940
MCLGET(n, M_DONTWAIT);
sys/netinet6/ip6_output.c
941
if ((n->m_flags & M_EXT) == 0) {
sys/netinet6/ip6_output.c
942
m_freem(n);
sys/netinet6/ip6_output.c
943
n = NULL;
sys/netinet6/ip6_output.c
946
if (!n)
sys/netinet6/ip6_output.c
948
n->m_len = oldoptlen + JUMBOOPTLEN;
sys/netinet6/ip6_output.c
949
memcpy(mtod(n, caddr_t), mtod(mopt, caddr_t),
sys/netinet6/ip6_output.c
951
optbuf = mtod(n, u_int8_t *) + oldoptlen;
sys/netinet6/ip6_output.c
953
mopt = exthdrs->ip6e_hbh = n;
sys/netinet6/ip6_output.c
989
struct mbuf *n, *mlast;
sys/netinet6/ip6_output.c
992
n = m_copym(m0, sizeof(struct ip6_hdr),
sys/netinet6/ip6_output.c
994
if (n == NULL)
sys/netinet6/ip6_output.c
996
m->m_next = n;
sys/netinet6/ip6_output.c
998
n = m;
sys/netinet6/nd6.h
104
#define ND6_LLINFO_PERMANENT(n) ((n)->ln_rt->rt_expire == 0)
sys/netinet6/raw_ip6.c
226
struct mbuf *n;
sys/netinet6/raw_ip6.c
230
n = m_copym(m, 0, M_COPYALL, M_NOWAIT);
sys/netinet6/raw_ip6.c
231
if (n != NULL)
sys/netinet6/raw_ip6.c
232
rip6_sbappend(last, n, ip6, *offp, &rip6src);
sys/netinet6/raw_ip6.c
478
struct mbuf *n;
sys/netinet6/raw_ip6.c
494
n = m_pulldown(m, off, sizeof(*sump), &sumoff);
sys/netinet6/raw_ip6.c
495
if (n == NULL) {
sys/netinet6/raw_ip6.c
500
sump = (u_int16_t *)(mtod(n, caddr_t) + sumoff);
sys/netmpls/mpls_output.c
150
struct mbuf *n;
sys/netmpls/mpls_output.c
178
n = m_getptr(m, loc, &off);
sys/netmpls/mpls_output.c
179
if (n == NULL)
sys/netmpls/mpls_output.c
182
ttl = *(mtod(n, uint8_t *) + off);
sys/nfs/nfs.h
69
#define NFS_CMPFH(n, f, s) \
sys/nfs/nfs.h
70
((n)->n_fhsize == (s) && !bcmp((caddr_t)(n)->n_fhp, (caddr_t)(f), (s)))
sys/nfs/nfs.h
72
#define NFS_SRVMAXDATA(n) \
sys/nfs/nfs.h
73
(((n)->nd_flag & ND_NFSV3) ? (((n)->nd_nam2) ? \
sys/nfs/nfs_bio.c
179
n = ulmin(biosize - on, uio->uio_resid);
sys/nfs/nfs_bio.c
181
if (offdiff < (off_t)n)
sys/nfs/nfs_bio.c
182
n = (int)offdiff;
sys/nfs/nfs_bio.c
183
if (not_readin && n > 0) {
sys/nfs/nfs_bio.c
184
if (on < bp->b_validoff || (on + n) > bp->b_validend) {
sys/nfs/nfs_bio.c
197
if (diff < n)
sys/nfs/nfs_bio.c
198
n = diff;
sys/nfs/nfs_bio.c
213
n = ulmin(uio->uio_resid, NFS_MAXPATHLEN - bp->b_resid);
sys/nfs/nfs_bio.c
222
if (n > 0) {
sys/nfs/nfs_bio.c
225
error = uiomove(baddr + on, n, uio);
sys/nfs/nfs_bio.c
229
n = 0;
sys/nfs/nfs_bio.c
233
} while (error == 0 && uio->uio_resid > 0 && n > 0);
sys/nfs/nfs_bio.c
255
int n, on, error = 0, extended = 0, wrotedta = 0, truncated = 0;
sys/nfs/nfs_bio.c
320
n = ulmin(biosize - on, uio->uio_resid);
sys/nfs/nfs_bio.c
329
if (uio->uio_offset + n > np->n_size) {
sys/nfs/nfs_bio.c
330
np->n_size = uio->uio_offset + n;
sys/nfs/nfs_bio.c
333
} else if (uio->uio_offset + n < np->n_size)
sys/nfs/nfs_bio.c
342
(on > bp->b_dirtyend || (on + n) < bp->b_dirtyoff)) {
sys/nfs/nfs_bio.c
351
error = uiomove((char *)bp->b_data + on, n, uio);
sys/nfs/nfs_bio.c
359
bp->b_dirtyend = max((on + n), bp->b_dirtyend);
sys/nfs/nfs_bio.c
362
bp->b_dirtyend = on + n;
sys/nfs/nfs_bio.c
396
} else if ((n + on) == biosize) {
sys/nfs/nfs_bio.c
403
} while (uio->uio_resid > 0 && n > 0);
sys/nfs/nfs_bio.c
76
int got_buf = 0, nra, error = 0, n = 0, on = 0, not_readin;
sys/nfs/nfs_socket.c
1357
nfs_realign_fixup(struct mbuf *m, struct mbuf *n, unsigned int *off)
sys/nfs/nfs_socket.c
1365
while (n->m_next != NULL)
sys/nfs/nfs_socket.c
1366
n = n->m_next;
sys/nfs/nfs_socket.c
1377
padding = min(ALIGN(n->m_len) - n->m_len, m->m_len);
sys/nfs/nfs_socket.c
1378
if (padding > m_trailingspace(n))
sys/nfs/nfs_socket.c
1381
bcopy(mtod(m, void *), mtod(n, char *) + n->m_len, padding);
sys/nfs/nfs_socket.c
1383
n->m_len += padding;
sys/nfs/nfs_socket.c
1387
} while (!ALIGNED_POINTER(n->m_len, void *));
sys/nfs/nfs_socket.c
1399
struct mbuf *n = NULL;
sys/nfs/nfs_socket.c
1406
MGET(n, M_WAIT, MT_DATA);
sys/nfs/nfs_socket.c
1407
#define ALIGN_POINTER(n) ((u_int)(((n) + sizeof(void *)) & ~sizeof(void *)))
sys/nfs/nfs_socket.c
1409
MCLGET(n, M_WAIT);
sys/nfs/nfs_socket.c
1411
n->m_len = 0;
sys/nfs/nfs_socket.c
1420
if (n != NULL) {
sys/nfs/nfs_socket.c
1423
m_copyback(n, off, m->m_len, mtod(m, caddr_t), M_WAIT);
sys/nfs/nfs_socket.c
1430
nfs_realign_fixup(m, n, &off);
sys/nfs/nfs_socket.c
1436
*pm = n;
sys/nfs/nfs_subs.c
1477
struct nfsnode *n = VTONFS(v);
sys/nfs/nfs_subs.c
1480
nfsm_strtombuf(&info->nmi_mb, n->n_fhp, n->n_fhsize);
sys/nfs/nfs_subs.c
1482
nfsm_buftombuf(&info->nmi_mb, n->n_fhp, NFSX_V2FH);
sys/nfs/nfs_syscalls.c
506
struct mbuf *m, *n;
sys/nfs/nfs_syscalls.c
522
n = m->m_nextpkt;
sys/nfs/nfs_syscalls.c
524
m = n;
sys/nfs/nfs_vfsops.c
270
long n;
sys/nfs/nfs_vfsops.c
299
n = attr.va_atime.tv_sec;
sys/nfs/nfs_vfsops.c
301
printf("root time: 0x%lx\n", n);
sys/nfs/nfs_vfsops.c
303
inittodr(n);
sys/nfs/nfs_vfsops.c
363
n = (long) (attr.va_size >> DEV_BSHIFT);
sys/nfs/nfs_vfsops.c
367
printf("swap size: 0x%lx (blocks)\n", n);
sys/ntfs/ntfs.h
305
#define DNPRINTF(n, x...) do { if(ntfs_debug >= (n)) printf(x); } while(0)
sys/ntfs/ntfs.h
309
#define DNPRINTF(n, x...)
sys/ntfs/ntfs_conv.c
101
if (n < 3) {
sys/ntfs/ntfs_conv.c
113
if (n < 2) {
sys/ntfs/ntfs_conv.c
123
if (n < 1) {
sys/ntfs/ntfs_conv.c
98
ntfs_utf8_wput(char *s, size_t n, wchar wc)
sys/scsi/cd.c
1115
int tocidx, n, audioonly = 1;
sys/scsi/cd.c
1147
n = toc->header.ending_track - toc->header.starting_track + 1;
sys/scsi/cd.c
1148
for (tocidx = 0; tocidx < n; tocidx++)
sys/scsi/cd.c
1575
int n, len, error;
sys/scsi/cd.c
1583
n = toc->header.ending_track - toc->header.starting_track + 2;
sys/scsi/cd.c
1584
len = n * sizeof(struct cd_toc_entry) + sizeof(toc->header);
sys/scsi/ses.c
42
#define DPRINTFN(n, x...) do { if (sesdebug > (n)) printf(x); } while (0)
sys/scsi/ses.c
46
#define DPRINTFN(n,x...) /* n: x */
sys/stand/boot/cmd.c
246
readline(char *buf, size_t n, int to)
sys/stand/boot/cmd.c
296
if (p - buf < n-1)
sys/stand/efi/include/efistdarg.h
30
#define _INTSIZEOF(n) ( (sizeof(n) + sizeof(UINTN) - 1) & ~(sizeof(UINTN) - 1) )
sys/sys/atomic.h
35
atomic_cas_uint(volatile unsigned int *p, unsigned int o, unsigned int n)
sys/sys/atomic.h
37
return __sync_val_compare_and_swap(p, o, n);
sys/sys/atomic.h
43
atomic_cas_ulong(volatile unsigned long *p, unsigned long o, unsigned long n)
sys/sys/atomic.h
45
return __sync_val_compare_and_swap(p, o, n);
sys/sys/atomic.h
51
atomic_cas_ptr(volatile void *pp, void *o, void *n)
sys/sys/atomic.h
54
return __sync_val_compare_and_swap(p, o, n);
sys/sys/conf.h
102
#define dev_type_dump(n) int n(dev_t, daddr_t, caddr_t, size_t)
sys/sys/conf.h
103
#define dev_type_size(n) daddr_t n(dev_t)
sys/sys/conf.h
106
#define dev_size_init(c,n) (c > 0 ? __CONCAT(n,size) : 0)
sys/sys/conf.h
108
#define bdev_decl(n) \
sys/sys/conf.h
109
dev_decl(n,open); dev_decl(n,close); dev_decl(n,strategy); \
sys/sys/conf.h
110
dev_decl(n,ioctl); dev_decl(n,dump); dev_decl(n,size)
sys/sys/conf.h
112
#define bdev_disk_init(c,n) { \
sys/sys/conf.h
113
dev_init(c,n,open), dev_init(c,n,close), \
sys/sys/conf.h
114
dev_init(c,n,strategy), dev_init(c,n,ioctl), \
sys/sys/conf.h
115
dev_init(c,n,dump), dev_size_init(c,n), D_DISK }
sys/sys/conf.h
117
#define bdev_swap_init(c,n) { \
sys/sys/conf.h
119
dev_init(c,n,strategy), (dev_type_ioctl((*))) enodev, \
sys/sys/conf.h
155
#define dev_type_read(n) int n(dev_t, struct uio *, int)
sys/sys/conf.h
156
#define dev_type_write(n) int n(dev_t, struct uio *, int)
sys/sys/conf.h
157
#define dev_type_stop(n) int n(struct tty *, int)
sys/sys/conf.h
158
#define dev_type_tty(n) struct tty *n(dev_t)
sys/sys/conf.h
159
#define dev_type_mmap(n) paddr_t n(dev_t, off_t, int)
sys/sys/conf.h
160
#define dev_type_kqfilter(n) int n(dev_t, struct knote *)
sys/sys/conf.h
162
#define cdev_decl(n) \
sys/sys/conf.h
163
dev_decl(n,open); dev_decl(n,close); dev_decl(n,read); \
sys/sys/conf.h
164
dev_decl(n,write); dev_decl(n,ioctl); dev_decl(n,stop); \
sys/sys/conf.h
165
dev_decl(n,tty); dev_decl(n,mmap); \
sys/sys/conf.h
166
dev_decl(n,kqfilter)
sys/sys/conf.h
169
#define cdev_disk_init(c,n) { \
sys/sys/conf.h
170
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
171
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
176
#define cdev_tape_init(c,n) { \
sys/sys/conf.h
177
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
178
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
183
#define cdev_tty_init(c,n) { \
sys/sys/conf.h
184
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
185
dev_init(c,n,write), dev_init(c,n,ioctl), dev_init(c,n,stop), \
sys/sys/conf.h
186
dev_init(c,n,tty), (dev_type_mmap((*))) enodev, \
sys/sys/conf.h
190
#define cdev_mouse_init(c,n) { \
sys/sys/conf.h
191
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
192
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
194
(dev_type_mmap((*))) enodev , 0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
203
#define cdev_cn_init(c,n) { \
sys/sys/conf.h
204
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
205
dev_init(c,n,write), dev_init(c,n,ioctl), dev_init(c,n,stop), \
sys/sys/conf.h
207
D_TTY, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
210
#define cdev_ctty_init(c,n) { \
sys/sys/conf.h
211
dev_init(c,n,open), (dev_type_close((*))) nullop, dev_init(c,n,read), \
sys/sys/conf.h
212
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) nullop, \
sys/sys/conf.h
214
D_TTY, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
217
#define cdev_mm_init(c,n) { \
sys/sys/conf.h
218
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
219
dev_init(c,n,write), dev_init(c,n,ioctl), \
sys/sys/conf.h
220
(dev_type_stop((*))) enodev, 0, dev_init(c,n,mmap), \
sys/sys/conf.h
224
#define cdev_ptc_init(c,n) { \
sys/sys/conf.h
225
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
226
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) nullop, \
sys/sys/conf.h
227
dev_init(c,n,tty), (dev_type_mmap((*))) enodev, \
sys/sys/conf.h
228
D_TTY, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
231
#define cdev_ptm_init(c,n) { \
sys/sys/conf.h
232
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
233
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
237
#define cdev_log_init(c,n) { \
sys/sys/conf.h
238
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
239
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
241
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
244
#define cdev_fd_init(c,n) { \
sys/sys/conf.h
245
dev_init(c,n,open), (dev_type_close((*))) enodev, \
sys/sys/conf.h
251
#define cdev_tun_init(c,n) { \
sys/sys/conf.h
252
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
253
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
255
0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
258
#define cdev_vscsi_init(c,n) { \
sys/sys/conf.h
259
dev_init(c,n,open), dev_init(c,n,close), \
sys/sys/conf.h
261
dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
263
0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
266
#define cdev_pppx_init(c,n) { \
sys/sys/conf.h
267
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
268
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
270
0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
273
#define cdev_bpf_init(c,n) { \
sys/sys/conf.h
274
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
275
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
277
0, D_CLONE, dev_init(c,n,kqfilter) }
sys/sys/conf.h
280
#define cdev_ch_init(c,n) { \
sys/sys/conf.h
281
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
282
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
287
#define cdev_uk_init(c,n) { \
sys/sys/conf.h
288
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
289
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
294
#define cdev_audio_init(c,n) { \
sys/sys/conf.h
295
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
296
dev_init(c,n,write), dev_init(c,n,ioctl), \
sys/sys/conf.h
298
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
301
#define cdev_midi_init(c,n) { \
sys/sys/conf.h
302
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
303
dev_init(c,n,write), dev_init(c,n,ioctl), \
sys/sys/conf.h
305
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
308
#define cdev_ksyms_init(c,n) { \
sys/sys/conf.h
309
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
315
#define cdev_kstat_init(c,n) { \
sys/sys/conf.h
316
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
317
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
322
#define cdev_wsdisplay_init(c,n) { \
sys/sys/conf.h
323
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
324
dev_init(c,n,write), dev_init(c,n,ioctl), dev_init(c,n,stop), \
sys/sys/conf.h
325
dev_init(c,n,tty), dev_init(c,n,mmap), \
sys/sys/conf.h
326
D_TTY, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
329
#define cdev_random_init(c,n) { \
sys/sys/conf.h
330
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
331
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
333
0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
336
#define cdev_usb_init(c,n) { \
sys/sys/conf.h
337
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
338
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
343
#define cdev_ulpt_init(c,n) { \
sys/sys/conf.h
344
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
345
dev_init(c,n,write), (dev_type_ioctl((*))) enodev, \
sys/sys/conf.h
349
#define cdev_pf_init(c,n) { \
sys/sys/conf.h
350
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
351
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
356
#define cdev_usbdev_init(c,n) { \
sys/sys/conf.h
357
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
358
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
360
dev_init(c,n,kqfilter) }
sys/sys/conf.h
363
#define cdev_fido_init(c,n) { \
sys/sys/conf.h
364
dev_init(c,n,open), dev_init(c,uhid,close), dev_init(c,uhid,read), \
sys/sys/conf.h
370
#define cdev_ujoy_init(c,n) { \
sys/sys/conf.h
371
dev_init(c,n,open), dev_init(c,uhid,close), dev_init(c,uhid,read), \
sys/sys/conf.h
377
#define cdev_pci_init(c,n) { \
sys/sys/conf.h
378
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
379
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
384
#define cdev_radio_init(c,n) { \
sys/sys/conf.h
385
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
386
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
391
#define cdev_video_init(c,n) { \
sys/sys/conf.h
392
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
393
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
395
dev_init(c,n,mmap), 0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
398
#define cdev_spkr_init(c,n) { \
sys/sys/conf.h
399
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
400
dev_init(c,n,write), dev_init(c,n,ioctl), (dev_type_stop((*))) enodev, \
sys/sys/conf.h
405
#define cdev_lpt_init(c,n) { \
sys/sys/conf.h
406
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
407
dev_init(c,n,write), (dev_type_ioctl((*))) enodev, \
sys/sys/conf.h
412
#define cdev_bktr_init(c, n) { \
sys/sys/conf.h
413
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
414
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
415
(dev_type_stop((*))) enodev, 0, dev_init(c,n,mmap), \
sys/sys/conf.h
419
#define cdev_hotplug_init(c,n) { \
sys/sys/conf.h
420
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
421
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
423
(dev_type_mmap((*))) enodev, 0, 0, dev_init(c,n,kqfilter) }
sys/sys/conf.h
426
#define cdev_gpio_init(c,n) { \
sys/sys/conf.h
427
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
428
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
433
#define cdev_bio_init(c,n) { \
sys/sys/conf.h
434
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
435
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
440
#define cdev_drm_init(c,n) { \
sys/sys/conf.h
441
dev_init(c,n,open), dev_init(c,n,close), dev_init(c, n, read), \
sys/sys/conf.h
442
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
444
dev_init(c,n,mmap), 0, D_CLONE, dev_init(c,n,kqfilter) }
sys/sys/conf.h
447
#define cdev_amdmsr_init(c,n) { \
sys/sys/conf.h
448
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
449
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
454
#define cdev_fuse_init(c,n) { \
sys/sys/conf.h
455
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
456
dev_init(c,n,write), (dev_type_ioctl((*))) enodev, \
sys/sys/conf.h
458
(dev_type_mmap((*))) enodev, 0, D_CLONE, dev_init(c,n,kqfilter) }
sys/sys/conf.h
461
#define cdev_pvbus_init(c,n) { \
sys/sys/conf.h
462
dev_init(c,n,open), dev_init(c,n,close), \
sys/sys/conf.h
465
dev_init(c,n,ioctl), \
sys/sys/conf.h
470
#define cdev_ipmi_init(c,n) { \
sys/sys/conf.h
471
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
472
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
477
#define cdev_efi_init(c,n) { \
sys/sys/conf.h
478
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
479
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
484
#define cdev_kcov_init(c,n) { \
sys/sys/conf.h
485
dev_init(c,n,open), dev_init(c,n,close), (dev_type_read((*))) enodev, \
sys/sys/conf.h
486
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
488
(dev_init(c,n,mmap)), 0, D_CLONE }
sys/sys/conf.h
491
#define cdev_dt_init(c,n) { \
sys/sys/conf.h
492
dev_init(c,n,open), dev_init(c,n,close), dev_init(c,n,read), \
sys/sys/conf.h
493
(dev_type_write((*))) enodev, dev_init(c,n,ioctl), \
sys/sys/conf.h
67
#define dev_type_open(n) int n(dev_t, int, int, struct proc *)
sys/sys/conf.h
68
#define dev_type_close(n) int n(dev_t, int, int, struct proc *)
sys/sys/conf.h
69
#define dev_type_strategy(n) void n(struct buf *)
sys/sys/conf.h
70
#define dev_type_ioctl(n) \
sys/sys/conf.h
71
int n(dev_t, u_long, caddr_t, int, struct proc *)
sys/sys/conf.h
73
#define dev_decl(n,t) __CONCAT(dev_type_,t)(__CONCAT(n,t))
sys/sys/conf.h
74
#define dev_init(c,n,t) \
sys/sys/conf.h
75
((c) > 0 ? __CONCAT(n,t) : (__CONCAT(dev_type_,t)((*))) enxio)
sys/sys/ctf.h
167
#define CTF_NAME_STID(n) ((n) >> 31)
sys/sys/ctf.h
168
#define CTF_NAME_OFFSET(n) ((n) & CTF_MAX_NAME)
sys/sys/disklabel.h
147
#define DL_SETPSIZE(p, n) do { \
sys/sys/disklabel.h
148
u_int64_t __x = (n); \
sys/sys/disklabel.h
153
#define DL_SETPOFFSET(p, n) do { \
sys/sys/disklabel.h
154
u_int64_t __x = (n); \
sys/sys/disklabel.h
161
#define DL_SETDSIZE(d, n) do { \
sys/sys/disklabel.h
162
u_int64_t __x = (n); \
sys/sys/disklabel.h
168
#define DL_SETBSTART(d, n) do { \
sys/sys/disklabel.h
169
u_int64_t __x = (n); \
sys/sys/disklabel.h
175
#define DL_SETBEND(d, n) do { \
sys/sys/disklabel.h
176
u_int64_t __x = (n); \
sys/sys/disklabel.h
182
#define DL_SECTOBLK(d, n) ((n) * DL_BLKSPERSEC(d))
sys/sys/disklabel.h
183
#define DL_BLKTOSEC(d, n) ((n) / DL_BLKSPERSEC(d))
sys/sys/disklabel.h
184
#define DL_BLKOFFSET(d, n) (((n) % DL_BLKSPERSEC(d)) * DEV_BSIZE)
sys/sys/endian.h
74
#define swap16_multi(v, n) do { \
sys/sys/endian.h
75
__size_t __swap16_multi_n = (n); \
sys/sys/ioccom.h
62
#define _IO(g,n) _IOC(IOC_VOID, (g), (n), 0)
sys/sys/ioccom.h
63
#define _IOR(g,n,t) _IOC(IOC_OUT, (g), (n), sizeof(t))
sys/sys/ioccom.h
64
#define _IOW(g,n,t) _IOC(IOC_IN, (g), (n), sizeof(t))
sys/sys/ioccom.h
66
#define _IOWR(g,n,t) _IOC(IOC_INOUT, (g), (n), sizeof(t))
sys/sys/mbuf.h
287
#define MCLADDREFERENCE(o, n) m_extref((o), (n))
sys/sys/mutex.h
153
#define _mtx_init_flags(m,i,n,f,t) _mtx_init(m,i)
sys/sys/select.h
83
#define FD_SET(n, p) __fd_set((n), (p))
sys/sys/select.h
90
#define FD_CLR(n, p) __fd_clr((n), (p))
sys/sys/select.h
97
#define FD_ISSET(n, p) __fd_isset((n), (p))
sys/sys/socket.h
557
#define CMSG_ALIGN(n) _ALIGN(n)
sys/sys/srp.h
181
struct _type *c, *n; \
sys/sys/srp.h
187
n = SRPL_NEXT_LOCKED(c, _ENTRY); \
sys/sys/srp.h
188
if (n != NULL) \
sys/sys/srp.h
189
(_rc)->srpl_ref(&(_rc)->srpl_cookie, n); \
sys/sys/srp.h
190
srp_update_locked(&(_rc)->srpl_gc, ref, n); \
sys/sys/syscallargs.h
1053
syscallarg(int) n;
sys/sys/systm.h
405
#define bzero(b, n) __builtin_bzero((b), (n))
sys/sys/systm.h
406
#define memcmp(b1, b2, n) __builtin_memcmp((b1), (b2), (n))
sys/sys/systm.h
407
#define memcpy(d, s, n) __builtin_memcpy((d), (s), (n))
sys/sys/systm.h
408
#define memset(b, c, n) __builtin_memset((b), (c), (n))
sys/sys/systm.h
410
#define memmove(d, s, n) __builtin_memmove((d), (s), (n))
sys/sys/systm.h
413
#define bcmp(b1, b2, n) __builtin_bcmp((b1), (b2), (n))
sys/sys/systm.h
414
#define bcopy(s, d, n) __builtin_bcopy((s), (d), (n))
sys/sys/ttycom.h
118
#define UIOCCMD(n) _IO('u', n) /* usr cntl op "n" */
sys/ufs/ufs/ufs_dirhash.c
53
#define BLKFREE2IDX(n) ((n) > DH_NFSTATS ? DH_NFSTATS : (n))
sys/uvm/uvm_amap.c
110
int n;
sys/uvm/uvm_amap.c
1153
int i, lcv, n, slot;
sys/uvm/uvm_amap.c
1162
for (i = 0, lcv = slot; lcv < slot + npages; i += n, lcv += n) {
sys/uvm/uvm_amap.c
1163
n = UVM_AMAP_CHUNK - UVM_AMAP_SLOTIDX(lcv);
sys/uvm/uvm_amap.c
1164
if (lcv + n > slot + npages)
sys/uvm/uvm_amap.c
1165
n = slot + npages - lcv;
sys/uvm/uvm_amap.c
1169
memset(&anons[i], 0, n * sizeof(*anons));
sys/uvm/uvm_amap.c
1173
n * sizeof(*anons));
sys/uvm/uvm_amap.c
128
n = UVM_AMAP_CHUNK;
sys/uvm/uvm_amap.c
130
n = amap->am_nslot - baseslot;
sys/uvm/uvm_amap.c
146
newchunk->ac_nslot = n;
sys/uvm/uvm_amap.c
281
int buckets, i, n;
sys/uvm/uvm_amap.c
362
n = slots % UVM_AMAP_CHUNK;
sys/uvm/uvm_amap.c
363
if (n == 0)
sys/uvm/uvm_amap.c
364
n = UVM_AMAP_CHUNK;
sys/uvm/uvm_amap.c
366
n = UVM_AMAP_CHUNK;
sys/uvm/uvm_amap.c
376
chunk->ac_nslot = n;
sys/uvm/uvm_amap.c
535
int i, j, k, n, srcslot;
sys/uvm/uvm_amap.c
627
for (lcv = 0; lcv < slots; lcv += n) {
sys/uvm/uvm_amap.c
631
n = UVM_AMAP_CHUNK;
sys/uvm/uvm_amap.c
633
n -= i;
sys/uvm/uvm_amap.c
635
n -= j;
sys/uvm/uvm_amap.c
636
if (lcv + n > slots)
sys/uvm/uvm_amap.c
637
n = slots - lcv;
sys/uvm/uvm_amap.c
652
for (k = 0; k < n; i++, j++, k++) {
sys/uvm/uvm_fault.c
174
uvmfault_anonflush(struct vm_anon **anons, int n)
sys/uvm/uvm_fault.c
179
for (lcv = 0; lcv < n; lcv++) {
sys/uvm/uvm_page.c
177
vsize_t freepages, pagecount, n;
sys/uvm/uvm_page.c
237
n = seg->end - seg->start;
sys/uvm/uvm_page.c
238
if (n > pagecount) {
sys/uvm/uvm_page.c
240
(long)(n - pagecount));
sys/uvm/uvm_page.c
247
pagearray += n;
sys/uvm/uvm_page.c
248
pagecount -= n;
sys/uvm/uvm_page.c
249
seg->lastpg = seg->pgs + (n - 1);
sys/uvm/uvm_page.c
254
for (i = 0, curpg = seg->pgs; i < n;
usr.bin/apply/apply.c
127
for (n = 0, p = argv[0]; *p != '\0'; ++p)
usr.bin/apply/apply.c
130
if (p[0] - '0' > n)
usr.bin/apply/apply.c
131
n = p[0] - '0';
usr.bin/apply/apply.c
141
if (n == 0) {
usr.bin/apply/apply.c
158
nargs = n;
usr.bin/apply/apply.c
59
size_t n;
usr.bin/apply/apply.c
61
n = strlen(p);
usr.bin/apply/apply.c
63
sz = (n / 1024 + 1) * 1024;
usr.bin/apply/apply.c
67
} else if (sz - strlen(str) <= n) {
usr.bin/apply/apply.c
68
sz += (n / 1024 + 1) * 1024;
usr.bin/apply/apply.c
86
int ch, debug, i, magic, n, nargs, rval;
usr.bin/at/at.c
396
print_job(struct atjob *job, int n, int shortformat)
usr.bin/at/at.c
413
if (n / 10 == 1)
usr.bin/at/at.c
414
printf("%3d%-5s", n,"th");
usr.bin/at/at.c
416
printf("%3d%-5s", n, ranks[n % 10]);
usr.bin/aucat/afile.c
715
ssize_t n;
usr.bin/aucat/afile.c
728
n = read(f->fd, data, count);
usr.bin/aucat/afile.c
729
if (n == -1) {
usr.bin/aucat/afile.c
733
f->curpos += n;
usr.bin/aucat/afile.c
734
return n;
usr.bin/aucat/afile.c
741
int n;
usr.bin/aucat/afile.c
754
n = write(f->fd, data, count);
usr.bin/aucat/afile.c
755
if (n == -1) {
usr.bin/aucat/afile.c
759
f->curpos += n;
usr.bin/aucat/afile.c
762
return n;
usr.bin/aucat/aucat.c
1012
unsigned int n, todo;
usr.bin/aucat/aucat.c
1027
n = sio_read(dev_sh, p, todo);
usr.bin/aucat/aucat.c
1028
if (n == 0) {
usr.bin/aucat/aucat.c
1032
p += n;
usr.bin/aucat/aucat.c
1033
todo -= n;
usr.bin/aucat/aucat.c
1053
n = sio_write(dev_sh, p, todo);
usr.bin/aucat/aucat.c
1054
if (n == 0) {
usr.bin/aucat/aucat.c
1079
int n, ns, nm, ev;
usr.bin/aucat/aucat.c
1086
n = sio_nfds(dev_sh);
usr.bin/aucat/aucat.c
1088
n += mio_nfds(dev_mh);
usr.bin/aucat/aucat.c
1089
pfds = reallocarray(NULL, n, sizeof(struct pollfd));
usr.bin/aucat/aucat.c
1145
n = mio_read(dev_mh, mbuf, MIDIBUFSZ);
usr.bin/aucat/aucat.c
1146
midi_in(mbuf, n);
usr.bin/aucat/aucat.c
226
int count, n;
usr.bin/aucat/aucat.c
233
n = afile_write(&s->afile, data, count);
usr.bin/aucat/aucat.c
234
if (n == 0) {
usr.bin/aucat/aucat.c
239
abuf_rdiscard(&s->buf, n);
usr.bin/aucat/aucat.c
246
int count, n;
usr.bin/aucat/aucat.c
253
n = afile_read(&s->afile, data, count);
usr.bin/aucat/aucat.c
254
if (n == 0) {
usr.bin/aucat/aucat.c
261
abuf_wcommit(&s->buf, n);
usr.bin/aucat/aucat.c
909
unsigned int done, n;
usr.bin/aucat/aucat.c
924
n = slot_mix_badd(s, dev_pbuf);
usr.bin/aucat/aucat.c
925
if (n > done)
usr.bin/aucat/aucat.c
926
done = n;
usr.bin/aucat/dsp.c
387
int q, qi, qf, n;
usr.bin/aucat/dsp.c
431
n = ctx_start;
usr.bin/aucat/dsp.c
441
f[c] += (int64_t)ctx[n] * s;
usr.bin/aucat/dsp.c
445
n = (n + 1) & (RESAMP_NCTX - 1);
usr.bin/aucat/utils.c
62
int n, save_errno = errno;
usr.bin/aucat/utils.c
65
n = vsnprintf(log_buf + log_used, sizeof(log_buf) - log_used, fmt, ap);
usr.bin/aucat/utils.c
68
if (n != -1) {
usr.bin/aucat/utils.c
69
log_used += n;
usr.bin/aucat/utils.h
23
#define logx(n, ...) \
usr.bin/aucat/utils.h
25
if (log_level >= (n)) \
usr.bin/awk/awk.h
219
#define notlegal(n) (n <= FIRSTTOKEN || n >= LASTTOKEN || proctab[n-FIRSTTOKEN] == nullproc)
usr.bin/awk/awk.h
220
#define isvalue(n) ((n)->ntype == NVALUE)
usr.bin/awk/awk.h
221
#define isexpr(n) ((n)->ntype == NEXPR)
usr.bin/awk/awk.h
222
#define isjump(n) ((n)->ctype == OJUMP)
usr.bin/awk/awk.h
223
#define isexit(n) ((n)->csub == JEXIT)
usr.bin/awk/awk.h
224
#define isbreak(n) ((n)->csub == JBREAK)
usr.bin/awk/awk.h
225
#define iscont(n) ((n)->csub == JCONT)
usr.bin/awk/awk.h
226
#define isnext(n) ((n)->csub == JNEXT || (n)->csub == JNEXTFILE)
usr.bin/awk/awk.h
227
#define isret(n) ((n)->csub == JRET)
usr.bin/awk/awk.h
228
#define isrec(n) ((n)->tval & REC)
usr.bin/awk/awk.h
229
#define isfld(n) ((n)->tval & FLD)
usr.bin/awk/awk.h
230
#define isstr(n) ((n)->tval & STR)
usr.bin/awk/awk.h
231
#define isnum(n) ((n)->tval & NUM)
usr.bin/awk/awk.h
232
#define isarr(n) ((n)->tval & ARR)
usr.bin/awk/awk.h
233
#define isfcn(n) ((n)->tval & FCN)
usr.bin/awk/awk.h
234
#define istrue(n) ((n)->csub == BTRUE)
usr.bin/awk/awk.h
235
#define istemp(n) ((n)->csub == CTEMP)
usr.bin/awk/awk.h
236
#define isargument(n) ((n)->nobj == ARG)
usr.bin/awk/awkgram.y
496
Node *notnull(Node *n)
usr.bin/awk/awkgram.y
498
switch (n->nobj) {
usr.bin/awk/awkgram.y
501
return n;
usr.bin/awk/awkgram.y
503
return op2(NE, n, nullnode);
usr.bin/awk/b.c
119
intalloc(size_t n, const char *f)
usr.bin/awk/b.c
121
int *p = (int *) calloc(n, sizeof(int));
usr.bin/awk/b.c
1258
int c, n;
usr.bin/awk/b.c
1273
if ((n = u8_rune(&rlxval, (const char *) prestr)) > 1) {
usr.bin/awk/b.c
1274
prestr += n;
usr.bin/awk/b.c
1316
n = 5 * strlen((const char *) prestr)+1; /* BUG: was 2. what value? */
usr.bin/awk/b.c
1317
if (!adjbuf((char **) &buf, &bufsz, n, n, (char **) &bp, "relex1"))
usr.bin/awk/b.c
1320
if ((n = u8_rune(&rlxval, (const char *) prestr)) > 1) {
usr.bin/awk/b.c
1321
for (i = 0; i < n; i++)
usr.bin/awk/b.c
1355
n++;
usr.bin/awk/b.c
1359
n++;
usr.bin/awk/b.c
1416
n = -1; m = -1;
usr.bin/awk/b.c
1430
if (m < n)
usr.bin/awk/b.c
1433
if (n == 0 && m == 1) {
usr.bin/awk/b.c
1437
if (n == 0)
usr.bin/awk/b.c
1439
else if (n == 1)
usr.bin/awk/b.c
1444
n = num;
usr.bin/awk/b.c
1452
startreptok - lastatom, n, m) > 0) {
usr.bin/awk/b.c
1453
if (n == 0 && m == 0) {
usr.bin/awk/b.c
1477
n = num;
usr.bin/awk/b.c
350
int n = 0;
usr.bin/awk/b.c
355
n = 16 * n + *p - '0';
usr.bin/awk/b.c
357
n = 16 * n + *p - 'a' + 10;
usr.bin/awk/b.c
359
n = 16 * n + *p - 'A' + 10;
usr.bin/awk/b.c
362
return n;
usr.bin/awk/b.c
408
int n = c - '0';
usr.bin/awk/b.c
410
n = 8 * n + *p++ - '0';
usr.bin/awk/b.c
412
n = 8 * n + *p++ - '0';
usr.bin/awk/b.c
414
c = n;
usr.bin/awk/b.c
425
int n;
usr.bin/awk/b.c
435
n = u8_rune(&c, (const char *) p);
usr.bin/awk/b.c
436
p += n;
usr.bin/awk/b.c
443
n = u8_rune(&c2, (const char *) p);
usr.bin/awk/b.c
444
p += n;
usr.bin/awk/b.c
716
int n;
usr.bin/awk/b.c
729
n = u8_rune(&rune, (const char *) p);
usr.bin/awk/b.c
738
p += n;
usr.bin/awk/b.c
746
int n;
usr.bin/awk/b.c
762
n = u8_rune(&rune, (const char *) q);
usr.bin/awk/b.c
780
q += n;
usr.bin/awk/b.c
793
n = u8_rune(&rune, (const char *) p);
usr.bin/awk/b.c
794
p += n;
usr.bin/awk/b.c
802
int n;
usr.bin/awk/b.c
818
n = u8_rune(&rune, (const char *) q);
usr.bin/awk/b.c
832
q += n;
usr.bin/awk/b.c
868
int c, n, ns, s;
usr.bin/awk/b.c
906
for (n = awk_mb_cur_max ; n > 0; n--) {
usr.bin/awk/lex.c
379
int c, n;
usr.bin/awk/lex.c
415
n = c - '0';
usr.bin/awk/lex.c
417
n = 8 * n + input() - '0';
usr.bin/awk/lex.c
419
n = 8 * n + input() - '0';
usr.bin/awk/lex.c
421
*bp++ = n;
usr.bin/awk/lex.c
432
n = 0;
usr.bin/awk/lex.c
439
n *= 16;
usr.bin/awk/lex.c
441
n += (c - '0');
usr.bin/awk/lex.c
443
n += 10 + (c - 'a');
usr.bin/awk/lex.c
450
*bp++ = n;
usr.bin/awk/lex.c
458
n = 0;
usr.bin/awk/lex.c
464
n *= 16;
usr.bin/awk/lex.c
466
n += (c - '0');
usr.bin/awk/lex.c
468
n += 10 + (c - 'a');
usr.bin/awk/lex.c
471
bp += runetochar(bp, n);
usr.bin/awk/lex.c
494
static int binsearch(char *w, const Keyword *kp, int n)
usr.bin/awk/lex.c
499
high = n - 1;
usr.bin/awk/lex.c
515
int c, n;
usr.bin/awk/lex.c
517
n = binsearch(w, keywords, sizeof(keywords)/sizeof(keywords[0]));
usr.bin/awk/lex.c
518
if (n != -1) { /* found in table */
usr.bin/awk/lex.c
519
kp = keywords + n;
usr.bin/awk/lex.c
542
if (c != '(' && infunc && (n=isarg(w)) >= 0) {
usr.bin/awk/lex.c
543
yylval.i = n;
usr.bin/awk/lib.c
331
char *getargv(int n) /* get ARGV[n] */
usr.bin/awk/lib.c
339
snprintf(temp, sizeof(temp), "%d", n);
usr.bin/awk/lib.c
344
DPRINTF("getargv(%d) returns |%s|\n", n, s);
usr.bin/awk/lib.c
381
int i, j, n;
usr.bin/awk/lib.c
388
n = strlen(r);
usr.bin/awk/lib.c
389
if (n > fieldssize) {
usr.bin/awk/lib.c
391
if ((fields = (char *) malloc(n+2)) == NULL) /* possibly 2 final \0s */
usr.bin/awk/lib.c
392
FATAL("out of space for fields in fldbld %d", n);
usr.bin/awk/lib.c
393
fieldssize = n;
usr.bin/awk/lib.c
462
n = u8_nextlen(r);
usr.bin/awk/lib.c
463
for (j = 0; j < n; j++)
usr.bin/awk/lib.c
532
void newfld(int n) /* add field n after end of existing lastfld */
usr.bin/awk/lib.c
534
if (n > nfields)
usr.bin/awk/lib.c
535
growfldtab(n);
usr.bin/awk/lib.c
536
cleanfld(lastfld+1, n);
usr.bin/awk/lib.c
537
lastfld = n;
usr.bin/awk/lib.c
538
setfval(nfloc, (Awkfloat) n);
usr.bin/awk/lib.c
541
void setlastfld(int n) /* set lastfld cleaning fldtab cells if necessary */
usr.bin/awk/lib.c
543
if (n < 0)
usr.bin/awk/lib.c
545
if (n > nfields)
usr.bin/awk/lib.c
546
growfldtab(n);
usr.bin/awk/lib.c
548
if (lastfld < n)
usr.bin/awk/lib.c
549
cleanfld(lastfld+1, n);
usr.bin/awk/lib.c
551
cleanfld(n+1, lastfld);
usr.bin/awk/lib.c
553
lastfld = n;
usr.bin/awk/lib.c
556
Cell *fieldadr(int n) /* get nth field */
usr.bin/awk/lib.c
558
if (n < 0)
usr.bin/awk/lib.c
559
FATAL("trying to access out of range field %d", n);
usr.bin/awk/lib.c
560
if (n > nfields) /* fields after NF are empty */
usr.bin/awk/lib.c
561
growfldtab(n); /* but does not increase NF */
usr.bin/awk/lib.c
562
return(fldtab[n]);
usr.bin/awk/lib.c
565
void growfldtab(int n) /* make new fields up to at least $n */
usr.bin/awk/lib.c
570
if (n > nf)
usr.bin/awk/lib.c
571
nf = n;
usr.bin/awk/lib.c
588
int i, tempstat, n;
usr.bin/awk/lib.c
591
n = strlen(rec);
usr.bin/awk/lib.c
592
if (n > fieldssize) {
usr.bin/awk/lib.c
594
if ((fields = (char *) malloc(n+1)) == NULL)
usr.bin/awk/lib.c
595
FATAL("out of space for fields in refldbld %d", n);
usr.bin/awk/lib.c
596
fieldssize = n;
usr.bin/awk/lib.c
64
void recinit(unsigned int n)
usr.bin/awk/lib.c
66
if ( (record = (char *) malloc(n)) == NULL
usr.bin/awk/lib.c
67
|| (fields = (char *) malloc(n+1)) == NULL
usr.bin/awk/lib.c
717
void bcheck2(int n, int c1, int c2)
usr.bin/awk/lib.c
719
if (n == 1)
usr.bin/awk/lib.c
721
else if (n > 1)
usr.bin/awk/lib.c
722
fprintf(stderr, "\t%d missing %c's\n", n, c2);
usr.bin/awk/lib.c
723
else if (n == -1)
usr.bin/awk/lib.c
725
else if (n < -1)
usr.bin/awk/lib.c
726
fprintf(stderr, "\t%d extra %c's\n", -n, c2);
usr.bin/awk/main.c
61
static noreturn void fpecatch(int n
usr.bin/awk/maketab.c
119
int i, n, tok;
usr.bin/awk/maketab.c
142
n = sscanf(buf, "%1c %199s %199s %d", &c, def, name,
usr.bin/awk/maketab.c
144
if (n == 4 && c == '#' && strcmp(def, "define") == 0) {
usr.bin/awk/maketab.c
152
n = sscanf(buf, "%199s = %d,\n", name, &tok);
usr.bin/awk/maketab.c
153
if (n != 2)
usr.bin/awk/parse.c
260
int n;
usr.bin/awk/parse.c
273
n = 0; /* count arguments */
usr.bin/awk/parse.c
275
n++;
usr.bin/awk/parse.c
276
v->fval = n;
usr.bin/awk/parse.c
277
DPRINTF("defining func %s (%d args)\n", v->nval, n);
usr.bin/awk/parse.c
284
int n;
usr.bin/awk/parse.c
286
for (n = 0; p != NULL; p = p->nnext, n++)
usr.bin/awk/parse.c
288
return n;
usr.bin/awk/parse.c
33
Node *nodealloc(size_t n)
usr.bin/awk/parse.c
37
x = (Node *) malloc(sizeof(*x) + (n-1) * sizeof(x));
usr.bin/awk/proto.h
120
extern void growfldtab(int n);
usr.bin/awk/run.c
1004
n = (int) getfval(z);
usr.bin/awk/run.c
1007
n = k - 1;
usr.bin/awk/run.c
1008
if (n < 0)
usr.bin/awk/run.c
1009
n = 0;
usr.bin/awk/run.c
1010
else if (n > k - m)
usr.bin/awk/run.c
1011
n = k - m;
usr.bin/awk/run.c
1013
DPRINTF("substr: m=%d, n=%d, s=%s\n", m, n, s);
usr.bin/awk/run.c
1016
nb = mb + u8_char2byte(&s[mb], n); /* byte offset of end+1 char in s */
usr.bin/awk/run.c
1062
int n;
usr.bin/awk/run.c
1064
for (n = 0; *s != 0; s += n) {
usr.bin/awk/run.c
1065
n = u8_nextlen(s);
usr.bin/awk/run.c
1066
if (n > 1)
usr.bin/awk/run.c
1080
int flag = 0, n;
usr.bin/awk/run.c
1181
n = MAXNUMSIZE;
usr.bin/awk/run.c
1182
if (fmtwd > n)
usr.bin/awk/run.c
1183
n = fmtwd;
usr.bin/awk/run.c
1184
adjbuf(&buf, &bufsize, 1+n+p-buf, recsize, &p, "format5");
usr.bin/awk/run.c
1189
n = strlen(t);
usr.bin/awk/run.c
1190
if (fmtwd > n)
usr.bin/awk/run.c
1191
n = fmtwd;
usr.bin/awk/run.c
1192
adjbuf(&buf, &bufsize, 1+strlen(p)+n+p-buf, recsize, &p, "format6");
usr.bin/awk/run.c
1204
n = strlen(t);
usr.bin/awk/run.c
1207
if (fmtwd > n)
usr.bin/awk/run.c
1208
n = fmtwd;
usr.bin/awk/run.c
1209
if (!adjbuf(&buf, &bufsize, 1+n+p-buf, recsize, &p, "format7"))
usr.bin/awk/run.c
1211
" ran format() out of memory", n, t);
usr.bin/awk/run.c
1220
int ljust = 0, wid = 0, prec = n, pad = 0;
usr.bin/awk/run.c
1304
n = count;
usr.bin/awk/run.c
1314
n = u8_nextlen(t);
usr.bin/awk/run.c
1316
if (n < 2) { /* not utf8 */
usr.bin/awk/run.c
1322
int ljust = 0, wid = 0, prec = n, pad = 0;
usr.bin/awk/run.c
1351
for (i = 0; i < n; i++)
usr.bin/awk/run.c
1362
for (i = 0; i < n; i++)
usr.bin/awk/run.c
1387
Cell *awksprintf(Node **a, int n) /* sprintf(a[0]) */
usr.bin/awk/run.c
1407
Cell *awkprintf(Node **a, int n) /* printf */
usr.bin/awk/run.c
1441
Cell *arith(Node **a, int n) /* a[0] + a[1], etc. also -a[0] */
usr.bin/awk/run.c
1450
if (n != UMINUS && n != UPLUS) {
usr.bin/awk/run.c
1456
switch (n) {
usr.bin/awk/run.c
1491
FATAL("illegal arithmetic operator %d", n);
usr.bin/awk/run.c
1497
double ipow(double x, int n) /* x**n. ought to be done by pow, but isn't always */
usr.bin/awk/run.c
1501
if (n <= 0)
usr.bin/awk/run.c
1503
v = ipow(x, n/2);
usr.bin/awk/run.c
1504
if (n % 2 == 0)
usr.bin/awk/run.c
1510
Cell *incrdecr(Node **a, int n) /* a[0]++, etc. */
usr.bin/awk/run.c
1518
k = (n == PREINCR || n == POSTINCR) ? 1 : -1;
usr.bin/awk/run.c
1519
if (n == PREINCR || n == PREDECR) {
usr.bin/awk/run.c
1530
Cell *assign(Node **a, int n) /* a[0] = a[1], a[0] += a[1], etc. */
usr.bin/awk/run.c
1538
if (n == ASSIGN) { /* ordinary assignment */
usr.bin/awk/run.c
1558
switch (n) {
usr.bin/awk/run.c
1588
FATAL("illegal assignment operator %d", n);
usr.bin/awk/run.c
1625
Cell *pastat(Node **a, int n) /* a[0] { a[1] } */
usr.bin/awk/run.c
1641
Cell *dopa2(Node **a, int n) /* a[0], a[1] { a[2] } */
usr.bin/awk/run.c
1672
int j, n, tempstat, arg3type;
usr.bin/awk/run.c
1703
n = 0;
usr.bin/awk/run.c
1721
n++;
usr.bin/awk/run.c
1722
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
1732
n++;
usr.bin/awk/run.c
1733
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
1742
n++;
usr.bin/awk/run.c
1743
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
1755
n++;
usr.bin/awk/run.c
1774
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
1785
for (n = 0; ; ) {
usr.bin/awk/run.c
1791
n++;
usr.bin/awk/run.c
1798
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
1809
for (n = 0; *s != '\0'; s += u8_nextlen(s)) {
usr.bin/awk/run.c
1811
n++;
usr.bin/awk/run.c
1812
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
1827
n++;
usr.bin/awk/run.c
1833
snprintf(num, sizeof(num), "%d", n);
usr.bin/awk/run.c
184
Cell *program(Node **a, int n) /* execute an awk program */
usr.bin/awk/run.c
1848
x->fval = n;
usr.bin/awk/run.c
1852
Cell *condexpr(Node **a, int n) /* a[0] ? a[1] : a[2] */
usr.bin/awk/run.c
1867
Cell *ifstat(Node **a, int n) /* if (a[0]) a[1]; else a[2] */
usr.bin/awk/run.c
1882
Cell *whilestat(Node **a, int n) /* while (a[0]) a[1] */
usr.bin/awk/run.c
1902
Cell *dostat(Node **a, int n) /* do a[0]; while(a[1]) */
usr.bin/awk/run.c
1920
Cell *forstat(Node **a, int n) /* for (a[0]; a[1]; a[2]) a[3] */
usr.bin/awk/run.c
1943
Cell *instat(Node **a, int n) /* for (a[0] in a[1]) a[2] */
usr.bin/awk/run.c
1981
size_t n = 0;
usr.bin/awk/run.c
2002
while (n = mbtowc(&wc, ps, sz),
usr.bin/awk/run.c
2003
n > 0 && n != (size_t)-1 && n != (size_t)-2)
usr.bin/awk/run.c
2005
ps += n;
usr.bin/awk/run.c
2007
n = wctomb(pbuf, fun_wc(wc));
usr.bin/awk/run.c
2008
if (n == (size_t)-1)
usr.bin/awk/run.c
2011
pbuf += n;
usr.bin/awk/run.c
2016
if (n)
usr.bin/awk/run.c
2051
Cell *bltin(Node **a, int n) /* builtin functions. a[0] is type, a[1] is arg list */
usr.bin/awk/run.c
2292
Cell *printstat(Node **a, int n) /* print a[0] */
usr.bin/awk/run.c
231
Cell *call(Node **a, int n) /* function call. very kludgy and fragile */
usr.bin/awk/run.c
2318
Cell *nullproc(Node **a, int n)
usr.bin/awk/run.c
2442
Cell *closefile(Node **a, int n)
usr.bin/awk/run.c
349
Cell *arg(Node **a, int n) /* nth argument of a function */
usr.bin/awk/run.c
352
n = ptoi(a[0]); /* argument number, counting from 0 */
usr.bin/awk/run.c
353
DPRINTF("arg(%d), frp->nargs=%d\n", n, frp->nargs);
usr.bin/awk/run.c
354
if (n+1 > frp->nargs)
usr.bin/awk/run.c
356
n+1, frp->fcncell->nval);
usr.bin/awk/run.c
357
return frp->args[n];
usr.bin/awk/run.c
360
Cell *jump(Node **a, int n) /* break, continue, next, nextfile, return */
usr.bin/awk/run.c
364
switch (n) {
usr.bin/awk/run.c
399
FATAL("illegal jump type %d", n);
usr.bin/awk/run.c
404
Cell *awkgetline(Node **a, int n) /* get next line from specific input */
usr.bin/awk/run.c
428
n = -1;
usr.bin/awk/run.c
430
n = readrec(&buf, &bufsize, fp, newflag);
usr.bin/awk/run.c
431
if (n <= 0) {
usr.bin/awk/run.c
450
n = getrec(&record, &recsize, true);
usr.bin/awk/run.c
452
n = getrec(&buf, &bufsize, false);
usr.bin/awk/run.c
453
if (n > 0) {
usr.bin/awk/run.c
464
setfval(r, (Awkfloat) n);
usr.bin/awk/run.c
469
Cell *getnf(Node **a, int n) /* get NF */
usr.bin/awk/run.c
513
Cell *array(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */
usr.bin/awk/run.c
536
Cell *awkdelete(Node **a, int n) /* a[0] is symtab, a[1] is list of subscripts */
usr.bin/awk/run.c
560
Cell *intest(Node **a, int n) /* a[0] is index (list), a[1] is symtab */
usr.bin/awk/run.c
631
int n, ret;
usr.bin/awk/run.c
640
n = strlen(s);
usr.bin/awk/run.c
641
if (n >= 2 && ((c>>5) & 0x7) == 0x6 && (s[1] & 0xC0) == 0x80) {
usr.bin/awk/run.c
644
} else if (n >= 3 && ((c>>4) & 0xF) == 0xE && (s[1] & 0xC0) == 0x80
usr.bin/awk/run.c
649
} else if (n >= 4 && ((c>>3) & 0x1F) == 0x1E && (s[1] & 0xC0) == 0x80
usr.bin/awk/run.c
675
int i, len, n, totlen;
usr.bin/awk/run.c
678
n = strlen(s);
usr.bin/awk/run.c
680
for (i = 0; i < n; i += len) {
usr.bin/awk/run.c
688
if (i > n)
usr.bin/awk/run.c
689
FATAL("bad utf count [%s] n=%d i=%d\n", s, n, i);
usr.bin/awk/run.c
697
int n;
usr.bin/awk/run.c
701
n = u8_nextlen(s);
usr.bin/awk/run.c
702
s += n;
usr.bin/awk/run.c
703
bytenum += n;
usr.bin/awk/run.c
796
Cell *matchop(Node **a, int n) /* ~ and match() */
usr.bin/awk/run.c
805
if (n == MATCHFCN) {
usr.bin/awk/run.c
821
if (n == MATCHFCN) {
usr.bin/awk/run.c
842
} else if ((n == MATCH && i == 1) || (n == NOTMATCH && i == 0))
usr.bin/awk/run.c
852
Cell *boolop(Node **a, int n) /* a[0] || a[1], a[0] && a[1], !a[0] */
usr.bin/awk/run.c
860
switch (n) {
usr.bin/awk/run.c
879
FATAL("unknown boolean operator %d", n);
usr.bin/awk/run.c
884
Cell *relop(Node **a, int n) /* a[0 < a[1], etc. */
usr.bin/awk/run.c
896
if ((x_is_nan || y_is_nan) && n != NE)
usr.bin/awk/run.c
905
switch (n) {
usr.bin/awk/run.c
920
FATAL("unknown relational operator %d", n);
usr.bin/awk/run.c
955
Cell *indirect(Node **a, int n) /* $( a[0] ) */
usr.bin/awk/run.c
975
int k, m, n;
usr.bin/awk/tran.c
159
Array *makesymtab(int n) /* make a new symbol table */
usr.bin/awk/tran.c
165
tp = (Cell **) calloc(n, sizeof(*tp));
usr.bin/awk/tran.c
169
ap->size = n;
usr.bin/awk/tran.c
225
Cell *setsymtab(const char *n, const char *s, Awkfloat f, unsigned t, Array *tp)
usr.bin/awk/tran.c
230
if (n != NULL && (p = lookup(n, tp)) != NULL) {
usr.bin/awk/tran.c
237
FATAL("out of space for symbol table at %s", n);
usr.bin/awk/tran.c
238
p->nval = tostring(n);
usr.bin/awk/tran.c
247
h = hash(n, tp->size);
usr.bin/awk/tran.c
255
int hash(const char *s, int n) /* form hash value for string s */
usr.bin/awk/tran.c
261
return hashval % n;
usr.bin/awk/tran.c
427
int n;
usr.bin/awk/tran.c
467
n = (vp->sval = strdup(p)) ? 0 : -1; \
usr.bin/awk/tran.c
469
n = asprintf(&vp->sval, "%.30g", vp->fval); \
usr.bin/awk/tran.c
471
n = asprintf(&vp->sval, *fmt, vp->fval); \
usr.bin/awk/tran.c
472
if (n == -1) \
usr.bin/awk/tran.c
536
char *tostringN(const char *s, size_t n) /* make a copy of string s */
usr.bin/awk/tran.c
540
p = (char *) malloc(n);
usr.bin/awk/tran.c
542
FATAL("out of space in tostringN %zu", n);
usr.bin/awk/tran.c
543
if (strlcpy(p, s, n) >= n)
usr.bin/awk/tran.c
575
int c, n;
usr.bin/awk/tran.c
606
n = c - '0';
usr.bin/awk/tran.c
608
n = 8 * n + *++s - '0';
usr.bin/awk/tran.c
610
n = 8 * n + *++s - '0';
usr.bin/awk/tran.c
612
*bp++ = n;
usr.bin/bc/bc.y
303
ssize_t n;
usr.bin/bc/bc.y
306
n = node($10, cs("M"), $8, cs("s."),
usr.bin/bc/bc.y
309
n = node($10, $8, cs("s."), $6, $3,
usr.bin/bc/bc.y
312
emit_macro($3, n);
usr.bin/bc/bc.y
333
ssize_t n;
usr.bin/bc/bc.y
336
n = node($6, cs("M"), $4, $3, END_NODE);
usr.bin/bc/bc.y
338
n = node($6, $4, $3, END_NODE);
usr.bin/bc/bc.y
339
emit_macro($3, n);
usr.bin/bc/bc.y
382
int n = node(prologue, $8, epilogue,
usr.bin/bc/bc.y
385
emit_macro($1, n);
usr.bin/bc/bc.y
654
ssize_t n = node(cs("R"), $5, END_NODE);
usr.bin/bc/bc.y
655
emit_macro($3, n);
usr.bin/bc/bc.y
660
ssize_t n = node(cs("R"), $5, END_NODE);
usr.bin/bc/bc.y
661
emit_macro($3, n);
usr.bin/bc/bc.y
929
add_par(ssize_t n)
usr.bin/bc/bc.y
931
prologue = node(cs("S"), n, prologue, END_NODE);
usr.bin/bc/bc.y
932
epilogue = node(epilogue, cs("L"), n, cs("s."), END_NODE);
usr.bin/bc/bc.y
936
add_local(ssize_t n)
usr.bin/bc/bc.y
938
prologue = node(cs("0S"), n, prologue, END_NODE);
usr.bin/bc/bc.y
939
epilogue = node(epilogue, cs("L"), n, cs("s."), END_NODE);
usr.bin/bc/bc.y
946
int n;
usr.bin/bc/bc.y
949
n = asprintf(&str, "%s: %s:%d: %s: unexpected EOF",
usr.bin/bc/bc.y
952
n = asprintf(&str,
usr.bin/bc/bc.y
957
n = asprintf(&str,
usr.bin/bc/bc.y
961
n = asprintf(&str, "%s: %s:%d: %s: %s unexpected",
usr.bin/bc/bc.y
963
if (n == -1)
usr.bin/bgplg/bgplgsh.c
129
int i, c = 0, n;
usr.bin/bgplg/bgplgsh.c
131
if ((n = argc - off) < 0)
usr.bin/bgplg/bgplgsh.c
139
if ((new_argv = calloc(c + n + 1, sizeof(char *))) == NULL) {
usr.bin/bgplg/bgplgsh.c
149
for (i = n; i < argc; i++)
usr.bin/cal/cal.c
273
int a, b, c, s, e, f, g, d, n;
usr.bin/cal/cal.c
288
n = f + 3 - d;
usr.bin/cal/cal.c
290
if (n < 0)
usr.bin/cal/cal.c
292
else if (n > 364 + s)
usr.bin/cal/cal.c
295
return n/7 + 1;
usr.bin/calendar/day.c
582
struct fixs *n;
usr.bin/calendar/day.c
584
for (n = fnmonths; n->name; ++n)
usr.bin/calendar/day.c
585
if (!strncasecmp(s, n->name, n->len))
usr.bin/calendar/day.c
586
return ((n - fnmonths) + 1);
usr.bin/calendar/day.c
587
for (n = nmonths; n->name; ++n)
usr.bin/calendar/day.c
588
if (!strncasecmp(s, n->name, n->len))
usr.bin/calendar/day.c
589
return ((n - nmonths) + 1);
usr.bin/calendar/day.c
601
struct fixs *n;
usr.bin/calendar/day.c
603
for (n = fndays; n->name; ++n)
usr.bin/calendar/day.c
604
if (!strncasecmp(s, n->name, n->len))
usr.bin/calendar/day.c
605
return ((n - fndays) + 1);
usr.bin/calendar/day.c
606
for (n = ndays; n->name; ++n)
usr.bin/calendar/day.c
607
if (!strncasecmp(s, n->name, n->len))
usr.bin/calendar/day.c
608
return ((n - ndays) + 1);
usr.bin/cdio/cddb.c
110
char *n;
usr.bin/cdio/cddb.c
112
if (asprintf(&n, "%s%s", *p, copy_buffer) == -1)
usr.bin/cdio/cddb.c
115
*p = n;
usr.bin/cdio/cddb.c
234
verify_track_names(char **names, int n, struct cd_toc_entry *e)
usr.bin/cdio/cddb.c
238
for (i = 0; i < n; i++) {
usr.bin/cdio/cddb.c
245
cddb(const char *host_port, int n, struct cd_toc_entry *e, char *arg)
usr.bin/cdio/cddb.c
288
send_query(cout, n, e);
usr.bin/cdio/cddb.c
341
result = calloc(sizeof(char *), n + 1);
usr.bin/cdio/cddb.c
344
for (i = 0; i <= n; i++)
usr.bin/cdio/cddb.c
365
k = strtonum(line, 0, n - 1, &errstr);
usr.bin/cdio/cddb.c
371
verify_track_names(result, n, e);
usr.bin/cdio/cddb.c
64
cddb_discid(int n, struct cd_toc_entry *e)
usr.bin/cdio/cddb.c
70
for (i =0; i < n; i++)
usr.bin/cdio/cddb.c
73
((entry2time(e+n) - entry2time(e)) << 8) | n);
usr.bin/cdio/cddb.c
89
send_query(FILE *f, int n, struct cd_toc_entry *e)
usr.bin/cdio/cddb.c
93
fprintf(f, "cddb query %8lx %d", cddb_discid(n, e), n);
usr.bin/cdio/cddb.c
94
for (i = 0; i < n; i++)
usr.bin/cdio/cddb.c
96
fprintf(f, " %lu\r\n", (entry2frames(e+n)-entry2frames(e)) /75);
usr.bin/cdio/cdio.c
1008
toc2msf(n+1, &tm, &ts, &tf);
usr.bin/cdio/cdio.c
1187
int rc, n;
usr.bin/cdio/cdio.c
1195
n = h.ending_track - h.starting_track + 1;
usr.bin/cdio/cdio.c
1196
rc = read_toc_entrys((n + 1) * sizeof (struct cd_toc_entry));
usr.bin/cdio/cdio.c
1200
id = cddb_discid(n, toc_buffer);
usr.bin/cdio/cdio.c
1213
int rc, i, n;
usr.bin/cdio/cdio.c
1231
n = h.ending_track - h.starting_track + 1;
usr.bin/cdio/cdio.c
1232
rc = read_toc_entrys((n + 1) * sizeof (struct cd_toc_entry));
usr.bin/cdio/cdio.c
1241
for (i = 0; i < n; i++) {
usr.bin/cdio/cdio.c
1245
printf("%5d ", toc_buffer[n].track);
usr.bin/cdio/cdio.c
1246
prtrack(toc_buffer + n, 1, NULL);
usr.bin/cdio/cdio.c
1254
int rc, i, n;
usr.bin/cdio/cdio.c
1262
n = h.ending_track - h.starting_track + 1;
usr.bin/cdio/cdio.c
1263
rc = read_toc_entrys((n + 1) * sizeof (struct cd_toc_entry));
usr.bin/cdio/cdio.c
1271
track_names = cddb(cddb_host, n, toc_buffer, arg);
usr.bin/cdio/cdio.c
1277
for (i = 0; i < n; i++) {
usr.bin/cdio/cdio.c
1281
printf("%5d ", toc_buffer[n].track);
usr.bin/cdio/cdio.c
1282
prtrack(toc_buffer + n, 1, "");
usr.bin/cdio/cdio.c
205
char *s, n;
usr.bin/cdio/cdio.c
214
n = toupper((unsigned char)*s);
usr.bin/cdio/cdio.c
216
n = *s;
usr.bin/cdio/cdio.c
217
putchar(n);
usr.bin/cdio/cdio.c
690
unsigned int blk, len, n;
usr.bin/cdio/cdio.c
704
n = h.ending_track - h.starting_track + 1;
usr.bin/cdio/cdio.c
705
rc = read_toc_entrys((n + 1) * sizeof (struct cd_toc_entry));
usr.bin/cdio/cdio.c
735
len = msf2lba(toc_buffer[n].addr.msf.minute,
usr.bin/cdio/cdio.c
736
toc_buffer[n].addr.msf.second,
usr.bin/cdio/cdio.c
737
toc_buffer[n].addr.msf.frame) - blk;
usr.bin/cdio/cdio.c
739
len = toc_buffer[n].addr.lba - blk;
usr.bin/cdio/cdio.c
777
if (tr1 > n || tr2 > n) {
usr.bin/cdio/cdio.c
778
printf("Track number must be between 0 and %u\n", n);
usr.bin/cdio/cdio.c
956
if (tr1 > n || tr2 > n) {
usr.bin/cdio/cdio.c
957
printf("Track number must be between 0 and %u\n", n);
usr.bin/cdio/cdio.c
986
toc2msf(n+1, &tm, &ts, &tf);
usr.bin/cdio/rip.c
122
int i, base, n;
usr.bin/cdio/rip.c
124
n = nxt - start;
usr.bin/cdio/rip.c
126
if (n > 3 || n < 1)
usr.bin/cdio/rip.c
135
for (i = 0; i < n; i++) {
usr.bin/cdio/rip.c
136
*val += base * (start[n - i - 1] - '0');
usr.bin/cdio/rip.c
598
u_int n;
usr.bin/cdio/rip.c
610
n = h.ending_track - h.starting_track + 1;
usr.bin/cdio/rip.c
611
rc = read_toc_entrys((n + 1) * sizeof(struct cd_toc_entry));
usr.bin/cdio/rip.c
631
rc = rip_tracks_loop(tp, n, next_track);
usr.bin/col/col.c
525
xreallocarray(void *p, size_t n, size_t size)
usr.bin/col/col.c
528
if (!(p = reallocarray(p, n, size)))
usr.bin/csplit/csplit.c
294
toomuch(FILE *ofp, long n)
usr.bin/csplit/csplit.c
313
if (n == 0)
usr.bin/csplit/csplit.c
317
lineno -= n;
usr.bin/csplit/csplit.c
335
if (buf[nread - i] == '\n' && n-- == 0)
usr.bin/csplit/csplit.c
339
} while (n > 0);
usr.bin/ctfconv/dw.c
134
size_t n;
usr.bin/ctfconv/dw.c
139
n = end - d->buf + 1;
usr.bin/ctfconv/dw.c
141
d->buf += n;
usr.bin/ctfconv/dw.c
142
d->len -= n;
usr.bin/ctfconv/dw.c
147
dw_read_buf(struct dwbuf *d, struct dwbuf *v, size_t n)
usr.bin/ctfconv/dw.c
149
if (d->len < n)
usr.bin/ctfconv/dw.c
152
v->len = n;
usr.bin/ctfconv/dw.c
153
d->buf += n;
usr.bin/ctfconv/dw.c
154
d->len -= n;
usr.bin/ctfconv/dw.c
159
dw_skip_bytes(struct dwbuf *d, size_t n)
usr.bin/ctfconv/dw.c
161
if (d->len < n)
usr.bin/ctfconv/dw.c
163
d->buf += n;
usr.bin/ctfconv/dw.c
164
d->len -= n;
usr.bin/ctfconv/dw.c
62
dw_read_bytes(struct dwbuf *d, void *v, size_t n)
usr.bin/ctfconv/dw.c
64
if (d->len < n)
usr.bin/ctfconv/dw.c
66
memcpy(v, d->buf, n);
usr.bin/ctfconv/dw.c
67
d->buf += n;
usr.bin/ctfconv/dw.c
68
d->len -= n;
usr.bin/ctfconv/hash.c
62
struct _hash_record *n;
usr.bin/ctfconv/hash.c
79
n = calloc(ns, sizeof(struct _hash_record));
usr.bin/ctfconv/hash.c
80
if (!n)
usr.bin/ctfconv/hash.c
87
while (n[i].p != NULL) {
usr.bin/ctfconv/hash.c
92
n[i].hv = h->t[j].hv;
usr.bin/ctfconv/hash.c
93
n[i].p = h->t[j].p;
usr.bin/ctfconv/hash.c
97
h->t = n;
usr.bin/ctfconv/parse.c
225
size_t n;
usr.bin/ctfconv/parse.c
227
if ((n = strlcpy(it->it_name, name, ITNAME_MAX)) > ITNAME_MAX)
usr.bin/ctfconv/parse.c
228
warnx("name %s too long %zd > %d", name, n, ITNAME_MAX);
usr.bin/ctfconv/parse.c
425
size_t n;
usr.bin/ctfconv/parse.c
427
n = strlcpy(im->im_name, name, ITNAME_MAX);
usr.bin/ctfconv/parse.c
428
if (n > ITNAME_MAX)
usr.bin/ctfconv/parse.c
429
warnx("name %s too long %zd > %d", name, n,
usr.bin/cu/input.c
52
ssize_t n;
usr.bin/cu/input.c
69
n = read(STDIN_FILENO, &c, 1);
usr.bin/cu/input.c
70
if (n == -1 && errno != EINTR)
usr.bin/cu/input.c
72
if (n != 1 || input_stop)
usr.bin/cu/xmodem.c
102
buf += n;
usr.bin/cu/xmodem.c
103
len -= n;
usr.bin/cu/xmodem.c
93
ssize_t n;
usr.bin/cu/xmodem.c
96
n = write(line_fd, buf, len);
usr.bin/cu/xmodem.c
97
if (n == -1) {
usr.bin/cut/cut.c
159
int dash, n;
usr.bin/cut/cut.c
166
n = strtonum(*p, 1, _POSIX2_LINE_MAX, &errstr);
usr.bin/cut/cut.c
174
return n;
usr.bin/cvs/atomicio.c
41
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
usr.bin/cvs/atomicio.c
50
while (n > pos) {
usr.bin/cvs/atomicio.c
51
res = (f) (fd, s + pos, n - pos);
usr.bin/cvs/diff3.c
278
size_t m, n;
usr.bin/cvs/diff3.c
305
n = readin(fds[1], &d23);
usr.bin/cvs/diff3.c
314
return (merge(m, n));
usr.bin/cvs/diff3.c
510
get_line(FILE *b, size_t *n)
usr.bin/cvs/diff3.c
531
if (n != NULL)
usr.bin/cvs/diff3.c
532
*n = len;
usr.bin/cvs/diff3.c
713
size_t j, n;
usr.bin/cvs/diff3.c
716
for (n = 0; cline[i] < from - 1; n += j) {
usr.bin/cvs/diff3.c
723
return ((int) n);
usr.bin/cvs/diff3.c
791
edscript(int n)
usr.bin/cvs/diff3.c
796
for (; n > 0; n--) {
usr.bin/cvs/diff3.c
797
if (!oflag || !overlap[n])
usr.bin/cvs/diff3.c
798
prange(&de[n].old);
usr.bin/cvs/diff3.c
800
diff_output("%da\n=======\n", de[n].old.to -1);
usr.bin/cvs/diff3.c
801
(void)fseek(fp[2], (long)de[n].new.from, SEEK_SET);
usr.bin/cvs/diff3.c
802
for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {
usr.bin/cvs/diff3.c
817
if (!oflag || !overlap[n])
usr.bin/cvs/diff3.c
821
diff_output("%da\n%s\n.\n", de[n].old.from - 1, f1mark);
usr.bin/cvs/diff_internals.c
496
equiv(struct line *a, int n, struct line *b, int m, int *c)
usr.bin/cvs/diff_internals.c
501
while (i <= n && j <= m) {
usr.bin/cvs/diff_internals.c
509
while (i <= n)
usr.bin/cvs/diff_internals.c
525
isqrt(int n)
usr.bin/cvs/diff_internals.c
529
if (n == 0)
usr.bin/cvs/diff_internals.c
534
x = n / x;
usr.bin/cvs/diff_internals.c
543
stone(int *a, int n, int *b, int *c, int flags)
usr.bin/cvs/diff_internals.c
552
sq = isqrt(n);
usr.bin/cvs/diff_internals.c
558
for (i = 1; i <= n; i++) {
usr.bin/cvs/diff_internals.c
750
sort(struct line *a, int n)
usr.bin/cvs/diff_internals.c
755
if (n == 0)
usr.bin/cvs/diff_internals.c
757
for (j = 1; j <= n; j *= 2)
usr.bin/cvs/diff_internals.c
760
k = n - m;
usr.bin/cvs/rcs.h
106
#define RCSNUM_ISBRANCH(n) ((n)->rn_len % 2)
usr.bin/cvs/rcs.h
107
#define RCSNUM_ISBRANCHREV(n) (!((n)->rn_len % 2) && ((n)->rn_len >= 4))
usr.bin/dc/bcode.c
1258
struct number *n;
usr.bin/dc/bcode.c
1264
n = pop_number();
usr.bin/dc/bcode.c
1265
if (n == NULL)
usr.bin/dc/bcode.c
1267
if (BN_is_zero(n->number)) {
usr.bin/dc/bcode.c
1270
} else if (BN_is_negative(n->number))
usr.bin/dc/bcode.c
1273
scale = max(bmachine.scale, n->scale);
usr.bin/dc/bcode.c
1274
normalize(n, 2*scale);
usr.bin/dc/bcode.c
1275
x = BN_dup(n->number);
usr.bin/dc/bcode.c
1281
bn_check(BN_div(y, NULL, n->number, x, bmachine.ctx));
usr.bin/dc/bcode.c
1297
free_number(n);
usr.bin/dc/bcode.c
1511
struct number *n;
usr.bin/dc/bcode.c
1514
n = pop_number();
usr.bin/dc/bcode.c
1515
if (n == NULL)
usr.bin/dc/bcode.c
1517
i = get_ulong(n);
usr.bin/dc/bcode.c
1518
free_number(n);
usr.bin/dc/bcode.c
1534
struct number *n;
usr.bin/dc/bcode.c
1537
n = pop_number();
usr.bin/dc/bcode.c
1538
if (n == NULL)
usr.bin/dc/bcode.c
1540
i = get_ulong(n);
usr.bin/dc/bcode.c
317
pn(const char *str, const struct number *n)
usr.bin/dc/bcode.c
319
char *p = BN_bn2dec(n->number);
usr.bin/dc/bcode.c
323
(void)fprintf(stderr, " %s (%u)\n" , p, n->scale);
usr.bin/dc/bcode.c
328
pbn(const char *str, const BIGNUM *n)
usr.bin/dc/bcode.c
330
char *p = BN_bn2dec(n);
usr.bin/dc/bcode.c
352
scale_number(BIGNUM *n, int s)
usr.bin/dc/bcode.c
363
bn_check(BN_mul_word(n, factors[abs_scale]));
usr.bin/dc/bcode.c
365
(void)BN_div_word(n, factors[abs_scale]);
usr.bin/dc/bcode.c
378
bn_check(BN_mul(n, n, a, bmachine.ctx));
usr.bin/dc/bcode.c
380
bn_check(BN_div(n, NULL, n, a, bmachine.ctx));
usr.bin/dc/bcode.c
387
split_number(const struct number *n, BIGNUM *i, BIGNUM *f)
usr.bin/dc/bcode.c
391
bn_checkp(BN_copy(i, n->number));
usr.bin/dc/bcode.c
393
if (n->scale == 0) {
usr.bin/dc/bcode.c
396
} else if (n->scale < nitems(factors)) {
usr.bin/dc/bcode.c
397
rem = BN_div_word(i, factors[n->scale]);
usr.bin/dc/bcode.c
409
bn_check(BN_set_word(p, n->scale));
usr.bin/dc/bcode.c
411
bn_check(BN_div(i, f, n->number, a, bmachine.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
571
struct number *n;
usr.bin/dc/bcode.c
573
n = new_number();
usr.bin/dc/bcode.c
574
bn_check(BN_set_word(n->number, bmachine.scale));
usr.bin/dc/bcode.c
575
push_number(n);
usr.bin/dc/bcode.c
581
struct number *n;
usr.bin/dc/bcode.c
584
n = pop_number();
usr.bin/dc/bcode.c
585
if (n != NULL) {
usr.bin/dc/bcode.c
586
if (BN_is_negative(n->number))
usr.bin/dc/bcode.c
589
scale = get_ulong(n);
usr.bin/dc/bcode.c
595
free_number(n);
usr.bin/dc/bcode.c
602
struct number *n;
usr.bin/dc/bcode.c
604
n = new_number();
usr.bin/dc/bcode.c
605
bn_check(BN_set_word(n->number, bmachine.obase));
usr.bin/dc/bcode.c
606
push_number(n);
usr.bin/dc/bcode.c
612
struct number *n;
usr.bin/dc/bcode.c
615
n = pop_number();
usr.bin/dc/bcode.c
616
if (n != NULL) {
usr.bin/dc/bcode.c
617
base = get_ulong(n);
usr.bin/dc/bcode.c
622
free_number(n);
usr.bin/dc/bcode.c
629
struct number *n;
usr.bin/dc/bcode.c
631
n = new_number();
usr.bin/dc/bcode.c
632
bn_check(BN_set_word(n->number, bmachine.ibase));
usr.bin/dc/bcode.c
633
push_number(n);
usr.bin/dc/bcode.c
639
struct number *n;
usr.bin/dc/bcode.c
642
n = pop_number();
usr.bin/dc/bcode.c
643
if (n != NULL) {
usr.bin/dc/bcode.c
644
base = get_ulong(n);
usr.bin/dc/bcode.c
650
free_number(n);
usr.bin/dc/bcode.c
658
struct number *n;
usr.bin/dc/bcode.c
661
n = new_number();
usr.bin/dc/bcode.c
662
bn_check(BN_set_word(n->number, i));
usr.bin/dc/bcode.c
663
push_number(n);
usr.bin/dc/bcode.c
671
struct number *n;
usr.bin/dc/bcode.c
685
n = new_number();
usr.bin/dc/bcode.c
686
bn_check(BN_set_word(n->number, scale));
usr.bin/dc/bcode.c
687
push_number(n);
usr.bin/dc/bcode.c
692
count_digits(const struct number *n)
usr.bin/dc/bcode.c
699
if (BN_is_zero(n->number))
usr.bin/dc/bcode.c
700
return n->scale;
usr.bin/dc/bcode.c
705
split_number(n, int_part, NULL);
usr.bin/dc/bcode.c
739
return d + n->scale;
usr.bin/dc/bcode.c
747
struct number *n = NULL;
usr.bin/dc/bcode.c
756
n = new_number();
usr.bin/dc/bcode.c
757
bn_check(BN_set_word(n->number, digits));
usr.bin/dc/bcode.c
761
n = new_number();
usr.bin/dc/bcode.c
762
bn_check(BN_set_word(n->number, digits));
usr.bin/dc/bcode.c
766
push_number(n);
usr.bin/dc/bcode.c
775
struct number *n;
usr.bin/dc/bcode.c
784
n = value->u.num;
usr.bin/dc/bcode.c
785
normalize(n, 0);
usr.bin/dc/bcode.c
786
if (BN_num_bits(n->number) > 8)
usr.bin/dc/bcode.c
787
bn_check(BN_mask_bits(n->number, 8));
usr.bin/dc/bcode.c
788
str[0] = (char)BN_get_word(n->number);
usr.bin/dc/bcode.c
826
struct number *n;
usr.bin/dc/bcode.c
832
n = new_number();
usr.bin/dc/bcode.c
833
bn_check(BN_set_word(n->number, 0));
usr.bin/dc/bcode.c
834
push_number(n);
usr.bin/dc/bcode.c
897
struct number *inumber, *n;
usr.bin/dc/bcode.c
916
n = new_number();
usr.bin/dc/bcode.c
917
bn_check(BN_set_word(n->number, 0));
usr.bin/dc/bcode.c
918
push_number(n);
usr.bin/dc/inout.c
180
struct number *n;
usr.bin/dc/inout.c
187
n = new_number();
usr.bin/dc/inout.c
188
bn_check(BN_set_word(n->number, 0));
usr.bin/dc/inout.c
209
n->scale++;
usr.bin/dc/inout.c
211
bn_check(BN_mul_word(n->number, base));
usr.bin/dc/inout.c
217
bn_check(BN_add_word(n->number, v));
usr.bin/dc/inout.c
220
scale_number(n->number, n->scale);
usr.bin/dc/inout.c
221
for (i = 0; i < n->scale; i++)
usr.bin/dc/inout.c
222
(void)BN_div_word(n->number, base);
usr.bin/dc/inout.c
225
negate(n);
usr.bin/dc/inout.c
226
return n;
usr.bin/dc/inout.c
412
print_ascii(FILE *f, const struct number *n)
usr.bin/dc/inout.c
416
numbits = BN_num_bytes(n->number) * 8;
usr.bin/dc/inout.c
420
ch |= BN_is_bit_set(n->number, numbits-i-1) << (7 - i);
usr.bin/dc/mem.c
30
struct number *n;
usr.bin/dc/mem.c
32
n = bmalloc(sizeof(*n));
usr.bin/dc/mem.c
33
n->scale = 0;
usr.bin/dc/mem.c
34
n->number = BN_new();
usr.bin/dc/mem.c
35
bn_checkp(n->number);
usr.bin/dc/mem.c
36
return n;
usr.bin/dc/mem.c
40
free_number(struct number *n)
usr.bin/dc/mem.c
42
BN_free(n->number);
usr.bin/dc/mem.c
43
free(n);
usr.bin/dc/mem.c
49
struct number *n;
usr.bin/dc/mem.c
51
n = bmalloc(sizeof(*n));
usr.bin/dc/mem.c
52
n->scale = a->scale;
usr.bin/dc/mem.c
53
n->number = BN_dup(a->number);
usr.bin/dc/mem.c
54
bn_checkp(n->number);
usr.bin/dc/mem.c
55
return n;
usr.bin/dc/stack.c
280
struct array *n;
usr.bin/dc/stack.c
285
n = array_new();
usr.bin/dc/stack.c
286
array_grow(n, a->size);
usr.bin/dc/stack.c
288
(void)stack_dup_value(&a->data[i], &n->data[i]);
usr.bin/dc/stack.c
289
return n;
usr.bin/dc/stack.c
326
struct value n;
usr.bin/dc/stack.c
329
n.type = BCODE_NONE;
usr.bin/dc/stack.c
330
n.array = NULL;
usr.bin/dc/stack.c
331
stack_push(stack, &n);
usr.bin/deroff/deroff.c
692
int n, i;
usr.bin/deroff/deroff.c
704
n = atoi(a);
usr.bin/deroff/deroff.c
706
n = 1;
usr.bin/deroff/deroff.c
707
for (i = 0; i < n;) {
usr.bin/diff/diffreg.c
545
equiv(struct line *a, int n, struct line *b, int m, int *c)
usr.bin/diff/diffreg.c
550
while (i <= n && j <= m) {
usr.bin/diff/diffreg.c
558
while (i <= n)
usr.bin/diff/diffreg.c
574
isqrt(int n)
usr.bin/diff/diffreg.c
578
if (n == 0)
usr.bin/diff/diffreg.c
583
x = n / x;
usr.bin/diff/diffreg.c
592
stone(int *a, int n, int *b, int *c, int flags)
usr.bin/diff/diffreg.c
601
sq = isqrt(n);
usr.bin/diff/diffreg.c
607
for (i = 1; i <= n; i++) {
usr.bin/diff/diffreg.c
803
sort(struct line *a, int n)
usr.bin/diff/diffreg.c
808
if (n == 0)
usr.bin/diff/diffreg.c
810
for (j = 1; j <= n; j *= 2)
usr.bin/diff/diffreg.c
813
k = n - m;
usr.bin/diff3/diff3prog.c
146
int ch, i, m, n;
usr.bin/diff3/diff3prog.c
188
n = readin(argv[1], &d23);
usr.bin/diff3/diff3prog.c
193
merge(m, n);
usr.bin/diff3/diff3prog.c
268
get_line(FILE *b, size_t *n)
usr.bin/diff3/diff3prog.c
290
if (n != NULL)
usr.bin/diff3/diff3prog.c
291
*n = len;
usr.bin/diff3/diff3prog.c
464
size_t j, n;
usr.bin/diff3/diff3prog.c
467
for (n = 0; cline[i] < from - 1; n += j) {
usr.bin/diff3/diff3prog.c
474
return ((int) n);
usr.bin/diff3/diff3prog.c
548
edscript(int n)
usr.bin/diff3/diff3prog.c
553
for (; n > 0; n--) {
usr.bin/diff3/diff3prog.c
554
if (!oflag || !overlap[n])
usr.bin/diff3/diff3prog.c
555
prange(&de[n].old);
usr.bin/diff3/diff3prog.c
557
printf("%da\n=======\n", de[n].old.to -1);
usr.bin/diff3/diff3prog.c
558
(void)fseek(fp[2], (long)de[n].new.from, SEEK_SET);
usr.bin/diff3/diff3prog.c
559
for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {
usr.bin/diff3/diff3prog.c
572
if (!oflag || !overlap[n])
usr.bin/diff3/diff3prog.c
576
printf("%da\n%s\n.\n", de[n].old.from - 1, f1mark);
usr.bin/dig/dig.c
1113
n = strlcpy(sitvalue, value,
usr.bin/dig/dig.c
1115
if (n >= sizeof(sitvalue))
usr.bin/dig/dig.c
651
size_t n;
usr.bin/dig/dighost.c
2735
dig_lookup_t *l, *n;
usr.bin/dig/dighost.c
2776
n = requeue_lookup(l, 1);
usr.bin/dig/dighost.c
2777
n->eoferr++;
usr.bin/dig/dighost.c
2995
query->byte_count += sevent->n;
usr.bin/dig/dighost.c
3102
dighost_received(sevent->n, &sevent->address, query);
usr.bin/dig/dighost.c
3214
dig_lookup_t *n, *l;
usr.bin/dig/dighost.c
3272
n = requeue_lookup(l, 1);
usr.bin/dig/dighost.c
3273
n->eoferr++;
usr.bin/dig/dighost.c
3456
n = requeue_lookup(l, 1);
usr.bin/dig/dighost.c
3458
n->rdtype = l->qrdtype;
usr.bin/dig/dighost.c
3472
n = requeue_lookup(l, 1);
usr.bin/dig/dighost.c
3473
n->tcp_mode = 1;
usr.bin/dig/dighost.c
3475
n->rdtype = l->qrdtype;
usr.bin/dig/dighost.c
3769
dig_lookup_t *l, *n;
usr.bin/dig/dighost.c
3808
n = ISC_LIST_NEXT(l, link);
usr.bin/dig/dighost.c
3811
l = n;
usr.bin/dig/lib/dns/compress.c
108
for (n = 0; n < labels - 1; n++) {
usr.bin/dig/lib/dns/compress.c
109
dns_name_getlabelsequence(name, n, labels - n, &tname);
usr.bin/dig/lib/dns/compress.c
133
if (n == 0)
usr.bin/dig/lib/dns/compress.c
136
dns_name_getlabelsequence(name, 0, n, prefix);
usr.bin/dig/lib/dns/compress.c
148
unsigned int n;
usr.bin/dig/lib/dns/compress.c
160
n = dns_name_countlabels(name);
usr.bin/dig/lib/dns/compress.c
169
dns_name_getlabelsequence(name, start, n, &tname);
usr.bin/dig/lib/dns/compress.c
191
n--;
usr.bin/dig/lib/dns/compress.c
94
unsigned int labels, hash, n;
usr.bin/dig/lib/dns/dst_api.c
280
dst_key_sigsize(const dst_key_t *key, unsigned int *n) {
usr.bin/dig/lib/dns/dst_api.c
282
REQUIRE(n != NULL);
usr.bin/dig/lib/dns/dst_api.c
287
*n = ISC_SHA1_DIGESTLENGTH;
usr.bin/dig/lib/dns/dst_api.c
290
*n = ISC_SHA224_DIGESTLENGTH;
usr.bin/dig/lib/dns/dst_api.c
293
*n = ISC_SHA256_DIGESTLENGTH;
usr.bin/dig/lib/dns/dst_api.c
296
*n = ISC_SHA384_DIGESTLENGTH;
usr.bin/dig/lib/dns/dst_api.c
299
*n = ISC_SHA512_DIGESTLENGTH;
usr.bin/dig/lib/dns/gen.c
294
int type, n;
usr.bin/dig/lib/dns/gen.c
305
n = snprintf(buf, sizeof(buf), "%s_%d.%c", typename,
usr.bin/dig/lib/dns/gen.c
307
INSIST(n > 0 && (unsigned)n < sizeof(buf));
usr.bin/dig/lib/dns/gen.c
335
int c, n;
usr.bin/dig/lib/dns/gen.c
386
n = snprintf(srcdir, sizeof(srcdir), "%s/",
usr.bin/dig/lib/dns/gen.c
388
INSIST(n > 0 && (unsigned)n < sizeof(srcdir));
usr.bin/dig/lib/dns/gen.c
403
n = snprintf(buf, sizeof(buf), "%srdata", srcdir);
usr.bin/dig/lib/dns/gen.c
404
INSIST(n > 0 && (unsigned)n < sizeof(srcdir));
usr.bin/dig/lib/dns/gen.c
416
n = snprintf(buf, sizeof(buf), "%srdata/%s_%d",
usr.bin/dig/lib/dns/gen.c
418
INSIST(n > 0 && (unsigned)n < sizeof(buf));
usr.bin/dig/lib/dns/gen.c
425
n = snprintf(buf, sizeof(buf), "%srdata/generic", srcdir);
usr.bin/dig/lib/dns/gen.c
426
INSIST(n > 0 && (unsigned)n < sizeof(srcdir));
usr.bin/dig/lib/dns/gen.c
431
n = snprintf(year, sizeof(year), "-%d",
usr.bin/dig/lib/dns/gen.c
433
INSIST(n > 0 && (unsigned)n < sizeof(year));
usr.bin/dig/lib/dns/include/dns/name.h
431
dns_name_getlabel(const dns_name_t *name, unsigned int n, dns_label_t *label);
usr.bin/dig/lib/dns/include/dns/name.h
450
unsigned int n, dns_name_t *target);
usr.bin/dig/lib/dns/include/dst/dst.h
288
dst_key_sigsize(const dst_key_t *key, unsigned int *n);
usr.bin/dig/lib/dns/masterdump.c
120
int n = t;
usr.bin/dig/lib/dns/masterdump.c
121
if (n > N_TABS)
usr.bin/dig/lib/dns/masterdump.c
122
n = N_TABS;
usr.bin/dig/lib/dns/masterdump.c
123
memmove(p, tabs, n);
usr.bin/dig/lib/dns/masterdump.c
124
p += n;
usr.bin/dig/lib/dns/masterdump.c
125
t -= n;
usr.bin/dig/lib/dns/masterdump.c
141
int n = t;
usr.bin/dig/lib/dns/masterdump.c
142
if (n > N_SPACES)
usr.bin/dig/lib/dns/masterdump.c
143
n = N_SPACES;
usr.bin/dig/lib/dns/masterdump.c
144
memmove(p, spaces, n);
usr.bin/dig/lib/dns/masterdump.c
145
p += n;
usr.bin/dig/lib/dns/masterdump.c
146
t -= n;
usr.bin/dig/lib/dns/name.c
1205
unsigned int nused, labels, n, nmax;
usr.bin/dig/lib/dns/name.c
1241
n = 0;
usr.bin/dig/lib/dns/name.c
1292
n = c;
usr.bin/dig/lib/dns/name.c
1317
n--;
usr.bin/dig/lib/dns/name.c
1318
if (n == 0)
usr.bin/dig/lib/dns/name.c
531
dns_name_getlabel(const dns_name_t *name, unsigned int n, dns_label_t *label) {
usr.bin/dig/lib/dns/name.c
540
REQUIRE(n < name->labels);
usr.bin/dig/lib/dns/name.c
545
label->base = &name->ndata[offsets[n]];
usr.bin/dig/lib/dns/name.c
546
if (n == name->labels - 1)
usr.bin/dig/lib/dns/name.c
547
label->length = name->length - offsets[n];
usr.bin/dig/lib/dns/name.c
549
label->length = offsets[n + 1] - offsets[n];
usr.bin/dig/lib/dns/name.c
554
unsigned int first, unsigned int n,
usr.bin/dig/lib/dns/name.c
567
REQUIRE(n <= source->labels - first); /* note first+n could overflow */
usr.bin/dig/lib/dns/name.c
577
if (first + n == source->labels)
usr.bin/dig/lib/dns/name.c
580
endoffset = offsets[first + n];
usr.bin/dig/lib/dns/name.c
585
if (first + n == source->labels && n > 0 &&
usr.bin/dig/lib/dns/name.c
591
target->labels = n;
usr.bin/dig/lib/dns/rdata.c
1108
unsigned int n;
usr.bin/dig/lib/dns/rdata.c
1118
n = *sp++;
usr.bin/dig/lib/dns/rdata.c
1120
REQUIRE(n + 1 <= source->length);
usr.bin/dig/lib/dns/rdata.c
1121
if (n == 0U)
usr.bin/dig/lib/dns/rdata.c
1130
while (n--) {
usr.bin/dig/lib/dns/rdata.c
1176
unsigned int n;
usr.bin/dig/lib/dns/rdata.c
1183
n = *sregion.base + 1;
usr.bin/dig/lib/dns/rdata.c
1184
if (n > sregion.length)
usr.bin/dig/lib/dns/rdata.c
1188
if (n > tregion.length)
usr.bin/dig/lib/dns/rdata.c
1192
memmove(tregion.base, sregion.base, n);
usr.bin/dig/lib/dns/rdata.c
1193
isc_buffer_forward(source, n);
usr.bin/dig/lib/dns/rdata.c
1194
isc_buffer_add(target, n);
usr.bin/dig/lib/dns/rdata.c
1204
unsigned int n0, n;
usr.bin/dig/lib/dns/rdata.c
1219
n = source->length;
usr.bin/dig/lib/dns/rdata.c
1222
while (n--) {
usr.bin/dig/lib/dns/rdata.c
842
unsigned int n;
usr.bin/dig/lib/dns/rdata.c
845
n = source->length;
usr.bin/dig/lib/dns/rdata.c
847
if (n == 0)
usr.bin/dig/lib/dns/rdata.c
851
if ((size_t)snprintf(lookup, sizeof(lookup), "%.*s", n, source->base)
usr.bin/dig/lib/dns/rdata.c
867
if (n > 4 && strncasecmp("type", lookup, 4) == 0) {
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
106
isc_region_consume(&sr, n);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
111
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
113
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
119
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
121
RETERR(dns_tsigrcode_totext((dns_rcode_t)n, target));
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
126
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
128
snprintf(buf, sizeof(buf), " %u ", n);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
144
unsigned long n;
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
175
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
176
if (sr.length < n + 2)
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
178
RETERR(isc_mem_tobuffer(target, sr.base, n + 2));
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
179
isc_region_consume(&sr, n + 2);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
180
isc_buffer_forward(source, n + 2);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
196
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
197
if (sr.length < n + 2)
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
199
isc_buffer_forward(source, n + 2);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
200
return (isc_mem_tobuffer(target, sr.base, n + 2));
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
34
unsigned short n;
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
75
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
77
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
83
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
85
snprintf(buf, sizeof(buf), "%u", n);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
91
REQUIRE(n <= sr.length);
usr.bin/dig/lib/dns/rdata/any_255/tsig_250.c
93
sigr.length = n;
usr.bin/dig/lib/dns/rdata/generic/cert_37.c
30
unsigned int n;
usr.bin/dig/lib/dns/rdata/generic/cert_37.c
42
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/cert_37.c
44
RETERR(dns_cert_totext((dns_cert_t)n, target));
usr.bin/dig/lib/dns/rdata/generic/cert_37.c
50
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/cert_37.c
52
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
24
uint32_t n;
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
37
n = uint32_fromregion(®ion);
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
39
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
45
n = uint32_fromregion(®ion);
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
47
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
53
n = uint8_fromregion(®ion);
usr.bin/dig/lib/dns/rdata/generic/doa_259.c
55
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
33
unsigned int n;
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
44
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
46
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
52
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
54
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
60
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/ds_43.c
62
snprintf(buf, sizeof(buf), "%u", n);
usr.bin/dig/lib/dns/rdata/generic/naptr_35.c
114
n = isc_regex_validate(regex);
usr.bin/dig/lib/dns/rdata/generic/naptr_35.c
115
if (n < 0 || nsub > (unsigned int)n)
usr.bin/dig/lib/dns/rdata/generic/naptr_35.c
42
int n;
usr.bin/dig/lib/dns/rdata/generic/sshfp_44.c
28
unsigned int n;
usr.bin/dig/lib/dns/rdata/generic/sshfp_44.c
40
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/sshfp_44.c
42
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/sshfp_44.c
48
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/sshfp_44.c
50
snprintf(buf, sizeof(buf), "%u", n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
100
REQUIRE(n <= sr.length);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
102
dr.length = n;
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
115
isc_region_consume(&sr, n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
120
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
122
snprintf(buf, sizeof(buf), "%lu", n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
128
REQUIRE(n <= sr.length);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
129
if (n != 0U) {
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
131
dr.length = n;
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
149
unsigned long n;
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
183
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
184
if (sr.length < n + 2)
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
186
RETERR(isc_mem_tobuffer(target, sr.base, n + 2));
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
187
isc_region_consume(&sr, n + 2);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
188
isc_buffer_forward(source, n + 2);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
195
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
196
if (sr.length < n + 2)
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
198
isc_buffer_forward(source, n + 2);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
199
return (isc_mem_tobuffer(target, sr.base, n + 2));
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
32
unsigned long n;
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
56
n = uint32_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
58
snprintf(buf, sizeof(buf), "%lu ", n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
64
n = uint32_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
66
snprintf(buf, sizeof(buf), "%lu ", n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
72
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
74
snprintf(buf, sizeof(buf), "%lu ", n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
80
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
82
if (dns_tsigrcode_totext((dns_rcode_t)n, target) == ISC_R_SUCCESS)
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
85
snprintf(buf, sizeof(buf), "%lu ", n);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
92
n = uint16_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tkey_249.c
94
snprintf(buf, sizeof(buf), "%lu", n);
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
26
unsigned int n;
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
37
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
39
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
45
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
47
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
53
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/tlsa_52.c
55
snprintf(buf, sizeof(buf), "%u", n);
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
30
uint32_t n;
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
38
n = uint32_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
40
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
44
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
46
snprintf(buf, sizeof(buf), "%u ", n);
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
50
n = uint8_fromregion(&sr);
usr.bin/dig/lib/dns/rdata/generic/zonemd_63.c
52
snprintf(buf, sizeof(buf), "%u", n);
usr.bin/dig/lib/dns/rdata/in_1/apl_42.c
35
int n;
usr.bin/dig/lib/dns/rdata/in_1/apl_42.c
56
n = snprintf(txt, sizeof(txt), "%s%s%u:", sep,
usr.bin/dig/lib/dns/rdata/in_1/apl_42.c
58
INSIST(n < (int)sizeof(txt));
usr.bin/dig/lib/dns/rdata/in_1/apl_42.c
80
n = snprintf(txt, sizeof(txt), "/%u", prefix);
usr.bin/dig/lib/dns/rdata/in_1/apl_42.c
81
INSIST(n < (int)sizeof(txt));
usr.bin/dig/lib/dns/rdata/in_1/dhcid_49.c
28
size_t n;
usr.bin/dig/lib/dns/rdata/in_1/dhcid_49.c
47
n = snprintf(buf, sizeof(buf), " ; %u %u %u",
usr.bin/dig/lib/dns/rdata/in_1/dhcid_49.c
50
INSIST(n < sizeof(buf));
usr.bin/dig/lib/isc/base32.c
209
int n = 5;
usr.bin/dig/lib/isc/base32.c
214
n = ctx->seen_32;
usr.bin/dig/lib/isc/base32.c
221
RETERR(isc_mem_tobuffer(ctx->target, buf, n));
usr.bin/dig/lib/isc/base32.c
223
if (n > ctx->length)
usr.bin/dig/lib/isc/base32.c
226
ctx->length -= n;
usr.bin/dig/lib/isc/base64.c
117
int n;
usr.bin/dig/lib/isc/base64.c
134
n = (ctx->val[2] == 64) ? 1 :
usr.bin/dig/lib/isc/base64.c
136
if (n != 3) {
usr.bin/dig/lib/isc/base64.c
146
RETERR(isc_mem_tobuffer(ctx->target, buf, n));
usr.bin/dig/lib/isc/base64.c
148
if (n > ctx->length)
usr.bin/dig/lib/isc/base64.c
151
ctx->length -= n;
usr.bin/dig/lib/isc/buffer.c
127
isc__buffer_setactive(isc_buffer_t *b, unsigned int n) {
usr.bin/dig/lib/isc/buffer.c
132
REQUIRE(b->current + n <= b->used);
usr.bin/dig/lib/isc/buffer.c
134
ISC__BUFFER_SETACTIVE(b, n);
usr.bin/dig/lib/isc/buffer.c
147
isc__buffer_forward(isc_buffer_t *b, unsigned int n) {
usr.bin/dig/lib/isc/buffer.c
152
REQUIRE(b->current + n <= b->used);
usr.bin/dig/lib/isc/buffer.c
154
ISC__BUFFER_FORWARD(b, n);
usr.bin/dig/lib/isc/buffer.c
74
isc__buffer_add(isc_buffer_t *b, unsigned int n) {
usr.bin/dig/lib/isc/buffer.c
79
REQUIRE(b->used + n <= b->length);
usr.bin/dig/lib/isc/buffer.c
81
ISC__BUFFER_ADD(b, n);
usr.bin/dig/lib/isc/buffer.c
85
isc__buffer_subtract(isc_buffer_t *b, unsigned int n) {
usr.bin/dig/lib/isc/buffer.c
90
REQUIRE(b->used >= n);
usr.bin/dig/lib/isc/buffer.c
92
ISC__BUFFER_SUBTRACT(b, n);
usr.bin/dig/lib/isc/include/isc/buffer.h
256
isc__buffer_add(isc_buffer_t *b, unsigned int n);
usr.bin/dig/lib/isc/include/isc/buffer.h
269
isc__buffer_subtract(isc_buffer_t *b, unsigned int n);
usr.bin/dig/lib/isc/include/isc/buffer.h
321
isc__buffer_setactive(isc_buffer_t *b, unsigned int n);
usr.bin/dig/lib/isc/include/isc/buffer.h
348
isc__buffer_forward(isc_buffer_t *b, unsigned int n);
usr.bin/dig/lib/isc/include/isc/refcount.h
127
isc_refcount_init(isc_refcount_t *ref, unsigned int n);
usr.bin/dig/lib/isc/include/isc/socket.h
92
unsigned int n; /*%< bytes read or written */
usr.bin/dig/lib/isc/refcount.c
26
isc_refcount_init(isc_refcount_t *ref, unsigned int n) {
usr.bin/dig/lib/isc/refcount.c
29
ref->refs = n;
usr.bin/dig/lib/isc/unix/app.c
145
int n;
usr.bin/dig/lib/isc/unix/app.c
175
n = isc_socketmgr_waitevents(ctx->socketmgr, tvp, &swait);
usr.bin/dig/lib/isc/unix/app.c
177
if (n == 0 || call_timer_dispatch) {
usr.bin/dig/lib/isc/unix/app.c
194
if (n > 0)
usr.bin/dig/lib/isc/unix/socket.c
1075
dev->n += cc;
usr.bin/dig/lib/isc/unix/socket.c
2540
int n;
usr.bin/dig/lib/isc/unix/socket.c
2557
n = select(swait_private.maxfd, swait_private.readset,
usr.bin/dig/lib/isc/unix/socket.c
2561
return (n);
usr.bin/dig/lib/isc/unix/socket.c
523
write_count = dev->region.length - dev->n;
usr.bin/dig/lib/isc/unix/socket.c
524
iov[0].iov_base = (void *)(dev->region.base + dev->n);
usr.bin/dig/lib/isc/unix/socket.c
535
skip_count = dev->n;
usr.bin/dig/lib/isc/unix/socket.c
721
read_count = dev->region.length - dev->n;
usr.bin/dig/lib/isc/unix/socket.c
722
iov[0].iov_base = (void *)(dev->region.base + dev->n);
usr.bin/dig/lib/isc/unix/socket.c
812
ev->n = 0;
usr.bin/dig/lib/isc/unix/socket.c
940
dev->n += cc;
usr.bin/dig/lib/isc/unix/socket.c
964
if (((size_t)cc != read_count) && (dev->n < dev->minimum))
usr.bin/dig/lib/lwres/lwconfig.c
303
size_t n;
usr.bin/dig/lib/lwres/lwconfig.c
305
n = strlcpy(buf, buffer, sizeof(buf));
usr.bin/dig/lib/lwres/lwconfig.c
306
if (n >= sizeof(buf))
usr.bin/dig/nslookup.c
526
uint32_t n;
usr.bin/dig/nslookup.c
529
n = strtonum(value, 0, 65535, &errstr);
usr.bin/dig/nslookup.c
531
port = (uint16_t) n;
usr.bin/dig/nslookup.c
538
uint32_t n;
usr.bin/dig/nslookup.c
541
n = strtonum(value, 0, UINT_MAX, &errstr);
usr.bin/dig/nslookup.c
543
timeout = n;
usr.bin/dig/nslookup.c
550
uint32_t n;
usr.bin/dig/nslookup.c
553
n = strtonum(value, 0, INT_MAX, &errstr);
usr.bin/dig/nslookup.c
555
tries = n;
usr.bin/dig/nslookup.c
562
uint32_t n;
usr.bin/dig/nslookup.c
565
n = strtonum(value, 0, 128, &errstr);
usr.bin/dig/nslookup.c
567
ndots = n;
usr.bin/expand/expand.c
102
for (n = 0; n < nstops; n++)
usr.bin/expand/expand.c
103
if (tabstops[n] > column)
usr.bin/expand/expand.c
105
if (n == nstops) {
usr.bin/expand/expand.c
110
while (column < tabstops[n]) {
usr.bin/expand/expand.c
52
int n;
usr.bin/file/magic-load.c
1076
u_int at, level, n, i;
usr.bin/file/magic-load.c
1119
n = 0;
usr.bin/file/magic-load.c
1121
n++;
usr.bin/file/magic-load.c
1135
if (n == level + 1) {
usr.bin/file/magic-load.c
1137
} else if (n < level) {
usr.bin/file/magic-load.c
1138
for (i = n; i < level && parent != NULL; i++)
usr.bin/file/magic-load.c
1140
} else if (n != level) {
usr.bin/file/magic-load.c
1141
magic_warn(ml, "level skipped (%u->%u)", level, n);
usr.bin/file/magic-load.c
1146
level = n;
usr.bin/file/magic-load.c
284
int n;
usr.bin/file/magic-load.c
291
n = 1;
usr.bin/file/magic-load.c
295
n = 2 * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
306
n += 1 * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
314
n += 2 * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
330
n += 4 * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
363
n += 8 * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
367
n += ml->test_string_size * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
371
n += ml->test_string_size * MAGIC_STRENGTH_MULTIPLIER / 2;
usr.bin/file/magic-load.c
378
n += ml->test_string_size * size;
usr.bin/file/magic-load.c
383
n += MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
389
n -= 2 * MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
393
n -= MAGIC_STRENGTH_MULTIPLIER;
usr.bin/file/magic-load.c
400
n += ml->strength_value;
usr.bin/file/magic-load.c
403
n -= ml->strength_value;
usr.bin/file/magic-load.c
406
n *= ml->strength_value;
usr.bin/file/magic-load.c
409
n /= ml->strength_value;
usr.bin/file/magic-load.c
412
return (n <= 0 ? 1 : n);
usr.bin/file/magic-test.c
1047
int result, n, cflag = 0, bflag = 0, Bflag = 0;
usr.bin/file/magic-test.c
1105
n = magic_test_eq(start, ms->size - ms->offset, ml->test_string,
usr.bin/file/magic-test.c
1107
if (n == -1 && ml->test_operator == '<')
usr.bin/file/magic-test.c
1109
else if (n == 1 && ml->test_operator == '>')
usr.bin/file/magic-test.c
1111
else if (n == 0 && ml->test_operator == '=')
usr.bin/file/magic-test.c
1119
n = magic_test_eq(start + i, ms->size - ms->offset - i,
usr.bin/file/magic-test.c
1121
if (n == 0) {
usr.bin/fmt/fmt.c
515
size_t n = 0;
usr.bin/fmt/fmt.c
520
++n;
usr.bin/fmt/fmt.c
523
n = (n / tab_width + 1) * tab_width;
usr.bin/fmt/fmt.c
530
return n;
usr.bin/fstat/fstat.c
950
int n;
usr.bin/fstat/fstat.c
954
n = strtonum(sig, 0, NSIG - 1, &errstr);
usr.bin/fstat/fstat.c
955
return (errstr ? -1 : n);
usr.bin/fstat/fstat.c
959
for (n = 1; n < NSIG; n++) {
usr.bin/fstat/fstat.c
960
if (!strcasecmp(sys_signame[n], sig))
usr.bin/fstat/fstat.c
961
return (n);
usr.bin/ftp/cmds.c
1020
int n, aflag = 0;
usr.bin/ftp/cmds.c
1030
n = command("USER %s", argv[1]);
usr.bin/ftp/cmds.c
1031
if (n == CONTINUE) {
usr.bin/ftp/cmds.c
1034
n = command("PASS %s", argv[2]);
usr.bin/ftp/cmds.c
1036
if (n == CONTINUE) {
usr.bin/ftp/cmds.c
1050
n = command("ACCT %s", argv[3]);
usr.bin/ftp/cmds.c
1053
if (n != COMPLETE) {
usr.bin/ftp/ftp.c
1112
int i, n, ch;
usr.bin/ftp/ftp.c
1116
n = restart_point;
usr.bin/ftp/ftp.c
1117
for (i = 0; i++ < n;) {
usr.bin/ftp/ftp.c
440
int c, n, lineno;
usr.bin/ftp/ftp.c
450
dig = n = code = 0;
usr.bin/ftp/ftp.c
489
((verbose > -1 && n == '5' && dig > 4) &&
usr.bin/ftp/ftp.c
490
(((!n && c < '5') || (n && n < '5')) ||
usr.bin/ftp/ftp.c
521
if (n == 0)
usr.bin/ftp/ftp.c
522
n = c;
usr.bin/ftp/ftp.c
526
if (verbose > 0 || ((verbose > -1 && n == '5') &&
usr.bin/ftp/ftp.c
527
(n < '5' || !retry_connect))) {
usr.bin/ftp/ftp.c
545
if (n != '1')
usr.bin/ftp/ftp.c
552
return (n - '0');
usr.bin/ftp/util.c
220
int n, aflag = 0, retry = 0;
usr.bin/ftp/util.c
288
n = command("USER %s", user);
usr.bin/ftp/util.c
289
if (n == CONTINUE) {
usr.bin/ftp/util.c
292
n = command("PASS %s", pass);
usr.bin/ftp/util.c
294
if (n == CONTINUE) {
usr.bin/ftp/util.c
298
n = command("ACCT %s", acctname);
usr.bin/ftp/util.c
300
if ((n != COMPLETE) ||
usr.bin/ftp/util.c
313
for (n = 0; n < macnum; ++n) {
usr.bin/ftp/util.c
314
if (!strcmp("init", macros[n].mac_name)) {
usr.bin/getcap/getcap.c
125
int ch, n, prefixlen;
usr.bin/getcap/getcap.c
148
if ((n = cgetstr(buf, cap, &cp)) == -1)
usr.bin/getcap/getcap.c
150
else if (n == -2)
usr.bin/getcap/getcap.c
156
n = strlen(cap) - 1;
usr.bin/getcap/getcap.c
157
ch = cap[n];
usr.bin/getcap/getcap.c
158
cap[n] = '\0';
usr.bin/getcap/getcap.c
160
cap[n] = ch;
usr.bin/getcap/getcap.c
41
size_t n;
usr.bin/getcap/getcap.c
79
for (n = 1, cp = optarg; (cp = strchr(cp, ':')); n++)
usr.bin/getcap/getcap.c
81
pathvec = calloc(n + 1, sizeof(char *));
usr.bin/getcap/getcap.c
82
for (n = 0; (pathvec[n] = strsep(&optarg, ":"));) {
usr.bin/getcap/getcap.c
83
if (*pathvec[n] != '\0')
usr.bin/getcap/getcap.c
84
n++;
usr.bin/grep/binary.c
39
isbinary(const char *buf, size_t n)
usr.bin/grep/binary.c
41
return (memchr(buf, '\0', n) != NULL);
usr.bin/grep/file.c
61
size_t n;
usr.bin/grep/file.c
64
for (n = 0; ; ++n) {
usr.bin/grep/file.c
79
if (n >= lnbufsize) {
usr.bin/grep/file.c
85
lnbuf[n] = c;
usr.bin/grep/file.c
88
if (gzeof(f) && n == 0)
usr.bin/grep/file.c
90
*len = n;
usr.bin/grep/util.c
659
int n;
usr.bin/grep/util.c
661
n = 0;
usr.bin/grep/util.c
667
++n;
usr.bin/grep/util.c
670
if (n)
usr.bin/grep/util.c
673
++n;
usr.bin/grep/util.c
676
if (n)
usr.bin/grep/util.c
680
++n;
usr.bin/grep/util.c
682
if (n)
usr.bin/hexdump/display.c
227
int n;
usr.bin/hexdump/display.c
260
n = fread((char *)curp + nread, sizeof(u_char),
usr.bin/hexdump/display.c
262
if (!n) {
usr.bin/hexdump/display.c
270
length -= n;
usr.bin/hexdump/display.c
271
if (!(need -= n)) {
usr.bin/hexdump/display.c
286
nread += n;
usr.bin/indent/indent.c
1296
int n,
usr.bin/indent/indent.c
1314
while ((n = read(fileno(input), buff, sizeof buff)) > 0)
usr.bin/indent/indent.c
1315
if (write(bakchn, buff, n) != n)
usr.bin/indent/indent.c
1317
if (n == -1)
usr.bin/infocmp/infocmp.c
1019
int i, n;
usr.bin/infocmp/infocmp.c
1025
for (n = 0; n < argc && n < MAXCOMPARE; n++) {
usr.bin/infocmp/infocmp.c
1026
if (freopen(argv[n], "r", stdin) == 0)
usr.bin/infocmp/infocmp.c
1027
_nc_err_abort("Can't open %s", argv[n]);
usr.bin/infocmp/infocmp.c
1030
entered[n].head = _nc_head;
usr.bin/infocmp/infocmp.c
1031
entered[n].tail = _nc_tail;
usr.bin/infocmp/infocmp.c
1036
_nc_set_source(argv[n]);
usr.bin/infocmp/infocmp.c
104
int n;
usr.bin/infocmp/infocmp.c
1040
(void) fprintf(stderr, "Resolving file %d...\n", n - 0);
usr.bin/infocmp/infocmp.c
1046
argv[n]);
usr.bin/infocmp/infocmp.c
106
for (n = 0; n < termcount; ++n) {
usr.bin/infocmp/infocmp.c
109
_nc_head = entered[n].head;
usr.bin/infocmp/infocmp.c
110
_nc_tail = entered[n].tail;
usr.bin/infocmp/infocmp.c
111
_nc_free_entries(entered[n].head);
usr.bin/infocmp/infocmp.c
1251
size_t n;
usr.bin/infocmp/infocmp.c
1254
for (n = 0; n < left; n++) {
usr.bin/infocmp/infocmp.c
1255
size_t m = n + left;
usr.bin/infocmp/infocmp.c
1257
fprintf(stderr, "%-40.40s%s\n", options[n], options[m]);
usr.bin/infocmp/infocmp.c
1259
fprintf(stderr, "%s\n", options[n]);
usr.bin/infocmp/infocmp.c
1306
unsigned n;
usr.bin/infocmp/infocmp.c
1312
for_each_string(n, term) {
usr.bin/infocmp/infocmp.c
1313
if (VALID_STRING(term->Strings[n])) {
usr.bin/infocmp/infocmp.c
1319
for (sp = term->Strings[n];
usr.bin/infocmp/infocmp.c
1335
string_variable(ExtStrname(term, (int) n, strnames)),
usr.bin/infocmp/infocmp.c
1343
for_each_boolean(n, term) {
usr.bin/infocmp/infocmp.c
1344
switch ((int) (term->Booleans[n])) {
usr.bin/infocmp/infocmp.c
1362
n, ExtBoolname(term, (int) n, boolnames), str);
usr.bin/infocmp/infocmp.c
1368
for_each_number(n, term) {
usr.bin/infocmp/infocmp.c
1370
switch (term->Numbers[n]) {
usr.bin/infocmp/infocmp.c
1378
_nc_SPRINTF(buf, _nc_SLIMIT(sizeof(buf)) "%d", term->Numbers[n]);
usr.bin/infocmp/infocmp.c
1382
(void) printf("\t/* %3u: %-8s */\t%s,\n", n,
usr.bin/infocmp/infocmp.c
1383
ExtNumname(term, (int) n, numnames), str);
usr.bin/infocmp/infocmp.c
1389
for_each_string(n, term) {
usr.bin/infocmp/infocmp.c
1391
if (term->Strings[n] == ABSENT_STRING)
usr.bin/infocmp/infocmp.c
1393
else if (term->Strings[n] == CANCELLED_STRING)
usr.bin/infocmp/infocmp.c
1396
str = string_variable(ExtStrname(term, (int) n, strnames));
usr.bin/infocmp/infocmp.c
1398
(void) printf("\t/* %3u: %-8s */\t%s,\n", n,
usr.bin/infocmp/infocmp.c
1399
ExtStrname(term, (int) n, strnames), str);
usr.bin/infocmp/infocmp.c
1409
for (n = BOOLCOUNT; n < NUM_BOOLEANS(term); ++n) {
usr.bin/infocmp/infocmp.c
1411
n, ExtBoolname(term, (int) n, boolnames));
usr.bin/infocmp/infocmp.c
1413
for (n = NUMCOUNT; n < NUM_NUMBERS(term); ++n) {
usr.bin/infocmp/infocmp.c
1415
n, ExtNumname(term, (int) n, numnames));
usr.bin/infocmp/infocmp.c
1417
for (n = STRCOUNT; n < NUM_STRINGS(term); ++n) {
usr.bin/infocmp/infocmp.c
1419
n, ExtStrname(term, (int) n, strnames));
usr.bin/infocmp/infocmp.c
438
#define check_user_definable(n,limit) if (!_nc_user_definable && (n) > (limit)) break
usr.bin/infocmp/infocmp.c
440
#define check_user_definable(n,limit) if ((n) > (limit)) break
usr.bin/jot/jot.c
148
n = getprec(argv[2]);
usr.bin/jot/jot.c
157
if (n > prec) /* maximum precision */
usr.bin/jot/jot.c
158
prec = n;
usr.bin/jot/jot.c
87
int n = 0;
usr.bin/kdump/kdump.c
954
int n, i, *top;
usr.bin/kdump/kdump.c
956
n = ap[1];
usr.bin/kdump/kdump.c
957
if (n > CTL_MAXNAME)
usr.bin/kdump/kdump.c
958
n = CTL_MAXNAME;
usr.bin/kdump/kdump.c
959
if (n < 0)
usr.bin/kdump/kdump.c
960
errx(1, "invalid sysctl length %d", n);
usr.bin/kdump/kdump.c
961
if (n > 0) {
usr.bin/kdump/kdump.c
964
for (i = 1; i < n; i++)
usr.bin/kdump/kdump.c
968
for (i = 1; i < n; i++) {
usr.bin/kdump/ktrstruct.c
84
#define check_sockaddr_len(n) \
usr.bin/kdump/ktrstruct.c
85
if (sa_##n->s##n##_len < sizeof(struct sockaddr_##n)) { \
usr.bin/lam/lam.c
216
size_t n;
usr.bin/lam/lam.c
220
n = strlcpy(lp, ip->sepstring, line + sizeof(line) - lp);
usr.bin/lam/lam.c
221
lp += (n < line + sizeof(line) - lp) ? n : strlen(lp);
usr.bin/lam/lam.c
236
size_t n;
usr.bin/lam/lam.c
257
n = strlcpy(lp, ip->sepstring, line + sizeof(line) - lp);
usr.bin/lam/lam.c
258
lp += (n < line + sizeof(line) - lp) ? n : strlen(lp);
usr.bin/lam/lam.c
263
n = strlcpy(lp, s, line + sizeof(line) - lp);
usr.bin/lam/lam.c
264
lp += (n < line + sizeof(line) - lp) ? n : strlen(lp);
usr.bin/less/brac.c
28
match_brac(int obrac, int cbrac, int forwdir, int n)
usr.bin/less/brac.c
60
} while (c != obrac || --n > 0);
usr.bin/less/ch.c
143
int n;
usr.bin/less/ch.c
244
n = 1;
usr.bin/less/ch.c
247
n = iread(ch_file, &bp->data[bp->datasize],
usr.bin/less/ch.c
251
if (n == READ_INTR)
usr.bin/less/ch.c
253
if (n < 0) {
usr.bin/less/ch.c
256
n = 0;
usr.bin/less/ch.c
262
if (!secure && logfile >= 0 && n > 0)
usr.bin/less/ch.c
263
(void) write(logfile, (char *)&bp->data[bp->datasize], n);
usr.bin/less/ch.c
265
ch_fpos += n;
usr.bin/less/ch.c
266
bp->datasize += n;
usr.bin/less/ch.c
272
if (n == 0) {
usr.bin/less/cmdbuf.c
1134
off_t n = 0;
usr.bin/less/cmdbuf.c
1138
n = (n * 10) + (*p - '0');
usr.bin/less/cmdbuf.c
1144
return (n);
usr.bin/less/cmdbuf.c
1248
int n;
usr.bin/less/cmdbuf.c
1258
for (n = 0; n < histsize; n++) {
usr.bin/less/command.c
789
multi_search(char *pattern, int n)
usr.bin/less/command.c
816
n = search(search_type, pattern, n);
usr.bin/less/command.c
823
if (n == 0) {
usr.bin/less/command.c
831
if (n < 0)
usr.bin/less/command.c
860
if (n > 0)
usr.bin/less/decode.c
533
int n;
usr.bin/less/decode.c
535
n = *(*sp)++;
usr.bin/less/decode.c
536
n += *(*sp)++ * KRADIX;
usr.bin/less/decode.c
537
return (n);
usr.bin/less/decode.c
568
int n;
usr.bin/less/decode.c
584
n = gint(&p);
usr.bin/less/decode.c
585
if (n < 0 || p + n >= end)
usr.bin/less/decode.c
587
add_fcmd_table(p, n);
usr.bin/less/decode.c
588
p += n;
usr.bin/less/decode.c
591
n = gint(&p);
usr.bin/less/decode.c
592
if (n < 0 || p + n >= end)
usr.bin/less/decode.c
594
add_ecmd_table(p, n);
usr.bin/less/decode.c
595
p += n;
usr.bin/less/decode.c
598
n = gint(&p);
usr.bin/less/decode.c
599
if (n < 0 || p + n >= end)
usr.bin/less/decode.c
602
&list_sysvar_tables : &list_var_tables, p, n);
usr.bin/less/decode.c
603
p += n;
usr.bin/less/decode.c
624
long n;
usr.bin/less/decode.c
663
n = read(f, buf, (unsigned int) len);
usr.bin/less/decode.c
665
if (n != len) {
usr.bin/less/edit.c
422
edit_istep(IFILE h, int n, int dir)
usr.bin/less/edit.c
431
if (--n < 0) {
usr.bin/less/edit.c
457
edit_inext(IFILE h, int n)
usr.bin/less/edit.c
459
return (edit_istep(h, n, +1));
usr.bin/less/edit.c
463
edit_next(int n)
usr.bin/less/edit.c
465
return (edit_istep(curr_ifile, n, +1));
usr.bin/less/edit.c
469
edit_iprev(IFILE h, int n)
usr.bin/less/edit.c
471
return (edit_istep(h, n, -1));
usr.bin/less/edit.c
475
edit_prev(int n)
usr.bin/less/edit.c
477
return (edit_istep(curr_ifile, n, -1));
usr.bin/less/edit.c
484
edit_index(int n)
usr.bin/less/edit.c
496
} while (get_index(h) != n);
usr.bin/less/filename.c
240
int n;
usr.bin/less/filename.c
251
n = 0;
usr.bin/less/filename.c
261
n++;
usr.bin/less/filename.c
268
n++;
usr.bin/less/filename.c
270
n += strlen(get_filename(ifile));
usr.bin/less/filename.c
278
n++;
usr.bin/less/filename.c
283
e = ecalloc(n+1, sizeof (char));
usr.bin/less/filename.c
301
e + n + 1 - to);
usr.bin/less/filename.c
354
ssize_t i, n;
usr.bin/less/filename.c
362
n = read(f, data, sizeof (data));
usr.bin/less/filename.c
364
for (i = 0; i < n; i += len) {
usr.bin/less/filename.c
365
len = mbtowc(&ch, data + i, n - i);
usr.bin/less/forwback.c
116
forw(int n, off_t pos, int force, int only_last, int nblank)
usr.bin/less/forwback.c
133
do_repaint = (only_last && n > sc_height-1) ||
usr.bin/less/forwback.c
134
(forw_scroll >= 0 && n > forw_scroll && n != sc_height-1);
usr.bin/less/forwback.c
137
if (top_scroll && n >= sc_height - 1 && pos != ch_length()) {
usr.bin/less/forwback.c
169
while (--n >= 0) {
usr.bin/less/forwback.c
241
back(int n, off_t pos, int force, int only_last)
usr.bin/less/forwback.c
247
do_repaint = (n > get_back_scroll() || (only_last && n > sc_height-1));
usr.bin/less/forwback.c
248
while (--n >= 0) {
usr.bin/less/forwback.c
287
forward(int n, int force, int only_last)
usr.bin/less/forwback.c
323
forw(n, pos, force, only_last, 0);
usr.bin/less/forwback.c
331
backward(int n, int force, int only_last)
usr.bin/less/forwback.c
340
back(n, pos, force, only_last);
usr.bin/less/line.c
1026
int n;
usr.bin/less/line.c
1034
n = 0;
usr.bin/less/line.c
1040
if (n >= size_linebuf-1) {
usr.bin/less/line.c
1050
linebuf[n++] = (char)c;
usr.bin/less/line.c
1053
linebuf[n] = '\0';
usr.bin/less/line.c
1057
*line_lenp = n;
usr.bin/less/line.c
1068
int n;
usr.bin/less/line.c
1075
n = size_linebuf;
usr.bin/less/line.c
1076
linebuf[--n] = '\0';
usr.bin/less/line.c
1096
if (n <= 0) {
usr.bin/less/line.c
1109
n = size_linebuf - old_size_linebuf;
usr.bin/less/line.c
1110
memmove(linebuf + n, linebuf, old_size_linebuf);
usr.bin/less/line.c
1112
linebuf[--n] = c;
usr.bin/less/line.c
1115
*linep = &linebuf[n];
usr.bin/less/line.c
1117
*line_lenp = size_linebuf - 1 - n;
usr.bin/less/line.c
177
int n;
usr.bin/less/line.c
180
n = strlen(buf);
usr.bin/less/line.c
181
if (n < MIN_LINENUM_WIDTH)
usr.bin/less/line.c
182
n = MIN_LINENUM_WIDTH;
usr.bin/less/line.c
183
snprintf(linebuf+curr, size_linebuf-curr, "%*s ", n, buf);
usr.bin/less/line.c
184
n++; /* One space after the line number. */
usr.bin/less/line.c
185
for (i = 0; i < n; i++)
usr.bin/less/line.c
187
curr += n;
usr.bin/less/line.c
188
column += n;
usr.bin/less/line.c
189
lmargin += n;
usr.bin/less/main.c
312
char *n;
usr.bin/less/main.c
314
n = strdup(str);
usr.bin/less/main.c
315
if (n == NULL) {
usr.bin/less/main.c
319
return (n);
usr.bin/less/optfunc.c
448
int n = 0;
usr.bin/less/optfunc.c
451
n = (10 * n) + (*s++ - '0');
usr.bin/less/optfunc.c
452
if (n > tabstops[i-1])
usr.bin/less/optfunc.c
453
tabstops[i++] = n;
usr.bin/less/option.c
619
int n;
usr.bin/less/option.c
631
n = 0;
usr.bin/less/option.c
633
n = 10 * n + *s++ - '0';
usr.bin/less/option.c
638
n = -n;
usr.bin/less/option.c
639
return (n);
usr.bin/less/os.c
37
int n;
usr.bin/less/os.c
41
n = read(fd, buf, len);
usr.bin/less/os.c
42
if (n == -1) {
usr.bin/less/os.c
53
return (n);
usr.bin/less/output.c
80
int n;
usr.bin/less/output.c
84
n = (intptr_t)ob - (intptr_t)obuf;
usr.bin/less/output.c
85
if (n == 0)
usr.bin/less/output.c
89
nwritten = write(fd, obuf, n);
usr.bin/less/output.c
90
if (nwritten != n) {
usr.bin/less/prompt.c
224
int n;
usr.bin/less/prompt.c
297
n = ntags();
usr.bin/less/prompt.c
298
if (n)
usr.bin/less/prompt.c
299
ap_int(n);
usr.bin/less/screen.c
176
int sys_height = 0, sys_width = 0, n;
usr.bin/less/screen.c
194
else if (!hardcopy && (n = lines) > 0)
usr.bin/less/screen.c
195
sc_height = n;
usr.bin/less/screen.c
203
else if (!hardcopy && (n = columns) > 0)
usr.bin/less/screen.c
204
sc_width = n;
usr.bin/less/search.c
854
search(int search_type, char *pattern, int n)
usr.bin/less/search.c
921
return (n);
usr.bin/less/search.c
927
n = search_range(pos, -1, search_type, n, -1, &pos, NULL);
usr.bin/less/search.c
928
if (n != 0) {
usr.bin/less/search.c
932
if (hilite_search == OPT_ON && n > 0)
usr.bin/less/search.c
937
return (n);
usr.bin/less/tags.c
148
nexttag(int n)
usr.bin/less/tags.c
152
while (n-- > 0)
usr.bin/less/tags.c
161
prevtag(int n)
usr.bin/less/tags.c
165
while (n-- > 0)
usr.bin/lex/buf.c
139
buf_strnappend(struct Buf *buf, const char *str, int n)
usr.bin/lex/buf.c
141
buf_append(buf, str, n + 1);
usr.bin/lex/misc.c
664
out_dec(const char *fmt, int n)
usr.bin/lex/misc.c
666
fprintf(stdout, fmt, n);
usr.bin/lex/misc.c
694
out_str_dec(const char *fmt, const char str[], int n)
usr.bin/lex/misc.c
696
fprintf(stdout, fmt, str, n);
usr.bin/lex/regex.c
142
int n = 0;
usr.bin/lex/regex.c
156
n = strtol (s, endptr, base);
usr.bin/lex/regex.c
161
return n;
usr.bin/lex/scanopt.c
146
#define INC_INDEX(s,n) \
usr.bin/lex/scanopt.c
148
(s)->index += (n); \
usr.bin/lex/scanopt.c
394
#define PRINT_SPACES(fp,n)\
usr.bin/lex/scanopt.c
397
_n=(n);\
usr.bin/lex/scanopt.c
461
int n = 0;
usr.bin/lex/scanopt.c
466
while (*p && n < maxlen[1]
usr.bin/lex/scanopt.c
471
n++;
usr.bin/lex/scanopt.c
481
fprintf (fp, "%.*s\n", n,
usr.bin/lex/scanopt.c
499
n,
usr.bin/lex/tables.c
394
flex_int32_t n;
usr.bin/lex/tables.c
396
n = abs (yytbl_data_geti (tbl, i));
usr.bin/lex/tables.c
398
if (n > max)
usr.bin/lex/tables.c
399
max = n;
usr.bin/lex/tables.c
45
#define BYTES2TFLAG(n)\
usr.bin/lex/tables.c
46
(((n) == sizeof(flex_int8_t))\
usr.bin/lex/tables.c
48
:(((n)== sizeof(flex_int16_t))\
usr.bin/lex/tables_shared.c
62
flex_int32_t n;
usr.bin/lex/tables_shared.c
65
n = tbl->td_lolen;
usr.bin/lex/tables_shared.c
67
n *= tbl->td_hilen;
usr.bin/lex/tables_shared.c
70
n *= 2;
usr.bin/lex/tables_shared.c
71
return n;
usr.bin/lex/tables_shared.h
70
#define yypad64(n) ((8-((n)%8))%8)
usr.bin/logger/logger.c
169
int n = strtonum(name, 0, INT_MAX, &errstr);
usr.bin/logger/logger.c
171
return (n);
usr.bin/m4/eval.c
122
int c, n;
usr.bin/m4/eval.c
129
for (n = 0; n < argc; n++)
usr.bin/m4/eval.c
130
printf("argv[%d] = %s\n", n, argv[n]);
usr.bin/m4/eval.c
227
n = strtonum(argv[2], INT_MIN, INT_MAX-1, &errstr);
usr.bin/m4/eval.c
231
pbnum(n + 1);
usr.bin/m4/eval.c
240
n = strtonum(argv[2], INT_MIN+1, INT_MAX, &errstr);
usr.bin/m4/eval.c
244
pbnum(n - 1);
usr.bin/m4/eval.c
332
for (n = argc - 1; n > 3; n--) {
usr.bin/m4/eval.c
334
pbstr(argv[n]);
usr.bin/m4/eval.c
346
n = strtonum(argv[2], INT_MIN, INT_MAX, &errstr);
usr.bin/m4/eval.c
350
if (n != 0) {
usr.bin/m4/eval.c
351
dodivert(n);
usr.bin/m4/eval.c
375
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
376
macro_undefine(argv[n]);
usr.bin/m4/eval.c
385
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
386
macro_popdef(argv[n]);
usr.bin/m4/eval.c
443
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
444
fprintf(stderr, "%s ", argv[n]);
usr.bin/m4/eval.c
476
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
477
dodefn(argv[n]);
usr.bin/m4/eval.c
523
int n;
usr.bin/m4/eval.c
555
for (n = argc - 1; n > 2; n--) {
usr.bin/m4/eval.c
556
pbstr(argv[n]);
usr.bin/m4/eval.c
564
for (n = argc - 1; n > 2; n--) {
usr.bin/m4/eval.c
566
pbstr(argv[n]);
usr.bin/m4/eval.c
664
int n;
usr.bin/m4/eval.c
668
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
669
if ((p = lookup_macro_definition(argv[n])) != NULL)
usr.bin/m4/eval.c
670
dump_one_def(argv[n], p);
usr.bin/m4/eval.c
681
int n;
usr.bin/m4/eval.c
684
for (n = 2; n < argc; n++)
usr.bin/m4/eval.c
685
mark_traced(argv[n], on);
usr.bin/m4/eval.c
812
dodivert(int n)
usr.bin/m4/eval.c
816
oindex = n;
usr.bin/m4/eval.c
817
if (n >= maxout) {
usr.bin/m4/eval.c
819
resizedivs(n + 10);
usr.bin/m4/eval.c
821
n = 0; /* bitbucket */
usr.bin/m4/eval.c
824
if (n < 0)
usr.bin/m4/eval.c
825
n = 0; /* bitbucket */
usr.bin/m4/eval.c
826
if (outfile[n] == NULL) {
usr.bin/m4/eval.c
831
(outfile[n] = fdopen(fd, "w+")) == NULL)
usr.bin/m4/eval.c
834
active = outfile[n];
usr.bin/m4/eval.c
845
int n;
usr.bin/m4/eval.c
850
n = strtonum(argv[ind], 1, INT_MAX, &errstr);
usr.bin/m4/eval.c
855
if (n < maxout && outfile[n] != NULL)
usr.bin/m4/eval.c
856
getdiv(n);
usr.bin/m4/eval.c
861
for (n = 1; n < maxout; n++)
usr.bin/m4/eval.c
862
if (outfile[n] != NULL)
usr.bin/m4/eval.c
863
getdiv(n);
usr.bin/m4/gnum4.c
151
ndptr n;
usr.bin/m4/gnum4.c
154
n = lookup(argv[2]);
usr.bin/m4/gnum4.c
155
if (n == NULL || (p = macro_getdef(n)) == NULL)
usr.bin/m4/gnum4.c
159
eval(argv+1, argc-1, p->type, is_traced(n));
usr.bin/m4/gnum4.c
197
addchars(const char *c, size_t n)
usr.bin/m4/gnum4.c
199
if (n == 0)
usr.bin/m4/gnum4.c
201
while (current + n > bufsize) {
usr.bin/m4/gnum4.c
211
memcpy(buffer+current, c, n);
usr.bin/m4/gnum4.c
212
current += n;
usr.bin/m4/gnum4.c
269
add_sub(int n, const char *string, regex_t *re, regmatch_t *pm)
usr.bin/m4/gnum4.c
271
if (n > re->re_nsub)
usr.bin/m4/gnum4.c
272
m4_warnx("No subexpression %d", n);
usr.bin/m4/gnum4.c
275
else if (pm[n].rm_so != -1 &&
usr.bin/m4/gnum4.c
276
pm[n].rm_eo != -1) {
usr.bin/m4/gnum4.c
277
addchars(string + pm[n].rm_so,
usr.bin/m4/gnum4.c
278
pm[n].rm_eo - pm[n].rm_so);
usr.bin/m4/gnum4.c
65
struct path_entry *n;
usr.bin/m4/gnum4.c
67
n = malloc(sizeof(struct path_entry));
usr.bin/m4/gnum4.c
68
if (!n)
usr.bin/m4/gnum4.c
70
n->name = xstrdup(dirname);
usr.bin/m4/gnum4.c
71
n->next = 0;
usr.bin/m4/gnum4.c
72
return n;
usr.bin/m4/gnum4.c
78
struct path_entry *n;
usr.bin/m4/gnum4.c
80
n = new_path_entry(dirname);
usr.bin/m4/gnum4.c
83
last->next = n;
usr.bin/m4/gnum4.c
84
last = n;
usr.bin/m4/gnum4.c
87
last = first = n;
usr.bin/m4/look.c
138
ndptr n;
usr.bin/m4/look.c
141
n = ohash_find(¯os, i);
usr.bin/m4/look.c
142
if (n == NULL) {
usr.bin/m4/look.c
143
n = ohash_create_entry(¯o_info, name, &end);
usr.bin/m4/look.c
144
ohash_insert(¯os, i, n);
usr.bin/m4/look.c
145
n->trace_flags = FLAG_NO_TRACE;
usr.bin/m4/look.c
146
n->builtin_type = MACROTYPE;
usr.bin/m4/look.c
147
n->d = NULL;
usr.bin/m4/look.c
149
return n;
usr.bin/m4/look.c
155
ndptr n = create_entry(name);
usr.bin/m4/look.c
156
if (n->d != NULL) {
usr.bin/m4/look.c
157
if (n->d->defn != null)
usr.bin/m4/look.c
158
free_definition(n->d->defn);
usr.bin/m4/look.c
160
n->d = xalloc(sizeof(struct macro_definition), NULL);
usr.bin/m4/look.c
161
n->d->next = NULL;
usr.bin/m4/look.c
163
setup_definition(n->d, defn, name);
usr.bin/m4/look.c
169
ndptr n;
usr.bin/m4/look.c
172
n = create_entry(name);
usr.bin/m4/look.c
174
d->next = n->d;
usr.bin/m4/look.c
175
n->d = d;
usr.bin/m4/look.c
176
setup_definition(n->d, defn, name);
usr.bin/m4/look.c
182
ndptr n = lookup(name);
usr.bin/m4/look.c
183
if (n != NULL) {
usr.bin/m4/look.c
186
for (r = n->d; r != NULL; r = r2) {
usr.bin/m4/look.c
192
n->d = NULL;
usr.bin/m4/look.c
199
ndptr n = lookup(name);
usr.bin/m4/look.c
201
if (n != NULL) {
usr.bin/m4/look.c
202
struct macro_definition *r = n->d;
usr.bin/m4/look.c
204
n->d = r->next;
usr.bin/m4/look.c
215
ndptr n;
usr.bin/m4/look.c
218
for (n = ohash_first(¯os, &i); n != NULL;
usr.bin/m4/look.c
219
n = ohash_next(¯os, &i))
usr.bin/m4/look.c
220
if (n->d != NULL)
usr.bin/m4/look.c
221
f(n->name, n->d);
usr.bin/m4/look.c
227
ndptr n;
usr.bin/m4/look.c
237
n = create_entry(name2);
usr.bin/m4/look.c
238
n->builtin_type = type;
usr.bin/m4/look.c
239
n->d = xalloc(sizeof(struct macro_definition), NULL);
usr.bin/m4/look.c
240
n->d->defn = name2;
usr.bin/m4/look.c
241
n->d->type = type;
usr.bin/m4/look.c
242
n->d->next = NULL;
usr.bin/m4/look.c
68
hash_calloc(size_t n, size_t s, void *u UNUSED)
usr.bin/m4/look.c
70
void *storage = xcalloc(n, s, "hash alloc");
usr.bin/m4/main.c
171
int n;
usr.bin/m4/main.c
286
for (n = 1; n < maxout; n++) /* default wrap-up: undivert */
usr.bin/m4/main.c
287
if (outfile[n] != NULL)
usr.bin/m4/main.c
288
getdiv(n);
usr.bin/m4/misc.c
100
size_t n;
usr.bin/m4/misc.c
102
n = strlen(s);
usr.bin/m4/misc.c
103
while (endpbb - bp <= n)
usr.bin/m4/misc.c
105
while (n > 0)
usr.bin/m4/misc.c
106
*bp++ = s[--n];
usr.bin/m4/misc.c
113
pbnum(int n)
usr.bin/m4/misc.c
115
pbnumbase(n, 10, 0);
usr.bin/m4/misc.c
119
pbnumbase(int n, int base, int d)
usr.bin/m4/misc.c
131
num = (n < 0) ? -n : n;
usr.bin/m4/misc.c
138
if (n < 0)
usr.bin/m4/misc.c
143
if (n < 0)
usr.bin/m4/misc.c
151
pbunsigned(unsigned long n)
usr.bin/m4/misc.c
154
pushback(n % 10 + '0');
usr.bin/m4/misc.c
156
while ((n /= 10) > 0);
usr.bin/m4/misc.c
227
getdiv(int n)
usr.bin/m4/misc.c
231
if (active == outfile[n])
usr.bin/m4/misc.c
233
rewind(outfile[n]);
usr.bin/m4/misc.c
234
while ((c = getc(outfile[n])) != EOF)
usr.bin/m4/misc.c
236
(void) fclose(outfile[n]);
usr.bin/m4/misc.c
237
outfile[n] = NULL;
usr.bin/m4/misc.c
254
int n;
usr.bin/m4/misc.c
256
for (n = 0; n < maxout; n++)
usr.bin/m4/misc.c
257
if (outfile[n] != NULL) {
usr.bin/m4/misc.c
258
(void) fclose(outfile[n]);
usr.bin/m4/misc.c
283
resizedivs(int n)
usr.bin/m4/misc.c
287
outfile = xreallocarray(outfile, n, sizeof(FILE *),
usr.bin/m4/misc.c
288
"too many diverts %d", n);
usr.bin/m4/misc.c
289
for (i = maxout; i < n; i++)
usr.bin/m4/misc.c
291
maxout = n;
usr.bin/m4/misc.c
295
xalloc(size_t n, const char *fmt, ...)
usr.bin/m4/misc.c
297
void *p = malloc(n);
usr.bin/m4/misc.c
314
xcalloc(size_t n, size_t s, const char *fmt, ...)
usr.bin/m4/misc.c
316
void *p = calloc(n, s);
usr.bin/m4/misc.c
333
xrealloc(void *old, size_t n, const char *fmt, ...)
usr.bin/m4/misc.c
335
char *p = realloc(old, n);
usr.bin/m4/stdd.h
52
#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
60
n = msgvec[0];
usr.bin/mail/cmd1.c
61
if (n != 0 && size > 0)
usr.bin/mail/cmd1.c
62
screen = (n-1)/size;
usr.bin/mail/cmd1.c
72
if (dot != &message[n-1])
usr.bin/mail/cmd3.c
101
n = BUFSIZ;
usr.bin/mail/cmd3.c
104
if (n < strlen(lastbang)) {
usr.bin/mail/cmd3.c
112
n -= strlen(lastbang);
usr.bin/mail/cmd3.c
117
if (--n <= 1)
usr.bin/mail/cmd3.c
123
if (--n <= 1)
usr.bin/mail/cmd3.c
97
int n, changed = 0;
usr.bin/mail/fio.c
202
int n;
usr.bin/mail/fio.c
231
n = -1;
usr.bin/mail/fio.c
233
n = strlen(linebuf);
usr.bin/mail/fio.c
234
if (n > 0 && linebuf[n - 1] == '\n')
usr.bin/mail/fio.c
235
linebuf[--n] = '\0';
usr.bin/mail/fio.c
236
if (n > 0 && linebuf[n - 1] == '\r')
usr.bin/mail/fio.c
237
linebuf[--n] = '\0';
usr.bin/mail/fio.c
250
return(n);
usr.bin/mail/lex.c
200
int n, sig, *sigp;
usr.bin/mail/lex.c
222
n = 0;
usr.bin/mail/lex.c
226
if (readline(input, &linebuf[n], LINESIZE - n, sigp) < 0) {
usr.bin/mail/lex.c
241
if (n == 0)
usr.bin/mail/lex.c
242
n = -1;
usr.bin/mail/lex.c
245
if ((n = strlen(linebuf)) == 0)
usr.bin/mail/lex.c
247
n--;
usr.bin/mail/lex.c
248
if (linebuf[n] != '\\')
usr.bin/mail/lex.c
250
linebuf[n++] = ' ';
usr.bin/mail/lex.c
253
if (n < 0) {
usr.bin/mail/lex.c
524
setmsize(int n)
usr.bin/mail/lex.c
529
msize = (n + 1) * sizeof(*msgvec);
usr.bin/mail/lex.c
629
int u, n, mdot, d, s;
usr.bin/mail/lex.c
644
for (mp = &message[0], n = 0, u = 0; mp < &message[msgCount]; mp++) {
usr.bin/mail/lex.c
646
n++;
usr.bin/mail/lex.c
668
if (n > 0)
usr.bin/mail/lex.c
669
printf(" %d new", n);
usr.bin/mail/lex.c
670
if (u-n > 0)
usr.bin/mail/tty.c
324
ssize_t n;
usr.bin/mail/tty.c
328
n = -1;
usr.bin/mail/tty.c
330
n = read(t->fdin, &c, 1);
usr.bin/mail/tty.c
331
switch (n) {
usr.bin/mail/util.c
233
size_t n = dsize;
usr.bin/mail/util.c
236
if (n != 0 && --n != 0) {
usr.bin/mail/util.c
240
} while (--n != 0);
usr.bin/mail/util.c
244
if (n == 0) {
usr.bin/make/arch.c
171
struct arch_member *n;
usr.bin/make/arch.c
173
n = ohash_create_entry(&members_info, name, &end);
usr.bin/make/arch.c
175
memcpy(n->date, &(hdr->ar_date), AR_DATE_SIZE);
usr.bin/make/arch.c
176
n->date[AR_DATE_SIZE] = '\0';
usr.bin/make/arch.c
178
ts_set_out_of_date(n->mtime);
usr.bin/make/arch.c
179
return n;
usr.bin/make/arch.c
398
size_t n;
usr.bin/make/arch.c
406
n = fread(&arHeader, 1, sizeof(struct ar_hdr), arch);
usr.bin/make/arch.c
409
if (n == 0 && feof(arch)) {
usr.bin/make/arch.c
414
if (n < sizeof(struct ar_hdr))
usr.bin/make/buf.c
141
int n;
usr.bin/make/buf.c
143
n = vsnprintf(bp->inPtr, bp->endPtr - bp->inPtr, fmt, va);
usr.bin/make/buf.c
145
if (n+1 > bp->endPtr - bp->inPtr) {
usr.bin/make/buf.c
147
BufExpand(bp, n);
usr.bin/make/buf.c
152
bp->inPtr += n;
usr.bin/make/dir.c
247
struct file_stamp *n;
usr.bin/make/dir.c
250
n = ohash_find(&mtimes, slot);
usr.bin/make/dir.c
251
if (n)
usr.bin/make/dir.c
252
n->mtime = t;
usr.bin/make/dir.c
254
n = ohash_create_entry(&stamp_info, file, &end);
usr.bin/make/dir.c
255
n->mtime = t;
usr.bin/make/dir.c
256
ohash_insert(&mtimes, slot, n);
usr.bin/make/dir.c
275
char *n;
usr.bin/make/dir.c
279
n = ohash_find(h, slot);
usr.bin/make/dir.c
280
if (n == NULL) {
usr.bin/make/dir.c
281
n = ohash_create_entry(&file_info, file, &end);
usr.bin/make/dir.c
282
ohash_insert(h, slot, n);
usr.bin/make/dir.h
104
#define Dir_FindFilei(n, e, p) Dir_FindFileComplexi(n, e, p, true)
usr.bin/make/dir.h
105
#define Dir_FindFileNoDoti(n, e, p) Dir_FindFileComplexi(n, e, p, false)
usr.bin/make/dir.h
106
#define Dir_FindFile(n, p) Dir_FindFilei(n, strchr(n, '\0'), p)
usr.bin/make/dir.h
107
#define Dir_FindFileNoDot(n, p) Dir_FindFileNoDoti(n, strchr(n, '\0'), p)
usr.bin/make/dir.h
65
#define Dir_AddDir(l, n) Dir_AddDiri(l, n, NULL)
usr.bin/make/direxpand.h
44
#define Dir_HasWildcards(n) Dir_HasWildcardsi(n, strchr(n, '\0'))
usr.bin/make/direxpand.h
51
#define Dir_Expand(n, l1, l2) Dir_Expandi(n, strchr(n, '\0'), l1, l2)
usr.bin/make/dump.c
69
size_t n = ohash_entries(h);
usr.bin/make/dump.c
70
void **t = ereallocarray(NULL, n+1, sizeof(void *));
usr.bin/make/dump.c
75
qsort(t, n, sizeof(void *), comparison);
usr.bin/make/dump.c
78
t[n] = NULL;
usr.bin/make/for.c
118
unsigned long n;
usr.bin/make/for.c
120
n = 0;
usr.bin/make/for.c
125
n++;
usr.bin/make/for.c
127
return n;
usr.bin/make/for.c
138
unsigned long n;
usr.bin/make/for.c
186
n = build_words_list(&arg->lst, sub);
usr.bin/make/for.c
188
if (arg->nvars != 1 && n % arg->nvars != 0) {
usr.bin/make/for.c
193
n, arg->nvars);
usr.bin/make/garray.h
103
for (i = 0; i < (l)->n; i++) \
usr.bin/make/garray.h
110
(l)->n = 0; \
usr.bin/make/garray.h
116
(l)->n = 0; \
usr.bin/make/garray.h
119
#define Array_IsEmpty(l) ((l)->n == 0)
usr.bin/make/garray.h
35
unsigned int n; /* Current number of members */
usr.bin/make/garray.h
53
if ((l)->n >= (l)->size) { \
usr.bin/make/garray.h
59
(l)->a[(l)->n++] = (gn); \
usr.bin/make/garray.h
65
((l)->n > 0 ? (l)->a[--(l)->n] : NULL)
usr.bin/make/garray.h
70
for (i = 0; i < (l)->n; i++) \
usr.bin/make/garray.h
73
if (i == (l)->n) \
usr.bin/make/garray.h
80
for (i = 0; i < (l)->n; i++) \
usr.bin/make/garray.h
88
for (i = 0; i < (l)->n; i++) \
usr.bin/make/garray.h
96
for (i = 0; i < (l)->n; i++) \
usr.bin/make/main.c
444
add_dirpath(Lst l, const char *n)
usr.bin/make/main.c
449
for (start = n;;) {
usr.bin/make/make.c
147
for (i = g->n; i > 0; i--) {
usr.bin/make/make.c
204
for (i = 0, j = 0; i < heldBack.n; i++, j++) {
usr.bin/make/make.c
216
heldBack.n = j;
usr.bin/make/make.c
624
for (i = 0; i != l->n; i++) {
usr.bin/make/memory.c
106
hash_calloc(size_t n, size_t s, void *u UNUSED)
usr.bin/make/memory.c
110
if ((p = calloc(n, s)) == NULL)
usr.bin/make/memory.c
111
enocmem(n, s);
usr.bin/make/parse.c
1442
if (targets->n <= 1)
usr.bin/make/parse.c
1462
for (i = 0; i < targets->n; i++)
usr.bin/make/parse.c
1473
for (i = 0; i < targets->n; i++) {
usr.bin/make/parse.c
1511
if (targets->n <= 1)
usr.bin/make/parse.c
1516
for (i = 0, j = 0; i < targets->n; i++) {
usr.bin/make/parse.c
1521
targets->n = j;
usr.bin/make/parse.c
666
if (gtargets.n > 0 &&
usr.bin/make/parse.c
696
for (i = 0; i < gtargets.n; i++)
usr.bin/make/parse.c
710
for (i = 0; i < gtargets.n; i++) {
usr.bin/make/stats.c
148
unsigned long n;
usr.bin/make/stats.c
154
n = 0;
usr.bin/make/stats.c
156
fwrite(&n, sizeof(unsigned long), 1, f);
usr.bin/make/targ.c
122
#define Targ_mk_constant(n, type) \
usr.bin/make/targ.c
123
Targ_mk_special_node(n, sizeof(n), K_##n, type, SPECIAL_NONE, 0)
usr.bin/make/targ.c
211
Targ_mk_special_node(const char *name, size_t n, uint32_t hv,
usr.bin/make/targ.c
216
const char *ename = name + n - 1;
usr.bin/make/targ.h
43
#define Targ_NewGN(n) Targ_NewGNi(n, NULL);
usr.bin/make/targ.h
45
#define Targ_FindNode(n, i) Targ_FindNodei(n, NULL, i)
usr.bin/make/var.h
37
#define Var_Value(n) Var_Valuei(n, NULL)
usr.bin/make/var.h
48
#define Var_Set(n, v) Var_Seti_with_ctxt(n, NULL, v, VAR_GLOBAL)
usr.bin/make/var.h
49
#define Var_Seti(n, e, v) Var_Seti_with_ctxt(n, e, v, VAR_GLOBAL)
usr.bin/make/var.h
56
#define Var_Append(n, v) Var_Appendi_with_ctxt(n, NULL, v, VAR_GLOBAL)
usr.bin/make/var.h
57
#define Var_Appendi(n, e, v) Var_Appendi_with_ctxt(n, e, v, VAR_GLOBAL)
usr.bin/make/varmodifiers.c
1046
do_regex(const char *s, const struct Name *n UNUSED, void *arg)
usr.bin/make/varmodifiers.c
636
int n;
usr.bin/make/varmodifiers.c
642
n = 0;
usr.bin/make/varmodifiers.c
646
n = rp[1] - '0';
usr.bin/make/varmodifiers.c
653
if (n >= pat->nsub) {
usr.bin/make/varmodifiers.c
658
} else if (pat->matches[n].rm_so == -1 &&
usr.bin/make/varmodifiers.c
659
pat->matches[n].rm_eo == -1) {
usr.bin/make/varmodifiers.c
665
subbuf = wp + pat->matches[n].rm_so;
usr.bin/make/varmodifiers.c
666
sublen = pat->matches[n].rm_eo -
usr.bin/make/varmodifiers.c
667
pat->matches[n].rm_so;
usr.bin/make/varmodifiers.c
837
VarQuote(const char *str, const struct Name *n UNUSED, void *islistp)
usr.bin/make/varmodifiers.c
899
do_shcmd(const char *s, const struct Name *n UNUSED, void *arg UNUSED)
usr.bin/make/varmodifiers.c
935
do_upper(const char *s, const struct Name *n UNUSED, void *arg UNUSED)
usr.bin/make/varmodifiers.c
949
do_lower(const char *s, const struct Name *n UNUSED, void *arg UNUSED)
usr.bin/mandoc/html.c
363
html_make_id(const struct roff_node *n, int unique)
usr.bin/mandoc/html.c
371
if (n->tag != NULL)
usr.bin/mandoc/html.c
372
buf = mandoc_strdup(n->tag);
usr.bin/mandoc/html.c
374
switch (n->tok) {
usr.bin/mandoc/html.c
380
for (nch = n->child; nch != NULL; nch = nch->next)
usr.bin/mandoc/html.c
384
deroff(&buf, n);
usr.bin/mandoc/html.c
389
if (n->child == NULL || n->child->type != ROFFT_TEXT)
usr.bin/mandoc/html.c
391
buf = mandoc_strdup(n->child->string);
usr.bin/mandoc/html.c
807
struct roff_node *n)
usr.bin/mandoc/html.c
815
if (n->flags & NODE_ID)
usr.bin/mandoc/html.c
816
id = html_make_id(n, 1);
usr.bin/mandoc/html.c
817
if (n->flags & NODE_HREF)
usr.bin/mandoc/html.c
818
href = id == NULL ? html_make_id(n, 2) : id;
usr.bin/mandoc/html.c
824
if (href != NULL && (nch = n->child) != NULL) {
usr.bin/mandoc/html.c
826
if (n->tok > MDOC_MAX ||
usr.bin/mandoc/html.c
883
print_gen_comment(struct html *h, struct roff_node *n)
usr.bin/mandoc/html.c
891
while (n != NULL && n->type == ROFFT_COMMENT) {
usr.bin/mandoc/html.c
892
if (strstr(n->string, "-->") == NULL &&
usr.bin/mandoc/html.c
893
(wantblank || *n->string != '\0')) {
usr.bin/mandoc/html.c
896
print_word(h, n->string);
usr.bin/mandoc/html.c
897
wantblank = *n->string != '\0';
usr.bin/mandoc/html.c
899
n = n->next;
usr.bin/mandoc/html.c
915
print_tagged_text(struct html *h, const char *word, struct roff_node *n)
usr.bin/mandoc/html.c
948
if (n != NULL && (href = html_make_id(n, 2)) != NULL) {
usr.bin/mandoc/man.c
180
struct roff_node *n;
usr.bin/mandoc/man.c
254
n = man->last;
usr.bin/mandoc/man.c
255
if (n->type == ROFFT_BODY &&
usr.bin/mandoc/man.c
256
strcmp(n->prev->child->string, "NAME"))
usr.bin/mandoc/man.c
285
struct roff_node *n;
usr.bin/mandoc/man.c
295
n = man->last;
usr.bin/mandoc/man.c
296
if (n->type == ROFFT_TEXT)
usr.bin/mandoc/man.c
297
n = n->parent;
usr.bin/mandoc/man.c
298
if (n->tok < MAN_TH ||
usr.bin/mandoc/man.c
299
(man_macro(n->tok)->flags & (MAN_NSCOPED | MAN_ESCOPED))
usr.bin/mandoc/man.c
301
n = n->parent;
usr.bin/mandoc/man.c
303
mandoc_msg(MANDOCERR_BLK_LINE, n->line, n->pos,
usr.bin/mandoc/man.c
304
"%s breaks %s", roff_name[tok], roff_name[n->tok]);
usr.bin/mandoc/man.c
305
if (n->parent->type != ROFFT_ELEM ||
usr.bin/mandoc/man.c
306
(man_macro(n->parent->tok)->flags &
usr.bin/mandoc/man.c
309
n = n->parent;
usr.bin/mandoc/man.c
311
roff_node_delete(man, n);
usr.bin/mandoc/man.c
323
n = man->last;
usr.bin/mandoc/man.c
324
man_unscope(man, n);
usr.bin/mandoc/man.c
325
roff_body_alloc(man, n->line, n->pos, n->tok);
usr.bin/mandoc/man.c
337
n = man->last;
usr.bin/mandoc/man.c
338
if (n->type == ROFFT_TEXT)
usr.bin/mandoc/man.c
339
n = n->parent;
usr.bin/mandoc/man.c
340
if (n->tok < MAN_TH ||
usr.bin/mandoc/man.c
341
(man_macro(n->tok)->flags & MAN_XSCOPE) == 0)
usr.bin/mandoc/man.c
342
n = n->parent;
usr.bin/mandoc/man.c
344
assert(n->type == ROFFT_HEAD);
usr.bin/mandoc/man.c
345
n = n->parent;
usr.bin/mandoc/man.c
346
assert(n->type == ROFFT_BLOCK);
usr.bin/mandoc/man.c
347
assert(man_macro(n->tok)->flags & MAN_BSCOPED);
usr.bin/mandoc/man.c
349
mandoc_msg(MANDOCERR_BLK_LINE, n->line, n->pos,
usr.bin/mandoc/man.c
350
"%s breaks %s", roff_name[tok], roff_name[n->tok]);
usr.bin/mandoc/man.c
352
roff_node_delete(man, n);
usr.bin/mandoc/man_html.c
116
struct roff_node *n;
usr.bin/mandoc/man_html.c
120
n = man->first->child;
usr.bin/mandoc/man_html.c
128
if (n != NULL && n->type == ROFFT_COMMENT)
usr.bin/mandoc/man_html.c
129
print_gen_comment(h, n);
usr.bin/mandoc/man_html.c
135
print_man_nodelist(man, n, h);
usr.bin/mandoc/man_html.c
156
while (n != NULL) {
usr.bin/mandoc/man_html.c
157
print_man_node(man, n, h);
usr.bin/mandoc/man_html.c
158
n = n->next;
usr.bin/mandoc/man_html.c
168
if (n->type == ROFFT_COMMENT || n->flags & NODE_NOPRT)
usr.bin/mandoc/man_html.c
171
if ((n->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/man_html.c
174
n->tok != ROFF_fi && n->flags & NODE_LINE &&
usr.bin/mandoc/man_html.c
175
(n->prev == NULL || n->prev->tok != MAN_YS))
usr.bin/mandoc/man_html.c
179
switch (n->type) {
usr.bin/mandoc/man_html.c
181
if (*n->string == '\0') {
usr.bin/mandoc/man_html.c
185
if (*n->string == ' ' && n->flags & NODE_LINE &&
usr.bin/mandoc/man_html.c
188
else if (n->flags & NODE_DELIMC)
usr.bin/mandoc/man_html.c
192
print_text(h, n->string);
usr.bin/mandoc/man_html.c
197
print_eqn(h, n->eqn);
usr.bin/mandoc/man_html.c
205
print_tbl(h, n->span);
usr.bin/mandoc/man_html.c
226
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/man_html.c
227
roff_html_pre(h, n);
usr.bin/mandoc/man_html.c
232
assert(n->tok >= MAN_TH && n->tok < MAN_MAX);
usr.bin/mandoc/man_html.c
233
if (man_html_acts[n->tok - MAN_TH].pre != NULL)
usr.bin/mandoc/man_html.c
234
child = (*man_html_acts[n->tok - MAN_TH].pre)(man,
usr.bin/mandoc/man_html.c
235
n, h);
usr.bin/mandoc/man_html.c
239
if (child && n->child != NULL)
usr.bin/mandoc/man_html.c
240
print_man_nodelist(man, n->child, h);
usr.bin/mandoc/man_html.c
244
if (n->type == ROFFT_BLOCK &&
usr.bin/mandoc/man_html.c
245
(n->tok == MAN_IP || n->tok == MAN_TP || n->tok == MAN_TQ)) {
usr.bin/mandoc/man_html.c
253
if (list_continues(n, roff_node_next(n)) == '\0') {
usr.bin/mandoc/man_html.c
326
if (n->tok == MAN_SH) {
usr.bin/mandoc/man_html.c
333
switch (n->type) {
usr.bin/mandoc/man_html.c
339
print_otag_id(h, tag, class, n);
usr.bin/mandoc/man_html.c
357
for (i = 0, nn = n->child; nn != NULL; nn = nn->next, i++) {
usr.bin/mandoc/man_html.c
358
switch (n->tok) {
usr.bin/mandoc/man_html.c
37
struct roff_node *n, \
usr.bin/mandoc/man_html.c
399
if (n->tok == MAN_SB)
usr.bin/mandoc/man_html.c
407
switch (n->type) {
usr.bin/mandoc/man_html.c
414
if (n->child != NULL &&
usr.bin/mandoc/man_html.c
415
(n->child->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/man_html.c
417
n->tok == MAN_HP ? "Pp HP" : "Pp");
usr.bin/mandoc/man_html.c
462
nn = n->type == ROFFT_BLOCK ? n : n->parent;
usr.bin/mandoc/man_html.c
492
switch (n->type) {
usr.bin/mandoc/man_html.c
501
print_otag_id(h, TAG_DT, NULL, n);
usr.bin/mandoc/man_html.c
509
switch(n->tok) {
usr.bin/mandoc/man_html.c
511
if (n->child != NULL)
usr.bin/mandoc/man_html.c
512
print_man_node(man, n->child, h);
usr.bin/mandoc/man_html.c
516
nn = n->child;
usr.bin/mandoc/man_html.c
539
if (n->child != NULL) {
usr.bin/mandoc/man_html.c
540
name = n->child->string;
usr.bin/mandoc/man_html.c
541
if (n->child->next != NULL) {
usr.bin/mandoc/man_html.c
542
section = n->child->next->string;
usr.bin/mandoc/man_html.c
545
if (n->child->next->next != NULL)
usr.bin/mandoc/man_html.c
546
suffix = n->child->next->next->string;
usr.bin/mandoc/man_html.c
585
if ((n = n->child) != NULL) {
usr.bin/mandoc/man_html.c
587
print_text(h, n->string);
usr.bin/mandoc/man_html.c
592
if (n != NULL && n->next != NULL) {
usr.bin/mandoc/man_html.c
594
print_text(h, n->next->string);
usr.bin/mandoc/man_html.c
633
switch (n->type) {
usr.bin/mandoc/man_html.c
651
switch (n->type) {
usr.bin/mandoc/man_html.c
675
n = n->child;
usr.bin/mandoc/man_html.c
676
assert(n->type == ROFFT_HEAD);
usr.bin/mandoc/man_html.c
677
if (n->child != NULL) {
usr.bin/mandoc/man_html.c
678
assert(n->child->type == ROFFT_TEXT);
usr.bin/mandoc/man_html.c
679
if (n->tok == MAN_MT) {
usr.bin/mandoc/man_html.c
680
mandoc_asprintf(&cp, "mailto:%s", n->child->string);
usr.bin/mandoc/man_html.c
684
print_otag(h, TAG_A, "ch", "Lk", n->child->string);
usr.bin/mandoc/man_html.c
687
assert(n->next->type == ROFFT_BODY);
usr.bin/mandoc/man_html.c
688
if (n->next->child != NULL)
usr.bin/mandoc/man_html.c
689
n = n->next;
usr.bin/mandoc/man_html.c
691
print_man_nodelist(man, n->child, h);
usr.bin/mandoc/man_macro.c
102
if (to == NULL && ! (n->flags & NODE_VALID)) {
usr.bin/mandoc/man_macro.c
104
man_macro(n->tok)->flags &
usr.bin/mandoc/man_macro.c
107
n->line, n->pos,
usr.bin/mandoc/man_macro.c
108
"EOF breaks %s", roff_name[n->tok]);
usr.bin/mandoc/man_macro.c
110
if (n->parent->type == ROFFT_ROOT ||
usr.bin/mandoc/man_macro.c
111
(man_macro(n->parent->tok)->flags &
usr.bin/mandoc/man_macro.c
115
assert(n->type == ROFFT_HEAD);
usr.bin/mandoc/man_macro.c
116
n = n->parent;
usr.bin/mandoc/man_macro.c
119
man->last = n;
usr.bin/mandoc/man_macro.c
120
n = n->parent;
usr.bin/mandoc/man_macro.c
124
if (n->type == ROFFT_BLOCK &&
usr.bin/mandoc/man_macro.c
125
man_macro(n->tok)->fp == blk_exp)
usr.bin/mandoc/man_macro.c
127
n->line, n->pos, "%s",
usr.bin/mandoc/man_macro.c
128
roff_name[n->tok]);
usr.bin/mandoc/man_macro.c
138
man->last = n;
usr.bin/mandoc/man_macro.c
139
n = n->parent;
usr.bin/mandoc/man_macro.c
162
struct roff_node *n;
usr.bin/mandoc/man_macro.c
166
n = man->last;
usr.bin/mandoc/man_macro.c
167
if (tok == MAN_RS && n->child == NULL &&
usr.bin/mandoc/man_macro.c
168
(n->tok == MAN_P || n->tok == MAN_PP || n->tok == MAN_LP))
usr.bin/mandoc/man_macro.c
172
if (n->type == ROFFT_ROOT)
usr.bin/mandoc/man_macro.c
174
if (n->flags & NODE_VALID) {
usr.bin/mandoc/man_macro.c
175
n = n->parent;
usr.bin/mandoc/man_macro.c
178
if (n->type != ROFFT_BLOCK) {
usr.bin/mandoc/man_macro.c
179
if (n->parent->type == ROFFT_ROOT) {
usr.bin/mandoc/man_macro.c
180
man_unscope(man, n);
usr.bin/mandoc/man_macro.c
183
n = n->parent;
usr.bin/mandoc/man_macro.c
187
if (tok != MAN_SH && (n->tok == MAN_SH ||
usr.bin/mandoc/man_macro.c
188
(tok != MAN_SS && (n->tok == MAN_SS ||
usr.bin/mandoc/man_macro.c
189
man_macro(n->tok)->fp == blk_exp))))
usr.bin/mandoc/man_macro.c
191
man_unscope(man, n);
usr.bin/mandoc/man_macro.c
192
n = man->last;
usr.bin/mandoc/man_macro.c
343
struct roff_node *n;
usr.bin/mandoc/man_macro.c
350
n = roff_head_alloc(man, line, ppos, tok);
usr.bin/mandoc/man_macro.c
369
(tok == MAN_TP || tok == MAN_TQ || n == man->last)) {
usr.bin/mandoc/man_macro.c
376
man_unscope(man, n);
usr.bin/mandoc/man_macro.c
386
struct roff_node *n;
usr.bin/mandoc/man_macro.c
389
n = man->last;
usr.bin/mandoc/man_macro.c
397
if (buf[*pos] != '\0' && man->last != n && tok == MAN_PD) {
usr.bin/mandoc/man_macro.c
418
if (n != man->last &&
usr.bin/mandoc/man_macro.c
428
if (n == man->last && man_macro(tok)->flags & MAN_ESCOPED) {
usr.bin/mandoc/man_macro.c
440
if (man->last == n)
usr.bin/mandoc/man_macro.c
94
struct roff_node *n;
usr.bin/mandoc/man_macro.c
97
n = man->last;
usr.bin/mandoc/man_macro.c
98
while (n != to) {
usr.bin/mandoc/man_term.c
1003
if (n->parent->tok == MAN_HP && n->parent->type == ROFFT_BODY &&
usr.bin/mandoc/man_term.c
1004
n->prev == NULL && n->flags & NODE_NOFILL) {
usr.bin/mandoc/man_term.c
1009
if (n->flags & NODE_EOS)
usr.bin/mandoc/man_term.c
1016
while (n != NULL) {
usr.bin/mandoc/man_term.c
1017
print_man_node(p, mt, n, meta);
usr.bin/mandoc/man_term.c
1018
n = n->next;
usr.bin/mandoc/man_term.c
154
struct roff_node *n, *nc, *nn;
usr.bin/mandoc/man_term.c
167
n = man->first->child;
usr.bin/mandoc/man_term.c
169
for (nn = NULL; n != NULL; n = n->next) {
usr.bin/mandoc/man_term.c
170
if (n->tok != MAN_SH)
usr.bin/mandoc/man_term.c
172
nc = n->child->child;
usr.bin/mandoc/man_term.c
178
nn = n;
usr.bin/mandoc/man_term.c
180
if (n == NULL)
usr.bin/mandoc/man_term.c
181
n = nn;
usr.bin/mandoc/man_term.c
183
if (n != NULL && (n = n->child->next->child) != NULL)
usr.bin/mandoc/man_term.c
184
print_man_nodelist(p, &mt, n, man);
usr.bin/mandoc/man_term.c
189
if (n != NULL)
usr.bin/mandoc/man_term.c
190
print_man_nodelist(p, &mt, n, man);
usr.bin/mandoc/man_term.c
202
print_bvspace(struct termp *p, struct roff_node *n, int pardist)
usr.bin/mandoc/man_term.c
209
if (n->body != NULL &&
usr.bin/mandoc/man_term.c
210
(nch = roff_node_child(n->body)) != NULL &&
usr.bin/mandoc/man_term.c
214
while (roff_node_prev(n) == NULL) {
usr.bin/mandoc/man_term.c
215
n = n->parent;
usr.bin/mandoc/man_term.c
216
if (n->tok != MAN_RS)
usr.bin/mandoc/man_term.c
218
if (n->type == ROFFT_BODY)
usr.bin/mandoc/man_term.c
219
n = n->parent;
usr.bin/mandoc/man_term.c
248
if (n->parent->tok == MAN_HP && p->tcol->rmargin < p->maxrmargin) {
usr.bin/mandoc/man_term.c
263
n = n->child;
usr.bin/mandoc/man_term.c
264
if (n == NULL) {
usr.bin/mandoc/man_term.c
268
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/man_term.c
269
if (a2roffsu(n->string, &su, SCALE_VS) != NULL)
usr.bin/mandoc/man_term.c
281
switch (n->tok) {
usr.bin/mandoc/man_term.c
309
for (i = 0, nn = n->child; nn != NULL; nn = nn->next, i = 1 - i) {
usr.bin/mandoc/man_term.c
332
n = n->child;
usr.bin/mandoc/man_term.c
333
if (n != NULL) {
usr.bin/mandoc/man_term.c
334
term_word(p, n->string); /* name */
usr.bin/mandoc/man_term.c
339
if (n != NULL && (n = n->next) != NULL) {
usr.bin/mandoc/man_term.c
340
term_word(p, n->string); /* section */
usr.bin/mandoc/man_term.c
344
if (n != NULL && (n = n->next) != NULL) {
usr.bin/mandoc/man_term.c
346
term_word(p, n->string); /* suffix */
usr.bin/mandoc/man_term.c
357
if ((n = n->child) != NULL) {
usr.bin/mandoc/man_term.c
359
term_word(p, n->string);
usr.bin/mandoc/man_term.c
361
if (n != NULL && n->next != NULL) {
usr.bin/mandoc/man_term.c
363
term_word(p, n->next->string);
usr.bin/mandoc/man_term.c
382
if (n->child == NULL) {
usr.bin/mandoc/man_term.c
387
cp = n->child->string;
usr.bin/mandoc/man_term.c
431
switch (n->type) {
usr.bin/mandoc/man_term.c
433
print_bvspace(p, n, mt->pardist);
usr.bin/mandoc/man_term.c
443
if (n->child == NULL)
usr.bin/mandoc/man_term.c
446
if ((n->child->flags & NODE_NOFILL) == 0) {
usr.bin/mandoc/man_term.c
453
if ((nn = n->parent->head->child) != NULL &&
usr.bin/mandoc/man_term.c
472
switch (n->type) {
usr.bin/mandoc/man_term.c
486
if (n->child == NULL)
usr.bin/mandoc/man_term.c
502
switch (n->type) {
usr.bin/mandoc/man_term.c
505
print_bvspace(p, n, mt->pardist);
usr.bin/mandoc/man_term.c
52
struct roff_node *n, \
usr.bin/mandoc/man_term.c
525
switch (n->type) {
usr.bin/mandoc/man_term.c
527
print_bvspace(p, n, mt->pardist);
usr.bin/mandoc/man_term.c
541
if ((nn = n->parent->head->child) != NULL &&
usr.bin/mandoc/man_term.c
553
switch (n->type) {
usr.bin/mandoc/man_term.c
557
if (n->child != NULL)
usr.bin/mandoc/man_term.c
558
print_man_node(p, mt, n->child, meta);
usr.bin/mandoc/man_term.c
573
switch (n->type) {
usr.bin/mandoc/man_term.c
598
switch (n->type) {
usr.bin/mandoc/man_term.c
600
if (n->tok == MAN_TP)
usr.bin/mandoc/man_term.c
601
print_bvspace(p, n, mt->pardist);
usr.bin/mandoc/man_term.c
616
if ((nn = n->parent->head->child) != NULL &&
usr.bin/mandoc/man_term.c
628
switch (n->type) {
usr.bin/mandoc/man_term.c
634
nn = n->child;
usr.bin/mandoc/man_term.c
658
switch (n->type) {
usr.bin/mandoc/man_term.c
678
switch (n->type) {
usr.bin/mandoc/man_term.c
688
if ((n = roff_node_prev(n)) == NULL ||
usr.bin/mandoc/man_term.c
689
(n->tok == MAN_SS && roff_node_child(n->body) == NULL))
usr.bin/mandoc/man_term.c
720
switch (n->type) {
usr.bin/mandoc/man_term.c
730
if ((n = roff_node_prev(n)) == NULL ||
usr.bin/mandoc/man_term.c
731
(n->tok == MAN_SH && roff_node_child(n->body) == NULL))
usr.bin/mandoc/man_term.c
760
switch (n->type) {
usr.bin/mandoc/man_term.c
779
switch (n->type) {
usr.bin/mandoc/man_term.c
791
n = n->parent->head;
usr.bin/mandoc/man_term.c
792
n->aux = SHRT_MAX + 1;
usr.bin/mandoc/man_term.c
793
if (n->child == NULL)
usr.bin/mandoc/man_term.c
794
n->aux = mt->lmargin[mt->lmargincur];
usr.bin/mandoc/man_term.c
795
else if (a2roffsu(n->child->string, &su, SCALE_EN) != NULL)
usr.bin/mandoc/man_term.c
796
n->aux = term_hspan(p, &su);
usr.bin/mandoc/man_term.c
797
if (n->aux < 0 && (size_t)(-n->aux) > mt->offset)
usr.bin/mandoc/man_term.c
798
n->aux = -mt->offset;
usr.bin/mandoc/man_term.c
799
else if (n->aux > SHRT_MAX)
usr.bin/mandoc/man_term.c
800
n->aux = term_len(p, p->defindent);
usr.bin/mandoc/man_term.c
802
mt->offset += n->aux;
usr.bin/mandoc/man_term.c
816
switch (n->type) {
usr.bin/mandoc/man_term.c
826
mt->offset -= n->parent->head->aux;
usr.bin/mandoc/man_term.c
838
switch (n->type) {
usr.bin/mandoc/man_term.c
840
if ((nn = roff_node_prev(n)) == NULL || nn->tok != MAN_SY)
usr.bin/mandoc/man_term.c
841
print_bvspace(p, n, mt->pardist);
usr.bin/mandoc/man_term.c
850
nn = n->parent->head->child;
usr.bin/mandoc/man_term.c
855
switch (n->type) {
usr.bin/mandoc/man_term.c
859
if (n->next->child == NULL ||
usr.bin/mandoc/man_term.c
860
(n->next->child->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/man_term.c
879
switch (n->type) {
usr.bin/mandoc/man_term.c
898
return n->type != ROFFT_HEAD;
usr.bin/mandoc/man_term.c
904
if (n->type != ROFFT_BLOCK)
usr.bin/mandoc/man_term.c
910
if (n->child->child != NULL)
usr.bin/mandoc/man_term.c
911
print_man_node(p, mt, n->child->child, meta);
usr.bin/mandoc/man_term.c
928
if (n->flags & NODE_NOFILL) {
usr.bin/mandoc/man_term.c
929
if (n->flags & NODE_LINE &&
usr.bin/mandoc/man_term.c
934
if (n->flags & NODE_LINE)
usr.bin/mandoc/man_term.c
939
if (n->flags & NODE_ID)
usr.bin/mandoc/man_term.c
940
term_tag_write(n, p->line);
usr.bin/mandoc/man_term.c
942
switch (n->type) {
usr.bin/mandoc/man_term.c
949
if (*n->string == '\0') {
usr.bin/mandoc/man_term.c
955
} else if (*n->string == ' ' && n->flags & NODE_LINE &&
usr.bin/mandoc/man_term.c
958
else if (n->flags & NODE_DELIMC)
usr.bin/mandoc/man_term.c
961
term_word(p, n->string);
usr.bin/mandoc/man_term.c
966
if ( ! (n->flags & NODE_LINE))
usr.bin/mandoc/man_term.c
968
term_eqn(p, n->eqn);
usr.bin/mandoc/man_term.c
969
if (n->next != NULL && ! (n->next->flags & NODE_LINE))
usr.bin/mandoc/man_term.c
975
term_tbl(p, n->span);
usr.bin/mandoc/man_term.c
981
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/man_term.c
982
roff_term_pre(p, n);
usr.bin/mandoc/man_term.c
986
act = man_term_act(n->tok);
usr.bin/mandoc/man_term.c
987
if ((act->flags & MAN_NOTEXT) == 0 && n->tok != MAN_SM)
usr.bin/mandoc/man_term.c
992
c = (*act->pre)(p, mt, n, meta);
usr.bin/mandoc/man_term.c
994
if (c && n->child != NULL)
usr.bin/mandoc/man_term.c
995
print_man_nodelist(p, mt, n->child, meta);
usr.bin/mandoc/man_term.c
998
(*act->post)(p, mt, n, meta);
usr.bin/mandoc/man_term.c
999
if ((act->flags & MAN_NOTEXT) == 0 && n->tok != MAN_SM)
usr.bin/mandoc/man_validate.c
111
struct roff_node *n;
usr.bin/mandoc/man_validate.c
119
n = man->last;
usr.bin/mandoc/man_validate.c
123
if (man->last == n)
usr.bin/mandoc/man_validate.c
131
man->last = n;
usr.bin/mandoc/man_validate.c
133
switch (n->type) {
usr.bin/mandoc/man_validate.c
135
check_text(man, n);
usr.bin/mandoc/man_validate.c
138
check_root(man, n);
usr.bin/mandoc/man_validate.c
145
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/man_validate.c
149
assert(n->tok >= MAN_TH && n->tok < MAN_MAX);
usr.bin/mandoc/man_validate.c
150
cp = man_valids + (n->tok - MAN_TH);
usr.bin/mandoc/man_validate.c
152
(*cp)(man, n);
usr.bin/mandoc/man_validate.c
153
if (man->last == n)
usr.bin/mandoc/man_validate.c
154
n->flags |= NODE_VALID;
usr.bin/mandoc/man_validate.c
164
if (n->last == NULL || n->last->type == ROFFT_COMMENT)
usr.bin/mandoc/man_validate.c
165
mandoc_msg(MANDOCERR_DOC_EMPTY, n->line, n->pos, NULL);
usr.bin/mandoc/man_validate.c
170
mandoc_msg(MANDOCERR_TH_NOTITLE, n->line, n->pos, NULL);
usr.bin/mandoc/man_validate.c
195
check_tag(struct roff_node *n, struct roff_node *nt)
usr.bin/mandoc/man_validate.c
245
tag_put(cp, prio, n);
usr.bin/mandoc/man_validate.c
256
if (n->flags & NODE_NOFILL)
usr.bin/mandoc/man_validate.c
259
cp = n->string;
usr.bin/mandoc/man_validate.c
262
n->line, n->pos + (int)(p - cp), NULL);
usr.bin/mandoc/man_validate.c
268
if ((n->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/man_validate.c
269
mandoc_msg(MANDOCERR_FI_SKIP, n->line, n->pos, "EE");
usr.bin/mandoc/man_validate.c
275
if (n->flags & NODE_NOFILL)
usr.bin/mandoc/man_validate.c
276
mandoc_msg(MANDOCERR_NF_SKIP, n->line, n->pos, "EX");
usr.bin/mandoc/man_validate.c
283
if (n->child == NULL)
usr.bin/mandoc/man_validate.c
284
mandoc_msg(MANDOCERR_OP_EMPTY, n->line, n->pos, "OP");
usr.bin/mandoc/man_validate.c
285
else if (n->child->next != NULL && n->child->next->next != NULL) {
usr.bin/mandoc/man_validate.c
286
n = n->child->next->next;
usr.bin/mandoc/man_validate.c
288
n->line, n->pos, "OP ... %s", n->string);
usr.bin/mandoc/man_validate.c
298
nc = n->child;
usr.bin/mandoc/man_validate.c
299
switch (n->type) {
usr.bin/mandoc/man_validate.c
301
if ((nc = n->prev) != NULL && nc->tok == ROFF_br) {
usr.bin/mandoc/man_validate.c
304
roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
310
deroff(&tag, n);
usr.bin/mandoc/man_validate.c
317
tag_put(NULL, TAG_STRONG, n);
usr.bin/mandoc/man_validate.c
319
tag_put(tag, TAG_FALLBACK, n);
usr.bin/mandoc/man_validate.c
336
man->last = n;
usr.bin/mandoc/man_validate.c
343
"%s after %s", roff_name[nc->tok], roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
352
if ((nc = n->last) != NULL && nc->tok == ROFF_br) {
usr.bin/mandoc/man_validate.c
355
roff_name[nc->tok], roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
363
if (n->type == ROFFT_HEAD && n->child == NULL)
usr.bin/mandoc/man_validate.c
364
mandoc_msg(MANDOCERR_UR_NOHEAD, n->line, n->pos,
usr.bin/mandoc/man_validate.c
365
"%s", roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
371
if (n->type == ROFFT_BODY && n->child == NULL)
usr.bin/mandoc/man_validate.c
372
mandoc_msg(MANDOCERR_BLK_EMPTY, n->line, n->pos,
usr.bin/mandoc/man_validate.c
373
"%s", roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
380
switch (n->type) {
usr.bin/mandoc/man_validate.c
382
if (n->body->child == NULL)
usr.bin/mandoc/man_validate.c
383
roff_node_delete(man, n);
usr.bin/mandoc/man_validate.c
386
if (n->child != NULL &&
usr.bin/mandoc/man_validate.c
387
(n->child->tok == ROFF_sp || n->child->tok == ROFF_br)) {
usr.bin/mandoc/man_validate.c
389
n->child->line, n->child->pos,
usr.bin/mandoc/man_validate.c
390
"%s after %s", roff_name[n->child->tok],
usr.bin/mandoc/man_validate.c
391
roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
392
roff_node_delete(man, n->child);
usr.bin/mandoc/man_validate.c
394
if (n->child == NULL)
usr.bin/mandoc/man_validate.c
395
mandoc_msg(MANDOCERR_PAR_SKIP, n->line, n->pos,
usr.bin/mandoc/man_validate.c
396
"%s empty", roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
399
if (n->child != NULL)
usr.bin/mandoc/man_validate.c
401
n->line, n->pos, "%s %s%s",
usr.bin/mandoc/man_validate.c
402
roff_name[n->tok], n->child->string,
usr.bin/mandoc/man_validate.c
403
n->child->next != NULL ? " ..." : "");
usr.bin/mandoc/man_validate.c
413
switch (n->type) {
usr.bin/mandoc/man_validate.c
415
if (n->head->child == NULL && n->body->child == NULL)
usr.bin/mandoc/man_validate.c
416
roff_node_delete(man, n);
usr.bin/mandoc/man_validate.c
419
check_tag(n, n->child);
usr.bin/mandoc/man_validate.c
42
#define CHKARGS struct roff_man *man, struct roff_node *n
usr.bin/mandoc/man_validate.c
422
if (n->parent->head->child == NULL && n->child == NULL)
usr.bin/mandoc/man_validate.c
423
mandoc_msg(MANDOCERR_PAR_SKIP, n->line, n->pos,
usr.bin/mandoc/man_validate.c
424
"%s empty", roff_name[n->tok]);
usr.bin/mandoc/man_validate.c
440
if (n->type != ROFFT_HEAD || (nt = n->child) == NULL)
usr.bin/mandoc/man_validate.c
459
check_tag(n, nt);
usr.bin/mandoc/man_validate.c
477
nb = n;
usr.bin/mandoc/man_validate.c
481
n = n->child;
usr.bin/mandoc/man_validate.c
482
if (n != NULL && n->string != NULL && *n->string != '\0') {
usr.bin/mandoc/man_validate.c
483
for (p = n->string; *p != '\0'; p++) {
usr.bin/mandoc/man_validate.c
487
mandoc_msg(MANDOCERR_TITLE_CASE, n->line,
usr.bin/mandoc/man_validate.c
488
n->pos + (int)(p - n->string),
usr.bin/mandoc/man_validate.c
489
"TH %s", n->string);
usr.bin/mandoc/man_validate.c
493
man->meta.title = mandoc_strdup(n->string);
usr.bin/mandoc/man_validate.c
501
if (n != NULL)
usr.bin/mandoc/man_validate.c
502
n = n->next;
usr.bin/mandoc/man_validate.c
503
if (n != NULL && n->string != NULL) {
usr.bin/mandoc/man_validate.c
504
man->meta.msec = mandoc_strdup(n->string);
usr.bin/mandoc/man_validate.c
506
man->filesec != *n->string &&
usr.bin/mandoc/man_validate.c
507
*n->string >= '1' && *n->string <= '9')
usr.bin/mandoc/man_validate.c
508
mandoc_msg(MANDOCERR_MSEC_FILE, n->line, n->pos,
usr.bin/mandoc/man_validate.c
509
"*.%c vs TH ... %c", man->filesec, *n->string);
usr.bin/mandoc/man_validate.c
518
if (n != NULL)
usr.bin/mandoc/man_validate.c
519
n = n->next;
usr.bin/mandoc/man_validate.c
520
if (man->quick && n != NULL)
usr.bin/mandoc/man_validate.c
523
man->meta.date = mandoc_normdate(n, nb);
usr.bin/mandoc/man_validate.c
527
if (n && (n = n->next))
usr.bin/mandoc/man_validate.c
528
man->meta.os = mandoc_strdup(n->string);
usr.bin/mandoc/man_validate.c
541
if (n && (n = n->next))
usr.bin/mandoc/man_validate.c
542
man->meta.vol = mandoc_strdup(n->string);
usr.bin/mandoc/man_validate.c
547
if (n != NULL && (n = n->next) != NULL)
usr.bin/mandoc/man_validate.c
549
n->line, n->pos, "TH ... %s", n->string);
usr.bin/mandoc/man_validate.c
563
if ((nch = n->child) == NULL) {
usr.bin/mandoc/man_validate.c
564
mandoc_msg(MANDOCERR_NM_NONAME, n->line, n->pos, "MR");
usr.bin/mandoc/man_validate.c
569
n->line, n->pos, "MR %s", nch->string);
usr.bin/mandoc/man_validate.c
597
n = n->child;
usr.bin/mandoc/man_validate.c
599
if (n == NULL || n->type != ROFFT_TEXT)
usr.bin/mandoc/man_validate.c
602
s = n->string;
usr.bin/mandoc/man_validate.c
634
n = n->child;
usr.bin/mandoc/man_validate.c
636
if (n == NULL || n->type != ROFFT_TEXT)
usr.bin/mandoc/man_validate.c
639
s = n->string;
usr.bin/mandoc/man_validate.c
645
nn = n->next;
usr.bin/mandoc/man_validate.c
665
if (n->parent->tok != MAN_TP ||
usr.bin/mandoc/man_validate.c
666
n->parent->type != ROFFT_HEAD ||
usr.bin/mandoc/man_validate.c
667
n->child == NULL ||
usr.bin/mandoc/man_validate.c
668
*n->child->string == '+' ||
usr.bin/mandoc/man_validate.c
669
*n->child->string == '-')
usr.bin/mandoc/man_validate.c
671
mandoc_asprintf(&s, "+%s", n->child->string);
usr.bin/mandoc/man_validate.c
672
free(n->child->string);
usr.bin/mandoc/man_validate.c
673
n->child->string = s;
usr.bin/mandoc/mandoc_ohash.c
52
hash_calloc(size_t n, size_t sz, void *arg)
usr.bin/mandoc/mandoc_ohash.c
55
return mandoc_calloc(n, sz);
usr.bin/mandoc/mandocdb.c
1421
const struct roff_node *n, uint64_t m, int taboo)
usr.bin/mandoc/mandocdb.c
1424
for ( ; NULL != n; n = n->next) {
usr.bin/mandoc/mandocdb.c
1425
if (n->flags & taboo)
usr.bin/mandoc/mandocdb.c
1427
if (NULL != n->child)
usr.bin/mandoc/mandocdb.c
1428
putmdockey(mpage, n->child, m, taboo);
usr.bin/mandoc/mandocdb.c
1429
if (n->type == ROFFT_TEXT)
usr.bin/mandoc/mandocdb.c
1430
putkey(mpage, n->string, m);
usr.bin/mandoc/mandocdb.c
1436
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1443
if (n == NULL)
usr.bin/mandoc/mandocdb.c
1453
if (n->type == ROFFT_BODY && n->tok == MAN_SH) {
usr.bin/mandoc/mandocdb.c
1454
body = n;
usr.bin/mandoc/mandocdb.c
1557
for (n = n->child; n; n = n->next) {
usr.bin/mandoc/mandocdb.c
1560
parse_man(mpage, meta, n);
usr.bin/mandoc/mandocdb.c
1566
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1570
for (n = n->child; n != NULL; n = n->next) {
usr.bin/mandoc/mandocdb.c
1571
if (n->tok == TOKEN_NONE || n->tok < ROFF_MAX)
usr.bin/mandoc/mandocdb.c
1573
assert(n->tok >= MDOC_Dd && n->tok < MDOC_MAX);
usr.bin/mandoc/mandocdb.c
1574
handler = mdoc_handlers + (n->tok - MDOC_Dd);
usr.bin/mandoc/mandocdb.c
1575
if (n->flags & handler->taboo)
usr.bin/mandoc/mandocdb.c
1578
switch (n->type) {
usr.bin/mandoc/mandocdb.c
1585
(*handler->fp)(mpage, meta, n) == 0)
usr.bin/mandoc/mandocdb.c
1588
putmdockey(mpage, n->child,
usr.bin/mandoc/mandocdb.c
1594
if (NULL != n->child)
usr.bin/mandoc/mandocdb.c
1595
parse_mdoc(mpage, meta, n);
usr.bin/mandoc/mandocdb.c
1601
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1606
if (n->sec == SEC_SYNOPSIS)
usr.bin/mandoc/mandocdb.c
1609
putmdockey(mpage, n->child, mask, 0);
usr.bin/mandoc/mandocdb.c
1615
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1620
if (SEC_SYNOPSIS != n->sec ||
usr.bin/mandoc/mandocdb.c
1621
NULL == (n = n->child) ||
usr.bin/mandoc/mandocdb.c
1622
n->type != ROFFT_TEXT)
usr.bin/mandoc/mandocdb.c
1630
if (strcmp("#include", n->string))
usr.bin/mandoc/mandocdb.c
1633
if ((n = n->next) == NULL || n->type != ROFFT_TEXT)
usr.bin/mandoc/mandocdb.c
1641
start = n->string;
usr.bin/mandoc/mandocdb.c
1658
parse_mdoc_fname(struct mpage *mpage, const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1663
if (n->type != ROFFT_TEXT)
usr.bin/mandoc/mandocdb.c
1668
cp = n->string;
usr.bin/mandoc/mandocdb.c
1674
if (n->sec == SEC_SYNOPSIS)
usr.bin/mandoc/mandocdb.c
1680
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1684
if (n->child == NULL)
usr.bin/mandoc/mandocdb.c
1687
parse_mdoc_fname(mpage, n->child);
usr.bin/mandoc/mandocdb.c
1689
n = n->child->next;
usr.bin/mandoc/mandocdb.c
1690
if (n != NULL && n->type == ROFFT_TEXT) {
usr.bin/mandoc/mandocdb.c
1692
if (n->sec == SEC_SYNOPSIS)
usr.bin/mandoc/mandocdb.c
1694
putmdockey(mpage, n, mask, 0);
usr.bin/mandoc/mandocdb.c
1702
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1705
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mandocdb.c
1708
if (n->child != NULL)
usr.bin/mandoc/mandocdb.c
1709
parse_mdoc_fname(mpage, n->child);
usr.bin/mandoc/mandocdb.c
1716
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1720
for (n = n->child; n != NULL; n = n->next) {
usr.bin/mandoc/mandocdb.c
1721
if (n->flags & NODE_NOSRC)
usr.bin/mandoc/mandocdb.c
1723
cp = n->string;
usr.bin/mandoc/mandocdb.c
1724
if (n->sec == SEC_SYNOPSIS)
usr.bin/mandoc/mandocdb.c
1727
if (n->sec == SEC_SYNOPSIS)
usr.bin/mandoc/mandocdb.c
1735
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1739
if (n->type != ROFFT_ELEM && n->type != ROFFT_BODY)
usr.bin/mandoc/mandocdb.c
1742
if (n->child != NULL &&
usr.bin/mandoc/mandocdb.c
1743
n->child->next == NULL &&
usr.bin/mandoc/mandocdb.c
1744
n->child->type == ROFFT_TEXT)
usr.bin/mandoc/mandocdb.c
1748
deroff(&cp, n);
usr.bin/mandoc/mandocdb.c
1750
putkey(mpage, cp, TYPE_Vt | (n->tok == MDOC_Va ||
usr.bin/mandoc/mandocdb.c
1751
n->type == ROFFT_BODY ? TYPE_Va : 0));
usr.bin/mandoc/mandocdb.c
1760
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1764
if (NULL == (n = n->child))
usr.bin/mandoc/mandocdb.c
1767
if (NULL == n->next) {
usr.bin/mandoc/mandocdb.c
1768
putkey(mpage, n->string, TYPE_Xr);
usr.bin/mandoc/mandocdb.c
1772
mandoc_asprintf(&cp, "%s(%s)", n->string, n->next->string);
usr.bin/mandoc/mandocdb.c
1780
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1783
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mandocdb.c
1784
deroff(&mpage->desc, n);
usr.bin/mandoc/mandocdb.c
1790
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1793
if (SEC_NAME == n->sec)
usr.bin/mandoc/mandocdb.c
1794
putmdockey(mpage, n->child, NAME_TITLE, 0);
usr.bin/mandoc/mandocdb.c
1795
else if (n->sec == SEC_SYNOPSIS && n->type == ROFFT_HEAD) {
usr.bin/mandoc/mandocdb.c
1796
if (n->child == NULL)
usr.bin/mandoc/mandocdb.c
1799
putmdockey(mpage, n->child, NAME_SYN, 0);
usr.bin/mandoc/mandocdb.c
1802
n->child == NULL || n->child->string == NULL ||
usr.bin/mandoc/mandocdb.c
1803
strcasecmp(n->child->string, meta->title))) {
usr.bin/mandoc/mandocdb.c
1804
putkey(mpage, n->child->string, NAME_HEAD);
usr.bin/mandoc/mandocdb.c
1812
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1815
return n->sec == SEC_CUSTOM && n->type == ROFFT_HEAD;
usr.bin/mandoc/mandocdb.c
1820
const struct roff_node *n)
usr.bin/mandoc/mandocdb.c
1823
return n->type == ROFFT_HEAD;
usr.bin/mandoc/mdoc.c
165
struct roff_node *n;
usr.bin/mandoc/mdoc.c
169
n = mdoc->last;
usr.bin/mandoc/mdoc.c
178
if ((n->tok == MDOC_Bl && n->type == ROFFT_BODY &&
usr.bin/mandoc/mdoc.c
179
n->end == ENDBODY_NOT && n->norm->Bl.type == LIST_column) ||
usr.bin/mandoc/mdoc.c
180
(n->parent != NULL && n->parent->tok == MDOC_Bl &&
usr.bin/mandoc/mdoc.c
181
n->parent->norm->Bl.type == LIST_column)) {
usr.bin/mandoc/mdoc.c
307
struct roff_node *n;
usr.bin/mandoc/mdoc.c
359
n = mdoc->last;
usr.bin/mandoc/mdoc.c
360
if (n == NULL || tok == MDOC_It || tok == MDOC_El ||
usr.bin/mandoc/mdoc.c
373
if ((n->tok == MDOC_Bl && n->type == ROFFT_BODY &&
usr.bin/mandoc/mdoc.c
374
n->end == ENDBODY_NOT && n->norm->Bl.type == LIST_column) ||
usr.bin/mandoc/mdoc.c
375
(n->parent != NULL && n->parent->tok == MDOC_Bl &&
usr.bin/mandoc/mdoc.c
376
n->parent->norm->Bl.type == LIST_column)) {
usr.bin/mandoc/mdoc_argv.c
416
struct roff_node *n;
usr.bin/mandoc/mdoc_argv.c
429
for (n = mdoc->last; n != NULL; n = n->parent) {
usr.bin/mandoc/mdoc_argv.c
430
if (n->tok != MDOC_Bl)
usr.bin/mandoc/mdoc_argv.c
432
if (n->norm->Bl.type == LIST_column)
usr.bin/mandoc/mdoc_html.c
1014
if (n->norm->An.auth == AUTH_split) {
usr.bin/mandoc/mdoc_html.c
1019
if (n->norm->An.auth == AUTH_nosplit) {
usr.bin/mandoc/mdoc_html.c
1028
if (n->sec == SEC_AUTHORS && ! (h->flags & HTML_NOSPLIT))
usr.bin/mandoc/mdoc_html.c
1038
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1049
if (n->parent->tok != MDOC_Fo) {
usr.bin/mandoc/mdoc_html.c
1053
for (nn = n->child; nn != NULL; nn = nn->next) {
usr.bin/mandoc/mdoc_html.c
1062
if (n->child != NULL &&
usr.bin/mandoc/mdoc_html.c
1063
(nn = roff_node_next(n)) != NULL &&
usr.bin/mandoc/mdoc_html.c
1077
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1079
if (NULL == (n = n->child))
usr.bin/mandoc/mdoc_html.c
1082
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_html.c
1084
if (strcmp(n->string, "#include")) {
usr.bin/mandoc/mdoc_html.c
1090
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1092
if (NULL != (n = n->next)) {
usr.bin/mandoc/mdoc_html.c
1093
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_html.c
1096
cp = n->string;
usr.bin/mandoc/mdoc_html.c
1108
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1111
n = n->next;
usr.bin/mandoc/mdoc_html.c
1114
for ( ; n; n = n->next) {
usr.bin/mandoc/mdoc_html.c
1115
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_html.c
1116
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1125
if (n->type == ROFFT_BLOCK) {
usr.bin/mandoc/mdoc_html.c
1126
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1128
} else if (n->type == ROFFT_ELEM) {
usr.bin/mandoc/mdoc_html.c
1129
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1130
} else if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_html.c
1140
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1153
pretty = NODE_SYNPRETTY & n->flags;
usr.bin/mandoc/mdoc_html.c
1154
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1157
assert(n->child->string);
usr.bin/mandoc/mdoc_html.c
1158
sp = n->child->string;
usr.bin/mandoc/mdoc_html.c
1175
t = print_otag_id(h, TAG_CODE, "Fn", n);
usr.bin/mandoc/mdoc_html.c
1186
for (n = n->child->next; n; n = n->next) {
usr.bin/mandoc/mdoc_html.c
1187
if (NODE_SYNPRETTY & n->flags)
usr.bin/mandoc/mdoc_html.c
1192
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1194
if (n->next) {
usr.bin/mandoc/mdoc_html.c
1215
if (NULL == n->child)
usr.bin/mandoc/mdoc_html.c
1217
else if (0 == strcmp("on", n->child->string))
usr.bin/mandoc/mdoc_html.c
1240
if (n->flags & NODE_NOFILL) {
usr.bin/mandoc/mdoc_html.c
1242
if (n->flags & NODE_ID)
usr.bin/mandoc/mdoc_html.c
1243
mdoc_tg_pre(meta, n, h);
usr.bin/mandoc/mdoc_html.c
1250
id = n->flags & NODE_ID ? html_make_id(n, 1) : NULL;
usr.bin/mandoc/mdoc_html.c
1263
if ((link = n->child) == NULL)
usr.bin/mandoc/mdoc_html.c
1267
punct = n->last;
usr.bin/mandoc/mdoc_html.c
1300
for (n = n->child; n; n = n->next) {
usr.bin/mandoc/mdoc_html.c
1301
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_html.c
1302
mandoc_asprintf(&cp, "mailto:%s", n->string);
usr.bin/mandoc/mdoc_html.c
1304
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1316
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
1318
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1321
if (n->child != NULL) {
usr.bin/mandoc/mdoc_html.c
1322
t = print_otag_id(h, TAG_CODE, "Fn", n);
usr.bin/mandoc/mdoc_html.c
1323
print_text(h, n->child->string);
usr.bin/mandoc/mdoc_html.c
1340
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_html.c
1353
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
1363
if (NODE_SYNPRETTY & n->flags && NODE_LINE & n->flags)
usr.bin/mandoc/mdoc_html.c
1369
if (NULL != (n = n->child)) {
usr.bin/mandoc/mdoc_html.c
1370
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_html.c
1373
t = print_otag(h, TAG_A, "chI", "In", n->string);
usr.bin/mandoc/mdoc_html.c
1376
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1379
n = n->next;
usr.bin/mandoc/mdoc_html.c
1385
for ( ; n; n = n->next) {
usr.bin/mandoc/mdoc_html.c
1386
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_html.c
1387
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
1413
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
1425
if (FONT_Em == n->norm->Bf.font)
usr.bin/mandoc/mdoc_html.c
1427
else if (FONT_Sy == n->norm->Bf.font)
usr.bin/mandoc/mdoc_html.c
1429
else if (FONT_Li == n->norm->Bf.font)
usr.bin/mandoc/mdoc_html.c
1449
if ( ! (n->next == NULL || n->next->flags & NODE_LINE))
usr.bin/mandoc/mdoc_html.c
1456
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
1458
if (n->sec == SEC_SEE_ALSO)
usr.bin/mandoc/mdoc_html.c
1464
if (n->sec == SEC_SEE_ALSO)
usr.bin/mandoc/mdoc_html.c
1477
print_otag_id(h, TAG_SPAN, roff_name[n->tok], n);
usr.bin/mandoc/mdoc_html.c
1484
print_otag_id(h, TAG_B, "Sy", n);
usr.bin/mandoc/mdoc_html.c
1491
if (n->sec == SEC_LIBRARY &&
usr.bin/mandoc/mdoc_html.c
1492
n->flags & NODE_LINE &&
usr.bin/mandoc/mdoc_html.c
1493
roff_node_prev(n) != NULL)
usr.bin/mandoc/mdoc_html.c
1510
arg = n->child->string;
usr.bin/mandoc/mdoc_html.c
1512
switch (n->tok) {
usr.bin/mandoc/mdoc_html.c
1515
if ((nn = roff_node_prev(n)) != NULL && nn->tok == MDOC__A &&
usr.bin/mandoc/mdoc_html.c
1516
((nn = roff_node_next(n)) == NULL || nn->tok != MDOC__A))
usr.bin/mandoc/mdoc_html.c
1566
if (n->parent != NULL && n->parent->tok == MDOC_Rs &&
usr.bin/mandoc/mdoc_html.c
1567
n->parent->norm->Rs.quote_T) {
usr.bin/mandoc/mdoc_html.c
1593
switch (n->tok) {
usr.bin/mandoc/mdoc_html.c
1595
if ((nn = roff_node_next(n)) != NULL && nn->tok == MDOC__A &&
usr.bin/mandoc/mdoc_html.c
1597
((nn = roff_node_prev(n)) == NULL || nn->tok != MDOC__A))
usr.bin/mandoc/mdoc_html.c
1601
if (n->parent != NULL && n->parent->tok == MDOC_Rs &&
usr.bin/mandoc/mdoc_html.c
1602
n->parent->norm->Rs.quote_T) {
usr.bin/mandoc/mdoc_html.c
1610
if (n->parent == NULL || n->parent->tok != MDOC_Rs)
usr.bin/mandoc/mdoc_html.c
1614
print_text(h, roff_node_next(n) ? "," : ".");
usr.bin/mandoc/mdoc_html.c
1621
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
1627
if (n->parent->args != NULL || n->prev->child == NULL)
usr.bin/mandoc/mdoc_html.c
1641
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_html.c
1648
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_html.c
1651
switch (n->tok) {
usr.bin/mandoc/mdoc_html.c
1654
print_text(h, n->child != NULL && n->child->next == NULL &&
usr.bin/mandoc/mdoc_html.c
1655
n->child->tok == MDOC_Mt ? "<" : "\\(la");
usr.bin/mandoc/mdoc_html.c
1679
if (NULL == n->norm->Es ||
usr.bin/mandoc/mdoc_html.c
1680
NULL == n->norm->Es->child)
usr.bin/mandoc/mdoc_html.c
1682
print_text(h, n->norm->Es->child->string);
usr.bin/mandoc/mdoc_html.c
1717
if (n->type != ROFFT_BODY && n->type != ROFFT_ELEM)
usr.bin/mandoc/mdoc_html.c
1722
switch (n->tok) {
usr.bin/mandoc/mdoc_html.c
1725
print_text(h, n->child != NULL && n->child->next == NULL &&
usr.bin/mandoc/mdoc_html.c
1726
n->child->tok == MDOC_Mt ? ">" : "\\(ra");
usr.bin/mandoc/mdoc_html.c
1739
if (n->norm->Es == NULL ||
usr.bin/mandoc/mdoc_html.c
1740
n->norm->Es->child == NULL ||
usr.bin/mandoc/mdoc_html.c
1741
n->norm->Es->child->next == NULL)
usr.bin/mandoc/mdoc_html.c
1744
print_text(h, n->norm->Es->child->next->string);
usr.bin/mandoc/mdoc_html.c
1772
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_html.c
1775
if (n->end == ENDBODY_NOT &&
usr.bin/mandoc/mdoc_html.c
1776
n->parent->head->child == NULL &&
usr.bin/mandoc/mdoc_html.c
1777
n->child != NULL &&
usr.bin/mandoc/mdoc_html.c
1778
n->child->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_html.c
1780
else if (n->end != ENDBODY_NOT ? n->child != NULL :
usr.bin/mandoc/mdoc_html.c
1781
n->parent->head->child != NULL && (n->child != NULL ||
usr.bin/mandoc/mdoc_html.c
1782
(n->parent->tail != NULL && n->parent->tail->child != NULL)))
usr.bin/mandoc/mdoc_html.c
1792
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_html.c
1795
if (n->end != ENDBODY_NOT) {
usr.bin/mandoc/mdoc_html.c
1800
body = n->child != NULL || n->parent->head->child != NULL;
usr.bin/mandoc/mdoc_html.c
1801
tail = n->parent->tail != NULL && n->parent->tail->child != NULL;
usr.bin/mandoc/mdoc_html.c
246
synopsis_pre(struct html *h, struct roff_node *n)
usr.bin/mandoc/mdoc_html.c
250
if ((n->flags & NODE_SYNPRETTY) == 0 ||
usr.bin/mandoc/mdoc_html.c
251
(np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/mdoc_html.c
254
if (np->tok == n->tok &&
usr.bin/mandoc/mdoc_html.c
255
MDOC_Fo != n->tok &&
usr.bin/mandoc/mdoc_html.c
256
MDOC_Ft != n->tok &&
usr.bin/mandoc/mdoc_html.c
257
MDOC_Fn != n->tok) {
usr.bin/mandoc/mdoc_html.c
270
if (n->tok != MDOC_Fn && n->tok != MDOC_Fo)
usr.bin/mandoc/mdoc_html.c
285
struct roff_node *n;
usr.bin/mandoc/mdoc_html.c
289
n = mdoc->first->child;
usr.bin/mandoc/mdoc_html.c
297
if (n != NULL && n->type == ROFFT_COMMENT)
usr.bin/mandoc/mdoc_html.c
298
print_gen_comment(h, n);
usr.bin/mandoc/mdoc_html.c
304
print_mdoc_nodelist(mdoc, n, h);
usr.bin/mandoc/mdoc_html.c
336
while (n != NULL) {
usr.bin/mandoc/mdoc_html.c
337
print_mdoc_node(meta, n, h);
usr.bin/mandoc/mdoc_html.c
338
n = n->next;
usr.bin/mandoc/mdoc_html.c
348
if (n->type == ROFFT_COMMENT || n->flags & NODE_NOPRT)
usr.bin/mandoc/mdoc_html.c
351
if ((n->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/mdoc_html.c
354
n->tok != ROFF_fi && n->flags & NODE_LINE)
usr.bin/mandoc/mdoc_html.c
358
n->flags &= ~NODE_ENDED;
usr.bin/mandoc/mdoc_html.c
359
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
361
if (n->flags & NODE_LINE) {
usr.bin/mandoc/mdoc_html.c
362
switch (*n->string) {
usr.bin/mandoc/mdoc_html.c
369
(n->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/mdoc_html.c
378
if (n->flags & NODE_DELIMC)
usr.bin/mandoc/mdoc_html.c
380
if (n->flags & NODE_HREF)
usr.bin/mandoc/mdoc_html.c
381
print_tagged_text(h, n->string, n);
usr.bin/mandoc/mdoc_html.c
383
print_text(h, n->string);
usr.bin/mandoc/mdoc_html.c
384
if (n->flags & NODE_DELIMO)
usr.bin/mandoc/mdoc_html.c
39
struct roff_node *n, \
usr.bin/mandoc/mdoc_html.c
390
print_eqn(h, n->eqn);
usr.bin/mandoc/mdoc_html.c
398
print_tbl(h, n->span);
usr.bin/mandoc/mdoc_html.c
411
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/mdoc_html.c
412
roff_html_pre(h, n);
usr.bin/mandoc/mdoc_html.c
417
assert(n->tok >= MDOC_Dd && n->tok < MDOC_MAX);
usr.bin/mandoc/mdoc_html.c
418
if (mdoc_html_acts[n->tok - MDOC_Dd].pre != NULL &&
usr.bin/mandoc/mdoc_html.c
419
(n->end == ENDBODY_NOT || n->child != NULL))
usr.bin/mandoc/mdoc_html.c
420
child = (*mdoc_html_acts[n->tok - MDOC_Dd].pre)(meta,
usr.bin/mandoc/mdoc_html.c
421
n, h);
usr.bin/mandoc/mdoc_html.c
425
if (h->flags & HTML_KEEP && n->flags & NODE_LINE) {
usr.bin/mandoc/mdoc_html.c
430
if (child && n->child != NULL)
usr.bin/mandoc/mdoc_html.c
431
print_mdoc_nodelist(meta, n->child, h);
usr.bin/mandoc/mdoc_html.c
436
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
441
if (mdoc_html_acts[n->tok - MDOC_Dd].post == NULL ||
usr.bin/mandoc/mdoc_html.c
442
n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_html.c
444
(*mdoc_html_acts[n->tok - MDOC_Dd].post)(meta, n, h);
usr.bin/mandoc/mdoc_html.c
445
if (n->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_html.c
446
n->body->flags |= NODE_ENDED;
usr.bin/mandoc/mdoc_html.c
521
print_otag_id(h, TAG_CODE, roff_name[n->tok], n);
usr.bin/mandoc/mdoc_html.c
533
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
538
n->sec <= SEC_SYNOPSIS) {
usr.bin/mandoc/mdoc_html.c
544
for (sn = n->next; sn != NULL; sn = sn->next)
usr.bin/mandoc/mdoc_html.c
555
for (sn = n; sn != NULL; sn = sn->next) {
usr.bin/mandoc/mdoc_html.c
586
print_otag_id(h, TAG_H2, "Sh", n);
usr.bin/mandoc/mdoc_html.c
589
if (n->sec == SEC_AUTHORS)
usr.bin/mandoc/mdoc_html.c
601
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
607
print_otag_id(h, TAG_H3, "Ss", n);
usr.bin/mandoc/mdoc_html.c
622
print_otag_id(h, TAG_CODE, "Fl", n);
usr.bin/mandoc/mdoc_html.c
624
if (n->child != NULL ||
usr.bin/mandoc/mdoc_html.c
625
((nn = roff_node_next(n)) != NULL &&
usr.bin/mandoc/mdoc_html.c
636
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
654
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
670
synopsis_pre(h, n);
usr.bin/mandoc/mdoc_html.c
681
if (n->child == NULL)
usr.bin/mandoc/mdoc_html.c
684
name = n->child->string;
usr.bin/mandoc/mdoc_html.c
685
if (n->child->next != NULL) {
usr.bin/mandoc/mdoc_html.c
686
section = n->child->next->string;
usr.bin/mandoc/mdoc_html.c
717
if ((id = html_make_id(n, 1)) != NULL) {
usr.bin/mandoc/mdoc_html.c
728
if ( ! (NODE_LINE & n->flags))
usr.bin/mandoc/mdoc_html.c
753
bl = n->parent;
usr.bin/mandoc/mdoc_html.c
764
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
768
print_otag_id(h, TAG_LI, NULL, n);
usr.bin/mandoc/mdoc_html.c
778
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
780
print_otag_id(h, TAG_DT, NULL, n);
usr.bin/mandoc/mdoc_html.c
790
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
792
print_otag_id(h, TAG_DT, NULL, n);
usr.bin/mandoc/mdoc_html.c
795
if (n->child == NULL) {
usr.bin/mandoc/mdoc_html.c
806
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
813
print_otag_id(h, TAG_TR, NULL, n);
usr.bin/mandoc/mdoc_html.c
829
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
841
bl = &n->norm->Bl;
usr.bin/mandoc/mdoc_html.c
880
bl->comp ? "Bl-tag Bl-compact" : "Bl-tag", n->body);
usr.bin/mandoc/mdoc_html.c
893
print_otag_id(h, elemtype, cattr, n->body);
usr.bin/mandoc/mdoc_html.c
900
if (roff_node_prev(n) != NULL)
usr.bin/mandoc/mdoc_html.c
915
print_otag_id(h, TAG_I, "Em", n);
usr.bin/mandoc/mdoc_html.c
922
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
933
print_otag_id(h, TAG_DIV, "Bd Bd-indent", n);
usr.bin/mandoc/mdoc_html.c
934
if (n->tok == MDOC_Dl)
usr.bin/mandoc/mdoc_html.c
944
id = html_make_id(n, 0);
usr.bin/mandoc/mdoc_html.c
957
switch (n->type) {
usr.bin/mandoc/mdoc_html.c
971
comp = n->norm->Bd.comp;
usr.bin/mandoc/mdoc_html.c
972
for (nn = n; nn != NULL && comp == 0; nn = nn->parent) {
usr.bin/mandoc/mdoc_html.c
986
if (n->norm->Bd.offs != NULL &&
usr.bin/mandoc/mdoc_html.c
987
strcmp(n->norm->Bd.offs, "left") != 0)
usr.bin/mandoc/mdoc_html.c
990
if (n->norm->Bd.type == DISP_literal)
usr.bin/mandoc/mdoc_html.c
993
print_otag_id(h, TAG_DIV, buf, n);
usr.bin/mandoc/mdoc_macro.c
1001
roff_name[n->tok]);
usr.bin/mandoc/mdoc_macro.c
1002
rew_pending(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
1003
n = mdoc->last;
usr.bin/mandoc/mdoc_macro.c
1007
blk = n;
usr.bin/mandoc/mdoc_macro.c
1017
if (tok != MDOC_Sh && (n->tok == MDOC_Sh ||
usr.bin/mandoc/mdoc_macro.c
1018
(tok != MDOC_Ss && (n->tok == MDOC_Ss ||
usr.bin/mandoc/mdoc_macro.c
1019
(tok != MDOC_It && n->tok == MDOC_It)))))
usr.bin/mandoc/mdoc_macro.c
1033
rew_pending(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
1038
if (tok == MDOC_It && (n == NULL || n->tok != MDOC_Bl)) {
usr.bin/mandoc/mdoc_macro.c
1250
struct roff_node *n;
usr.bin/mandoc/mdoc_macro.c
1307
for (n = body->child; n && n->next; n = n->next)
usr.bin/mandoc/mdoc_macro.c
1309
if (n && n->tok == MDOC_Ns)
usr.bin/mandoc/mdoc_macro.c
1310
roff_node_relink(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
1499
struct roff_node *n;
usr.bin/mandoc/mdoc_macro.c
1504
n = mdoc->last;
usr.bin/mandoc/mdoc_macro.c
1506
n = n->parent;
usr.bin/mandoc/mdoc_macro.c
1507
if (n->tok == MDOC_Nm)
usr.bin/mandoc/mdoc_macro.c
1508
rew_last(mdoc, n->parent);
usr.bin/mandoc/mdoc_macro.c
1573
struct roff_node *body, *n;
usr.bin/mandoc/mdoc_macro.c
1578
for (n = mdoc->last; n != NULL; n = n->parent) {
usr.bin/mandoc/mdoc_macro.c
1579
if (n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_macro.c
1581
if (n->tok == MDOC_It && n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_macro.c
1582
body = n;
usr.bin/mandoc/mdoc_macro.c
1583
if (n->tok == MDOC_Bl && n->end == ENDBODY_NOT)
usr.bin/mandoc/mdoc_macro.c
1587
if (n == NULL || n->norm->Bl.type != LIST_column) {
usr.bin/mandoc/mdoc_macro.c
220
struct roff_node *n;
usr.bin/mandoc/mdoc_macro.c
224
n = mdoc->last->flags & NODE_VALID ?
usr.bin/mandoc/mdoc_macro.c
227
for ( ; n; n = n->parent)
usr.bin/mandoc/mdoc_macro.c
228
if (n->type == ROFFT_BLOCK &&
usr.bin/mandoc/mdoc_macro.c
229
mdoc_macro(n->tok)->flags & MDOC_EXPLICIT)
usr.bin/mandoc/mdoc_macro.c
231
n->line, n->pos, "%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_macro.c
286
rew_pending(struct roff_man *mdoc, const struct roff_node *n)
usr.bin/mandoc/mdoc_macro.c
290
rew_last(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
292
if (mdoc->last == n) {
usr.bin/mandoc/mdoc_macro.c
293
switch (n->type) {
usr.bin/mandoc/mdoc_macro.c
295
roff_body_alloc(mdoc, n->line, n->pos,
usr.bin/mandoc/mdoc_macro.c
296
n->tok);
usr.bin/mandoc/mdoc_macro.c
297
if (n->tok == MDOC_Ss)
usr.bin/mandoc/mdoc_macro.c
305
if ( ! (n->flags & NODE_BROKEN))
usr.bin/mandoc/mdoc_macro.c
308
n = mdoc->last;
usr.bin/mandoc/mdoc_macro.c
311
if ((n = n->parent) == NULL)
usr.bin/mandoc/mdoc_macro.c
314
if (n->type == ROFFT_BLOCK ||
usr.bin/mandoc/mdoc_macro.c
315
n->type == ROFFT_HEAD) {
usr.bin/mandoc/mdoc_macro.c
316
if (n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_macro.c
373
struct roff_node *n;
usr.bin/mandoc/mdoc_macro.c
375
n = mdoc->last;
usr.bin/mandoc/mdoc_macro.c
376
if (n->type != ROFFT_ELEM)
usr.bin/mandoc/mdoc_macro.c
377
n = n->parent;
usr.bin/mandoc/mdoc_macro.c
378
assert(n->type == ROFFT_ELEM);
usr.bin/mandoc/mdoc_macro.c
379
assert(tok == n->tok);
usr.bin/mandoc/mdoc_macro.c
380
rew_last(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
384
break_intermediate(struct roff_node *n, struct roff_node *breaker)
usr.bin/mandoc/mdoc_macro.c
386
if (n != breaker &&
usr.bin/mandoc/mdoc_macro.c
387
n->type != ROFFT_BLOCK && n->type != ROFFT_HEAD &&
usr.bin/mandoc/mdoc_macro.c
388
(n->type != ROFFT_BODY || n->end != ENDBODY_NOT))
usr.bin/mandoc/mdoc_macro.c
389
n = n->parent;
usr.bin/mandoc/mdoc_macro.c
390
while (n != breaker) {
usr.bin/mandoc/mdoc_macro.c
391
if ( ! (n->flags & NODE_VALID))
usr.bin/mandoc/mdoc_macro.c
392
n->flags |= NODE_BROKEN;
usr.bin/mandoc/mdoc_macro.c
393
n = n->parent;
usr.bin/mandoc/mdoc_macro.c
406
struct roff_node *n;
usr.bin/mandoc/mdoc_macro.c
413
for (n = mdoc->last; n != NULL && n != target; n = n->parent) {
usr.bin/mandoc/mdoc_macro.c
414
if (n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_macro.c
416
if (n->type == ROFFT_BLOCK &&
usr.bin/mandoc/mdoc_macro.c
417
mdoc_macro(n->tok)->flags & MDOC_EXPLICIT) {
usr.bin/mandoc/mdoc_macro.c
425
roff_name[tok], roff_name[n->tok]);
usr.bin/mandoc/mdoc_macro.c
546
struct roff_node *n; /* Search back to our block. */
usr.bin/mandoc/mdoc_macro.c
572
for (n = mdoc->last; n; n = n->parent) {
usr.bin/mandoc/mdoc_macro.c
573
if (n->flags & NODE_ENDED || n->tok != atok ||
usr.bin/mandoc/mdoc_macro.c
574
n->type != ROFFT_BODY || n->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_macro.c
576
body = n;
usr.bin/mandoc/mdoc_macro.c
586
for (n = mdoc->last; n; n = n->parent) {
usr.bin/mandoc/mdoc_macro.c
587
if (n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_macro.c
595
if (body == NULL || n->type != ROFFT_BLOCK)
usr.bin/mandoc/mdoc_macro.c
603
if (n->tok == MDOC_Nm) {
usr.bin/mandoc/mdoc_macro.c
605
n->flags |= NODE_BROKEN | NODE_ENDED;
usr.bin/mandoc/mdoc_macro.c
609
if (n->tok == MDOC_It) {
usr.bin/mandoc/mdoc_macro.c
610
itblk = n;
usr.bin/mandoc/mdoc_macro.c
614
if (atok == n->tok) {
usr.bin/mandoc/mdoc_macro.c
660
if (n->tok == MDOC_Nd) {
usr.bin/mandoc/mdoc_macro.c
662
n->flags |= NODE_BROKEN | NODE_ENDED;
usr.bin/mandoc/mdoc_macro.c
664
rew_last(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
671
n->flags |= NODE_BROKEN;
usr.bin/mandoc/mdoc_macro.c
673
later = n;
usr.bin/mandoc/mdoc_macro.c
697
if (endbody == NULL && n != NULL)
usr.bin/mandoc/mdoc_macro.c
698
rew_pending(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
716
n = endbody;
usr.bin/mandoc/mdoc_macro.c
722
if (j == maxargs && n != NULL)
usr.bin/mandoc/mdoc_macro.c
723
rew_last(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
741
if (n != NULL)
usr.bin/mandoc/mdoc_macro.c
742
rew_last(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
748
if (n != NULL) {
usr.bin/mandoc/mdoc_macro.c
750
if (ntok != TOKEN_NONE && n->flags & NODE_BROKEN) {
usr.bin/mandoc/mdoc_macro.c
751
target = n;
usr.bin/mandoc/mdoc_macro.c
758
rew_pending(mdoc, n);
usr.bin/mandoc/mdoc_macro.c
956
struct roff_node *n;
usr.bin/mandoc/mdoc_macro.c
975
for (n = mdoc->last; n != NULL; n = n->parent) {
usr.bin/mandoc/mdoc_macro.c
976
if (n->flags & NODE_ENDED) {
usr.bin/mandoc/mdoc_macro.c
977
if ( ! (n->flags & NODE_VALID))
usr.bin/mandoc/mdoc_macro.c
978
n->flags |= NODE_BROKEN;
usr.bin/mandoc/mdoc_macro.c
981
if (n->type != ROFFT_BLOCK)
usr.bin/mandoc/mdoc_macro.c
984
if (tok == MDOC_It && n->tok == MDOC_Bl) {
usr.bin/mandoc/mdoc_macro.c
994
if (mdoc_macro(n->tok)->flags & MDOC_EXPLICIT) {
usr.bin/mandoc/mdoc_man.c
1004
if (roff_node_next(n->parent) != NULL)
usr.bin/mandoc/mdoc_man.c
1012
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1020
switch (n->norm->Bf.font) {
usr.bin/mandoc/mdoc_man.c
1038
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_man.c
1045
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1060
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1062
while ((n = n->parent) != NULL)
usr.bin/mandoc/mdoc_man.c
1063
if (n->tok == MDOC_Bk)
usr.bin/mandoc/mdoc_man.c
1084
if (n->norm->Bl.offs) {
usr.bin/mandoc/mdoc_man.c
1085
print_offs(n->norm->Bl.offs, 0);
usr.bin/mandoc/mdoc_man.c
1089
switch (n->norm->Bl.type) {
usr.bin/mandoc/mdoc_man.c
1091
n->norm->Bl.count = 0;
usr.bin/mandoc/mdoc_man.c
1099
if (n->child != NULL) {
usr.bin/mandoc/mdoc_man.c
1101
for (icol = 0; icol < n->norm->Bl.ncols; icol++)
usr.bin/mandoc/mdoc_man.c
1113
switch (n->norm->Bl.type) {
usr.bin/mandoc/mdoc_man.c
1115
if (n->child != NULL)
usr.bin/mandoc/mdoc_man.c
1119
n->norm->Bl.count = 0;
usr.bin/mandoc/mdoc_man.c
1125
if (n->norm->Bl.offs) {
usr.bin/mandoc/mdoc_man.c
1136
if (roff_node_next(n->parent) != NULL)
usr.bin/mandoc/mdoc_man.c
1159
if (roff_node_next(n->parent) != NULL)
usr.bin/mandoc/mdoc_man.c
1175
if (NULL == n->norm->Es ||
usr.bin/mandoc/mdoc_man.c
1176
NULL == n->norm->Es->child)
usr.bin/mandoc/mdoc_man.c
1179
print_word(n->norm->Es->child->string);
usr.bin/mandoc/mdoc_man.c
1188
if (NULL == n->norm->Es ||
usr.bin/mandoc/mdoc_man.c
1189
NULL == n->norm->Es->child ||
usr.bin/mandoc/mdoc_man.c
1190
NULL == n->norm->Es->child->next)
usr.bin/mandoc/mdoc_man.c
1194
print_word(n->norm->Es->child->next->string);
usr.bin/mandoc/mdoc_man.c
1202
if (n->end == ENDBODY_NOT &&
usr.bin/mandoc/mdoc_man.c
1203
n->parent->head->child == NULL &&
usr.bin/mandoc/mdoc_man.c
1204
n->child != NULL &&
usr.bin/mandoc/mdoc_man.c
1205
n->child->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_man.c
1207
else if (n->end != ENDBODY_NOT ? n->child != NULL :
usr.bin/mandoc/mdoc_man.c
1208
n->parent->head->child != NULL && (n->child != NULL ||
usr.bin/mandoc/mdoc_man.c
1209
(n->parent->tail != NULL && n->parent->tail->child != NULL)))
usr.bin/mandoc/mdoc_man.c
1219
if (n->end != ENDBODY_NOT) {
usr.bin/mandoc/mdoc_man.c
1224
body = n->child != NULL || n->parent->head->child != NULL;
usr.bin/mandoc/mdoc_man.c
1225
tail = n->parent->tail != NULL && n->parent->tail->child != NULL;
usr.bin/mandoc/mdoc_man.c
1240
am_Fa = MDOC_Fa == n->tok;
usr.bin/mandoc/mdoc_man.c
1243
n = n->child;
usr.bin/mandoc/mdoc_man.c
1245
while (NULL != n) {
usr.bin/mandoc/mdoc_man.c
1247
if (am_Fa || NODE_SYNPRETTY & n->flags)
usr.bin/mandoc/mdoc_man.c
1249
print_node(meta, n);
usr.bin/mandoc/mdoc_man.c
1251
if (NULL != (n = n->next))
usr.bin/mandoc/mdoc_man.c
1262
if ((nn = roff_node_next(n)) != NULL && nn->tok == MDOC_Fa)
usr.bin/mandoc/mdoc_man.c
1269
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1286
if (n->child != NULL)
usr.bin/mandoc/mdoc_man.c
1297
if (n->child == NULL &&
usr.bin/mandoc/mdoc_man.c
1298
((nn = roff_node_next(n)) != NULL &&
usr.bin/mandoc/mdoc_man.c
1308
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1310
n = n->child;
usr.bin/mandoc/mdoc_man.c
1311
if (NULL == n)
usr.bin/mandoc/mdoc_man.c
1314
if (NODE_SYNPRETTY & n->flags)
usr.bin/mandoc/mdoc_man.c
1318
print_node(meta, n);
usr.bin/mandoc/mdoc_man.c
1324
n = n->next;
usr.bin/mandoc/mdoc_man.c
1325
if (NULL != n)
usr.bin/mandoc/mdoc_man.c
1326
pre_fa(meta, n);
usr.bin/mandoc/mdoc_man.c
1335
if (NODE_SYNPRETTY & n->flags) {
usr.bin/mandoc/mdoc_man.c
1345
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1347
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1350
if (n->child == NULL)
usr.bin/mandoc/mdoc_man.c
1352
if (NODE_SYNPRETTY & n->flags)
usr.bin/mandoc/mdoc_man.c
1371
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1373
if (n->child != NULL)
usr.bin/mandoc/mdoc_man.c
1377
post_fn(meta, n);
usr.bin/mandoc/mdoc_man.c
1388
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1397
print_word(n->child->string);
usr.bin/mandoc/mdoc_man.c
1405
if (NODE_SYNPRETTY & n->flags) {
usr.bin/mandoc/mdoc_man.c
1406
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1422
if (NODE_SYNPRETTY & n->flags) {
usr.bin/mandoc/mdoc_man.c
1439
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1442
bln = n->parent->parent;
usr.bin/mandoc/mdoc_man.c
1444
(n->parent->prev == NULL &&
usr.bin/mandoc/mdoc_man.c
1482
print_width(&bln->norm->Bl, n->child);
usr.bin/mandoc/mdoc_man.c
1487
print_width(&bln->norm->Bl, n->child);
usr.bin/mandoc/mdoc_man.c
1532
bln = n->parent->parent;
usr.bin/mandoc/mdoc_man.c
1534
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1570
if (NULL != n->next) {
usr.bin/mandoc/mdoc_man.c
1588
if (SEC_LIBRARY == n->sec)
usr.bin/mandoc/mdoc_man.c
1597
if ((link = n->child) == NULL)
usr.bin/mandoc/mdoc_man.c
1601
punct = n->last;
usr.bin/mandoc/mdoc_man.c
1634
print_word(roff_name[n->tok]);
usr.bin/mandoc/mdoc_man.c
1635
if (n->child != NULL)
usr.bin/mandoc/mdoc_man.c
1636
print_word(n->child->string);
usr.bin/mandoc/mdoc_man.c
1638
if (n->tok == ROFF_ce)
usr.bin/mandoc/mdoc_man.c
1639
for (n = n->child->next; n != NULL; n = n->next)
usr.bin/mandoc/mdoc_man.c
1640
print_node(meta, n);
usr.bin/mandoc/mdoc_man.c
1655
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1658
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1666
name = n->child == NULL ? NULL : n->child->string;
usr.bin/mandoc/mdoc_man.c
1669
if (n->type == ROFFT_HEAD) {
usr.bin/mandoc/mdoc_man.c
1670
if (roff_node_prev(n->parent) == NULL)
usr.bin/mandoc/mdoc_man.c
1683
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1689
if (n->child != NULL && n->child->string != NULL)
usr.bin/mandoc/mdoc_man.c
1710
print_word(roff_name[n->tok]);
usr.bin/mandoc/mdoc_man.c
1725
if ( ! (n->next == NULL || n->next->flags & NODE_LINE))
usr.bin/mandoc/mdoc_man.c
1733
if (MDOC_It != n->parent->tok)
usr.bin/mandoc/mdoc_man.c
1744
if (SEC_SEE_ALSO == n->sec) {
usr.bin/mandoc/mdoc_man.c
1762
if (NULL == n->child)
usr.bin/mandoc/mdoc_man.c
1764
else if (0 == strcmp("on", n->child->string))
usr.bin/mandoc/mdoc_man.c
1783
if (n->child != NULL)
usr.bin/mandoc/mdoc_man.c
1784
print_word(n->child->string);
usr.bin/mandoc/mdoc_man.c
1801
for (n = n->child; n != NULL; n = n->next)
usr.bin/mandoc/mdoc_man.c
1802
print_word(n->string);
usr.bin/mandoc/mdoc_man.c
1810
if (NODE_SYNPRETTY & n->flags) {
usr.bin/mandoc/mdoc_man.c
1811
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
1813
pre_syn(n);
usr.bin/mandoc/mdoc_man.c
1829
if (n->flags & NODE_SYNPRETTY && n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_man.c
1838
n = n->child;
usr.bin/mandoc/mdoc_man.c
1839
if (NULL == n)
usr.bin/mandoc/mdoc_man.c
1841
print_node(meta, n);
usr.bin/mandoc/mdoc_man.c
1842
n = n->next;
usr.bin/mandoc/mdoc_man.c
1843
if (NULL == n)
usr.bin/mandoc/mdoc_man.c
1847
print_node(meta, n);
usr.bin/mandoc/mdoc_man.c
32
#define DECL_ARGS const struct roff_meta *meta, struct roff_node *n
usr.bin/mandoc/mdoc_man.c
610
struct roff_node *n;
usr.bin/mandoc/mdoc_man.c
614
for (n = mdoc->first->child; n != NULL; n = n->next) {
usr.bin/mandoc/mdoc_man.c
615
if (n->type != ROFFT_COMMENT)
usr.bin/mandoc/mdoc_man.c
617
printf(".\\\"%s\n", n->string);
usr.bin/mandoc/mdoc_man.c
633
for (; n != NULL; n = n->next)
usr.bin/mandoc/mdoc_man.c
634
print_node(mdoc, n);
usr.bin/mandoc/mdoc_man.c
645
if (n->flags & NODE_NOPRT)
usr.bin/mandoc/mdoc_man.c
653
n->flags & NODE_LINE &&
usr.bin/mandoc/mdoc_man.c
654
!roff_node_transparent(n))
usr.bin/mandoc/mdoc_man.c
660
n->flags &= ~NODE_ENDED;
usr.bin/mandoc/mdoc_man.c
662
switch (n->type) {
usr.bin/mandoc/mdoc_man.c
665
mandoc_msg(n->type == ROFFT_EQN ? MANDOCERR_EQN_TMAN :
usr.bin/mandoc/mdoc_man.c
666
MANDOCERR_TBL_TMAN, n->line, n->pos, NULL);
usr.bin/mandoc/mdoc_man.c
671
print_word(n->type == ROFFT_EQN ? "eqn(7)" : "tbl(7)");
usr.bin/mandoc/mdoc_man.c
681
('.' == *n->string || '\'' == *n->string)) {
usr.bin/mandoc/mdoc_man.c
686
if (n->flags & NODE_DELIMC)
usr.bin/mandoc/mdoc_man.c
690
print_word(n->string);
usr.bin/mandoc/mdoc_man.c
691
if (n->flags & NODE_DELIMO)
usr.bin/mandoc/mdoc_man.c
697
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/mdoc_man.c
698
(*roff_man_acts[n->tok])(meta, n);
usr.bin/mandoc/mdoc_man.c
701
act = mdoc_man_act(n->tok);
usr.bin/mandoc/mdoc_man.c
702
cond = act->cond == NULL || (*act->cond)(meta, n);
usr.bin/mandoc/mdoc_man.c
704
(n->end == ENDBODY_NOT || n->child != NULL))
usr.bin/mandoc/mdoc_man.c
705
do_sub = (*act->pre)(meta, n);
usr.bin/mandoc/mdoc_man.c
715
for (sub = n->child; sub; sub = sub->next)
usr.bin/mandoc/mdoc_man.c
721
if (NODE_ENDED & n->flags)
usr.bin/mandoc/mdoc_man.c
725
(*act->post)(meta, n);
usr.bin/mandoc/mdoc_man.c
727
if (ENDBODY_NOT != n->end)
usr.bin/mandoc/mdoc_man.c
728
n->body->flags |= NODE_ENDED;
usr.bin/mandoc/mdoc_man.c
735
return n->type == ROFFT_HEAD;
usr.bin/mandoc/mdoc_man.c
742
return n->type == ROFFT_BODY;
usr.bin/mandoc/mdoc_man.c
756
prefix = mdoc_man_act(n->tok)->prefix;
usr.bin/mandoc/mdoc_man.c
769
suffix = mdoc_man_act(n->tok)->suffix;
usr.bin/mandoc/mdoc_man.c
795
if (mdoc_man_act(n->tok)->pre == pre_em)
usr.bin/mandoc/mdoc_man.c
798
if (n->parent == NULL || n->parent->tok != MDOC_Rs)
usr.bin/mandoc/mdoc_man.c
801
if ((nn = roff_node_next(n)) != NULL) {
usr.bin/mandoc/mdoc_man.c
802
np = roff_node_prev(n);
usr.bin/mandoc/mdoc_man.c
804
if (nn->tok != n->tok ||
usr.bin/mandoc/mdoc_man.c
805
(np != NULL && np->tok == n->tok) ||
usr.bin/mandoc/mdoc_man.c
806
(nnn != NULL && nnn->tok == n->tok))
usr.bin/mandoc/mdoc_man.c
808
if (nn->tok == n->tok &&
usr.bin/mandoc/mdoc_man.c
809
(nnn == NULL || nnn->tok != n->tok))
usr.bin/mandoc/mdoc_man.c
821
if (n->parent->tok == MDOC_Rs && n->parent->norm->Rs.quote_T) {
usr.bin/mandoc/mdoc_man.c
833
if (n->parent->tok == MDOC_Rs && n->parent->norm->Rs.quote_T) {
usr.bin/mandoc/mdoc_man.c
838
post_percent(meta, n);
usr.bin/mandoc/mdoc_man.c
848
if (n->type == ROFFT_HEAD) {
usr.bin/mandoc/mdoc_man.c
850
print_block(mdoc_man_act(n->tok)->prefix, 0);
usr.bin/mandoc/mdoc_man.c
865
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_man.c
871
if (MDOC_Sh == n->tok && SEC_AUTHORS == n->sec)
usr.bin/mandoc/mdoc_man.c
877
pre_syn(struct roff_node *n)
usr.bin/mandoc/mdoc_man.c
881
if ((n->flags & NODE_SYNPRETTY) == 0 ||
usr.bin/mandoc/mdoc_man.c
882
(np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/mdoc_man.c
885
if (np->tok == n->tok &&
usr.bin/mandoc/mdoc_man.c
886
MDOC_Ft != n->tok &&
usr.bin/mandoc/mdoc_man.c
887
MDOC_Fo != n->tok &&
usr.bin/mandoc/mdoc_man.c
888
MDOC_Fn != n->tok) {
usr.bin/mandoc/mdoc_man.c
902
if (MDOC_Fn != n->tok && MDOC_Fo != n->tok) {
usr.bin/mandoc/mdoc_man.c
917
switch (n->norm->An.auth) {
usr.bin/mandoc/mdoc_man.c
929
else if (SEC_AUTHORS == n->sec &&
usr.bin/mandoc/mdoc_man.c
950
print_word(n->child != NULL && n->child->next == NULL &&
usr.bin/mandoc/mdoc_man.c
951
n->child->tok == MDOC_Mt ? "<" : "\\(la");
usr.bin/mandoc/mdoc_man.c
961
print_word(n->child != NULL && n->child->next == NULL &&
usr.bin/mandoc/mdoc_man.c
962
n->child->tok == MDOC_Mt ? ">" : "\\(ra");
usr.bin/mandoc/mdoc_man.c
969
if (n->norm->Bd.type == DISP_unfilled ||
usr.bin/mandoc/mdoc_man.c
970
n->norm->Bd.type == DISP_literal)
usr.bin/mandoc/mdoc_man.c
972
if (n->norm->Bd.comp == 0 && roff_node_prev(n->parent) != NULL)
usr.bin/mandoc/mdoc_man.c
974
print_offs(n->norm->Bd.offs, 1);
usr.bin/mandoc/mdoc_man.c
985
bef = n->flags & NODE_NOFILL ? ROFF_nf : ROFF_fi;
usr.bin/mandoc/mdoc_man.c
986
if (n->last == NULL)
usr.bin/mandoc/mdoc_man.c
987
now = n->norm->Bd.type == DISP_unfilled ||
usr.bin/mandoc/mdoc_man.c
988
n->norm->Bd.type == DISP_literal ? ROFF_nf : ROFF_fi;
usr.bin/mandoc/mdoc_man.c
989
else if (n->last->tok == ROFF_nf)
usr.bin/mandoc/mdoc_man.c
991
else if (n->last->tok == ROFF_fi)
usr.bin/mandoc/mdoc_man.c
994
now = n->last->flags & NODE_NOFILL ? ROFF_nf : ROFF_fi;
usr.bin/mandoc/mdoc_markdown.c
1000
n->norm->Es->child == NULL)
usr.bin/mandoc/mdoc_markdown.c
1003
md_word(n->norm->Es->child->string);
usr.bin/mandoc/mdoc_markdown.c
1009
md_post_En(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1011
if (n->norm->Es == NULL ||
usr.bin/mandoc/mdoc_markdown.c
1012
n->norm->Es->child == NULL ||
usr.bin/mandoc/mdoc_markdown.c
1013
n->norm->Es->child->next == NULL)
usr.bin/mandoc/mdoc_markdown.c
1017
md_word(n->norm->Es->child->next->string);
usr.bin/mandoc/mdoc_markdown.c
1021
md_pre_Eo(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1023
if (n->end == ENDBODY_NOT &&
usr.bin/mandoc/mdoc_markdown.c
1024
n->parent->head->child == NULL &&
usr.bin/mandoc/mdoc_markdown.c
1025
n->child != NULL &&
usr.bin/mandoc/mdoc_markdown.c
1026
n->child->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_markdown.c
1028
else if (n->end != ENDBODY_NOT ? n->child != NULL :
usr.bin/mandoc/mdoc_markdown.c
1029
n->parent->head->child != NULL && (n->child != NULL ||
usr.bin/mandoc/mdoc_markdown.c
1030
(n->parent->tail != NULL && n->parent->tail->child != NULL)))
usr.bin/mandoc/mdoc_markdown.c
1036
md_post_Eo(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1038
if (n->end != ENDBODY_NOT) {
usr.bin/mandoc/mdoc_markdown.c
1043
if (n->child == NULL && n->parent->head->child == NULL)
usr.bin/mandoc/mdoc_markdown.c
1046
if (n->parent->tail != NULL && n->parent->tail->child != NULL)
usr.bin/mandoc/mdoc_markdown.c
1053
md_pre_Fa(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1057
am_Fa = n->tok == MDOC_Fa;
usr.bin/mandoc/mdoc_markdown.c
1060
n = n->child;
usr.bin/mandoc/mdoc_markdown.c
1062
while (n != NULL) {
usr.bin/mandoc/mdoc_markdown.c
1065
md_node(n);
usr.bin/mandoc/mdoc_markdown.c
1068
if ((n = n->next) != NULL)
usr.bin/mandoc/mdoc_markdown.c
1075
md_post_Fa(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1079
if ((nn = roff_node_next(n)) != NULL && nn->tok == MDOC_Fa)
usr.bin/mandoc/mdoc_markdown.c
1084
md_pre_Fd(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1086
md_pre_syn(n);
usr.bin/mandoc/mdoc_markdown.c
1087
md_pre_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1092
md_post_Fd(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1094
md_post_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1099
md_post_Fl(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1103
md_post_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1104
if (n->child == NULL && (nn = roff_node_next(n)) != NULL &&
usr.bin/mandoc/mdoc_markdown.c
1110
md_pre_Fn(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1112
md_pre_syn(n);
usr.bin/mandoc/mdoc_markdown.c
1114
if ((n = n->child) == NULL)
usr.bin/mandoc/mdoc_markdown.c
1119
md_node(n);
usr.bin/mandoc/mdoc_markdown.c
1125
if ((n = n->next) != NULL)
usr.bin/mandoc/mdoc_markdown.c
1126
md_pre_Fa(n);
usr.bin/mandoc/mdoc_markdown.c
1131
md_post_Fn(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1134
if (n->flags & NODE_SYNPRETTY) {
usr.bin/mandoc/mdoc_markdown.c
1141
md_pre_Fo(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1143
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1145
md_pre_syn(n);
usr.bin/mandoc/mdoc_markdown.c
1148
if (n->child == NULL)
usr.bin/mandoc/mdoc_markdown.c
1150
md_pre_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1163
md_post_Fo(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1165
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1167
if (n->child != NULL)
usr.bin/mandoc/mdoc_markdown.c
1168
md_post_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1171
md_post_Fn(n);
usr.bin/mandoc/mdoc_markdown.c
1179
md_pre_In(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1181
if (n->flags & NODE_SYNPRETTY) {
usr.bin/mandoc/mdoc_markdown.c
1182
md_pre_syn(n);
usr.bin/mandoc/mdoc_markdown.c
1196
md_post_In(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1198
if (n->flags & NODE_SYNPRETTY) {
usr.bin/mandoc/mdoc_markdown.c
1209
md_pre_It(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1213
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1218
bln = n->parent->parent;
usr.bin/mandoc/mdoc_markdown.c
1266
bln = n->parent->parent;
usr.bin/mandoc/mdoc_markdown.c
1273
md_pre_D1(n);
usr.bin/mandoc/mdoc_markdown.c
1286
md_post_It(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1291
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_markdown.c
1294
bln = n->parent->parent;
usr.bin/mandoc/mdoc_markdown.c
1306
md_post_D1(n);
usr.bin/mandoc/mdoc_markdown.c
1310
if (n->next == NULL)
usr.bin/mandoc/mdoc_markdown.c
1316
while ((n = n->prev) != NULL && n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_markdown.c
1344
md_post_Lb(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1346
if (n->sec == SEC_LIBRARY)
usr.bin/mandoc/mdoc_markdown.c
1366
md_pre_Lk(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1370
if ((link = n->child) == NULL)
usr.bin/mandoc/mdoc_markdown.c
1374
punct = n->last;
usr.bin/mandoc/mdoc_markdown.c
1406
md_pre_Mt(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1412
for (nch = n->child; nch != NULL; nch = nch->next)
usr.bin/mandoc/mdoc_markdown.c
1416
for (nch = n->child; nch != NULL; nch = nch->next) {
usr.bin/mandoc/mdoc_markdown.c
1429
md_pre_Nd(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1438
md_pre_Nm(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1440
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1443
md_pre_syn(n);
usr.bin/mandoc/mdoc_markdown.c
1447
md_pre_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1456
md_post_Nm(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1458
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1464
md_post_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1472
md_pre_No(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1479
md_pre_Ns(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1486
md_post_Pf(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1488
if (n->next != NULL && (n->next->flags & NODE_LINE) == 0)
usr.bin/mandoc/mdoc_markdown.c
1493
md_pre_Pp(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1500
md_pre_Rs(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1502
if (n->sec == SEC_SEE_ALSO)
usr.bin/mandoc/mdoc_markdown.c
1508
md_pre_Sh(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1510
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1512
if (n->sec == SEC_AUTHORS)
usr.bin/mandoc/mdoc_markdown.c
1517
md_rawword(n->tok == MDOC_Sh ? "#" : "##");
usr.bin/mandoc/mdoc_markdown.c
1529
md_pre_Sm(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1531
if (n->child == NULL)
usr.bin/mandoc/mdoc_markdown.c
1533
else if (strcmp("on", n->child->string) == 0)
usr.bin/mandoc/mdoc_markdown.c
1545
md_pre_Vt(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1547
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1549
md_pre_syn(n);
usr.bin/mandoc/mdoc_markdown.c
1553
md_pre_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1561
md_post_Vt(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1563
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
1566
md_post_raw(n);
usr.bin/mandoc/mdoc_markdown.c
1574
md_pre_Xr(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1576
n = n->child;
usr.bin/mandoc/mdoc_markdown.c
1577
if (n == NULL)
usr.bin/mandoc/mdoc_markdown.c
1579
md_node(n);
usr.bin/mandoc/mdoc_markdown.c
1580
n = n->next;
usr.bin/mandoc/mdoc_markdown.c
1581
if (n == NULL)
usr.bin/mandoc/mdoc_markdown.c
1585
md_node(n);
usr.bin/mandoc/mdoc_markdown.c
1591
md_pre__R(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1596
arg = n->child->string;
usr.bin/mandoc/mdoc_markdown.c
1619
md_pre__T(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1621
if (n->parent->tok == MDOC_Rs && n->parent->norm->Rs.quote_T)
usr.bin/mandoc/mdoc_markdown.c
1630
md_post__T(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
1633
if (n->parent->tok == MDOC_Rs && n->parent->norm->Rs.quote_T)
usr.bin/mandoc/mdoc_markdown.c
1637
md_post_pc(n);
usr.bin/mandoc/mdoc_markdown.c
1641
md_pre_br(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
305
md_nodelist(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
307
while (n != NULL) {
usr.bin/mandoc/mdoc_markdown.c
308
md_node(n);
usr.bin/mandoc/mdoc_markdown.c
309
n = n->next;
usr.bin/mandoc/mdoc_markdown.c
314
md_node(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
319
if (n->type == ROFFT_COMMENT || n->flags & NODE_NOPRT)
usr.bin/mandoc/mdoc_markdown.c
325
n->flags & NODE_LINE &&
usr.bin/mandoc/mdoc_markdown.c
326
!roff_node_transparent(n))
usr.bin/mandoc/mdoc_markdown.c
332
n->flags &= ~NODE_ENDED;
usr.bin/mandoc/mdoc_markdown.c
334
if (n->type == ROFFT_TEXT) {
usr.bin/mandoc/mdoc_markdown.c
335
if (n->flags & NODE_DELIMC)
usr.bin/mandoc/mdoc_markdown.c
339
md_word(n->string);
usr.bin/mandoc/mdoc_markdown.c
340
if (n->flags & NODE_DELIMO)
usr.bin/mandoc/mdoc_markdown.c
344
} else if (n->tok < ROFF_MAX) {
usr.bin/mandoc/mdoc_markdown.c
345
switch (n->tok) {
usr.bin/mandoc/mdoc_markdown.c
347
process_children = md_pre_br(n);
usr.bin/mandoc/mdoc_markdown.c
350
process_children = md_pre_Pp(n);
usr.bin/mandoc/mdoc_markdown.c
357
act = md_act(n->tok);
usr.bin/mandoc/mdoc_markdown.c
358
cond = act->cond == NULL || (*act->cond)(n);
usr.bin/mandoc/mdoc_markdown.c
360
(n->end == ENDBODY_NOT || n->child != NULL))
usr.bin/mandoc/mdoc_markdown.c
361
process_children = (*act->pre)(n);
usr.bin/mandoc/mdoc_markdown.c
364
if (process_children && n->child != NULL)
usr.bin/mandoc/mdoc_markdown.c
365
md_nodelist(n->child);
usr.bin/mandoc/mdoc_markdown.c
367
if (n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_markdown.c
371
(*act->post)(n);
usr.bin/mandoc/mdoc_markdown.c
373
if (n->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_markdown.c
374
n->body->flags |= NODE_ENDED;
usr.bin/mandoc/mdoc_markdown.c
735
md_cond_head(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
737
return n->type == ROFFT_HEAD;
usr.bin/mandoc/mdoc_markdown.c
741
md_cond_body(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
743
return n->type == ROFFT_BODY;
usr.bin/mandoc/mdoc_markdown.c
747
md_pre_abort(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
753
md_pre_raw(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
757
if ((prefix = md_act(n->tok)->prefix) != NULL) {
usr.bin/mandoc/mdoc_markdown.c
767
md_post_raw(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
771
if ((suffix = md_act(n->tok)->suffix) != NULL) {
usr.bin/mandoc/mdoc_markdown.c
780
md_pre_word(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
784
if ((prefix = md_act(n->tok)->prefix) != NULL) {
usr.bin/mandoc/mdoc_markdown.c
792
md_post_word(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
796
if ((suffix = md_act(n->tok)->suffix) != NULL) {
usr.bin/mandoc/mdoc_markdown.c
803
md_post_pc(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
807
md_post_raw(n);
usr.bin/mandoc/mdoc_markdown.c
808
if (n->parent->tok != MDOC_Rs)
usr.bin/mandoc/mdoc_markdown.c
811
if ((nn = roff_node_next(n)) != NULL) {
usr.bin/mandoc/mdoc_markdown.c
813
if (nn->tok == n->tok &&
usr.bin/mandoc/mdoc_markdown.c
814
(nn = roff_node_prev(n)) != NULL &&
usr.bin/mandoc/mdoc_markdown.c
815
nn->tok == n->tok)
usr.bin/mandoc/mdoc_markdown.c
824
md_pre_skip(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
830
md_pre_syn(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
834
if ((n->flags & NODE_SYNPRETTY) == 0 ||
usr.bin/mandoc/mdoc_markdown.c
835
(np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/mdoc_markdown.c
838
if (np->tok == n->tok &&
usr.bin/mandoc/mdoc_markdown.c
839
n->tok != MDOC_Ft &&
usr.bin/mandoc/mdoc_markdown.c
840
n->tok != MDOC_Fo &&
usr.bin/mandoc/mdoc_markdown.c
841
n->tok != MDOC_Fn) {
usr.bin/mandoc/mdoc_markdown.c
855
if (n->tok != MDOC_Fn && n->tok != MDOC_Fo) {
usr.bin/mandoc/mdoc_markdown.c
867
md_pre_An(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
869
switch (n->norm->An.auth) {
usr.bin/mandoc/mdoc_markdown.c
881
else if (n->sec == SEC_AUTHORS &&
usr.bin/mandoc/mdoc_markdown.c
889
md_pre_Ap(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
898
md_pre_Bd(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
900
switch (n->norm->Bd.type) {
usr.bin/mandoc/mdoc_markdown.c
903
return md_pre_Dl(n);
usr.bin/mandoc/mdoc_markdown.c
905
return md_pre_D1(n);
usr.bin/mandoc/mdoc_markdown.c
910
md_pre_Bk(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
912
switch (n->type) {
usr.bin/mandoc/mdoc_markdown.c
924
md_post_Bk(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
926
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_markdown.c
931
md_pre_Bl(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
933
n->norm->Bl.count = 0;
usr.bin/mandoc/mdoc_markdown.c
934
if (n->norm->Bl.type == LIST_column)
usr.bin/mandoc/mdoc_markdown.c
935
md_pre_Dl(n);
usr.bin/mandoc/mdoc_markdown.c
941
md_post_Bl(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
943
n->norm->Bl.count = 0;
usr.bin/mandoc/mdoc_markdown.c
944
if (n->norm->Bl.type == LIST_column)
usr.bin/mandoc/mdoc_markdown.c
945
md_post_D1(n);
usr.bin/mandoc/mdoc_markdown.c
950
md_pre_D1(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
968
md_post_D1(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
979
md_pre_Dl(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
997
md_pre_En(struct roff_node *n)
usr.bin/mandoc/mdoc_markdown.c
999
if (n->norm->Es == NULL ||
usr.bin/mandoc/mdoc_state.c
166
mdoc_state(struct roff_man *mdoc, struct roff_node *n)
usr.bin/mandoc/mdoc_state.c
170
if (n->tok == TOKEN_NONE || n->tok < ROFF_MAX)
usr.bin/mandoc/mdoc_state.c
173
assert(n->tok >= MDOC_Dd && n->tok < MDOC_MAX);
usr.bin/mandoc/mdoc_state.c
174
if ((mdoc_macro(n->tok)->flags & MDOC_PROLOGUE) == 0)
usr.bin/mandoc/mdoc_state.c
177
handler = state_handlers[n->tok - MDOC_Dd];
usr.bin/mandoc/mdoc_state.c
179
(*handler)(mdoc, n);
usr.bin/mandoc/mdoc_state.c
188
if (n->type != ROFFT_HEAD || n->parent->args == NULL)
usr.bin/mandoc/mdoc_state.c
191
args = n->parent->args;
usr.bin/mandoc/mdoc_state.c
195
n->norm->Bl.type = LIST_diag;
usr.bin/mandoc/mdoc_state.c
198
n->norm->Bl.type = LIST_column;
usr.bin/mandoc/mdoc_state.c
207
setsec(struct roff_node *n, enum roff_sec sec)
usr.bin/mandoc/mdoc_state.c
211
n->sec = sec;
usr.bin/mandoc/mdoc_state.c
212
for (nch = n->child; nch != NULL; nch = nch->next)
usr.bin/mandoc/mdoc_state.c
227
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_state.c
230
if ((n->flags & NODE_VALID) == 0) {
usr.bin/mandoc/mdoc_state.c
231
sec = n->child != NULL && n->child->type == ROFFT_TEXT &&
usr.bin/mandoc/mdoc_state.c
232
n->child->next == NULL ? mdoc_a2sec(n->child->string) :
usr.bin/mandoc/mdoc_state.c
234
n->parent->sec = sec;
usr.bin/mandoc/mdoc_state.c
235
setsec(n, sec);
usr.bin/mandoc/mdoc_state.c
237
if ((mdoc->lastsec = n->sec) == SEC_SYNOPSIS) {
usr.bin/mandoc/mdoc_state.c
250
if (n->child == NULL)
usr.bin/mandoc/mdoc_state.c
252
else if ( ! strcmp(n->child->string, "on"))
usr.bin/mandoc/mdoc_state.c
254
else if ( ! strcmp(n->child->string, "off"))
usr.bin/mandoc/mdoc_state.c
31
#define STATE_ARGS struct roff_man *mdoc, struct roff_node *n
usr.bin/mandoc/mdoc_term.c
1001
if (n->child == NULL)
usr.bin/mandoc/mdoc_term.c
1003
else if (n->child->type == ROFFT_TEXT) {
usr.bin/mandoc/mdoc_term.c
1004
p->tcol->rmargin += term_strlen(p, n->child->string);
usr.bin/mandoc/mdoc_term.c
1005
if (n->child->next != NULL)
usr.bin/mandoc/mdoc_term.c
1012
return termp_bold_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1018
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1023
if (n->next == NULL || n->next->child == NULL)
usr.bin/mandoc/mdoc_term.c
1030
if (n->child != NULL)
usr.bin/mandoc/mdoc_term.c
1046
if (n->child != NULL ||
usr.bin/mandoc/mdoc_term.c
1047
((nn = roff_node_next(n)) != NULL &&
usr.bin/mandoc/mdoc_term.c
1060
if ((nn = roff_node_prev(n)) != NULL && nn->tok == MDOC__A &&
usr.bin/mandoc/mdoc_term.c
1061
((nn = roff_node_next(n)) == NULL || nn->tok != MDOC__A))
usr.bin/mandoc/mdoc_term.c
1071
if (n->norm->An.auth == AUTH_split) {
usr.bin/mandoc/mdoc_term.c
1076
if (n->norm->An.auth == AUTH_nosplit) {
usr.bin/mandoc/mdoc_term.c
1085
if (n->sec == SEC_AUTHORS && ! (p->flags & TERMP_NOSPLIT))
usr.bin/mandoc/mdoc_term.c
1095
if ( ! (NODE_LINE & n->flags))
usr.bin/mandoc/mdoc_term.c
1103
if (SEC_SEE_ALSO != n->sec)
usr.bin/mandoc/mdoc_term.c
1105
if (n->type == ROFFT_BLOCK && roff_node_prev(n) != NULL)
usr.bin/mandoc/mdoc_term.c
1120
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
1128
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1142
if (n->type != ROFFT_BLOCK)
usr.bin/mandoc/mdoc_term.c
1145
if (n->tok != MDOC_Bl || n->norm->Bl.type != LIST_column)
usr.bin/mandoc/mdoc_term.c
1155
if (NULL == (n = n->child))
usr.bin/mandoc/mdoc_term.c
1158
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_term.c
1159
term_word(p, n->string);
usr.bin/mandoc/mdoc_term.c
1161
if (NULL == (n = n->next))
usr.bin/mandoc/mdoc_term.c
1168
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_term.c
1169
term_word(p, n->string);
usr.bin/mandoc/mdoc_term.c
1183
synopsis_pre(struct termp *p, struct roff_node *n)
usr.bin/mandoc/mdoc_term.c
1187
if ((n->flags & NODE_SYNPRETTY) == 0 ||
usr.bin/mandoc/mdoc_term.c
1188
(np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/mdoc_term.c
1196
if (np->tok == n->tok &&
usr.bin/mandoc/mdoc_term.c
1197
MDOC_Ft != n->tok &&
usr.bin/mandoc/mdoc_term.c
1198
MDOC_Fo != n->tok &&
usr.bin/mandoc/mdoc_term.c
1199
MDOC_Fn != n->tok) {
usr.bin/mandoc/mdoc_term.c
1218
if (n->tok != MDOC_Fn && n->tok != MDOC_Fo) {
usr.bin/mandoc/mdoc_term.c
1232
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1234
return termp_ft_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1236
synopsis_pre(p, n);
usr.bin/mandoc/mdoc_term.c
1241
return termp_under_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1255
synopsis_pre(p, n);
usr.bin/mandoc/mdoc_term.c
1256
return termp_bold_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1270
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1276
if ((np = roff_node_prev(n)) == NULL ||
usr.bin/mandoc/mdoc_term.c
1283
return termp_bold_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1289
if (n->sec == SEC_AUTHORS)
usr.bin/mandoc/mdoc_term.c
1301
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1318
if (n->sec == SEC_LIBRARY && n->flags & NODE_LINE)
usr.bin/mandoc/mdoc_term.c
1325
if (n->type != ROFFT_BLOCK)
usr.bin/mandoc/mdoc_term.c
1338
synopsis_pre(p, n);
usr.bin/mandoc/mdoc_term.c
1339
return termp_under_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1348
synopsis_pre(p, n);
usr.bin/mandoc/mdoc_term.c
1349
pretty = n->flags & NODE_SYNPRETTY;
usr.bin/mandoc/mdoc_term.c
1350
if ((n = n->child) == NULL)
usr.bin/mandoc/mdoc_term.c
1359
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_term.c
1361
term_word(p, n->string);
usr.bin/mandoc/mdoc_term.c
1376
for (n = n->next; n; n = n->next) {
usr.bin/mandoc/mdoc_term.c
1377
assert(n->type == ROFFT_TEXT);
usr.bin/mandoc/mdoc_term.c
1381
term_word(p, n->string);
usr.bin/mandoc/mdoc_term.c
1384
if (n->next) {
usr.bin/mandoc/mdoc_term.c
1406
if (n->parent->tok != MDOC_Fo)
usr.bin/mandoc/mdoc_term.c
1407
return termp_under_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1409
for (nn = n->child; nn != NULL; nn = nn->next) {
usr.bin/mandoc/mdoc_term.c
1419
if (n->child != NULL &&
usr.bin/mandoc/mdoc_term.c
1420
(nn = roff_node_next(n)) != NULL &&
usr.bin/mandoc/mdoc_term.c
1433
if (n->type == ROFFT_BLOCK) {
usr.bin/mandoc/mdoc_term.c
1434
print_bvspace(p, n, n);
usr.bin/mandoc/mdoc_term.c
1436
} else if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
1441
if (n->norm->Bd.offs == NULL ||
usr.bin/mandoc/mdoc_term.c
1442
! strcmp(n->norm->Bd.offs, "left"))
usr.bin/mandoc/mdoc_term.c
1444
else if ( ! strcmp(n->norm->Bd.offs, "indent"))
usr.bin/mandoc/mdoc_term.c
1446
else if ( ! strcmp(n->norm->Bd.offs, "indent-two"))
usr.bin/mandoc/mdoc_term.c
1449
offset = a2width(p, n->norm->Bd.offs);
usr.bin/mandoc/mdoc_term.c
1456
switch (n->norm->Bd.type) {
usr.bin/mandoc/mdoc_term.c
1474
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
1476
if (n->norm->Bd.type == DISP_unfilled ||
usr.bin/mandoc/mdoc_term.c
1477
n->norm->Bd.type == DISP_literal)
usr.bin/mandoc/mdoc_term.c
1482
if (n->norm->Bd.type == DISP_centered)
usr.bin/mandoc/mdoc_term.c
1489
if ((n->aux = p->flags & TERMP_PREKEEP) == 0)
usr.bin/mandoc/mdoc_term.c
1497
if (n->aux == 0)
usr.bin/mandoc/mdoc_term.c
1504
if (n->next != NULL && (n->next->flags & NODE_LINE) == 0)
usr.bin/mandoc/mdoc_term.c
1511
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1513
if (roff_node_prev(n) == NULL)
usr.bin/mandoc/mdoc_term.c
1521
return termp_bold_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1537
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1552
synopsis_pre(p, n);
usr.bin/mandoc/mdoc_term.c
1553
if (n->flags & NODE_SYNPRETTY && n->flags & NODE_LINE) {
usr.bin/mandoc/mdoc_term.c
1568
if (n->flags & NODE_SYNPRETTY)
usr.bin/mandoc/mdoc_term.c
1572
if (n->flags & NODE_SYNPRETTY)
usr.bin/mandoc/mdoc_term.c
1580
if (n->flags & NODE_ID)
usr.bin/mandoc/mdoc_term.c
1581
term_tag_write(n, p->line);
usr.bin/mandoc/mdoc_term.c
1594
if (n->type != ROFFT_BODY && n->type != ROFFT_ELEM)
usr.bin/mandoc/mdoc_term.c
1597
switch (n->tok) {
usr.bin/mandoc/mdoc_term.c
1600
term_word(p, n->child != NULL && n->child->next == NULL &&
usr.bin/mandoc/mdoc_term.c
1601
n->child->tok == MDOC_Mt ? "<" : "\\(la");
usr.bin/mandoc/mdoc_term.c
1620
if (NULL == n->norm->Es ||
usr.bin/mandoc/mdoc_term.c
1621
NULL == n->norm->Es->child)
usr.bin/mandoc/mdoc_term.c
1623
term_word(p, n->norm->Es->child->string);
usr.bin/mandoc/mdoc_term.c
1650
if (n->type != ROFFT_BODY && n->type != ROFFT_ELEM)
usr.bin/mandoc/mdoc_term.c
1655
switch (n->tok) {
usr.bin/mandoc/mdoc_term.c
1658
term_word(p, n->child != NULL && n->child->next == NULL &&
usr.bin/mandoc/mdoc_term.c
1659
n->child->tok == MDOC_Mt ? ">" : "\\(ra");
usr.bin/mandoc/mdoc_term.c
1678
if (n->norm->Es == NULL ||
usr.bin/mandoc/mdoc_term.c
1679
n->norm->Es->child == NULL ||
usr.bin/mandoc/mdoc_term.c
1680
n->norm->Es->child->next == NULL)
usr.bin/mandoc/mdoc_term.c
1683
term_word(p, n->norm->Es->child->next->string);
usr.bin/mandoc/mdoc_term.c
1707
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
1710
if (n->end == ENDBODY_NOT &&
usr.bin/mandoc/mdoc_term.c
1711
n->parent->head->child == NULL &&
usr.bin/mandoc/mdoc_term.c
1712
n->child != NULL &&
usr.bin/mandoc/mdoc_term.c
1713
n->child->end != ENDBODY_NOT)
usr.bin/mandoc/mdoc_term.c
1715
else if (n->end != ENDBODY_NOT ? n->child != NULL :
usr.bin/mandoc/mdoc_term.c
1716
n->parent->head->child != NULL && (n->child != NULL ||
usr.bin/mandoc/mdoc_term.c
1717
(n->parent->tail != NULL && n->parent->tail->child != NULL)))
usr.bin/mandoc/mdoc_term.c
1728
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
1731
if (n->end != ENDBODY_NOT) {
usr.bin/mandoc/mdoc_term.c
1736
body = n->child != NULL || n->parent->head->child != NULL;
usr.bin/mandoc/mdoc_term.c
1737
tail = n->parent->tail != NULL && n->parent->tail->child != NULL;
usr.bin/mandoc/mdoc_term.c
1752
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1754
synopsis_pre(p, n);
usr.bin/mandoc/mdoc_term.c
1758
if (n->flags & NODE_SYNPRETTY) {
usr.bin/mandoc/mdoc_term.c
1766
if (n->flags & NODE_SYNPRETTY) {
usr.bin/mandoc/mdoc_term.c
1776
return termp_bold_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1783
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
1789
if (n->flags & NODE_SYNPRETTY) {
usr.bin/mandoc/mdoc_term.c
1799
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1807
switch (n->norm->Bf.font) {
usr.bin/mandoc/mdoc_term.c
1809
return termp_under_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1811
return termp_bold_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1813
return termp_li_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1820
if (n->child == NULL)
usr.bin/mandoc/mdoc_term.c
1822
else if (strcmp(n->child->string, "on") == 0)
usr.bin/mandoc/mdoc_term.c
1852
if (n->tok == MDOC__A &&
usr.bin/mandoc/mdoc_term.c
1853
(nn = roff_node_next(n)) != NULL && nn->tok == MDOC__A &&
usr.bin/mandoc/mdoc_term.c
1855
((nn = roff_node_prev(n)) == NULL || nn->tok != MDOC__A))
usr.bin/mandoc/mdoc_term.c
1860
if (n->parent == NULL || n->parent->tok != MDOC_Rs)
usr.bin/mandoc/mdoc_term.c
1864
if (roff_node_next(n) == NULL) {
usr.bin/mandoc/mdoc_term.c
1883
if ((link = n->child) == NULL)
usr.bin/mandoc/mdoc_term.c
1887
punct = n->last;
usr.bin/mandoc/mdoc_term.c
1921
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
1927
if (n->parent->args != NULL || n->prev->child == NULL)
usr.bin/mandoc/mdoc_term.c
1939
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
1950
if (n->parent != NULL && n->parent->tok == MDOC_Rs &&
usr.bin/mandoc/mdoc_term.c
1951
n->parent->norm->Rs.quote_T)
usr.bin/mandoc/mdoc_term.c
1952
termp_quote_post(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1953
termp____post(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1959
if (n->parent != NULL && n->parent->tok == MDOC_Rs &&
usr.bin/mandoc/mdoc_term.c
1960
n->parent->norm->Rs.quote_T)
usr.bin/mandoc/mdoc_term.c
1961
return termp_quote_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
1963
return termp_under_pre(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
250
struct roff_node *n, *nn;
usr.bin/mandoc/mdoc_term.c
259
n = mdoc->first->child;
usr.bin/mandoc/mdoc_term.c
261
for (nn = NULL; n != NULL; n = n->next) {
usr.bin/mandoc/mdoc_term.c
262
if (n->tok != MDOC_Sh)
usr.bin/mandoc/mdoc_term.c
264
if (n->sec == SEC_SYNOPSIS)
usr.bin/mandoc/mdoc_term.c
266
if (nn == NULL && n->sec == SEC_NAME)
usr.bin/mandoc/mdoc_term.c
267
nn = n;
usr.bin/mandoc/mdoc_term.c
269
if (n == NULL)
usr.bin/mandoc/mdoc_term.c
270
n = nn;
usr.bin/mandoc/mdoc_term.c
272
if (n != NULL && (n = n->child->next->child) != NULL)
usr.bin/mandoc/mdoc_term.c
273
print_mdoc_nodelist(p, NULL, mdoc, n);
usr.bin/mandoc/mdoc_term.c
277
while (n != NULL &&
usr.bin/mandoc/mdoc_term.c
278
(n->type == ROFFT_COMMENT ||
usr.bin/mandoc/mdoc_term.c
279
n->flags & NODE_NOPRT))
usr.bin/mandoc/mdoc_term.c
280
n = n->next;
usr.bin/mandoc/mdoc_term.c
281
if (n != NULL) {
usr.bin/mandoc/mdoc_term.c
282
if (n->tok != MDOC_Sh)
usr.bin/mandoc/mdoc_term.c
284
print_mdoc_nodelist(p, NULL, mdoc, n);
usr.bin/mandoc/mdoc_term.c
293
while (n != NULL) {
usr.bin/mandoc/mdoc_term.c
294
print_mdoc_node(p, pair, meta, n);
usr.bin/mandoc/mdoc_term.c
295
n = n->next;
usr.bin/mandoc/mdoc_term.c
312
if (n->flags & NODE_NOFILL) {
usr.bin/mandoc/mdoc_term.c
313
if (n->flags & NODE_LINE &&
usr.bin/mandoc/mdoc_term.c
318
if (n->flags & NODE_LINE)
usr.bin/mandoc/mdoc_term.c
323
if (n->type == ROFFT_COMMENT || n->flags & NODE_NOPRT)
usr.bin/mandoc/mdoc_term.c
329
n->flags &= ~NODE_ENDED;
usr.bin/mandoc/mdoc_term.c
330
n->prev_font = p->fonti;
usr.bin/mandoc/mdoc_term.c
335
if (n->flags & NODE_ID && n->tok != MDOC_Pp &&
usr.bin/mandoc/mdoc_term.c
336
(n->tok != MDOC_It || n->type != ROFFT_BLOCK))
usr.bin/mandoc/mdoc_term.c
337
term_tag_write(n, p->line);
usr.bin/mandoc/mdoc_term.c
344
if (p->flags & TERMP_KEEP && n->flags & NODE_LINE) {
usr.bin/mandoc/mdoc_term.c
355
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
357
if (n->flags & NODE_LINE) {
usr.bin/mandoc/mdoc_term.c
358
switch (*n->string) {
usr.bin/mandoc/mdoc_term.c
373
if (NODE_DELIMC & n->flags)
usr.bin/mandoc/mdoc_term.c
375
term_word(p, n->string);
usr.bin/mandoc/mdoc_term.c
376
if (NODE_DELIMO & n->flags)
usr.bin/mandoc/mdoc_term.c
380
if ( ! (n->flags & NODE_LINE))
usr.bin/mandoc/mdoc_term.c
382
term_eqn(p, n->eqn);
usr.bin/mandoc/mdoc_term.c
383
if (n->next != NULL && ! (n->next->flags & NODE_LINE))
usr.bin/mandoc/mdoc_term.c
389
term_tbl(p, n->span);
usr.bin/mandoc/mdoc_term.c
392
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/mdoc_term.c
393
roff_term_pre(p, n);
usr.bin/mandoc/mdoc_term.c
396
assert(n->tok >= MDOC_Dd && n->tok < MDOC_MAX);
usr.bin/mandoc/mdoc_term.c
397
act = mdoc_term_acts + (n->tok - MDOC_Dd);
usr.bin/mandoc/mdoc_term.c
399
(n->end == ENDBODY_NOT || n->child != NULL))
usr.bin/mandoc/mdoc_term.c
400
chld = (*act->pre)(p, &npair, meta, n);
usr.bin/mandoc/mdoc_term.c
404
if (chld && n->child)
usr.bin/mandoc/mdoc_term.c
405
print_mdoc_nodelist(p, &npair, meta, n->child);
usr.bin/mandoc/mdoc_term.c
408
(ENDBODY_NOT == n->end ? n : n->body)->prev_font);
usr.bin/mandoc/mdoc_term.c
410
switch (n->type) {
usr.bin/mandoc/mdoc_term.c
418
if (act->post == NULL || n->flags & NODE_ENDED)
usr.bin/mandoc/mdoc_term.c
420
(void)(*act->post)(p, &npair, meta, n);
usr.bin/mandoc/mdoc_term.c
427
if (ENDBODY_NOT != n->end)
usr.bin/mandoc/mdoc_term.c
428
n->body->flags |= NODE_ENDED;
usr.bin/mandoc/mdoc_term.c
432
if (NODE_EOS & n->flags)
usr.bin/mandoc/mdoc_term.c
435
if (n->type != ROFFT_TEXT)
usr.bin/mandoc/mdoc_term.c
49
struct roff_node *n
usr.bin/mandoc/mdoc_term.c
583
print_bvspace(struct termp *p, struct roff_node *bl, struct roff_node *n)
usr.bin/mandoc/mdoc_term.c
595
nn = n;
usr.bin/mandoc/mdoc_term.c
616
n->prev == NULL || n->prev->tok != MDOC_It ||
usr.bin/mandoc/mdoc_term.c
619
n->prev->body->child != NULL)))
usr.bin/mandoc/mdoc_term.c
637
if (n->type == ROFFT_BLOCK) {
usr.bin/mandoc/mdoc_term.c
638
print_bvspace(p, n->parent->parent, n);
usr.bin/mandoc/mdoc_term.c
639
if (n->flags & NODE_ID)
usr.bin/mandoc/mdoc_term.c
640
term_tag_write(n, p->line);
usr.bin/mandoc/mdoc_term.c
644
bl = n->parent->parent->parent;
usr.bin/mandoc/mdoc_term.c
687
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
708
for (i = 0, nn = n->prev;
usr.bin/mandoc/mdoc_term.c
759
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
763
if (n->type == ROFFT_BODY && n->parent->head->child != NULL)
usr.bin/mandoc/mdoc_term.c
774
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
793
if (n->type == ROFFT_HEAD) {
usr.bin/mandoc/mdoc_term.c
800
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
806
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
812
if (NULL == n->next || NULL == n->next->child)
usr.bin/mandoc/mdoc_term.c
816
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
819
if (NULL == n->next) {
usr.bin/mandoc/mdoc_term.c
829
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
853
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
865
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
867
if (n->next == NULL && p->tcol->rmargin < p->maxrmargin)
usr.bin/mandoc/mdoc_term.c
879
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
912
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
916
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
932
if (n->type == ROFFT_BLOCK)
usr.bin/mandoc/mdoc_term.c
935
type = n->parent->parent->parent->norm->Bl.type;
usr.bin/mandoc/mdoc_term.c
941
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
945
if (n->type == ROFFT_BODY)
usr.bin/mandoc/mdoc_term.c
968
if (n->type == ROFFT_BLOCK) {
usr.bin/mandoc/mdoc_term.c
973
if (n->type == ROFFT_BODY) {
usr.bin/mandoc/mdoc_term.c
974
if (n->child == NULL)
usr.bin/mandoc/mdoc_term.c
978
if (n->prev->child != NULL)
usr.bin/mandoc/mdoc_term.c
979
cp = n->prev->child->string;
usr.bin/mandoc/mdoc_term.c
990
if (n->child == NULL)
usr.bin/mandoc/mdoc_term.c
993
if (n->type == ROFFT_HEAD)
usr.bin/mandoc/mdoc_term.c
994
synopsis_pre(p, n->parent);
usr.bin/mandoc/mdoc_term.c
996
if (n->type == ROFFT_HEAD &&
usr.bin/mandoc/mdoc_term.c
997
n->next != NULL && n->next->child != NULL) {
usr.bin/mandoc/mdoc_validate.c
1002
if (n->sec == SEC_SYNOPSIS) {
usr.bin/mandoc/mdoc_validate.c
1003
roff_word_alloc(mdoc, n->line, n->pos, "/*");
usr.bin/mandoc/mdoc_validate.c
1006
roff_word_alloc(mdoc, n->line, n->pos, "-l");
usr.bin/mandoc/mdoc_validate.c
1015
roff_word_alloc(mdoc, n->line, n->pos, "*/");
usr.bin/mandoc/mdoc_validate.c
1017
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1021
roff_word_alloc(mdoc, n->line, n->pos, "library");
usr.bin/mandoc/mdoc_validate.c
1023
roff_word_alloc(mdoc, n->line, n->pos, "\\(lq");
usr.bin/mandoc/mdoc_validate.c
1026
roff_word_alloc(mdoc, n->line, n->pos, "\\(rq");
usr.bin/mandoc/mdoc_validate.c
1028
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1034
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1039
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1041
if (n->child != NULL) {
usr.bin/mandoc/mdoc_validate.c
1042
roff_word_alloc(mdoc, n->line, n->pos, "The");
usr.bin/mandoc/mdoc_validate.c
1045
roff_word_alloc(mdoc, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1048
roff_word_alloc(mdoc, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1051
roff_word_alloc(mdoc, n->line, n->pos, "Upon successful "
usr.bin/mandoc/mdoc_validate.c
1055
roff_word_alloc(mdoc, n->line, n->pos, "otherwise "
usr.bin/mandoc/mdoc_validate.c
1058
roff_elem_alloc(mdoc, n->line, n->pos, MDOC_Va);
usr.bin/mandoc/mdoc_validate.c
1060
roff_word_alloc(mdoc, n->line, n->pos, "errno");
usr.bin/mandoc/mdoc_validate.c
1064
roff_word_alloc(mdoc, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1067
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1073
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1077
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1078
if (n->args && n->args->argc == 1)
usr.bin/mandoc/mdoc_validate.c
1079
if (n->args->argv[0].arg == MDOC_Std)
usr.bin/mandoc/mdoc_validate.c
1082
mandoc_msg(MANDOCERR_ARG_STD, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1083
"%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
1089
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
1092
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1093
nch = n->child;
usr.bin/mandoc/mdoc_validate.c
1099
roff_node_delete(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
1107
mdoc->last= n;
usr.bin/mandoc/mdoc_validate.c
1113
struct roff_node *n; /* The .Tg node. */
usr.bin/mandoc/mdoc_validate.c
1121
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1122
for (nn = n; nn != NULL; nn = nn->parent) {
usr.bin/mandoc/mdoc_validate.c
1131
nt = nch = n->child;
usr.bin/mandoc/mdoc_validate.c
1138
mandoc_msg(MANDOCERR_MACRO_EMPTY, n->line, n->pos, "Tg");
usr.bin/mandoc/mdoc_validate.c
1140
roff_node_delete(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
1158
roff_node_delete(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
1164
nn = n;
usr.bin/mandoc/mdoc_validate.c
1171
nn = nn->head->child == NULL ? n : nn->head;
usr.bin/mandoc/mdoc_validate.c
1192
nn = nn->body->child == NULL ? n : nn->body;
usr.bin/mandoc/mdoc_validate.c
1202
nn = nn->body->child == NULL ? n : nn->body;
usr.bin/mandoc/mdoc_validate.c
1219
nn = n;
usr.bin/mandoc/mdoc_validate.c
1222
nn = n;
usr.bin/mandoc/mdoc_validate.c
1226
if (nn != n)
usr.bin/mandoc/mdoc_validate.c
1227
n->flags |= NODE_NOPRT;
usr.bin/mandoc/mdoc_validate.c
1233
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1235
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1236
if (n->type == ROFFT_ELEM || n->type == ROFFT_BLOCK)
usr.bin/mandoc/mdoc_validate.c
1237
mandoc_msg(MANDOCERR_MACRO_OBS, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1238
"%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
1244
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1246
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1247
mandoc_msg(MANDOCERR_MACRO_USELESS, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1248
"%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
1322
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
1326
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1327
nch = n->child;
usr.bin/mandoc/mdoc_validate.c
1336
if (n->sec == SEC_DESCRIPTION ||
usr.bin/mandoc/mdoc_validate.c
1337
n->sec == SEC_CUSTOM)
usr.bin/mandoc/mdoc_validate.c
1338
tag_put(NULL, fn_prio++, n);
usr.bin/mandoc/mdoc_validate.c
1355
const struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1357
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1359
if (n->type != ROFFT_HEAD)
usr.bin/mandoc/mdoc_validate.c
1362
if (n->child == NULL) {
usr.bin/mandoc/mdoc_validate.c
1363
mandoc_msg(MANDOCERR_FO_NOHEAD, n->line, n->pos, "Fo");
usr.bin/mandoc/mdoc_validate.c
1366
if (n->child != n->last) {
usr.bin/mandoc/mdoc_validate.c
1368
n->child->next->line, n->child->next->pos,
usr.bin/mandoc/mdoc_validate.c
1369
"Fo ... %s", n->child->next->string);
usr.bin/mandoc/mdoc_validate.c
1370
while (n->child != n->last)
usr.bin/mandoc/mdoc_validate.c
1371
roff_node_delete(mdoc, n->last);
usr.bin/mandoc/mdoc_validate.c
1381
const struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1384
for (n = mdoc->last->child; n != NULL; n = n->next) {
usr.bin/mandoc/mdoc_validate.c
1385
for (cp = n->string; *cp != '\0'; cp++) {
usr.bin/mandoc/mdoc_validate.c
1391
mandoc_msg(MANDOCERR_FA_COMMA, n->line,
usr.bin/mandoc/mdoc_validate.c
1392
n->pos + (int)(cp - n->string), "%s", n->string);
usr.bin/mandoc/mdoc_validate.c
1402
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1404
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1406
if (n->sec == SEC_NAME && n->child != NULL &&
usr.bin/mandoc/mdoc_validate.c
1407
n->child->type == ROFFT_TEXT && mdoc->meta.msec != NULL)
usr.bin/mandoc/mdoc_validate.c
1408
mandoc_xr_add(mdoc->meta.msec, n->child->string, -1, -1);
usr.bin/mandoc/mdoc_validate.c
1410
if (n->last != NULL && n->last->tok == MDOC_Pp)
usr.bin/mandoc/mdoc_validate.c
1411
roff_node_relink(mdoc, n->last);
usr.bin/mandoc/mdoc_validate.c
1414
deroff(&mdoc->meta.name, n);
usr.bin/mandoc/mdoc_validate.c
1417
(mdoc->lastsec == SEC_NAME && n->child == NULL))
usr.bin/mandoc/mdoc_validate.c
1418
mandoc_msg(MANDOCERR_NM_NONAME, n->line, n->pos, "Nm");
usr.bin/mandoc/mdoc_validate.c
1420
switch (n->type) {
usr.bin/mandoc/mdoc_validate.c
1431
if ((n->child != NULL && n->child->type == ROFFT_TEXT) ||
usr.bin/mandoc/mdoc_validate.c
1436
roff_word_alloc(mdoc, n->line, n->pos, mdoc->meta.name);
usr.bin/mandoc/mdoc_validate.c
1438
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1444
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1446
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1448
if (n->type != ROFFT_BODY)
usr.bin/mandoc/mdoc_validate.c
1451
if (n->sec != SEC_NAME)
usr.bin/mandoc/mdoc_validate.c
1452
mandoc_msg(MANDOCERR_ND_LATE, n->line, n->pos, "Nd");
usr.bin/mandoc/mdoc_validate.c
1454
if (n->child == NULL)
usr.bin/mandoc/mdoc_validate.c
1455
mandoc_msg(MANDOCERR_ND_EMPTY, n->line, n->pos, "Nd");
usr.bin/mandoc/mdoc_validate.c
1465
struct roff_node *n, *np;
usr.bin/mandoc/mdoc_validate.c
1467
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1468
switch (n->type) {
usr.bin/mandoc/mdoc_validate.c
1470
if (n->end != ENDBODY_NOT) {
usr.bin/mandoc/mdoc_validate.c
1471
if (n->tok == MDOC_Bd &&
usr.bin/mandoc/mdoc_validate.c
1472
n->body->parent->args == NULL)
usr.bin/mandoc/mdoc_validate.c
1473
roff_node_delete(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
1474
} else if (n->child == NULL)
usr.bin/mandoc/mdoc_validate.c
1475
mandoc_msg(MANDOCERR_BLK_EMPTY, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
1476
"%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
1477
else if (n->tok == MDOC_D1)
usr.bin/mandoc/mdoc_validate.c
1481
if (n->tok == MDOC_Bd) {
usr.bin/mandoc/mdoc_validate.c
1482
if (n->args == NULL) {
usr.bin/mandoc/mdoc_validate.c
1484
n->line, n->pos, "Bd");
usr.bin/mandoc/mdoc_validate.c
1486
while (n->body->child != NULL)
usr.bin/mandoc/mdoc_validate.c
1488
n->body->child);
usr.bin/mandoc/mdoc_validate.c
1489
roff_node_delete(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
1495
for (np = n->parent; np != NULL; np = np->parent) {
usr.bin/mandoc/mdoc_validate.c
1497
mandoc_msg(MANDOCERR_BD_NEST, n->line,
usr.bin/mandoc/mdoc_validate.c
1498
n->pos, "%s in Bd", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
1511
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1513
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1514
if (n->child != NULL) {
usr.bin/mandoc/mdoc_validate.c
1519
switch (n->tok) {
usr.bin/mandoc/mdoc_validate.c
1521
roff_word_alloc(mdoc, n->line, n->pos, "file");
usr.bin/mandoc/mdoc_validate.c
1523
roff_word_alloc(mdoc, n->line, n->pos, "...");
usr.bin/mandoc/mdoc_validate.c
1527
roff_word_alloc(mdoc, n->line, n->pos, "~");
usr.bin/mandoc/mdoc_validate.c
1533
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1539
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
1542
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1543
nch = n->child;
usr.bin/mandoc/mdoc_validate.c
1561
roff_word_alloc(mdoc, n->line, n->pos, "AT&T UNIX");
usr.bin/mandoc/mdoc_validate.c
1563
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1604
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1606
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1607
if (n->sec == SEC_ERRORS &&
usr.bin/mandoc/mdoc_validate.c
1608
(n->parent->tok == MDOC_It ||
usr.bin/mandoc/mdoc_validate.c
1609
(n->parent->tok == MDOC_Bq &&
usr.bin/mandoc/mdoc_validate.c
1610
n->parent->parent->parent->tok == MDOC_It)))
usr.bin/mandoc/mdoc_validate.c
1611
tag_put(NULL, TAG_STRONG, n);
usr.bin/mandoc/mdoc_validate.c
1618
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1620
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1621
if ((n->prev == NULL ||
usr.bin/mandoc/mdoc_validate.c
1622
(n->prev->type == ROFFT_TEXT &&
usr.bin/mandoc/mdoc_validate.c
1623
strcmp(n->prev->string, "|") == 0)) &&
usr.bin/mandoc/mdoc_validate.c
1624
(n->parent->tok == MDOC_It ||
usr.bin/mandoc/mdoc_validate.c
1625
(n->parent->tok == MDOC_Xo &&
usr.bin/mandoc/mdoc_validate.c
1626
n->parent->parent->prev == NULL &&
usr.bin/mandoc/mdoc_validate.c
1627
n->parent->parent->parent->tok == MDOC_It)))
usr.bin/mandoc/mdoc_validate.c
1628
tag_put(NULL, TAG_STRONG, n);
usr.bin/mandoc/mdoc_validate.c
1642
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1650
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1651
if (n->prev != NULL && n->prev->tok == MDOC_Fl &&
usr.bin/mandoc/mdoc_validate.c
1652
n->prev->child == NULL && n->child != NULL &&
usr.bin/mandoc/mdoc_validate.c
1653
(n->flags & NODE_LINE) == 0) {
usr.bin/mandoc/mdoc_validate.c
1654
mandoc_asprintf(&cp, "\\-%s", n->child->string);
usr.bin/mandoc/mdoc_validate.c
1655
free(n->child->string);
usr.bin/mandoc/mdoc_validate.c
1656
n->child->string = cp;
usr.bin/mandoc/mdoc_validate.c
1657
roff_node_delete(mdoc, n->prev);
usr.bin/mandoc/mdoc_validate.c
1665
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
1671
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1672
switch (n->tok) {
usr.bin/mandoc/mdoc_validate.c
1684
if (n->child == NULL)
usr.bin/mandoc/mdoc_validate.c
1686
v = n->child->string;
usr.bin/mandoc/mdoc_validate.c
1691
n->child->flags |= NODE_NOPRT;
usr.bin/mandoc/mdoc_validate.c
1693
roff_word_alloc(mdoc, n->child->line, n->child->pos, v);
usr.bin/mandoc/mdoc_validate.c
1697
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1709
roff_word_alloc(mdoc, n->line, n->pos, os);
usr.bin/mandoc/mdoc_validate.c
1711
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
1794
struct roff_node *n, *ni, *nc;
usr.bin/mandoc/mdoc_validate.c
1798
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
1799
for (ni = n->body->child; ni != NULL; ni = ni->next) {
usr.bin/mandoc/mdoc_validate.c
1816
} else if (n->norm->Bl.comp == 0 &&
usr.bin/mandoc/mdoc_validate.c
1817
n->norm->Bl.type != LIST_column) {
usr.bin/mandoc/mdoc_validate.c
2041
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2043
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2045
if (n->type == ROFFT_BLOCK && n->body->child == NULL) {
usr.bin/mandoc/mdoc_validate.c
2046
mandoc_msg(MANDOCERR_BLK_EMPTY, n->line, n->pos, "Bk");
usr.bin/mandoc/mdoc_validate.c
2047
roff_node_delete(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
2083
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2109
n = mdoc->meta.first->child;
usr.bin/mandoc/mdoc_validate.c
2110
while (n->tok != MDOC_Dt ||
usr.bin/mandoc/mdoc_validate.c
2111
n->child == NULL ||
usr.bin/mandoc/mdoc_validate.c
2112
n->child->next == NULL ||
usr.bin/mandoc/mdoc_validate.c
2113
n->child->next->next == NULL)
usr.bin/mandoc/mdoc_validate.c
2114
n = n->next;
usr.bin/mandoc/mdoc_validate.c
2115
n = n->child->next->next;
usr.bin/mandoc/mdoc_validate.c
2116
mandoc_msg(MANDOCERR_ARCH_BAD, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
2124
n = mdoc->meta.first->child;
usr.bin/mandoc/mdoc_validate.c
2125
while (n != NULL &&
usr.bin/mandoc/mdoc_validate.c
2126
(n->type == ROFFT_COMMENT ||
usr.bin/mandoc/mdoc_validate.c
2127
(n->tok >= MDOC_Dd &&
usr.bin/mandoc/mdoc_validate.c
2128
mdoc_macro(n->tok)->flags & MDOC_PROLOGUE)))
usr.bin/mandoc/mdoc_validate.c
2129
n = n->next;
usr.bin/mandoc/mdoc_validate.c
2131
if (n == NULL)
usr.bin/mandoc/mdoc_validate.c
2133
else if (n->tok != MDOC_Sh)
usr.bin/mandoc/mdoc_validate.c
2134
mandoc_msg(MANDOCERR_SEC_BEFORE, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
2135
"%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
2233
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
2236
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2237
for (nch = n->child; nch != NULL; nch = nch->next) {
usr.bin/mandoc/mdoc_validate.c
2247
if (n->tag == NULL && n->flags & NODE_ID)
usr.bin/mandoc/mdoc_validate.c
2248
n->tag = mandoc_strdup(nch->string);
usr.bin/mandoc/mdoc_validate.c
2257
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2259
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2260
if (n->flags & NODE_LINE ||
usr.bin/mandoc/mdoc_validate.c
2261
(n->next != NULL && n->next->flags & NODE_DELIMC))
usr.bin/mandoc/mdoc_validate.c
2262
mandoc_msg(MANDOCERR_NS_SKIP, n->line, n->pos, NULL);
usr.bin/mandoc/mdoc_validate.c
2304
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2309
for (n = mdoc->last->child; n != NULL; n = n->next) {
usr.bin/mandoc/mdoc_validate.c
2310
switch (n->tok) {
usr.bin/mandoc/mdoc_validate.c
2312
if (hasnm && n->child != NULL)
usr.bin/mandoc/mdoc_validate.c
2314
n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
2315
"Nm %s", n->child->string);
usr.bin/mandoc/mdoc_validate.c
2320
if (n->next != NULL)
usr.bin/mandoc/mdoc_validate.c
2322
n->line, n->pos, NULL);
usr.bin/mandoc/mdoc_validate.c
2325
if (n->type == ROFFT_TEXT &&
usr.bin/mandoc/mdoc_validate.c
2326
n->string[0] == ',' && n->string[1] == '\0' &&
usr.bin/mandoc/mdoc_validate.c
2327
n->next != NULL && n->next->tok == MDOC_Nm) {
usr.bin/mandoc/mdoc_validate.c
2328
n = n->next;
usr.bin/mandoc/mdoc_validate.c
2334
n->line, n->pos, "%s", roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
2351
const struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2356
n = mdoc->last->child;
usr.bin/mandoc/mdoc_validate.c
2358
while (n != NULL) {
usr.bin/mandoc/mdoc_validate.c
2359
if (n->tok != MDOC_Xr ||
usr.bin/mandoc/mdoc_validate.c
2360
n->child == NULL ||
usr.bin/mandoc/mdoc_validate.c
2361
n->child->next == NULL)
usr.bin/mandoc/mdoc_validate.c
2366
name = n->child->string;
usr.bin/mandoc/mdoc_validate.c
2367
sec = n->child->next->string;
usr.bin/mandoc/mdoc_validate.c
2370
mandoc_msg(MANDOCERR_XR_PUNCT, n->line,
usr.bin/mandoc/mdoc_validate.c
2371
n->pos, "%s before %s(%s)",
usr.bin/mandoc/mdoc_validate.c
2375
mandoc_msg(MANDOCERR_XR_ORDER, n->line,
usr.bin/mandoc/mdoc_validate.c
2376
n->pos, "%s(%s) after %s(%s)",
usr.bin/mandoc/mdoc_validate.c
2380
mandoc_msg(MANDOCERR_XR_ORDER, n->line,
usr.bin/mandoc/mdoc_validate.c
2381
n->pos, "%s after %s", name, lastname);
usr.bin/mandoc/mdoc_validate.c
2388
n = n->next;
usr.bin/mandoc/mdoc_validate.c
2389
if (n == NULL)
usr.bin/mandoc/mdoc_validate.c
2391
if (n->tok == MDOC_Xr) {
usr.bin/mandoc/mdoc_validate.c
2395
if (n->type != ROFFT_TEXT)
usr.bin/mandoc/mdoc_validate.c
2397
for (name = n->string; *name != '\0'; name++)
usr.bin/mandoc/mdoc_validate.c
2400
lastpunct = n->string;
usr.bin/mandoc/mdoc_validate.c
2401
if (n->next == NULL || n->next->tok == MDOC_Rs)
usr.bin/mandoc/mdoc_validate.c
2402
mandoc_msg(MANDOCERR_XR_PUNCT, n->line,
usr.bin/mandoc/mdoc_validate.c
2403
n->pos, "%s after %s(%s)",
usr.bin/mandoc/mdoc_validate.c
2405
n = n->next;
usr.bin/mandoc/mdoc_validate.c
2410
child_an(const struct roff_node *n)
usr.bin/mandoc/mdoc_validate.c
2413
for (n = n->child; n != NULL; n = n->next)
usr.bin/mandoc/mdoc_validate.c
2414
if ((n->tok == MDOC_An && n->child != NULL) || child_an(n))
usr.bin/mandoc/mdoc_validate.c
2589
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
2591
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2592
nch = n->child;
usr.bin/mandoc/mdoc_validate.c
2595
n->line, n->pos, "Xr %s", nch->string);
usr.bin/mandoc/mdoc_validate.c
2597
assert(nch->next == n->last);
usr.bin/mandoc/mdoc_validate.c
2610
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
2613
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2614
switch (n->type) {
usr.bin/mandoc/mdoc_validate.c
2620
deroff(&tag, n);
usr.bin/mandoc/mdoc_validate.c
2625
if ((nch = n->child) != NULL &&
usr.bin/mandoc/mdoc_validate.c
2628
tag_put(NULL, TAG_STRONG, n);
usr.bin/mandoc/mdoc_validate.c
2630
tag_put(tag, TAG_FALLBACK, n);
usr.bin/mandoc/mdoc_validate.c
2641
if ((nch = n->child) != NULL &&
usr.bin/mandoc/mdoc_validate.c
2646
roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
2649
if ((nch = n->last) != NULL &&
usr.bin/mandoc/mdoc_validate.c
2653
roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
2661
struct roff_node *n, *np;
usr.bin/mandoc/mdoc_validate.c
2663
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2664
if (n->type != ROFFT_ELEM && n->type != ROFFT_BLOCK)
usr.bin/mandoc/mdoc_validate.c
2666
if ((np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/mdoc_validate.c
2676
if (n->tok == MDOC_Bl && n->norm->Bl.comp)
usr.bin/mandoc/mdoc_validate.c
2678
if (n->tok == MDOC_Bd && n->norm->Bd.comp)
usr.bin/mandoc/mdoc_validate.c
2680
if (n->tok == MDOC_It && n->parent->norm->Bl.comp)
usr.bin/mandoc/mdoc_validate.c
2684
"%s before %s", roff_name[np->tok], roff_name[n->tok]);
usr.bin/mandoc/mdoc_validate.c
2705
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2707
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2708
n->flags |= NODE_NOPRT;
usr.bin/mandoc/mdoc_validate.c
2711
mandoc_msg(MANDOCERR_PROLOG_REP, n->line, n->pos, "Dd");
usr.bin/mandoc/mdoc_validate.c
2714
mandoc_msg(MANDOCERR_PROLOG_LATE, n->line, n->pos, "Dd");
usr.bin/mandoc/mdoc_validate.c
2717
n->line, n->pos, "Dd after Dt");
usr.bin/mandoc/mdoc_validate.c
2720
n->line, n->pos, "Dd after Os");
usr.bin/mandoc/mdoc_validate.c
2725
mdoc->meta.date = mandoc_normdate(n->child, n);
usr.bin/mandoc/mdoc_validate.c
2731
struct roff_node *nn, *n;
usr.bin/mandoc/mdoc_validate.c
2735
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2736
n->flags |= NODE_NOPRT;
usr.bin/mandoc/mdoc_validate.c
2739
mandoc_msg(MANDOCERR_DT_LATE, n->line, n->pos, "Dt");
usr.bin/mandoc/mdoc_validate.c
2744
mandoc_msg(MANDOCERR_PROLOG_REP, n->line, n->pos, "Dt");
usr.bin/mandoc/mdoc_validate.c
2747
n->line, n->pos, "Dt after Os");
usr.bin/mandoc/mdoc_validate.c
2761
nn = n->child;
usr.bin/mandoc/mdoc_validate.c
2763
mandoc_msg(MANDOCERR_DT_NOTITLE, n->line, n->pos, "Dt");
usr.bin/mandoc/mdoc_validate.c
2785
mandoc_msg(MANDOCERR_MSEC_MISSING, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
2826
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
2831
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2832
nch = n->child;
usr.bin/mandoc/mdoc_validate.c
2841
n->line, n->pos, "%s", macro);
usr.bin/mandoc/mdoc_validate.c
2845
roff_elem_alloc(mdoc, n->line, n->pos, MDOC_Ns);
usr.bin/mandoc/mdoc_validate.c
2850
roff_word_alloc(mdoc, n->line, n->pos, "BSD");
usr.bin/mandoc/mdoc_validate.c
2854
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
2858
roff_elem_alloc(mdoc, n->line, n->pos, MDOC_Ns);
usr.bin/mandoc/mdoc_validate.c
2861
roff_word_alloc(mdoc, n->line, n->pos, "-");
usr.bin/mandoc/mdoc_validate.c
2863
roff_elem_alloc(mdoc, n->line, n->pos, MDOC_Ns);
usr.bin/mandoc/mdoc_validate.c
2865
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
2882
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
2884
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
2885
n->flags |= NODE_NOPRT;
usr.bin/mandoc/mdoc_validate.c
2888
mandoc_msg(MANDOCERR_PROLOG_REP, n->line, n->pos, "Os");
usr.bin/mandoc/mdoc_validate.c
2890
mandoc_msg(MANDOCERR_PROLOG_LATE, n->line, n->pos, "Os");
usr.bin/mandoc/mdoc_validate.c
2905
deroff(&mdoc->meta.os, n);
usr.bin/mandoc/mdoc_validate.c
2919
mandoc_msg(MANDOCERR_OS_UNAME, n->line, n->pos, "Os");
usr.bin/mandoc/mdoc_validate.c
2942
if (n->child != NULL)
usr.bin/mandoc/mdoc_validate.c
2943
mandoc_msg(MANDOCERR_OS_ARG, n->child->line, n->child->pos,
usr.bin/mandoc/mdoc_validate.c
2944
"Os %s (%s)", n->child->string,
usr.bin/mandoc/mdoc_validate.c
2948
while (n->tok != MDOC_Dd)
usr.bin/mandoc/mdoc_validate.c
2949
if ((n = n->prev) == NULL)
usr.bin/mandoc/mdoc_validate.c
2951
if ((n = n->child) == NULL)
usr.bin/mandoc/mdoc_validate.c
2953
if (strncmp(n->string, "$" "Mdocdate", 9)) {
usr.bin/mandoc/mdoc_validate.c
2955
mandoc_msg(MANDOCERR_MDOCDATE_MISSING, n->line,
usr.bin/mandoc/mdoc_validate.c
2956
n->pos, "Dd %s (OpenBSD)", n->string);
usr.bin/mandoc/mdoc_validate.c
2959
mandoc_msg(MANDOCERR_MDOCDATE, n->line,
usr.bin/mandoc/mdoc_validate.c
2960
n->pos, "Dd %s (NetBSD)", n->string);
usr.bin/mandoc/mdoc_validate.c
302
struct roff_node *n, *np;
usr.bin/mandoc/mdoc_validate.c
311
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
312
switch (n->tok) {
usr.bin/mandoc/mdoc_validate.c
314
n->tok = MDOC_Pp;
usr.bin/mandoc/mdoc_validate.c
318
n->tok = MDOC_Ft;
usr.bin/mandoc/mdoc_validate.c
332
if (mdoc->last == n)
usr.bin/mandoc/mdoc_validate.c
340
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
342
switch (n->type) {
usr.bin/mandoc/mdoc_validate.c
344
np = n->parent;
usr.bin/mandoc/mdoc_validate.c
345
if (n->sec != SEC_SYNOPSIS ||
usr.bin/mandoc/mdoc_validate.c
347
check_text(mdoc, n->line, n->pos, n->string);
usr.bin/mandoc/mdoc_validate.c
348
if ((n->flags & NODE_NOFILL) == 0 &&
usr.bin/mandoc/mdoc_validate.c
351
check_text_em(mdoc, n->line, n->pos, n->string);
usr.bin/mandoc/mdoc_validate.c
354
check_toptext(mdoc, n->line, n->pos, n->string);
usr.bin/mandoc/mdoc_validate.c
372
if (n->child != NULL)
usr.bin/mandoc/mdoc_validate.c
373
n->child->flags &= ~NODE_DELIMC;
usr.bin/mandoc/mdoc_validate.c
374
if (n->last != NULL)
usr.bin/mandoc/mdoc_validate.c
375
n->last->flags &= ~NODE_DELIMO;
usr.bin/mandoc/mdoc_validate.c
379
if (n->tok < ROFF_MAX) {
usr.bin/mandoc/mdoc_validate.c
384
assert(n->tok >= MDOC_Dd && n->tok < MDOC_MAX);
usr.bin/mandoc/mdoc_validate.c
385
p = mdoc_valids + (n->tok - MDOC_Dd);
usr.bin/mandoc/mdoc_validate.c
388
if (mdoc->last == n)
usr.bin/mandoc/mdoc_validate.c
389
mdoc_state(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
395
check_args(struct roff_man *mdoc, struct roff_node *n)
usr.bin/mandoc/mdoc_validate.c
399
if (NULL == n->args)
usr.bin/mandoc/mdoc_validate.c
402
assert(n->args->argc);
usr.bin/mandoc/mdoc_validate.c
403
for (i = 0; i < (int)n->args->argc; i++)
usr.bin/mandoc/mdoc_validate.c
404
check_argv(mdoc, n, &n->args->argv[i]);
usr.bin/mandoc/mdoc_validate.c
408
check_argv(struct roff_man *mdoc, struct roff_node *n, struct mdoc_argv *v)
usr.bin/mandoc/mdoc_validate.c
638
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
644
n = mdoc->last->parent;
usr.bin/mandoc/mdoc_validate.c
645
n->norm->Bl.type = LIST__NONE;
usr.bin/mandoc/mdoc_validate.c
653
wa = (n->args == NULL) ? NULL : n->args->argv;
usr.bin/mandoc/mdoc_validate.c
655
for (i = 0; n->args && i < (int)n->args->argc; i++) {
usr.bin/mandoc/mdoc_validate.c
656
argv = n->args->argv + i;
usr.bin/mandoc/mdoc_validate.c
695
if (n->norm->Bl.comp)
usr.bin/mandoc/mdoc_validate.c
698
n->norm->Bl.comp = 1;
usr.bin/mandoc/mdoc_validate.c
705
n->norm->Bl.width = "0n";
usr.bin/mandoc/mdoc_validate.c
708
if (NULL != n->norm->Bl.width)
usr.bin/mandoc/mdoc_validate.c
713
n->norm->Bl.width = argv->value[0];
usr.bin/mandoc/mdoc_validate.c
721
if (NULL != n->norm->Bl.offs)
usr.bin/mandoc/mdoc_validate.c
726
n->norm->Bl.offs = argv->value[0];
usr.bin/mandoc/mdoc_validate.c
737
if (LIST__NONE != n->norm->Bl.type) {
usr.bin/mandoc/mdoc_validate.c
738
mandoc_msg(MANDOCERR_BL_REP, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
745
if (n->norm->Bl.width ||
usr.bin/mandoc/mdoc_validate.c
746
n->norm->Bl.offs ||
usr.bin/mandoc/mdoc_validate.c
747
n->norm->Bl.comp)
usr.bin/mandoc/mdoc_validate.c
749
n->line, n->pos, "Bl -%s",
usr.bin/mandoc/mdoc_validate.c
750
mdoc_argnames[n->args->argv[0].arg]);
usr.bin/mandoc/mdoc_validate.c
752
n->norm->Bl.type = lt;
usr.bin/mandoc/mdoc_validate.c
754
n->norm->Bl.ncols = argv->sz;
usr.bin/mandoc/mdoc_validate.c
755
n->norm->Bl.cols = (void *)argv->value;
usr.bin/mandoc/mdoc_validate.c
761
if (LIST__NONE == n->norm->Bl.type) {
usr.bin/mandoc/mdoc_validate.c
762
mandoc_msg(MANDOCERR_BL_NOTYPE, n->line, n->pos, "Bl");
usr.bin/mandoc/mdoc_validate.c
763
n->norm->Bl.type = LIST_item;
usr.bin/mandoc/mdoc_validate.c
774
switch (n->norm->Bl.type) {
usr.bin/mandoc/mdoc_validate.c
776
if (n->norm->Bl.width == NULL)
usr.bin/mandoc/mdoc_validate.c
778
n->line, n->pos, "Bl -tag");
usr.bin/mandoc/mdoc_validate.c
785
if (n->norm->Bl.width != NULL)
usr.bin/mandoc/mdoc_validate.c
788
n->norm->Bl.width = NULL;
usr.bin/mandoc/mdoc_validate.c
793
if (n->norm->Bl.width == NULL)
usr.bin/mandoc/mdoc_validate.c
794
n->norm->Bl.width = "2n";
usr.bin/mandoc/mdoc_validate.c
797
if (n->norm->Bl.width == NULL)
usr.bin/mandoc/mdoc_validate.c
798
n->norm->Bl.width = "3n";
usr.bin/mandoc/mdoc_validate.c
808
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
813
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
814
for (i = 0; n->args && i < (int)n->args->argc; i++) {
usr.bin/mandoc/mdoc_validate.c
815
argv = n->args->argv + i;
usr.bin/mandoc/mdoc_validate.c
835
mandoc_msg(MANDOCERR_BD_FILE, n->line, n->pos, NULL);
usr.bin/mandoc/mdoc_validate.c
843
if (NULL != n->norm->Bd.offs)
usr.bin/mandoc/mdoc_validate.c
848
n->norm->Bd.offs = argv->value[0];
usr.bin/mandoc/mdoc_validate.c
851
if (n->norm->Bd.comp)
usr.bin/mandoc/mdoc_validate.c
854
n->norm->Bd.comp = 1;
usr.bin/mandoc/mdoc_validate.c
862
if (DISP__NONE == n->norm->Bd.type)
usr.bin/mandoc/mdoc_validate.c
863
n->norm->Bd.type = dt;
usr.bin/mandoc/mdoc_validate.c
865
mandoc_msg(MANDOCERR_BD_REP, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
869
if (DISP__NONE == n->norm->Bd.type) {
usr.bin/mandoc/mdoc_validate.c
870
mandoc_msg(MANDOCERR_BD_NOTYPE, n->line, n->pos, "Bd");
usr.bin/mandoc/mdoc_validate.c
871
n->norm->Bd.type = DISP_ragged;
usr.bin/mandoc/mdoc_validate.c
882
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
886
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
887
if (n->args == NULL)
usr.bin/mandoc/mdoc_validate.c
890
for (i = 1; i < n->args->argc; i++) {
usr.bin/mandoc/mdoc_validate.c
891
argv = n->args->argv + i;
usr.bin/mandoc/mdoc_validate.c
896
argv = n->args->argv;
usr.bin/mandoc/mdoc_validate.c
898
n->norm->An.auth = AUTH_split;
usr.bin/mandoc/mdoc_validate.c
900
n->norm->An.auth = AUTH_nosplit;
usr.bin/mandoc/mdoc_validate.c
908
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
911
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
912
if (n->child != NULL)
usr.bin/mandoc/mdoc_validate.c
913
mandoc_msg(MANDOCERR_ARG_SKIP, n->line,
usr.bin/mandoc/mdoc_validate.c
914
n->pos, "%s %s", roff_name[n->tok], n->child->string);
usr.bin/mandoc/mdoc_validate.c
916
while (n->child != NULL)
usr.bin/mandoc/mdoc_validate.c
917
roff_node_delete(mdoc, n->child);
usr.bin/mandoc/mdoc_validate.c
919
roff_word_alloc(mdoc, n->line, n->pos, n->tok == MDOC_Bt ?
usr.bin/mandoc/mdoc_validate.c
922
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
928
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
931
n = mdoc->last->next;
usr.bin/mandoc/mdoc_validate.c
933
roff_elem_alloc(mdoc, n->line, n->pos, tok);
usr.bin/mandoc/mdoc_validate.c
935
roff_node_relink(mdoc, n);
usr.bin/mandoc/mdoc_validate.c
936
n = mdoc->last = mdoc->last->parent;
usr.bin/mandoc/mdoc_validate.c
938
if (n->next == NULL)
usr.bin/mandoc/mdoc_validate.c
940
if (ic > 1 || n->next->next != NULL) {
usr.bin/mandoc/mdoc_validate.c
941
roff_word_alloc(mdoc, n->line, n->pos, ",");
usr.bin/mandoc/mdoc_validate.c
944
n = mdoc->last->next;
usr.bin/mandoc/mdoc_validate.c
945
if (n->next == NULL) {
usr.bin/mandoc/mdoc_validate.c
946
roff_word_alloc(mdoc, n->line, n->pos, "and");
usr.bin/mandoc/mdoc_validate.c
955
struct roff_node *n;
usr.bin/mandoc/mdoc_validate.c
960
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
962
roff_word_alloc(mdoc, n->line, n->pos, "The");
usr.bin/mandoc/mdoc_validate.c
968
roff_elem_alloc(mdoc, n->line, n->pos, MDOC_Nm);
usr.bin/mandoc/mdoc_validate.c
970
roff_word_alloc(mdoc, n->line, n->pos, mdoc->meta.name);
usr.bin/mandoc/mdoc_validate.c
976
mandoc_msg(MANDOCERR_EX_NONAME, n->line, n->pos, "Ex");
usr.bin/mandoc/mdoc_validate.c
980
roff_word_alloc(mdoc, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
983
roff_word_alloc(mdoc, n->line, n->pos,
usr.bin/mandoc/mdoc_validate.c
986
mdoc->last = n;
usr.bin/mandoc/mdoc_validate.c
992
struct roff_node *n, *nch;
usr.bin/mandoc/mdoc_validate.c
997
n = mdoc->last;
usr.bin/mandoc/mdoc_validate.c
998
nch = n->child;
usr.bin/mandoc/roff.c
1000
n = roff_node_alloc(man, line, pos, ROFFT_BLOCK, tok);
usr.bin/mandoc/roff.c
1001
roff_node_append(man, n);
usr.bin/mandoc/roff.c
1003
return n;
usr.bin/mandoc/roff.c
1009
struct roff_node *n;
usr.bin/mandoc/roff.c
1011
n = roff_node_alloc(man, line, pos, ROFFT_HEAD, tok);
usr.bin/mandoc/roff.c
1012
roff_node_append(man, n);
usr.bin/mandoc/roff.c
1014
return n;
usr.bin/mandoc/roff.c
1020
struct roff_node *n;
usr.bin/mandoc/roff.c
1022
n = roff_node_alloc(man, line, pos, ROFFT_BODY, tok);
usr.bin/mandoc/roff.c
1023
roff_node_append(man, n);
usr.bin/mandoc/roff.c
1025
return n;
usr.bin/mandoc/roff.c
1031
struct roff_node *n;
usr.bin/mandoc/roff.c
1037
n = roff_node_alloc(man, line, 0, ROFFT_TBL, TOKEN_NONE);
usr.bin/mandoc/roff.c
1038
n->span = span;
usr.bin/mandoc/roff.c
1039
roff_node_append(man, n);
usr.bin/mandoc/roff.c
1040
n->flags |= NODE_VALID | NODE_ENDED;
usr.bin/mandoc/roff.c
1046
roff_node_unlink(struct roff_man *man, struct roff_node *n)
usr.bin/mandoc/roff.c
1051
if (n->prev)
usr.bin/mandoc/roff.c
1052
n->prev->next = n->next;
usr.bin/mandoc/roff.c
1053
if (n->next)
usr.bin/mandoc/roff.c
1054
n->next->prev = n->prev;
usr.bin/mandoc/roff.c
1058
if (n->parent != NULL) {
usr.bin/mandoc/roff.c
1059
if (n->parent->child == n)
usr.bin/mandoc/roff.c
1060
n->parent->child = n->next;
usr.bin/mandoc/roff.c
1061
if (n->parent->last == n)
usr.bin/mandoc/roff.c
1062
n->parent->last = n->prev;
usr.bin/mandoc/roff.c
1069
if (man->last == n) {
usr.bin/mandoc/roff.c
1070
if (n->prev == NULL) {
usr.bin/mandoc/roff.c
1071
man->last = n->parent;
usr.bin/mandoc/roff.c
1074
man->last = n->prev;
usr.bin/mandoc/roff.c
1078
if (man->meta.first == n)
usr.bin/mandoc/roff.c
1083
roff_node_relink(struct roff_man *man, struct roff_node *n)
usr.bin/mandoc/roff.c
1085
roff_node_unlink(man, n);
usr.bin/mandoc/roff.c
1086
n->prev = n->next = NULL;
usr.bin/mandoc/roff.c
1087
roff_node_append(man, n);
usr.bin/mandoc/roff.c
1091
roff_node_free(struct roff_node *n)
usr.bin/mandoc/roff.c
1094
if (n->args != NULL)
usr.bin/mandoc/roff.c
1095
mdoc_argv_free(n->args);
usr.bin/mandoc/roff.c
1096
if (n->type == ROFFT_BLOCK || n->type == ROFFT_ELEM)
usr.bin/mandoc/roff.c
1097
free(n->norm);
usr.bin/mandoc/roff.c
1098
eqn_box_free(n->eqn);
usr.bin/mandoc/roff.c
1099
free(n->string);
usr.bin/mandoc/roff.c
1100
free(n->tag);
usr.bin/mandoc/roff.c
1101
free(n);
usr.bin/mandoc/roff.c
1105
roff_node_delete(struct roff_man *man, struct roff_node *n)
usr.bin/mandoc/roff.c
1108
while (n->child != NULL)
usr.bin/mandoc/roff.c
1109
roff_node_delete(man, n->child);
usr.bin/mandoc/roff.c
1110
roff_node_unlink(man, n);
usr.bin/mandoc/roff.c
1111
roff_node_free(n);
usr.bin/mandoc/roff.c
1115
roff_node_transparent(struct roff_node *n)
usr.bin/mandoc/roff.c
1117
if (n == NULL)
usr.bin/mandoc/roff.c
1119
if (n->type == ROFFT_COMMENT || n->flags & NODE_NOPRT)
usr.bin/mandoc/roff.c
1121
return roff_tok_transparent(n->tok);
usr.bin/mandoc/roff.c
1148
roff_node_child(struct roff_node *n)
usr.bin/mandoc/roff.c
1150
for (n = n->child; roff_node_transparent(n); n = n->next)
usr.bin/mandoc/roff.c
1152
return n;
usr.bin/mandoc/roff.c
1156
roff_node_prev(struct roff_node *n)
usr.bin/mandoc/roff.c
1159
n = n->prev;
usr.bin/mandoc/roff.c
1160
} while (roff_node_transparent(n));
usr.bin/mandoc/roff.c
1161
return n;
usr.bin/mandoc/roff.c
1165
roff_node_next(struct roff_node *n)
usr.bin/mandoc/roff.c
1168
n = n->next;
usr.bin/mandoc/roff.c
1169
} while (roff_node_transparent(n));
usr.bin/mandoc/roff.c
1170
return n;
usr.bin/mandoc/roff.c
1174
deroff(char **dest, const struct roff_node *n)
usr.bin/mandoc/roff.c
1179
if (n->string == NULL) {
usr.bin/mandoc/roff.c
1180
for (n = n->child; n != NULL; n = n->next)
usr.bin/mandoc/roff.c
1181
deroff(dest, n);
usr.bin/mandoc/roff.c
1187
for (cp = n->string; *cp != '\0'; cp++) {
usr.bin/mandoc/roff.c
1234
struct roff_node *n; /* used for header comments */
usr.bin/mandoc/roff.c
1322
n = roff_node_alloc(r->man, ln, stesc + 1 - buf->buf,
usr.bin/mandoc/roff.c
1324
n->string = mandoc_strdup(stesc + 2);
usr.bin/mandoc/roff.c
1325
roff_node_append(r->man, n);
usr.bin/mandoc/roff.c
1326
n->flags |= NODE_VALID | NODE_ENDED;
usr.bin/mandoc/roff.c
2432
int n, p;
usr.bin/mandoc/roff.c
2435
n = v[p] == '-';
usr.bin/mandoc/roff.c
2436
if (n || v[p] == '+')
usr.bin/mandoc/roff.c
2449
if (p == *pos + n)
usr.bin/mandoc/roff.c
2452
if (n)
usr.bin/mandoc/roff.c
3391
struct roff_node *n;
usr.bin/mandoc/roff.c
3395
n = roff_node_alloc(r->man, ln, ppos, ROFFT_EQN, TOKEN_NONE);
usr.bin/mandoc/roff.c
3397
n->flags |= NODE_LINE;
usr.bin/mandoc/roff.c
3398
n->eqn = eqn_box_new();
usr.bin/mandoc/roff.c
3399
roff_node_append(r->man, n);
usr.bin/mandoc/roff.c
3408
r->eqn->node = n;
usr.bin/mandoc/roff.c
3469
struct roff_node *n;
usr.bin/mandoc/roff.c
3484
n = r->man->last;
usr.bin/mandoc/roff.c
3518
n->flags |= NODE_VALID | NODE_ENDED;
usr.bin/mandoc/roff.c
3519
r->man->last = n;
usr.bin/mandoc/roff.c
3521
n->flags |= NODE_LINE;
usr.bin/mandoc/roff.c
3529
struct roff_node *n;
usr.bin/mandoc/roff.c
3533
n = r->man->last;
usr.bin/mandoc/roff.c
3543
n->flags |= NODE_LINE | NODE_VALID | NODE_ENDED;
usr.bin/mandoc/roff.c
3544
r->man->last = n;
usr.bin/mandoc/roff.c
3706
struct roff_node *n;
usr.bin/mandoc/roff.c
3742
n = r->man->last;
usr.bin/mandoc/roff.c
3745
n->flags |= NODE_LINE | NODE_VALID | NODE_ENDED;
usr.bin/mandoc/roff.c
3746
r->man->last = n;
usr.bin/mandoc/roff.c
4116
struct roffkv *n;
usr.bin/mandoc/roff.c
4122
n = *r;
usr.bin/mandoc/roff.c
4124
while (n && (namesz != n->key.sz ||
usr.bin/mandoc/roff.c
4125
strncmp(n->key.p, name, namesz)))
usr.bin/mandoc/roff.c
4126
n = n->next;
usr.bin/mandoc/roff.c
4128
if (NULL == n) {
usr.bin/mandoc/roff.c
4130
n = mandoc_malloc(sizeof(struct roffkv));
usr.bin/mandoc/roff.c
4131
n->key.p = mandoc_strndup(name, namesz);
usr.bin/mandoc/roff.c
4132
n->key.sz = namesz;
usr.bin/mandoc/roff.c
4133
n->val.p = NULL;
usr.bin/mandoc/roff.c
4134
n->val.sz = 0;
usr.bin/mandoc/roff.c
4135
n->next = *r;
usr.bin/mandoc/roff.c
4136
*r = n;
usr.bin/mandoc/roff.c
4138
free(n->val.p);
usr.bin/mandoc/roff.c
4139
n->val.p = NULL;
usr.bin/mandoc/roff.c
4140
n->val.sz = 0;
usr.bin/mandoc/roff.c
4152
if (NULL == n->val.p) {
usr.bin/mandoc/roff.c
4153
n->val.p = mandoc_malloc(newch);
usr.bin/mandoc/roff.c
4154
*n->val.p = '\0';
usr.bin/mandoc/roff.c
4157
oldch = n->val.sz;
usr.bin/mandoc/roff.c
4158
n->val.p = mandoc_realloc(n->val.p, oldch + newch);
usr.bin/mandoc/roff.c
4162
c = n->val.p + (int)oldch;
usr.bin/mandoc/roff.c
4181
n->val.sz = (int)(c - n->val.p);
usr.bin/mandoc/roff.c
4188
const struct roffkv *n;
usr.bin/mandoc/roff.c
4193
for (n = r->strtab; n != NULL; n = n->next) {
usr.bin/mandoc/roff.c
4194
if (strncmp(name, n->key.p, len) != 0 ||
usr.bin/mandoc/roff.c
4195
n->key.p[len] != '\0' || n->val.p == NULL)
usr.bin/mandoc/roff.c
4199
return n->val.p;
usr.bin/mandoc/roff.c
4205
for (n = r->rentab; n != NULL; n = n->next) {
usr.bin/mandoc/roff.c
4206
if (strncmp(name, n->key.p, len) != 0 ||
usr.bin/mandoc/roff.c
4207
n->key.p[len] != '\0' || n->val.p == NULL)
usr.bin/mandoc/roff.c
4211
return n->val.p;
usr.bin/mandoc/roff.c
4281
struct roffkv *n, *nn;
usr.bin/mandoc/roff.c
4283
for (n = r; n; n = nn) {
usr.bin/mandoc/roff.c
4284
free(n->key.p);
usr.bin/mandoc/roff.c
4285
free(n->val.p);
usr.bin/mandoc/roff.c
4286
nn = n->next;
usr.bin/mandoc/roff.c
4287
free(n);
usr.bin/mandoc/roff.c
880
struct roff_node *n;
usr.bin/mandoc/roff.c
882
n = mandoc_calloc(1, sizeof(*n));
usr.bin/mandoc/roff.c
883
n->line = line;
usr.bin/mandoc/roff.c
884
n->pos = pos;
usr.bin/mandoc/roff.c
885
n->tok = tok;
usr.bin/mandoc/roff.c
886
n->type = type;
usr.bin/mandoc/roff.c
887
n->sec = man->lastsec;
usr.bin/mandoc/roff.c
890
n->flags |= NODE_SYNPRETTY;
usr.bin/mandoc/roff.c
892
n->flags &= ~NODE_SYNPRETTY;
usr.bin/mandoc/roff.c
894
n->flags |= NODE_NOFILL;
usr.bin/mandoc/roff.c
896
n->flags &= ~NODE_NOFILL;
usr.bin/mandoc/roff.c
898
n->flags |= NODE_LINE;
usr.bin/mandoc/roff.c
901
return n;
usr.bin/mandoc/roff.c
905
roff_node_append(struct roff_man *man, struct roff_node *n)
usr.bin/mandoc/roff.c
911
n->next = man->last->next;
usr.bin/mandoc/roff.c
912
man->last->next->prev = n;
usr.bin/mandoc/roff.c
914
man->last->parent->last = n;
usr.bin/mandoc/roff.c
915
man->last->next = n;
usr.bin/mandoc/roff.c
916
n->prev = man->last;
usr.bin/mandoc/roff.c
917
n->parent = man->last->parent;
usr.bin/mandoc/roff.c
921
n->next = man->last->child;
usr.bin/mandoc/roff.c
922
man->last->child->prev = n;
usr.bin/mandoc/roff.c
924
man->last->last = n;
usr.bin/mandoc/roff.c
925
man->last->child = n;
usr.bin/mandoc/roff.c
926
n->parent = man->last;
usr.bin/mandoc/roff.c
931
man->last = n;
usr.bin/mandoc/roff.c
933
switch (n->type) {
usr.bin/mandoc/roff.c
935
n->parent->head = n;
usr.bin/mandoc/roff.c
938
if (n->end != ENDBODY_NOT)
usr.bin/mandoc/roff.c
940
n->parent->body = n;
usr.bin/mandoc/roff.c
943
n->parent->tail = n;
usr.bin/mandoc/roff.c
954
n->norm = n->parent->norm;
usr.bin/mandoc/roff.c
955
assert(n->parent->type == ROFFT_BLOCK);
usr.bin/mandoc/roff.c
961
struct roff_node *n;
usr.bin/mandoc/roff.c
963
n = roff_node_alloc(man, line, pos, ROFFT_TEXT, TOKEN_NONE);
usr.bin/mandoc/roff.c
964
n->string = roff_strdup(man->roff, word);
usr.bin/mandoc/roff.c
965
roff_node_append(man, n);
usr.bin/mandoc/roff.c
966
n->flags |= NODE_VALID | NODE_ENDED;
usr.bin/mandoc/roff.c
973
struct roff_node *n;
usr.bin/mandoc/roff.c
976
n = man->last;
usr.bin/mandoc/roff.c
978
mandoc_asprintf(&newstr, "%s %s", n->string, addstr);
usr.bin/mandoc/roff.c
980
free(n->string);
usr.bin/mandoc/roff.c
981
n->string = newstr;
usr.bin/mandoc/roff.c
988
struct roff_node *n;
usr.bin/mandoc/roff.c
990
n = roff_node_alloc(man, line, pos, ROFFT_ELEM, tok);
usr.bin/mandoc/roff.c
991
roff_node_append(man, n);
usr.bin/mandoc/roff.c
998
struct roff_node *n;
usr.bin/mandoc/roff_html.c
29
#define ROFF_HTML_ARGS struct html *h, const struct roff_node *n
usr.bin/mandoc/roff_html.c
57
roff_html_pre(struct html *h, const struct roff_node *n)
usr.bin/mandoc/roff_html.c
59
assert(n->tok < ROFF_MAX);
usr.bin/mandoc/roff_html.c
60
if (roff_html_pre_acts[n->tok] != NULL)
usr.bin/mandoc/roff_html.c
61
(*roff_html_pre_acts[n->tok])(h, n);
usr.bin/mandoc/roff_html.c
73
for (n = n->child->next; n != NULL; n = n->next) {
usr.bin/mandoc/roff_html.c
74
if (n->type == ROFFT_TEXT) {
usr.bin/mandoc/roff_html.c
75
if (n->flags & NODE_LINE)
usr.bin/mandoc/roff_html.c
76
roff_html_pre_br(h, n);
usr.bin/mandoc/roff_html.c
77
print_text(h, n->string);
usr.bin/mandoc/roff_html.c
79
roff_html_pre(h, n);
usr.bin/mandoc/roff_html.c
81
roff_html_pre_br(h, n);
usr.bin/mandoc/roff_html.c
96
cp = n->child->string;
usr.bin/mandoc/roff_term.c
111
cp = n->child->string;
usr.bin/mandoc/roff_term.c
139
term_setwidth(p, n->child != NULL ? n->child->string : NULL);
usr.bin/mandoc/roff_term.c
150
if (n->child != NULL) {
usr.bin/mandoc/roff_term.c
151
p->mc = n->child->string;
usr.bin/mandoc/roff_term.c
174
if (n->child != NULL &&
usr.bin/mandoc/roff_term.c
175
a2roffsu(n->child->string, &su, SCALE_EM) != NULL) {
usr.bin/mandoc/roff_term.c
177
if (*n->child->string == '+' ||
usr.bin/mandoc/roff_term.c
178
*n->child->string == '-')
usr.bin/mandoc/roff_term.c
200
if (n->child != NULL) {
usr.bin/mandoc/roff_term.c
201
if (a2roffsu(n->child->string, &su, SCALE_VS) == NULL)
usr.bin/mandoc/roff_term.c
213
roff_term_pre_br(p, n);
usr.bin/mandoc/roff_term.c
220
for (n = n->child; n != NULL; n = n->next)
usr.bin/mandoc/roff_term.c
221
term_tab_set(p, n->string);
usr.bin/mandoc/roff_term.c
233
roff_term_pre_br(p, n);
usr.bin/mandoc/roff_term.c
235
if (n->child == NULL)
usr.bin/mandoc/roff_term.c
237
cp = n->child->string;
usr.bin/mandoc/roff_term.c
29
#define ROFF_TERM_ARGS struct termp *p, const struct roff_node *n
usr.bin/mandoc/roff_term.c
60
roff_term_pre(struct termp *p, const struct roff_node *n)
usr.bin/mandoc/roff_term.c
62
assert(n->tok < ROFF_MAX);
usr.bin/mandoc/roff_term.c
63
(*roff_term_pre_acts[n->tok])(p, n);
usr.bin/mandoc/roff_term.c
84
roff_term_pre_br(p, n);
usr.bin/mandoc/roff_term.c
85
p->flags |= n->tok == ROFF_ce ? TERMP_CENTER : TERMP_RIGHT;
usr.bin/mandoc/roff_term.c
86
nc1 = n->child->next;
usr.bin/mandoc/roff_validate.c
106
if (n->child == NULL) {
usr.bin/mandoc/roff_validate.c
108
roff_word_alloc(man, n->line, n->pos, "P");
usr.bin/mandoc/roff_validate.c
109
man->last = n;
usr.bin/mandoc/roff_validate.c
113
cp = n->child->string;
usr.bin/mandoc/roff_validate.c
116
mandoc_msg(MANDOCERR_FT_BAD, n->line, n->pos, "ft %s", cp);
usr.bin/mandoc/roff_validate.c
117
roff_node_delete(man, n);
usr.bin/mandoc/roff_validate.c
123
if (n->flags & NODE_NOFILL)
usr.bin/mandoc/roff_validate.c
124
mandoc_msg(MANDOCERR_NF_SKIP, n->line, n->pos, "nf");
usr.bin/mandoc/roff_validate.c
132
if ((np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/roff_validate.c
143
n->line, n->pos, "sp after Pp");
usr.bin/mandoc/roff_validate.c
144
roff_node_delete(man, n);
usr.bin/mandoc/roff_validate.c
28
#define ROFF_VALID_ARGS struct roff_man *man, struct roff_node *n
usr.bin/mandoc/roff_validate.c
57
struct roff_node *n;
usr.bin/mandoc/roff_validate.c
59
n = man->last;
usr.bin/mandoc/roff_validate.c
60
assert(n->tok < ROFF_MAX);
usr.bin/mandoc/roff_validate.c
61
if (roff_valids[n->tok] != NULL)
usr.bin/mandoc/roff_validate.c
62
(*roff_valids[n->tok])(man, n);
usr.bin/mandoc/roff_validate.c
70
if (n->next != NULL && n->next->type == ROFFT_TEXT &&
usr.bin/mandoc/roff_validate.c
71
*n->next->string == ' ') {
usr.bin/mandoc/roff_validate.c
72
mandoc_msg(MANDOCERR_PAR_SKIP, n->line, n->pos,
usr.bin/mandoc/roff_validate.c
74
roff_node_delete(man, n);
usr.bin/mandoc/roff_validate.c
78
if ((np = roff_node_prev(n)) == NULL)
usr.bin/mandoc/roff_validate.c
86
n->line, n->pos, "br after %s", roff_name[np->tok]);
usr.bin/mandoc/roff_validate.c
87
roff_node_delete(man, n);
usr.bin/mandoc/roff_validate.c
97
if ((n->flags & NODE_NOFILL) == 0)
usr.bin/mandoc/roff_validate.c
98
mandoc_msg(MANDOCERR_FI_SKIP, n->line, n->pos, "fi");
usr.bin/mandoc/tag.c
106
if (n->flags & NODE_ID)
usr.bin/mandoc/tag.c
113
if (n->child == NULL || n->child->type != ROFFT_TEXT)
usr.bin/mandoc/tag.c
115
s = n->child->string;
usr.bin/mandoc/tag.c
222
entry->nodes[entry->nnodes++] = n;
usr.bin/mandoc/tag.c
224
n->flags |= NODE_ID;
usr.bin/mandoc/tag.c
226
assert(n->tag == NULL);
usr.bin/mandoc/tag.c
227
n->tag = mandoc_strndup(s, len);
usr.bin/mandoc/tag.c
245
tag_move_id(struct roff_node *n)
usr.bin/mandoc/tag.c
249
np = n;
usr.bin/mandoc/tag.c
277
np->tag = mandoc_strdup(n->tag == NULL ?
usr.bin/mandoc/tag.c
278
n->child->string : n->tag);
usr.bin/mandoc/tag.c
280
n->flags &= ~NODE_ID;
usr.bin/mandoc/tag.c
307
tag_move_href(struct roff_man *man, struct roff_node *n, const char *tag)
usr.bin/mandoc/tag.c
311
if (n == NULL || n->type != ROFFT_TEXT ||
usr.bin/mandoc/tag.c
312
*n->string == '\0' || *n->string == ' ')
usr.bin/mandoc/tag.c
315
cp = n->string;
usr.bin/mandoc/tag.c
316
while (cp != NULL && cp - n->string < 5)
usr.bin/mandoc/tag.c
322
man->last = n;
usr.bin/mandoc/tag.c
324
roff_word_alloc(man, n->line,
usr.bin/mandoc/tag.c
325
n->pos + (cp - n->string), cp + 1);
usr.bin/mandoc/tag.c
326
man->last->flags = n->flags & ~NODE_LINE;
usr.bin/mandoc/tag.c
330
assert(n->tag == NULL);
usr.bin/mandoc/tag.c
331
n->tag = mandoc_strdup(tag);
usr.bin/mandoc/tag.c
332
n->flags |= NODE_HREF;
usr.bin/mandoc/tag.c
341
tag_postprocess(struct roff_man *man, struct roff_node *n)
usr.bin/mandoc/tag.c
343
if (n->flags & NODE_ID) {
usr.bin/mandoc/tag.c
344
switch (n->tok) {
usr.bin/mandoc/tag.c
346
tag_move_href(man, n->next, n->tag);
usr.bin/mandoc/tag.c
351
tag_move_href(man, n->child, n->tag);
usr.bin/mandoc/tag.c
357
if (n->type == ROFFT_ELEM || n->tok == MDOC_Fo)
usr.bin/mandoc/tag.c
358
tag_move_id(n);
usr.bin/mandoc/tag.c
359
if (n->tok != MDOC_Tg)
usr.bin/mandoc/tag.c
360
n->flags |= NODE_HREF;
usr.bin/mandoc/tag.c
361
else if ((n->flags & NODE_ID) == 0) {
usr.bin/mandoc/tag.c
362
n->flags |= NODE_NOPRT;
usr.bin/mandoc/tag.c
363
free(n->tag);
usr.bin/mandoc/tag.c
364
n->tag = NULL;
usr.bin/mandoc/tag.c
369
for (n = n->child; n != NULL; n = n->next)
usr.bin/mandoc/tag.c
370
tag_postprocess(man, n);
usr.bin/mandoc/tag.c
87
tag_put(const char *s, int prio, struct roff_node *n)
usr.bin/mandoc/term_tab.c
101
tabs.a.n += tabs.p.n;
usr.bin/mandoc/term_tab.c
102
if (tabs.a.s < tabs.a.n) {
usr.bin/mandoc/term_tab.c
103
tabs.a.s = tabs.a.n;
usr.bin/mandoc/term_tab.c
107
for (j = 0; j < tabs.p.n; j++)
usr.bin/mandoc/term_tab.c
30
size_t n; /* Currently used number of positions. */
usr.bin/mandoc/term_tab.c
52
tabs.a.n = tabs.p.n = 0;
usr.bin/mandoc/term_tab.c
78
if (tl->n >= tl->s) {
usr.bin/mandoc/term_tab.c
86
tl->t[tl->n] = pos;
usr.bin/mandoc/term_tab.c
87
if (add && tl->n)
usr.bin/mandoc/term_tab.c
88
tl->t[tl->n] += tl->t[tl->n - 1];
usr.bin/mandoc/term_tab.c
89
tl->n++;
usr.bin/mandoc/term_tab.c
98
if (i == tabs.a.n) {
usr.bin/mandoc/term_tab.c
99
if (tabs.p.n == 0)
usr.bin/mandoc/term_tag.c
150
term_tag_write(struct roff_node *n, size_t line)
usr.bin/mandoc/term_tag.c
157
cp = n->tag == NULL ? n->child->string : n->tag;
usr.bin/mandoc/tree.c
109
if (n->end)
usr.bin/mandoc/tree.c
135
switch (n->type) {
usr.bin/mandoc/tree.c
138
p = n->string;
usr.bin/mandoc/tree.c
141
p = roff_name[n->tok];
usr.bin/mandoc/tree.c
144
p = roff_name[n->tok];
usr.bin/mandoc/tree.c
147
p = roff_name[n->tok];
usr.bin/mandoc/tree.c
150
p = roff_name[n->tok];
usr.bin/mandoc/tree.c
151
if (n->args) {
usr.bin/mandoc/tree.c
152
argv = n->args->argv;
usr.bin/mandoc/tree.c
153
argc = n->args->argc;
usr.bin/mandoc/tree.c
157
p = roff_name[n->tok];
usr.bin/mandoc/tree.c
158
if (n->args) {
usr.bin/mandoc/tree.c
159
argv = n->args->argv;
usr.bin/mandoc/tree.c
160
argc = n->args->argc;
usr.bin/mandoc/tree.c
175
if (n->span) {
usr.bin/mandoc/tree.c
177
print_span(n->span, indent);
usr.bin/mandoc/tree.c
193
print_attr(n);
usr.bin/mandoc/tree.c
195
if (n->eqn)
usr.bin/mandoc/tree.c
196
print_box(n->eqn->first, indent + 4);
usr.bin/mandoc/tree.c
197
if (n->child)
usr.bin/mandoc/tree.c
198
print_mdoc(n->child, indent +
usr.bin/mandoc/tree.c
199
(n->type == ROFFT_BLOCK ? 2 : 4));
usr.bin/mandoc/tree.c
200
if (n->next)
usr.bin/mandoc/tree.c
201
print_mdoc(n->next, indent);
usr.bin/mandoc/tree.c
205
print_man(const struct roff_node *n, int indent)
usr.bin/mandoc/tree.c
210
if (n == NULL)
usr.bin/mandoc/tree.c
215
switch (n->type) {
usr.bin/mandoc/tree.c
246
switch (n->type) {
usr.bin/mandoc/tree.c
249
p = n->string;
usr.bin/mandoc/tree.c
255
p = roff_name[n->tok];
usr.bin/mandoc/tree.c
269
if (n->span) {
usr.bin/mandoc/tree.c
271
print_span(n->span, indent);
usr.bin/mandoc/tree.c
276
print_attr(n);
usr.bin/mandoc/tree.c
278
if (n->eqn)
usr.bin/mandoc/tree.c
279
print_box(n->eqn->first, indent + 4);
usr.bin/mandoc/tree.c
280
if (n->child)
usr.bin/mandoc/tree.c
281
print_man(n->child, indent +
usr.bin/mandoc/tree.c
282
(n->type == ROFFT_BLOCK ? 2 : 4));
usr.bin/mandoc/tree.c
283
if (n->next)
usr.bin/mandoc/tree.c
284
print_man(n->next, indent);
usr.bin/mandoc/tree.c
288
print_attr(const struct roff_node *n)
usr.bin/mandoc/tree.c
291
if (n->flags & NODE_DELIMO)
usr.bin/mandoc/tree.c
293
if (n->flags & NODE_LINE)
usr.bin/mandoc/tree.c
295
printf("%d:%d", n->line, n->pos + 1);
usr.bin/mandoc/tree.c
296
if (n->flags & NODE_DELIMC)
usr.bin/mandoc/tree.c
298
if (n->flags & NODE_EOS)
usr.bin/mandoc/tree.c
300
if (n->flags & NODE_ID) {
usr.bin/mandoc/tree.c
302
if (n->flags & NODE_HREF)
usr.bin/mandoc/tree.c
304
} else if (n->flags & NODE_HREF)
usr.bin/mandoc/tree.c
306
else if (n->tag != NULL)
usr.bin/mandoc/tree.c
308
if (n->tag != NULL)
usr.bin/mandoc/tree.c
309
printf("=%s", n->tag);
usr.bin/mandoc/tree.c
310
if (n->flags & NODE_BROKEN)
usr.bin/mandoc/tree.c
312
if (n->flags & NODE_NOFILL)
usr.bin/mandoc/tree.c
314
if (n->flags & NODE_NOSRC)
usr.bin/mandoc/tree.c
316
if (n->flags & NODE_NOPRT)
usr.bin/mandoc/tree.c
84
print_mdoc(const struct roff_node *n, int indent)
usr.bin/mandoc/tree.c
91
if (n == NULL)
usr.bin/mandoc/tree.c
98
switch (n->type) {
usr.bin/mg/autoexec.c
97
auto_execute(int f, int n)
usr.bin/mg/basic.c
118
gotobob(int f, int n)
usr.bin/mg/basic.c
121
(void) setmark(f, n);
usr.bin/mg/basic.c
126
if (f & FFOTHARG && n > 0) {
usr.bin/mg/basic.c
127
if (n > 9)
usr.bin/mg/basic.c
130
forwline(f, percint(curwp->w_bufp->b_lines, n) - 1);
usr.bin/mg/basic.c
142
gotoeob(int f, int n)
usr.bin/mg/basic.c
148
(void) setmark(f, n);
usr.bin/mg/basic.c
163
if (f & FFOTHARG && n > 0) {
usr.bin/mg/basic.c
164
if (n > 9)
usr.bin/mg/basic.c
167
backline(f, percint(curwp->w_bufp->b_lines, n));
usr.bin/mg/basic.c
182
forwline(int f, int n)
usr.bin/mg/basic.c
186
if (n < 0)
usr.bin/mg/basic.c
187
return (backline(f | FFRAND, -n));
usr.bin/mg/basic.c
196
if (n == 0)
usr.bin/mg/basic.c
198
while (n--) {
usr.bin/mg/basic.c
225
backline(int f, int n)
usr.bin/mg/basic.c
229
if (n < 0)
usr.bin/mg/basic.c
230
return (forwline(f | FFRAND, -n));
usr.bin/mg/basic.c
240
while (n-- && lback(dlp) != curbp->b_headp) {
usr.bin/mg/basic.c
244
if (n > 0 && !(f & FFRAND))
usr.bin/mg/basic.c
30
gotobol(int f, int n)
usr.bin/mg/basic.c
303
forwpage(int f, int n)
usr.bin/mg/basic.c
308
n = curwp->w_ntrows - 2; /* Default scroll. */
usr.bin/mg/basic.c
309
if (n <= 0) /* Forget the overlap */
usr.bin/mg/basic.c
310
n = 1; /* if tiny window. */
usr.bin/mg/basic.c
311
} else if (n < 0)
usr.bin/mg/basic.c
312
return (backpage(f | FFRAND, -n));
usr.bin/mg/basic.c
315
while (n--)
usr.bin/mg/basic.c
32
if (n == 0)
usr.bin/mg/basic.c
324
for (n = curwp->w_ntrows; n-- && lp != curbp->b_headp; lp = lforw(lp))
usr.bin/mg/basic.c
346
backpage(int f, int n)
usr.bin/mg/basic.c
351
n = curwp->w_ntrows - 2; /* Default scroll. */
usr.bin/mg/basic.c
352
if (n <= 0) /* Don't blow up if the */
usr.bin/mg/basic.c
354
} else if (n < 0)
usr.bin/mg/basic.c
355
return (forwpage(f | FFRAND, -n));
usr.bin/mg/basic.c
359
while (n-- && lback(lp) != curbp->b_headp) {
usr.bin/mg/basic.c
369
for (n = curwp->w_ntrows; n-- && lp != curbp->b_headp; lp = lforw(lp))
usr.bin/mg/basic.c
392
forw1page(int f, int n)
usr.bin/mg/basic.c
395
n = 1;
usr.bin/mg/basic.c
398
forwpage(f | FFRAND, n);
usr.bin/mg/basic.c
403
back1page(int f, int n)
usr.bin/mg/basic.c
406
n = 1;
usr.bin/mg/basic.c
409
backpage(f | FFRAND, n);
usr.bin/mg/basic.c
418
pagenext(int f, int n)
usr.bin/mg/basic.c
426
(void) nextwind(f, n);
usr.bin/mg/basic.c
427
(void) forwpage(f, n);
usr.bin/mg/basic.c
450
setmark(int f, int n)
usr.bin/mg/basic.c
459
clearmark(int f, int n)
usr.bin/mg/basic.c
46
backchar(int f, int n)
usr.bin/mg/basic.c
479
swapmark(int f, int n)
usr.bin/mg/basic.c
50
if (n < 0)
usr.bin/mg/basic.c
508
gotoline(int f, int n)
usr.bin/mg/basic.c
51
return (forwchar(f, -n));
usr.bin/mg/basic.c
519
n = (int)strtonum(buf, INT_MIN, INT_MAX, &err);
usr.bin/mg/basic.c
52
while (n--) {
usr.bin/mg/basic.c
523
return(setlineno(n));
usr.bin/mg/basic.c
530
setlineno(int n)
usr.bin/mg/basic.c
534
if (n >= 0) {
usr.bin/mg/basic.c
535
if (n == 0)
usr.bin/mg/basic.c
536
n++;
usr.bin/mg/basic.c
537
curwp->w_dotline = n;
usr.bin/mg/basic.c
539
while (--n > 0) {
usr.bin/mg/basic.c
547
curwp->w_dotline = curwp->w_bufp->b_lines + n;
usr.bin/mg/basic.c
549
while (n < 0) {
usr.bin/mg/basic.c
555
n++;
usr.bin/mg/basic.c
74
gotoeol(int f, int n)
usr.bin/mg/basic.c
76
if (n == 0)
usr.bin/mg/basic.c
90
forwchar(int f, int n)
usr.bin/mg/basic.c
92
if (n < 0)
usr.bin/mg/basic.c
93
return (backchar(f, -n));
usr.bin/mg/basic.c
94
while (n--) {
usr.bin/mg/bell.c
30
dobeep_num(const char *msg, int n)
usr.bin/mg/bell.c
32
ewprintf("%s %d", msg, n);
usr.bin/mg/bell.c
69
toggleaudiblebell(int f, int n)
usr.bin/mg/bell.c
72
doaudiblebell = n > 0;
usr.bin/mg/bell.c
80
togglevisiblebell(int f, int n)
usr.bin/mg/bell.c
83
dovisiblebell = n > 0;
usr.bin/mg/buffer.c
1003
diffbuffer(int f, int n)
usr.bin/mg/buffer.c
1016
if (n > 1)
usr.bin/mg/buffer.c
137
usebuffer(int f, int n)
usr.bin/mg/buffer.c
158
poptobuffer(int f, int n)
usr.bin/mg/buffer.c
179
return (splitwind(f, n));
usr.bin/mg/buffer.c
196
killbuffer_cmd(int f, int n)
usr.bin/mg/buffer.c
287
savebuffers(int f, int n)
usr.bin/mg/buffer.c
299
static int listbuf_goto_buffer(int f, int n);
usr.bin/mg/buffer.c
300
static int listbuf_goto_buffer_one(int f, int n);
usr.bin/mg/buffer.c
301
static int listbuf_goto_buffer_helper(int f, int n, int only);
usr.bin/mg/buffer.c
333
listbuffers(int f, int n)
usr.bin/mg/buffer.c
40
settabw(int f, int n)
usr.bin/mg/buffer.c
416
listbuf_goto_buffer(int f, int n)
usr.bin/mg/buffer.c
418
return (listbuf_goto_buffer_helper(f, n, 0));
usr.bin/mg/buffer.c
422
listbuf_goto_buffer_one(int f, int n)
usr.bin/mg/buffer.c
424
return (listbuf_goto_buffer_helper(f, n, 1));
usr.bin/mg/buffer.c
428
listbuf_goto_buffer_helper(int f, int n, int only)
usr.bin/mg/buffer.c
46
if (n <= 0 || n > 16)
usr.bin/mg/buffer.c
48
defb_tabw = n;
usr.bin/mg/buffer.c
57
n = strtonum(buf, 1, 16, &errstr);
usr.bin/mg/buffer.c
60
curbp->b_tabw = n;
usr.bin/mg/buffer.c
66
togglereadonlyall(int f, int n)
usr.bin/mg/buffer.c
794
bufferinsert(int f, int n)
usr.bin/mg/buffer.c
849
notmodified(int f, int n)
usr.bin/mg/buffer.c
87
togglereadonly(int f, int n)
usr.bin/mg/buffer.c
948
revertbuffer(int f, int n)
usr.bin/mg/cmode.c
106
cmode(int f, int n)
usr.bin/mg/cmode.c
108
return(changemode(f, n, "c"));
usr.bin/mg/cmode.c
115
cc_char(int f, int n)
usr.bin/mg/cmode.c
117
if (n < 0)
usr.bin/mg/cmode.c
119
if (selfinsert(FFRAND, n) == FALSE)
usr.bin/mg/cmode.c
121
return (cc_indent(FFRAND, n));
usr.bin/mg/cmode.c
128
cc_brace(int f, int n)
usr.bin/mg/cmode.c
130
if (n < 0)
usr.bin/mg/cmode.c
134
return (cc_indent(FFRAND, n));
usr.bin/mg/cmode.c
144
cc_tab(int f, int n)
usr.bin/mg/cmode.c
152
return (selfinsert(f, n));
usr.bin/mg/cmode.c
161
cc_indent(int f, int n)
usr.bin/mg/cmode.c
168
if (n < 0)
usr.bin/mg/cmode.c
203
cc_lfindent(int f, int n)
usr.bin/mg/cmode.c
205
if (n < 0)
usr.bin/mg/cmode.c
211
return (cc_indent(FFRAND, n));
usr.bin/mg/cscope.c
100
csfuncalled(int f, int n)
usr.bin/mg/cscope.c
109
cscallerfuncs(int f, int n)
usr.bin/mg/cscope.c
118
csfindtext(int f, int n)
usr.bin/mg/cscope.c
127
csegrep(int f, int n)
usr.bin/mg/cscope.c
136
csfindfile(int f, int n)
usr.bin/mg/cscope.c
145
csfindinc(int f, int n)
usr.bin/mg/cscope.c
155
cscreatelist(int f, int n)
usr.bin/mg/cscope.c
225
csnextmatch(int f, int n)
usr.bin/mg/cscope.c
258
csprevmatch(int f, int n)
usr.bin/mg/cscope.c
288
csnextfile(int f, int n)
usr.bin/mg/cscope.c
310
csprevfile(int f, int n)
usr.bin/mg/cscope.c
82
cssymbol(int f, int n)
usr.bin/mg/cscope.c
91
csdefinition(int f, int n)
usr.bin/mg/def.h
152
#define lgetc(lp, n) (CHARMASK((lp)->l_text[(n)]))
usr.bin/mg/def.h
153
#define lputc(lp, n, c) ((lp)->l_text[(n)]=(c))
usr.bin/mg/dir.c
40
changedir(int f, int n)
usr.bin/mg/dir.c
72
showcwdir(int f, int n)
usr.bin/mg/dir.c
89
makedir(int f, int n)
usr.bin/mg/dired.c
1115
dired_jump(int f, int n)
usr.bin/mg/dired.c
1130
return (d_updirectory(f, n));
usr.bin/mg/dired.c
1154
d_gotofile(int f, int n)
usr.bin/mg/dired.c
243
dired(int f, int n)
usr.bin/mg/dired.c
271
d_otherwindow(int f, int n)
usr.bin/mg/dired.c
302
d_del(int f, int n)
usr.bin/mg/dired.c
304
if (n < 0)
usr.bin/mg/dired.c
306
while (n--) {
usr.bin/mg/dired.c
321
d_undel(int f, int n)
usr.bin/mg/dired.c
323
if (n < 0)
usr.bin/mg/dired.c
324
return (d_undelbak(f, -n));
usr.bin/mg/dired.c
325
while (n--) {
usr.bin/mg/dired.c
338
d_undelbak(int f, int n)
usr.bin/mg/dired.c
340
if (n < 0)
usr.bin/mg/dired.c
341
return (d_undel(f, -n));
usr.bin/mg/dired.c
342
while (n--) {
usr.bin/mg/dired.c
355
d_findfile(int f, int n)
usr.bin/mg/dired.c
378
d_updirectory(int f, int n)
usr.bin/mg/dired.c
400
d_ffotherwindow(int f, int n)
usr.bin/mg/dired.c
421
d_expunge(int f, int n)
usr.bin/mg/dired.c
477
d_copy(int f, int n)
usr.bin/mg/dired.c
535
d_rename(int f, int n)
usr.bin/mg/dired.c
607
d_shell_command(int f, int n)
usr.bin/mg/dired.c
655
int ret = (ABORT), n;
usr.bin/mg/dired.c
663
for (n = 2; va_arg(ap, char *) != NULL; n++)
usr.bin/mg/dired.c
668
if ((argv = calloc(n, sizeof(*argv))) == NULL) {
usr.bin/mg/dired.c
674
n = 1;
usr.bin/mg/dired.c
677
while ((argv[n] = va_arg(ap, char *)) != NULL)
usr.bin/mg/dired.c
678
n++;
usr.bin/mg/dired.c
755
d_create_directory(int f, int n)
usr.bin/mg/dired.c
771
d_killbuffer_cmd(int f, int n)
usr.bin/mg/dired.c
777
d_refreshbuffer(int f, int n)
usr.bin/mg/dired.c
889
d_forwpage(int f, int n)
usr.bin/mg/dired.c
891
forwpage(f | FFRAND, n);
usr.bin/mg/dired.c
896
d_backpage (int f, int n)
usr.bin/mg/dired.c
898
backpage(f | FFRAND, n);
usr.bin/mg/dired.c
903
d_forwline (int f, int n)
usr.bin/mg/dired.c
905
forwline(f | FFRAND, n);
usr.bin/mg/dired.c
910
d_backline (int f, int n)
usr.bin/mg/dired.c
912
backline(f | FFRAND, n);
usr.bin/mg/dired.c
917
d_filevisitalt (int f, int n)
usr.bin/mg/display.c
106
linenotoggle(int f, int n)
usr.bin/mg/display.c
109
linenos = n > 0;
usr.bin/mg/display.c
119
colnotoggle(int f, int n)
usr.bin/mg/display.c
122
colnos = n > 0;
usr.bin/mg/display.c
149
#define TRYREALLOC(a, n) do { \
usr.bin/mg/display.c
151
if ((tmp = realloc((a), (n))) == NULL) { \
usr.bin/mg/display.c
157
#define TRYREALLOCARRAY(a, n, m) do { \
usr.bin/mg/display.c
159
if ((tmp = reallocarray((a), (n), (m))) == NULL) {\
usr.bin/mg/display.c
789
int n, md;
usr.bin/mg/display.c
794
n = wp->w_toprow + wp->w_ntrows; /* Location. */
usr.bin/mg/display.c
795
vscreen[n]->v_color = modelinecolor; /* Mode line color. */
usr.bin/mg/display.c
796
vscreen[n]->v_flag |= (VFCHG | VFHBAD); /* Recompute, display. */
usr.bin/mg/display.c
797
vtmove(n, 0); /* Seek to right line. */
usr.bin/mg/display.c
815
n = 5;
usr.bin/mg/display.c
816
n += vtputs("Mg: ", wp);
usr.bin/mg/display.c
818
n += vtputs(&(bp->b_bname[0]), wp);
usr.bin/mg/display.c
819
while (n < 42) { /* Pad out with blanks. */
usr.bin/mg/display.c
821
++n;
usr.bin/mg/display.c
824
++n;
usr.bin/mg/display.c
826
n += vtputs(bp->b_modes[md]->p_name, wp);
usr.bin/mg/display.c
830
++n;
usr.bin/mg/display.c
834
n += vtputs("-def", wp);
usr.bin/mg/display.c
836
n += vtputs("-gwd", wp);
usr.bin/mg/display.c
838
++n;
usr.bin/mg/display.c
848
n += vtputs(sl, wp);
usr.bin/mg/display.c
850
while (n < ncol) { /* Pad out. */
usr.bin/mg/display.c
852
++n;
usr.bin/mg/display.c
862
int n = 0;
usr.bin/mg/display.c
866
++n;
usr.bin/mg/display.c
868
return (n);
usr.bin/mg/display.c
882
int i, n;
usr.bin/mg/display.c
890
n = ncol - i; /* Erase cheaper? */
usr.bin/mg/display.c
891
if (n > tceeol)
usr.bin/mg/display.c
892
n = tceeol;
usr.bin/mg/display.c
893
vp->v_cost = i + n; /* Bytes + blanks. */
usr.bin/mg/display.c
894
for (n = 0; i != 0; --i, --s)
usr.bin/mg/display.c
895
n = (n << 5) + n + *s;
usr.bin/mg/display.c
896
vp->v_hash = n; /* Hash code. */
usr.bin/mg/extend.c
326
int c, s, n;
usr.bin/mg/extend.c
347
n = strlcpy(bprompt, p, sizeof(bprompt));
usr.bin/mg/extend.c
348
if (n >= sizeof(bprompt))
usr.bin/mg/extend.c
349
n = sizeof(bprompt) - 1;
usr.bin/mg/extend.c
350
pep = bprompt + n;
usr.bin/mg/extend.c
36
insert(int f, int n)
usr.bin/mg/extend.c
42
while (--n >= 0) {
usr.bin/mg/extend.c
464
bindtokey(int f, int n)
usr.bin/mg/extend.c
473
localbind(int f, int n)
usr.bin/mg/extend.c
483
redefine_key(int f, int n)
usr.bin/mg/extend.c
505
unbindtokey(int f, int n)
usr.bin/mg/extend.c
511
localunbind(int f, int n)
usr.bin/mg/extend.c
524
extend(int f, int n)
usr.bin/mg/extend.c
53
if (n == 1)
usr.bin/mg/extend.c
532
bufp = eread("%d M-x ", xname, NXNAME, EFNEW | EFFUNC, n);
usr.bin/mg/extend.c
545
return ((*funct)(f, n));
usr.bin/mg/extend.c
571
evalexpr(int f, int n)
usr.bin/mg/extend.c
591
evalbuffer(int f, int n)
usr.bin/mg/extend.c
61
while (--n >= 0) {
usr.bin/mg/extend.c
621
evalfile(int f, int n)
usr.bin/mg/extend.c
680
int status, c, f, n;
usr.bin/mg/extend.c
698
n = 1;
usr.bin/mg/extend.c
720
n = (int)nl;
usr.bin/mg/extend.c
882
status = (*fp)(f, n);
usr.bin/mg/file.c
138
filevisitro(int f, int n)
usr.bin/mg/file.c
142
error = filevisit(f, n);
usr.bin/mg/file.c
154
poptofile(int f, int n)
usr.bin/mg/file.c
176
return (splitwind(f, n));
usr.bin/mg/file.c
28
fileinsert(int f, int n)
usr.bin/mg/file.c
506
filewrite(int f, int n)
usr.bin/mg/file.c
53
filevisit(int f, int n)
usr.bin/mg/file.c
566
filesave(int f, int n)
usr.bin/mg/file.c
574
return (filewrite(f, n));
usr.bin/mg/file.c
634
makebkfile(int f, int n)
usr.bin/mg/file.c
637
makebackup = n > 0;
usr.bin/mg/file.c
92
filevisitalt(int f, int n)
usr.bin/mg/fileio.c
643
backuptohomedir(int f, int n)
usr.bin/mg/fileio.c
671
toggleleavetmp(int f, int n)
usr.bin/mg/grep.c
102
if (savebuffers(f, n) == ABORT)
usr.bin/mg/grep.c
118
gid(int f, int n)
usr.bin/mg/grep.c
181
int ret, n, status;
usr.bin/mg/grep.c
189
n = snprintf(qcmd, sizeof(qcmd), "%s 2>&1", command);
usr.bin/mg/grep.c
190
if (n < 0 || n >= sizeof(qcmd))
usr.bin/mg/grep.c
254
compile_goto_error(int f, int n)
usr.bin/mg/grep.c
321
next_error(int f, int n)
usr.bin/mg/grep.c
338
return (compile_goto_error(f, n));
usr.bin/mg/grep.c
346
globalwdtoggle(int f, int n)
usr.bin/mg/grep.c
349
globalwd = n > 0;
usr.bin/mg/grep.c
65
grep(int f, int n)
usr.bin/mg/grep.c
90
compile(int f, int n)
usr.bin/mg/help.c
102
wallchart(int f, int n)
usr.bin/mg/help.c
156
help_help(int f, int n)
usr.bin/mg/help.c
171
return ((*funct)(f, n));
usr.bin/mg/help.c
175
apropos_command(int f, int n)
usr.bin/mg/help.c
28
desckey(int f, int n)
usr.bin/mg/kbd.c
171
rescan(int f, int n)
usr.bin/mg/kbd.c
198
return (mgwrap(fp, f, n));
usr.bin/mg/kbd.c
219
return (mgwrap(fp, f, n));
usr.bin/mg/kbd.c
225
universal_argument(int f, int n)
usr.bin/mg/kbd.c
232
nn *= n;
usr.bin/mg/kbd.c
258
digit_argument(int f, int n)
usr.bin/mg/kbd.c
290
negative_argument(int f, int n)
usr.bin/mg/kbd.c
307
nn = -n;
usr.bin/mg/kbd.c
330
selfinsert(int f, int n)
usr.bin/mg/kbd.c
336
if (n < 0)
usr.bin/mg/kbd.c
338
if (n == 0)
usr.bin/mg/kbd.c
350
if (maclcur->l_size < maclcur->l_used + n) {
usr.bin/mg/kbd.c
351
if (lrealloc(maclcur, maclcur->l_used + n) ==
usr.bin/mg/kbd.c
355
maclcur->l_used += n;
usr.bin/mg/kbd.c
357
for (count = maclcur->l_used - n;
usr.bin/mg/kbd.c
362
if ((lp = lalloc(n)) == NULL)
usr.bin/mg/kbd.c
368
for (count = 0; count < n; count++)
usr.bin/mg/kbd.c
376
} while (--n && count == TRUE);
usr.bin/mg/kbd.c
383
while (curwp->w_doto < llength(curwp->w_dotp) && n--)
usr.bin/mg/kbd.c
385
if (n <= 0)
usr.bin/mg/kbd.c
388
return (linsert(n, c));
usr.bin/mg/kbd.c
399
ask_selfinsert(int f, int n)
usr.bin/mg/kbd.c
41
do_meta(int f, int n)
usr.bin/mg/kbd.c
418
quote(int f, int n)
usr.bin/mg/kbd.c
436
return (selfinsert(f, n));
usr.bin/mg/kbd.c
44
use_metakey = n > 0;
usr.bin/mg/kbd.c
445
mgwrap(PF funct, int f, int n)
usr.bin/mg/kbd.c
460
return ((*funct)(f, n));
usr.bin/mg/kbd.c
57
bsmap(int f, int n)
usr.bin/mg/kbd.c
60
bs_map = n > 0;
usr.bin/mg/line.c
159
linsert(int n, int c)
usr.bin/mg/line.c
167
if (!n)
usr.bin/mg/line.c
195
if ((lp2 = lalloc(n)) == NULL)
usr.bin/mg/line.c
204
for (i = 0; i < n; ++i)
usr.bin/mg/line.c
214
undo_add_insert(lp2, 0, n);
usr.bin/mg/line.c
215
curwp->w_doto = n;
usr.bin/mg/line.c
221
if ((lp1->l_used + n) > lp1->l_size) {
usr.bin/mg/line.c
222
if (lrealloc(lp1, lp1->l_used + n) == FALSE)
usr.bin/mg/line.c
225
lp1->l_used += n;
usr.bin/mg/line.c
226
if (lp1->l_used != n)
usr.bin/mg/line.c
227
memmove(&lp1->l_text[doto + n], &lp1->l_text[doto],
usr.bin/mg/line.c
228
lp1->l_used - n - doto);
usr.bin/mg/line.c
231
for (i = 0; i < n; ++i)
usr.bin/mg/line.c
236
wp->w_doto += n;
usr.bin/mg/line.c
240
wp->w_marko += n;
usr.bin/mg/line.c
243
undo_add_insert(curwp->w_dotp, doto, n);
usr.bin/mg/line.c
355
ldelete(RSIZE n, int kflag)
usr.bin/mg/line.c
36
setcasereplace(int f, int n)
usr.bin/mg/line.c
375
len = n;
usr.bin/mg/line.c
380
undo_add_delete(curwp->w_dotp, curwp->w_doto, n, (kflag & KREG));
usr.bin/mg/line.c
382
while (n != 0) {
usr.bin/mg/line.c
39
casereplace = n > 0;
usr.bin/mg/line.c
391
if (chunk > n)
usr.bin/mg/line.c
392
chunk = n;
usr.bin/mg/line.c
401
--n;
usr.bin/mg/line.c
426
n -= chunk;
usr.bin/mg/line.c
532
RSIZE n;
usr.bin/mg/line.c
562
n = plen;
usr.bin/mg/line.c
567
for (n = 0, is_query_allcaps = 1; n < plen && is_query_allcaps;
usr.bin/mg/line.c
568
n++) {
usr.bin/mg/line.c
575
n++; /* \n is implicit in the buffer */
usr.bin/mg/line.c
580
for (n = 0, is_replace_alllower = 1; n < rlen && is_replace_alllower;
usr.bin/mg/line.c
581
n++)
usr.bin/mg/line.c
582
is_replace_alllower = !isupper((unsigned char)repl[n]);
usr.bin/mg/line.c
586
for (n = 0; n < rlen; n++)
usr.bin/mg/line.c
587
repl[n] = toupper((unsigned char)repl[n]);
usr.bin/mg/macro.c
28
definemacro(int f, int n)
usr.bin/mg/macro.c
57
finishmacro(int f, int n)
usr.bin/mg/macro.c
68
executemacro(int f, int n)
usr.bin/mg/macro.c
86
for (i = n; i > 0; i--) {
usr.bin/mg/main.c
315
quit(int f, int n)
usr.bin/mg/main.c
337
ctrlg(int f, int n)
usr.bin/mg/match.c
45
showmatch(int f, int n)
usr.bin/mg/match.c
49
for (i = 0; i < n; i++) {
usr.bin/mg/modes.c
102
if (n <= 0)
usr.bin/mg/modes.c
112
set_default_mode(int f, int n)
usr.bin/mg/modes.c
132
n = 0;
usr.bin/mg/modes.c
136
if (n > 0) {
usr.bin/mg/modes.c
158
if (n <= 0)
usr.bin/mg/modes.c
164
if (n <= 0)
usr.bin/mg/modes.c
26
changemode(int f, int n, char *newmode)
usr.bin/mg/modes.c
40
n = 0;
usr.bin/mg/modes.c
44
if (n > 0) {
usr.bin/mg/modes.c
70
indentmode(int f, int n)
usr.bin/mg/modes.c
72
return (changemode(f, n, "indent"));
usr.bin/mg/modes.c
76
fillmode(int f, int n)
usr.bin/mg/modes.c
78
return (changemode(f, n, "fill"));
usr.bin/mg/modes.c
82
notabmode(int f, int n)
usr.bin/mg/modes.c
84
if (changemode(f, n, "notab") == FALSE)
usr.bin/mg/modes.c
87
if (n <= 0)
usr.bin/mg/modes.c
97
overwrite_mode(int f, int n)
usr.bin/mg/modes.c
99
if (changemode(f, n, "overwrite") == FALSE)
usr.bin/mg/paragraph.c
128
fillpara(int f, int n)
usr.bin/mg/paragraph.c
142
if (n == 0)
usr.bin/mg/paragraph.c
265
killpara(int f, int n)
usr.bin/mg/paragraph.c
269
if (n == 0)
usr.bin/mg/paragraph.c
283
(void)gotoeop(FFRAND, n);
usr.bin/mg/paragraph.c
298
markpara(int f, int n)
usr.bin/mg/paragraph.c
302
if (n == 0)
usr.bin/mg/paragraph.c
310
(void)do_gotoeop(FFRAND, n, &i);
usr.bin/mg/paragraph.c
327
transposepara(int f, int n)
usr.bin/mg/paragraph.c
332
if (n == 0)
usr.bin/mg/paragraph.c
34
gotobop(int f, int n)
usr.bin/mg/paragraph.c
355
if (do_gotoeop(FFRAND, n, &i) == FALSE) {
usr.bin/mg/paragraph.c
39
if (n < 0)
usr.bin/mg/paragraph.c
40
return (gotoeop(f, -n));
usr.bin/mg/paragraph.c
406
fillword(int f, int n)
usr.bin/mg/paragraph.c
413
return selfinsert(f, n);
usr.bin/mg/paragraph.c
42
while (n-- > 0) {
usr.bin/mg/paragraph.c
421
(void)selfinsert(f, n);
usr.bin/mg/paragraph.c
445
return (fillword(f, n));
usr.bin/mg/paragraph.c
453
setfillcol(int f, int n)
usr.bin/mg/paragraph.c
460
fillcol = n;
usr.bin/mg/paragraph.c
480
sentencespace(int f, int n)
usr.bin/mg/paragraph.c
483
dblspace = n > 1;
usr.bin/mg/paragraph.c
72
gotoeop(int f, int n)
usr.bin/mg/paragraph.c
76
return(do_gotoeop(f, n, &i));
usr.bin/mg/paragraph.c
80
do_gotoeop(int f, int n, int *i)
usr.bin/mg/paragraph.c
85
if (n < 0)
usr.bin/mg/paragraph.c
86
return (gotobop(f, -n));
usr.bin/mg/paragraph.c
89
while (n-- > 0) {
usr.bin/mg/re_search.c
102
re_searchagain(int f, int n)
usr.bin/mg/re_search.c
136
re_queryrepl(int f, int n)
usr.bin/mg/re_search.c
213
re_repl(int f, int n)
usr.bin/mg/re_search.c
501
setcasefold(int f, int n)
usr.bin/mg/re_search.c
523
delmatchlines(int f, int n)
usr.bin/mg/re_search.c
539
delnonmatchlines(int f, int n)
usr.bin/mg/re_search.c
55
re_forwsearch(int f, int n)
usr.bin/mg/re_search.c
598
cntmatchlines(int f, int n)
usr.bin/mg/re_search.c
613
cntnonmatchlines(int f, int n)
usr.bin/mg/re_search.c
78
re_backsearch(int f, int n)
usr.bin/mg/region.c
114
lowerregion(int f, int n)
usr.bin/mg/region.c
157
upperregion(int f, int n)
usr.bin/mg/region.c
285
prefixregion(int f, int n)
usr.bin/mg/region.c
331
setprefix(int f, int n)
usr.bin/mg/region.c
398
markbuffer(int f, int n)
usr.bin/mg/region.c
400
if (gotoeob(f,n) == FALSE)
usr.bin/mg/region.c
402
(void) clearmark(f, n);
usr.bin/mg/region.c
403
if (gotobob(f,n) == FALSE)
usr.bin/mg/region.c
412
piperegion(int f, int n)
usr.bin/mg/region.c
43
killregion(int f, int n)
usr.bin/mg/region.c
442
if (n > 1) {
usr.bin/mg/region.c
456
shellcommand(int f, int n)
usr.bin/mg/region.c
461
if (n > 1)
usr.bin/mg/region.c
69
copyregion(int f, int n)
usr.bin/mg/search.c
103
searchagain(int f, int n)
usr.bin/mg/search.c
131
forwisearch(int f, int n)
usr.bin/mg/search.c
135
return (forwsearch(f,n));
usr.bin/mg/search.c
145
backisearch(int f, int n)
usr.bin/mg/search.c
149
return (backsearch(f,n));
usr.bin/mg/search.c
557
queryrepl(int f, int n)
usr.bin/mg/search.c
60
forwsearch(int f, int n)
usr.bin/mg/search.c
638
replstr(int f, int n)
usr.bin/mg/search.c
82
backsearch(int f, int n)
usr.bin/mg/search.c
855
zaptochar(int f, int n)
usr.bin/mg/search.c
857
return (zap(TRUE, n));
usr.bin/mg/search.c
862
zapuptochar(int f, int n)
usr.bin/mg/search.c
864
return (zap(FALSE, n));
usr.bin/mg/search.c
873
zap(int including, int n)
usr.bin/mg/search.c
877
backward = n < 0;
usr.bin/mg/search.c
879
n = -n;
usr.bin/mg/search.c
891
if (n == 0)
usr.bin/mg/search.c
898
while (n--) {
usr.bin/mg/spawn.c
24
spawncli(int f, int n)
usr.bin/mg/tags.c
107
findtag(int f, int n)
usr.bin/mg/tags.c
113
if (curtoken(f, n, dtok) == FALSE) {
usr.bin/mg/tags.c
134
if ((ret = tagsvisit(f, n)) != TRUE)
usr.bin/mg/tags.c
220
poptag(int f, int n)
usr.bin/mg/tags.c
428
curtoken(int f, int n, char *token)
usr.bin/mg/tags.c
450
if ((r = backword(f, n)) == FALSE)
usr.bin/mg/tags.c
455
if ((r = forwword(f, n)) == FALSE)
usr.bin/mg/tags.c
70
tagsvisit(int f, int n)
usr.bin/mg/undo.c
172
undo_enable(int f, int n)
usr.bin/mg/undo.c
177
undo_enable_flag = n > 0;
usr.bin/mg/undo.c
195
undo_boundary_enable(int f, int n)
usr.bin/mg/undo.c
205
boundary_flag = n > 0;
usr.bin/mg/undo.c
221
undo_add_boundary(int f, int n)
usr.bin/mg/undo.c
385
undo_dump(int f, int n)
usr.bin/mg/undo.c
482
undo(int f, int n)
usr.bin/mg/undo.c
491
if (n < 0)
usr.bin/mg/undo.c
503
while (n--) {
usr.bin/mg/util.c
136
twiddle(int f, int n)
usr.bin/mg/util.c
141
if (n == 0)
usr.bin/mg/util.c
189
openline(int f, int n)
usr.bin/mg/util.c
193
if (n < 0)
usr.bin/mg/util.c
195
if (n == 0)
usr.bin/mg/util.c
200
i = n;
usr.bin/mg/util.c
207
s = backchar(f | FFRAND, n);
usr.bin/mg/util.c
216
enewline(int f, int n)
usr.bin/mg/util.c
220
if (n < 0)
usr.bin/mg/util.c
223
while (n--) {
usr.bin/mg/util.c
239
deblank(int f, int n)
usr.bin/mg/util.c
262
justone(int f, int n)
usr.bin/mg/util.c
265
(void)delwhite(f, n);
usr.bin/mg/util.c
275
delwhite(int f, int n)
usr.bin/mg/util.c
303
delleadwhite(int f, int n)
usr.bin/mg/util.c
329
deltrailwhite(int f, int n)
usr.bin/mg/util.c
353
int n;
usr.bin/mg/util.c
357
if ((n = cols / curbp->b_tabw) != 0 && linsert(n, '\t') == FALSE)
usr.bin/mg/util.c
359
if ((n = cols % curbp->b_tabw) != 0 && linsert(n, ' ') == FALSE)
usr.bin/mg/util.c
373
lfindent(int f, int n)
usr.bin/mg/util.c
378
if (n < 0)
usr.bin/mg/util.c
382
while (n--) {
usr.bin/mg/util.c
410
indent(int f, int n)
usr.bin/mg/util.c
414
if (n < 0)
usr.bin/mg/util.c
426
if (doindent(n) == FALSE)
usr.bin/mg/util.c
43
showcpos(int f, int n)
usr.bin/mg/util.c
442
forwdel(int f, int n)
usr.bin/mg/util.c
444
if (n < 0)
usr.bin/mg/util.c
445
return (backdel(f | FFRAND, -n));
usr.bin/mg/util.c
454
return (ldelete((RSIZE) n, (f & FFARG) ? KFORW : KNONE));
usr.bin/mg/util.c
463
backdel(int f, int n)
usr.bin/mg/util.c
467
if (n < 0)
usr.bin/mg/util.c
468
return (forwdel(f | FFRAND, -n));
usr.bin/mg/util.c
476
if ((s = backchar(f | FFRAND, n)) == TRUE)
usr.bin/mg/util.c
477
s = ldelete((RSIZE)n, (f & FFARG) ? KFORW : KNONE);
usr.bin/mg/util.c
483
space_to_tabstop(int f, int n)
usr.bin/mg/util.c
487
if (n < 0)
usr.bin/mg/util.c
489
if (n == 0)
usr.bin/mg/util.c
493
while (n-- > 0)
usr.bin/mg/util.c
502
backtoindent(int f, int n)
usr.bin/mg/util.c
517
joinline(int f, int n)
usr.bin/mg/version.c
23
showversion(int f, int n)
usr.bin/mg/window.c
110
nextwind(int f, int n)
usr.bin/mg/window.c
128
prevwind(int f, int n)
usr.bin/mg/window.c
151
onlywind(int f, int n)
usr.bin/mg/window.c
205
splitwind(int f, int n)
usr.bin/mg/window.c
283
wp->w_flag = n;
usr.bin/mg/window.c
295
enlargewind(int f, int n)
usr.bin/mg/window.c
301
if (n < 0)
usr.bin/mg/window.c
302
return (shrinkwind(f, -n));
usr.bin/mg/window.c
313
if (adjwp->w_ntrows <= n) {
usr.bin/mg/window.c
322
for (i = 0; i < n && lp != adjwp->w_bufp->b_headp; ++i)
usr.bin/mg/window.c
325
adjwp->w_toprow += n;
usr.bin/mg/window.c
329
for (i = 0; i < n && lback(lp) != curbp->b_headp; ++i)
usr.bin/mg/window.c
332
curwp->w_toprow -= n;
usr.bin/mg/window.c
334
curwp->w_ntrows += n;
usr.bin/mg/window.c
335
adjwp->w_ntrows -= n;
usr.bin/mg/window.c
346
shrinkwind(int f, int n)
usr.bin/mg/window.c
352
if (n < 0)
usr.bin/mg/window.c
353
return (enlargewind(f, -n));
usr.bin/mg/window.c
363
if (!(f & FFRAND) && curwp->w_ntrows <= n) {
usr.bin/mg/window.c
377
for (i = 0; i < n && lback(lp) != adjwp->w_bufp->b_headp; ++i)
usr.bin/mg/window.c
380
adjwp->w_toprow -= n;
usr.bin/mg/window.c
384
for (i = 0; i < n && lp != curbp->b_headp; ++i)
usr.bin/mg/window.c
387
curwp->w_toprow += n;
usr.bin/mg/window.c
389
curwp->w_ntrows -= n;
usr.bin/mg/window.c
390
adjwp->w_ntrows += n;
usr.bin/mg/window.c
401
delwind(int f, int n)
usr.bin/mg/window.c
46
reposition(int f, int n)
usr.bin/mg/window.c
48
curwp->w_frame = (f & FFARG) ? (n >= 0 ? n + 1 : n) : 0;
usr.bin/mg/window.c
69
redraw(int f, int n)
usr.bin/mg/window.c
71
return (do_redraw(f, n, FALSE));
usr.bin/mg/window.c
75
do_redraw(int f, int n, int force)
usr.bin/mg/word.c
121
while (n-- > 0) {
usr.bin/mg/word.c
235
upperword(int f, int n)
usr.bin/mg/word.c
248
if (n < 0)
usr.bin/mg/word.c
250
while (n--) {
usr.bin/mg/word.c
277
lowerword(int f, int n)
usr.bin/mg/word.c
28
backword(int f, int n)
usr.bin/mg/word.c
289
if (n < 0)
usr.bin/mg/word.c
291
while (n--) {
usr.bin/mg/word.c
30
if (n < 0)
usr.bin/mg/word.c
31
return (forwword(f | FFRAND, -n));
usr.bin/mg/word.c
320
capword(int f, int n)
usr.bin/mg/word.c
333
if (n < 0)
usr.bin/mg/word.c
335
while (n--) {
usr.bin/mg/word.c
34
while (n--) {
usr.bin/mg/word.c
398
delfword(int f, int n)
usr.bin/mg/word.c
412
if (n < 0)
usr.bin/mg/word.c
424
while (n--) {
usr.bin/mg/word.c
454
delbword(int f, int n)
usr.bin/mg/word.c
467
if (n < 0)
usr.bin/mg/word.c
480
while (n--) {
usr.bin/mg/word.c
52
forwword(int f, int n)
usr.bin/mg/word.c
54
if (n < 0)
usr.bin/mg/word.c
55
return (backword(f | FFRAND, -n));
usr.bin/mg/word.c
56
while (n--) {
usr.bin/mg/word.c
76
transposeword(int f, int n)
usr.bin/mg/word.c
93
if (n == 0)
usr.bin/mg/word.c
96
n = 1; /* remove this line to allow muliple-iterations */
usr.bin/mg/yank.c
104
kremove(int n)
usr.bin/mg/yank.c
106
if (n < 0 || n + kstart >= kused)
usr.bin/mg/yank.c
108
return (CHARMASK(kbufp[n + kstart]));
usr.bin/mg/yank.c
152
killline(int f, int n)
usr.bin/mg/yank.c
173
} else if (n > 0) {
usr.bin/mg/yank.c
180
i = n;
usr.bin/mg/yank.c
193
i = n;
usr.bin/mg/yank.c
223
yank(int f, int n)
usr.bin/mg/yank.c
228
if (n < 0)
usr.bin/mg/yank.c
235
while (n--) {
usr.bin/midicat/midicat.c
151
n = write(ofd, buf, len);
usr.bin/midicat/midicat.c
152
if (n != len) {
usr.bin/midicat/midicat.c
157
n = mio_write(oh, buf, len);
usr.bin/midicat/midicat.c
158
if (n != len) {
usr.bin/midicat/midicat.c
35
int dump, c, i, len, n, sep, mode;
usr.bin/mixerctl/mixerctl.c
110
for (n = i = 0; i < p->infp->un.s.num_mem; i++)
usr.bin/mixerctl/mixerctl.c
112
printf("%s%s", n++ ? "," : "",
usr.bin/mixerctl/mixerctl.c
92
int i, n;
usr.bin/mklocale/yacc.y
564
int x, n;
usr.bin/mklocale/yacc.y
647
for (list = types.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
656
err(1, "writing runetype_ext #%d to %s", n, locale_file);
usr.bin/mklocale/yacc.y
661
for (list = maplower.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
670
err(1, "writing maplower_ext #%d to %s", n, locale_file);
usr.bin/mklocale/yacc.y
675
for (list = mapupper.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
684
err(1, "writing mapupper_ext #%d to %s", n, locale_file);
usr.bin/mklocale/yacc.y
689
for (list = types.root, n = 0; list != NULL; list = list->next, n++) {
usr.bin/mklocale/yacc.y
697
err(1, "writing runetype_ext table #%d to %s", n, locale_file);
usr.bin/nc/atomicio.c
39
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
usr.bin/nc/atomicio.c
48
while (n > pos) {
usr.bin/nc/atomicio.c
49
res = (f) (fd, s + pos, n - pos);
usr.bin/nc/netcat.c
1112
int n, num_fds;
usr.bin/nc/netcat.c
1166
for (n = 0; n < 4; n++) {
usr.bin/nc/netcat.c
1167
if (pfd[n].revents & (POLLERR|POLLNVAL)) {
usr.bin/nc/netcat.c
1168
pfd[n].fd = -1;
usr.bin/nc/netcat.c
1300
ssize_t n;
usr.bin/nc/netcat.c
1307
n = tls_write(tls, buf, *bufpos);
usr.bin/nc/netcat.c
1308
if (n == -1)
usr.bin/nc/netcat.c
1311
n = write(fd, buf, *bufpos);
usr.bin/nc/netcat.c
1313
if (n == -1 && (errno == EAGAIN || errno == EINTR))
usr.bin/nc/netcat.c
1314
n = TLS_WANT_POLLOUT;
usr.bin/nc/netcat.c
1316
if (n <= 0)
usr.bin/nc/netcat.c
1317
return n;
usr.bin/nc/netcat.c
1319
adjust = *bufpos - n;
usr.bin/nc/netcat.c
1321
memmove(buf, buf + n, adjust);
usr.bin/nc/netcat.c
1322
*bufpos -= n;
usr.bin/nc/netcat.c
1323
return n;
usr.bin/nc/netcat.c
1330
ssize_t n;
usr.bin/nc/netcat.c
1336
n = tls_read(tls, buf + *bufpos, num);
usr.bin/nc/netcat.c
1337
if (n == -1)
usr.bin/nc/netcat.c
1340
n = read(fd, buf + *bufpos, num);
usr.bin/nc/netcat.c
1342
if (n == -1 && (errno == EAGAIN || errno == EINTR))
usr.bin/nc/netcat.c
1343
n = TLS_WANT_POLLIN;
usr.bin/nc/netcat.c
1345
if (n <= 0)
usr.bin/nc/netcat.c
1346
return n;
usr.bin/nc/netcat.c
1347
*bufpos += n;
usr.bin/nc/netcat.c
1348
return n;
usr.bin/nc/netcat.c
1469
char *n;
usr.bin/nc/netcat.c
1473
if (isdigit((unsigned char)*p) && (n = strchr(p, '-')) != NULL) {
usr.bin/nc/netcat.c
1474
*n = '\0';
usr.bin/nc/netcat.c
1475
n++;
usr.bin/nc/netcat.c
1478
hi = strtoport(n, uflag);
usr.bin/netstat/if.c
202
int m, n;
usr.bin/netstat/if.c
214
n = strlen(cp) < 11 ? 11 : strlen(cp);
usr.bin/netstat/if.c
216
n = 11;
usr.bin/netstat/if.c
217
printf("%-*.*s ", n, n, cp);
usr.bin/netstat/if.c
220
n = strlen(cp) < 17 ? 17 : strlen(cp);
usr.bin/netstat/if.c
222
n = 17;
usr.bin/netstat/if.c
223
printf("%-*.*s ", n, n, cp);
usr.bin/netstat/if.c
241
n = strlen(cp) < 11 ? 11 : strlen(cp);
usr.bin/netstat/if.c
243
n = 11;
usr.bin/netstat/if.c
244
printf("%-*.*s ", n, n, cp);
usr.bin/netstat/if.c
247
n = strlen(cp) < 17 ? 17 : strlen(cp);
usr.bin/netstat/if.c
249
n = 17;
usr.bin/netstat/if.c
250
printf("%-*.*s ", n, n, cp);
usr.bin/netstat/if.c
263
n = sdl->sdl_alen;
usr.bin/netstat/if.c
271
n = cp - sa->sa_data + 1;
usr.bin/netstat/if.c
274
while (--n >= 0)
usr.bin/netstat/if.c
276
n > 0 ? '.' : ' ');
usr.bin/netstat/inet.c
828
struct rpcnams *n;
usr.bin/netstat/inet.c
849
n = malloc(sizeof(struct rpcnams));
usr.bin/netstat/inet.c
850
if (n == NULL)
usr.bin/netstat/inet.c
852
n->next = rpcn;
usr.bin/netstat/inet.c
853
rpcn = n;
usr.bin/netstat/inet.c
854
n->port = head->pml_map.pm_port;
usr.bin/netstat/inet.c
855
n->proto = head->pml_map.pm_prot;
usr.bin/netstat/inet.c
859
n->rpcname = strdup(rpc->r_name);
usr.bin/netstat/inet.c
863
n->rpcname = strdup(num);
usr.bin/netstat/inet.c
869
for (n = rpcn; n; n = n->next)
usr.bin/netstat/inet.c
870
if (n->port == port && n->proto == proto)
usr.bin/netstat/inet.c
871
return (n->rpcname);
usr.bin/netstat/inet6.c
331
const char *n;
usr.bin/netstat/inet6.c
379
n = NULL;
usr.bin/netstat/inet6.c
381
n = ip6nh[i];
usr.bin/netstat/inet6.c
383
n = ep->p_name;
usr.bin/netstat/inet6.c
384
if (n)
usr.bin/netstat/inet6.c
385
printf("\t\t%s: %llu\n", n,
usr.bin/netstat/main.c
413
plural(u_int64_t n)
usr.bin/netstat/main.c
415
return (n != 1 ? "s" : "");
usr.bin/netstat/main.c
419
plurales(u_int64_t n)
usr.bin/netstat/main.c
421
return (n != 1 ? "es" : "");
usr.bin/netstat/main.c
425
pluralys(u_int64_t n)
usr.bin/netstat/main.c
427
return (n != 1 ? "ies" : "y");
usr.bin/netstat/show.c
63
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
usr.bin/newsyslog/newsyslog.c
1137
size_t n;
usr.bin/newsyslog/newsyslog.c
1139
n = strlcat(file, suffix, size);
usr.bin/newsyslog/newsyslog.c
1140
if (n < size && func(file, sp) == 0)
usr.bin/newsyslog/newsyslog.c
1142
file[n - strlen(suffix)] = '\0';
usr.bin/openssl/apps.c
1080
const char *n;
usr.bin/openssl/apps.c
1082
n = a[DB_serial];
usr.bin/openssl/apps.c
1083
while (*n == '0')
usr.bin/openssl/apps.c
1084
n++;
usr.bin/openssl/apps.c
1085
return (lh_strhash(n));
usr.bin/openssl/apps.c
1179
int ret = 0, n;
usr.bin/openssl/apps.c
1183
n = strlcpy(serialpath, serialfile, sizeof serialpath);
usr.bin/openssl/apps.c
1185
n = snprintf(serialpath, sizeof serialpath, "%s.%s",
usr.bin/openssl/apps.c
1187
if (n < 0 || n >= sizeof(serialpath)) {
usr.bin/openssl/apps.c
2156
int *n = arg;
usr.bin/openssl/apps.c
2161
fprintf(stderr, " -%-24s%s", name->name, (++*n % 3 != 0 ? "" : "\n"));
usr.bin/openssl/ca.c
1735
X509_NAME *n = parse_name(subj, chtype, multirdn);
usr.bin/openssl/ca.c
1737
if (n == NULL) {
usr.bin/openssl/ca.c
1741
if (!X509_REQ_set_subject_name(req, n)) {
usr.bin/openssl/ca.c
1742
X509_NAME_free(n);
usr.bin/openssl/ca.c
1745
X509_NAME_free(n);
usr.bin/openssl/certhash.c
475
int n;
usr.bin/openssl/certhash.c
484
n = readlink(dep->d_name, target, sizeof(target) - 1);
usr.bin/openssl/certhash.c
485
if (n == -1) {
usr.bin/openssl/certhash.c
489
if (n >= sizeof(target) - 1) {
usr.bin/openssl/certhash.c
493
target[n] = '\0';
usr.bin/openssl/crl.c
381
unsigned int n;
usr.bin/openssl/crl.c
384
if (!X509_CRL_digest(x, digest, md, &n)) {
usr.bin/openssl/crl.c
390
for (j = 0; j < (int) n; j++) {
usr.bin/openssl/crl.c
392
(j + 1 == (int)n) ? '\n' : ':');
usr.bin/openssl/dhparam.c
227
static int dh_cb(int p, int n, BN_GENCB *cb);
usr.bin/openssl/dhparam.c
429
dh_cb(int p, int n, BN_GENCB *cb)
usr.bin/openssl/dsa.c
215
int n = 0;
usr.bin/openssl/dsa.c
226
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
usr.bin/openssl/dsaparam.c
152
static int dsa_cb(int p, int n, BN_GENCB *cb);
usr.bin/openssl/dsaparam.c
297
dsa_cb(int p, int n, BN_GENCB *cb)
usr.bin/openssl/ec.c
244
int n = 0;
usr.bin/openssl/ec.c
256
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
usr.bin/openssl/ecparam.c
291
size_t n = 0;
usr.bin/openssl/ecparam.c
303
for (n = 0; n < crv_len; n++) {
usr.bin/openssl/ecparam.c
306
comment = curves[n].comment;
usr.bin/openssl/ecparam.c
307
sname = OBJ_nid2sn(curves[n].nid);
usr.bin/openssl/enc.c
312
int n = 0;
usr.bin/openssl/enc.c
324
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, skip_aead_and_xts, &n);
usr.bin/openssl/enc.c
427
unsigned long n;
usr.bin/openssl/enc.c
430
for (n = 0; *p != '\0'; p++) {
usr.bin/openssl/enc.c
433
n = n * 10 + i - '0';
usr.bin/openssl/enc.c
435
n *= 1024;
usr.bin/openssl/enc.c
445
if (cfg.base64 && n < 80)
usr.bin/openssl/enc.c
446
n = 80;
usr.bin/openssl/enc.c
448
bsize = (int)n;
usr.bin/openssl/enc.c
753
int i, n;
usr.bin/openssl/enc.c
756
n = strlen(in);
usr.bin/openssl/enc.c
757
if (n > (size * 2)) {
usr.bin/openssl/enc.c
762
for (i = 0; i < n; i++) {
usr.bin/openssl/gendh.c
203
dh_cb(int p, int n, BN_GENCB *cb)
usr.bin/openssl/gendh.c
87
static int dh_cb(int p, int n, BN_GENCB *cb);
usr.bin/openssl/genrsa.c
375
genrsa_cb(int p, int n, BN_GENCB *cb)
usr.bin/openssl/genrsa.c
86
static int genrsa_cb(int p, int n, BN_GENCB *cb);
usr.bin/openssl/passwd.c
305
int n;
usr.bin/openssl/passwd.c
357
n = passwd_len;
usr.bin/openssl/passwd.c
358
while (n) {
usr.bin/openssl/passwd.c
359
if (!EVP_DigestUpdate(md, (n & 1) ? "\0" : passwd, 1))
usr.bin/openssl/passwd.c
361
n >>= 1;
usr.bin/openssl/pkey.c
186
int n = 0;
usr.bin/openssl/pkey.c
198
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
usr.bin/openssl/req.c
1053
const BIGNUM *n = NULL;
usr.bin/openssl/req.c
1055
RSA_get0_key(EVP_PKEY_get0_RSA(tpubkey), &n, NULL, NULL);
usr.bin/openssl/req.c
1057
BN_print(out, n);
usr.bin/openssl/req.c
118
static int add_DN_object(X509_NAME * n, char *text, const char *def, char *value,
usr.bin/openssl/req.c
1194
X509_NAME *n;
usr.bin/openssl/req.c
1196
if (!(n = parse_name(subject, chtype, multirdn)))
usr.bin/openssl/req.c
1199
if (!X509_REQ_set_subject_name(req, n)) {
usr.bin/openssl/req.c
1200
X509_NAME_free(n);
usr.bin/openssl/req.c
1203
X509_NAME_free(n);
usr.bin/openssl/req.c
1449
add_DN_object(X509_NAME * n, char *text, const char *def, char *value,
usr.bin/openssl/req.c
1491
if (!X509_NAME_add_entry_by_NID(n, nid, chtype,
usr.bin/openssl/rsa.c
232
int n = 0;
usr.bin/openssl/rsa.c
244
OBJ_NAME_do_all_sorted(OBJ_NAME_TYPE_CIPHER_METH, show_cipher, &n);
usr.bin/openssl/s_server.c
1736
int len, n;
usr.bin/openssl/s_server.c
1739
n = write(fileno(stdout), buf + len, i - len);
usr.bin/openssl/s_server.c
1740
} while (n == -1 && errno == EINTR);
usr.bin/openssl/s_server.c
1742
if (n == -1) {
usr.bin/openssl/s_server.c
1746
len += n;
usr.bin/openssl/speed.c
2734
int n;
usr.bin/openssl/speed.c
2745
for (n = 0; n < multi; ++n) {
usr.bin/openssl/speed.c
2754
fds[n] = fd[0];
usr.bin/openssl/speed.c
2768
printf("Forked child %d\n", n);
usr.bin/openssl/speed.c
2772
for (n = 0; n < multi; ++n) {
usr.bin/openssl/speed.c
2777
f = fdopen(fds[n], "r");
usr.bin/openssl/speed.c
2784
buf, n);
usr.bin/openssl/speed.c
2787
printf("Got: %s from %d\n", buf, n);
usr.bin/openssl/speed.c
2808
if (n)
usr.bin/openssl/speed.c
2814
if (n)
usr.bin/openssl/speed.c
2828
if (n)
usr.bin/openssl/speed.c
2834
if (n)
usr.bin/openssl/speed.c
2848
if (n)
usr.bin/openssl/speed.c
2854
if (n)
usr.bin/openssl/speed.c
2868
if (n)
usr.bin/openssl/speed.c
2874
if (n)
usr.bin/openssl/speed.c
2888
if (n)
usr.bin/openssl/speed.c
2895
fprintf(stderr, "Unknown type '%s' from child %d\n", buf, n);
usr.bin/openssl/x509.c
1139
const BIGNUM *n = NULL;
usr.bin/openssl/x509.c
1141
RSA_get0_key(rsa, &n, NULL, NULL);
usr.bin/openssl/x509.c
1142
BN_print(out, n);
usr.bin/openssl/x509.c
1190
unsigned int n;
usr.bin/openssl/x509.c
1197
if (!X509_digest(x, fdig, md, &n)) {
usr.bin/openssl/x509.c
1203
for (j = 0; j < (int) n; j++) {
usr.bin/openssl/x509.c
1205
(j + 1 == (int)n) ? '\n' : ':');
usr.bin/patch/pch.c
1198
LINENUM n;
usr.bin/patch/pch.c
1234
n = p_end - i + 1;
usr.bin/patch/pch.c
1236
n = -i;
usr.bin/patch/pch.c
1237
p_efake += n;
usr.bin/patch/pch.c
1238
p_bfake += n;
usr.bin/patch/pch.c
1240
for (n = 0; i <= p_end; i++, n++) {
usr.bin/patch/pch.c
1241
p_line[n] = tp_line[i];
usr.bin/patch/pch.c
1242
p_char[n] = tp_char[i];
usr.bin/patch/pch.c
1243
if (p_char[n] == '+')
usr.bin/patch/pch.c
1244
p_char[n] = '-';
usr.bin/patch/pch.c
1245
p_len[n] = tp_len[i];
usr.bin/patch/pch.c
1249
p_line[n] = tp_line[i];
usr.bin/patch/pch.c
1250
p_char[n] = tp_char[i];
usr.bin/patch/pch.c
1251
p_len[n] = tp_len[i];
usr.bin/patch/pch.c
1252
n++;
usr.bin/patch/pch.c
1271
for (i = 0; n <= p_end; i++, n++) {
usr.bin/patch/pch.c
1272
p_line[n] = tp_line[i];
usr.bin/patch/pch.c
1273
p_char[n] = tp_char[i];
usr.bin/patch/pch.c
1274
if (p_char[n] == '-')
usr.bin/patch/pch.c
1275
p_char[n] = '+';
usr.bin/patch/pch.c
1276
p_len[n] = tp_len[i];
usr.bin/patch/pch.c
1484
size_t n;
usr.bin/patch/pch.c
1487
for (n = 0, cp = path; (cp = strchr(cp, '/')) != NULL; n++) {
usr.bin/patch/pch.c
1492
return n;
usr.bin/pctr/pctr.c
316
int i, n;
usr.bin/pctr/pctr.c
322
n = PCTR_INTEL_NUM;
usr.bin/pctr/pctr.c
325
n = PCTR_AMD_NUM;
usr.bin/pctr/pctr.c
326
for (i = 0; i < n; i++)
usr.bin/pkgconf/cli/main.c
725
pkgconf_node_t *n;
usr.bin/pkgconf/cli/main.c
735
PKGCONF_FOREACH_LIST_ENTRY(pkg->required.head, n)
usr.bin/pkgconf/cli/main.c
737
pkgconf_dependency_t *dep = n->data;
usr.bin/pkgconf/cli/main.c
970
pkgconf_node_t *n;
usr.bin/pkgconf/cli/main.c
978
PKGCONF_FOREACH_LIST_ENTRY(p->dir_list.head, n)
usr.bin/pkgconf/cli/main.c
980
pkgconf_path_t *pn = n->data;
usr.bin/pkgconf/cli/main.c
986
PKGCONF_FOREACH_LIST_ENTRY(p->filter_includedirs.head, n)
usr.bin/pkgconf/cli/main.c
988
pkgconf_path_t *pn = n->data;
usr.bin/pkgconf/cli/main.c
994
PKGCONF_FOREACH_LIST_ENTRY(p->filter_libdirs.head, n)
usr.bin/pkgconf/cli/main.c
996
pkgconf_path_t *pn = n->data;
usr.bin/pkgconf/libpkgconf/bsdstubs.c
167
reallocarray(void *ptr, size_t m, size_t n)
usr.bin/pkgconf/libpkgconf/bsdstubs.c
169
if (n && m > -1 / n)
usr.bin/pkgconf/libpkgconf/bsdstubs.c
175
return realloc(ptr, m * n);
usr.bin/pkgconf/libpkgconf/bsdstubs.c
180
pkgconf_reallocarray(void *ptr, size_t m, size_t n)
usr.bin/pkgconf/libpkgconf/bsdstubs.c
182
return reallocarray(ptr, m, n);
usr.bin/pkgconf/libpkgconf/bsdstubs.c
40
size_t n = siz;
usr.bin/pkgconf/libpkgconf/bsdstubs.c
43
if (n != 0) {
usr.bin/pkgconf/libpkgconf/bsdstubs.c
44
while (--n != 0) {
usr.bin/pkgconf/libpkgconf/bsdstubs.c
51
if (n == 0) {
usr.bin/pkgconf/libpkgconf/bsdstubs.c
75
size_t n = siz;
usr.bin/pkgconf/libpkgconf/bsdstubs.c
79
while (n-- != 0 && *d != '\0')
usr.bin/pkgconf/libpkgconf/bsdstubs.c
82
n = siz - dlen;
usr.bin/pkgconf/libpkgconf/bsdstubs.c
84
if (n == 0)
usr.bin/pkgconf/libpkgconf/bsdstubs.c
87
if (n != 1) {
usr.bin/pkgconf/libpkgconf/bsdstubs.c
89
n--;
usr.bin/pkgconf/libpkgconf/bsdstubs.h
28
PKGCONF_API extern void *pkgconf_reallocarray(void *ptr, size_t m, size_t n);
usr.bin/pkgconf/libpkgconf/client.c
37
const pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/client.c
40
PKGCONF_FOREACH_LIST_ENTRY(list->head, n)
usr.bin/pkgconf/libpkgconf/client.c
42
const pkgconf_path_t *p = n->data;
usr.bin/pkgconf/libpkgconf/dependency.c
59
const pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/dependency.c
61
PKGCONF_FOREACH_LIST_ENTRY(list->head, n)
usr.bin/pkgconf/libpkgconf/dependency.c
63
pkgconf_dependency_t *dep2 = n->data;
usr.bin/pkgconf/libpkgconf/path.c
230
pkgconf_node_t *n = NULL;
usr.bin/pkgconf/libpkgconf/path.c
238
PKGCONF_FOREACH_LIST_ENTRY(dirlist->head, n)
usr.bin/pkgconf/libpkgconf/path.c
240
pkgconf_path_t *pnode = n->data;
usr.bin/pkgconf/libpkgconf/path.c
263
pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/path.c
265
PKGCONF_FOREACH_LIST_ENTRY(src->head, n)
usr.bin/pkgconf/libpkgconf/path.c
267
pkgconf_path_t *srcpath = n->data, *path;
usr.bin/pkgconf/libpkgconf/path.c
294
pkgconf_node_t *n, *tn;
usr.bin/pkgconf/libpkgconf/path.c
296
PKGCONF_FOREACH_LIST_ENTRY_SAFE(dirlist->head, tn, n)
usr.bin/pkgconf/libpkgconf/path.c
298
pkgconf_path_t *pnode = n->data;
usr.bin/pkgconf/libpkgconf/path.c
32
pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/path.c
34
PKGCONF_FOREACH_LIST_ENTRY(dirlist->head, n)
usr.bin/pkgconf/libpkgconf/path.c
36
pkgconf_path_t *pn = n->data;
usr.bin/pkgconf/libpkgconf/personality.c
289
pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/personality.c
318
PKGCONF_FOREACH_LIST_ENTRY(plist.head, n)
usr.bin/pkgconf/libpkgconf/personality.c
320
pkgconf_path_t *pn = n->data;
usr.bin/pkgconf/libpkgconf/personality.c
331
PKGCONF_FOREACH_LIST_ENTRY(plist.head, n)
usr.bin/pkgconf/libpkgconf/personality.c
333
pkgconf_path_t *pn = n->data;
usr.bin/pkgconf/libpkgconf/pkg.c
774
pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/pkg.c
777
PKGCONF_FOREACH_LIST_ENTRY(client->dir_list.head, n)
usr.bin/pkgconf/libpkgconf/pkg.c
779
pkgconf_path_t *pnode = n->data;
usr.bin/pkgconf/libpkgconf/pkg.c
844
pkgconf_node_t *n;
usr.bin/pkgconf/libpkgconf/pkg.c
882
PKGCONF_FOREACH_LIST_ENTRY(client->dir_list.head, n)
usr.bin/pkgconf/libpkgconf/pkg.c
884
pkgconf_path_t *pnode = n->data;
usr.bin/rcs/diff.c
478
equiv(struct line *a, int n, struct line *b, int m, int *c)
usr.bin/rcs/diff.c
483
while (i <= n && j <= m) {
usr.bin/rcs/diff.c
491
while (i <= n)
usr.bin/rcs/diff.c
507
isqrt(int n)
usr.bin/rcs/diff.c
511
if (n == 0)
usr.bin/rcs/diff.c
516
x = n / x;
usr.bin/rcs/diff.c
525
stone(int *a, int n, int *b, int *c, int flags)
usr.bin/rcs/diff.c
534
sq = isqrt(n);
usr.bin/rcs/diff.c
540
for (i = 1; i <= n; i++) {
usr.bin/rcs/diff.c
732
sort(struct line *a, int n)
usr.bin/rcs/diff.c
737
if (n == 0)
usr.bin/rcs/diff.c
739
for (j = 1; j <= n; j *= 2)
usr.bin/rcs/diff.c
742
k = n - m;
usr.bin/rcs/diff3.c
379
ssize_t m, n;
usr.bin/rcs/diff3.c
400
if ((n = readin(argv[1], &d23)) < 0) {
usr.bin/rcs/diff3.c
411
return (merge(m, n));
usr.bin/rcs/diff3.c
605
get_line(FILE *b, size_t *n)
usr.bin/rcs/diff3.c
626
if (n != NULL)
usr.bin/rcs/diff3.c
627
*n = len;
usr.bin/rcs/diff3.c
808
size_t j, n;
usr.bin/rcs/diff3.c
811
for (n = 0; cline[i] < from - 1; n += j) {
usr.bin/rcs/diff3.c
818
return ((int) n);
usr.bin/rcs/diff3.c
886
edscript(int n)
usr.bin/rcs/diff3.c
891
for (; n > 0; n--) {
usr.bin/rcs/diff3.c
892
if (!oflag || !overlap[n])
usr.bin/rcs/diff3.c
893
prange(&de[n].old);
usr.bin/rcs/diff3.c
895
diff_output("%da\n=======\n", de[n].old.to -1);
usr.bin/rcs/diff3.c
896
(void)fseek(fp[2], (long)de[n].new.from, SEEK_SET);
usr.bin/rcs/diff3.c
897
for (k = de[n].new.to-de[n].new.from; k > 0; k-= j) {
usr.bin/rcs/diff3.c
912
if (!oflag || !overlap[n])
usr.bin/rcs/diff3.c
916
diff_output("%da\n%s\n.\n", de[n].old.from - 1, f1mark);
usr.bin/rcs/rcs.h
106
#define RCSNUM_ISBRANCH(n) ((n)->rn_len % 2)
usr.bin/rcs/rcs.h
107
#define RCSNUM_ISBRANCHREV(n) (!((n)->rn_len % 2) && ((n)->rn_len >= 4))
usr.bin/rcs/rcsclean.c
178
size_t len, n;
usr.bin/rcs/rcsclean.c
183
for (n = 0; n < len; ++n)
usr.bin/rcs/rcsclean.c
184
if (buf_getc(b1, n) != buf_getc(b2, n)) {
usr.bin/rdist/client.c
494
int n;
usr.bin/rdist/client.c
507
n = remline(s = respbuff, sizeof(respbuff), TRUE);
usr.bin/rdist/client.c
508
if (n <= 0) {
usr.bin/rdist/client.c
545
if (n > 0)
usr.bin/rdist/client.c
550
if (n > 0)
usr.bin/rdist/client.c
657
int f, n;
usr.bin/rdist/client.c
686
if ((n = readlink(target, lbuf, sizeof(lbuf)-1)) != -1)
usr.bin/rdist/client.c
687
lbuf[n] = '\0';
usr.bin/rdist/client.c
696
if (n != stb->st_size) {
usr.bin/rdist/client.c
717
n = remline(s = respbuff, sizeof(respbuff), TRUE);
usr.bin/rdist/client.c
718
if (n == -1) /* normal EOF */
usr.bin/rdist/client.c
720
if (n == 0) {
usr.bin/rdist/client.c
734
if (n > 0)
usr.bin/rdist/client.c
739
if (n > 0)
usr.bin/rdist/client.c
778
int done, n;
usr.bin/rdist/client.c
813
n = remline(cp = respbuff, sizeof(respbuff), TRUE);
usr.bin/rdist/client.c
814
if (n <= 0) {
usr.bin/rdist/client.c
870
if (n <= 1 || !S_ISREG(statp->st_mode))
usr.bin/rdist/common.c
525
int n;
usr.bin/rdist/common.c
529
n = remline(s = resp, sizeof(resp), 0);
usr.bin/rdist/common.c
531
n--;
usr.bin/rdist/common.c
537
if (n > 0) {
usr.bin/rdist/common.c
550
n++;
usr.bin/rdist/docmd.c
288
int n;
usr.bin/rdist/docmd.c
335
n = remline(respbuff, sizeof(respbuff), TRUE);
usr.bin/rdist/docmd.c
336
if (n <= 0 || respbuff[0] != S_VERSION) {
usr.bin/rdist/docmd.c
337
if (n > 0)
usr.bin/rdist/docmd.c
419
int n, ddir, destdir;
usr.bin/rdist/docmd.c
477
n = 0;
usr.bin/rdist/docmd.c
481
n++;
usr.bin/rdist/docmd.c
539
if (!n) {
usr.bin/rdist/expand.c
119
int n;
usr.bin/rdist/expand.c
146
for (n = 0; n < eargc; n++) {
usr.bin/rdist/expand.c
148
nl->n_name = eargv[n];
usr.bin/rdist/lookup.c
118
unsigned int n;
usr.bin/rdist/lookup.c
125
n = 0;
usr.bin/rdist/lookup.c
127
n += *cp++;
usr.bin/rdist/lookup.c
128
n %= HASHSIZE;
usr.bin/rdist/lookup.c
130
for (s = hashtab[n]; s != NULL; s = s->s_next) {
usr.bin/rdist/lookup.c
154
s->s_next = hashtab[n];
usr.bin/rdist/lookup.c
155
hashtab[n] = s;
usr.bin/rdistd/server.c
1033
#define PRN(n) ((n[0] == ':') ? n+1 : n)
usr.bin/rdistd/server.c
1658
int n, proto_version;
usr.bin/rdistd/server.c
1704
n = remline(cp = cmdbuf, sizeof(cmdbuf), TRUE);
usr.bin/rdistd/server.c
1705
if (n == -1) /* EOF */
usr.bin/rdistd/server.c
1707
if (n == 0) {
usr.bin/rdistd/server.c
493
int n;
usr.bin/rdistd/server.c
500
n = remline(cp = buf, sizeof(buf), FALSE);
usr.bin/rdistd/server.c
501
if (n <= 0) {
usr.bin/readlink/readlink.c
44
int n, ch, nflag = 0, fflag = 0;
usr.bin/readlink/readlink.c
67
n = strlen(argv[0]);
usr.bin/readlink/readlink.c
68
if (n > PATH_MAX - 1) {
usr.bin/readlink/readlink.c
79
if ((n = readlink(argv[0], buf, sizeof buf-1)) == -1)
usr.bin/readlink/readlink.c
81
buf[n] = '\0';
usr.bin/rs/rs.c
192
int i, j, n;
usr.bin/rs/rs.c
202
for (n = 0, i = 0; i < orows && n < nelem; i++) {
usr.bin/rs/rs.c
204
if (n++ >= nelem)
usr.bin/rs/rs.c
216
int n;
usr.bin/rs/rs.c
218
n = (flags & ONEOSEPONLY ? 1 : colwidths[col] - ep->w);
usr.bin/rs/rs.c
220
while (n-- > 0)
usr.bin/rs/rs.c
223
while (n-- > 0)
usr.bin/rs/rs.c
247
int n;
usr.bin/rs/rs.c
305
n = orows * ocols;
usr.bin/rs/rs.c
306
if (n > nelem && (flags & RECYCLE))
usr.bin/rs/rs.c
307
nelem = n;
usr.bin/rsync/mktemp.c
288
int n, dirlen;
usr.bin/rsync/mktemp.c
293
n = asprintf(ret, "%.*s/.%s.XXXXXXXXXX",
usr.bin/rsync/mktemp.c
295
if (n == -1) {
usr.bin/rsync/mktemp.c
299
} else if ((n = asprintf(ret, ".%s.XXXXXXXXXX", path)) == -1) {
usr.bin/rsync/mktemp.c
304
return n;
usr.bin/script/script.c
193
ssize_t n = write(master, ibuf + off, cc - off);
usr.bin/script/script.c
194
if (n == -1 && errno != EAGAIN)
usr.bin/script/script.c
196
if (n == 0)
usr.bin/script/script.c
198
if (n > 0)
usr.bin/script/script.c
199
off += n;
usr.bin/script/script.c
286
ssize_t n = write(STDOUT_FILENO, obuf + off, cc - off);
usr.bin/script/script.c
287
if (n == -1 && errno != EAGAIN)
usr.bin/script/script.c
289
if (n == 0)
usr.bin/script/script.c
291
if (n > 0)
usr.bin/script/script.c
292
off += n;
usr.bin/sdiff/sdiff.c
614
size_t file1start, file1end, file2start, file2end, n;
usr.bin/sdiff/sdiff.c
765
n = file2end - file2start + 1;
usr.bin/sdiff/sdiff.c
770
n = file1end - file1start + 1 + 1 + file2end - file2start + 1;
usr.bin/sdiff/sdiff.c
775
n = file1end - file1start + 1;
usr.bin/sdiff/sdiff.c
784
while (n--) {
usr.bin/sed/compile.c
553
s->n = 1; /* Default */
usr.bin/sed/compile.c
565
s->n = 0;
usr.bin/sed/compile.c
585
s->n = (int)l;
usr.bin/sed/defs.h
61
int n; /* Occurrence to subst. */
usr.bin/sed/process.c
338
int n, lastempty;
usr.bin/sed/process.c
355
n = cp->u.s->n;
usr.bin/sed/process.c
360
if (n <= 1 && (match[0].rm_so > le))
usr.bin/sed/process.c
366
if (n <= 1) {
usr.bin/sed/process.c
369
if (n == 1)
usr.bin/sed/process.c
370
n = -1;
usr.bin/sed/process.c
376
n--;
usr.bin/sed/process.c
400
} while (n >= 0 && slen >= 0 &&
usr.bin/sed/process.c
404
if (n > 0)
usr.bin/sendbug/atomicio.c
39
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
usr.bin/sendbug/atomicio.c
48
while (n > pos) {
usr.bin/sendbug/atomicio.c
49
res = (f) (fd, s + pos, n - pos);
usr.bin/signify/zsig.c
145
size_t n = 0;
usr.bin/signify/zsig.c
150
n = len >= bufsize ? bufsize : len;
usr.bin/signify/zsig.c
151
memcpy(buffer, residual, n);
usr.bin/signify/zsig.c
152
residual += n;
usr.bin/signify/zsig.c
155
while (n != bufsize) {
usr.bin/signify/zsig.c
156
ssize_t more = read(fdin, buffer+n, bufsize-n);
usr.bin/signify/zsig.c
159
n += more;
usr.bin/signify/zsig.c
163
if (n == 0)
usr.bin/signify/zsig.c
165
SHA512_256Data(buffer, n, output);
usr.bin/signify/zsig.c
173
writeall(fdout, buffer, n, "stdout");
usr.bin/signify/zsig.c
174
if (n != bufsize)
usr.bin/signify/zsig.c
281
size_t n = read(fdin, buffer, bufsize);
usr.bin/signify/zsig.c
282
if (n == -1)
usr.bin/signify/zsig.c
284
if (n == 0)
usr.bin/signify/zsig.c
286
SHA512_256Data(buffer, n, p);
usr.bin/signify/zsig.c
309
size_t n = read(fdin, buffer, bufsize);
usr.bin/signify/zsig.c
310
if (n == -1)
usr.bin/signify/zsig.c
312
if (n == 0)
usr.bin/signify/zsig.c
314
writeall(fdout, buffer, n, sigfile);
usr.bin/signify/zsig.c
63
ssize_t n;
usr.bin/signify/zsig.c
75
n = read(fd, buf+len, sz-len);
usr.bin/signify/zsig.c
76
if (n == -1)
usr.bin/signify/zsig.c
79
if (n == 0)
usr.bin/signify/zsig.c
81
len += n;
usr.bin/skey/skey.c
106
n = strtonum(argv[i], 0, SKEY_MAX_SEQ, &errstr);
usr.bin/skey/skey.c
112
n = strtonum(argv[i], 0, SKEY_MAX_SEQ, &errstr);
usr.bin/skey/skey.c
134
while (n-- != 0)
usr.bin/skey/skey.c
138
for (i = 0; i <= n - cnt; i++)
usr.bin/skey/skey.c
140
for (; i <= n; i++) {
usr.bin/skey/skey.c
41
int n, i, cnt = 1, pass = 0, hexmode = 0;
usr.bin/skeyaudit/skeyaudit.c
126
left = key.n - 1;
usr.bin/skeyaudit/skeyaudit.c
146
left = key.n - 1;
usr.bin/skeyinfo/skeyinfo.c
84
(void)printf("%d %s\n", key.n - 1, key.seed);
usr.bin/skeyinit/skeyinit.c
290
if (defaultsetup && n == 0)
usr.bin/skeyinit/skeyinit.c
291
n = 100;
usr.bin/skeyinit/skeyinit.c
299
secure_mode(&n, key, seed, sizeof seed, buf, sizeof(buf));
usr.bin/skeyinit/skeyinit.c
301
normal_mode(pp->pw_name, n, key, seed);
usr.bin/skeyinit/skeyinit.c
311
pp->pw_name, skey_get_algorithm(), n, seed, skey.val);
usr.bin/skeyinit/skeyinit.c
315
skey_get_algorithm(), n, seed);
usr.bin/skeyinit/skeyinit.c
327
int i, n = *count;
usr.bin/skeyinit/skeyinit.c
330
if (n == 0) {
usr.bin/skeyinit/skeyinit.c
340
n = strtonum(buf, 1, SKEY_MAX_SEQ-1, &errstr);
usr.bin/skeyinit/skeyinit.c
347
*count= n;
usr.bin/skeyinit/skeyinit.c
388
skey_get_algorithm(), n, seed);
usr.bin/skeyinit/skeyinit.c
408
normal_mode(char *username, int n, char *key, char *seed)
usr.bin/skeyinit/skeyinit.c
466
nn = n;
usr.bin/skeyinit/skeyinit.c
47
int rval, i, l, n, defaultsetup, rmkey, hexmode, enable;
usr.bin/skeyinit/skeyinit.c
56
n = rmkey = hexmode = enable = 0;
usr.bin/skeyinit/skeyinit.c
83
n = strtonum(argv[i], 1, SKEY_MAX_SEQ - 1, &errstr);
usr.bin/sndioctl/sndioctl.c
545
int n;
usr.bin/sndioctl/sndioctl.c
547
if (sscanf(p, "%u%n", &val, &n) != 1) {
usr.bin/sndioctl/sndioctl.c
556
*line = p + n;
usr.bin/sndioctl/sndioctl.c
565
int n;
usr.bin/sndioctl/sndioctl.c
567
if (sscanf(p, "%g%n", &val, &n) != 1) {
usr.bin/sndioctl/sndioctl.c
576
*line = p + n;
usr.bin/sndiod/dev.c
1101
dev_iscompat(struct dev *o, struct dev *n)
usr.bin/sndiod/dev.c
1103
if (((long long)o->round * n->rate != (long long)n->round * o->rate) ||
usr.bin/sndiod/dev.c
1104
((long long)o->bufsz * n->rate != (long long)n->bufsz * o->rate)) {
usr.bin/sndiod/dev.c
1105
logx(1, "%s: not compatible with %s", n->name, o->name);
usr.bin/sndiod/dev.c
422
unsigned int n;
usr.bin/sndiod/dev.c
436
n = 0;
usr.bin/sndiod/dev.c
443
n++;
usr.bin/sndiod/dev.c
445
weight /= n;
usr.bin/sndiod/dsp.c
318
int q, qi, qf, n;
usr.bin/sndiod/dsp.c
362
n = ctx_start;
usr.bin/sndiod/dsp.c
372
f[c] += (int64_t)ctx[n] * s;
usr.bin/sndiod/dsp.c
376
n = (n + 1) & (RESAMP_NCTX - 1);
usr.bin/sndiod/fdpass.c
102
n = sendmsg(f->fd, &msg, 0);
usr.bin/sndiod/fdpass.c
103
if (n == -1) {
usr.bin/sndiod/fdpass.c
108
if (n != sizeof(struct fdpass_msg)) {
usr.bin/sndiod/fdpass.c
133
ssize_t n;
usr.bin/sndiod/fdpass.c
142
n = recvmsg(f->fd, &msg, MSG_WAITALL);
usr.bin/sndiod/fdpass.c
143
if (n == -1 && errno == EMSGSIZE) {
usr.bin/sndiod/fdpass.c
149
n = recvmsg(f->fd, &msg, MSG_WAITALL);
usr.bin/sndiod/fdpass.c
151
if (n == -1) {
usr.bin/sndiod/fdpass.c
156
if (n == 0) {
usr.bin/sndiod/fdpass.c
83
ssize_t n;
usr.bin/sndiod/listen.c
167
int s, error, opt = 1, n = 0;
usr.bin/sndiod/listen.c
218
n++;
usr.bin/sndiod/listen.c
221
return n;
usr.bin/sndiod/miofile.c
109
int n, count;
usr.bin/sndiod/miofile.c
115
n = mio_write(p->mio.hdl, data, count);
usr.bin/sndiod/miofile.c
116
if (n == 0)
usr.bin/sndiod/miofile.c
118
abuf_rdiscard(&ep->obuf, n);
usr.bin/sndiod/miofile.c
119
if (n < count)
usr.bin/sndiod/miofile.c
93
int n;
usr.bin/sndiod/miofile.c
96
n = mio_read(p->mio.hdl, data, MIDI_BUFSZ);
usr.bin/sndiod/miofile.c
97
if (n == 0)
usr.bin/sndiod/miofile.c
99
midi_in(ep, data, n);
usr.bin/sndiod/opt.c
428
size_t n = 0;
usr.bin/sndiod/opt.c
432
n += snprintf(buf + n, n >= sizeof(buf) ? 0 : sizeof(buf) - n,
usr.bin/sndiod/siofile.c
333
unsigned int n;
usr.bin/sndiod/siofile.c
364
n = sio_read(d->sio.hdl, data, d->sio.todo);
usr.bin/sndiod/siofile.c
365
d->sio.todo -= n;
usr.bin/sndiod/siofile.c
368
n, d->sio.todo, d->round * d->rchan * d->par.bps);
usr.bin/sndiod/siofile.c
418
n = sio_write(d->sio.hdl, data, d->sio.todo);
usr.bin/sndiod/siofile.c
419
d->sio.todo -= n;
usr.bin/sndiod/siofile.c
422
d->path, n, d->sio.todo, d->round * d->pchan * d->par.bps);
usr.bin/sndiod/sock.c
361
int n;
usr.bin/sndiod/sock.c
363
n = write(f->fd, data, count);
usr.bin/sndiod/sock.c
364
if (n == -1) {
usr.bin/sndiod/sock.c
381
if (n == 0) {
usr.bin/sndiod/sock.c
385
return n;
usr.bin/sndiod/sock.c
394
int n;
usr.bin/sndiod/sock.c
396
n = read(f->fd, data, count);
usr.bin/sndiod/sock.c
397
if (n == -1) {
usr.bin/sndiod/sock.c
414
if (n == 0) {
usr.bin/sndiod/sock.c
418
return n;
usr.bin/sndiod/sock.c
427
int n;
usr.bin/sndiod/sock.c
437
n = sock_fdread(f, data, f->rtodo);
usr.bin/sndiod/sock.c
438
if (n == 0)
usr.bin/sndiod/sock.c
440
if (n < f->rtodo) {
usr.bin/sndiod/sock.c
441
f->rtodo -= n;
usr.bin/sndiod/sock.c
457
int n;
usr.bin/sndiod/sock.c
467
n = sock_fdwrite(f, data, f->wtodo);
usr.bin/sndiod/sock.c
468
if (n == 0)
usr.bin/sndiod/sock.c
470
if (n < f->wtodo) {
usr.bin/sndiod/sock.c
471
f->wtodo -= n;
usr.bin/sndiod/sock.c
489
int n, count;
usr.bin/sndiod/sock.c
506
n = sock_fdread(f, data, count);
usr.bin/sndiod/sock.c
507
if (n == 0)
usr.bin/sndiod/sock.c
509
f->rtodo -= n;
usr.bin/sndiod/sock.c
511
abuf_wcommit(&f->slot->mix.buf, n);
usr.bin/sndiod/sock.c
513
midi_in(f->midi, midibuf, n);
usr.bin/sndiod/sock.c
531
int n, count;
usr.bin/sndiod/sock.c
541
n = sock_fdwrite(f, dummy, f->wtodo);
usr.bin/sndiod/sock.c
542
if (n == 0)
usr.bin/sndiod/sock.c
544
f->wtodo -= n;
usr.bin/sndiod/sock.c
566
n = sock_fdwrite(f, data, count);
usr.bin/sndiod/sock.c
567
if (n == 0)
usr.bin/sndiod/sock.c
569
f->wtodo -= n;
usr.bin/sndiod/sock.c
571
abuf_rdiscard(&f->slot->sub.buf, n);
usr.bin/sndiod/sock.c
573
abuf_rdiscard(&f->midi->obuf, n);
usr.bin/sndiod/utils.c
62
int n, save_errno = errno;
usr.bin/sndiod/utils.c
65
n = vsnprintf(log_buf + log_used, sizeof(log_buf) - log_used, fmt, ap);
usr.bin/sndiod/utils.c
68
if (n != -1) {
usr.bin/sndiod/utils.c
69
log_used += n;
usr.bin/sndiod/utils.h
23
#define logx(n, ...) \
usr.bin/sndiod/utils.h
25
if (log_level >= (n)) \
usr.bin/snmp/snmpc.c
599
int n = 0, prev_cmp, skip_cmp;
usr.bin/snmp/snmpc.c
641
n++;
usr.bin/snmp/snmpc.c
695
n++;
usr.bin/snmp/snmpc.c
703
if (walk_fallback_oid && n == 0) {
usr.bin/snmp/snmpc.c
720
n++;
usr.bin/snmp/snmpc.c
725
printf("Variables found: %d\n", n);
usr.bin/sort/bwstring.c
274
size_t n = sort_mb_cur_max;
usr.bin/sort/bwstring.c
276
if (n > len - cptr)
usr.bin/sort/bwstring.c
277
n = len - cptr;
usr.bin/sort/bwstring.c
278
charlen = mbrlen(s + cptr, n, &mbs);
usr.bin/sort/bwstring.c
290
n = mbrtowc(ret->data.wstr + (chars++),
usr.bin/sort/bwstring.c
292
if ((n == (size_t)-1) || (n == (size_t)-2))
usr.bin/sort/radixsort.c
328
size_t n;
usr.bin/sort/radixsort.c
333
n = sln - i - 1;
usr.bin/sort/radixsort.c
334
slc = sl->sublevels[n];
usr.bin/sort/radixsort.c
344
sl->sublevels[n] = NULL;
usr.bin/sort/radixsort.c
424
size_t i, n;
usr.bin/sort/radixsort.c
428
n = sl->sln - i - 1;
usr.bin/sort/radixsort.c
429
slc = sl->sublevels[n];
usr.bin/sort/radixsort.c
436
sl->sublevels[n] = NULL;
usr.bin/ssh/addr.c
138
addr_invert(struct xaddr *n)
usr.bin/ssh/addr.c
142
if (n == NULL)
usr.bin/ssh/addr.c
145
switch (n->af) {
usr.bin/ssh/addr.c
147
n->v4.s_addr = ~n->v4.s_addr;
usr.bin/ssh/addr.c
151
n->addr32[i] = ~n->addr32[i];
usr.bin/ssh/addr.c
164
addr_netmask(int af, u_int l, struct xaddr *n)
usr.bin/ssh/addr.c
168
if (masklen_valid(af, l) != 0 || n == NULL)
usr.bin/ssh/addr.c
171
memset(n, '\0', sizeof(*n));
usr.bin/ssh/addr.c
174
n->af = AF_INET;
usr.bin/ssh/addr.c
177
n->v4.s_addr = htonl((0xffffffff << (32 - l)) & 0xffffffff);
usr.bin/ssh/addr.c
180
n->af = AF_INET6;
usr.bin/ssh/addr.c
182
n->addr32[i] = 0xffffffffU;
usr.bin/ssh/addr.c
184
n->addr32[i] = htonl((0xffffffff << (32 - l)) &
usr.bin/ssh/addr.c
193
addr_hostmask(int af, u_int l, struct xaddr *n)
usr.bin/ssh/addr.c
195
if (addr_netmask(af, l, n) == -1 || addr_invert(n) == -1)
usr.bin/ssh/addr.c
305
uint32_t n;
usr.bin/ssh/addr.c
314
n = ntohl(a->addr32[3 - i]) + 1;
usr.bin/ssh/addr.c
315
a->addr32[3 - i] = htonl(n);
usr.bin/ssh/addr.c
316
if (n != 0)
usr.bin/ssh/addr.c
373
addr_pton(const char *p, struct xaddr *n)
usr.bin/ssh/addr.c
391
if (n != NULL && addr_sa_to_xaddr(ai->ai_addr, ai->ai_addrlen,
usr.bin/ssh/addr.c
392
n) == -1) {
usr.bin/ssh/addr.c
435
addr_ntop(const struct xaddr *n, char *p, size_t len)
usr.bin/ssh/addr.c
440
if (addr_xaddr_to_sa(n, _SA(&ss), &slen, 0) == -1)
usr.bin/ssh/addr.c
456
addr_pton_cidr(const char *p, struct xaddr *n, u_int *l)
usr.bin/ssh/addr.c
485
if (n != NULL)
usr.bin/ssh/addr.c
486
memcpy(n, &tmp, sizeof(*n));
usr.bin/ssh/addr.h
43
int addr_netmask(int af, u_int l, struct xaddr *n);
usr.bin/ssh/addr.h
44
int addr_pton(const char *p, struct xaddr *n);
usr.bin/ssh/addr.h
45
int addr_pton_cidr(const char *p, struct xaddr *n, u_int *l);
usr.bin/ssh/addr.h
46
int addr_ntop(const struct xaddr *n, char *p, size_t len);
usr.bin/ssh/atomicio.c
43
atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
usr.bin/ssh/atomicio.c
53
while (n > pos) {
usr.bin/ssh/atomicio.c
54
res = (f) (fd, s + pos, n - pos);
usr.bin/ssh/atomicio.c
84
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
usr.bin/ssh/atomicio.c
86
return atomicio6(f, fd, _s, n, NULL, NULL);
usr.bin/ssh/atomicio.h
38
atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
usr.bin/ssh/auth-options.c
702
serialise_array(struct sshbuf *m, char **a, size_t n)
usr.bin/ssh/auth-options.c
708
if (n > INT_MAX)
usr.bin/ssh/auth-options.c
714
for (i = 0; i < n; i++) {
usr.bin/ssh/auth-options.c
718
if ((r = sshbuf_put_u32(m, n)) != 0 ||
usr.bin/ssh/auth-options.c
732
size_t i, n = 0;
usr.bin/ssh/auth-options.c
744
n = tmp;
usr.bin/ssh/auth-options.c
745
if (n > 0 && (a = calloc(n, sizeof(*a))) == NULL) {
usr.bin/ssh/auth-options.c
749
for (i = 0; i < n; i++) {
usr.bin/ssh/auth-options.c
757
*np = n;
usr.bin/ssh/auth-options.c
758
n = 0;
usr.bin/ssh/auth-options.c
761
for (i = 0; i < n; i++)
usr.bin/ssh/auth2.c
107
size_t len, n;
usr.bin/ssh/auth2.c
123
n = atomicio(read, fd, banner, len);
usr.bin/ssh/auth2.c
126
if (n != len) {
usr.bin/ssh/auth2.c
130
banner[n] = '\0';
usr.bin/ssh/bitmap.c
104
if ((r = reserve(b, n)) != 0)
usr.bin/ssh/bitmap.c
106
offset = n / BITMAP_BITS;
usr.bin/ssh/bitmap.c
109
b->d[offset] |= (BITMAP_WTYPE)1 << (n & BITMAP_WMASK);
usr.bin/ssh/bitmap.c
124
bitmap_clear_bit(struct bitmap *b, u_int n)
usr.bin/ssh/bitmap.c
128
if (b->top >= b->len || n > BITMAP_MAX)
usr.bin/ssh/bitmap.c
130
offset = n / BITMAP_BITS;
usr.bin/ssh/bitmap.c
133
b->d[offset] &= ~((BITMAP_WTYPE)1 << (n & BITMAP_WMASK));
usr.bin/ssh/bitmap.c
70
bitmap_test_bit(struct bitmap *b, u_int n)
usr.bin/ssh/bitmap.c
74
if (b->len == 0 || (n / BITMAP_BITS) > b->top)
usr.bin/ssh/bitmap.c
76
return (b->d[n / BITMAP_BITS] >> (n & BITMAP_WMASK)) & 1;
usr.bin/ssh/bitmap.c
80
reserve(struct bitmap *b, u_int n)
usr.bin/ssh/bitmap.c
85
if (b->top >= b->len || n > BITMAP_MAX)
usr.bin/ssh/bitmap.c
87
nlen = (n / BITMAP_BITS) + 1;
usr.bin/ssh/bitmap.c
99
bitmap_set_bit(struct bitmap *b, u_int n)
usr.bin/ssh/bitmap.h
37
int bitmap_test_bit(struct bitmap *b, u_int n);
usr.bin/ssh/bitmap.h
40
int bitmap_set_bit(struct bitmap *b, u_int n);
usr.bin/ssh/bitmap.h
43
void bitmap_clear_bit(struct bitmap *b, u_int n);
usr.bin/ssh/chacha.c
21
#define ROTL32(v, n) \
usr.bin/ssh/chacha.c
22
(U32V((v) << (n)) | ((v) >> (32 - (n))))
usr.bin/ssh/channels.c
5043
int gaierr, n, num_socks = 0, socks[NUM_SOCKS];
usr.bin/ssh/channels.c
5079
for (n = 0; n < num_socks; n++)
usr.bin/ssh/channels.c
5080
close(socks[n]);
usr.bin/ssh/channels.c
5097
for (n = 0; n < num_socks; n++) {
usr.bin/ssh/channels.c
5098
sock = socks[n];
usr.bin/ssh/channels.c
5108
for (n = 0; n < num_socks; n++) {
usr.bin/ssh/channels.c
5109
sock = socks[n];
usr.bin/ssh/channels.c
5115
(*chanids)[n] = nc->self;
usr.bin/ssh/channels.c
5117
(*chanids)[n] = -1;
usr.bin/ssh/channels.c
702
u_int n, *npermp;
usr.bin/ssh/channels.c
710
n = (*npermp)++;
usr.bin/ssh/channels.c
712
(*permp)[n].host_to_connect = MAYBE_DUP(host_to_connect);
usr.bin/ssh/channels.c
713
(*permp)[n].port_to_connect = port_to_connect;
usr.bin/ssh/channels.c
714
(*permp)[n].listen_host = MAYBE_DUP(listen_host);
usr.bin/ssh/channels.c
715
(*permp)[n].listen_path = MAYBE_DUP(listen_path);
usr.bin/ssh/channels.c
716
(*permp)[n].listen_port = listen_port;
usr.bin/ssh/channels.c
717
(*permp)[n].downstream = downstream;
usr.bin/ssh/channels.c
719
return (int)n;
usr.bin/ssh/channels.c
759
u_int i, n;
usr.bin/ssh/channels.c
763
for (n = 0, i = 0; i < sc->channels_alloc; i++) {
usr.bin/ssh/channels.c
766
n++;
usr.bin/ssh/channels.c
778
c->remote_name ? c->remote_name : "???", n);
usr.bin/ssh/cipher-aesctr.c
67
u32 n = 0;
usr.bin/ssh/cipher-aesctr.c
71
if (n == 0) {
usr.bin/ssh/cipher-aesctr.c
75
*(c++) = *(m++) ^ buf[n];
usr.bin/ssh/cipher-aesctr.c
76
n = (n + 1) % AES_BLOCK_SIZE;
usr.bin/ssh/clientloop.c
578
long long n;
usr.bin/ssh/clientloop.c
661
n = (now.tv_sec - next_interval.tv_sec) * 1000LL * 1000 * 1000;
usr.bin/ssh/clientloop.c
662
n += now.tv_nsec - next_interval.tv_nsec;
usr.bin/ssh/clientloop.c
663
n /= options.obscure_keystroke_timing_interval * 1000LL * 1000;
usr.bin/ssh/clientloop.c
664
n = (n < 0) ? 1 : n + 1;
usr.bin/ssh/clientloop.c
668
options.obscure_keystroke_timing_interval * n, 0);
usr.bin/ssh/dh.c
233
int n = BN_num_bits(dh_pub);
usr.bin/ssh/dh.c
261
for (i = 0; i <= n; i++)
usr.bin/ssh/dh.c
60
long long n;
usr.bin/ssh/dh.c
79
n = strtonum(arg, 0, 5, &errstr);
usr.bin/ssh/dh.c
80
if (errstr != NULL || n != MODULI_TYPE_SAFE) {
usr.bin/ssh/dh.c
88
n = strtonum(arg, 0, 0x1f, &errstr);
usr.bin/ssh/dh.c
90
(n & MODULI_TESTS_COMPOSITE) || !(n & ~MODULI_TESTS_COMPOSITE)) {
usr.bin/ssh/dh.c
97
n = strtonum(arg, 0, 1<<30, &errstr);
usr.bin/ssh/dh.c
98
if (errstr != NULL || n == 0) {
usr.bin/ssh/groupaccess.c
74
ga_match(char * const *groups, int n)
usr.bin/ssh/groupaccess.c
79
for (j = 0; j < n; j++)
usr.bin/ssh/kex.c
1241
size_t len, n;
usr.bin/ssh/kex.c
1286
for (n = 0; ; n++) {
usr.bin/ssh/kex.c
1287
if (n >= SSH_MAX_PRE_BANNER_LINES) {
usr.bin/ssh/kex.c
1366
debug_f("banner line %zu: %s", n, cp);
usr.bin/ssh/libcrux_mlkem768_sha3.h
5946
uint8_t n, uint32_t value) {
usr.bin/ssh/libcrux_mlkem768_sha3.h
5947
return value & ((1U << (uint32_t)n) - 1U);
usr.bin/ssh/log.c
528
uint64_t n = now - rl->last_event;
usr.bin/ssh/log.c
530
if (n > UINT_MAX)
usr.bin/ssh/log.c
531
n = UINT_MAX;
usr.bin/ssh/log.c
532
if (rl->accumulated_events < (u_int)n)
usr.bin/ssh/log.c
535
rl->accumulated_events -= (u_int)n;
usr.bin/ssh/moduli.c
106
#define BIT_CLEAR(a,n) ((a)[(n)>>SHIFT_WORD] &= ~(1L << ((n) & 31)))
usr.bin/ssh/moduli.c
107
#define BIT_SET(a,n) ((a)[(n)>>SHIFT_WORD] |= (1L << ((n) & 31)))
usr.bin/ssh/moduli.c
108
#define BIT_TEST(a,n) ((a)[(n)>>SHIFT_WORD] & (1L << ((n) & 31)))
usr.bin/ssh/monitor_fdpass.c
114
while ((n = recvmsg(sock, &msg, 0)) == -1 &&
usr.bin/ssh/monitor_fdpass.c
119
if (n == -1) {
usr.bin/ssh/monitor_fdpass.c
124
if (n != 1) {
usr.bin/ssh/monitor_fdpass.c
125
error_f("recvmsg: expected received 1 got %zd", n);
usr.bin/ssh/monitor_fdpass.c
51
ssize_t n;
usr.bin/ssh/monitor_fdpass.c
71
while ((n = sendmsg(sock, &msg, 0)) == -1 &&
usr.bin/ssh/monitor_fdpass.c
76
if (n == -1) {
usr.bin/ssh/monitor_fdpass.c
81
if (n != 1) {
usr.bin/ssh/monitor_fdpass.c
82
error_f("sendmsg: expected sent 1 got %zd", n);
usr.bin/ssh/monitor_fdpass.c
98
ssize_t n;
usr.bin/ssh/readconf.c
3114
#define FREE_ARRAY(type, n, a) \
usr.bin/ssh/readconf.c
3117
for (_i = 0; _i < (n); _i++) \
usr.bin/ssh/readconf.c
964
free_canon_cnames(struct allowed_cname *cnames, u_int n)
usr.bin/ssh/readconf.c
968
if (cnames == NULL || n == 0)
usr.bin/ssh/readconf.c
970
for (i = 0; i < n; i++) {
usr.bin/ssh/scp.c
1628
size_t n, npatterns = 0;
usr.bin/ssh/scp.c
1768
for (n = 0; n < npatterns; n++) {
usr.bin/ssh/scp.c
1769
if (strcmp(patterns[n], cp) == 0 ||
usr.bin/ssh/scp.c
1770
fnmatch(patterns[n], cp, 0) == 0)
usr.bin/ssh/scp.c
1773
if (n >= npatterns) {
usr.bin/ssh/scp.c
1777
for (n = 0; n < npatterns; n++) {
usr.bin/ssh/scp.c
1779
n, patterns[n]);
usr.bin/ssh/scp.c
1924
for (n = 0; n < npatterns; n++)
usr.bin/ssh/scp.c
1925
free(patterns[n]);
usr.bin/ssh/scp.c
1929
for (n = 0; n < npatterns; n++)
usr.bin/ssh/scp.c
1930
free(patterns[n]);
usr.bin/ssh/scp.c
417
int ch, fflag, tflag, status, r, n;
usr.bin/ssh/scp.c
434
for (n = 0; n < argc; n++)
usr.bin/ssh/scp.c
435
newargv[n] = xstrdup(argv[n]);
usr.bin/ssh/servconf.c
1269
int cmdline = 0, *intptr, value, value2, value3, n, port, oactive, r;
usr.bin/ssh/servconf.c
1942
if ((n = sscanf(arg, "%d:%d:%d",
usr.bin/ssh/servconf.c
1947
} else if (n == 1) {
usr.bin/ssh/servconf.c
1969
switch (n = sscanf(arg, "%d:%d", &value, &value2)) {
usr.bin/ssh/servconf.c
1972
n = -1;
usr.bin/ssh/servconf.c
1976
n = -1;
usr.bin/ssh/servconf.c
1978
if (n != 1 && n != 2)
usr.bin/ssh/servconf.c
1983
if (n == 2)
usr.bin/ssh/servconf.c
2316
for (n = 0; n < (int)gbuf.gl_pathc; n++) {
usr.bin/ssh/servconf.c
2318
filename, linenum, gbuf.gl_pathv[n]);
usr.bin/ssh/servconf.c
2321
item->filename = strdup(gbuf.gl_pathv[n]);
usr.bin/ssh/servconf.c
2872
#define M_CP_INTOPT(n) do {\
usr.bin/ssh/servconf.c
2873
if (src->n != -1) \
usr.bin/ssh/servconf.c
2874
dst->n = src->n; \
usr.bin/ssh/servconf.c
2926
#define M_CP_STROPT(n) do {\
usr.bin/ssh/servconf.c
2927
if (src->n != NULL && dst->n != src->n) { \
usr.bin/ssh/servconf.c
2928
free(dst->n); \
usr.bin/ssh/servconf.c
2929
dst->n = xstrdup(src->n); \
usr.bin/ssh/session.c
794
size_t n;
usr.bin/ssh/session.c
851
for (n = 0 ; n < auth_opts->nenv; n++) {
usr.bin/ssh/session.c
852
ocp = xstrdup(auth_opts->env[n]);
usr.bin/ssh/sftp-server.c
1698
u_int n, nusers = 0, ngroups = 0;
usr.bin/ssh/sftp-server.c
1711
if ((r = sshbuf_get_u32(uids, &n)) != 0)
usr.bin/ssh/sftp-server.c
1713
user_pw = getpwuid((uid_t)n);
usr.bin/ssh/sftp-server.c
1715
debug3_f("uid %u => \"%s\"", n, name);
usr.bin/ssh/sftp-server.c
1721
if ((r = sshbuf_get_u32(gids, &n)) != 0)
usr.bin/ssh/sftp-server.c
1723
gr = getgrgid((gid_t)n);
usr.bin/ssh/sftp-server.c
1725
debug3_f("gid %u => \"%s\"", n, name);
usr.bin/ssh/sftp-usergroup.c
152
u_int id, i, n = 0, *ids = NULL;
usr.bin/ssh/sftp-usergroup.c
164
if (has_id(id, ids, n))
usr.bin/ssh/sftp-usergroup.c
166
ids = xrecallocarray(ids, n, n + 1, sizeof(*ids));
usr.bin/ssh/sftp-usergroup.c
167
ids[n++] = id;
usr.bin/ssh/sftp-usergroup.c
170
*nidsp = n;
usr.bin/ssh/sftp-usergroup.c
191
u_int id, i, n = 0, *ids = NULL;
usr.bin/ssh/sftp-usergroup.c
203
if (has_id(id, ids, n))
usr.bin/ssh/sftp-usergroup.c
205
ids = xrecallocarray(ids, n, n + 1, sizeof(*ids));
usr.bin/ssh/sftp-usergroup.c
206
ids[n++] = id;
usr.bin/ssh/sftp-usergroup.c
209
*nidsp = n;
usr.bin/ssh/sftp.c
1367
cmdnum = cmds[i].n;
usr.bin/ssh/sftp.c
148
const int n;
usr.bin/ssh/sftp.c
838
int n;
usr.bin/ssh/sftp.c
842
if ((n = sftp_readdir(conn, path, &d)) != 0)
usr.bin/ssh/sftp.c
843
return (n);
usr.bin/ssh/sftp.c
851
for (n = 0; d[n] != NULL; n++) {
usr.bin/ssh/sftp.c
852
if (d[n]->filename[0] != '.' || (lflag & LS_SHOW_ALL))
usr.bin/ssh/sftp.c
853
m = MAXIMUM(m, strlen(d[n]->filename));
usr.bin/ssh/sftp.c
871
for (n = 0; d[n] != NULL; n++)
usr.bin/ssh/sftp.c
874
qsort(d, n, sizeof(*d), sdirent_comp);
usr.bin/ssh/sftp.c
878
for (n = 0; d[n] != NULL && !interrupted; n++) {
usr.bin/ssh/sftp.c
881
if (d[n]->filename[0] == '.' && !(lflag & LS_SHOW_ALL))
usr.bin/ssh/sftp.c
884
tmp = sftp_path_append(path, d[n]->filename);
usr.bin/ssh/sftp.c
895
attrib_to_stat(&d[n]->a, &sb);
usr.bin/ssh/sftp.c
903
mprintf("%s\n", d[n]->longname);
usr.bin/ssh/smult_curve25519_ref.c
248
const unsigned char *n,
usr.bin/ssh/smult_curve25519_ref.c
254
for (i = 0;i < 32;++i) e[i] = n[i];
usr.bin/ssh/sntrup761.c
1615
static void crypto_sort_int32(void *array,long long n)
usr.bin/ssh/sntrup761.c
1620
if (n < 2) return;
usr.bin/ssh/sntrup761.c
1622
while (top < n - top) top += top;
usr.bin/ssh/sntrup761.c
1626
while (i + 2 * p <= n) {
usr.bin/ssh/sntrup761.c
1631
for (j = i;j < n - p;++j)
usr.bin/ssh/sntrup761.c
1638
if (j == n - q) goto done;
usr.bin/ssh/sntrup761.c
1649
while (i + p <= n - q) {
usr.bin/ssh/sntrup761.c
1660
while (j < n - q) {
usr.bin/ssh/sntrup761.c
1678
static void crypto_sort_uint32(void *array,long long n)
usr.bin/ssh/sntrup761.c
1682
for (j = 0;j < n;++j) x[j] ^= 0x80000000;
usr.bin/ssh/sntrup761.c
1683
crypto_sort_int32(array,n);
usr.bin/ssh/sntrup761.c
1684
for (j = 0;j < n;++j) x[j] ^= 0x80000000;
usr.bin/ssh/ssh-add.c
252
uint64_t n;
usr.bin/ssh/ssh-add.c
261
n = (CERT_EXPIRY_GRACE + cert->cert->valid_before) - (uint64_t)now;
usr.bin/ssh/ssh-add.c
262
n = MINIMUM(n, INT_MAX);
usr.bin/ssh/ssh-add.c
264
return (int)n;
usr.bin/ssh/ssh-add.c
265
return MINIMUM(cert_lifetime, (int)n);
usr.bin/ssh/ssh-add.c
819
size_t n, ndest_constraints = 0, ncerts = 0;
usr.bin/ssh/ssh-add.c
995
for (n = 0; n < ncerts; n++)
usr.bin/ssh/ssh-add.c
996
sshkey_free(certs[n]);
usr.bin/ssh/ssh-keygen.c
1697
u_int n;
usr.bin/ssh/ssh-keygen.c
1764
n = 0;
usr.bin/ssh/ssh-keygen.c
1768
for (; (cp = strsep(&tmp, ",")) != NULL; n++) {
usr.bin/ssh/ssh-keygen.c
1769
plist = xreallocarray(plist, n + 1, sizeof(*plist));
usr.bin/ssh/ssh-keygen.c
1770
if (*(plist[n] = xstrdup(cp)) == '\0')
usr.bin/ssh/ssh-keygen.c
1775
if (n > SSHKEY_CERT_MAX_PRINCIPALS)
usr.bin/ssh/ssh-keygen.c
1791
public->cert->nprincipals = n;
usr.bin/ssh/ssh-keygen.c
3699
unsigned int n = 0;
usr.bin/ssh/ssh-keygen.c
3702
n = do_print_resource_record(pw, identity_file,
usr.bin/ssh/ssh-keygen.c
3704
if (n == 0)
usr.bin/ssh/ssh-keygen.c
3709
n += do_print_resource_record(pw,
usr.bin/ssh/ssh-keygen.c
3712
n += do_print_resource_record(pw,
usr.bin/ssh/ssh-keygen.c
3715
n += do_print_resource_record(pw,
usr.bin/ssh/ssh-keygen.c
3718
if (n == 0)
usr.bin/ssh/ssh-keyscan.c
432
int n = 0, remote_major = 0, remote_minor = 0;
usr.bin/ssh/ssh-keyscan.c
439
n = snprintf(buf, sizeof buf, "SSH-%d.%d-OpenSSH-keyscan\r\n",
usr.bin/ssh/ssh-keyscan.c
441
if (n < 0 || (size_t)n >= sizeof(buf)) {
usr.bin/ssh/ssh-keyscan.c
446
if (atomicio(vwrite, s, buf, n) != (size_t)n) {
usr.bin/ssh/ssh-keyscan.c
466
(n = atomicio(read, s, cp, 1)) == 1 && *cp != '\n') {
usr.bin/ssh/ssh-keyscan.c
471
if (n != 1 || strncmp(buf, "SSH-", 4) == 0)
usr.bin/ssh/ssh-keyscan.c
474
if (n == 0) {
usr.bin/ssh/ssh-pkcs11.c
1417
CK_ULONG n = 0;
usr.bin/ssh/ssh-pkcs11.c
1441
rv = f->C_FindObjects(session, &obj, 1, &n);
usr.bin/ssh/ssh-pkcs11.c
1446
if (n == 0)
usr.bin/ssh/ssh-pkcs11.c
1523
CK_ULONG n = 0;
usr.bin/ssh/ssh-pkcs11.c
1547
rv = f->C_FindObjects(session, &obj, 1, &n);
usr.bin/ssh/ssh-pkcs11.c
1552
if (n == 0)
usr.bin/ssh/ssh-sk-client.c
111
n = read(execpipe[0], execbuf, sizeof execbuf);
usr.bin/ssh/ssh-sk-client.c
113
if (n > 0) {
usr.bin/ssh/ssh-sk-client.c
114
execbuf[n - 1] = '\0';
usr.bin/ssh/ssh-sk-client.c
48
ssize_t n;
usr.bin/ssh/ssh.c
641
size_t n, len;
usr.bin/ssh/ssh.c
810
for (n = 0; n < len; n++)
usr.bin/ssh/ssh.c
811
if (cp[n] == ',')
usr.bin/ssh/ssh.c
812
cp[n] = '\n';
usr.bin/ssh/ssh_api.c
341
size_t n, j;
usr.bin/ssh/ssh_api.c
343
for (j = n = 0;;) {
usr.bin/ssh/ssh_api.c
369
if (ssh->kex->server || ++n > SSH_MAX_PRE_BANNER_LINES) {
usr.bin/ssh/sshconnect.c
800
u_int i, n, num_othernames = 0;
usr.bin/ssh/sshconnect.c
812
n = num_othernames;
usr.bin/ssh/sshconnect.c
813
if (n > MAX_OTHER_NAMES)
usr.bin/ssh/sshconnect.c
814
n = MAX_OTHER_NAMES;
usr.bin/ssh/sshconnect.c
815
for (i = 0; i < n; i++) {
usr.bin/ssh/sshconnect.c
818
if (n < num_othernames) {
usr.bin/ssh/sshconnect.c
820
num_othernames - n);
usr.bin/ssh/ssherr.c
23
ssh_err(int n)
usr.bin/ssh/ssherr.c
27
switch (n) {
usr.bin/ssh/ssherr.h
87
const char *ssh_err(int n);
usr.bin/ssh/sshkey.c
1558
struct sshkey *n = NULL;
usr.bin/ssh/sshkey.c
1565
if ((n = sshkey_new(k->type)) == NULL) {
usr.bin/ssh/sshkey.c
1569
if ((r = impl->funcs->copy_public(k, n)) != 0)
usr.bin/ssh/sshkey.c
1571
if (sshkey_is_cert(k) && (r = sshkey_cert_copy(k, n)) != 0)
usr.bin/ssh/sshkey.c
1574
*pkp = n;
usr.bin/ssh/sshkey.c
1575
n = NULL;
usr.bin/ssh/sshkey.c
1578
sshkey_free(n);
usr.bin/ssh/sshsig.c
507
ssize_t n, total = 0;
usr.bin/ssh/sshsig.c
526
if ((n = read(fd, rbuf, sizeof(rbuf))) == -1) {
usr.bin/ssh/sshsig.c
534
} else if (n == 0) {
usr.bin/ssh/sshsig.c
538
total += (size_t)n;
usr.bin/ssh/sshsig.c
539
if ((r = ssh_digest_update(ctx, rbuf, (size_t)n)) != 0) {
usr.bin/stat/stat.c
499
int l, small, formats, gottime, n;
usr.bin/stat/stat.c
771
n = snprintf(buf, blen, "%.*s,%.*s",
usr.bin/stat/stat.c
773
return (n >= blen ? blen : n);
usr.bin/stat/stat.c
820
n = snprintf(buf, blen, lfmt, (long long)secs);
usr.bin/stat/stat.c
821
return (n >= blen ? blen : n);
usr.bin/stat/stat.c
897
n = snprintf(buf, blen, lfmt, sdata);
usr.bin/stat/stat.c
898
return (n >= blen ? blen : n);
usr.bin/stat/stat.c
919
n = snprintf(buf, blen, lfmt, data);
usr.bin/stat/stat.c
920
return (n >= blen ? blen : n);
usr.bin/systat/cache.c
63
int n;
usr.bin/systat/cache.c
85
for (n = 0; n < max; n++)
usr.bin/systat/cache.c
86
TAILQ_INSERT_HEAD(&scq_free, sc_store + n, qlink);
usr.bin/systat/if.c
212
int n, i, count = 0;
usr.bin/systat/if.c
214
for (n = 0, i = 0; n < nifs; n++) {
usr.bin/systat/if.c
215
if (ifstats[n].ifs_name[0] == '\0')
usr.bin/systat/if.c
221
showifstat(ifstats + n);
usr.bin/systat/iostat.c
169
int n, count = 0;
usr.bin/systat/iostat.c
180
for (n = dispstart; n < num_disp - 1; n++) {
usr.bin/systat/iostat.c
181
showdrive(n);
usr.bin/systat/main.c
158
int i, n;
usr.bin/systat/main.c
160
n = 0;
usr.bin/systat/main.c
166
mvprintw(2 + ++n, 10, "%s", namelist[i].n_name);
usr.bin/systat/malloc.c
326
int n, count = 0;
usr.bin/systat/malloc.c
328
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/malloc.c
329
showtype(n);
usr.bin/systat/malloc.c
338
int n, count = 0;
usr.bin/systat/malloc.c
340
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/malloc.c
341
showbucket(n);
usr.bin/systat/mbufs.c
357
int i, p, n, count = 0;
usr.bin/systat/mbufs.c
361
for (n = i = 0; i < num_ifs; i++) {
usr.bin/systat/mbufs.c
373
if (n++ >= dispstart) {
usr.bin/systat/mbufs.c
382
if (n++ >= dispstart) {
usr.bin/systat/netstat.c
335
int n, count = 0;
usr.bin/systat/netstat.c
337
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/netstat.c
338
shownetstat(netinfos + n);
usr.bin/systat/pf.c
146
#define ADD_LINE_A(t, n, v) \
usr.bin/systat/pf.c
150
print_fld_str(FLD_PF_NAME, (n)); \
usr.bin/systat/pf.c
166
#define ADD_LINE_S(t, n, v) \
usr.bin/systat/pf.c
170
print_fld_str(FLD_PF_NAME, (n)); \
usr.bin/systat/pf.c
178
#define ADD_LINE_V(t, n, v) \
usr.bin/systat/pf.c
182
print_fld_str(FLD_PF_NAME, (n)); \
usr.bin/systat/pf.c
190
#define ADD_LINE_VR(t, n, v, r) \
usr.bin/systat/pf.c
194
print_fld_str(FLD_PF_NAME, (n)); \
usr.bin/systat/pftop.c
1463
u_int32_t n, count = 0;
usr.bin/systat/pftop.c
1465
for (n = dispstart; n < num_rules; n++) {
usr.bin/systat/pftop.c
1466
print_rule(rules + n);
usr.bin/systat/pftop.c
1682
uint32_t n, count, start;
usr.bin/systat/pftop.c
1685
n = count = 0;
usr.bin/systat/pftop.c
1689
if (n < start) {
usr.bin/systat/pftop.c
1690
n++;
usr.bin/systat/pftop.c
660
size_t n;
usr.bin/systat/pftop.c
683
for (n = 0; n < num_states_all; n++)
usr.bin/systat/pftop.c
684
state_ord[n] = n;
usr.bin/systat/pftop.c
687
for (n = 0; n < num_states; n++)
usr.bin/systat/pftop.c
688
state_cache[n] = cache_state(state_buf + n);
usr.bin/systat/pftop.c
897
int n, count = 0;
usr.bin/systat/pftop.c
899
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/pftop.c
900
count += print_state(state_buf + state_ord[n],
usr.bin/systat/pftop.c
901
state_cache[state_ord[n]]);
usr.bin/systat/pigs.c
216
int n, count = 0;
usr.bin/systat/pigs.c
218
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/pigs.c
219
showpigs(pb_indices[n]);
usr.bin/systat/pool.c
360
int i, n, count = 0;
usr.bin/systat/pool.c
365
for (n = i = 0; i < num_pools; i++) {
usr.bin/systat/pool.c
374
if (n++ < dispstart)
usr.bin/systat/pool.c
535
int i, n, count = 0;
usr.bin/systat/pool.c
540
for (n = i = 0; i < num_pool_caches; i++) {
usr.bin/systat/pool.c
545
if (n++ < dispstart)
usr.bin/systat/sensors.c
185
int n, count = 0;
usr.bin/systat/sensors.c
187
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/sensors.c
188
showsensor(sensors + n);
usr.bin/systat/swap.c
137
int n, count = 0;
usr.bin/systat/swap.c
145
for (n = dispstart; n < num_disp; n++) {
usr.bin/systat/swap.c
146
if (n >= nswap)
usr.bin/systat/swap.c
149
showswap(n);
usr.bin/systat/vmstat.c
508
putint(int n, int l, int c, int w)
usr.bin/systat/vmstat.c
513
if (n == 0) {
usr.bin/systat/vmstat.c
518
snprintf(b, sizeof b, "%*d", w, n);
usr.bin/systat/vmstat.c
528
putintmk(int n, int l, int c, int w)
usr.bin/systat/vmstat.c
533
if (n == 0) {
usr.bin/systat/vmstat.c
538
if (n > 9999 * 1024)
usr.bin/systat/vmstat.c
539
snprintf(b, sizeof b, "%*dG", w - 1, n / 1024 / 1024);
usr.bin/systat/vmstat.c
540
else if (n > 9999)
usr.bin/systat/vmstat.c
541
snprintf(b, sizeof b, "%*dM", w - 1, n / 1024);
usr.bin/systat/vmstat.c
543
snprintf(b, sizeof b, "%*dK", w - 1, n);
usr.bin/systat/vmstat.c
553
putuint64(u_int64_t n, int l, int c, int w)
usr.bin/systat/vmstat.c
558
if (n == 0) {
usr.bin/systat/vmstat.c
563
snprintf(b, sizeof b, "%*llu", w, n);
usr.bin/tcpbench/tcpbench.c
341
u_int n = 0;
usr.bin/tcpbench/tcpbench.c
345
if ((ret = reallocarray(ret, (++n + 1), sizeof(*ret))) == NULL)
usr.bin/tcpbench/tcpbench.c
347
if ((ret[n - 1] = strdup(item)) == NULL)
usr.bin/tcpbench/tcpbench.c
349
ret[n] = NULL;
usr.bin/tcpbench/tcpbench.c
578
ssize_t n;
usr.bin/tcpbench/tcpbench.c
580
n = read(fd, ptb->dummybuf, ptb->dummybuf_len);
usr.bin/tcpbench/tcpbench.c
581
if (n == 0)
usr.bin/tcpbench/tcpbench.c
583
else if (n == -1) {
usr.bin/tcpbench/tcpbench.c
590
fprintf(stderr, "read: %zd bytes\n", n);
usr.bin/tcpbench/tcpbench.c
598
udp_sc->bytes += n;
usr.bin/tcpbench/tcpbench.c
599
mainstats.slice_bytes += n;
usr.bin/tcpbench/tcpbench.c
600
mainstats.total_bytes += n;
usr.bin/tcpbench/tcpbench.c
607
ssize_t n;
usr.bin/tcpbench/tcpbench.c
610
n = tls_read(sc->tls, sc->buf, sc->buflen);
usr.bin/tcpbench/tcpbench.c
612
n = read(sc->fd, sc->buf, sc->buflen);
usr.bin/tcpbench/tcpbench.c
613
if (n == -1) {
usr.bin/tcpbench/tcpbench.c
619
} else if (n == 0) {
usr.bin/tcpbench/tcpbench.c
639
fprintf(stderr, "read: %zd bytes\n", n);
usr.bin/tcpbench/tcpbench.c
640
sc->bytes += n;
usr.bin/tcpbench/tcpbench.c
641
mainstats.slice_bytes += n;
usr.bin/tcpbench/tcpbench.c
642
mainstats.total_bytes += n;
usr.bin/tcpbench/tcpbench.c
841
ssize_t n;
usr.bin/tcpbench/tcpbench.c
848
n = tls_write(sc->tls, sc->buf, blen);
usr.bin/tcpbench/tcpbench.c
850
n = write(sc->fd, sc->buf, blen);
usr.bin/tcpbench/tcpbench.c
851
if (n == -1) {
usr.bin/tcpbench/tcpbench.c
860
if (TCP_MODE && n == 0) {
usr.bin/tcpbench/tcpbench.c
865
fprintf(stderr, "write: %zd bytes\n", n);
usr.bin/tcpbench/tcpbench.c
866
sc->bytes += n;
usr.bin/tcpbench/tcpbench.c
867
mainstats.slice_bytes += n;
usr.bin/tcpbench/tcpbench.c
868
mainstats.total_bytes += n;
usr.bin/tee/tee.c
119
for (n = 0; n < rval; n += wval) {
usr.bin/tee/tee.c
120
wval = write(p->fd, buf + n, rval - n);
usr.bin/tee/tee.c
72
ssize_t n, rval, wval;
usr.bin/telnet/genget.c
71
int n;
usr.bin/telnet/genget.c
78
if ((n = isprefix(name, *c)) == 0)
usr.bin/telnet/genget.c
80
if (n < 0) /* exact match */
usr.bin/telnet/network.c
107
int n, n1;
usr.bin/telnet/network.c
109
if ((n1 = n = ring_full_consecutive(&netoring)) > 0) {
usr.bin/telnet/network.c
111
n = send(net, (char *)netoring.consume, n, 0); /* normal write */
usr.bin/telnet/network.c
121
n = send(net, (char *)netoring.consume, 1, MSG_OOB);/* URGENT data */
usr.bin/telnet/network.c
124
if (n < 0) {
usr.bin/telnet/network.c
132
n = 0;
usr.bin/telnet/network.c
134
if (netdata && n) {
usr.bin/telnet/network.c
135
Dump('>', netoring.consume, n);
usr.bin/telnet/network.c
137
if (n) {
usr.bin/telnet/network.c
138
ring_consumed(&netoring, n);
usr.bin/telnet/network.c
143
if ((n1 == n) && ring_full_consecutive(&netoring)) {
usr.bin/telnet/telnet.c
474
int n;
usr.bin/telnet/telnet.c
490
for (n = 1, cp = buf; *cp; cp++) {
usr.bin/telnet/telnet.c
492
n++;
usr.bin/telnet/telnet.c
497
argv = reallocarray(NULL, n+3, sizeof(char *));
usr.bin/telnet/telnet.c
506
n = 0;
usr.bin/telnet/telnet.c
517
if (n || (cp - cp2 > 41))
usr.bin/telnet/telnet.c
533
n = 0;
usr.bin/telnet/telnet.c
541
n = 1;
usr.bin/telnet/telnet.c
586
int n;
usr.bin/telnet/telnet.c
588
n = strlen(name) + 1;
usr.bin/telnet/telnet.c
590
if (strncasecmp(*ap, name, n) == 0)
usr.bin/telnet/terminal.c
100
ring_consumed(&ttyoring, n);
usr.bin/telnet/terminal.c
102
if (n < 0) {
usr.bin/telnet/terminal.c
107
if (n == n0) {
usr.bin/telnet/terminal.c
112
return n0 - n + 1;
usr.bin/telnet/terminal.c
73
int n, n0, n1;
usr.bin/telnet/terminal.c
76
if ((n1 = n = ring_full_consecutive(&ttyoring)) > 0) {
usr.bin/telnet/terminal.c
81
n = write(tout, ttyoring.consume, n);
usr.bin/telnet/terminal.c
84
if (n > 0) {
usr.bin/telnet/terminal.c
85
if (termdata && n) {
usr.bin/telnet/terminal.c
86
Dump('>', ttyoring.consume, n);
usr.bin/telnet/terminal.c
93
if (n1 == n && n0 > n) {
usr.bin/telnet/terminal.c
94
n1 = n0 - n;
usr.bin/telnet/terminal.c
98
n += n1;
usr.bin/tftp/main.c
326
int n;
usr.bin/tftp/main.c
345
for (n = 1; n < argc - 1; n++)
usr.bin/tftp/main.c
346
if (strchr(argv[n], ':')) {
usr.bin/tftp/main.c
381
for (n = 1; n < argc - 1; n++) {
usr.bin/tftp/main.c
382
if (asprintf(&cp, "%s/%s", targ, tail(argv[n])) == -1)
usr.bin/tftp/main.c
384
fd = open(argv[n], O_RDONLY);
usr.bin/tftp/main.c
386
warn("open: %s", argv[n]);
usr.bin/tftp/main.c
392
argv[n], hostname, cp, mode);
usr.bin/tftp/main.c
413
int n;
usr.bin/tftp/main.c
431
for (n = 1; n < argc; n++)
usr.bin/tftp/main.c
432
if (strrchr(argv[n], ':') == 0) {
usr.bin/tftp/main.c
437
for (n = 1; n < argc; n++) {
usr.bin/tftp/main.c
438
src = strrchr(argv[n], ':');
usr.bin/tftp/main.c
440
src = argv[n];
usr.bin/tftp/main.c
445
cp = argv[n];
usr.bin/tftp/tftp.c
136
int n, nfds, error, timeouts, size;
usr.bin/tftp/tftp.c
199
n = recvfrom(f, ackbuf, packet_size, 0,
usr.bin/tftp/tftp.c
201
if (n == 0) {
usr.bin/tftp/tftp.c
205
if (n == -1) {
usr.bin/tftp/tftp.c
221
tpacket("received", ap, n);
usr.bin/tftp/tftp.c
226
oack(ap, n, 0);
usr.bin/tftp/tftp.c
282
int n, nfds, error, timeouts, size;
usr.bin/tftp/tftp.c
291
n = 0;
usr.bin/tftp/tftp.c
346
n = recvfrom(f, dp, packet_size, 0,
usr.bin/tftp/tftp.c
348
if (n == 0) {
usr.bin/tftp/tftp.c
352
if (n == -1) {
usr.bin/tftp/tftp.c
368
tpacket("received", dp, n);
usr.bin/tftp/tftp.c
373
oack(dp, n, 0);
usr.bin/tftp/tftp.c
400
size = writeit(file, &dp, n - 4, convert);
usr.bin/tftp/tftp.c
508
tpacket(const char *s, struct tftphdr *tp, int n)
usr.bin/tftp/tftp.c
524
n -= 2;
usr.bin/tftp/tftp.c
529
oack(tp, n, 1);
usr.bin/tftp/tftp.c
533
printf("<block=%d, %d bytes>\n", ntohs(tp->th_block), n - 4);
usr.bin/tftp/tftp.c
543
oack(tp, n, 1);
usr.bin/tftp/tftp.c
631
int i, n;
usr.bin/tftp/tftp.c
643
n = strtonum(value, TIMEOUT_MIN, TIMEOUT_MAX,
usr.bin/tftp/tftp.c
645
if (errstr || rexmtval != n ||
usr.bin/tftp/tftp.c
655
n = strtonum(value, SEGSIZE_MIN, SEGSIZE_MAX,
usr.bin/tftp/tftp.c
657
if (errstr || opt_blksize != n ||
usr.bin/tftp/tftp.c
664
segment_size = n;
usr.bin/tic/dump_entry.c
100
#define isObsolete(f,n) ((f == F_TERMINFO || f == F_VARIABLE) && (sortmode != S_VARIABLE) && OBSOLETE(n))
usr.bin/tic/dump_entry.c
1318
unsigned n;
usr.bin/tic/dump_entry.c
1319
for (n = 0; n < NUM_STRINGS(tterm); ++n) {
usr.bin/tic/dump_entry.c
1320
if (cap == tterm->Strings[n]) {
usr.bin/tic/dump_entry.c
1321
tterm->Strings[n] = ABSENT_STRING;
usr.bin/tic/dump_entry.c
1331
PredIdx n;
usr.bin/tic/dump_entry.c
1332
for (n = 0; n < NUM_STRINGS(tterm); ++n) {
usr.bin/tic/dump_entry.c
1333
if (version_filter(STRING, n)
usr.bin/tic/dump_entry.c
1334
&& !strcmp(name, strnames[n])) {
usr.bin/tic/dump_entry.c
1335
char *cap = tterm->Strings[n];
usr.bin/tic/dump_entry.c
1352
int n;
usr.bin/tic/dump_entry.c
1356
for (n = 0; n <= 10; ++n) {
usr.bin/tic/dump_entry.c
1359
_nc_SPRINTF(name, _nc_SLIMIT(sizeof(name)) "lf%d", n);
usr.bin/tic/dump_entry.c
1379
int n;
usr.bin/tic/dump_entry.c
1383
for (n = 60; n >= 0; --n) {
usr.bin/tic/dump_entry.c
1386
_nc_SPRINTF(name, _nc_SLIMIT(sizeof(name)) "kf%d", n);
usr.bin/tic/dump_entry.c
1411
int n = 0;
usr.bin/tic/dump_entry.c
1412
while (mapping[n] != '\0' && mapping[n + 1] != '\0') {
usr.bin/tic/dump_entry.c
1413
if (isLine(mapping[n]) &&
usr.bin/tic/dump_entry.c
1414
mapping[n] != mapping[n + 1]) {
usr.bin/tic/dump_entry.c
1418
n += 2;
usr.bin/tic/dump_entry.c
1501
unsigned n;
usr.bin/tic/dump_entry.c
1507
for (n = 0; n < offset; ++n) {
usr.bin/tic/dump_entry.c
1509
"%02X", UChar(bigbuf[n]));
usr.bin/tic/dump_entry.c
1521
for (n = 0; n < offset; ++n) {
usr.bin/tic/dump_entry.c
1522
encode_b64(numbuf, bigbuf, n, &value);
usr.bin/tic/dump_entry.c
1525
switch (n % 3) {
usr.bin/tic/dump_entry.c
1580
unsigned n;
usr.bin/tic/dump_entry.c
1581
for (n = STRCOUNT; n < NUM_STRINGS(tterm); n++) {
usr.bin/tic/dump_entry.c
1582
const char *name = ExtStrname(tterm, (int) n, strnames);
usr.bin/tic/dump_entry.c
1584
if (VALID_STRING(tterm->Strings[n])) {
usr.bin/tic/dump_entry.c
1787
size_t n;
usr.bin/tic/dump_entry.c
1793
for (n = 0, source = 0; acs_chars[n] != 0; n++) {
usr.bin/tic/dump_entry.c
1794
target = UChar(acs_chars[n]);
usr.bin/tic/dump_entry.c
1800
if (acs_chars[n + 1])
usr.bin/tic/dump_entry.c
1801
n++;
usr.bin/tic/dump_entry.c
1809
for (n = 0; acs_chars[n] != 0; n++) {
usr.bin/tic/dump_entry.c
1810
source = UChar(acs_chars[n]);
usr.bin/tic/dump_entry.c
1811
if ((target = (unsigned char) acs_chars[n + 1]) != 0) {
usr.bin/tic/dump_entry.c
1813
n++;
usr.bin/tic/dump_entry.c
1818
for (n = m = 0; n < sizeof(mapped); n++) {
usr.bin/tic/dump_entry.c
1819
if (mapped[n]) {
usr.bin/tic/dump_entry.c
1820
acs_chars[m++] = (char) n;
usr.bin/tic/dump_entry.c
1821
acs_chars[m++] = mapped[n];
usr.bin/tic/dump_entry.c
455
int n = result;
usr.bin/tic/dump_entry.c
456
while ((ch = src[offset + n]) != '\0') {
usr.bin/tic/dump_entry.c
458
result = ++n;
usr.bin/tic/dump_entry.c
461
n++;
usr.bin/tic/dump_entry.c
486
int n;
usr.bin/tic/dump_entry.c
488
for (n = size - 1; n > 0; --n) {
usr.bin/tic/dump_entry.c
489
int ch = UChar(src[step + n]);
usr.bin/tic/dump_entry.c
491
if (n > 0 && src[step + n - 1] == ch)
usr.bin/tic/dump_entry.c
492
--n;
usr.bin/tic/dump_entry.c
493
mark = n;
usr.bin/tic/dump_entry.c
503
for (n = size - 1; n > 0; --n) {
usr.bin/tic/dump_entry.c
504
int ch = UChar(src[step + n]);
usr.bin/tic/dump_entry.c
506
int need = op_length(src, step + n);
usr.bin/tic/dump_entry.c
507
if ((n + need) > size) {
usr.bin/tic/dump_entry.c
508
mark = n;
usr.bin/tic/dump_entry.c
719
int n;
usr.bin/tic/dump_entry.c
721
for (n = 0; n < level; n++)
usr.bin/tic/dump_entry.c
757
int n;
usr.bin/tic/dump_entry.c
761
for (n = 0; n < len - 1; ++n) {
usr.bin/tic/dump_entry.c
762
if (!strncmp(src + n, "%p", (size_t) 2)) {
usr.bin/tic/dump_entry.c
764
} else if (!strncmp(src + n, "%;", (size_t) 2)) {
usr.bin/tic/dump_entry.c
906
#define SAME_CAP(n,cap) (&tterm->Strings[n] == &cap)
usr.bin/tic/dump_entry.c
95
#define OBSOLETE(n) (!_nc_user_definable && (n[0] == 'O' && n[1] == 'T'))
usr.bin/tic/dump_entry.c
97
#define OBSOLETE(n) (n[0] == 'O' && n[1] == 'T')
usr.bin/tic/progs.priv.h
156
#define ErrSystem(n) (4 + (n))
usr.bin/tic/progs.priv.h
262
#define _nc_read_entry2(n,f,t) _nc_read_entry(n,f,t)
usr.bin/tic/reset_cmd.c
66
# define WINSIZE_ROWS(n) n.ts_lines
usr.bin/tic/reset_cmd.c
67
# define WINSIZE_COLS(n) n.ts_cols
usr.bin/tic/reset_cmd.c
73
# define WINSIZE_ROWS(n) n.ws_row
usr.bin/tic/reset_cmd.c
74
# define WINSIZE_COLS(n) n.ws_col
usr.bin/tic/tic.c
110
int n;
usr.bin/tic/tic.c
111
for (n = 0; src[n] != 0; ++n)
usr.bin/tic/tic.c
112
free(src[n]);
usr.bin/tic/tic.c
1221
int n;
usr.bin/tic/tic.c
1223
for (n = same = 0; n < limit; ++n) {
usr.bin/tic/tic.c
1224
char *oldvalue = safe_strdup(TIPARM_1(oldcap, n));
usr.bin/tic/tic.c
1225
char *newvalue = safe_strdup(TIPARM_1(newcap, n));
usr.bin/tic/tic.c
1880
unsigned n;
usr.bin/tic/tic.c
1883
for (n = 0; n < SIZEOF(table); n++) {
usr.bin/tic/tic.c
1884
if (!strcmp(name, table[n].name)) {
usr.bin/tic/tic.c
1885
result = table[n].count;
usr.bin/tic/tic.c
1975
size_t n;
usr.bin/tic/tic.c
1976
for (n = 0; n < SIZEOF(table); ++n) {
usr.bin/tic/tic.c
1977
if (!strcmp(name, table[n])) {
usr.bin/tic/tic.c
1995
int n;
usr.bin/tic/tic.c
2020
for (n = 0; n <= NUM_PARM; n++)
usr.bin/tic/tic.c
2021
params[n] = FALSE;
usr.bin/tic/tic.c
2033
n = (*s - '0');
usr.bin/tic/tic.c
2034
if (n > actual)
usr.bin/tic/tic.c
2035
actual = n;
usr.bin/tic/tic.c
2036
params[n] = TRUE;
usr.bin/tic/tic.c
206
unsigned n;
usr.bin/tic/tic.c
2067
for (n = 1; n < actual; n++) {
usr.bin/tic/tic.c
2068
if (!params[n])
usr.bin/tic/tic.c
2069
_nc_warning("%s omits parameter %d", name, n);
usr.bin/tic/tic.c
2116
for (n = 0; n < limit; ++n) {
usr.bin/tic/tic.c
2118
(void) TPARM_9(value, n, n, n, n, n, n, n, n, n);
usr.bin/tic/tic.c
2122
name, n);
usr.bin/tic/tic.c
215
for (n = 0; n < STRCOUNT; n++) {
usr.bin/tic/tic.c
216
s = ep->tterm.Strings[n];
usr.bin/tic/tic.c
2293
#define myParam(n) numbers[n]
usr.bin/tic/tic.c
2308
#define myParam(n) (p_is_s[n - 1] != 0 ? ((TPARM_ARG) strings[n]) : numbers[n])
usr.bin/tic/tic.c
497
unsigned pass, n, nn;
usr.bin/tic/tic.c
525
for (n = nn = 0, base = src;; n++) {
usr.bin/tic/tic.c
526
int mark = src[n];
usr.bin/tic/tic.c
531
src[n] = '\0';
usr.bin/tic/tic.c
534
base = &src[n + 1];
usr.bin/tic/tic.c
548
for (n = 0; dst[n] != 0; n++)
usr.bin/tic/tic.c
549
fprintf(log_fp, "%u:%s\n", n + 1, dst[n]);
usr.bin/tic/tic.c
561
size_t n;
usr.bin/tic/tic.c
563
for (n = 0; needle[n] != 0; n++) {
usr.bin/tic/tic.c
564
if (_nc_name_match(haystack, needle[n], "|")) {
usr.bin/tic/tparm_type.c
69
unsigned n;
usr.bin/tic/tparm_type.c
70
for (n = 0; n < SIZEOF(table); n++) {
usr.bin/tic/tparm_type.c
71
if (!strcmp(name, table[n].name)) {
usr.bin/tic/tparm_type.c
72
result = table[n].code;
usr.bin/tic/transform.c
52
size_t n;
usr.bin/tic/transform.c
54
for (n = first; n < *len; ++n) {
usr.bin/tic/transform.c
55
if (tolower(UChar(a[n])) != tolower(UChar(ignore[n - first]))) {
usr.bin/tmux/arguments.c
864
int n;
usr.bin/tmux/arguments.c
873
n = strcspn(state->cmd, " ,");
usr.bin/tmux/arguments.c
874
xasprintf(&s, "%.*s", n, state->cmd);
usr.bin/tmux/cmd-capture-pane.c
115
int n, join_lines, flags = 0;
usr.bin/tmux/cmd-capture-pane.c
150
n = args_strtonum_and_expand(args, 'S', INT_MIN, SHRT_MAX,
usr.bin/tmux/cmd-capture-pane.c
155
} else if (n < 0 && (u_int) -n > gd->hsize)
usr.bin/tmux/cmd-capture-pane.c
158
top = gd->hsize + n;
usr.bin/tmux/cmd-capture-pane.c
167
n = args_strtonum_and_expand(args, 'E', INT_MIN, SHRT_MAX,
usr.bin/tmux/cmd-capture-pane.c
172
} else if (n < 0 && (u_int) -n > gd->hsize)
usr.bin/tmux/cmd-capture-pane.c
175
bottom = gd->hsize + n;
usr.bin/tmux/cmd-display-menu.c
111
long n;
usr.bin/tmux/cmd-display-menu.c
181
n = (long)(tty->sx - 1) / 2 - w / 2;
usr.bin/tmux/cmd-display-menu.c
182
if (n < 0)
usr.bin/tmux/cmd-display-menu.c
185
format_add(ft, "popup_centre_x", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
186
n = (tty->sy - 1) / 2 + h / 2;
usr.bin/tmux/cmd-display-menu.c
187
if (n >= tty->sy)
usr.bin/tmux/cmd-display-menu.c
190
format_add(ft, "popup_centre_y", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
194
n = (long)event->m.x - w / 2;
usr.bin/tmux/cmd-display-menu.c
195
if (n < 0)
usr.bin/tmux/cmd-display-menu.c
198
format_add(ft, "popup_mouse_centre_x", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
199
n = event->m.y - h / 2;
usr.bin/tmux/cmd-display-menu.c
200
if (n + h >= tty->sy) {
usr.bin/tmux/cmd-display-menu.c
204
format_add(ft, "popup_mouse_centre_y", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
205
n = (long)event->m.y + h;
usr.bin/tmux/cmd-display-menu.c
206
if (n >= tty->sy)
usr.bin/tmux/cmd-display-menu.c
209
format_add(ft, "popup_mouse_top", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
210
n = event->m.y - h;
usr.bin/tmux/cmd-display-menu.c
211
if (n < 0)
usr.bin/tmux/cmd-display-menu.c
214
format_add(ft, "popup_mouse_bottom", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
219
n = top + wp->yoff - oy + h;
usr.bin/tmux/cmd-display-menu.c
220
if (n >= tty->sy)
usr.bin/tmux/cmd-display-menu.c
223
format_add(ft, "popup_pane_top", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
226
n = (long)wp->xoff + wp->sx - ox - w;
usr.bin/tmux/cmd-display-menu.c
227
if (n < 0)
usr.bin/tmux/cmd-display-menu.c
230
format_add(ft, "popup_pane_right", "%ld", n);
usr.bin/tmux/cmd-display-menu.c
245
n = strtol(p, NULL, 10);
usr.bin/tmux/cmd-display-menu.c
246
if (n + w >= tty->sx)
usr.bin/tmux/cmd-display-menu.c
247
n = tty->sx - w;
usr.bin/tmux/cmd-display-menu.c
248
else if (n < 0)
usr.bin/tmux/cmd-display-menu.c
249
n = 0;
usr.bin/tmux/cmd-display-menu.c
250
*px = n;
usr.bin/tmux/cmd-display-menu.c
267
n = strtol(p, NULL, 10);
usr.bin/tmux/cmd-display-menu.c
268
if (n < h)
usr.bin/tmux/cmd-display-menu.c
269
n = 0;
usr.bin/tmux/cmd-display-menu.c
271
n -= h;
usr.bin/tmux/cmd-display-menu.c
272
if (n + h >= tty->sy)
usr.bin/tmux/cmd-display-menu.c
273
n = tty->sy - h;
usr.bin/tmux/cmd-display-menu.c
274
else if (n < 0)
usr.bin/tmux/cmd-display-menu.c
275
n = 0;
usr.bin/tmux/cmd-display-menu.c
276
*py = n;
usr.bin/tmux/cmd-find.c
353
int idx, n, exact;
usr.bin/tmux/cmd-find.c
377
n = strtonum(window + 1, 1, INT_MAX, NULL);
usr.bin/tmux/cmd-find.c
379
n = 1;
usr.bin/tmux/cmd-find.c
383
if (INT_MAX - s->curw->idx < n)
usr.bin/tmux/cmd-find.c
385
fs->idx = s->curw->idx + n;
usr.bin/tmux/cmd-find.c
387
if (n > s->curw->idx)
usr.bin/tmux/cmd-find.c
389
fs->idx = s->curw->idx - n;
usr.bin/tmux/cmd-find.c
394
fs->wl = winlink_next_by_number(s->curw, s, n);
usr.bin/tmux/cmd-find.c
396
fs->wl = winlink_previous_by_number(s->curw, s, n);
usr.bin/tmux/cmd-find.c
570
u_int n;
usr.bin/tmux/cmd-find.c
615
n = strtonum(pane + 1, 1, INT_MAX, NULL);
usr.bin/tmux/cmd-find.c
617
n = 1;
usr.bin/tmux/cmd-find.c
620
fs->wp = window_pane_next_by_number(fs->w, wp, n);
usr.bin/tmux/cmd-find.c
622
fs->wp = window_pane_previous_by_number(fs->w, wp, n);
usr.bin/tmux/cmd-list-buffers.c
55
u_int i, n;
usr.bin/tmux/cmd-list-buffers.c
69
l = sort_get_buffers(&n, &sort_crit);
usr.bin/tmux/cmd-list-buffers.c
70
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-clients.c
62
u_int i, n;
usr.bin/tmux/cmd-list-clients.c
83
l = sort_get_clients(&n, &sort_crit);
usr.bin/tmux/cmd-list-clients.c
84
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-keys.c
117
*n = len;
usr.bin/tmux/cmd-list-keys.c
123
struct key_binding **l, u_int *n)
usr.bin/tmux/cmd-list-keys.c
128
for (i = 0; i < *n; i++) {
usr.bin/tmux/cmd-list-keys.c
136
*n = j;
usr.bin/tmux/cmd-list-keys.c
178
u_int i, n;
usr.bin/tmux/cmd-list-keys.c
214
l = sort_get_key_bindings_table(table, &n, &sort_crit);
usr.bin/tmux/cmd-list-keys.c
216
l = cmd_list_keys_get_root_and_prefix(&n, &sort_crit);
usr.bin/tmux/cmd-list-keys.c
218
l = sort_get_key_bindings(&n, &sort_crit);
usr.bin/tmux/cmd-list-keys.c
224
&n);
usr.bin/tmux/cmd-list-keys.c
227
n = 1;
usr.bin/tmux/cmd-list-keys.c
232
format_add(ft, "key_has_repeat", "%d", key_bindings_has_repeat(l, n));
usr.bin/tmux/cmd-list-keys.c
233
format_add(ft, "key_string_width", "%u", cmd_list_keys_get_width(l, n));
usr.bin/tmux/cmd-list-keys.c
235
cmd_list_keys_get_table_width(l, n));
usr.bin/tmux/cmd-list-keys.c
236
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-keys.c
240
if ((single && tc != NULL) || n == 1)
usr.bin/tmux/cmd-list-keys.c
70
cmd_list_keys_get_width(struct key_binding **l, u_int n)
usr.bin/tmux/cmd-list-keys.c
74
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-keys.c
83
cmd_list_keys_get_table_width(struct key_binding **l, u_int n)
usr.bin/tmux/cmd-list-keys.c
87
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-keys.c
96
cmd_list_keys_get_root_and_prefix(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/cmd-list-panes.c
101
u_int i, n;
usr.bin/tmux/cmd-list-panes.c
139
l = sort_get_panes_window(wl->window, &n, &sort_crit);
usr.bin/tmux/cmd-list-panes.c
140
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-panes.c
143
format_add(ft, "line", "%u", n);
usr.bin/tmux/cmd-list-sessions.c
57
u_int n, i;
usr.bin/tmux/cmd-list-sessions.c
75
l = sort_get_sessions(&n, &sort_crit);
usr.bin/tmux/cmd-list-sessions.c
76
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-windows.c
65
u_int i, n;
usr.bin/tmux/cmd-list-windows.c
83
l = sort_get_winlinks(&n, &sort_crit);
usr.bin/tmux/cmd-list-windows.c
87
l = sort_get_winlinks_session(target->s, &n, &sort_crit);
usr.bin/tmux/cmd-list-windows.c
92
for (i = 0; i < n; i++) {
usr.bin/tmux/cmd-list-windows.c
96
format_add(ft, "line", "%u", n);
usr.bin/tmux/cmd-paste-buffer.c
51
size_t n;
usr.bin/tmux/cmd-paste-buffer.c
53
n = utf8_stravisx(&cp, buf, len, VIS_SAFE|VIS_NOSLASH);
usr.bin/tmux/cmd-paste-buffer.c
54
bufferevent_write(wp->event, cp, n);
usr.bin/tmux/cmd-send-keys.c
113
long n;
usr.bin/tmux/cmd-send-keys.c
117
n = strtol(s, &endptr, 16);
usr.bin/tmux/cmd-send-keys.c
118
if (*s =='\0' || n < 0 || n > 0xff || *endptr != '\0')
usr.bin/tmux/cmd-send-keys.c
121
KEYC_LITERAL|n));
usr.bin/tmux/cmd-show-messages.c
56
u_int i, n;
usr.bin/tmux/cmd-show-messages.c
58
n = 0;
usr.bin/tmux/cmd-show-messages.c
66
cmdq_print(item, "Terminal %u: %s for %s, flags=0x%x:", n,
usr.bin/tmux/cmd-show-messages.c
68
n++;
usr.bin/tmux/cmd-show-messages.c
72
return (n != 0);
usr.bin/tmux/cmd-source-file.c
110
u_int n;
usr.bin/tmux/cmd-source-file.c
127
n = ++cdata->current;
usr.bin/tmux/cmd-source-file.c
128
if (n < cdata->nfiles)
usr.bin/tmux/cmd-source-file.c
129
file_read(c, cdata->files[n], cmd_source_file_done, cdata);
usr.bin/tmux/cmd.c
433
size_t wanted, n;
usr.bin/tmux/cmd.c
447
n = equals - ov->string;
usr.bin/tmux/cmd.c
448
if (n == wanted && strncmp(name, ov->string, n) == 0)
usr.bin/tmux/colour.c
1085
colour_palette_get(struct colour_palette *p, int n)
usr.bin/tmux/colour.c
1090
if (n >= 90 && n <= 97)
usr.bin/tmux/colour.c
1091
n = 8 + n - 90;
usr.bin/tmux/colour.c
1092
else if (n & COLOUR_FLAG_256)
usr.bin/tmux/colour.c
1093
n &= ~COLOUR_FLAG_256;
usr.bin/tmux/colour.c
1094
else if (n >= 8)
usr.bin/tmux/colour.c
1097
if (p->palette != NULL && p->palette[n] != -1)
usr.bin/tmux/colour.c
1098
return (p->palette[n]);
usr.bin/tmux/colour.c
1099
if (p->default_palette != NULL && p->default_palette[n] != -1)
usr.bin/tmux/colour.c
1100
return (p->default_palette[n]);
usr.bin/tmux/colour.c
1106
colour_palette_set(struct colour_palette *p, int n, int c)
usr.bin/tmux/colour.c
1110
if (p == NULL || n < 0 || n > 255)
usr.bin/tmux/colour.c
1121
p->palette[n] = c;
usr.bin/tmux/colour.c
1131
u_int i, n;
usr.bin/tmux/colour.c
1150
n = options_array_item_index(a);
usr.bin/tmux/colour.c
1151
if (n < 256) {
usr.bin/tmux/colour.c
1153
p->default_palette[n] = c;
usr.bin/tmux/colour.c
231
int n;
usr.bin/tmux/colour.c
239
n = sscanf(s + 1, "%2hhx%2hhx%2hhx", &r, &g, &b);
usr.bin/tmux/colour.c
240
if (n != 3)
usr.bin/tmux/colour.c
246
n = strtonum(s + (sizeof "colour") - 1, 0, 255, &errstr);
usr.bin/tmux/colour.c
249
return (n | COLOUR_FLAG_256);
usr.bin/tmux/colour.c
252
n = strtonum(s + (sizeof "color") - 1, 0, 255, &errstr);
usr.bin/tmux/colour.c
255
return (n | COLOUR_FLAG_256);
usr.bin/tmux/format-draw.c
1091
u_int n, leading_width, width = 0;
usr.bin/tmux/format-draw.c
1098
end = format_leading_hashes(cp, &n, &leading_width);
usr.bin/tmux/format-draw.c
1131
u_int n, width = 0, leading_width;
usr.bin/tmux/format-draw.c
1140
end = format_leading_hashes(cp, &n, &leading_width);
usr.bin/tmux/format-draw.c
1144
if (n == 1)
usr.bin/tmux/format-draw.c
1192
u_int width = 0, total_width, skip, n;
usr.bin/tmux/format-draw.c
1205
end = format_leading_hashes(cp, &n, &leading_width);
usr.bin/tmux/format-draw.c
1214
if (n == 1)
usr.bin/tmux/format-draw.c
648
format_leading_hashes(const char *cp, u_int *n, u_int *width)
usr.bin/tmux/format-draw.c
650
for (*n = 0; cp[*n] == '#'; (*n)++)
usr.bin/tmux/format-draw.c
652
if (*n == 0) {
usr.bin/tmux/format-draw.c
656
if (cp[*n] != '[') {
usr.bin/tmux/format-draw.c
657
if ((*n % 2) == 0)
usr.bin/tmux/format-draw.c
658
*width = (*n / 2);
usr.bin/tmux/format-draw.c
660
*width = (*n / 2) + 1;
usr.bin/tmux/format-draw.c
661
return (cp + *n);
usr.bin/tmux/format-draw.c
663
*width = (*n / 2);
usr.bin/tmux/format-draw.c
664
if ((*n % 2) == 0) {
usr.bin/tmux/format-draw.c
670
return (cp + *n);
usr.bin/tmux/format-draw.c
673
return (cp + *n - 1);
usr.bin/tmux/format-draw.c
679
u_int n)
usr.bin/tmux/format-draw.c
684
for (i = 0; i < n; i++)
usr.bin/tmux/format-draw.c
714
u_int ocx = os->cx, ocy = os->cy, n, i, width[TOTAL];
usr.bin/tmux/format-draw.c
760
for (n = 1; cp[n] == '#'; n++)
usr.bin/tmux/format-draw.c
762
even = ((n % 2) == 0);
usr.bin/tmux/format-draw.c
763
if (cp[n] != '[') {
usr.bin/tmux/format-draw.c
764
cp += n;
usr.bin/tmux/format-draw.c
766
n = (n / 2);
usr.bin/tmux/format-draw.c
768
n = (n / 2) + 1;
usr.bin/tmux/format-draw.c
769
width[current] += n;
usr.bin/tmux/format-draw.c
770
format_draw_many(&ctx[current], &sy, '#', n);
usr.bin/tmux/format-draw.c
774
cp += (n + 1);
usr.bin/tmux/format-draw.c
776
cp += (n - 1);
usr.bin/tmux/format-draw.c
779
format_draw_many(&ctx[current], &sy, '#', n / 2);
usr.bin/tmux/format-draw.c
780
width[current] += (n / 2);
usr.bin/tmux/format.c
1114
u_int n = 0;
usr.bin/tmux/format.c
1122
n++;
usr.bin/tmux/format.c
1123
xasprintf(&value, "%u", n);
usr.bin/tmux/format.c
1690
size_t n;
usr.bin/tmux/format.c
1693
n = strlen(cfg_files[i]) + 1;
usr.bin/tmux/format.c
1694
s = xrealloc(s, slen + n + 1);
usr.bin/tmux/format.c
1695
slen += xsnprintf(s + slen, n + 1, "%s,", cfg_files[i]);
usr.bin/tmux/format.c
2424
u_int n = 0;
usr.bin/tmux/format.c
2427
n++;
usr.bin/tmux/format.c
2428
return (format_printf("%u", n));
usr.bin/tmux/format.c
2838
u_int n = 0;
usr.bin/tmux/format.c
2847
n++;
usr.bin/tmux/format.c
2853
n++;
usr.bin/tmux/format.c
2855
return (format_printf("%u", n));
usr.bin/tmux/format.c
4238
const char *c, size_t n, char **argv, int argc)
usr.bin/tmux/format.c
4245
memcpy(fm->modifier, c, n);
usr.bin/tmux/format.c
4246
fm->modifier[n] = '\0';
usr.bin/tmux/format.c
4247
fm->size = n;
usr.bin/tmux/format.c
4526
int i, n, last = 0;
usr.bin/tmux/format.c
4536
l = sort_get_sessions(&n, sc);
usr.bin/tmux/format.c
4537
for (i = 0; i < n; i++) {
usr.bin/tmux/format.c
4546
if (i == n - 1)
usr.bin/tmux/format.c
4637
int i, n, last = 0;
usr.bin/tmux/format.c
4652
l = sort_get_winlinks_session(ft->s, &n, sc);
usr.bin/tmux/format.c
4653
for (i = 0; i < n; i++) {
usr.bin/tmux/format.c
4661
if (i == n - 1)
usr.bin/tmux/format.c
4671
i + 1 < n && l[i + 1] == ft->s->curw);
usr.bin/tmux/format.c
4672
if (i + 1 < n)
usr.bin/tmux/format.c
4708
int i, n, last = 0;
usr.bin/tmux/format.c
4723
l = sort_get_panes_window(ft->w, &n, sc);
usr.bin/tmux/format.c
4724
for (i = 0; i < n; i++) {
usr.bin/tmux/format.c
4731
if (i == n - 1)
usr.bin/tmux/format.c
4766
int i, n, last = 0;
usr.bin/tmux/format.c
4771
l = sort_get_clients(&n, sc);
usr.bin/tmux/format.c
4772
for (i = 0; i < n; i++) {
usr.bin/tmux/format.c
4775
if (i == n - 1)
usr.bin/tmux/format.c
5508
size_t off, len, n, outlen;
usr.bin/tmux/format.c
5565
n = ptr - fmt;
usr.bin/tmux/format.c
5567
name = xstrndup(fmt, n);
usr.bin/tmux/format.c
5590
fmt += n + 1;
usr.bin/tmux/format.c
5596
n = ptr - fmt;
usr.bin/tmux/format.c
5598
format_log(es, "found #{}: %.*s", (int)n, fmt);
usr.bin/tmux/format.c
5599
if (format_replace(es, fmt, n, &buf, &len, &off) != 0)
usr.bin/tmux/format.c
5601
fmt += n + 1;
usr.bin/tmux/format.c
5610
n = 2 - (ch == '[');
usr.bin/tmux/format.c
5613
n++;
usr.bin/tmux/format.c
5617
format_log(es, "found #*%zu[", n);
usr.bin/tmux/format.c
5618
while (len - off < n + 2) {
usr.bin/tmux/format.c
5622
memcpy(buf + off, fmt - 2, n + 1);
usr.bin/tmux/format.c
5623
off += n + 1;
usr.bin/tmux/format.c
5654
n = strlen(s);
usr.bin/tmux/format.c
5656
if (format_replace(es, s, n, &buf, &len, &off) != 0)
usr.bin/tmux/format.c
698
u_int n = 0;
usr.bin/tmux/format.c
707
n++;
usr.bin/tmux/format.c
710
xasprintf(&value, "%u", n);
usr.bin/tmux/format.c
753
u_int n = 0;
usr.bin/tmux/format.c
766
n++;
usr.bin/tmux/format.c
769
xasprintf(&value, "%u", n);
usr.bin/tmux/grid.c
1004
s[n++] = 0;
usr.bin/tmux/grid.c
1012
s[n++] = attrs[i].code;
usr.bin/tmux/grid.c
1017
if (n > 0) {
usr.bin/tmux/grid.c
1022
for (i = 0; i < n; i++) {
usr.bin/tmux/grid.c
1030
if (i + 1 < n)
usr.bin/tmux/grid.c
1039
grid_string_cells_add_code(buf, len, n, s, newc, oldc, nnewc, noldc,
usr.bin/tmux/grid.c
1045
grid_string_cells_add_code(buf, len, n, s, newc, oldc, nnewc, noldc,
usr.bin/tmux/grid.c
1051
grid_string_cells_add_code(buf, len, n, s, newc, oldc, nnewc, noldc,
usr.bin/tmux/grid.c
1229
grid_reflow_add(struct grid *gd, u_int n)
usr.bin/tmux/grid.c
1232
u_int sy = gd->sy + n;
usr.bin/tmux/grid.c
1236
memset(gl, 0, n * (sizeof *gl));
usr.bin/tmux/grid.c
788
size_t n;
usr.bin/tmux/grid.c
791
n = 0;
usr.bin/tmux/grid.c
793
values[n++] = 38;
usr.bin/tmux/grid.c
794
values[n++] = 5;
usr.bin/tmux/grid.c
795
values[n++] = gc->fg & 0xff;
usr.bin/tmux/grid.c
797
values[n++] = 38;
usr.bin/tmux/grid.c
798
values[n++] = 2;
usr.bin/tmux/grid.c
800
values[n++] = r;
usr.bin/tmux/grid.c
801
values[n++] = g;
usr.bin/tmux/grid.c
802
values[n++] = b;
usr.bin/tmux/grid.c
813
values[n++] = gc->fg + 30;
usr.bin/tmux/grid.c
816
values[n++] = 39;
usr.bin/tmux/grid.c
826
values[n++] = gc->fg;
usr.bin/tmux/grid.c
830
return (n);
usr.bin/tmux/grid.c
837
size_t n;
usr.bin/tmux/grid.c
840
n = 0;
usr.bin/tmux/grid.c
842
values[n++] = 48;
usr.bin/tmux/grid.c
843
values[n++] = 5;
usr.bin/tmux/grid.c
844
values[n++] = gc->bg & 0xff;
usr.bin/tmux/grid.c
846
values[n++] = 48;
usr.bin/tmux/grid.c
847
values[n++] = 2;
usr.bin/tmux/grid.c
849
values[n++] = r;
usr.bin/tmux/grid.c
850
values[n++] = g;
usr.bin/tmux/grid.c
851
values[n++] = b;
usr.bin/tmux/grid.c
862
values[n++] = gc->bg + 40;
usr.bin/tmux/grid.c
865
values[n++] = 49;
usr.bin/tmux/grid.c
875
values[n++] = gc->bg + 10;
usr.bin/tmux/grid.c
879
return (n);
usr.bin/tmux/grid.c
886
size_t n;
usr.bin/tmux/grid.c
889
n = 0;
usr.bin/tmux/grid.c
891
values[n++] = 58;
usr.bin/tmux/grid.c
892
values[n++] = 5;
usr.bin/tmux/grid.c
893
values[n++] = gc->us & 0xff;
usr.bin/tmux/grid.c
895
values[n++] = 58;
usr.bin/tmux/grid.c
896
values[n++] = 2;
usr.bin/tmux/grid.c
898
values[n++] = r;
usr.bin/tmux/grid.c
899
values[n++] = g;
usr.bin/tmux/grid.c
900
values[n++] = b;
usr.bin/tmux/grid.c
902
return (n);
usr.bin/tmux/grid.c
907
grid_string_cells_add_code(char *buf, size_t len, u_int n, int *s, int *newc,
usr.bin/tmux/grid.c
912
int reset = (n != 0 && s[0] == 0);
usr.bin/tmux/grid.c
974
size_t noldc, nnewc, n, i;
usr.bin/tmux/grid.c
997
n = 0;
usr.bin/tmux/input.c
1444
int i, n, m, ek, set, p;
usr.bin/tmux/input.c
1469
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1470
if (n == -1)
usr.bin/tmux/input.c
1472
while (cx > 0 && n-- > 0) {
usr.bin/tmux/input.c
1480
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1481
if (n != -1)
usr.bin/tmux/input.c
1482
screen_write_cursorleft(sctx, n);
usr.bin/tmux/input.c
1485
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1486
if (n != -1)
usr.bin/tmux/input.c
1487
screen_write_cursordown(sctx, n);
usr.bin/tmux/input.c
1490
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1491
if (n != -1)
usr.bin/tmux/input.c
1492
screen_write_cursorright(sctx, n);
usr.bin/tmux/input.c
1495
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1497
if (n != -1 && m != -1)
usr.bin/tmux/input.c
1498
screen_write_cursormove(sctx, m - 1, n - 1, 1);
usr.bin/tmux/input.c
1501
n = input_get(ictx, 0, 0, 0);
usr.bin/tmux/input.c
1502
if (n != 4)
usr.bin/tmux/input.c
1520
n = input_get(ictx, 0, 0, 0);
usr.bin/tmux/input.c
1521
if (n != 4)
usr.bin/tmux/input.c
1537
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1538
if (n != -1)
usr.bin/tmux/input.c
1539
screen_write_cursorup(sctx, n);
usr.bin/tmux/input.c
1542
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1543
if (n != -1) {
usr.bin/tmux/input.c
1545
screen_write_cursordown(sctx, n);
usr.bin/tmux/input.c
1549
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1550
if (n != -1) {
usr.bin/tmux/input.c
1552
screen_write_cursorup(sctx, n);
usr.bin/tmux/input.c
1580
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1581
if (n != -1)
usr.bin/tmux/input.c
1582
screen_write_clearcharacter(sctx, n, bg);
usr.bin/tmux/input.c
1585
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1586
if (n != -1)
usr.bin/tmux/input.c
1587
screen_write_deletecharacter(sctx, n, bg);
usr.bin/tmux/input.c
1590
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1592
if (n != -1 && m != -1)
usr.bin/tmux/input.c
1593
screen_write_scrollregion(sctx, n - 1, m - 1);
usr.bin/tmux/input.c
1596
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1597
if (n != -1)
usr.bin/tmux/input.c
1598
screen_write_deleteline(sctx, n, bg);
usr.bin/tmux/input.c
1612
n = (s->mode & MODE_CURSOR_BLINKING) ? 1 : 2;
usr.bin/tmux/input.c
1621
n = (p == 1 || p == 3 || p == 5) ? 1 : 2;
usr.bin/tmux/input.c
1623
input_reply(ictx, 1, "\033[?12;%d$y", n);
usr.bin/tmux/input.c
1626
n = (s->mode & MODE_FOCUSON) ? 1 : 2;
usr.bin/tmux/input.c
1627
input_reply(ictx, 1, "\033[?1004;%d$y", n);
usr.bin/tmux/input.c
1630
n = (s->mode & MODE_MOUSE_SGR) ? 1 : 2;
usr.bin/tmux/input.c
1631
input_reply(ictx, 1, "\033[?1006;%d$y", n);
usr.bin/tmux/input.c
1634
n = (s->mode & MODE_BRACKETPASTE) ? 1 : 2;
usr.bin/tmux/input.c
1635
input_reply(ictx, 1, "\033[?2004;%d$y", n);
usr.bin/tmux/input.c
1638
n = (s->mode & MODE_SYNC) ? 1 : 2;
usr.bin/tmux/input.c
1639
input_reply(ictx, 1, "\033[?2026;%d$y", n);
usr.bin/tmux/input.c
1708
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1709
if (n != -1)
usr.bin/tmux/input.c
1710
screen_write_cursormove(sctx, n - 1, -1, 1);
usr.bin/tmux/input.c
1713
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1714
if (n != -1)
usr.bin/tmux/input.c
1715
screen_write_insertcharacter(sctx, n, bg);
usr.bin/tmux/input.c
1718
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1719
if (n != -1)
usr.bin/tmux/input.c
1720
screen_write_insertline(sctx, n, bg);
usr.bin/tmux/input.c
1723
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1724
if (n == -1)
usr.bin/tmux/input.c
1728
if (n > m)
usr.bin/tmux/input.c
1729
n = m;
usr.bin/tmux/input.c
1740
for (i = 0; i < n; i++)
usr.bin/tmux/input.c
1768
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1769
if (n != -1)
usr.bin/tmux/input.c
1770
screen_write_scrollup(sctx, n, bg);
usr.bin/tmux/input.c
1773
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1774
if (n != -1)
usr.bin/tmux/input.c
1775
screen_write_scrolldown(sctx, n, bg);
usr.bin/tmux/input.c
1794
n = input_get(ictx, 0, 1, 1);
usr.bin/tmux/input.c
1795
if (n != -1)
usr.bin/tmux/input.c
1796
screen_write_cursormove(sctx, -1, n - 1, 1);
usr.bin/tmux/input.c
1799
n = input_get(ictx, 0, 0, 0);
usr.bin/tmux/input.c
1800
if (n == -1)
usr.bin/tmux/input.c
1802
screen_set_cursor_style(n, &s->cstyle, &s->mode);
usr.bin/tmux/input.c
1803
if (n == 0) {
usr.bin/tmux/input.c
1809
n = input_get(ictx, 0, 0, 0);
usr.bin/tmux/input.c
1810
if (n == 0) {
usr.bin/tmux/input.c
2041
int n, m;
usr.bin/tmux/input.c
2047
while ((n = input_get(ictx, m, 0, -1)) != -1) {
usr.bin/tmux/input.c
2048
switch (n) {
usr.bin/tmux/input.c
2208
u_int n;
usr.bin/tmux/input.c
2211
for (n = 0; n < nitems(p); n++)
usr.bin/tmux/input.c
2212
p[n] = -1;
usr.bin/tmux/input.c
2213
n = 0;
usr.bin/tmux/input.c
2218
p[n++] = strtonum(out, 0, INT_MAX, &errstr);
usr.bin/tmux/input.c
2219
if (errstr != NULL || n == nitems(p)) {
usr.bin/tmux/input.c
2224
n++;
usr.bin/tmux/input.c
2225
if (n == nitems(p)) {
usr.bin/tmux/input.c
2230
log_debug("%s: %u = %d", __func__, n - 1, p[n - 1]);
usr.bin/tmux/input.c
2234
if (n == 0)
usr.bin/tmux/input.c
2237
if (n != 2)
usr.bin/tmux/input.c
2266
if (n < 2 || (p[0] != 38 && p[0] != 48 && p[0] != 58))
usr.bin/tmux/input.c
2270
if (n < 3)
usr.bin/tmux/input.c
2272
if (n == 5)
usr.bin/tmux/input.c
2276
if (n < i + 3)
usr.bin/tmux/input.c
2282
if (n < 3)
usr.bin/tmux/input.c
2295
int n;
usr.bin/tmux/input.c
2307
n = input_get(ictx, i, 0, 0);
usr.bin/tmux/input.c
2308
if (n == -1)
usr.bin/tmux/input.c
2311
if (n == 38 || n == 48 || n == 58) {
usr.bin/tmux/input.c
2315
input_csi_dispatch_sgr_rgb(ictx, n, &i);
usr.bin/tmux/input.c
2318
input_csi_dispatch_sgr_256(ictx, n, &i);
usr.bin/tmux/input.c
2324
switch (n) {
usr.bin/tmux/input.c
2389
gc->fg = n - 30;
usr.bin/tmux/input.c
2402
gc->bg = n - 40;
usr.bin/tmux/input.c
2424
gc->fg = n;
usr.bin/tmux/input.c
2434
gc->bg = n - 10;
usr.bin/tmux/input.c
2793
input_osc_colour_reply(struct input_ctx *ictx, int add, u_int n, int idx, int c,
usr.bin/tmux/input.c
2810
if (n == 4) {
usr.bin/tmux/input.c
2813
n, idx, r, r, g, g, b, b, end);
usr.bin/tmux/input.c
2817
n, r, r, g, g, b, b, end);
usr.bin/tmux/job.c
441
u_int n = 0;
usr.bin/tmux/job.c
449
n, job->cmd, job->fd, (long)job->pid, job->status);
usr.bin/tmux/job.c
450
n++;
usr.bin/tmux/key-bindings.c
709
key_bindings_has_repeat(struct key_binding **l, u_int n)
usr.bin/tmux/key-bindings.c
713
for (i = 0; i < n; i++) {
usr.bin/tmux/layout-custom.c
124
u_int n = 0;
usr.bin/tmux/layout-custom.c
135
n += lcchild->sx + 1;
usr.bin/tmux/layout-custom.c
137
if (n - 1 != lc->sx)
usr.bin/tmux/layout-custom.c
146
n += lcchild->sy + 1;
usr.bin/tmux/layout-custom.c
148
if (n - 1 != lc->sy)
usr.bin/tmux/layout-set.c
131
u_int n, sx, sy;
usr.bin/tmux/layout-set.c
136
n = window_count_panes(w);
usr.bin/tmux/layout-set.c
137
if (n <= 1)
usr.bin/tmux/layout-set.c
144
sx = (n * (PANE_MINIMUM + 1)) - 1;
usr.bin/tmux/layout-set.c
149
sy = (n * (PANE_MINIMUM + 1)) - 1;
usr.bin/tmux/layout-set.c
197
u_int n, mainh, otherh, sx, sy;
usr.bin/tmux/layout-set.c
204
n = window_count_panes(w);
usr.bin/tmux/layout-set.c
205
if (n <= 1)
usr.bin/tmux/layout-set.c
207
n--; /* take off main pane */
usr.bin/tmux/layout-set.c
240
sx = (n * (PANE_MINIMUM + 1)) - 1;
usr.bin/tmux/layout-set.c
259
if (n == 1) {
usr.bin/tmux/layout-set.c
295
u_int n, mainh, otherh, sx, sy;
usr.bin/tmux/layout-set.c
302
n = window_count_panes(w);
usr.bin/tmux/layout-set.c
303
if (n <= 1)
usr.bin/tmux/layout-set.c
305
n--; /* take off main pane */
usr.bin/tmux/layout-set.c
338
sx = (n * (PANE_MINIMUM + 1)) - 1;
usr.bin/tmux/layout-set.c
351
if (n == 1) {
usr.bin/tmux/layout-set.c
393
u_int n, mainw, otherw, sx, sy;
usr.bin/tmux/layout-set.c
400
n = window_count_panes(w);
usr.bin/tmux/layout-set.c
401
if (n <= 1)
usr.bin/tmux/layout-set.c
403
n--; /* take off main pane */
usr.bin/tmux/layout-set.c
436
sy = (n * (PANE_MINIMUM + 1)) - 1;
usr.bin/tmux/layout-set.c
455
if (n == 1) {
usr.bin/tmux/layout-set.c
491
u_int n, mainw, otherw, sx, sy;
usr.bin/tmux/layout-set.c
498
n = window_count_panes(w);
usr.bin/tmux/layout-set.c
499
if (n <= 1)
usr.bin/tmux/layout-set.c
501
n--; /* take off main pane */
usr.bin/tmux/layout-set.c
534
sy = (n * (PANE_MINIMUM + 1)) - 1;
usr.bin/tmux/layout-set.c
547
if (n == 1) {
usr.bin/tmux/layout-set.c
590
u_int n, width, height, used, sx, sy;
usr.bin/tmux/layout-set.c
596
n = window_count_panes(w);
usr.bin/tmux/layout-set.c
597
if (n <= 1)
usr.bin/tmux/layout-set.c
605
while (rows * columns < n) {
usr.bin/tmux/layout-set.c
607
if (rows * columns < n &&
usr.bin/tmux/layout-set.c
645
if (n - (j * columns) == 1 || columns == 1) {
usr.bin/tmux/layout.c
115
log_debug("%s:%*s%p type %s [parent %p] wp=%p [%u,%u %ux%u]", hdr, n,
usr.bin/tmux/layout.c
122
layout_print_cell(lcchild, hdr, n + 1);
usr.bin/tmux/layout.c
96
layout_print_cell(struct layout_cell *lc, const char *hdr, u_int n)
usr.bin/tmux/mode-tree.c
742
size_t size, n;
usr.bin/tmux/mode-tree.c
889
n = (sizeof "no matches") - 1;
usr.bin/tmux/mode-tree.c
891
n = (sizeof "active") - 1;
usr.bin/tmux/mode-tree.c
892
if (mtd->filter != NULL && w - 2 >= strlen(text) + 10 + n + 2) {
usr.bin/tmux/options.c
1064
int n = 0, choice = -1;
usr.bin/tmux/options.c
1068
choice = n;
usr.bin/tmux/options.c
1069
n++;
usr.bin/tmux/proc.c
76
ssize_t n;
usr.bin/tmux/proc.c
85
if ((n = imsg_get(&peer->ibuf, &imsg)) == -1) {
usr.bin/tmux/proc.c
89
if (n == 0)
usr.bin/tmux/regsub.c
38
regmatch_t *m, u_int n)
usr.bin/tmux/regsub.c
48
if (i < n && m[i].rm_so != m[i].rm_eo) {
usr.bin/tmux/resize.c
102
u_int n = 0;
usr.bin/tmux/resize.c
107
if (++n > 1)
usr.bin/tmux/resize.c
110
return (n);
usr.bin/tmux/resize.c
121
u_int cx, cy, n = 0;
usr.bin/tmux/resize.c
145
n = clients_with_window(w);
usr.bin/tmux/resize.c
167
if (type == WINDOW_SIZE_LATEST && n > 1 && loop != w->latest) {
usr.bin/tmux/screen-write.c
1681
screen_write_collect_clear(struct screen_write_ctx *ctx, u_int y, u_int n)
usr.bin/tmux/screen-write.c
1686
for (i = y; i < y + n; i++) {
usr.bin/tmux/screen-write.c
2097
u_int n, cx = s->cx, cy = s->cy;
usr.bin/tmux/screen-write.c
2127
n = 1;
usr.bin/tmux/screen-write.c
2128
grid_view_get_cell(gd, cx - n, cy, &last);
usr.bin/tmux/screen-write.c
2130
n = 2;
usr.bin/tmux/screen-write.c
2131
grid_view_get_cell(gd, cx - n, cy, &last);
usr.bin/tmux/screen-write.c
2133
if (n != last.data.width || (last.flags & GRID_FLAG_PADDING))
usr.bin/tmux/screen-write.c
2169
cx - n, cy, n, last.data.width);
usr.bin/tmux/screen-write.c
2178
n = 2;
usr.bin/tmux/screen-write.c
2184
grid_view_set_cell(gd, cx - n, cy, &last);
usr.bin/tmux/screen-write.c
2194
screen_write_set_cursor(ctx, cx - n, cy);
usr.bin/tmux/screen.c
771
int n;
usr.bin/tmux/screen.c
783
n = snprintf(buf + last, len - last, "%.4d \"", y);
usr.bin/tmux/screen.c
784
if (n <= 0 || (u_int)n >= len - last)
usr.bin/tmux/screen.c
786
last += n;
usr.bin/tmux/screen.c
805
n = strlen(acs);
usr.bin/tmux/screen.c
808
n = 1;
usr.bin/tmux/screen.c
810
if (last + n + 1 >= len)
usr.bin/tmux/screen.c
812
memcpy(buf + last, acs, n);
usr.bin/tmux/screen.c
813
last += n;
usr.bin/tmux/server-client.c
170
server_client_ensure_ranges(struct visible_ranges *r, u_int n)
usr.bin/tmux/server-client.c
172
if (r->size >= n)
usr.bin/tmux/server-client.c
1720
u_int cx = 0, cy = 0, ox, oy, sx, sy, n;
usr.bin/tmux/server-client.c
174
r->ranges = xrecallocarray(r->ranges, r->size, n, sizeof *r->ranges);
usr.bin/tmux/server-client.c
175
r->size = n;
usr.bin/tmux/server-client.c
1750
n = options_get_number(oo, "status-position");
usr.bin/tmux/server-client.c
1751
if (n == 0)
usr.bin/tmux/server-client.c
1754
n = status_line_size(c) - status_prompt_line_at(c);
usr.bin/tmux/server-client.c
1755
if (n <= tty->sy)
usr.bin/tmux/server-client.c
1756
cy = tty->sy - n;
usr.bin/tmux/server-client.c
706
u_int x, y, sx, sy, px, py, n, sl_mpos = 0;
usr.bin/tmux/server-client.c
74
u_int n;
usr.bin/tmux/server-client.c
76
n = 0;
usr.bin/tmux/server-client.c
79
n++;
usr.bin/tmux/server-client.c
81
return (n);
usr.bin/tmux/server-client.c
848
n = sr->argument; /* parsing keeps this < 10 */
usr.bin/tmux/server-client.c
849
log_debug("mouse range: control %u", n);
usr.bin/tmux/server-client.c
850
loc = KEYC_MOUSE_LOCATION_CONTROL0 + n;
usr.bin/tmux/server-client.c
894
n = sr->argument;
usr.bin/tmux/server-client.c
895
loc = KEYC_MOUSE_LOCATION_CONTROL0 + n;
usr.bin/tmux/server.c
331
int n, mode;
usr.bin/tmux/server.c
334
n = 0;
usr.bin/tmux/server.c
337
n++;
usr.bin/tmux/server.c
342
if (n != last) {
usr.bin/tmux/server.c
343
last = n;
usr.bin/tmux/server.c
348
if (n != 0) {
usr.bin/tmux/session.c
301
u_int n, i;
usr.bin/tmux/session.c
306
l = sort_get_sessions(&n, sort_crit);
usr.bin/tmux/session.c
307
for (i = 0; i < n; i++) {
usr.bin/tmux/session.c
311
if (i == n)
usr.bin/tmux/session.c
314
if (i == n)
usr.bin/tmux/session.c
324
u_int n, i;
usr.bin/tmux/session.c
329
l = sort_get_sessions(&n, sort_crit);
usr.bin/tmux/session.c
330
for (i = 0; i < n; i++) {
usr.bin/tmux/session.c
334
if (i == n)
usr.bin/tmux/session.c
337
i = n;
usr.bin/tmux/session.c
593
u_int n;
usr.bin/tmux/session.c
595
n = 0;
usr.bin/tmux/session.c
597
n++;
usr.bin/tmux/session.c
598
return (n);
usr.bin/tmux/session.c
606
u_int n;
usr.bin/tmux/session.c
608
n = 0;
usr.bin/tmux/session.c
610
n += s->attached;
usr.bin/tmux/session.c
611
return (n);
usr.bin/tmux/sort.c
396
sort_get_buffers(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/sort.c
413
*n = i;
usr.bin/tmux/sort.c
419
sort_get_clients(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/sort.c
436
*n = i;
usr.bin/tmux/sort.c
442
sort_get_sessions(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/sort.c
459
*n = i;
usr.bin/tmux/sort.c
465
sort_get_panes(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/sort.c
490
*n = i;
usr.bin/tmux/sort.c
496
sort_get_panes_session(struct session *s, u_int *n,
usr.bin/tmux/sort.c
519
*n = i;
usr.bin/tmux/sort.c
525
sort_get_panes_window(struct window *w, u_int *n,
usr.bin/tmux/sort.c
543
*n = i;
usr.bin/tmux/sort.c
549
sort_get_winlinks(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/sort.c
569
*n = i;
usr.bin/tmux/sort.c
575
sort_get_winlinks_session(struct session *s, u_int *n,
usr.bin/tmux/sort.c
593
*n = i;
usr.bin/tmux/sort.c
599
sort_get_key_bindings(u_int *n, struct sort_criteria *sort_crit)
usr.bin/tmux/sort.c
622
*n = i;
usr.bin/tmux/sort.c
628
sort_get_key_bindings_table(struct key_table *table, u_int *n,
usr.bin/tmux/sort.c
647
*n = i;
usr.bin/tmux/status.c
1130
size_t size, n, bufsize;
usr.bin/tmux/status.c
1138
n = utf8_strlen(c->prompt_saved);
usr.bin/tmux/status.c
1162
n = udp - ud;
usr.bin/tmux/status.c
1164
if (n != 0) {
usr.bin/tmux/status.c
1165
c->prompt_buffer = xreallocarray(c->prompt_buffer, size + n + 1,
usr.bin/tmux/status.c
1169
n * sizeof *c->prompt_buffer);
usr.bin/tmux/status.c
1170
c->prompt_index += n;
usr.bin/tmux/status.c
1173
memmove(c->prompt_buffer + c->prompt_index + n,
usr.bin/tmux/status.c
1178
n * sizeof *c->prompt_buffer);
usr.bin/tmux/status.c
1179
c->prompt_index += n;
usr.bin/tmux/status.c
1192
size_t size, n, off, idx, used;
usr.bin/tmux/status.c
1239
n = size - (last - c->prompt_buffer) + 1; /* with \0 */
usr.bin/tmux/status.c
1240
memmove(first, last, n * sizeof *c->prompt_buffer);
usr.bin/tmux/status.c
1249
memmove(first + strlen(s), first, n * sizeof *c->prompt_buffer);
usr.bin/tmux/status.c
2072
char *out, *tmp, n[11];
usr.bin/tmux/status.c
2080
xsnprintf(n, sizeof n, "%u", loop->id);
usr.bin/tmux/status.c
2082
strncmp(n, s + 1, strlen(s) - 1) == 0) {
usr.bin/tmux/status.c
2085
xasprintf(&(*list)[(*size)++], "$%s:", n);
usr.bin/tmux/status.c
364
u_int lines, i, n, width = c->tty.sx;
usr.bin/tmux/status.c
413
for (n = 0; n < width * lines; n++)
usr.bin/tmux/status.c
421
for (n = 0; n < width; n++)
usr.bin/tmux/status.c
436
for (n = 0; n < width; n++)
usr.bin/tmux/status.c
586
size_t n = 0;
usr.bin/tmux/status.c
590
n++;
usr.bin/tmux/status.c
592
p = out = xmalloc(strlen(s) + n + 1);
usr.bin/tmux/status.c
850
u_int i, lines, offset, left, start, width, n;
usr.bin/tmux/status.c
866
n = options_get_number(s->options, "prompt-cursor-colour");
usr.bin/tmux/status.c
867
sl->active->default_ccolour = n;
usr.bin/tmux/status.c
869
n = options_get_number(s->options, "prompt-command-cursor-style");
usr.bin/tmux/status.c
871
n = options_get_number(s->options, "prompt-cursor-style");
usr.bin/tmux/status.c
872
screen_set_cursor_style(n, &sl->active->default_cstyle,
usr.bin/tmux/style.c
143
n = strtonum(found, 0, 9, &errstr);
usr.bin/tmux/style.c
147
sy->range_argument = n;
usr.bin/tmux/style.c
154
n = strtonum(found + 1, 0, UINT_MAX, &errstr);
usr.bin/tmux/style.c
158
sy->range_argument = n;
usr.bin/tmux/style.c
163
n = strtonum(found, 0, UINT_MAX, &errstr);
usr.bin/tmux/style.c
167
sy->range_argument = n;
usr.bin/tmux/style.c
174
n = strtonum(found + 1, 0, UINT_MAX, &errstr);
usr.bin/tmux/style.c
178
sy->range_argument = n;
usr.bin/tmux/style.c
240
n = strtonum(tmp + 6, 0, 100, &errstr);
usr.bin/tmux/style.c
243
sy->width = (int)n;
usr.bin/tmux/style.c
246
n = strtonum(tmp + 6, 0, UINT_MAX, &errstr);
usr.bin/tmux/style.c
249
sy->width = (int)n;
usr.bin/tmux/style.c
253
n = strtonum(tmp + 4, 0, UINT_MAX, &errstr);
usr.bin/tmux/style.c
256
sy->pad = (int)n;
usr.bin/tmux/style.c
67
u_int n;
usr.bin/tmux/tmux.c
146
expand_paths(const char *s, char ***paths, u_int *n, int no_realpath)
usr.bin/tmux/tmux.c
154
*n = 0;
usr.bin/tmux/tmux.c
175
for (i = 0; i < *n; i++) {
usr.bin/tmux/tmux.c
179
if (i != *n) {
usr.bin/tmux/tmux.c
184
*paths = xreallocarray(*paths, (*n) + 1, sizeof *paths);
usr.bin/tmux/tmux.c
185
(*paths)[(*n)++] = path;
usr.bin/tmux/tmux.c
194
u_int i, n;
usr.bin/tmux/tmux.c
203
expand_paths(TMUX_SOCK, &paths, &n, 0);
usr.bin/tmux/tmux.c
204
if (n == 0) {
usr.bin/tmux/tmux.c
209
for (i = 1; i < n; i++)
usr.bin/tmux/tty-keys.c
1428
u_int i, n = 0;
usr.bin/tmux/tty-keys.c
1467
p[n] = strtoul(next, &endptr, 10);
usr.bin/tmux/tty-keys.c
1469
p[n] = 0;
usr.bin/tmux/tty-keys.c
1470
if (++n == nitems(p))
usr.bin/tmux/tty-keys.c
1481
for (i = 1; i < n; i++) {
usr.bin/tmux/tty-keys.c
1512
u_int i, n = 0;
usr.bin/tmux/tty-keys.c
1551
p[n] = strtoul(next, &endptr, 10);
usr.bin/tmux/tty-keys.c
1553
p[n] = 0;
usr.bin/tmux/tty-keys.c
1554
if (++n == nitems(p))
usr.bin/tmux/tty-keys.c
1665
int n;
usr.bin/tmux/tty-keys.c
1712
n = colour_parseX11(tmp);
usr.bin/tmux/tty-keys.c
1713
if (n != -1 && buf[3] == '0') {
usr.bin/tmux/tty-keys.c
1715
log_debug("%s fg is %s", c->name, colour_tostring(n));
usr.bin/tmux/tty-keys.c
1717
log_debug("fg is %s", colour_tostring(n));
usr.bin/tmux/tty-keys.c
1718
*fg = n;
usr.bin/tmux/tty-keys.c
1720
} else if (n != -1) {
usr.bin/tmux/tty-keys.c
1722
log_debug("%s bg is %s", c->name, colour_tostring(n));
usr.bin/tmux/tty-keys.c
1724
log_debug("bg is %s", colour_tostring(n));
usr.bin/tmux/tty-keys.c
1725
*bg = n;
usr.bin/tmux/tty-keys.c
739
int delay, expired = 0, n;
usr.bin/tmux/tty-keys.c
856
n = tty_keys_next1(tty, buf, len, &key, &size, expired);
usr.bin/tmux/tty-keys.c
857
if (n == 0) /* found */
usr.bin/tmux/tty-keys.c
859
if (n == 1)
usr.bin/tmux/tty-keys.c
868
n = tty_keys_next1(tty, buf + 1, len - 1, &key, &size, expired);
usr.bin/tmux/tty-keys.c
869
if (n == 0) { /* found */
usr.bin/tmux/tty-keys.c
886
if (n == 1) /* partial */
usr.bin/tmux/tty-term.c
331
size_t n = 0, at = *offset;
usr.bin/tmux/tty-term.c
339
value[n++] = ':';
usr.bin/tmux/tty-term.c
344
value[n++] = s[at];
usr.bin/tmux/tty-term.c
347
if (n == (sizeof value) - 1)
usr.bin/tmux/tty-term.c
354
value[n] = '\0';
usr.bin/tmux/tty-term.c
367
int n, remove;
usr.bin/tmux/tty-term.c
417
n = strtonum(value, 0, INT_MAX, &errstr);
usr.bin/tmux/tty-term.c
420
code->value.number = n;
usr.bin/tmux/tty-term.c
534
int n;
usr.bin/tmux/tty-term.c
569
n = strtonum(value, 0, INT_MAX, &errstr);
usr.bin/tmux/tty-term.c
574
code->value.number = n;
usr.bin/tmux/tty-term.c
685
int error, n;
usr.bin/tmux/tty-term.c
724
n = tigetnum((char *)ent->name);
usr.bin/tmux/tty-term.c
725
if (n == -1 || n == -2)
usr.bin/tmux/tty-term.c
727
xsnprintf(tmp, sizeof tmp, "%d", n);
usr.bin/tmux/tty-term.c
731
n = tigetflag((char *)ent->name);
usr.bin/tmux/tty-term.c
732
if (n == -1)
usr.bin/tmux/tty-term.c
734
if (n)
usr.bin/tmux/tty.c
407
u_int n = t - tty->last_requests;
usr.bin/tmux/tty.c
412
if (!force && n <= TTY_REQUEST_LIMIT) {
usr.bin/tmux/tty.c
414
n);
usr.bin/tmux/tty.c
418
force ? "(force) " : "" , n);
usr.bin/tmux/tty.c
553
ssize_t n, slen;
usr.bin/tmux/tty.c
558
n = write(c->fd, s, slen);
usr.bin/tmux/tty.c
559
if (n >= 0) {
usr.bin/tmux/tty.c
560
s += n;
usr.bin/tmux/tty.c
561
slen -= n;
usr.bin/tmux/tty.c
564
} else if (n == -1 && errno != EAGAIN)
usr.bin/tmux/tty.c
896
enum tty_code_code code1, u_int n)
usr.bin/tmux/tty.c
899
tty_putcode_i(tty, code, n);
usr.bin/tmux/tty.c
901
while (n-- > 0)
usr.bin/tmux/tty.c
907
tty_repeat_space(struct tty *tty, u_int n)
usr.bin/tmux/tty.c
914
while (n > sizeof s) {
usr.bin/tmux/tty.c
916
n -= sizeof s;
usr.bin/tmux/tty.c
918
if (n != 0)
usr.bin/tmux/tty.c
919
tty_putn(tty, s, n, n);
usr.bin/tmux/utf8.c
325
unsigned long long n;
usr.bin/tmux/utf8.c
342
n = strtoull(copy + 2, &endptr, 16);
usr.bin/tmux/utf8.c
344
n == 0 ||
usr.bin/tmux/utf8.c
345
n > WCHAR_MAX ||
usr.bin/tmux/utf8.c
346
(errno == ERANGE && n == ULLONG_MAX)) {
usr.bin/tmux/utf8.c
350
wc_start = n;
usr.bin/tmux/utf8.c
358
n = strtoull(endptr + 2, &endptr, 16);
usr.bin/tmux/utf8.c
360
n == 0 ||
usr.bin/tmux/utf8.c
361
n > WCHAR_MAX ||
usr.bin/tmux/utf8.c
362
(errno == ERANGE && n == ULLONG_MAX) ||
usr.bin/tmux/utf8.c
363
(wchar_t)n < wc_start) {
usr.bin/tmux/utf8.c
367
wc_end = n;
usr.bin/tmux/utf8.c
774
size_t n = 0;
usr.bin/tmux/utf8.c
780
dst = xreallocarray(dst, n + 1, sizeof *dst);
usr.bin/tmux/utf8.c
785
dst = xreallocarray(dst, n + ud.width,
usr.bin/tmux/utf8.c
788
dst[n++] = '_';
usr.bin/tmux/utf8.c
794
dst[n++] = *src;
usr.bin/tmux/utf8.c
796
dst[n++] = '_';
usr.bin/tmux/utf8.c
799
dst = xreallocarray(dst, n + 1, sizeof *dst);
usr.bin/tmux/utf8.c
800
dst[n] = '\0';
usr.bin/tmux/utf8.c
817
utf8_strwidth(const struct utf8_data *s, ssize_t n)
usr.bin/tmux/utf8.c
823
if (n != -1 && n == i)
usr.bin/tmux/utf8.c
838
size_t n = 0;
usr.bin/tmux/utf8.c
842
dst = xreallocarray(dst, n + 1, sizeof *dst);
usr.bin/tmux/utf8.c
843
if ((more = utf8_open(&dst[n], *src)) == UTF8_MORE) {
usr.bin/tmux/utf8.c
845
more = utf8_append(&dst[n], *src);
usr.bin/tmux/utf8.c
847
n++;
usr.bin/tmux/utf8.c
850
src -= dst[n].have;
usr.bin/tmux/utf8.c
852
utf8_set(&dst[n], *src);
usr.bin/tmux/utf8.c
853
n++;
usr.bin/tmux/utf8.c
856
dst = xreallocarray(dst, n + 1, sizeof *dst);
usr.bin/tmux/utf8.c
857
dst[n].size = 0;
usr.bin/tmux/utf8.c
866
size_t n = 0;
usr.bin/tmux/utf8.c
869
dst = xreallocarray(dst, n + src->size, 1);
usr.bin/tmux/utf8.c
870
memcpy(dst + n, src->data, src->size);
usr.bin/tmux/utf8.c
871
n += src->size;
usr.bin/tmux/utf8.c
873
dst = xreallocarray(dst, n + 1, 1);
usr.bin/tmux/utf8.c
874
dst[n] = '\0';
usr.bin/tmux/utf8.c
910
u_int n, i;
usr.bin/tmux/utf8.c
912
n = utf8_cstrwidth(s);
usr.bin/tmux/utf8.c
913
if (n >= width)
usr.bin/tmux/utf8.c
917
out = xmalloc(slen + 1 + (width - n));
usr.bin/tmux/utf8.c
919
for (i = n; i < width; i++)
usr.bin/tmux/utf8.c
931
u_int n, i;
usr.bin/tmux/utf8.c
933
n = utf8_cstrwidth(s);
usr.bin/tmux/utf8.c
934
if (n >= width)
usr.bin/tmux/utf8.c
938
out = xmalloc(slen + 1 + (width - n));
usr.bin/tmux/utf8.c
939
for (i = 0; i < width - n; i++)
usr.bin/tmux/window-buffer.c
135
u_int i, n;
usr.bin/tmux/window-buffer.c
149
l = sort_get_buffers(&n, sort_crit);
usr.bin/tmux/window-buffer.c
150
for (i = 0; i < n; i++) {
usr.bin/tmux/window-client.c
122
u_int i, n;
usr.bin/tmux/window-client.c
132
l = sort_get_clients(&n, sort_crit);
usr.bin/tmux/window-client.c
133
for (i = 0; i < n; i++) {
usr.bin/tmux/window-copy.c
1732
u_int px, py, xx, n;
usr.bin/tmux/window-copy.c
1771
n = 1;
usr.bin/tmux/window-copy.c
1795
n++;
usr.bin/tmux/window-copy.c
1797
n--;
usr.bin/tmux/window-copy.c
1799
} while (n != 0);
usr.bin/tmux/window-copy.c
1818
u_int px, py, xx, yy, sx, sy, n;
usr.bin/tmux/window-copy.c
1898
n = 1;
usr.bin/tmux/window-copy.c
1916
n++;
usr.bin/tmux/window-copy.c
1918
n--;
usr.bin/tmux/window-copy.c
1920
} while (n != 0);
usr.bin/tmux/window-copy.c
614
u_int ox, oy, px, py, n, offset, size;
usr.bin/tmux/window-copy.c
661
n = (u_int)delta;
usr.bin/tmux/window-copy.c
662
if (data->oy + n > screen_hsize(data->backing)) {
usr.bin/tmux/window-copy.c
664
if (data->cy < n)
usr.bin/tmux/window-copy.c
667
data->cy -= n;
usr.bin/tmux/window-copy.c
669
data->oy += n;
usr.bin/tmux/window-copy.c
671
n = (u_int)-delta;
usr.bin/tmux/window-copy.c
672
if (data->oy < n) {
usr.bin/tmux/window-copy.c
674
if (data->cy + (n - data->oy) >= sy)
usr.bin/tmux/window-copy.c
677
data->cy += n - data->oy;
usr.bin/tmux/window-copy.c
679
data->oy -= n;
usr.bin/tmux/window-copy.c
715
u_int n, ox, oy, px, py;
usr.bin/tmux/window-copy.c
726
n = 1;
usr.bin/tmux/window-copy.c
729
n = screen_size_y(s) / 2;
usr.bin/tmux/window-copy.c
731
n = screen_size_y(s) - 2;
usr.bin/tmux/window-copy.c
734
if (data->oy + n > screen_hsize(data->backing)) {
usr.bin/tmux/window-copy.c
736
if (data->cy < n)
usr.bin/tmux/window-copy.c
739
data->cy -= n;
usr.bin/tmux/window-copy.c
741
data->oy += n;
usr.bin/tmux/window-copy.c
773
u_int n, ox, oy, px, py;
usr.bin/tmux/window-copy.c
784
n = 1;
usr.bin/tmux/window-copy.c
787
n = screen_size_y(s) / 2;
usr.bin/tmux/window-copy.c
789
n = screen_size_y(s) - 2;
usr.bin/tmux/window-copy.c
792
if (data->oy < n) {
usr.bin/tmux/window-copy.c
794
if (data->cy + (n - data->oy) >= screen_size_y(data->backing))
usr.bin/tmux/window-copy.c
797
data->cy += n - data->oy;
usr.bin/tmux/window-copy.c
799
data->oy -= n;
usr.bin/tmux/window-tree.c
253
u_int n, i;
usr.bin/tmux/window-tree.c
287
l = sort_get_panes_window(wl->window, &n, sort_crit);
usr.bin/tmux/window-tree.c
288
if (n == 0)
usr.bin/tmux/window-tree.c
290
for (i = 0; i < n; i++) {
usr.bin/tmux/window-tree.c
312
u_int n, i, empty;
usr.bin/tmux/window-tree.c
335
l = sort_get_winlinks_session(s, &n, sort_crit);
usr.bin/tmux/window-tree.c
337
for (i = 0; i < n; i++) {
usr.bin/tmux/window-tree.c
342
if (empty == n) {
usr.bin/tmux/window-tree.c
356
u_int n, i;
usr.bin/tmux/window-tree.c
366
l = sort_get_sessions(&n, sort_crit);
usr.bin/tmux/window-tree.c
367
if (n == 0)
usr.bin/tmux/window-tree.c
369
s = l[n - 1];
usr.bin/tmux/window-tree.c
370
for (i = 0; i < n; i++) {
usr.bin/tmux/window.c
1314
size_t n;
usr.bin/tmux/window.c
1329
for (n = strlen(line); n > 0; n--) {
usr.bin/tmux/window.c
1330
if (!isspace((u_char)line[n - 1]))
usr.bin/tmux/window.c
1332
line[n - 1] = '\0';
usr.bin/tmux/window.c
158
u_int n;
usr.bin/tmux/window.c
160
n = 0;
usr.bin/tmux/window.c
162
n++;
usr.bin/tmux/window.c
164
return (n);
usr.bin/tmux/window.c
224
winlink_next_by_number(struct winlink *wl, struct session *s, int n)
usr.bin/tmux/window.c
226
for (; n > 0; n--) {
usr.bin/tmux/window.c
235
winlink_previous_by_number(struct winlink *wl, struct session *s, int n)
usr.bin/tmux/window.c
237
for (; n > 0; n--) {
usr.bin/tmux/window.c
377
int n;
usr.bin/tmux/window.c
382
if (ioctl(wp->fd, FIONREAD, &n) != -1 && n > 0)
usr.bin/tmux/window.c
800
u_int n;
usr.bin/tmux/window.c
802
n = options_get_number(w->options, "pane-base-index");
usr.bin/tmux/window.c
804
if (n == idx)
usr.bin/tmux/window.c
806
n++;
usr.bin/tmux/window.c
812
window_pane_next_by_number(struct window *w, struct window_pane *wp, u_int n)
usr.bin/tmux/window.c
814
for (; n > 0; n--) {
usr.bin/tmux/window.c
824
u_int n)
usr.bin/tmux/window.c
826
for (; n > 0; n--) {
usr.bin/tmux/window.c
855
u_int n;
usr.bin/tmux/window.c
857
n = 0;
usr.bin/tmux/window.c
859
n++;
usr.bin/tmux/window.c
860
return (n);
usr.bin/top/machine.c
543
skip_processes(struct handle *hndl, int n)
usr.bin/top/machine.c
545
hndl->next_proc += n;
usr.bin/tput/tput.c
324
#define myParam(n) numbers[n]
usr.bin/tput/tput.c
341
#define myParam(n) (p_is_s[n - 1] != 0 ? ((TPARM_ARG) strings[n]) : numbers[n])
usr.bin/tset/tset.c
350
size_t n;
usr.bin/tset/tset.c
356
for (n = 0; n < SIZEOF(speeds); ++n) {
usr.bin/tset/tset.c
357
if (n > 0 && (speeds[n].speed <= speeds[n - 1].speed)) {
usr.bin/tset/tset.c
361
if (!CaselessCmp(rate, speeds[n].string)) {
usr.bin/tset/tset.c
362
sp = speeds + n;
usr.bin/tset/tset.c
625
int n;
usr.bin/tset/tset.c
626
for (n = 0; environ[n] != 0; n++) {
usr.bin/tset/tset.c
627
if (!strncmp("TERMCAP=", environ[n], (size_t) 8)) {
usr.bin/tset/tset.c
628
while ((environ[n] = environ[n + 1]) != 0) {
usr.bin/tset/tset.c
629
n++;
usr.bin/tsort/tsort.c
179
hash_calloc(size_t n, size_t s, void *u UNUSED)
usr.bin/tsort/tsort.c
181
return emem(calloc(n, s));
usr.bin/tsort/tsort.c
197
ereallocarray(void *p, size_t n, size_t s)
usr.bin/tsort/tsort.c
199
return emem(reallocarray(p, n, s));
usr.bin/tsort/tsort.c
212
struct node *n;
usr.bin/tsort/tsort.c
214
n = ohash_create_entry(&node_info, start, &end);
usr.bin/tsort/tsort.c
215
n->from = NULL;
usr.bin/tsort/tsort.c
216
n->arcs = NULL;
usr.bin/tsort/tsort.c
217
n->refs = 0;
usr.bin/tsort/tsort.c
218
n->mark = 0;
usr.bin/tsort/tsort.c
219
n->order = NO_ORDER;
usr.bin/tsort/tsort.c
220
n->traverse = NULL;
usr.bin/tsort/tsort.c
221
return n;
usr.bin/tsort/tsort.c
235
struct node * n;
usr.bin/tsort/tsort.c
239
n = ohash_find(h, i);
usr.bin/tsort/tsort.c
240
if (n == NULL)
usr.bin/tsort/tsort.c
241
n = ohash_insert(h, i, new_node(start, end));
usr.bin/tsort/tsort.c
242
return n;
usr.bin/tsort/tsort.c
247
dump_node(struct node *n)
usr.bin/tsort/tsort.c
251
if (n->refs == 0)
usr.bin/tsort/tsort.c
253
printf("%s (%u/%u): ", n->k, n->order, n->refs);
usr.bin/tsort/tsort.c
254
for (l = n->arcs; l != NULL; l = l->next)
usr.bin/tsort/tsort.c
255
if (n->refs != 0)
usr.bin/tsort/tsort.c
273
struct node *n;
usr.bin/tsort/tsort.c
275
for (n = ohash_first(h, &i); n != NULL; n = ohash_next(h, &i))
usr.bin/tsort/tsort.c
276
dump_node(n);
usr.bin/tsort/tsort.c
432
struct node *n;
usr.bin/tsort/tsort.c
435
n = NULL;
usr.bin/tsort/tsort.c
437
n = h->t[0];
usr.bin/tsort/tsort.c
443
return n;
usr.bin/tsort/tsort.c
446
#define ENQUEUE(h, n) do { \
usr.bin/tsort/tsort.c
448
enqueue((h), (n)); \
usr.bin/tsort/tsort.c
450
(h)->t[(h)->entries++] = (n); \
usr.bin/tsort/tsort.c
454
enqueue(struct array *h, struct node *n)
usr.bin/tsort/tsort.c
459
h->t[h->entries++] = n;
usr.bin/tsort/tsort.c
476
struct node *n;
usr.bin/tsort/tsort.c
487
for (n = ohash_first(hash, &i); n != NULL;
usr.bin/tsort/tsort.c
488
n = ohash_next(hash, &i)) {
usr.bin/tsort/tsort.c
489
if (n->order == NO_ORDER) {
usr.bin/tsort/tsort.c
492
for (l = n->arcs; l != NULL; l = l->next) {
usr.bin/tsort/tsort.c
501
n->order = min;
usr.bin/tsort/tsort.c
512
for (n = ohash_first(hash, &i); n != NULL;
usr.bin/tsort/tsort.c
513
n = ohash_next(hash, &i))
usr.bin/tsort/tsort.c
514
if (n->order == NO_ORDER)
usr.bin/tsort/tsort.c
515
for (l = n->arcs; l != NULL; l = l->next)
usr.bin/tsort/tsort.c
516
if (l->node->order < n->order) {
usr.bin/tsort/tsort.c
517
n->order = l->node->order;
usr.bin/tsort/tsort.c
533
struct node *n;
usr.bin/tsort/tsort.c
543
for (n = ohash_first(hash, &i); n != NULL; n = ohash_next(hash, &i)) {
usr.bin/tsort/tsort.c
544
if (n->refs == 0)
usr.bin/tsort/tsort.c
545
heap->t[heap->entries++] = n;
usr.bin/tsort/tsort.c
547
remaining->t[remaining->entries++] = n;
usr.bin/tsort/tsort.c
564
struct node *n = h->t[i];
usr.bin/tsort/tsort.c
566
if (n->refs == 1)
usr.bin/tsort/tsort.c
567
return n;
usr.bin/tsort/tsort.c
568
if (n->refs != 0 && n->refs < best) {
usr.bin/tsort/tsort.c
569
best = n->refs;
usr.bin/tsort/tsort.c
570
u = n;
usr.bin/tsort/tsort.c
590
struct node *n = h->t[i];
usr.bin/tsort/tsort.c
591
if (n->refs != 0 && n->order < best) {
usr.bin/tsort/tsort.c
592
best = n->order;
usr.bin/tsort/tsort.c
593
u = n;
usr.bin/tsort/tsort.c
610
struct node *n;
usr.bin/tsort/tsort.c
612
n = i;
usr.bin/tsort/tsort.c
618
n->mark = 1;
usr.bin/tsort/tsort.c
619
if (n->traverse)
usr.bin/tsort/tsort.c
620
n->traverse = n->traverse->next;
usr.bin/tsort/tsort.c
622
n->traverse = n->arcs;
usr.bin/tsort/tsort.c
624
while (n->traverse && n->traverse->node->refs == 0)
usr.bin/tsort/tsort.c
625
n->traverse = n->traverse->next;
usr.bin/tsort/tsort.c
626
if (n->traverse) {
usr.bin/tsort/tsort.c
627
struct node *go = n->traverse->node;
usr.bin/tsort/tsort.c
631
for (; n != NULL && n != go; n = n->from) {
usr.bin/tsort/tsort.c
632
c->t[c->entries++] = n;
usr.bin/tsort/tsort.c
633
n->mark = 0;
usr.bin/tsort/tsort.c
635
for (; n != NULL; n = n->from)
usr.bin/tsort/tsort.c
636
n->mark = 0;
usr.bin/tsort/tsort.c
640
go->from = n;
usr.bin/tsort/tsort.c
641
n = go;
usr.bin/tsort/tsort.c
644
n->mark = 0;
usr.bin/tsort/tsort.c
645
n = n->from;
usr.bin/tsort/tsort.c
646
if (n == NULL)
usr.bin/tsort/tsort.c
656
find_predecessor(struct array *a, struct node *n)
usr.bin/tsort/tsort.c
668
if (l->node == n)
usr.bin/tsort/tsort.c
681
traverse_node(struct node *n, unsigned int o, struct array *c)
usr.bin/tsort/tsort.c
685
n->from = NULL;
usr.bin/tsort/tsort.c
690
n->mark = o;
usr.bin/tsort/tsort.c
692
printf("%s(%u) ", n->k, n->mark);
usr.bin/tsort/tsort.c
694
if (n->traverse)
usr.bin/tsort/tsort.c
695
n->traverse = n->traverse->next;
usr.bin/tsort/tsort.c
697
n->traverse = n->arcs;
usr.bin/tsort/tsort.c
699
while (n->traverse && n->traverse->node->refs == 0)
usr.bin/tsort/tsort.c
700
n->traverse = n->traverse->next;
usr.bin/tsort/tsort.c
702
if (n->traverse) {
usr.bin/tsort/tsort.c
705
go = n->traverse->node;
usr.bin/tsort/tsort.c
713
go->from = n;
usr.bin/tsort/tsort.c
714
n = go;
usr.bin/tsort/tsort.c
729
for (t = n; t != go; t = t->from)
usr.bin/tsort/tsort.c
736
n->mark = min;
usr.bin/tsort/tsort.c
737
n = n->from;
usr.bin/tsort/tsort.c
738
if (!n)
usr.bin/tsort/tsort.c
764
struct node *n;
usr.bin/tsort/tsort.c
784
n = h->t[i];
usr.bin/tsort/tsort.c
785
if (n->refs != 0 && n->mark == 0) {
usr.bin/tsort/tsort.c
789
o = traverse_node(n, o, c);
usr.bin/tsort/tsort.c
794
n = c->t[0];
usr.bin/tsort/tsort.c
795
best = n->refs;
usr.bin/tsort/tsort.c
798
n = c->t[i];
usr.bin/tsort/tsort.c
799
best = n->refs;
usr.bin/tsort/tsort.c
802
return n;
usr.bin/tsort/tsort.c
808
struct node *b, *n;
usr.bin/tsort/tsort.c
811
n = find_smallest_node(h);
usr.bin/tsort/tsort.c
813
n = find_good_cycle_break(h);
usr.bin/tsort/tsort.c
814
while ((b = find_cycle_from(n, c)) == NULL)
usr.bin/tsort/tsort.c
815
n = find_predecessor(h, n);
usr.bin/tsort/tsort.c
820
#define plural(n) ((n) > 1 ? "s" : "")
usr.bin/tsort/tsort.c
936
struct node *n;
usr.bin/tsort/tsort.c
938
n = DEQUEUE(&aux);
usr.bin/tsort/tsort.c
939
printf("%s\n", n->k);
usr.bin/tsort/tsort.c
946
for (l = n->arcs; l != NULL; l = l->next)
usr.bin/tsort/tsort.c
954
struct node *n;
usr.bin/tsort/tsort.c
961
n = find_longest_cycle(&remaining, &aux);
usr.bin/tsort/tsort.c
963
n = find_normal_cycle(&remaining, &aux);
usr.bin/tsort/tsort.c
971
warnx("%u edge%s broken", n->refs,
usr.bin/tsort/tsort.c
972
plural(n->refs));
usr.bin/tsort/tsort.c
973
broken_arcs += n->refs;
usr.bin/tsort/tsort.c
974
n->refs = 0;
usr.bin/tsort/tsort.c
976
aux.t[0] = n;
usr.bin/unifdef/unifdef.c
1545
size_t n;
usr.bin/unifdef/unifdef.c
1549
n = (size_t)(end - start) + 1;
usr.bin/unifdef/unifdef.c
1550
s = (char *)malloc(n);
usr.bin/unifdef/unifdef.c
1553
snprintf(s, n, "%s", start);
usr.bin/usbhidaction/usbhidaction.c
173
n = read(fd, buf, sz);
usr.bin/usbhidaction/usbhidaction.c
175
printf("read %d bytes:", n);
usr.bin/usbhidaction/usbhidaction.c
176
for (i = 0; i < n; i++)
usr.bin/usbhidaction/usbhidaction.c
180
if (n == -1) {
usr.bin/usbhidaction/usbhidaction.c
186
if (n != sz) {
usr.bin/usbhidaction/usbhidaction.c
402
int n, r;
usr.bin/usbhidaction/usbhidaction.c
416
n = strtol(p, &p, 10) - 1;
usr.bin/usbhidaction/usbhidaction.c
417
if (n >= 0 && n < argc) {
usr.bin/usbhidaction/usbhidaction.c
418
strncpy(q, argv[n], len);
usr.bin/usbhidaction/usbhidaction.c
85
int fd, ch, sz, n, val, i;
usr.bin/uudecode/uudecode.c
188
size_t n, m;
usr.bin/uudecode/uudecode.c
214
n = strlen(q);
usr.bin/uudecode/uudecode.c
215
while (n > 0 && (q[n-1] == '\n' || q[n-1] == '\r'))
usr.bin/uudecode/uudecode.c
216
q[--n] = '\0';
usr.bin/uudecode/uudecode.c
218
if (n > 0)
usr.bin/uudecode/uudecode.c
242
n = strlen(pw->pw_dir);
usr.bin/uudecode/uudecode.c
243
if (buf + n > p) {
usr.bin/uudecode/uudecode.c
246
if (sizeof(buf) < n + m) {
usr.bin/uudecode/uudecode.c
251
p = memmove(buf + n, p, m);
usr.bin/uudecode/uudecode.c
253
q = memcpy(p - n, pw->pw_dir, n);
usr.bin/uudecode/uudecode.c
325
size_t n;
usr.bin/uudecode/uudecode.c
327
n = strlen(end);
usr.bin/uudecode/uudecode.c
328
if (strncmp(ptr, end, n) != 0 ||
usr.bin/uudecode/uudecode.c
329
strspn(ptr + n, " \t\r\n") != strlen(ptr + n)) {
usr.bin/uudecode/uudecode.c
431
int n;
usr.bin/uudecode/uudecode.c
442
n = b64_pton(inbuf, outbuf, sizeof(outbuf));
usr.bin/uudecode/uudecode.c
443
if (n < 0)
usr.bin/uudecode/uudecode.c
445
fwrite(outbuf, 1, n, outfp);
usr.bin/uuencode/uuencode.c
153
size_t n;
usr.bin/uuencode/uuencode.c
159
while ((n = fread(buf, 1, sizeof(buf), stdin))) {
usr.bin/uuencode/uuencode.c
161
rv = b64_ntop(buf, n, buf2, (sizeof(buf2) / sizeof(buf2[0])));
usr.bin/uuencode/uuencode.c
177
int ch, n;
usr.bin/uuencode/uuencode.c
182
while ((n = fread(buf, 1, 45, stdin))) {
usr.bin/uuencode/uuencode.c
183
ch = ENC(n);
usr.bin/uuencode/uuencode.c
186
for (p = buf; n > 0; n -= 3, p += 3) {
usr.bin/uuencode/uuencode.c
188
if (n < 3) {
usr.bin/uuencode/uuencode.c
190
if (n < 2)
usr.bin/vi/common/seq.c
351
e_memcmp(CHAR_T *p1, EVENT *ep, size_t n)
usr.bin/vi/common/seq.c
353
if (n != 0) {
usr.bin/vi/common/seq.c
358
} while (--n != 0);
usr.bin/vi/ex/ex_argv.c
125
size_t blen, len, n;
usr.bin/vi/ex/ex_argv.c
165
n = 0;
usr.bin/vi/ex/ex_argv.c
171
n = len - SHELLOFFSET;
usr.bin/vi/ex/ex_argv.c
173
for (; n > 0; --n, ++p)
usr.bin/vi/ex/ex_argv.c
177
for (; n > 0; --n, ++p)
usr.bin/vi/ex/ex_argv.c
196
switch (n) {
usr.bin/vi/ex/ex_print.c
247
size_t n;
usr.bin/vi/ex/ex_print.c
252
n = vsnprintf(exp->obp + exp->obp_len,
usr.bin/vi/ex/ex_print.c
255
if (n >= sizeof(exp->obp) - exp->obp_len)
usr.bin/vi/ex/ex_print.c
256
n = sizeof(exp->obp) - exp->obp_len - 1;
usr.bin/vi/ex/ex_print.c
257
exp->obp_len += n;
usr.bin/vi/ex/ex_print.c
263
return (n);
usr.bin/vi/ex/ex_print.c
276
int doflush, n;
usr.bin/vi/ex/ex_print.c
281
for (doflush = n = 0; *str != '\0'; ++n) {
usr.bin/vi/ex/ex_print.c
289
return (n);
usr.bin/watch/watch.c
551
ssize_t n;
usr.bin/watch/watch.c
553
n = read(child->fd, child->buf + child->pos, child->bufsiz - child->pos);
usr.bin/watch/watch.c
554
if (n == -1)
usr.bin/watch/watch.c
556
child->pos += n;
usr.bin/which/which.c
53
size_t n;
usr.bin/which/which.c
87
for (n = 0; n < argc; n++)
usr.bin/which/which.c
88
if (findprog(argv[n], path, progmode, allmatches) == 0)
usr.bin/xargs/strnsubst.c
35
int n;
usr.bin/xargs/strnsubst.c
56
n = snprintf(s2 + s2len, maxsize - s2len, "%.*s%s",
usr.bin/xargs/strnsubst.c
58
if (n < 0 || n + s2len + strlen(this + matchlen) >= maxsize)
usr.bin/xargs/strnsubst.c
60
s2len += n;
usr.bin/yacc/closure.c
189
closure(short *nucleus, int n)
usr.bin/yacc/closure.c
201
csend = nucleus + n;
usr.bin/yacc/closure.c
236
print_closure(n);
usr.bin/yacc/closure.c
49
print_closure(int n)
usr.bin/yacc/closure.c
53
printf("\n\nn = %d\n\n", n);
usr.bin/yacc/defs.h
140
#define NEW2(n,t) ((t*)allocate((n)*sizeof(t)))
usr.bin/yacc/defs.h
64
#define WORDSIZE(n) (((n)+(BITS_PER_WORD-1))/BITS_PER_WORD)
usr.bin/yacc/defs.h
65
#define BIT(r, n) ((((r)[(n)>>5])>>((n)&31))&1)
usr.bin/yacc/defs.h
66
#define SETBIT(r, n) ((r)[(n)>>5]|=((unsigned)1<<((n)&31)))
usr.bin/yacc/lalr.c
451
transpose(short **old_R, int n)
usr.bin/yacc/lalr.c
456
nedges = NEW2(n, short);
usr.bin/yacc/lalr.c
458
for (i = 0; i < n; i++) {
usr.bin/yacc/lalr.c
466
new_R = NEW2(n, short *);
usr.bin/yacc/lalr.c
467
temp_R = NEW2(n, short *);
usr.bin/yacc/lalr.c
469
for (i = 0; i < n; i++) {
usr.bin/yacc/lalr.c
481
for (i = 0; i < n; i++) {
usr.bin/yacc/lalr.c
504
int i, n;
usr.bin/yacc/lalr.c
510
n = lookaheads[nstates];
usr.bin/yacc/lalr.c
511
for (i = 0; i < n; i++) {
usr.bin/yacc/lalr.c
522
for (i = 0; i < n; i++)
usr.bin/yacc/lr0.c
190
int n, found, key;
usr.bin/yacc/lr0.c
200
n = iend - isp1;
usr.bin/yacc/lr0.c
208
if (sp->nitems == n) {
usr.bin/yacc/lr0.c
296
int n;
usr.bin/yacc/lr0.c
309
n = iend - isp1;
usr.bin/yacc/lr0.c
311
p = allocate(sizeof(core) + (n - 1) * sizeof(short));
usr.bin/yacc/lr0.c
314
p->nitems = n;
usr.bin/yacc/main.c
166
allocate(size_t n)
usr.bin/yacc/main.c
171
if (n) {
usr.bin/yacc/main.c
172
v = calloc(1, n);
usr.bin/yacc/mkpar.c
130
int i, j, m, n;
usr.bin/yacc/mkpar.c
136
n = lookaheads[stateno + 1];
usr.bin/yacc/mkpar.c
137
for (i = m; i < n; i++) {
usr.bin/yacc/output.c
383
int n;
usr.bin/yacc/output.c
388
n = goto_map[symbol + 1];
usr.bin/yacc/output.c
390
if (m == n)
usr.bin/yacc/output.c
395
for (i = m; i < n; i++)
usr.bin/yacc/output.c
417
int n;
usr.bin/yacc/output.c
425
n = goto_map[symbol + 1];
usr.bin/yacc/output.c
428
for (i = m; i < n; i++) {
usr.bin/yacc/output.c
440
for (i = m; i < n; i++) {
usr.bin/yacc/reader.c
1298
int c, i, n, depth, quote;
usr.bin/yacc/reader.c
1315
n = 0;
usr.bin/yacc/reader.c
1317
++n;
usr.bin/yacc/reader.c
1338
if (i > n)
usr.bin/yacc/reader.c
1340
fprintf(f, "yyvsp[%d].%s", i - n, tag);
usr.bin/yacc/reader.c
1345
i = -get_number() - n;
usr.bin/yacc/reader.c
1365
if (i <= 0 || i > n)
usr.bin/yacc/reader.c
1367
tag = pitem[nitems + i - n - 1]->tag;
usr.bin/yacc/reader.c
1369
untyped_rhs(i, pitem[nitems + i - n - 1]->name);
usr.bin/yacc/reader.c
1370
fprintf(f, "yyvsp[%d].%s", i - n, tag);
usr.bin/yacc/reader.c
1372
if (i > n)
usr.bin/yacc/reader.c
1374
fprintf(f, "yyvsp[%d]", i - n);
usr.bin/yacc/reader.c
1382
fprintf(f, "yyvsp[%d]", -i - n);
usr.bin/yacc/reader.c
1630
int i, j, k, n;
usr.bin/yacc/reader.c
1693
n = v[i]->value;
usr.bin/yacc/reader.c
1694
if (n > 256) {
usr.bin/yacc/reader.c
1695
for (j = k++; j > 0 && symbol_value[j - 1] > n; --j)
usr.bin/yacc/reader.c
1697
symbol_value[j] = n;
usr.bin/yacc/reader.c
1705
n = 257;
usr.bin/yacc/reader.c
1708
while (j < k && n == symbol_value[j]) {
usr.bin/yacc/reader.c
1709
while (++j < k && n == symbol_value[j])
usr.bin/yacc/reader.c
1711
++n;
usr.bin/yacc/reader.c
1713
v[i]->value = n;
usr.bin/yacc/reader.c
1714
++n;
usr.bin/yacc/reader.c
633
int c, quote, i, n;
usr.bin/yacc/reader.c
711
n = cinc;
usr.bin/yacc/reader.c
712
s = malloc(n);
usr.bin/yacc/reader.c
716
memcpy(s, cache, n);
usr.bin/yacc/reader.c
719
if (n == 1)
usr.bin/yacc/reader.c
724
for (i = 0; i < n; ++i) {
usr.bin/yacc/reader.c
764
if (n == 1)
usr.bin/yacc/reader.c
772
if (n == 1 && bp->value == UNDEFINED)
usr.bin/yacc/warshall.c
41
transitive_closure(unsigned int *R, int n)
usr.bin/yacc/warshall.c
47
rowsize = WORDSIZE(n);
usr.bin/yacc/warshall.c
48
relend = R + n * rowsize;
usr.bin/yacc/warshall.c
79
reflexive_transitive_closure(unsigned int *R, int n)
usr.bin/yacc/warshall.c
85
transitive_closure(R, n);
usr.bin/yacc/warshall.c
87
rowsize = WORDSIZE(n);
usr.bin/yacc/warshall.c
88
relend = R + n * rowsize;
usr.sbin/acme-client/json.c
101
if (n->d.obj == NULL)
usr.sbin/acme-client/json.c
105
&n->d.obj[i].lhs,
usr.sbin/acme-client/json.c
111
&n->d.obj[i].rhs,
usr.sbin/acme-client/json.c
121
n->fields = t->size;
usr.sbin/acme-client/json.c
122
n->d.array = calloc(n->fields,
usr.sbin/acme-client/json.c
124
if (n->d.array == NULL)
usr.sbin/acme-client/json.c
128
&n->d.array[i],
usr.sbin/acme-client/json.c
156
struct jsmnn *n = &p->nodes[i];
usr.sbin/acme-client/json.c
157
switch (n->type) {
usr.sbin/acme-client/json.c
159
free(n->d.array);
usr.sbin/acme-client/json.c
162
free(n->d.obj);
usr.sbin/acme-client/json.c
165
free(n->d.str);
usr.sbin/acme-client/json.c
168
free(n->d.str);
usr.sbin/acme-client/json.c
226
json_getarrayobj(struct jsmnn *n)
usr.sbin/acme-client/json.c
229
return n->type != JSMN_OBJECT ? NULL : n;
usr.sbin/acme-client/json.c
236
json_getarraystr(struct jsmnn *n)
usr.sbin/acme-client/json.c
238
return n->type != JSMN_STRING ? NULL : n->d.str;
usr.sbin/acme-client/json.c
247
json_getarray(struct jsmnn *n, const char *name)
usr.sbin/acme-client/json.c
251
if (n->type != JSMN_OBJECT)
usr.sbin/acme-client/json.c
253
for (i = 0; i < n->fields; i++) {
usr.sbin/acme-client/json.c
254
if (n->d.obj[i].lhs->type != JSMN_STRING &&
usr.sbin/acme-client/json.c
255
n->d.obj[i].lhs->type != JSMN_PRIMITIVE)
usr.sbin/acme-client/json.c
257
else if (strcmp(name, n->d.obj[i].lhs->d.str))
usr.sbin/acme-client/json.c
261
if (i == n->fields)
usr.sbin/acme-client/json.c
263
if (n->d.obj[i].rhs->type != JSMN_ARRAY)
usr.sbin/acme-client/json.c
265
return n->d.obj[i].rhs;
usr.sbin/acme-client/json.c
274
json_getobj(struct jsmnn *n, const char *name)
usr.sbin/acme-client/json.c
278
if (n->type != JSMN_OBJECT)
usr.sbin/acme-client/json.c
280
for (i = 0; i < n->fields; i++) {
usr.sbin/acme-client/json.c
281
if (n->d.obj[i].lhs->type != JSMN_STRING &&
usr.sbin/acme-client/json.c
282
n->d.obj[i].lhs->type != JSMN_PRIMITIVE)
usr.sbin/acme-client/json.c
284
else if (strcmp(name, n->d.obj[i].lhs->d.str))
usr.sbin/acme-client/json.c
288
if (i == n->fields)
usr.sbin/acme-client/json.c
290
if (n->d.obj[i].rhs->type != JSMN_OBJECT)
usr.sbin/acme-client/json.c
292
return n->d.obj[i].rhs;
usr.sbin/acme-client/json.c
301
json_getstr(struct jsmnn *n, const char *name)
usr.sbin/acme-client/json.c
306
if (n->type != JSMN_OBJECT)
usr.sbin/acme-client/json.c
308
for (i = 0; i < n->fields; i++) {
usr.sbin/acme-client/json.c
309
if (n->d.obj[i].lhs->type != JSMN_STRING &&
usr.sbin/acme-client/json.c
310
n->d.obj[i].lhs->type != JSMN_PRIMITIVE)
usr.sbin/acme-client/json.c
312
else if (strcmp(name, n->d.obj[i].lhs->d.str))
usr.sbin/acme-client/json.c
316
if (i == n->fields)
usr.sbin/acme-client/json.c
318
if (n->d.obj[i].rhs->type != JSMN_STRING &&
usr.sbin/acme-client/json.c
319
n->d.obj[i].rhs->type != JSMN_PRIMITIVE)
usr.sbin/acme-client/json.c
322
cp = strdup(n->d.obj[i].rhs->d.str);
usr.sbin/acme-client/json.c
345
json_parse_response(struct jsmnn *n)
usr.sbin/acme-client/json.c
350
if (n == NULL)
usr.sbin/acme-client/json.c
352
if ((resp = json_getstr(n, "status")) == NULL)
usr.sbin/acme-client/json.c
374
json_parse_challenge(struct jsmnn *n, struct chng *p)
usr.sbin/acme-client/json.c
381
if (n == NULL)
usr.sbin/acme-client/json.c
384
array = json_getarray(n, "challenges");
usr.sbin/acme-client/json.c
413
json_parse_order_status(struct jsmnn *n)
usr.sbin/acme-client/json.c
417
if (n == NULL)
usr.sbin/acme-client/json.c
420
if ((status = json_getstr(n, "status")) == NULL)
usr.sbin/acme-client/json.c
442
json_parse_order(struct jsmnn *n, struct order *order)
usr.sbin/acme-client/json.c
448
order->status = json_parse_order_status(n);
usr.sbin/acme-client/json.c
450
if (n == NULL)
usr.sbin/acme-client/json.c
453
if ((finalize = json_getstr(n, "finalize")) == NULL) {
usr.sbin/acme-client/json.c
461
if ((array = json_getarray(n, "authorizations")) == NULL)
usr.sbin/acme-client/json.c
489
json_parse_upd_order(struct jsmnn *n, struct order *order)
usr.sbin/acme-client/json.c
492
order->status = json_parse_order_status(n);
usr.sbin/acme-client/json.c
493
if ((certificate = json_getstr(n, "certificate")) != NULL) {
usr.sbin/acme-client/json.c
521
json_parse_capaths(struct jsmnn *n, struct capaths *p)
usr.sbin/acme-client/json.c
523
if (n == NULL)
usr.sbin/acme-client/json.c
526
p->newaccount = json_getstr(n, "newAccount");
usr.sbin/acme-client/json.c
527
p->newnonce = json_getstr(n, "newNonce");
usr.sbin/acme-client/json.c
528
p->neworder = json_getstr(n, "newOrder");
usr.sbin/acme-client/json.c
529
p->revokecert = json_getstr(n, "revokeCert");
usr.sbin/acme-client/json.c
556
struct jsmnn *n;
usr.sbin/acme-client/json.c
592
n = jsmntree_alloc(tok, buf, r);
usr.sbin/acme-client/json.c
594
return n;
usr.sbin/acme-client/json.c
75
struct jsmnn *n;
usr.sbin/acme-client/json.c
82
n = *np = &parse->nodes[parse->cur++];
usr.sbin/acme-client/json.c
83
n->p = parse;
usr.sbin/acme-client/json.c
84
n->type = t->type;
usr.sbin/acme-client/json.c
90
n->fields = 1;
usr.sbin/acme-client/json.c
91
n->d.str = strndup
usr.sbin/acme-client/json.c
94
if (n->d.str == NULL)
usr.sbin/acme-client/json.c
98
n->fields = t->size;
usr.sbin/acme-client/json.c
99
n->d.obj = calloc(n->fields,
usr.sbin/amd/amd/mapc.c
241
kv *n;
usr.sbin/amd/amd/mapc.c
278
n = ALLOC(kv);
usr.sbin/amd/amd/mapc.c
279
n->key = key;
usr.sbin/amd/amd/mapc.c
280
n->val = val;
usr.sbin/amd/amd/mapc.c
281
n->next = *h;
usr.sbin/amd/amd/mapc.c
282
*h = n;
usr.sbin/amd/amd/mapc.c
462
kv *n = k->next;
usr.sbin/amd/amd/mapc.c
466
k = n;
usr.sbin/amd/amd/nfsx_ops.c
241
nfsx_mnt *n = &nx->nx_v[i];
usr.sbin/amd/amd/nfsx_ops.c
242
mntfs *m = n->n_mnt;
usr.sbin/amd/amd/nfsx_ops.c
255
n->n_error = error;
usr.sbin/amd/amd/nfsx_ops.c
274
nfsx_mnt *n = nx->nx_try;
usr.sbin/amd/amd/nfsx_ops.c
276
n->n_mnt->mf_flags &= ~(MFF_ERROR|MFF_MOUNTING);
usr.sbin/amd/amd/nfsx_ops.c
282
wakeup(n->n_mnt);
usr.sbin/amd/amd/nfsx_ops.c
289
plog(XLOG_ERROR, "mount for %s got signal %d", n->n_mnt->mf_mount, term);
usr.sbin/amd/amd/nfsx_ops.c
290
n->n_error = EIO;
usr.sbin/amd/amd/nfsx_ops.c
296
plog(XLOG_ERROR, "%s: mount (nfsx_cont): %m", n->n_mnt->mf_mount);
usr.sbin/amd/amd/nfsx_ops.c
297
n->n_error = rc;
usr.sbin/amd/amd/nfsx_ops.c
299
free_mntfs(n->n_mnt);
usr.sbin/amd/amd/nfsx_ops.c
300
n->n_mnt = new_mntfs();
usr.sbin/amd/amd/nfsx_ops.c
301
n->n_mnt->mf_error = n->n_error;
usr.sbin/amd/amd/nfsx_ops.c
302
n->n_mnt->mf_flags |= MFF_ERROR;
usr.sbin/amd/amd/nfsx_ops.c
307
mf_mounted(n->n_mnt);
usr.sbin/amd/amd/nfsx_ops.c
308
n->n_error = 0;
usr.sbin/amd/amd/nfsx_ops.c
337
nfsx_mnt *n;
usr.sbin/amd/amd/nfsx_ops.c
340
for (n = nx->nx_v; n < nx->nx_v + nx->nx_c; n++) {
usr.sbin/amd/amd/nfsx_ops.c
341
mntfs *m = n->n_mnt;
usr.sbin/amd/amd/nfsx_ops.c
342
if (n->n_error < 0) {
usr.sbin/amd/amd/nfsx_ops.c
355
for (n = nx->nx_v; n < nx->nx_v + nx->nx_c; n++) {
usr.sbin/amd/amd/nfsx_ops.c
356
mntfs *m = n->n_mnt;
usr.sbin/amd/amd/nfsx_ops.c
357
if (n->n_error < 0) {
usr.sbin/amd/amd/nfsx_ops.c
363
n->n_error = EINVAL;
usr.sbin/amd/amd/nfsx_ops.c
373
nx->nx_try = n;
usr.sbin/amd/amd/nfsx_ops.c
376
n->n_error = -1;
usr.sbin/amd/amd/nfsx_ops.c
382
n->n_error = (*m->mf_ops->fmount_fs)(m);
usr.sbin/amd/amd/nfsx_ops.c
386
if (n->n_error > 0) {
usr.sbin/amd/amd/nfsx_ops.c
387
errno = n->n_error; /* XXX */
usr.sbin/amd/amd/nfsx_ops.c
391
if (n->n_error == 0) {
usr.sbin/amd/amd/nfsx_ops.c
394
glob_error = n->n_error;
usr.sbin/amd/amd/nfsx_ops.c
417
nfsx_mnt *n;
usr.sbin/amd/amd/nfsx_ops.c
424
for (n = nx->nx_v + nx->nx_c - 1; n >= nx->nx_v; --n) {
usr.sbin/amd/amd/nfsx_ops.c
425
mntfs *m = n->n_mnt;
usr.sbin/amd/amd/nfsx_ops.c
435
if (n->n_error == 0) {
usr.sbin/amd/amd/nfsx_ops.c
439
n->n_error = (*m->mf_ops->fumount_fs)(m);
usr.sbin/amd/amd/nfsx_ops.c
440
if (n->n_error) {
usr.sbin/amd/amd/nfsx_ops.c
441
glob_error = n->n_error;
usr.sbin/amd/amd/nfsx_ops.c
442
n->n_error = 0;
usr.sbin/amd/amd/nfsx_ops.c
447
n->n_error = -1;
usr.sbin/amd/amd/nfsx_ops.c
467
for (n = nx->nx_v; n < nx->nx_v + nx->nx_c; n++) {
usr.sbin/amd/amd/nfsx_ops.c
468
mntfs *m = n->n_mnt;
usr.sbin/amd/amd/nfsx_ops.c
469
if (n->n_error < 0) {
usr.sbin/amd/amd/nfsx_ops.c
476
n->n_mnt = 0;
usr.sbin/amd/amd/nfsx_ops.c
477
n->n_error = -1;
usr.sbin/arp/arp.c
734
int n;
usr.sbin/arp/arp.c
743
n = snprintf(p, ep - p, "%dd", days);
usr.sbin/arp/arp.c
744
if (n < 0 || n >= ep - p)
usr.sbin/arp/arp.c
746
p += n;
usr.sbin/arp/arp.c
750
n = snprintf(p, ep - p, "%dh", hours);
usr.sbin/arp/arp.c
751
if (n < 0 || n >= ep - p)
usr.sbin/arp/arp.c
753
p += n;
usr.sbin/arp/arp.c
757
n = snprintf(p, ep - p, "%dm", mins);
usr.sbin/arp/arp.c
758
if (n < 0 || n >= ep - p)
usr.sbin/arp/arp.c
760
p += n;
usr.sbin/arp/arp.c
94
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
usr.sbin/authpf/authpf.c
172
if ((n = snprintf(rulesetname, sizeof(rulesetname), "%s(%ld)",
usr.sbin/authpf/authpf.c
173
luser, (long)getpid())) < 0 || (u_int)n >= sizeof(rulesetname)) {
usr.sbin/authpf/authpf.c
176
if ((n = snprintf(rulesetname, sizeof(rulesetname), "%ld",
usr.sbin/authpf/authpf.c
177
(long)getpid())) < 0 || (u_int)n >= sizeof(rulesetname)) {
usr.sbin/authpf/authpf.c
185
n = snprintf(pidfile, sizeof(pidfile), "%s/%s",
usr.sbin/authpf/authpf.c
187
if (n < 0 || (u_int)n >= sizeof(pidfile)) {
usr.sbin/authpf/authpf.c
591
int n;
usr.sbin/authpf/authpf.c
594
n = snprintf(tmp, sizeof(tmp), "%s/%s", luserdir, luser);
usr.sbin/authpf/authpf.c
595
if (n < 0 || (u_int)n >= sizeof(tmp)) {
usr.sbin/authpf/authpf.c
84
int lockcnt = 0, n;
usr.sbin/bgpctl/bgpctl.c
428
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpctl/bgpctl.c
430
if (n == 0)
usr.sbin/bgpctl/bgpctl.c
440
if ((n = imsgbuf_read(imsgbuf)) == -1)
usr.sbin/bgpctl/bgpctl.c
442
if (n == 0)
usr.sbin/bgpctl/bgpctl.c
84
int fd, n, done, numdone, ch, verbose = 0;
usr.sbin/bgpctl/mrtparser.c
57
ssize_t n;
usr.sbin/bgpctl/mrtparser.c
60
if ((n = read(fd, b, len)) == -1) {
usr.sbin/bgpctl/mrtparser.c
65
if (n == 0)
usr.sbin/bgpctl/mrtparser.c
67
b += n;
usr.sbin/bgpctl/mrtparser.c
68
len -= n;
usr.sbin/bgpd/bgpd.c
1261
ssize_t n;
usr.sbin/bgpd/bgpd.c
1275
if ((n = imsgbuf_read(i)) == -1) {
usr.sbin/bgpd/bgpd.c
1281
if (n == 0) {
usr.sbin/bgpd/bgpd.c
748
size_t i, l, n;
usr.sbin/bgpd/bgpd.c
752
as = set_get(aset->set, &n);
usr.sbin/bgpd/bgpd.c
754
sizeof(n) + sizeof(aset->name))) == NULL)
usr.sbin/bgpd/bgpd.c
756
if (imsg_add(wbuf, &n, sizeof(n)) == -1 ||
usr.sbin/bgpd/bgpd.c
761
for (i = 0; i < n; i += l) {
usr.sbin/bgpd/bgpd.c
762
l = (n - i > 1024 ? 1024 : n - i);
usr.sbin/bgpd/bgpd.c
850
ssize_t n;
usr.sbin/bgpd/bgpd.c
856
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/bgpd.c
859
if (n == 0)
usr.sbin/bgpd/chash.c
359
uint32_t n;
usr.sbin/bgpd/chash.c
362
for (n = 0; n < CH_H2_SIZE; n++, g++) {
usr.sbin/bgpd/chash.c
363
g = &table[n];
usr.sbin/bgpd/chash.c
367
iter->ci_set_idx = n;
usr.sbin/bgpd/chash.c
371
iter->ci_set_idx = n;
usr.sbin/bgpd/chash.c
384
uint32_t n;
usr.sbin/bgpd/chash.c
387
for (n = iter->ci_set_idx; n < CH_H2_SIZE; n++, g++) {
usr.sbin/bgpd/chash.c
388
g = &table[n];
usr.sbin/bgpd/chash.c
395
iter->ci_set_idx = n;
usr.sbin/bgpd/chash.c
399
iter->ci_set_idx = n;
usr.sbin/bgpd/chash.c
414
uint32_t n;
usr.sbin/bgpd/chash.c
420
for (n = 0; n < CH_H2_SIZE; n++, g++) {
usr.sbin/bgpd/chash.c
482
uint32_t n;
usr.sbin/bgpd/chash.c
486
for (n = 0; n < CH_H2_SIZE; n++, g++, b++) {
usr.sbin/bgpd/config.c
105
struct network *n;
usr.sbin/bgpd/config.c
107
while ((n = TAILQ_FIRST(networks)) != NULL) {
usr.sbin/bgpd/config.c
108
TAILQ_REMOVE(networks, n, entry);
usr.sbin/bgpd/config.c
109
network_free(n);
usr.sbin/bgpd/config.c
645
struct network *n, *m, *tmp;
usr.sbin/bgpd/config.c
649
TAILQ_FOREACH_SAFE(n, nw, entry, tmp) {
usr.sbin/bgpd/config.c
650
if (n->net.type == NETWORK_PREFIXSET) {
usr.sbin/bgpd/config.c
651
TAILQ_REMOVE(nw, n, entry);
usr.sbin/bgpd/config.c
652
if ((ps = find_prefixset(n->net.psname, &c->prefixsets))
usr.sbin/bgpd/config.c
655
n->net.psname);
usr.sbin/bgpd/config.c
663
filterset_copy(&n->net.attrset,
usr.sbin/bgpd/config.c
667
network_free(n);
usr.sbin/bgpd/config.c
95
network_free(struct network *n)
usr.sbin/bgpd/config.c
97
rtlabel_unref(n->net.rtlabel);
usr.sbin/bgpd/config.c
98
filterset_free(&n->net.attrset);
usr.sbin/bgpd/config.c
99
free(n);
usr.sbin/bgpd/control.c
248
ssize_t n;
usr.sbin/bgpd/control.c
275
if ((n = imsg_get(&c->imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/control.c
278
if (n == 0)
usr.sbin/bgpd/kroute.c
1180
kr_net_find(struct ktable *kt, struct network *n)
usr.sbin/bgpd/kroute.c
1185
if (n->net.type != xn->net.type ||
usr.sbin/bgpd/kroute.c
1186
n->net.prefixlen != xn->net.prefixlen ||
usr.sbin/bgpd/kroute.c
1187
n->net.rd != xn->net.rd ||
usr.sbin/bgpd/kroute.c
1188
n->net.rtlabel != xn->net.rtlabel ||
usr.sbin/bgpd/kroute.c
1189
n->net.priority != xn->net.priority)
usr.sbin/bgpd/kroute.c
1191
if (memcmp(&n->net.prefix, &xn->net.prefix,
usr.sbin/bgpd/kroute.c
1192
sizeof(n->net.prefix)) == 0)
usr.sbin/bgpd/kroute.c
1201
struct network *n, *xn;
usr.sbin/bgpd/kroute.c
1207
while ((n = TAILQ_FIRST(nh)) != NULL) {
usr.sbin/bgpd/kroute.c
1208
TAILQ_REMOVE(nh, n, entry);
usr.sbin/bgpd/kroute.c
1209
n->net.old = 0;
usr.sbin/bgpd/kroute.c
1210
n->net.rd = rd;
usr.sbin/bgpd/kroute.c
1211
xn = kr_net_find(kt, n);
usr.sbin/bgpd/kroute.c
1215
filterset_move(&n->net.attrset, &xn->net.attrset);
usr.sbin/bgpd/kroute.c
1216
network_free(n);
usr.sbin/bgpd/kroute.c
1218
TAILQ_INSERT_TAIL(&kt->krn, n, entry);
usr.sbin/bgpd/kroute.c
1225
struct network *n, *xn;
usr.sbin/bgpd/kroute.c
1227
TAILQ_FOREACH_SAFE(n, &kt->krn, entry, xn) {
usr.sbin/bgpd/kroute.c
1228
TAILQ_REMOVE(&kt->krn, n, entry);
usr.sbin/bgpd/kroute.c
1229
if (n->net.type == NETWORK_DEFAULT)
usr.sbin/bgpd/kroute.c
1230
kr_net_redist_del(kt, &n->net, 0);
usr.sbin/bgpd/kroute.c
1231
network_free(n);
usr.sbin/bgpd/kroute.c
1314
struct network *n;
usr.sbin/bgpd/kroute.c
1323
TAILQ_FOREACH(n, &kt->krn, entry)
usr.sbin/bgpd/kroute.c
1324
n->net.old = 1;
usr.sbin/bgpd/kroute.c
1332
struct network *n, *xn;
usr.sbin/bgpd/kroute.c
1345
TAILQ_FOREACH_SAFE(n, &kt->krn, entry, xn) {
usr.sbin/bgpd/kroute.c
1346
if (n->net.old) {
usr.sbin/bgpd/kroute.c
1347
TAILQ_REMOVE(&kt->krn, n, entry);
usr.sbin/bgpd/kroute.c
1348
if (n->net.type == NETWORK_DEFAULT)
usr.sbin/bgpd/kroute.c
1349
kr_net_redist_del(kt, &n->net, 0);
usr.sbin/bgpd/kroute.c
1350
network_free(n);
usr.sbin/bgpd/kroute.c
1363
struct network *n;
usr.sbin/bgpd/kroute.c
1376
TAILQ_FOREACH(n, &kt->krn, entry)
usr.sbin/bgpd/kroute.c
1377
if (n->net.type == NETWORK_DEFAULT) {
usr.sbin/bgpd/kroute.c
1378
kr_net_redist_add(kt, &n->net,
usr.sbin/bgpd/kroute.c
1379
&n->net.attrset, 0);
usr.sbin/bgpd/kroute.c
1641
struct knexthop *n;
usr.sbin/bgpd/kroute.c
1732
RB_FOREACH(n, knexthop_tree, KT2KNT(kt))
usr.sbin/bgpd/kroute.c
1733
if (prefix_compare(&kf->prefix, &n->nexthop,
usr.sbin/bgpd/kroute.c
1735
knexthop_validate(kt, n);
usr.sbin/bgpd/kroute.c
1752
struct knexthop *n;
usr.sbin/bgpd/kroute.c
1805
RB_FOREACH(n, knexthop_tree, KT2KNT(kt)) {
usr.sbin/bgpd/kroute.c
1806
if (n->kroute == krm)
usr.sbin/bgpd/kroute.c
1807
knexthop_validate(kt, n);
usr.sbin/bgpd/kroute.c
1822
struct knexthop *n;
usr.sbin/bgpd/kroute.c
1874
RB_FOREACH(n, knexthop_tree, KT2KNT(kt)) {
usr.sbin/bgpd/kroute.c
1875
if (n->kroute == krm)
usr.sbin/bgpd/kroute.c
1876
knexthop_validate(kt, n);
usr.sbin/bgpd/kroute.c
2293
struct kroute_nexthop n;
usr.sbin/bgpd/kroute.c
2297
memset(&n, 0, sizeof(n));
usr.sbin/bgpd/kroute.c
2298
n.nexthop = kn->nexthop;
usr.sbin/bgpd/kroute.c
2301
n.valid = 0; /* NH is not valid */
usr.sbin/bgpd/kroute.c
2302
send_nexthop_update(&n);
usr.sbin/bgpd/kroute.c
2309
n.valid = kroute_validate(kr);
usr.sbin/bgpd/kroute.c
2310
n.connected = kr->flags & F_CONNECTED;
usr.sbin/bgpd/kroute.c
2311
if (!n.connected) {
usr.sbin/bgpd/kroute.c
2312
n.gateway.aid = AID_INET;
usr.sbin/bgpd/kroute.c
2313
n.gateway.v4.s_addr = kr->nexthop.s_addr;
usr.sbin/bgpd/kroute.c
2315
n.gateway = n.nexthop;
usr.sbin/bgpd/kroute.c
2316
n.net.aid = AID_INET;
usr.sbin/bgpd/kroute.c
2317
n.net.v4.s_addr = kr->prefix.s_addr;
usr.sbin/bgpd/kroute.c
2318
n.netlen = kr->prefixlen;
usr.sbin/bgpd/kroute.c
2323
n.valid = kroute6_validate(kr6);
usr.sbin/bgpd/kroute.c
2324
n.connected = kr6->flags & F_CONNECTED;
usr.sbin/bgpd/kroute.c
2325
if (!n.connected) {
usr.sbin/bgpd/kroute.c
2326
n.gateway.aid = AID_INET6;
usr.sbin/bgpd/kroute.c
2327
n.gateway.v6 = kr6->nexthop;
usr.sbin/bgpd/kroute.c
2328
n.gateway.scope_id = kr6->nexthop_scope_id;
usr.sbin/bgpd/kroute.c
2330
n.gateway = n.nexthop;
usr.sbin/bgpd/kroute.c
2331
n.net.aid = AID_INET6;
usr.sbin/bgpd/kroute.c
2332
n.net.v6 = kr6->prefix;
usr.sbin/bgpd/kroute.c
2333
n.net.scope_id = kr6->prefix_scope_id;
usr.sbin/bgpd/kroute.c
2334
n.netlen = kr6->prefixlen;
usr.sbin/bgpd/kroute.c
2338
send_nexthop_update(&n);
usr.sbin/bgpd/kroute.c
2984
ssize_t n;
usr.sbin/bgpd/kroute.c
2992
if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) {
usr.sbin/bgpd/kroute.c
2999
if (n == 0) {
usr.sbin/bgpd/kroute.c
3004
lim = buf + n;
usr.sbin/bgpd/mrt.c
356
struct nexthop *n;
usr.sbin/bgpd/mrt.c
420
n = prefix_nexthop(p);
usr.sbin/bgpd/mrt.c
421
if (n == NULL) {
usr.sbin/bgpd/mrt.c
426
nh = &n->exit_nexthop;
usr.sbin/bgpd/parse.y
1084
struct network *n, *m;
usr.sbin/bgpd/parse.y
1086
if ((n = calloc(1, sizeof(struct network))) == NULL)
usr.sbin/bgpd/parse.y
1088
memcpy(&n->net.prefix, &$2.prefix,
usr.sbin/bgpd/parse.y
1089
sizeof(n->net.prefix));
usr.sbin/bgpd/parse.y
1090
n->net.prefixlen = $2.len;
usr.sbin/bgpd/parse.y
1091
filterset_move($3, &n->net.attrset);
usr.sbin/bgpd/parse.y
1094
if (n->net.type == m->net.type &&
usr.sbin/bgpd/parse.y
1095
n->net.prefixlen == m->net.prefixlen &&
usr.sbin/bgpd/parse.y
1096
prefix_compare(&n->net.prefix,
usr.sbin/bgpd/parse.y
1097
&m->net.prefix, n->net.prefixlen) == 0)
usr.sbin/bgpd/parse.y
1102
TAILQ_INSERT_TAIL(netconf, n, entry);
usr.sbin/bgpd/parse.y
1106
struct network *n;
usr.sbin/bgpd/parse.y
1124
if ((n = calloc(1, sizeof(struct network))) == NULL)
usr.sbin/bgpd/parse.y
1126
strlcpy(n->net.psname, ps->name, sizeof(n->net.psname));
usr.sbin/bgpd/parse.y
1127
filterset_move($4, &n->net.attrset);
usr.sbin/bgpd/parse.y
1128
n->net.type = NETWORK_PREFIXSET;
usr.sbin/bgpd/parse.y
1129
TAILQ_INSERT_TAIL(netconf, n, entry);
usr.sbin/bgpd/parse.y
1134
struct network *n;
usr.sbin/bgpd/parse.y
1136
if ((n = calloc(1, sizeof(struct network))) == NULL)
usr.sbin/bgpd/parse.y
1138
if (afi2aid($2, SAFI_UNICAST, &n->net.prefix.aid) ==
usr.sbin/bgpd/parse.y
1145
n->net.type = NETWORK_RTLABEL;
usr.sbin/bgpd/parse.y
1146
n->net.rtlabel = rtlabel_name2id($4);
usr.sbin/bgpd/parse.y
1147
filterset_move($5, &n->net.attrset);
usr.sbin/bgpd/parse.y
1150
TAILQ_INSERT_TAIL(netconf, n, entry);
usr.sbin/bgpd/parse.y
1153
struct network *n;
usr.sbin/bgpd/parse.y
1159
if ((n = calloc(1, sizeof(struct network))) == NULL)
usr.sbin/bgpd/parse.y
1161
if (afi2aid($2, SAFI_UNICAST, &n->net.prefix.aid) ==
usr.sbin/bgpd/parse.y
1168
n->net.type = NETWORK_PRIORITY;
usr.sbin/bgpd/parse.y
1169
n->net.priority = $4;
usr.sbin/bgpd/parse.y
1170
filterset_move($5, &n->net.attrset);
usr.sbin/bgpd/parse.y
1173
TAILQ_INSERT_TAIL(netconf, n, entry);
usr.sbin/bgpd/parse.y
1176
struct network *n;
usr.sbin/bgpd/parse.y
1178
if ((n = calloc(1, sizeof(struct network))) == NULL)
usr.sbin/bgpd/parse.y
1180
if (afi2aid($2, SAFI_UNICAST, &n->net.prefix.aid) ==
usr.sbin/bgpd/parse.y
1187
n->net.type = $3 ? NETWORK_STATIC : NETWORK_CONNECTED;
usr.sbin/bgpd/parse.y
1188
filterset_move($4, &n->net.attrset);
usr.sbin/bgpd/parse.y
1191
TAILQ_INSERT_TAIL(netconf, n, entry);
usr.sbin/bgpd/parse.y
4105
struct network *n;
usr.sbin/bgpd/parse.y
4146
TAILQ_FOREACH(n, netconf, entry)
usr.sbin/bgpd/parse.y
4147
if (n->net.priority == conf->fib_priority) {
usr.sbin/bgpd/parse.y
4151
n->net.priority, conf->fib_priority);
usr.sbin/bgpd/parse.y
4731
struct mrt *m, *n;
usr.sbin/bgpd/parse.y
4751
if ((n = calloc(1, sizeof(struct mrt_config))) == NULL)
usr.sbin/bgpd/parse.y
4754
n->type = type;
usr.sbin/bgpd/parse.y
4755
n->state = MRT_STATE_OPEN;
usr.sbin/bgpd/parse.y
4756
if (strlcpy(MRT2MC(n)->name, name, sizeof(MRT2MC(n)->name)) >=
usr.sbin/bgpd/parse.y
4757
sizeof(MRT2MC(n)->name)) {
usr.sbin/bgpd/parse.y
4759
name, sizeof(MRT2MC(n)->name) - 1);
usr.sbin/bgpd/parse.y
4760
free(n);
usr.sbin/bgpd/parse.y
4763
TAILQ_INIT(&MRT2MC(n)->timer);
usr.sbin/bgpd/parse.y
4764
MRT2MC(n)->ReopenTimerInterval = timeout;
usr.sbin/bgpd/parse.y
4767
n->peer_id = 0;
usr.sbin/bgpd/parse.y
4768
n->group_id = p->conf.id;
usr.sbin/bgpd/parse.y
4770
n->peer_id = p->conf.id;
usr.sbin/bgpd/parse.y
4771
n->group_id = 0;
usr.sbin/bgpd/parse.y
4777
free(n);
usr.sbin/bgpd/parse.y
4780
if (strlcpy(n->rib, rib, sizeof(n->rib)) >=
usr.sbin/bgpd/parse.y
4781
sizeof(n->rib)) {
usr.sbin/bgpd/parse.y
4783
name, sizeof(n->rib) - 1);
usr.sbin/bgpd/parse.y
4784
free(n);
usr.sbin/bgpd/parse.y
4789
LIST_INSERT_HEAD(conf->mrt, n, entry);
usr.sbin/bgpd/parse.y
5469
struct rtr_config *n;
usr.sbin/bgpd/parse.y
5471
n = calloc(1, sizeof(*n));
usr.sbin/bgpd/parse.y
5472
if (n == NULL) {
usr.sbin/bgpd/parse.y
5477
n->remote_addr = *addr;
usr.sbin/bgpd/parse.y
5478
strlcpy(n->descr, log_addr(addr), sizeof(currtr->descr));
usr.sbin/bgpd/parse.y
5480
return n;
usr.sbin/bgpd/parse.y
5616
getservice(char *n)
usr.sbin/bgpd/parse.y
5620
s = getservbyname(n, "tcp");
usr.sbin/bgpd/parse.y
5622
s = getservbyname(n, "udp");
usr.sbin/bgpd/parse.y
643
struct aspa_tas_l *a, *n;
usr.sbin/bgpd/parse.y
647
for (a = $7; a != NULL; a = n) {
usr.sbin/bgpd/parse.y
648
n = a->next;
usr.sbin/bgpd/pfkey.c
396
n = writev(sd, iov, iov_cnt);
usr.sbin/bgpd/pfkey.c
397
} while (n == -1 && (errno == EAGAIN || errno == EINTR));
usr.sbin/bgpd/pfkey.c
399
if (n == -1) {
usr.sbin/bgpd/pfkey.c
71
ssize_t n;
usr.sbin/bgpd/printconf.c
1278
struct network *n;
usr.sbin/bgpd/printconf.c
1290
TAILQ_FOREACH(n, &conf->networks, entry)
usr.sbin/bgpd/printconf.c
1291
print_network(&n->net, "");
usr.sbin/bgpd/printconf.c
445
struct network *n;
usr.sbin/bgpd/printconf.c
458
TAILQ_FOREACH(n, &vpn->net_l, entry)
usr.sbin/bgpd/printconf.c
459
print_network(&n->net, "\t");
usr.sbin/bgpd/printconf.c
480
print_network(struct network_config *n, const char *c)
usr.sbin/bgpd/printconf.c
482
switch (n->type) {
usr.sbin/bgpd/printconf.c
484
printf("%snetwork %s static", c, print_af(n->prefix.aid));
usr.sbin/bgpd/printconf.c
487
printf("%snetwork %s connected", c, print_af(n->prefix.aid));
usr.sbin/bgpd/printconf.c
491
print_af(n->prefix.aid), rtlabel_id2name(n->rtlabel));
usr.sbin/bgpd/printconf.c
495
print_af(n->prefix.aid), n->priority);
usr.sbin/bgpd/printconf.c
498
printf("%snetwork prefix-set %s", c, n->psname);
usr.sbin/bgpd/printconf.c
501
printf("%snetwork %s/%u", c, log_addr(&n->prefix),
usr.sbin/bgpd/printconf.c
502
n->prefixlen);
usr.sbin/bgpd/printconf.c
505
if (!TAILQ_EMPTY(&n->attrset))
usr.sbin/bgpd/printconf.c
507
print_set(&n->attrset);
usr.sbin/bgpd/printconf.c
625
size_t i, n;
usr.sbin/bgpd/printconf.c
630
as = set_get(aset->set, &n);
usr.sbin/bgpd/printconf.c
631
for (i = 0, len = 8; i < n; i++) {
usr.sbin/bgpd/rde.c
1338
int n;
usr.sbin/bgpd/rde.c
1341
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/rde.c
1343
if (n == 0)
usr.sbin/bgpd/rde.c
2720
char *n = NULL;
usr.sbin/bgpd/rde.c
2728
if (asprintf(&n, " via %s", log_addr(next)) == -1)
usr.sbin/bgpd/rde.c
2729
n = NULL;
usr.sbin/bgpd/rde.c
2735
p ? p : "out of memory", n ? n : "");
usr.sbin/bgpd/rde.c
2738
free(n);
usr.sbin/bgpd/rde.c
3115
rde_match_peer(struct rde_peer *p, struct ctl_neighbor *n)
usr.sbin/bgpd/rde.c
3119
if (n && n->addr.aid) {
usr.sbin/bgpd/rde.c
3120
if (memcmp(&p->conf.remote_addr, &n->addr,
usr.sbin/bgpd/rde.c
3123
} else if (n && n->descr[0]) {
usr.sbin/bgpd/rde.c
3124
s = n->is_group ? p->conf.group : p->conf.descr;
usr.sbin/bgpd/rde.c
3126
if (strncmp(s, n->descr, sizeof(n->descr)))
usr.sbin/bgpd/rde.c
467
ssize_t n;
usr.sbin/bgpd/rde.c
474
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/rde.c
476
if (n == 0)
usr.sbin/bgpd/rde.c
920
int n, fd;
usr.sbin/bgpd/rde.c
924
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/rde.c
926
if (n == 0)
usr.sbin/bgpd/rde_community.c
681
struct rde_community *n, *f;
usr.sbin/bgpd/rde_community.c
683
if ((n = malloc(sizeof(*n))) == NULL)
usr.sbin/bgpd/rde_community.c
685
communities_copy(n, comm);
usr.sbin/bgpd/rde_community.c
688
switch (CH_INSERT(comm_tree, &commtable, n, &f)) {
usr.sbin/bgpd/rde_community.c
693
free(n->communities);
usr.sbin/bgpd/rde_community.c
694
free(n);
usr.sbin/bgpd/rde_community.c
697
n->refcnt = 1; /* initial reference by the cache */
usr.sbin/bgpd/rde_community.c
699
rdemem.comm_size += n->size;
usr.sbin/bgpd/rde_community.c
700
rdemem.comm_nmemb += n->nentries;
usr.sbin/bgpd/rde_community.c
703
return n;
usr.sbin/bgpd/rde_peer.c
137
peer_match(struct ctl_neighbor *n, uint32_t peerid)
usr.sbin/bgpd/rde_peer.c
149
if (rde_match_peer(peer, n))
usr.sbin/bgpd/rde_sets.c
100
n->lastchange = o->lastchange;
usr.sbin/bgpd/rde_sets.c
92
struct as_set *n, *o;
usr.sbin/bgpd/rde_sets.c
94
SIMPLEQ_FOREACH(n, new, entry) {
usr.sbin/bgpd/rde_sets.c
95
if (old == NULL || (o = as_sets_lookup(old, n->name)) == NULL ||
usr.sbin/bgpd/rde_sets.c
96
!set_equal(n->set, o->set)) {
usr.sbin/bgpd/rde_sets.c
97
n->dirty = 1;
usr.sbin/bgpd/rde_sets.c
98
n->lastchange = getmonotime();
usr.sbin/bgpd/rde_trie.c
148
struct tentry_v4 *n, *new, *b, **prev;
usr.sbin/bgpd/rde_trie.c
155
n = *prev;
usr.sbin/bgpd/rde_trie.c
156
while (n) {
usr.sbin/bgpd/rde_trie.c
160
minlen = n->plen > plen ? plen : n->plen;
usr.sbin/bgpd/rde_trie.c
162
if (n->addr.s_addr != mp.s_addr) {
usr.sbin/bgpd/rde_trie.c
171
b->plen = inet4findmsb(&n->addr, &mp);
usr.sbin/bgpd/rde_trie.c
172
inet4applymask(&b->addr, &n->addr, b->plen);
usr.sbin/bgpd/rde_trie.c
175
if (inet4isset(&n->addr, b->plen)) {
usr.sbin/bgpd/rde_trie.c
176
b->trie[1] = n;
usr.sbin/bgpd/rde_trie.c
179
b->trie[0] = n;
usr.sbin/bgpd/rde_trie.c
182
n = NULL;
usr.sbin/bgpd/rde_trie.c
186
if (n->plen > plen) {
usr.sbin/bgpd/rde_trie.c
191
if (n->plen == plen) {
usr.sbin/bgpd/rde_trie.c
193
if (n->node == 0)
usr.sbin/bgpd/rde_trie.c
195
n->node = 1;
usr.sbin/bgpd/rde_trie.c
196
return n;
usr.sbin/bgpd/rde_trie.c
200
if (inet4isset(&p, n->plen))
usr.sbin/bgpd/rde_trie.c
201
prev = &n->trie[1];
usr.sbin/bgpd/rde_trie.c
203
prev = &n->trie[0];
usr.sbin/bgpd/rde_trie.c
204
n = *prev;
usr.sbin/bgpd/rde_trie.c
219
if (n) {
usr.sbin/bgpd/rde_trie.c
220
if (inet4isset(&n->addr, new->plen))
usr.sbin/bgpd/rde_trie.c
221
new->trie[1] = n;
usr.sbin/bgpd/rde_trie.c
223
new->trie[0] = n;
usr.sbin/bgpd/rde_trie.c
231
struct tentry_v6 *n, *new, *b, **prev;
usr.sbin/bgpd/rde_trie.c
238
n = *prev;
usr.sbin/bgpd/rde_trie.c
239
while (n) {
usr.sbin/bgpd/rde_trie.c
243
minlen = n->plen > plen ? plen : n->plen;
usr.sbin/bgpd/rde_trie.c
245
if (memcmp(&n->addr, &mp, sizeof(mp)) != 0) {
usr.sbin/bgpd/rde_trie.c
254
b->plen = inet6findmsb(&n->addr, &mp);
usr.sbin/bgpd/rde_trie.c
255
inet6applymask(&b->addr, &n->addr, b->plen);
usr.sbin/bgpd/rde_trie.c
258
if (inet6isset(&n->addr, b->plen)) {
usr.sbin/bgpd/rde_trie.c
259
b->trie[1] = n;
usr.sbin/bgpd/rde_trie.c
262
b->trie[0] = n;
usr.sbin/bgpd/rde_trie.c
265
n = NULL;
usr.sbin/bgpd/rde_trie.c
269
if (n->plen > plen) {
usr.sbin/bgpd/rde_trie.c
274
if (n->plen == plen) {
usr.sbin/bgpd/rde_trie.c
276
if (n->node == 0)
usr.sbin/bgpd/rde_trie.c
278
n->node = 1;
usr.sbin/bgpd/rde_trie.c
279
return n;
usr.sbin/bgpd/rde_trie.c
283
if (inet6isset(&p, n->plen))
usr.sbin/bgpd/rde_trie.c
284
prev = &n->trie[1];
usr.sbin/bgpd/rde_trie.c
286
prev = &n->trie[0];
usr.sbin/bgpd/rde_trie.c
287
n = *prev;
usr.sbin/bgpd/rde_trie.c
302
if (n) {
usr.sbin/bgpd/rde_trie.c
303
if (inet6isset(&n->addr, new->plen))
usr.sbin/bgpd/rde_trie.c
304
new->trie[1] = n;
usr.sbin/bgpd/rde_trie.c
306
new->trie[0] = n;
usr.sbin/bgpd/rde_trie.c
442
trie_free_v4(struct tentry_v4 *n)
usr.sbin/bgpd/rde_trie.c
444
if (n == NULL)
usr.sbin/bgpd/rde_trie.c
446
trie_free_v4(n->trie[0]);
usr.sbin/bgpd/rde_trie.c
447
trie_free_v4(n->trie[1]);
usr.sbin/bgpd/rde_trie.c
448
set_free(n->set);
usr.sbin/bgpd/rde_trie.c
449
free(n);
usr.sbin/bgpd/rde_trie.c
451
rdemem.pset_size -= sizeof(*n);
usr.sbin/bgpd/rde_trie.c
455
trie_free_v6(struct tentry_v6 *n)
usr.sbin/bgpd/rde_trie.c
457
if (n == NULL)
usr.sbin/bgpd/rde_trie.c
459
trie_free_v6(n->trie[0]);
usr.sbin/bgpd/rde_trie.c
460
trie_free_v6(n->trie[1]);
usr.sbin/bgpd/rde_trie.c
461
set_free(n->set);
usr.sbin/bgpd/rde_trie.c
462
free(n);
usr.sbin/bgpd/rde_trie.c
464
rdemem.pset_size -= sizeof(*n);
usr.sbin/bgpd/rde_trie.c
479
struct tentry_v4 *n;
usr.sbin/bgpd/rde_trie.c
486
n = th->root_v4;
usr.sbin/bgpd/rde_trie.c
487
while (n) {
usr.sbin/bgpd/rde_trie.c
490
if (n->plen > plen)
usr.sbin/bgpd/rde_trie.c
493
inet4applymask(&mp, prefix, n->plen);
usr.sbin/bgpd/rde_trie.c
494
if (n->addr.s_addr != mp.s_addr)
usr.sbin/bgpd/rde_trie.c
498
if (n->node && orlonger)
usr.sbin/bgpd/rde_trie.c
502
if (n->node && inet4isset(&n->plenmask, plen - 1))
usr.sbin/bgpd/rde_trie.c
505
if (n->plen == 32)
usr.sbin/bgpd/rde_trie.c
507
if (inet4isset(prefix, n->plen))
usr.sbin/bgpd/rde_trie.c
508
n = n->trie[1];
usr.sbin/bgpd/rde_trie.c
510
n = n->trie[0];
usr.sbin/bgpd/rde_trie.c
520
struct tentry_v6 *n;
usr.sbin/bgpd/rde_trie.c
527
n = th->root_v6;
usr.sbin/bgpd/rde_trie.c
528
while (n) {
usr.sbin/bgpd/rde_trie.c
531
if (n->plen > plen)
usr.sbin/bgpd/rde_trie.c
534
inet6applymask(&mp, prefix, n->plen);
usr.sbin/bgpd/rde_trie.c
535
if (memcmp(&n->addr, &mp, sizeof(mp)) != 0)
usr.sbin/bgpd/rde_trie.c
539
if (n->node && orlonger)
usr.sbin/bgpd/rde_trie.c
543
if (n->node && inet6isset(&n->plenmask, plen - 1))
usr.sbin/bgpd/rde_trie.c
546
if (n->plen == 128)
usr.sbin/bgpd/rde_trie.c
548
if (inet6isset(prefix, n->plen))
usr.sbin/bgpd/rde_trie.c
549
n = n->trie[1];
usr.sbin/bgpd/rde_trie.c
551
n = n->trie[0];
usr.sbin/bgpd/rde_trie.c
576
struct tentry_v4 *n;
usr.sbin/bgpd/rde_trie.c
582
n = th->root_v4;
usr.sbin/bgpd/rde_trie.c
583
while (n) {
usr.sbin/bgpd/rde_trie.c
586
if (n->plen > plen)
usr.sbin/bgpd/rde_trie.c
589
inet4applymask(&mp, prefix, n->plen);
usr.sbin/bgpd/rde_trie.c
590
if (n->addr.s_addr != mp.s_addr)
usr.sbin/bgpd/rde_trie.c
593
if (n->node) {
usr.sbin/bgpd/rde_trie.c
602
if ((rs = set_match(n->set, as)) != NULL) {
usr.sbin/bgpd/rde_trie.c
603
if (plen == n->plen || plen <= rs->maxlen)
usr.sbin/bgpd/rde_trie.c
609
if (n->plen == 32)
usr.sbin/bgpd/rde_trie.c
611
if (inet4isset(prefix, n->plen))
usr.sbin/bgpd/rde_trie.c
612
n = n->trie[1];
usr.sbin/bgpd/rde_trie.c
614
n = n->trie[0];
usr.sbin/bgpd/rde_trie.c
624
struct tentry_v6 *n;
usr.sbin/bgpd/rde_trie.c
630
n = th->root_v6;
usr.sbin/bgpd/rde_trie.c
631
while (n) {
usr.sbin/bgpd/rde_trie.c
634
if (n->plen > plen)
usr.sbin/bgpd/rde_trie.c
637
inet6applymask(&mp, prefix, n->plen);
usr.sbin/bgpd/rde_trie.c
638
if (memcmp(&n->addr, &mp, sizeof(mp)) != 0)
usr.sbin/bgpd/rde_trie.c
641
if (n->node) {
usr.sbin/bgpd/rde_trie.c
650
if ((rs = set_match(n->set, as)) != NULL)
usr.sbin/bgpd/rde_trie.c
651
if (plen == n->plen || plen <= rs->maxlen)
usr.sbin/bgpd/rde_trie.c
656
if (n->plen == 128)
usr.sbin/bgpd/rde_trie.c
658
if (inet6isset(prefix, n->plen))
usr.sbin/bgpd/rde_trie.c
659
n = n->trie[1];
usr.sbin/bgpd/rde_trie.c
661
n = n->trie[0];
usr.sbin/bgpd/rde_trie.c
754
trie_dump_v4(struct tentry_v4 *n)
usr.sbin/bgpd/rde_trie.c
756
if (n == NULL)
usr.sbin/bgpd/rde_trie.c
758
if (n->node)
usr.sbin/bgpd/rde_trie.c
759
fprintf(stderr, "%s/%u plenmask %08x\n", inet_ntoa(n->addr),
usr.sbin/bgpd/rde_trie.c
760
n->plen, n->plenmask.s_addr);
usr.sbin/bgpd/rde_trie.c
762
fprintf(stderr, " %s/%u\n", inet_ntoa(n->addr), n->plen);
usr.sbin/bgpd/rde_trie.c
764
trie_dump_v4(n->trie[0]);
usr.sbin/bgpd/rde_trie.c
765
trie_dump_v4(n->trie[1]);
usr.sbin/bgpd/rde_trie.c
769
trie_dump_v6(struct tentry_v6 *n)
usr.sbin/bgpd/rde_trie.c
774
if (n == NULL)
usr.sbin/bgpd/rde_trie.c
776
if (n->node) {
usr.sbin/bgpd/rde_trie.c
778
inet_ntop(AF_INET6, &n->addr, buf, sizeof(buf)), n->plen);
usr.sbin/bgpd/rde_trie.c
779
for (i = 0; i < sizeof(n->plenmask); i++)
usr.sbin/bgpd/rde_trie.c
780
fprintf(stderr, "%02x", n->plenmask.s6_addr[i]);
usr.sbin/bgpd/rde_trie.c
784
inet_ntop(AF_INET6, &n->addr, buf, sizeof(buf)), n->plen);
usr.sbin/bgpd/rde_trie.c
786
trie_dump_v6(n->trie[0]);
usr.sbin/bgpd/rde_trie.c
787
trie_dump_v6(n->trie[1]);
usr.sbin/bgpd/rtr.c
323
int n, fd;
usr.sbin/bgpd/rtr.c
326
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/rtr.c
328
if (n == 0)
usr.sbin/bgpd/rtr.c
466
int n;
usr.sbin/bgpd/rtr.c
469
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/rtr.c
471
if (n == 0)
usr.sbin/bgpd/session.c
1193
int n, fd, depend_ok, restricted;
usr.sbin/bgpd/session.c
1198
if ((n = imsg_get(imsgbuf, &imsg)) == -1)
usr.sbin/bgpd/session.c
1201
if (n == 0)
usr.sbin/bgpd/session.c
1662
peer_matched(struct peer *p, struct ctl_neighbor *n)
usr.sbin/bgpd/session.c
1666
if (n && n->addr.aid) {
usr.sbin/bgpd/session.c
1667
if (memcmp(&p->conf.remote_addr, &n->addr,
usr.sbin/bgpd/session.c
1670
} else if (n && n->descr[0]) {
usr.sbin/bgpd/session.c
1671
s = n->is_group ? p->conf.group : p->conf.descr;
usr.sbin/bgpd/session.c
1673
if (strncmp(s, n->descr, sizeof(n->descr)))
usr.sbin/bgpd/util.c
454
int r, n = 0;
usr.sbin/bgpd/util.c
464
r = snprintf(buf, size, "%s%s", n++ != 0 ? " " : "",
usr.sbin/bgplgd/slowcgi.c
1046
ssize_t n;
usr.sbin/bgplgd/slowcgi.c
1059
n = read(fd, resp->data + sizeof(struct fcgi_record_header),
usr.sbin/bgplgd/slowcgi.c
1062
if (n == -1) {
usr.sbin/bgplgd/slowcgi.c
1069
n = 0; /* fake empty FCGI_STD{OUT,ERR} response */
usr.sbin/bgplgd/slowcgi.c
1072
header->content_len = htons(n);
usr.sbin/bgplgd/slowcgi.c
1074
resp->data_len = n + sizeof(struct fcgi_record_header);
usr.sbin/bgplgd/slowcgi.c
1077
if (n == 0) {
usr.sbin/bgplgd/slowcgi.c
1111
size_t n;
usr.sbin/bgplgd/slowcgi.c
1125
n = len > FCGI_CONTENT_SIZE ? FCGI_CONTENT_SIZE : len;
usr.sbin/bgplgd/slowcgi.c
1126
memcpy(resp->data + sizeof(struct fcgi_record_header), d, n);
usr.sbin/bgplgd/slowcgi.c
1128
header->content_len = htons(n);
usr.sbin/bgplgd/slowcgi.c
1130
resp->data_len = n + sizeof(struct fcgi_record_header);
usr.sbin/bgplgd/slowcgi.c
1133
len -= n;
usr.sbin/bgplgd/slowcgi.c
1134
d += n;
usr.sbin/bgplgd/slowcgi.c
59
#define FCGI_ALIGN(n) \
usr.sbin/bgplgd/slowcgi.c
60
(((n) + (FCGI_ALIGNMENT - 1)) & ~(FCGI_ALIGNMENT - 1))
usr.sbin/bgplgd/slowcgi.c
617
ssize_t n;
usr.sbin/bgplgd/slowcgi.c
626
n = write(fd, resp->data + resp->data_pos, resp->data_len);
usr.sbin/bgplgd/slowcgi.c
627
if (n == -1) {
usr.sbin/bgplgd/slowcgi.c
633
resp->data_pos += n;
usr.sbin/bgplgd/slowcgi.c
634
resp->data_len -= n;
usr.sbin/bgplgd/slowcgi.c
653
ssize_t n;
usr.sbin/bgplgd/slowcgi.c
658
n = read(fd, c->buf + c->buf_pos + c->buf_len,
usr.sbin/bgplgd/slowcgi.c
661
switch (n) {
usr.sbin/bgplgd/slowcgi.c
679
c->buf_len += n;
usr.sbin/bgplgd/slowcgi.c
704
parse_begin_request(uint8_t *buf, uint16_t n, struct request *c, uint16_t id)
usr.sbin/bgplgd/slowcgi.c
712
if (n != sizeof(struct fcgi_begin_request_body)) {
usr.sbin/bgplgd/slowcgi.c
713
lwarnx("wrong size %d != %lu", n,
usr.sbin/bgplgd/slowcgi.c
726
parse_params(uint8_t *buf, uint16_t n, struct request *c, uint16_t id)
usr.sbin/bgplgd/slowcgi.c
745
if (n == 0) {
usr.sbin/bgplgd/slowcgi.c
750
while (n > 0) {
usr.sbin/bgplgd/slowcgi.c
753
n--;
usr.sbin/bgplgd/slowcgi.c
756
if (n > 3) {
usr.sbin/bgplgd/slowcgi.c
759
n -= 4;
usr.sbin/bgplgd/slowcgi.c
765
if (n > 0) {
usr.sbin/bgplgd/slowcgi.c
768
n--;
usr.sbin/bgplgd/slowcgi.c
771
if (n > 3) {
usr.sbin/bgplgd/slowcgi.c
775
n -= 4;
usr.sbin/bgplgd/slowcgi.c
783
if (n < name_len + val_len)
usr.sbin/bgplgd/slowcgi.c
805
n -= name_len;
usr.sbin/bgplgd/slowcgi.c
809
n -= val_len;
usr.sbin/bgplgd/slowcgi.c
820
parse_stdin(uint8_t *buf, uint16_t n, struct request *c, uint16_t id)
usr.sbin/bgplgd/slowcgi.c
827
if (n != 0)
usr.sbin/bgplgd/slowcgi.c
832
parse_record(uint8_t *buf, size_t n, struct request *c)
usr.sbin/bgplgd/slowcgi.c
836
if (n < sizeof(struct fcgi_record_header))
usr.sbin/bgplgd/slowcgi.c
844
if (n < sizeof(struct fcgi_record_header) + ntohs(h->content_len)
usr.sbin/config/gram.y
55
#define FORMAT(n) ((n) > -10 && (n) < 10 ? "%d" : "0x%x")
usr.sbin/config/gram.y
68
#define new0(n,s,p,i,x) (alloc[adepth++] = newnv(n, s, p, i, x))
usr.sbin/config/gram.y
69
#define new_n(n) new0(n, NULL, NULL, 0, NULL)
usr.sbin/config/gram.y
70
#define new_nx(n, x) new0(n, NULL, NULL, 0, x)
usr.sbin/config/gram.y
71
#define new_ns(n, s) new0(n, s, NULL, 0, NULL)
usr.sbin/config/gram.y
73
#define new_nsi(n,s,i) new0(n, s, NULL, i, NULL)
usr.sbin/config/gram.y
74
#define new_np(n, p) new0(n, NULL, p, 0, NULL)
usr.sbin/config/hash.c
109
u_int n, i;
usr.sbin/config/hash.c
111
n = ht->ht_size * 2;
usr.sbin/config/hash.c
112
h = ecalloc(n, sizeof *h);
usr.sbin/config/hash.c
114
n--;
usr.sbin/config/hash.c
118
p->h_next = h[p->h_hash & n];
usr.sbin/config/hash.c
119
h[p->h_hash & n] = p;
usr.sbin/config/hash.c
124
ht->ht_mask = n;
usr.sbin/config/hash.c
125
ht->ht_size = ++n;
usr.sbin/config/hash.c
126
ht->ht_lim = HASHFRACTION(n);
usr.sbin/config/hash.c
90
u_int n;
usr.sbin/config/hash.c
96
for (n = 0; n < sz; n++)
usr.sbin/config/main.c
377
const char *n;
usr.sbin/config/main.c
387
for (n = name, p = low; (c = *n) != '\0'; n++)
usr.sbin/config/main.c
392
n = intern(low);
usr.sbin/config/main.c
394
(void)do_option(defopttab, &nextdefopt, n, name, "defopt");
usr.sbin/config/main.c
411
const char *n;
usr.sbin/config/main.c
434
for (n = name, p = low; (c = *n) != '\0'; n++)
usr.sbin/config/main.c
438
n = intern(low);
usr.sbin/config/main.c
440
(void)ht_remove(selecttab, n);
usr.sbin/config/main.c
451
const char *n;
usr.sbin/config/main.c
458
for (n = name, p = low; (c = *n) != '\0'; n++)
usr.sbin/config/main.c
462
n = intern(low);
usr.sbin/config/main.c
464
(void)ht_insert(selecttab, n, (void *)n);
usr.sbin/config/main.c
656
int errs, n;
usr.sbin/config/main.c
673
for (n = 0; i != NULL; i = i->i_alias)
usr.sbin/config/main.c
675
n++;
usr.sbin/config/main.c
676
if (n < 1)
usr.sbin/config/mkioconf.c
112
size_t n;
usr.sbin/config/mkioconf.c
124
while ((n = fread(buf, 1, sizeof(buf), ifp)) > 0)
usr.sbin/config/mkioconf.c
125
if (fwrite(buf, 1, n, ofp) != n)
usr.sbin/config/mkmakefile.c
149
char *ret = NULL, *nam, *n, *s, *e, *expand;
usr.sbin/config/mkmakefile.c
152
if ((nam = n = strdup(_nam)) == NULL)
usr.sbin/config/mkmakefile.c
155
while (*n) {
usr.sbin/config/mkmakefile.c
157
if ((s = strchr(n, '$')) == NULL) {
usr.sbin/config/mkmakefile.c
160
if (asprintf(&expand, "%s%s", ret, n) == -1)
usr.sbin/config/mkmakefile.c
185
n = e + 1;
usr.sbin/config/pack.c
122
int n;
usr.sbin/config/pack.c
138
n = i->i_pvlen + 1;
usr.sbin/config/pack.c
139
if (n > longest_pvec)
usr.sbin/config/pack.c
140
longest_pvec = n;
usr.sbin/config/pack.c
141
pvecspace += n;
usr.sbin/config/pack.c
166
int j, m, n;
usr.sbin/config/pack.c
169
n = 0;
usr.sbin/config/pack.c
176
m = n;
usr.sbin/config/pack.c
185
for (j = m; j < n; j++) {
usr.sbin/config/pack.c
195
l->i_cfindex = n;
usr.sbin/config/pack.c
198
packed[n++] = l;
usr.sbin/config/pack.c
203
npacked = n;
usr.sbin/config/pack.c
204
packed[n] = NULL;
usr.sbin/config/pack.c
238
int j, n, old, new, ndup;
usr.sbin/config/pack.c
247
n = nparents(NULL, src->i_atdev, src->i_atunit);
usr.sbin/config/pack.c
248
p = ereallocarray(NULL, n, sizeof *p);
usr.sbin/config/pack.c
249
if (n == 0)
usr.sbin/config/pack.c
253
n = 0;
usr.sbin/config/pack.c
255
n += nparents(NULL, nv->nv_ptr, src->i_atunit);
usr.sbin/config/pack.c
256
if (n == 0)
usr.sbin/config/pack.c
258
p = ereallocarray(NULL, n, sizeof *p);
usr.sbin/config/pack.c
259
n = 0;
usr.sbin/config/pack.c
261
n += nparents(p + n, nv->nv_ptr, src->i_atunit);
usr.sbin/config/pack.c
265
for (j = 0; j < n; j++) {
usr.sbin/config/pack.c
277
new = old + (n - ndup);
usr.sbin/config/pack.c
288
for (j = 0; j < n; j++)
usr.sbin/config/pack.c
301
int n;
usr.sbin/config/pack.c
303
n = 0;
usr.sbin/config/pack.c
312
n++;
usr.sbin/config/pack.c
316
return (n);
usr.sbin/config/sem.c
1092
struct nvlist *m, *n;
usr.sbin/config/sem.c
1110
for (n = got; n != NULL; n = n->nv_next)
usr.sbin/config/sem.c
1111
n->nv_int = -1;
usr.sbin/config/sem.c
1116
for (n = got; n != NULL; n = n->nv_next) {
usr.sbin/config/sem.c
1117
if (n->nv_name == m->nv_name) {
usr.sbin/config/sem.c
1118
n->nv_int = ord;
usr.sbin/config/sem.c
1122
if (n == NULL && m->nv_int == 0) {
usr.sbin/config/sem.c
1135
for (n = got; n != NULL; n = n->nv_next) {
usr.sbin/config/sem.c
1136
if (n->nv_int >= 0) {
usr.sbin/config/sem.c
1137
if (n->nv_str != NULL)
usr.sbin/config/sem.c
1138
lp[n->nv_int] = n->nv_str;
usr.sbin/config/sem.c
1139
else if (lp[n->nv_int] == NULL) {
usr.sbin/config/sem.c
1142
n->nv_name);
usr.sbin/config/sem.c
1146
ep = extend(extra, sizeof(extra), ep, n->nv_name);
usr.sbin/config/sem.c
158
setmaxusers(int n)
usr.sbin/config/sem.c
162
warnx("warning: duplicate maxusers parameter, will use latest definition (%d)", n);
usr.sbin/config/sem.c
164
maxusers = n;
usr.sbin/config/sem.c
165
if (n < minmaxusers) {
usr.sbin/config/sem.c
168
} else if (n > maxmaxusers) {
usr.sbin/config/sem.c
169
warnx("warning: maxusers (%d) > %d", n, maxmaxusers);
usr.sbin/config/sem.c
232
struct nvlist *n;
usr.sbin/config/sem.c
234
n = newnv(NULL, NULL, dev, 0, l);
usr.sbin/config/sem.c
235
return (n);
usr.sbin/config/sem.c
488
setmajor(struct devbase *d, int n)
usr.sbin/config/sem.c
495
d->d_major = n;
usr.sbin/config/sem.h
55
void setmajor(struct devbase *d, int n);
usr.sbin/cron/crontab.c
209
char n[PATH_MAX];
usr.sbin/cron/crontab.c
213
if (snprintf(n, sizeof n, "%s/%s", _PATH_CRON_SPOOL, User) >= sizeof(n))
usr.sbin/cron/crontab.c
215
if (!(f = fopen(n, "r"))) {
usr.sbin/cron/crontab.c
219
warn("%s", n);
usr.sbin/cron/crontab.c
234
char n[PATH_MAX];
usr.sbin/cron/crontab.c
237
if (snprintf(n, sizeof n, "%s/%s", _PATH_CRON_SPOOL, User) >= sizeof(n))
usr.sbin/cron/crontab.c
239
if (unlink(n) != 0) {
usr.sbin/cron/crontab.c
243
warn("%s", n);
usr.sbin/cron/crontab.c
259
char n[PATH_MAX], q[MAX_TEMPSTR];
usr.sbin/cron/crontab.c
266
if (snprintf(n, sizeof n, "%s/%s", _PATH_CRON_SPOOL, User) >= sizeof(n))
usr.sbin/cron/crontab.c
268
if (!(f = fopen(n, "r"))) {
usr.sbin/cron/crontab.c
270
err(EXIT_FAILURE, "%s", n);
usr.sbin/cron/crontab.c
426
char n[PATH_MAX], envstr[MAX_ENVSTR];
usr.sbin/cron/crontab.c
520
if (snprintf(n, sizeof n, "%s/%s", _PATH_CRON_SPOOL, User) >= sizeof(n)) {
usr.sbin/cron/crontab.c
525
if (rename(TempFilename, n)) {
usr.sbin/cron/crontab.c
526
warn("unable to rename %s to %s", TempFilename, n);
usr.sbin/crunchgen/crunchgen.c
852
char *n, *s, *d;
usr.sbin/crunchgen/crunchgen.c
860
if ((n = strdup(str)) == NULL)
usr.sbin/crunchgen/crunchgen.c
862
for (d = s = n; *s != '\0'; s++) {
usr.sbin/crunchgen/crunchgen.c
869
return n;
usr.sbin/dhcp6leasectl/dhcp6leasectl.c
143
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dhcp6leasectl/dhcp6leasectl.c
145
if (n == 0)
usr.sbin/dhcp6leasectl/dhcp6leasectl.c
148
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dhcp6leasectl/dhcp6leasectl.c
150
if (n == 0)
usr.sbin/dhcp6leasectl/dhcp6leasectl.c
71
int n, lFlag = 0, maxwait_set = 0, didot = 0;
usr.sbin/dhcpd/confpars.c
1550
int n;
usr.sbin/dhcpd/confpars.c
1553
n = dn_comp(domains[i], &buf[bufn], bufsiz - bufn, bufptrs,
usr.sbin/dhcpd/confpars.c
1555
if (n == -1)
usr.sbin/dhcpd/confpars.c
1557
bufn += (size_t)n;
usr.sbin/dhcpd/confpars.c
198
char *n;
usr.sbin/dhcpd/confpars.c
271
n = piaddr(share->subnets->net);
usr.sbin/dhcpd/confpars.c
272
share->name = strdup(n);
usr.sbin/dhcpd/dhcpd.c
358
struct subnet *n;
usr.sbin/dhcpd/dhcpd.c
365
for (n = subnets; n; n = n->next_subnet)
usr.sbin/dhcpd/dhcpd.c
366
for (g = n->group; g; g = g->next)
usr.sbin/dhcpd/dhcpd.c
375
for (n = subnets; n; n = n->next_subnet)
usr.sbin/dhcpd/dhcpd.c
376
for (g = n->group; g; g = g->next)
usr.sbin/dhcpd/parse.c
511
size_t n;
usr.sbin/dhcpd/parse.c
526
n = strlcat(timestr, val, sizeof(timestr));
usr.sbin/dhcpd/parse.c
527
if (n >= sizeof(timestr)) {
usr.sbin/dhcpd/pfutils.c
201
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
usr.sbin/dhcpd/pfutils.c
207
while (n > pos) {
usr.sbin/dhcpd/pfutils.c
208
res = (f) (fd, s + pos, n - pos);
usr.sbin/dhcpleasectl/dhcpleasectl.c
177
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dhcpleasectl/dhcpleasectl.c
179
if (n == 0)
usr.sbin/dhcpleasectl/dhcpleasectl.c
182
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dhcpleasectl/dhcpleasectl.c
184
if (n == 0)
usr.sbin/dhcpleasectl/dhcpleasectl.c
71
int n, lFlag = 0, maxwait_set = 0, didot = 0;
usr.sbin/dvmrpctl/dvmrpctl.c
181
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dvmrpctl/dvmrpctl.c
183
if (n == 0)
usr.sbin/dvmrpctl/dvmrpctl.c
187
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dvmrpctl/dvmrpctl.c
189
if (n == 0)
usr.sbin/dvmrpctl/dvmrpctl.c
82
int n;
usr.sbin/dvmrpd/control.c
227
int n;
usr.sbin/dvmrpd/control.c
250
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/dvmrpd/control.c
255
if (n == 0)
usr.sbin/dvmrpd/dvmrpd.c
317
ssize_t n;
usr.sbin/dvmrpd/dvmrpd.c
321
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dvmrpd/dvmrpd.c
323
if (n == 0) /* connection closed */
usr.sbin/dvmrpd/dvmrpd.c
336
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dvmrpd/dvmrpd.c
339
if (n == 0)
usr.sbin/dvmrpd/dvmrpd.c
381
ssize_t n;
usr.sbin/dvmrpd/dvmrpd.c
385
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dvmrpd/dvmrpd.c
387
if (n == 0) /* connection closed */
usr.sbin/dvmrpd/dvmrpd.c
400
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dvmrpd/dvmrpd.c
403
if (n == 0)
usr.sbin/dvmrpd/dvmrpe.c
242
ssize_t n;
usr.sbin/dvmrpd/dvmrpe.c
246
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dvmrpd/dvmrpe.c
248
if (n == 0) /* connection closed */
usr.sbin/dvmrpd/dvmrpe.c
261
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dvmrpd/dvmrpe.c
263
if (n == 0)
usr.sbin/dvmrpd/dvmrpe.c
318
ssize_t n;
usr.sbin/dvmrpd/dvmrpe.c
322
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dvmrpd/dvmrpe.c
324
if (n == 0) /* connection closed */
usr.sbin/dvmrpd/dvmrpe.c
337
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dvmrpd/dvmrpe.c
339
if (n == 0)
usr.sbin/dvmrpd/kroute.c
376
ssize_t n;
usr.sbin/dvmrpd/kroute.c
381
if ((n = read(fd, &buf, sizeof(buf))) == -1) {
usr.sbin/dvmrpd/kroute.c
387
if (n == 0)
usr.sbin/dvmrpd/kroute.c
390
lim = buf + n;
usr.sbin/dvmrpd/rde.c
207
ssize_t n;
usr.sbin/dvmrpd/rde.c
211
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/dvmrpd/rde.c
213
if (n == 0) /* connection closed */
usr.sbin/dvmrpd/rde.c
226
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/dvmrpd/rde.c
228
if (n == 0)
usr.sbin/eigrpctl/eigrpctl.c
225
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpctl/eigrpctl.c
227
if (n == 0)
usr.sbin/eigrpctl/eigrpctl.c
231
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpctl/eigrpctl.c
233
if (n == 0)
usr.sbin/eigrpctl/eigrpctl.c
85
int n, verbose = 0;
usr.sbin/eigrpd/control.c
218
ssize_t n;
usr.sbin/eigrpd/control.c
241
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/eigrpd/control.c
246
if (n == 0)
usr.sbin/eigrpd/eigrpd.c
374
ssize_t n;
usr.sbin/eigrpd/eigrpd.c
380
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpd/eigrpd.c
382
if (n == 0) /* connection closed */
usr.sbin/eigrpd/eigrpd.c
395
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpd/eigrpd.c
398
if (n == 0)
usr.sbin/eigrpd/eigrpd.c
452
ssize_t n;
usr.sbin/eigrpd/eigrpd.c
458
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpd/eigrpd.c
460
if (n == 0) /* connection closed */
usr.sbin/eigrpd/eigrpd.c
473
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpd/eigrpd.c
476
if (n == 0)
usr.sbin/eigrpd/eigrpe.c
228
int n, shut = 0;
usr.sbin/eigrpd/eigrpe.c
231
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpd/eigrpe.c
233
if (n == 0) /* connection closed */
usr.sbin/eigrpd/eigrpe.c
246
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpd/eigrpe.c
248
if (n == 0)
usr.sbin/eigrpd/eigrpe.c
401
int n, shut = 0;
usr.sbin/eigrpd/eigrpe.c
404
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpd/eigrpe.c
406
if (n == 0) /* connection closed */
usr.sbin/eigrpd/eigrpe.c
419
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpd/eigrpe.c
421
if (n == 0)
usr.sbin/eigrpd/kroute.c
1307
ssize_t n;
usr.sbin/eigrpd/kroute.c
1309
if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) {
usr.sbin/eigrpd/kroute.c
1316
if (n == 0) {
usr.sbin/eigrpd/kroute.c
1321
return (rtmsg_process(buf, n));
usr.sbin/eigrpd/neighbor.c
167
struct nbr n;
usr.sbin/eigrpd/neighbor.c
175
n.ei = &i;
usr.sbin/eigrpd/neighbor.c
176
n.addr = *addr;
usr.sbin/eigrpd/neighbor.c
178
return (RB_FIND(nbr_addr_head, &ei->eigrp->nbrs, &n));
usr.sbin/eigrpd/neighbor.c
184
struct nbr n;
usr.sbin/eigrpd/neighbor.c
185
n.peerid = peerid;
usr.sbin/eigrpd/neighbor.c
186
return (RB_FIND(nbr_pid_head, &nbrs_by_pid, &n));
usr.sbin/eigrpd/rde.c
174
ssize_t n;
usr.sbin/eigrpd/rde.c
180
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpd/rde.c
182
if (n == 0) /* connection closed */
usr.sbin/eigrpd/rde.c
195
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpd/rde.c
197
if (n == 0)
usr.sbin/eigrpd/rde.c
311
ssize_t n;
usr.sbin/eigrpd/rde.c
317
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/eigrpd/rde.c
319
if (n == 0) /* connection closed */
usr.sbin/eigrpd/rde.c
332
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/eigrpd/rde.c
334
if (n == 0)
usr.sbin/eigrpd/rde_dual.c
1273
struct rde_nbr n;
usr.sbin/eigrpd/rde_dual.c
1275
n.peerid = peerid;
usr.sbin/eigrpd/rde_dual.c
1277
return (RB_FIND(rde_nbr_head, &rde_nbrs, &n));
usr.sbin/ftp-proxy/ftp-proxy.c
1077
int n;
usr.sbin/ftp-proxy/ftp-proxy.c
1087
while ((n = get_line(s->sbuf, &s->sbuf_valid)) > 0) {
usr.sbin/ftp-proxy/ftp-proxy.c
1096
if (n == -1) {
usr.sbin/ftp-proxy/ftp-proxy.c
1108
static int n = 0;
usr.sbin/ftp-proxy/ftp-proxy.c
1111
n = (n + 1) % NTOP_BUFS;
usr.sbin/ftp-proxy/ftp-proxy.c
1112
ntop_buf[n][0] = '\0';
usr.sbin/ftp-proxy/ftp-proxy.c
1117
return (inet_ntop(AF_INET, &sin->sin_addr, ntop_buf[n],
usr.sbin/ftp-proxy/ftp-proxy.c
1124
return (inet_ntop(AF_INET6, &sin6->sin6_addr, ntop_buf[n],
usr.sbin/ftp-proxy/ftp-proxy.c
234
int n;
usr.sbin/ftp-proxy/ftp-proxy.c
242
while ((n = get_line(s->cbuf, &s->cbuf_valid)) > 0) {
usr.sbin/ftp-proxy/ftp-proxy.c
251
if (n == -1) {
usr.sbin/ftp-proxy/ftp-proxy.c
821
int n;
usr.sbin/ftp-proxy/ftp-proxy.c
833
n = sscanf(p, " %u,%u,%u,%u,%u,%u", &v[0], &v[1], &v[2],
usr.sbin/ftp-proxy/ftp-proxy.c
835
if (n == 6 && v[0] < 256 && v[1] < 256 && v[2] < 256 &&
usr.sbin/ftp-proxy/ftp-proxy.c
840
n = sscanf(p, "(%u,%u,%u,%u,%u,%u)", &v[0], &v[1], &v[2],
usr.sbin/ftp-proxy/ftp-proxy.c
842
if (n == 6 && v[0] < 256 && v[1] < 256 && v[2] < 256 &&
usr.sbin/ftp-proxy/ftp-proxy.c
847
n = sscanf(p, "(|||%u|)", &port);
usr.sbin/ftp-proxy/ftp-proxy.c
848
if (n == 1 && port < 65536)
usr.sbin/ftp-proxy/ftp-proxy.c
852
n = sscanf(p, " |1|%u.%u.%u.%u|%u|", &v[0], &v[1], &v[2],
usr.sbin/ftp-proxy/ftp-proxy.c
854
if (n == 5 && v[0] < 256 && v[1] < 256 && v[2] < 256 &&
usr.sbin/ftp-proxy/ftp-proxy.c
857
n = sscanf(p, " |2|%*[a-fA-F0-9:]|%u|", &port);
usr.sbin/ftp-proxy/ftp-proxy.c
858
if (n == 1 && port < 65536)
usr.sbin/gpioctl/gpioctl.c
152
for (n = 3; n < argc; n++) {
usr.sbin/gpioctl/gpioctl.c
155
if (!strcmp(argv[n],
usr.sbin/gpioctl/gpioctl.c
162
nam = argv[n];
usr.sbin/gpioctl/gpioctl.c
75
int pin, ch, ga_offset = -1, n, fl = 0, value = 0;
usr.sbin/hostapd/hostapd.c
101
size_t n;
usr.sbin/hostapd/hostapd.c
108
if ((n = strlcpy(newfmt, printbuf, sizeof(newfmt))) >= sizeof(newfmt))
usr.sbin/hostapd/hostapd.c
110
if (strlcpy(newfmt + n, fmt, sizeof(newfmt) - n) >= sizeof(newfmt) - n)
usr.sbin/hostapd/privsep.c
191
int n;
usr.sbin/hostapd/privsep.c
196
n = ENXIO;
usr.sbin/hostapd/privsep.c
197
hostapd_must_write(fd, &n, sizeof(int));
usr.sbin/hostapd/privsep.c
488
hostapd_may_read(int fd, void *buf, size_t n)
usr.sbin/hostapd/privsep.c
493
while ((ssize_t)n > pos) {
usr.sbin/hostapd/privsep.c
494
res = read(fd, s + pos, n - pos);
usr.sbin/hostapd/privsep.c
514
hostapd_must_read(int fd, void *buf, size_t n)
usr.sbin/hostapd/privsep.c
519
while ((ssize_t)n > pos) {
usr.sbin/hostapd/privsep.c
520
res = read(fd, s + pos, n - pos);
usr.sbin/hostapd/privsep.c
540
hostapd_must_write(int fd, void *buf, size_t n)
usr.sbin/hostapd/privsep.c
545
while ((ssize_t)n > pos) {
usr.sbin/hostapd/privsep.c
546
res = write(fd, s + pos, n - pos);
usr.sbin/httpd/config.c
211
int fd, n, m;
usr.sbin/httpd/config.c
248
n = -1;
usr.sbin/httpd/config.c
249
proc_range(ps, id, &n, &m);
usr.sbin/httpd/config.c
250
for (n = 0; n < m; n++) {
usr.sbin/httpd/config.c
255
if (proc_composev_imsg(ps, id, n,
usr.sbin/httpd/config.c
264
if (proc_flush_imsg(ps, id, n) == -1) {
usr.sbin/httpd/control.c
228
int n;
usr.sbin/httpd/control.c
252
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/httpd/control.c
257
if (n == 0)
usr.sbin/httpd/parse.y
2490
getservice(char *n)
usr.sbin/httpd/parse.y
2496
llval = strtonum(n, 0, UINT16_MAX, &errstr);
usr.sbin/httpd/parse.y
2498
s = getservbyname(n, "tcp");
usr.sbin/httpd/parse.y
2500
s = getservbyname(n, "udp");
usr.sbin/httpd/proc.c
247
unsigned int n)
usr.sbin/httpd/proc.c
257
dst, n + 1);
usr.sbin/httpd/proc.c
263
if (pp->pp_pipes[dst][n] != -1) {
usr.sbin/httpd/proc.c
268
pp->pp_pipes[dst][n] = fd;
usr.sbin/httpd/proc.c
270
iev = &ps->ps_ievs[dst][n];
usr.sbin/httpd/proc.c
444
unsigned int dst, n;
usr.sbin/httpd/proc.c
456
for (n = 0; n < ps->ps_instances[dst]; n++) {
usr.sbin/httpd/proc.c
457
if (pp->pp_pipes[dst][n] == -1)
usr.sbin/httpd/proc.c
461
event_del(&(ps->ps_ievs[dst][n].ev));
usr.sbin/httpd/proc.c
462
imsgbuf_clear(&(ps->ps_ievs[dst][n].ibuf));
usr.sbin/httpd/proc.c
463
close(pp->pp_pipes[dst][n]);
usr.sbin/httpd/proc.c
464
pp->pp_pipes[dst][n] = -1;
usr.sbin/httpd/proc.c
600
ssize_t n;
usr.sbin/httpd/proc.c
609
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/httpd/proc.c
611
if (n == 0) {
usr.sbin/httpd/proc.c
632
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/httpd/proc.c
634
if (n == 0)
usr.sbin/httpd/proc.c
733
proc_range(struct privsep *ps, enum privsep_procid id, int *n, int *m)
usr.sbin/httpd/proc.c
735
if (*n == -1) {
usr.sbin/httpd/proc.c
737
*n = 0;
usr.sbin/httpd/proc.c
741
*m = *n + 1;
usr.sbin/httpd/proc.c
746
proc_compose_imsg(struct privsep *ps, enum privsep_procid id, int n,
usr.sbin/httpd/proc.c
751
proc_range(ps, id, &n, &m);
usr.sbin/httpd/proc.c
752
for (; n < m; n++) {
usr.sbin/httpd/proc.c
753
if (imsg_compose_event(&ps->ps_ievs[id][n],
usr.sbin/httpd/proc.c
769
proc_composev_imsg(struct privsep *ps, enum privsep_procid id, int n,
usr.sbin/httpd/proc.c
774
proc_range(ps, id, &n, &m);
usr.sbin/httpd/proc.c
775
for (; n < m; n++)
usr.sbin/httpd/proc.c
776
if (imsg_composev_event(&ps->ps_ievs[id][n],
usr.sbin/httpd/proc.c
792
enum privsep_procid id, int n)
usr.sbin/httpd/proc.c
794
return (proc_compose_imsg(ps, id, n, imsg->hdr.type,
usr.sbin/httpd/proc.c
799
proc_ibuf(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/httpd/proc.c
803
proc_range(ps, id, &n, &m);
usr.sbin/httpd/proc.c
804
return (&ps->ps_ievs[id][n].ibuf);
usr.sbin/httpd/proc.c
808
proc_iev(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/httpd/proc.c
812
proc_range(ps, id, &n, &m);
usr.sbin/httpd/proc.c
813
return (&ps->ps_ievs[id][n]);
usr.sbin/httpd/proc.c
818
proc_flush_imsg(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/httpd/proc.c
823
proc_range(ps, id, &n, &m);
usr.sbin/httpd/proc.c
824
for (; n < m; n++) {
usr.sbin/httpd/proc.c
825
if ((ibuf = proc_ibuf(ps, id, n)) == NULL)
usr.sbin/httpd/proc.c
829
imsg_event_add(&ps->ps_ievs[id][n]);
usr.sbin/httpd/server_http.c
1133
int n, ret;
usr.sbin/httpd/server_http.c
1149
n = strtonum(ibuf + 1, 0,
usr.sbin/httpd/server_http.c
1155
if ((str = url_encode(clt->clt_srv_match.sm_match[n])) == NULL)
usr.sbin/httpd/server_http.c
1485
server_root_strip(const char *path, int n)
usr.sbin/httpd/server_http.c
1490
for (; n > 0 && *path != '\0'; n--)
usr.sbin/identd/identd.c
1008
ssize_t n;
usr.sbin/identd/identd.c
1011
n = read(fd, buf, sizeof(buf));
usr.sbin/identd/identd.c
1012
switch (n) {
usr.sbin/identd/identd.c
1029
c->rxbytes += n;
usr.sbin/identd/identd.c
1041
n = write(fd, c->buf + c->bufoff, c->buflen - c->bufoff);
usr.sbin/identd/identd.c
1042
if (n == -1) {
usr.sbin/identd/identd.c
1055
c->bufoff += n;
usr.sbin/identd/identd.c
382
ssize_t n;
usr.sbin/identd/identd.c
385
n = read(fd, &uid, sizeof(uid));
usr.sbin/identd/identd.c
386
switch (n) {
usr.sbin/identd/identd.c
401
lerrx(1, "unexpected %zd data from child", n);
usr.sbin/identd/identd.c
420
n = (*parent_uprintf)(r, pw);
usr.sbin/identd/identd.c
421
if (n == -1) {
usr.sbin/identd/identd.c
426
r->buflen = n + 1;
usr.sbin/identd/identd.c
489
ssize_t n;
usr.sbin/identd/identd.c
501
n = writev(fd, iov, iovcnt);
usr.sbin/identd/identd.c
502
if (n == -1) {
usr.sbin/identd/identd.c
513
if (n != sizeof(r->error) + r->buflen)
usr.sbin/identd/identd.c
514
lerrx(1, "unexpected parent write length %zd", n);
usr.sbin/identd/identd.c
535
ssize_t n;
usr.sbin/identd/identd.c
537
n = read(fd, &reply, sizeof(reply));
usr.sbin/identd/identd.c
538
switch (n) {
usr.sbin/identd/identd.c
560
if (n < sizeof(reply.error))
usr.sbin/identd/identd.c
572
n = asprintf(&c->buf, "%u , %u : USERID : UNIX : %s\r\n",
usr.sbin/identd/identd.c
576
n = asprintf(&c->buf, "%u , %u : ERROR : %s\r\n",
usr.sbin/identd/identd.c
581
n = asprintf(&c->buf, "%u , %u : ERROR : UNKNOWN-ERROR\r\n",
usr.sbin/identd/identd.c
585
n = asprintf(&c->buf, "%u , %u : ERROR : HIDDEN-USER\r\n",
usr.sbin/identd/identd.c
591
if (n == -1)
usr.sbin/identd/identd.c
594
c->buflen = n;
usr.sbin/identd/identd.c
612
ssize_t n;
usr.sbin/identd/identd.c
614
n = write(fd, &c->uid, sizeof(c->uid));
usr.sbin/identd/identd.c
615
switch (n) {
usr.sbin/identd/identd.c
632
lerrx(1, "unexpected child write length %zd", n);
usr.sbin/identd/identd.c
780
ssize_t n, i;
usr.sbin/identd/identd.c
783
n = read(fd, buf, sizeof(buf));
usr.sbin/identd/identd.c
784
switch (n) {
usr.sbin/identd/identd.c
803
c->rxbytes += n;
usr.sbin/identd/identd.c
807
for (i = 0; c->state < S_EOL && i < n; i++)
usr.sbin/identd/identd.c
847
ssize_t n;
usr.sbin/identd/identd.c
849
n = asprintf(&c->buf, "%u , %u : ERROR : %s\r\n",
usr.sbin/identd/identd.c
851
if (n == -1)
usr.sbin/identd/identd.c
854
c->buflen = n;
usr.sbin/identd/identd.c
881
ssize_t n;
usr.sbin/identd/identd.c
888
n = read(fd, buf, sizeof(buf));
usr.sbin/identd/identd.c
889
switch (n) {
usr.sbin/identd/identd.c
905
c->rxbytes += n;
usr.sbin/ikectl/ikectl.c
165
int n;
usr.sbin/ikectl/ikectl.c
347
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ikectl/ikectl.c
349
if (n == 0)
usr.sbin/ikectl/ikectl.c
353
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ikectl/ikectl.c
355
if (n == 0)
usr.sbin/ikectl/ikectl.c
433
plural(uint64_t n)
usr.sbin/ikectl/ikectl.c
435
return (n != 1 ? "s" : "");
usr.sbin/inetd/inetd.c
899
socklen_t n;
usr.sbin/inetd/inetd.c
908
n = sizeof sin;
usr.sbin/inetd/inetd.c
909
if (getsockname(sep->se_fd, (struct sockaddr *)&sin, &n) == -1) {
usr.sbin/inetd/inetd.c
915
for (n = sep->se_rpcversl; n <= sep->se_rpcversh; n++) {
usr.sbin/inetd/inetd.c
918
sep->se_rpcprog, n, pp->p_proto,
usr.sbin/inetd/inetd.c
920
(void)pmap_unset(sep->se_rpcprog, n);
usr.sbin/inetd/inetd.c
921
if (!pmap_set(sep->se_rpcprog, n, pp->p_proto, ntohs(sin.sin_port)))
usr.sbin/inetd/inetd.c
924
sep->se_rpcprog, n, pp->p_proto,
usr.sbin/inetd/inetd.c
932
int n;
usr.sbin/inetd/inetd.c
934
for (n = sep->se_rpcversl; n <= sep->se_rpcversh; n++) {
usr.sbin/inetd/inetd.c
937
sep->se_rpcprog, n);
usr.sbin/inetd/inetd.c
938
if (!pmap_unset(sep->se_rpcprog, n))
usr.sbin/inetd/inetd.c
940
sep->se_rpcprog, n);
usr.sbin/installboot/i386_nlist.c
301
int fd, n;
usr.sbin/installboot/i386_nlist.c
306
n = __elf_fdnlist(fd, list);
usr.sbin/installboot/i386_nlist.c
309
return (n);
usr.sbin/installboot/util.c
104
int n;
usr.sbin/installboot/util.c
110
n = snprintf(s, PATH_MAX, "%s/%s", base, path);
usr.sbin/installboot/util.c
111
if (n < 0 || n >= PATH_MAX) {
usr.sbin/installboot/util.c
127
n = snprintf(s, PATH_MAX, "%s/%s", r, b);
usr.sbin/installboot/util.c
128
if (n < 0 || n >= PATH_MAX) {
usr.sbin/installboot/util.c
41
ssize_t sz, n;
usr.sbin/installboot/util.c
77
n = MINIMUM(sz, BUFSIZE);
usr.sbin/installboot/util.c
78
if ((n = read(sfd, buf, n)) == -1) {
usr.sbin/installboot/util.c
83
sz -= n;
usr.sbin/installboot/util.c
84
if (write(dfd, buf, n) != n) {
usr.sbin/iscsictl/iscsictl.c
219
ssize_t n;
usr.sbin/iscsictl/iscsictl.c
224
if ((n = recv(control.fd, cbuf, sizeof(cbuf), 0)) == -1 &&
usr.sbin/iscsictl/iscsictl.c
228
if (n == 0)
usr.sbin/iscsictl/iscsictl.c
231
pdu = ctl_getpdu(cbuf, n);
usr.sbin/iscsictl/iscsictl.c
270
size_t n;
usr.sbin/iscsictl/iscsictl.c
279
n = sizeof(*cmh);
usr.sbin/iscsictl/iscsictl.c
280
cmh = pdu_alloc(n);
usr.sbin/iscsictl/iscsictl.c
281
bcopy(buf, cmh, n);
usr.sbin/iscsictl/iscsictl.c
282
buf += n;
usr.sbin/iscsictl/iscsictl.c
283
len -= n;
usr.sbin/iscsictl/iscsictl.c
285
if (pdu_addbuf(p, cmh, n, 0)) {
usr.sbin/iscsictl/iscsictl.c
293
n = cmh->len[i];
usr.sbin/iscsictl/iscsictl.c
294
if (n == 0)
usr.sbin/iscsictl/iscsictl.c
296
if (PDU_LEN(n) > len)
usr.sbin/iscsictl/iscsictl.c
298
if (!(data = pdu_alloc(n)))
usr.sbin/iscsictl/iscsictl.c
300
bcopy(buf, data, n);
usr.sbin/iscsictl/iscsictl.c
301
if (pdu_addbuf(p, data, n, i + 1)) {
usr.sbin/iscsictl/iscsictl.c
305
buf += PDU_LEN(n);
usr.sbin/iscsictl/iscsictl.c
306
len -= PDU_LEN(n);
usr.sbin/iscsid/connection.c
137
ssize_t n;
usr.sbin/iscsid/connection.c
143
if ((n = pdu_read(c)) == -1) {
usr.sbin/iscsid/connection.c
151
if (n == 0) { /* connection closed */
usr.sbin/iscsid/connection.c
163
ssize_t n;
usr.sbin/iscsid/connection.c
185
if ((n = pdu_write(c)) == -1) {
usr.sbin/iscsid/connection.c
190
if (n == 0) { /* connection closed */
usr.sbin/iscsid/control.c
205
ssize_t n;
usr.sbin/iscsid/control.c
215
if ((n = recv(fd, cbuf, sizeof(cbuf), 0)) == -1 &&
usr.sbin/iscsid/control.c
220
if (n == 0) {
usr.sbin/iscsid/control.c
224
pdu = control_getpdu(cbuf, n);
usr.sbin/iscsid/control.c
265
size_t n;
usr.sbin/iscsid/control.c
274
n = sizeof(*cmh);
usr.sbin/iscsid/control.c
275
cmh = pdu_alloc(n);
usr.sbin/iscsid/control.c
276
memcpy(cmh, buf, n);
usr.sbin/iscsid/control.c
277
buf += n;
usr.sbin/iscsid/control.c
278
len -= n;
usr.sbin/iscsid/control.c
280
if (pdu_addbuf(p, cmh, n, 0)) {
usr.sbin/iscsid/control.c
288
n = cmh->len[i];
usr.sbin/iscsid/control.c
289
if (n == 0)
usr.sbin/iscsid/control.c
291
if (PDU_LEN(n) > len)
usr.sbin/iscsid/control.c
293
if (!(data = pdu_alloc(n)))
usr.sbin/iscsid/control.c
295
memcpy(data, buf, n);
usr.sbin/iscsid/control.c
296
if (pdu_addbuf(p, data, n, i + 1)) {
usr.sbin/iscsid/control.c
300
buf += PDU_LEN(n);
usr.sbin/iscsid/control.c
301
len -= PDU_LEN(n);
usr.sbin/iscsid/initiator.c
388
int n;
usr.sbin/iscsid/initiator.c
417
if ((n = text_to_pdu(kvp, p)) == -1) {
usr.sbin/iscsid/initiator.c
423
if (n > 8192) {
usr.sbin/iscsid/initiator.c
428
n = htonl(n);
usr.sbin/iscsid/initiator.c
430
memcpy(&lreq->ahslen, &n, sizeof(n));
usr.sbin/iscsid/initiator.c
440
int n;
usr.sbin/iscsid/initiator.c
451
if ((n = text_to_pdu(kvp, p)) == -1)
usr.sbin/iscsid/initiator.c
453
n = htonl(n);
usr.sbin/iscsid/initiator.c
454
memcpy(&lreq->ahslen, &n, sizeof(n));
usr.sbin/iscsid/initiator.c
466
size_t n, size;
usr.sbin/iscsid/initiator.c
485
buf = pdu_getbuf(p, &n, PDU_DATA);
usr.sbin/iscsid/initiator.c
486
if (size > n) {
usr.sbin/iscsid/initiator.c
549
size_t n, size;
usr.sbin/iscsid/initiator.c
561
buf = pdu_getbuf(p, &n, PDU_DATA);
usr.sbin/iscsid/initiator.c
562
if (size > n || buf == NULL)
usr.sbin/iscsid/pdu.c
101
if (n == len) {
usr.sbin/iscsid/pdu.c
105
len = n + 1;
usr.sbin/iscsid/pdu.c
107
for(n = 0; n < len; n++)
usr.sbin/iscsid/pdu.c
108
if (buf[n] == '\0')
usr.sbin/iscsid/pdu.c
260
ssize_t n;
usr.sbin/iscsid/pdu.c
275
if ((n = readv(c->fd, iov, niov)) == -1)
usr.sbin/iscsid/pdu.c
277
if (n == 0)
usr.sbin/iscsid/pdu.c
281
c->prbuf.wpos += n;
usr.sbin/iscsid/pdu.c
285
return n;
usr.sbin/iscsid/pdu.c
295
ssize_t n;
usr.sbin/iscsid/pdu.c
314
if ((n = writev(c->fd, iov, niov)) == -1) {
usr.sbin/iscsid/pdu.c
323
if (n == 0)
usr.sbin/iscsid/pdu.c
326
size = n;
usr.sbin/iscsid/pdu.c
349
return n;
usr.sbin/iscsid/pdu.c
368
ssize_t n;
usr.sbin/iscsid/pdu.c
412
n = pdu_readbuf_read(&c->prbuf,
usr.sbin/iscsid/pdu.c
415
p->resid += n;
usr.sbin/iscsid/pdu.c
416
if (n == 0 || off + n !=
usr.sbin/iscsid/pdu.c
60
int n, nk;
usr.sbin/iscsid/pdu.c
77
n = snprintf(s, rem, "%s=%s", k[nk].key, k[nk].value);
usr.sbin/iscsid/pdu.c
78
if (n < 0 || (size_t)n >= rem)
usr.sbin/iscsid/pdu.c
80
rem -= n + 1;
usr.sbin/iscsid/pdu.c
81
s += n + 1;
usr.sbin/iscsid/pdu.c
94
size_t n;
usr.sbin/iscsid/pdu.c
99
for (n = len; n > 0 && buf[n - 1] == '\0'; n--)
usr.sbin/iscsid/vscsi.c
215
size_t size, off, n;
usr.sbin/iscsid/vscsi.c
243
buf = pdu_getbuf(p, &n, PDU_DATA);
usr.sbin/iscsid/vscsi.c
257
buf = pdu_getbuf(p, &n, PDU_DATA);
usr.sbin/iscsid/vscsi.c
260
if (size > n)
usr.sbin/ldapctl/ldapctl.c
245
ssize_t n;
usr.sbin/ldapctl/ldapctl.c
363
if ((n = imsgbuf_read(&ibuf)) == -1)
usr.sbin/ldapctl/ldapctl.c
365
if (n == 0)
usr.sbin/ldapctl/ldapctl.c
369
if ((n = imsg_get(&ibuf, &imsg)) == -1)
usr.sbin/ldapctl/ldapctl.c
371
if (n == 0)
usr.sbin/ldapctl/ldapctl.c
412
#define ZDIV(t,n) ((n) == 0 ? 0 : (float)(t) / (n))
usr.sbin/ldapd/btree.c
2646
size_t n = 0;
usr.sbin/ldapd/btree.c
2661
n++;
usr.sbin/ldapd/btree.c
2665
sep->size = n + 1;
usr.sbin/ldapd/btree.c
2677
n++;
usr.sbin/ldapd/btree.c
2678
if (n == min->ksize || n == sep->size)
usr.sbin/ldapd/btree.c
2682
sep->size = n + 1;
usr.sbin/ldapd/btree.c
365
size_t n = 0;
usr.sbin/ldapd/btree.c
383
n++;
usr.sbin/ldapd/btree.c
386
assert(n <= (int)sizeof(pfx->str));
usr.sbin/ldapd/btree.c
387
pfx->len = n;
usr.sbin/ldapd/btree.c
388
bcopy(p2 + 1, pfx->str, n);
usr.sbin/ldapd/btree.c
394
if (n == min->len || n == max->len)
usr.sbin/ldapd/btree.c
398
n++;
usr.sbin/ldapd/btree.c
401
assert(n <= (int)sizeof(pfx->str));
usr.sbin/ldapd/btree.c
402
pfx->len = n;
usr.sbin/ldapd/btree.c
403
bcopy(max->str, pfx->str, n);
usr.sbin/ldapd/btree.c
731
int n, done;
usr.sbin/ldapd/btree.c
785
n = 0;
usr.sbin/ldapd/btree.c
789
iov[n].iov_len = bt->head.psize;
usr.sbin/ldapd/btree.c
790
iov[n].iov_base = mp->page;
usr.sbin/ldapd/btree.c
791
if (++n >= BT_COMMIT_PAGES) {
usr.sbin/ldapd/btree.c
797
if (n == 0)
usr.sbin/ldapd/btree.c
800
DPRINTF("committing %u dirty pages", n);
usr.sbin/ldapd/btree.c
801
rc = writev(bt->fd, iov, n);
usr.sbin/ldapd/btree.c
802
if (rc != (ssize_t)bt->head.psize*n) {
usr.sbin/ldapd/btree.c
817
if (--n == 0)
usr.sbin/ldapd/evbuffer_tls.c
299
int n = EVBUFFER_MAX_READ;
usr.sbin/ldapd/evbuffer_tls.c
301
if (howmuch < 0 || howmuch > n)
usr.sbin/ldapd/evbuffer_tls.c
302
howmuch = n;
usr.sbin/ldapd/evbuffer_tls.c
311
n = tls_read(ctx, p, howmuch);
usr.sbin/ldapd/evbuffer_tls.c
312
if (n <= 0)
usr.sbin/ldapd/evbuffer_tls.c
313
return (n);
usr.sbin/ldapd/evbuffer_tls.c
315
buf->off += n;
usr.sbin/ldapd/evbuffer_tls.c
321
return (n);
usr.sbin/ldapd/evbuffer_tls.c
327
int n;
usr.sbin/ldapd/evbuffer_tls.c
329
n = tls_write(ctx, buffer->buffer, buffer->off);
usr.sbin/ldapd/evbuffer_tls.c
330
if (n <= 0)
usr.sbin/ldapd/evbuffer_tls.c
331
return (n);
usr.sbin/ldapd/evbuffer_tls.c
332
evbuffer_drain(buffer, n);
usr.sbin/ldapd/evbuffer_tls.c
334
return (n);
usr.sbin/ldapd/imsgev.c
110
ssize_t n;
usr.sbin/ldapd/imsgev.c
120
if ((n = imsgbuf_read(ibuf)) == -1) {
usr.sbin/ldapd/imsgev.c
124
if (n == 0) {
usr.sbin/ldapd/imsgev.c
150
if ((n = imsg_get(ibuf, &imsg)) == -1) {
usr.sbin/ldapd/imsgev.c
154
if (n == 0)
usr.sbin/ldapd/schema.c
260
struct name *n;
usr.sbin/ldapd/schema.c
269
if ((n = calloc(1, sizeof(*n))) == NULL) {
usr.sbin/ldapd/schema.c
274
n->name = name;
usr.sbin/ldapd/schema.c
275
SLIST_INSERT_HEAD(nl, n, next);
usr.sbin/ldapd/syntax.c
230
#define IS_XDIGITS(n, c) \
usr.sbin/ldapd/syntax.c
232
for (i = 0; i < (n); i++) \
usr.sbin/ldapd/syntax.c
266
int n;
usr.sbin/ldapd/syntax.c
274
n = (p[0] - '0') * 10 + (p[1] - '0'); \
usr.sbin/ldapd/syntax.c
275
if (n < min || n > max) \
usr.sbin/ldapd/util.c
61
size_t n;
usr.sbin/ldapd/util.c
68
n = strspn(s, " ");
usr.sbin/ldapd/util.c
69
if (s[n] == '\0' || s[n] == ',')
usr.sbin/ldomctl/ldom_util.h
33
#define roundup(n, m) (((n) + ((m) - 1)) & ~((m) - 1))
usr.sbin/ldpctl/ldpctl.c
214
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpctl/ldpctl.c
216
if (n == 0)
usr.sbin/ldpctl/ldpctl.c
220
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpctl/ldpctl.c
222
if (n == 0)
usr.sbin/ldpctl/ldpctl.c
82
int n;
usr.sbin/ldpd/control.c
202
ssize_t n;
usr.sbin/ldpd/control.c
225
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/ldpd/control.c
230
if (n == 0)
usr.sbin/ldpd/kroute.c
1531
ssize_t n;
usr.sbin/ldpd/kroute.c
1533
if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) {
usr.sbin/ldpd/kroute.c
1540
if (n == 0) {
usr.sbin/ldpd/kroute.c
1545
return (rtmsg_process(buf, n));
usr.sbin/ldpd/lde.c
199
ssize_t n;
usr.sbin/ldpd/lde.c
203
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpd/lde.c
205
if (n == 0) /* connection closed */
usr.sbin/ldpd/lde.c
218
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpd/lde.c
220
if (n == 0)
usr.sbin/ldpd/lde.c
395
ssize_t n;
usr.sbin/ldpd/lde.c
400
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpd/lde.c
402
if (n == 0) /* connection closed */
usr.sbin/ldpd/lde.c
415
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpd/lde.c
417
if (n == 0)
usr.sbin/ldpd/ldpd.c
382
ssize_t n;
usr.sbin/ldpd/ldpd.c
386
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpd/ldpd.c
388
if (n == 0) /* connection closed */
usr.sbin/ldpd/ldpd.c
401
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpd/ldpd.c
404
if (n == 0)
usr.sbin/ldpd/ldpd.c
463
ssize_t n;
usr.sbin/ldpd/ldpd.c
467
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpd/ldpd.c
469
if (n == 0) /* connection closed */
usr.sbin/ldpd/ldpd.c
482
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpd/ldpd.c
485
if (n == 0)
usr.sbin/ldpd/ldpe.c
233
int n, shut = 0;
usr.sbin/ldpd/ldpe.c
236
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpd/ldpe.c
238
if (n == 0) /* connection closed */
usr.sbin/ldpd/ldpe.c
251
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpd/ldpe.c
253
if (n == 0)
usr.sbin/ldpd/ldpe.c
499
int n, shut = 0;
usr.sbin/ldpd/ldpe.c
503
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ldpd/ldpe.c
505
if (n == 0) /* connection closed */
usr.sbin/ldpd/ldpe.c
518
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ldpd/ldpe.c
520
if (n == 0)
usr.sbin/ldpd/neighbor.c
335
struct nbr n;
usr.sbin/ldpd/neighbor.c
336
n.id.s_addr = lsr_id;
usr.sbin/ldpd/neighbor.c
337
return (RB_FIND(nbr_id_head, &nbrs_by_id, &n));
usr.sbin/ldpd/neighbor.c
343
struct nbr n;
usr.sbin/ldpd/neighbor.c
344
n.af = af;
usr.sbin/ldpd/neighbor.c
345
n.raddr = *addr;
usr.sbin/ldpd/neighbor.c
346
return (RB_FIND(nbr_addr_head, &nbrs_by_addr, &n));
usr.sbin/ldpd/neighbor.c
352
struct nbr n;
usr.sbin/ldpd/neighbor.c
353
n.peerid = peerid;
usr.sbin/ldpd/neighbor.c
354
return (RB_FIND(nbr_pid_head, &nbrs_by_pid, &n));
usr.sbin/ldpd/packet.c
429
ssize_t n, len;
usr.sbin/ldpd/packet.c
436
if ((n = read(fd, tcp->rbuf->buf + tcp->rbuf->wpos,
usr.sbin/ldpd/packet.c
446
if (n == 0) {
usr.sbin/ldpd/packet.c
452
tcp->rbuf->wpos += n;
usr.sbin/ldpd/parse.y
1490
struct nbr_params *n;
usr.sbin/ldpd/parse.y
1492
LIST_FOREACH(n, &conf->nbrp_list, entry) {
usr.sbin/ldpd/parse.y
1493
if (n->lsr_id.s_addr == lsr_id.s_addr) {
usr.sbin/ldpd/parse.y
1500
n = nbr_params_new(lsr_id);
usr.sbin/ldpd/parse.y
1501
LIST_INSERT_HEAD(&conf->nbrp_list, n, entry);
usr.sbin/ldpd/parse.y
1502
return (n);
usr.sbin/ldpd/parse.y
1597
struct nbr_params *n;
usr.sbin/ldpd/parse.y
1612
while ((n = LIST_FIRST(&xconf->nbrp_list)) != NULL) {
usr.sbin/ldpd/parse.y
1613
LIST_REMOVE(n, entry);
usr.sbin/ldpd/parse.y
1614
free(n);
usr.sbin/ldpd/pfkey.c
238
n = writev(sd, iov, iov_cnt);
usr.sbin/ldpd/pfkey.c
239
} while (n == -1 && (errno == EAGAIN || errno == EINTR));
usr.sbin/ldpd/pfkey.c
241
if (n == -1) {
usr.sbin/ldpd/pfkey.c
62
ssize_t n;
usr.sbin/lpd/io.c
1020
int n, saved_errno;
usr.sbin/lpd/io.c
1031
switch ((n = iobuf_read_ssl(&io->iobuf, (SSL*)io->tls))) {
usr.sbin/lpd/io.c
1054
io_debug("%s(...) -> r=%d", __func__, n);
usr.sbin/lpd/io.c
1069
int n, saved_errno;
usr.sbin/lpd/io.c
1079
switch ((n = iobuf_write_ssl(&io->iobuf, (SSL*)io->tls))) {
usr.sbin/lpd/io.c
1102
io_debug("%s(...) -> w=%d", __func__, n);
usr.sbin/lpd/io.c
555
int n;
usr.sbin/lpd/io.c
557
n = 0;
usr.sbin/lpd/io.c
568
n++;
usr.sbin/lpd/io.c
572
if (n)
usr.sbin/lpd/io.c
576
n++;
usr.sbin/lpd/io.c
580
if (n)
usr.sbin/lpd/io.c
584
n++;
usr.sbin/lpd/io.c
588
if (n)
usr.sbin/lpd/io.c
592
n++;
usr.sbin/lpd/io.c
596
if (n)
usr.sbin/lpd/io.c
762
ssize_t n;
usr.sbin/lpd/io.c
773
if ((n = iobuf_write(&io->iobuf, io->sock)) < 0) {
usr.sbin/lpd/io.c
774
if (n == IOBUF_WANT_WRITE) /* kqueue bug? */
usr.sbin/lpd/io.c
776
if (n == IOBUF_CLOSED)
usr.sbin/lpd/io.c
787
if (w > io->lowat && w - n <= io->lowat)
usr.sbin/lpd/io.c
794
if ((n = iobuf_read(&io->iobuf, io->sock)) < 0) {
usr.sbin/lpd/io.c
795
if (n == IOBUF_CLOSED)
usr.sbin/lpd/io.c
806
if (n)
usr.sbin/lpd/iobuf.c
105
iobuf_extend(struct iobuf *io, size_t n)
usr.sbin/lpd/iobuf.c
109
if (n > io->max)
usr.sbin/lpd/iobuf.c
112
if (io->max - io->size < n)
usr.sbin/lpd/iobuf.c
115
t = recallocarray(io->buf, io->size, io->size + n, 1);
usr.sbin/lpd/iobuf.c
119
io->size += n;
usr.sbin/lpd/iobuf.c
150
iobuf_drop(struct iobuf *io, size_t n)
usr.sbin/lpd/iobuf.c
152
if (n >= iobuf_len(io)) {
usr.sbin/lpd/iobuf.c
157
io->rpos += n;
usr.sbin/lpd/iobuf.c
208
ssize_t n;
usr.sbin/lpd/iobuf.c
210
n = read(fd, io->buf + io->wpos, iobuf_left(io));
usr.sbin/lpd/iobuf.c
211
if (n == -1) {
usr.sbin/lpd/iobuf.c
217
if (n == 0)
usr.sbin/lpd/iobuf.c
220
io->wpos += n;
usr.sbin/lpd/iobuf.c
222
return (n);
usr.sbin/lpd/iobuf.c
354
ssize_t n;
usr.sbin/lpd/iobuf.c
365
n = writev(fd, iov, i);
usr.sbin/lpd/iobuf.c
366
if (n == -1) {
usr.sbin/lpd/iobuf.c
374
iobuf_drain(io, n);
usr.sbin/lpd/iobuf.c
376
return (n);
usr.sbin/lpd/iobuf.c
410
ssize_t n;
usr.sbin/lpd/iobuf.c
413
n = SSL_write(ssl, q->buf + q->rpos, q->wpos - q->rpos);
usr.sbin/lpd/iobuf.c
414
if (n <= 0) {
usr.sbin/lpd/iobuf.c
415
switch ((r = SSL_get_error(ssl, n))) {
usr.sbin/lpd/iobuf.c
432
iobuf_drain(io, n);
usr.sbin/lpd/iobuf.c
434
return (n);
usr.sbin/lpd/iobuf.c
440
ssize_t n;
usr.sbin/lpd/iobuf.c
443
n = SSL_read(ssl, io->buf + io->wpos, iobuf_left(io));
usr.sbin/lpd/iobuf.c
444
if (n < 0) {
usr.sbin/lpd/iobuf.c
445
switch ((r = SSL_get_error(ssl, n))) {
usr.sbin/lpd/iobuf.c
459
} else if (n == 0)
usr.sbin/lpd/iobuf.c
462
io->wpos += n;
usr.sbin/lpd/iobuf.c
464
return (n);
usr.sbin/lpd/iobuf.c
83
iobuf_drain(struct iobuf *io, size_t n)
usr.sbin/lpd/iobuf.c
86
size_t left = n;
usr.sbin/lpd/iobuf.c
99
io->queued -= (n - left);
usr.sbin/lpd/lp.c
282
size_t len, sz, nqi, nqe = 0, nqa = 0, n, i;
usr.sbin/lpd/lp.c
341
n = nqa ? (nqa + 5) : nqi;
usr.sbin/lpd/lp.c
342
tqe = recallocarray(qe, nqa, n, sizeof(*qe));
usr.sbin/lpd/lp.c
348
nqa = n;
usr.sbin/lpd/printer.c
1315
ssize_t n;
usr.sbin/lpd/printer.c
1330
if ((n = write(fd, buf, len)) == -1) {
usr.sbin/lpd/printer.c
1337
len -= n;
usr.sbin/lpd/printer.c
1338
buf += n;
usr.sbin/lpd/printer.c
1385
ssize_t n;
usr.sbin/lpd/printer.c
1388
if ((n = read(prn->pfd, buf, sz)) == 0) {
usr.sbin/lpd/printer.c
1390
n = -1;
usr.sbin/lpd/printer.c
1392
if (n == -1) {
usr.sbin/lpd/printer.c
1399
return n;
usr.sbin/lpd/printer.c
595
size_t n;
usr.sbin/lpd/printer.c
716
while ((n = read(efd, tmp, sizeof(tmp))) > 0)
usr.sbin/lpd/printer.c
717
(void)write(STDERR_FILENO, tmp, n);
usr.sbin/lpd/printer.c
910
ssize_t n;
usr.sbin/lpd/printer.c
912
if ((n = prn_read(line, sizeof(line))) == -1)
usr.sbin/lpd/printer.c
915
if (n == 1) {
usr.sbin/lpd/printer.c
922
if (n > 256)
usr.sbin/lpd/printer.c
923
n = 256;
usr.sbin/lpd/printer.c
924
line[n] = '\0';
usr.sbin/lpd/printer.c
925
if (line[n-1] == '\n')
usr.sbin/lpd/printer.c
926
line[--n] = '\0';
usr.sbin/lpd/printer.c
928
strvisx(visbuf, line, n, VIS_NL | VIS_CSTYLE);
usr.sbin/lpd/proc.c
280
ssize_t n;
usr.sbin/lpd/proc.c
285
n = imsgbuf_read(&p->imsgbuf);
usr.sbin/lpd/proc.c
286
switch (n) {
usr.sbin/lpd/proc.c
310
if ((n = imsg_get(&p->imsgbuf, &imsg)) == -1) {
usr.sbin/lpd/proc.c
315
if (n == 0)
usr.sbin/lpr/common_source/displayq.c
285
int n = 0;
usr.sbin/lpr/common_source/displayq.c
299
n = strvisx(visline, line, i, VIS_SAFE|VIS_NOSLASH);
usr.sbin/lpr/common_source/displayq.c
300
(void)fwrite(visline, 1, n, stdout);
usr.sbin/lpr/common_source/displayq.c
304
if (n > 0 && visline[n-1] != '\n')
usr.sbin/lpr/common_source/displayq.c
409
int *r, n;
usr.sbin/lpr/common_source/displayq.c
423
for (n = 0, cp = file+3; isdigit((unsigned char)*cp); )
usr.sbin/lpr/common_source/displayq.c
424
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/common_source/displayq.c
426
if (*r == n && !strcmp(cp, from))
usr.sbin/lpr/common_source/displayq.c
446
blankfill(int n)
usr.sbin/lpr/common_source/displayq.c
448
while (col++ < n)
usr.sbin/lpr/common_source/displayq.c
458
int n, fill;
usr.sbin/lpr/common_source/displayq.c
466
if (((n = strlen(nfile)) + col + fill) >=
usr.sbin/lpr/common_source/displayq.c
478
col += n+fill;
usr.sbin/lpr/common_source/displayq.c
515
prank(int n)
usr.sbin/lpr/common_source/displayq.c
522
if (n == 0) {
usr.sbin/lpr/common_source/displayq.c
527
if ((n/10)%10 == 1)
usr.sbin/lpr/common_source/displayq.c
528
(void)snprintf(rline, sizeof(rline), "%dth", n);
usr.sbin/lpr/common_source/displayq.c
530
(void)snprintf(rline, sizeof(rline), "%d%s", n, r[n%10]);
usr.sbin/lpr/common_source/rmjob.c
164
int fd, i, n;
usr.sbin/lpr/common_source/rmjob.c
187
for (i = 1; (n = fread(current, sizeof(char), sizeof(current), fp)) <= 0; i++) {
usr.sbin/lpr/common_source/rmjob.c
189
n = 1;
usr.sbin/lpr/common_source/rmjob.c
194
current[n-1] = '\0';
usr.sbin/lpr/common_source/rmjob.c
249
int *r, n, fd;
usr.sbin/lpr/common_source/rmjob.c
286
for (n = 0, cp = file+3; isdigit((unsigned char)*cp); )
usr.sbin/lpr/common_source/rmjob.c
287
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/common_source/rmjob.c
289
if (*r == n && isowner(line+1, file))
usr.sbin/lpr/common_source/rmjob.c
328
size_t n;
usr.sbin/lpr/common_source/rmjob.c
341
n = snprintf(buf, sizeof(buf), "\5%s %s ", RP, all ? "-all" : person);
usr.sbin/lpr/common_source/rmjob.c
342
if (n < 0 || n >= sizeof(buf))
usr.sbin/lpr/common_source/rmjob.c
344
cp = buf + n;
usr.sbin/lpr/common_source/rmjob.c
346
n = strlcpy(cp, user[i], sizeof(buf) - (cp - buf + 1));
usr.sbin/lpr/common_source/rmjob.c
347
if (n >= sizeof(buf) - (cp - buf + 1))
usr.sbin/lpr/common_source/rmjob.c
349
cp += n;
usr.sbin/lpr/common_source/rmjob.c
354
n = snprintf(cp, sizeof(buf) - (cp - buf), "%d ", requ[i]);
usr.sbin/lpr/common_source/rmjob.c
355
if (n < 0 || n >= sizeof(buf) - (cp - buf))
usr.sbin/lpr/common_source/rmjob.c
357
cp += n;
usr.sbin/lpr/common_source/startdaemon.c
104
while ((n = read(s, buf, sizeof(buf))) > 0)
usr.sbin/lpr/common_source/startdaemon.c
105
fwrite(buf, 1, n, stdout);
usr.sbin/lpr/common_source/startdaemon.c
56
size_t n;
usr.sbin/lpr/common_source/startdaemon.c
85
if ((n = snprintf(buf, sizeof(buf), "\1%s\n", printer)) < 0 ||
usr.sbin/lpr/common_source/startdaemon.c
86
n >= sizeof(buf)) {
usr.sbin/lpr/common_source/startdaemon.c
92
if (write(s, buf, n) != n) {
usr.sbin/lpr/lpc/cmds.c
1049
int jobnum, fd, n;
usr.sbin/lpr/lpc/cmds.c
1074
n = 0;
usr.sbin/lpr/lpc/cmds.c
1076
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/lpc/cmds.c
1077
if (jobnum != n)
usr.sbin/lpr/lpc/cmds.c
292
int i, n;
usr.sbin/lpr/lpc/cmds.c
324
n = 0;
usr.sbin/lpr/lpc/cmds.c
330
n++;
usr.sbin/lpr/lpc/cmds.c
332
if (n == 0) {
usr.sbin/lpr/lpd/lpd.c
445
int n;
usr.sbin/lpr/lpd/lpd.c
452
if ((n = read(STDOUT_FILENO, cp, 1)) != 1) {
usr.sbin/lpr/lpd/lpd.c
453
if (n < 0)
usr.sbin/lpr/lpd/printjob.c
1191
delay(int n)
usr.sbin/lpr/lpd/printjob.c
1195
if (n <= 0 || n > 10000)
usr.sbin/lpr/lpd/printjob.c
1196
fatal("unreasonable delay period (%d)", n);
usr.sbin/lpr/lpd/printjob.c
1197
tdelay.tv_sec = n / 1000;
usr.sbin/lpr/lpd/printjob.c
1198
tdelay.tv_nsec = n * 1000000 % 1000000000;
usr.sbin/lpr/lpd/printjob.c
1479
int i, n;
usr.sbin/lpr/lpd/printjob.c
1486
if ((n = snprintf(line, sizeof(line), "\2%s\n", RP)) < 0 ||
usr.sbin/lpr/lpd/printjob.c
1487
n >= sizeof(line))
usr.sbin/lpr/lpd/printjob.c
1488
n = sizeof(line) - 1;
usr.sbin/lpr/lpd/printjob.c
1489
if (write(pfd, line, n) == n &&
usr.sbin/lpr/lpd/printjob.c
540
int n, fi, fo, p[2], stopped = 0, nofile;
usr.sbin/lpr/lpd/printjob.c
572
while ((n = read(fi, buf, BUFSIZ)) > 0)
usr.sbin/lpr/lpd/printjob.c
573
if (write(ofd, buf, n) != n) {
usr.sbin/lpr/lpd/printjob.c
599
for (n = 3; n < nofile; n++)
usr.sbin/lpr/lpd/printjob.c
600
(void)close(n);
usr.sbin/lpr/lpd/printjob.c
619
n = 4;
usr.sbin/lpr/lpd/printjob.c
638
n = 5;
usr.sbin/lpr/lpd/printjob.c
644
n = 3;
usr.sbin/lpr/lpd/printjob.c
654
for (n = 0; n < 4; n++) {
usr.sbin/lpr/lpd/printjob.c
655
if (fonts[n][0] != '/')
usr.sbin/lpr/lpd/printjob.c
658
(void)write(fo, fonts[n], strlen(fonts[n]));
usr.sbin/lpr/lpd/printjob.c
666
n = 3;
usr.sbin/lpr/lpd/printjob.c
672
n = 3;
usr.sbin/lpr/lpd/printjob.c
678
n = 3;
usr.sbin/lpr/lpd/printjob.c
684
n = 3;
usr.sbin/lpr/lpd/printjob.c
703
av[n++] = "-n";
usr.sbin/lpr/lpd/printjob.c
704
av[n++] = logname;
usr.sbin/lpr/lpd/printjob.c
706
av[n++] = "-j";
usr.sbin/lpr/lpd/printjob.c
707
av[n++] = jobname;
usr.sbin/lpr/lpd/printjob.c
709
av[n++] = "-h";
usr.sbin/lpr/lpd/printjob.c
710
av[n++] = fromhost;
usr.sbin/lpr/lpd/printjob.c
711
av[n++] = AF;
usr.sbin/lpr/lpd/printjob.c
712
av[n] = 0;
usr.sbin/lpr/lpd/printjob.c
733
n = open(tempfile, O_WRONLY|O_CREAT|O_EXCL, 0664);
usr.sbin/lpr/lpd/printjob.c
734
if (n >= 0)
usr.sbin/lpr/lpd/printjob.c
735
dup2(n, 2);
usr.sbin/lpr/lpd/printjob.c
738
for (n = 3; n < nofile; n++)
usr.sbin/lpr/lpd/printjob.c
739
(void)close(n);
usr.sbin/lpr/lpr/lpr.c
398
copy(int f, char *n)
usr.sbin/lpr/lpr/lpr.c
404
card('T', title ? title : n);
usr.sbin/lpr/lpr/lpr.c
408
card('N', n);
usr.sbin/lpr/lpr/lpr.c
413
warn("%s", n);
usr.sbin/lpr/lpr/lpr.c
421
warnx("%s: copy file is too large", n);
usr.sbin/lpr/lpr/lpr.c
428
warnx("%s: empty input file", f ? n : "stdin");
usr.sbin/lpr/lpr/lpr.c
501
nfile(char *n)
usr.sbin/lpr/lpr/lpr.c
507
f = open(n, O_WRONLY|O_EXCL|O_CREAT, FILMOD);
usr.sbin/lpr/lpr/lpr.c
510
warn("%s", n);
usr.sbin/lpr/lpr/lpr.c
514
if (++n[inchar] > 'z') {
usr.sbin/lpr/lpr/lpr.c
515
if (++n[inchar-2] == 't') {
usr.sbin/lpr/lpr/lpr.c
519
n[inchar] = 'A';
usr.sbin/lpr/lpr/lpr.c
520
} else if (n[inchar] == '[')
usr.sbin/lpr/lpr/lpr.c
521
n[inchar] = 'a';
usr.sbin/lpr/lpr/lpr.c
661
int len, fd, n;
usr.sbin/lpr/lpr/lpr.c
674
n = 0;
usr.sbin/lpr/lpr/lpr.c
679
n = n * 10 + (*cp++ - '0');
usr.sbin/lpr/lpr/lpr.c
683
tfname = lmktemp("tf", n);
usr.sbin/lpr/lpr/lpr.c
684
cfname = lmktemp("cf", n);
usr.sbin/lpr/lpr/lpr.c
685
dfname = lmktemp("df", n);
usr.sbin/lpr/lpr/lpr.c
686
n = (n + 1) % 1000;
usr.sbin/lpr/lpr/lpr.c
691
snprintf(buf, sizeof(buf), "%03d\n", n);
usr.sbin/makefs/cd9660.c
1387
} *n;
usr.sbin/makefs/cd9660.c
1389
#define PTQUEUE_NEW(n,s,r,t){\
usr.sbin/makefs/cd9660.c
1390
n = emalloc(sizeof(struct s)); \
usr.sbin/makefs/cd9660.c
1391
if (n == NULL) \
usr.sbin/makefs/cd9660.c
1393
n->node = t;\
usr.sbin/makefs/cd9660.c
1415
PTQUEUE_NEW(n, ptq_entry, -1, diskStructure->rootNode);
usr.sbin/makefs/cd9660.c
1418
TAILQ_INSERT_HEAD(&pt_head, n, ptq);
usr.sbin/makefs/cd9660.c
1422
n = pt_head.tqh_first;
usr.sbin/makefs/cd9660.c
1423
dirNode = n->node;
usr.sbin/makefs/cd9660.c
1425
free(n);
usr.sbin/makefs/cd9660.c
1450
PTQUEUE_NEW(n, ptq_entry, -1, cn);
usr.sbin/makefs/cd9660.c
1451
TAILQ_INSERT_TAIL(&pt_head, n, ptq);
usr.sbin/makefs/cd9660/cd9660_debug.c
116
debug_print_path_tree(cd9660node *n)
usr.sbin/makefs/cd9660/cd9660_debug.c
118
cd9660node *iterator = n;
usr.sbin/makefs/cd9660/cd9660_debug.c
121
if (n->parent == NULL)
usr.sbin/makefs/cd9660/cd9660_debug.c
190
int n = 0;
usr.sbin/makefs/cd9660/cd9660_debug.c
202
debug_dump_to_xml_ptentry(&pttemp, n, mode);
usr.sbin/makefs/cd9660/cd9660_debug.c
203
n++;
usr.sbin/makefs/cd9660/cd9660_debug.c
46
print_n_tabs(int n)
usr.sbin/makefs/cd9660/cd9660_debug.c
50
for (i = 1; i <= n; i ++)
usr.sbin/makefs/cd9660/cd9660_debug.c
56
debug_print_rrip_info(n)
usr.sbin/makefs/cd9660/cd9660_debug.c
57
cd9660node *n;
usr.sbin/makefs/cd9660/cd9660_debug.c
67
debug_print_susp_attrs(cd9660node *n, int indent)
usr.sbin/makefs/cd9660/cd9660_debug.c
71
TAILQ_FOREACH(t, &n->head, rr_ll) {
usr.sbin/makefs/ffs.c
308
ssize_t n;
usr.sbin/makefs/ffs.c
327
n = pwrite(fsopts->fd, lp, dl16sz,
usr.sbin/makefs/ffs.c
329
if (n == -1)
usr.sbin/makefs/ffs.c
331
else if (n < dl16sz)
usr.sbin/makefs/ffs/buf.c
163
void *n;
usr.sbin/makefs/ffs/buf.c
186
n = erealloc(bp->b_data, (size_t)size);
usr.sbin/makefs/ffs/buf.c
187
memset(n, 0, (size_t)size);
usr.sbin/makefs/ffs/buf.c
188
bp->b_data = n;
usr.sbin/makefs/ffs/mkfs.c
751
int n;
usr.sbin/makefs/ffs/mkfs.c
758
n = read(fsopts->fd, bf, size);
usr.sbin/makefs/ffs/mkfs.c
759
if (n == -1) {
usr.sbin/makefs/ffs/mkfs.c
763
else if (n != size)
usr.sbin/makefs/ffs/mkfs.c
774
int n;
usr.sbin/makefs/ffs/mkfs.c
781
n = write(fsopts->fd, bf, size);
usr.sbin/makefs/ffs/mkfs.c
782
if (n == -1)
usr.sbin/makefs/ffs/mkfs.c
785
else if (n != size)
usr.sbin/makefs/ffs/mkfs.c
805
u_int n;
usr.sbin/makefs/ffs/mkfs.c
807
for (n = 0; n < sizeof(n) * CHAR_BIT; n++)
usr.sbin/makefs/ffs/mkfs.c
808
if (1 << n == val)
usr.sbin/makefs/ffs/mkfs.c
809
return (n);
usr.sbin/makefs/msdos/mkfs_msdos.c
240
ssize_t n;
usr.sbin/makefs/msdos/mkfs_msdos.c
618
if ((n = read(fd1, img, bpb.bps)) == -1) {
usr.sbin/makefs/msdos/mkfs_msdos.c
622
if ((size_t)n != bpb.bps) {
usr.sbin/makefs/msdos/mkfs_msdos.c
710
if ((n = write(fd, img, bpb.bps)) == -1) {
usr.sbin/makefs/msdos/mkfs_msdos.c
714
if ((size_t)n != bpb.bps) {
usr.sbin/makefs/msdos/msdosfs_fat.c
739
u_long cl, n;
usr.sbin/makefs/msdos/msdosfs_fat.c
741
for (cl = start, n = count; n-- > 0;)
usr.sbin/map-mbone/mapper.c
108
Node *n = *ptr;
usr.sbin/map-mbone/mapper.c
110
if (!n) {
usr.sbin/map-mbone/mapper.c
111
*ptr = n = malloc(sizeof(Node));
usr.sbin/map-mbone/mapper.c
112
n->addr = addr;
usr.sbin/map-mbone/mapper.c
113
n->version = 0;
usr.sbin/map-mbone/mapper.c
114
n->tries = 0;
usr.sbin/map-mbone/mapper.c
115
n->u.interfaces = 0;
usr.sbin/map-mbone/mapper.c
116
n->left = n->right = 0;
usr.sbin/map-mbone/mapper.c
117
return n;
usr.sbin/map-mbone/mapper.c
118
} else if (addr == n->addr)
usr.sbin/map-mbone/mapper.c
119
return n;
usr.sbin/map-mbone/mapper.c
120
else if (addr < n->addr)
usr.sbin/map-mbone/mapper.c
121
return find_node(addr, &(n->left));
usr.sbin/map-mbone/mapper.c
123
return find_node(addr, &(n->right));
usr.sbin/map-mbone/mapper.c
889
Node *n = find_node(target_addr, &routers);
usr.sbin/map-mbone/mapper.c
891
n->tries = 1;
usr.sbin/mrouted/cfparse.y
444
int n;
usr.sbin/mrouted/cfparse.y
488
if (sscanf(q,"%[.0-9]/%d%c",s1,&n,s2) == 2) {
usr.sbin/mrouted/cfparse.y
490
yylval.addrmask.mask = n;
usr.sbin/mrouted/cfparse.y
503
if (sscanf(q,"0x%8x%c",&n,s1) == 1) {
usr.sbin/mrouted/cfparse.y
504
yylval.addr = n;
usr.sbin/mrouted/cfparse.y
507
if (sscanf(q,"%d%c",&n,s1) == 1) {
usr.sbin/mrouted/cfparse.y
508
yylval.num = n;
usr.sbin/mrouted/defs.h
80
#define BIT_SET(X,n) ((X) |= 1 << (n))
usr.sbin/mrouted/defs.h
81
#define BIT_CLR(X,n) ((X) &= ~(1 << (n)))
usr.sbin/mrouted/defs.h
82
#define BIT_TST(X,n) ((X) & 1 << (n))
usr.sbin/mrouted/main.c
253
if ((n = poll(pfd, nhandlers + 1, -1)) == -1) {
usr.sbin/mrouted/main.c
297
int n;
usr.sbin/mrouted/main.c
306
if ((n = report_next_chunk()) <= 0)
usr.sbin/mrouted/main.c
308
nleft -= n;
usr.sbin/mrouted/main.c
315
if ((n = report_next_chunk()) <= 0)
usr.sbin/mrouted/main.c
317
nsent += n;
usr.sbin/mrouted/main.c
83
int vers, n, i, ch;
usr.sbin/mrouted/prune.c
147
struct listaddr *n = neighbor_info(vifi, addr);
usr.sbin/mrouted/prune.c
150
if (n == NULL)
usr.sbin/mrouted/prune.c
153
if (n->al_flags & NF_PRUNE)
usr.sbin/mrouted/prune.c
160
vers = NBR_VERS(n);
usr.sbin/mrouted/prune.c
170
struct listaddr *n = neighbor_info(vifi, addr);
usr.sbin/mrouted/prune.c
173
if (n == NULL)
usr.sbin/mrouted/prune.c
176
if (n->al_flags & NF_MTRACE)
usr.sbin/mrouted/prune.c
183
vers = NBR_VERS(n);
usr.sbin/mrouted/prune.h
142
#define NBR_VERS(n) (((n)->al_pv << 8) + (n)->al_mv)
usr.sbin/mrouted/route.c
1038
int i, n = 0, min = 20000;
usr.sbin/mrouted/route.c
1063
n = report_chunk(sr, vifi,
usr.sbin/mrouted/route.c
1066
if (n < min)
usr.sbin/mrouted/route.c
1067
min = n;
usr.sbin/mrouted/route.c
1073
n = min;
usr.sbin/mrouted/route.c
1075
n, (nroutes - start_rt), nroutes);
usr.sbin/mrouted/route.c
1077
start_rt = (start_rt + n) % nroutes;
usr.sbin/mrouted/route.c
1078
return (n);
usr.sbin/mrouted/vif.c
1014
for (n = v->uv_neighbors; n != NULL; n = n->al_next) {
usr.sbin/mrouted/vif.c
1015
if (addr == n->al_addr) {
usr.sbin/mrouted/vif.c
1023
if (n) {
usr.sbin/mrouted/vif.c
1024
n->al_timer = 0;
usr.sbin/mrouted/vif.c
1031
if ((n->al_pv != (level & 0xff)) ||
usr.sbin/mrouted/vif.c
1032
(n->al_mv != ((level >> 8) & 0xff))) {
usr.sbin/mrouted/vif.c
1038
n->al_pv, n->al_mv, level&0xff, (level >> 8) & 0xff);
usr.sbin/mrouted/vif.c
1040
n->al_pv = level & 0xff;
usr.sbin/mrouted/vif.c
1041
n->al_mv = (level >> 8) & 0xff;
usr.sbin/mrouted/vif.c
1052
n = malloc(sizeof(struct listaddr));
usr.sbin/mrouted/vif.c
1053
if (n == NULL)
usr.sbin/mrouted/vif.c
1056
n->al_addr = addr;
usr.sbin/mrouted/vif.c
1057
n->al_pv = level & 0xff;
usr.sbin/mrouted/vif.c
1058
n->al_mv = (level >> 8) & 0xff;
usr.sbin/mrouted/vif.c
1059
n->al_genid = 0;
usr.sbin/mrouted/vif.c
1061
time(&n->al_ctime);
usr.sbin/mrouted/vif.c
1062
n->al_timer = 0;
usr.sbin/mrouted/vif.c
1063
n->al_next = v->uv_neighbors;
usr.sbin/mrouted/vif.c
1077
v->uv_neighbors = n;
usr.sbin/mrouted/vif.c
1110
if (n->al_genid == 0)
usr.sbin/mrouted/vif.c
1111
n->al_genid = genid;
usr.sbin/mrouted/vif.c
1112
else if (n->al_genid != genid) {
usr.sbin/mrouted/vif.c
1115
inet_fmt(addr, s1), vifi, n->al_genid, genid);
usr.sbin/mrouted/vif.c
1117
n->al_genid = genid;
usr.sbin/mrouted/vif.c
1144
if (n->al_flags != nflags) {
usr.sbin/mrouted/vif.c
1145
n->al_flags = nflags;
usr.sbin/mrouted/vif.c
1147
if (n->al_flags & NF_LEAF) {
usr.sbin/mrouted/vif.c
1183
struct listaddr *a, *prev_a, *n;
usr.sbin/mrouted/vif.c
1219
for (n = v->uv_neighbors; n != NULL; n = n->al_next) {
usr.sbin/mrouted/vif.c
1220
if (ntohl(n->al_addr) < ntohl(v->uv_lcl_addr)) {
usr.sbin/mrouted/vif.c
1223
if (!(n->al_flags & NF_LEAF)) {
usr.sbin/mrouted/vif.c
981
struct listaddr *n;
usr.sbin/mtrace/mtrace.c
1024
struct tr_resp *n = new->resps + rno;
usr.sbin/mtrace/mtrace.c
1027
u_long qarrtime = fixtime(ntohl(n->tr_qarr));
usr.sbin/mtrace/mtrace.c
1028
u_int ttl = n->tr_fttl;
usr.sbin/mtrace/mtrace.c
1048
printf("\t\t\t\tv_in: %u ", ntohl(n->tr_vifin));
usr.sbin/mtrace/mtrace.c
1049
printf("v_out: %u ", ntohl(n->tr_vifout));
usr.sbin/mtrace/mtrace.c
1050
printf("pkts: %u\n", ntohl(n->tr_pktcnt));
usr.sbin/mtrace/mtrace.c
1054
printf("\t\t\t\tv_in: %u ", ntohl(n->tr_vifin) - ntohl(b->tr_vifin));
usr.sbin/mtrace/mtrace.c
1055
printf("v_out: %u ", ntohl(n->tr_vifout) - ntohl(b->tr_vifout));
usr.sbin/mtrace/mtrace.c
1056
printf("pkts: %u\n", ntohl(n->tr_pktcnt) - ntohl(b->tr_pktcnt));
usr.sbin/mtrace/mtrace.c
1061
if ((n->tr_inaddr != b->tr_inaddr) || (p->tr_inaddr != b->tr_inaddr))
usr.sbin/mtrace/mtrace.c
1064
if ((n->tr_inaddr != n->tr_outaddr))
usr.sbin/mtrace/mtrace.c
1065
printf("%-15s\n", inet_fmt(n->tr_inaddr, s1));
usr.sbin/mtrace/mtrace.c
1066
printf("%-15s %-14s %s\n", inet_fmt(n->tr_outaddr, s1), names[rno],
usr.sbin/mtrace/mtrace.c
1067
flag_type(n->tr_rflags));
usr.sbin/mtrace/mtrace.c
1072
stat_line(p, n, TRUE, r);
usr.sbin/mtrace/mtrace.c
1075
qarrtime = fixtime(ntohl((n-1)->tr_qarr));
usr.sbin/mtrace/mtrace.c
1079
stat_line(b, n, TRUE, r);
usr.sbin/mtrace/mtrace.c
1082
--b, --p, --n, --r;
usr.sbin/mtrace/mtrace.c
1083
if (ttl < n->tr_fttl) ttl = n->tr_fttl;
usr.sbin/mtrace/mtrace.c
1088
stat_line(p, n, FALSE, r);
usr.sbin/mtrace/mtrace.c
1093
stat_line(b, n, FALSE, r);
usr.sbin/mtrace/mtrace.c
507
int n = ntohl(*p++) & 0xFF;
usr.sbin/mtrace/mtrace.c
512
p += n;
usr.sbin/mtrace/mtrace.c
807
int n = ntohl(*p++) & 0xFF;
usr.sbin/mtrace/mtrace.c
815
p += n;
usr.sbin/mtrace/mtrace.c
942
struct tr_resp *n = new->resps + rno;
usr.sbin/mtrace/mtrace.c
949
--n; --p; --b; --s;
usr.sbin/mtrace/mtrace.c
950
if (*s || ntohl(n->tr_vifout) - ntohl(p->tr_vifout) > 100000) {
usr.sbin/mtrace/mtrace.c
960
n->tr_qarr = byteswap(n->tr_qarr);
usr.sbin/mtrace/mtrace.c
961
n->tr_vifin = byteswap(n->tr_vifin);
usr.sbin/mtrace/mtrace.c
962
n->tr_vifout = byteswap(n->tr_vifout);
usr.sbin/mtrace/mtrace.c
963
n->tr_pktcnt = byteswap(n->tr_pktcnt);
usr.sbin/mtrace/mtrace.c
970
n = new->resps + rno;
usr.sbin/mtrace/mtrace.c
973
--n; --p; --b; --r;
usr.sbin/mtrace/mtrace.c
974
res = ((ntohl(n->tr_pktcnt) < ntohl(b->tr_pktcnt)) ||
usr.sbin/mtrace/mtrace.c
975
(ntohl(n->tr_pktcnt) < ntohl(p->tr_pktcnt)));
usr.sbin/mtrace/mtrace.c
987
p->tr_pktcnt = b->tr_pktcnt = n->tr_pktcnt;
usr.sbin/ndp/ndp.c
109
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
usr.sbin/ndp/ndp.c
704
ndp_ether_aton(const char *a, u_char *n)
usr.sbin/ndp/ndp.c
715
n[i] = o[i];
usr.sbin/ndp/ndp.c
904
int n;
usr.sbin/ndp/ndp.c
913
n = snprintf(p, ep - p, "%dd", days);
usr.sbin/ndp/ndp.c
914
if (n < 0 || n >= ep - p)
usr.sbin/ndp/ndp.c
916
p += n;
usr.sbin/ndp/ndp.c
920
n = snprintf(p, ep - p, "%dh", hours);
usr.sbin/ndp/ndp.c
921
if (n < 0 || n >= ep - p)
usr.sbin/ndp/ndp.c
923
p += n;
usr.sbin/ndp/ndp.c
927
n = snprintf(p, ep - p, "%dm", mins);
usr.sbin/ndp/ndp.c
928
if (n < 0 || n >= ep - p)
usr.sbin/ndp/ndp.c
930
p += n;
usr.sbin/npppctl/npppctl.c
142
int i, n, ppp_id_idx;
usr.sbin/npppctl/npppctl.c
152
n = ppp_id_idx = 0;
usr.sbin/npppctl/npppctl.c
163
for (i = 0; i < res->entry_count; i++, n++) {
usr.sbin/npppctl/npppctl.c
166
fprint_who_brief(n, &res->entry[i], out);
usr.sbin/npppctl/npppctl.c
169
fprint_who_packets(n, &res->entry[i], out);
usr.sbin/npppctl/npppctl.c
173
fprint_who_all(n, &res->entry[i], out);
usr.sbin/npppctl/npppctl.c
208
int i, n;
usr.sbin/npppctl/npppctl.c
220
n = 0;
usr.sbin/npppctl/npppctl.c
227
if (n == 0)
usr.sbin/npppctl/npppctl.c
233
fprint_who_all(n++, &res->entry[i], out);
usr.sbin/npppctl/npppctl.c
235
if (n > 0)
usr.sbin/npppctl/npppctl.c
335
int succ, fail, i, n, nmax;
usr.sbin/npppctl/npppctl.c
345
for (i = 0; i < ppp_id_count; i += n) {
usr.sbin/npppctl/npppctl.c
346
n = MINIMUM(nmax, ppp_id_count - i);
usr.sbin/npppctl/npppctl.c
347
req.count = n;
usr.sbin/npppctl/npppctl.c
352
iov[1].iov_len = sizeof(u_int) * n;
usr.sbin/npppctl/npppctl.c
511
int n;
usr.sbin/npppctl/npppctl.c
516
if ((n = imsg_get(&ctl_ibuf, &ctl_imsg)) == -1)
usr.sbin/npppctl/npppctl.c
518
if (n != 0)
usr.sbin/npppd/common/hash.c
125
hash_link *n;
usr.sbin/npppd/common/hash.c
130
if ((n = malloc(sizeof(hash_link))) == NULL) {
usr.sbin/npppd/common/hash.c
136
n->item = i;
usr.sbin/npppd/common/hash.c
137
n->key = k;
usr.sbin/npppd/common/hash.c
138
n->next = htbl->bucket[c];
usr.sbin/npppd/common/hash.c
139
htbl->bucket[c] = n;
usr.sbin/npppd/common/radish.c
697
register caddr_t m = m_arg, n = n_arg;
usr.sbin/npppd/common/radish.c
698
register caddr_t lim, lim2 = lim = n + *(u_char *)n;
usr.sbin/npppd/common/radish.c
699
int longer = (*(u_char *)n++) - (int)(*(u_char *)m++);
usr.sbin/npppd/common/radish.c
704
while (n < lim) {
usr.sbin/npppd/common/radish.c
705
if (*n & ~(*m))
usr.sbin/npppd/common/radish.c
707
if (*n++ != *m++)
usr.sbin/npppd/common/radish.c
711
while (n < lim2)
usr.sbin/npppd/common/radish.c
712
if (*n++)
usr.sbin/npppd/common/radish.h
68
#define Bcmp(a, b, n) memcmp(((char *)(a)), ((char *)(b)), (size_t)(n))
usr.sbin/npppd/common/radish.h
71
#define Bzero(p, n) memset((char *)(p), 0, (size_t)(n))
usr.sbin/npppd/common/radish.h
73
#define R_Malloc(p, t, n) (p = (t) malloc((n)))
usr.sbin/npppd/common/slist.c
223
int i, n;
usr.sbin/npppd/common/slist.c
225
n = slist_length(add_items);
usr.sbin/npppd/common/slist.c
226
for (i = 0; i < n; i++) {
usr.sbin/npppd/common/slist.c
311
slist_swap0(slist *list, int m, int n)
usr.sbin/npppd/common/slist.c
318
list->list[REAL_IDX(list, m)] = list->list[REAL_IDX(list, n)];
usr.sbin/npppd/common/slist.c
319
list->list[REAL_IDX(list, n)] = m0;
usr.sbin/npppd/common/slist.c
324
slist_swap(slist *list, int m, int n)
usr.sbin/npppd/common/slist.c
330
SLIST_ASSERT(n >= 0);
usr.sbin/npppd/common/slist.c
332
SLIST_ASSERT(len > n);
usr.sbin/npppd/common/slist.c
334
if (m < 0 || n < 0)
usr.sbin/npppd/common/slist.c
336
if (m >= len || n >= len)
usr.sbin/npppd/common/slist.c
339
slist_swap0(list, m, n);
usr.sbin/npppd/l2tp/l2tp_subr.h
84
short_cmp(const void *m, const void *n)
usr.sbin/npppd/l2tp/l2tp_subr.h
86
return ((intptr_t)m - (intptr_t)n);
usr.sbin/npppd/npppd/control.c
253
int n, retval;
usr.sbin/npppd/npppd/control.c
280
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/npppd/npppd/control.c
285
if (n == 0)
usr.sbin/npppd/npppd/mppe.c
314
int pktloss, encrypt, flushed, m, n;
usr.sbin/npppd/npppd/mppe.c
391
n = coher_cnt / 256;
usr.sbin/npppd/npppd/mppe.c
392
while (m++ < n)
usr.sbin/npppd/npppd/npppd_config.c
148
int n, i, j;
usr.sbin/npppd/npppd/npppd_config.c
156
n = 0;
usr.sbin/npppd/npppd/npppd_config.c
166
if (n >= countof(_this->pool)) {
usr.sbin/npppd/npppd/npppd_config.c
171
if (npppd_pool_init(&pool0[n], _this, ipcp->name) != 0) {
usr.sbin/npppd/npppd/npppd_config.c
176
if (npppd_pool_reload(&pool0[n]) != 0)
usr.sbin/npppd/npppd/npppd_config.c
178
n++;
usr.sbin/npppd/npppd/npppd_config.c
180
for (; n < countof(pool0); n++)
usr.sbin/npppd/npppd/npppd_config.c
181
pool0[n].initialized = 0;
usr.sbin/npppd/npppd/npppd_config.c
205
for (i = 0; i < n; i++) {
usr.sbin/npppd/npppd/npppd_ctl.c
180
int i, n;
usr.sbin/npppd/npppd/npppd_ctl.c
183
for (n = 0, i = 0; i < count; i++) {
usr.sbin/npppd/npppd/npppd_ctl.c
187
n++;
usr.sbin/npppd/npppd/npppd_ctl.c
191
return (n);
usr.sbin/npppd/npppd/npppd_radius.c
704
int code, n = 0;
usr.sbin/npppd/npppd/npppd_radius.c
802
n++;
usr.sbin/npppd/npppd/npppd_radius.c
816
n++;
usr.sbin/npppd/npppd/npppd_radius.c
823
n++;
usr.sbin/npppd/npppd/npppd_radius.c
827
if (n > 0)
usr.sbin/npppd/npppd/parse.y
1015
if ((n = malloc(sizeof(struct confbind))) == NULL) {
usr.sbin/npppd/npppd/parse.y
1022
n->tunnconf = tunn;
usr.sbin/npppd/npppd/parse.y
1023
n->authconf = auth;
usr.sbin/npppd/npppd/parse.y
1024
n->iface = iface;
usr.sbin/npppd/npppd/parse.y
1025
TAILQ_INSERT_TAIL(&conf->confbinds, n, entry);
usr.sbin/npppd/npppd/parse.y
182
struct tunnconf *n;
usr.sbin/npppd/npppd/parse.y
191
if ((n = malloc(sizeof(struct tunnconf))) == NULL) {
usr.sbin/npppd/npppd/parse.y
196
tunnconf_init(n, $4);
usr.sbin/npppd/npppd/parse.y
199
strlcpy(n->proto.l2tp.name, $2,
usr.sbin/npppd/npppd/parse.y
200
sizeof(n->proto.l2tp.name));
usr.sbin/npppd/npppd/parse.y
201
n->name = n->proto.l2tp.name;
usr.sbin/npppd/npppd/parse.y
204
strlcpy(n->proto.pptp.name, $2,
usr.sbin/npppd/npppd/parse.y
205
sizeof(n->proto.pptp.name));
usr.sbin/npppd/npppd/parse.y
206
n->name = n->proto.pptp.name;
usr.sbin/npppd/npppd/parse.y
209
strlcpy(n->proto.pppoe.name, $2,
usr.sbin/npppd/npppd/parse.y
210
sizeof(n->proto.pppoe.name));
usr.sbin/npppd/npppd/parse.y
211
n->name = n->proto.pppoe.name;
usr.sbin/npppd/npppd/parse.y
215
n->protocol = $4;
usr.sbin/npppd/npppd/parse.y
216
curr_tunnconf = n;
usr.sbin/npppd/npppd/parse.y
703
struct authconf *n;
usr.sbin/npppd/npppd/parse.y
711
if ((n = malloc(sizeof(struct authconf))) == NULL) {
usr.sbin/npppd/npppd/parse.y
716
authconf_init(n);
usr.sbin/npppd/npppd/parse.y
717
strlcpy(n->name, $2, sizeof(n->name));
usr.sbin/npppd/npppd/parse.y
719
n->auth_type = $4;
usr.sbin/npppd/npppd/parse.y
721
TAILQ_INIT(&n->data.radius.auth.servers);
usr.sbin/npppd/npppd/parse.y
722
TAILQ_INIT(&n->data.radius.acct.servers);
usr.sbin/npppd/npppd/parse.y
724
curr_authconf = n;
usr.sbin/npppd/npppd/parse.y
790
struct radserver *n;
usr.sbin/npppd/npppd/parse.y
799
TAILQ_FOREACH(n, &curr_radconf->servers, entry) {
usr.sbin/npppd/npppd/parse.y
808
if ((n = malloc(sizeof(struct radserver))) == NULL) {
usr.sbin/npppd/npppd/parse.y
812
n->address = $2;
usr.sbin/npppd/npppd/parse.y
813
((struct sockaddr_in *)&n->address)->sin_port =
usr.sbin/npppd/npppd/parse.y
815
n->secret = $5;
usr.sbin/npppd/npppd/parse.y
816
TAILQ_INSERT_TAIL(&curr_radconf->servers, n, entry);
usr.sbin/npppd/npppd/parse.y
833
struct ipcpconf *n;
usr.sbin/npppd/npppd/parse.y
853
if ((n = malloc(sizeof(struct ipcpconf))) == NULL) {
usr.sbin/npppd/npppd/parse.y
858
ipcpconf_init(n);
usr.sbin/npppd/npppd/parse.y
859
strlcpy(n->name, $2, sizeof(n->name));
usr.sbin/npppd/npppd/parse.y
861
curr_ipcpconf = n;
usr.sbin/npppd/npppd/parse.y
937
struct iface *n;
usr.sbin/npppd/npppd/parse.y
941
TAILQ_FOREACH(n, &conf->ifaces, entry) {
usr.sbin/npppd/npppd/parse.y
961
if ((n = calloc(1, sizeof(struct iface))) == NULL) {
usr.sbin/npppd/npppd/parse.y
966
strlcpy(n->name, $2, sizeof(n->name));
usr.sbin/npppd/npppd/parse.y
968
n->ip4addr = $4;
usr.sbin/npppd/npppd/parse.y
969
if (strncmp(n->name, "pppx", 4) == 0)
usr.sbin/npppd/npppd/parse.y
970
n->is_pppx = true;
usr.sbin/npppd/npppd/parse.y
972
n->ipcpconf = ipcp;
usr.sbin/npppd/npppd/parse.y
973
TAILQ_INSERT_TAIL(&conf->ifaces, n, entry);
usr.sbin/npppd/npppd/parse.y
984
struct confbind *n;
usr.sbin/npppd/npppd/ppp.h
694
#define BZERO(s, n) memset(s, 0, n)
usr.sbin/npppd/npppd/privsep.c
351
ssize_t n;
usr.sbin/npppd/npppd/privsep.c
365
if ((n = imsg_read_and_get(&privsep_ibuf, &imsg)) == -1)
usr.sbin/npppd/npppd/privsep.c
386
n = strlcpy(cp, username, sz);
usr.sbin/npppd/npppd/privsep.c
387
cp += ++n; sz -= n;
usr.sbin/npppd/npppd/privsep.c
390
n = strlcpy(cp, r->password, sz);
usr.sbin/npppd/npppd/privsep.c
391
cp += ++n; sz -= n;
usr.sbin/npppd/npppd/privsep.c
394
n = strlcpy(cp, r->calling_number, sz);
usr.sbin/npppd/npppd/privsep.c
395
cp += ++n; sz -= n;
usr.sbin/npppd/npppd/privsep.c
959
ssize_t n;
usr.sbin/npppd/npppd/privsep.c
964
if ((n = imsg_get(ibuf, imsg)) < 0)
usr.sbin/npppd/npppd/privsep.c
966
if (n == 0)
usr.sbin/npppd/npppd/radius_req.c
479
int i, n;
usr.sbin/npppd/npppd/radius_req.c
491
n = (lap->setting->curr_server + i) %
usr.sbin/npppd/npppd/radius_req.c
493
if (lap->setting->server[n].enabled) {
usr.sbin/npppd/npppd/radius_req.c
494
lap->setting->curr_server = n;
usr.sbin/npppd/pptp/pptp_call.c
99
#define RUPDIV(n,d) (((n) + ((d) - ((n) % (d)))) / (d))
usr.sbin/nsd/bitset.c
101
n += ((srcset2->size % CHAR_BIT) != 0);
usr.sbin/nsd/bitset.c
103
if (n > i) {
usr.sbin/nsd/bitset.c
73
size_t i, n, size, bytes;
usr.sbin/nsd/bitset.c
87
n = (srcset1->size / CHAR_BIT);
usr.sbin/nsd/bitset.c
88
if (n > i) {
usr.sbin/nsd/bitset.c
91
n += ((srcset1->size % CHAR_BIT) != 0);
usr.sbin/nsd/bitset.c
93
if (n > i) {
usr.sbin/nsd/bitset.c
97
n = (srcset2->size / CHAR_BIT);
usr.sbin/nsd/bitset.c
98
if (n > i) {
usr.sbin/nsd/dbaccess.c
45
struct radnode* n;
usr.sbin/nsd/dbaccess.c
46
for(n=radix_first(db->zonetree); n; n=radix_next(n)) {
usr.sbin/nsd/dbaccess.c
47
zone_ixfr_free(((zone_type*)n->elem)->ixfr);
usr.sbin/nsd/difffile.c
1737
udb_ptr t, n;
usr.sbin/nsd/difffile.c
1740
udb_ptr_init(&n, taskudb);
usr.sbin/nsd/difffile.c
1742
udb_ptr_set_rptr(&n, taskudb, &TASKLIST(&t)->next);
usr.sbin/nsd/difffile.c
1745
udb_ptr_set_ptr(&t, taskudb, &n);
usr.sbin/nsd/difffile.c
1748
udb_ptr_unlink(&n, taskudb);
usr.sbin/nsd/dns.c
1167
for (int i=0, n=sizeof(type_descriptors)/sizeof(type_descriptors[0]); i < n; i++) {
usr.sbin/nsd/edns.c
27
int memcmp_fixedtime(const void *s1, const void *s2, size_t n);
usr.sbin/nsd/iterated_hash.c
34
int n;
usr.sbin/nsd/iterated_hash.c
44
for(n=0 ; n <= iterations ; ++n)
usr.sbin/nsd/ixfr.c
2202
struct domain* n;
usr.sbin/nsd/ixfr.c
2211
n = domain_next(domain);
usr.sbin/nsd/ixfr.c
2212
if(n && domain_is_subdomain(n, domain))
usr.sbin/nsd/ixfr.c
517
struct ixfr_data* n;
usr.sbin/nsd/ixfr.c
520
n = (struct ixfr_data*)rbtree_search(ixfr->data, &ixfr->oldest_serial);
usr.sbin/nsd/ixfr.c
521
if(!n || n == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
523
return n;
usr.sbin/nsd/ixfr.c
530
struct ixfr_data* n;
usr.sbin/nsd/ixfr.c
533
n = (struct ixfr_data*)rbtree_search(ixfr->data, &ixfr->newest_serial);
usr.sbin/nsd/ixfr.c
534
if(!n || n == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
536
return n;
usr.sbin/nsd/ixfr.c
543
struct ixfr_data* n;
usr.sbin/nsd/ixfr.c
548
n = (struct ixfr_data*)rbtree_next(&cur->node);
usr.sbin/nsd/ixfr.c
549
if(n && n != (struct ixfr_data*)RBTREE_NULL &&
usr.sbin/nsd/ixfr.c
550
cur->newserial == n->oldserial) {
usr.sbin/nsd/ixfr.c
552
return n;
usr.sbin/nsd/ixfr.c
559
n = (struct ixfr_data*)rbtree_search(ixfr->data, &cur->newserial);
usr.sbin/nsd/ixfr.c
560
if(!n || n == (struct ixfr_data*)RBTREE_NULL)
usr.sbin/nsd/ixfr.c
562
return n;
usr.sbin/nsd/lookup3.c
107
#define hashsize(n) ((uint32_t)1<<(n))
usr.sbin/nsd/lookup3.c
108
#define hashmask(n) (hashsize(n)-1)
usr.sbin/nsd/namedb.c
138
domain_type* n;
usr.sbin/nsd/namedb.c
142
n = domain_next(domain);
usr.sbin/nsd/namedb.c
144
if(n && domain_is_subdomain(n, domain))
usr.sbin/nsd/namedb.c
173
domain_type* d = table->prehash_list, *n;
usr.sbin/nsd/namedb.c
175
n = d->nsec3->prehash_next;
usr.sbin/nsd/namedb.c
178
d = n;
usr.sbin/nsd/namedb.c
678
struct radnode* n = radname_search(db->zonetree, dname_name(dname),
usr.sbin/nsd/namedb.c
680
if(n) return (zone_type*)n->elem;
usr.sbin/nsd/nsd-checkconf.c
644
cpu_option_type *n;
usr.sbin/nsd/nsd-checkconf.c
646
for(n = opt->cpu_affinity; n; n = n->next) {
usr.sbin/nsd/nsd-checkconf.c
647
printf(" %d", n->cpu);
usr.sbin/nsd/nsd-checkconf.c
652
cpu_map_option_type *n;
usr.sbin/nsd/nsd-checkconf.c
653
for(n = opt->service_cpu_affinity; n; n = n->next) {
usr.sbin/nsd/nsd-checkconf.c
654
if(n->service > 0) {
usr.sbin/nsd/nsd-checkconf.c
656
n->service, n->cpu);
usr.sbin/nsd/nsd-checkconf.c
657
} else if(n->service == -1) {
usr.sbin/nsd/nsd-checkconf.c
659
n->cpu);
usr.sbin/nsd/nsd-checkconf.c
695
struct range_option *n;
usr.sbin/nsd/nsd-checkconf.c
697
for(n=ip->servers, sep=""; n; n = n->next, sep=" ") {
usr.sbin/nsd/nsd-checkconf.c
698
if(n->first == n->last) {
usr.sbin/nsd/nsd-checkconf.c
699
printf("%s%d", sep, n->first);
usr.sbin/nsd/nsd-checkconf.c
701
printf("%s%d-%d", sep, n->first, n->last);
usr.sbin/nsd/nsd.c
332
size_t i = 0, n = 1;
usr.sbin/nsd/nsd.c
347
n++;
usr.sbin/nsd/nsd.c
352
*udp = xalloc_zero((n + 1) * sizeof(struct nsd_socket));
usr.sbin/nsd/nsd.c
353
*tcp = xalloc_zero((n + 1) * sizeof(struct nsd_socket));
usr.sbin/nsd/nsd.h
431
void server_close_all_sockets(struct nsd_socket sockets[], size_t n);
usr.sbin/nsd/nsec3.c
520
uint8_t n[48];
usr.sbin/nsd/nsec3.c
523
b32_ntop(hash, hashlen, (char*)(n+5), sizeof(n)-5);
usr.sbin/nsd/nsec3.c
525
d.dname = (dname_type*)n;
usr.sbin/nsd/nsec3.c
527
d.node.key = n;
usr.sbin/nsd/nsec3.c
529
n[0] = 34; /* name_size */
usr.sbin/nsd/nsec3.c
530
n[1] = 2; /* label_count */
usr.sbin/nsd/nsec3.c
531
n[2] = 0; /* label_offset[0] */
usr.sbin/nsd/nsec3.c
532
n[3] = 0; /* label_offset[1] */
usr.sbin/nsd/nsec3.c
533
n[4] = 32; /* label-size[0] */
usr.sbin/nsd/nsec3.c
636
unsigned long n = 0, c = 0;
usr.sbin/nsd/nsec3.c
641
n++;
usr.sbin/nsd/nsec3.c
659
(n==0)?0:(int)(c*((unsigned long)100)/n)));
usr.sbin/nsd/nsec3.c
701
struct nsec3_domain_data n;
usr.sbin/nsd/nsec3.c
711
n.hash_wc = &hash_wc;
usr.sbin/nsd/nsec3.c
713
n.ds_parent_hash = &ds_parent_hash;
usr.sbin/nsd/nsec3.c
714
d.nsec3 = &n;
usr.sbin/nsd/nsec3.c
735
struct nsec3_domain_data n;
usr.sbin/nsd/nsec3.c
745
n.hash_wc = &hash_wc;
usr.sbin/nsd/nsec3.c
747
n.ds_parent_hash = &ds_parent_hash;
usr.sbin/nsd/nsec3.c
748
d.nsec3 = &n;
usr.sbin/nsd/options.c
1170
struct acl_options* n;
usr.sbin/nsd/options.c
1172
n = list->next;
usr.sbin/nsd/options.c
1174
list = n;
usr.sbin/nsd/options.c
1643
uint32_t i, n;
usr.sbin/nsd/options.c
1651
for(n = 0; strv[n]; n++) {
usr.sbin/nsd/options.c
1654
marshal_u32(b, n);
usr.sbin/nsd/options.c
1664
uint32_t i, n;
usr.sbin/nsd/options.c
1670
if ((n = unmarshal_u32(b)) == 0) {
usr.sbin/nsd/options.c
1673
strv = region_alloc_zero(r, (n + 1) * sizeof(char *));
usr.sbin/nsd/options.c
1674
for(i = 0; i <= n; i++) {
usr.sbin/nsd/options.c
1677
assert(i == (n + 1));
usr.sbin/nsd/options.c
2944
struct zonestatname* n;
usr.sbin/nsd/options.c
2954
n = (struct zonestatname*)region_alloc_zero(opt->region, sizeof(*n));
usr.sbin/nsd/options.c
2955
n->node.key = region_strdup(opt->region, statname);
usr.sbin/nsd/options.c
2956
if(!n->node.key) {
usr.sbin/nsd/options.c
2960
n->id = (unsigned)(opt->zonestatnames->count);
usr.sbin/nsd/options.c
2961
rbtree_insert(opt->zonestatnames, (rbnode_type*)n);
usr.sbin/nsd/options.c
2962
return n->id;
usr.sbin/nsd/options.c
415
struct zonestatname* n;
usr.sbin/nsd/options.c
416
n = (struct zonestatname*)region_alloc_zero(opt->region,
usr.sbin/nsd/options.c
417
sizeof(*n));
usr.sbin/nsd/options.c
418
n->node.key = region_strdup(opt->region, "");
usr.sbin/nsd/options.c
419
if(!n->node.key) {
usr.sbin/nsd/options.c
423
n->id = (unsigned)(opt->zonestatnames->count);
usr.sbin/nsd/options.c
424
rbtree_insert(opt->zonestatnames, (rbnode_type*)n);
usr.sbin/nsd/radtree.c
100
for(idx=0; idx<n->len; idx++) {
usr.sbin/nsd/radtree.c
1000
uint8_t idx = n->pidx;
usr.sbin/nsd/radtree.c
1002
n = n->parent;
usr.sbin/nsd/radtree.c
1003
assert(n->len > 0); /* since we are a child */
usr.sbin/nsd/radtree.c
1005
s = radnode_find_prev_from_idx(n, idx);
usr.sbin/nsd/radtree.c
1008
if(n->elem)
usr.sbin/nsd/radtree.c
1009
return n;
usr.sbin/nsd/radtree.c
101
if(n->array[idx].node) {
usr.sbin/nsd/radtree.c
103
if(n->array[idx].node->elem)
usr.sbin/nsd/radtree.c
104
return n->array[idx].node;
usr.sbin/nsd/radtree.c
106
if((s=radnode_first_in_subtree(n->array[idx].node))!=0)
usr.sbin/nsd/radtree.c
115
radnode_find_prev_from_idx(struct radnode* n, unsigned from)
usr.sbin/nsd/radtree.c
1188
struct radnode* n = radname_search(rt, d, max);
usr.sbin/nsd/radtree.c
1189
if(n) radix_delete(rt, n);
usr.sbin/nsd/radtree.c
1199
struct radnode* n = rt->root;
usr.sbin/nsd/radtree.c
120
if(n->array[idx].node) {
usr.sbin/nsd/radtree.c
1208
if(!n) return NULL;
usr.sbin/nsd/radtree.c
1209
return n->elem?n:NULL;
usr.sbin/nsd/radtree.c
122
n->array[idx].node);
usr.sbin/nsd/radtree.c
1232
while(n) {
usr.sbin/nsd/radtree.c
1239
return n->elem?n:NULL;
usr.sbin/nsd/radtree.c
1246
if(byte < n->offset)
usr.sbin/nsd/radtree.c
1248
byte -= n->offset;
usr.sbin/nsd/radtree.c
1249
if(byte >= n->len)
usr.sbin/nsd/radtree.c
1251
if(n->array[byte].len != 0) {
usr.sbin/nsd/radtree.c
1254
for(i=0; i<n->array[byte].len; i++) {
usr.sbin/nsd/radtree.c
1268
if(n->array[byte].str[i] != b)
usr.sbin/nsd/radtree.c
1272
n = n->array[byte].node;
usr.sbin/nsd/radtree.c
1284
struct radnode* n = rt->root;
usr.sbin/nsd/radtree.c
1290
if(!n) {
usr.sbin/nsd/radtree.c
1301
if(n->elem) {
usr.sbin/nsd/radtree.c
1302
*result = n;
usr.sbin/nsd/radtree.c
1343
if(n->elem) {
usr.sbin/nsd/radtree.c
1344
*result = n;
usr.sbin/nsd/radtree.c
1349
*result = radix_prev(n);
usr.sbin/nsd/radtree.c
1358
if(byte < n->offset)
usr.sbin/nsd/radtree.c
1361
return ret_self_or_prev(n, result);
usr.sbin/nsd/radtree.c
1362
byte -= n->offset;
usr.sbin/nsd/radtree.c
1363
if(byte >= n->len) {
usr.sbin/nsd/radtree.c
1366
*result = radnode_last_in_subtree_incl_self(n);
usr.sbin/nsd/radtree.c
1368
*result = radix_prev(n);
usr.sbin/nsd/radtree.c
1371
if(!n->array[byte].node) {
usr.sbin/nsd/radtree.c
1374
*result = radnode_find_prev_from_idx(n, byte);
usr.sbin/nsd/radtree.c
1378
return ret_self_or_prev(n, result);
usr.sbin/nsd/radtree.c
1380
if(n->array[byte].len != 0) {
usr.sbin/nsd/radtree.c
1383
for(i=0; i<n->array[byte].len; i++) {
usr.sbin/nsd/radtree.c
1394
n->array[byte].node);
usr.sbin/nsd/radtree.c
1402
if(b < n->array[byte].str[i]) {
usr.sbin/nsd/radtree.c
1404
n->array[byte].node);
usr.sbin/nsd/radtree.c
1406
} else if(b > n->array[byte].str[i]) {
usr.sbin/nsd/radtree.c
1410
*result = radnode_last_in_subtree_incl_self(n->array[byte].node);
usr.sbin/nsd/radtree.c
1414
*result = radix_prev(n->array[byte].node);
usr.sbin/nsd/radtree.c
1419
n = n->array[byte].node;
usr.sbin/nsd/radtree.c
142
struct radnode* n = rt->root;
usr.sbin/nsd/radtree.c
146
*result = n;
usr.sbin/nsd/radtree.c
147
if(!n) return 0;
usr.sbin/nsd/radtree.c
148
while(n) {
usr.sbin/nsd/radtree.c
153
if(byte < n->offset) {
usr.sbin/nsd/radtree.c
156
byte -= n->offset;
usr.sbin/nsd/radtree.c
157
if(byte >= n->len) {
usr.sbin/nsd/radtree.c
161
if(n->array[byte].len != 0) {
usr.sbin/nsd/radtree.c
163
if(pos+n->array[byte].len > len) {
usr.sbin/nsd/radtree.c
166
if(memcmp(&k[pos], n->array[byte].str,
usr.sbin/nsd/radtree.c
167
n->array[byte].len) != 0) {
usr.sbin/nsd/radtree.c
170
pos += n->array[byte].len;
usr.sbin/nsd/radtree.c
172
n = n->array[byte].node;
usr.sbin/nsd/radtree.c
173
if(!n) return 1;
usr.sbin/nsd/radtree.c
175
*result = n;
usr.sbin/nsd/radtree.c
184
radnode_array_grow(struct region* region, struct radnode* n, unsigned want)
usr.sbin/nsd/radtree.c
186
unsigned ns = ((unsigned)n->capacity)*2;
usr.sbin/nsd/radtree.c
196
assert(n->len <= n->capacity);
usr.sbin/nsd/radtree.c
197
assert(n->capacity < ns);
usr.sbin/nsd/radtree.c
198
memcpy(&a[0], &n->array[0], n->len*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
199
region_recycle(region, n->array, n->capacity*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
200
n->array = a;
usr.sbin/nsd/radtree.c
201
n->capacity = ns;
usr.sbin/nsd/radtree.c
207
radnode_array_space(struct region* region, struct radnode* n, uint8_t byte)
usr.sbin/nsd/radtree.c
210
if(!n->array || n->capacity == 0) {
usr.sbin/nsd/radtree.c
211
n->array = (struct radsel*)region_alloc(region,
usr.sbin/nsd/radtree.c
213
if(!n->array) return 0;
usr.sbin/nsd/radtree.c
214
memset(&n->array[0], 0, sizeof(struct radsel));
usr.sbin/nsd/radtree.c
215
n->len = 1;
usr.sbin/nsd/radtree.c
216
n->capacity = 1;
usr.sbin/nsd/radtree.c
217
n->offset = byte;
usr.sbin/nsd/radtree.c
219
} else if(n->len == 0 && n->capacity != 0) {
usr.sbin/nsd/radtree.c
220
n->len = 1;
usr.sbin/nsd/radtree.c
221
n->offset = byte;
usr.sbin/nsd/radtree.c
222
memset(&n->array[0], 0, sizeof(struct radsel));
usr.sbin/nsd/radtree.c
224
} else if(byte < n->offset) {
usr.sbin/nsd/radtree.c
227
unsigned need = n->offset-byte;
usr.sbin/nsd/radtree.c
228
if(n->len+need > n->capacity) {
usr.sbin/nsd/radtree.c
230
if(!radnode_array_grow(region, n, n->len+need))
usr.sbin/nsd/radtree.c
234
memmove(&n->array[need], &n->array[0],
usr.sbin/nsd/radtree.c
235
n->len*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
237
for(idx = 0; idx < n->len; idx++) {
usr.sbin/nsd/radtree.c
238
if(n->array[idx+need].node)
usr.sbin/nsd/radtree.c
239
n->array[idx+need].node->pidx = idx+need;
usr.sbin/nsd/radtree.c
242
memset(&n->array[0], 0, need*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
243
n->len += need;
usr.sbin/nsd/radtree.c
244
n->offset = byte;
usr.sbin/nsd/radtree.c
246
} else if(byte-n->offset >= n->len) {
usr.sbin/nsd/radtree.c
248
unsigned need = (byte-n->offset) - n->len + 1;
usr.sbin/nsd/radtree.c
250
if(n->len + need > n->capacity) {
usr.sbin/nsd/radtree.c
251
if(!radnode_array_grow(region, n, n->len+need))
usr.sbin/nsd/radtree.c
255
memset(&n->array[n->len], 0, need*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
257
n->len += need;
usr.sbin/nsd/radtree.c
35
static void radnode_del_postorder(struct region* region, struct radnode* n)
usr.sbin/nsd/radtree.c
38
if(!n) return;
usr.sbin/nsd/radtree.c
39
for(i=0; i<n->len; i++) {
usr.sbin/nsd/radtree.c
40
radnode_del_postorder(region, n->array[i].node);
usr.sbin/nsd/radtree.c
41
region_recycle(region, n->array[i].str, n->array[i].len);
usr.sbin/nsd/radtree.c
43
region_recycle(region, n->array, n->capacity*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
44
region_recycle(region, n, sizeof(*n));
usr.sbin/nsd/radtree.c
497
struct radnode* n;
usr.sbin/nsd/radtree.c
506
if(!radix_find_prefix_node(rt, k, len, &n, &pos)) {
usr.sbin/nsd/radtree.c
513
n = (struct radnode*)region_alloc_zero(rt->region,
usr.sbin/nsd/radtree.c
514
sizeof(*n));
usr.sbin/nsd/radtree.c
515
if(!n) {
usr.sbin/nsd/radtree.c
519
if(!radnode_array_space(rt->region, n, k[0])) {
usr.sbin/nsd/radtree.c
520
region_recycle(rt->region, n->array,
usr.sbin/nsd/radtree.c
521
n->capacity*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
522
region_recycle(rt->region, n, sizeof(*n));
usr.sbin/nsd/radtree.c
526
add->parent = n;
usr.sbin/nsd/radtree.c
528
n->array[0].node = add;
usr.sbin/nsd/radtree.c
531
&n->array[0].str, &n->array[0].len)) {
usr.sbin/nsd/radtree.c
532
region_recycle(rt->region, n->array,
usr.sbin/nsd/radtree.c
533
n->capacity*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
534
region_recycle(rt->region, n, sizeof(*n));
usr.sbin/nsd/radtree.c
539
rt->root = n;
usr.sbin/nsd/radtree.c
543
if(n->elem) {
usr.sbin/nsd/radtree.c
548
n->elem = elem;
usr.sbin/nsd/radtree.c
550
add = n;
usr.sbin/nsd/radtree.c
558
if(byte < n->offset || byte-n->offset >= n->len) {
usr.sbin/nsd/radtree.c
560
if(!radnode_array_space(rt->region, n, byte)) {
usr.sbin/nsd/radtree.c
564
assert(byte>=n->offset && byte-n->offset<n->len);
usr.sbin/nsd/radtree.c
565
byte -= n->offset;
usr.sbin/nsd/radtree.c
568
if(!radsel_str_create(rt->region, &n->array[byte],
usr.sbin/nsd/radtree.c
575
add->parent = n;
usr.sbin/nsd/radtree.c
577
n->array[byte].node = add;
usr.sbin/nsd/radtree.c
579
} else if(n->array[byte-n->offset].node == NULL) {
usr.sbin/nsd/radtree.c
581
byte -= n->offset;
usr.sbin/nsd/radtree.c
584
if(!radsel_str_create(rt->region, &n->array[byte],
usr.sbin/nsd/radtree.c
591
add->parent = n;
usr.sbin/nsd/radtree.c
593
n->array[byte].node = add;
usr.sbin/nsd/radtree.c
600
if(!radsel_split(rt->region, &n->array[byte-n->offset],
usr.sbin/nsd/radtree.c
613
static void radnode_delete(struct region* region, struct radnode* n)
usr.sbin/nsd/radtree.c
616
if(!n) return;
usr.sbin/nsd/radtree.c
617
for(i=0; i<n->len; i++) {
usr.sbin/nsd/radtree.c
619
region_recycle(region, n->array[i].str, n->array[i].len);
usr.sbin/nsd/radtree.c
621
region_recycle(region, n->array, n->capacity*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
622
region_recycle(region, n, sizeof(*n));
usr.sbin/nsd/radtree.c
627
radnode_cleanup_onechild(struct region* region, struct radnode* n,
usr.sbin/nsd/radtree.c
63
radnode_last_in_subtree(struct radnode* n)
usr.sbin/nsd/radtree.c
632
uint8_t pidx = n->pidx;
usr.sbin/nsd/radtree.c
633
struct radnode* child = n->array[0].node;
usr.sbin/nsd/radtree.c
639
joinlen = par->array[pidx].len + n->array[0].len + 1;
usr.sbin/nsd/radtree.c
650
join[par->array[pidx].len] = child->pidx + n->offset;
usr.sbin/nsd/radtree.c
652
if(n->array[0].str)
usr.sbin/nsd/radtree.c
653
memmove(join+par->array[pidx].len+1, n->array[0].str, n->array[0].len);
usr.sbin/nsd/radtree.c
662
radnode_delete(region, n);
usr.sbin/nsd/radtree.c
668
radnode_array_clean_all(struct region* region, struct radnode* n)
usr.sbin/nsd/radtree.c
67
for(idx=((int)n->len)-1; idx >= 0; idx--) {
usr.sbin/nsd/radtree.c
670
n->offset = 0;
usr.sbin/nsd/radtree.c
671
n->len = 0;
usr.sbin/nsd/radtree.c
673
region_recycle(region, n->array, n->capacity*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
674
n->array = NULL;
usr.sbin/nsd/radtree.c
675
n->capacity = 0;
usr.sbin/nsd/radtree.c
68
if(n->array[idx].node) {
usr.sbin/nsd/radtree.c
680
radnode_array_reduce_if_needed(struct region* region, struct radnode* n)
usr.sbin/nsd/radtree.c
682
if(n->len <= n->capacity/2 && n->len != n->capacity) {
usr.sbin/nsd/radtree.c
684
sizeof(*a), n->len);
usr.sbin/nsd/radtree.c
686
memcpy(a, n->array, sizeof(*a)*n->len);
usr.sbin/nsd/radtree.c
687
region_recycle(region, n->array, n->capacity*sizeof(*a));
usr.sbin/nsd/radtree.c
688
n->array = a;
usr.sbin/nsd/radtree.c
689
n->capacity = n->len;
usr.sbin/nsd/radtree.c
695
radnode_array_clean_front(struct region* region, struct radnode* n)
usr.sbin/nsd/radtree.c
70
if(n->array[idx].node->len > 0) {
usr.sbin/nsd/radtree.c
700
while(shuf < n->len && n->array[shuf].node == NULL)
usr.sbin/nsd/radtree.c
704
if(shuf == n->len) {
usr.sbin/nsd/radtree.c
706
radnode_array_clean_all(region, n);
usr.sbin/nsd/radtree.c
709
assert(shuf < n->len);
usr.sbin/nsd/radtree.c
710
assert((int)shuf <= 255-(int)n->offset);
usr.sbin/nsd/radtree.c
711
memmove(&n->array[0], &n->array[shuf],
usr.sbin/nsd/radtree.c
712
(n->len - shuf)*sizeof(struct radsel));
usr.sbin/nsd/radtree.c
713
n->offset += shuf;
usr.sbin/nsd/radtree.c
714
n->len -= shuf;
usr.sbin/nsd/radtree.c
715
for(idx=0; idx<n->len; idx++)
usr.sbin/nsd/radtree.c
716
if(n->array[idx].node)
usr.sbin/nsd/radtree.c
717
n->array[idx].node->pidx = idx;
usr.sbin/nsd/radtree.c
719
radnode_array_reduce_if_needed(region, n);
usr.sbin/nsd/radtree.c
72
n->array[idx].node);
usr.sbin/nsd/radtree.c
724
radnode_array_clean_end(struct region* region, struct radnode* n)
usr.sbin/nsd/radtree.c
729
while(shuf < n->len && n->array[n->len-1-shuf].node == NULL)
usr.sbin/nsd/radtree.c
733
if(shuf == n->len) {
usr.sbin/nsd/radtree.c
735
radnode_array_clean_all(region, n);
usr.sbin/nsd/radtree.c
738
assert(shuf < n->len);
usr.sbin/nsd/radtree.c
739
n->len -= shuf;
usr.sbin/nsd/radtree.c
742
radnode_array_reduce_if_needed(region, n);
usr.sbin/nsd/radtree.c
747
radnode_cleanup_leaf(struct region* region, struct radnode* n,
usr.sbin/nsd/radtree.c
753
pidx = n->pidx;
usr.sbin/nsd/radtree.c
754
radnode_delete(region, n);
usr.sbin/nsd/radtree.c
76
if(n->array[idx].node->elem)
usr.sbin/nsd/radtree.c
77
return n->array[idx].node;
usr.sbin/nsd/radtree.c
784
radnode_cleanup(struct radtree* rt, struct radnode* n)
usr.sbin/nsd/radtree.c
786
while(n) {
usr.sbin/nsd/radtree.c
787
if(n->elem) {
usr.sbin/nsd/radtree.c
790
} else if(n->len == 1 && n->parent) {
usr.sbin/nsd/radtree.c
791
return radnode_cleanup_onechild(rt->region, n, n->parent);
usr.sbin/nsd/radtree.c
792
} else if(n->len == 0) {
usr.sbin/nsd/radtree.c
793
struct radnode* par = n->parent;
usr.sbin/nsd/radtree.c
796
radnode_delete(rt->region, n);
usr.sbin/nsd/radtree.c
801
radnode_cleanup_leaf(rt->region, n, par);
usr.sbin/nsd/radtree.c
803
n = par;
usr.sbin/nsd/radtree.c
813
void radix_delete(struct radtree* rt, struct radnode* n)
usr.sbin/nsd/radtree.c
815
if(!n) return;
usr.sbin/nsd/radtree.c
816
n->elem = NULL;
usr.sbin/nsd/radtree.c
818
if(!radnode_cleanup(rt, n)) {
usr.sbin/nsd/radtree.c
827
struct radnode* n = rt->root;
usr.sbin/nsd/radtree.c
830
while(n) {
usr.sbin/nsd/radtree.c
832
return n->elem?n:NULL;
usr.sbin/nsd/radtree.c
834
if(byte < n->offset)
usr.sbin/nsd/radtree.c
836
byte -= n->offset;
usr.sbin/nsd/radtree.c
837
if(byte >= n->len)
usr.sbin/nsd/radtree.c
840
if(n->array[byte].len != 0) {
usr.sbin/nsd/radtree.c
842
if(pos+n->array[byte].len > len)
usr.sbin/nsd/radtree.c
844
if(memcmp(&k[pos], n->array[byte].str,
usr.sbin/nsd/radtree.c
845
n->array[byte].len) != 0)
usr.sbin/nsd/radtree.c
847
pos += n->array[byte].len;
usr.sbin/nsd/radtree.c
849
n = n->array[byte].node;
usr.sbin/nsd/radtree.c
85
radnode_last_in_subtree_incl_self(struct radnode* n)
usr.sbin/nsd/radtree.c
855
static int ret_self_or_prev(struct radnode* n, struct radnode** result)
usr.sbin/nsd/radtree.c
857
if(n->elem)
usr.sbin/nsd/radtree.c
858
*result = n;
usr.sbin/nsd/radtree.c
859
else *result = radix_prev(n);
usr.sbin/nsd/radtree.c
866
struct radnode* n = rt->root;
usr.sbin/nsd/radtree.c
87
struct radnode* s = radnode_last_in_subtree(n);
usr.sbin/nsd/radtree.c
870
if(!n) {
usr.sbin/nsd/radtree.c
877
if(byte < n->offset) {
usr.sbin/nsd/radtree.c
880
return ret_self_or_prev(n, result);
usr.sbin/nsd/radtree.c
882
byte -= n->offset;
usr.sbin/nsd/radtree.c
883
if(byte >= n->len) {
usr.sbin/nsd/radtree.c
886
if((*result=radnode_last_in_subtree_incl_self(n))==0)
usr.sbin/nsd/radtree.c
887
*result = radix_prev(n);
usr.sbin/nsd/radtree.c
89
if(n->elem) return n;
usr.sbin/nsd/radtree.c
891
if(!n->array[byte].node) {
usr.sbin/nsd/radtree.c
894
*result = radnode_find_prev_from_idx(n, byte);
usr.sbin/nsd/radtree.c
898
return ret_self_or_prev(n, result);
usr.sbin/nsd/radtree.c
900
if(n->array[byte].len != 0) {
usr.sbin/nsd/radtree.c
902
if(pos+n->array[byte].len > len) {
usr.sbin/nsd/radtree.c
904
if( (memcmp(&k[pos], n->array[byte].str,
usr.sbin/nsd/radtree.c
907
*result = radix_prev(n->array[byte].node);
usr.sbin/nsd/radtree.c
912
*result=radnode_last_in_subtree_incl_self(n->array[byte].node);
usr.sbin/nsd/radtree.c
918
*result = radix_prev(n->array[byte].node);
usr.sbin/nsd/radtree.c
922
if( (r=memcmp(&k[pos], n->array[byte].str,
usr.sbin/nsd/radtree.c
923
n->array[byte].len)) < 0) {
usr.sbin/nsd/radtree.c
924
*result = radix_prev(n->array[byte].node);
usr.sbin/nsd/radtree.c
930
*result=radnode_last_in_subtree_incl_self(n->array[byte].node);
usr.sbin/nsd/radtree.c
932
if(!*result) *result = radix_prev(n->array[byte].node);
usr.sbin/nsd/radtree.c
935
pos += n->array[byte].len;
usr.sbin/nsd/radtree.c
937
n = n->array[byte].node;
usr.sbin/nsd/radtree.c
939
if(n->elem) {
usr.sbin/nsd/radtree.c
941
*result = n;
usr.sbin/nsd/radtree.c
945
*result = radix_prev(n);
usr.sbin/nsd/radtree.c
95
radnode_first_in_subtree(struct radnode* n)
usr.sbin/nsd/radtree.c
952
struct radnode* n;
usr.sbin/nsd/radtree.c
954
n = rt->root;
usr.sbin/nsd/radtree.c
955
if(n->elem) return n;
usr.sbin/nsd/radtree.c
956
return radix_next(n);
usr.sbin/nsd/radtree.c
965
struct radnode* radix_next(struct radnode* n)
usr.sbin/nsd/radtree.c
967
if(!n) return NULL;
usr.sbin/nsd/radtree.c
968
if(n->len) {
usr.sbin/nsd/radtree.c
970
struct radnode* s = radnode_first_in_subtree(n);
usr.sbin/nsd/radtree.c
974
while(n->parent) {
usr.sbin/nsd/radtree.c
975
unsigned idx = n->pidx;
usr.sbin/nsd/radtree.c
976
n = n->parent;
usr.sbin/nsd/radtree.c
978
for(; idx < n->len; idx++) {
usr.sbin/nsd/radtree.c
980
if(n->array[idx].node) {
usr.sbin/nsd/radtree.c
983
if(n->array[idx].node->elem)
usr.sbin/nsd/radtree.c
984
return n->array[idx].node;
usr.sbin/nsd/radtree.c
987
n->array[idx].node);
usr.sbin/nsd/radtree.c
995
struct radnode* radix_prev(struct radnode* n)
usr.sbin/nsd/radtree.c
997
if(!n) return NULL;
usr.sbin/nsd/radtree.c
999
while(n->parent) {
usr.sbin/nsd/radtree.h
111
void radix_delete(struct radtree* rt, struct radnode* n);
usr.sbin/nsd/radtree.h
155
struct radnode* radix_next(struct radnode* n);
usr.sbin/nsd/radtree.h
162
struct radnode* radix_prev(struct radnode* n);
usr.sbin/nsd/rdata.c
235
size_t n;
usr.sbin/nsd/rdata.c
238
n = rdata[*offset];
usr.sbin/nsd/rdata.c
239
if((size_t)rdlength - *offset < 1 + n)
usr.sbin/nsd/rdata.c
242
for (size_t i = 1; i <= n; i++) {
usr.sbin/nsd/rdata.c
256
*offset += n;
usr.sbin/nsd/remote.c
2991
print_stat_block(RES* ssl, char* n, char* d, struct nsdst* st)
usr.sbin/nsd/remote.c
3003
if(!ssl_printf(ssl, "%s%snum.type.%s=%lu\n", n, d,
usr.sbin/nsd/remote.c
3012
if(!ssl_printf(ssl, "%s%snum.opcode.%s=%lu\n", n, d,
usr.sbin/nsd/remote.c
3021
if(!ssl_printf(ssl, "%s%snum.class.%s=%lu\n", n, d,
usr.sbin/nsd/remote.c
3031
if(!ssl_printf(ssl, "%s%snum.rcode.%s=%lu\n", n, d, rcstr[i],
usr.sbin/nsd/remote.c
3037
if(!ssl_printf(ssl, "%s%snum.edns=%lu\n", n, d, (unsigned long)st->edns))
usr.sbin/nsd/remote.c
3041
if(!ssl_printf(ssl, "%s%snum.ednserr=%lu\n", n, d,
usr.sbin/nsd/remote.c
3046
if(!ssl_printf(ssl, "%s%snum.udp=%lu\n", n, d, (unsigned long)st->qudp))
usr.sbin/nsd/remote.c
3049
if(!ssl_printf(ssl, "%s%snum.udp6=%lu\n", n, d, (unsigned long)st->qudp6))
usr.sbin/nsd/remote.c
3052
if(!ssl_printf(ssl, "%s%snum.tcp=%lu\n", n, d, (unsigned long)st->ctcp))
usr.sbin/nsd/remote.c
3055
if(!ssl_printf(ssl, "%s%snum.tcp6=%lu\n", n, d, (unsigned long)st->ctcp6))
usr.sbin/nsd/remote.c
3058
if(!ssl_printf(ssl, "%s%snum.tls=%lu\n", n, d, (unsigned long)st->ctls))
usr.sbin/nsd/remote.c
3061
if(!ssl_printf(ssl, "%s%snum.tls6=%lu\n", n, d, (unsigned long)st->ctls6))
usr.sbin/nsd/remote.c
3065
if(!ssl_printf(ssl, "%s%snum.answer_wo_aa=%lu\n", n, d,
usr.sbin/nsd/remote.c
3070
if(!ssl_printf(ssl, "%s%snum.rxerr=%lu\n", n, d, (unsigned long)st->rxerr))
usr.sbin/nsd/remote.c
3074
if(!ssl_printf(ssl, "%s%snum.txerr=%lu\n", n, d, (unsigned long)st->txerr))
usr.sbin/nsd/remote.c
3078
if(!ssl_printf(ssl, "%s%snum.raxfr=%lu\n", n, d, (unsigned long)st->raxfr))
usr.sbin/nsd/remote.c
3082
if(!ssl_printf(ssl, "%s%snum.rixfr=%lu\n", n, d, (unsigned long)st->rixfr))
usr.sbin/nsd/remote.c
3086
if(!ssl_printf(ssl, "%s%snum.truncated=%lu\n", n, d,
usr.sbin/nsd/remote.c
3091
if(!ssl_printf(ssl, "%s%snum.dropped=%lu\n", n, d,
usr.sbin/nsd/remote.c
3113
struct zonestatname* n;
usr.sbin/nsd/remote.c
3115
RBTREE_FOR(n, struct zonestatname*, xfrd->nsd->options->zonestatnames){
usr.sbin/nsd/remote.c
3116
char* name = (char*)n->node.key;
usr.sbin/nsd/remote.c
3117
if(n->id >= xfrd->zonestat_safe)
usr.sbin/nsd/remote.c
3126
memcpy(&stat0, &zonestats[0][n->id], sizeof(stat0));
usr.sbin/nsd/remote.c
3127
memcpy(&stat1, &zonestats[1][n->id], sizeof(stat1));
usr.sbin/nsd/remote.c
3133
if(n->id < xfrd->zonestat_clear_num &&
usr.sbin/nsd/remote.c
3134
xfrd->zonestat_clear[n->id])
usr.sbin/nsd/remote.c
3135
stats_subtract(&stat0, xfrd->zonestat_clear[n->id]);
usr.sbin/nsd/remote.c
3138
if(n->id >= xfrd->zonestat_clear_num) {
usr.sbin/nsd/remote.c
3139
if(n->id+1 < xfrd->nsd->options->zonestatnames->count)
usr.sbin/nsd/remote.c
3142
resize_zonestat(xfrd, n->id+1);
usr.sbin/nsd/remote.c
3144
if(!xfrd->zonestat_clear[n->id])
usr.sbin/nsd/remote.c
3145
xfrd->zonestat_clear[n->id] = xalloc(
usr.sbin/nsd/remote.c
3148
memcpy(xfrd->zonestat_clear[n->id], &stat1,
usr.sbin/nsd/remote.c
585
struct rc_state* n;
usr.sbin/nsd/remote.c
630
n = (struct rc_state*)calloc(1, sizeof(*n));
usr.sbin/nsd/remote.c
631
if(!n) {
usr.sbin/nsd/remote.c
636
n->tval.tv_sec = REMOTE_CONTROL_TCP_TIMEOUT;
usr.sbin/nsd/remote.c
637
n->tval.tv_usec = 0L;
usr.sbin/nsd/remote.c
638
n->fd = newfd;
usr.sbin/nsd/remote.c
640
memset(&n->c, 0, sizeof(n->c));
usr.sbin/nsd/remote.c
641
event_set(&n->c, newfd, EV_PERSIST|EV_TIMEOUT|EV_READ,
usr.sbin/nsd/remote.c
642
remote_control_callback, n);
usr.sbin/nsd/remote.c
643
if(event_base_set(xfrd->event_base, &n->c) != 0) {
usr.sbin/nsd/remote.c
645
free(n);
usr.sbin/nsd/remote.c
648
if(event_add(&n->c, &n->tval) != 0) {
usr.sbin/nsd/remote.c
650
free(n);
usr.sbin/nsd/remote.c
653
n->event_added = 1;
usr.sbin/nsd/remote.c
667
n->shake_state = rc_hs_read;
usr.sbin/nsd/remote.c
668
n->ssl = SSL_new(rc->ctx);
usr.sbin/nsd/remote.c
669
if(!n->ssl) {
usr.sbin/nsd/remote.c
671
if(n->event_added)
usr.sbin/nsd/remote.c
672
event_del(&n->c);
usr.sbin/nsd/remote.c
673
free(n);
usr.sbin/nsd/remote.c
676
SSL_set_accept_state(n->ssl);
usr.sbin/nsd/remote.c
677
(void)SSL_set_mode(n->ssl, SSL_MODE_AUTO_RETRY);
usr.sbin/nsd/remote.c
678
if(!SSL_set_fd(n->ssl, newfd)) {
usr.sbin/nsd/remote.c
680
if(n->event_added)
usr.sbin/nsd/remote.c
681
event_del(&n->c);
usr.sbin/nsd/remote.c
682
SSL_free(n->ssl);
usr.sbin/nsd/remote.c
683
free(n);
usr.sbin/nsd/remote.c
687
n->ssl = NULL;
usr.sbin/nsd/remote.c
691
n->rc = rc;
usr.sbin/nsd/remote.c
692
n->stats_next = NULL;
usr.sbin/nsd/remote.c
693
n->prev = NULL;
usr.sbin/nsd/remote.c
694
n->next = rc->busy_list;
usr.sbin/nsd/remote.c
695
if(n->next) n->next->prev = n;
usr.sbin/nsd/remote.c
696
rc->busy_list = n;
usr.sbin/nsd/remote.c
701
remote_control_callback(newfd, EV_READ, n);
usr.sbin/nsd/remote.c
934
struct notify_zone* n = (struct notify_zone*)rbtree_search(
usr.sbin/nsd/remote.c
936
if(n) {
usr.sbin/nsd/remote.c
937
xfrd_notify_start(n, xfrd);
usr.sbin/nsd/remote.c
943
struct notify_zone* n;
usr.sbin/nsd/remote.c
944
RBTREE_FOR(n, struct notify_zone*, xfrd->notify_zones) {
usr.sbin/nsd/remote.c
945
xfrd_notify_start(n, xfrd);
usr.sbin/nsd/server.c
1604
server_close_all_sockets(struct nsd_socket sockets[], size_t n)
usr.sbin/nsd/server.c
1609
for (i = 0; i < n; ++i) {
usr.sbin/nsd/server.c
1842
struct radnode* n;
usr.sbin/nsd/server.c
1846
for(n=radix_first(nsd->db->zonetree); n; n=radix_next(n)) {
usr.sbin/nsd/server.c
1847
task_new_soainfo(taskudb, &task_last, (zone_type*)n->elem, 0);
usr.sbin/nsd/server.c
559
struct radnode* n;
usr.sbin/nsd/server.c
560
for(n=radix_first(nsd->db->zonetree); n; n=radix_next(n)) {
usr.sbin/nsd/server.c
561
zone_type* zone = (zone_type*)n->elem;
usr.sbin/nsd/simdzone/src/bench.c
125
const size_t n = sizeof(kernels)/sizeof(kernels[0]);
usr.sbin/nsd/simdzone/src/bench.c
130
for (size_t i=0; !kernel && i < n; i++) {
usr.sbin/nsd/simdzone/src/bench.c
136
for (size_t i=0; !kernel && i < n; i++) {
usr.sbin/nsd/simdzone/src/bench.c
166
for (size_t i=0, n=sizeof(kernels)/sizeof(kernels[0]); i < n; i++)
usr.sbin/nsd/simdzone/src/bench.c
27
#define strncasecmp(s1, s2, n) _strnicmp(s1, s2, n)
usr.sbin/nsd/simdzone/src/fallback/name.h
31
uint32_t n;
usr.sbin/nsd/simdzone/src/fallback/name.h
32
if (!(n = unescape(t, w)))
usr.sbin/nsd/simdzone/src/fallback/name.h
34
w += 1; t += n;
usr.sbin/nsd/simdzone/src/generic/ilnp64.h
23
size_t n = 0;
usr.sbin/nsd/simdzone/src/generic/ilnp64.h
28
if (n == 3 || p == g || p - g > 4)
usr.sbin/nsd/simdzone/src/generic/ilnp64.h
31
n += 1;
usr.sbin/nsd/simdzone/src/generic/ilnp64.h
42
a[n] = (uint16_t)(a[n] << 4u) + x;
usr.sbin/nsd/simdzone/src/generic/ilnp64.h
47
if (n != 3 || p == g || p - g > 4 || classify[(uint8_t)*p] == CONTIGUOUS)
usr.sbin/nsd/simdzone/src/generic/ip6.h
168
const int n = (int)(tp - colonp);
usr.sbin/nsd/simdzone/src/generic/ip6.h
171
for (i = 1; i <= n; i++) {
usr.sbin/nsd/simdzone/src/generic/ip6.h
172
endp[- i] = colonp[n - i];
usr.sbin/nsd/simdzone/src/generic/ip6.h
173
colonp[n - i] = 0;
usr.sbin/nsd/simdzone/src/generic/parser.h
19
# define strncasecmp(s1, s2, n) _strnicmp((s1), (s2), (n))
usr.sbin/nsd/simdzone/src/generic/svcb.h
200
size_t n = 0;
usr.sbin/nsd/simdzone/src/generic/svcb.h
206
if ((n = (size_t)scan_ip4(t, rdata->octets)) == 0)
usr.sbin/nsd/simdzone/src/generic/svcb.h
209
t += n;
usr.sbin/nsd/simdzone/src/generic/svcb.h
214
if ((n = (size_t)scan_ip4(t + 1, rdata->octets)) == 0)
usr.sbin/nsd/simdzone/src/generic/svcb.h
217
t += n + 1;
usr.sbin/nsd/simdzone/src/generic/svcb.h
268
size_t n = 0;
usr.sbin/nsd/simdzone/src/generic/svcb.h
274
if ((n = (size_t)scan_ip6(t, rdata->octets)) == 0)
usr.sbin/nsd/simdzone/src/generic/svcb.h
277
t += n;
usr.sbin/nsd/simdzone/src/generic/svcb.h
282
if ((n = (size_t)scan_ip6(t + 1, rdata->octets)) == 0)
usr.sbin/nsd/simdzone/src/generic/svcb.h
285
t += n + 1;
usr.sbin/nsd/simdzone/src/generic/types.h
1089
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1093
if ((r = check(&c, check_name(parser, type, &f[0], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1144
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1148
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1149
(r = check(&c, check_int16(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1150
(r = check(&c, check_int16(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1151
(r = check(&c, check_name(parser, type, &f[3], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1154
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
1369
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1373
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1374
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1375
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1395
if (digest_size && n - 4 != digest_size)
usr.sbin/nsd/simdzone/src/generic/types.h
1399
if (c > n)
usr.sbin/nsd/simdzone/src/generic/types.h
1459
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1463
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1464
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1469
if (c == n)
usr.sbin/nsd/simdzone/src/generic/types.h
1470
SYNTAX_ERROR(parser, "Missing %s in %s", NAME((&f[n!=0])), NAME(type));
usr.sbin/nsd/simdzone/src/generic/types.h
1471
else if (o[1] == 1 && (n - c) != 20)
usr.sbin/nsd/simdzone/src/generic/types.h
1474
else if (o[1] == 2 && (n - c) != 32)
usr.sbin/nsd/simdzone/src/generic/types.h
1562
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1567
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1568
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1569
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1576
if ((r = check(&c, check_ip4(parser, t, &f[3], o+c, n-c))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
1582
if ((r = check(&c, check_ip6(parser, t, &f[3], o+c, n-c))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
1588
if ((r = check(&c, check_name(parser, t, &f[3], o+c, n-c))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
1597
if (c < n)
usr.sbin/nsd/simdzone/src/generic/types.h
1601
if (c >= n)
usr.sbin/nsd/simdzone/src/generic/types.h
1678
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1682
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1683
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1684
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1685
(r = check(&c, check_ttl(parser, type, &f[3], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1686
(r = check(&c, check_int32(parser, type, &f[4], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1687
(r = check(&c, check_int32(parser, type, &f[5], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1688
(r = check(&c, check_int16(parser, type, &f[6], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1689
(r = check(&c, check_name(parser, type, &f[7], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1692
if (c > n)
usr.sbin/nsd/simdzone/src/generic/types.h
1749
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1753
if ((r = check(&c, check_name(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1754
(r = check(&c, check_nsec(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1757
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
1786
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1790
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1791
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1792
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1795
if (c > n)
usr.sbin/nsd/simdzone/src/generic/types.h
1858
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1862
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1863
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1864
(r = check(&c, check_int16(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1865
(r = check(&c, check_string(parser, type, &f[3], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1866
(r = check(&c, check_string(parser, type, &f[4], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1867
(r = check(&c, check_nsec(parser, type, &f[5], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1870
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
1915
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1919
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1920
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1921
(r = check(&c, check_int16(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1922
(r = check(&c, check_string(parser, type, &f[3], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1925
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
1964
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
1968
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1969
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
1970
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
1973
if (c >= n)
usr.sbin/nsd/simdzone/src/generic/types.h
2094
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2098
if ((r = check(&c, check_int32(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2099
(r = check(&c, check_int16(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2100
(r = check(&c, check_nsec(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2103
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
2136
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2140
if ((r = check(&c, check_int32(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2141
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2142
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2156
if (digest_size && n - 6 != digest_size)
usr.sbin/nsd/simdzone/src/generic/types.h
2284
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2288
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2289
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2290
(r = check(&c, check_int16(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2291
(r = check(&c, check_name(parser, type, &f[3], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2302
if (c > n)
usr.sbin/nsd/simdzone/src/generic/types.h
2348
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2352
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2353
(r = check(&c, check_ilnp64(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2355
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
2386
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2390
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2391
(r = check(&c, check_ip4(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2394
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
2425
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2429
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2430
(r = check(&c, check_ilnp64(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2432
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
2513
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2517
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2518
(r = check(&c, check_int16(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2520
if (c >= n)
usr.sbin/nsd/simdzone/src/generic/types.h
2555
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2559
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2560
(r = check(&c, check_int8(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2562
if (c >= n)
usr.sbin/nsd/simdzone/src/generic/types.h
2597
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2601
if ((r = check(&c, check_int32(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2602
(r = check(&c, check_int32(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2603
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2604
(r = check(&c, check_string(parser, type, &f[3], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2606
if (c > n)
usr.sbin/nsd/simdzone/src/generic/types.h
262
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
266
if ((r = check(&c, check_name(parser, type, &f[0], o, n))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
2685
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
269
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
2690
if ((r = check(&c, check_int8(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
2691
(r = check(&c, check_int8(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
2698
if ((r = check(&c, check_ip4(parser, t, &f[3], o+c, n-c))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
2704
if ((r = check(&c, check_ip6(parser, t, &f[3], o+c, n-c))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
2710
if ((r = check(&c, check_name(parser, t, &f[3], o+c, n-c))) < 0)
usr.sbin/nsd/simdzone/src/generic/types.h
2716
if (c < n)
usr.sbin/nsd/simdzone/src/generic/types.h
2795
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
2799
if ((r = check(&c, check_int64(parser, type, &f[0], o, n))))
usr.sbin/nsd/simdzone/src/generic/types.h
2801
if (c > n)
usr.sbin/nsd/simdzone/src/generic/types.h
296
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
300
if ((r = check(&c, check_name(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
301
(r = check(&c, check_name(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
302
(r = check(&c, check_int32(parser, type, &f[2], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
303
(r = check(&c, check_ttl(parser, type, &f[3], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
304
(r = check(&c, check_ttl(parser, type, &f[4], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
305
(r = check(&c, check_ttl(parser, type, &f[5], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
306
(r = check(&c, check_ttl(parser, type, &f[6], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
309
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
360
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
364
if ((r = check(&c, check_ip4(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
365
(r = check(&c, check_int8(parser, type, &f[0], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
370
if (n > 8192 + 5)
usr.sbin/nsd/simdzone/src/generic/types.h
431
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
435
if ((r = check(&c, check_string(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
436
(r = check(&c, check_string(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
439
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
470
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
474
if ((r = check(&c, check_name(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
475
(r = check(&c, check_name(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
478
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
509
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
513
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
514
(r = check(&c, check_name(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
517
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
548
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
552
if ((r = check(&c, check_string(parser, type, &f[0], o, n))))
usr.sbin/nsd/simdzone/src/generic/types.h
555
while (c < n)
usr.sbin/nsd/simdzone/src/generic/types.h
556
if ((r = check(&c, check_string(parser, type, &f[0], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
559
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
588
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
592
if ((r = check(&c, check_string(parser, type, &f[0], o, n))))
usr.sbin/nsd/simdzone/src/generic/types.h
595
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
622
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
626
if ((r = check(&c, check_string(parser, type, &f[0], o, n))))
usr.sbin/nsd/simdzone/src/generic/types.h
629
if (c < n && (r = check(&c, check_string(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
632
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
668
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
672
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
673
(r = check(&c, check_name(parser, type, &f[1], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
676
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
733
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
737
if ((r = check(&c, check_string(parser, type, &f[0], o, n))))
usr.sbin/nsd/simdzone/src/generic/types.h
740
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
758
const size_t n = parser->file->owner.length;
usr.sbin/nsd/simdzone/src/generic/types.h
760
for (; i < n; i += 2)
usr.sbin/nsd/simdzone/src/generic/types.h
765
if (strncasecmp((const char *)o + i, (const char *)nsap_int, 9) != 0 || !i || i + 10 != n)
usr.sbin/nsd/simdzone/src/generic/types.h
797
const size_t n = parser->rdata->length;
usr.sbin/nsd/simdzone/src/generic/types.h
846
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
850
if ((r = check(&c, check_int16(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
851
(r = check(&c, check_name(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
852
(r = check(&c, check_name(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
855
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
890
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
894
if ((r = check(&c, check_string(parser, type, &f[0], o, n))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
895
(r = check(&c, check_string(parser, type, &f[1], o+c, n-c))) ||
usr.sbin/nsd/simdzone/src/generic/types.h
896
(r = check(&c, check_string(parser, type, &f[2], o+c, n-c))))
usr.sbin/nsd/simdzone/src/generic/types.h
899
if (c != n)
usr.sbin/nsd/simdzone/src/generic/types.h
933
const size_t n = (uintptr_t)rdata->octets - (uintptr_t)parser->rdata->octets;
usr.sbin/nsd/simdzone/src/generic/types.h
937
if ((r = check(&c, check_ip6(parser, type, &f[0], o, n))))
usr.sbin/nsd/simdzone/src/generic/types.h
940
if (c != n)
usr.sbin/nsd/simdzone/src/zone.c
36
# define strncasecmp(s1, s2, n) _strnicmp(s1, s2, n)
usr.sbin/nsd/tsig.c
25
int memcmp_fixedtime(const void *s1, const void *s2, size_t n)
usr.sbin/nsd/tsig.c
35
for(i=0; i<n; i++) {
usr.sbin/nsd/udb.c
1444
move_xl_segment(void* base, udb_base* udb, udb_void xl, udb_void n,
usr.sbin/nsd/udb.c
1448
udb_xl_chunk_d* np = UDB_XL_CHUNK(n);
usr.sbin/nsd/udb.c
1449
uint64_t amount = xl - n;
usr.sbin/nsd/udb.c
1450
assert(n < xl); /* move to compact */
usr.sbin/nsd/udb.c
1454
udb->glob_data->rb_new = n;
usr.sbin/nsd/udb.c
1484
udb_void n = xl-amount;
usr.sbin/nsd/udb.c
1487
move_xl_segment(base, alloc->udb, xl, n, sz, 0);
usr.sbin/nsd/udb.c
1488
chunk_fix_ptrs(base, alloc->udb, UDB_CHUNK(n),
usr.sbin/nsd/udb.c
1489
n+sizeof(udb_xl_chunk_d),
usr.sbin/nsd/udb.c
1846
udb_void c, n, newd;
usr.sbin/nsd/udb.c
1875
n = chunk_from_dataptr(newd);
usr.sbin/nsd/udb.c
1876
np = UDB_CHUNK(n);
usr.sbin/nsd/udb.c
32
udb_void n, uint64_t sz, uint64_t startseg);
usr.sbin/nsd/util.c
1321
int i, x, y, z, n = (int)(bitset->size);
usr.sbin/nsd/util.c
1330
for (i = 0; i <= n; i++) {
usr.sbin/nsd/util.c
1331
if (i == n || !nsd_bitset_isset(bitset, i)) {
usr.sbin/nsd/util.c
1333
if (i == n && x == -1) {
usr.sbin/nsd/util.c
1335
assert(z == (n - 1));
usr.sbin/nsd/util.c
1339
if (x == 0 && y == (n - 1)) {
usr.sbin/nsd/util.c
670
size_t n;
usr.sbin/nsd/util.c
688
n=p/8;
usr.sbin/nsd/util.c
691
target[n]|=d << (b-4);
usr.sbin/nsd/util.c
693
target[n]|=d >> (4-b);
usr.sbin/nsd/util.c
694
target[n+1]|=d << (b+4);
usr.sbin/nsd/util.h
37
#define ALIGN_UP(n, alignment) \
usr.sbin/nsd/util.h
38
(((n) + (alignment) - 1) & (~((alignment) - 1)))
usr.sbin/nsd/util.h
39
#define PADDING(n, alignment) \
usr.sbin/nsd/util.h
40
(ALIGN_UP((n), (alignment)) - (n))
usr.sbin/nsd/xfrd-tcp.c
340
struct xfrd_tcp_pipeline_id *n;
usr.sbin/nsd/xfrd-tcp.c
348
n = (struct xfrd_tcp_pipeline_id*)node;
usr.sbin/nsd/xfrd-tcp.c
349
n->next_free = tp->pipe_id_free_list;
usr.sbin/nsd/xfrd-tcp.c
350
tp->pipe_id_free_list = n;
usr.sbin/nsd/xfrd-tcp.c
390
struct xfrd_tcp_pipeline_id* n = (struct xfrd_tcp_pipeline_id*)
usr.sbin/nsd/xfrd-tcp.c
391
region_alloc_zero(region, sizeof(*n));
usr.sbin/nsd/xfrd-tcp.c
392
n->next_free = tp->pipe_id_free_list;
usr.sbin/nsd/xfrd-tcp.c
393
tp->pipe_id_free_list = n;
usr.sbin/nsd/xfrd-tcp.c
407
rbnode_type* n;
usr.sbin/nsd/xfrd-tcp.c
411
n = rbtree_search(tp->zone_per_id, &key);
usr.sbin/nsd/xfrd-tcp.c
412
if(n && n != RBTREE_NULL) {
usr.sbin/nsd/xfrd-tcp.c
413
return ((struct xfrd_tcp_pipeline_id*)n)->zone;
usr.sbin/nsd/xfrd-tcp.c
422
struct xfrd_tcp_pipeline_id* n;
usr.sbin/nsd/xfrd-tcp.c
427
n = tp->pipe_id_free_list;
usr.sbin/nsd/xfrd-tcp.c
428
tp->pipe_id_free_list = n->next_free;
usr.sbin/nsd/xfrd-tcp.c
429
n->next_free = NULL;
usr.sbin/nsd/xfrd-tcp.c
430
memset(&n->node, 0, sizeof(n->node));
usr.sbin/nsd/xfrd-tcp.c
431
n->node.key = n;
usr.sbin/nsd/xfrd-tcp.c
432
n->id = id;
usr.sbin/nsd/xfrd-tcp.c
433
n->zone = zone;
usr.sbin/nsd/xfrd-tcp.c
434
rbtree_insert(tp->zone_per_id, &n->node);
usr.sbin/nsd/xfrd-tcp.c
447
struct xfrd_tcp_pipeline_id* n =
usr.sbin/nsd/xfrd-tcp.c
449
n->next_free = tp->pipe_id_free_list;
usr.sbin/nsd/xfrd-tcp.c
450
tp->pipe_id_free_list = n;
usr.sbin/nsd/xfrd-tcp.c
458
rbnode_type* n;
usr.sbin/nsd/xfrd-tcp.c
462
n = rbtree_search(tp->zone_per_id, &key);
usr.sbin/nsd/xfrd-tcp.c
463
if(n && n != RBTREE_NULL) {
usr.sbin/nsd/xfrd-tcp.c
464
struct xfrd_tcp_pipeline_id* zid = (struct xfrd_tcp_pipeline_id*)n;
usr.sbin/nsd/xfrd.c
476
struct notify_zone* n;
usr.sbin/nsd/xfrd.c
477
RBTREE_FOR(n, struct notify_zone*, xfrd->notify_zones) {
usr.sbin/nsd/xfrd.c
478
tsig_delete_record(&n->notify_tsig, NULL);
usr.sbin/ntpd/constraint.c
631
ssize_t n;
usr.sbin/ntpd/constraint.c
649
if ((n = imsg_get(&cstr->ibuf, &imsg)) == -1) {
usr.sbin/ntpd/constraint.c
653
if (n == 0)
usr.sbin/ntpd/constraint.c
776
struct constraint *n, *tmp;
usr.sbin/ntpd/constraint.c
777
TAILQ_FOREACH_SAFE(n, &conf->constraints, entry, tmp) {
usr.sbin/ntpd/constraint.c
778
if (cstr->id == n->id)
usr.sbin/ntpd/constraint.c
780
if (cstr->addr_head.pool == n->addr_head.pool)
usr.sbin/ntpd/constraint.c
781
constraint_remove(n);
usr.sbin/ntpd/control.c
207
ssize_t n;
usr.sbin/ntpd/control.c
229
if ((n = imsg_get(&c->ibuf, &imsg)) == -1) {
usr.sbin/ntpd/control.c
233
if (n == 0)
usr.sbin/ntpd/ntp.c
480
int n;
usr.sbin/ntpd/ntp.c
486
if ((n = imsg_get(ibuf_main, &imsg)) == -1)
usr.sbin/ntpd/ntp.c
489
if (n == 0)
usr.sbin/ntpd/ntp.c
494
memcpy(&n, imsg.data, sizeof(n));
usr.sbin/ntpd/ntp.c
495
if (n == 1 && !conf->status.synced) {
usr.sbin/ntpd/ntp.c
500
} else if (n == 0 && conf->status.synced) {
usr.sbin/ntpd/ntp.c
524
struct sockaddr_storage old[MAX_SERVERS_DNS], size_t n)
usr.sbin/ntpd/ntp.c
528
for (i = 0; i < n; i++) {
usr.sbin/ntpd/ntp.c
554
int n;
usr.sbin/ntpd/ntp.c
560
if ((n = imsg_get(ibuf_dns, &imsg)) == -1)
usr.sbin/ntpd/ntp.c
563
if (n == 0)
usr.sbin/ntpd/ntp.c
581
n = 0;
usr.sbin/ntpd/ntp.c
593
existing[n++] = npeer->addr->ss;
usr.sbin/ntpd/ntp.c
627
n)) {
usr.sbin/ntpd/ntp.c
670
memcpy(&n, imsg.data, sizeof(int));
usr.sbin/ntpd/ntp.c
671
if (n < 0)
usr.sbin/ntpd/ntp_dns.c
142
int n, cnt;
usr.sbin/ntpd/ntp_dns.c
153
if ((n = imsg_get(ibuf_dns, &imsg)) == -1)
usr.sbin/ntpd/ntp_dns.c
156
if (n == 0)
usr.sbin/ntpd/ntp_dns.c
240
int i, n;
usr.sbin/ntpd/ntp_dns.c
247
n = probe_root_ns();
usr.sbin/ntpd/ntp_dns.c
249
if (n >= 0)
usr.sbin/ntpd/ntp_dns.c
262
n >= 0 ? "eventually succeeded": "gave up");
usr.sbin/ntpd/ntp_dns.c
263
if (imsg_compose(ibuf_dns, IMSG_PROBE_ROOT, 0, 0, -1, &n,
usr.sbin/ntpd/ntp_msg.c
46
ssize_t n;
usr.sbin/ntpd/ntp_msg.c
53
n = sendto(fd, msg, sizeof(*msg), 0, sa, sa_len);
usr.sbin/ntpd/ntp_msg.c
54
if (n == -1) {
usr.sbin/ntpd/ntp_msg.c
64
if (n != sizeof(*msg)) {
usr.sbin/ntpd/ntp_msg.c
65
log_warnx("ntp_sendmsg: only %zd of %zu bytes sent", n,
usr.sbin/ntpd/ntpd.c
394
int n;
usr.sbin/ntpd/ntpd.c
401
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ntpd/ntpd.c
404
if (n == 0)
usr.sbin/ntpd/ntpd.c
412
n = ntpd_adjtime(d);
usr.sbin/ntpd/ntpd.c
413
if (n == -1)
usr.sbin/ntpd/ntpd.c
416
&n, sizeof(n));
usr.sbin/ntpd/ntpd.c
618
int fd, n, done, ch, action;
usr.sbin/ntpd/ntpd.c
710
if ((n = imsgbuf_read(ibuf_ctl)) == -1)
usr.sbin/ntpd/ntpd.c
712
if (n == 0)
usr.sbin/ntpd/ntpd.c
716
if ((n = imsg_get(ibuf_ctl, &imsg)) == -1)
usr.sbin/ntpd/ntpd.c
718
if (n == 0)
usr.sbin/ntpd/sensors.c
51
int i, n, err;
usr.sbin/ntpd/sensors.c
55
n = 0;
usr.sbin/ntpd/sensors.c
63
n++;
usr.sbin/ntpd/sensors.c
66
return n;
usr.sbin/ospf6ctl/ospf6ctl.c
258
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6ctl/ospf6ctl.c
260
if (n == 0)
usr.sbin/ospf6ctl/ospf6ctl.c
264
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6ctl/ospf6ctl.c
266
if (n == 0)
usr.sbin/ospf6ctl/ospf6ctl.c
95
int n;
usr.sbin/ospf6d/area.c
51
struct rde_nbr *n;
usr.sbin/ospf6d/area.c
63
while ((n = LIST_FIRST(&area->nbr_list)) != NULL)
usr.sbin/ospf6d/area.c
64
rde_nbr_del(n);
usr.sbin/ospf6d/control.c
250
ssize_t n;
usr.sbin/ospf6d/control.c
273
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/ospf6d/control.c
278
if (n == 0)
usr.sbin/ospf6d/kroute.c
1323
ssize_t n;
usr.sbin/ospf6d/kroute.c
1325
if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) {
usr.sbin/ospf6d/kroute.c
1332
if (n == 0) {
usr.sbin/ospf6d/kroute.c
1337
return (rtmsg_process(buf, n));
usr.sbin/ospf6d/ospf6d.c
342
ssize_t n;
usr.sbin/ospf6d/ospf6d.c
346
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6d/ospf6d.c
348
if (n == 0) /* connection closed */
usr.sbin/ospf6d/ospf6d.c
361
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6d/ospf6d.c
364
if (n == 0)
usr.sbin/ospf6d/ospf6d.c
420
ssize_t n;
usr.sbin/ospf6d/ospf6d.c
424
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6d/ospf6d.c
426
if (n == 0) /* connection closed */
usr.sbin/ospf6d/ospf6d.c
439
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6d/ospf6d.c
442
if (n == 0)
usr.sbin/ospf6d/ospfe.c
261
int n, stub_changed, shut = 0, isvalid, wasvalid;
usr.sbin/ospf6d/ospfe.c
264
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6d/ospfe.c
266
if (n == 0) /* connection closed */
usr.sbin/ospf6d/ospfe.c
279
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6d/ospfe.c
281
if (n == 0)
usr.sbin/ospf6d/ospfe.c
453
int n, noack = 0, shut = 0;
usr.sbin/ospf6d/ospfe.c
457
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6d/ospfe.c
459
if (n == 0) /* connection closed */
usr.sbin/ospf6d/ospfe.c
472
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6d/ospfe.c
474
if (n == 0)
usr.sbin/ospf6d/rde.c
275
ssize_t n;
usr.sbin/ospf6d/rde.c
281
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6d/rde.c
283
if (n == 0) /* connection closed */
usr.sbin/ospf6d/rde.c
299
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6d/rde.c
301
if (n == 0)
usr.sbin/ospf6d/rde.c
653
ssize_t n;
usr.sbin/ospf6d/rde.c
657
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospf6d/rde.c
659
if (n == 0) /* connection closed */
usr.sbin/ospf6d/rde.c
672
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospf6d/rde.c
674
if (n == 0)
usr.sbin/ospf6d/rde_lsdb.c
622
lsa_find_rtr_frag(struct area *area, u_int32_t rtr_id, unsigned int n)
usr.sbin/ospf6d/rde_lsdb.c
642
if (i >= n)
usr.sbin/ospf6d/rde_lsdb.c
650
if (i == n)
usr.sbin/ospf6d/rde_lsdb.c
701
unsigned int n = 1;
usr.sbin/ospf6d/rde_lsdb.c
710
v = lsa_find_rtr_frag(v->area, htonl(v->adv_rtr), n++);
usr.sbin/ospfctl/ospfctl.c
225
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfctl/ospfctl.c
227
if (n == 0)
usr.sbin/ospfctl/ospfctl.c
231
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfctl/ospfctl.c
233
if (n == 0)
usr.sbin/ospfctl/ospfctl.c
68
int n, verbose = 0;
usr.sbin/ospfd/area.c
51
struct rde_nbr *n;
usr.sbin/ospfd/area.c
64
while ((n = LIST_FIRST(&area->nbr_list)) != NULL)
usr.sbin/ospfd/area.c
65
rde_nbr_del(n);
usr.sbin/ospfd/control.c
250
ssize_t n;
usr.sbin/ospfd/control.c
273
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/ospfd/control.c
278
if (n == 0)
usr.sbin/ospfd/kroute.c
1360
ssize_t n;
usr.sbin/ospfd/kroute.c
1362
if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) {
usr.sbin/ospfd/kroute.c
1369
if (n == 0) {
usr.sbin/ospfd/kroute.c
1374
return (rtmsg_process(buf, n));
usr.sbin/ospfd/ospfd.c
358
ssize_t n;
usr.sbin/ospfd/ospfd.c
364
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfd/ospfd.c
366
if (n == 0) /* connection closed */
usr.sbin/ospfd/ospfd.c
379
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfd/ospfd.c
382
if (n == 0)
usr.sbin/ospfd/ospfd.c
446
ssize_t n;
usr.sbin/ospfd/ospfd.c
452
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfd/ospfd.c
454
if (n == 0) /* connection closed */
usr.sbin/ospfd/ospfd.c
467
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfd/ospfd.c
470
if (n == 0)
usr.sbin/ospfd/ospfe.c
275
int n, link_ok, stub_changed, shut = 0;
usr.sbin/ospfd/ospfe.c
278
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfd/ospfe.c
280
if (n == 0) /* connection closed */
usr.sbin/ospfd/ospfe.c
293
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfd/ospfe.c
295
if (n == 0)
usr.sbin/ospfd/ospfe.c
498
int n, noack = 0, shut = 0;
usr.sbin/ospfd/ospfe.c
502
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfd/ospfe.c
504
if (n == 0) /* connection closed */
usr.sbin/ospfd/ospfe.c
517
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfd/ospfe.c
519
if (n == 0)
usr.sbin/ospfd/rde.c
263
ssize_t n;
usr.sbin/ospfd/rde.c
271
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfd/rde.c
273
if (n == 0) /* connection closed */
usr.sbin/ospfd/rde.c
289
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfd/rde.c
291
if (n == 0)
usr.sbin/ospfd/rde.c
650
ssize_t n;
usr.sbin/ospfd/rde.c
656
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ospfd/rde.c
658
if (n == 0) /* connection closed */
usr.sbin/ospfd/rde.c
671
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ospfd/rde.c
673
if (n == 0)
usr.sbin/pppd/chat/chat.c
121
#define memmove(to, from, n) bcopy(from, to, n)
usr.sbin/pppd/chat/chat.c
122
#define strerror(n) ((unsigned)(n) < sys_nerr? sys_errlist[(n)] :\
usr.sbin/pppd/chat/chat.c
1230
void echo_stderr(int n)
usr.sbin/pppd/chat/chat.c
1235
switch (n) {
usr.sbin/pppd/chat/chat.c
1247
s = character(n);
usr.sbin/pppd/chat/chat.c
1288
int n, abort_len, report_len;
usr.sbin/pppd/chat/chat.c
1315
for (n = 0; n < n_reports; ++n) {
usr.sbin/pppd/chat/chat.c
1316
if ((report_string[n] != (char*) NULL) &&
usr.sbin/pppd/chat/chat.c
1317
s - temp >= (report_len = strlen(report_string[n])) &&
usr.sbin/pppd/chat/chat.c
1318
strncmp(s - report_len, report_string[n], report_len) == 0) {
usr.sbin/pppd/chat/chat.c
1323
strlcat (report_buffer, report_string[n], sizeof(report_buffer));
usr.sbin/pppd/chat/chat.c
1325
report_string[n] = (char *) NULL;
usr.sbin/pppd/chat/chat.c
1357
for (n = 0; n < n_aborts; ++n) {
usr.sbin/pppd/chat/chat.c
1358
if (s - temp >= (abort_len = strlen(abort_string[n])) &&
usr.sbin/pppd/chat/chat.c
1359
strncmp(s - abort_len, abort_string[n], abort_len) == 0) {
usr.sbin/pppd/chat/chat.c
1368
exit_code = n + 4;
usr.sbin/pppd/chat/chat.c
1369
strlcpy(fail_buffer, abort_string[n], sizeof fail_buffer);
usr.sbin/pppd/chat/chat.c
1433
int c, i, n;
usr.sbin/pppd/chat/chat.c
1530
n = prec;
usr.sbin/pppd/chat/chat.c
1532
n = strlen((char *)p);
usr.sbin/pppd/chat/chat.c
1533
if (prec > 0 && prec < n)
usr.sbin/pppd/chat/chat.c
1534
n = prec;
usr.sbin/pppd/chat/chat.c
1536
while (n > 0 && buflen > 0) {
usr.sbin/pppd/chat/chat.c
1538
--n;
usr.sbin/pppd/chat/chat.c
1605
if ((n = width - len) > 0) {
usr.sbin/pppd/chat/chat.c
1606
buflen -= n;
usr.sbin/pppd/chat/chat.c
1607
for (; n > 0; --n)
usr.sbin/pppd/demand.c
203
loop_chars(unsigned char *p, int n)
usr.sbin/pppd/demand.c
208
for (; n > 0; --n) {
usr.sbin/pppd/main.c
1227
int i, n;
usr.sbin/pppd/main.c
1241
n = (*protp->printpkt)(p, len, printer, arg);
usr.sbin/pppd/main.c
1243
p += n;
usr.sbin/pppd/main.c
1244
len -= n;
usr.sbin/pppd/main.c
1259
int n;
usr.sbin/pppd/main.c
1265
n = vfmtmsg(buf, sizeof(buf), fmt, pvar);
usr.sbin/pppd/main.c
1268
if (linep + n + 1 > line + sizeof(line)) {
usr.sbin/pppd/main.c
1273
linep += n;
usr.sbin/pppd/main.c
1332
int n;
usr.sbin/pppd/main.c
1335
n = vfmtmsg(buf, buflen, fmt, args);
usr.sbin/pppd/main.c
1337
return n;
usr.sbin/pppd/main.c
1348
int c, i, n;
usr.sbin/pppd/main.c
1454
n = prec;
usr.sbin/pppd/main.c
1456
n = strlen((char *)p);
usr.sbin/pppd/main.c
1457
if (prec > 0 && prec < n)
usr.sbin/pppd/main.c
1458
n = prec;
usr.sbin/pppd/main.c
1460
while (n > 0 && buflen > 0) {
usr.sbin/pppd/main.c
1462
--n;
usr.sbin/pppd/main.c
1529
if ((n = width - len) > 0) {
usr.sbin/pppd/main.c
1530
buflen -= n;
usr.sbin/pppd/main.c
1531
for (; n > 0; --n)
usr.sbin/pppd/options.c
1468
int n, ret;
usr.sbin/pppd/options.c
1474
n = strtol(p, &endp, 16);
usr.sbin/pppd/options.c
1481
if (n < 0 || (0x20 <= n && n <= 0x3F) || n == 0x5E || n > 0xFF) {
usr.sbin/pppd/options.c
1482
option_error("can't escape character 0x%x", n);
usr.sbin/pppd/options.c
1485
xmit_accm[0][n >> 5] |= 1 << (n & 0x1F);
usr.sbin/pppd/options.c
724
int value, digit, got, n;
usr.sbin/pppd/options.c
844
for (n = 0; n < 3 && isoctal(c); ++n) {
usr.sbin/pppd/options.c
858
for (n = 0; n < 2 && isxdigit(c); ++n) {
usr.sbin/pppd/pppd.h
387
#define INCPTR(n, cp) ((cp) += (n))
usr.sbin/pppd/pppd.h
388
#define DECPTR(n, cp) ((cp) -= (n))
usr.sbin/pppd/pppd.h
406
#define BZERO(s, n) memset(s, 0, n)
usr.sbin/pppd/pppd.h
408
#define EXPLICIT_BZERO(s, n) explicit_bzero(s, n)
usr.sbin/pppd/pppstats/pppstats.c
149
#define KBPS(n) ((n) / (interval * 1000.0))
usr.sbin/pppd/sys-bsd.c
1414
int fd, n;
usr.sbin/pppd/sys-bsd.c
1427
n = read(fd, hdb_lock_buffer, 11);
usr.sbin/pppd/sys-bsd.c
1428
if (n <= 0) {
usr.sbin/pppd/sys-bsd.c
1432
hdb_lock_buffer[n] = 0;
usr.sbin/pppd/sys-bsd.c
592
int n;
usr.sbin/pppd/sys-bsd.c
600
n = select(ttyfd+1, fdsp, NULL, fdsp, timo);
usr.sbin/pppd/sys-bsd.c
601
if (n == -1 && errno != EINTR) {
usr.sbin/pppd/sys-bsd.c
620
int n;
usr.sbin/pppd/sys-bsd.c
628
n = select(loop_master + 1, fdsp, NULL, fdsp, timo);
usr.sbin/pppd/sys-bsd.c
629
if (n == -1 && errno != EINTR) {
usr.sbin/pppd/sys-bsd.c
645
int n;
usr.sbin/pppd/sys-bsd.c
647
n = select(0, NULL, NULL, NULL, timo);
usr.sbin/pppd/sys-bsd.c
648
if (n == -1 && errno != EINTR) {
usr.sbin/pppd/sys-bsd.c
682
int n;
usr.sbin/pppd/sys-bsd.c
684
while ((n = read(loop_master, inbuf, sizeof(inbuf))) >= 0) {
usr.sbin/pppd/sys-bsd.c
685
if (loop_chars(inbuf, n))
usr.sbin/pppd/sys-bsd.c
689
if (n == 0) {
usr.sbin/procmap/procmap.c
984
struct namecache n, *tmp;
usr.sbin/procmap/procmap.c
991
_KDEREF(kd, (u_long)tmp, &n, sizeof(n));
usr.sbin/procmap/procmap.c
993
if (n.nc_nlen > 0) {
usr.sbin/procmap/procmap.c
994
if (n.nc_nlen > 2 ||
usr.sbin/procmap/procmap.c
995
n.nc_name[0] != '.' ||
usr.sbin/procmap/procmap.c
996
(n.nc_nlen != 1 && n.nc_name[1] != '.'))
usr.sbin/procmap/procmap.c
997
cache_enter(&n);
usr.sbin/procmap/procmap.c
999
tmp = TAILQ_NEXT(&n, nc_lru);
usr.sbin/pstat/pstat.c
238
int longformat = 0, stringformat = 0, error = 0, n;
usr.sbin/pstat/pstat.c
242
n = strlen(dformat);
usr.sbin/pstat/pstat.c
243
if (n == 0)
usr.sbin/pstat/pstat.c
255
else if (strchr("diouxX", dformat[n - 1])) {
usr.sbin/pstat/pstat.c
262
if (strlen(mod) == n - 1 &&
usr.sbin/quot/quot.c
371
int n;
usr.sbin/quot/quot.c
391
for (usr = usrs, n = nusers; --n >= 0 && usr->count; usr++) {
usr.sbin/quot/quot.c
61
#define SIZE(n) (howmany(((off_t)(n)) * DEV_BSIZE, blocksize))
usr.sbin/ractl/ractl.c
131
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ractl/ractl.c
133
if (n == 0)
usr.sbin/ractl/ractl.c
137
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ractl/ractl.c
139
if (n == 0)
usr.sbin/ractl/ractl.c
66
int n, verbose = 0;
usr.sbin/rad/control.c
229
ssize_t n;
usr.sbin/rad/control.c
251
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/rad/control.c
255
if (n == 0)
usr.sbin/rad/engine.c
192
ssize_t n;
usr.sbin/rad/engine.c
199
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/rad/engine.c
201
if (n == 0) /* Connection closed. */
usr.sbin/rad/engine.c
214
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/rad/engine.c
216
if (n == 0) /* No more messages. */
usr.sbin/rad/engine.c
277
ssize_t n;
usr.sbin/rad/engine.c
283
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/rad/engine.c
285
if (n == 0) /* Connection closed. */
usr.sbin/rad/engine.c
298
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/rad/engine.c
300
if (n == 0) /* No more messages. */
usr.sbin/rad/frontend.c
1490
ssize_t n;
usr.sbin/rad/frontend.c
1498
if ((n = read(fd, buf, ROUTE_SOCKET_BUF_SIZE)) == -1) {
usr.sbin/rad/frontend.c
1505
if (n == 0)
usr.sbin/rad/frontend.c
1508
if (n < (ssize_t)sizeof(rtm->rtm_msglen) || n < rtm->rtm_msglen) {
usr.sbin/rad/frontend.c
1509
log_warnx("partial rtm of %zd in buffer", n);
usr.sbin/rad/frontend.c
322
int n, shut = 0, icmp6sock, rdomain;
usr.sbin/rad/frontend.c
325
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/rad/frontend.c
327
if (n == 0) /* Connection closed. */
usr.sbin/rad/frontend.c
340
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/rad/frontend.c
342
if (n == 0) /* No more messages. */
usr.sbin/rad/frontend.c
546
int n, shut = 0;
usr.sbin/rad/frontend.c
549
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/rad/frontend.c
551
if (n == 0) /* Connection closed. */
usr.sbin/rad/frontend.c
564
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/rad/frontend.c
566
if (n == 0) /* No more messages. */
usr.sbin/rad/parse.y
1130
size_t n;
usr.sbin/rad/parse.y
1140
n = strlcpy(iface->name, name, sizeof(iface->name));
usr.sbin/rad/parse.y
1141
if (n >= sizeof(iface->name))
usr.sbin/rad/rad.c
381
ssize_t n;
usr.sbin/rad/rad.c
388
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/rad/rad.c
390
if (n == 0) /* Connection closed. */
usr.sbin/rad/rad.c
403
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/rad/rad.c
405
if (n == 0) /* No more messages. */
usr.sbin/rad/rad.c
452
ssize_t n;
usr.sbin/rad/rad.c
458
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/rad/rad.c
460
if (n == 0) /* Connection closed. */
usr.sbin/rad/rad.c
473
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/rad/rad.c
475
if (n == 0) /* No more messages. */
usr.sbin/radiusctl/radiusctl.c
195
if ((n = imsg_get(&ibuf, &imsg)) <= 0) {
usr.sbin/radiusctl/radiusctl.c
196
if (n != 0)
usr.sbin/radiusctl/radiusctl.c
98
ssize_t n;
usr.sbin/radiusd/control.c
251
ssize_t n, datalen;
usr.sbin/radiusd/control.c
273
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/radiusd/control.c
278
if (n == 0)
usr.sbin/radiusd/parse.y
139
struct radiusd_listen *n;
usr.sbin/radiusd/parse.y
141
if ((n = calloc(1, sizeof(struct radiusd_listen)))
usr.sbin/radiusd/parse.y
147
*n = $3;
usr.sbin/radiusd/parse.y
148
TAILQ_INSERT_TAIL(&conf->listen, n, next);
usr.sbin/radiusd/radiusd.c
1155
ssize_t n;
usr.sbin/radiusd/radiusd.c
1209
(n = imsg_get(&module->ibuf, &imsg)) <= 0) {
usr.sbin/radiusd/radiusd.c
1384
int n;
usr.sbin/radiusd/radiusd.c
1387
if ((n = imsgbuf_read(&module->ibuf)) != 1) {
usr.sbin/radiusd/radiusd.c
1388
if (n == -1)
usr.sbin/radiusd/radiusd.c
1396
if ((n = imsg_get(&module->ibuf, &imsg)) == -1) {
usr.sbin/radiusd/radiusd.c
1401
if (n == 0)
usr.sbin/radiusd/radiusd.c
1649
ssize_t n;
usr.sbin/radiusd/radiusd.c
1704
if ((n = imsg_get(&module->ibuf, &imsg)) > 0)
usr.sbin/radiusd/radiusd.c
1706
if (n < 0) {
usr.sbin/radiusd/radiusd_bsdauth.c
126
if ((n = imsg_get(&ibuf, &imsg)) == -1)
usr.sbin/radiusd/radiusd_bsdauth.c
128
if (n == 0)
usr.sbin/radiusd/radiusd_bsdauth.c
343
ssize_t n;
usr.sbin/radiusd/radiusd_bsdauth.c
362
if ((n = imsg_get(&module->ibuf, &imsg)) <= 0)
usr.sbin/radiusd/radiusd_bsdauth.c
388
if ((n = imsg_get(&module->ibuf, &imsg)) <= 0)
usr.sbin/radiusd/radiusd_bsdauth.c
86
ssize_t n;
usr.sbin/radiusd/radiusd_file.c
102
ssize_t n;
usr.sbin/radiusd/radiusd_file.c
136
(n = imsg_get(&ibuf, &imsg)) <= 0)
usr.sbin/radiusd/radiusd_file.c
165
if ((n = imsg_get(&ibuf, &imsg)) == -1)
usr.sbin/radiusd/radiusd_file.c
167
if (n == 0)
usr.sbin/radiusd/radiusd_file.c
349
ssize_t n;
usr.sbin/radiusd/radiusd_file.c
369
if ((n = imsg_get(&self->ibuf, &imsg)) <= 0) {
usr.sbin/radiusd/radiusd_ipcp.c
744
int i, n;
usr.sbin/radiusd/radiusd_ipcp.c
817
n = 0;
usr.sbin/radiusd/radiusd_ipcp.c
843
n++;
usr.sbin/radiusd/radiusd_ipcp.c
846
n >= self->user_max_sessions) {
usr.sbin/radiusd/radiusd_ipcp.c
887
n = arc4random_uniform(self->npools);
usr.sbin/radiusd/radiusd_ipcp.c
891
if (i <= n && n < i + addr->naddrs) {
usr.sbin/radiusd/radiusd_ipcp.c
892
inpool_idx = n - i;
usr.sbin/radiusd/radiusd_module.c
359
ssize_t n;
usr.sbin/radiusd/radiusd_module.c
362
if ((n = imsgbuf_read(&base->ibuf)) != 1) {
usr.sbin/radiusd/radiusd_module.c
363
if (n == -1)
usr.sbin/radiusd/radiusd_module.c
369
if ((n = imsg_get(&base->ibuf, &imsg)) == -1) {
usr.sbin/radiusd/radiusd_module.c
374
if (n == 0)
usr.sbin/rarpd/rarpd.c
598
int len, n;
usr.sbin/rarpd/rarpd.c
633
n = write(ii->ii_fd, (char *) ep, len);
usr.sbin/rarpd/rarpd.c
634
if (n != len)
usr.sbin/rarpd/rarpd.c
635
warning("write: only %d of %d bytes written", n, len);
usr.sbin/rbootd/bpf.c
105
if (ioctl(BpfFd, BIOCGDLT, (caddr_t)&n) == -1) {
usr.sbin/rbootd/bpf.c
109
if (n != DLT_EN10MB) {
usr.sbin/rbootd/bpf.c
111
IntfName, n);
usr.sbin/rbootd/bpf.c
118
n = 1;
usr.sbin/rbootd/bpf.c
119
if (ioctl(BpfFd, BIOCIMMEDIATE, (caddr_t)&n) == -1) {
usr.sbin/rbootd/bpf.c
253
int minunit = 999, n;
usr.sbin/rbootd/bpf.c
283
n = strtonum(cp, 0, INT_MAX, &errstr);
usr.sbin/rbootd/bpf.c
284
if (errstr == NULL && n < minunit) {
usr.sbin/rbootd/bpf.c
285
minunit = n;
usr.sbin/rbootd/bpf.c
85
int n;
usr.sbin/rbootd/defs.h
58
#define STRNEQN(s1,s2,n) ((*s1 == *s2) && (strncmp(s1,s2,n) == 0))
usr.sbin/rdate/ntp.c
475
long long n;
usr.sbin/rdate/ntp.c
479
if ((n = (long long) difference) > difference)
usr.sbin/rdate/ntp.c
480
--n;
usr.sbin/rdate/ntp.c
481
adjust->tv_sec = n;
usr.sbin/rdate/ntp.c
482
adjust->tv_usec = (long) (MILLION_D * (difference-n));
usr.sbin/rdate/ntp.c
487
new->tv_usec = (n = (long) old.tv_usec + (long) adjust->tv_usec);
usr.sbin/rdate/ntp.c
489
if (n < 0) {
usr.sbin/rdate/ntp.c
492
} else if (n >= MILLION_L) {
usr.sbin/rdsetroot/rdsetroot.c
183
n = write(fsfd, dataseg + rd_root_image_off,
usr.sbin/rdsetroot/rdsetroot.c
185
if (n != rd_root_size_val)
usr.sbin/rdsetroot/rdsetroot.c
199
n = read(fsfd, dataseg + rd_root_image_off,
usr.sbin/rdsetroot/rdsetroot.c
201
if (n < 0)
usr.sbin/rdsetroot/rdsetroot.c
208
fprintf(stderr, "...copied %d bytes\n", n);
usr.sbin/rdsetroot/rdsetroot.c
50
int ch, debug = 0, fsfd, kfd, n, sflag = 0, xflag = 0;
usr.sbin/relayctl/relayctl.c
104
int n, verbose = 0;
usr.sbin/relayctl/relayctl.c
229
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/relayctl/relayctl.c
231
if (n == 0)
usr.sbin/relayctl/relayctl.c
235
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/relayctl/relayctl.c
237
if (n == 0)
usr.sbin/relayd/ca.c
321
int n, done = 0, cnt = 0;
usr.sbin/relayd/ca.c
377
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/relayd/ca.c
379
if (n == 0)
usr.sbin/relayd/ca.c
383
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/relayd/ca.c
385
if (n == 0)
usr.sbin/relayd/config.c
799
config_setrelayfd(struct privsep *ps, int id, int n,
usr.sbin/relayd/config.c
811
if (proc_compose_imsg(ps, id, n, IMSG_CFG_RELAY_FD, -1, fd,
usr.sbin/relayd/config.c
827
int fd, n, m;
usr.sbin/relayd/config.c
860
n = -1;
usr.sbin/relayd/config.c
861
proc_range(ps, id, &n, &m);
usr.sbin/relayd/config.c
862
for (n = 0; n < m; n++) {
usr.sbin/relayd/config.c
865
if (proc_composev_imsg(ps, id, n,
usr.sbin/relayd/config.c
873
if (proc_flush_imsg(ps, id, n) == -1) {
usr.sbin/relayd/config.c
894
n = -1;
usr.sbin/relayd/config.c
895
proc_range(ps, id, &n, &m);
usr.sbin/relayd/config.c
896
for (n = 0; (what & CONFIG_CERTS) && n < m; n++) {
usr.sbin/relayd/config.c
898
config_setrelayfd(ps, id, n,
usr.sbin/relayd/config.c
908
config_setrelayfd(ps, id, n,
usr.sbin/relayd/config.c
918
config_setrelayfd(ps, id, n,
usr.sbin/relayd/config.c
931
n = -1;
usr.sbin/relayd/config.c
932
proc_range(ps, id, &n, &m);
usr.sbin/relayd/config.c
933
for (n = 0; n < m; n++) {
usr.sbin/relayd/config.c
935
config_setrelayfd(ps, id, n, 0,
usr.sbin/relayd/config.c
944
config_setrelayfd(ps, id, n, 0,
usr.sbin/relayd/config.c
953
config_setrelayfd(ps, id, n, 0,
usr.sbin/relayd/config.c
962
if (proc_flush_imsg(ps, id, n) == -1) {
usr.sbin/relayd/control.c
230
int n;
usr.sbin/relayd/control.c
255
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/relayd/control.c
260
if (n == 0)
usr.sbin/relayd/parse.y
3490
getservice(char *n)
usr.sbin/relayd/parse.y
3496
llval = strtonum(n, 0, UINT16_MAX, &errstr);
usr.sbin/relayd/parse.y
3498
s = getservbyname(n, "tcp");
usr.sbin/relayd/parse.y
3500
s = getservbyname(n, "udp");
usr.sbin/relayd/parse.y
3502
yyerror("unknown port %s", n);
usr.sbin/relayd/proc.c
247
unsigned int n)
usr.sbin/relayd/proc.c
257
dst, n + 1);
usr.sbin/relayd/proc.c
263
if (pp->pp_pipes[dst][n] != -1) {
usr.sbin/relayd/proc.c
268
pp->pp_pipes[dst][n] = fd;
usr.sbin/relayd/proc.c
270
iev = &ps->ps_ievs[dst][n];
usr.sbin/relayd/proc.c
445
unsigned int dst, n;
usr.sbin/relayd/proc.c
457
for (n = 0; n < ps->ps_instances[dst]; n++) {
usr.sbin/relayd/proc.c
458
if (pp->pp_pipes[dst][n] == -1)
usr.sbin/relayd/proc.c
462
event_del(&(ps->ps_ievs[dst][n].ev));
usr.sbin/relayd/proc.c
463
imsgbuf_clear(&(ps->ps_ievs[dst][n].ibuf));
usr.sbin/relayd/proc.c
464
close(pp->pp_pipes[dst][n]);
usr.sbin/relayd/proc.c
465
pp->pp_pipes[dst][n] = -1;
usr.sbin/relayd/proc.c
601
ssize_t n;
usr.sbin/relayd/proc.c
610
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/relayd/proc.c
612
if (n == 0) {
usr.sbin/relayd/proc.c
633
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/relayd/proc.c
635
if (n == 0)
usr.sbin/relayd/proc.c
734
proc_range(struct privsep *ps, enum privsep_procid id, int *n, int *m)
usr.sbin/relayd/proc.c
736
if (*n == -1) {
usr.sbin/relayd/proc.c
738
*n = 0;
usr.sbin/relayd/proc.c
742
*m = *n + 1;
usr.sbin/relayd/proc.c
747
proc_compose_imsg(struct privsep *ps, enum privsep_procid id, int n,
usr.sbin/relayd/proc.c
752
proc_range(ps, id, &n, &m);
usr.sbin/relayd/proc.c
753
for (; n < m; n++) {
usr.sbin/relayd/proc.c
754
if (imsg_compose_event(&ps->ps_ievs[id][n],
usr.sbin/relayd/proc.c
770
proc_composev_imsg(struct privsep *ps, enum privsep_procid id, int n,
usr.sbin/relayd/proc.c
775
proc_range(ps, id, &n, &m);
usr.sbin/relayd/proc.c
776
for (; n < m; n++)
usr.sbin/relayd/proc.c
777
if (imsg_composev_event(&ps->ps_ievs[id][n],
usr.sbin/relayd/proc.c
793
enum privsep_procid id, int n)
usr.sbin/relayd/proc.c
795
return (proc_compose_imsg(ps, id, n, imsg->hdr.type,
usr.sbin/relayd/proc.c
800
proc_ibuf(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/relayd/proc.c
804
proc_range(ps, id, &n, &m);
usr.sbin/relayd/proc.c
805
return (&ps->ps_ievs[id][n].ibuf);
usr.sbin/relayd/proc.c
809
proc_iev(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/relayd/proc.c
813
proc_range(ps, id, &n, &m);
usr.sbin/relayd/proc.c
814
return (&ps->ps_ievs[id][n]);
usr.sbin/relayd/proc.c
819
proc_flush_imsg(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/relayd/proc.c
824
proc_range(ps, id, &n, &m);
usr.sbin/relayd/proc.c
825
for (; n < m; n++) {
usr.sbin/relayd/proc.c
826
if ((ibuf = proc_ibuf(ps, id, n)) == NULL)
usr.sbin/relayd/proc.c
830
imsg_event_add(&ps->ps_ievs[id][n]);
usr.sbin/relayd/relay_http.c
1994
server_root_strip(char *path, int n)
usr.sbin/relayd/relay_http.c
1999
for (; n > 0 && *path != '\0'; n--)
usr.sbin/ripctl/ripctl.c
195
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripctl/ripctl.c
197
if (n == 0)
usr.sbin/ripctl/ripctl.c
201
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripctl/ripctl.c
203
if (n == 0)
usr.sbin/ripctl/ripctl.c
76
int n;
usr.sbin/ripd/control.c
217
ssize_t n;
usr.sbin/ripd/control.c
240
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/ripd/control.c
245
if (n == 0)
usr.sbin/ripd/kroute.c
1023
ssize_t n;
usr.sbin/ripd/kroute.c
1037
if ((n = read(kr_state.fd, &buf, sizeof(buf))) == -1) {
usr.sbin/ripd/kroute.c
1044
if (n == 0) {
usr.sbin/ripd/kroute.c
1049
lim = buf + n;
usr.sbin/ripd/rde.c
198
ssize_t n;
usr.sbin/ripd/rde.c
202
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripd/rde.c
204
if (n == 0) /* connection closed */
usr.sbin/ripd/rde.c
217
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripd/rde.c
219
if (n == 0)
usr.sbin/ripd/rde.c
301
ssize_t n;
usr.sbin/ripd/rde.c
305
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripd/rde.c
307
if (n == 0) /* connection closed */
usr.sbin/ripd/rde.c
320
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripd/rde.c
322
if (n == 0)
usr.sbin/ripd/ripd.c
315
ssize_t n;
usr.sbin/ripd/ripd.c
319
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripd/ripd.c
321
if (n == 0) /* connection closed */
usr.sbin/ripd/ripd.c
334
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripd/ripd.c
337
if (n == 0)
usr.sbin/ripd/ripd.c
395
ssize_t n;
usr.sbin/ripd/ripd.c
399
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripd/ripd.c
401
if (n == 0) /* connection closed */
usr.sbin/ripd/ripd.c
414
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripd/ripd.c
417
if (n == 0)
usr.sbin/ripd/ripe.c
232
ssize_t n;
usr.sbin/ripd/ripe.c
236
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripd/ripe.c
238
if (n == 0) /* connection closed */
usr.sbin/ripd/ripe.c
251
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripd/ripe.c
253
if (n == 0)
usr.sbin/ripd/ripe.c
313
ssize_t n;
usr.sbin/ripd/ripe.c
317
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ripd/ripe.c
319
if (n == 0) /* connection closed */
usr.sbin/ripd/ripe.c
332
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ripd/ripe.c
334
if (n == 0)
usr.sbin/rmt/rmt.c
220
n = atoi(count);
usr.sbin/rmt/rmt.c
222
record = checkbuf(record, n);
usr.sbin/rmt/rmt.c
223
for (i = 0; i < n; i += cc) {
usr.sbin/rmt/rmt.c
224
cc = read(STDIN_FILENO, &record[i], n - i);
usr.sbin/rmt/rmt.c
230
rval = write(tape, record, n);
usr.sbin/rmt/rmt.c
238
n = atoi(count);
usr.sbin/rmt/rmt.c
239
record = checkbuf(record, n);
usr.sbin/rmt/rmt.c
240
rval = read(tape, record, n);
usr.sbin/rmt/rmt.c
78
int n, i, cc;
usr.sbin/route6d/route6d.c
272
#define FLAG(c, flag, n) case c: do { flag = n; break; } while(0)
usr.sbin/route6d/route6d.c
3082
plen2mask(int n)
usr.sbin/route6d/route6d.c
3093
for (i = 0; i < 16; i++, p++, n -= 8) {
usr.sbin/route6d/route6d.c
3094
if (n >= 8) {
usr.sbin/route6d/route6d.c
3098
*p = pl2m[n];
usr.sbin/route6d/route6d.c
3201
int n;
usr.sbin/route6d/route6d.c
3212
n = nindex2ifc;
usr.sbin/route6d/route6d.c
3215
if (n != nindex2ifc) {
usr.sbin/route6d/route6d.c
3221
memset(p + n, 0, (nindex2ifc - n) * sizeof(*index2ifc));
usr.sbin/route6d/route6d.c
600
#define RIPSIZE(n) \
usr.sbin/route6d/route6d.c
601
(sizeof(struct rip6) + ((n)-1) * sizeof(struct netinfo6))
usr.sbin/route6d/route6d.c
75
#define ADVANCE(x, n) (x += ROUNDUP((n)->sa_len))
usr.sbin/rpc.statd/statd.c
589
die(int n)
usr.sbin/rpc.statd/statd.c
592
exit(n);
usr.sbin/rpki-client/constraints.c
343
ssize_t n;
usr.sbin/rpki-client/constraints.c
369
while ((n = getline(&line, &len, f)) != -1) {
usr.sbin/rpki-client/constraints.c
370
if (line[n - 1] == '\n')
usr.sbin/rpki-client/constraints.c
371
line[n - 1] = '\0';
usr.sbin/rpki-client/encoding.c
41
ssize_t n;
usr.sbin/rpki-client/encoding.c
58
n = read(fd, buf, size);
usr.sbin/rpki-client/encoding.c
59
if (n == -1)
usr.sbin/rpki-client/encoding.c
61
if ((size_t)n != size) {
usr.sbin/rpki-client/parser.c
1032
int error, n;
usr.sbin/rpki-client/parser.c
1050
n = 0;
usr.sbin/rpki-client/parser.c
1054
if (++n > 16)
usr.sbin/rpki-client/parser.c
1057
if (n > 16) {
usr.sbin/rpki-client/repo.c
678
ssize_t n;
usr.sbin/rpki-client/repo.c
703
while ((n = getline(&line, &len, f)) != -1) {
usr.sbin/rpki-client/repo.c
704
if (line[n - 1] == '\n')
usr.sbin/rpki-client/repo.c
705
line[n - 1] = '\0';
usr.sbin/rpki-client/rrdp_notification.c
74
struct delta_item *d, *n;
usr.sbin/rpki-client/rrdp_notification.c
84
n = TAILQ_LAST(&nxml->delta_q, delta_q);
usr.sbin/rpki-client/rrdp_notification.c
85
if (n == NULL)
usr.sbin/rpki-client/rrdp_notification.c
87
else if (n->serial < serial)
usr.sbin/rpki-client/rrdp_notification.c
90
TAILQ_FOREACH(n, &nxml->delta_q, q) {
usr.sbin/rpki-client/rrdp_notification.c
91
if (n->serial == serial) {
usr.sbin/rpki-client/rrdp_notification.c
96
if (n->serial > serial) {
usr.sbin/rpki-client/rrdp_notification.c
97
TAILQ_INSERT_BEFORE(n, d, q);
usr.sbin/rpki-client/validate.c
529
int n = 0;
usr.sbin/rpki-client/validate.c
532
switch (n) {
usr.sbin/rpki-client/validate.c
537
if (s[n] != '-')
usr.sbin/rpki-client/validate.c
542
if (s[n] != '4')
usr.sbin/rpki-client/validate.c
547
if (s[n] != '8' && s[n] != '9' && s[n] != 'a' &&
usr.sbin/rpki-client/validate.c
548
s[n] != 'A' && s[n] != 'b' && s[n] != 'B')
usr.sbin/rpki-client/validate.c
552
return s[n] == '\0';
usr.sbin/rpki-client/validate.c
554
if (!isxdigit((unsigned char)s[n]))
usr.sbin/rpki-client/validate.c
558
n++;
usr.sbin/sasyncd/monitor.c
540
ssize_t n;
usr.sbin/sasyncd/monitor.c
545
switch (n = write(sock, ptr + pos, len - pos)) {
usr.sbin/sasyncd/monitor.c
551
return n;
usr.sbin/sasyncd/monitor.c
554
pos += n;
usr.sbin/sasyncd/monitor.c
563
ssize_t n;
usr.sbin/sasyncd/monitor.c
568
switch (n = read(sock, ptr + pos, len - pos)) {
usr.sbin/sasyncd/monitor.c
574
return n;
usr.sbin/sasyncd/monitor.c
577
pos += n;
usr.sbin/sasyncd/pfkey.c
76
ssize_t n;
usr.sbin/sasyncd/pfkey.c
82
n = write(cfgstate.pfkey_socket, buf, len);
usr.sbin/sasyncd/pfkey.c
83
} while (n == -1 && (errno == EAGAIN || errno == EINTR));
usr.sbin/sasyncd/pfkey.c
84
if (n == -1) {
usr.sbin/sasyncd/sasyncd.c
108
n = pselect(maxfd, rfds, wfds, NULL, timeout, NULL);
usr.sbin/sasyncd/sasyncd.c
109
if (n == -1) {
usr.sbin/sasyncd/sasyncd.c
114
} else if (n) {
usr.sbin/sasyncd/sasyncd.c
62
int maxfd, n;
usr.sbin/sasyncd/sasyncd.c
64
n = getdtablesize();
usr.sbin/sasyncd/sasyncd.c
65
fdsetsize = howmany(n, NFDBITS) * sizeof(fd_mask);
usr.sbin/sasyncd/sasyncd.c
92
n = net_set_pending_wfds(wfds);
usr.sbin/sasyncd/sasyncd.c
93
if (n > maxfd)
usr.sbin/sasyncd/sasyncd.c
94
maxfd = n;
usr.sbin/sensorsd/sensorsd.c
512
int i = 0, n = 0, r;
usr.sbin/sensorsd/sensorsd.c
518
for (i = n = 0; n < len; ++i) {
usr.sbin/sensorsd/sensorsd.c
520
buf[n++] = '\0';
usr.sbin/sensorsd/sensorsd.c
524
buf[n++] = limit->command[i];
usr.sbin/sensorsd/sensorsd.c
529
buf[n++] = '\0';
usr.sbin/sensorsd/sensorsd.c
535
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
539
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
543
r = snprintf(&buf[n], len - n, "%d",
usr.sbin/sensorsd/sensorsd.c
566
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
589
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
594
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
599
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
604
r = snprintf(&buf[n], len - n, "%s",
usr.sbin/sensorsd/sensorsd.c
609
r = snprintf(&buf[n], len - n, "%%%c",
usr.sbin/sensorsd/sensorsd.c
613
if (r == -1 || (r >= len - n)) {
usr.sbin/sensorsd/sensorsd.c
619
n += r;
usr.sbin/slaacctl/slaacctl.c
144
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/slaacctl/slaacctl.c
146
if (n == 0)
usr.sbin/slaacctl/slaacctl.c
150
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/slaacctl/slaacctl.c
152
if (n == 0)
usr.sbin/slaacctl/slaacctl.c
72
int n, verbose = 0;
usr.sbin/slowcgi/slowcgi.c
1025
ssize_t n;
usr.sbin/slowcgi/slowcgi.c
1038
n = read(fd, resp->data + sizeof(struct fcgi_record_header),
usr.sbin/slowcgi/slowcgi.c
1041
if (n == -1) {
usr.sbin/slowcgi/slowcgi.c
1048
n = 0; /* fake empty FCGI_STD{OUT,ERR} response */
usr.sbin/slowcgi/slowcgi.c
1051
header->content_len = htons(n);
usr.sbin/slowcgi/slowcgi.c
1053
resp->data_len = n + sizeof(struct fcgi_record_header);
usr.sbin/slowcgi/slowcgi.c
1056
if (n == 0) {
usr.sbin/slowcgi/slowcgi.c
1094
ssize_t n;
usr.sbin/slowcgi/slowcgi.c
1104
n = write(fd, node->data + node->data_pos, node->data_len);
usr.sbin/slowcgi/slowcgi.c
1105
if (n == -1) {
usr.sbin/slowcgi/slowcgi.c
1111
node->data_pos += n;
usr.sbin/slowcgi/slowcgi.c
1112
node->data_len -= n;
usr.sbin/slowcgi/slowcgi.c
52
#define FCGI_ALIGN(n) \
usr.sbin/slowcgi/slowcgi.c
53
(((n) + (FCGI_ALIGNMENT - 1)) & ~(FCGI_ALIGNMENT - 1))
usr.sbin/slowcgi/slowcgi.c
590
ssize_t n;
usr.sbin/slowcgi/slowcgi.c
599
n = write(fd, resp->data + resp->data_pos, resp->data_len);
usr.sbin/slowcgi/slowcgi.c
600
if (n == -1) {
usr.sbin/slowcgi/slowcgi.c
606
resp->data_pos += n;
usr.sbin/slowcgi/slowcgi.c
607
resp->data_len -= n;
usr.sbin/slowcgi/slowcgi.c
627
ssize_t n;
usr.sbin/slowcgi/slowcgi.c
632
n = read(fd, c->buf + c->buf_pos + c->buf_len,
usr.sbin/slowcgi/slowcgi.c
635
switch (n) {
usr.sbin/slowcgi/slowcgi.c
653
c->buf_len += n;
usr.sbin/slowcgi/slowcgi.c
678
parse_begin_request(uint8_t *buf, uint16_t n, struct request *c, uint16_t id)
usr.sbin/slowcgi/slowcgi.c
686
if (n != sizeof(struct fcgi_begin_request_body)) {
usr.sbin/slowcgi/slowcgi.c
687
lwarnx("wrong size %d != %lu", n,
usr.sbin/slowcgi/slowcgi.c
700
parse_params(uint8_t *buf, uint16_t n, struct request *c, uint16_t id)
usr.sbin/slowcgi/slowcgi.c
719
if (n == 0) {
usr.sbin/slowcgi/slowcgi.c
724
while (n > 0) {
usr.sbin/slowcgi/slowcgi.c
727
n--;
usr.sbin/slowcgi/slowcgi.c
730
if (n > 3) {
usr.sbin/slowcgi/slowcgi.c
733
n -= 4;
usr.sbin/slowcgi/slowcgi.c
739
if (n > 0) {
usr.sbin/slowcgi/slowcgi.c
742
n--;
usr.sbin/slowcgi/slowcgi.c
745
if (n > 3) {
usr.sbin/slowcgi/slowcgi.c
749
n -= 4;
usr.sbin/slowcgi/slowcgi.c
757
if (n < name_len + val_len)
usr.sbin/slowcgi/slowcgi.c
774
n -= name_len;
usr.sbin/slowcgi/slowcgi.c
790
n -= val_len;
usr.sbin/slowcgi/slowcgi.c
799
parse_stdin(uint8_t *buf, uint16_t n, struct request *c, uint16_t id)
usr.sbin/slowcgi/slowcgi.c
813
bcopy(buf, node->data, n);
usr.sbin/slowcgi/slowcgi.c
815
node->data_len = n;
usr.sbin/slowcgi/slowcgi.c
824
parse_record(uint8_t *buf, size_t n, struct request *c)
usr.sbin/slowcgi/slowcgi.c
828
if (n < sizeof(struct fcgi_record_header))
usr.sbin/slowcgi/slowcgi.c
836
if (n < sizeof(struct fcgi_record_header) + ntohs(h->content_len)
usr.sbin/smtpd/bounce.c
405
size_t n, sz = 0;
usr.sbin/smtpd/bounce.c
537
n = io_queued(s->io);
usr.sbin/smtpd/bounce.c
573
s, io_queued(s->io) - n);
usr.sbin/smtpd/bounce.c
601
size_t n;
usr.sbin/smtpd/bounce.c
604
n = 0;
usr.sbin/smtpd/bounce.c
626
n += 1;
usr.sbin/smtpd/bounce.c
640
f, msg->msgid, msg->to, n, n > 1 ? "s":"", status);
usr.sbin/smtpd/bounce.c
644
stat_decrement("bounce.envelope", n);
usr.sbin/smtpd/ca.c
300
int n, done = 0;
usr.sbin/smtpd/ca.c
326
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/smtpd/ca.c
328
if (n == 0)
usr.sbin/smtpd/ca.c
332
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/smtpd/ca.c
334
if (n == 0)
usr.sbin/smtpd/ca.c
409
int n, done = 0;
usr.sbin/smtpd/ca.c
434
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/smtpd/ca.c
436
if (n == 0)
usr.sbin/smtpd/ca.c
439
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/smtpd/ca.c
441
if (n == 0)
usr.sbin/smtpd/enqueue.c
445
get_responses(FILE *fin, int n)
usr.sbin/smtpd/enqueue.c
458
while (n) {
usr.sbin/smtpd/enqueue.c
487
n--;
usr.sbin/smtpd/enqueue.c
754
int n;
usr.sbin/smtpd/enqueue.c
756
n = 1;
usr.sbin/smtpd/enqueue.c
759
n++;
usr.sbin/smtpd/enqueue.c
764
msg.rcpt_cnt + n, sizeof(char *))) == NULL)
usr.sbin/smtpd/enqueue.c
768
while (n--) {
usr.sbin/smtpd/enqueue.c
783
int n;
usr.sbin/smtpd/enqueue.c
791
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/smtpd/enqueue.c
793
if (n == 0)
usr.sbin/smtpd/enqueue.c
796
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/smtpd/enqueue.c
798
if (n == 0)
usr.sbin/smtpd/iobuf.c
100
iobuf_extend(struct iobuf *io, size_t n)
usr.sbin/smtpd/iobuf.c
104
if (n > io->max)
usr.sbin/smtpd/iobuf.c
107
if (io->max - io->size < n)
usr.sbin/smtpd/iobuf.c
110
t = recallocarray(io->buf, io->size, io->size + n, 1);
usr.sbin/smtpd/iobuf.c
114
io->size += n;
usr.sbin/smtpd/iobuf.c
145
iobuf_drop(struct iobuf *io, size_t n)
usr.sbin/smtpd/iobuf.c
147
if (n >= iobuf_len(io)) {
usr.sbin/smtpd/iobuf.c
152
io->rpos += n;
usr.sbin/smtpd/iobuf.c
202
ssize_t n;
usr.sbin/smtpd/iobuf.c
204
n = read(fd, io->buf + io->wpos, iobuf_left(io));
usr.sbin/smtpd/iobuf.c
205
if (n == -1) {
usr.sbin/smtpd/iobuf.c
211
if (n == 0)
usr.sbin/smtpd/iobuf.c
214
io->wpos += n;
usr.sbin/smtpd/iobuf.c
216
return (n);
usr.sbin/smtpd/iobuf.c
348
ssize_t n;
usr.sbin/smtpd/iobuf.c
359
n = writev(fd, iov, i);
usr.sbin/smtpd/iobuf.c
360
if (n == -1) {
usr.sbin/smtpd/iobuf.c
368
iobuf_drain(io, n);
usr.sbin/smtpd/iobuf.c
370
return (n);
usr.sbin/smtpd/iobuf.c
403
ssize_t n;
usr.sbin/smtpd/iobuf.c
407
n = tls_write(tls, q->buf + q->rpos, q->wpos - q->rpos);
usr.sbin/smtpd/iobuf.c
408
if (n == TLS_WANT_POLLIN)
usr.sbin/smtpd/iobuf.c
410
else if (n == TLS_WANT_POLLOUT)
usr.sbin/smtpd/iobuf.c
412
else if (n == 0)
usr.sbin/smtpd/iobuf.c
414
else if (n == -1)
usr.sbin/smtpd/iobuf.c
417
iobuf_drain(io, n);
usr.sbin/smtpd/iobuf.c
419
return (n);
usr.sbin/smtpd/iobuf.c
425
ssize_t n;
usr.sbin/smtpd/iobuf.c
427
n = tls_read(tls, io->buf + io->wpos, iobuf_left(io));
usr.sbin/smtpd/iobuf.c
428
if (n == TLS_WANT_POLLIN)
usr.sbin/smtpd/iobuf.c
430
else if (n == TLS_WANT_POLLOUT)
usr.sbin/smtpd/iobuf.c
432
else if (n == 0)
usr.sbin/smtpd/iobuf.c
434
else if (n == -1)
usr.sbin/smtpd/iobuf.c
437
io->wpos += n;
usr.sbin/smtpd/iobuf.c
439
return (n);
usr.sbin/smtpd/iobuf.c
78
iobuf_drain(struct iobuf *io, size_t n)
usr.sbin/smtpd/iobuf.c
81
size_t left = n;
usr.sbin/smtpd/iobuf.c
94
io->queued -= (n - left);
usr.sbin/smtpd/ioev.c
623
int n;
usr.sbin/smtpd/ioev.c
625
n = 0;
usr.sbin/smtpd/ioev.c
636
n++;
usr.sbin/smtpd/ioev.c
640
if (n)
usr.sbin/smtpd/ioev.c
644
n++;
usr.sbin/smtpd/ioev.c
648
if (n)
usr.sbin/smtpd/ioev.c
652
n++;
usr.sbin/smtpd/ioev.c
656
if (n)
usr.sbin/smtpd/ioev.c
660
n++;
usr.sbin/smtpd/ioev.c
664
if (n)
usr.sbin/smtpd/ioev.c
679
ssize_t n;
usr.sbin/smtpd/ioev.c
690
if ((n = iobuf_write(&io->iobuf, io->sock)) < 0) {
usr.sbin/smtpd/ioev.c
691
if (n == IOBUF_WANT_WRITE) /* kqueue bug? */
usr.sbin/smtpd/ioev.c
693
if (n == IOBUF_CLOSED)
usr.sbin/smtpd/ioev.c
703
if (w > io->lowat && w - n <= io->lowat)
usr.sbin/smtpd/ioev.c
710
if ((n = iobuf_read(&io->iobuf, io->sock)) < 0) {
usr.sbin/smtpd/ioev.c
711
if (n == IOBUF_CLOSED)
usr.sbin/smtpd/ioev.c
721
if (n)
usr.sbin/smtpd/ioev.c
887
int n;
usr.sbin/smtpd/ioev.c
898
switch ((n = iobuf_read_tls(&io->iobuf, io->tls))) {
usr.sbin/smtpd/ioev.c
913
io_debug("io_dispatch_read_tls(...) -> r=%d\n", n);
usr.sbin/smtpd/ioev.c
927
int n;
usr.sbin/smtpd/ioev.c
938
switch ((n = iobuf_write_tls(&io->iobuf, io->tls))) {
usr.sbin/smtpd/ioev.c
953
io_debug("io_dispatch_write_tls(...) -> w=%d\n", n);
usr.sbin/smtpd/lka_filter.c
939
int n;
usr.sbin/smtpd/lka_filter.c
947
n = io_printf(lka_proc_get_io(filter->proc),
usr.sbin/smtpd/lka_filter.c
953
n = io_printf(lka_proc_get_io(filter->proc),
usr.sbin/smtpd/lka_filter.c
958
if (n == -1)
usr.sbin/smtpd/lka_filter.c
965
int n;
usr.sbin/smtpd/lka_filter.c
970
n = io_printf(lka_proc_get_io(filter->proc),
usr.sbin/smtpd/lka_filter.c
976
if (n == -1)
usr.sbin/smtpd/mail.lmtp.c
125
int n, s = -1, save_errno;
usr.sbin/smtpd/mail.lmtp.c
163
n = getaddrinfo(hostname, servname, &hints, &res0);
usr.sbin/smtpd/mail.lmtp.c
164
if (n)
usr.sbin/smtpd/mail.lmtp.c
165
errx(EX_TEMPFAIL, "inet: %s", gai_strerror(n));
usr.sbin/smtpd/mda.c
116
int n, fd;
usr.sbin/smtpd/mda.c
239
n = io_printf(s->io,
usr.sbin/smtpd/mda.c
245
n = io_printf(s->io,
usr.sbin/smtpd/mda.c
248
if (n == -1) {
usr.sbin/smtpd/mproc.c
137
ssize_t n;
usr.sbin/smtpd/mproc.c
143
n = imsgbuf_read(&p->imsgbuf);
usr.sbin/smtpd/mproc.c
145
switch (n) {
usr.sbin/smtpd/mproc.c
181
if ((n = imsg_get(&p->imsgbuf, &imsg)) == -1) {
usr.sbin/smtpd/mproc.c
194
if (n == 0)
usr.sbin/smtpd/mproc.c
242
int fd, const struct iovec *iov, int n)
usr.sbin/smtpd/mproc.c
247
imsg_composev(&p->imsgbuf, type, peerid, pid, fd, iov, n);
usr.sbin/smtpd/mproc.c
250
for (i = 0; i < n; i++)
usr.sbin/smtpd/mta.c
1534
size_t n, r;
usr.sbin/smtpd/mta.c
1542
n = 0;
usr.sbin/smtpd/mta.c
1569
n++;
usr.sbin/smtpd/mta.c
1576
stat_decrement("mta.envelope", n);
usr.sbin/smtpd/mta.c
2008
#define SHOWSTATUS(f, n) do { \
usr.sbin/smtpd/mta.c
2012
(void)strlcat(flags, (n), sizeof(flags)); \
usr.sbin/smtpd/mta.c
2050
#define SHOWFLAG(f, n) do { \
usr.sbin/smtpd/mta.c
2054
(void)strlcat(flags, (n), sizeof(flags)); \
usr.sbin/smtpd/mta_session.c
1467
size_t n;
usr.sbin/smtpd/mta_session.c
1474
n = 0;
usr.sbin/smtpd/mta_session.c
1477
if (count && n == count) {
usr.sbin/smtpd/mta_session.c
1478
stat_decrement("mta.envelope", n);
usr.sbin/smtpd/mta_session.c
1511
n++;
usr.sbin/smtpd/mta_session.c
1523
stat_decrement("mta.envelope", n);
usr.sbin/smtpd/parser.c
116
return (n);
usr.sbin/smtpd/parser.c
59
int i, n;
usr.sbin/smtpd/parser.c
65
n = 0;
usr.sbin/smtpd/parser.c
66
for (ap = argv; n < ARGVMAX && (*ap = strsep(&str, " \t")) != NULL;) {
usr.sbin/smtpd/parser.c
69
n++;
usr.sbin/smtpd/parser.c
80
for (i = 0; i < n; i++) {
usr.sbin/smtpd/queue_fs.c
203
int queued = 0, i, r = 0, *n;
usr.sbin/smtpd/queue_fs.c
231
n = tree_pop(&evpcount, msgid);
usr.sbin/smtpd/queue_fs.c
232
if (n == NULL)
usr.sbin/smtpd/queue_fs.c
233
n = REF;
usr.sbin/smtpd/queue_fs.c
234
n += 1;
usr.sbin/smtpd/queue_fs.c
235
tree_xset(&evpcount, msgid, n);
usr.sbin/smtpd/queue_fs.c
285
int *n;
usr.sbin/smtpd/queue_fs.c
293
n = tree_pop(&evpcount, msgid);
usr.sbin/smtpd/queue_fs.c
294
n -= 1;
usr.sbin/smtpd/queue_fs.c
296
if (n - REF == 0)
usr.sbin/smtpd/queue_fs.c
299
tree_xset(&evpcount, msgid, n);
usr.sbin/smtpd/queue_fs.c
313
int r, *n;
usr.sbin/smtpd/queue_fs.c
352
n = tree_pop(&evpcount, msgid);
usr.sbin/smtpd/queue_fs.c
353
if (n == NULL)
usr.sbin/smtpd/queue_fs.c
354
n = REF;
usr.sbin/smtpd/queue_fs.c
356
n += 1;
usr.sbin/smtpd/queue_fs.c
357
tree_xset(&evpcount, msgid, n);
usr.sbin/smtpd/queue_fs.c
373
int r, *n;
usr.sbin/smtpd/queue_fs.c
387
n = tree_pop(&evpcount, msgid);
usr.sbin/smtpd/queue_fs.c
388
if (n == NULL)
usr.sbin/smtpd/queue_fs.c
389
n = REF;
usr.sbin/smtpd/queue_fs.c
390
n += 1;
usr.sbin/smtpd/queue_fs.c
391
tree_xset(&evpcount, msgid, n);
usr.sbin/smtpd/queue_fs.c
631
unsigned int n;
usr.sbin/smtpd/queue_fs.c
643
for (n = 0; n < nitems(paths); n++) {
usr.sbin/smtpd/queue_fs.c
645
if (strlcat(path, paths[n], sizeof(path)) >= sizeof(path))
usr.sbin/smtpd/queue_fs.c
646
fatalx("path too long %s%s", PATH_SPOOL, paths[n]);
usr.sbin/smtpd/queue_proc.c
34
ssize_t n;
usr.sbin/smtpd/queue_proc.c
42
if ((n = imsg_get(&ibuf, &imsg)) == -1) {
usr.sbin/smtpd/queue_proc.c
46
if (n) {
usr.sbin/smtpd/queue_proc.c
57
if ((n = imsgbuf_read(&ibuf)) == -1) {
usr.sbin/smtpd/queue_proc.c
62
if (n == 0) {
usr.sbin/smtpd/queue_ram.c
108
n = fread(msg->buf, 1, msg->len, f);
usr.sbin/smtpd/queue_ram.c
111
else if ((off_t)n != sb.st_size)
usr.sbin/smtpd/queue_ram.c
148
size_t n;
usr.sbin/smtpd/queue_ram.c
176
n = fwrite(msg->buf, 1, msg->len, f);
usr.sbin/smtpd/queue_ram.c
177
if (n != msg->len) {
usr.sbin/smtpd/queue_ram.c
79
size_t n;
usr.sbin/smtpd/scheduler.c
116
n = backend->commit(msgid);
usr.sbin/smtpd/scheduler.c
117
stat_decrement("scheduler.envelope.incoming", n);
usr.sbin/smtpd/scheduler.c
118
stat_increment("scheduler.envelope", n);
usr.sbin/smtpd/scheduler.c
128
n = backend->rollback(msgid);
usr.sbin/smtpd/scheduler.c
129
stat_decrement("scheduler.envelope.incoming", n);
usr.sbin/smtpd/scheduler.c
303
n = backend->messages(msgid, msgids, env->sc_scheduler_max_msg_batch_size);
usr.sbin/smtpd/scheduler.c
305
msgids, n * sizeof (*msgids));
usr.sbin/smtpd/scheduler.c
310
n = backend->envelopes(id, state, env->sc_scheduler_max_evp_batch_size);
usr.sbin/smtpd/scheduler.c
311
for (i = 0; i < n; i++) {
usr.sbin/smtpd/scheduler.c
55
size_t n, i;
usr.sbin/smtpd/scheduler.c
81
n = backend->commit(msgid);
usr.sbin/smtpd/scheduler.c
82
stat_decrement("scheduler.envelope.incoming", n);
usr.sbin/smtpd/scheduler.c
83
stat_increment("scheduler.envelope", n);
usr.sbin/smtpd/scheduler_null.c
102
scheduler_null_release(int type, uint64_t holdq, int n)
usr.sbin/smtpd/scheduler_proc.c
233
scheduler_proc_release(int type, uint64_t holdq, int n)
usr.sbin/smtpd/scheduler_proc.c
241
sizeof(holdq) + sizeof(n));
usr.sbin/smtpd/scheduler_proc.c
248
if (imsg_add(buf, &n, sizeof(n)) == -1)
usr.sbin/smtpd/scheduler_proc.c
33
ssize_t n;
usr.sbin/smtpd/scheduler_proc.c
41
if ((n = imsg_get(&ibuf, &imsg)) == -1) {
usr.sbin/smtpd/scheduler_proc.c
45
if (n) {
usr.sbin/smtpd/scheduler_proc.c
56
if ((n = imsgbuf_read(&ibuf)) == -1) {
usr.sbin/smtpd/scheduler_proc.c
61
if (n == 0) {
usr.sbin/smtpd/scheduler_ramqueue.c
414
scheduler_ram_release(int type, uint64_t holdq, int n)
usr.sbin/smtpd/scheduler_ramqueue.c
426
if (n == -1) {
usr.sbin/smtpd/scheduler_ramqueue.c
427
n = 0;
usr.sbin/smtpd/scheduler_ramqueue.c
433
for (i = 0; n == 0 || i < n; i++) {
usr.sbin/smtpd/scheduler_ramqueue.c
466
size_t i, n;
usr.sbin/smtpd/scheduler_ramqueue.c
476
n = 0;
usr.sbin/smtpd/scheduler_ramqueue.c
562
if (i == n)
usr.sbin/smtpd/scheduler_ramqueue.c
565
n = i;
usr.sbin/smtpd/scheduler_ramqueue.c
590
size_t n;
usr.sbin/smtpd/scheduler_ramqueue.c
593
for (n = 0, i = NULL; n < size; n++) {
usr.sbin/smtpd/scheduler_ramqueue.c
596
dst[n] = id;
usr.sbin/smtpd/scheduler_ramqueue.c
599
return (n);
usr.sbin/smtpd/scheduler_ramqueue.c
608
size_t n;
usr.sbin/smtpd/scheduler_ramqueue.c
613
for (n = 0, i = NULL; n < size; ) {
usr.sbin/smtpd/scheduler_ramqueue.c
622
dst[n].evpid = evp->evpid;
usr.sbin/smtpd/scheduler_ramqueue.c
623
dst[n].flags = 0;
usr.sbin/smtpd/scheduler_ramqueue.c
624
dst[n].retry = 0;
usr.sbin/smtpd/scheduler_ramqueue.c
625
dst[n].time = 0;
usr.sbin/smtpd/scheduler_ramqueue.c
628
dst[n].time = evp->sched;
usr.sbin/smtpd/scheduler_ramqueue.c
629
dst[n].flags = EF_PENDING;
usr.sbin/smtpd/scheduler_ramqueue.c
632
dst[n].time = evp->t_scheduled;
usr.sbin/smtpd/scheduler_ramqueue.c
633
dst[n].flags = EF_PENDING;
usr.sbin/smtpd/scheduler_ramqueue.c
636
dst[n].time = evp->t_inflight;
usr.sbin/smtpd/scheduler_ramqueue.c
637
dst[n].flags = EF_INFLIGHT;
usr.sbin/smtpd/scheduler_ramqueue.c
641
dst[n].time = evp->t_scheduled;
usr.sbin/smtpd/scheduler_ramqueue.c
642
dst[n].flags = EF_PENDING;
usr.sbin/smtpd/scheduler_ramqueue.c
643
dst[n].flags |= EF_HOLD;
usr.sbin/smtpd/scheduler_ramqueue.c
646
dst[n].flags |= EF_SUSPEND;
usr.sbin/smtpd/scheduler_ramqueue.c
648
n++;
usr.sbin/smtpd/scheduler_ramqueue.c
651
return (n);
usr.sbin/smtpd/scheduler_ramqueue.c
878
size_t n;
usr.sbin/smtpd/scheduler_ramqueue.c
880
n = 0;
usr.sbin/smtpd/scheduler_ramqueue.c
885
if (n == SCHEDULEMAX)
usr.sbin/smtpd/scheduler_ramqueue.c
902
n += 1;
usr.sbin/smtpd/smtp_client.c
259
size_t n;
usr.sbin/smtpd/smtp_client.c
332
n = strlcat(ibuf, proto->params.auth_pass, sizeof(ibuf));
usr.sbin/smtpd/smtp_client.c
333
if (n >= sizeof(ibuf)) {
usr.sbin/smtpd/smtp_client.c
341
if (base64_encode(ibuf, n, obuf, sizeof(obuf)) == -1) {
usr.sbin/smtpd/smtp_client.c
834
int n;
usr.sbin/smtpd/smtp_client.c
844
n = io_printf(proto->io, "%s%s\r\n", *ln == '.'?".":"", ln);
usr.sbin/smtpd/smtp_client.c
845
if (n == -1) {
usr.sbin/smtpd/smtp_client.c
850
total += n;
usr.sbin/smtpd/smtp_client.c
851
w += n;
usr.sbin/smtpd/smtp_session.c
2099
int n;
usr.sbin/smtpd/smtp_session.c
2103
n = vsnprintf(buf, sizeof buf, fmt, ap);
usr.sbin/smtpd/smtp_session.c
2105
if (n < 0)
usr.sbin/smtpd/smtp_session.c
2107
if (n < 4)
usr.sbin/smtpd/smtp_session.c
2109
if (n >= (int)sizeof buf) {
usr.sbin/smtpd/smtp_session.c
2156
s->id, n, buf);
usr.sbin/smtpd/smtp_session.c
2162
s->id, n, buf);
usr.sbin/smtpd/smtp_session.c
2168
s->id, n, buf);
usr.sbin/smtpd/smtp_session.c
2174
s->id, n, buf);
usr.sbin/smtpd/smtp_session.c
2181
s->id, tmp, n, buf);
usr.sbin/smtpd/smtpctl.c
178
ssize_t n;
usr.sbin/smtpd/smtpctl.c
183
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/smtpd/smtpctl.c
185
if (n) {
usr.sbin/smtpd/smtpctl.c
197
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/smtpd/smtpctl.c
199
if (n == 0)
usr.sbin/smtpd/smtpctl.c
314
static size_t n, curr;
usr.sbin/smtpd/smtpctl.c
329
n = rlen / sizeof(*msgids);
usr.sbin/smtpd/smtpctl.c
334
from = msgids[n - 1] + 1;
usr.sbin/smtpd/smtpctl.c
340
if (curr == n) {
usr.sbin/smtpd/smtpctl.c
405
static int n, tmpalloc, alloc = 0;
usr.sbin/smtpd/smtpctl.c
409
n = 0;
usr.sbin/smtpd/smtpctl.c
411
if (n == alloc) {
usr.sbin/smtpd/smtpctl.c
420
evpids[n++] = evp.id;
usr.sbin/smtpd/smtpctl.c
424
if (*offset >= n)
usr.sbin/smtpd/smtpd.c
1008
ssize_t n;
usr.sbin/smtpd/smtpd.c
1014
if ((n = imsg_get(ibuf, imsg)) == -1)
usr.sbin/smtpd/smtpd.c
1016
if (n)
usr.sbin/smtpd/smtpd.c
1019
n = poll(pfd, 1, timeout);
usr.sbin/smtpd/smtpd.c
1020
if (n == -1)
usr.sbin/smtpd/smtpd.c
1022
if (n == 0) {
usr.sbin/smtpd/smtpd.c
156
int fd, n, v, ret;
usr.sbin/smtpd/smtpd.c
1564
int n = 0;
usr.sbin/smtpd/smtpd.c
1603
if ((n++) == OFFLINE_READMAX) {
usr.sbin/smtpd/smtpd.c
223
while ((n = tree_iter(&children, &i, NULL, (void**)&c)))
usr.sbin/smtpd/smtpd.c
228
if (!n) {
usr.sbin/smtpd/spfwalk.c
173
ssize_t n;
usr.sbin/smtpd/spfwalk.c
177
n = parse_txt(rr->rr.other.rdata, rr->rr.other.rdlen, buf, sizeof(buf));
usr.sbin/smtpd/spfwalk.c
178
if (n == -1 || n == sizeof(buf))
usr.sbin/smtpd/spfwalk.c
180
buf[n] = '\0';
usr.sbin/smtpd/table.c
222
size_t n;
usr.sbin/smtpd/table.c
268
n = strlcpy(t->t_name, name, sizeof(t->t_name));
usr.sbin/smtpd/table.c
269
if (n >= sizeof(t->t_name))
usr.sbin/smtpd/unpack_dns.c
147
size_t n, count, end, ptr, start;
usr.sbin/smtpd/unpack_dns.c
157
if (!(n = data[offset]))
usr.sbin/smtpd/unpack_dns.c
160
if ((n & 0xc0) == 0xc0) {
usr.sbin/smtpd/unpack_dns.c
163
ptr = 256 * (n & ~0xc0) + data[offset + 1];
usr.sbin/smtpd/unpack_dns.c
171
if (offset + n + 1 > len)
usr.sbin/smtpd/unpack_dns.c
176
count = (max < n + 1) ? (max) : (n + 1);
usr.sbin/smtpd/unpack_dns.c
181
res += n + 1;
usr.sbin/smtpd/unpack_dns.c
182
offset += n + 1;
usr.sbin/smtpd/util.c
285
size_t n;
usr.sbin/smtpd/util.c
290
if ((n = strlen(to)) == 0)
usr.sbin/smtpd/util.c
293
sep = (to[n - 1] == '/') ? "" : "/";
usr.sbin/snmpd/proc.c
246
unsigned int n)
usr.sbin/snmpd/proc.c
256
dst, n + 1);
usr.sbin/snmpd/proc.c
262
if (pp->pp_pipes[dst][n] != -1) {
usr.sbin/snmpd/proc.c
267
pp->pp_pipes[dst][n] = fd;
usr.sbin/snmpd/proc.c
269
iev = &ps->ps_ievs[dst][n];
usr.sbin/snmpd/proc.c
439
unsigned int dst, n;
usr.sbin/snmpd/proc.c
451
for (n = 0; n < ps->ps_instances[dst]; n++) {
usr.sbin/snmpd/proc.c
452
if (pp->pp_pipes[dst][n] == -1)
usr.sbin/snmpd/proc.c
456
event_del(&(ps->ps_ievs[dst][n].ev));
usr.sbin/snmpd/proc.c
457
imsgbuf_clear(&(ps->ps_ievs[dst][n].ibuf));
usr.sbin/snmpd/proc.c
458
close(pp->pp_pipes[dst][n]);
usr.sbin/snmpd/proc.c
459
pp->pp_pipes[dst][n] = -1;
usr.sbin/snmpd/proc.c
575
ssize_t n;
usr.sbin/snmpd/proc.c
584
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/snmpd/proc.c
586
if (n == 0) {
usr.sbin/snmpd/proc.c
607
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/snmpd/proc.c
609
if (n == 0)
usr.sbin/snmpd/proc.c
708
proc_range(struct privsep *ps, enum privsep_procid id, int *n, int *m)
usr.sbin/snmpd/proc.c
710
if (*n == -1) {
usr.sbin/snmpd/proc.c
712
*n = 0;
usr.sbin/snmpd/proc.c
716
*m = *n + 1;
usr.sbin/snmpd/proc.c
721
proc_compose_imsg(struct privsep *ps, enum privsep_procid id, int n,
usr.sbin/snmpd/proc.c
726
proc_range(ps, id, &n, &m);
usr.sbin/snmpd/proc.c
727
for (; n < m; n++) {
usr.sbin/snmpd/proc.c
728
if (imsg_compose_event(&ps->ps_ievs[id][n],
usr.sbin/snmpd/proc.c
744
proc_composev_imsg(struct privsep *ps, enum privsep_procid id, int n,
usr.sbin/snmpd/proc.c
749
proc_range(ps, id, &n, &m);
usr.sbin/snmpd/proc.c
750
for (; n < m; n++)
usr.sbin/snmpd/proc.c
751
if (imsg_composev_event(&ps->ps_ievs[id][n],
usr.sbin/snmpd/proc.c
766
proc_ibuf(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/snmpd/proc.c
770
proc_range(ps, id, &n, &m);
usr.sbin/snmpd/proc.c
771
return (&ps->ps_ievs[id][n].ibuf);
usr.sbin/snmpd/proc.c
775
proc_iev(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/snmpd/proc.c
779
proc_range(ps, id, &n, &m);
usr.sbin/snmpd/proc.c
780
return (&ps->ps_ievs[id][n]);
usr.sbin/snmpd/proc.c
785
proc_flush_imsg(struct privsep *ps, enum privsep_procid id, int n)
usr.sbin/snmpd/proc.c
790
proc_range(ps, id, &n, &m);
usr.sbin/snmpd/proc.c
791
for (; n < m; n++) {
usr.sbin/snmpd/proc.c
792
if ((ibuf = proc_ibuf(ps, id, n)) == NULL)
usr.sbin/snmpd/proc.c
796
imsg_event_add(&ps->ps_ievs[id][n]);
usr.sbin/snmpd/traphandler.c
252
ssize_t n;
usr.sbin/snmpd/traphandler.c
255
if ((n = IMSG_DATA_SIZE(imsg)) <= 0)
usr.sbin/snmpd/traphandler.c
280
ssize_t n;
usr.sbin/snmpd/traphandler.c
301
n = IMSG_DATA_SIZE(imsg);
usr.sbin/snmpd/traphandler.c
304
n -= sa->sa_len;
usr.sbin/snmpd/traphandler.c
308
ober_set_readbuf(&ber, buf, n);
usr.sbin/snmpd/traphandler.c
330
int n, s[2], status = 0;
usr.sbin/snmpd/traphandler.c
385
n = dprintf(s[0], "%s %s\n", oidbuf, value);
usr.sbin/snmpd/traphandler.c
387
if (n == -1)
usr.sbin/syslogd/evbuffer_tls.c
300
int n = EVBUFFER_MAX_READ;
usr.sbin/syslogd/evbuffer_tls.c
302
if (howmuch < 0 || howmuch > n)
usr.sbin/syslogd/evbuffer_tls.c
303
howmuch = n;
usr.sbin/syslogd/evbuffer_tls.c
312
n = tls_read(ctx, p, howmuch);
usr.sbin/syslogd/evbuffer_tls.c
313
if (n <= 0)
usr.sbin/syslogd/evbuffer_tls.c
314
return (n);
usr.sbin/syslogd/evbuffer_tls.c
316
buf->off += n;
usr.sbin/syslogd/evbuffer_tls.c
322
return (n);
usr.sbin/syslogd/evbuffer_tls.c
328
int n;
usr.sbin/syslogd/evbuffer_tls.c
330
n = tls_write(ctx, buffer->buffer, buffer->off);
usr.sbin/syslogd/evbuffer_tls.c
331
if (n <= 0)
usr.sbin/syslogd/evbuffer_tls.c
332
return (n);
usr.sbin/syslogd/evbuffer_tls.c
333
evbuffer_drain(buffer, n);
usr.sbin/syslogd/evbuffer_tls.c
335
return (n);
usr.sbin/syslogd/parsemsg.c
37
size_t n;
usr.sbin/syslogd/parsemsg.c
44
if ((n = parsemsg_timestamp_bsd(msgstr, msg->m_timestamp)) == 0)
usr.sbin/syslogd/parsemsg.c
45
n = parsemsg_timestamp_v1(msgstr, msg->m_timestamp);
usr.sbin/syslogd/parsemsg.c
46
msgstr += n;
usr.sbin/syslogd/privsep.c
852
may_read(int fd, void *buf, size_t n)
usr.sbin/syslogd/privsep.c
858
while (n > pos) {
usr.sbin/syslogd/privsep.c
859
res = read(fd, s + pos, n - pos);
usr.sbin/syslogd/privsep.c
876
must_read(int fd, void *buf, size_t n)
usr.sbin/syslogd/privsep.c
882
while (n > pos) {
usr.sbin/syslogd/privsep.c
883
res = read(fd, s + pos, n - pos);
usr.sbin/syslogd/privsep.c
899
must_write(int fd, void *buf, size_t n)
usr.sbin/syslogd/privsep.c
905
while (n > pos) {
usr.sbin/syslogd/privsep.c
906
res = write(fd, s + pos, n - pos);
usr.sbin/syslogd/privsep_fdpass.c
105
if ((n = recvmsg(sock, &msg, 0)) == -1) {
usr.sbin/syslogd/privsep_fdpass.c
112
if (n != sizeof(int))
usr.sbin/syslogd/privsep_fdpass.c
114
"receive_fd", (long)n);
usr.sbin/syslogd/privsep_fdpass.c
55
ssize_t n;
usr.sbin/syslogd/privsep_fdpass.c
76
if ((n = sendmsg(sock, &msg, 0)) == -1)
usr.sbin/syslogd/privsep_fdpass.c
78
if (n != sizeof(int))
usr.sbin/syslogd/privsep_fdpass.c
80
"send_fd", (long)n);
usr.sbin/syslogd/privsep_fdpass.c
93
ssize_t n;
usr.sbin/syslogd/ringbuf.c
139
size_t copy_len, n;
usr.sbin/syslogd/ringbuf.c
153
n = rb->len - rb->start;
usr.sbin/syslogd/ringbuf.c
154
memcpy(buf, rb->buf + rb->start, MINIMUM(n, copy_len));
usr.sbin/syslogd/ringbuf.c
155
if (copy_len > n)
usr.sbin/syslogd/ringbuf.c
156
memcpy(buf + n, rb->buf,
usr.sbin/syslogd/ringbuf.c
157
MINIMUM(rb->end, copy_len - n));
usr.sbin/syslogd/syslogd.c
1034
ssize_t n;
usr.sbin/syslogd/syslogd.c
1036
n = read(fd, linebuf, linesize - 1);
usr.sbin/syslogd/syslogd.c
1037
if (n > 0) {
usr.sbin/syslogd/syslogd.c
1038
linebuf[n] = '\0';
usr.sbin/syslogd/syslogd.c
1040
} else if (n == -1 && errno != EINTR) {
usr.sbin/syslogd/syslogd.c
1051
ssize_t n;
usr.sbin/syslogd/syslogd.c
1054
n = recvfrom(fd, linebuf, LOG_MAXLINE, 0, (struct sockaddr *)&sa,
usr.sbin/syslogd/syslogd.c
1056
if (n > 0) {
usr.sbin/syslogd/syslogd.c
1059
linebuf[n] = '\0';
usr.sbin/syslogd/syslogd.c
1063
} else if (n == -1 && errno != EINTR && errno != EWOULDBLOCK)
usr.sbin/syslogd/syslogd.c
1072
ssize_t n;
usr.sbin/syslogd/syslogd.c
1075
n = recvfrom(fd, linebuf, LOG_MAXLINE, 0, (struct sockaddr *)&sa,
usr.sbin/syslogd/syslogd.c
1077
if (n > 0) {
usr.sbin/syslogd/syslogd.c
1078
linebuf[n] = '\0';
usr.sbin/syslogd/syslogd.c
1080
} else if (n == -1 && errno != EINTR && errno != EWOULDBLOCK)
usr.sbin/syslogd/syslogd.c
3319
ssize_t n;
usr.sbin/syslogd/syslogd.c
3330
n = read(fd, (char*)&ctl_cmd + ctl_cmd_bytes,
usr.sbin/syslogd/syslogd.c
3332
switch (n) {
usr.sbin/syslogd/syslogd.c
3344
ctl_cmd_bytes += n;
usr.sbin/syslogd/syslogd.c
3450
ssize_t n;
usr.sbin/syslogd/syslogd.c
3461
n = write(fd, ctl_reply + ctl_reply_offset,
usr.sbin/syslogd/syslogd.c
3463
switch (n) {
usr.sbin/syslogd/syslogd.c
3476
ctl_reply_offset += n;
usr.sbin/tcpdump/addrtoname.c
116
int n;
usr.sbin/tcpdump/addrtoname.c
123
n = 4;
usr.sbin/tcpdump/addrtoname.c
136
} while (--n > 0);
usr.sbin/tcpdump/addrtoname.c
211
size_t n = priv_gethostbyaddr((char *)&addr, sizeof(addr),
usr.sbin/tcpdump/addrtoname.c
213
if (n > 0) {
usr.sbin/tcpdump/addrtoname.c
269
size_t n = priv_gethostbyaddr((char *)&addr, sizeof(addr),
usr.sbin/tcpdump/addrtoname.c
271
if (n > 0) {
usr.sbin/tcpdump/bpf_dump.c
39
int n = p->bf_len;
usr.sbin/tcpdump/bpf_dump.c
43
printf("%d\n", n);
usr.sbin/tcpdump/bpf_dump.c
44
for (i = 0; i < n; ++insn, ++i) {
usr.sbin/tcpdump/bpf_dump.c
51
for (i = 0; i < n; ++insn, ++i)
usr.sbin/tcpdump/bpf_dump.c
56
for (i = 0; i < n; ++insn, ++i) {
usr.sbin/tcpdump/pfctl_osfp.c
145
#define GET_INT(v, mod, n, ty, mx) \
usr.sbin/tcpdump/pfctl_osfp.c
146
get_int(&line, &len, &v, mod, n, ty, mx, fp_filename, lineno)
usr.sbin/tcpdump/pfctl_osfp.c
147
#define GET_STR(v, n, mn) \
usr.sbin/tcpdump/pfctl_osfp.c
148
get_str(&line, &len, &v, n, mn, fp_filename, lineno)
usr.sbin/tcpdump/print-bgp.c
387
int n;
usr.sbin/tcpdump/print-bgp.c
404
n = snprintf(buf, buflen, "%s/%u", getname((u_char *)&addr), plen);
usr.sbin/tcpdump/print-bgp.c
405
if (n < 0 || n >= buflen)
usr.sbin/tcpdump/print-bgp.c
419
int n;
usr.sbin/tcpdump/print-bgp.c
434
n = snprintf(buf, buflen, "%s/%u", getname6((u_char *)&addr), plen);
usr.sbin/tcpdump/print-bgp.c
435
if (n < 0 || n >= buflen)
usr.sbin/tcpdump/print-dhcp6.c
285
char n[NI_MAXHOST];
usr.sbin/tcpdump/print-dhcp6.c
295
if (inet_ntop(AF_INET6, ia, n, sizeof(n)) == NULL) {
usr.sbin/tcpdump/print-dhcp6.c
299
printf("%s, ", n);
usr.sbin/tcpdump/print-dhcp6.c
496
char n[NI_MAXHOST];
usr.sbin/tcpdump/print-dhcp6.c
507
if (inet_ntop(AF_INET6, ia, n, sizeof(n)) == NULL) {
usr.sbin/tcpdump/print-dhcp6.c
512
printf("%s", n);
usr.sbin/tcpdump/print-dhcp6.c
527
char n[NI_MAXHOST];
usr.sbin/tcpdump/print-dhcp6.c
575
if (inet_ntop(AF_INET6, &ia, n, sizeof(n)) == NULL) {
usr.sbin/tcpdump/print-dhcp6.c
580
printf("prefix %s/%u", n, plen);
usr.sbin/tcpdump/print-isoclns.c
300
int n;
usr.sbin/tcpdump/print-isoclns.c
305
n = toff - p + 1;
usr.sbin/tcpdump/print-isoclns.c
322
c1 = (((c0 * (len - n)) - c1) % 255);
usr.sbin/tcpdump/print-lldp.c
300
int n, type, vlen;
usr.sbin/tcpdump/print-lldp.c
304
for (n = 0; n < len;) {
usr.sbin/tcpdump/print-lldp.c
310
n += vlen;
usr.sbin/tcpdump/print-wb.c
250
int n;
usr.sbin/tcpdump/print-wb.c
258
n = ntohl(prep->pp_n);
usr.sbin/tcpdump/print-wb.c
260
while (--n >= 0 && (u_char *)ps < ep) {
usr.sbin/tcpdump/privsep.c
799
may_read(int fd, void *buf, size_t n)
usr.sbin/tcpdump/privsep.c
804
while (n > pos) {
usr.sbin/tcpdump/privsep.c
805
res = read(fd, s + pos, n - pos);
usr.sbin/tcpdump/privsep.c
823
must_read(int fd, void *buf, size_t n)
usr.sbin/tcpdump/privsep.c
828
while (n > pos) {
usr.sbin/tcpdump/privsep.c
829
res = read(fd, s + pos, n - pos);
usr.sbin/tcpdump/privsep.c
846
must_write(int fd, const void *buf, size_t n)
usr.sbin/tcpdump/privsep.c
851
while (n > pos) {
usr.sbin/tcpdump/privsep.c
852
res = write(fd, s + pos, n - pos);
usr.sbin/tcpdump/privsep_fdpass.c
43
ssize_t n;
usr.sbin/tcpdump/privsep_fdpass.c
63
if ((n = sendmsg(sock, &msg, 0)) == -1)
usr.sbin/tcpdump/privsep_fdpass.c
65
if (n != sizeof(int))
usr.sbin/tcpdump/privsep_fdpass.c
67
__func__, (long)n);
usr.sbin/tcpdump/privsep_fdpass.c
80
ssize_t n;
usr.sbin/tcpdump/privsep_fdpass.c
92
if ((n = recvmsg(sock, &msg, 0)) == -1) {
usr.sbin/tcpdump/privsep_fdpass.c
96
if (n != sizeof(int))
usr.sbin/tcpdump/privsep_fdpass.c
98
__func__, (long)n);
usr.sbin/tcpdump/tcpdump.c
182
u_int n;
usr.sbin/tcpdump/tcpdump.c
201
for (n = 0; n < dl.bfl_len; n++) {
usr.sbin/tcpdump/tcpdump.c
203
pcap_print_linktype(dltlist[n]);
usr.sbin/tcpdump/util.c
236
size_t len = 0, n;
usr.sbin/tcpdump/util.c
242
for (n = 0; argv[n]; n++)
usr.sbin/tcpdump/util.c
243
len += strlen(argv[n])+1;
usr.sbin/tcpdump/util.c
252
for (n = 1; argv[n]; n++) {
usr.sbin/tcpdump/util.c
254
strlcat(buf, argv[n], len);
usr.sbin/tcpdump/util.c
86
fn_printn(const u_char *s, u_int n, const u_char *ep)
usr.sbin/tcpdump/util.c
93
if (n-- <= 0) {
usr.sbin/tftp-proxy/tftp-proxy.c
689
ssize_t n;
usr.sbin/tftp-proxy/tftp-proxy.c
711
n = recvmsg(fd, &msg, 0);
usr.sbin/tftp-proxy/tftp-proxy.c
712
if (n == -1) {
usr.sbin/tftp-proxy/tftp-proxy.c
722
r->buflen = n;
usr.sbin/tftp-proxy/tftp-proxy.c
725
if (n < 5) {
usr.sbin/tftp-proxy/tftp-proxy.c
938
static int n = 0;
usr.sbin/tftp-proxy/tftp-proxy.c
941
n = (n + 1) % NTOP_BUFS;
usr.sbin/tftp-proxy/tftp-proxy.c
942
ntop_buf[n][0] = '\0';
usr.sbin/tftp-proxy/tftp-proxy.c
947
return (inet_ntop(AF_INET, &sin->sin_addr, ntop_buf[n],
usr.sbin/tftp-proxy/tftp-proxy.c
954
return (inet_ntop(AF_INET6, &sin6->sin6_addr, ntop_buf[n],
usr.sbin/tftpd/tftpd.c
1198
ssize_t n;
usr.sbin/tftpd/tftpd.c
1209
n = recv(fd, rbuf, sizeof(rbuf), 0);
usr.sbin/tftpd/tftpd.c
1210
if (n == -1) {
usr.sbin/tftpd/tftpd.c
1265
ssize_t n;
usr.sbin/tftpd/tftpd.c
1268
n = recv(client->sock, rbuf, sizeof(rbuf), 0);
usr.sbin/tftpd/tftpd.c
1269
if (n == -1) {
usr.sbin/tftpd/tftpd.c
1325
ssize_t n;
usr.sbin/tftpd/tftpd.c
1337
n = recv(fd, wbuf, client->packet_size, 0);
usr.sbin/tftpd/tftpd.c
1338
if (n == -1) {
usr.sbin/tftpd/tftpd.c
1350
if (n < 4)
usr.sbin/tftpd/tftpd.c
1378
for (i = 4; i < n; i++) {
usr.sbin/tftpd/tftpd.c
1385
if (n < client->packet_size) {
usr.sbin/tftpd/tftpd.c
1411
ssize_t n;
usr.sbin/tftpd/tftpd.c
1418
n = recv(fd, wbuf, client->packet_size, 0);
usr.sbin/tftpd/tftpd.c
1419
if (n == -1) {
usr.sbin/tftpd/tftpd.c
1431
if (n < 4)
usr.sbin/tftpd/tftpd.c
1514
int i, n, size;
usr.sbin/tftpd/tftpd.c
1525
n = snprintf(bp, size, "%s%c%lld", opt_names[i], '\0',
usr.sbin/tftpd/tftpd.c
1527
if (n < 0 || n >= size) {
usr.sbin/tftpd/tftpd.c
1532
bp += n + 1;
usr.sbin/tftpd/tftpd.c
1533
size -= n + 1;
usr.sbin/tftpd/tftpd.c
1582
ssize_t n;
usr.sbin/tftpd/tftpd.c
1593
n = recv(client->sock, client->buf, client->packet_size, 0);
usr.sbin/tftpd/tftpd.c
1594
if (n == -1) {
usr.sbin/tftpd/tftpd.c
1607
if (n < 4)
usr.sbin/tftpd/tftpd.c
678
ssize_t n;
usr.sbin/tftpd/tftpd.c
706
n = recvmsg(fd, &msg, 0);
usr.sbin/tftpd/tftpd.c
707
if (n == -1) {
usr.sbin/tftpd/tftpd.c
711
if (n < 4)
usr.sbin/tftpd/tftpd.c
775
tftp(client, tp, n);
usr.sbin/unbound/cachedb/cachedb.c
82
# define be64toh(n) (n)
usr.sbin/unbound/cachedb/cachedb.c
83
# define htobe64(n) (n)
usr.sbin/unbound/cachedb/cachedb.c
85
# define be64toh(n) (((uint64_t)htonl((n) & 0xFFFFFFFF) << 32) | htonl((n) >> 32))
usr.sbin/unbound/cachedb/cachedb.c
86
# define htobe64(n) (((uint64_t)htonl((n) & 0xFFFFFFFF) << 32) | htonl((n) >> 32))
usr.sbin/unbound/cachedb/redis.c
519
int n;
usr.sbin/unbound/cachedb/redis.c
524
n = snprintf(cmdbuf, sizeof(cmdbuf), "GET %s", key);
usr.sbin/unbound/cachedb/redis.c
525
if(n < 0 || n >= (int)sizeof(cmdbuf)) {
usr.sbin/unbound/cachedb/redis.c
566
int n;
usr.sbin/unbound/cachedb/redis.c
589
n = snprintf(cmdbuf, sizeof(cmdbuf), "SET %s %%b", key);
usr.sbin/unbound/cachedb/redis.c
595
n = snprintf(cmdbuf, sizeof(cmdbuf), "EXPIRE %s 0", key);
usr.sbin/unbound/cachedb/redis.c
604
n = snprintf(cmdbuf, sizeof(cmdbuf), "SET %s %%b EX %u", key,
usr.sbin/unbound/cachedb/redis.c
609
if(n < 0 || n >= (int)sizeof(cmdbuf)) {
usr.sbin/unbound/daemon/acl_list.c
802
char a[128], n[128];
usr.sbin/unbound/daemon/acl_list.c
808
n, sizeof(n));
usr.sbin/unbound/daemon/acl_list.c
810
"%s/%d %s%s", action, a, (int)port, n,
usr.sbin/unbound/daemon/daemon.c
489
int i, n, k, temp;
usr.sbin/unbound/daemon/daemon.c
501
n = avail;
usr.sbin/unbound/daemon/daemon.c
502
while(--n > 0) {
usr.sbin/unbound/daemon/daemon.c
503
k = ub_random_max(daemon->rand, n+1); /* 0<= k<= n */
usr.sbin/unbound/daemon/daemon.c
505
shufport[k] = shufport[n];
usr.sbin/unbound/daemon/daemon.c
506
shufport[n] = temp;
usr.sbin/unbound/daemon/remote.c
1762
static void addrtree_traverse_visit_node(struct addrnode* n, addrkey_t* addr,
usr.sbin/unbound/daemon/remote.c
1845
size_t n;
usr.sbin/unbound/daemon/remote.c
1851
n = (size_t)((addrlen / KEYWIDTH) + ((addrlen % KEYWIDTH != 0)?1:0));
usr.sbin/unbound/daemon/remote.c
1852
if(n > addr_size)
usr.sbin/unbound/daemon/remote.c
1853
n = addr_size;
usr.sbin/unbound/daemon/remote.c
1855
memcpy(addr, edge->str, n);
usr.sbin/unbound/daemon/remote.c
1862
addrtree_traverse_visit_node(struct addrnode* n, addrkey_t* addr,
usr.sbin/unbound/daemon/remote.c
1868
if(n->elem && n->ttl >= now) {
usr.sbin/unbound/daemon/remote.c
1869
func(q, (struct reply_info*)n->elem, addr, addr_size, is_ipv6,
usr.sbin/unbound/daemon/remote.c
1870
n->scope, n->only_match_scope_zero, n->ttl, arg);
usr.sbin/unbound/daemon/remote.c
1873
addrtree_traverse_visit_edge(n->edge[0], addr, addr_size, is_ipv6,
usr.sbin/unbound/daemon/remote.c
1875
addrtree_traverse_visit_edge(n->edge[1], addr, addr_size, is_ipv6,
usr.sbin/unbound/daemon/remote.c
278
struct listen_port* n;
usr.sbin/unbound/daemon/remote.c
350
n = (struct listen_port*)calloc(1, sizeof(*n));
usr.sbin/unbound/daemon/remote.c
351
if(!n) {
usr.sbin/unbound/daemon/remote.c
356
n->next = *list;
usr.sbin/unbound/daemon/remote.c
357
*list = n;
usr.sbin/unbound/daemon/remote.c
358
n->fd = fd;
usr.sbin/unbound/daemon/remote.c
401
struct listen_list* n = (struct listen_list*)malloc(sizeof(*n));
usr.sbin/unbound/daemon/remote.c
402
if(!n) {
usr.sbin/unbound/daemon/remote.c
406
n->next = rc->accept_list;
usr.sbin/unbound/daemon/remote.c
407
rc->accept_list = n;
usr.sbin/unbound/daemon/remote.c
409
n->com = comm_point_create_raw(rc->worker->base, fd, 0,
usr.sbin/unbound/daemon/remote.c
411
if(!n->com)
usr.sbin/unbound/daemon/remote.c
414
n->com->do_not_close = 1;
usr.sbin/unbound/daemon/remote.c
455
struct rc_state* n;
usr.sbin/unbound/daemon/remote.c
473
n = (struct rc_state*)calloc(1, sizeof(*n));
usr.sbin/unbound/daemon/remote.c
474
if(!n) {
usr.sbin/unbound/daemon/remote.c
478
n->fd = newfd;
usr.sbin/unbound/daemon/remote.c
480
n->c = comm_point_create_raw(rc->worker->base, newfd, 0,
usr.sbin/unbound/daemon/remote.c
481
&remote_control_callback, n);
usr.sbin/unbound/daemon/remote.c
482
if(!n->c) {
usr.sbin/unbound/daemon/remote.c
484
free(n);
usr.sbin/unbound/daemon/remote.c
488
n->c->do_not_close = 0;
usr.sbin/unbound/daemon/remote.c
489
comm_point_stop_listening(n->c);
usr.sbin/unbound/daemon/remote.c
490
comm_point_start_listening(n->c, -1, REMOTE_CONTROL_TCP_TIMEOUT);
usr.sbin/unbound/daemon/remote.c
491
memcpy(&n->c->repinfo.remote_addr, &addr, addrlen);
usr.sbin/unbound/daemon/remote.c
492
n->c->repinfo.remote_addrlen = addrlen;
usr.sbin/unbound/daemon/remote.c
494
n->shake_state = rc_hs_read;
usr.sbin/unbound/daemon/remote.c
495
n->ssl = SSL_new(rc->ctx);
usr.sbin/unbound/daemon/remote.c
496
if(!n->ssl) {
usr.sbin/unbound/daemon/remote.c
498
comm_point_delete(n->c);
usr.sbin/unbound/daemon/remote.c
499
free(n);
usr.sbin/unbound/daemon/remote.c
502
SSL_set_accept_state(n->ssl);
usr.sbin/unbound/daemon/remote.c
503
(void)SSL_set_mode(n->ssl, (long)SSL_MODE_AUTO_RETRY);
usr.sbin/unbound/daemon/remote.c
504
if(!SSL_set_fd(n->ssl, newfd)) {
usr.sbin/unbound/daemon/remote.c
506
SSL_free(n->ssl);
usr.sbin/unbound/daemon/remote.c
507
comm_point_delete(n->c);
usr.sbin/unbound/daemon/remote.c
508
free(n);
usr.sbin/unbound/daemon/remote.c
512
n->ssl = NULL;
usr.sbin/unbound/daemon/remote.c
515
n->rc = rc;
usr.sbin/unbound/daemon/remote.c
516
n->next = rc->busy_list;
usr.sbin/unbound/daemon/remote.c
517
rc->busy_list = n;
usr.sbin/unbound/daemon/remote.c
522
(void)remote_control_callback(n->c, n, NETEVENT_NOERROR, NULL);
usr.sbin/unbound/daemon/worker.c
2147
worker_create(struct daemon* daemon, int id, int* ports, int n)
usr.sbin/unbound/daemon/worker.c
2154
worker->numports = n;
usr.sbin/unbound/daemon/worker.c
2155
worker->ports = (int*)memdup(ports, sizeof(int)*n);
usr.sbin/unbound/daemon/worker.h
153
struct worker* worker_create(struct daemon* daemon, int id, int* ports, int n);
usr.sbin/unbound/dns64/dns64.c
177
uitoa(unsigned n, char* s)
usr.sbin/unbound/dns64/dns64.c
181
*ss++ = '0' + n % 10;
usr.sbin/unbound/dns64/dns64.c
182
} while (n /= 10);
usr.sbin/unbound/dns64/dns64.c
423
struct name_tree_node* n = (struct name_tree_node*)node;
usr.sbin/unbound/dns64/dns64.c
424
if(!n) return;
usr.sbin/unbound/dns64/dns64.c
425
free(n->name);
usr.sbin/unbound/dns64/dns64.c
426
free(n);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
108
n = 4+4+4+4+4+strlen(contenttype);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
109
control = malloc(n);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
119
*len = n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
126
size_t n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
136
n = 4+4+4+4+4+strlen(contenttype);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
137
control = malloc(n);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
147
*len = n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
154
size_t n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
161
n = 4+4+4;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
162
control = malloc(n);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
169
*len = n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
52
size_t n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
61
n = 4+4+4+4+4+strlen(contenttype);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
62
control = malloc(n);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
71
*len = n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
78
size_t n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
84
n = 4+4+4;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
85
control = malloc(n);
usr.sbin/unbound/dnstap/dnstap_fstrm.c
91
*len = n;
usr.sbin/unbound/dnstap/dnstap_fstrm.c
98
size_t n;
usr.sbin/unbound/edns-subnet/addrtree.c
115
node_size(const struct addrtree *tree, const struct addrnode *n)
usr.sbin/unbound/edns-subnet/addrtree.c
117
return sizeof *n + sizeof *n->parent_edge + n->parent_edge->len +
usr.sbin/unbound/edns-subnet/addrtree.c
118
(n->elem?tree->sizefunc(n->elem):0);
usr.sbin/unbound/edns-subnet/addrtree.c
246
struct addrnode *n, *p;
usr.sbin/unbound/edns-subnet/addrtree.c
250
n = tree->first;
usr.sbin/unbound/edns-subnet/addrtree.c
251
if (!n) break;
usr.sbin/unbound/edns-subnet/addrtree.c
252
children = (n->edge[0] != NULL) + (n->edge[1] != NULL);
usr.sbin/unbound/edns-subnet/addrtree.c
255
if (children == 2 || !n->parent_edge) {
usr.sbin/unbound/edns-subnet/addrtree.c
256
lru_update(tree, n);
usr.sbin/unbound/edns-subnet/addrtree.c
259
p = n->parent_edge->parent_node;
usr.sbin/unbound/edns-subnet/addrtree.c
260
purge_node(tree, n);
usr.sbin/unbound/edns-subnet/addrtree.c
279
struct addrnode *n;
usr.sbin/unbound/edns-subnet/addrtree.c
284
while ((n = tree->first)) {
usr.sbin/unbound/edns-subnet/addrtree.c
285
tree->first = n->next;
usr.sbin/unbound/edns-subnet/addrtree.c
286
clean_node(tree, n);
usr.sbin/unbound/edns-subnet/addrtree.c
287
tree->size_bytes -= node_size(tree, n);
usr.sbin/unbound/edns-subnet/addrtree.c
288
free(n->parent_edge->str);
usr.sbin/unbound/edns-subnet/addrtree.c
289
free(n->parent_edge);
usr.sbin/unbound/edns-subnet/addrtree.c
290
free(n);
usr.sbin/unbound/edns-subnet/addrtree.c
304
getbit(const addrkey_t *addr, addrlen_t addrlen, addrlen_t n)
usr.sbin/unbound/edns-subnet/addrtree.c
306
log_assert(addrlen > n);
usr.sbin/unbound/edns-subnet/addrtree.c
308
return (int)(addr[n/KEYWIDTH]>>((KEYWIDTH-1)-(n%KEYWIDTH))) & 1;
usr.sbin/unbound/edns-subnet/addrtree.c
316
cmpbit(const addrkey_t *key1, const addrkey_t *key2, addrlen_t n)
usr.sbin/unbound/edns-subnet/addrtree.c
318
addrkey_t c = key1[n/KEYWIDTH] ^ key2[n/KEYWIDTH];
usr.sbin/unbound/edns-subnet/addrtree.c
319
return (int)(c >> ((KEYWIDTH-1)-(n%KEYWIDTH))) & 1;
usr.sbin/unbound/edns-subnet/addrtree.c
523
const addrkey_t *key2, addrlen_t n) {
usr.sbin/unbound/edns-subnet/addrtree.c
524
return cmpbit(key1, key2, n);
usr.sbin/unbound/edns-subnet/addrtree.c
531
addrlen_t addrlen, addrlen_t n) {
usr.sbin/unbound/edns-subnet/addrtree.c
532
return getbit(addr, addrlen, n);
usr.sbin/unbound/edns-subnet/addrtree.c
58
size_t n;
usr.sbin/unbound/edns-subnet/addrtree.c
67
n = (size_t)((addrlen / KEYWIDTH) + ((addrlen % KEYWIDTH != 0)?1:0));
usr.sbin/unbound/edns-subnet/addrtree.c
68
edge->str = (addrkey_t *)calloc(n, sizeof (addrkey_t));
usr.sbin/unbound/edns-subnet/addrtree.c
73
memcpy(edge->str, addr, n * sizeof (addrkey_t));
usr.sbin/unbound/edns-subnet/addrtree.h
185
const addrkey_t *key2, addrlen_t n);
usr.sbin/unbound/edns-subnet/addrtree.h
189
addrlen_t addrlen, addrlen_t n);
usr.sbin/unbound/edns-subnet/edns-subnet.c
47
copy_clear(uint8_t* dst, size_t dstlen, uint8_t* src, size_t srclen, size_t n)
usr.sbin/unbound/edns-subnet/edns-subnet.c
49
size_t intpart = n / 8; /* bytes */
usr.sbin/unbound/edns-subnet/edns-subnet.c
50
size_t fracpart = n % 8; /* bits */
usr.sbin/unbound/edns-subnet/edns-subnet.h
65
copy_clear(uint8_t* dst, size_t dstlen, uint8_t* src, size_t srclen, size_t n);
usr.sbin/unbound/edns-subnet/subnet-whitelist.c
135
struct name_tree_node* n;
usr.sbin/unbound/edns-subnet/subnet-whitelist.c
155
n = (struct name_tree_node*)regional_alloc(whitelist->region,
usr.sbin/unbound/edns-subnet/subnet-whitelist.c
156
sizeof(*n));
usr.sbin/unbound/edns-subnet/subnet-whitelist.c
157
if(!n) {
usr.sbin/unbound/edns-subnet/subnet-whitelist.c
161
if(!name_tree_insert(&whitelist->dname, n, nmr, nm_len, nm_labs,
usr.sbin/unbound/edns-subnet/subnetmod.c
538
size_t n = (size_t)net / 8;
usr.sbin/unbound/edns-subnet/subnetmod.c
539
return !memcmp(a, b, n) && ((net % 8) == 0 || a[n] == b[n]);
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
111
whitelist_free(struct rbnode_type* n, void* ATTR_UNUSED(d))
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
113
if(n) {
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
114
free(((struct name_tree_node*)n)->name);
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
115
free(n);
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
121
whitelist_get_mem(struct rbnode_type* n, void* arg)
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
123
struct name_tree_node* node = (struct name_tree_node*)n;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
59
struct name_tree_node* n;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
66
n = (struct name_tree_node*)calloc(1, sizeof(*n));
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
67
if(!n) {
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
72
n->node.key = n;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
73
n->name = nm;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
74
n->len = len;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
75
n->labs = dname_count_labels(nm);
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
76
n->dclass = LDNS_RR_CLASS_IN;
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
77
if(!name_tree_insert(whitelist, n, nm, len, n->labs, n->dclass)) {
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
79
free(n->name);
usr.sbin/unbound/ipsecmod/ipsecmod-whitelist.c
80
free(n);
usr.sbin/unbound/iterator/iter_delegpt.c
379
size_t n = 0;
usr.sbin/unbound/iterator/iter_delegpt.c
381
n++;
usr.sbin/unbound/iterator/iter_delegpt.c
382
return n;
usr.sbin/unbound/iterator/iter_delegpt.c
389
size_t n = 0, nlame = 0;
usr.sbin/unbound/iterator/iter_delegpt.c
392
n++;
usr.sbin/unbound/iterator/iter_delegpt.c
395
if(alllame && n == nlame) *alllame = 1;
usr.sbin/unbound/iterator/iter_delegpt.c
396
return n;
usr.sbin/unbound/iterator/iter_delegpt.c
611
struct delegpt_ns* n, *nn;
usr.sbin/unbound/iterator/iter_delegpt.c
615
n = dp->nslist;
usr.sbin/unbound/iterator/iter_delegpt.c
616
while(n) {
usr.sbin/unbound/iterator/iter_delegpt.c
617
nn = n->next;
usr.sbin/unbound/iterator/iter_delegpt.c
618
free(n->name);
usr.sbin/unbound/iterator/iter_delegpt.c
619
free(n->tls_auth_name);
usr.sbin/unbound/iterator/iter_delegpt.c
620
free(n);
usr.sbin/unbound/iterator/iter_delegpt.c
621
n = nn;
usr.sbin/unbound/iterator/iter_fwd.c
488
rbnode_type* n;
usr.sbin/unbound/iterator/iter_fwd.c
492
n = rbtree_first(fwd->tree);
usr.sbin/unbound/iterator/iter_fwd.c
493
if(n == RBTREE_NULL)
usr.sbin/unbound/iterator/iter_fwd.c
495
p = (struct iter_forward_zone*)n;
usr.sbin/unbound/iterator/iter_fwd.c
512
n = NULL;
usr.sbin/unbound/iterator/iter_fwd.c
513
if(rbtree_find_less_equal(fwd->tree, &key, &n)) {
usr.sbin/unbound/iterator/iter_fwd.c
518
if(!n || n == RBTREE_NULL)
usr.sbin/unbound/iterator/iter_fwd.c
520
n = rbtree_next(n);
usr.sbin/unbound/iterator/iter_fwd.c
521
if(n == RBTREE_NULL)
usr.sbin/unbound/iterator/iter_fwd.c
523
p = (struct iter_forward_zone*)n;
usr.sbin/unbound/iterator/iter_fwd.c
78
static void fwd_zone_free(struct iter_forward_zone* n)
usr.sbin/unbound/iterator/iter_fwd.c
80
if(!n) return;
usr.sbin/unbound/iterator/iter_fwd.c
81
delegpt_free_mlc(n->dp);
usr.sbin/unbound/iterator/iter_fwd.c
82
free(n->name);
usr.sbin/unbound/iterator/iter_fwd.c
83
free(n);
usr.sbin/unbound/iterator/iter_fwd.c
86
static void delfwdnode(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/iterator/iter_fwd.c
88
struct iter_forward_zone* node = (struct iter_forward_zone*)n;
usr.sbin/unbound/iterator/iter_hints.c
72
static void delhintnode(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/iterator/iter_hints.c
74
struct iter_hints_stub* node = (struct iter_hints_stub*)n;
usr.sbin/unbound/iterator/iter_priv.c
100
if(!addr_tree_insert(&priv->a, n, &addr, addrlen, net)) {
usr.sbin/unbound/iterator/iter_priv.c
113
struct name_tree_node* n;
usr.sbin/unbound/iterator/iter_priv.c
132
n = (struct name_tree_node*)regional_alloc(priv->region,
usr.sbin/unbound/iterator/iter_priv.c
133
sizeof(*n));
usr.sbin/unbound/iterator/iter_priv.c
134
if(!n) {
usr.sbin/unbound/iterator/iter_priv.c
138
if(!name_tree_insert(&priv->n, n, nmr, nm_len, nm_labs,
usr.sbin/unbound/iterator/iter_priv.c
152
name_tree_init(&priv->n);
usr.sbin/unbound/iterator/iter_priv.c
162
name_tree_init_parents(&priv->n);
usr.sbin/unbound/iterator/iter_priv.c
201
return name_tree_lookup(&priv->n, decomp, len, labs, dclass) != NULL;
usr.sbin/unbound/iterator/iter_priv.c
66
name_tree_init(&priv->n);
usr.sbin/unbound/iterator/iter_priv.c
82
struct addr_tree_node* n;
usr.sbin/unbound/iterator/iter_priv.c
94
n = (struct addr_tree_node*)regional_alloc(priv->region,
usr.sbin/unbound/iterator/iter_priv.c
95
sizeof(*n));
usr.sbin/unbound/iterator/iter_priv.c
96
if(!n) {
usr.sbin/unbound/iterator/iter_priv.h
70
rbtree_type n;
usr.sbin/unbound/iterator/iter_utils.c
129
caps_free(struct rbnode_type* n, void* ATTR_UNUSED(d))
usr.sbin/unbound/iterator/iter_utils.c
131
if(n) {
usr.sbin/unbound/iterator/iter_utils.c
132
free(((struct name_tree_node*)n)->name);
usr.sbin/unbound/iterator/iter_utils.c
133
free(n);
usr.sbin/unbound/iterator/iter_utils.c
151
struct name_tree_node* n;
usr.sbin/unbound/iterator/iter_utils.c
158
n = (struct name_tree_node*)calloc(1, sizeof(*n));
usr.sbin/unbound/iterator/iter_utils.c
159
if(!n) {
usr.sbin/unbound/iterator/iter_utils.c
164
n->node.key = n;
usr.sbin/unbound/iterator/iter_utils.c
165
n->name = nm;
usr.sbin/unbound/iterator/iter_utils.c
166
n->len = len;
usr.sbin/unbound/iterator/iter_utils.c
167
n->labs = dname_count_labels(nm);
usr.sbin/unbound/iterator/iter_utils.c
168
n->dclass = LDNS_RR_CLASS_IN;
usr.sbin/unbound/iterator/iter_utils.c
169
if(!name_tree_insert(ntree, n, nm, len, n->labs, n->dclass)) {
usr.sbin/unbound/iterator/iter_utils.c
171
free(n->name);
usr.sbin/unbound/iterator/iter_utils.c
172
free(n);
usr.sbin/unbound/iterator/iter_utils.c
403
nth_rtt(struct delegpt_addr* result_list, size_t num_results, size_t n)
usr.sbin/unbound/iterator/iter_utils.c
409
if(num_results < 1 || n >= num_results) {
usr.sbin/unbound/iterator/iter_utils.c
429
log_assert(n > 0);
usr.sbin/unbound/iterator/iter_utils.c
430
rtt_band = rtt_list[n-1];
usr.sbin/unbound/iterator/iter_utils.c
447
struct delegpt_addr* a, *n, *prev=NULL;
usr.sbin/unbound/iterator/iter_utils.c
499
n = a->next_result;
usr.sbin/unbound/iterator/iter_utils.c
500
prev->next_result = n;
usr.sbin/unbound/iterator/iter_utils.c
503
a = n;
usr.sbin/unbound/iterator/iter_utils.c
552
n = a->next_result;
usr.sbin/unbound/iterator/iter_utils.c
553
prev->next_result = n;
usr.sbin/unbound/iterator/iter_utils.c
556
a = n;
usr.sbin/unbound/iterator/iter_utils.c
610
n = a->next_result;
usr.sbin/unbound/iterator/iter_utils.c
611
prev->next_result = n;
usr.sbin/unbound/iterator/iter_utils.c
614
a = n;
usr.sbin/unbound/iterator/iter_utils.c
748
iter_ns_probability(struct ub_randstate* rnd, int n, int m)
usr.sbin/unbound/iterator/iter_utils.c
751
if(n == m) /* 100% chance */
usr.sbin/unbound/iterator/iter_utils.c
756
return (sel < n);
usr.sbin/unbound/iterator/iter_utils.h
166
int iter_ns_probability(struct ub_randstate* rnd, int n, int m);
usr.sbin/unbound/iterator/iterator.c
3977
size_t n = from->rep->rrset_count+to->rep->rrset_count;
usr.sbin/unbound/iterator/iterator.c
3988
dest = regional_alloc(forq->region, sizeof(dest[0])*n);
usr.sbin/unbound/iterator/iterator.c
4022
to->rep->rrset_count = n;
usr.sbin/unbound/libunbound/libunbound.c
256
delq(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/libunbound/libunbound.c
258
struct ctx_query* q = (struct ctx_query*)n;
usr.sbin/unbound/respip/respip.c
75
resp_addr_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/respip/respip.c
77
struct resp_addr* r = (struct resp_addr*)n->key;
usr.sbin/unbound/services/authzone.c
1587
char* n = sldns_wire2str_dname(z->name, z->namelen);
usr.sbin/unbound/services/authzone.c
1591
zfilename, n?n:"error");
usr.sbin/unbound/services/authzone.c
1592
free(n);
usr.sbin/unbound/services/authzone.c
1596
zfilename, n?n:"error", strerror(errno));
usr.sbin/unbound/services/authzone.c
1597
free(n);
usr.sbin/unbound/services/authzone.c
1618
char* n = sldns_wire2str_dname(z->name, z->namelen);
usr.sbin/unbound/services/authzone.c
1620
zfilename, n?n:"error");
usr.sbin/unbound/services/authzone.c
1621
free(n);
usr.sbin/unbound/services/authzone.c
1707
auth_zone_write_domain(struct auth_zone* z, struct auth_data* n, FILE* out)
usr.sbin/unbound/services/authzone.c
1711
if(z->namelen == n->namelen) {
usr.sbin/unbound/services/authzone.c
1712
struct auth_rrset* soa = az_domain_rrset(n, LDNS_RR_TYPE_SOA);
usr.sbin/unbound/services/authzone.c
1714
if(!auth_zone_write_rrset(z, n, soa, out))
usr.sbin/unbound/services/authzone.c
1719
for(r = n->rrsets; r; r = r->next) {
usr.sbin/unbound/services/authzone.c
1720
if(z->namelen == n->namelen &&
usr.sbin/unbound/services/authzone.c
1723
if(!auth_zone_write_rrset(z, n, r, out))
usr.sbin/unbound/services/authzone.c
1732
struct auth_data* n;
usr.sbin/unbound/services/authzone.c
1738
RBTREE_FOR(n, struct auth_data*, &z->data) {
usr.sbin/unbound/services/authzone.c
1739
if(!auth_zone_write_domain(z, n, out)) {
usr.sbin/unbound/services/authzone.c
2297
struct auth_addr *n;
usr.sbin/unbound/services/authzone.c
2299
n = list->next;
usr.sbin/unbound/services/authzone.c
2301
list = n;
usr.sbin/unbound/services/authzone.c
2309
struct auth_master* n;
usr.sbin/unbound/services/authzone.c
2311
n = list->next;
usr.sbin/unbound/services/authzone.c
2316
list = n;
usr.sbin/unbound/services/authzone.c
2351
auth_zone_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
2353
struct auth_zone* z = (struct auth_zone*)n->key;
usr.sbin/unbound/services/authzone.c
2359
auth_xfer_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
2361
struct auth_xfer* z = (struct auth_xfer*)n->key;
usr.sbin/unbound/services/authzone.c
2377
domain_has_only_nsec3(struct auth_data* n)
usr.sbin/unbound/services/authzone.c
2379
struct auth_rrset* rrset = n->rrsets;
usr.sbin/unbound/services/authzone.c
2430
struct auth_data* n)
usr.sbin/unbound/services/authzone.c
2434
if(n) {
usr.sbin/unbound/services/authzone.c
2435
nm = dname_get_shared_topdomain(qinfo->qname, n->name);
usr.sbin/unbound/services/authzone.c
2440
n = az_find_name(z, nm, nmlen);
usr.sbin/unbound/services/authzone.c
2442
while(!n) {
usr.sbin/unbound/services/authzone.c
2445
n = az_find_name(z, nm, nmlen);
usr.sbin/unbound/services/authzone.c
2447
return n;
usr.sbin/unbound/services/authzone.c
2452
az_domain_go_up(struct auth_zone* z, struct auth_data* n)
usr.sbin/unbound/services/authzone.c
2454
uint8_t* nm = n->name;
usr.sbin/unbound/services/authzone.c
2455
size_t nmlen = n->namelen;
usr.sbin/unbound/services/authzone.c
2457
if((n=az_find_name(z, nm, nmlen)) != NULL)
usr.sbin/unbound/services/authzone.c
2458
return n;
usr.sbin/unbound/services/authzone.c
2480
struct auth_data* n = node;
usr.sbin/unbound/services/authzone.c
2486
n = az_find_candidate_ce(z, qinfo, n);
usr.sbin/unbound/services/authzone.c
2489
*ce = n;
usr.sbin/unbound/services/authzone.c
2493
if(n && domain_has_only_nsec3(n)) {
usr.sbin/unbound/services/authzone.c
2500
while(n) {
usr.sbin/unbound/services/authzone.c
2503
if(n->namelen != z->namelen &&
usr.sbin/unbound/services/authzone.c
2504
(lookrrset=az_domain_rrset(n, LDNS_RR_TYPE_NS)) &&
usr.sbin/unbound/services/authzone.c
2507
n->namelen != qinfo->qname_len)) {
usr.sbin/unbound/services/authzone.c
2510
*ce = n;
usr.sbin/unbound/services/authzone.c
2515
if(n->namelen != qinfo->qname_len &&
usr.sbin/unbound/services/authzone.c
2516
(lookrrset=az_domain_rrset(n, LDNS_RR_TYPE_DNAME))) {
usr.sbin/unbound/services/authzone.c
2518
*ce = n;
usr.sbin/unbound/services/authzone.c
2523
if(*ce == NULL && !domain_has_only_nsec3(n)) {
usr.sbin/unbound/services/authzone.c
2526
*ce = n;
usr.sbin/unbound/services/authzone.c
2530
n = az_domain_go_up(z, n);
usr.sbin/unbound/services/authzone.c
367
auth_data_delete(struct auth_data* n)
usr.sbin/unbound/services/authzone.c
370
if(!n) return;
usr.sbin/unbound/services/authzone.c
371
p = n->rrsets;
usr.sbin/unbound/services/authzone.c
377
free(n->name);
usr.sbin/unbound/services/authzone.c
378
free(n);
usr.sbin/unbound/services/authzone.c
383
auth_data_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/authzone.c
385
struct auth_data* z = (struct auth_data*)n->key;
usr.sbin/unbound/services/authzone.c
592
struct auth_data* n = (struct auth_data*)malloc(sizeof(*n));
usr.sbin/unbound/services/authzone.c
593
if(!n) return NULL;
usr.sbin/unbound/services/authzone.c
594
memset(n, 0, sizeof(*n));
usr.sbin/unbound/services/authzone.c
595
n->node.key = n;
usr.sbin/unbound/services/authzone.c
596
n->name = memdup(nm, nmlen);
usr.sbin/unbound/services/authzone.c
597
if(!n->name) {
usr.sbin/unbound/services/authzone.c
598
free(n);
usr.sbin/unbound/services/authzone.c
601
n->namelen = nmlen;
usr.sbin/unbound/services/authzone.c
602
n->namelabs = dname_count_labels(nm);
usr.sbin/unbound/services/authzone.c
603
if(!rbtree_insert(&z->data, &n->node)) {
usr.sbin/unbound/services/authzone.c
605
free(n->name);
usr.sbin/unbound/services/authzone.c
606
free(n);
usr.sbin/unbound/services/authzone.c
609
return n;
usr.sbin/unbound/services/authzone.c
643
struct auth_data* n = az_find_name(z, dname, dname_len);
usr.sbin/unbound/services/authzone.c
644
if(!n) {
usr.sbin/unbound/services/authzone.c
645
n = az_domain_create(z, dname, dname_len);
usr.sbin/unbound/services/authzone.c
647
return n;
usr.sbin/unbound/services/authzone.c
652
az_domain_rrset(struct auth_data* n, uint16_t t)
usr.sbin/unbound/services/authzone.c
655
if(!n) return NULL;
usr.sbin/unbound/services/authzone.c
656
rrset = n->rrsets;
usr.sbin/unbound/services/authzone.c
7713
struct auth_data* n;
usr.sbin/unbound/services/authzone.c
7714
RBTREE_FOR(n, struct auth_data*, &z->data) {
usr.sbin/unbound/services/authzone.c
7715
if(!zonemd_simple_domain(z, hashalgo, h, n, region, buf,
usr.sbin/unbound/services/authzone.c
8661
struct auth_master* n;
usr.sbin/unbound/services/authzone.c
8662
for(n = list; n; n = n->next) {
usr.sbin/unbound/services/authzone.c
8663
m += sizeof(*n);
usr.sbin/unbound/services/authzone.c
8664
m += auth_addrs_get_mem(n->list);
usr.sbin/unbound/services/authzone.c
8665
if(n->host)
usr.sbin/unbound/services/authzone.c
8666
m += strlen(n->host)+1;
usr.sbin/unbound/services/authzone.c
8667
if(n->file)
usr.sbin/unbound/services/authzone.c
8668
m += strlen(n->file)+1;
usr.sbin/unbound/services/cache/infra.c
396
static void domain_limit_free(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/cache/infra.c
398
if(n) {
usr.sbin/unbound/services/cache/infra.c
399
free(((struct domain_limit_data*)n)->node.name);
usr.sbin/unbound/services/cache/infra.c
400
free(n);
usr.sbin/unbound/services/cache/infra.c
413
static void wait_limit_netblock_del(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/cache/infra.c
415
free(n);
usr.sbin/unbound/services/localzone.c
113
lzdel(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/localzone.c
115
struct local_zone* z = (struct local_zone*)n->key;
usr.sbin/unbound/services/localzone.c
2130
struct local_data* n = (struct local_data*)rbtree_next(&d->node);
usr.sbin/unbound/services/localzone.c
2131
if(n == (struct local_data*)RBTREE_NULL)
usr.sbin/unbound/services/localzone.c
2133
if(dname_strict_subdomain(n->name, n->namelabs, d->name, d->namelabs))
usr.sbin/unbound/services/localzone.c
761
struct local_zone_override* n;
usr.sbin/unbound/services/localzone.c
762
n = (struct local_zone_override*)regional_alloc_zero(
usr.sbin/unbound/services/localzone.c
763
z->region, sizeof(*n));
usr.sbin/unbound/services/localzone.c
764
if(!n) {
usr.sbin/unbound/services/localzone.c
769
n->type = t;
usr.sbin/unbound/services/localzone.c
771
(struct addr_tree_node*)n, &addr, addrlen, net)) {
usr.sbin/unbound/services/mesh.c
1170
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
1176
n =
usr.sbin/unbound/services/mesh.c
1181
log_assert(n != NULL); /* must have been present */
usr.sbin/unbound/services/mesh.c
1206
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
1216
n =
usr.sbin/unbound/services/mesh.c
1221
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
1226
n =
usr.sbin/unbound/services/mesh.c
1231
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
1263
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
1287
n =
usr.sbin/unbound/services/mesh.c
1292
log_assert(n != NULL); /* we checked above if statement, the reverse
usr.sbin/unbound/services/mesh.c
2329
struct mesh_reply* n, *prev = NULL;
usr.sbin/unbound/services/mesh.c
2330
n = m->reply_list;
usr.sbin/unbound/services/mesh.c
2333
if(!n) return; /* nothing to remove, also no accounting needed */
usr.sbin/unbound/services/mesh.c
2334
while(n) {
usr.sbin/unbound/services/mesh.c
2335
if(n->query_reply.c == cp) {
usr.sbin/unbound/services/mesh.c
2337
if(prev) prev->next = n->next;
usr.sbin/unbound/services/mesh.c
2338
else m->reply_list = n->next;
usr.sbin/unbound/services/mesh.c
2343
&n->query_reply, mesh->env->cfg);
usr.sbin/unbound/services/mesh.c
2346
n = n->next;
usr.sbin/unbound/services/mesh.c
2349
prev = n;
usr.sbin/unbound/services/mesh.c
2350
n = n->next;
usr.sbin/unbound/services/mesh.c
248
mesh_delete_helper(rbnode_type* n)
usr.sbin/unbound/services/mesh.c
250
struct mesh_state* mstate = (struct mesh_state*)n->key;
usr.sbin/unbound/services/mesh.c
475
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
512
n =
usr.sbin/unbound/services/mesh.c
517
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
619
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
640
n =
usr.sbin/unbound/services/mesh.c
645
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
708
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
732
n =
usr.sbin/unbound/services/mesh.c
737
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
761
n =
usr.sbin/unbound/services/mesh.c
766
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
785
struct rbnode_type* n;
usr.sbin/unbound/services/mesh.c
819
n =
usr.sbin/unbound/services/mesh.c
824
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
848
n =
usr.sbin/unbound/services/mesh.c
853
log_assert(n != NULL);
usr.sbin/unbound/services/mesh.c
896
struct config_strlist* n = regional_alloc_zero(region,
usr.sbin/unbound/services/mesh.c
897
sizeof(*n));
usr.sbin/unbound/services/mesh.c
898
if(!n)
usr.sbin/unbound/services/mesh.c
900
n->str = regional_strdup(region, s->str);
usr.sbin/unbound/services/mesh.c
901
if(!n->str)
usr.sbin/unbound/services/mesh.c
904
last->next = n;
usr.sbin/unbound/services/mesh.c
905
else result = n;
usr.sbin/unbound/services/mesh.c
906
last = n;
usr.sbin/unbound/services/outside_network.c
471
rbnode_type* n;
usr.sbin/unbound/services/outside_network.c
475
n = rbtree_search(&reuse->tree_by_id, &key_w);
usr.sbin/unbound/services/outside_network.c
476
if(!n) return NULL;
usr.sbin/unbound/services/outside_network.c
477
return (struct waiting_tcp*)n->key;
usr.sbin/unbound/services/rpz.c
361
rpz_clientip_synthesized_rr_delete(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/rpz.c
363
struct clientip_synthesized_rr* r = (struct clientip_synthesized_rr*)n->key;
usr.sbin/unbound/services/view.c
83
delviewnode(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/services/view.c
85
struct view* v = (struct view*)n;
usr.sbin/unbound/sldns/keyraw.c
378
sldns_key_rsa_buf_bignum(unsigned char* key, size_t len, BIGNUM** n,
usr.sbin/unbound/sldns/keyraw.c
409
*n = BN_new();
usr.sbin/unbound/sldns/keyraw.c
410
if(!*n) {
usr.sbin/unbound/sldns/keyraw.c
415
(void) BN_bin2bn(key+offset, (int)(len - offset), *n);
usr.sbin/unbound/sldns/keyraw.c
437
rsa->n = modulus;
usr.sbin/unbound/sldns/keyraw.c
459
BIGNUM *n=NULL, *e=NULL;
usr.sbin/unbound/sldns/keyraw.c
463
if(!sldns_key_rsa_buf_bignum(key, len, &n, &e)) {
usr.sbin/unbound/sldns/keyraw.c
469
BN_free(n);
usr.sbin/unbound/sldns/keyraw.c
473
if(!OSSL_PARAM_BLD_push_BN(param_bld, "n", n)) {
usr.sbin/unbound/sldns/keyraw.c
475
BN_free(n);
usr.sbin/unbound/sldns/keyraw.c
481
BN_free(n);
usr.sbin/unbound/sldns/keyraw.c
491
BN_free(n);
usr.sbin/unbound/sldns/keyraw.c
498
BN_free(n);
usr.sbin/unbound/sldns/keyraw.c
505
BN_free(n);
usr.sbin/unbound/sldns/keyraw.c
512
BN_free(n);
usr.sbin/unbound/sldns/str2wire.c
1936
int n;
usr.sbin/unbound/sldns/str2wire.c
1943
n = sldns_b64_pton(str, rd, *len);
usr.sbin/unbound/sldns/str2wire.c
1944
if(n < 0)
usr.sbin/unbound/sldns/str2wire.c
1946
*len = (size_t)n;
usr.sbin/unbound/sldns/str2wire.c
1954
int n;
usr.sbin/unbound/sldns/str2wire.c
1958
n = sldns_b32_pton_extended_hex(str, slen, rd+1, *len-1);
usr.sbin/unbound/sldns/str2wire.c
1959
if(n < 0)
usr.sbin/unbound/sldns/str2wire.c
1961
*len = (size_t)n+1;
usr.sbin/unbound/sldns/str2wire.c
2877
int n;
usr.sbin/unbound/sldns/str2wire.c
2878
n = strtol(str, &s, 10);
usr.sbin/unbound/sldns/str2wire.c
2879
if(n < 0) /* negative number not allowed */
usr.sbin/unbound/sldns/str2wire.c
2881
if(*len < ((size_t)n)+2)
usr.sbin/unbound/sldns/str2wire.c
2883
if(n > 65535)
usr.sbin/unbound/sldns/str2wire.c
2886
if(n == 0) {
usr.sbin/unbound/sldns/str2wire.c
2897
n = sldns_b64_pton(s, rd+2, (*len)-2);
usr.sbin/unbound/sldns/str2wire.c
2898
if(n < 0)
usr.sbin/unbound/sldns/str2wire.c
2900
sldns_write_uint16(rd, (uint16_t)n);
usr.sbin/unbound/sldns/str2wire.c
2901
*len = ((size_t)n)+2;
usr.sbin/unbound/sldns/wire2str.c
1992
uint16_t n;
usr.sbin/unbound/sldns/wire2str.c
1995
n = sldns_read_uint16(*d);
usr.sbin/unbound/sldns/wire2str.c
1996
if(*dl < 2+(size_t)n)
usr.sbin/unbound/sldns/wire2str.c
2000
if(n == 0) {
usr.sbin/unbound/sldns/wire2str.c
2003
w = sldns_str_print(s, sl, "%u ", (unsigned)n);
usr.sbin/unbound/sldns/wire2str.c
2004
w += sldns_wire2str_b64_scan_num(d, dl, s, sl, n);
usr.sbin/unbound/sldns/wire2str.c
2074
size_t i, n;
usr.sbin/unbound/sldns/wire2str.c
2078
n = (size_t)((*d)[0]);
usr.sbin/unbound/sldns/wire2str.c
2079
if(*dl < 1+n)
usr.sbin/unbound/sldns/wire2str.c
2081
for(i=0; i<n; i++)
usr.sbin/unbound/sldns/wire2str.c
2084
for(i=0; i<n; i++)
usr.sbin/unbound/sldns/wire2str.c
2086
(*d)+=n+1;
usr.sbin/unbound/sldns/wire2str.c
2087
(*dl)-=(n+1);
usr.sbin/unbound/sldns/wire2str.c
782
int w = 0, n;
usr.sbin/unbound/sldns/wire2str.c
799
n = sldns_wire2str_rdf_scan(d, dlen, s, slen, rdftype,
usr.sbin/unbound/sldns/wire2str.c
801
if(n == -1) {
usr.sbin/unbound/sldns/wire2str.c
809
w += n;
usr.sbin/unbound/smallapp/unbound-anchor.c
1341
int frac = 0, n = 0;
usr.sbin/unbound/smallapp/unbound-anchor.c
1342
if(sscanf(s+1, "%d%n", &frac, &n) < 1) {
usr.sbin/unbound/smallapp/unbound-anchor.c
1348
s+=n;
usr.sbin/unbound/smallapp/unbound-anchor.c
1355
int hr = 0, mn = 0, n = 0;
usr.sbin/unbound/smallapp/unbound-anchor.c
1356
if(sscanf(s+1, "%d:%d%n", &hr, &mn, &n) < 2) {
usr.sbin/unbound/smallapp/unbound-anchor.c
1368
s += n;
usr.sbin/unbound/smallapp/unbound-anchor.c
909
size_t n = 0;
usr.sbin/unbound/smallapp/unbound-anchor.c
913
if(n >= len) {
usr.sbin/unbound/smallapp/unbound-anchor.c
917
if((r = SSL_read(ssl, buf+n, 1)) <= 0) {
usr.sbin/unbound/smallapp/unbound-anchor.c
925
if(endnl && buf[n] == '\n') {
usr.sbin/unbound/smallapp/unbound-anchor.c
931
} else if(buf[n] == '\r') {
usr.sbin/unbound/smallapp/unbound-anchor.c
935
} else if(buf[n] == '\n') {
usr.sbin/unbound/smallapp/unbound-anchor.c
938
} else n++;
usr.sbin/unbound/smallapp/unbound-anchor.c
940
buf[n] = 0;
usr.sbin/unbound/smallapp/unbound-checkconf.c
665
char n[64];
usr.sbin/unbound/smallapp/unbound-checkconf.c
667
n[0]=0;
usr.sbin/unbound/smallapp/unbound-checkconf.c
668
n[sizeof(n)-1]=0;
usr.sbin/unbound/smallapp/unbound-checkconf.c
669
for(j=0; j<sizeof(n)-1; j++) {
usr.sbin/unbound/smallapp/unbound-checkconf.c
671
n[j] = 0;
usr.sbin/unbound/smallapp/unbound-checkconf.c
674
n[j] = s[j];
usr.sbin/unbound/smallapp/unbound-checkconf.c
679
"with unbound -V", n);
usr.sbin/unbound/testcode/perf.c
270
perfsend(struct perfinfo* info, size_t n, struct timeval* now)
usr.sbin/unbound/testcode/perf.c
273
r = sendto(info->io[n].fd, (void*)info->qlist_data[info->qlist_idx],
usr.sbin/unbound/testcode/perf.c
286
info->io[n].timeout.tv_sec = IO_TIMEOUT/1000;
usr.sbin/unbound/testcode/perf.c
287
info->io[n].timeout.tv_usec = (IO_TIMEOUT%1000)*1000;
usr.sbin/unbound/testcode/perf.c
288
perf_tv_add(&info->io[n].timeout, now);
usr.sbin/unbound/testcode/perf.c
293
perfreply(struct perfinfo* info, size_t n, struct timeval* now)
usr.sbin/unbound/testcode/perf.c
296
r = recv(info->io[n].fd, (void*)sldns_buffer_begin(info->buf),
usr.sbin/unbound/testcode/perf.c
307
perfsend(info, n, now);
usr.sbin/unbound/testcode/perf.c
312
perftimeout(struct perfinfo* info, size_t n, struct timeval* now)
usr.sbin/unbound/testcode/perf.c
316
perfsend(info, n, now);
usr.sbin/unbound/testcode/petal.c
154
size_t n = 0;
usr.sbin/unbound/testcode/petal.c
158
if(n >= len) {
usr.sbin/unbound/testcode/petal.c
162
if((r = SSL_read(ssl, buf+n, 1)) <= 0) {
usr.sbin/unbound/testcode/petal.c
170
if(endnl && buf[n] == '\n') {
usr.sbin/unbound/testcode/petal.c
176
} else if(buf[n] == '\r') {
usr.sbin/unbound/testcode/petal.c
180
} else if(buf[n] == '\n') {
usr.sbin/unbound/testcode/petal.c
183
} else n++;
usr.sbin/unbound/testcode/petal.c
185
buf[n] = 0;
usr.sbin/unbound/testcode/testpkts.c
1010
get_line(char** s, char** n)
usr.sbin/unbound/testcode/testpkts.c
1013
if(*n == NULL || **n == 0)
usr.sbin/unbound/testcode/testpkts.c
1016
*s = *n;
usr.sbin/unbound/testcode/testpkts.c
1018
*n = strchr(*s, '\n');
usr.sbin/unbound/testcode/testpkts.c
1019
if(*n && **n != 0) {
usr.sbin/unbound/testcode/testpkts.c
1021
(*n)[0] = 0;
usr.sbin/unbound/testcode/testpkts.c
1022
(*n)++;
usr.sbin/unbound/testcode/testpkts.c
1401
char* edns = str, *n;
usr.sbin/unbound/testcode/testpkts.c
1404
n = strchr(edns, '\n');
usr.sbin/unbound/testcode/testpkts.c
1405
if(!n) {
usr.sbin/unbound/testcode/testpkts.c
1410
memmove(edns, n+1, str_len-(n-str));
usr.sbin/unbound/testcode/unitdname.c
1096
int n;
usr.sbin/unbound/testcode/unitdname.c
1109
for (n = 0 ; n < (int)sizeof(string_domain); ++n) {
usr.sbin/unbound/testcode/unitdname.c
1110
if ((uint8_t)string_domain[n] == 0xff)
usr.sbin/unbound/testcode/unitdname.c
1115
n, skip, string_domain + skip*31);
usr.sbin/unbound/testcode/unitdname.c
1116
unit_assert(n <= 255);
usr.sbin/unbound/testcode/unitdname.c
1123
for (n = 0 ; n < (int)sizeof(string_domain); ++n) {
usr.sbin/unbound/testcode/unitdname.c
1124
if ((uint8_t)string_domain[n] == 0xff)
usr.sbin/unbound/testcode/unitdname.c
1129
n, skip, string_domain + skip*31);
usr.sbin/unbound/testcode/unitdname.c
1130
unit_assert(n <= 255);
usr.sbin/unbound/testcode/unitdname.c
466
uint8_t* n = orig;
usr.sbin/unbound/testcode/unitdname.c
469
dname_remove_label(&n, &l);
usr.sbin/unbound/testcode/unitdname.c
470
unit_assert( n == orig+8 );
usr.sbin/unbound/testcode/unitdname.c
472
dname_remove_label(&n, &l);
usr.sbin/unbound/testcode/unitdname.c
473
unit_assert( n == orig+12 );
usr.sbin/unbound/testcode/unitdname.c
475
dname_remove_label(&n, &l);
usr.sbin/unbound/testcode/unitdname.c
476
unit_assert( n == orig+12 );
usr.sbin/unbound/testcode/unitdname.c
485
uint8_t* n = orig;
usr.sbin/unbound/testcode/unitdname.c
489
unit_assert(dname_remove_label_limit_len(&n, &l, lenlimit) == 1);
usr.sbin/unbound/testcode/unitdname.c
490
unit_assert( n == orig+8 );
usr.sbin/unbound/testcode/unitdname.c
492
unit_assert(dname_remove_label_limit_len(&n, &l, lenlimit) == 0);
usr.sbin/unbound/testcode/unitdname.c
493
unit_assert( n == orig+8 );
usr.sbin/unbound/testcode/unitneg.c
245
int n, i;
usr.sbin/unbound/testcode/unitneg.c
259
n = random() % (int)(z->count);
usr.sbin/unbound/testcode/unitneg.c
261
printf("neg stress delete zone %d\n", n);
usr.sbin/unbound/testcode/unitneg.c
265
while(i!=n+1 && walk && walk != RBTREE_NULL && !z->in_use) {
usr.sbin/unbound/testcode/unitneg.c
285
n = random() % (int)(d->count);
usr.sbin/unbound/testcode/unitneg.c
287
printf("neg stress delete item %d\n", n);
usr.sbin/unbound/testcode/unitneg.c
291
while(i!=n+1 && walk && walk != RBTREE_NULL && !d->in_use) {
usr.sbin/unbound/testcode/unittcpreuse.c
238
struct waiting_tcp* n = NULL;
usr.sbin/unbound/testcode/unittcpreuse.c
244
n = w->next_waiting;
usr.sbin/unbound/testcode/unittcpreuse.c
245
for(j=0; n; j++) {
usr.sbin/unbound/testcode/unittcpreuse.c
247
unit_assert(n != w);
usr.sbin/unbound/testcode/unittcpreuse.c
248
n = n->next_waiting;
usr.sbin/unbound/testcode/unittcpreuse.c
257
struct waiting_tcp* w = outnet->tcp_wait_first, *n = NULL;
usr.sbin/unbound/testcode/unittcpreuse.c
262
n = w->next_waiting;
usr.sbin/unbound/testcode/unittcpreuse.c
265
w = n;
usr.sbin/unbound/testcode/unittcpreuse.c
364
struct waiting_tcp* n = NULL;
usr.sbin/unbound/testcode/unittcpreuse.c
371
n = w->write_wait_next;
usr.sbin/unbound/testcode/unittcpreuse.c
372
for(j=0; n; j++) {
usr.sbin/unbound/testcode/unittcpreuse.c
374
unit_assert(n != w);
usr.sbin/unbound/testcode/unittcpreuse.c
375
n = n->write_wait_next;
usr.sbin/unbound/testcode/unittcpreuse.c
384
n = w->write_wait_prev;
usr.sbin/unbound/testcode/unittcpreuse.c
385
for(j=0; n; j++) {
usr.sbin/unbound/testcode/unittcpreuse.c
387
unit_assert(n != w);
usr.sbin/unbound/testcode/unittcpreuse.c
388
n = n->write_wait_prev;
usr.sbin/unbound/testcode/unittcpreuse.c
397
struct waiting_tcp* w = reuse->write_wait_first, *n = NULL;
usr.sbin/unbound/testcode/unittcpreuse.c
402
n = w->write_wait_next;
usr.sbin/unbound/testcode/unittcpreuse.c
406
w = n;
usr.sbin/unbound/testcode/unitverify.c
168
size_t i, n = 0;
usr.sbin/unbound/testcode/unitverify.c
174
sigalg[n++] = algo;
usr.sbin/unbound/testcode/unitverify.c
177
sigalg[n] = 0;
usr.sbin/unbound/util/alloc.c
661
char* n = (char*)unbound_stat_malloc_lite(l, file, line, func);
usr.sbin/unbound/util/alloc.c
662
if(!n) return NULL;
usr.sbin/unbound/util/alloc.c
663
memmove(n, s, l);
usr.sbin/unbound/util/alloc.c
664
return n;
usr.sbin/unbound/util/alloc.c
669
char* n = unbound_strdup_lite(s, __FILE__, __LINE__, __func__);
usr.sbin/unbound/util/alloc.c
671
return n;
usr.sbin/unbound/util/alloc.c
698
unsigned char* n = NULL;
usr.sbin/unbound/util/alloc.c
699
int r= i2d_DSA_SIG(dsasig, &n);
usr.sbin/unbound/util/alloc.c
700
if(n) {
usr.sbin/unbound/util/alloc.c
704
memcpy(*sig, n, (size_t)r);
usr.sbin/unbound/util/alloc.c
705
free(n);
usr.sbin/unbound/util/alloc.h
194
# define calloc(n,s) unbound_stat_calloc_lite(n, s, __FILE__, __LINE__, __func__)
usr.sbin/unbound/util/data/dname.c
760
dname_remove_labels(uint8_t** dname, size_t* len, int n)
usr.sbin/unbound/util/data/dname.c
763
for(i=0; i<n; i++)
usr.sbin/unbound/util/data/dname.h
290
void dname_remove_labels(uint8_t** dname, size_t* len, int n);
usr.sbin/unbound/util/data/msgencode.c
115
int c, n, closen=0;
usr.sbin/unbound/util/data/msgencode.c
120
if((c = dname_lab_cmp(dname, labs, p->dname, p->labs, &n))
usr.sbin/unbound/util/data/msgencode.c
122
*matchlabels = n;
usr.sbin/unbound/util/data/msgencode.c
130
closen = n;
usr.sbin/unbound/util/data/msgencode.c
185
struct compress_tree_node* n = (struct compress_tree_node*)
usr.sbin/unbound/util/data/msgencode.c
187
if(!n) return 0;
usr.sbin/unbound/util/data/msgencode.c
188
n->left = 0;
usr.sbin/unbound/util/data/msgencode.c
189
n->right = 0;
usr.sbin/unbound/util/data/msgencode.c
190
n->parent = 0;
usr.sbin/unbound/util/data/msgencode.c
191
n->dname = dname;
usr.sbin/unbound/util/data/msgencode.c
192
n->labs = labs;
usr.sbin/unbound/util/data/msgencode.c
193
n->offset = offset;
usr.sbin/unbound/util/data/msgencode.c
194
return n;
usr.sbin/unbound/util/data/msgreply.c
1422
struct edns_option* n;
usr.sbin/unbound/util/data/msgreply.c
1425
n = list->next;
usr.sbin/unbound/util/data/msgreply.c
1427
list = n;
usr.sbin/unbound/util/net_help.c
1815
size_t n;
usr.sbin/unbound/util/net_help.c
1829
n = fread(data, 1, 80, f);
usr.sbin/unbound/util/net_help.c
1832
if(n != 80) {
usr.sbin/unbound/util/net_help.c
1833
log_err("tls-session-ticket-key %s is %d bytes, must be 80 bytes", p->str, (int)n);
usr.sbin/unbound/util/netevent.c
90
# define CMSG_ALIGN(n) __CMSG_ALIGN(n)
usr.sbin/unbound/util/storage/dnstree.c
271
rbnode_type* n;
usr.sbin/unbound/util/storage/dnstree.c
275
n = rbtree_first(tree);
usr.sbin/unbound/util/storage/dnstree.c
276
if(n == RBTREE_NULL)
usr.sbin/unbound/util/storage/dnstree.c
278
p = (struct name_tree_node*)n;
usr.sbin/unbound/util/storage/dnstree.c
295
n = NULL;
usr.sbin/unbound/util/storage/dnstree.c
296
if(rbtree_find_less_equal(tree, &key, &n)) {
usr.sbin/unbound/util/storage/dnstree.c
301
if(!n || n == RBTREE_NULL)
usr.sbin/unbound/util/storage/dnstree.c
303
n = rbtree_next(n);
usr.sbin/unbound/util/storage/dnstree.c
304
if(n == RBTREE_NULL)
usr.sbin/unbound/util/storage/dnstree.c
306
p = (struct name_tree_node*)n;
usr.sbin/unbound/util/storage/lookup3.c
116
#define hashsize(n) ((uint32_t)1<<(n))
usr.sbin/unbound/util/storage/lookup3.c
117
#define hashmask(n) (hashsize(n)-1)
usr.sbin/unbound/util/storage/lruhash.c
355
struct lruhash_entry* n = reclaimlist->overflow_next;
usr.sbin/unbound/util/storage/lruhash.c
359
reclaimlist = n;
usr.sbin/unbound/util/storage/lruhash.c
557
struct lruhash_entry* n = reclaimlist->overflow_next;
usr.sbin/unbound/util/storage/lruhash.c
561
reclaimlist = n;
usr.sbin/unbound/util/storage/lruhash.c
587
struct lruhash_entry* n = reclaimlist->overflow_next;
usr.sbin/unbound/util/storage/lruhash.c
591
reclaimlist = n;
usr.sbin/unbound/util/storage/lruhash.c
696
struct lruhash_entry* n = reclaimlist->overflow_next;
usr.sbin/unbound/util/storage/lruhash.c
700
reclaimlist = n;
usr.sbin/unbound/util/tcp_conn_limit.c
68
struct tcl_addr* n = (struct tcl_addr*) node;
usr.sbin/unbound/util/tcp_conn_limit.c
69
lock_quick_destroy(&n->lock);
usr.sbin/unbound/util/tcp_conn_limit.c
71
(void)n;
usr.sbin/unbound/util/ub_event.c
226
ub_get_event_sys(struct ub_event_base* base, const char** n, const char** s,
usr.sbin/unbound/util/ub_event.c
231
*n = "event";
usr.sbin/unbound/util/ub_event.c
236
*n = "mini-event";
usr.sbin/unbound/util/ub_event.c
243
*n = "libev";
usr.sbin/unbound/util/ub_event.c
252
*n = "libevent";
usr.sbin/unbound/util/ub_event.c
257
*n = "unknown";
usr.sbin/unbound/util/ub_event.h
68
void ub_get_event_sys(struct ub_event_base*, const char** n, const char** s,
usr.sbin/unbound/util/ub_event_pluggable.c
437
ub_get_event_sys(struct ub_event_base* ub_base, const char** n, const char** s,
usr.sbin/unbound/util/ub_event_pluggable.c
442
*n = "pluggable-event";
usr.sbin/unbound/util/ub_event_pluggable.c
447
*n = "pluggable-event";
usr.sbin/unbound/util/ub_event_pluggable.c
457
*n = "pluggable-event";
usr.sbin/unbound/util/ub_event_pluggable.c
460
*n = "pluggable-libev";
usr.sbin/unbound/util/ub_event_pluggable.c
467
*n = "pluggable-libevent";
usr.sbin/unbound/validator/val_anchor.c
201
rbnode_type* n;
usr.sbin/unbound/validator/val_anchor.c
209
n = rbtree_search(anchors->tree, &key);
usr.sbin/unbound/validator/val_anchor.c
210
if(n) {
usr.sbin/unbound/validator/val_anchor.c
211
lock_basic_lock(&((struct trust_anchor*)n->key)->lock);
usr.sbin/unbound/validator/val_anchor.c
214
if(!n)
usr.sbin/unbound/validator/val_anchor.c
216
return (struct trust_anchor*)n->key;
usr.sbin/unbound/validator/val_neg.c
114
neg_clear_datas(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/validator/val_neg.c
116
struct val_neg_data* d = (struct val_neg_data*)n;
usr.sbin/unbound/validator/val_neg.c
123
neg_clear_zones(rbnode_type* n, void* ATTR_UNUSED(arg))
usr.sbin/unbound/validator/val_neg.c
125
struct val_neg_zone* z = (struct val_neg_zone*)n;
usr.sbin/unbound/validator/val_nsec3.c
663
rbnode_type* n;
usr.sbin/unbound/validator/val_nsec3.c
692
n =
usr.sbin/unbound/validator/val_nsec3.c
697
log_assert(n); /* cannot be duplicate, just did lookup */
usr.sbin/unbound/validator/val_secalgo.c
1879
nettle_mpz_set_str_256_u(pubkey.n, pubkey.size, &key[mod_offset]);
usr.sbin/unbound/validator/val_sigcrypt.c
437
void algo_needs_init_dnskey_add(struct algo_needs* n,
usr.sbin/unbound/validator/val_sigcrypt.c
441
size_t i, total = n->num;
usr.sbin/unbound/validator/val_sigcrypt.c
448
if(n->needs[algo] == 0) {
usr.sbin/unbound/validator/val_sigcrypt.c
449
n->needs[algo] = 1;
usr.sbin/unbound/validator/val_sigcrypt.c
455
n->num = total;
usr.sbin/unbound/validator/val_sigcrypt.c
458
void algo_needs_init_list(struct algo_needs* n, uint8_t* sigalg)
usr.sbin/unbound/validator/val_sigcrypt.c
463
memset(n->needs, 0, sizeof(uint8_t)*ALGO_NEEDS_MAX);
usr.sbin/unbound/validator/val_sigcrypt.c
466
log_assert(n->needs[algo] == 0);
usr.sbin/unbound/validator/val_sigcrypt.c
467
n->needs[algo] = 1;
usr.sbin/unbound/validator/val_sigcrypt.c
470
n->num = total;
usr.sbin/unbound/validator/val_sigcrypt.c
473
void algo_needs_init_ds(struct algo_needs* n, struct ub_packed_rrset_key* ds,
usr.sbin/unbound/validator/val_sigcrypt.c
480
memset(n->needs, 0, sizeof(uint8_t)*ALGO_NEEDS_MAX);
usr.sbin/unbound/validator/val_sigcrypt.c
488
if(n->needs[algo] == 0) {
usr.sbin/unbound/validator/val_sigcrypt.c
489
n->needs[algo] = 1;
usr.sbin/unbound/validator/val_sigcrypt.c
495
n->num = total;
usr.sbin/unbound/validator/val_sigcrypt.c
498
int algo_needs_set_secure(struct algo_needs* n, uint8_t algo)
usr.sbin/unbound/validator/val_sigcrypt.c
500
if(n->needs[algo]) {
usr.sbin/unbound/validator/val_sigcrypt.c
501
n->needs[algo] = 0;
usr.sbin/unbound/validator/val_sigcrypt.c
502
n->num --;
usr.sbin/unbound/validator/val_sigcrypt.c
503
if(n->num == 0) /* done! */
usr.sbin/unbound/validator/val_sigcrypt.c
509
void algo_needs_set_bogus(struct algo_needs* n, uint8_t algo)
usr.sbin/unbound/validator/val_sigcrypt.c
511
if(n->needs[algo]) n->needs[algo] = 2; /* need it, but bogus */
usr.sbin/unbound/validator/val_sigcrypt.c
514
size_t algo_needs_num_missing(struct algo_needs* n)
usr.sbin/unbound/validator/val_sigcrypt.c
516
return n->num;
usr.sbin/unbound/validator/val_sigcrypt.c
519
int algo_needs_missing(struct algo_needs* n)
usr.sbin/unbound/validator/val_sigcrypt.c
526
if(n->needs[i] == 2)
usr.sbin/unbound/validator/val_sigcrypt.c
528
if(n->needs[i] == 1 && miss == -1)
usr.sbin/unbound/validator/val_sigcrypt.h
100
void algo_needs_init_ds(struct algo_needs* n, struct ub_packed_rrset_key* ds,
usr.sbin/unbound/validator/val_sigcrypt.h
109
int algo_needs_set_secure(struct algo_needs* n, uint8_t algo);
usr.sbin/unbound/validator/val_sigcrypt.h
117
void algo_needs_set_bogus(struct algo_needs* n, uint8_t algo);
usr.sbin/unbound/validator/val_sigcrypt.h
124
size_t algo_needs_num_missing(struct algo_needs* n);
usr.sbin/unbound/validator/val_sigcrypt.h
133
int algo_needs_missing(struct algo_needs* n);
usr.sbin/unbound/validator/val_sigcrypt.h
82
void algo_needs_init_dnskey_add(struct algo_needs* n,
usr.sbin/unbound/validator/val_sigcrypt.h
90
void algo_needs_init_list(struct algo_needs* n, uint8_t* sigalg);
usr.sbin/unwindctl/unwindctl.c
185
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/unwindctl/unwindctl.c
187
if (n == 0)
usr.sbin/unwindctl/unwindctl.c
191
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/unwindctl/unwindctl.c
193
if (n == 0)
usr.sbin/unwindctl/unwindctl.c
339
print_histogram(const char *name, int64_t histogram[], size_t n)
usr.sbin/unwindctl/unwindctl.c
344
for(i = 0; i < n; i++)
usr.sbin/unwindctl/unwindctl.c
95
int i, j, k, n, verbose = 0;
usr.sbin/user/user.c
347
int len, n;
usr.sbin/user/user.c
355
for (n = 0; (dp = readdir(dirp)) != NULL && n == 0 ; ) {
usr.sbin/user/user.c
360
n = 1;
usr.sbin/user/user.c
363
if (n == 0) {
usr.sbin/user/user.c
369
n = 0;
usr.sbin/user/user.c
377
return n;
usr.sbin/vmctl/main.c
187
int n;
usr.sbin/vmctl/main.c
271
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmctl/main.c
273
if (n == 0)
usr.sbin/vmctl/main.c
277
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmctl/main.c
279
if (n == 0)
usr.sbin/vmd/atomicio.c
46
atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
usr.sbin/vmd/atomicio.c
56
while (n > pos) {
usr.sbin/vmd/atomicio.c
57
res = (f) (fd, s + pos, n - pos);
usr.sbin/vmd/atomicio.c
82
atomicio(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n)
usr.sbin/vmd/atomicio.c
84
return atomicio6(f, fd, _s, n, NULL, NULL);
usr.sbin/vmd/atomicio.h
38
atomicio6(ssize_t (*f) (int, void *, size_t), int fd, void *_s, size_t n,
usr.sbin/vmd/config.c
196
int n = 0, aflags, oflags, ret = -1;
usr.sbin/vmd/config.c
357
n = virtio_get_base(diskfds[i][j], base, sizeof(base),
usr.sbin/vmd/config.c
359
if (n == 0)
usr.sbin/vmd/config.c
361
if (n == -1) {
usr.sbin/vmd/config.c
565
unsigned int n, idx;
usr.sbin/vmd/config.c
576
n = imsg_uint_read(imsg);
usr.sbin/vmd/config.c
579
if (n >= vm->vm_params.vmc_ndisks || fd == -1) {
usr.sbin/vmd/config.c
584
idx = vm->vm_params.vmc_diskbases[n]++;
usr.sbin/vmd/config.c
590
vm->vm_disks[n][idx] = fd;
usr.sbin/vmd/config.c
598
unsigned int n;
usr.sbin/vmd/config.c
609
n = imsg_uint_read(imsg);
usr.sbin/vmd/config.c
612
if (n >= vm->vm_params.vmc_nnics ||
usr.sbin/vmd/config.c
613
vm->vm_ifs[n].vif_fd != -1 || fd == -1) {
usr.sbin/vmd/config.c
617
vm->vm_ifs[n].vif_fd = fd;
usr.sbin/vmd/control.c
383
int n, v, wait = 0, ret = 0;
usr.sbin/vmd/control.c
405
if ((n = imsg_get(&c->iev.ibuf, &imsg)) == -1) {
usr.sbin/vmd/control.c
410
if (n == 0)
usr.sbin/vmd/i8259.c
281
i8259_write_datareg(uint8_t n, uint8_t data)
usr.sbin/vmd/i8259.c
283
struct i8259 *pic = &pics[n];
usr.sbin/vmd/i8259.c
289
__func__, i8259_pic_name(n), data);
usr.sbin/vmd/i8259.c
293
if (n == SLAVE && (data & 0xf8)) {
usr.sbin/vmd/i8259.c
295
__func__, i8259_pic_name(n), data);
usr.sbin/vmd/i8259.c
302
"clear", __func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
308
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
315
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
321
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
327
" 0x%x", __func__, i8259_pic_name(n), data);
usr.sbin/vmd/i8259.c
351
i8259_specific_eoi(uint8_t n, uint8_t data)
usr.sbin/vmd/i8259.c
353
if (!(pics[n].isr & (1 << (data & 0x7)))) {
usr.sbin/vmd/i8259.c
355
" service", __func__, i8259_pic_name(n), (data & 0x7));
usr.sbin/vmd/i8259.c
358
pics[n].isr &= ~(1 << (data & 0x7));
usr.sbin/vmd/i8259.c
368
i8259_nonspecific_eoi(uint8_t n, uint8_t data)
usr.sbin/vmd/i8259.c
373
if ((pics[n].isr & (1 << (i & 0x7)))) {
usr.sbin/vmd/i8259.c
374
i8259_specific_eoi(n, i);
usr.sbin/vmd/i8259.c
390
i8259_rotate_priority(uint8_t n)
usr.sbin/vmd/i8259.c
392
pics[n].lowest_pri++;
usr.sbin/vmd/i8259.c
393
if (pics[n].lowest_pri > 7)
usr.sbin/vmd/i8259.c
394
pics[n].lowest_pri = 0;
usr.sbin/vmd/i8259.c
407
i8259_write_cmdreg(uint8_t n, uint8_t data)
usr.sbin/vmd/i8259.c
409
struct i8259 *pic = &pics[n];
usr.sbin/vmd/i8259.c
415
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
421
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
427
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
433
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
439
__func__, i8259_pic_name(n));
usr.sbin/vmd/i8259.c
491
i8259_nonspecific_eoi(n, data);
usr.sbin/vmd/i8259.c
494
i8259_specific_eoi(n, data);
usr.sbin/vmd/i8259.c
497
i8259_nonspecific_eoi(n, data);
usr.sbin/vmd/i8259.c
498
i8259_rotate_priority(n);
usr.sbin/vmd/i8259.c
501
i8259_specific_eoi(n, data);
usr.sbin/vmd/i8259.c
502
i8259_rotate_priority(n);
usr.sbin/vmd/i8259.c
543
i8259_read_datareg(uint8_t n)
usr.sbin/vmd/i8259.c
545
struct i8259 *pic = &pics[n];
usr.sbin/vmd/i8259.c
563
i8259_read_cmdreg(uint8_t n)
usr.sbin/vmd/i8259.c
565
struct i8259 *pic = &pics[n];
usr.sbin/vmd/i8259.c
588
uint8_t n = 0;
usr.sbin/vmd/i8259.c
595
n = MASTER;
usr.sbin/vmd/i8259.c
599
n = SLAVE;
usr.sbin/vmd/i8259.c
607
i8259_write_datareg(n, data);
usr.sbin/vmd/i8259.c
609
i8259_write_cmdreg(n, data);
usr.sbin/vmd/i8259.c
628
uint8_t n = 0;
usr.sbin/vmd/i8259.c
634
n = MASTER;
usr.sbin/vmd/i8259.c
638
n = SLAVE;
usr.sbin/vmd/i8259.c
646
rv = i8259_read_datareg(n);
usr.sbin/vmd/i8259.c
648
rv = i8259_read_cmdreg(n);
usr.sbin/vmd/loadfile_elf.c
216
size_t n, stacksize;
usr.sbin/vmd/loadfile_elf.c
253
n = create_bios_memmap(&vm->vm_params, memmap);
usr.sbin/vmd/loadfile_elf.c
254
bootargsz = push_bootargs(memmap, n, bootmac);
usr.sbin/vmd/loadfile_elf.c
281
size_t i, n = 0;
usr.sbin/vmd/loadfile_elf.c
284
for (i = 0; i < vmc->vmc_nmemranges; i++, n++) {
usr.sbin/vmd/loadfile_elf.c
286
memmap[n].addr = vmr->vmr_gpa;
usr.sbin/vmd/loadfile_elf.c
287
memmap[n].size = vmr->vmr_size;
usr.sbin/vmd/loadfile_elf.c
289
memmap[n].type = BIOS_MAP_FREE;
usr.sbin/vmd/loadfile_elf.c
291
memmap[n].type = BIOS_MAP_RES;
usr.sbin/vmd/loadfile_elf.c
295
memmap[n].addr = 0x0;
usr.sbin/vmd/loadfile_elf.c
296
memmap[n].size = 0x0;
usr.sbin/vmd/loadfile_elf.c
297
memmap[n].type = BIOS_MAP_END;
usr.sbin/vmd/loadfile_elf.c
298
n++;
usr.sbin/vmd/loadfile_elf.c
300
return (n);
usr.sbin/vmd/loadfile_elf.c
320
push_bootargs(bios_memmap_t *memmap, size_t n, bios_bootmac_t *bootmac)
usr.sbin/vmd/loadfile_elf.c
326
memmap_sz = 3 * sizeof(uint32_t) + n * sizeof(bios_memmap_t);
usr.sbin/vmd/loadfile_elf.c
330
memcpy(&ba[3], memmap, n * sizeof(bios_memmap_t));
usr.sbin/vmd/proc.c
446
ssize_t n;
usr.sbin/vmd/proc.c
456
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/proc.c
458
if (n == 0) {
usr.sbin/vmd/proc.c
479
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/proc.c
481
if (n == 0)
usr.sbin/vmd/vioblk.c
394
ssize_t n = 0;
usr.sbin/vmd/vioblk.c
399
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vioblk.c
401
if (n == 0) {
usr.sbin/vmd/vioblk.c
424
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vioblk.c
426
if (n == 0)
usr.sbin/vmd/vioblk.c
462
ssize_t n;
usr.sbin/vmd/vioblk.c
466
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vioblk.c
468
if (n == 0) {
usr.sbin/vmd/vioblk.c
491
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vioblk.c
492
fatalx("%s: imsg_get (n=%ld)", __func__, n);
usr.sbin/vmd/vioblk.c
493
if (n == 0)
usr.sbin/vmd/vionet.c
838
ssize_t n = 0;
usr.sbin/vmd/vionet.c
846
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vionet.c
848
if (n == 0) {
usr.sbin/vmd/vionet.c
871
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vionet.c
873
if (n == 0)
usr.sbin/vmd/vionet.c
914
ssize_t n;
usr.sbin/vmd/vionet.c
918
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vionet.c
920
if (n == 0) {
usr.sbin/vmd/vionet.c
943
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vionet.c
944
fatalx("%s: imsg_get (n=%ld)", __func__, n);
usr.sbin/vmd/vionet.c
945
if (n == 0)
usr.sbin/vmd/vioscsi.c
429
ssize_t n = 0;
usr.sbin/vmd/vioscsi.c
434
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vioscsi.c
436
if (n == 0) {
usr.sbin/vmd/vioscsi.c
459
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vioscsi.c
461
if (n == 0)
usr.sbin/vmd/vioscsi.c
496
ssize_t n;
usr.sbin/vmd/vioscsi.c
500
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vioscsi.c
502
if (n == 0) {
usr.sbin/vmd/vioscsi.c
525
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vioscsi.c
526
fatalx("%s: imsg_get (n=%ld)", __func__, n);
usr.sbin/vmd/vioscsi.c
527
if (n == 0)
usr.sbin/vmd/virtio.c
1689
ssize_t n = 0;
usr.sbin/vmd/virtio.c
1693
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/virtio.c
1695
if (n == 0) {
usr.sbin/vmd/virtio.c
1718
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/virtio.c
1720
if (n == 0)
usr.sbin/vmd/virtio.h
33
#define VIRTQUEUE_ALIGN(n) (((n)+(VIRTIO_PAGE_SIZE-1))& \
usr.sbin/vmd/vm.c
1062
size_t n;
usr.sbin/vmd/vm.c
1063
n = write(p->write, &msg, sizeof(msg));
usr.sbin/vmd/vm.c
1064
if (n != sizeof(msg))
usr.sbin/vmd/vm.c
1084
size_t n;
usr.sbin/vmd/vm.c
1086
n = read(p->read, &msg, sizeof(msg));
usr.sbin/vmd/vm.c
1087
if (n != sizeof(msg))
usr.sbin/vmd/vm.c
315
ssize_t n;
usr.sbin/vmd/vm.c
319
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vm.c
321
if (n == 0)
usr.sbin/vmd/vm.c
334
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vm.c
336
if (n == 0)
usr.sbin/vmd/vm.c
427
unsigned int n;
usr.sbin/vmd/vm.c
438
for (n = 0; n < vm->vm_params.vmc_ncpus; n++) {
usr.sbin/vmd/vm.c
439
ret = pthread_cond_broadcast(&vcpu_run_cond[n]);
usr.sbin/vmd/vm.c
459
unsigned int n;
usr.sbin/vmd/vm.c
470
for (n = 0; n < vm->vm_params.vmc_ncpus; n++) {
usr.sbin/vmd/vm.c
471
ret = pthread_cond_broadcast(&vcpu_unpause_cond[n]);
usr.sbin/vmd/vm.c
812
uint32_t n = vrp->vrp_vcpu_id;
usr.sbin/vmd/vm.c
816
ret = pthread_mutex_lock(&vcpu_run_mtx[n]);
usr.sbin/vmd/vm.c
826
halted = vcpu_hlt[n];
usr.sbin/vmd/vm.c
838
ret = pthread_mutex_lock(&vcpu_unpause_mtx[n]);
usr.sbin/vmd/vm.c
846
mutex_unlock(&vcpu_run_mtx[n]);
usr.sbin/vmd/vm.c
847
ret = pthread_cond_wait(&vcpu_unpause_cond[n],
usr.sbin/vmd/vm.c
848
&vcpu_unpause_mtx[n]);
usr.sbin/vmd/vm.c
855
mutex_lock(&vcpu_run_mtx[n]);
usr.sbin/vmd/vm.c
857
ret = pthread_mutex_unlock(&vcpu_unpause_mtx[n]);
usr.sbin/vmd/vm.c
867
ret = pthread_cond_wait(&vcpu_run_cond[n],
usr.sbin/vmd/vm.c
868
&vcpu_run_mtx[n]);
usr.sbin/vmd/vm.c
875
&vcpu_run_mtx[n]);
usr.sbin/vmd/vm.c
880
ret = pthread_mutex_unlock(&vcpu_run_mtx[n]);
usr.sbin/vmd/vm.c
901
__func__, current_vm->vm_vmid, n);
usr.sbin/vmd/vm.c
923
vcpu_done[n] = 1;
usr.sbin/vmd/vmd.c
1871
size_t i, n;
usr.sbin/vmd/vmd.c
1878
n = sizeof(vmc->vmc_disks) / sizeof(vmc->vmc_disks[0]);
usr.sbin/vmd/vmd.c
1879
for (i = 0; i < n; i++)
usr.sbin/vmd/vmd.c
1882
n = sizeof(vmc->vmc_ifnames) / sizeof(vmc->vmc_ifnames[0]);
usr.sbin/vmd/vmd.c
1883
for (i = 0; i < n; i++)
usr.sbin/vmd/vmd.c
1886
n = sizeof(vmc->vmc_ifswitch) / sizeof(vmc->vmc_ifswitch[0]);
usr.sbin/vmd/vmd.c
1887
for (i = 0; i < n; i++)
usr.sbin/vmd/vmd.c
1890
n = sizeof(vmc->vmc_ifgroup) / sizeof(vmc->vmc_ifgroup[0]);
usr.sbin/vmd/vmd.c
1891
for (i = 0; i < n; i++)
usr.sbin/vmd/vmm.c
458
ssize_t n;
usr.sbin/vmd/vmm.c
463
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/vmd/vmm.c
465
if (n == 0) {
usr.sbin/vmd/vmm.c
484
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/vmd/vmm.c
486
if (n == 0)
usr.sbin/vmd/x86_mmio.c
188
next_value(struct x86_decode_state *state, size_t n, uint64_t *value)
usr.sbin/vmd/x86_mmio.c
197
if (n == 0 || n > sizeof(bytes))
usr.sbin/vmd/x86_mmio.c
201
for (i = 0; i < n; i++)
usr.sbin/vmd/x86_vm.c
696
size_t i, n;
usr.sbin/vmd/x86_vm.c
715
n = vmr->vmr_size - (gpa - vmr->vmr_gpa);
usr.sbin/vmd/x86_vm.c
716
if (len < n)
usr.sbin/vmd/x86_vm.c
719
len -= n;
usr.sbin/vmd/x86_vm.c
758
size_t n, off;
usr.sbin/vmd/x86_vm.c
771
n = vmr->vmr_size - off;
usr.sbin/vmd/x86_vm.c
772
if (len < n)
usr.sbin/vmd/x86_vm.c
773
n = len;
usr.sbin/vmd/x86_vm.c
777
memset(to, 0, n);
usr.sbin/vmd/x86_vm.c
779
memcpy(to, from, n);
usr.sbin/vmd/x86_vm.c
780
from += n;
usr.sbin/vmd/x86_vm.c
782
len -= n;
usr.sbin/vmd/x86_vm.c
809
size_t n, off;
usr.sbin/vmd/x86_vm.c
822
n = vmr->vmr_size - off;
usr.sbin/vmd/x86_vm.c
823
if (len < n)
usr.sbin/vmd/x86_vm.c
824
n = len;
usr.sbin/vmd/x86_vm.c
827
memcpy(to, from, n);
usr.sbin/vmd/x86_vm.c
829
to += n;
usr.sbin/vmd/x86_vm.c
830
len -= n;
usr.sbin/ypldap/ldapclient.c
132
int n, wait_cnt = 0;
usr.sbin/ypldap/ldapclient.c
144
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ypldap/ldapclient.c
146
if (n == 0)
usr.sbin/ypldap/ldapclient.c
159
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ypldap/ldapclient.c
161
if (n == 0)
usr.sbin/ypldap/ldapclient.c
233
int n;
usr.sbin/ypldap/ldapclient.c
244
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ypldap/ldapclient.c
246
if (n == 0)
usr.sbin/ypldap/ldapclient.c
259
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ypldap/ldapclient.c
261
if (n == 0)
usr.sbin/ypldap/ypldap.c
352
int n;
usr.sbin/ypldap/ypldap.c
364
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ypldap/ypldap.c
366
if (n == 0)
usr.sbin/ypldap/ypldap.c
379
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ypldap/ypldap.c
381
if (n == 0)
usr.sbin/ypldap/ypldap.c
395
(void)memcpy(&ir, imsg.data, n - IMSG_HEADER_SIZE);
usr.sbin/ypldap/ypldap.c
421
(void)memcpy(&ir, imsg.data, n - IMSG_HEADER_SIZE);
usr.sbin/ypldap/ypldap.h
97
#define F_FIXED_ATTR(n) (1<<n)
usr.sbin/ypldap/ypldap.h
98
#define F_LIST(n) (1<<n)
usr.sbin/ypldap/ypldap_dns.c
135
int n, cnt;
usr.sbin/ypldap/ypldap_dns.c
150
if ((n = imsgbuf_read(ibuf)) == -1)
usr.sbin/ypldap/ypldap_dns.c
152
if (n == 0)
usr.sbin/ypldap/ypldap_dns.c
165
if ((n = imsg_get(ibuf, &imsg)) == -1)
usr.sbin/ypldap/ypldap_dns.c
167
if (n == 0)
usr.sbin/ypserv/ypserv/ypserv_db.c
529
datum k, v, n;
usr.sbin/ypserv/ypserv/ypserv_db.c
535
n.dptr = key.keydat_val;
usr.sbin/ypserv/ypserv/ypserv_db.c
536
n.dsize = key.keydat_len;
usr.sbin/ypserv/ypserv/ypserv_db.c
542
n = ypdb_setkey(db, n);
usr.sbin/ypserv/ypserv/ypserv_db.c
544
if (n.dptr != NULL)
usr.sbin/zic/zic.c
49
#define end(cp, n) (memchr((cp), '\0', (n)))
