/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | module_read_1.f90 | 13 function pop(n) result(item) ! { dg-warning "not set" } 15 character(len=merge(1, 0, n > 0)) :: item local in function:pop 17 function push(n) result(item) ! { dg-warning "not set" } 19 character(len=merge(1, 0, n /= 0)) :: item local in function:push
|
H A D | finalize_16.f90 | 13 class(inner), allocatable :: item 17 class(outer), allocatable :: item 31 deallocate(var%v(1)%item%item)
|
H A D | unlimited_polymorphic_12.f90 | 11 class(*),allocatable :: item 18 subroutine list_move_alloc(self,item) 20 class(*),intent(inout),allocatable :: item 22 call move_alloc(item, self%item)
|
H A D | unlimited_polymorphic_21.f90 | 24 subroutine associate_pointer(this, item) 26 class(*), pointer :: item(:) 27 item => this%component
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.mike/ |
H A D | pmf2.C | 8 virtual void func2(int &item) { printf("func2(%d,) c=%d\n",item,c);} argument 13 typedef void (B_table::* B_ti_fn) (int &item); 15 virtual void call_fn_fn1(int &item, void *pfn1); 16 void func1(int &item) { printf("func1(%d)\n",item);} argument 17 virtual void func2(int &item) { printf("func2(%d) j=%d\n",item,j);} argument 25 virtual void func2(int &item) { printf("func2(%d) i=%d\n",item, argument 33 func2(int &item) argument 37 call_fn_fn1(int &item, void *pfn1) argument [all...] |
H A D | net1.C | 17 inline TBScrollBoxInfo item() { function
|
H A D | p1989.C | 10 T item; member in struct:link 14 link(const T& t): item(t), prev(0), next(0) 16 link(const T& t, link<T> *p, link<T> *n): item(t), prev(p), next(n) 27 void append(const T& item); 28 void prepend(const T& item); 29 void insert(const T& item, Pix x, bool before); 33 void remove(Pix& x, T& item); 56 { return ((link<T> *) x)->item; } 82 List_DL<T>::append(const T& item) argument 86 head = new link<T>(item); 96 prepend(const T& item) argument 111 insert(const T& item, Pix x, bool before = TRUE) argument 136 remove(Pix& x, T& item) argument 241 remove(const T& item) argument 274 add(const T& item) argument 276 remove(Pix& x, T& item) argument 306 add(const T& item) argument 308 remove(Pix& x, T& item) argument 334 T item; member in struct:vertex [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr54985.c | 11 ST *item = s; local 17 x = item->a; 23 item++;
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.other/ |
H A D | conv9.C | 15 void const* item; member in struct:Foo::Bar 25 bar(cp->key, cp->item); 29 bar(cp->key, (copyfn) ? (*copyfn)(0) : cp->item); 30 bar(cp->key, (copyfn) ? (*copyfn)(cp) : cp->item);
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/garbage/ |
H A D | tree.go | 48 item int 52 func bottomUpTree(item, depth int) *Node { 54 return &Node{item: item} 56 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 61 return n.item 63 return n.item + n.left.itemCheck() - n.right.itemCheck()
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | binary-tree.go | 47 item int 51 func bottomUpTree(item, depth int) *Node { 53 return &Node{item: item} 55 return &Node{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 60 return n.item 62 return n.item + n.left.itemCheck() - n.right.itemCheck()
|
H A D | binary-tree.c | 47 long item; member in struct:tn 51 treeNode* NewTreeNode(treeNode* left, treeNode* right, long item) argument 59 new->item = item; 68 return tree->item; 70 return tree->item + ItemCheck(tree->left) - ItemCheck(tree->right); 74 treeNode* BottomUpTree(long item, unsigned depth) argument 79 BottomUpTree(2 * item - 1, depth - 1), 80 BottomUpTree(2 * item, depth - 1), 81 item [all...] |
H A D | binary-tree-freelist.go | 47 item int 68 func (a *Arena) New(item int, left, right *Node) *Node { 78 n.item = item 84 func bottomUpTree(item, depth int) *Node { 86 return arena.New(item, nil, nil) 88 return arena.New(item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)) 93 return n.item [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | friend22.C | 8 template <class T> class item { class 15 item<const A> i;
|
H A D | overload14.C | 12 void push_back(param_value_type item) {} argument 13 void push_back(rvalue_type item) {} argument
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.law/ |
H A D | copy2.C | 26 String item[100]; member in struct:List
|
H A D | ctors20.C | 26 String item[100]; member in struct:List
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/ken/ |
H A D | rob1.go | 16 item Item 29 item := new(ListItem) 30 item.item = i 31 item.next = list.head 32 list.head = item 39 r += i.item.Print()
|
/haiku-buildtools/autoconf/lib/Autom4te/ |
H A D | ChannelDefs.pm | 69 =item C<fatal> 73 =item C<error> 77 =item C<error-gnu> 81 =item C<error-gnu/warn> 85 =item C<error-gnits> 89 =item C<automake> 93 =item C<cross> 97 =item C<gnu> 101 =item C<obsolete> 105 =item [all...] |
/haiku-buildtools/gcc/gcc/testsuite/objc.dg/ |
H A D | objc-foreach-5.m | 27 // for (id item in values) { 28 id item; 29 for (item in values) { 30 accumulator += [item integerValue];
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | pr10392-1.c | 37 char *item[] = { local 48 result = use(item[i]);
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/go1/ |
H A D | binarytree_test.go | 13 item int 17 func bottomUpTree(item, depth int) *binaryNode { 19 return &binaryNode{item: item} 21 return &binaryNode{item, bottomUpTree(2*item-1, depth-1), bottomUpTree(2*item, depth-1)} 26 return n.item 28 return n.item + n.left.itemCheck() - n.right.itemCheck()
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.brendan/ |
H A D | crash56.C | 24 { return v == x.item; } 26 { return v == x.item; } 28 { return v != x.item; } 30 { return v != x.item; } 32 { return x1.owner == x2.owner && x1.item == x2.item; } 34 { return x1.owner != x2.owner || x1.item != x2.item; } 42 link *item; member in class:ListDProto::Vix 67 void prepend(link *item); 114 T item; member in struct:ListD::link_item 160 prepend(const T& item) argument 167 append(const T& item) argument 253 add(const T& item) argument 275 remove(const T& item) argument [all...] |
/haiku-buildtools/legacy/gcc/gcc/f/ |
H A D | equiv.c | 86 ffebld item; 91 for (item = ffebld_head (list); item != NULL; item = ffebld_trail (item)) 95 expr = ffebld_head (item); 124 ffebld item; /* List of equivalences. */ 149 /* Find the symbol for the first valid item in the list of lists, use that 165 for (item = ffebld_head (list); 166 item ! 85 ffebld item; local 123 ffebld item; /* List of equivalences. */ local 854 ffebld item; local 970 ffebld item; local 1012 ffebld item; /* List of list of equivalences in a given local 1395 ffebld item; /* Current item in current list. */ local 1454 ffebld item; /* Current item in current list. */ local [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
H A D | 2371.C | 91 T item; member in struct:ListS_link 94 ListS_link(const T& i, ListS_link<T> *n = 0): item(i), next(n) 115 void prepend(const T& item); 116 void append(const T& item); 121 return head_link->item; } 124 return head_link->item; } 127 fill = head_link->item; } 135 return tail_link->item; } 138 return tail_link->item; } 141 fill = tail_link->item; } 253 prepend(const T& item) argument 267 append(const T& item) argument 403 add(const T& item) argument [all...] |