| /src/external/apache2/llvm/dist/llvm/lib/Transforms/IPO/ |
| ExtractGV.cpp | 21 /// Make sure GV is visible from both modules. Delete is true if it is
25 static void makeVisible(GlobalValue &GV, bool Delete) {
27 if (Local || Delete) {
86 bool Delete = deleteStuff == (bool)Named.count(&GV) &&
89 if (!Delete) {
96 makeVisible(GV, Delete);
98 if (Delete) {
107 bool Delete =
109 if (!Delete) {
114 makeVisible(F, Delete);
[all...] |
| /src/external/bsd/openldap/dist/contrib/slapd-modules/variant/tests/scripts/ |
| test006-acl | 43 dn: ou=Add & Delete,dc=example,dc=com
46 ou: Add & Delete
48 dn: cn=group,ou=Add & Delete,dc=example,dc=com
53 dn: sn=Doe,ou=Add & Delete,dc=example,dc=com
59 dn: sn=Elliot,ou=Add & Delete,dc=example,dc=com
93 echo "# Add & Delete subtree contents as seen by Babs" >> $SEARCHOUT
94 $LDAPSEARCH -b "ou=Add & Delete,dc=example,dc=com" -H $URI1 \
98 echo "# Add & Delete subtree contents as seen by Bjorn" >> $SEARCHOUT
99 $LDAPSEARCH -b "ou=Add & Delete,dc=example,dc=com" -H $URI1 \
106 dn: cn=group,ou=Add & Delete,dc=example,dc=co
[all...] |
| /src/external/bsd/openldap/dist/tests/scripts/ |
| test006-acls | 104 # 1) delete someone else (should fail)
105 # 2) delete self (should succeed)
115 delete: member
138 delete: member
338 delete: description
432 dn: ou=Add & Delete,dc=example,dc=com
435 ou: Add & Delete
446 dn: cn=Added by Babs (must fail),ou=Add & Delete,dc=example,dc=com
470 dn: cn=Added by Bjorn (must succeed),ou=Add & Delete,dc=example,dc=com
476 dn: cn=Added by Bjorn (will be deleted),ou=Add & Delete,dc=example,dc=co
[all...] |
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/tests/ |
| sanitizer_ring_buffer_test.cc | 33 RBlong->Delete();
42 RB->Delete();
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Support/ |
| CFGUpdate.h | 9 // This file defines a CFG Edge Update: Insert or Delete, and two Nodes as the
25 enum class UpdateKind : unsigned char { Insert, Delete };
44 OS << (getKind() == UpdateKind::Insert ? "Insert " : "Delete ");
90 NumInsertions > 0 ? UpdateKind::Insert : UpdateKind::Delete;
|
| /src/external/apache2/llvm/dist/llvm/examples/IRTransforms/ |
| SimplifyCFG.cpp | 32 // * Add fixed point iteration to delete all dead blocks
122 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ});
203 // Delete the edge between BB and RemovedSucc in the DominatorTree, iff
207 DTUpdates.push_back({DominatorTree::Delete, &BB, RemovedSucc});
250 // Delete the edge between BB and RemovedSucc in the DominatorTree, iff
254 DTUpdates.push_back({DominatorTree::Delete, &BB, RemovedSucc});
326 DTUpdates.push_back({DominatorTree::Delete, &BB, Succ});
330 DTUpdates.push_back({DominatorTree::Delete, Pred, &BB});
|
| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ASTDiff/ |
| ASTDiff.h | 29 Delete, // (Src): delete node Src.
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
| IndirectBrExpandPass.cpp | 180 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB});
222 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB});
246 Updates.push_back({DominatorTree::Delete, IBr->getParent(), SuccBB});
|
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| DomTreeUpdater.cpp | 45 if (Kind == DominatorTree::Delete && HasEdge)
107 // delete only has an UnreachableInst inside.
113 delete BB;
186 delete DelBB;
201 delete DelBB;
262 // If the first update to an edge is "Delete", it means that the edge
266 // For example, if the user submits {{Delete, A, B}, {Insert, A, B}},
269 // i.e., user cannot delete an nonexistent edge,
275 // edge, so both {Delete, A, B}, {Insert, A, B} actually happened and
277 // b. If the edge doesn't exist, we can then infer that {Delete, A, B
[all...] |
| /src/external/apache2/llvm/dist/llvm/tools/llvm-ar/ |
| llvm-ar.cpp | 97 d - delete [files] from the archive
194 Delete, ///< Delete the specified members
224 // match for extract/delete operations when there are multiple matches. This is
314 Operation = Delete;
437 if (Operation != Extract && Operation != Delete)
585 case Delete:
753 if (Operation == Delete) {
833 // instance, "llvm-ar dN 2 archive.a member.o" should delete the second
842 if (Operation == Delete)
[all...] |
| /src/share/mk/ |
| bsd.clean.mk | 7 # clean: Delete files listed in ${CLEANFILES}.
8 # cleandir: Delete files listed in ${CLEANFILES} and ${CLEANDIRFILES}.
26 # delete a directory as part of "make clean" or "make cleandir" then you
42 # files to delete. (We pass the variable name, e.g. CLEANFILES,
|
| /src/external/apache2/llvm/dist/clang/include/clang/AST/ |
| ASTMutationListener.h | 82 /// A virtual destructor's operator delete has been resolved.
84 const FunctionDecl *Delete,
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/hwasan/ |
| hwasan_thread.cpp | 102 heap_allocations_->Delete();
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| LoopFuse.cpp | 805 DominatorTree::UpdateType(DominatorTree::Delete, Pred, BB));
1388 DominatorTree::Delete, FC0.ExitingBlock, FC1.Preheader));
1393 DominatorTree::Delete, FC0.ExitBlock, FC1.Preheader));
1399 DominatorTree::Delete, FC0.ExitingBlock, FC0.ExitBlock));
1411 DominatorTree::Delete, FC1.Preheader, FC1.Header));
1458 TreeUpdates.emplace_back(DominatorTree::UpdateType(DominatorTree::Delete,
1462 TreeUpdates.emplace_back(DominatorTree::UpdateType(DominatorTree::Delete,
1504 // Delete the now empty loop L1.
1609 DominatorTree::Delete, FC1GuardBlock, FC1.Preheader));
1611 DominatorTree::Delete, FC1GuardBlock, FC1NonLoopBlock))
[all...] |
| LowerConstantIntrinsics.cpp | 85 DTU->applyUpdates({{DominatorTree::Delete, Source, Other}});
|
| JumpThreading.cpp | 525 // FIXME: THREADING will delete values that are just used to compute the
1106 Updates.push_back({DominatorTree::Delete, BB, Succ});
1186 {{DominatorTree::Delete, BB, ToRemoveSucc}});
1286 DTU->applyUpdatesPermissive({{DominatorTree::Delete, BB, RemoveSucc}});
1727 Updates.push_back({DominatorTree::Delete, BB, SuccBB});
2311 {DominatorTree::Delete, PredPredBB, PredBB}});
2428 {DominatorTree::Delete, PredBB, BB}});
2475 Updates.push_back({DominatorTree::Delete, Pred, BB});
2637 Updates.push_back({DominatorTree::Delete, PredBB, BB});
2655 Updates.push_back({DominatorTree::Delete, OldPredBB, BB})
[all...] |
| SCCP.cpp | 216 // delete their contents now. Note that we cannot actually delete the blocks,
383 Updates.push_back({DominatorTree::Delete, BB, Succ});
400 Updates.push_back({DominatorTree::Delete, BB, Succ});
653 // delete the global and any stores that remain to it.
|
| /src/external/apache2/llvm/dist/clang/lib/Frontend/ |
| MultiplexConsumer.cpp | 94 const FunctionDecl *Delete,
164 const CXXDestructorDecl *DD, const FunctionDecl *Delete, Expr *ThisArg) {
166 L->ResolvedOperatorDelete(DD, Delete, ThisArg);
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_ring_buffer.h | 33 void Delete() {
67 RingBuffer(const RingBuffer&) = delete;
155 CompactRingBuffer(const CompactRingBuffer &) = delete;
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/ |
| MatrixUtils.cpp | 52 {DominatorTree::Delete, Preheader, Tmp},
|
| BasicBlockUtils.cpp | 66 Updates->push_back({DominatorTree::Delete, BB, Succ});
132 // Delete the dead blocks.
160 // or RAUW'd undef, so use an array of WeakTrackingVH for the PHIs to delete.
246 Updates.push_back({DominatorTree::Delete, BB, SuccOfBB});
247 Updates.push_back({DominatorTree::Delete, PredBB, BB});
270 // Delete the unconditional branch from BB.
276 // Delete the unconditional branch from the predecessor.
466 // Delete the unnecessary instruction now...
483 // Replace all uses of the old instruction, and delete it.
652 Updates.push_back({DominatorTree::Delete, BB, Succ})
[all...] |
| SimplifyCFG.cpp | 498 ConstantComparesGatherer(const ConstantComparesGatherer &) = delete;
500 operator=(const ConstantComparesGatherer &) = delete;
901 {{DominatorTree::Delete, PredDef, ThisCases[0].Dest}});
933 Updates.push_back({DominatorTree::Delete, PredDef, I.first});
991 Updates.push_back({DominatorTree::Delete, TIBB, RemovedSucc});
1186 Updates.push_back({DominatorTree::Delete, Pred, PredDefault});
1323 Updates.push_back({DominatorTree::Delete, Pred, BB});
1630 Updates.push_back({DominatorTree::Delete, BIParent, Succ});
2555 // We will delete Phis while threading, so Phis should not be accounted in
2689 Updates.push_back({DominatorTree::Delete, PredBB, BB})
[all...] |
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_ring_buffer.h | 32 void Delete() {
66 RingBuffer(const RingBuffer&) = delete;
154 CompactRingBuffer(const CompactRingBuffer &) = delete;
|
| /src/sys/arch/epoc32/stand/e32boot/exe/ |
| e32boot.cpp | 225 delete cleanup;
265 input.Delete(pos, 1);
287 args->Delete(0, i + 1);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SILateBranchLowering.cpp | 96 DTUpdates.push_back({DomTreeT::Delete, &MBB, Succ});
|
