Re: 如何得知一個 function 會用多少 stack...

看板PttCurrent作者 (@.@)時間22年前 (2002/08/06 15:51), 編輯推噓0(000)
留言0則, 0人參與, 最新討論串1/1
※ [本文轉錄自 Administor 看板] 作者: in2 (使用者名單是可以) 看板: Administor 標題: Re: 如何得知一個 function 會用多少 stack... 時間: Sun Jul 21 01:30:03 2002 ※ 引述《Action (雪...)》之銘言: 目前有用到比較多的: announce.c: (4764) void gem(char *maintitle, item_t * path, int update) { gmenu_t me; int ch; char fname[PATHLEN]; board.c: (24684) void brc_update() { if (brc_changed && cuser.userlevel) { char dirfile[STRLEN], *ptr; char tmp_buf[BRC_MAXSIZE - BRC_ITEMSIZE], *tmp; char tmp_name[BRC_STRLEN]; int tmp_list[BRC_MAXNUM], tmp_num; int fd, tmp_size; cache.c: (16412) (不過這個沒差, 只會跑一次) void sort_utmp() { userinfo_t *uentp; int count, i, ns; short nusers[MAX_BOARD]; dice.c: (2380) int dice_main(void) { char input[10], data[256], ch; dicedata_t table[256]; int bet[3], index, money = 0, i, ya = 0, j, total, sig = 0; FILE *winfp /* , *lostfp */ ; mbbsd.c: (3408) static void setup_utmp(int mode) { userinfo_t uinfo; more.c: (5532) int more(char *fpath, int promptend) { static char *head[4] = {"作者", "標題", "時間", "轉信"}; char *ptr, *word = NULL, buf[ANSILINELEN + 1]; struct stat st; /* rocker */ //FILE * fp; int fd, fsize; unsigned int pagebreak[MAX_PAGES], pageno, lino = 0; int line, ch, viewed, pos, numbytes; int header = 0; int local = 0; char search_char0 = 0; static char search_str[81] = ""; typedef char *(*FPTR) (); static FPTR fptr; int searching = 0; int scrollup = 0; char *printcolor[3] = {"44", "33;45", "0;34;46"}, color = 0; read.c: (2060) int Tagger(time_t chrono, int recno, int mode) { int head, tail, posi = 0, comp; talk.c: (3100) static void pickup(pickup_t * currpickup, int pickup_way, int *page, int *nfriend, int *myfriend, int *friendme, int *bfriend) { /* avoid race condition */ int currsorted = SHM->currsorted; int utmpnumber = SHM->UTMPnumber; int friendtotal = currutmp->friendtotal; talk.c: (4396) static void userlist(void) { /* * 啝夛唿夘喞夋userlist userlist() : main loop draw_pickup() : show out * screen pickup() : generate THIS PAGE pickup list * pickup_maxpages : return max pages number of all list pickup_myfriend * : pickup friend (from friend_online) and sort */ pickup_t currpickup[MAXPICKUP]; userinfo_t *uentp; static int show_mode = 0; userinfo_t *uentp; static int show_mode = 0; static int show_uid = 0; static int show_board = 0; static int show_pid = 0; static int real_name = 0; char genbuf[256]; int page, offset, pickup_way, ch, leave, redraw, redrawall, fri_stat; int nfriend, myfriend, friendme, bfriend, i; time_t lastupdate; topsong.c: (61964) void sortsong() { FILE *fo, *fp = fopen(BBSHOME "/" FN_USSONG, "r"); songcmp_t songs[MAX_SONGS + 1]; int n; char buf[256], cbuf[256]; -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.112.30.143 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 140.112.30.143
文章代碼(AID): #zJu06_i (PttCurrent)