Searched refs:recent (Results 1 - 15 of 15) sorted by relevance

/ast/src/lib/libvdelta/vd01/
H A Dvdelhdr01.h105 ** and a revolving cache of K_RTYPE "recent" addresses.
109 ** the "recent" cache an address that is closest to the being coded address,
124 #define K_DDECL(quick,recent,rhere) /* cache decls in vdelta */ \
125 int quick[K_QSIZE]; int recent[K_RTYPE]; int rhere/*;*/
126 #define K_UDECL(quick,recent,rhere) /* cache decls in vdupdate */ \
127 long quick[K_QSIZE]; long recent[K_RTYPE]; int rhere/*;*/
128 #define K_INIT(quick,recent,rhere) \
131 recent[rhere=0] = (1<<8); \
132 while((rhere += 1) < K_RTYPE) recent[rhere] = (rhere+1)*(1<<8); \
134 #define K_UPDATE(quick,recent,rher
[all...]
H A Dvdupdate01.c48 K_UDECL(quick,recent,rhere); /* address caches */
145 copy += tab->recent[k_type - K_RECENT];
150 K_UPDATE(tab->quick,tab->recent,tab->rhere,copy);
388 K_INIT(tab.quick,tab.recent,tab.rhere);
H A Dvddelta01.c49 K_DDECL(quick,recent,rhere); /* address caches */
84 { if((d = copy - tab->recent[n]) < 0 || d >= best)
101 K_UPDATE(tab->quick,tab->recent,tab->rhere,copy);
471 K_INIT(tab.quick,tab.recent,tab.rhere);
/ast/src/lib/libvdelta/
H A Dvdexpand.c31 K_UDECL(quick,recent,rhere); /* address caches */
94 copy += tab->recent[k_type - K_RECENT];
99 K_UPDATE(tab->quick,tab->recent,tab->rhere,copy);
140 K_INIT(tab.quick,tab.recent,tab.rhere);
H A Dvdelhdr.h105 ** and a revolving cache of K_RTYPE "recent" addresses.
109 ** the "recent" cache an address that is closest to the being coded address,
124 #define K_DDECL(quick,recent,rhere) /* cache decls in vdelta */ \
125 int quick[K_QSIZE]; int recent[K_RTYPE]; int rhere/*;*/
126 #define K_UDECL(quick,recent,rhere) /* cache decls in vdupdate */ \
127 long quick[K_QSIZE]; long recent[K_RTYPE]; int rhere/*;*/
128 #define K_INIT(quick,recent,rhere) \
131 recent[rhere=0] = (1<<8); \
132 while((rhere += 1) < K_RTYPE) recent[rhere] = (rhere+1)*(1<<8); \
134 #define K_UPDATE(quick,recent,rher
[all...]
H A Dvdsqueeze.c43 K_DDECL(quick,recent,rhere); /* address caches */
79 { if((d = copy - tab->recent[n]) < 0 || d >= best)
96 K_UPDATE(tab->quick,tab->recent,tab->rhere,copy);
308 K_INIT(tab.quick,tab.recent,tab.rhere);
H A Dvdupdate.c50 K_UDECL(quick,recent,rhere); /* address caches */
147 copy += tab->recent[k_type - K_RECENT];
152 K_UPDATE(tab->quick,tab->recent,tab->rhere,copy);
407 K_INIT(tab.quick,tab.recent,tab.rhere);
H A Dvddelta.c45 K_DDECL(quick,recent,rhere); /* address caches */
80 { if((d = copy - tab->recent[n]) < 0 || d >= best)
97 K_UPDATE(tab->quick,tab->recent,tab->rhere,copy);
518 K_INIT(tab.quick,tab.recent,tab.rhere);
/ast/src/lib/libast/port/
H A Dastconf.c297 Feature_t* recent; member in struct:State_s
856 state.recent = fp;
1465 if (state.recent && streq(name, state.recent->name) && (s = format(state.recent, path, value, flags, conferror)))
/ast/src/cmd/nmake/
H A Dcommand.c1241 int recent; local
1269 if (recent = r->status == MAKING)
1277 if (recent = r->status == MAKING)
1289 if (recent && (r->property & (P_joint|P_target)) == (P_joint|P_target))
H A DMakerules.mk2815 * the most recent :PACKAGE: assertion takes highest precedence
/ast/src/cmd/mailx/
H A Ddata.c225 X("[ message ... ]\nRestore the selected messages by removing the DELETE mark. If no messages are specified then the most recent DELETE message is restored. If ${autoprint} is on then the last restored message is listed."),
229 X("[ message ... ]\nRemove the READ mark from the selected messages. If no messages are specified then the most recent DELETE message is restored."),
399 X("Print the status and sender for the specified number of most recent messages and exit."),
432 "recent", &state.var.recent, 0, 0,0,
H A Dimap.c218 int recent; /* first recent message */ member in struct:__anon128::__anon130
1306 imap->mailbox.recent = op->count;
1930 sfprintf(sfstdout, " recent %d\n", imap->mailbox.recent);
1931 sfprintf(sfstdout, " read_only %d\n", imap->mailbox.recent);
H A Dlex.c612 else if (msgcount <= 0 && state.var.recent)
H A Dmailx.h844 char* recent; member in struct:__anon136::__anon147

Completed in 115 milliseconds