Searched refs:last (Results 1 - 25 of 185) 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/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.c39 const char *cur, *last; local
55 /* the last position where its possible to find "s" in "l" */
56 last = cl + l_len - s_len;
58 for (cur = cl; cur <= last; cur++)
/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.cpp55 BString list, last; local
70 if (last != "")
71 list << ", " << last; local
72 last = "Buffer consumer";
81 if (last != "")
82 list << ", " << last; local
83 last = "Time source";
92 if (last != "")
93 list << ", " << last; local
94 last
104 list << ", " << last; local
115 list << ", " << last; local
126 list << ", " << last; local
137 list << ", " << last; local
148 list << ", " << last; local
154 list << " & " << last; local
632 BString list, last; local
648 list << ", " << last; local
659 list << ", " << last; local
670 list << ", " << last; local
681 list << ", " << last; local
692 list << ", " << last; local
703 list << ", " << last; local
714 list << ", " << last; local
725 list << ", " << last; local
736 list << ", " << last; local
747 list << ", " << last; local
758 list << ", " << last; local
769 list << ", " << last; local
780 list << ", " << last; local
791 list << ", " << last; local
802 list << ", " << last; local
813 list << ", " << last; local
824 list << ", " << last; local
829 list << " & " << last; local
1221 BString list, last; local
1237 list << ", " << last; local
1248 list << ", " << last; local
1254 list << " & " << last; local
[all...]
/haiku/src/libs/libcxxrt/
H A Dcxa_atexit.c57 struct atexit_handler **last = &head; local
60 *last = h->next;
64 last = &h->next;
/haiku/src/add-ons/input_server/filters/shortcut_catcher/
H A DKeyInfos.cpp105 FindSpecialKeyLabelFor(uint8 keyCode, uint32& last) argument
107 while ((keyLabels[last].fKeyCode < keyCode)
108 && (last < (sizeof(keyLabels) / sizeof(struct KeyLabelMap)) - 1)) {
109 last++;
112 if (keyLabels[last].fKeyCode == keyCode)
113 return keyLabels[last].fLabel;
/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/system/libnetwork/netresolv/isc/
H A Dev_waits.c63 if (wl->last != NULL)
64 wl->last->next = new;
67 wl->last = new;
92 if (ctx->waitDone.last != NULL)
93 ctx->waitDone.last->next = first;
96 ctx->waitDone.last = wl->last;
125 if (wl->last == this)
126 wl->last = prev;
144 if (ctx->waitDone.last
[all...]
/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)
117 u_char *last; local
142 last = list2 + nmemb * size;
144 while (*EVAL(list2) != last) {
147 for (tp2 = p2 = list2; p2 != last; p1 = EVAL(l2)) {
151 if (p2 != last)
237 last
277 u_char *f1, *f2, *s, *l2, *last, *p2; local
[all...]
/haiku/src/libs/icon/flat_icon/
H A DPathCommandQueue.cpp47 BPoint last(B_ORIGIN);
58 if (point.x == last.x) {
62 } else if (point.y == last.y) {
77 last = point;
81 // the last couple commands have not been written
110 BPoint last(B_ORIGIN);
125 point.y = last.y;
132 point.x = last.x;
157 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/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;
/haiku/headers/os/net/
H A DGopherRequest.h31 void _ParseInput(bool last);

Completed in 222 milliseconds

12345678