mirror of
https://github.com/JakeHillion/drgn.git
synced 2024-12-24 10:03:05 +00:00
87b7292aa5
drgn is currently licensed as GPLv3+. Part of the long term vision for drgn is that other projects can use it as a library providing programmatic interfaces for debugger functionality. A more permissive license is better suited to this goal. We decided on LGPLv2.1+ as a good balance between software freedom and permissiveness. All contributors not employed by Meta were contacted via email and consented to the license change. The only exception was the author of commitc4fbf7e589("libdrgn: fix for compilation error"), who did not respond. That commit reverted a single line of code to one originally written by me in commit640b1c011d("libdrgn: embed DWARF index in DWARF info cache"). Signed-off-by: Omar Sandoval <osandov@osandov.com>
121 lines
4.6 KiB
Python
121 lines
4.6 KiB
Python
# Copyright (c) Meta Platforms, Inc. and affiliates.
|
|
# SPDX-License-Identifier: LGPL-2.1-or-later
|
|
import itertools
|
|
import os.path
|
|
|
|
from drgn import filename_matches
|
|
from tests import TestCase
|
|
from tests.libdrgn import PathIterator, path_ends_with
|
|
|
|
|
|
# normpath("//") returns "//". See https://bugs.python.org/issue26329.
|
|
def my_normpath(path):
|
|
path = os.path.normpath(path)
|
|
if path[:2] == "//":
|
|
return path[1:]
|
|
else:
|
|
return path
|
|
|
|
|
|
# Given a sequence of components, generate all of the possible combinations of
|
|
# joining or not joining those components with '/'.
|
|
def join_combinations(components):
|
|
if len(components) > 1:
|
|
for join in itertools.product([False, True], repeat=len(components) - 1):
|
|
combination = [components[0]]
|
|
for i in range(1, len(components)):
|
|
if join[i - 1]:
|
|
combination[-1] += "/" + components[i]
|
|
else:
|
|
combination.append(components[i])
|
|
yield combination
|
|
else:
|
|
yield components
|
|
|
|
|
|
class TestPathIterator(TestCase):
|
|
def assertComponents(self, path_components, expected, combinations=True):
|
|
if combinations:
|
|
cases = join_combinations(path_components)
|
|
else:
|
|
cases = (path_components,)
|
|
for case in cases:
|
|
with self.subTest(case=case):
|
|
self.assertEqual(list(PathIterator(*case)), expected)
|
|
|
|
def test_empty(self):
|
|
self.assertEqual(list(PathIterator()), [])
|
|
self.assertEqual(list(PathIterator("")), [])
|
|
self.assertEqual(list(PathIterator("", "")), [])
|
|
|
|
def test_simple(self):
|
|
self.assertComponents(("a",), ["a"])
|
|
self.assertComponents(("abc", "def"), ["def", "abc"])
|
|
self.assertComponents(("abc", "def", "ghi"), ["ghi", "def", "abc"])
|
|
|
|
def test_root(self):
|
|
self.assertComponents(("/",), [""])
|
|
self.assertComponents(("/", ""), [""])
|
|
self.assertComponents(("", "/"), [""])
|
|
self.assertComponents(("", "/", ""), [""])
|
|
|
|
def test_absolute(self):
|
|
self.assertComponents(("/root",), ["root", ""])
|
|
self.assertComponents(("/./usr",), ["usr", ""])
|
|
self.assertComponents(("/home", "user"), ["user", "home", ""])
|
|
self.assertComponents(("foo", "/root"), ["root", ""], combinations=False)
|
|
|
|
def test_redundant_slash(self):
|
|
self.assertComponents(("a/",), ["a"])
|
|
self.assertComponents(("a//",), ["a"])
|
|
self.assertComponents(("//",), [""])
|
|
self.assertComponents(("//a",), ["a", ""])
|
|
self.assertComponents(("///a",), ["a", ""])
|
|
|
|
def test_dot(self):
|
|
self.assertComponents(("a", "."), ["a"])
|
|
self.assertComponents((".", "a"), ["a"])
|
|
self.assertComponents((".", "a", "."), ["a"])
|
|
|
|
def test_dot_dot(self):
|
|
self.assertComponents(("a", "b", ".."), ["a"])
|
|
self.assertComponents(("a", "..", "b"), ["b"])
|
|
|
|
def test_relative_dot_dot(self):
|
|
self.assertComponents(("..", "one", "two"), ["two", "one", ".."])
|
|
self.assertComponents(("one", "..", "..", "two"), ["two", ".."])
|
|
self.assertComponents(("one", "two", "..", "..", ".."), [".."])
|
|
|
|
def test_dot_dot_above_root(self):
|
|
self.assertComponents(("/..", "one", "two"), ["two", "one", ""])
|
|
self.assertComponents(("/one", "..", "..", "two"), ["two", ""])
|
|
self.assertComponents(("/one", "two", "..", "..", ".."), [""])
|
|
|
|
def test_current_directory(self):
|
|
self.assertComponents((".",), [])
|
|
self.assertComponents(("", "."), [], combinations=False)
|
|
self.assertComponents((".", ""), [])
|
|
self.assertComponents((".", "."), [])
|
|
self.assertComponents(("foo", ".."), [])
|
|
self.assertComponents(("a", "b", "..", ".."), [])
|
|
|
|
def assertPathEndsWith(self, haystack, needle):
|
|
self.assertTrue(path_ends_with(PathIterator(*haystack), PathIterator(*needle)))
|
|
self.assertTrue(
|
|
filename_matches(os.path.join(*haystack), os.path.join(*needle))
|
|
)
|
|
|
|
def assertNotPathEndsWith(self, haystack, needle):
|
|
self.assertFalse(path_ends_with(PathIterator(*haystack), PathIterator(*needle)))
|
|
self.assertFalse(
|
|
filename_matches(os.path.join(*haystack), os.path.join(*needle))
|
|
)
|
|
|
|
def test_path_ends_with(self):
|
|
self.assertPathEndsWith(("ab/cd/ef",), ("ef",))
|
|
self.assertPathEndsWith(("ab/cd/ef",), ("cd/ef",))
|
|
self.assertNotPathEndsWith(("ab/cd/ef",), ("d/ef",))
|
|
self.assertNotPathEndsWith(("ab/cd", "/ef"), ("cd/ef",))
|
|
self.assertPathEndsWith(("/abc",), ("abc",))
|
|
self.assertNotPathEndsWith(("abc",), ("/abc",))
|