Searched refs:tail (Results 76 - 100 of 124) sorted by relevance

12345

/haiku-fatelf/src/bin/gdb/gdb/
H A Dsymtab.c207 /* Now, search for a matching tail (only if name doesn't have any dirs) */
300 /* Now, search for a matching tail (only if name doesn't have any dirs) */
2873 struct symbol_search *tail;
2885 tail = NULL;
3034 struct symbol_search *prevtail = tail;
3057 if (tail == NULL)
3060 tail->next = psr;
3061 tail = psr;
3072 tail = sort_search_symbols (&dummy, nfound);
3078 tail
2865 struct symbol_search *tail; local
3738 const char *tail = lbasename (srcfile); local
[all...]
/haiku-fatelf/src/bin/gdb/gdb/gdbserver/
H A Dlinux-low.c498 if (all_threads.head == all_threads.tail)
703 if (all_threads.head == all_threads.tail)
711 all_processes.head = all_processes.tail = NULL;
720 all_processes.head = all_processes.tail = NULL;
H A Dconfigure1945 rm -f conftest.tail
1959 sed 1,${ac_max_here_lines}d conftest.vals > conftest.tail
1961 mv conftest.tail conftest.vals
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Drunlist.c254 /* Move the tail of @dst out of the way, then copy in @src. */
341 /* Move the tail of @dst out of the way, then copy in @src. */
391 int tail; /* Start of tail of @dst */ local
428 * tail - Offset of the tail of @dst
429 * Nominally: @tail = @loc + 1 (location, skipping the replaced run)
432 tail = loc + right + 1;
441 /* Move the tail of @dst out of the way, then copy in @src. */
442 ntfs_rl_mm(dst, marker, tail, dsiz
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dfts.c1224 FTSENT *cur, *tail; local
1360 for (head = tail = NULL, nitems = 0; dirp && (dp = readdir(dirp));) {
1469 head = tail = p;
1471 tail->fts_link = p;
1472 tail = p;
/haiku-fatelf/src/bin/network/wget/src/
H A Dutils.c979 match_tail (const char *string, const char *tail, bool fold_case)
988 for (i = strlen (string), j = strlen (tail); i >= 0 && j >= 0; i--, j--)
989 if (string[i] != tail[j])
994 for (i = strlen (string), j = strlen (tail); i >= 0 && j >= 0; i--, j--)
995 if (c_tolower (string[i]) != c_tolower (tail[j]))
999 /* If the tail was exhausted, the match was succesful. */
973 match_tail(const char *string, const char *tail, bool fold_case) argument
/haiku-fatelf/src/bin/gdb/bfd/
H A Dmmo.c335 mmo_data_list_type *tail; member in struct:mmo_section_data_struct
1182 if (mmo_section_data (sec)->tail != NULL)
1183 mmo_section_data (sec)->tail->next = loc;
1186 mmo_section_data (sec)->tail = loc;
1580 if (sdatap->tail != NULL && entry->where >= sdatap->tail->where)
1582 sdatap->tail->next = entry;
1584 sdatap->tail = entry;
1597 sdatap->tail = entry;
H A Delf32-hppa.c2397 asection *tail = *list; local
2398 if (tail == bfd_abs_section_ptr)
2400 while (tail != NULL)
2407 curr = tail;
2408 total = tail->size;
2418 section. (or the tail section is itself larger than
2431 prev = PREV_SEC (tail);
2433 htab->stub_group[tail->id].link_sec = curr;
2435 while (tail != curr && (tail
[all...]
H A Dcoff-ppc.c846 extern struct list_ele *tail;
873 tail = t;
877 tail->next = t;
878 tail = t;
1613 struct list_ele *tail;
1606 struct list_ele *tail; variable in typeref:struct:list_ele
H A Delf64-ppc.c7871 asection *tail = *list;
7872 while (tail != NULL)
7880 curr = tail;
7881 total = tail->size;
7883 curr_toc = htab->stub_group[tail->id].toc_off;
7893 section. (or the tail section is itself larger than
7903 prev = PREV_SEC (tail);
7905 htab->stub_group[tail->id].link_sec = curr;
7907 while (tail != curr && (tail
7867 asection *tail = *list; local
[all...]
/haiku-fatelf/src/bin/bash/
H A Dexecute_cmd.c1459 struct cpelement *tail; member in struct:cplist
1509 coproc_list.head = coproc_list.tail = cpe;
1514 coproc_list.tail->next = cpe;
1515 coproc_list.tail = cpe;
1545 else if (p == coproc_list.tail)
1546 coproc_list.tail = prev;
1550 coproc_list.head = coproc_list.tail = 0;
1552 coproc_list.tail = coproc_list.head; /* just to make sure */
1570 else if (p == coproc_list.tail)
1571 coproc_list.tail
[all...]
/haiku-fatelf/src/libs/print/libgutenprint/test/
H A Dpixma_parse.h237 rasterline_t* tail; /* start of linked list */ member in struct:color_s
H A Dpixma_parse.c171 if(!color->tail)
172 color->head = color->tail = color->pos = calloc(1,sizeof(rasterline_t));
715 rasterline_t** r=&img->color[i].tail;
/haiku-fatelf/src/bin/rcs/
H A Drcs.c1136 branchpoint(strt, tail)
1137 struct hshentry *strt, *tail;
1138 /* Function: check whether the deltas between strt and tail */
1147 for (pt = strt; pt != tail; pt = pt->next) {
/haiku-fatelf/src/libs/print/libgutenprint/src/ghost/
H A Dijsgutenprint.c258 char *tail; local
273 *pw = strtod (buf, &tail);
274 if (tail == buf)
282 *ph = strtod (buf, &tail);
283 if (tail == buf)
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/fs_shell/
H A Dkernel.c71 vnode *tail; member in struct:vnlist
503 lists[FREE_LIST].tail = &vns[vnnum-1];
506 lists[USED_LIST].tail = NULL;
509 lists[LOCKED_LIST].tail = NULL;
556 ns->vnodes.head = ns->vnodes.tail = NULL;
1706 ns->vnodes.head = ns->vnodes.tail = NULL;
2736 vn->ns->vnodes.tail = vn->nspace.prev;
2759 vn->ns->vnodes.tail = vn;
2774 lists[(int)vn->inlist].tail = vn->list.prev;
2778 vn->list.prev = lists[list].tail;
[all...]
/haiku-fatelf/src/system/kernel/
H A Dthread.cpp2340 /*! Insert a thread to the tail of a queue */
2347 queue->tail = thread;
2349 queue->tail->queue_next = thread;
2350 queue->tail = thread;
2369 if (queue->tail == thread)
2370 queue->tail = NULL;
2390 if (q->tail == thread)
2391 q->tail = last;
/haiku-fatelf/headers/private/graphics/radeon/
H A Dradeon_interface.h456 uint32 tail, tail_mask; // next write position in dwords; mask for wrap-arounds member in struct:__anon910::__anon911
/haiku-fatelf/src/add-ons/translators/jpeg2000/libjasper/
H A Djpc_t2dec.c348 jpc_seglist_insert(&cblk->segs, cblk->segs.tail, seg);
/haiku-fatelf/src/add-ons/kernel/drivers/graphics/radeon/
H A DCP_setup.c270 si->cp.ring.tail = cur_read_ptr;
366 cp->ring.tail = 0;
/haiku-fatelf/src/bin/network/tcpdump/libpcap/msdos/
H A Dpkt_rx0.asm92 ; This macro return ES:DI to tail of Rx queue
/haiku-fatelf/src/add-ons/media/plugins/matroska/libMatroskaParser/
H A DMatroskaParser.c128 struct QueueEntry *tail; member in struct:Queue
454 if (q->tail)
455 q->tail->next = qe;
457 q->tail = qe;
469 if (q->tail == qe)
470 q->tail = NULL;
2305 q->tail = NULL;
/haiku-fatelf/src/bin/makeudfimage/
H A DUdfBuilder.cpp990 uint32 tail = _OutputFile().Position() % _BlockSize(); local
991 if (tail > 0) {
992 uint32 padding = _BlockSize() - tail;
/haiku-fatelf/headers/private/kernel/
H A Dthread_types.h783 Thread* tail; member in struct:thread_queue
/haiku-fatelf/src/bin/coreutils/
H A Dbootstrap298 lp=$(printf "$p1\n$p2\n" | LANG=C sort -n | tail -n1)

Completed in 512 milliseconds

12345