Searched refs:last (Results 176 - 200 of 387) sorted by relevance

1234567891011>>

/haiku-fatelf/src/add-ons/translators/webp/libwebp/enc/
H A Dquant.c401 int last = -1; local
414 if (out[n]) last = n;
420 return (last >= 0);
461 int best_path[3] = {-1, -1, -1}; // store best-last/best-level/best-previous
464 int last = first - 1; local
479 if (err > thresh) last = n;
482 // to last + 1 (inclusive) without losing much.
483 if (last < 15) ++last;
499 for (n = first; n <= last;
[all...]
/haiku-fatelf/src/apps/cortex/Persistence/
H A DImporter.cpp201 bool last) {
205 int err = XML_Parse(m_parser, pBuffer, length, last);
198 parseBuffer( const char* pBuffer, uint32 length, bool last) argument
/haiku-fatelf/src/bin/network/wget/build-aux/
H A Dupdate-copyright167 last;
/haiku-fatelf/src/libs/zlib/
H A Ddeflate.h130 * array to 64K, this link is maintained only for the last 32K strings.
247 int last_eob_len; /* bit length of EOB code for last block */
259 /* Number of valid bits in bi_buf. All bits above the last valid bit
296 ulg stored_len, int last));
299 ulg stored_len, int last));
/haiku-fatelf/src/add-ons/kernel/network/stack/
H A Dstack.cpp455 net_protocol* last = NULL;
471 if (last == NULL) {
475 last->next = protocol;
477 last = protocol;
554 net_datalink_protocol* last = NULL;
572 if (last == NULL) {
576 last->next = protocol;
578 last = protocol;
705 // Add datalink interface protocol as the last protocol in the chain; it's
/haiku-fatelf/src/system/kernel/device_manager/
H A Ddevice_manager.cpp480 device_node* last = (device_node*)cookie;
481 if (!last->Parent())
485 = last->Parent()->Children().GetIterator();
491 if (node == last)
515 device_attr* last = (device_attr*)attrInfo.cookie; local
518 while (iterator.HasNext() && last != NULL) {
521 if (attr == last)
670 device_node* last = *_node; local
673 while (iterator.HasNext() && last != NULL) {
676 if (node != last)
[all...]
H A Ddevfs.cpp357 devfs_vnode* last = NULL; local
359 last = node;
362 if (last == NULL) {
368 vnode->dir_next = last->dir_next;
369 last->dir_next = vnode;
563 int32 i = 0, last = 0; local
565 while (temp[last]) {
574 //TRACE(("\tpath component '%s'\n", &temp[last]));
577 vnode = devfs_find_in_dir(dir, &temp[last]);
580 last
628 int32 i = 0, last = 0; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/fat/
H A Dfat.c98 uint32 n = 0, first = 0, last = 0; local
264 first = last = cluster;
267 ASSERT(IS_DATA_CLUSTER(last));
268 // set last cluster to point to us
270 result = _fat_ioctl_(vol, _IOCTL_SET_ENTRY_, last, cluster);
276 last = cluster;
/haiku-fatelf/src/add-ons/kernel/partitioning_systems/session/
H A DDisc.cpp201 TRACE((" last = %d\n", header->last));
433 /*! \brief Returns the last item in the list, or NULL if empty
681 TRACE((" last track hint: %d\n", session->last_track_hint));
776 TRACE(("%s: last track is data, adjusted TOC\n",
829 // last track hint
836 WARN(("%s: warning: illegal last track hint %d found "
841 WARN(("%s: warning: duplicate last track hint values found "
989 // incorrect last track hint
990 struct track* last local
[all...]
/haiku-fatelf/src/libs/print/libgutenprint/test/
H A Dbjc-unprint.c68 void rle_info (const unsigned char *inbuf, int n, int *first, int *last,
119 void rle_info(const unsigned char *inbuf, int n, int *first, int *last, int *width, int *length) argument
127 *last= 0;
155 if (last) *last= l;
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/dos/r5/
H A Dfat.c83 uint32 n = 0, first = 0, last = 0; local
232 first = last = cluster;
235 ASSERT(IS_DATA_CLUSTER(last));
236 // set last cluster to point to us
238 if ((result = _fat_ioctl_(vol,_IOCTL_SET_ENTRY_,last,cluster)) < 0) {
243 last = cluster;
/haiku-fatelf/src/add-ons/kernel/busses/usb/
H A Dehci.cpp731 // Ignore the fact that the last descriptor might need less bandwidth.
876 // Simply check every last descriptor of the isochronous transfer list
1557 // we arrived at the last (stray) descriptor, we're done
1714 * isochronous descriptor. Once it finds the last isochronous descriptor
1764 // Process the transfer if we found the last descriptor
2289 EHCI::LinkDescriptors(ehci_qtd *first, ehci_qtd *last, ehci_qtd *alt) argument
2291 first->next_phy = last->this_phy;
2292 first->next_log = last;
2307 ehci_itd *last = *_last; local
2308 itd->next_phy = last
2320 ehci_sitd *last = *_last; local
2330 UnlinkITDescriptors(ehci_itd *itd, ehci_itd **last) argument
2342 UnlinkSITDescriptors(ehci_sitd *sitd, ehci_sitd **last) argument
[all...]
H A Dohci.h87 ohci_general_td *last);
/haiku-fatelf/src/system/kernel/arch/x86/
H A Darch_debug.cpp44 int32 last = *_last; local
49 if (visited[(NUM_PREVIOUS_LOCATIONS + last - i) % NUM_PREVIOUS_LOCATIONS] == bp)
53 *_last = last = (last + 1) % NUM_PREVIOUS_LOCATIONS;
54 visited[last] = bp;
678 int32 num = 0, last = 0; local
732 if (already_visited(previousLocations, &last, &num, bp)) {
/haiku-fatelf/src/libs/ncurses/ncurses/tty/
H A Dtty_update.c494 * If this is the last part of the given interval,
496 * last update on the line.
533 * Output the line in the given range [first .. last]
544 int first, int last)
549 otext, ntext, row, first, last));
552 && (last - first + 1) > SP->_inline_cost) {
553 for (j = first, same = 0; j <= last; j++) {
573 return EmitRange(ntext + first, last - first + 1);
999 int last = min(screen_columns, newscr->_maxx + 1); local
1000 NCURSES_CH_T blank = newscr->_line[total - 1].text[last
541 PutRange(const NCURSES_CH_T * otext, const NCURSES_CH_T * ntext, int row, int first, int last) argument
[all...]
/haiku-fatelf/src/add-ons/translators/gif/
H A DGIFLoad.cpp481 Memblock *last = NULL; local
488 last = block;
496 last->next = block;
/haiku-fatelf/src/apps/serialconnect/libvterm/src/
H A Dunicode.c74 int last; member in struct:interval
136 if (ucs < table[0].first || ucs > table[max].last)
140 if (ucs > table[mid].last)
/haiku-fatelf/src/libs/ncurses/test/
H A Dncurses.c1125 int last = first + LEN_ATTRSTRING; local
1127 if (first >= ' ' && last <= '~') { /* 32..126 */
1129 for (j = 0, k = first; j < MAX_ATTRSTRING && k <= last; ++j, ++k) {
1379 int last = first + LEN_ATTRSTRING; local
1381 if (first >= ' ' && last <= '~') { /* 32..126 */
1383 for (j = 0, k = first; j < MAX_ATTRSTRING && k <= last; ++j, ++k) {
2310 ,"last screen position. The ncurses code does not yet handle this"
2593 unsigned last = first + 31; local
2599 C1 ? "C1" : "GR", first, last);
2603 for (code = first; code <= last; cod
2750 int last = first + 31; local
3094 FRAME *next, *last; variable
4297 static int last; local
[all...]
/haiku-fatelf/src/preferences/mail/
H A DFilterConfigView.cpp88 bool last = false; local
90 target = CountItems() - 1, last = true;
93 if (last)
/haiku-fatelf/src/add-ons/kernel/drivers/disk/floppy/pc_floppy/
H A Dfloppy.c141 struct floppy *last = NULL; local
237 if (last)
238 last->next = &(floppies[current]);
247 last = &(floppies[current]);
458 // handle partial last block
/haiku-fatelf/src/libs/edit/
H A Dchared.c87 k->last = k->buf + size;
332 * Return p pointing to last char used.
482 el->el_chared.c_kill.last = el->el_chared.c_kill.buf;
594 el->el_chared.c_kill.last = newbuffer +
595 (el->el_chared.c_kill.last - oldkbuf);
H A Dcommon.c122 el->el_chared.c_kill.last = kp;
143 "\nD(b: %x(%s) c: %x(%s) last: %x(%s) limit: %x(%s)\n",
197 el->el_chared.c_kill.last = kp;
654 el->el_history.last = el->el_history.buf +
727 el->el_history.last = el->el_history.buf +
/haiku-fatelf/src/libs/ncurses/include/
H A Dterm_entry.h68 struct entry *last; member in struct:entry
/haiku-fatelf/src/system/boot/loader/file_systems/bfs/
H A DBPlusTree.cpp307 for (int16 first = 0, last = node->NumKeys() - 1; first <= last;) {
308 uint16 i = (first + last) >> 1;
320 last = i - 1;
531 * store the last key - if this will ever become an issue, it will be
547 // if the tree was emptied since the last call
619 // there are no nodes left, so turn back to the last key
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.cpp265 // the last group may have less bits than the others
282 // the last group may have less bits in the last block
611 // the last allocation group may contain less blocks than the others
668 // the last allocation group may contain less blocks than the others
994 // last one)
1002 int32 last = 0;
1003 for (; last < NUM_DIRECT_BLOCKS - 1; last++)
1004 if (data.direct[last
[all...]

Completed in 408 milliseconds

1234567891011>>