| /freebsd/tests/sys/geom/class/multipath/ |
| H A D | misc.sh | 44 check_multipath_state ${md0} "OPTIMAL" "ACTIVE" "PASSIVE" 48 check_multipath_state ${md0} "OPTIMAL" "ACTIVE" "PASSIVE" "PASSIVE" 70 check_multipath_state "${md1} ${md0}" "OPTIMAL" "ACTIVE" "ACTIVE" 92 check_multipath_state ${md0} "OPTIMAL" "ACTIVE" "READ" 139 atf_check_equal "OPTIMAL" $STATE 160 check_multipath_state ${md0} "OPTIMAL" "ACTIVE" "PASSIVE" 242 check_multipath_state ${md0} "OPTIMAL" "ACTIVE" "PASSIVE" "PASSIVE" 246 check_multipath_state ${md2} "OPTIMAL" "PASSIVE" "PASSIVE" "ACTIVE" 275 check_multipath_state ${md1} "OPTIMAL" "PASSIVE" "ACTIVE" 332 check_multipath_state ${md0} "OPTIMAL" "ACTIVE" "PASSIVE" "PASSIVE" [all …]
|
| /freebsd/sys/contrib/dev/athk/ath12k/ |
| H A D | Kconfig | 25 you want optimal performance choose N. 34 you want optimal performance choose N.
|
| /freebsd/contrib/ntp/scripts/calc_tickadj/ |
| H A D | invoke-calc_tickadj.texi | 4 @cindex Calculates "optimal" value for tick given ntp drift file. 14 The @code{calc_tickadj} script uses provided ntp drift file to generate optimal 66 calc_tickadj - Calculates "optimal" value for tick given ntp drift file. - Ver. 4.2.8p15
|
| H A D | calc_tickadj.texi | 11 Project, that is used calculate optimal tick value based on given drift file. 15 * calc_tickadj: (calc_tickadj). Calculate optimal tick value from a drift file.
|
| H A D | calc_tickadj-opts.def | 7 prog-title = 'Calculates "optimal" value for tick given ntp drift file.'; 35 The @code{calc_tickadj} script uses provided ntp drift file to generate optimal
|
| H A D | calc_tickadj.1calc_tickadjmdoc | 11 .Nd Calculates "optimal" value for tick given ntp drift file. 22 The \fBcalc_tickadj\fP script uses provided ntp drift file to generate optimal
|
| H A D | calc_tickadj.mdoc.in | 11 .Nd Calculates "optimal" value for tick given ntp drift file. 22 The \fBcalc_tickadj\fP script uses provided ntp drift file to generate optimal
|
| H A D | calc_tickadj.1calc_tickadjman | 22 \- Calculates optimal value for tick given ntp drift file. 37 The \fBcalc_tickadj\fP script uses provided ntp drift file to generate optimal
|
| H A D | calc_tickadj.man.in | 22 \- Calculates optimal value for tick given ntp drift file. 37 The \fBcalc_tickadj\fP script uses provided ntp drift file to generate optimal
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | SpillPlacement.h | 1 //===- SpillPlacement.h - Optimal Spill Code Placement ---------*- C++ -*--===// 9 // This analysis computes the optimal spill code placement between basic blocks. 20 // The returned bit vector can be used to place optimal spill code at basic 142 /// finish - Compute the optimal spill code placement given the in getRecentPositive()
|
| /freebsd/sys/dev/qat/qat_api/include/lac/ |
| H A D | cpa_cy_ecsm2.h | 55 * For optimal performance all data buffers SHOULD be 8-byte aligned. 95 * For optimal performance all data buffers SHOULD be 8-byte aligned. 140 * For optimal performance all data buffers SHOULD be 8-byte aligned. 180 * For optimal performance all data buffers SHOULD be 8-byte aligned. 216 * For optimal performance all data buffers SHOULD be 8-byte aligned. 254 * For optimal performance all data buffers SHOULD be 8-byte aligned. 294 * For optimal performance all data buffers SHOULD be 8-byte aligned. 338 * For optimal performance all data buffers SHOULD be 8-byte aligned. 374 * For optimal performance all data buffers SHOULD be 8-byte aligned. 419 * For optimal performance all data buffers SHOULD be 8-byte aligned. [all …]
|
| H A D | cpa_cy_ec.h | 202 * For optimal performance all data buffers SHOULD be 8-byte aligned. 267 * For optimal performance all data buffers SHOULD be 8-byte aligned. 299 * For optimal performance all data buffers SHOULD be 8-byte aligned. 350 * For optimal performance all data buffers SHOULD be 8-byte aligned. 393 * For optimal performance all data buffers SHOULD be 8-byte aligned. 432 * For optimal performance all data buffers SHOULD be 8-byte aligned. 485 * For optimal performance all data buffers SHOULD be 8-byte aligned. 711 * For optimal performance, data pointers SHOULD be 8-byte aligned. 800 * For optimal performance, data pointers SHOULD be 8-byte aligned. 871 * For optimal performance, data pointers SHOULD be 8-byte aligned. [all …]
|
| H A D | cpa_cy_dsa.h | 72 * For optimal performance all data buffers SHOULD be 8-byte aligned. 142 * For optimal performance all data SHOULD be 8-byte aligned. 178 * For optimal performance all data SHOULD be 8-byte aligned. 216 * For optimal performance all data SHOULD be 8-byte aligned. 260 * For optimal performance all data SHOULD be 8-byte aligned. 306 * For optimal performance all data SHOULD be 8-byte aligned. 760 * For optimal performance, data pointers SHOULD be 8-byte aligned. 849 * For optimal performance, data pointers SHOULD be 8-byte aligned. 924 * For optimal performance, data pointers SHOULD be 8-byte aligned. 1011 * For optimal performance, data pointers SHOULD be 8-byte aligned. [all …]
|
| H A D | cpa_cy_ecdsa.h | 52 * For optimal performance all data buffers SHOULD be 8-byte aligned. 100 * For optimal performance all data buffers SHOULD be 8-byte aligned. 143 * For optimal performance all data buffers SHOULD be 8-byte aligned. 195 * For optimal performance all data buffers SHOULD be 8-byte aligned. 530 * For optimal performance, data pointers SHOULD be 8-byte aligned. 601 * For optimal performance, data pointers SHOULD be 8-byte aligned. 672 * For optimal performance, data pointers SHOULD be 8-byte aligned. 745 * For optimal performance, data pointers SHOULD be 8-byte aligned.
|
| /freebsd/share/doc/smm/05.fastfs/ |
| H A D | 3.t | 279 application programs the optimal size for a read or write. 280 For files the optimal size is the block size of the file system 283 the optimal size is the underlying buffer size. 370 The distance between ``rotationally optimal'' blocks varies greatly; 403 To ease the calculation of finding rotationally optimal blocks, 452 They also calculate rotationally optimal block layouts, 457 the local allocation routines that use a locally optimal scheme to 511 preferably at rotationally optimal positions in the same cylinder.
|
| /freebsd/contrib/sendmail/libsm/ |
| H A D | README | 119 "optimal blocksize for I/O". 124 st_blksize that is the "optimal blocksize for I/O". 129 st_blksize that is the "optimal blocksize for I/O".
|
| /freebsd/contrib/lua/src/ |
| H A D | ltable.c | 384 ** Compute the optimal size for the array part of table 't'. 'nums' is a 388 ** will go to the array part; return the optimal size. (The condition 393 unsigned int twotoi; /* 2^i (candidate for optimal size) */ in computesizes() 396 unsigned int optimal = 0; /* optimal size for array part */ in computesizes() local 403 optimal = twotoi; /* optimal size (till now) */ in computesizes() 404 na = a; /* all elements up to 'optimal' will go to array part */ in computesizes() 407 lua_assert((optimal == 0 || optimal / 2 < na) && na <= optimal); in computesizes() 409 return optimal; in computesizes() 599 unsigned int asize; /* optimal size for array part */ in rehash()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | SimplifyLibCalls.h | 49 /// optimal value to replace the instruction with or 0 if a more 50 /// optimal form can't be found. 99 /// that replace well formed calls to library functions with a more optimal 147 /// optimal value to replace the instruction with or 0 if a more 148 /// optimal form can't be found. Note that the returned value may
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | LoopSink.cpp | 18 // * It uses block frequency info to find the optimal sinking locations 97 /// The purpose of the function is to find the optimal sinking points to 103 /// frequency, the optimal solution is not sinking (return empty set). 105 /// \p ColdLoopBBs is used to help find the optimal sinking locations. 343 // With static profile, the sinking decision may be sub-optimal. in run()
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/icelakex/ |
| H A D | frontend.json | 357 "BriefDescription": "Cycles DSB is delivering optimal number of Uops", 364 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 395 "BriefDescription": "Cycles MITE is delivering optimal number of Uops", 402 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 471 …"BriefDescription": "Cycles when optimal number of uops was delivered to the back-end when the bac… 479 …"PublicDescription": "Counts the number of cycles when the optimal number of uops were delivered b…
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/sapphirerapids/ |
| H A D | frontend.json | 342 "BriefDescription": "Cycles DSB is delivering optimal number of Uops", 349 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 377 "BriefDescription": "Cycles MITE is delivering optimal number of Uops", 384 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 459 …"BriefDescription": "Cycles when optimal number of uops was delivered to the back-end when the bac… 467 …"PublicDescription": "Counts the number of cycles when the optimal number of uops were delivered b…
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/icelake/ |
| H A D | frontend.json | 357 "BriefDescription": "Cycles DSB is delivering optimal number of Uops", 364 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 395 "BriefDescription": "Cycles MITE is delivering optimal number of Uops", 402 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 484 …"BriefDescription": "Cycles when optimal number of uops was delivered to the back-end when the bac… 492 …"PublicDescription": "Counts the number of cycles when the optimal number of uops were delivered b…
|
| /freebsd/lib/libpmc/pmu-events/arch/x86/tigerlake/ |
| H A D | frontend.json | 349 "BriefDescription": "Cycles DSB is delivering optimal number of Uops", 356 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 384 "BriefDescription": "Cycles MITE is delivering optimal number of Uops", 391 …"PublicDescription": "Counts the number of cycles where optimal number of uops was delivered to th… 466 …"BriefDescription": "Cycles when optimal number of uops was delivered to the back-end when the bac… 474 …"PublicDescription": "Counts the number of cycles when the optimal number of uops were delivered b…
|
| /freebsd/sys/sys/ |
| H A D | stat.h | 114 __int32_t st_blksize; /* optimal blocksize for I/O */ 135 blksize_t st_blksize; /* optimal blocksize for I/O */ 185 blksize_t st_blksize; /* optimal blocksize for I/O */ 206 blksize_t st_blksize; /* optimal blocksize for I/O */
|
| /freebsd/contrib/llvm-project/clang/include/clang/Tooling/ASTDiff/ |
| H A D | ASTDiff.h | 14 // is able to match large subtrees that are equivalent, with an optimal 98 /// Whenever two subtrees are matched in the bottom-up phase, the optimal
|