Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched full:tombstone (Results 26 - 50 of 220) sorted by null

12 3 4 5 6 7 8 9

/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/
CachedHashString.h	16 // tombstone values). 59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); 164 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); 176 // This is safe because if RHS.P is the empty or tombstone key, it will have
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/ADT/
CachedHashString.h	16 // tombstone values). 59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); 164 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); 176 // This is safe because if RHS.P is the empty or tombstone key, it will have
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/ADT/
CachedHashString.h	16 // tombstone values). 59 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); 164 assert(!isEqual(S, getTombstoneKey()) && "Cannot hash the tombstone key!"); 176 // This is safe because if RHS.P is the empty or tombstone key, it will have
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/system/sepolicy/prebuilts/api/26.0/public/
crash_dump.te	49 # Append to tombstone files.
/system/sepolicy/prebuilts/api/27.0/public/
crash_dump.te	52 # Append to tombstone files.
/external/swiftshader/third_party/LLVM/include/llvm/ADT/
DenseMap.h	301 // If we are writing over a tombstone, remember this. 322 /// true, otherwise it returns a bucket with an empty marker or tombstone and 334 // FoundTombstone - Keep track of whether we find a tombstone while probing. 340 "Empty/Tombstone value shouldn't be inserted into map!"); 353 // If we've already seen a tombstone while probing, fill it in instead 360 // If this is a tombstone, remember it. If Val ends up not in the map, we 363 FoundTombstone = ThisBucket; // Remember the first tombstone found. 365 // Otherwise, it's a hash collision or a tombstone, continue quadratic 535 const KeyT Tombstone = KeyInfoT::getTombstoneKey(); 539 KeyInfoT::isEqual(Ptr->first, Tombstone)))     [all...]
/system/sepolicy/prebuilts/api/28.0/public/
crash_dump.te	54 # Append to tombstone files.
/system/sepolicy/public/
crash_dump.te	54 # Append to tombstone files.
/system/core/debuggerd/tombstoned/
tombstoned.cpp	123 PLOG(FATAL) << "failed to create temporary tombstone in " << dir_path_; 361 PLOG(ERROR) << "failed to unlink tombstone at " << tombstone_path; 367 PLOG(ERROR) << "failed to link tombstone"; 373 // tombstone associated with a given native crash was written. Any changes 375 LOG(ERROR) << "Tombstone written to: " << tombstone_path; 383 PLOG(ERROR) << "failed to unlink temporary tombstone at " << crash->crash_tombstone_path;
/external/llvm/include/llvm/ADT/
SparseMultiSet.h	103 /// Whether this node is a tombstone node, and thus is in our freelist. 108 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 121 /// We have a built-in recycler for reusing tombstone slots. This recycler 122 /// puts a singly-linked free list into tombstone slots, allowing us quick 166 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 174 /// Make the current index a new tombstone. Pushes it onto the freelist. 464 "erasing invalid/end/tombstone iterator"); 470 // Put in a tombstone.
DenseMap.h	500 // If we are writing over a tombstone, remember this. 510 /// true, otherwise it returns a bucket with an empty marker or tombstone and 523 // FoundTombstone - Keep track of whether we find a tombstone while probing. 529 "Empty/Tombstone value shouldn't be inserted into map!"); 544 // If we've already seen a tombstone while probing, fill it in instead 550 // If this is a tombstone, remember it. If Val ends up not in the map, we 554 FoundTombstone = ThisBucket; // Remember the first tombstone found. 556 // Otherwise, it's a hash collision or a tombstone, continue quadratic     [all...]
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 468 "erasing invalid/end/tombstone iterator"); 474 // Put in a tombstone.
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 468 "erasing invalid/end/tombstone iterator"); 474 // Put in a tombstone.
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/
SparseMultiSet.h	111 /// Whether this node is a tombstone node, and thus is in our freelist. 116 /// Since the list is circular in Prev, all non-tombstone nodes have a valid 129 /// We have a built-in recycler for reusing tombstone slots. This recycler 130 /// puts a singly-linked free list into tombstone slots, allowing us quick 169 assert(Dense[Idx].isTombstone() && "Non-tombstone free?"); 177 /// Make the current index a new tombstone. Pushes it onto the freelist. 469 "erasing invalid/end/tombstone iterator"); 475 // Put in a tombstone.

Completed in 2719 milliseconds

12 3 4 5 6 7 8 9