Home
last modified time | relevance | path

Searched full:gaps (Results 1 – 25 of 177) sorted by relevance

12345678

/freebsd/lib/libsys/
H A Dprocctl.2619 Controls stack gaps in the specified process.
630 Gaps protect against stack overflows by preventing them from corrupting memory
641 If stack gaps are enabled, the flag is ignored.
642 If stack gaps are disabled, the request fails with
644 After gaps are disabled in a process, they can only be re-enabled when an
648 Disable stack gaps for the process.
652 Enable stack gaps for the new address space constructed by any future
656 Inherit disabled stack gaps state after
658 In other words, if the currently executing program has stack gaps disabled,
660 If gaps were enabled, they are kept enabled after exec.
[all …]
/freebsd/contrib/llvm-project/llvm/lib/ObjectYAML/
H A DCodeViewYAMLSymbols.cpp413 IO.mapRequired("Gaps", Symbol.Gaps); in map()
420 IO.mapRequired("Gaps", Symbol.Gaps); in map()
427 IO.mapRequired("Gaps", Symbol.Gaps); in map()
433 IO.mapRequired("Gaps", Symbol.Gaps); in map()
441 IO.mapRequired("Gaps", Symbol.Gaps); in map()
454 IO.mapRequired("Gaps", Symbol.Gaps); in map()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DSymbolDumper.cpp51 void printLocalVariableAddrGap(ArrayRef<LocalVariableAddrGap> Gaps);
89 ArrayRef<LocalVariableAddrGap> Gaps) { in printLocalVariableAddrGap() argument
90 for (auto &Gap : Gaps) { in printLocalVariableAddrGap()
319 printLocalVariableAddrGap(DefRangeFramePointerRel.Gaps); in visitKnownRecord()
333 printLocalVariableAddrGap(DefRangeRegisterRel.Gaps); in visitKnownRecord()
344 printLocalVariableAddrGap(DefRangeRegister.Gaps); in visitKnownRecord()
356 printLocalVariableAddrGap(DefRangeSubfieldRegister.Gaps); in visitKnownRecord()
375 printLocalVariableAddrGap(DefRangeSubfield.Gaps); in visitKnownRecord()
392 printLocalVariableAddrGap(DefRange.Gaps); in visitKnownRecord()
H A DSymbolRecordMapping.cpp234 error(IO.mapVectorTail(DefRangeFramePointerRel.Gaps, MapGap())); in visitKnownRecord()
255 error(IO.mapVectorTail(DefRangeRegisterRel.Gaps, MapGap())); in visitKnownRecord()
266 error(IO.mapVectorTail(DefRangeRegister.Gaps, MapGap())); in visitKnownRecord()
278 error(IO.mapVectorTail(DefRangeSubfieldRegister.Gaps, MapGap())); in visitKnownRecord()
289 error(IO.mapVectorTail(DefRangeSubfield.Gaps, MapGap())); in visitKnownRecord()
299 error(IO.mapVectorTail(DefRange.Gaps, MapGap())); in visitKnownRecord()
/freebsd/contrib/llvm-project/llvm/tools/llvm-pdbutil/
H A DMinimalSymbolDumper.cpp357 ArrayRef<LocalVariableAddrGap> Gaps) { in formatGaps() argument
359 for (const auto &G : Gaps) { in formatGaps()
615 P.formatLine("gaps = [{0}]", formatGaps(P.getIndentLevel() + 9, Def.Gaps)); in visitKnownRecord()
627 P.formatLine("range = {0}, gaps = [{1}]", formatRange(Def.Range), in visitKnownRecord()
628 formatGaps(P.getIndentLevel() + 9, Def.Gaps)); in visitKnownRecord()
642 P.formatLine("gaps = [{0}]", in visitKnownRecord()
643 formatGaps(P.getIndentLevel() + 9, DefRangeRegister.Gaps)); in visitKnownRecord()
654 P.formatLine("range = {0}, gaps = [{1}]", formatRange(Def.Range), in visitKnownRecord()
655 formatGaps(P.getIndentLevel() + 9, Def.Gaps)); in visitKnownRecord()
664 P.formatLine("gaps = [{0}]", formatGaps(P.getIndentLevel() + 9, Def.Gaps)); in visitKnownRecord()
[all …]
/freebsd/usr.sbin/pw/tests/
H A Dpw-modified.conf8 # Reuse gaps in uid sequence? (yes or no)
11 # Reuse gaps in gid sequence? (yes or no)
H A Dpw.conf8 # Reuse gaps in uid sequence? (yes or no)
11 # Reuse gaps in gid sequence? (yes or no)
/freebsd/sys/contrib/openzfs/tests/zfs-tests/tests/functional/mmp/
H A Dmultihost_history.ksh22 # zfs_multihost_history should report both writes issued and gaps
27 # 3. Check multihost_history for both issued writes, and for gaps where
/freebsd/usr.sbin/pw/
H A Dpw.conf.564 reuse gaps in uid sequences
66 reuse gaps in gid sequences
149 reusing gaps in the user or group id sequence that are caused by
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DOptimizedStructLayout.h96 /// gaps among the fixed-offset fields, the algorithm may attempt
97 /// to allocate flexible-offset fields into those gaps. If that's
98 /// undesirable, the caller should "block out" those gaps by e.g.
/freebsd/contrib/llvm-project/lldb/source/Plugins/SymbolFile/NativePDB/
H A DPdbUtil.cpp37 llvm::ArrayRef<LocalVariableAddrGap> gaps) { in MakeRangeList() argument
45 while (!gaps.empty()) { in MakeRangeList()
46 const LocalVariableAddrGap &gap = gaps.front(); in MakeRangeList()
50 gaps = gaps.drop_front(); in MakeRangeList()
797 MakeRangeList(index, loc.Range, loc.Gaps); in GetVariableLocationInfo()
836 MakeRangeList(index, loc.Range, loc.Gaps); in GetVariableLocationInfo()
851 MakeRangeList(index, loc.Range, loc.Gaps); in GetVariableLocationInfo()
881 Variable::RangeList ranges = MakeRangeList(index, loc.Range, loc.Gaps); in GetVariableLocationInfo()
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DSymbolRecord.h472 std::vector<LocalVariableAddrGap> Gaps;
494 std::vector<LocalVariableAddrGap> Gaps;
516 std::vector<LocalVariableAddrGap> Gaps;
540 std::vector<LocalVariableAddrGap> Gaps; in getRelocationOffset()
566 std::vector<LocalVariableAddrGap> Gaps;
601 std::vector<LocalVariableAddrGap> Gaps;
451 std::vector<LocalVariableAddrGap> Gaps; global() variable
473 std::vector<LocalVariableAddrGap> Gaps; global() variable
495 std::vector<LocalVariableAddrGap> Gaps; global() variable
519 std::vector<LocalVariableAddrGap> Gaps; global() variable
545 std::vector<LocalVariableAddrGap> Gaps; global() variable
580 std::vector<LocalVariableAddrGap> Gaps; global() variable
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DOptimizedStructLayout.cpp173 // Consider the padding gaps between fixed-offset fields in ascending in performOptimizedStructLayout()
204 // better advantage of large gaps and may be more likely to have a size in performOptimizedStructLayout()
213 // O_j be the object sizes; add fixed-offset fields such that the gaps in performOptimizedStructLayout()
421 // Phase 1: fill the gaps between fixed-offset fields with the best in performOptimizedStructLayout()
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DVectorUtils.h340 /// are gaps.
468 /// Note: the interleaved load group could have gaps (missing members), but
469 /// the interleaved store group doesn't allow gaps.
567 /// Returns true if this Group requires a scalar iteration to handle gaps.
574 // We have a group with gaps. It therefore can't be a reversed access, in requiresScalarEpilogue()
578 // This is a group of loads, with gaps, and without a last-member in requiresScalarEpilogue()
670 /// Invalidate groups that require a scalar epilogue (due to gaps). This can
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DVectorUtils.cpp1150 // part of a full group or a group with gaps. Checking wrapping for all in collectConstStrideAccesses()
1151 // pointers (even those that end up in groups with no gaps) will be overly in collectConstStrideAccesses()
1422 // Remove interleaved groups with gaps whose memory in analyzeInterleaving()
1454 // Case 3: A non-reversed interleaved load group with gaps: We need in analyzeInterleaving()
1462 "a reverse access with gaps.\n"); in analyzeInterleaving()
1479 // Interleave-store-group with gaps is implemented using masked wide store. in analyzeInterleaving()
1480 // Remove interleaved store groups with gaps if in analyzeInterleaving()
1485 "to gaps.\n"); in analyzeInterleaving()
1494 // stores with gaps, which are implemented with masked-store (rather than in analyzeInterleaving()
1519 << "LV: Invalidate candidate interleaved group due to gaps that " in invalidateGroupsRequiringScalarEpilogue()
/freebsd/sys/contrib/openzfs/module/zfs/
H A Drange_tree.c54 * A range tree is also capable of 'bridging' gaps when adding
58 * is not to bridge gaps (i.e. the maximum allowed gap size is 0).
70 * that can bridge small gaps between segments. This kind of tree is used
74 * this implementation is that segments of range trees with gaps can only
544 * of range trees with gaps. in range_tree_remove_impl()
/freebsd/contrib/libarchive/libarchive/
H A Darchive_read_data.358 and fills any gaps with nulls so that callers see a single
/freebsd/sys/contrib/device-tree/Bindings/net/
H A Dqca,qca7000.txt28 between each data word. In burst mode these gaps aren't
/freebsd/sys/contrib/device-tree/Bindings/display/bridge/
H A Dsii902x.txt24 but there can be no gaps. E.g. an i2s pin must be mapped to
H A Dsil,sii9022.yaml67 connected to any FIFO, but there can be no gaps. E.g. an I2S pin must be
/freebsd/tools/tools/mctest/
H A Dmctest.199 Gaps are measured with
/freebsd/sys/contrib/openzfs/man/man8/
H A Dzpool-events.8334 and can include some gaps of non-corruption.
340 array, gaps of non-corruption
/freebsd/contrib/tzcode/
H A DCONTRIBUTING11 free to fill gaps or fix mistakes, and please email improvements
/freebsd/contrib/tzdata/
H A DCONTRIBUTING11 free to fill gaps or fix mistakes, and please email improvements
/freebsd/stand/i386/loader/
H A Dhelp.i38635 gaps in the sequence (eg. no primary slave), the unit number can be

12345678