Searched refs:last (Results 201 - 225 of 387) sorted by relevance

1234567891011>>

/haiku-fatelf/src/bin/bc/bc/
H A Dscan.l46 /* Force . as last for now. */
247 last return(Last);
/haiku-fatelf/src/bin/diffutils/src/
H A Dcontext.c387 to the `struct change' for the last change before those lines. */
453 /* Find the last function-header line in LINBUF prior to line number LINENUM.
461 lin last = find_function_last_search;
464 while (last <= --i)
480 find the line we found last time. */
454 lin last = find_function_last_search; local
/haiku-fatelf/src/kits/interface/
H A DSplitView.cpp177 BSplitView::SetCollapsible(int32 first, int32 last, bool collapsible) argument
179 fSplitLayout->SetCollapsible(first, last, collapsible);
/haiku-fatelf/src/libs/pdflib/libs/pdflib/
H A Dp_hyper.c30 #define LAST(index) (p->outlines[index].last)
43 int last; /* last sub-entry */ member in struct:pdf_outline_s
661 self->last = 0;
676 /* insert new outline as last child of parent in all cases */
1118 pdf_info *info, *last; local
1143 last = info;
1146 pdc_free(p->pdc, last->key);
1147 pdc_free(p->pdc, last->value);
1148 pdc_free(p->pdc, last);
[all...]
H A Dp_annots.c545 pdf_annot *last; local
561 for (last = p->annots; last->next != NULL; /* */ )
562 last = last->next;
563 last->next = ann;
/haiku-fatelf/src/libs/print/libgutenprint/test/
H A Dunprint.c453 int c, l, p, left, right, first, last, width, height, i; local
465 last = pstate.bottom_edge;
468 height = oversample * (last - first + 1);
474 right, last - pstate.top_margin,
476 (last / (double) pstate.page_management_units),
477 right - left + 1, last - first + 1,
479 (last - first + 1) / (double) pstate.page_management_units);
494 for (l = first; l <= last; l++)
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/
H A Dtransform.c625 if ((target != NULL) && (target->last != NULL) &&
626 (target->last->type == XML_CDATA_SECTION_NODE)) {
627 return(xsltAddTextString(ctxt, target->last, string, len));
631 if ((target != NULL) && (target->last != NULL) &&
632 (target->last->type == XML_TEXT_NODE) &&
633 (target->last->name == xmlStringTextNoenc)) {
634 return(xsltAddTextString(ctxt, target->last, string, len));
640 if ((target != NULL) && (target->last != NULL) &&
641 (target->last->type == XML_TEXT_NODE) &&
642 (target->last
[all...]
/haiku-fatelf/src/tools/fs_shell/
H A Dblock_cache.cpp227 // remove the notification if this was the last pending event
653 /*! Removes a reference from the specified \a block. If this was the last
975 fssh_panic("last transaction (%d) still open!\n",
1184 cached_block* last = NULL; local
1209 if (last == NULL)
1212 last->transaction_next = block;
1215 last = block;
1315 cached_block* last = NULL; local
1322 if (last != NULL)
1323 last
[all...]
/haiku-fatelf/src/add-ons/translators/exr/openexr/ilmimf/
H A DImfOutputFile.cpp329 int startY, endY; // The first and last scanlines in
949 int last = (_data->currentScanLine + (numScanLines - 1) - local
956 last - first + 1),
967 stop = last + 1;
972 int last = (_data->currentScanLine - (numScanLines - 1) - local
979 first - last + 1),
990 stop = last - 1;
1056 // If this was the last line buffer in the scanline range
/haiku-fatelf/src/bin/gawk/
H A Darray.c231 * the last node, shorten the list.
563 register NODE *bucket, *last; local
572 last = NULL; /* shut up gcc -Wall */
583 last = NULL;
585 last = bucket, bucket = bucket->ahnext) {
617 if (last != NULL)
618 last->ahnext = bucket->ahnext;
/haiku-fatelf/src/libs/agg/font_freetype/
H A Dagg_font_freetype.cpp170 int last; // index of last point in contour local
172 last = outline.contours[n];
173 limit = outline.points + last;
176 v_last = outline.points[last];
191 if(FT_CURVE_TAG(outline.tags[last]) == FT_CURVE_TAG_ON)
193 // start at last point if it is on the curve
199 // if both first and last points are conic,
398 first = last + 1;
/haiku-fatelf/src/servers/app/font/
H A DFontEngine.cpp81 int last; // index of last point in contour local
83 last = outline.contours[n];
84 limit = outline.points + last;
87 v_last = outline.points[last];
102 if (FT_CURVE_TAG(outline.tags[last]) == FT_CURVE_TAG_ON) {
103 // start at last point if it is on the curve
107 // if both first and last points are conic,
283 first = last + 1;
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/
H A Dtree.h208 struct _xmlNode *last; /* NULL */ member in struct:_xmlAttribute
301 struct _xmlNode *last; /* NULL */ member in struct:_xmlElement
360 struct _xmlNode *last; /* last child link */ member in struct:_xmlDtd
388 struct _xmlNode *last; /* NULL */ member in struct:_xmlAttr
443 struct _xmlNode *last; /* last child link */ member in struct:_xmlNode
488 struct _xmlNode *last; /* last child link */ member in struct:_xmlDoc
/haiku-fatelf/src/bin/gdb/bfd/
H A Dnlmcode.h1669 file_ptr last;
1984 last = bfd_tell (abfd);
1986 nlm_fixed_header (abfd)->codeImageOffset = last;
1988 nlm_fixed_header (abfd)->dataImageOffset = last;
1990 nlm_fixed_header (abfd)->customDataOffset = last;
1992 nlm_fixed_header (abfd)->moduleDependencyOffset = last;
1994 nlm_fixed_header (abfd)->relocationFixupOffset = last;
1996 nlm_fixed_header (abfd)->externalReferencesOffset = last;
1998 nlm_fixed_header (abfd)->publicsOffset = last;
2000 nlm_fixed_header (abfd)->debugInfoOffset = last;
1667 file_ptr last; variable
[all...]
/haiku-fatelf/src/apps/terminal/
H A DBasicTerminalBuffer.cpp234 int32 last = fHeight - 1; local
238 if (first > dirtyBottom || dirtyTop > last)
243 if (last > dirtyBottom)
244 last = dirtyBottom;
247 //debug_printf(" updating: %ld - %ld\n", first, last);
248 for (int32 i = first; i <= last; i++) {
348 // get all but the last line
358 // get the last line, if not empty
1013 BasicTerminalBuffer::_ClearLines(int32 first, int32 last) argument
1018 for (int32 i = first; i <= last;
[all...]
/haiku-fatelf/src/tests/system/kernel/device_manager/playground/
H A Ddevice_manager.cpp467 device_node* last = *_node; local
470 while (iterator.HasNext() && last != NULL) {
473 if (node != last)
485 if (last != NULL)
486 last->Release();
494 if (last != NULL)
495 last->Release();
1646 with the deepest and last child.
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/r5/
H A DBlockAllocator.cpp103 // the last group may have less bits in the last block
381 // the last allocation group may contain less blocks than the others
428 // the last allocation group may contain less blocks than the others
634 // are there already allocated blocks? (then just try to allocate near the last one)
642 int32 last = 0;
643 for (; last < NUM_DIRECT_BLOCKS - 1; last++)
644 if (data->direct[last + 1].IsZero())
647 group = data->direct[last]
[all...]
/haiku-fatelf/src/tools/docbook/libxml2/
H A Drelaxng.c3690 xmlRelaxNGDefinePtr tmp2, last = NULL; local
3706 if (last == NULL) {
3707 except->content = last = tmp2;
3709 last->next = tmp2;
3710 last = tmp2;
4447 xmlRelaxNGDefinePtr last = NULL, cur; local
4483 if (last == NULL) {
4484 def->content = last = cur;
4486 last->next = cur;
4487 last
5099 xmlRelaxNGDefinePtr ret, cur, last = NULL; local
5240 xmlRelaxNGDefinePtr last = NULL; local
5299 xmlRelaxNGDefinePtr ret, cur, last; local
5413 xmlRelaxNGDefinePtr def = NULL, last = NULL, cur, parent; local
5461 xmlRelaxNGDefinePtr def = NULL, last; local
5621 xmlRelaxNGDefinePtr cur, last, tmp, tmp2; local
9110 xmlNodePtr cur, start, last = NULL, lastchg = NULL, lastelem; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DBlockAllocator.cpp610 AllocationBlockGroup* last = &fGroups[fNumGroups]; local
614 for (; group < last; ++group, ++groupNum) {
642 last = &fGroups[blockGroup + 1];
686 // Try to allocate near it's last blocks
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/bfs/btree/
H A Dtest.cpp268 bool last; local
273 } while ((last = findKey(name,length,i)) && tries++ < 100);
275 if (last) {
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Drunlist.c127 int last; local
132 last = irl;
133 while (na->rl[last].length)
134 last++;
135 newrl = ntfs_rl_realloc(na->rl,last+1,last+more_entries+1);
513 int dfinal, sfinal; /* The last index into @[ds]rl with
592 /* Scan to the last element with lcn >= LCN_HOLE. */
1403 * @dst_max: pointer to last byte of destination buffer for bounds checking
/haiku-fatelf/src/bin/coreutils/src/
H A Dpr.c133 -b Balance columns on the last page.
139 printing columns down is equivalent to that on the last
468 we do column balancing on the last page. */
525 /* (-b) True means balance columns on the last page as Sys V does. */
801 uintmax_t last = UINTMAX_MAX;
812 err = xstrtoumax (p1, &p, 10, &last, "");
815 if (p1 == p || last < first)
823 last_page_number = last;
1473 columns on the last page. */
1917 because the last entr
799 uintmax_t last = UINTMAX_MAX; local
2594 char *last = &buff[line_vector[line + 1]]; local
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A Dhppa-tdep.c422 ui->last = -1;
468 ui->last = total_entries - 1;
550 int first, middle, last;
598 last = ui->last;
600 while (first <= last)
602 middle = (first + last) / 2;
614 last = middle - 1;
1480 /* Return the address of the PC after the last prologue instruction if
1936 slow, so only use this as a last resor
549 int first, middle, last; local
[all...]
/haiku-fatelf/src/bin/gdb/libiberty/
H A Dmaint-tool243 last if /remainder of this file/;
/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/
H A Dcomp_scan.c706 _nc_trans_string(char *ptr, char *last) argument
716 if (ptr == (last - 1))

Completed in 407 milliseconds

1234567891011>>