| /freebsd/contrib/llvm-project/llvm/lib/Target/AArch64/ |
| H A D | AArch64PromoteConstant.cpp | 148 /// Map an insertion point to all the uses it dominates.
154 /// Check if the given insertion point is dominated by an existing
155 /// insertion point.
158 /// \param NewPt the insertion point to be checked
161 /// \param InsertPts existing insertion points
163 /// \return true if one of the insertion point in InsertPts dominates NewPt,
168 /// Check if the given insertion point can be merged with an existing
169 /// insertion point in a common dominator.
170 /// If true, the given use is added to the list of the created insertion
172 /// \param NewPt the insertion point to be checked
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.h | 105 /// Abstract class used to represent an insertion point in a CFG.
106 /// This class records an insertion point and materializes it on
108 /// It allows to reason about the frequency of this insertion point,
116 /// Materialize the insertion point.
126 /// Return the materialized insertion basic block.
132 /// Return the materialized insertion point.
162 /// the basic block that contains the insertion point.
190 /// Frequency of the insertion point.
197 /// Check whether this insertion point can be materialized.
203 /// Insertion poin
[all...] |
| /freebsd/contrib/tcsh/nls/french/ |
| H A D | set3 | 57 55 Passe du mode insertion au mode recouvrement et vice-versa
84 82 Vi passe en mode insertion après le curseur
85 83 Vi passe en mode insertion à la fin de la ligne
99 97 Passe en mode insertion Vi
100 98 Passe en mode insertion Vi au début de la ligne
109 107 Vi remplace le caractère sous le curseur et passe en mode insertion
|
| H A D | set4 | 13 11 termine le mode d'insertion
17 15 commence le mode insertion
|
| /freebsd/contrib/ofed/opensm/include/complib/ |
| H A D | cl_list.h | 64 * than to a cl_list_item_t structure. Insertion operations on a list can
67 * Use quick list in situations where insertion failures cannot be tolerated.
420 * CL_SUCCESS if the insertion was successful.
422 * CL_INSUFFICIENT_MEMORY if there was not enough memory for the insertion.
425 * Inserts the specified object at the head of the list. List insertion
471 * CL_SUCCESS if the insertion was successful.
473 * CL_INSUFFICIENT_MEMORY if there was not enough memory for the insertion.
476 * Inserts the specified object at the tail of the list. List insertion
516 * CL_SUCCESS if the insertion was successful.
518 * CL_INSUFFICIENT_MEMORY if there was not enough memory for the insertion.
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Frontend/OpenMP/ |
| H A D | OMPIRBuilder.h | 46 /// Splice a BasicBlock at an IRBuilder's current insertion point. Its new
47 /// insert location will stick to after the instruction before the insertion
58 /// semantically there is no change; otherwise the block of the insertion point
64 /// Split a BasicBlock at \p Builder's insertion point, even if the block is
66 /// after the instruction before the insertion point (instead of moving with the
71 /// Split a BasicBlock at \p Builder's insertion point, even if the block is
73 /// after the instruction before the insertion point (instead of moving with the
491 /// Type used throughout for insertion points.
506 /// \param CodeGenIP is the insertion point at which the finalization code
558 /// \param AllocaIP is the insertion point at which new alloca instructions
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | PriorityWorklist.h | 1 //===- PriorityWorklist.h - Worklist with insertion priority ----*- C++ -*-===//
30 /// A FILO worklist that prioritizes on re-insertion without duplication.
33 /// while re-insertion does not create a duplicate, it does adjust the
34 /// visitation order to respect the last insertion point. This can be useful
35 /// when the visit order needs to be prioritized based on insertion point
38 /// Note that this doesn't prevent re-insertion of elements which have been
248 /// The vector of elements in insertion order.
|
| H A D | SetVector.h | 10 /// This file implements a set that has insertion order iteration
12 /// visited later but in a deterministic order (insertion order). The interface
33 /// A vector that has set insertion semantics.
37 /// order of insertion.
45 /// that value_type can be converted into key_type for insertion. Users must be
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/ |
| H A D | interval_map_test.cpp | 45 // Check that insertion coalesces with previous range when values are equal. in TEST()
56 // Check that insertion does not coalesce with previous range when values are in TEST()
74 // Check that insertion coalesces with following range when values are equal. in TEST()
85 // Check that insertion does not coalesce with previous range when values are in TEST()
102 // Check that insertion coalesces with both previous and following ranges in TEST()
121 // Check that insertion does not coalesce with previous range when values are in TEST()
|
| /freebsd/contrib/llvm-project/clang/include/clang/Tooling/Refactoring/ |
| H A D | AtomicChange.h | 30 /// header insertion/deletion.
98 /// insertion conflicts with an existing insertion (at the same position),
99 /// this will be inserted before/after the existing insertion depending on
102 /// is not an insertion, an error is returned.
|
| /freebsd/contrib/llvm-project/clang/lib/Serialization/ |
| H A D | InMemoryModuleCache.cpp | 27 auto Insertion = PCMs.insert(std::make_pair(Filename, std::move(Buffer))); in addPCM() local
28 assert(Insertion.second && "Already has a PCM"); in addPCM()
29 return *Insertion.first->second.Buffer; in addPCM()
|
| /freebsd/contrib/llvm-project/clang/lib/Rewrite/ |
| H A D | RewriteRope.cpp | 104 /// guaranteed that there is a place to do an insertion at the specified
204 /// guaranteed that there is a place to do an insertion at the specified
231 /// guaranteed that there is a place to do an insertion at the specified
237 // Find the insertion point. We are guaranteed that there is a split at the in split()
280 // Find the insertion point. We are guaranteed that there is a split at the in insert()
290 assert(SlotOffs == Offset && "Split didn't occur before insertion!"); in insert()
293 // For an insertion into a non-full leaf node, just insert the value in in insert()
441 /// guaranteed that there is a place to do an insertion at the specified
456 /// HandleChildPiece - A child propagated an insertion result up to us.
472 /// guaranteed that there is a place to do an insertion at the specified
[all …]
|
| H A D | DeltaTree.cpp | 105 /// DoInsertion - Do an insertion of the specified FileIndex/Delta pair into
106 /// this node. If insertion is easy, do it and return false. Otherwise,
180 /// DoInsertion - Do an insertion of the specified FileIndex/Delta pair into
181 /// this node. If insertion is easy, do it and return false. Otherwise,
189 // Find the insertion point, the first delta whose index is >= FileIndex. in DoInsertion()
205 // Otherwise, we found an insertion point, and we know that the value at the in DoInsertion()
209 // For an insertion into a non-full leaf node, just insert the value in in DoInsertion()
274 // Find the insertion point, the first delta whose index is >SubSplit.FileLoc. in DoInsertion()
|
| /freebsd/sys/contrib/device-tree/Bindings/usb/ |
| H A D | usb-nop-xceiv.txt | 21 - vbus-detect-gpio: should specify the GPIO detecting a VBus insertion
43 GPIO 13 detects VBus insertion, and accordingly notifies the vbus-regulator.
|
| /freebsd/sys/contrib/device-tree/Bindings/sound/ |
| H A D | ti,ts3a227e.yaml | 60 ti,debounce-insertion-ms:
61 description: headset insertion debounce time in ms (datasheet section 9.6.5).
|
| /freebsd/contrib/llvm-project/llvm/lib/IR/ |
| H A D | Type.cpp | 338 auto Insertion = pImpl->FunctionTypes.insert_as(nullptr, Key); in get() local
339 if (Insertion.second) { in get()
346 *Insertion.first = FT; in get()
349 FT = *Insertion.first; in get()
384 auto Insertion = pImpl->AnonStructTypes.insert_as(nullptr, Key); in get() local
385 if (Insertion.second) { in get()
391 *Insertion.first = ST; in get()
394 ST = *Insertion.first; in get()
806 auto Insertion = C.pImpl->TargetExtTypes.insert_as(nullptr, Key); in get() local
807 if (Insertion.second) { in get()
[all …]
|
| /freebsd/sys/contrib/openzfs/module/avl/ |
| H A D | avl.c | 42 * insertion and deletion relatively efficiently. Searching the tree is
45 * The key to insertion and deletion is a set of tree manipulations called
210 * Access the node immediately before or after an insertion point.
244 * *where (if not NULL) is set to indicate the insertion point
283 * This routine is used by both insertion and deletion. The return value
505 * insertion point. If we get to a highly unbalanced ancestor, we in avl_insert()
552 * the AVL_PREV or AVL_NEXT and reverse the insertion direction. Since
578 * node and reverse the insertion direction. in avl_insert_here()
630 * Delete a node from the AVL tree. Deletion is similar to insertion, but
|
| /freebsd/sys/dev/ice/ |
| H A D | virtchnl.h | 820 * allows the VF to toggle VLAN filtering, stripping, and/or insertion it should
839 * for filtering, insertion, and stripping capabilities.
841 * If only outer capabilities are supported (for filtering, insertion, and/or
845 * If only inner capabilities are supported (for filtering, insertion, and/or
851 * If both outer and inner capabilities are supported (for filtering, insertion,
895 * if the PF supports a different ethertype for stripping and insertion.
898 * for stripping affect the ethertype(s) specified for insertion and visa versa
901 * that will be the ethertype for both stripping and insertion.
904 * stripping do not affect the ethertype(s) specified for insertion and visa
943 * not allow outer VLAN filtering, stripping, or insertion t
[all...] |
| /freebsd/bin/chio/ |
| H A D | chio.1 | 105 is specified, the media unit will be inverted before insertion.
130 specify whether the media units are to be inverted before insertion into
156 is specified, the media unit will be inverted before insertion.
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.cpp | 213 report_fatal_error("need testcase to support multiple insertion points"); in repairReg()
336 // could not find an insertion point before the terminators of in tryAvoidingSplit()
498 // Find the insertion point for the repairing code. in computeMapping()
503 // If we need to split a basic block to materialize this insertion point, in computeMapping()
533 // Sums up the repairing cost of MO at each insertion point. in computeMapping()
687 // Set a sensible insertion point so that subsequent calls to in assignRegisterBanks()
787 // * After, move the insertion point past the last phi. in RepairingPlacement()
798 // Check if we can move the insertion point prior to the in RepairingPlacement()
829 "copy insertion in middle of terminators not handled"); in RepairingPlacement()
905 // Otherwise the insertion point is just the current or next in materialize()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
| H A D | LoopSimplify.h | 13 // Loop pre-header insertion guarantees that there is a single, non-critical
17 // Loop exit-block insertion guarantees that all exit blocks from the loop
|
| H A D | ScalarEvolutionExpander.h | 130 // RAII object that stores the current insertion point and restores it when
312 /// insertion point. If a type is specified, the result will be expanded to
370 /// Set the current insertion point. This is useful if multiple calls to
383 /// Clear the current insertion point. This is useful if the instruction
384 /// that had been serving as the insertion point may have been deleted.
528 /// current insertion point.
|
| H A D | VNCoercion.h | 79 // This is the same as getValueForLoad, except it performs no insertion.
91 // This is the same as getStoreValueForLoad, except it performs no insertion.
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/ |
| H A D | LoopVectorizationPlanner.h | 73 /// Clear the insertion point: created instructions will not be inserted into
90 /// InsertPoint - A saved insertion point.
96 /// Creates a new insertion point which doesn't point to anything.
99 /// Creates a new insertion point at the given location.
209 /// RAII object that stores the current insertion point and restores it when
|
| /freebsd/contrib/llvm-project/clang/lib/CodeGen/ |
| H A D | CGCleanup.cpp | 58 /// necessary to restore it to usability at the current insertion
429 // If we didn't have any branches, the insertion point before cleanups must in PopCleanupBlocks()
430 // dominate the current insertion point and we don't need to reload any in PopCleanupBlocks()
436 // insertion point. in PopCleanupBlocks()
451 // Find an insertion point after Inst and spill it to the temporary. in PopCleanupBlocks()
459 // Reload the value at the current insertion point. in PopCleanupBlocks()
566 assert(CGF.HaveInsertPoint() && "cleanup ended with no insertion point?"); in EmitCleanup()
635 /// current insertion point is threaded through the cleanup, as are
680 // Branch-through fall-throughs leave the insertion point set to the in PopCleanupBlock()
712 // insertion point in the prebranched block. in PopCleanupBlock()
[all …]
|