diff options
author | LAN-TW <lantw44@gmail.com> | 2012-09-13 01:09:01 +0800 |
---|---|---|
committer | LAN-TW <lantw44@gmail.com> | 2012-09-13 01:09:01 +0800 |
commit | 286793cc984b2b5b05bb51ee2f73778a571dc0d4 (patch) | |
tree | cce70d940a51bf0370512aea748b625683cbb644 /l4bds | |
parent | 3e3947087f43f172a01d9c1f2b8069d55b934115 (diff) | |
download | l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.tar l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.tar.gz l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.tar.bz2 l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.tar.lz l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.tar.xz l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.tar.zst l4basic-286793cc984b2b5b05bb51ee2f73778a571dc0d4.zip |
在一些函式的 data 參數加上 const 標記
Diffstat (limited to 'l4bds')
-rw-r--r-- | l4bds/l4bds.h | 4 | ||||
-rw-r--r-- | l4bds/list.c | 8 |
2 files changed, 7 insertions, 5 deletions
diff --git a/l4bds/l4bds.h b/l4bds/l4bds.h index 5c353c1..2ad7199 100644 --- a/l4bds/l4bds.h +++ b/l4bds/l4bds.h @@ -25,8 +25,8 @@ void l4ll_free(L4LL*); #define l4ll_node_front(list) ((list)->list_first) #define l4ll_data(node) ((node)->node_data) #define l4ll_datasize(node) ((node)->node_data_size) -L4LLNODE* l4ll_insert_prev(L4LL*, L4LLNODE*, void*, int); -L4LLNODE* l4ll_insert_next(L4LL*, L4LLNODE*, void*, int); +L4LLNODE* l4ll_insert_prev(L4LL*, L4LLNODE*, const void*, int); +L4LLNODE* l4ll_insert_next(L4LL*, L4LLNODE*, const void*, int); void l4ll_remove(L4LL*, L4LLNODE*); #define l4ll_pushback(list,data,size) \ (l4ll_insert_next((list),(l4ll_node_back(list)),(data),(size))) diff --git a/l4bds/list.c b/l4bds/list.c index 960af59..09ec746 100644 --- a/l4bds/list.c +++ b/l4bds/list.c @@ -31,7 +31,7 @@ void l4ll_free(L4LL* oldlist){ } static L4LLNODE* -l4ll_initfirst(L4LL* list, void* data, int size){ +l4ll_initfirst(L4LL* list, const void* data, int size){ /* 插入第一個資料,如果 list 不是空的就別用! * 否則會造成資料結構混亂和 memory leak */ L4LLNODE* node = (L4LLNODE*)malloc(sizeof(L4LLNODE)); @@ -57,7 +57,8 @@ l4ll_initfirst(L4LL* list, void* data, int size){ return node; } -L4LLNODE* l4ll_insert_prev(L4LL* list, L4LLNODE* node, void* data, int size){ +L4LLNODE* l4ll_insert_prev(L4LL* list, L4LLNODE* node, + const void* data, int size){ /* list 送 NULL 來的我不理它,就自己去 segfault 吧 * node 送 NULL 來只能在 list 是空的時候用 */ if(list->list_len == 0){ @@ -92,7 +93,8 @@ L4LLNODE* l4ll_insert_prev(L4LL* list, L4LLNODE* node, void* data, int size){ return newnode; } -L4LLNODE* l4ll_insert_next(L4LL* list, L4LLNODE* node, void* data, int size){ +L4LLNODE* l4ll_insert_next(L4LL* list, L4LLNODE* node, + const void* data, int size){ /* 基本上同 l4ll_insert_prev */ if(list->list_len == 0){ return l4ll_initfirst(list, data, size); |