/freebsd/ |
H A D | .cirrus.yml | 117 - pw useradd -n user -m 123 …- su user -c "make -j$(sysctl -n hw.ncpu) ${EXTRA_MAKE_FLAGS} CROSS_TOOLCHAIN=${TOOLCHAIN} WITHOUT… 126 …- su user -c "make -j$(sysctl -n hw.ncpu) CROSS_TOOLCHAIN=${TOOLCHAIN} WITHOUT_TOOLCHAIN=yes build… 141 …- if ! git diff --exit-code; then printf "\n>>> Generated sysent files not updated, run make sysen… 145 …f ! make -C include/ check-ldirs; then printf "\n>>> include/Makefile lists nonexistant directorie… 152 …nes "^.Dd" share/man/man5/src.conf.5; then printf "\n>>> src.conf.5 was not updated as required <<… 153 …-q "no description found" /tmp/makeman.out; then printf "\n>>> Missing description files <<<\n"; f…
|
H A D | Makefile.inc1 | 1415 libs=$$(ldd -f "%o %p\n" -f "%o %p\n" $$progs 2>/dev/null | sort -u | grep -Ev '\[.*]' | \ 2289 printf "version = 2;\n" > ${WSTAGEDIR}/meta
|
H A D | ObsoleteFiles.inc | 5794 OLD_FILES+=usr/share/terminfo/n/n7900 5851 OLD_FILES+=usr/share/terminfo/n/ncsa 5852 OLD_FILES+=usr/share/terminfo/n/ncsa-m 5857 OLD_FILES+=usr/share/terminfo/n/nd9500 5866 OLD_FILES+=usr/share/terminfo/n/nec 5869 OLD_FILES+=usr/share/terminfo/n/newhp 5871 OLD_FILES+=usr/share/terminfo/n/news 5881 OLD_FILES+=usr/share/terminfo/n/news-a 5882 OLD_FILES+=usr/share/terminfo/n/news-o 5900 OLD_FILES+=usr/share/terminfo/n/next [all …]
|
H A D | UPDATING | 2113 configuration must include the correct COMPAT_FREEBSD<n> option for
|
/freebsd/.github/workflows/ |
H A D | cross-bootstrap-tools.yml | 55 if [ -n "${{ matrix.cross-bindir }}" ]; then 63 …e.py --debug $EXTRA_BUILD_ARGS TARGET=${{ matrix.target }} TARGET_ARCH=${{ matrix.target_arch }} -n
|
/freebsd/bin/date/ |
H A D | vary.c | 498 struct vary *n; in vary_destroy() local 501 n = v->next; in vary_destroy() 503 v = n; in vary_destroy()
|
/freebsd/bin/dd/ |
H A D | dd.c | 381 ssize_t n; in dd_in() local 418 if (n == 0 && in.dbrcnt == 0) in dd_in() 422 if (n == -1) { in dd_in() 449 n = in.dbsz; in dd_in() 452 in.dbrcnt += n; in dd_in() 478 if ((n = in.dbrcnt) & 1) { in dd_in() 480 --n; in dd_in() 542 size_t cnt, n; in dd_out() local 570 for (n = force ? out.dbcnt : out.dbsz;; n = out.dbsz) { in dd_out() 571 cnt = n; in dd_out() [all …]
|
H A D | position.c | 52 off_t n; in seek_offset() local 55 n = io->offset; in seek_offset() 67 if ((io->flags & ISCHR) == 0 && (n < 0 || n > OFF_MAX / (ssize_t)sz)) in seek_offset() 74 return ((off_t)( (uint64_t)n * sz )); in seek_offset() 155 ssize_t n; in pos_out() local 187 n = read(out.fd, out.db, out.dbsz); in pos_out() 189 if (n > 0) in pos_out() 191 if (n == -1) in pos_out() 206 n = write(out.fd, out.db, out.dbsz); in pos_out() 208 if (n == -1) in pos_out() [all …]
|
/freebsd/bin/ed/ |
H A D | POSIX | 21 i) `s' (i.e., s[n][rgp]*) to repeat a previous substitution,
|
H A D | buf.c | 144 long n = 0; in get_line_node_addr() local 147 n++; in get_line_node_addr() 148 if (n && cp == &buffer_head) { in get_line_node_addr() 152 return n; in get_line_node_addr() 164 if (n > on) in get_addressed_line_node() 166 for (; on < n; on++) in get_addressed_line_node() 174 if (n >= on >> 1) in get_addressed_line_node() 175 for (; on > n; on--) in get_addressed_line_node() 179 for (on = 0; on < n; on++) in get_addressed_line_node() 232 quit(int n) in quit() argument [all …]
|
H A D | ed.h | 113 #define REALLOC(b,n,i,err) \ argument 114 if ((i) > (n)) { \ 115 size_t ti = (n); \ 133 (n) = ti; \ 139 #define REALLOC(b,n,i,err) \ argument 140 if ((i) > (n)) { \ 141 size_t ti = (n); \ 150 (n) = ti; \
|
H A D | glbl.c | 42 long n; in build_active_list() local 55 for (n = first_addr; n <= second_addr; n++, lp = lp->q_forw) { in build_active_list() 78 int n; in exec_global() local 99 while ((n = get_tty_line()) > 0 && in exec_global() 100 ibuf[n - 1] != '\n') in exec_global() 102 if (n < 0) in exec_global() 104 else if (n == 0) { in exec_global() 107 } else if (n == 1 && !strcmp(ibuf, "\n")) in exec_global() 109 else if (n == 2 && !strcmp(ibuf, "&\n")) { in exec_global() 117 REALLOC(ocmd, ocmdsz, n + 1, ERR); in exec_global() [all …]
|
H A D | io.c | 33 read_file(char *fn, long n) in read_file() argument 57 return current_addr - n; in read_file() 66 read_stream(FILE *fp, long n) in read_stream() argument 164 return n ? m - n + 1 : 0; in write_file() 177 for (; n && n <= m; n++, lp = lp->q_forw) { in write_stream() 211 int l, n; in get_extended_line() local 226 if ((n = get_tty_line()) < 0) in get_extended_line() 228 else if (n == 0 || ibuf[n - 1] != '\n') { in get_extended_line() 233 memcpy(cvbuf + l, ibuf, n); in get_extended_line() 234 l += n; in get_extended_line() [all …]
|
H A D | main.c | 92 int c, n; in main() local 279 long n; in next_addr() local 295 addr += (c == '-' || c == '^') ? -n : n; in next_addr() 438 int n = 0; in exec_command() local 738 n++; in exec_command() 768 if ((n = *ibufp) == 'q' || n == 'Q') { in exec_command() 882 if ((n = dir ? INC_MOD(n, addr_last) : DEC_MOD(n, addr_last))) { in get_matching_node_addr() 904 int n; in get_filename() local 917 if (n) in get_filename() 1335 size_t n; in handle_hup() local [all …]
|
H A D | re.c | 44 int n; in get_compiled_pattern() local 64 if ((n = regcomp(expr, exprs, 0))) { in get_compiled_pattern() 65 regerror(n, expr, error, sizeof error); in get_compiled_pattern()
|
H A D | sub.c | 72 int n = 0; in extract_subst_template() local 93 while ((n = get_tty_line()) == 0 || in extract_subst_template() 94 (n > 0 && ibuf[n - 1] != '\n')) in extract_subst_template() 96 if (n < 0) in extract_subst_template() 228 int n; in apply_subst_template() local 239 (n = *sub - '0') <= re_nsub) { in apply_subst_template() 240 j = rm[n].rm_so; in apply_subst_template() 241 k = rm[n].rm_eo; in apply_subst_template()
|
H A D | undo.c | 85 long n; in pop_undo_stack() local 96 for (n = u_p; n-- > 0;) { in pop_undo_stack() 99 REQUE(ustack[n].h->q_back, ustack[n].t->q_forw); in pop_undo_stack() 102 REQUE(ustack[n].h->q_back, ustack[n].h); in pop_undo_stack() 103 REQUE(ustack[n].t, ustack[n].t->q_forw); in pop_undo_stack() 107 REQUE(ustack[n - 1].h, ustack[n].h->q_forw); in pop_undo_stack() 108 REQUE(ustack[n].t->q_back, ustack[n - 1].t); in pop_undo_stack() 109 REQUE(ustack[n].h, ustack[n].t); in pop_undo_stack() 110 n--; in pop_undo_stack() 119 for (n = u_p; n-- > (u_p + 1)/ 2;) in pop_undo_stack() [all …]
|
/freebsd/bin/ed/test/ |
H A D | s2.r | 1 li(n)e 1 2 i(n)e 200 3 li(n)e 3 4 li(n)e 4 5 li(n)e500
|
/freebsd/bin/kill/ |
H A D | kill.c | 149 int n; in signame_to_signum() local 153 for (n = 1; n < sys_nsig; n++) { in signame_to_signum() 154 if (!strcasecmp(sys_signame[n], sig)) in signame_to_signum() 155 return (n); in signame_to_signum() 176 int n; in printsignals() local 178 for (n = 1; n < sys_nsig; n++) { in printsignals() 179 (void)fprintf(fp, "%s", sys_signame[n]); in printsignals() 180 if (n == (sys_nsig / 2) || n == (sys_nsig - 1)) in printsignals()
|
/freebsd/bin/ls/ |
H A D | ls.c | 76 #define MAKENINES(n) \ argument 81 for (__i = 1; n > 0; __i *= 10) \ 82 n--; \ 83 n = __i - 1; \
|
H A D | util.c | 56 int i, n; in prn_normal() local 60 n = 0; in prn_normal() 70 n++; in prn_normal() 79 return (n); in prn_normal() 87 int i, n; in prn_printable() local 91 n = 0; in prn_printable() 96 n++; in prn_printable() 102 n++; in prn_printable() 108 n++; in prn_printable() 114 n += wcwidth(wc); in prn_printable() [all …]
|
/freebsd/bin/ls/tests/ |
H A D | ls_tests.sh | 579 bc_expr="$(printf "scale=%s\n%s/%s\nquit" $scale $file_size $divisor)"
|
/freebsd/bin/pax/tests/ |
H A D | legacy_test.pl | 9 my $n = 0; 13 $n++; 17 print $fd "file $n\n"; 49 my $n = 0;
|
/freebsd/bin/ps/ |
H A D | print.c | 752 #define CHKINF127(n) (((n) > 127) && (v->flag & INF127) ? 127 : (n)) in printval() argument
|
H A D | ps.c | 1084 for (n = src; n < src + nsrc; n++) { in descendant_sort() 1086 if (maxlvl < ki[n].ki_d.level) in descendant_sort() 1087 maxlvl = ki[n].ki_d.level; in descendant_sort() 1127 for (n = 0; n < lvl - 2; n++) { in descendant_sort() 1128 ki[src].ki_d.prefix[n * 2] = in descendant_sort() 1129 path[n / 8] & 1 << (n % 8) ? '|' : ' '; in descendant_sort() 1130 ki[src].ki_d.prefix[n * 2 + 1] = ' '; in descendant_sort() 1132 if (n == lvl - 2) { in descendant_sort() 1142 path[n / 8] |= 1 << (n % 8); in descendant_sort() 1144 path[n / 8] &= ~(1 << (n % 8)); in descendant_sort() [all …]
|