/macosx-10.10.1/dcerpc-61/dcerpc/ncklib/ |
H A D | rpclist.h | 123 * rpc_list_t structure and manipulates the fields of it ("next" and 125 * remove it from the first list since the "next" and "last" fields 140 dce_pointer_t next; /* next element of list */ member in struct:__anon8050 238 list.next = NULL; \ 258 #define RPC_LIST_EMPTY(list) (list.next == NULL) 277 ((rpc_list_p_t) (insert_element))->next = \ 278 ((rpc_list_p_t) (list_element))->next; \ 280 if (((rpc_list_p_t) (list_element))->next == NULL) \ 286 ((rpc_list_p_t) (((rpc_list_p_t) (list_element))->next)) [all...] |
/macosx-10.10.1/postfix-255/postfix/src/oqmgr/ |
H A D | qmgr.h | 47 head.next->peers.prev = head.prev; \ 48 head.prev->peers.next = head.next; \ 49 head.next = object->peers.next; \ 50 if (object->peers.next) \ 51 head.next->peers.prev = 0; \ 53 object->peers.next = 0; \ 57 type next = object->peers.next; \ 98 QMGR_TRANSPORT *next; member in struct:QMGR_TRANSPORT_LIST 148 QMGR_QUEUE *next; member in struct:QMGR_QUEUE_LIST 191 QMGR_ENTRY *next; member in struct:QMGR_ENTRY_LIST [all...] |
/macosx-10.10.1/xnu-2782.1.97/bsd/net/ |
H A D | init.c | 37 struct init_list_entry *next; member in struct:init_list_entry 69 entry->next = list_head; 71 if (entry->next == LIST_RAN) { 76 } while(!OSCompareAndSwapPtr(entry->next, entry, &list_head)); 99 backward_head = current->next; 100 current->next = forward_head; 107 forward_head = current->next;
|
/macosx-10.10.1/bc-21/bc/dc/ |
H A D | array.c | 43 struct dc_array *next; member in struct:dc_array 67 cur = cur->next; 81 newentry->next = cur; 83 prev->next = newentry; 98 for (cur=dc_get_stacked_array(array_id); cur; cur=cur->next) 110 struct dc_array *next; member in struct:DC_DECLEND 112 for (cur=a_head; cur; cur=next) { 113 next = cur->next;
|
/macosx-10.10.1/ksh-23/ksh/src/lib/libast/misc/ |
H A D | setenviron.c | 47 static char** next; /* next free slot */ local 63 environ = next = p; 64 *++next = 0; 104 next = p; 107 else if (next == last) 113 next = last - INCREMENT; 131 next--; 143 p = next; 144 *++next [all...] |
/macosx-10.10.1/IOPCIFamily-239.1.2/ |
H A D | balloc.c | 29 vtd_baddr_t next; local 33 next = bf->bheads[idx].free.next; 34 while (next) 36 VTLOG("[%d]: 0x%x\n", idx, next); 37 vtd_space_nfault(bf, next, 1); 38 entry = bf->tables[0][next]; 40 next = entry.free.next; 49 vtd_baddr_t next; local 116 vtd_baddr_t next; local 182 vtd_baddr_t next; local [all...] |
/macosx-10.10.1/ksh-23/ksh/src/lib/libast/cdt/ |
H A D | dtwalk.c | 39 Void_t *obj, *next; local 46 next = dtnext(dt,obj); 49 obj = next;
|
/macosx-10.10.1/bash-94.1.2/bash-3.2/builtins/ |
H A D | bashgetopt.c | 83 loptend = lcurrent->next; 95 lcurrent = lcurrent->next; 100 loptend = lcurrent->next; 110 lcurrent = lcurrent->next; 111 /* If the specifier is `;', don't set optarg if the next 114 } else if (lcurrent->next && (*cp == ':' || lcurrent->next->word->word[0] != '-')) { 116 } else if (lcurrent->next && (*cp == ':' || NOTOPT(lcurrent->next->word->word))) { 118 lcurrent = lcurrent->next; [all...] |
/macosx-10.10.1/libxml2-26/libxml2/doc/examples/ |
H A D | xpath1.c | 151 xmlChar* next; local 162 next = nsListDup; 163 while(next != NULL) { 165 while((*next) == ' ') next++; 166 if((*next) == '\0') break; 169 prefix = next; 170 next = (xmlChar*)xmlStrchr(next, '='); 171 if(next [all...] |
/macosx-10.10.1/zsh-61/zsh/Src/ |
H A D | linklist.c | 39 * union; see zsh.h next prev dat (LinkNode) 51 * | |next| |next| |next| |next| 135 tmp = node->next; 136 node->next = new = (LinkNode) zhalloc(sizeof *tmp); 139 new->next = tmp; 153 tmp = node->next; 154 node->next 285 LinkNode node, next; local [all...] |
/macosx-10.10.1/llvmCore-3425.0.34/lib/Analysis/ |
H A D | PathProfileInfo.cpp | 126 for( BLEdgeIterator next = node->succBegin(), 127 end = node->succEnd(); next != end; next++ ) { 128 if( (*next)->getType() != BallLarusEdge::BACKEDGE && // no backedges 129 (*next)->getType() != BallLarusEdge::SPLITEDGE && // no split edges 130 (*next)->getWeight() <= pathNumber && // weight must be <= pathNumber 131 (!best || (best->getWeight() < (*next)->getWeight())) ) // best one? 132 best = *next; 144 BallLarusEdge* next = getNextEdge(currentNode, increment); local 146 increment -= next 183 BallLarusEdge* next = getNextEdge(currentNode, increment); local [all...] |
/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/asm/ |
H A D | Handler.java | 69 Handler next; field in class:Handler
|
/macosx-10.10.1/BerkeleyDB-21/db/test/scr018/ |
H A D | t.c | 21 goto next; 24 goto next; 28 goto next; 32 next: if (ch == '\n')
|
/macosx-10.10.1/WTF-7600.1.24/wtf/ |
H A D | UnionFind.h | 80 T* next = result->m_parent; local 81 while (next) { 82 result = next; 83 next = result->m_parent;
|
/macosx-10.10.1/apr-32/apr/apr/include/arch/netware/ |
H A D | apr_arch_dso.h | 31 sym_list *next; member in struct:sym_list
|
/macosx-10.10.1/ipsec-286.1.1/ipsec-tools/racoon/ |
H A D | throttle.h | 37 TAILQ_ENTRY(throttle_entry) next; member in struct:throttle_entry
|
/macosx-10.10.1/screen-22/screen/ |
H A D | sched.h | 27 struct event *next; member in struct:event
|
/macosx-10.10.1/shell_cmds-179/date/ |
H A D | vary.h | 31 struct vary *next; member in struct:vary
|
/macosx-10.10.1/tcl-105/tk/tk/generic/ |
H A D | tkFileFilter.h | 27 struct GlobPattern *next; /* Chains to the next glob pattern in a glob member in struct:GlobPattern 34 struct MacFileType *next; /* Chains to the next mac file type in a mac member in struct:MacFileType 40 struct FileFilterClause *next; member in struct:FileFilterClause 41 /* Chains to the next clause in a clause 50 struct FileFilter *next; /* Chains to the next filter in a filter member in struct:FileFilter
|
/macosx-10.10.1/tcl-105/tk84/tk/generic/ |
H A D | tkFileFilter.h | 31 struct GlobPattern * next; /* Chains to the next glob pattern member in struct:GlobPattern 39 struct MacFileType * next; /* Chains to the next mac file type member in struct:MacFileType 46 struct FileFilterClause * next; /* Chains to the next clause in member in struct:FileFilterClause 55 struct FileFilter * next; /* Chains to the next filter member in struct:FileFilter
|
/macosx-10.10.1/bash-94.1.2/bash-3.2/examples/loadables/ |
H A D | tee.c | 31 struct flist *next; member in struct:flist 83 tee_flist->next = (FLIST *)NULL; 87 for (rval = EXECUTION_SUCCESS; list; list = list->next) 97 fl->next = (FLIST *)xmalloc (sizeof(FLIST)); 98 fl->next->fd = fd; 99 fl->next->fname = list->word->word; 100 fl = fl->next; 101 fl->next = (FLIST *)NULL; 106 for (fl = tee_flist; fl; fl = fl->next) 126 tee_flist = tee_flist->next; /* ski [all...] |
/macosx-10.10.1/ksh-23/ksh/src/lib/libast/hash/ |
H A D | hashfree.c | 73 b = b->next; 111 for (; tp; tp = tp->next) 112 if (tp->next == tab) 114 tp->next = tab->next; 118 else if (!(tab->root->references = tp->next)) 122 for (; rp; rp = rp->next) 123 if (rp->next == tab->root) 125 rp->next = tab->root->next; [all...] |
/macosx-10.10.1/BerkeleyDB-21/db/java/src/com/sleepycat/persist/ |
H A D | ForwardCursor.java | 33 * Moves the cursor to the next value and returns it, or returns null 39 * @return the next value, or null if there are no more values in the 42 V next() method in interface:ForwardCursor 46 * Moves the cursor to the next value and returns it, or returns null 53 * @return the next value, or null if there are no more values in the 56 V next(LockMode lockMode) method in interface:ForwardCursor
|
/macosx-10.10.1/JavaScriptCore-7600.1.17/heap/ |
H A D | WeakSet.h | 84 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) { 99 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 105 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 111 for (WeakBlock* block = m_blocks.head(); block; block = block->next()) 117 WeakBlock* next; local 118 for (WeakBlock* block = m_blocks.head(); block; block = next) { 119 next = block->next();
|
/macosx-10.10.1/bind9-45.101/bind9/contrib/idn/idnkit-1.0-src/lib/tests/ |
H A D | setenv.c | 62 myenv_t *next; member in struct:myenv 83 for (mye = myenvs; mye != NULL; mye = mye->next) { 85 if (mye->next != NULL) 86 mye->next->prev = mye->prev; 88 mye->prev->next = mye->next; 89 if (mye->next == NULL && mye->prev == NULL) 125 mye->next = myenvs;
|