Home
last modified time | relevance | path

Searched full:count (Results 1 – 25 of 5034) sorted by relevance

12345678910>>...202

/freebsd/sys/netinet/
H A Din_kdtrace.h60 SDT_PROBE_DECLARE(mib, ip, count, ips_total);
61 SDT_PROBE_DECLARE(mib, ip, count, ips_badsum);
62 SDT_PROBE_DECLARE(mib, ip, count, ips_tooshort);
63 SDT_PROBE_DECLARE(mib, ip, count, ips_toosmall);
64 SDT_PROBE_DECLARE(mib, ip, count, ips_badhlen);
65 SDT_PROBE_DECLARE(mib, ip, count, ips_badlen);
66 SDT_PROBE_DECLARE(mib, ip, count, ips_fragments);
67 SDT_PROBE_DECLARE(mib, ip, count, ips_fragdropped);
68 SDT_PROBE_DECLARE(mib, ip, count, ips_fragtimeout);
69 SDT_PROBE_DECLARE(mib, ip, count, ips_forward);
[all …]
/freebsd/sys/contrib/dev/acpica/compiler/
H A Daslcompiler.l187 count (int type);
217 [ ] { count (0); }
218 [\n] { count (0); } /* Handle files with both LF and CR/LF */
219 [\r] { count (0); } /* termination on both Unix and Windows */
220 [ \t] { count (0); }
228 ";" { count (0); return(';'); }
232 "~" { count (3); return (PARSEOP_EXP_NOT); }
233 "!" { count (3); return (PARSEOP_EXP_LOGICAL_NOT); }
234 "*" { count (3); return (PARSEOP_EXP_MULTIPLY); }
235 "/" { count (3); return (PARSEOP_EXP_DIVIDE); }
[all …]
/freebsd/lib/libpmc/
H A Dpmc.amd.372 .It Li count= Ns Ar value
77 Configure the counter to only count negated-to-asserted transitions
84 .Dq Li count
88 .Dq Li count
96 Configure the PMC to count events happening at privilege level 0.
98 Configure the PMC to count events occurring at privilege levels 1, 2
112 Count the number of clock cycles when the CPU is not in the HLT or
116 Count fill requests that missed in the L2 cache.
125 Count data cache fill requests.
127 Count instructio
[all...]
/freebsd/contrib/libxo/tests/core/saved/
H A Dtest_08.X.out1count>1412</count></item><item><name key="key">rope</name><count>85</count></item><item><name key=…
H A Dtest_08.XP.out6 <count>1412</count>
10 <count>85</count>
14 <count>0</count>
18 <count>4123</count>
22 <count>17</count>
30 <count>1412</count>
34 <count>85</count>
38 <count>0</count>
42 <count>4123</count>
46 <count>17</count>
[all …]
H A Dtest_08.J.out1count":1412}, {"name":"rope","count":85}, {"name":"ladder","count":0}, {"name":"bolt","count":4123…
H A Dtest_08.JP.out8 "count": 1412
12 "count": 85
16 "count": 0
20 "count": 4123
24 "count": 17
34 "count": 1412
38 "count": 85
42 "count": 0
46 "count": 4123
50 "count": 17
[all …]
H A Dtest_08.JPu.out8 "count": 1412
12 "count": 85
16 "count": 0
20 "count": 4123
24 "count": 17
34 "count": 1412
38 "count": 85
42 "count": 0
46 "count": 4123
50 "count": 17
[all …]
/freebsd/sys/x86/include/
H A Dbus.h256 * Read `count' 1, 2, 4, or 8 byte quantities from bus space
262 size_t count);
267 size_t count);
272 size_t count);
276 bus_size_t offset, u_int8_t *addr, size_t count) in bus_space_read_multi_1() argument
280 insb(bsh + offset, addr, count); in bus_space_read_multi_1()
286 "=D" (addr), "=c" (count) : in bus_space_read_multi_1()
287 "r" (bsh + offset), "0" (addr), "1" (count) : in bus_space_read_multi_1()
294 bus_size_t offset, u_int16_t *addr, size_t count) in bus_space_read_multi_2() argument
298 insw(bsh + offset, addr, count); in bus_space_read_multi_2()
[all …]
/freebsd/sys/sys/
H A Drefcount.h43 * Attempt to handle reference count overflow and underflow. Force the counter
49 _refcount_update_saturated(volatile u_int *count) in _refcount_update_saturated() argument
52 panic("refcount %p wraparound", count); in _refcount_update_saturated()
54 atomic_store_int(count, REFCOUNT_SATURATION_VALUE); in _refcount_update_saturated()
59 refcount_init(volatile u_int *count, u_int value) in refcount_init() argument
63 atomic_store_int(count, value); in refcount_init()
67 refcount_load(volatile const u_int *count) in refcount_load() argument
69 return (atomic_load_int(count)); in refcount_load()
73 refcount_acquire(volatile u_int *count) in refcount_acquire() argument
77 old = atomic_fetchadd_int(count, 1); in refcount_acquire()
[all …]
/freebsd/contrib/nvi/vi/
H A Dv_cmd.c32 "[count]^A",
36 "[count]^B",
44 "[count]^D",
45 "^D scroll down by half screens (setting count)"},
48 "[count]^E",
52 "[count]^F",
60 "[count]^H",
66 "[count]^J",
76 "[count]^M",
80 "[count]^N",
[all …]
/freebsd/share/doc/usd/13.viref/
H A Dvi.cmd.roff234 The optional count prefix available for some of the
237 or the count prefix available for the
251 if the optional count prefix is specified for both the
262 .KY "count"
263 .IP "count"
266 or as a repeat count (for commands that modify text).
267 The count argument is always optional and defaults to 1 unless otherwise
275 .LI [count] ,
369 .IP "[count] <control-A>"
371 .LI count
[all …]
/freebsd/contrib/nvi/man/
H A Dvi.1529 .It Ar count
543 .Ar count ,
547 .Ar count ,
559 .Op Ar count
563 .Ar count
568 .Op Ar count
572 .Ar count
575 .Ar count
586 .Op Ar count
590 .Ar count
[all …]
/freebsd/contrib/cortex-strings/src/aarch64/
H A Dmemset.S65 #define count x2 macro
88 add dstend, dstin, count
90 cmp count, 96
92 cmp count, 16
97 tbz count, 3, 1f
102 1: tbz count, 2, 2f
106 2: cbz count, 3f
108 tbz count, 1, 3f
115 tbnz count, 6, L(set96)
117 tbz count, 5, 1f
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/aarch64/
H A Dsme-libc-mem-routines.S19 #define count x2 macro
38 #define G_l count
58 add srcend1, src, count
59 add dstend1, dstin, count
60 cmp count, 128
62 cmp count, 32
66 cmp count, 16
76 tbz count, 3, L(copy8)
86 tbz count, 2, L(copy4)
95 cbz count, L(copy0)
[all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/icelakex/
H A Dfloating-point.json15count twice as noted below. Each count represents 2 computation operations, one for each element.…
21count twice as noted below. Each count represents 2 computation operations, one for each element.…
26count twice as noted below. Each count represents 4 computation operations, one for each element.…
32count twice as noted below. Each count represents 4 computation operations, one for each element.…
37count twice as noted below. Each count represents 4 computation operations, one for each element.…
43count twice as noted below. Each count represents 4 computation operations, one for each element.…
48count twice as noted below. Each count represents 8 computation operations, one for each element.…
54count twice as noted below. Each count represents 8 computation operations, one for each element.…
59count twice as noted below. Each count represents 8 computation operations, one for each element.…
65count twice as noted below. Each count represents 8 computation operations, one for each element.…
[all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/icelake/
H A Dfloating-point.json15count twice as noted below. Each count represents 2 computation operations, one for each element.…
21count twice as noted below. Each count represents 2 computation operations, one for each element.…
26count twice as noted below. Each count represents 4 computation operations, one for each element.…
32count twice as noted below. Each count represents 4 computation operations, one for each element.…
37count twice as noted below. Each count represents 4 computation operations, one for each element.…
43count twice as noted below. Each count represents 4 computation operations, one for each element.…
48count twice as noted below. Each count represents 8 computation operations, one for each element.…
54count twice as noted below. Each count represents 8 computation operations, one for each element.…
59count twice as noted below. Each count represents 8 computation operations, one for each element.…
65count twice as noted below. Each count represents 8 computation operations, one for each element.…
[all …]
/freebsd/lib/libpmc/pmu-events/arch/x86/tigerlake/
H A Dfloating-point.json14count twice as noted below. Each count represents 2 computation operations, one for each element.…
20count twice as noted below. Each count represents 2 computation operations, one for each element.…
25count twice as noted below. Each count represents 4 computation operations, one for each element.…
31count twice as noted below. Each count represents 4 computation operations, one for each element.…
36count twice as noted below. Each count represents 4 computation operations, one for each element.…
42count twice as noted below. Each count represents 4 computation operations, one for each element.…
47count twice as noted below. Each count represents 8 computation operations, one for each element.…
53count twice as noted below. Each count represents 8 computation operations, one for each element.…
58count twice as noted below. Each count represents 8 computation operations, one for each element.…
64count twice as noted below. Each count represents 8 computation operations, one for each element.…
[all …]
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/direct/
H A Ddio_property.ksh59 count=8
69 check_write $TESTPOOL $tmp_file $rs $count 0 "" 1 $((count - 1))
72 check_write $TESTPOOL $tmp_file $rs $count 0 "" 0 $count
75 check_write $TESTPOOL $tmp_file $((rs / 2)) $((2 * count)) 0 "" $((2 * count)) 0
78 check_write $TESTPOOL $tmp_file 512 $count 0 "" $count 0
82 check_read $TESTPOOL $tmp_file $rs $count 0 "" 0 $count
85 check_read $TESTPOOL $tmp_file $((rs / 2)) $((count * 2)) 0 "" 0 $((2 * count))
88 check_read $TESTPOOL $tmp_file 512 $count 0 "" 1 0
101 check_write $TESTPOOL $tmp_file $rs $count 0 "-D" $count 0
104 check_write $TESTPOOL $tmp_file $rs $count 0 "-D" $count 0
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dallocator_common.h24 Count = N; in setFromArray()
25 memcpy(Batch, Array, sizeof(Batch[0]) * Count); in setFromArray()
28 DCHECK_LE(N, MaxNumCached - Count); in appendFromArray()
29 memcpy(Batch + Count, Array, sizeof(Batch[0]) * N); in appendFromArray()
31 Count = static_cast<u16>(Count + N); in appendFromArray()
34 DCHECK_LE(N, MaxNumCached - Count); in appendFromTransferBatch()
35 DCHECK_GE(B->Count, N); in appendFromTransferBatch()
37 memcpy(Batch + Count, B->Batch + (B->Count - N), sizeof(Batch[0]) * N); in appendFromTransferBatch()
39 Count = static_cast<u16>(Count + N); in appendFromTransferBatch()
40 B->Count = static_cast<u16>(B->Count - N); in appendFromTransferBatch()
[all …]
H A Dlocal_cache.h43 if (C->Count == 0) { in appendFromTransferBatch()
48 DCHECK_GT(C->Count, 0); in add()
51 // Count, while Chunks might be further off (depending on Count). That keeps in add()
54 CompactPtrT CompactP = C->Chunks[--C->Count]; in copyToArray()
65 const bool NeedToDrainCache = C->Count == C->MaxCount;
70 C->Chunks[C->Count++] =
80 if (PerClassArray[I].Count)
90 while (PerClassArray[I].Count > 0)
93 while (PerClassArray[BatchClassId].Count >
68 u16 Count; global() member
210 u16 Count; alignas() local
261 const u16 Count = Min(static_cast<u16>(C->MaxCount / 2), C->Count); drain() local
[all...]
/freebsd/contrib/arm-optimized-routines/string/aarch64/
H A Dmemset.S19 #define count x2 macro
29 add dstend, dstin, count
31 cmp count, 96
33 cmp count, 16
38 tbz count, 3, 1f
43 1: tbz count, 2, 2f
47 2: cbz count, 3f
49 tbz count, 1, 3f
56 tbnz count, 6, L(set96)
58 tbz count, 5, 1f
[all …]
/freebsd/sys/arm64/arm64/
H A Dmemset.S40 #define count x2 macro
65 cmp count, #64
68 cmp count, #15
71 ands tmp1, count, #0x30
84 and count, count, #15
85 add dst, dst, count
92 tbz count, #3, 1f
95 tbz count, #2, 1f
98 tbz count, #1, 1f
101 tbz count, #0, 1f
[all …]
/freebsd/lib/libc/softfloat/
H A Dtimesoftfloat.c61 static void reportTime( int32 count, long clocks ) in reportTime() argument
66 ( count / ( ( (float) clocks ) / CLOCKS_PER_SEC ) ) / 1000, in reportTime()
104 int32 count, i; in time_a_int32_z_float32() local
107 count = 0; in time_a_int32_z_float32()
115 count += minIterations; in time_a_int32_z_float32()
119 for ( i = count; i; --i ) { in time_a_int32_z_float32()
124 reportTime( count, endClock - startClock ); in time_a_int32_z_float32()
131 int32 count, i; in time_a_int32_z_float64() local
134 count = 0; in time_a_int32_z_float64()
142 count += minIterations; in time_a_int32_z_float64()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ProfileData/
H A DProfileSummaryBuilder.cpp26 // The following two parameters determine the threshold for a count to be
28 // by 10000). If the counts are sorted in descending order, the minimum count to
29 // reach ProfileSummaryCutoffHot gives the threshold to determine a hot count.
30 // Similarly, the minimum count to reach ProfileSummaryCutoffCold gives the
31 // threshold for determining cold count (everything <= this threshold is
35 cl::desc("A count is hot if it exceeds the minimum count to"
40 cl::desc("A count is cold if it is below the minimum count"
48 " percentile exceeds this count
123 uint64_t Count = I.second.getSamples(); addRecord() local
141 uint64_t CurrSum = 0, Count = 0; computeDetailedSummary() local
228 addEntryCount(uint64_t Count) addEntryCount() argument
237 addInternalCount(uint64_t Count) addInternalCount() argument
[all...]

12345678910>>...202