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:best_node
(Results
1 - 6
of
6
) sorted by relevance
/third_party/ffmpeg/libavcodec/
H
A
D
idcinvideo.c
88
int best,
best_node
;
in huff_smallest_node()
local
91
best_node
= -1;
in huff_smallest_node()
99
best_node
= i;
in huff_smallest_node()
103
if(
best_node
== -1)
in huff_smallest_node()
105
hnodes[
best_node
].used = 1;
in huff_smallest_node()
106
return
best_node
;
in huff_smallest_node()
/third_party/mesa3d/src/panfrost/util/
H
A
D
lcra.c
228
signed
best_node
= -1;
in lcra_get_best_spill_node()
local
242
best_node
= i;
in lcra_get_best_spill_node()
246
return
best_node
;
in lcra_get_best_spill_node()
/third_party/mesa3d/src/gallium/drivers/lima/ir/gp/
H
A
D
scheduler.c
1290
gpir_node *
best_node
= NULL;
in try_node()
local
1304
if (node->sched.dist <
best_node
->sched.dist)
in try_node()
1312
if (score == INT_MIN && !
best_node
&&
in try_node()
1320
best_node
= node;
in try_node()
1327
best_node
= node;
in try_node()
1332
if (
best_node
) {
in try_node()
1333
gpir_debug("scheduling %d (score = %d)%s\n",
best_node
->index,
in try_node()
1334
best_score,
best_node
->sched.max_node ? " (max)" : "");
in try_node()
1335
ASSERTED int score = schedule_try_node(ctx,
best_node
, false);
in try_node()
/third_party/mesa3d/src/panfrost/bifrost/
H
A
D
bi_ra.c
568
signed
best_node
= -1;
in bi_choose_spill_node()
local
585
best_node
= i;
in bi_choose_spill_node()
602
best_node
= i;
in bi_choose_spill_node()
608
return
best_node
;
in bi_choose_spill_node()
/third_party/mesa3d/src/util/
H
A
D
register_allocate.c
1041
unsigned int
best_node
= -1;
in ra_get_best_spill_node()
local
1064
best_node
= n;
in ra_get_best_spill_node()
1068
return
best_node
;
in ra_get_best_spill_node()
/third_party/skia/third_party/externals/libwebp/src/enc/
H
A
D
quant_enc.c
731
int
best_node
= best_path[1];
in TrellisQuantizeBlock()
local
733
NODE(n,
best_node
).prev = best_path[2]; // force best-prev for terminal
in TrellisQuantizeBlock()
736
const Node* const node = &NODE(n,
best_node
);
in TrellisQuantizeBlock()
741
best_node
= node->prev;
in TrellisQuantizeBlock()
Completed in 9 milliseconds