| /freebsd/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 …]
|
| /freebsd/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 …]
|
| H A D | pt_image_section_cache.c | 181 /* We do not zero-initialize the array - a NULL check is in pt_iscache_find_locked()
198 /* We should not have a section without a filename. */ in pt_iscache_find_locked()
257 /* We shouldn't prune the cache unnecessarily. */ in pt_iscache_lru_prune()
263 * Returns a positive integer if we need to prune the cache.
264 * Returns zero if we don't need to prune the cache.
281 /* Don't try to add the section if it is too big. We'd prune it again in pt_isache_lru_new()
316 * Returns a positive integer if we need to prune the cache.
317 * Returns zero if we don't need to prune the cache.
334 /* We found it in the cache. Move it to the front. */ in pt_iscache_lru_add()
342 /* We didn't find it in the cache. Add it. */ in pt_iscache_lru_add()
[all …]
|
| /freebsd/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 …]
|
| H A D | WebAssemblySortRegion.cpp | 19 const auto *WE = WEI.getExceptionFor(MBB); in getRegionFor() local
20 if (!ML && !WE) in getRegionFor()
22 // We determine subregion relationship by domination of their headers, i.e., in getRegionFor()
27 // dominated by its header. So here we should use in getRegionFor()
28 // WE->contains(ML->getHeader()), but not ML->contains(WE->getHeader()). in getRegionFor()
29 if ((ML && !WE) || (ML && WE && WE->contains(ML->getHeader()))) { in getRegionFor()
37 if (ExceptionMap.count(WE)) in getRegionFor()
38 return ExceptionMap[WE].get(); in getRegionFor()
39 ExceptionMap[WE] = in getRegionFor()
40 std::make_unique<ConcreteSortRegion<WebAssemblyException>>(WE); in getRegionFor()
[all …]
|
| /freebsd/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 …]
|
| H A D | file_subs.c | 77 * works. We have to take special handling when the file does exist. To in file_creat()
78 * detect this, we use O_EXCL. For example when trying to create a in file_creat()
79 * file and a character device or fifo exists with the same name, we in file_creat()
81 * open). If we find that the open has failed, then spend the effort in file_creat()
92 * the file seems to exist. First we try to get rid of it (found to be in file_creat()
94 * then we go to the expense to check and create the path to the file in file_creat()
103 * it cannot fix anything, we will skip the last attempt in file_creat()
137 * set owner/groups first as this may strip off mode bits we want in file_close()
146 * if not preserving mode or we cannot set uid/gid, then PROHIBIT in file_close()
171 * we may be running as root, so we have to be sure that link target in lnk_creat()
[all …]
|
| /freebsd/sys/contrib/openzfs/module/zfs/ |
| H A D | spa_log_spacemap.c | 41 * throughout the pool. This means that each TXG we will have to append some
42 * FREE records to almost every metaslab. With log space maps, we hold their
45 * more unflushed changes are accounted in memory, we flush a selected group
47 * when loading the pool. Flushing a metaslab to disk relieves memory as we
56 * is activated when we create the first log space map and remains active
70 * the metaslab haven't had its changes flushed. During import, we use this
72 * from a TXG before msp_unflushed_txg. At that point, we also populate its
74 * we flush that metaslab.
80 * end of the TXG and will be destroyed when it becomes fully obsolete. We
84 * doesn't have the changes from that log and we can therefore destroy it.
[all …]
|
| H A D | spa_checkpoint.c | 41 * flag is set to active when we create the checkpoint and remains active
44 * references the state of the pool when we take the checkpoint. The entry
45 * remains populated until we start discarding the checkpoint or we rewind
51 * but we want to keep around in case we decide to rewind to the checkpoint.
55 * checkpoint, with the only exception being the scenario when we free
65 * - To create a checkpoint, we first wait for the current TXG to be synced,
66 * so we can use the most recently synced uberblock (spa_ubsync) as the
67 * checkpointed uberblock. Then we use an early synctask to place that
70 * to the TXG of the checkpointed uberblock. We use an early synctask for
75 * - When a checkpoint exists, we need to ensure that the blocks that
[all …]
|
| /freebsd/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 …]
|
| /freebsd/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 …]
|
| H A D | CMakeLists.txt | 3 # We need 3.12 or later, so that we can set policy CMP0074; see
16 # otherwise, require 3.5, so we don't get messages warning
29 # neither do we with autotools; don't do so with CMake, either, and
45 # WE KNOW WHAT WE'RE DOING, WE'RE DOING EVERYTHING THE WAY THAT NEWER
53 # We want find_file() and find_library() to honor {packagename}_ROOT,
63 # We want check_include_file() to honor CMAKE_REQUIRED_LIBRARIES; see
74 # We explicitly indicate what languages are used in libpcap to avoid
113 # shipping a pre-built shared library cache, at least), and we do the
147 # system library, which we do *NOT* want to put in our libpcap.pc and
150 # So we just run pkg-config ourselves, so that we get its output
[all …]
|
| H A D | pcap-linux.c | 108 * We require TPACKET_V2 support.
114 /* check for memory mapped access availability. We assume every needed
175 * When capturing on all interfaces we use this as the buffer size.
191 int must_do_on_close; /* stuff we must do when we close */
194 int ifindex; /* interface index of device we're bound to */
196 int netdown; /* we got an ENETDOWN and haven't resolved it */
198 char *mondevice; /* mac80211 monitor device we created */
214 * Stuff to do when we close.
270 * With a pre-3.0 kernel, we cannot distinguish between packets with no
271 * VLAN tag and packets on VLAN 0, so we will mishandle some packets, and
[all …]
|
| /freebsd/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 …]
|
| H A D | tcp_rack.h | 31 #define RACK_DEFERRED 0x000004/* We can't use this for RTT calc - not used */
32 #define RACK_OVERMAX 0x000008/* We have more retran's then we can fit */
34 #define RACK_WAS_SACKPASS 0x000020/* We retransmitted due to SACK pass */
38 #define RACK_APP_LIMITED 0x000200/* We went app limited after this send */
45 #define RACK_MUST_RXT 0x010000/* We must retransmit this rsm (non-sack/mtu chg)*/
71 uint32_t orig_m_len; /* The original mbuf len when we sent (can update) */
72 uint32_t orig_t_space; /* The original trailing space when we sent (can update) */
98 * to cast it to uint32_t. The reason we do this is not for
99 * wrap, but we need to get back, at times, to the millisecond
100 * timestamp that is used in the TSTMP option. To do this we
[all …]
|
| /freebsd/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 …]
|
| /freebsd/contrib/tcpdump/ |
| H A D | CMakeLists.txt | 3 # We need 3.12 or later, so that we can set policy CMP0074; see
16 # otherwise, require 3.5, so we don't get messages warning
28 # We want find_path() and find_library() to honor {packagename}_ROOT,
71 # We suppress this by setting CMAKE_INSTALL_RPATH_USE_LINK_PATH to TRUE;
82 # If, for whatever reason, directories in which we search for external
84 # added to the executable's rpath in the build process, we most
93 # We explicitly indicate what languages are used in tcpdump to avoid
134 # Show the bit width for which we're compiling.
138 # libraries that we might use (looking at *you*, Oracle Studio!).
151 # there are two separate .pc files, so if we're doing a 32-bit build we
[all …]
|
| H A D | configure.ac | 24 # Try to enable as many C99 features as we can.
25 # At minimum, we want C++/C99-style // comments.
76 # Do we have pkg-config?
81 # Do we have the brew command from Homebrew?
95 # OK, we found smi.h. Do we have libsmi with smiInit?
100 # OK, we have libsmi with smiInit. Can we use it?
137 dnl We leave this in just in case
246 # We don't check cap_rights_init(), as it's a macro, wrapping another
250 # All of the ones we check for must be available in order to enable
253 # XXX - do we need to check for all of them, or are there some that, if
[all …]
|
| /freebsd/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 …]
|
| H A D | StopInfo.cpp | 63 // This is a little tricky. We want to count "run and stopped again in HasTargetRunSinceMe()
65 // HasTargetRunSinceMe. But we don't want to include any running of the in HasTargetRunSinceMe()
66 // target done for expressions. So we track both resumes, and resumes in HasTargetRunSinceMe()
155 // Only check once if we should stop at a breakpoint in ShouldStopSynchronous()
192 // If we have just hit an internal breakpoint, and it has a kind in GetDescription()
284 // conditions, we should change the stop-info to none. Otherwise, if we in PerformAction()
292 // site, then we won't be operating on a bad list. in PerformAction()
299 actually_hit_any_locations = true; // We're going to stop, don't in PerformAction()
302 // We go through each location, and test first its precondition - in PerformAction()
303 // this overrides everything. Note, we only do this once per in PerformAction()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.cpp | 100 // We could preserve the information from these two analysis but in getAnalysisUsage()
113 // By default we assume we will have to repair something. in assignmentMatch()
142 assert(!NewVRegs.empty() && "We should not have to repair"); in repairReg()
146 // Assume we are repairing a use and thus, the original reg will be in repairReg()
151 // If we repair a definition, swap the source and destination for in repairReg()
157 "We are about to create several defs for Dst"); in repairReg()
216 // Check if MI is legal. if not, we need to legalize all the in repairReg()
217 // instructions we are going to insert. in repairReg()
240 assert(MO.isReg() && "We should only repair register operand"); in getRepairCost()
245 // If MO does not have a register bank, we should have just been in getRepairCost()
[all …]
|
| /freebsd/crypto/openssl/util/ |
| H A D | add-depends.pl | 19 # When using stat() on Windows, we can get it to perform better by avoid some
20 # data. This doesn't affect the mtime field, so we're not losing anything...
59 # Convenient cache of absolute to relative map. We start with filling it
63 # generate entries in this map. We could of course deal with C header files
64 # only, but in case we decide to handle more than just C files in the future,
65 # we already have the mechanism in place here.
66 # NOTE2: we lower case the index to make it searchable without regard for
67 # character case. That could seem dangerous, but as long as we don't have
68 # files we depend on in the same directory that only differ by character case,
69 # we're fine.
[all …]
|