erase\-size (full) in projects: freebsd

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

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

12 3 4 5 6 7 8 9 10 >>...43

/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A D	SparseSet.h	`1 //===- llvm/ADT/SparseSet.h - Sparse set -------- [all...]`
H A D	MapVector.h	`1 //===- llvm/ADT/MapVector.h - Map w/ deterministic value order --- C++ --===// 5 // SPDX-License-Identifier: Apache-2. 60 size_type size() const { return Vector.size(); } size() function 172 typename VectorType::iterator erase(typename VectorType::iterator Iterator) { erase() function 191 size_type erase(const KeyT &Key) { erase() function [all...]`
H A D	PriorityWorklist.h	1 //===- 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 D	SetVector.h	`1 //===- llvm/ADT/SetVector.h - Set with insert order iteration ---- C++ --===// 5 // SPDX-License-Identifie 98 size_type size() const { size() function 212 iterator erase(const_iterator I) { erase() function [all...]`
H A D	SetOperations.h	1 //===-- llvm/ADT/SetOperations.h - Generic Set Operations -------- C++ --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 13 //===----------------------------------------------------------------------===// 33 decltype(std::declval<Set>().erase(std::declval<Set>().begin())); 41 /// set_union(A, B) - Compute A := A u B, return whether A changed. 53 /// set_intersect(A, B) - Compute A := A ^ B 67 S1.erase(I); // Erase element if not in S2 in set_intersect() 81 /// set_intersection(A, B) - Return A ^ B 84 if (S1.size() < S2.size()) in set_intersection() [all …]
H A D	TinyPtrVector.h	1 //===- 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 D	IntervalMap.h	1 //===- llvm/ADT/IntervalMap.h - A sorted interval map -------- 272 erase(unsigned i,unsigned j,unsigned Size) erase() argument 279 erase(unsigned i,unsigned Size) erase() argument 286 shift(unsigned i,unsigned Size) shift() argument 295 transferToLeftSib(unsigned Size,NodeBase & Sib,unsigned SSize,unsigned Count) transferToLeftSib() argument 306 transferToRightSib(unsigned Size,NodeBase & Sib,unsigned SSize,unsigned Count) transferToRightSib() argument 319 adjustFromLeftSib(unsigned Size,NodeBase & Sib,unsigned SSize,int Add) adjustFromLeftSib() argument 515 unsigned size() const { return pip.getInt() + 1; } size() function 582 findFrom(unsigned i,unsigned Size,KeyT x) findFrom() argument 630 insertFrom(unsigned & Pos,unsigned Size,KeyT a,KeyT b,ValT y) insertFrom() argument 717 findFrom(unsigned i,unsigned Size,KeyT x) findFrom() argument 752 insert(unsigned i,unsigned Size,NodeRef Node,KeyT Stop) insert() argument 778 unsigned size; global() member 800 unsigned size(unsigned Level) const { return path[Level].size; } size() function 850 setSize(unsigned Level,unsigned Size) setSize() argument 860 setRoot(void * Node,unsigned Size,unsigned Offset) setRoot() argument 1221 unsigned size[Nodes]; branchRoot() local 1262 unsigned Size[Nodes]; splitRoot() local 1840 unsigned Size = IM.rootLeaf().insertFrom(P.leafOffset(), IM.rootSize, a, b, y); insert() local 1899 unsigned Size = P.leafSize(); treeInsert() local 1922 iterator::erase() { erase() function [all...]
H A D	DenseSet.h	1 //===- 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 D	SparseMultiSet.h	1 //===- 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 D	ilist.h	1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------- C++ --==// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 15 /// replacement does not provide a constant time size() method, so be careful to 22 //===----------------------------------------------------------------------===// 36 /// Specialize this to get different behaviour for ownership-related API. (If 48 /// non-intrusive deletion in iplist (which implies ownership). 95 //===----------------------------------------------------------------------===// 97 /// A wrapper around an intrusive list with callbacks and non-intrusive 150 size_type max_size() const { return size_type(-1); } [all …]
/freebsd/contrib/llvm-project/clang/lib/Rewrite/
H A D	RewriteRope.cpp	1 //===- 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/contrib/llvm-project/libcxx/include/ext/
H A D	hash_set	`1 // -- C++ -- 2 //===----------------------------------------------------------------------===// 6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 8 //===----------------------------------------------------------------------===// 56 size_type size() const; 68 void erase(const_iterator position); 69 size_type erase(const key_type& k); 70 void erase(const_iterator first, const_iterator last); 142 size_type size() const; 154 void erase(const_iterator position); [all …]`
H A D	hash_map	`1 // -- C++ -- 2 //===----------------------------------------------------------------------===// 6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 8 //===----------------------------------------------------------------------===// 60 size_type size() const; 72 void erase(const_iterator position); 73 size_type erase(const key_type& k); 74 void erase(const_iterator first, const_iterator last); 150 size_type size() const; 162 void erase(const_iterator position); [all …]`
/freebsd/bin/stty/
H A D	stty.1	`1 .\"- 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/usr.sbin/trim/
H A D	trim.8	`31 .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/contrib/llvm-project/llvm/lib/Target/Hexagon/Disassembler/
H A D	HexagonDisassembler.cpp	`1 //===- HexagonDisassembler.cpp - Disassembler for Hexagon ISA -------- 173 getInstruction(MCInst & MI,uint64_t & Size,ArrayRef<uint8_t> Bytes,uint64_t Address,raw_ostream & cs) const getInstruction() argument [all...]`
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A D	LostDebugLocObserver.cpp	1 //===----- 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/contrib/llvm-project/llvm/include/llvm/Analysis/
H A D	Trace.h	1 //===- 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/contrib/libcbor/oss-fuzz/
H A D	cbor_load_fuzzer.cc	12 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/usr.bin/dtc/
H A D	checking.cc	1 /- 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/sys/dev/mmc/
H A D	mmcsd.c	1 /- 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-3C LLC, the SD Card Association or any third 50 * SD Group, SD-3C LLC, the SD Card Association or any third party. Nothing 51 * herein shall be construed as an obligation by the SD Group, the SD-3C LLC 53 * information, know-how or other confidential information to any third party. [all …]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A D	Randstruct.cpp	1 //===--- Randstruct.cpp ---------------------------------------------------===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 12 //===----------------------------------------------------------------------===// 39 // cache-line. 42 int Size = 0; member in __anon49e3dfbb0111::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/contrib/llvm-project/llvm/lib/ExecutionEngine/IntelJITEvents/
H A D	IntelJITEventListener.cpp	1 //===-- IntelJITEventListener.cpp - Tell Intel profiler about JITed code --===// 5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception 7 //===----------------------------------------------------------------------===// 12 //===----------------------------------------------------------------------===// 16 #include "llvm-c/ExecutionEngine.h" 37 #define DEBUG_TYPE "amplifier-jit-event-listener" 64 if (SectionInfoVector.size()) in getSectionInfoVectorBegin() 96 SectionInfo.size = ElfSection.getSize(); in fillSectionInformation() 98 SectionInfo.size); in fillSectionInformation() 112 // reallocation - reallocation invalidates all the references, pointers, and in fillSectionInformation() [all …]
/freebsd/sys/powerpc/powernv/
H A D	opal_flash.c	1 /- 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/share/man/man4/
H A D	termios.4	`190 returns -1 with 224 returns -1 with 238 full-duplex mode, so that data may arrive even while output is occurring. 271 This is useful for terminals that can operate in full-duplex mode. 291 .Bl -enum -offset indent 301 If there is no data available, the read returns -1, with 313 character, an end-of-file 315 character, or an end-of-line 342 Erase and kill processing occur when either of two special characters, 344 .Dv ERASE [all …]`

12 3 4 5 6 7 8 9 10 >>...43