Searched refs:last (Results 51 - 75 of 387) sorted by relevance

1234567891011>>

/haiku-fatelf/src/libs/ncurses/ncurses/tinfo/
H A Dparse_entry.c74 unsigned first, last, n; local
80 last = tp->ext_Booleans;
86 last = tp->ext_Numbers + first;
92 last = tp->ext_Strings + first;
119 for (n = first, found = FALSE; n < last; n++) {
146 for (last = tp->num_Booleans - 1; last > tindex; last--)
147 tp->Booleans[last] = tp->Booleans[last
[all...]
H A Dcomp_parse.c78 * | NULL |<--+---- |<--+---- | last
98 newp->last = _nc_tail;
102 if (newp->last)
103 newp->last->next = newp;
119 ENTRY *ep, *last; local
121 for (last = 0, ep = headp; ep != 0; last = ep, ep = ep->next) {
123 if (last != 0)
124 last->next = ep->next;
226 for (_nc_head = _nc_tail; _nc_head->last; _nc_hea
[all...]
/haiku-fatelf/src/preferences/dun/
H A DDUNWindow.cpp227 { //post: window has been set to last state :-)
464 if(last.x == 1 && last.y == 0)
484 if(last.x == 0 && last.y == 1)
503 if(last.x == 0 && last.y == 0)
541 if(last.x == 1 && last.y == 0)
562 if(last
[all...]
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar9002/
H A Dar9280.c222 int numChannels=0,i,last;
253 for (last=0,i=0;
255 last=i++);
256 totalD = data[i].channelValue - data[last].channelValue;
258 totalF = data[i].maxPower_t4 - data[last].maxPower_t4;
259 *maxPow = (int8_t) ((totalF*(chan->channel-data[last].channelValue) + data[last].maxPower_t4*totalD)/totalD);
261 totalMin = ar9280GetMinPower(ah,&data[i]) - ar9280GetMinPower(ah, &data[last]);
262 *minPow = (int8_t) ((totalMin*(chan->channel-data[last].channelValue) + ar9280GetMinPower(ah, &data[last])*total
[all...]
H A Dar9287.c228 int numChannels=0,i,last;
259 for (last=0,i=0;
261 last=i++);
262 totalD = data[i].channelValue - data[last].channelValue;
264 totalF = data[i].maxPower_t4 - data[last].maxPower_t4;
265 *maxPow = (int8_t) ((totalF*(chan->channel-data[last].channelValue) + data[last].maxPower_t4*totalD)/totalD);
267 totalMin = ar9287GetMinPower(ah,&data[i]) - ar9287GetMinPower(ah, &data[last]);
268 *minPow = (int8_t) ((totalMin*(chan->channel-data[last].channelValue) + ar9287GetMinPower(ah, &data[last])*total
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ext2/
H A DExtentStream.cpp185 ext2_extent_entry &last = stream->extent_entries[ local
187 TRACE("Enlarge() last %lld allocatedPos %lld\n",
188 last.PhysicalBlock() + last.Length(), fAllocatedPos);
189 if (last.PhysicalBlock() + last.Length() == fAllocatedPos
190 && (last.Length() + allocated) <= EXT2_EXTENT_MAX_LENGTH) {
198 .SetLength(last.Length() + allocated);
397 ext2_extent_entry &last = stream->extent_entries[index]; local
398 if (last
437 ext2_extent_index &last = stream->extent_index[index]; local
[all...]
/haiku-fatelf/src/add-ons/translators/rtf/
H A DRTF.cpp168 char last; local
169 header.Parse('\0', fStream, last);
172 char c = last;
221 element->Parse(c, fStream, last);
222 c = last;
295 Group::Parse(char first, BDataIO &stream, char &last) throw (status_t) argument
303 last = read_char(stream);
455 Header::Parse(char first, BDataIO &stream, char &last) throw (status_t) argument
460 fVersion = parse_integer(first, stream, last);
532 Text::Parse(char first, BDataIO &stream, char &last) thro argument
616 Parse(char first, BDataIO &stream, char &last) argument
[all...]
/haiku-fatelf/src/tests/add-ons/kernel/kernelland_emu/
H A Dlock.cpp30 mutex_waiter* last; // last in queue (valid for the first in queue) member in struct:mutex_waiter
36 rw_lock_waiter* last; // last in queue (valid for the first in queue) member in struct:rw_lock_waiter
199 lock->waiters->last->next = &waiter;
203 lock->waiters->last = &waiter;
235 lock->waiters->last = waiter->last;
251 lock->waiters->last = waiter->last;
[all...]
/haiku-fatelf/headers/libs/agg/
H A Dagg_scanline_p.h247 if(x == m_last_x+1 && m_spans.size() && m_spans.last().len > 0)
249 m_spans.last().len++;
263 if(x == m_last_x+1 && m_spans.size() && m_spans.last().len > 0)
265 m_spans.last().len += coord_type(len);
280 m_spans.last().len < 0 &&
281 cover == *m_spans.last().covers)
283 m_spans.last().len -= coord_type(len);
/haiku-fatelf/src/bin/gdb/gdb/
H A Dreggroups.c74 struct reggroup_el **last; member in struct:reggroups
84 groups->last = &groups->first;
98 (*groups->last) = el;
99 groups->last = &el->next;
125 reggroup_next (struct gdbarch *gdbarch, struct reggroup *last) argument
138 if (last == NULL)
142 if (el->group == last)
/haiku-fatelf/src/system/kernel/arch/ppc/
H A Darch_debug.cpp34 int32 last = *_last; local
39 if (visited[(NUM_PREVIOUS_LOCATIONS + last - i)
45 *_last = last = (last + 1) % NUM_PREVIOUS_LOCATIONS;
46 visited[last] = framePointer;
123 int32 i, num = 0, last = 0; local
237 if (already_visited(previousLocations, &last, &num, framePointer)) {
/haiku-fatelf/src/system/kernel/
H A Dtimer.cpp75 timer* last = NULL; local
78 for (next = *list; next; last = next, next = (timer*)next->next) {
83 if (last != NULL) {
84 event->next = last->next;
85 last->next = event;
420 timer* last = NULL; local
425 if (last == NULL)
428 last->next = current->next;
433 last = current;
/haiku-fatelf/src/add-ons/kernel/file_systems/ntfs/libntfs/
H A Dlist.h153 struct list_head *last = list->prev; local
159 last->next = at;
160 at->prev = last;
/haiku-fatelf/src/kits/media/
H A DRealtimeAlloc.cpp180 FreeChunk* last = &pool->free_anchor; local
182 last = chunk;
187 last->fNext = this;
226 FreeChunk* last = &free_anchor; local
237 last->SetNext(freedChunk->Next());
238 chunk = last;
244 last = chunk;
360 FreeChunk* last = &pool->free_anchor; local
362 last = chunk;
378 last
[all...]
/haiku-fatelf/src/bin/bash/lib/readline/
H A Dhistexpand.c113 /* The last string searched for by a !?string? search. */
116 /* The last string matched by a !?string? search. */
416 no previous pattern for the lhs, the last history search
643 /* :p means make this the last executed line. So we
650 /* :t discards all but the last part of the pathname. */
662 /* :h discards the last part of a pathname. */
689 for each occurrence of `this'. :& repeats the last
690 substitution. :g& repeats the last substitution
723 uses the last search string as the lhs. */
791 the last tim
1245 int first, last; local
[all...]
/haiku-fatelf/src/bin/gdb/readline/
H A Dhistexpand.c110 /* The last string searched for by a !?string? search. */
113 /* The last string matched by a !?string? search. */
411 no previous pattern for the lhs, the last history search
632 /* :p means make this the last executed line. So we
639 /* :t discards all but the last part of the pathname. */
651 /* :h discards the last part of a pathname. */
678 for each occurrence of `this'. :& repeats the last
679 substitution. :g& repeats the last substitution
712 uses the last search string as the lhs. */
1174 to point to just after the last characte
1181 int first, last; local
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/nfs/
H A DRPCPendingCalls.c73 struct PendingCall *last=NULL; local
87 if (last)
88 last->next=current->next;
99 last=current;
/haiku-fatelf/src/add-ons/translators/exr/openexr/ilmimf/
H A DImfChannelList.h205 Iterator &last);
209 ConstIterator &last) const;
226 Iterator &last);
230 ConstIterator &last) const;
/haiku-fatelf/src/apps/cortex/DiagramView/
H A DDiagramView.cpp443 DiagramItem *last = _LastItemUnder(); local
446 if (last)
448 last->MessageDragged(point, B_EXITED_VIEW, message);
457 if (item != last)
459 if (last)
460 last->MessageDragged(point, B_EXITED_VIEW, message);
468 else if (last)
470 last->MessageDragged(point, B_EXITED_VIEW, message);
484 DiagramItem *last = _LastItemUnder(); local
487 if (last)
[all...]
/haiku-fatelf/src/bin/bc/bc/
H A Dmain.c41 /* Points to the last node in the file name list for easy adding. */
42 static file_node *last = NULL; variable
142 if (last == NULL)
145 last->next = temp;
146 last = temp;
/haiku-fatelf/src/libs/edit/
H A Dhist.c55 el->el_history.last = el->el_history.buf;
99 (el->el_history.last - el->el_history.buf);
196 el->el_history.last = newbuf +
197 (el->el_history.last - el->el_history.buf);
/haiku-fatelf/src/libs/ncurses/ncurses/base/
H A Dlib_getstr.c47 * This wipes out the last character, no matter whether it was a tab, control
51 WipeOut(WINDOW *win, int y, int x, char *first, char *last, bool echoed) argument
53 if (last > first) {
54 *--last = '\0';
69 return last;
159 * If the last waddch forced a wrap &
/haiku-fatelf/src/libs/ncurses/ncurses/widechar/
H A Dlib_get_wstr.c58 * This wipes out the last character, no matter whether it was a tab, control
62 WipeOut(WINDOW *win, int y, int x, wint_t *first, wint_t *last, bool echoed) argument
64 if (last > first) {
65 *--last = '\0';
83 return last;
186 * If the last waddch forced a wrap & scroll, adjust our
/haiku-fatelf/src/libs/ncurses/test/
H A Drailroad.c109 int ch, first, last; local
129 last = ch;
137 if (first < last) {
139 while (first < last) {
/haiku-fatelf/src/libs/zlib/
H A Dinflate.h32 TYPE, /* i: waiting for type bits, including last-flag bit */
83 int last; /* true if processing last block */ member in struct:inflate_state
120 int back; /* bits back of last unprocessed length/lit */

Completed in 135 milliseconds

1234567891011>>