Searched refs:first (Results 76 - 100 of 434) sorted by relevance

1234567891011>>

/haiku-fatelf/src/bin/gdb/readline/
H A Dhistexpand.c80 /* During tokenization, if this character is seen as the first character
676 /* :s/this/that substitutes `that' for the first
762 /* Find the first occurrence of THIS in TEMP. */
1181 int first, last; local
1186 first = last = 0;
1197 /* Handle special cases first. */
1224 first = 0;
1226 first = 1;
1229 for (first = 0; _rl_digit_p (spec[i]); i++)
1230 first
[all...]
/haiku-fatelf/src/preferences/keymap/
H A DKeyboardLayout.cpp205 // The first term within a row is the position of the row, written as
217 // also used to determine the height of the first row of the enter key;
223 // 2) "<first>-<last>": keys are added for scancode <first> to scancode
225 // 3) "<first>+<count>": one key with the <first> scancode is added, plus
510 int32 first; local
524 first = fKeys[fKeyCount - 1].code + 1;
526 first = 1;
528 last = first
[all...]
/haiku-fatelf/src/apps/processcontroller/
H A DUtilities.cpp122 mix_colors(rgb_color &target, rgb_color & first, rgb_color & second, float mix) argument
124 target.red = (uint8)(second.red * mix + (1. - mix) * first.red);
125 target.green = (uint8)(second.green * mix + (1. - mix) * first.green);
126 target.blue = (uint8)(second.blue * mix + (1. - mix) * first.blue);
127 target.alpha = (uint8)(second.alpha * mix + (1. - mix) * first.alpha);
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dtriostr.h49 TRIO_STRING_PUBLIC int trio_equal TRIO_PROTO((const char *first, const char *second));
50 TRIO_STRING_PUBLIC int trio_equal_case TRIO_PROTO((const char *first, const char *second));
51 TRIO_STRING_PUBLIC int trio_equal_locale TRIO_PROTO((const char *first, const char *second));
52 TRIO_STRING_PUBLIC int trio_equal_max TRIO_PROTO((const char *first, size_t max, const char *second));
67 TRIO_STRING_PUBLIC int trio_equal_case_max TRIO_PROTO((const char *first, size_t max, const char *second));
/haiku-fatelf/src/bin/bfs_tools/
H A Dbfswhich.cpp225 parseBlockRun(Disk& disk, char* first, char* last) argument
230 return block_run::Run(atol(first), atol(last), 1);
232 if ((comma = strchr(first, ',')) != NULL) {
234 return block_run::Run(atol(first), atol(comma));
237 return disk.ToBlockRun(atoll(first));
H A Dbfsinfo.cpp98 parseBlockRun(Disk &disk, char *first, char *last) argument
103 return block_run::Run(atol(first), atol(last), 1);
104 } else if ((comma = strchr(first, ',')) != NULL) {
106 return block_run::Run(atol(first), atol(comma));
109 return disk.ToBlockRun(atoll(first));
/haiku-fatelf/src/add-ons/kernel/file_systems/shared/
H A DQueryParserUtils.cpp260 uint32 first = utf8ToUnicode(&pattern); local
263 if (first == c) {
277 if (c >= first && c <= last) {
/haiku-fatelf/src/bin/bc/lib/
H A Dtestmul.c106 clock_t first; local
111 first = clock();
117 res = (int) (clock() - first);
/haiku-fatelf/src/libs/ncurses/ncurses/base/
H A Dlib_getstr.c51 WipeOut(WINDOW *win, int y, int x, char *first, char *last, bool echoed) argument
53 if (last > first) {
60 waddstr(win, first);
/haiku-fatelf/src/servers/media/
H A DAppManager.cpp148 be_roster->GetRunningAppInfo(iterator->first, &info);
149 printf(" team %ld \"%s\", messenger %svalid\n", iterator->first,
207 team_id team = iterator->first;
/haiku-fatelf/src/tools/translation/bitsinfo/
H A Dbitsinfo.cpp222 int32 first = 1; local
226 first = 2;
229 for (int32 i = first; i < argc; i++)
/haiku-fatelf/src/add-ons/kernel/busses/usb/
H A Dohci.cpp197 // setup the empty slot in the list and linking of all -> first
206 // Now link the first endpoint to the isochronous endpoint
870 // the current tail will become the first descriptor
873 // the data and first descriptors might be the same
879 // even the last and the first descriptor might be the same
934 TRACE("finishing transfers (first transfer: %p; last"
1065 // remove the transfer from the list first so we are sure
1251 // Apply data toggle to the first descriptor (the others will use the carry)
1303 ohci_general_td *first, ohci_general_td *last)
1305 // fill in the information of the first descripto
1302 _SwitchEndpointTail(ohci_endpoint_descriptor *endpoint, ohci_general_td *first, ohci_general_td *last) argument
1818 _LinkDescriptors(ohci_general_td *first, ohci_general_td *second) argument
[all...]
/haiku-fatelf/src/add-ons/media/plugins/asf_reader/libasf/
H A Dparse.c109 if (!header->first) {
110 header->first = current;
177 header->first = NULL;
231 headerext->first = NULL;
250 if (!header->first) {
251 header->first = current;
H A Dasfint.h65 struct asfint_object_s *first; member in struct:asf_object_headerext_s
76 struct asfint_object_s *first; member in struct:asf_object_header_s
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DBlockReferenceManager.cpp56 uint32 first = (uint32)table->GetReferences(); local
58 if (first <= address && address < last)
/haiku-fatelf/src/apps/deskbar/
H A DTeamMenu.cpp60 TTeamMenu::CompareByName(const void* first, const void* second) argument
62 return strcasecmp((*(static_cast<BarTeamInfo* const*>(first)))->name,
/haiku-fatelf/src/apps/devices/
H A DDevice.cpp138 attributes.push_back(Attribute(iter->first, iter->second));
180 str << iter->first << " : " << iter->second << "\n";
/haiku-fatelf/src/bin/coreutils/lib/
H A Dmgetgroups.c50 is a member. If GID is not -1, store it first. GID should be the
164 returns the effective gid twice: once as the first element, and
170 the most likely duplicates are the first element with an
172 first and second elements returned by getgroups. It is possible
181 gid_t first = *g; local
187 if (*next == first || *next == *g)
/haiku-fatelf/src/bin/coreutils/man/
H A Druncon.x9 the first argument is used as the complete context. Any additional
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DBlockReferenceManager.cpp58 uint32 first = (uint32)table->GetReferences(); local
60 if (first <= address && address < last)
/haiku-fatelf/src/add-ons/kernel/file_systems/fat/
H A Dfat.c98 uint32 n = 0, first = 0, last = 0; local
263 ASSERT(first == 0);
264 first = last = cluster;
266 ASSERT(IS_DATA_CLUSTER(first));
330 first));
331 if (first != 0)
332 clear_fat_chain(vol, first);
335 if (first != 0)
336 clear_fat_chain(vol, first);
340 result = first;
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/dos/r5/
H A Dfat.c83 uint32 n = 0, first = 0, last = 0; local
231 ASSERT(first == 0);
232 first = last = cluster;
234 ASSERT(IS_DATA_CLUSTER(first));
280 DPRINTF(0, ("pooh. there is a problem. clearing chain (%lx)\n", first));
281 if (first != 0) clear_fat_chain(vol, first);
284 if (first != 0) clear_fat_chain(vol, first);
288 result = first;
[all...]
/haiku-fatelf/src/bin/network/tcpdump/
H A Dprint-snmp.c684 int o = 0, first = -1, i = asnlen; local
696 first = 1;
709 * first subitem encodes two items with 1st*OIDMUX+2nd
712 if (first < 0) {
716 first = 0;
719 OBJ_PRINT(s, first);
722 OBJ_PRINT(o, first);
723 if (--first < 0)
724 first = 0;
741 char *cpf, *cpl, last[6], first[3 local
781 register int printable = 1, first = 1; local
904 int o = 0, first = -1, i = asnlen; local
[all...]
/haiku-fatelf/headers/private/kernel/util/
H A Dring_buffer.h16 int32 first; member in struct:ring_buffer
/haiku-fatelf/src/add-ons/accelerants/s3/
H A Daccel.h68 void (*SetIndexedColors)(uint count, uint8 first, uint8* color_data, uint32 flags);
103 void Savage_SetIndexedColors(uint count, uint8 first, uint8* color_data, uint32 flags);
104 void Trio64_SetIndexedColors(uint count, uint8 first, uint8* color_data, uint32 flags);
105 void Virge_SetIndexedColors(uint count, uint8 first, uint8* color_data, uint32 flags);

Completed in 142 milliseconds

1234567891011>>