HomeSort by relevance Sort by last modified time
    Searched refs:NodeSymRel (Results 1 - 2 of 2) sorted by null

  /external/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp 447 typedef std::set<NodeSet> NodeSymRel;
451 const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) {
452 for (NodeSymRel::iterator I = Rel.begin(), E = Rel.end(); I != E; ++I)
528 NodeSymRel EqRel; // Equality relation (as set of equivalence classes).
550 std::pair<NodeSymRel::iterator, bool> Ins = EqRel.insert(C);
563 for (NodeSymRel::iterator I = EqRel.begin(), E = EqRel.end(); I != E; ++I) {
579 for (NodeSymRel::iterator I = EqRel.begin(), E = EqRel.end(); I != E; ++I) {
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp 467 using NodeSymRel = std::set<NodeSet>;
473 static const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) {
474 for (NodeSymRel::iterator I = Rel.begin(), E = Rel.end(); I != E; ++I)
549 NodeSymRel EqRel; // Equality relation (as set of equivalence classes).
571 std::pair<NodeSymRel::iterator, bool> Ins = EqRel.insert(C);
584 for (NodeSymRel::iterator I = EqRel.begin(), E = EqRel.end(); I != E; ++I) {
599 for (NodeSymRel::iterator I = EqRel.begin(), E = EqRel.end(); I != E; ++I) {
    [all...]

Completed in 266 milliseconds