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

  /frameworks/base/core/java/android/text/
Selection.java 348 int where = findEdge(text, layout, -1);
354 int where = findEdge(text, layout, 1);
360 int where = findEdge(text, layout, -1);
366 int where = findEdge(text, layout, 1);
407 private static int findEdge(Spannable text, Layout layout, int dir) {
  /external/llvm/lib/Target/AArch64/
AArch64PBQPRegAlloc.cpp 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_deadlock_detector1.cc 137 dd.findEdge(from, to, &stk_from, &stk_to, &unique_tid);
sanitizer_deadlock_detector.h 264 bool findEdge(uptr from_node, uptr to_node, u32 *stk_from, u32 *stk_to,
  /external/llvm/include/llvm/CodeGen/PBQP/
ReductionRules.h 128 EdgeId YZEId = G.findEdge(YNId, ZNId);
Graph.h 220 assert(findEdge(E.getN1Id(), E.getN2Id()) == invalidEdgeId() &&
580 EdgeId findEdge(NodeId N1Id, NodeId N2Id) {
  /external/compiler-rt/lib/sanitizer_common/tests/
sanitizer_deadlock_detector_test.cc 469 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid));
486 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid));
489 d.findEdge(node[i], node[j], &stk_from, &stk_to, &unique_tid));
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 451 PBQPRAGraph::EdgeId EId = G.findEdge(N1Id, N2Id);

Completed in 134 milliseconds