ESP-IDF
MIN_ADV_LENGTH
is only used within ESP-IDF.
Symbol previews are coming soon...
Symbols
loading...
Files
loading...
Summary
Syntax
Examples
References
Call Tree
Data Use
Class Tree
Override Tree
Implementations
Instances
Lifecycle
SourceVu
ESP-IDF Framework and Examples
ESP-IDF
MIN_ADV_LENGTH
MIN_ADV_LENGTH macro
Syntax
Show:
Summary
Declaration
from
btm_ble_gap.c:57
#define
MIN_ADV_LENGTH
2
Examples
References
from
examples
Code
Location
#define
MIN_ADV_LENGTH
2
btm_ble_gap.c:57
*
p
++
=
MIN_ADV_LENGTH
;
btm_ble_gap.c:2234
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_DEV_NAME
)
{
btm_ble_gap.c:2258
if
(
strlen
(
btm_cb
.
cfg
.
ble_bd_name
)
>
(
UINT16
)
(
len
-
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2259
cp_len
=
(
UINT16
)
(
len
-
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2260
len
-=
(
cp_len
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2270
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_MANU
&&
btm_ble_gap.c:2275
if
(
p_data
->
p_manu
->
len
>
(
len
-
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2278
cp_len
=
len
-
MIN_ADV_LENGTH
;
btm_ble_gap.c:2279
len
-=
(
cp_len
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2291
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_TX_PWR
)
{
btm_ble_gap.c:2295
*
p
++
=
MIN_ADV_LENGTH
;
btm_ble_gap.c:2296
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_SERVICE
&&
btm_ble_gap.c:2306
if
(
p_data
->
p_services
->
num_service
*
LEN_UUID_16
>
(
len
-
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2310
cp_len
=
(
len
-
MIN_ADV_LENGTH
)
/
LEN_UUID_16
;
btm_ble_gap.c:2311
len
-=
(
cp_len
*
MIN_ADV_LENGTH
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2323
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_SERVICE_32
&&
btm_ble_gap.c:2327
if
(
(
p_data
->
p_service_32b
->
num_service
*
LEN_UUID_32
)
>
(
len
-
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2331
cp_len
=
(
len
-
MIN_ADV_LENGTH
)
/
LEN_UUID_32
;
btm_ble_gap.c:2332
len
-=
(
cp_len
*
LEN_UUID_32
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2344
len
-=
(
MAX_UUID_SIZE
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2359
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_SERVICE_32SOL
&&
btm_ble_gap.c:2363
if
(
(
p_data
->
p_sol_service_32b
->
num_service
*
LEN_UUID_32
)
>
(
len
-
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2367
cp_len
=
(
len
-
MIN_ADV_LENGTH
)
/
LEN_UUID_32
;
btm_ble_gap.c:2368
len
-=
(
cp_len
*
LEN_UUID_32
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2380
if
(
len
>=
(
MAX_UUID_SIZE
+
MIN_ADV_LENGTH
)
&&
data_mask
&
BTM_BLE_AD_BIT_SERVICE_128SOL
&&
btm_ble_gap.c:2384
len
-=
(
MAX_UUID_SIZE
+
MIN_ADV_LENGTH
)
;
btm_ble_gap.c:2389
if
(
len
>
MIN_ADV_LENGTH
&&
data_mask
&
BTM_BLE_AD_BIT_SERVICE_DATA
&&
btm_ble_gap.c:2393
if
(
len
>
(
p_data
->
p_service_data
->
service_uuid
.
len
+
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2395
if
(
p_data
->
p_service_data
->
len
>
(
len
-
MIN_ADV_LENGTH
)
)
{
btm_ble_gap.c:2396
cp_len
=
len
-
MIN_ADV_LENGTH
-
p_data
->
p_service_data
->
service_uuid
.
len
;
btm_ble_gap.c:2397
len
-=
(
cp_len
+
MIN_ADV_LENGTH
+
p_data
->
p_service_data
->
service_uuid
.
len
)
;
btm_ble_gap.c:2417
if
(
len
>=
(
MIN_ADV_LENGTH
+
p_elem
->
len
)
)
/* len byte(1) + ATTR type(1) + Uuid len(2)
btm_ble_gap.c:2437
len
-=
(
MIN_ADV_LENGTH
+
p_elem
->
len
)
;
btm_ble_gap.c:2444
Call Tree
from
examples
All items filtered out
All items filtered out
Data Use
from
examples
All items filtered out
All items filtered out
Class Tree
from
examples
All items filtered out
All items filtered out
Override Tree
from
examples
All items filtered out
All items filtered out
Implementations
from
examples
All items filtered out
All items filtered out
Instances
from
examples
Lifecycle
from
examples
All items filtered out
All items filtered out