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:cur_sk
(Results
1 - 3
of
3
) sorted by relevance
/kernel/linux/linux-6.6/net/unix/
H
A
D
af_unix.c
3314
unsigned int
cur_sk
;
member
3365
while (iter->
cur_sk
< iter->end_sk)
in bpf_iter_unix_put_batch()
3366
sock_put(iter->batch[iter->
cur_sk
++]);
in bpf_iter_unix_put_batch()
3400
iter->
cur_sk
= 0;
in bpf_iter_unix_batch()
3438
/* Whenever seq_next() is called, the iter->
cur_sk
is
in bpf_iter_unix_seq_next()
3442
if (iter->
cur_sk
< iter->end_sk)
in bpf_iter_unix_seq_next()
3443
sock_put(iter->batch[iter->
cur_sk
++]);
in bpf_iter_unix_seq_next()
3447
if (iter->
cur_sk
< iter->end_sk)
in bpf_iter_unix_seq_next()
3448
sk = iter->batch[iter->
cur_sk
];
in bpf_iter_unix_seq_next()
3496
if (iter->
cur_sk
< ite
in bpf_iter_unix_seq_stop()
[all...]
/kernel/linux/linux-6.6/net/ipv4/
H
A
D
tcp_ipv4.c
2765
unsigned int
cur_sk
;
member
2792
while (iter->
cur_sk
< iter->end_sk)
in bpf_iter_tcp_put_batch()
2793
sock_gen_put(iter->batch[iter->
cur_sk
++]);
in bpf_iter_tcp_put_batch()
2896
iter->
cur_sk
= 0;
in bpf_iter_tcp_batch()
2939
/* Whenever seq_next() is called, the iter->
cur_sk
is
in bpf_iter_tcp_seq_next()
2943
if (iter->
cur_sk
< iter->end_sk) {
in bpf_iter_tcp_seq_next()
2954
sock_gen_put(iter->batch[iter->
cur_sk
++]);
in bpf_iter_tcp_seq_next()
2957
if (iter->
cur_sk
< iter->end_sk)
in bpf_iter_tcp_seq_next()
2958
sk = iter->batch[iter->
cur_sk
];
in bpf_iter_tcp_seq_next()
3024
if (iter->
cur_sk
< ite
in bpf_iter_tcp_seq_stop()
[all...]
H
A
D
udp.c
3107
unsigned int
cur_sk
;
member
3145
iter->
cur_sk
= 0;
in bpf_iter_udp_batch()
3208
/* Whenever seq_next() is called, the iter->
cur_sk
is
in bpf_iter_udp_seq_next()
3209
* done with seq_show(), so unref the iter->
cur_sk
.
in bpf_iter_udp_seq_next()
3211
if (iter->
cur_sk
< iter->end_sk) {
in bpf_iter_udp_seq_next()
3212
sock_put(iter->batch[iter->
cur_sk
++]);
in bpf_iter_udp_seq_next()
3216
/* After updating iter->
cur_sk
, check if there are more sockets
in bpf_iter_udp_seq_next()
3219
if (iter->
cur_sk
< iter->end_sk)
in bpf_iter_udp_seq_next()
3220
sk = iter->batch[iter->
cur_sk
];
in bpf_iter_udp_seq_next()
3284
while (iter->
cur_sk
< ite
in bpf_iter_udp_put_batch()
[all...]
Completed in 20 milliseconds