嵌入式軟件開(kāi)發(fā)與通用軟件開(kāi)發(fā)在數(shù)據(jù)結(jié)構(gòu)的選擇和使用上有顯著差異，主要受限于嵌入式系統(tǒng)的資源約束（如內(nèi)存、處理器能力）和實(shí)時(shí)性要求。
本文將詳細(xì)介紹嵌入式開(kāi)發(fā)中最關(guān)鍵的數(shù)據(jù)結(jié)構(gòu)及其高效使用方法。
在嵌入式系統(tǒng)開(kāi)發(fā)中選擇數(shù)據(jù)結(jié)構(gòu)時(shí)，需要考慮以下關(guān)鍵因素：
特點(diǎn)：
示例代碼：
// 靜態(tài)數(shù)組聲明
#define SENSOR_READINGS_SIZE 10
static int32_t sensor_readings[SENSOR_READINGS_SIZE];
// 循環(huán)緩沖區(qū)實(shí)現(xiàn)
typedef struct
{
uint8_t buffer[64];
uint8_t head;
uint8_t tail;
} CircularBuffer;
void circular_buffer_push(CircularBuffer* cb, uint8_t data)
{
cb->buffer[cb->head] = data;
cb->head = (cb->head + 1) % sizeof(cb->buffer);
}
使用技巧：
嵌入式變體：
實(shí)現(xiàn)示例：
// 靜態(tài)分配的鏈表節(jié)點(diǎn)池
#define MAX_NODES 32
typedef struct Node
{
int value;
struct Node* next;
} Node;
Node node_pool[MAX_NODES];
Node* free_list = NULL;
void init_pool()
{
for(int i=0; i<MAX_NODES-1; i++)
{
node_pool[i].next = &node_pool[i+1];
}
node_pool[MAX_NODES-1].next = NULL;
free_list = &node_pool[0];
}
Node* alloc_node()
{
if(!free_list) return NULL;
Node* node = free_list;
free_list = free_list->next;
return node;
}
適用場(chǎng)景：
嵌入式使用：
環(huán)形隊(duì)列實(shí)現(xiàn)：
typedef struct
{
uint8_t* buffer;
size_t head;
size_t tail;
size_t size;
size_t capacity;
} RingBuffer;
bool ring_buffer_init(RingBuffer* rb, uint8_t* buf, size_t capacity)
{
rb->buffer = buf;
rb->capacity = capacity;
rb->size = 0;
rb->head = 0;
rb->tail = 0;
returntrue;
}
bool ring_buffer_push(RingBuffer* rb, uint8_t data)
{
if(rb->size >= rb->capacity) returnfalse;
rb->buffer[rb->head] = data;
rb->head = (rb->head + 1) % rb->capacity;
rb->size++;
returntrue;
}
應(yīng)用場(chǎng)景：
實(shí)現(xiàn)要點(diǎn)：
實(shí)現(xiàn)示例：
#define STACK_SIZE 64
typedef struct
{
uint32_t data[STACK_SIZE];
int32_t top;
} Stack;
void stack_init(Stack* s)
{
s->top = -1;
}
bool stack_push(Stack* s, uint32_t value)
{
if(s->top >= STACK_SIZE-1) returnfalse;
s->data[++s->top] = value;
returntrue;
}
bool stack_pop(Stack* s, uint32_t* value)
{
if(s->top < 0) returnfalse;
*value = s->data[s->top--];
returntrue;
}
應(yīng)用場(chǎng)景：
嵌入式應(yīng)用：
實(shí)現(xiàn)示例：
#define HASH_SIZE 32
typedef struct
{
uint16_t key;
void* value;
bool used;
} HashEntry;
typedef struct
{
HashEntry entries[HASH_SIZE];
} HashTable;
uint16_t simple_hash(uint16_t key)
{
return key % HASH_SIZE;
}
bool hash_insert(HashTable* ht, uint16_t key, void* value)
{
uint16_t index = simple_hash(key);
for(int i=0; i<HASH_SIZE; i++) {
uint16_t slot = (index + i) % HASH_SIZE;
if(!ht->entries[slot].used) {
ht->entries[slot].key = key;
ht->entries[slot].value = value;
ht->entries[slot].used = true;
returntrue;
}
}
returnfalse;
}
應(yīng)用場(chǎng)景：
嵌入式常用變體：
優(yōu)化技巧：
數(shù)組實(shí)現(xiàn)二叉樹(shù)示例：
#define MAX_TREE_NODES 127
typedef struct
{
int data[MAX_TREE_NODES];
size_t size;
} ArrayBinaryTree;
size_t left_child(size_t index) { return 2*index + 1; }
size_t right_child(size_t index) { return 2*index + 2; }
void tree_insert(ArrayBinaryTree* tree, int value)
{
if(tree->size >= MAX_TREE_NODES) return;
tree->data[tree->size++] = value;
}
應(yīng)用場(chǎng)景：
優(yōu)勢(shì)：
實(shí)現(xiàn)示例：
// 位圖實(shí)現(xiàn)
#define BITMAP_SIZE 128
typedef struct
{
uint8_t bits[BITMAP_SIZE/8];
} Bitmap;
void bitmap_set(Bitmap* bm, size_t bit)
{
bm->bits[bit/8] |= (1 << (bit % 8));
}
bool bitmap_test(Bitmap* bm, size_t bit)
{
return (bm->bits[bit/8] & (1 << (bit % 8))) != 0;
}
// 位字段實(shí)現(xiàn)
typedef struct
{
uint32_t flag1 : 1;
uint32_t flag2 : 1;
uint32_t mode : 3;
uint32_t value : 10;
} PackedData;
應(yīng)用場(chǎng)景：
#define POOL_SIZE 1024
#define BLOCK_SIZE 32
#define NUM_BLOCKS (POOL_SIZE/BLOCK_SIZE)
typedef struct
{
uint8_t pool[POOL_SIZE];
uint8_t used[NUM_BLOCKS];
} MemoryPool;
void* pool_alloc(MemoryPool* mp)
{
for(int i=0; i<NUM_BLOCKS; i++)
{
if(!mp->used[i])
{
mp->used[i] = 1;
return &mp->pool[i*BLOCK_SIZE];
}
}
return NULL;
}
typedef enum { SENSOR_UPDATE, BUTTON_PRESS, TIMEOUT } EventType;
typedef struct
{
EventType type;
uint32_t timestamp;
union
{
int32_t sensor_value;
uint8_t button_id;
} data;
} Event;
#define MAX_EVENTS 16
typedef struct
{
Event events[MAX_EVENTS];
uint8_t front;
uint8_t rear;
uint8_t count;
} EventQueue;
#define TIMER_SLOTS 32
typedef void (*TimerCallback)(void*);
typedef struct
{
uint32_t timeout;
TimerCallback cb;
void* arg;
uint32_t remaining;
} Timer;
typedef struct
{
Timer slots[TIMER_SLOTS][8];
uint8_t counts[TIMER_SLOTS];
uint32_t current_slot;
} TimerWheel;
__attribute__((aligned))進(jìn)行對(duì)齊嵌入式軟件開(kāi)發(fā)中的數(shù)據(jù)結(jié)構(gòu)選擇對(duì)系統(tǒng)性能、可靠性和資源利用率有決定性影響。
掌握這些數(shù)據(jù)結(jié)構(gòu)的特性、實(shí)現(xiàn)方式及適用場(chǎng)景，能夠幫助開(kāi)發(fā)者構(gòu)建高效可靠的嵌入式系統(tǒng)。
在實(shí)際項(xiàng)目中，通常需要根據(jù)具體約束條件進(jìn)行定制化設(shè)計(jì)和優(yōu)化，找到最適合特定應(yīng)用場(chǎng)景的數(shù)據(jù)結(jié)構(gòu)解決方案。
覺(jué)得文章不錯(cuò)，點(diǎn)擊“分享”、“贊”、“推薦” 唄！
