Searched refs:first (Results 26 - 50 of 279) sorted by relevance

1234567891011>>

/haiku/src/apps/mail/
H A DPeople.cpp56 int first = 0; local
57 while (first < groupString.Length()) {
58 int end = groupString.FindFirst(',', first);
63 groupString.CopyInto(group, first, end - first);
67 first = end + 1;
/haiku/src/system/boot/platform/efi/arch/riscv64/
H A Darch_traps.cpp22 bool first = true; local
26 if (first) first = false; else dprintf(", ");
87 bool first = true; local
91 if (first) first = false; else dprintf(", ");
/haiku/headers/cpp/
H A Dparsestream.h146 int first() { return _first; }
148 int line_length() { marks[second].delta(marks[first]); }
149 int line_length() { marks[second].delta(marks[first]); }
/haiku/src/apps/cortex/support/
H A DProfileTarget.cpp97 if((*it).first.Length() > nameLength)
98 nameLength = (*it).first.Length();
101 sorted.back().name = (*it).first.String();
/haiku/src/kits/mail/
H A DMailDaemon.cpp83 BMessage first(kMsgCountNewMessages);
86 first.AddBool("wait_for_fetch_done",true);
88 fDaemon.SendMessage(&first, &reply);
/haiku/src/tests/system/kernel/util/
H A DDoublyLinkedListTest.cpp129 // remove first
131 Item *first = list.RemoveHead(); local
132 CHK(first->value == 0);
133 CHK(first == &items[0]);
147 // re-add first
149 list.Add(first);
/haiku/src/bin/
H A Dhd.c54 char *first = *++argv; local
56 if (strcmp(first, "--help") == 0) {
61 if (strcmp(first, "-n") == 0) {
84 arg = first;
/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Dqueuing.cpp32 The first condition is automatically cleared when a request has
42 requeued request and autosense-requests, which are added first. Each bus
56 scsi_ccb *first, *last, *before, *next; local
61 first = device->queued_reqs;
63 if( first == NULL ) {
69 SHOW_FLOW( 3, "first=%p, pos=%" B_PRId64 ", last_pos=%" B_PRId64,
70 first, first->sort, device->last_sort );
96 // (i.e. last) position and position of first queued request,
97 // insert it as first queu
[all...]
/haiku/src/add-ons/translators/rtf/
H A DRTF.h56 virtual void Parse(char first, BDataIO &stream, char &last) = 0;
82 virtual void Parse(char first, BDataIO &stream, char &last);
99 virtual void Parse(char first, BDataIO &stream, char &last);
116 virtual void Parse(char first, BDataIO &stream, char &last);
135 virtual void Parse(char first, BDataIO &stream, char &last);
H A DRTF.cpp37 static int32 parse_integer(char first, BDataIO &stream, char &_last, int32 base = 10);
60 parse_integer(char first, BDataIO &stream, char &_last, int32 base) argument
66 char digit = first;
294 Group::Parse(char first, BDataIO &stream, char &last) argument
296 if (first == '\0')
297 first = read_char(stream);
299 if (first != '{')
454 Header::Parse(char first, BDataIO &stream, char &last) argument
459 fVersion = parse_integer(first, stream, last);
531 Text::Parse(char first, BDataI argument
615 Parse(char first, BDataIO &stream, char &last) argument
[all...]
/haiku/headers/libs/agg/
H A Dagg_rasterizer_cells_aa.h220 int delta, p, first, dx; local
242 first = poly_subpixel_scale;
250 first = 0;
265 m_curr_cell.area += (fx1 + first) * delta;
304 m_curr_cell.area += (fx2 + poly_subpixel_scale - first) * delta;
339 int p, rem, mod, lift, delta, first, incr; local
370 first = poly_subpixel_scale;
373 first = 0;
379 //render_hline(ey1, x_from, fy1, x_from, first);
380 delta = first
[all...]
/haiku/src/apps/debuganalyzer/gui/chart/
H A DLineChartRenderer.cpp175 int32 first = (int32)updateRect.left - left - 1; local
177 if (first < 0)
178 first = 0;
181 if (first > last)
198 shape.MoveTo(BPoint(left + first,
199 bottom - ((info->samples[first] - minRange) * scale)));
201 for (int32 i = first; i <= last; i++) {
H A DLegendChartAxis.cpp95 // get the first legend position/end
292 BPoint first; local
293 first.*pointField = rulerStart;
294 first.*otherPointField = rulerChartClosest;
295 BPoint second = first;
301 view->AddLine(first, second, black);
309 first.*pointField = position;
310 first.*otherPointField = rulerChartDistant;
314 view->AddLine(first, second, black);
326 first
[all...]
/haiku/src/servers/registrar/
H A DRecentEntries.cpp70 \brief The list of entries and their corresponding app sigs, most recent first
145 /*! \brief Returns the first \a maxCount recent apps in the \c BMessage
148 The message is cleared first, and \c entry_refs for the the apps are
310 status_t outputError = path.SetTo(&mapItem->first);
327 mapItem->first.device, mapItem->first.directory,
328 mapItem->first.name));
336 mapItem->first.device, mapItem->first.directory,
337 mapItem->first
[all...]
/haiku/src/add-ons/kernel/generic/tty/
H A Dline_buffer.h13 int32 first; member in struct:line_buffer
/haiku/src/apps/processcontroller/
H A DUtilities.h29 void mix_colors(rgb_color& target, rgb_color& first, rgb_color& second, float mix);
/haiku/src/add-ons/kernel/file_systems/ntfs/
H A Dntfs.h80 entry* first, *current; member in struct:directory_cookie
/haiku/src/system/boot/platform/efi/arch/x86/
H A Dcrt0-efi-x86.S55 pushl %eax # pass ldbase as first argument
/haiku/src/kits/network/libnetservices/
H A DNetworkCookie.cpp783 int32 first = skip_whitespace_forward(cookieString, index);
787 if (first > last)
790 cookieString.CopyInto(name, first, last - first + 1);
792 first = skip_whitespace_forward(cookieString, firstEquals + 1);
794 if (first <= last)
795 cookieString.CopyInto(value, first, last - first + 1);
821 int32 first = skip_whitespace_forward(cookieString, index); local
824 if (first <
[all...]
/haiku/src/apps/devices/
H A DResourceUsageWindow.cpp270 bool first = true; local
285 IRQListView->AddItem(new IRQDMAItem(first ? i : -1,
287 first = false;
292 if (first) {
302 bool first = true; local
317 DMAListView->AddItem(new IRQDMAItem(first ? i : -1,
319 first = false;
324 if (first) {
H A DDevice.cpp120 attributes.push_back(Attribute(iter->first, iter->second));
132 str << iter->first << " : " << iter->second << "\n";
/haiku/src/kits/network/libnetapi/
H A DNetworkAddressResolver.cpp20 int32 first = host.FindFirst(':'); local
22 if (separator != first
225 int32 first = *cookie; local
226 for (int32 index = 0; index < first && info != NULL; index++) {
252 int32 first = *cookie; local
253 for (int32 index = 0; index < first && info != NULL; index++)
/haiku/src/system/libroot/posix/glibc/arch/sparc/
H A Dlshift.S35 ldx [%o1-8],%g2 ! load first limb
39 andcc %o2,4-1,%g4 ! number of limbs in first loop
41 be,pn %xcc,.L0 ! if multiple of 4 limbs, skip first loop
H A Drshift.S33 ldx [%o1],%g2 ! load first limb
36 andcc %o2,4-1,%g4 ! number of limbs in first loop
38 be,pn %xcc,.L0 ! if multiple of 4 limbs, skip first loop
/haiku/src/add-ons/kernel/busses/usb/
H A Dohci.cpp411 // setup the empty slot in the list and linking of all -> first
420 // Now link the first endpoint to the isochronous endpoint
1025 // the current tail will become the first descriptor
1028 // the data and first descriptors might be the same
1034 // even the last and the first descriptor might be the same
1081 // the current tail will become the first descriptor
1084 // the data and first descriptors are the same
1087 // the last and the first descriptor might be the same
1134 TRACE("finishing transfers (first transfer: %p; last"
1235 // remove the transfer from the list first s
1663 _SwitchEndpointTail(ohci_endpoint_descriptor *endpoint, ohci_general_td *first, ohci_general_td *last) argument
1703 _SwitchIsochronousEndpointTail(ohci_endpoint_descriptor *endpoint, ohci_isochronous_td *first, ohci_isochronous_td *last) argument
2530 _LinkDescriptors(ohci_general_td *first, ohci_general_td *second) argument
2538 _LinkIsochronousDescriptors(ohci_isochronous_td *first, ohci_isochronous_td *second, ohci_isochronous_td *nextDone) argument
[all...]

Completed in 132 milliseconds

1234567891011>>