[問題] 走訪 struct member 的問題
開發平台(Platform): (Ex: VC++, GCC, Linux, ...)
gcc, linux
問題(Question):
在底下 srt 結構, 有辦法不指定 struct member 而直接靠記憶體操作 struct member 嗎(ex: address + 1)?
會這麼問的原因是 &cat + 1 跳到的下一個位置會是往後跳 sizeof(int) * 5,
這樣一來就無法完成我要的結果.
目前本身的看法, 猜測 struct 本身就不建議這樣操作,
或者相同 type 要這樣操作就改用 array.
不知道大家有沒有什麼看法, 感謝.
程式碼(Code):(請善用置底文網頁, 記得排版)
#include <stdio.h>
#include <string.h>
struct srt {
int a;
int b;
int c;
int d;
int e;
};
int main ()
{
struct srt cat ;
int i = 0;
int tmp = 99;
for (; sizeof(struct srt)/sizeof(int); ++i)
memcpy(..., &tmp, sizeof(int));
return 0;
}
補充說明(Supplement):
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.113.235.150
→
11/08 23:28, , 1F
11/08 23:28, 1F
→
11/08 23:29, , 2F
11/08 23:29, 2F
→
11/08 23:44, , 3F
11/08 23:44, 3F
→
11/08 23:56, , 4F
11/08 23:56, 4F
→
11/09 00:18, , 5F
11/09 00:18, 5F
→
11/09 00:19, , 6F
11/09 00:19, 6F
→
11/09 01:03, , 7F
11/09 01:03, 7F
→
11/09 01:04, , 8F
11/09 01:04, 8F
→
11/09 12:49, , 9F
11/09 12:49, 9F
→
11/09 12:50, , 10F
11/09 12:50, 10F
推
11/09 15:42, , 11F
11/09 15:42, 11F
→
11/09 15:46, , 12F
11/09 15:46, 12F
→
11/09 15:47, , 13F
11/09 15:47, 13F
→
11/09 21:27, , 14F
11/09 21:27, 14F
→
11/09 21:28, , 15F
11/09 21:28, 15F
→
11/09 21:29, , 16F
11/09 21:29, 16F
→
11/09 21:30, , 17F
11/09 21:30, 17F
推
11/09 21:37, , 18F
11/09 21:37, 18F
→
11/09 21:38, , 19F
11/09 21:38, 19F
→
11/09 22:06, , 20F
11/09 22:06, 20F
→
11/09 22:11, , 21F
11/09 22:11, 21F
→
11/09 22:11, , 22F
11/09 22:11, 22F
→
11/09 22:14, , 23F
11/09 22:14, 23F
→
11/09 22:18, , 24F
11/09 22:18, 24F
→
11/09 22:18, , 25F
11/09 22:18, 25F
推
11/09 22:32, , 26F
11/09 22:32, 26F
→
11/09 22:35, , 27F
11/09 22:35, 27F
→
11/09 22:36, , 28F
11/09 22:36, 28F
→
11/09 22:36, , 29F
11/09 22:36, 29F
→
11/09 22:36, , 30F
11/09 22:36, 30F
→
11/09 22:49, , 31F
11/09 22:49, 31F
→
11/09 23:11, , 32F
11/09 23:11, 32F
→
11/09 23:11, , 33F
11/09 23:11, 33F
→
11/09 23:13, , 34F
11/09 23:13, 34F
→
11/09 23:18, , 35F
11/09 23:18, 35F
→
11/09 23:18, , 36F
11/09 23:18, 36F
→
11/09 23:30, , 37F
11/09 23:30, 37F
討論串 (同標題文章)
以下文章回應了本文:
完整討論串 (本文為第 1 之 2 篇):