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

  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 166 NodeId getN1Id() const { return NIds[0]; }
219 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
553 return getEdge(EId).getN1Id();
569 if (E.getN1Id() == NId) {
572 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 151 NodeId getN1Id() const { return NIds[0]; }
204 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
534 return getEdge(EId).getN1Id();
550 if (E.getN1Id() == NId) {
553 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/CodeGen/PBQP/
Graph.h 151 NodeId getN1Id() const { return NIds[0]; }
204 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
534 return getEdge(EId).getN1Id();
550 if (E.getN1Id() == NId) {
553 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/CodeGen/PBQP/
Graph.h 150 NodeId getN1Id() const { return NIds[0]; }
207 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
547 return getEdge(EId).getN1Id();
563 if (E.getN1Id() == NId) {
566 return E.getN1Id();

Completed in 663 milliseconds