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:q_total
(Results
1 - 2
of
2
) sorted by relevance
/third_party/mesa3d/src/util/
H
A
D
register_allocate_internal.h
110
unsigned int
q_total
;
member
120
* Temporary version of
q_total
which we decrement as things are placed
123
unsigned int
q_total
;
member
159
* * For each BITSET_WORD, the node with the minimum
q_total
if
H
A
D
register_allocate.c
518
g->nodes[n1].
q_total
+= g->regs->classes[n1_class]->q[n2_class];
in ra_add_node_adjacency()
531
g->nodes[n1].
q_total
-= g->regs->classes[n1_class]->q[n2_class];
in ra_node_remove_adjacency()
557
node->
q_total
= 0;
in ra_realloc_interference_graph()
661
if (g->nodes[n].tmp.
q_total
< g->regs->classes[n_class]->p) {
in update_pq_info()
670
if (g->nodes[n].tmp.
q_total
< g->tmp.min_q_total[i] ||
in update_pq_info()
671
(g->nodes[n].tmp.
q_total
== g->tmp.min_q_total[i] &&
in update_pq_info()
673
g->tmp.min_q_total[i] = g->nodes[n].tmp.
q_total
;
in update_pq_info()
692
assert(g->nodes[n2].tmp.
q_total
>= g->regs->classes[n2_class]->q[n_class]);
in add_node_to_stack()
693
g->nodes[n2].tmp.
q_total
-= g->regs->classes[n2_class]->q[n_class];
in add_node_to_stack()
739
g->nodes[n].tmp.
q_total
in ra_simplify()
[all...]
Completed in 2 milliseconds