Home
last modified time | relevance | path

Searched +full:erase +full:- +full:size (Results 1 – 25 of 1024) sorted by relevance

12345678910>>...41

/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DSparseSet.h1 //===- llvm/ADT/SparseSet.h - Sparse set ------------------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 /// on Programming Languages and Systems, Volume 2 Issue 1-4, March-Dec. 1993.
18 //===----------------------------------------------------------------------===//
34 /// SparseSetValTraits - Objects in a SparseSet are identified by keys that can
44 /// - unsigned key, identity index, identity value
45 /// - unsigned key, identity index, fat value providing getSparseSetIndex()
48 /// - unsigned key, remapped index, identity value (virtual registers)
49 /// - pointer key, pointer-derived index, identity value (node+ID)
[all …]
H A DPriorityWorklist.h1 //===- PriorityWorklist.h - Worklist with insertion priority ----*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
13 //===----------------------------------------------------------------------===//
30 /// A FILO worklist that prioritizes on re-insertion without duplication.
33 /// while re-insertion does not create a duplicate, it does adjust the
38 /// Note that this doesn't prevent re-insertion of elements which have been
39 /// visited -- if you need to break cycles, a set will still be necessary.
72 size_type size() const { in size() function
73 return M.size(); in size()
[all …]
H A DSetVector.h1 //===- llvm/ADT/SetVector.h - Set with insert order iteration ---*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
18 //===----------------------------------------------------------------------===//
40 /// respectively. This allows the vector-type operations and set-type operations
50 /// The parameter N specifies the "small" size of the container, which is the
60 static_assert(N <= 32, "Small size should be less than or equal to 32!");
98 size_type size() const { in size() function
99 return vector_.size(); in size()
156 assert(n < vector_.size() && "SetVector access out of range!");
[all …]
H A DMapVector.h1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
15 //===----------------------------------------------------------------------===//
60 size_type size() const { return Vector.size(); } in size() function
101 auto &I = Result.first->second;
104 I = Vector.size() - 1;
114 return Pos == Map.end()? ValueT() : Vector[Pos->second].second; in lookup()
121 It->second = Vector.size(); in try_emplace()
126 return std::make_pair(begin() + It->second, false); in try_emplace()
[all …]
H A DTinyPtrVector.h1 //===- llvm/ADT/TinyPtrVector.h - 'Normally tiny' vectors -------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
22 /// TinyPtrVector - This class is specialized for cases where there are
34 // default-constructed PtrUnion. This allows an empty TinyPtrVector to
59 this->clear();
66 if (RHS.size() == 1)
73 // If we have a full vector allocated, try to re-use it.
75 cast<VecTy *>(Val)->clear();
76 cast<VecTy *>(Val)->push_back(RHS.front());
[all …]
H A DDenseSet.h1 //===- llvm/ADT/DenseSet.h - Dense probed hash table ------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
76 : DenseSetImpl(PowerOf2Ceil(Elems.size())) { in DenseSetImpl()
81 size_type size() const { return TheMap.size(); } in size() function
84 /// Grow the DenseSet so that it has at least Size buckets. Will not shrink
85 /// the Size of the set.
86 void resize(size_t Size) { TheMap.resize(Size); } in resize() argument
90 void reserve(size_t Size) { TheMap.reserve(Size); } in reserve() argument
[all …]
H A DIntervalMap.h1 //===- llvm/ADT/IntervalMap.h - A sorted interval map -----------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
16 /// individual keys, and insert and erase operations use key intervals as well.
20 /// to a B+-tree representation with very small overhead for small key and
24 /// to work with both closed and half-open intervals.
32 /// each is the optimal size. For large objects use std::map instead.
34 //===----------------------------------------------------------------------===//
83 // const ValT *operator->() const;
87 // const_iterator &operator--();
[all …]
H A DSparseMultiSet.h1 //===- llvm/ADT/SparseMultiSet.h - Sparse multiset --------------*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
19 //===----------------------------------------------------------------------===//
39 /// SparseMultiSet allocates memory proportional to the size of the key
43 /// Compared to DenseSet and DenseMap, SparseMultiSet provides constant-time
44 /// fast clear() as fast as a vector. The find(), insert(), and erase()
47 /// on the order of insert() and erase() operations. Iteration order is the
51 /// Compared to BitVector, SparseMultiSet<unsigned> uses 8x-40x more memory, but
52 /// offers constant-time clear() and size() operations as well as fast iteration
[all …]
H A DSetOperations.h1 //===-- llvm/ADT/SetOperations.h - Generic Set Operations -------*
[all...]
/freebsd-src/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriteRope.cpp1 //===- RewriteRope.cpp - Rope specialized for rewriter --------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
57 /// RopePieceBTreeNode - Common base class for:
59 /// RopePieceBTreeLeaf - Directly manages up to '2*WidthFactor' RopePiece
62 /// RopePieceBTreeInterior - An interior node in the B+ Tree, which manages
67 //===----------------------------------------------------------------------===//
69 //===----------------------------------------------------------------------===//
71 /// RopePieceBTreeNode - Common base class of RopePieceBTreeLeaf and
[all …]
/freebsd-src/contrib/llvm-project/libcxx/include/ext/
H A Dhash_set1 // -*- C++ -*-
2 //===------
[all...]
H A Dhash_map1 // -*- C++ -*-
2 //===------
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/DWARFLinker/Parallel/
H A DOutputSections.cpp1 //=== OutputSections.cpp --------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
22 (SrcCU->getUniqueID() == RefCU->getUniqueID())),
30 RefCU(RefCU, SrcCU->getUniqueID() == RefCU->getUniqueID()),
63 ListDebugStrPatch.erase(); in clearAllSectionData()
64 ListDebugLineStrPatch.erase(); in clearAllSectionData()
65 ListDebugRangePatch.erase(); in clearAllSectionData()
66 ListDebugLocPatch.erase(); in clearAllSectionData()
67 ListDebugDieRefPatch.erase(); in clearAllSectionData()
[all …]
/freebsd-src/bin/stty/
H A Dstty.11 .\"-
57 .Bl -tag -width indent
61 .St -p1003.2 .
84 .St -p1003.2 .
93 .Bl -tag -width Fl
100 Select character size, if possible.
150 .Bl -tag -width Fl
226 Assume that input characters are UTF-8 encoded. Setting this flag
231 .Bl -tag -width Fl
233 Post-process output (do not
[all …]
/freebsd-src/usr.sbin/trim/
H A Dtrim.831 .Nd erase device blocks that have no needed contents
36 .Bk -words
43 .Bk -words
56 .Bl -tag -width indent
58 Do not actually erase anything but show what it would do (dry run).
104 as length of the region to erase.
120 .Ex -std
121 If the final erase operation fails for an argument, the
127 .Bl -tag -width ".Dv EX_UNAVAILABLE"
139 cannot be examined for its size due to some system input/output error.
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/Hexagon/Disassembler/
H A DHexagonDisassembler.cpp1 //===- HexagonDisassembler.cpp - Disassembler for Hexagon ISA -------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
33 #define DEBUG_TYPE "hexagon-disassembler"
57 DecodeStatus getInstruction(MCInst &Instr, uint64_t &Size,
67 MI.size() != HexagonMCInstrInfo::getExtendableOp(MCII, MI)) in fullValue()
73 Disassembler.CurrentExtender->getOperand(0).getExpr()->evaluateAsAbsolute( in fullValue()
94 // Forward declare these because the auto-generated code will reference them.
173 DecodeStatus HexagonDisassembler::getInstruction(MCInst &MI, uint64_t &Size, in getInstruction() argument
179 Size = 0; in getInstruction()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLostDebugLocObserver.cpp1 //===----- llvm/CodeGen/GlobalISel/LostDebugLocObserver.cpp -----*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
11 //===----------------------------------------------------------------------===//
30 LOC_DEBUG(dbgs() << ".. Searching " << PotentialMIsForDebugLocs.size() in analyzeDebugLocations()
31 << " instrs for " << LostDebugLocs.size() << " locations\n"); in analyzeDebugLocations()
34 if (!MI->getDebugLoc()) in analyzeDebugLocations()
36 // Check this first in case there's a matching line-0 location on both input in analyzeDebugLocations()
38 if (MI->getDebugLoc().getLine() == 0) { in analyzeDebugLocations()
40 dbgs() << ".. Assuming line-0 location covers remainder (if any)\n"); in analyzeDebugLocations()
[all …]
/freebsd-src/contrib/libcbor/oss-fuzz/
H A Dcbor_load_fuzzer.cc12 void *limited_malloc(size_t size) { in limited_malloc() argument
13 if (size + allocated_mem > kMemoryLimit) { in limited_malloc()
16 if (size == 0) { in limited_malloc()
19 void* m = malloc(size); in limited_malloc()
21 allocated_mem += size; in limited_malloc()
22 allocated_len_map[m] = size; in limited_malloc()
33 allocated_mem -= allocated_len_map[ptr]; in limited_free()
34 allocated_len_map.erase(ptr); in limited_free()
38 void *limited_realloc(void *ptr, size_t size) { in limited_realloc() argument
43 return limited_malloc(size); in limited_realloc()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DTrace.h1 //===- llvm/Analysis/Trace.h - Represent one trace of LLVM code -*- C++ -*-===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
10 // single entry, multiple exit, region of code that is often hot. Trace-based
13 // fall-through path are made at the expense of the non-fall-through paths.
15 //===----------------------------------------------------------------------===//
36 /// Trace ctor - Make a new trace from a vector of basic blocks,
41 /// getEntryBasicBlock - Return the entry basic block (first block)
45 /// operator[]/getBlock - Return basic block N in the trace.
49 /// getFunction - Return this trace's parent function.
[all …]
/freebsd-src/usr.bin/dtc/
H A Dchecking.cc1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
8 * Cambridge Computer Laboratory under DARPA/AFRL contract (FA8750-10-C-0237)
52 auto &deleted = n->deleted_child_nodes(); in check_node()
57 bool plural = deleted.size() > 1; in check_node()
73 * #address-cells and #size-cells properties.
82 if (n->child_begin() == n->child_end()) in check_node()
88 for (auto i=n->property_begin(), e=n->property_end() ; i!=e ; ++i) in check_node()
92 found_address = ((*i)->get_key() == "#address-cells"); in check_node()
96 found_size = ((*i)->get_key() == "#size-cells"); in check_node()
[all …]
/freebsd-src/contrib/llvm-project/clang/lib/AST/
H A DRandstruct.cpp1 //===--- Randstruct.cpp ---------------------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
39 // cache-line.
42 int Size = 0; member in __anonce06ef4d0111::Bucket
50 return Size + FieldSize <= CACHE_LINE; in canFit()
53 bool full() const { return Size >= CACHE_LINE; } in full()
57 Size += FieldSize; in addField()
69 // All of the Buckets produced by best-effort cache-line algorithm. in randomizeStructureLayoutImpl()
[all …]
/freebsd-src/sys/powerpc/powernv/
H A Dopal_flash.c1 /*-
54 * boundaries, but ERASE is only at flash-block-size block alignments and sizes.
57 * - Reads are on a 512-byte block boundary and size
58 * - Writes and Erases are aligned and sized on flash-block-size bytes.
70 bool sc_erase; /* Erase is needed before write. */
73 #define OPALFLASH_LOCK(sc) mtx_lock(&(sc)->sc_mtx)
74 #define OPALFLASH_UNLOCK(sc) mtx_unlock(&(sc)->sc_mtx)
76 mtx_init(&(sc)->sc_mtx, device_get_nameunit((sc)->sc_dev), \
130 if (bp->bio_disk == NULL || bp->bio_disk->d_drv1 == NULL) in opalflash_getattr()
133 sc = bp->bio_disk->d_drv1; in opalflash_getattr()
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/ExecutionEngine/IntelJITEvents/
H A DIntelJITEventListener.cpp1 //===-- IntelJITEventListener.cpp - Tell Intel profiler about JITed code --===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===-
272 uint64_t Size = P.second; notifyObjectLoaded() local
[all...]
/freebsd-src/sys/dev/mmc/
H A Dmmcsd.c1 /*-
2 * SPDX-License-Identifier: BSD-2-Clause
35 * Group. This Simplified Specification is provided on a non-confidential
38 * Association, SD Group, SD-3C LLC or other third parties.
44 * is provided "AS-IS" without any representations or warranties of any
45 * kind. No responsibility is assumed by the SD Group, SD-3C LLC or the SD
47 * right of the SD Group, SD-
232 off_t erase_size, sector_size, size, wp_size; mmcsd_attach() local
433 mmcsd_pretty_size(off_t size,char * unit) mmcsd_pretty_size() argument
833 u_long cnt, size; mmcsd_ioctl() local
[all...]
/freebsd-src/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_thread_registry.cpp1 //===-- sanitizer_thread_registry.cpp -------------------------------------===//
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
7 //===----------------------------------------------------------------------===//
12 //===----------------------------------------------------------------------===//
37 name[sizeof(name) - 1] = '\0'; in SetName()
126 *total = threads_.size(); in GetNumberOfThreads()
142 tid = tctx->tid; in CreateThread()
143 } else if (threads_.size() < max_threads_) { in CreateThread()
145 tid = threads_.size(); in CreateThread()
161 CHECK_EQ(tctx->status, ThreadStatusInvalid); in CreateThread()
[all …]

12345678910>>...41