top 28 examples/mqueue-cpp/mqueue.cpp Message m = q.top();
top 80 ext/charconv/guess.c guess_dfa *top = NULL;
top 114 ext/charconv/guess.c if (DFA_ALIVE(eucj)) top = &eucj;
top 116 ext/charconv/guess.c if (top) {
top 118 ext/charconv/guess.c if (top->score <= utf8.score) top = &utf8;
top 120 ext/charconv/guess.c if (top->score < utf8.score) top = &utf8;
top 123 ext/charconv/guess.c top = &utf8;
top 127 ext/charconv/guess.c if (top) {
top 129 ext/charconv/guess.c if (top->score <= sjis.score) top = &sjis;
top 131 ext/charconv/guess.c if (top->score < sjis.score) top = &sjis;
top 134 ext/charconv/guess.c top = &sjis;
top 138 ext/charconv/guess.c if (top == &eucj) return "EUC-JP";
top 139 ext/charconv/guess.c if (top == &utf8) return "UTF-8";
top 140 ext/charconv/guess.c if (top == &sjis) return "Shift_JIS";
top 733 gc/cord/cordbscs.c register CORD top = current_pe -> pe_cord;
top 736 gc/cord/cordbscs.c register size_t top_len = GEN_LEN(top);
top 739 gc/cord/cordbscs.c while(!CORD_IS_STRING(top) && IS_CONCATENATION(top)) {
top 741 gc/cord/cordbscs.c &(((CordRep *)top) -> concatenation);
top 747 gc/cord/cordbscs.c current_pe -> pe_cord = top = conc -> right;
top 751 gc/cord/cordbscs.c current_pe -> pe_cord = top = conc -> left;
top 758 gc/cord/cordbscs.c if (CORD_IS_STRING(top)) {
top 759 gc/cord/cordbscs.c p[0].cur_leaf = top;
top 165 gc/cord/de_win.c rectp -> top = line * char_height;
top 166 gc/cord/de_win.c rectp -> bottom = rectp->top + char_height;
top 204 gc/cord/de_win.c LINES = (client_area.bottom - client_area.top)/char_height;
top 278 gc/cord/de_win.c LINES = (client_area.bottom - client_area.top)/char_height;
top 296 gc/cord/de_win.c TextOut(dc, this_line.left, this_line.top,
top 298 gc/cord/de_win.c TextOut(dc, this_line.left + len * char_width, this_line.top,
top 302 gc/cord/de_win.c TextOut(dc, this_line.left, this_line.top,
top 323 gc/include/private/gc_pmark.h mse * GC_mark_from GC_PROTO((mse * top, mse * bottom, mse *limit));
top 1303 gc/include/private/gc_priv.h void GC_push_all GC_PROTO((ptr_t bottom, ptr_t top));
top 1308 gc/include/private/gc_priv.h ptr_t top, \
top 1310 gc/include/private/gc_priv.h void (*push_fn) GC_PROTO((ptr_t bottom, ptr_t top)) ));
top 1330 gc/include/private/gc_priv.h ptr_t bottom, ptr_t top, ptr_t cold_gc_frame ));
top 834 gc/mark.c mse *top = local - 1;
top 858 gc/mark.c ++top;
top 859 gc/mark.c top -> mse_descr = descr;
top 860 gc/mark.c top -> mse_start = p -> mse_start;
top 861 gc/mark.c GC_ASSERT( (top -> mse_descr & GC_DS_TAGS) != GC_DS_LENGTH ||
top 862 gc/mark.c top -> mse_descr < (ptr_t)GC_greatest_plausible_heap_addr
top 871 gc/mark.c return top;
top 1194 gc/mark.c void GC_push_all(bottom, top)
top 1196 gc/mark.c ptr_t top;
top 1201 gc/mark.c top = (ptr_t)(((word) top) & ~(ALIGNMENT-1));
top 1202 gc/mark.c if (top == 0 || bottom == top) return;
top 1207 gc/mark.c length = top - bottom;
top 1226 gc/mark.c void GC_push_selected(bottom, top, dirty_fn, push_fn)
top 1228 gc/mark.c ptr_t top;
top 1230 gc/mark.c void (*push_fn) GC_PROTO((ptr_t bottom, ptr_t top));
top 1235 gc/mark.c top = (ptr_t)(((long) top) & ~(ALIGNMENT-1));
top 1237 gc/mark.c if (top == 0 || bottom == top) return;
top 1239 gc/mark.c if (top <= (ptr_t) h) {
top 1241 gc/mark.c (*push_fn)(bottom, top);
top 1248 gc/mark.c while ((ptr_t)(h+1) <= top) {
top 1253 gc/mark.c (*push_fn)((ptr_t)h, top);
top 1261 gc/mark.c if ((ptr_t)h != top) {
top 1263 gc/mark.c (*push_fn)((ptr_t)h, top);
top 1283 gc/mark.c void GC_push_conditional(bottom, top, all)
top 1285 gc/mark.c ptr_t top;
top 1292 gc/mark.c GC_push_selected(bottom, top, GC_page_was_ever_dirty, GC_push_all);
top 1294 gc/mark.c GC_push_all(bottom, top);
top 1297 gc/mark.c GC_push_all(bottom, top);
top 1300 gc/mark.c GC_push_selected(bottom, top, GC_page_was_dirty, GC_push_all);
top 1449 gc/mark.c void GC_push_all_eager(bottom, top)
top 1451 gc/mark.c ptr_t top;
top 1454 gc/mark.c word * t = (word *)(((word) top) & ~(ALIGNMENT-1));
top 1463 gc/mark.c if (top == 0) return;
top 1483 gc/mark.c void GC_push_all_stack_partially_eager(bottom, top, cold_gc_frame)
top 1485 gc/mark.c ptr_t top;
top 1494 gc/mark.c GC_push_all_stack(bottom, top);
top 1497 gc/mark.c GC_ASSERT(bottom <= cold_gc_frame && cold_gc_frame <= top);
top 1499 gc/mark.c GC_push_all(cold_gc_frame - sizeof(ptr_t), top);
top 1503 gc/mark.c GC_push_all_eager(cold_gc_frame, top);
top 1506 gc/mark.c GC_push_all_eager(bottom, top);
top 1509 gc/mark.c GC_add_trace_entry("GC_push_all_stack", bottom, top);
top 1514 gc/mark.c void GC_push_all_stack(bottom, top)
top 1516 gc/mark.c ptr_t top;
top 1519 gc/mark.c GC_push_all(bottom, top);
top 1521 gc/mark.c GC_push_all_eager(bottom, top);
top 460 gc/mark_rts.c void GC_push_conditional_with_exclusions(bottom, top, all)
top 462 gc/mark_rts.c ptr_t top;
top 468 gc/mark_rts.c while (bottom < top) {
top 470 gc/mark_rts.c if (0 == next || (excl_start = next -> e_start) >= top) {
top 471 gc/mark_rts.c GC_push_conditional(bottom, top, all);
top 690 gc/solaris_threads.c register ptr_t bottom, top;
top 693 gc/solaris_threads.c # define PUSH(bottom,top) \
top 695 gc/solaris_threads.c GC_push_selected((bottom), (top), GC_page_was_ever_dirty, \
top 698 gc/solaris_threads.c GC_push_all_stack((bottom), (top)); \
top 707 gc/solaris_threads.c top = p -> stack + p -> stack_size;
top 711 gc/solaris_threads.c top = GC_stackbottom;
top 713 gc/solaris_threads.c if ((word)sp > (word)bottom && (word)sp < (word)top) bottom = sp;
top 714 gc/solaris_threads.c PUSH(bottom, top);
top 724 gc/solaris_threads.c register ptr_t bottom, top;