HomeSort by relevance Sort by last modified time
    Searched defs:GetOrInsertNode (Results 1 - 14 of 14) sorted by null

  /external/llvm/lib/Support/
FoldingSet.cpp 412 /// GetOrInsertNode - If there is an existing simple Node exactly
415 FoldingSetImpl::Node *FoldingSetImpl::GetOrInsertNode(FoldingSetImpl::Node *N) {
  /external/swiftshader/third_party/LLVM/lib/Support/
FoldingSet.cpp 374 /// GetOrInsertNode - If there is an existing simple Node exactly
377 FoldingSetImpl::Node *FoldingSetImpl::GetOrInsertNode(FoldingSetImpl::Node *N) {
  /external/swiftshader/third_party/llvm-subzero/lib/Support/
FoldingSet.cpp 412 /// GetOrInsertNode - If there is an existing simple Node exactly
415 FoldingSetImpl::Node *FoldingSetImpl::GetOrInsertNode(FoldingSetImpl::Node *N) {
  /external/llvm/include/llvm/ADT/
FoldingSet.h 67 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
154 /// GetOrInsertNode - If there is an existing simple Node exactly
157 Node *GetOrInsertNode(Node *N);
172 Node *Inserted = GetOrInsertNode(N);
463 /// GetOrInsertNode - If there is an existing simple Node exactly
466 T *GetOrInsertNode(Node *N) {
467 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
541 /// GetOrInsertNode - If there is an existing simple Node exactly
544 T *GetOrInsertNode(Node *N) {
545 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/ADT/
FoldingSet.h 71 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
154 /// GetOrInsertNode - If there is an existing simple Node exactly
157 Node *GetOrInsertNode(Node *N);
172 Node *Inserted = GetOrInsertNode(N);
426 /// GetOrInsertNode - If there is an existing simple Node exactly
429 T *GetOrInsertNode(Node *N) {
430 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
505 /// GetOrInsertNode - If there is an existing simple Node exactly
508 T *GetOrInsertNode(Node *N) {
509 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/
FoldingSet.h 72 /// MyNode *M = MyFoldingSet.GetOrInsertNode(N);
159 /// GetOrInsertNode - If there is an existing simple Node exactly
162 Node *GetOrInsertNode(Node *N);
177 Node *Inserted = GetOrInsertNode(N);
471 /// GetOrInsertNode - If there is an existing simple Node exactly
474 T *GetOrInsertNode(Node *N) {
475 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N));
551 /// GetOrInsertNode - If there is an existing simple Node exactly
554 T *GetOrInsertNode(Node *N) {
555 return static_cast<T *>(FoldingSetImpl::GetOrInsertNode(N))
    [all...]

Completed in 696 milliseconds