alex/esp-idf
alex/esp-idf
1
0
Fork 0
mirror of https://github.com/espressif/esp-idf.git synced 2024-10-05 20:47:46 -04:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

feat(log): add tags only when no one exist, otherwise refresh linked list and cache.

Browse Source
This commit is contained in:
michael 2017-08-25 11:46:55 +08:00
parent 940f5fcb89
commit cfd95b62cb
1 changed files with 34 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

44
components/log/log.c
View File

@ -13,7 +13,7 @@
// limitations under the License. // limitations under the License.
/* /*
* Log library â€implementation notes. * Log library implementation notes.
* *
* Log library stores all tags provided to esp_log_level_set as a linked * Log library stores all tags provided to esp_log_level_set as a linked
* list. See uncached_tag_entry_t structure. * list. See uncached_tag_entry_t structure.
@ -122,16 +122,40 @@ void esp_log_level_set(const char* tag, esp_log_level_t level)
return; return;
} }
// allocate new linked list entry and append it to the head of the list //searching exist tag
size_t entry_size = offsetof(uncached_tag_entry_t, tag) + strlen(tag) + 1; uncached_tag_entry_t *it = NULL;
uncached_tag_entry_t* new_entry = (uncached_tag_entry_t*) malloc(entry_size); SLIST_FOREACH( it, &s_log_tags, entries ) {
if (!new_entry) { if ( strcmp(it->tag, tag)==0 ) {
xSemaphoreGive(s_log_mutex); //one tag in the linked list match, update the level
return; it->level = level;
//quit with it != NULL
break;
}
}
//no exist tag, append new one
if ( it == NULL ) {
// allocate new linked list entry and append it to the head of the list
size_t entry_size = offsetof(uncached_tag_entry_t, tag) + strlen(tag) + 1;
uncached_tag_entry_t* new_entry = (uncached_tag_entry_t*) malloc(entry_size);
if (!new_entry) {
xSemaphoreGive(s_log_mutex);
return;
}
new_entry->level = (uint8_t) level;
strcpy(new_entry->tag, tag);
SLIST_INSERT_HEAD( &s_log_tags, new_entry, entries );
}
//search in the cache and update it if exist
for (int i = 0; i < s_log_cache_entry_count; ++i) {
#ifdef LOG_BUILTIN_CHECKS
assert(i == 0 || s_log_cache[(i - 1) / 2].generation < s_log_cache[i].generation);
#endif
if (s_log_cache[i].tag == tag) {
s_log_cache[i].level = level;
break;
}
} }
new_entry->level = (uint8_t) level;
strcpy(new_entry->tag, tag);
SLIST_INSERT_HEAD( &s_log_tags, new_entry, entries );
xSemaphoreGive(s_log_mutex); xSemaphoreGive(s_log_mutex);
} }