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:total_count_
(Results
1 - 16
of
16
) sorted by relevance
/third_party/node/deps/brotli/c/enc/
H
A
D
histogram_inc.h
14
size_t
total_count_
;
in FN()
local
20
self->
total_count_
= 0;
32
++self->
total_count_
;
37
self->
total_count_
+= n;
45
self->
total_count_
+= v->
total_count_
;
H
A
D
entropy_encode.c
50
if (v0->
total_count_
!= v1->
total_count_
) {
in SortHuffmanTree()
51
return TO_BROTLI_BOOL(v0->
total_count_
< v1->
total_count_
);
in SortHuffmanTree()
117
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliCreateHuffmanTree()
124
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliCreateHuffmanTree()
135
tree[j_end].
total_count_
=
in BrotliCreateHuffmanTree()
136
tree[left].
total_count_
in BrotliCreateHuffmanTree()
[all...]
H
A
D
bit_cost_inc.h
22
if (histogram->
total_count_
== 0) {
in BrotliPopulationCost()
36
return (kTwoSymbolHistogramCost + (double)histogram->
total_count_
);
in BrotliPopulationCost()
75
const double log2total = FastLog2(histogram->
total_count_
);
in BrotliPopulationCost()
H
A
D
entropy_encode.h
21
uint32_t
total_count_
;
member
28
self->
total_count_
= count;
in InitHuffmanTree()
H
A
D
brotli_bit_stream.c
400
return TO_BROTLI_BOOL(v0->
total_count_
< v1->
total_count_
);
in SortHuffmanTree()
474
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliBuildAndStoreHuffmanTreeFast()
481
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliBuildAndStoreHuffmanTreeFast()
489
node[-1].
total_count_
=
in BrotliBuildAndStoreHuffmanTreeFast()
490
tree[left].
total_count_
+ tree[right].
total_count_
;
in BrotliBuildAndStoreHuffmanTreeFast()
1247
lit_histo.
total_count_
,
in BrotliStoreMetaBlockFast()
[all...]
H
A
D
cluster_inc.h
36
if (out[idx1].
total_count_
== 0) {
39
} else if (out[idx2].
total_count_
== 0) {
159
if (histogram->
total_count_
== 0) {
H
A
D
block_splitter_inc.h
88
insert_cost[i] = FastLog2((uint32_t)histograms[i].
total_count_
);
in FindBlocks()
/third_party/skia/third_party/externals/brotli/c/enc/
H
A
D
histogram_inc.h
14
size_t
total_count_
;
in FN()
local
20
self->
total_count_
= 0;
32
++self->
total_count_
;
37
self->
total_count_
+= n;
45
self->
total_count_
+= v->
total_count_
;
H
A
D
entropy_encode.c
50
if (v0->
total_count_
!= v1->
total_count_
) {
in SortHuffmanTree()
51
return TO_BROTLI_BOOL(v0->
total_count_
< v1->
total_count_
);
in SortHuffmanTree()
117
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliCreateHuffmanTree()
124
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliCreateHuffmanTree()
135
tree[j_end].
total_count_
=
in BrotliCreateHuffmanTree()
136
tree[left].
total_count_
in BrotliCreateHuffmanTree()
[all...]
H
A
D
bit_cost_inc.h
22
if (histogram->
total_count_
== 0) {
in BrotliPopulationCost()
36
return (kTwoSymbolHistogramCost + (double)histogram->
total_count_
);
in BrotliPopulationCost()
75
const double log2total = FastLog2(histogram->
total_count_
);
in BrotliPopulationCost()
H
A
D
entropy_encode.h
21
uint32_t
total_count_
;
member
28
self->
total_count_
= count;
in InitHuffmanTree()
H
A
D
brotli_bit_stream.c
400
return TO_BROTLI_BOOL(v0->
total_count_
< v1->
total_count_
);
in SortHuffmanTree()
474
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliBuildAndStoreHuffmanTreeFast()
481
if (tree[i].
total_count_
<= tree[j].
total_count_
) {
in BrotliBuildAndStoreHuffmanTreeFast()
489
node[-1].
total_count_
=
in BrotliBuildAndStoreHuffmanTreeFast()
490
tree[left].
total_count_
+ tree[right].
total_count_
;
in BrotliBuildAndStoreHuffmanTreeFast()
1247
lit_histo.
total_count_
,
in BrotliStoreMetaBlockFast()
[all...]
H
A
D
cluster_inc.h
36
if (out[idx1].
total_count_
== 0) {
39
} else if (out[idx2].
total_count_
== 0) {
159
if (histogram->
total_count_
== 0) {
H
A
D
block_splitter_inc.h
88
insert_cost[i] = FastLog2((uint32_t)histograms[i].
total_count_
);
in FindBlocks()
/third_party/skia/third_party/externals/libwebp/src/utils/
H
A
D
huffman_encode_utils.c
125
if (t1->
total_count_
> t2->
total_count_
) {
in CompareHuffmanTrees()
127
} else if (t1->
total_count_
< t2->
total_count_
) {
in CompareHuffmanTrees()
201
tree[idx].
total_count_
= count;
in GenerateOptimalTree()
218
count = tree_pool[tree_pool_size - 1].
total_count_
+
in GenerateOptimalTree()
219
tree_pool[tree_pool_size - 2].
total_count_
;
in GenerateOptimalTree()
225
if (tree[k].
total_count_
<= count) {
in GenerateOptimalTree()
230
tree[k].
total_count_
= count;
in GenerateOptimalTree()
H
A
D
huffman_encode_utils.h
38
uint32_t
total_count_
; // Symbol frequency.
member
Completed in 12 milliseconds