Home
Sort by
last modified time
|
relevance
|
path
Repository(s)
applications
arkcompiler
base
build
commonlibrary
developtools
device
docs
domains
drivers
foundation
ide
interface
kernel
napi_generator
productdefine
test
third_party
vendor
select all
invert selection
clear
Full Search
Search through all text tokens(words,strings,identifiers,numbers) in index.
Definition
Only finds symbol definitions(where e.g a variable(function,...) is defined).
Symbol
Only finds symbol(e.g. methods classes,function,variables).
File Path
Path of the source file(use "/").If you want just exact path,enclose it in "".Source files end with: .jar/.bz2/.a/.h/.java...
History
History log comments.
Type
Any
Bzip(2)
C
Clojure
C#
C++
ELF
Erlang
Image file
Fortran
Golang
GZIP
Haskell
Jar
Java
Java class
JavaScript
Lisp
Lua
Pascal
Perl
PHP
Plain Text
PL/SQL
Python
Rust
Scala
Shell script
SQL
Tar
Tcl
Troff
UUEncoded
Visual Basic
XML
Zip
Type of analyzer used to filter file types include with selected(e.g. just C sources).
Help
Searched
refs:root_idx
(Results
1 - 2
of
2
) sorted by relevance
/third_party/skia/third_party/externals/harfbuzz/src/
H
A
D
hb-repacker.hh
187
return vertices_[
root_idx
()];
in root()
190
unsigned
root_idx
() const
in root_idx()
function
251
queue.push (
root_idx
());
in sort_kahn()
306
queue.insert (root ().modified_distance (0),
root_idx
());
in sort_shortest_distance()
307
int new_id =
root_idx
();
in sort_shortest_distance()
346
unsigned root_index =
root_idx
();
in assign_32bit_spaces()
406
// incoming edges to
root_idx
should be all 32 bit in length so we don't need to de-dup these
in isolate_subgraph()
407
// set the subgraph incoming edge count to match all of
root_idx
's incoming edges
in isolate_subgraph()
409
for (unsigned
root_idx
: roots)
in isolate_subgraph()
411
subgraph.set (
root_idx
, wide_parent
in isolate_subgraph()
[all...]
/third_party/mesa3d/src/util/
H
A
D
sparse_array.c
150
uint64_t
root_idx
= idx >> (root_level * node_size_log2);
in util_sparse_array_get()
local
151
if (likely(
root_idx
< (1ull << node_size_log2)))
in util_sparse_array_get()
Completed in 2 milliseconds