Searched refs:first (Results 251 - 275 of 434) sorted by relevance

<<1112131415161718

/haiku-fatelf/src/libs/ncurses/test/
H A Dncurses.c1124 int first = ((int) UChar(attr_test_string[0])) + adjust; local
1125 int last = first + LEN_ATTRSTRING;
1127 if (first >= ' ' && last <= '~') { /* 32..126 */
1129 for (j = 0, k = first; j < MAX_ATTRSTRING && k <= last; ++j, ++k) {
1131 if (((k + 1 - first) % 5) == 0) {
1378 int first = ((int) UChar(wide_attr_test_string[0])) + adjust; local
1379 int last = first + LEN_ATTRSTRING;
1381 if (first >= ' ' && last <= '~') { /* 32..126 */
1383 for (j = 0, k = first; j < MAX_ATTRSTRING && k <= last; ++j, ++k) {
1385 if (((k + 1 - first)
2589 show_upper_chars(unsigned first) argument
2746 show_upper_widechars(int first, int repeat, int space) argument
[all...]
H A Dins_wide.c188 static bool first = TRUE; local
205 if (first) {
/haiku-fatelf/docs/user/
H A Dapidoc.dox28 you are a developer and you want to prepare the first version of the
104 -# The first line is empty, then we get to the copyright notice. You may
121 Blocks are the basic units of documentation for Doxygen. At first it will
197 different blocks actually are about. That's why the first line in a
380 The first one is \c \\n. This commands sort of belongs to the category of
408 are two commands for that. The first one is \c \\ref, which enable you to
410 \c \\link which refers to members. The first one is takes one word as an
413 \\endlink. The first word between the two commands is the object that is
451 Notes on what to read first, or mistakes that may be made by beginners
495 As such, the first documentatio
[all...]
/haiku-fatelf/src/bin/gdb/gdb/
H A Dsymtab.c146 /* Check for a symtab of a specific name; first in symtabs, then in
1127 but more useful than an error. Do the symtabs first, then check
1361 /* We first use the address in the msymbol to try to locate
1646 /* Now search all the global symbols. Do the symtab's first, then
1693 Do the symtab's first, then
1801 parameter symbols first; it only uses parameter symbols as a
1959 find the one whose first PC is closer than that of the next line in this
1983 /* Store here the first line number
1987 with a range from the start of that file to the first line's pc. */
2118 item = l->item; /* Get first lin
2613 filename_seen(const char *file, int add, int *first) argument
2656 output_source_filename(const char *name, int *first) argument
2693 int first; local
3197 int first = 1; local
3836 int first = 1; local
[all...]
H A Dstack.c171 of the first nameless arg, and NUM is the number of nameless args to
172 print. FIRST is nonzero if this is the first argument (not just
173 the first nameless arg). */
177 int first, struct ui_file *stream)
190 if (!first)
193 first = 0;
211 int first = 1;
330 if (!first)
367 first = 0;
383 first, strea
175 print_frame_nameless_args(struct frame_info *fi, long start, int num, int first, struct ui_file *stream) argument
210 int first = 1; local
[all...]
H A Duw-thread.c119 /* Offset from SP to first arg on stack at first instruction of a
374 CORE_ADDR first, mapp; local
387 for (first = mapp;;)
401 if (mapp == first)
648 thread to ensure that it's displayed first by add_thread(). */
/haiku-fatelf/src/system/libroot/posix/malloc_debug/
H A Dheap.cpp115 heap_page * page_list; // sorted so that the desired page is always first
131 heap_area * areas; // sorted so that the desired area is always first
716 // decremented as soon as this area is used for the first time
949 int32 first = -1; local
954 first = i;
958 first = -1;
964 if (first >= 0)
968 if (first < 0) {
973 for (uint32 i = first; i < first
[all...]
/haiku-fatelf/src/kits/storage/
H A DPathMonitor.cpp277 BPath first(path);
281 // try to find the first part of the path that exists
283 status_t status = directory.SetTo(first.Path());
302 missing.Prepend(first.Leaf());
305 if (first.GetParent(&first) != B_OK)
1004 // first thread initializes the global looper
/haiku-fatelf/src/libs/ncurses/progs/
H A Dtic.c235 * postdates the time of tic's first call to write_entry(). Thus
1352 bool first = TRUE; local
1363 if (first) {
1371 first = FALSE;
1378 if (!first)
/haiku-fatelf/src/add-ons/kernel/file_systems/nfs/
H A Dnfs_add_on.c743 current = ns->first;
761 current = ns->first;
772 node->next = ns->first;
773 ns->first = node;
787 current = ns->first;
799 ns->first = current->next;
824 current = ns->first;
1304 ns->first = rootNode;
1346 while (ns->first) {
1347 fs_node *next = ns->first
[all...]
/haiku-fatelf/src/bin/coreutils/src/
H A Dshred.c259 /* Invert the first bit of every sector. */
411 /* Set position if first status update */
451 /* If the first write of the first pass for a given file
602 * One extension that is included is to complement the first bit in each
758 * The core routine to actually do the work. This overwrites the first
819 Let dopass do that as part of its first iteration. */
969 bool first = true; local
996 * be quoted only the first time.
998 char const *old = (first
[all...]
/haiku-fatelf/src/kits/network/libbind/nameser/
H A Dns_name.c520 int n, l, first = 1; local
575 (dstp - msg) < 0x4000 && first) {
578 first = 0;
818 /* Recurse to get rest of name done first. */
916 *\li dnptrs is the pointer to the first name on the list,
/haiku-fatelf/headers/libs/agg/
H A Dagg_path_storage.h392 bool first = m_ptr == m_data; local
395 return first ? path_cmd_move_to : path_cmd_line_to;
456 bool first = m_index == 0; local
460 return first ? path_cmd_move_to : path_cmd_line_to;
518 bool first = m_index == int(m_container->size() - 1); local
522 return first ? path_cmd_move_to : path_cmd_line_to;
/haiku-fatelf/src/system/kernel/debug/
H A Dtracing.cpp402 // free the first entries, until there's enough space
672 // TODO: Actually check the entries! Do that when first accessing the
1049 return !fSubFilters.first->Filter(entry, out);
1058 return fSubFilters.first->Filter(entry, out)
1068 return fSubFilters.first->Filter(entry, out)
1133 if ((filter->fSubFilters.first = _ParseExpression()) != NULL)
1138 if ((filter->fSubFilters.first = _ParseExpression()) != NULL
1145 if ((filter->fSubFilters.first = _ParseExpression()) != NULL
1519 // set the iterator to the entry before the first one to dump
1808 "--difftime - print difference times for all but the first entr
[all...]
/haiku-fatelf/src/system/boot/platform/bios_ia32/
H A Dstage1.S466 ; registers). readBufferInit must be called before the first call to readBuffer
502 ; get the buffer address to esi first
568 ; the last call to readInode). Must be called before the first call to
587 ; get the first indirect block index
650 ; The first (max) 512 - 4 -2 bytes of the boot code end here
654 %error "Code exceeds first boot code block!"
668 ; first comes the BFS superblock
682 ; prepare for the first call to readBuffer
775 ; prepare for the first call to readBuffer
778 ; we skip the first 102
[all...]
/haiku-fatelf/src/add-ons/accelerants/matrox/
H A DSetDisplayMode.c549 void SET_INDEXED_COLORS(uint count, uint8 first, uint8 *color_data, uint32 flags) { argument
560 i=first;
/haiku-fatelf/src/bin/bash/
H A Dcopy_cmd.c431 new_connection->first = copy_command (command->value.Connection->first);
/haiku-fatelf/src/bin/network/wget/
H A Dconfigure.bat41 echo If it doesn't work, try executing MSDEV\BIN\VCVARS32.BAT first,
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxpath.c93 * in a way, that it stop evaluation at the first node.
708 * @ch1: first child index
711 * @value: the first int value
714 * @value4: the first string value
2828 * @node1: the first node
2833 * Returns -2 in case of error 1 if first point < second point, 0 if
2941 * Find who's first.
2974 * @node1: the first node
2980 * Returns -2 in case of error 1 if first point < second point, 0 if
3232 * Find who's first
11111 xmlXPathNodeCollectAndTest(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, xmlNodePtr * first, xmlNodePtr * last) argument
11660 xmlXPathNodeCollectAndTestNth(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, int reqpos, xmlNodePtr * first, xmlNodePtr * last) argument
12123 xmlXPathCompOpEvalFirst(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, xmlNodePtr * first) argument
12413 xmlXPathCompOpEvalFilterFirst(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, xmlNodePtr * first) argument
13099 xmlNodePtr first = NULL; local
[all...]
H A Dcatalog.c2656 xmlChar *first; local
2665 first = content;
2667 while ((*first != 0) && (*first != '-') && (*first != '<') &&
2668 (!(((*first >= 'A') && (*first <= 'Z')) ||
2669 ((*first >= 'a') && (*first <= 'z')))))
2670 first
[all...]
/haiku-fatelf/headers/cpp/
H A Dstl_set.h134 return pair<iterator, bool>(__p.first, __p.second);
/haiku-fatelf/headers/private/kernel/
H A Dtracing.h204 TraceFilter* first; member in struct:TraceFilter::__anon1087::__anon1088
/haiku-fatelf/src/add-ons/accelerants/3dfx/
H A Daccelerant.h78 void TDFX_SetIndexedColors(uint count, uint8 first, uint8* color_data,
/haiku-fatelf/src/add-ons/kernel/busses/usb/
H A Dehci.h163 void LinkDescriptors(ehci_qtd *first,
H A Duhci.h184 void LinkDescriptors(uhci_td *first,
226 // keeps track of the first and last isochronous transfer descriptor

Completed in 268 milliseconds

<<1112131415161718