| /freebsd/contrib/one-true-awk/testdir/ |
| H A D | t.addops | 3 if (n != $1 + $1) print NR, "urk +="
6 if (n != 0) print NR, "urk -="
9 if (n != 3.5 * $1) print NR, "urk *="
12 if (n != $1 / 4) print NR, "urk /="
13 n = NR
15 if (n != NR * NR) print NR, "urk1 ^=", n, NR * NR
16 n = NR
18 if (n != NR * NR) print NR, "urk1 **=", n, NR * NR
19 n = NR
22 sq = sprintf("%.10g", NR * sqrt(NR))
[all …]
|
| H A D | t.arith | 1 { print NR, $1, $1+$1, $1-$1, $1 * $1 }
2 { print NR, $1/NR, $1 % NR }
3 # { print NR, $1++, $1--, --$1, $1-- } # this depends on order of eval of args!
4 { print NR, -$1 }
5 $1 > 0 { print NR, $1 ^ 0.5 }
6 $1 > 0 { print NR, $1 ** 0.5 }
|
| H A D | t.coerce | 1 END { print i, NR
2 if (i < NR)
3 print i, NR
|
| H A D | p.41 | 1 NR >= 10 { exit }
2 END { if (NR < 10)
3 print FILENAME " has only " NR " lines" }
|
| H A D | t.pat | 3 /a/ && NR > 10
4 /a/ || NR > 10
|
| H A D | t.array | 1 { x[NR] = $0 }
5 while (i <= NR) {
|
| H A D | t.break1 | 1 { x[NR] = $0 }
3 for (i = 1; i <= NR; i++) {
|
| H A D | t.break2 | 1 { x[NR] = $0 }
3 for (i=1; i <= NR; i++) {
|
| H A D | t.delete2 | 1 NR < 50 { n = split($0, x)
11 printf "delete2 miscount %d vs %d at %d\n", k, n^2-n, NR
|
| H A D | T.lilly | 10 print "###", NR, $0
19 print "###", NR, $0
|
| H A D | p.table | 8 { row[NR] = $0
17 for (r = 1; r <= NR; r++) {
|
| H A D | T.redir | 13 $awk 'NR%2 == 1 { print >>"foo" }
14 NR%2 == 0 { print >"foo" }' /etc/passwd
|
| H A D | T.utfre | 31 input, awk, neg, re, NR, re, op, input)
32 # printf(" %3d %s %s %s:\n", NR, re, op, input)
|
| H A D | t.mod | 1 NR % 2 == 1
|
| H A D | p.28 | 1 { print NR ":" $0 }
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | IntervalMap.cpp | 40 NodeRef NR = path[l].subtree(path[l].offset - 1); in getLeftSibling() local
44 NR = NR.subtree(NR.size() - 1); in getLeftSibling()
45 return NR; in getLeftSibling()
65 NodeRef NR = subtree(l); in moveLeft() local
69 path[l] = Entry(NR, NR.size() - 1); in moveLeft()
70 NR = NR.subtree(NR.size() - 1); in moveLeft()
72 path[l] = Entry(NR, NR.size() - 1); in moveLeft()
90 NodeRef NR = path[l].subtree(path[l].offset + 1); in getRightSibling() local
94 NR = NR.subtree(0); in getRightSibling()
95 return NR; in getRightSibling()
[all …]
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/vdev_zaps/ |
| H A D | vdev_zaps_008_pos.ksh | 59 NR=$(zpool get -H -o value rotational $TESTPOOL $VDEV1)
60 [[ "$NR" == "on" || "$NR" == "off" ]] ||
61 log_fail "leaf $VDEV1: expected on/off, got '$NR'"
65 NR=$(zpool get -H -o value rotational $TESTPOOL "$MIRROR")
66 [[ "$NR" == "on" || "$NR" == "off" ]] ||
67 log_fail "mirror: expected on/off, got '$NR'"
70 NR=$(zpool get -H -o value rotational $TESTPOOL $SPARE)
71 [[ "$NR" == "on" || "$NR" == "off" ]] ||
72 log_fail "spare $SPARE: expected on/off, got '$NR'"
75 NR=$(zpool get -H -o value rotational $TESTPOOL $L2C)
[all …]
|
| /freebsd/sys/dev/ppbus/ |
| H A D | pcfclock.c | 92 #define NR(buf, off) (buf[off+1]*10+buf[off]) macro
96 NR(buf, 14) <= 99 && \
97 NR(buf, 12) <= 12 && \
98 NR(buf, 10) <= 31 && \
99 NR(buf, 6) <= 23 && \
100 NR(buf, 4) <= 59 && \
101 NR(buf, 2) <= 59)
208 year = NR(buf, 14); in pcfclock_display_data()
214 NR(buf, 10), NR(buf, 12), 1900 + year, in pcfclock_display_data()
215 NR(buf, 6), NR(buf, 4), NR(buf, 2), in pcfclock_display_data()
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/zvol/zvol_swap/ |
| H A D | zvol_swap.cfg | 28 SAVESWAPDEVS=$(swapon -s | awk '(NR != 1) {print $1}')
30 SAVESWAPDEVS=$(swapctl -l | awk '(NR != 1) {print $1}')
32 SAVESWAPDEVS=$(swap -l | awk '(NR != 1) {print $1}')
|
| /freebsd/contrib/llvm-project/llvm/lib/Analysis/ |
| H A D | ConstraintSystem.cpp | 77 SmallVector<Entry, 8> NR; in eliminateUsingFM() local
132 NR.emplace_back(N, CurrentId); in eliminateUsingFM()
134 if (NR.empty()) in eliminateUsingFM()
136 Constraints.push_back(std::move(NR)); in eliminateUsingFM()
|
| /freebsd/crypto/krb5/src/lib/krb5/krb/ |
| H A D | conv_princ.c | 78 #define NR(NAME) { NAME, NAME, 0, sizeof(NAME)-1 } macro
80 NR("kadmin"),
106 NR("zephyr"),
117 #undef NR
|
| /freebsd/contrib/tzdata/ |
| H A D | ziguard.awk | 351 linkline[$3] = NR
355 { line[NR] = $0 }
380 for (i = 1; i <= NR; i++)
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | IntervalMap.h | 1206 IntervalMapImpl::NodeRef NR = rootBranch().safeLookup(x); in treeSafeLookup() local
1208 NR = NR.get<Branch>().safeLookup(x); in treeSafeLookup()
1209 return NR.get<Leaf>().safeLookup(x, NotFound); in treeSafeLookup()
1511 IntervalMapImpl::NodeRef NR = path.subtree(path.height()); in pathFillFind() local
1513 unsigned p = NR.get<Branch>().safeFind(0, x); in pathFillFind()
1514 path.push(NR, p); in pathFillFind()
1515 NR = NR.subtree(p); in pathFillFind()
1517 path.push(NR, NR.get<Leaf>().safeFind(0, x)); in pathFillFind()
1679 } else if (NodeRef NR = P.getLeftSibling(P.height())) { in canCoalesceLeft() local
1680 unsigned i = NR.size() - 1; in canCoalesceLeft()
[all …]
|
| H A D | ilist_iterator.h | 115 explicit ilist_iterator(reference NR) : NodePtr(Access::getNodePtr(&NR)) {}
257 explicit ilist_iterator_w_bits(reference NR)
258 : NodePtr(Access::getNodePtr(&NR)) {}
|
| /freebsd/sys/contrib/openzfs/tests/zfs-tests/include/ |
| H A D | kstat.shlib | 265 NR == 1 && $0 !~ oidre { exit 1 }
266 NR == 1 { prev = substr($0, length(oid)+2) ; next }
272 NR == 1 && $0 ~ oidre { exit 2 }
405 NR == 1 && ! /^[0-9]+ 1 / { exit 2 }
406 NR < 3 { next }
414 NR == 1 && /^[0-9]+ [^1] / { exit 2 }
415 NR < 3 { next }
422 NR == 1 && /^[0-9]+ 1 / { exit 1 }
|