It mentions that rc are excluded, but this is false with the new `rc` boolean argument. Signed-off-by: Théo Lebrun <theo.lebrun@bootlin.com>
337 lines
12 KiB
Python
Executable file
337 lines
12 KiB
Python
Executable file
#!/usr/bin/env python3
|
|
|
|
# This file is part of Elixir, a source code cross-referencer.
|
|
#
|
|
# Copyright (C) 2017--2020 Mikaël Bouillot <mikael.bouillot@bootlin.com>
|
|
# and contributors
|
|
#
|
|
# Elixir is free software: you can redistribute it and/or modify
|
|
# it under the terms of the GNU Affero General Public License as published by
|
|
# the Free Software Foundation, either version 3 of the License, or
|
|
# (at your option) any later version.
|
|
#
|
|
# Elixir is distributed in the hope that it will be useful,
|
|
# but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
# GNU Affero General Public License for more details.
|
|
#
|
|
# You should have received a copy of the GNU Affero General Public License
|
|
# along with Elixir. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
from .lib import script, scriptLines, decode
|
|
from . import lib
|
|
from . import data
|
|
import os
|
|
from collections import OrderedDict
|
|
from urllib import parse
|
|
|
|
from io import BytesIO
|
|
|
|
class SymbolInstance(object):
|
|
def __init__(self, path, line, type=None):
|
|
self.path = path
|
|
self.line = line
|
|
self.type = type
|
|
|
|
def __repr__(self):
|
|
type_repr = ""
|
|
if self.type:
|
|
type_repr = f" , type: {self.type}"
|
|
|
|
return f"Symbol in path: {self.path}, line: {self.line}" + type_repr
|
|
|
|
def __str__(self):
|
|
return self.__repr__()
|
|
|
|
# Returns a Query class instance or None if project data directory does not exist
|
|
# basedir: absolute path to parent directory of all project data directories, ex. "/srv/elixir-data/"
|
|
# project: name of the project, directory in basedir, ex. "linux"
|
|
def get_query(basedir, project):
|
|
datadir = basedir + '/' + project + '/data'
|
|
repodir = basedir + '/' + project + '/repo'
|
|
|
|
if not os.path.exists(datadir) or not os.path.exists(repodir):
|
|
return None
|
|
|
|
return Query(datadir, repodir)
|
|
|
|
class Query:
|
|
def __init__(self, data_dir, repo_dir):
|
|
self.repo_dir = repo_dir
|
|
self.data_dir = data_dir
|
|
self.dts_comp_support = int(self.script('dts-comp'))
|
|
self.db = data.DB(data_dir, readonly=True, dtscomp=self.dts_comp_support)
|
|
self.file_cache = {}
|
|
|
|
def script(self, *args):
|
|
return script(*args, env=self.getEnv())
|
|
|
|
def scriptLines(self, *args):
|
|
return scriptLines(*args, env=self.getEnv())
|
|
|
|
def getEnv(self):
|
|
return {
|
|
**os.environ,
|
|
"LXR_REPO_DIR": self.repo_dir,
|
|
"LXR_DATA_DIR": self.data_dir,
|
|
}
|
|
|
|
def close(self):
|
|
self.db.close()
|
|
|
|
# Check if a dts compatible string exists
|
|
def dts_comp_exists(self, ident):
|
|
if self.dts_comp_support:
|
|
return self.db.comps.exists(ident)
|
|
else:
|
|
return False
|
|
|
|
# Returns True if file exists
|
|
def file_exists(self, version, path):
|
|
if version not in self.file_cache:
|
|
version_cache = set()
|
|
last_dir = None
|
|
for _, path in self.db.vers.get(version).iter():
|
|
dirname, filename = os.path.split(path)
|
|
if dirname != last_dir:
|
|
last_dir = dirname
|
|
version_cache.add(dirname)
|
|
version_cache.add(path)
|
|
|
|
self.file_cache[version] = version_cache
|
|
|
|
return path.strip('/') in self.file_cache[version]
|
|
|
|
# Returns the contents of the specified file
|
|
# Tokens are marked for further processing
|
|
# Example: v3.1-rc10 /Makefile
|
|
def get_tokenized_file(self, version, path):
|
|
filename = os.path.basename(path)
|
|
family = lib.getFileFamily(filename)
|
|
|
|
if family != None:
|
|
assert family in lib.CACHED_DEFINITIONS_FAMILIES, f"family {family} must have its definitions cached"
|
|
|
|
buffer = BytesIO()
|
|
tokens = self.scriptLines('tokenize-file', version, path, family)
|
|
even = True
|
|
|
|
prefix = b''
|
|
if family == 'K':
|
|
prefix = b'CONFIG_'
|
|
|
|
for tok in tokens:
|
|
even = not even
|
|
tok2 = prefix + tok
|
|
if even and self.db.defs_cache[family].exists(tok2):
|
|
tok = b'\033[31m' + tok2 + b'\033[0m'
|
|
else:
|
|
tok = lib.unescape(tok)
|
|
buffer.write(tok)
|
|
return decode(buffer.getvalue())
|
|
else:
|
|
return decode(self.script('get-file', version, path))
|
|
|
|
# Returns the contents (trees or blobs) of the specified directory
|
|
# Example: v3.1-rc10 /arch
|
|
def get_dir_contents(self, version, path):
|
|
entries_str = decode(self.script('get-dir', version, path))
|
|
return entries_str.split("\n")[:-1]
|
|
|
|
# Returns indexed versions, as a tree of OrderedDict.
|
|
# It has a depth of 3, for example: v3 v3.1 v3.1-rc10.
|
|
def get_versions(self):
|
|
versions = OrderedDict()
|
|
|
|
for line in self.scriptLines('list-tags', '-h'):
|
|
taginfo = decode(line).split(' ')
|
|
num = len(taginfo)
|
|
topmenu, submenu = 'FIXME', 'FIXME'
|
|
|
|
if num == 1:
|
|
tag, = taginfo
|
|
elif num == 2:
|
|
submenu, tag = taginfo
|
|
elif num == 3:
|
|
topmenu, submenu, tag = taginfo
|
|
else:
|
|
raise Exception("unexpected number of fields in taginfo")
|
|
|
|
if self.db.vers.exists(tag):
|
|
if topmenu not in versions:
|
|
versions[topmenu] = OrderedDict()
|
|
if submenu not in versions[topmenu]:
|
|
versions[topmenu][submenu] = []
|
|
versions[topmenu][submenu].append(tag)
|
|
|
|
return versions
|
|
|
|
# Returns the type (blob or tree) associated to
|
|
# the given path. Example:
|
|
# > ./query.py type v3.1-rc10 /Makefile
|
|
# blob
|
|
# > ./query.py type v3.1-rc10 /arch
|
|
# tree
|
|
def get_file_type(self, version, path):
|
|
return decode(self.script('get-type', version, path)).strip()
|
|
|
|
# Returns identifier search results
|
|
def search_ident(self, version, ident, family):
|
|
# DT bindings compatible strings are handled differently
|
|
if family == 'B':
|
|
return self.get_idents_comps(version, ident)
|
|
else:
|
|
return self.get_idents_defs(version, ident, family)
|
|
|
|
# Returns the latest tag that is included in the database.
|
|
# This excludes release candidates if `rc` is False.
|
|
def get_latest_tag(self, rc):
|
|
if rc:
|
|
sorted_tags = reversed(self.scriptLines('list-tags'))
|
|
else:
|
|
sorted_tags = self.scriptLines('get-latest-tags')
|
|
|
|
for tag in sorted_tags:
|
|
if self.db.vers.exists(tag):
|
|
return tag.decode()
|
|
|
|
# return the oldest tag, even if it does not exist in the database
|
|
return sorted_tags[-1].decode()
|
|
|
|
def get_file_raw(self, version, path):
|
|
return decode(self.script('get-file', version, path))
|
|
|
|
def get_idents_comps(self, version, ident):
|
|
|
|
# DT bindings compatible strings are handled differently
|
|
# They are defined in C files
|
|
# Used in DT files
|
|
# Documented in documentation files
|
|
symbol_c = []
|
|
symbol_dts = []
|
|
symbol_docs = []
|
|
|
|
# DT compatible strings are quoted in the database
|
|
ident = parse.quote(ident)
|
|
|
|
if not self.dts_comp_support or not self.db.comps.exists(ident):
|
|
return symbol_c, symbol_dts, symbol_docs, False
|
|
|
|
files_this_version = self.db.vers.get(version).iter()
|
|
comps = self.db.comps.get(ident).iter(dummy=True)
|
|
|
|
if self.db.comps_docs.exists(ident):
|
|
comps_docs = self.db.comps_docs.get(ident).iter(dummy=True)
|
|
else:
|
|
comps_docs = data.RefList().iter(dummy=True)
|
|
|
|
comps_idx, comps_lines, comps_family = next(comps)
|
|
comps_docs_idx, comps_docs_lines, comps_docs_family = next(comps_docs)
|
|
compsCBuf = [] # C/CPP/ASM files
|
|
compsDBuf = [] # DT files
|
|
compsBBuf = [] # DT bindings docs files
|
|
|
|
for file_idx, file_path in files_this_version:
|
|
while comps_idx < file_idx:
|
|
comps_idx, comps_lines, comps_family = next(comps)
|
|
|
|
while comps_docs_idx < file_idx:
|
|
comps_docs_idx, comps_docs_lines, comps_docs_family = next(comps_docs)
|
|
|
|
if comps_idx == file_idx:
|
|
if comps_family == 'C':
|
|
compsCBuf.append((file_path, comps_lines))
|
|
elif comps_family == 'D':
|
|
compsDBuf.append((file_path, comps_lines))
|
|
|
|
if comps_docs_idx == file_idx:
|
|
compsBBuf.append((file_path, comps_docs_lines))
|
|
|
|
for path, cline in sorted(compsCBuf):
|
|
symbol_c.append(SymbolInstance(path, cline, 'compatible'))
|
|
|
|
for path, dlines in sorted(compsDBuf):
|
|
symbol_dts.append(SymbolInstance(path, dlines))
|
|
|
|
for path, blines in sorted(compsBBuf):
|
|
symbol_docs.append(SymbolInstance(path, blines))
|
|
|
|
return symbol_c, symbol_dts, symbol_docs, True
|
|
|
|
def get_idents_defs(self, version, ident, family):
|
|
|
|
symbol_definitions = []
|
|
symbol_references = []
|
|
symbol_doccomments = []
|
|
|
|
if not self.db.defs.exists(ident):
|
|
return symbol_definitions, symbol_references, symbol_doccomments, False
|
|
|
|
if not self.db.vers.exists(version):
|
|
return symbol_definitions, symbol_references, symbol_doccomments, True
|
|
|
|
files_this_version = self.db.vers.get(version).iter()
|
|
this_ident = self.db.defs.get(ident)
|
|
defs_this_ident = this_ident.iter(dummy=True)
|
|
macros_this_ident = this_ident.get_macros()
|
|
# FIXME: see why we can have a discrepancy between defs_this_ident and refs
|
|
if self.db.refs.exists(ident):
|
|
refs = self.db.refs.get(ident).iter(dummy=True)
|
|
else:
|
|
refs = data.RefList().iter(dummy=True)
|
|
|
|
if self.db.docs.exists(ident):
|
|
docs = self.db.docs.get(ident).iter(dummy=True)
|
|
else:
|
|
docs = data.RefList().iter(dummy=True)
|
|
|
|
# vers, defs, refs, and docs are all populated by update.py in order of
|
|
# idx, and there is a one-to-one mapping between blob hashes and idx
|
|
# values. Therefore, we can sequentially step through the defs, refs,
|
|
# and docs for each file in a version.
|
|
|
|
def_idx, def_type, def_line, def_family = next(defs_this_ident)
|
|
ref_idx, ref_lines, ref_family = next(refs)
|
|
doc_idx, doc_line, doc_family = next(docs)
|
|
|
|
dBuf = []
|
|
rBuf = []
|
|
docBuf = []
|
|
|
|
for file_idx, file_path in files_this_version:
|
|
# Advance defs, refs, and docs to the current file
|
|
while def_idx < file_idx:
|
|
def_idx, def_type, def_line, def_family = next(defs_this_ident)
|
|
while ref_idx < file_idx:
|
|
ref_idx, ref_lines, ref_family = next(refs)
|
|
while doc_idx < file_idx:
|
|
doc_idx, doc_line, doc_family = next(docs)
|
|
|
|
# Copy information about this identifier into dBuf, rBuf, and docBuf.
|
|
while def_idx == file_idx:
|
|
if (def_family == family or family == 'A'
|
|
or lib.compatibleMacro(macros_this_ident, family)):
|
|
dBuf.append((file_path, def_type, def_line))
|
|
def_idx, def_type, def_line, def_family = next(defs_this_ident)
|
|
|
|
if ref_idx == file_idx:
|
|
if lib.compatibleFamily(family, ref_family) or family == 'A':
|
|
rBuf.append((file_path, ref_lines))
|
|
|
|
if doc_idx == file_idx: # TODO should this be a `while`?
|
|
docBuf.append((file_path, doc_line))
|
|
|
|
# Sort dBuf by path name before sorting by type in the loop
|
|
dBuf.sort()
|
|
|
|
for path, type, dline in sorted(dBuf, key=lambda d: d[1], reverse=True):
|
|
symbol_definitions.append(SymbolInstance(path, dline, type))
|
|
|
|
for path, rlines in sorted(rBuf):
|
|
symbol_references.append(SymbolInstance(path, rlines))
|
|
|
|
for path, docline in sorted(docBuf):
|
|
symbol_doccomments.append(SymbolInstance(path, docline))
|
|
|
|
return symbol_definitions, symbol_references, symbol_doccomments, True
|
|
|