| /src/lib/libc/tests/gen/ |
| H A D | wordexp_test.c | 57 wordexp_t we; in ATF_TC_BODY() local
67 r = wordexp("hello world", &we, 0); in ATF_TC_BODY()
69 ATF_REQUIRE(we.we_wordc == 2); in ATF_TC_BODY()
70 ATF_REQUIRE(strcmp(we.we_wordv[0], "hello") == 0); in ATF_TC_BODY()
71 ATF_REQUIRE(strcmp(we.we_wordv[1], "world") == 0); in ATF_TC_BODY()
72 ATF_REQUIRE(we.we_wordv[2] == NULL); in ATF_TC_BODY()
73 wordfree(&we); in ATF_TC_BODY()
80 wordexp_t we; in ATF_TC_BODY() local
86 r = wordexp(longdata, &we, 0); in ATF_TC_BODY()
88 ATF_REQUIRE(we.we_wordc == 10000); in ATF_TC_BODY()
[all …]
|
| /src/crypto/openssl/doc/man7/ |
| H A D | ossl-guide-tls-client-block.pod | 21 We use a blocking socket for the purposes of this example. This means that
24 For example, this can happen if we have sent our request, but we are still
37 We assume that you already have OpenSSL installed on your system; that you
46 The first step is to create an B<SSL_CTX> object for our client. We use the
47 L<SSL_CTX_new(3)> function for this purpose. We could alternatively use
48 L<SSL_CTX_new_ex(3)> if we want to associate the B<SSL_CTX> with a particular
50 B<OSSL_LIB_CTX>). We pass as an argument the return value of the function
57 * Create an SSL_CTX which we can use to create SSL objects from. We
58 * want an SSL_CTX for creating clients so we use TLS_client_method()
67 Since we are writing a client we must ensure that we verify the server's
[all …]
|
| H A D | ossl-guide-tls-client-non-block.pod | 19 blocking TLS client. On this page we will amend that demo code so that it
27 As we saw in the previous example a blocking socket is one which waits (blocks)
44 L<ossl-guide-tls-client-block(7)> page we assume that you are familiar with it
45 and we only explain how this example differs.
67 we want to read or write to the socket, but we are currently unable to. In fact
82 In this demo application we will create a helper function which simulates doing
86 We call our function C<wait_for_activity()> because all it does is wait until
102 * Wait until the socket is writeable or readable. We use select here
124 In this example we are using the C<select> function because it is very simple
130 while waiting for the socket state to change. But we don't use that timeout
[all …]
|
| H A D | ossl-guide-quic-client-block.pod | 23 We assume that you already have OpenSSL installed on your system; that you
29 understanding of UDP/IP and sockets. The example code that we build in this
32 this one will be discussed so we also assume that you have run through and
46 In the TLS tutorial (L<ossl-guide-tls-client-block(7)>) we created an B<SSL_CTX>
48 TLS connection. A QUIC connection works in exactly the same way. We first create
53 client. This is done in the same way as before except that we use a different
60 mode", see L<ossl-guide-quic-introduction(7)>). For this tutorial we will be
61 using L<OSSL_QUIC_client_method(3)> because we will not be leaving the QUIC
65 * Create an SSL_CTX which we can use to create SSL objects from. We
66 * want an SSL_CTX for creating clients so we use OSSL_QUIC_client_method()
[all …]
|
| H A D | ossl-guide-quic-client-non-block.pod | 19 blocking QUIC client. On this page we will amend that demo code so that it
27 As we saw in the previous example an OpenSSL QUIC application always uses a
40 We will see later in this tutorial how to change the B<SSL> object so that it
46 L<ossl-guide-quic-client-block(7)> page we assume that you are familiar with it
47 and we only explain how this example differs.
52 we want to read or write to the B<SSL> object but we are currently unable to.
67 In this demo application we will create a helper function which simulates doing
70 after which the state of the B<SSL> object might have changed. We will call our
87 * Find out if we would like to write to the socket, or read from it (or
104 * Wait until the socket is writeable or readable. We use select here
[all …]
|
| /src/secure/lib/libcrypto/man/man7/ |
| H A D | ossl-guide-tls-client-block.7 | 33 .\" If the F register is >0, we'll generate index entries on stderr for
78 For example, this can happen if we have sent our request, but we are still
99 The first step is to create an \fBSSL_CTX\fR object for our client. We use the
100 \&\fBSSL_CTX_new\fR\|(3) function for this purpose. We could alternatively use
101 \&\fBSSL_CTX_new_ex\fR\|(3) if we want to associate the \fBSSL_CTX\fR with a particular
103 \&\fBOSSL_LIB_CTX\fR). We pass as an argument the return value of the function
111 \& * Create an SSL_CTX which we can use to create SSL objects from. We
112 \& * want an SSL_CTX for creating clients so we use TLS_client_method()
122 Since we are writing a client we must ensure that we verify the server\*(Aqs
123 certificate. We do this by calling the \fBSSL_CTX_set_verify\fR\|(3) function and
[all …]
|
| H A D | ossl-guide-tls-client-non-block.7 | 33 .\" If the F register is >0, we'll generate index entries on stderr for
73 blocking TLS client. On this page we will amend that demo code so that it
81 As we saw in the previous example a blocking socket is one which waits (blocks)
98 \&\fBossl\-guide\-tls\-client\-block\fR\|(7) page we assume that you are familiar with it
99 and we only explain how this example differs.
121 we want to read or write to the socket, but we are currently unable to. In fact
136 In this demo application we will create a helper function which simulates doing
157 \& * Wait until the socket is writeable or readable. We use select here
180 In this example we are using the \f(CW\*(C`select\*(C'\fR function because it is very simple
186 while waiting for the socket state to change. But we don\*(Aqt use that timeout
[all …]
|
| H A D | ossl-guide-quic-client-non-block.7 | 33 .\" If the F register is >0, we'll generate index entries on stderr for
73 blocking QUIC client. On this page we will amend that demo code so that it
81 As we saw in the previous example an OpenSSL QUIC application always uses a
100 \&\fBossl\-guide\-quic\-client\-block\fR\|(7) page we assume that you are familiar with it
101 and we only explain how this example differs.
105 we want to read or write to the \fBSSL\fR object but we are currently unable to.
120 In this demo application we will create a helper function which simulates doing
123 after which the state of the \fBSSL\fR object might have changed. We will call our
141 \& * Find out if we would like to write to the socket, or read from it (or
158 \& * Wait until the socket is writeable or readable. We use select here
[all …]
|
| H A D | ossl-guide-quic-client-block.7 | 33 .\" If the F register is >0, we'll generate index entries on stderr for
83 understanding of UDP/IP and sockets. The example code that we build in this
86 this one will be discussed so we also assume that you have run through and
99 In the TLS tutorial (\fBossl\-guide\-tls\-client\-block\fR\|(7)) we created an \fBSSL_CTX\fR
101 TLS connection. A QUIC connection works in exactly the same way. We first create
106 client. This is done in the same way as before except that we use a different
113 mode", see \fBossl\-guide\-quic\-introduction\fR\|(7)). For this tutorial we will be
114 using \fBOSSL_QUIC_client_method\fR\|(3) because we will not be leaving the QUIC
119 \& * Create an SSL_CTX which we can use to create SSL objects from. We
120 \& * want an SSL_CTX for creating clients so we use OSSL_QUIC_client_method()
[all …]
|
| /src/crypto/openssl/doc/designs/quic-design/ |
| H A D | dgram-api.md | 4 We need to evolve the API surface of BIO which is relevant to BIO_dgram (and the
15 - We use a sendmmsg/recvmmsg-like API. The alternative API was not considered
19 - We define our own structures rather than using the OS's `struct mmsghdr`.
28 - We do not have to expose functionality which we cannot guarantee
29 we can support on all platforms (for example, arbitrary control messages).
35 - For OSes which do not support `sendmmsg`, we emulate it using repeated
36 calls to `sendmsg`. For OSes which do not support `sendmsg`, we emulate it
40 - We do not define any flags at this time, as the flags previously considered
44 - We ensure the extensibility of our `BIO_MSG` structure in a way that preserves
61 - We do not support iovecs. The motivations for this are:
[all …]
|
| /src/contrib/processor-trace/libipt/src/ |
| H A D | pt_block_decoder.c | 60 * where we indicate the status after synchronizing. in pt_blk_status()
67 * Postpone it as long as we're still processing events, though. in pt_blk_status()
127 /* Set the flags we need for the query decoder we use. */ in pt_blk_decoder_init()
188 * If we're not already processing events, check the current time against the
205 /* We're not generating tick events if tracing is disabled. */ in pt_blk_tick()
213 * In rare cases where we need to proceed to an event location using in pt_blk_tick()
225 /* If we don't have wall-clock time, we use relative time. */ in pt_blk_tick()
232 /* We're done if time has not changed since the last event. */ in pt_blk_tick()
236 /* Time has changed so we create a new tick event. */ in pt_blk_tick()
241 /* Indicate if we have wall-clock time or only relative time. */ in pt_blk_tick()
[all …]
|
| H A D | pt_time.c | 80 * We adjust a single wrap-around but fail if the distance is bigger than that.
90 /* Correct a single wrap-around. If we lost enough MTCs to wrap in pt_time_ctc_delta()
96 /* Since we only store the CTC between TMA/MTC or MTC/TMC a in pt_time_ctc_delta()
146 /* We got the full time; we recover from previous losses. */ in pt_time_update_tsc()
188 /* We shouldn't have more than one TMA per TSC. */ in pt_time_update_tma()
192 /* We're ignoring MTC between TSC and TMA. */ in pt_time_update_tma()
212 * value, we can use the TMA as an MTC. in pt_time_update_tma()
214 * If it isn't, we will estimate the preceding MTC based on the CTC bits in pt_time_update_tma()
215 * the TMA provides at the next MTC. We forget about the previous MTC in pt_time_update_tma()
218 * If no MTC packets are dropped around TMA, we will estimate the in pt_time_update_tma()
[all …]
|
| /src/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyExceptionInfo.cpp | 88 auto WE = std::make_unique<WebAssemblyException>(EHPad); in recalculate() local
89 discoverAndMapException(WE.get(), MDT, MDF); in recalculate()
90 Exceptions.push_back(std::move(WE)); in recalculate()
109 // We group exceptions in this analysis simply by including all BBs dominated in recalculate()
115 // Here we extract those unwind destinations from their (incorrect) parent in recalculate()
117 // children of the parent exception, so we have to traverse the parent chain. in recalculate()
119 // We should traverse BBs in the preorder of the dominator tree, because in recalculate()
122 // and A's unwind destination is B and B's is C. When we visit B before A, we in recalculate()
155 // subexception of Exception A, and we fix it by taking Exception B out of in recalculate()
160 // A because they were dominated by EHPad A. We fix this case by taking those in recalculate()
[all …]
|
| /src/crypto/openssl/ssl/quic/ |
| H A D | quic_channel_local.h | 46 * to be valid for the lifetime of the channel. Therefore we do not free it
47 * when we free the channel.
52 /* Port LCIDM we use to register LCIDs. */
54 /* SRTM we register SRTs with. */
61 * The transport parameter block we will send or have sent.
114 * Client: The DCID used in the first Initial packet we transmit as a client.
135 * Client only: The SCID found in an incoming Retry packet we handled.
140 /* Server only: The DCID we currently expect the peer to use to talk to us. */
144 * The DCID we currently use to talk to the peer and its sequence num.
150 /* Transport parameter values we send to our peer. */
[all …]
|
| H A D | quic_ackm.c | 22 * sent for which we later expect to receive an ACK. It is essentially a simple
26 * We currently only allow packets to be appended to the list (i.e. the packet
28 * we should not currently need more general functionality such as a sorted list
46 * (inclusive). We do not allow packet numbers to be added to the history
53 * Packet number of the highest packet info structure we have yet appended
54 * to the list. This is usually one less than watermark, except when we have
172 * **Background.** The RX side of the ACK manager must track packets we have
173 * received for which we have to generate ACK frames. Broadly, this means we
174 * store a set of packet numbers which we have received but which we do not know
175 * for a fact that the transmitter knows we have received.
[all …]
|
| /src/bin/pax/ |
| H A D | buf_subs.c | 82 * does not specify a blocksize, we use the format default blocksize. in wr_start()
83 * We must be picky on writes, so we do not allow the user to create an in wr_start()
84 * archive that might be hard to read elsewhere. If all ok, we then in wr_start()
106 * we only allow wrblksz to be used with all archive operations in wr_start()
128 * leave space for the header pushback (see get_arc()). If we are in rd_start()
179 * position of the tape head) and the write point within the data we have
180 * stored in the read (soon to become write) buffer. We may have to move
185 * We first calculate which record has the first byte of the trailer. We
187 * up. We set the buffer write pointer to be at this byte (the byte where
188 * the trailer starts). We then move the OS file pointer back to the
[all …]
|
| H A D | ar_io.c | 76 static int can_unlnk = 0; /* do we unlink null archives? */
88 * Note: we may be called with name == NULL on the first open only.
183 * make sure we beyond any doubt that we only can unlink regular files in ar_open()
184 * we created in ar_open()
189 * if we are writing, we are done in ar_open()
199 * On all new archive volumes, we shift to wrblksz (if the user in ar_open()
200 * specified one, otherwise we will continue to use rdblksz). We in ar_open()
210 * that support variable sized records, we must make large in ar_open()
211 * reads to make sure we get the entire record, otherwise we in ar_open()
212 * will just get the first part of the record (up to size we in ar_open()
[all …]
|
| H A D | pat_rep.c | 126 * put the delimiter back in case we need an error message and in rep_add()
128 * we then point the node at the new substitution string in rep_add()
262 * NOTE: When the -c option is used, we are called when there was no match
263 * by pat_match() (that means we did match before the inverted sense of
264 * the logic). Now this seems really strange at first, but with -c we
286 * when we are NOT limited to a single match per pattern mark the in pat_sel()
295 * we reach this point only when we allow a single selected match per in pat_sel()
296 * pattern, if the pattern matches a directory and we do not have -d in pat_sel()
297 * (dflag) we are done with this pattern. We may also be handed a file in pat_sel()
298 * in the subtree of a directory. in that case when we are operating in pat_sel()
[all …]
|
| /src/sys/contrib/openzfs/module/zfs/ |
| H A D | spa_log_spacemap.c | 42 * throughout the pool. This means that each TXG we will have to append some
43 * FREE records to almost every metaslab. With log space maps, we hold their
46 * more unflushed changes are accounted in memory, we flush a selected group
48 * when loading the pool. Flushing a metaslab to disk relieves memory as we
57 * is activated when we create the first log space map and remains active
71 * the metaslab haven't had its changes flushed. During import, we use this
73 * from a TXG before msp_unflushed_txg. At that point, we also populate its
75 * we flush that metaslab.
81 * end of the TXG and will be destroyed when it becomes fully obsolete. We
85 * doesn't have the changes from that log and we can therefore destroy it.
[all …]
|
| /src/contrib/jemalloc/doc_internal/ |
| H A D | PROFILING_INTERNALS.md | 9 …we need to walk up the stack to get a stack trace. On top of that, we need to allocate storage to …
12 …002.23003)]), if we can orchestrate our algorithm so that many of our `coinflip` calls share their…
13 …inflip that comes up heads, rather than once per (logical) coinflip. Since we expect to sample rel…
16 …am memory. "Small" and "large" are necessarily sort of fuzzy terms, but if we define "small" as "a…
19 Suppose we have a sampling strategy that meets the following criteria:
24 We can then estimate the bytes in live allocations through some particular stack trace as:
28 …tions are fixed; the random variables are the sampling decisions), so taking the expectation we get
32 This is of course $\sum_i S_i$, as we want (and, a similar calculation could be done for allocation…
33 This is a fairly general strategy; note that while we require that sampling decisions be independen…
55 We can use this formula to compare various strategy choices. All else being equal, lower-variance s…
[all …]
|
| /src/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86SpeculativeLoadHardening.cpp | 142 // We mostly have one conditional branch, and in extremely rare cases have
234 // We have to insert the new block immediately after the current one as we in splitEdge()
235 // don't know what layout-successor relationships the successor has and we in splitEdge()
246 // we might have *broken* fallthrough and so need to inject a new in splitEdge()
256 // Update the unconditional branch now that we've added one. in splitEdge()
274 // If this is the only edge to the successor, we can just replace it in the in splitEdge()
275 // CFG. Otherwise we need to add a new entry in the CFG for the new in splitEdge()
323 /// FIXME: It's really frustrating that we have to do this, but SSA-form in MIR
324 /// isn't what you might expect. We may have multiple entries in PHI nodes for
325 /// a single predecessor. This makes CFG-updating extremely complex, so here we
[all …]
|
| /src/contrib/libpcap/ |
| H A D | configure.ac | 28 # for flags required for the platform for which we're building (and
34 # LIBS: inherited from the environment; we add libraries required by
38 # we're finished doing configuration tests for the modules.
64 # or libpcap.pc, as, in all platforms on which we run, if a dynamic
105 # We require C99 or later.
139 dnl include <sys/ioccom.h>, and we were to drop support for older
142 dnl in "aclocal.m4" uses it, so we would still have to test for it
143 dnl and set "HAVE_SYS_IOCCOM_H" if we have it, otherwise
150 # Check whether the platform for which we're compiling requires extra
151 # defines and libraries. If so, add them to CFLAGS and LIBS, as we want
[all …]
|
| /src/sys/netinet/tcp_stacks/ |
| H A D | tcp_bbr.h | 34 #define BBR_OVERMAX 0x0008 /* We have more retran's then we can
37 #define BBR_WAS_SACKPASS 0x0020 /* We retransmitted due to SACK pass */
57 * no way around this. We may be able to cut back
74 r_app_limited:1,/* We went app limited */
89 * Question, should we instead just grab the sending b/w
113 #define BBR_RED_BW_CONGSIG 0 /* We enter recovery and set using b/w */
114 #define BBR_RED_BW_RATECAL 1 /* We are calculating the loss rate */
115 #define BBR_RED_BW_USELRBW 2 /* We are dropping the lower b/w with
117 #define BBR_RED_BW_SETHIGHLOSS 3 /* We have set our highloss value at
119 #define BBR_RED_BW_PE_CLREARLY 4 /* We have decided to clear the
[all …]
|
| /src/lib/libc/gen/ |
| H A D | wordexp.c | 50 * of words in `we'. See wordexp(3).
55 wordexp(const char * __restrict words, wordexp_t * __restrict we, int flags) in wordexp() argument
60 wordfree(we); in wordexp()
62 we->we_wordc = 0; in wordexp()
63 we->we_wordv = NULL; in wordexp()
64 we->we_strings = NULL; in wordexp()
65 we->we_nbytes = 0; in wordexp()
68 wordfree(we); in wordexp()
71 if ((error = we_askshell(words, we, flags)) != 0) { in wordexp()
72 wordfree(we); in wordexp()
[all …]
|
| /src/contrib/llvm-project/lldb/source/Target/ |
| H A D | ThreadPlanStepOverRange.cpp | 98 // a step out, so we want to catch this case. in SetupAvoidNoDebug()
114 // It is okay to return to a different block of a straight function, we in IsEquivalentContext()
123 // Fall back to symbol if we have no decision from comp_unit/function/block. in IsEquivalentContext()
138 // If we're out of the range but in the same frame or in our caller's frame in ShouldStop()
139 // then we should stop. When stepping out we only stop others if we are in ShouldStop()
146 // If we're in an older frame then we should stop. in ShouldStop()
148 // A caveat to this is if we think the frame is older but we're actually in in ShouldStop()
151 // trampoline. So if we are in a trampoline we think the frame is older in ShouldStop()
152 // because the trampoline confused the backtracer. As below, we step in ShouldStop()
162 // Make sure we really are in a new frame. Do that by unwinding and seeing in ShouldStop()
[all …]
|