Searched refs:last (Results 1 - 25 of 195) sorted by relevance

12345678

/haiku/src/system/libroot/posix/
H A Dlibgen.cpp24 char *last = strrchr(filepath, '/'); local
26 if (last == NULL)
31 if (*(last + 1) != '\0')
32 ++last;
34 return last;
49 char *last = strrchr(filepath, '/'); local
51 if (last == NULL)
55 if (last == filepath)
56 last++;
58 *last
[all...]
/haiku/src/system/libroot/posix/string/
H A Dstrrchr.c15 char const *last = NULL; local
19 last = s;
24 return (char *)last;
/haiku/src/apps/cortex/Persistence/
H A DStringContent.cpp94 int32 last = 0;
95 for(; last < content.Length() && isspace(content[last]); ++last) {}
96 if(last > 0)
97 content.Remove(0, last);
99 last = content.Length() - 1;
100 int32 from = last;
102 if(from < last)
103 content.Remove(from+1, last
[all...]
/haiku/src/bin/network/ping/
H A Dutils.c51 } last; local
74 last.uc[0] = *w;
75 last.uc[1] = 0;
76 sum += last.us;
/haiku/headers/private/system/
H A Dsignal_defs.h38 #define SIGNAL_RANGE_TO_MASK(first, last) \
39 ((((SIGNAL_TO_MASK(last) - 1) << 1) | 1) & ~(SIGNAL_TO_MASK(first) - 1))
40 // Note: The last mask computation looks that way to avoid an overflow for
41 // last == 64.
/haiku/src/libs/gnu/
H A Dmemmem.c40 const char *cur, *last; local
56 /* the last position where its possible to find "s" in "l" */
57 last = cl + l_len - s_len;
59 for (cur = cl; cur <= last; cur++)
H A Dqsort.c97 char* last = base + sizeOfElement * (numElements - 1); local
100 // Use median of second, middle and second-last items as pivot.
101 // First and last may have been swapped with pivot and therefore be
106 pivList[2] = last - sizeOfElement;
116 // Swap mid value (pivList[1]), and last element to put pivot as last
118 if (pivList[1] != last)
119 sort_r_swap(pivList[1], last, sizeOfElement);
123 // ^- base ^- ple ^- pl ^- pr ^- pre ^- last (where the pivot is)
127 pivot = last;
[all...]
/haiku/headers/libs/agg/
H A Dagg_shorten_path.h51 vertex_type& last = vs[n]; local
53 double x = prev.x + (last.x - prev.x) * d;
54 double y = prev.y + (last.y - prev.y) * d;
55 last.x = x;
56 last.y = y;
57 if(!prev(last)) vs.remove_last();
/haiku/src/apps/cortex/support/
H A DMediaString.cpp65 BString list, last; local
80 if (last != "")
81 list << ", " << last; local
82 last = B_TRANSLATE("Buffer consumer");
91 if (last != "")
92 list << ", " << last; local
93 last = B_TRANSLATE("Time source");
102 if (last != "")
103 list << ", " << last; local
104 last
114 list << ", " << last; local
125 list << ", " << last; local
136 list << ", " << last; local
147 list << ", " << last; local
158 list << ", " << last; local
164 list << " & " << last; local
684 BString list, last; local
700 list << ", " << last; local
711 list << ", " << last; local
722 list << ", " << last; local
733 list << ", " << last; local
744 list << ", " << last; local
755 list << ", " << last; local
766 list << ", " << last; local
777 list << ", " << last; local
788 list << ", " << last; local
799 list << ", " << last; local
810 list << ", " << last; local
821 list << ", " << last; local
832 list << ", " << last; local
843 list << ", " << last; local
854 list << ", " << last; local
865 list << ", " << last; local
876 list << ", " << last; local
881 list << " & " << last; local
1352 BString list, last; local
1368 list << ", " << last; local
1379 list << ", " << last; local
1385 list << " & " << last; local
[all...]
/haiku/src/add-ons/kernel/bus_managers/scsi/
H A Ddl_list.h53 type *first, *last; \
56 last = first->prefix##prev; \
59 item->prefix##prev = last; \
61 last->prefix##next = item; \
74 type *first, *last; \
77 last = first->prefix##prev; \
80 item->prefix##prev = last; \
82 last->prefix##next = item; \
/haiku/src/add-ons/kernel/generic/locked_pool/
H A Ddl_list.h53 type *first, *last; \
56 last = first->prefix##prev; \
59 item->prefix##prev = last; \
61 last->prefix##next = item; \
74 type *first, *last; \
77 last = first->prefix##prev; \
80 item->prefix##prev = last; \
82 last->prefix##next = item; \
/haiku/src/add-ons/kernel/generic/scsi_periph/
H A Ddl_list.h53 type *first, *last; \
56 last = first->prefix##prev; \
59 item->prefix##prev = last; \
61 last->prefix##next = item; \
74 type *first, *last; \
77 last = first->prefix##prev; \
80 item->prefix##prev = last; \
82 last->prefix##next = item; \
/haiku/src/apps/cortex/DiagramView/
H A DDiagramBox.cpp205 DiagramItem *last = _LastItemUnder(); local
206 if (last && (transit == B_EXITED_VIEW)) {
207 last->MouseOver(point, B_EXITED_VIEW);
212 if (item != last) {
213 if (last)
214 last->MouseOver(point, B_EXITED_VIEW);
219 else if (last)
220 last->MouseOver(point, B_EXITED_VIEW);
232 DiagramItem *last = _LastItemUnder(); local
233 if (last
[all...]
/haiku/src/libs/iconv/
H A Dbig5hkscs1999.h110 unsigned char last = conv->ostate; local
112 if (last) {
113 /* last is = 0x66 or = 0xa7. */
118 r[1] = last + ((wc & 24) >> 2) - 4; /* = 0x62 or 0x64 or 0xa3 or 0xa5 */
129 r[1] = last;
186 unsigned char last = conv->ostate; local
188 if (last) {
192 r[1] = last;
H A Dbig5hkscs2001.h117 unsigned char last = conv->ostate; local
119 if (last) {
120 /* last is = 0x66 or = 0xa7. */
125 r[1] = last + ((wc & 24) >> 2) - 4; /* = 0x62 or 0x64 or 0xa3 or 0xa5 */
136 r[1] = last;
204 unsigned char last = conv->ostate; local
206 if (last) {
210 r[1] = last;
H A Dbig5hkscs2004.h122 unsigned char last = conv->ostate; local
124 if (last) {
125 /* last is = 0x66 or = 0xa7. */
130 r[1] = last + ((wc & 24) >> 2) - 4; /* = 0x62 or 0x64 or 0xa3 or 0xa5 */
141 r[1] = last;
220 unsigned char last = conv->ostate; local
222 if (last) {
226 r[1] = last;
/haiku/src/servers/net/
H A DAutoconfigLooper.cpp98 uint8 last = 56; local
102 last = mac[0] ^ mac[1] ^ mac[2] ^ mac[3] ^ mac[4] ^ mac[5];
103 if (last > 253)
104 last = 253;
105 else if (last == 0)
106 last = 1;
111 // generating the last octet but we could also use the 2 last octets if
114 snprintf(string, sizeof(string), "169.254.0.%u", last);
/haiku/src/add-ons/input_server/filters/shortcut_catcher/
H A DKeyInfos.cpp107 FindSpecialKeyLabelFor(uint8 keyCode, uint32& last) argument
109 while ((keyLabels[last].fKeyCode < keyCode)
110 && (last < (sizeof(keyLabels) / sizeof(struct KeyLabelMap)) - 1)) {
111 last++;
114 if (keyLabels[last].fKeyCode == keyCode)
115 return keyLabels[last].fLabel;
/haiku/src/system/libroot/posix/stdlib/
H A Dmerge.c68 #define ICOPY_LIST(src, dst, last) \
71 while(src < last)
77 #define CCOPY_LIST(src, dst, last) \
80 while (src < last)
105 u_char *list2, *list1, *p2, *p, *last, **p1; local
124 last = list2 + nmemb * size;
126 while (*EVAL(list2) != last) {
129 for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) {
133 if (p2 != last)
219 last
259 u_char *f1, *f2, *s, *l2, *last, *p2; local
[all...]
/haiku/src/libs/icon/flat_icon/
H A DPathCommandQueue.cpp50 BPoint last(B_ORIGIN);
61 if (point.x == last.x) {
65 } else if (point.y == last.y) {
80 last = point;
84 // the last couple commands have not been written
113 BPoint last(B_ORIGIN);
128 point.y = last.y;
135 point.x = last.x;
160 last = point;
/haiku/src/libs/uuid/
H A Dgen_uuid.c231 THREAD_LOCAL struct timeval last = {0, 0}; local
277 last.tv_sec = tv1;
278 last.tv_usec = tv2;
283 if ((last.tv_sec == 0) && (last.tv_usec == 0)) {
286 gettimeofday(&last, 0);
287 last.tv_sec--;
292 if ((tv.tv_sec < last.tv_sec) ||
293 ((tv.tv_sec == last.tv_sec) &&
294 (tv.tv_usec < last
[all...]
/haiku/src/system/kernel/util/
H A Dqueue.cpp38 queue_element *temp, *last = NULL; local
43 if (last)
44 last->next = temp->next;
49 q->tail = last;
53 last = temp;
/haiku/src/system/libroot/posix/unistd/
H A Dfork.c63 // search for last hook (need if an item was added to the beginning only --
65 fork_hook *last = *_hooks;
66 while (last->next)
67 last = last->next;
69 *_lastHook = last;
/haiku/src/system/libroot/posix/malloc_hoard2/
H A Darch-specific.cpp164 free_chunk *chunk = sFreeChunks, *last = NULL; local
169 last = chunk;
189 if (last != NULL) {
190 last->next = next;
197 if (last != NULL)
198 last->next = chunk;
304 free_chunk *chunk = (free_chunk *)sFreeChunks, *last = NULL, *smaller = NULL; local
311 if (last)
312 last->next = chunk->next;
330 last
[all...]
/haiku/src/kits/app/
H A DMessageQueue.cpp54 // The message passed in will be the last message on the queue so its
81 BMessage* last = NULL;
88 last->fQueueLink = entry->fQueueLink;
91 fTail = last;
96 last = entry;

Completed in 217 milliseconds

12345678