lv_fs_file_t::drv - syntax, references, description

References

Code

Location

Referrer

lv_fs_drv_t * drv;

lv_fs.h:90

file_p->drv = drv;

lv_fs.c:106

lv_fs_open()

if(file_p->drv == NULL) {

lv_fs.c:156

lv_fs_close()

if(file_p->drv->close_cb == NULL) {

lv_fs.c:160

lv_fs_close()

lv_fs_res_t res = file_p->drv->close_cb(file_p->drv, file_p->file_d);

lv_fs.c:166

lv_fs_close()

if(file_p->drv->cache_size && file_p->cache) {

lv_fs.c:168

lv_fs_close()

if(file_p->drv->cache_size != LV_FS_CACHE_FROM_BUFFER && file_p->cache->buffer) {

file_p->drv = NULL;

if(file_p->drv == NULL) return LV_FS_RES_INV_PARAM;

lv_fs.c:189

lv_fs_read()

if(file_p->drv->cache_size) {

lv_fs.c:191

lv_fs_read()

if(file_p->drv->read_cb == NULL || file_p->drv->seek_cb == NULL) return LV_FS_RES_NOT_IMP;

lv_fs.c:192

lv_fs_read()

if(file_p->drv->read_cb == NULL) return LV_FS_RES_NOT_IMP;

lv_fs.c:195

lv_fs_read()

if(file_p->drv->cache_size) {

lv_fs.c:203

lv_fs_read()

res = file_p->drv->read_cb(file_p->drv, file_p->file_d, buf, btr, &br_tmp);

lv_fs.c:207

lv_fs_read()

if(file_p->drv == NULL) {

lv_fs.c:221

lv_fs_write()

if(file_p->drv->cache_size) {

lv_fs.c:225

lv_fs_write()

if(file_p->drv->write_cb == NULL || file_p->drv->seek_cb == NULL) return LV_FS_RES_NOT_IMP;

lv_fs.c:226

lv_fs_write()

if(file_p->drv->write_cb == NULL) return LV_FS_RES_NOT_IMP;

lv_fs.c:229

lv_fs_write()

if(file_p->drv->cache_size) {

lv_fs.c:236

lv_fs_write()

res = file_p->drv->write_cb(file_p->drv, file_p->file_d, buf, btw, &bw_tmp);

lv_fs.c:240

lv_fs_write()

if(file_p->drv == NULL) {

lv_fs.c:251

lv_fs_seek()

if(file_p->drv->cache_size) {

lv_fs.c:255

lv_fs_seek()

if(file_p->drv->seek_cb == NULL || file_p->drv->tell_cb == NULL) return LV_FS_RES_NOT_IMP;

lv_fs.c:256

lv_fs_seek()

if(file_p->drv->seek_cb == NULL) return LV_FS_RES_NOT_IMP;

lv_fs.c:259

lv_fs_seek()

if(file_p->drv->cache_size) {

lv_fs.c:265

lv_fs_seek()

res = file_p->drv->seek_cb(file_p->drv, file_p->file_d, pos, whence);

lv_fs.c:269

lv_fs_seek()

if(file_p->drv == NULL) {

lv_fs.c:279

lv_fs_tell()

if(file_p->drv->cache_size == 0 && file_p->drv->tell_cb == NULL) {

lv_fs.c:284

lv_fs_tell()

if(file_p->drv->cache_size) {

lv_fs.c:292

lv_fs_tell()

res = file_p->drv->tell_cb(file_p->drv, file_p->file_d, pos);

lv_fs.c:297

lv_fs_tell()

uint32_t buffer_size = file_p->drv->cache_size;

lv_fs.c:545

lv_fs_read_cached()

if(file_p->drv->cache_size == LV_FS_CACHE_FROM_BUFFER) {

lv_fs.c:553

lv_fs_read_cached()

file_p->drv->seek_cb(file_p->drv, file_p->file_d, file_p->cache->end + 1,

lv_fs.c:567

lv_fs_read_cached()

res = file_p->drv->read_cb(file_p->drv, file_p->file_d, (char *)buf + buffer_remaining_length,

lv_fs.c:573

lv_fs_read_cached()

res = file_p->drv->read_cb(file_p->drv, file_p->file_d, buffer, buffer_size, &bytes_read_to_buffer);

lv_fs.c:578

lv_fs_read_cached()

file_p->drv->seek_cb(file_p->drv, file_p->file_d, file_p->cache->file_position,

lv_fs.c:589

lv_fs_read_cached()

res = file_p->drv->read_cb(file_p->drv, file_p->file_d, (void *)buf, btr, br);

lv_fs.c:595

lv_fs_read_cached()

res = file_p->drv->read_cb(file_p->drv, file_p->file_d, (void *)buffer, buffer_size, &bytes_read_to_buffer);

lv_fs.c:606

lv_fs_read_cached()

res = file_p->drv->seek_cb(file_p->drv, file_p->file_d, file_p->cache->file_position, LV_FS_SEEK_SET);

lv_fs.c:628

lv_fs_write_cached()

res = file_p->drv->write_cb(file_p->drv, file_p->file_d, buf, btw, bw);

lv_fs.c:631

lv_fs_write_cached()

res = file_p->drv->seek_cb(file_p->drv, file_p->file_d, pos, whence);

lv_fs.c:681

lv_fs_seek_cached()

res = file_p->drv->tell_cb(file_p->drv, file_p->file_d, &tmp_position);

lv_fs.c:684

lv_fs_seek_cached()

Call Tree

All items filtered out

Data Use

lv_fs_file_t::drv is written by 2 functions and is read by 8 functions:

lv_fs_file_t::drv

Class Tree

All items filtered out

Override Tree

All items filtered out

Implementations

All items filtered out

Instances

Lifecycle

All items filtered out

lv_fs_file_t::drv field

Syntax

Examples

References

Call Tree

Data Use

Class Tree

Override Tree

Implementations

Instances

Lifecycle