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:consumerTail
(Results
1 - 2
of
2
) sorted by relevance
/foundation/communication/dsoftbus/core/common/include/
H
A
D
softbus_queue.h
76
uint32_t
consumerTail
;
in QueueIsEmpty()
local
84
consumerTail
= queue->consumer.tail;
in QueueIsEmpty()
87
if (((producerTail -
consumerTail
) & mask) == 0) {
in QueueIsEmpty()
98
uint32_t
consumerTail
;
in QueueSingleProducerEnqueue()
local
109
consumerTail
= queue->consumer.tail;
in QueueSingleProducerEnqueue()
112
* 1. In normal cases, producerHead >
consumerTail
and producerHead <
consumerTail
+ mask
in QueueSingleProducerEnqueue()
113
* 2. If only producerHead is reversed, producerHead >
consumerTail
- 0xFFFFFFFF and
in QueueSingleProducerEnqueue()
114
* producerHead <
consumerTail
+ mask - 0xFFFFFFFF
in QueueSingleProducerEnqueue()
118
availableCount = (mask +
consumerTail
)
in QueueSingleProducerEnqueue()
147
uint32_t
consumerTail
;
QueueMultiProducerEnqueue()
local
[all...]
/foundation/communication/dsoftbus/core/common/queue/
H
A
D
softbus_queue.c
80
uint32_t
consumerTail
;
in QueueCountGet()
local
88
consumerTail
= queue->consumer.tail;
in QueueCountGet()
91
*count = ((producerTail -
consumerTail
) & mask);
in QueueCountGet()
Completed in 2 milliseconds