/freebsd/contrib/mandoc/ |
H A D | man.cgi.3 | 55 calls 60 is empty, calls 63 calls 68 calls the appropriate one among the 114 and then calls 135 Otherwise, it changes into the manpath and calls 137 Depending on the result, it calls either 154 This function calls 159 passed to it, and calls 178 query or if there is only one single result, it calls [all …]
|
/freebsd/lib/libc/locale/ |
H A D | mblocal.h | 61 /** Persistent state used by mblen() calls. */ 63 /** Persistent state used by mbrlen() calls. */ 65 /** Persistent state used by mbrtoc16() calls. */ 67 /** Persistent state used by mbrtoc32() calls. */ 69 /** Persistent state used by mbrtowc() calls. */ 71 /** Persistent state used by mbsnrtowcs() calls. */ 73 /** Persistent state used by mbsrtowcs() calls. */ 75 /** Persistent state used by mbtowc() calls. */ 77 /** Persistent state used by c16rtomb() calls. */ 79 /** Persistent state used by c32rtomb() calls. */ [all …]
|
/freebsd/contrib/googletest/googlemock/include/gmock/ |
H A D | gmock-cardinalities.h | 71 // calls allowed. 75 // Returns true if and only if call_count calls will satisfy this 79 // Returns true if and only if call_count calls will saturate this 101 // calls allowed. 105 // Returns true if and only if call_count calls will satisfy this 111 // Returns true if and only if call_count calls will saturate this 117 // Returns true if and only if call_count calls will over-saturate this 118 // cardinality, i.e. exceed the maximum number of allowed calls. 135 // Creates a cardinality that allows at least n calls. 138 // Creates a cardinality that allows at most n calls. [all …]
|
/freebsd/crypto/openssl/doc/internal/man3/ |
H A D | evp_keymgmt_newdata.pod | 42 evp_keymgmt_newdata() calls the method's new() function. 44 evp_keymgmt_freedata() calls the method's free() function. 50 evp_keymgmt_get_params() calls the method's get_params() function. 52 evp_keymgmt_has() calls the method's has() function. 54 evp_keymgmt_validate() calls the method's validate() function. 56 evp_keymgmt_import() calls the method's import() function. 58 evp_keymgmt_import_types() calls the method's import_types() function. 60 evp_keymgmt_export() calls the method's export() function. 62 evp_keymgmt_export_types() calls the method's export_types() function.
|
/freebsd/crypto/openssl/include/internal/ |
H A D | quic_reactor_wait_ctx.h | 33 * balanced calls to enter()/leave() on a single thread) is more convenient. 39 * In short, this allows multiple 'concurrent' blocking calls to be ongoing on a 41 * multiple concurrent blocking calls on a single thread makes no sense, the 56 * QUIC_REACTOR_WAIT_CTX before commencing a blocking operation, and then calls 58 * in the imminent blocking operation. Later it must ensure it calls 61 * wait context so long as the number of calls is balanced. The last leave() 67 * calls across all threads is not accurate and we need an accurate count of how 68 * many 'concurrent' blocking calls for a given reactor are active *on a given 73 * identifier for the reactor) to the number of 'recursive' calls outstanding: 106 * Precondition: All prior calls to ossl_quic_reactor_wait_ctx_enter() must have [all …]
|
/freebsd/lib/libsys/ |
H A D | extattr_get_file.2 | 43 .Nd system calls to manipulate VFS extended attributes 105 calls consume the 131 system calls behave in the same way as their _file counterparts, except that 140 calls are identical to their 156 The following arguments are common to all the system calls described here: 185 calls return the number of bytes 202 If any of the calls are unsuccessful, the value \-1 is returned 209 The following errors may be returned by the system calls themselves. 235 system calls may also fail if: 248 calls may also fail due to the following errors:
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/ |
H A D | Inliner.cpp | 10 // missing any calls and updating the call graph. The decisions of which calls 80 "multiplier and one of its inlined calls was also subject to " 226 // We use a single common worklist for calls across the entire SCC. We in run() 227 // process these in-order and append new calls introduced during inlining to in run() 233 // each function contains a small amount of code and a couple of calls to in run() 241 // functions we can end up incrementally inlining N calls into each of in run() 251 SmallVector<std::pair<CallBase *, int>, 16> Calls; in run() local 253 // Populate the initial list of calls in this SCC. in run() 266 Calls.push_back({CB, -1}); in run() 286 if (Calls.empty()) in run() [all …]
|
H A D | ModuleInliner.cpp | 10 // missing any calls in the module level. It doesn't need any infromation about 12 // which calls are profitable to inline are implemented elsewhere. 132 // In the module inliner, a priority-based worklist is used for calls across in run() 141 auto Calls = getInlineOrder(FAM, Params, MAM, M); in run() local 142 assert(Calls != nullptr && "Expected an initialized InlineOrder"); in run() 144 // Populate the initial list of calls in this module. in run() 151 Calls->push({CB, -1}); in run() 165 if (Calls->empty()) in run() 174 // Track the dead functions to delete once finished with inlining calls. We in run() 178 // Loop forward over all of the calls. in run() [all …]
|
/freebsd/contrib/libcbor/test/ |
H A D | test_allocator.c | 7 // How many alloc calls we expect 9 // How many alloc calls we got 14 void set_mock_malloc(int calls, ...) { in set_mock_malloc() argument 16 va_start(args, calls); in set_mock_malloc() 17 alloc_calls_expected = calls; in set_mock_malloc() 19 expectations = calloc(calls, sizeof(expectations)); in set_mock_malloc() 20 for (int i = 0; i < calls; i++) { in set_mock_malloc()
|
/freebsd/contrib/libfido2/ |
H A D | NEWS | 6 ** New API calls: 13 ** New API calls: 23 ** New API calls: 47 ** New API calls: 57 ** New API calls: 74 ** New API calls: 93 ** New API calls: 115 ** New API calls: 147 ** New API calls: 164 ** New API calls [all...] |
/freebsd/stand/forth/ |
H A D | menusets.4th.8 | 209 and calls menuset-loadvar. 213 and calls menuset-unloadvar. 231 and calls menuset-loadxvar 235 and calls menuset-unloadxvar 239 and calls menuset-loadxvar 243 and calls menuset-unloadxvar 247 and calls menuset-loadxvar 251 and calls menuset-unloadxvar 269 and calls menuset-loadxyvar. 273 and calls menuset-unloadxyvar. [all …]
|
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | CallingConv.h | 31 /// is the only one that supports varargs calls. As with typical C calling 36 // Generic LLVM calling conventions. None of these support varargs calls, 39 /// Attempts to make calls as fast as possible (e.g. by passing things in 44 /// assumption that the call is not commonly executed. As such, these calls 55 /// OBSOLETED - Used for stack based JavaScript calls 58 /// Used for dynamic register based calls (e.g. stackmap and patchpoint 62 /// Used for runtime calls that preserves most registers. 65 /// Used for runtime calls that preserves (almost) all registers. 74 /// Attemps to make calls as fast as possible while guaranteeing that tail 85 /// but guarantees tail calls will be made by making the callee clean up [all …]
|
/freebsd/contrib/googletest/docs/reference/ |
H A D | mocking.md | 70 apply only to calls of *`method_name`* whose arguments match all of the 95 Restricts the expectation to apply only to mock function calls whose arguments 127 The parameter *`cardinality`* represents the number of expected calls and can be 157 Expected calls assigned to the same sequence are expected to occur in the order 185 other calls. 211 // Collect all expectations of InitElement() calls 216 .After(all_inits); // Expect Describe() call after all InitElement() calls 239 the first, second, and third calls: 259 matching function calls. Takes effect after the actions specified in the 270 If any `WillOnce` clauses have been specified, matching function calls will [all …]
|
/freebsd/crypto/openssl/doc/designs/quic-design/ |
H A D | quic-thread-assist.md | 19 consistency over multiple API calls. For example: 25 For locking of API calls the lock would only be held for the separate get and 26 set calls, but the combination of the two would not be safe if the assist thread 35 calls, would be required to take the lock. As a special exemption, an 41 application side, although since most HL API calls made by an application 87 In this model, the application may make handshake layer calls freely prior to 89 thread and may not be touched further. We would need to block all API calls 94 connection. We could selectively enable some important post-handshake HL calls
|
H A D | error-handling.md | 8 used throughout the code base) during the libssl API calls. In most 14 The error stacks are thread-local. Libssl API calls from separate threads 46 library calls and in the subordinate libcrypto (and provider) calls. First 68 replicated for SSL_read()/SSL_write() calls on other streams. 81 the QUIC_CHANNEL error stack as well for possible further calls from 91 such as a memory allocation error where no further SSL_tick() calls
|
H A D | quic-io-arch.md | 69 used for the calls to the underlying network BIOs. To illustrate this point, we 90 calls to send(3) or recv(3) may block for some arbitrary period of time, meaning 128 Another conceptual possibility is that blocking calls could be kept ongoing in 131 - a thread which exists solely to execute blocking calls to the `BIO_write` of 133 - a thread which exists solely to execute blocking calls to the `BIO_read` of an 138 `BIO_write` calls do not take an excessive amount of time. 161 - By blocking in `BIO_write` calls, this precludes correct implementation of 173 `BIO_write` calls, they will need to be adapted to support this, which is 175 calls obviously does not work since both of these calls must be able to block 182 and `BIO_write` calls on some underlying network BIO, there needs to be some [all …]
|
/freebsd/share/doc/psd/18.gprof/ |
H A D | postp.me | 63 Let $C sub e$ be the number of calls to some routine, 65 calls from a caller $r$ to a callee $e$. 67 average amount of time for all calls to that routine, 78 sum from {r ~ roman CALLS ~ e} 81 where $r ~ roman CALLS ~ e$ is a relation showing all routines 85 However, if the execution contains recursive calls, 119 All calls into the cycle are made to share the total 122 Calls among the members of the cycle 172 looking for calls to routines, and note which
|
/freebsd/contrib/libc-pwcache/ |
H A D | pwcache.3 | 93 The user name is cached so that multiple calls with the same 95 do not require additional calls to 112 The group name is cached so that multiple calls with the same 114 do not require additional calls to 131 The uid is cached so that multiple calls with the same 133 do not require additional calls to 147 The gid is cached so that multiple calls with the same 149 do not require additional calls to
|
/freebsd/share/doc/papers/kerntune/ |
H A D | 2.t | 138 Although the number of calls of each member 144 Self-recursive routines have their calls broken 145 down into calls from the outside and self-recursive calls. 146 Only the outside calls affect the propagation of time. 174 Note that \s-1EXAMPLE\s+1 calls itself recursively four times. 175 The routine \s-1EXAMPLE\s+1 calls routine \s-1SUB1\s+1 twenty times, \s-1SUB2\s+1 once, 176 and never calls \s-1SUB3\s+1. 185 (not counting calls among members of the cycle), 214 the calls to count the subroutine invocations.
|
/freebsd/contrib/ofed/librdmacm/man/ |
H A D | rsocket.7.in | 12 of corresponding socket calls, except where noted. Rsocket 13 functions match the name and function signature of socket calls, 14 with the exception that all function calls are prefixed with an 'r'. 52 The following calls and options support direct data placement. 68 In order to enable the use of remote IO mapping calls on an rsocket, 108 Note that rsockets fd's cannot be passed into non-rsocket calls. For 117 of the preload library intercepting calls without the user's explicit
|
/freebsd/crypto/openssl/doc/designs/ |
H A D | handling-some-max-defines.md | 37 #### API calls depending on this: 55 Perhaps introduce API calls replacing the calls above that would have 67 #### API calls depending on this: 90 #### API calls depending on this: 117 #### API calls depending on this: 138 #### API calls depending on this:
|
/freebsd/lib/libpmc/pmu-events/arch/x86/silvermont/ |
H A D | pipeline.json | 8 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 18 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 28 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 38 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 48 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 58 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 68 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 78 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 88 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j… 98 …ict the following branch types: conditional branches, direct calls and jumps, indirect calls and j…
|
/freebsd/contrib/one-true-awk/testdir/ |
H A D | T.func | 103 { k = 0; print ack($1,$2), "(" k " calls)" } 113 1 (1 calls) 114 3 (4 calls) 115 7 (27 calls) 116 61 (2432 calls) 117 125 (10307 calls) 118 253 (42438 calls)
|
/freebsd/usr.bin/truss/ |
H A D | truss.1 | 7 .Nd trace system calls 22 utility traces the system calls called by the specified process or program. 43 Do not display individual system calls or signals. 86 and trace the system calls of it. 94 Follow the system calls used in echoing "hello":
|
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/docsExamples/ |
H A D | rwinfo.d | 43 uint64_t calls; member 54 i[probefunc].calls++; 68 printf(" calls max bytes elapsed nsecs\n"); 70 printf(" read %5d %9d %d\n", i["read"].calls, 72 printf(" write %5d %9d %d\n", i["write"].calls,
|