/haiku-fatelf/src/system/kernel/fs/ |
H A D | rootfs.cpp | 243 struct rootfs_vnode* last = NULL; local 245 last = node; 248 if (last == NULL) { 254 vnode->dir_next = last->dir_next; 255 last->dir_next = vnode;
|
/haiku-fatelf/src/bin/bash/ |
H A D | jobs.c | 204 /* Pid of the last asynchronous child. */ 505 /* Scan from the last slot backward, looking for the next free one. */ 1138 /* Take the last job and make it the first job. Must be called with 1497 PROCESS *first, *last, *show; local 1504 first = last = p; 1505 while (last->next != first) 1506 last = last->next; 1520 show = format ? p : last; 1559 if (p == last [all...] |
/haiku-fatelf/src/tools/docbook/libxml2/ |
H A D | SAX2.c | 1090 * Do the last stage of the attribute normalization 1269 ret->last = tmp; 1274 ret->last = ret->children; 1303 * Do the last stage of the attribute normalization 1919 /* link at the end to preserv order, TODO speed up with a last */ 1955 ret->last = tmp; 1968 ret->last = tmp; 1977 ret->last = tmp; 2125 xmlNsPtr last = NULL, ns; local 2197 if (last [all...] |
H A D | valid.c | 1569 if (dtd->last == NULL) { 1570 dtd->children = dtd->last = (xmlNodePtr) ret; 1572 dtd->last->next = (xmlNodePtr) ret; 1573 ret->prev = dtd->last; 1574 dtd->last = (xmlNodePtr) ret; 2159 if (dtd->last == NULL) { 2160 dtd->children = dtd->last = (xmlNodePtr) ret; 2162 dtd->last->next = (xmlNodePtr) ret; 2163 ret->prev = dtd->last; 2164 dtd->last 5137 xmlNodePtr repl = NULL, last = NULL, tmp; local [all...] |
/haiku-fatelf/src/system/kernel/ |
H A D | thread.cpp | 618 Thread *temp, *last = NULL; local 622 if (last == NULL) 625 last->team_next = temp->team_next; 630 last = temp; 2177 // we probably own the semaphore here, and we're the last to do so 2223 // enqueue in the undertaker list and reschedule for the last time 2380 Thread *last = NULL; 2385 if (last == NULL) 2388 last->queue_next = thread->queue_next; 2391 q->tail = last; [all...] |
H A D | sem.cpp | 143 thread_id last = -1; local 151 else if (!strcmp(argv[1], "last")) 152 last = strtoul(argv[2], NULL, 0); 156 kprintf("%-*s id count team last name\n", B_PRINTF_POINTER_WIDTH, 162 || (last != -1 && sem->u.used.last_acquirer != last) 202 kprintf("last acquired by: %" B_PRId32 ", count: %" B_PRId32 "\n", 204 kprintf("last released by: %" B_PRId32 ", count: %" B_PRId32 "\n", 212 kprintf("last acquired by: %" B_PRId32 "\n", sem->u.used.last_acquirer); 450 " | (\"last\" <las [all...] |
/haiku-fatelf/src/add-ons/kernel/file_systems/packagefs/ |
H A D | Volume.cpp | 570 // create the last modified index 1349 // If this is the last package node of the node, remove it completely. 1922 NodeListener* last = listener->PreviousNodeListener(); local 1929 if (listener == last) 1948 NodeListener* last = listener->PreviousNodeListener(); local 1955 if (listener == last) 1975 NodeListener* last = listener->PreviousNodeListener(); local 1982 if (listener == last)
|
/haiku-fatelf/src/bin/gdb/bfd/ |
H A D | archive.c | 199 got the last one. 1116 const char *last; 1120 last = first + 1; 1125 last = first; 1134 copy = bfd_alloc (abfd, last - first + 1); 1138 memcpy (copy, first, last - first); 1139 copy[last - first] = 0; 2025 /* Flush writes, get last-write timestamp from file, and compare it 1111 const char *last; local
|
/haiku-fatelf/src/tools/rman/ |
H A D | rman.c | 50 enum tagtype { NOTAG, TITLE, ITALICS, BOLD, SYMBOL, SMALLCAPS, BOLDITALICS, MONO, MANREF }; /* MANREF last */ 51 struct { enum tagtype type; int first; int last; } tags[MAXTAGS], tagtmp; member in struct:__anon6126 193 enum { NAME, SYNOPSIS, DESCRIPTION, SEEALSO, FILES, AUTHOR, RANDOM/*last!*/ }; 383 tagadd(int /*enum tagtype--abused in source parsing*/ type, int first, int last) { argument 389 tags[tagc].last = last; 1431 tags[0].last = linelen; 2563 iscnt--; /* leave last space for tail portion of loop */ 2689 while (tagc>0 && tags[tagc-1].last>hl2) tagc--; 2716 if (tagc && tags[0].first==0 && tags[tagc-1].last [all...] |
/haiku-fatelf/src/bin/findutils/find/ |
H A D | defs.h | 424 void parse_begin_user_args PARAMS((char **args, int argno, const struct predicate *last, const struct predicate *predicates)); 425 void parse_end_user_args PARAMS((char **args, int argno, const struct predicate *last, const struct predicate *predicates));
|
/haiku-fatelf/src/bin/sharutils/src/ |
H A D | remsync | 104 last; 171 last if /^q(uit)?$/; 1642 last; 2170 last PROCESS_LOOP;
|
H A D | remsync.in | 104 last; 171 last if /^q(uit)?$/; 1642 last; 2170 last PROCESS_LOOP;
|
/haiku-fatelf/src/libs/iconv/ |
H A D | loop_unicode.h | 74 unsigned short last = variant & 0x8000; local 102 if (last)
|
/haiku-fatelf/src/system/boot/loader/ |
H A D | vfs.cpp | 463 Node *device = NULL, *last = NULL; local 477 device = last; 481 last = device;
|
/haiku-fatelf/src/apps/terminal/ |
H A D | BasicTerminalBuffer.h | 175 void _ClearLines(int32 first, int32 last); 204 int32 fScrollBottom; // last line to scroll (incl.)
|
/haiku-fatelf/src/bin/gdb/readline/ |
H A D | display.c | 139 /* The last left edge of text that was displayed. This is used when 171 /* The index of the last invisible character in the prompt string. */ 174 /* The length (buffer offset) of the first line of the last (possibly 188 index of the last invisible character in the returned string. NIFLP, 205 int l, rl, last, ignoring, ninvis, invfl; local 221 for (rl = ignoring = last = ninvis = 0, p = pmt; p && *p; p++) 233 last = r - ret - 1; 255 *lip = last; 277 * local_prompt = expanded last line of string in rl_display_prompt 279 * local_prompt_prefix = portion before last newlin [all...] |
/haiku-fatelf/src/libs/ncurses/progs/ |
H A D | infocmp.c | 1025 const size_t last = SIZEOF(tbl); local 1026 const size_t left = (last - first + 1) / 2 + first; 1030 size_t m = (n < first) ? last : n + left - first; 1031 if (m < last)
|
/haiku-fatelf/src/libs/print/libgutenprint/src/gutenprintui2/ |
H A D | curve.c | 535 c->last = y; 632 y2 = c->last; 638 y1 = c->last; 655 c->last = y;
|
/haiku-fatelf/src/system/kernel/arch/m68k/ |
H A D | arch_vm_translation_map_impl.cpp | 299 // we're about to release it for the last time 313 vm_translation_map *last = NULL; local 326 if (last != NULL) 327 last->next = entry->next; 333 last = entry;
|
/haiku-fatelf/src/system/kernel/cache/ |
H A D | file_cache.cpp | 554 // get the last page in the I/O vectors 555 generic_addr_t last = vecs[vecCount - 1].base local 560 vm_memset_physical(last + lastPageOffset, 0, 564 // need to fetch the last page before we can update it 565 generic_io_vec readVec = { last, B_PAGE_SIZE }; 577 vm_memset_physical(last + bytesRead, 0, 736 // the "last*" variables always point to the end of the last 849 // we've read the last page, so we're done! 881 // fill the last remainin [all...] |
/haiku-fatelf/src/kits/interface/ |
H A D | ListView.cpp | 711 // No need to adapt selection, as this item is the last in the list 1426 // make sure index is behind last valid index 1483 // keep track of first and last selected item 1688 int32 last = max_c(a, b); local 1690 if (first < fFirstSelected || last > fLastSelected) 1691 _RescanSelection(min_c(first, fFirstSelected), max_c(last, fLastSelected)); 1704 _RecalcItemTops(first, last);
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/ipro1000/dev/e1000/ |
H A D | if_em.c | 179 /* required last entry */ 1815 int nsegs, i, j, first, last = 0; local 2031 ** If this is the last descriptor, we want to 2053 last = i; 2062 last = i; 2077 ** Here we swap the map so the last descriptor, 2098 tx_buffer->next_eop = last; 3814 int first, last, done, processed; local 3844 last = tx_buffer->next_eop; 3845 eop_desc = &txr->tx_base[last]; [all...] |
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ |
H A D | if_ath_tx.c | 248 , i == bf->bf_nseg - 1 /* last segment */ 354 struct ath_buf *last = ATH_TXQ_LAST(txq); local 358 wh = mtod(last->bf_m, struct ieee80211_frame *); 360 bus_dmamap_sync(sc->sc_dmat, last->bf_dmamap, 739 * updated properly. The last fragment uses only 836 /* XXX or should it go through the first, next, last 11n calls? */
|
/haiku-fatelf/src/add-ons/kernel/network/stack/ |
H A D | radix.c | 94 * If the index(m) < rn_bit, this implies the trailing last few bits of k 344 register struct radix_node *rn, *last = 0 /* shut up gcc */; local 350 * function because we need to keep track of the last node seen. 354 last = rn; 370 * in which case last == rn, or we reached a leaf, in which 371 * case we want to start from the last node we looked at. 372 * Either way, last is the node we want to start from. 374 rn = last; 396 /* if went up beyond last, stop */
|
/haiku-fatelf/src/add-ons/media/plugins/musepack/mpc/ |
H A D | synth_filter.cpp | 467 /*static*/ int last = 0; local 472 *p++ = ((float)tmp - last) * (1.f/65536.f/65536.f); 473 last = tmp;
|