Home
last modified time | relevance | path

Searched +full:non +full:- +full:negative (Results 1 – 25 of 1063) sorted by relevance

12345678910>>...43

/freebsd/contrib/llvm-project/libcxx/include/__iterator/
H A Dadvance.h1 // -*- C++ -*-
2 //===----------------------------------------------------------------------===//
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
8 //===----------------------------------------------------------------------===//
40 for (; __n > 0; --__n) in __advance()
48 for (; __n > 0; --__n) in __advance()
52 --__i; in __advance()
68 …// Calling `advance` with a negative value on a non-bidirectional iterator is a no-op in the curre… in advance()
70 … "Attempt to advance(it, n) with negative n on a non-bidirectional iterator"); in advance()
86 --__n; in __advance_forward()
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_user/zfs_list/
H A Dzfs_list_008_neg.ksh1 #!/bin/ksh -p
2 # SPDX-License-Identifier: CDDL-1.0
11 # or https://opensource.org/licenses/CDDL-1.0.
37 # A negative depth or a non numeric depth should fail in 'zfs list -d <n>'
40 # 1. Run zfs list -d with negative depth or non numeric depth
46 log_assert "A negative depth or a non numeric depth should fail in 'zfs list -d <n>'"
48 set -A badargs "a" "AB" "aBc" "2A" "a2b" "aB2" "-1" "-32" "-999"
50 typeset -i i=0
53 log_mustnot eval "zfs list -d ${badargs[i]} $DEPTH_FS >/dev/null 2>&1"
57 log_pass "A negative depth or a non numeric depth should fail in 'zfs list -d <n>'"
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/cli_root/zfs_get/
H A Dzfs_get_010_neg.ksh1 #!/bin/ksh -p
2 # SPDX-License-Identifier: CDDL-1.0
11 # or https://opensource.org/licenses/CDDL-1.0.
38 # A negative depth or a non numeric depth should fail in 'zfs get -d <n>'
41 # 1. Run zfs get -d with negative depth or non numeric depth
47 log_assert "A negative depth or a non numeric depth should fail in 'zfs get -d <n>'"
49 set -A badargs "a" "AB" "aBc" "2A" "a2b" "aB2" "-1" "-32" "-999"
51 typeset -i i=0
54 log_mustnot eval "zfs get -d ${badargs[i]} $TESTPOOL/$TESTFS >/dev/null 2>&1"
58 log_pass "A negative depth or a non numeric depth should fail in 'zfs get -d <n>'"
/freebsd/tests/sys/cddl/zfs/tests/cli_user/zfs_list/
H A Dzfs_list_008_neg.ksh1 #!/usr/local/bin/ksh93 -p
37 # A negative depth or a non numeric depth should fail in 'zfs list -d <n>'
40 # 1. Run zfs list -d with negative depth or non numeric depth
47 # CODING_STATUS: COMPLETED (2009-05-26)
56 log_unsupported "'zfs list -d' is not supported."
59 log_assert "A negative depth or a non numeric depth should fail in 'zfs list -d <n>'"
61 set -A badargs "a" "AB" "aBc" "2A" "a2b" "aB2" "-1" "-32" "-999"
63 typeset -i i=0
66 log_mustnot eval "run_unprivileged $ZFS list -d ${badargs[i]} $DEPTH_FS >/dev/null 2>&1"
70 log_pass "A negative depth or a non numeric depth should fail in 'zfs list -d <n>'"
/freebsd/tests/sys/cddl/zfs/tests/cli_root/zfs_get/
H A Dzfs_get_010_neg.ksh1 #!/usr/local/bin/ksh93 -p
37 # A negative depth or a non numeric depth should fail in 'zfs get -d <n>'
40 # 1. Run zfs get -d with negative depth or non numeric depth
47 # CODING_STATUS: COMPLETED (2009-05-22)
56 log_unsupported "'zfs get -d' is not supported."
59 log_assert "A negative depth or a non numeric depth should fail in 'zfs get -d <n>'"
61 set -A badargs "a" "AB" "aBc" "2A" "a2b" "aB2" "-1" "-32" "-999"
63 typeset -i i=0
66 log_mustnot eval "$ZFS get -d ${badargs[i]} $TESTPOOL/$TESTFS >/dev/null 2>&1"
70 log_pass "A negative depth or a non numeric depth should fail in 'zfs get -d <n>'"
/freebsd/contrib/processor-trace/libipt/include/
H A Dintel-pt.h2 * Copyright (c) 2013-2019, Intel Corporation
44 * - Version
45 * - Errors
46 * - Configuration
47 * - Packet encoder / decoder
48 * - Query decoder
49 * - Traced image
50 * - Instruction flow decoder
51 * - Block decoder
163 /* No wall-clock time is available. */
[all …]
H A Dintel-pt.h.in2 * Copyright (c) 2013-2019, Intel Corporation
44 * - Version
45 * - Errors
46 * - Configuration
47 * - Packet encoder / decoder
48 * - Query decoder
49 * - Traced image
50 * - Instruction flow decoder
51 * - Block decoder
163 /* No wall-clock time is available. */
[all …]
/freebsd/lib/libcuse/
H A Dcuse.32 .\" Copyright (c) 2010-2022 Hans Petter Selasky
38 .Bd -literal -offset indent
56 This function returns 0 on success or a negative value on failure.
69 This function returns 0 on success or a negative value on failure.
78 This function returns 0 on success or a negative value on failure.
92 This function returns 0 on success or a negative value on failure.
100 This function returns 0 on success or a negative value on failure.
109 If both the unit and id argument is -1, all allocated units will be freed.
110 This function returns 0 on success or a negative value on failure.
129 offset having to fit into a 32-bit variable typically for 32-bit
[all …]
/freebsd/contrib/bc/manuals/bc/
H A DH.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 bc \- arbitrary\-precision decimal arithmetic language and calculator
34 \f[B]bc\f[R] [\f[B]\-cCghilPqRsvVw\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
35 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-global\-stacks\f[R]]
36 [\f[B]\-\-help\f[R]] [\f[B]\-\-interactive\f[R]] [\f[B]\-\-mathlib\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-quiet\f[R]] [\f[B]\-\-standard\f[R]] [\f[B]\-\-warn\f[R]]
39 [\f[B]\-\-version\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
40 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
[all …]
H A DHN.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 bc \- arbitrary\-precision decimal arithmetic language and calculator
34 \f[B]bc\f[R] [\f[B]\-cCghilPqRsvVw\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
35 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-global\-stacks\f[R]]
36 [\f[B]\-\-help\f[R]] [\f[B]\-\-interactive\f[R]] [\f[B]\-\-mathlib\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-quiet\f[R]] [\f[B]\-\-standard\f[R]] [\f[B]\-\-warn\f[R]]
39 [\f[B]\-\-version\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
40 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
[all …]
H A DA.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 bc \- arbitrary\-precision decimal arithmetic language and calculator
34 \f[B]bc\f[R] [\f[B]\-cCghilPqRsvVw\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
35 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-global\-stacks\f[R]]
36 [\f[B]\-\-help\f[R]] [\f[B]\-\-interactive\f[R]] [\f[B]\-\-mathlib\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-quiet\f[R]] [\f[B]\-\-standard\f[R]] [\f[B]\-\-warn\f[R]]
39 [\f[B]\-\-version\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
40 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
[all …]
H A DN.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 bc \- arbitrary\-precision decimal arithmetic language and calculator
34 \f[B]bc\f[R] [\f[B]\-cCghilPqRsvVw\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
35 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-global\-stacks\f[R]]
36 [\f[B]\-\-help\f[R]] [\f[B]\-\-interactive\f[R]] [\f[B]\-\-mathlib\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-quiet\f[R]] [\f[B]\-\-standard\f[R]] [\f[B]\-\-warn\f[R]]
39 [\f[B]\-\-version\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
40 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
[all …]
H A DN.1.md1 <!---
3 SPDX-License-Identifier: BSD-2-Clause
5 Copyright (c) 2018-2025 Gavin D. Howard and contributors.
29 -->
33 bc - arbitrary-precision decimal arithmetic language and calculator
37 …-cCghilPqRsvVw**] [**-\-digit-clamp**] [**-\-no-digit-clamp**] [**-\-global-stacks**] [**-\-help**…
43 precision decimal arithmetic and is somewhat C-like, but there are differences.
49 This bc(1) is a drop-in replacement for *any* bc(1), including (and
56 command-line option **-r** *keyword*, where *keyword* is the keyword that is
66 **-C**, **-\-no-digit-clamp**
[all …]
H A DA.1.md1 <!---
3 SPDX-License-Identifier: BSD-2-Clause
5 Copyright (c) 2018-2025 Gavin D. Howard and contributors.
29 -->
33 bc - arbitrary-precision decimal arithmetic language and calculator
37 …-cCghilPqRsvVw**] [**-\-digit-clamp**] [**-\-no-digit-clamp**] [**-\-global-stacks**] [**-\-help**…
43 precision decimal arithmetic and is somewhat C-like, but there are differences.
49 This bc(1) is a drop-in replacement for *any* bc(1), including (and
56 command-line option **-r** *keyword*, where *keyword* is the keyword that is
66 **-C**, **-\-no-digit-clamp**
[all …]
H A DHN.1.md1 <!---
3 SPDX-License-Identifier: BSD-2-Clause
5 Copyright (c) 2018-2025 Gavin D. Howard and contributors.
29 -->
33 bc - arbitrary-precision decimal arithmetic language and calculator
37 …-cCghilPqRsvVw**] [**-\-digit-clamp**] [**-\-no-digit-clamp**] [**-\-global-stacks**] [**-\-help**…
43 precision decimal arithmetic and is somewhat C-like, but there are differences.
49 This bc(1) is a drop-in replacement for *any* bc(1), including (and
56 command-line option **-r** *keyword*, where *keyword* is the keyword that is
66 **-C**, **-\-no-digit-clamp**
[all …]
H A DH.1.md1 <!---
3 SPDX-License-Identifier: BSD-2-Clause
5 Copyright (c) 2018-2025 Gavin D. Howard and contributors.
29 -->
33 bc - arbitrary-precision decimal arithmetic language and calculator
37 …-cCghilPqRsvVw**] [**-\-digit-clamp**] [**-\-no-digit-clamp**] [**-\-global-stacks**] [**-\-help**…
43 precision decimal arithmetic and is somewhat C-like, but there are differences.
49 This bc(1) is a drop-in replacement for *any* bc(1), including (and
56 command-line option **-r** *keyword*, where *keyword* is the keyword that is
66 **-C**, **-\-no-digit-clamp**
[all …]
/freebsd/contrib/bc/manuals/dc/
H A DA.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator
34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]]
35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...]
[all …]
H A DN.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator
34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]]
35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...]
[all …]
H A DHN.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator
34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]]
35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...]
[all …]
H A DH.12 .\" SPDX-License-Identifier: BSD-2-Clause
4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors.
32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator
34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]]
35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]]
36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]]
37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]]
38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]]
39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...]
40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...]
[all …]
/freebsd/crypto/openssl/crypto/bn/
H A Dbn_mod.c2 * Copyright 1998-2024 The OpenSSL Project Authors. All Rights Reserved.
17 * like BN_mod, but returns non-negative remainder (i.e., 0 <= r < |d| in BN_nnmod()
28 if (!r->neg) in BN_nnmod()
30 /* now -|d| < r < 0, so we have to set r := r + |d| */ in BN_nnmod()
31 return (d->neg ? BN_sub : BN_add) (r, r, d); in BN_nnmod()
43 * BN_mod_add variant that may be used if both a and b are non-negative and
57 size_t i, ai, bi, mtop = m->top; in bn_mod_add_fixed_top()
71 ap = a->d != NULL ? a->d : tp; in bn_mod_add_fixed_top()
72 bp = b->d != NULL ? b->d : tp; in bn_mod_add_fixed_top()
75 mask = (BN_ULONG)0 - ((i - a->top) >> (8 * sizeof(i) - 1)); in bn_mod_add_fixed_top()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Dmodsi3.S8 * dividend -- the thing being divided
9 * divisor -- how many ways to divide it
11 * N -- how many bits per iteration we try to get
13 * WORDSIZE -- how many bits altogether we're talking about:
16 * TOPBITS -- how many bits are in the top "decade" of a number:
19 * Q -- the partial quotient under development -- initially 0
20 * R -- the remainder so far -- initially == the dividend
21 * ITER -- number of iterations of the main division loop which will
24 * V -- the current comparand -- initially divisor*2ˆ(ITER*4-1)
26 * current estimate for non-large dividend is
[all …]
H A Ddivsi3.S8 * dividend -- the thing being divided
9 * divisor -- how many ways to divide it
11 * N -- how many bits per iteration we try to get
13 * WORDSIZE -- how many bits altogether we're talking about:
16 * TOPBITS -- how many bits are in the top "decade" of a number:
19 * Q -- the partial quotient under development -- initially 0
20 * R -- the remainder so far -- initially == the dividend
21 * ITER -- number of iterations of the main division loop which will
24 * V -- the current comparand -- initially divisor*2ˆ(ITER*4-1)
26 * current estimate for non-large dividend is
[all …]
/freebsd/contrib/processor-trace/libipt/internal/include/
H A Dpt_insn.h2 * Copyright (c) 2016-2019, Intel Corporation
34 #include "intel-pt.h"
39 /* A finer-grain classification of instructions used internally. */
94 /* Instruction-specific information. */
109 * non-zero: direct
124 * Returns non-zero if it does, zero if it doesn't (or @insn/@iext is NULL).
131 * Returns non-zero if it does, zero if it doesn't (or @insn/@iext is NULL).
138 * Returns non-zero if it is, zero if it isn't (or @insn/@iext is NULL).
145 * Returns non-zero if it is, zero if it isn't (or @insn/@iext is NULL).
152 * Returns non-zero if it does, zero if it doesn't (or @insn/@iext is NULL).
[all …]
/freebsd/contrib/libpcap/
H A Dpcap_activate.3pcap22 pcap_activate \- activate a capture handle
42 on success without warnings, a non-zero positive value on
43 success with warnings, and a negative value on error.
44 A non-zero return value indicates what warning or error condition
121 should check for positive, negative, and zero return codes, and treat
122 all positive return codes as warnings and all negative return

12345678910>>...43