/Zephyr-latest/subsys/demand_paging/eviction/ |
D | Kconfig | 13 bool "Custom eviction algorithm" 16 This option is chosen when the eviction algorithm will be implemented 20 bool "Not Recently Used (NRU) page eviction algorithm" 22 This implements a Not Recently Used page eviction algorithm. 24 When a page frame needs to be evicted, the algorithm will prefer to 33 bool "Least Recently Used (LRU) page eviction algorithm" 36 This implements a Least Recently Used page eviction algorithm. 40 algorithm: all operations are O(1), the accessed flag is cleared on
|
D | nru.c | 6 * Not Recently Used (NRU) eviction algorithm for demand paging 117 * implement eviction tracking can still use this algorithm for
|
/Zephyr-latest/doc/kernel/memory_management/ |
D | demand_paging.rst | 17 the eviction algorithm is invoked to select a data page to be paged out, 37 the eviction algorithm. 107 * Execution time histogram of eviction algorithm via 116 Eviction Algorithm 119 The eviction algorithm is used to determine which data page and its 125 the eviction algorithm. This is called at ``POST_KERNEL``. 145 :c:func:`k_mem_paging_eviction_accessed()`. This is used by the LRU algorithm 150 * An NRU (Not-Recently-Used) eviction algorithm has been implemented as a 151 sample. This is a very simple algorithm which ranks data pages on whether 154 * An LRU (Least-Recently-Used) eviction algorithm is also available. It is [all …]
|
/Zephyr-latest/subsys/net/lib/ptp/ |
D | btca.h | 9 * @brief Interface for Best TimeTransmitter Clock Algorithm. 35 * @brief Function performing Best TimeTransmitter Clock state decision algorithm. 39 * @return Proposed PTP Port's state after execution of the state decision algorithm.
|
/Zephyr-latest/drivers/ieee802154/ |
D | Kconfig.cc13xx_cc26xx | 35 The maximum number of backoffs the CSMA-CA algorithm will attempt 45 algorithm. 54 algorithm. 78 algorithm. Except for the SUN O-QPSK PHY, the ED threshold
|
/Zephyr-latest/doc/hardware/peripherals/ |
D | w1.rst | 54 algorithm which successively detects all slaves on the bus. 55 This algorithm is described in the `1-Wire Search Algorithm Application Note`_. 99 .. _1-Wire Search Algorithm Application Note: 100 https://www.analog.com/en/resources/app-notes/1wire-search-algorithm.html
|
/Zephyr-latest/doc/connectivity/networking/api/ |
D | trickle.rst | 14 `IETF RFC6206 (Trickle Algorithm) <https://tools.ietf.org/html/rfc6206>`_. 16 The Trickle algorithm allows nodes in a lossy shared medium (e.g.,
|
/Zephyr-latest/subsys/jwt/ |
D | Kconfig | 14 prompt "JWT signature algorithm" 17 Select which algorithm to use for signing JWT tokens.
|
/Zephyr-latest/subsys/net/l2/ieee802154/ |
D | Kconfig.radio | 54 The maximum number of backoffs the CSMA-CA algorithm will attempt 64 algorithm (MAC PIB attribute: macMinBe). This setting must be less 73 algorithm (MAC PIB attribute: macMaxBe).
|
D | ieee802154_priv.h | 26 * algorithm (CSMA/CA, ALOHA, etc.) and re-transmission protocol. See sections 6.2.5 (random 41 * @brief This function implements the configured channel access algorithm (CSMA/CA, ALOHA, 48 * algorithm implements a backoff strategy.
|
D | ieee802154_radio_aloha.c | 24 /* Declare the public channel access algorithm function used by L2. */
|
/Zephyr-latest/tests/boot/with_mcumgr/pytest/ |
D | test_upgrade.py | 76 'Starting swap using move algorithm' 90 'Starting swap using move algorithm' 131 'Starting swap using move algorithm' 145 'Starting swap using move algorithm' 205 match_no_lines(output, ['Starting swap using move algorithm'])
|
/Zephyr-latest/samples/subsys/rtio/sensor_batch_processing/src/ |
D | main.c | 46 * available to execute a batch processing algorithm, such as in main() 70 /* Here is where we would execute a batch processing algorithm. in main() 74 * queue than we needed for the batch processing algorithm. in main()
|
/Zephyr-latest/modules/ |
D | Kconfig.tinycrypt | 53 bool "ECC_DSA digital signature algorithm" 56 Signature Algorithm (ECDSA).
|
/Zephyr-latest/subsys/secure_storage/include/internal/zephyr/secure_storage/its/transform/ |
D | aead_get.h | 18 /** @brief Returns the key type and algorithm to use for the AEAD operations. 21 * @param[out] alg The algorithm to use.
|
/Zephyr-latest/dts/bindings/ethernet/ |
D | snps,dwcxgmac.yaml | 315 Receive Arbitration Algorithm. 316 This field is used to select the arbitration algorithm for the Rx 322 ETS Algorithm. 323 This field selects the type of ETS algorithm to be applied for 324 traffic classes whose transmission selection algorithm (TSA) is 326 0: WRR algorithm 327 1: WFQ algorithm 328 2: DWRR algorithm 447 tx-sel-algorithm: 451 Transmission Selection Algorithm. This field is used to assign a transmission [all …]
|
/Zephyr-latest/subsys/bluetooth/mesh/ |
D | crypto.h | 98 int bt_mesh_prov_salt(uint8_t algorithm, const uint8_t *conf_salt, const uint8_t *prov_rand, 131 int bt_mesh_prov_conf_salt(uint8_t algorithm, const uint8_t conf_inputs[145], uint8_t *salt); 133 int bt_mesh_prov_conf_key(uint8_t algorithm, const uint8_t *k_input, const uint8_t *conf_salt, 136 int bt_mesh_prov_conf(uint8_t algorithm, const uint8_t *conf_key, const uint8_t *prov_rand,
|
D | provisionee.c | 141 LOG_DBG("Algorithm: 0x%02x", data[0]); in prov_start() 149 bt_mesh_prov_link.algorithm = data[0]; in prov_start() 152 bt_mesh_prov_link.algorithm = data[0]; in prov_start() 154 LOG_ERR("Unknown algorithm 0x%02x", data[0]); in prov_start() 180 bt_mesh_prov_link.algorithm == BT_MESH_PROV_AUTH_CMAC_AES128_AES_CCM)) { in prov_start() 219 if (bt_mesh_prov_conf_salt(bt_mesh_prov_link.algorithm, inputs, in send_confirm() 231 bt_mesh_prov_link.algorithm == BT_MESH_PROV_AUTH_HMAC_SHA256_AES_CCM) { in send_confirm() 236 if (bt_mesh_prov_conf_key(bt_mesh_prov_link.algorithm, conf_key_input, in send_confirm() 255 if (bt_mesh_prov_conf(bt_mesh_prov_link.algorithm, bt_mesh_prov_link.conf_key, in send_confirm() 432 if (bt_mesh_prov_conf(bt_mesh_prov_link.algorithm, bt_mesh_prov_link.conf_key, in prov_random() [all …]
|
D | prov.h | 127 uint8_t algorithm; /* Authen algorithm */ member 170 return bt_mesh_prov_link.algorithm == BT_MESH_PROV_AUTH_CMAC_AES128_AES_CCM ? 16 : 32; in bt_mesh_prov_auth_size_get()
|
D | crypto.c | 593 int bt_mesh_prov_salt(uint8_t algorithm, in bt_mesh_prov_salt() argument 599 uint8_t size = algorithm ? 32 : 16; in bt_mesh_prov_salt() 610 int bt_mesh_prov_conf_salt(uint8_t algorithm, const uint8_t conf_inputs[145], in bt_mesh_prov_conf_salt() argument 613 if (algorithm == BT_MESH_PROV_AUTH_HMAC_SHA256_AES_CCM && in bt_mesh_prov_conf_salt() 619 if (algorithm == BT_MESH_PROV_AUTH_CMAC_AES128_AES_CCM && in bt_mesh_prov_conf_salt() 628 int bt_mesh_prov_conf_key(uint8_t algorithm, const uint8_t *k_input, in bt_mesh_prov_conf_key() argument 631 if (algorithm == BT_MESH_PROV_AUTH_HMAC_SHA256_AES_CCM && in bt_mesh_prov_conf_key() 637 if (algorithm == BT_MESH_PROV_AUTH_CMAC_AES128_AES_CCM && in bt_mesh_prov_conf_key() 646 int bt_mesh_prov_conf(uint8_t algorithm, const uint8_t *conf_key, in bt_mesh_prov_conf() argument 649 uint8_t auth_size = algorithm ? 32 : 16; in bt_mesh_prov_conf() [all …]
|
/Zephyr-latest/subsys/shell/ |
D | shell_wildcard.c | 127 * Algorithm: in z_shell_wildcard_prepare() 130 * 2. Algorithm goes through command buffer to find handlers and in z_shell_wildcard_prepare() 132 * 3. If algorithm will find a wildcard character it switches to in z_shell_wildcard_prepare() 136 * 5. Algorithm switch back to Command buffer and analyzes next command. in z_shell_wildcard_prepare()
|
/Zephyr-latest/subsys/net/lib/trickle/ |
D | Kconfig | 15 module-str = Log level for Trickle algorithm
|
/Zephyr-latest/modules/mbedtls/ |
D | Kconfig.tls-generic | 303 bool "ChaCha20-Poly1305 AEAD algorithm" 323 bool "MD5 hash algorithm" 326 bool "SHA-1 hash algorithm" 329 bool "SHA-224 hash algorithm" 332 bool "SHA-256 hash algorithm" 344 bool "SHA-384 hash algorithm" 347 bool "SHA-512 hash algorithm"
|
/Zephyr-latest/doc/services/crypto/random/ |
D | index.rst | 15 Platforms without hardware RNG support shall use the `CTR-DRBG algorithm 17 The algorithm can be provided by `TinyCrypt <https://01.org/tinycrypt>`_
|
/Zephyr-latest/scripts/dts/python-devicetree/src/devicetree/ |
D | grutils.py | 64 # Execute Tarjan's algorithm on the graph. 66 # Tarjan's algorithm 102 # Do the work of Tarjan's algorithm for a given root node.
|