Searched refs:top (Results 1 - 25 of 359) sorted by relevance

1234567891011>>

/haiku-buildtools/gcc/gcc/testsuite/g++.dg/ipa/
H A Dpr60600.C9 struct top { struct
13 struct intermediate: top {
17 struct child1: top {
26 void test(top& t)
H A Dpr61540.C8 struct top { struct
12 struct intermediate: top {
16 struct child1: top {
25 void test(top& t)
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/parse/
H A Derror28.C8 struct top : public der { struct in inherits:der
9 top () {} // { dg-bogus "der\\(const" } function in struct:top
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.law/
H A Doperators33.C20 struct fcell *top; member in class:FStack
21 FStack() { top = NULL ; }
25 tmp->next = top;
26 top = tmp ;
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A D20000819-1.c5 int *p, *top; local
7 top = sp; sp -= cnt;
9 for(p = sp; p <= top; p++)
H A Dpr63209.c12 __attribute__((noinline)) unsigned Predictor(unsigned left, const unsigned* const top) { argument
13 const unsigned pred = Select(top[1], left, top[0]);
18 const unsigned top[2] = {0xff7a7a7a, 0xff7a7a7a}; local
20 const unsigned pred = Predictor(left, top /*+ 1*/);
H A D20020418-1.c10 top:
13 goto top;
H A D20020402-3.c38 register int bot, top, half; local
45 top = bl->nblocks;
47 while (top - bot > 1)
49 half = (top - bot + 1) >> 1;
54 top = bot + half;
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/
H A Dpr64378.C7 struct top { struct
11 struct child1: top {
18 void test(top *t)
/haiku-buildtools/gcc/libgcc/config/arc/gmon/
H A Dmcount.c66 register struct tostruct *top, *prevtop; local
135 top = &p->tos[toindex];
136 top->selfpc = selfpc;
137 top->count = 1;
138 top->link = 0;
141 top = &p->tos[toindex];
142 if (top->selfpc == selfpc) {
146 top->count++;
151 * top points to what we are looking at,
152 * prevtop points to previous top
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/pairing_heap_/
H A Dfind_fn_imps.hpp44 top() const function in class:PB_DS_CLASS_C_DEC
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/thin_heap_/
H A Dfind_fn_imps.hpp44 top() const function in class:PB_DS_CLASS_C_DEC
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D20030410-1.c8 int top; member in struct:_zend_ptr_stack
26 executor_globals.argument_stack.top -= 2;
H A DPYRBUG.c9 int top, left, bottom, right; member in struct:__anon1143
15 return pt.v >= r->top && pt.v < r->bottom
/haiku-buildtools/gcc/libstdc++-v3/testsuite/ext/pb_ds/example/
H A Dpriority_queue_erase_if.cc58 assert(p.top() == 999);
65 assert(p.top() == 500);
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/
H A Dvisibility6.C13 class top : public middle class in inherits:middle
H A Dnest15.C22 Page *top; member in struct:BDDHeap::Half::__anon1205
35 page(heap.half[heap.halfspace].inuse.top),
H A Dnest16.C22 Page *top; member in struct:BDDHeap::Half::__anon1206
38 Page *x = heap.half[heap.halfspace].inuse.top;
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpragma-ms_struct.c14 #pragma ms_struct on top of spaghetti /* { dg-warning "junk" } */
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/stack/members/
H A D7158.cc32 st.top() = 42;
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/priority_queue/
H A Dmoveable.cc36 VERIFY( b.size() == 1 && b.top() == 1 && a.size() == 0 );
39 VERIFY( c.size() == 1 && c.top() == 1 );
/haiku-buildtools/legacy/gcc/gcc/config/i386/
H A Dgmon-sol2.c259 register struct tostruct *top; local
316 top = &tos[toindex];
317 top->selfpc = selfpc;
318 top->count = 1;
319 top->link = 0;
322 top = &tos[toindex];
323 if (top->selfpc == selfpc) {
327 top->count++;
332 * top points to what we are looking at,
333 * prevtop points to previous top
[all...]
/haiku-buildtools/legacy/gcc/gcc/config/sparc/
H A Dgmon-sol2.c285 register struct tostruct *top; local
334 top = &tos[toindex];
335 top->selfpc = selfpc;
336 top->count = 1;
337 top->link = 0;
340 top = &tos[toindex];
341 if (top->selfpc == selfpc) {
345 top->count++;
350 * top points to what we are looking at,
351 * prevtop points to previous top
[all...]
/haiku-buildtools/legacy/gcc/gcc/
H A Dgmon.c195 register struct tostruct *top; local
239 top = &tos[toindex];
240 top->selfpc = selfpc;
241 top->count = 1;
242 top->link = 0;
245 top = &tos[toindex];
246 if (top->selfpc == selfpc) {
250 top->count++;
255 * top points to what we are looking at,
256 * prevtop points to previous top
[all...]
/haiku-buildtools/gcc/libgcc/config/sol2/
H A Dgmon.c311 struct tostruct *top; local
362 top = &tos[toindex];
363 top->selfpc = selfpc;
364 top->count = 1;
365 top->link = 0;
368 top = &tos[toindex];
369 if (top->selfpc == selfpc) {
371 top->count++;
375 looking at, prevtop points to previous top. We know it is not at the
378 if (top
[all...]

Completed in 225 milliseconds

1234567891011>>