Searched refs:first (Results 301 - 325 of 434) sorted by relevance

<<1112131415161718

/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DBlockAllocator.cpp1147 dprintf("group %d first free too late: should be "
1179 dprintf("group %d first free too late: should be %d, is %d\n",
1794 // if it is already allocated first
2148 kprintf(" first free: %" B_PRId32 "\n", group.fFirstFree);
2180 off_t first = volume->ToBlock(entry->Run());
2181 off_t last = first - 1 + entry->Run().Length();
2182 if (block >= first && block <= last) {
2188 off_t first = volume->ToBlock(entry->Run());
2189 off_t last = first - 1 + entry->Run().Length();
2190 if (block >= first
[all...]
/haiku-fatelf/src/tools/docbook/libxslt/libxslt/
H A Dxslt.c567 xsltLREEffectiveNsNodesFree(xsltEffectiveNsPtr first) argument
571 while (first != NULL) {
572 tmp = first;
573 first = first->nextInStore;
2496 * @first: the first list
2499 * Appends the content of @second to @first into @destination.
2505 xsltCompilerUtilsCreateMergedList(xsltPointerListPtr first, argument
2511 if (first)
[all...]
/haiku-fatelf/src/bin/gdb/texinfo/
H A Dtexinfo.tex353 \egroup % \vbox from first cropmarks clause
440 % But first, we have to remove the trailing space token.
531 % But first, it executes a specialized version of \checkenv
664 % max (\topskip - \ht (first item), 0). If that height is large,
701 % and the first line afterwards, we have to propagate \prevdepth.
968 % If WORD is `none', then suppress indentation of the first paragraph
1271 % subentries, which we calculated on our first read of the .toc above.
1321 \def\first{#1}
1326 \def\ppnn{\pgn=\first}
1353 \def\poptoks#1#2|ENDTOKS|{\let\first
[all...]
/haiku-fatelf/headers/cpp/
H A Dstl_hash_set.h159 return pair<iterator,bool>(__p.first, __p.second);
176 return pair<iterator, bool>(__p.first, __p.second);
/haiku-fatelf/src/add-ons/accelerants/s3/
H A Dsavage_mode.cpp834 Savage_SetIndexedColors(uint count, uint8 first, uint8* colorData, uint32 flags) argument
844 WriteIndexedColor(first++, // color index
/haiku-fatelf/src/add-ons/translators/exr/openexr/ilmimf/
H A DImfHeader.cpp193 insert (*i->first, *i->second);
227 insert (*i->first, *i->second);
/haiku-fatelf/src/bin/bash/
H A Djobs.c970 the foreground process (subshell_environment != 0). Returns the first
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)
1510 if (p != first)
1523 if (p != first)
1527 if (show->running == first->running &&
1528 WSTATUS (show->status) == WSTATUS (first->status))
1553 if (p != first
[all...]
/haiku-fatelf/src/bin/coreutils/src/
H A Djoin.c54 1 means use the first file argument, 2 the second. */
174 standard output. The default join field is the first, delimited\n\
250 /* Skip leading blanks before the first field. */
473 /* Read a line from FP and add it to SEQ, as the first item if FIRST is
476 advance_seq (FILE *fp, struct seq *seq, bool first, int whichfile) argument
478 if (first)
613 /* Read the first line of each file. */
790 /* The first character must be 0, 1, or 2. */
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dor32-opc.c56 machine[31:30]: first two bits of opcode
59 10 - first source operand is GPR (rA)
837 unsigned int first = *a; local
842 i = (insn >> first) & *a;
/haiku-fatelf/src/bin/rcs/
H A Drcsrev.c313 /* compare the first "length" fields of two dot numbers;
387 p->first = next;
904 aprintf(stderr,"%s\n",gendeltas->first->num);
/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/
H A Dread_termcap.c194 * name field if this is the first time through the loop, or
309 * Allocate first chunk of memory.
360 int first = lineno + 1; local
439 *beginning = first;
566 * (cgetcap always skips first field).
818 sprintf(temp, "%s/", home); /* $HOME first */
857 * the first (breaks tc= includes)
1140 * Disadvantage: After the first time a termcap type is loaded
/haiku-fatelf/src/servers/mail/
H A DMailDaemon.cpp554 iter->first);
730 fAccounts.erase(it->first);
/haiku-fatelf/headers/private/file_systems/
H A DQueryParser.h420 // first character of the equation symbol
447 // lets change "start" to point to the first character after the symbol
475 // at this point, "start" will point to the first character of the value,
476 // "end" will point to its last character, and "start" to the first non-
712 // first, check if we are matching for a live query and use that value
1019 Term<QueryPolicy>* first;
1022 first = fLeft;
1025 first = fRight;
1029 status_t status = first->Match(entry, node, attribute, type, key,
/haiku-fatelf/src/kits/translation/
H A DTranslatorRoster.cpp331 // add user directories first, so that they can override system translators
356 first. See _CompareTranslatorDirectoryPriority().
738 info.translator = iterator->first;
788 info.translator = iterator->first;
822 array[count++] = iterator->first;
1006 Directories added to the roster have a certain priority - the first entry
1080 update.AddInt32("translator_id", iterator->first);
1515 case the \a source is identified first)
/haiku-fatelf/src/libs/fluidsynth/src/
H A Dfluid_cmd.c1323 int first; member in struct:_fluid_handle_option_data_t
1331 if (d->first) {
1333 d->first = 0;
1397 data.first = 1;
/haiku-fatelf/src/libs/pdflib/libs/pdflib/
H A Dp_pfm.c82 pdc_byte first; /* First character */ member in struct:kern_
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/beserved/bt_fs/
H A Dnfs_add_on.h65 struct fs_node *first; member in struct:fs_nspace
/haiku-fatelf/src/tests/add-ons/kernel/partitioning_systems/
H A DPartitioningSystemsTest.cpp397 print_partition(iterator->first);
/haiku-fatelf/src/kits/interface/
H A DListView.cpp45 "Select and invoke the specified items, first removing any existing selection."
390 // if nothing is selected yet, always select the first item
407 // if nothing is selected yet, always select the first item
1483 // keep track of first and last selected item
1687 int32 first = min_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/apps/showimage/
H A DShowImageWindow.cpp623 bool first = fImageView->Bitmap() == NULL; local
626 if (!first && ref != fNavigator.CurrentRef()) {
641 if (first)
651 if (first) {
1405 // first/lastPage is unused for now
/haiku-fatelf/src/kits/tracker/
H A DOpenWithWindow.cpp251 // first set it's app signature as the preferred type
597 // if model is of unknown type, try mimeseting it first
1046 // relation with the lowest number goes first
1257 bool first; member in struct:AddOneTermParams
1264 if (!params->first)
1268 params->first = false;
1294 params.first = true;
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DQuery.cpp589 uint32 first = utf8ToUnicode(&pattern); local
592 if (first == c) {
605 if (c >= first && c <= last) {
694 // to the last character of the string, and "string" points to the first
719 // lets change "start" to point to the first character after the symbol
747 // at this point, "start" will point to the first character of the value,
748 // "end" will point to its last character, and "start" to the first non-
975 // first, check if we are matching for a live query and use that value
/haiku-fatelf/src/add-ons/translators/icns/openjpeg/
H A Dt2.c65 @param first
67 static opj_bool t2_init_seg(opj_tcd_cblk_dec_t* cblk, int index, int cblksty, int first);
203 /* if first instance of cblk --> zero bit-planes information */
299 static opj_bool t2_init_seg(opj_tcd_cblk_dec_t* cblk, int index, int cblksty, int first) { argument
319 if (first) {
/haiku-fatelf/src/bin/compress/
H A Dcompress.c211 * Removed ferror() calls in output routine on every output except first.
433 code_int free_ent = 0; /* first unused entry */
477 #define FIRST 257 /* first free entry */
940 * secondary probe. Here, the modular division first probe is gives way
1125 * Get to the first byte.
1130 * Since code is always >= 8 bits, only need to mask the first
1230 * As above, initialize the first 256 entries in the table.
1242 putchar( (char)finchar ); /* first code must be 8 bits = char */
1356 * Get to the first byte.
1360 /* Get first par
1431 register int i, first; local
[all...]
/haiku-fatelf/src/bin/coreutils/lib/
H A Dregcomp.c597 /* Set the first 128 bits. */
880 /* Force allocation of str_tree_storage the first time. */
993 Idx first, i;
998 the first node of the regular expression. */
999 first = dfa->str_tree->first->node_idx;
1000 dfa->init_node = first;
1001 err = re_node_set_init_copy (&init_nodes, dfa->eclosures + first);
1040 /* It must be the first time to invoke acquire_state. */
1151 /* Analyze the structure tree, and calculate "first", "nex
988 Idx first, i; local
[all...]

Completed in 390 milliseconds

<<1112131415161718