/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.jason/ |
H A D | crash3.C | 2 // Bug: g++ tries to generate initialization semantics for a Node from an int, 5 struct Node // { dg-message "note" } struct 7 Node* child[2]; 12 Node* q = new Node(i); // { dg-error "no matching" }
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/torture/ |
H A D | pr57478.c | 3 typedef struct Node Node; typedef in typeref:struct:Node 5 struct Node struct 7 Node *Pred, *Suc; 8 Node *SubBestPred; 9 Node *SubBestSuc; 13 foo (Node *N)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | pr22591.c | 9 } Node; typedef in typeref:struct:_Node 11 void __attribute__ ((noinline)) append (Node * q, Node * p) 20 swap (Node ** a, Node ** b) 22 Node *tmp = *a; 30 ListSwap (Node * x, Node * y) 32 Node *tmp; 45 Node [all...] |
/haiku-buildtools/gcc/libsanitizer/sanitizer_common/ |
H A D | sanitizer_stackdepotbase.h | 21 template <class Node, int kReservedBits, int kTabSizeLog> 24 typedef typename Node::args_type args_type; 25 typedef typename Node::handle_type handle_type; 37 static Node *find(Node *s, args_type args, u32 hash); 38 static Node *lock(atomic_uintptr_t *p); 39 static void unlock(atomic_uintptr_t *p, Node *s); 49 atomic_uintptr_t tab[kTabSize]; // Hash table of Node's. 57 template <class Node, int kReservedBits, int kTabSizeLog> 58 Node *StackDepotBas [all...] |
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/template/ |
H A D | init6.C | 13 class Node; 19 Iter<typename Graph<T>::Node*> *get(); 24 Iter<typename Graph<T>::Node*> *Graph<T>::Inner::get() { 25 SubIter<typename Graph<T>::Node*> *iter; 30 Iter<Graph<int>::Node*> *n2_iter = new SubIter<Graph<int>::Node*>();
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/warn/ |
H A D | Wstrict-aliasing-bogus-escape-3.C | 6 struct Node : Node_base struct in inherits:Node_base 19 int back() { return static_cast<Node*>(prev)->data; }
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.law/ |
H A D | cvt17.C | 13 class Node { public: Point Location(){ Point p; return p; } }; class 17 Node** node1;
|
/haiku-buildtools/gcc/liboffloadmic/runtime/ |
H A D | offload_table.h | 48 struct Node { struct in class:TableList 50 Node* prev; 51 Node* next; 55 explicit TableList(Node *node = 0) : m_head(node) {} 57 void add_table(Node *node) { 69 void remove_table(Node *node) { 86 Node* m_head; 114 explicit FuncList(Node *node = 0) : TableList<Table>(node), 119 void add_table(Node *node) { 190 explicit Iterator(Node *nod [all...] |
H A D | offload_table.cpp | 105 static FuncList::Node predefined_table = { 129 for (Node *n = m_head; n != 0; n = n->next) { 151 for (Node *n = m_head; n != 0; n = n->next) { 173 for (Node *n = m_head; n != 0; n = n->next) { 207 for (Node *n = m_head; n != 0; n = n->next) { 226 for (Node *n = m_head; n != 0; n = n->next) { 251 for (Node *n = m_head; n != 0; n = n->next) { 271 for (Node *n = m_head; n != 0; n = n->next) { 301 FuncList::Node *entry_table, 302 FuncList::Node *func_tabl [all...] |
H A D | ofldbegin.cpp | 79 static FuncList::Node __offload_entry_node = { 92 static FuncList::Node __offload_func_node = { 105 static VarList::Node __offload_var_node = {
|
/haiku-buildtools/gcc/gcc/ada/ |
H A D | nlists.h | 60 /* Node List Access Functions */ 87 Next (Node_Id Node) argument 89 return Next_Node_Ptr[Node - First_Node_Id]; 98 Prev (Node_Id Node) argument 100 return Prev_Node_Ptr[Node - First_Node_Id]; 125 Is_List_Member (Node_Id Node) argument 127 return Nodes_Ptr[Node - First_Node_Id].U.K.in_list; 131 List_Containing (Node_Id Node) argument 133 return Nodes_Ptr[Node - First_Node_Id].V.NX.link;
|
H A D | elists.h | 58 static Node_Id Node (Elmt_Id); 65 Node (Elmt_Id Elmt) function 83 Next_Elmt (Elmt_Id Node) argument 85 Int N = Elmts_Ptr[Node - First_Elmt_Id].next;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/ |
H A D | pr37828.c | 5 struct foo **Node; member in struct:foo 13 cd->Node[i] = Finite[first+i];
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/garbage/ |
H A D | tree.go | 47 type Node struct { type 49 left, right *Node 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)} 59 func (n *Node) itemCheck() int {
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/bench/shootout/ |
H A D | binary-tree.go | 46 type Node struct { type 48 left, right *Node 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)} 58 func (n *Node) itemCheck() int {
|
H A D | binary-tree-freelist.go | 46 type Node struct { type 48 left, right *Node 52 head *Node 57 func (n *Node) free() { 68 func (a *Arena) New(item int, left, right *Node) *Node { 70 nodes := make([]Node, 3<<uint(*n)) 84 func bottomUpTree(item, depth int) *Node { 91 func (n *Node) itemCheck() int {
|
/haiku-buildtools/jam/ |
H A D | StatCacheServerImpl.h | 11 #include <Node.h> 16 class Node; 84 void SetNode(Node *node); 85 Node *GetNode() const; 101 Node *fNode; 106 // Node 107 class Node : public Referencable { class in inherits:Referencable 109 Node(const struct stat &st); 110 virtual ~Node(); 136 class Directory : public Node { [all...] |
H A D | StatCacheServer.cpp | 141 Entry::SetNode(Node *node) 156 Node * 229 Node::Node(const struct stat &st) function in class:Node 238 Node::~Node() 248 Node::SetTo(Entry *entry) 263 Node::GetPath(string& path) 277 Node::GetStat() const 284 Node [all...] |
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/bin_search_tree_/ |
H A D | node_iterators.hpp | 51 bin_search_tree_const_node_it_<Node, Const_Iterator, Iterator, _Alloc> 54 template<typename Node, 63 Node>::other::pointer 83 typedef typename Node::metadata_type metadata_type; 129 bin_search_tree_node_it_<Node, Const_Iterator, Iterator, _Alloc> 131 /// Node iterator. 132 template<typename Node, 142 Node>::other::pointer
|
H A D | traits.hpp | 61 class Node, 69 typedef Node node; 127 Node, 135 Node, 167 class Node, 170 bin_search_tree_traits<Key, null_type, Cmp_Fn, Node_Update, Node, _Alloc> 176 typedef Node node; 212 Node,
|
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
H A D | point_const_iterator.hpp | 54 template<typename Node, typename _Alloc> 57 left_child_next_sibling_heap_node_point_const_iterator_<Node, _Alloc> 60 template<typename Node, typename _Alloc> 64 typedef typename _Alloc::template rebind<Node>::other::pointer node_pointer; 74 typedef typename Node::value_type value_type;
|
H A D | const_iterator.hpp | 53 left_child_next_sibling_heap_const_iterator_<Node, _Alloc> 56 left_child_next_sibling_heap_node_point_const_iterator_<Node, _Alloc> 59 template<typename Node, typename _Alloc>
|
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/fixedbugs/issue5125.dir/ |
H A D | bug.go | 7 type Node interface { type 12 node Node
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr51959.C | 39 struct Node { struct in class:QList 51 void node_construct(Node *n, const T &t); 52 void node_destruct(Node *n); 54 template <typename T> inline void QList<T>::node_construct(Node *n, const T &t) { 58 template <typename T> inline void QList<T>::node_destruct(Node *n) { 69 Node *n, copy; 71 try { n = reinterpret_cast<Node *>(p.append());; }
|
H A D | pr42773.C | 18 typedef QValueListNode<T> Node; typedef in class:QValueListPrivate 28 node = new Node;
|