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:reg_classes
(Results
1 - 18
of
18
) sorted by relevance
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/src/p2p/
H
A
D
p2p_utils.c
122
for (i = 0; i < a->
reg_classes
; i++) {
in p2p_channels_intersect()
124
for (j = 0; j < b->
reg_classes
; j++) {
in p2p_channels_intersect()
130
&res->reg_class[res->
reg_classes
]);
in p2p_channels_intersect()
131
if (res->reg_class[res->
reg_classes
].channels) {
in p2p_channels_intersect()
132
res->
reg_classes
++;
in p2p_channels_intersect()
133
if (res->
reg_classes
== P2P_MAX_REG_CLASSES)
in p2p_channels_intersect()
170
for (i = 0; i < res->
reg_classes
; i++) {
in p2p_channels_union_inplace()
172
for (j = 0; j < b->
reg_classes
; j++) {
in p2p_channels_union_inplace()
180
for (j = 0; j < b->
reg_classes
; j++) {
in p2p_channels_union_inplace()
183
for (i = 0; i < res->
reg_classes
;
in p2p_channels_union_inplace()
[all...]
H
A
D
p2p_go_neg.c
72
struct p2p_reg_class *cl = &ch->reg_class[ch->
reg_classes
];
in p2p_peer_channels_check()
83
ch->
reg_classes
++;
in p2p_peer_channels_check()
84
if (ch->
reg_classes
== P2P_MAX_REG_CLASSES)
in p2p_peer_channels_check()
89
p2p_dbg(p2p, "Own
reg_classes
%d peer
reg_classes
%d intersection
reg_classes
%d",
in p2p_peer_channels_check()
90
(int) own->
reg_classes
,
in p2p_peer_channels_check()
91
(int) dev->channels.
reg_classes
,
in p2p_peer_channels_check()
92
(int) intersection.
reg_classes
);
in p2p_peer_channels_check()
93
if (intersection.
reg_classes
in p2p_peer_channels_check()
[all...]
H
A
D
p2p_pd.c
797
if (dev->channels.
reg_classes
== 0 ||
in p2p_process_prov_disc_req()
809
ch->
reg_classes
= 1;
in p2p_process_prov_disc_req()
815
if (intersect.
reg_classes
== 0) {
in p2p_process_prov_disc_req()
H
A
D
p2p.h
66
*
reg_classes
- Number of reg_class entries in use
68
size_t
reg_classes
;
member
H
A
D
p2p_build.c
162
for (i = 0; i < chan->
reg_classes
; i++) {
in p2p_buf_add_channel_list()
H
A
D
p2p_invitation.c
286
if (intersection.
reg_classes
== 0) {
in p2p_process_invitation_req()
H
A
D
p2p_group.c
1162
if (!dev || dev->channels.
reg_classes
== 0)
in p2p_group_get_common_freqs()
H
A
D
p2p.c
1035
for (cl = 0; cl < c->
reg_classes
; cl++) {
1058
if (cl == c->
reg_classes
)
1500
p2p->channels.
reg_classes
= 1;
/third_party/wpa_supplicant/wpa_supplicant-2.9/src/p2p/
H
A
D
p2p_utils.c
119
for (i = 0; i < a->
reg_classes
; i++) {
in p2p_channels_intersect()
121
for (j = 0; j < b->
reg_classes
; j++) {
in p2p_channels_intersect()
127
&res->reg_class[res->
reg_classes
]);
in p2p_channels_intersect()
128
if (res->reg_class[res->
reg_classes
].channels) {
in p2p_channels_intersect()
129
res->
reg_classes
++;
in p2p_channels_intersect()
130
if (res->
reg_classes
== P2P_MAX_REG_CLASSES)
in p2p_channels_intersect()
167
for (i = 0; i < res->
reg_classes
; i++) {
in p2p_channels_union_inplace()
169
for (j = 0; j < b->
reg_classes
; j++) {
in p2p_channels_union_inplace()
177
for (j = 0; j < b->
reg_classes
; j++) {
in p2p_channels_union_inplace()
180
for (i = 0; i < res->
reg_classes
;
in p2p_channels_union_inplace()
[all...]
H
A
D
p2p_go_neg.c
62
struct p2p_reg_class *cl = &ch->reg_class[ch->
reg_classes
];
in p2p_peer_channels_check()
73
ch->
reg_classes
++;
in p2p_peer_channels_check()
74
if (ch->
reg_classes
== P2P_MAX_REG_CLASSES)
in p2p_peer_channels_check()
79
p2p_dbg(p2p, "Own
reg_classes
%d peer
reg_classes
%d intersection
reg_classes
%d",
in p2p_peer_channels_check()
80
(int) own->
reg_classes
,
in p2p_peer_channels_check()
81
(int) dev->channels.
reg_classes
,
in p2p_peer_channels_check()
82
(int) intersection.
reg_classes
);
in p2p_peer_channels_check()
83
if (intersection.
reg_classes
in p2p_peer_channels_check()
[all...]
H
A
D
p2p_pd.c
797
if (dev->channels.
reg_classes
== 0 ||
in p2p_process_prov_disc_req()
809
ch->
reg_classes
= 1;
in p2p_process_prov_disc_req()
815
if (intersect.
reg_classes
== 0) {
in p2p_process_prov_disc_req()
H
A
D
p2p.h
66
*
reg_classes
- Number of reg_class entries in use
68
size_t
reg_classes
;
member
H
A
D
p2p_build.c
162
for (i = 0; i < chan->
reg_classes
; i++) {
in p2p_buf_add_channel_list()
H
A
D
p2p_group.c
1118
if (!dev || dev->channels.
reg_classes
== 0)
in p2p_group_get_common_freqs()
H
A
D
p2p_invitation.c
268
if (intersection.
reg_classes
== 0) {
in p2p_process_invitation_req()
H
A
D
p2p.c
959
for (cl = 0; cl < c->
reg_classes
; cl++) {
in p2p_get_next_prog_freq()
982
if (cl == c->
reg_classes
)
in p2p_get_next_prog_freq()
1390
p2p->channels.
reg_classes
= 1;
in p2p_prepare_channel_pref()
/third_party/wpa_supplicant/wpa_supplicant-2.9/wpa_supplicant/
H
A
D
p2p_supplicant.c
3408
chan->
reg_classes
= cla;
in wpas_p2p_default_channels()
3667
chan->
reg_classes
= cla;
in wpas_p2p_setup_channels()
3668
cli_chan->
reg_classes
= cli_cla;
in wpas_p2p_setup_channels()
/third_party/wpa_supplicant/wpa_supplicant-2.9_standard/wpa_supplicant/
H
A
D
p2p_supplicant.c
4207
chan->
reg_classes
= cla;
in wpas_p2p_default_channels()
4604
chan->
reg_classes
= cla;
4605
cli_chan->
reg_classes
= cli_cla;
Completed in 60 milliseconds