aboutsummaryrefslogtreecommitdiff
path: root/lib/Index/IndexProvider.cpp
blob: 074a83d9a6fea6e08edae64ec6a1a92dfe2a32d6 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
//===--- IndexProvider.cpp - Map of entities to translation units ---------===//
//
//                     The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSaE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
//  Maps Entities to TranslationUnits
//
//===----------------------------------------------------------------------===//

#include "clang/Index/IndexProvider.h"
#include "clang/Index/Program.h"
#include "clang/Index/EntityHandler.h"
#include "clang/Index/TranslationUnit.h"
using namespace clang;
using namespace idx;

class IndexProvider::Indexer : public EntityHandler {
  TranslationUnit *TU;
  MapTy ⤅
  
public:
  Indexer(TranslationUnit *tu, MapTy &map) : TU(tu), Map(map) { }

  virtual void HandleEntity(Entity *Ent) {
    MapTy::iterator I = Map.find(Ent);
    if (I != Map.end()) {
      I->second.insert(TU);
      return;
    }
    
    Map[Ent].insert(TU);
  }
};

void IndexProvider::IndexAST(TranslationUnit *TU) {
  Indexer Idx(TU, Map);
  Prog.FindEntities(TU->getASTContext(), &Idx);
}

IndexProvider::translation_unit_iterator
IndexProvider::translation_units_begin(Entity *Ent) const {
  MapTy::iterator I = Map.find(Ent);
  if (I == Map.end())
    return translation_unit_iterator(0);
  
  return I->second.begin();
}

IndexProvider::translation_unit_iterator
IndexProvider::translation_units_end(Entity *Ent) const {
  MapTy::iterator I = Map.find(Ent);
  if (I == Map.end())
    return translation_unit_iterator(0);
  
  return I->second.end();
}

bool IndexProvider::translation_units_empty(Entity *Ent) const {
  MapTy::iterator I = Map.find(Ent);
  if (I == Map.end())
    return true;

  return I->second.begin() == I->second.end();
}