Home
last modified time | relevance | path

Searched refs:cur_path (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/lldb/examples/scripting/
H A Dtree_utils.py24 def DFS(root, word, cur_path): argument
58 return cur_path
66 cur_path = cur_path + "L"
67 return DFS(left_child_ptr, word, cur_path)
75 cur_path = cur_path + "R"
76 return DFS(right_child_ptr, word, cur_path)
/llvm-project-15.0.7/lldb/scripts/
H A Danalyze-project-deps.py105 cur_path = path_queue.pop(0)
106 if is_existing_cycle(cur_path, cycles):
110 last_component = cur_path[-1]
116 if item in cur_path:
120 new_index = cur_path.index(item)
121 cycle = cur_path[new_index:]
127 path_queue.append(cur_path + [item])
/llvm-project-15.0.7/lldb/docs/use/
H A Dpython.rst67 1: def DFS (root, word, cur_path):
79 13: return cur_path
84 18: cur_path = cur_path + "L"
85 19: return DFS (left_child_ptr, word, cur_path)
90 24: cur_path = cur_path + "R"
521 def DFS(root, word, cur_path):
555 return cur_path
563 cur_path = cur_path + "L"
564 return DFS(left_child_ptr, word, cur_path)
572 cur_path = cur_path + "R"
[all …]
/llvm-project-15.0.7/llvm/lib/Support/Windows/
H A DPath.inc201 SmallVector<wchar_t, MAX_PATH> cur_path;
205 cur_path.resize_for_overwrite(len);
206 len = ::GetCurrentDirectoryW(cur_path.size(), cur_path.data());
214 } while (len > cur_path.size());
218 cur_path.truncate(len);
221 UTF16ToUTF8(cur_path.begin(), cur_path.size(), result))