Searched refs:next (Results 1 - 25 of 1688) sorted by relevance

1234567891011>>

/haiku-buildtools/legacy/gcc/libio/dbz/
H A Drandom.c4 static unsigned long next = 1; variable
18 next = next * 1103515245 + 12345;
19 temp = (int)((next/65536)%32768);
30 next = (unsigned long)n;
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/lookup/
H A Dusing24.C4 struct A { int next; }; member in struct:A
5 struct B { int next; }; member in struct:B
6 struct C : B { using B::next; };
10 using C::next;
11 void f() { next = 1; }
H A Dusing26.C6 double next; member in struct:A
12 int next; // { dg-error "private" } member in struct:B
17 int next; member in struct:C
22 using B::next;
25 next = 12;
H A Dusing25.C6 int next; member in struct:A
11 int next; member in struct:B
16 using A::next;
19 void foo(C& c) { c.next = 42; }
25 c.B::next = 12;
26 if (c.next != 42 || c.A::next != 42 || c.B::next != 12)
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A Dpr41442.c7 link* next; member in struct:LINK
12 if ((p1->next && !p2->next) || p2->next)
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A Dpr25514.c2 struct node *next; member in struct:node
11 struct node *node, *next; local
14 next = node->next;
16 current_node = next;
19 node = global_list.next;
21 global_list.next = node->next;
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A Dpr31448-2.c8 st *next; variable
11 st *next = 0; local
15 next->iIndex = constreg[nIndx];
22 next->iIndex = constreg[nIndx];
23 next->iIndex1 = constreg[nIndx];
28 next = &a;
30 if (next->iIndex != 0xFFFEFEFE)
32 if (next->iIndex1 != 0xFFFEFEFE)
H A Dpr31448.c9 st *next; variable
12 st *next = 0; local
16 next->iIndex = constreg[nIndx];
23 next->iIndex = constreg[nIndx];
24 next->iIndex1 = constreg[nIndx];
29 next = &a;
31 if (next->iIndex != 0xFFFEFEFE)
33 if (next->iIndex1 != 0xFFFEFEFE)
H A D20000801-2.c7 struct foo *next; member in struct:foo
15 node = node->next;
34 a.next = &b;
35 b.next = (struct foo *)0;
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/
H A Dpr54240.c15 S *next; local
19 next = this->l;
21 next = this->r;
23 return next->v;
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/mips/
H A Dpr54240.c16 S *next; local
20 next = this->l;
22 next = this->r;
24 return next->v;
H A Dpr62030-octeon.c8 struct node *next; member in struct:node
33 struct node *next = n->next; local
36 h->first = next;
38 n->prev->next = next;
40 n->next = h->first;
41 return n->next == &node;
/haiku-buildtools/gcc/gcc/testsuite/obj-c++.dg/property/
H A Ddotsyntax-6.mm20 MyRootClass *next;
23 @property (assign) MyRootClass *next;
35 @synthesize next;
75 object.same.next = object;
76 if (object.same.next != object)
80 if (object.next.next.same.same.next.next.same != object)
84 MyRootClass.sharedInstance.next
[all...]
/haiku-buildtools/gcc/gcc/testsuite/objc.dg/property/
H A Ddotsyntax-6.m20 MyRootClass *next;
23 @property (assign) MyRootClass *next;
35 @synthesize next;
75 object.same.next = object;
76 if (object.same.next != object)
80 if (object.next.next.same.same.next.next.same != object)
84 MyRootClass.sharedInstance.next
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Duninit-1-O0.c8 struct list *next; member in struct:list
18 for (p = el; p; p = p->next)
20 for (q = el; q != p; q = q->next)
23 r->next = p->next;
H A Duninit-1.c8 struct list *next; member in struct:list
18 for (p = el; p; p = p->next)
20 for (q = el; q != p; q = q->next)
23 r->next = p->next;
H A Dpr62030.c8 struct node *next; member in struct:node
33 struct node *next = n->next; local
36 h->first = next;
38 n->prev->next = next;
40 n->next = h->first;
41 return n->next == &node;
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Dpr23095.f8 integer ix, n, next local in function:foo
11 assign 20 to next
13 go to next,(10, 30)
14 10 assign 40 to next
19 40 go to next,(10, 30)
/haiku-buildtools/legacy/gcc/gcc/f/
H A Dstt.c85 new->next = list->previous->next;
87 new->next->previous = new;
88 new->previous->next = new;
110 new->next = new->previous = new;
129 ffesttCaseList next;
131 for (next = list->next; next != list; next
128 ffesttCaseList next; local
160 ffesttCaseList next; local
214 ffesttDimList next; local
452 ffesttDimList next; local
477 ffesttDimList next; local
498 ffesttDimList next; local
603 ffesttExprList next; local
625 ffesttExprList next; local
650 ffesttExprList next; local
712 ffesttFormatList next; local
842 ffesttImpList next; local
864 ffesttImpList next; local
892 ffesttImpList next; local
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/
H A Dpr61964.c5 struct node { struct node *next, *prev; } node; member in struct:node
20 h->first = n->next;
22 n->prev->next = n->next;
24 n->next = h->first;
25 return n->next == &node;
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/lto/
H A D20100720-2_0.c10 list next; member in struct:list_node
17 return lst->next;
H A D20100720-3_0.c8 struct list_node *next; member in struct:link
18 lst->lnk.next = 0;
H A D20100720-3_1.c6 struct list_node *next; member in struct:link
16 lst->lnk.next = 0;
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tm/
H A Dreg-promotion.c10 struct obj *next; member in struct:obj
17 for (p = q; p; p = p->next)
/haiku-buildtools/gcc/libstdc++-v3/testsuite/24_iterators/operations/
H A D40497.cc25 template<class T> void next(T) { } function in namespace:X
39 next(c);

Completed in 114 milliseconds

1234567891011>>