Searched refs:last (Results 101 - 125 of 387) sorted by relevance

1234567891011>>

/haiku-fatelf/src/add-ons/kernel/bus_managers/agp_gart/
H A Dagp_gart.cpp747 aperture_memory *current = fFirstMemory, *last = NULL; local
751 if (last != NULL) {
752 last->next = current->next;
759 last = current;
769 aperture_memory *last = NULL; local
796 last = next;
801 if (last == NULL) {
807 last = next;
815 if (next->base >= ROUNDUP(last->base + last
[all...]
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DBlockReferenceManager.cpp57 uint32 last = (uint32)(table->GetReferences() + table->GetSize()); local
58 if (first <= address && address < last)
/haiku-fatelf/src/add-ons/media/plugins/asf_reader/libasf/
H A Dasfint.h66 struct asfint_object_s *last; member in struct:asf_object_headerext_s
77 struct asfint_object_s *last; member in struct:asf_object_header_s
/haiku-fatelf/src/libs/libfdt/
H A Dfdt.c204 const char *last = strtab + tabsize - len; local
207 for (p = strtab; p <= last; p++)
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DBlockReferenceManager.cpp59 uint32 last = (uint32)(table->GetReferences() + table->GetSize()); local
60 if (first <= address && address < last)
/haiku-fatelf/data/etc/bash_completion.d/helpers/
H A Dperl61 last if -r $perlfunc;
/haiku-fatelf/headers/private/fs_shell/
H A DSinglyLinkedList.h197 Element* last = NULL; local
199 last = next;
204 if (last == NULL)
207 sGetLink(last)->next = elementLink->next;
/haiku-fatelf/headers/private/kernel/util/
H A DSinglyLinkedList.h202 Element* last = NULL; local
206 last = next;
211 if (last == NULL)
214 sGetLink(last)->next = elementLink->next;
/haiku-fatelf/src/apps/cortex/Persistence/
H A DImporter.h110 bool last);
/haiku-fatelf/src/bin/gdb/gdb/osf-share/
H A Dcma_stack_int.h110 cma_t_address last; /* Last protected byte */
120 cma_t_address last_guard; /* last address of guard pages */
109 cma_t_address last; /* Last protected byte */ member in struct:CMA___T_INT_HOLE
/haiku-fatelf/src/bin/gdb/opcodes/
H A Dv850-dis.c155 We may need to output a trailing ']' if the last operand
257 unsigned long int last; local
270 last = bit;
272 if (last > first + 1)
274 info->fprintf_func (info->stream, " - %s", v850_reg_names[ last - 1 ]);
/haiku-fatelf/src/libs/edit/
H A Dchared.h102 char *last; member in struct:c_kill_t
H A Dhist.h51 char *last; /* The last character */ member in struct:el_history_t
/haiku-fatelf/src/add-ons/kernel/generic/atomizer/
H A Datomizer.c135 atomizer_data_list *last = 0; local
145 last = adl;
162 if (last) last->next = adl;
239 atomizer_data_list *last = 0; local
245 last = adl;
254 /* the system atomizer is always first, so last will be non-zero */
255 last->next = adl->next;
/haiku-fatelf/src/libs/pdflib/libs/flate/
H A Dinfblock.c1 /* infblock.c -- interpret and process block types to last block
47 Huffman codes, but the last two had better not show up in the data.
60 really is 258. The last length deserves its own, short code
144 s->last = t & 1;
149 s->last ? " (last)" : ""));
157 s->last ? " (last)" : ""));
175 s->last ? " (last)"
[all...]
/haiku-fatelf/src/system/libroot/posix/malloc/
H A Dwrapper.cpp190 block* last = sUsedList; local
191 while (last != NULL && last->getNext() != b) {
192 last = last->getNext();
195 if (last == NULL) {
199 last->setNext(b->getNext());
/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5416/
H A Dar2133.c341 int numChannels=0,i,last;
372 for (last=0,i=0;
374 last=i++);
375 totalD = data[i].channelValue - data[last].channelValue;
377 totalF = data[i].maxPower_t4 - data[last].maxPower_t4;
378 *maxPow = (int8_t) ((totalF*(chan->channel-data[last].channelValue) + data[last].maxPower_t4*totalD)/totalD);
380 totalMin = ar2133GetMinPower(ah,&data[i]) - ar2133GetMinPower(ah, &data[last]);
381 *minPow = (int8_t) ((totalMin*(chan->channel-data[last].channelValue) + ar2133GetMinPower(ah, &data[last])*total
[all...]
/haiku-fatelf/src/bin/bash/lib/readline/
H A Dhistory.c402 register int i, last; local
415 last = -1;
423 last = i;
428 if (which == -2 && last >= 0)
430 entry = the_history[last];
/haiku-fatelf/src/bin/network/tcpdump/libpcap/
H A Doptimize.c703 struct slist *next, *last; local
710 last = s;
726 last = next;
816 * it is defined by the last stmt of this sequence
817 * (i.e., the last statement of the sequence loads
841 if (last->s.code == (BPF_ALU|BPF_SUB|BPF_X)) {
854 last->s.code = NOP;
866 last->s.code = NOP;
877 else if (last->s.code == (BPF_ALU|BPF_SUB|BPF_K)) {
878 last
1171 struct stmt *last[N_ATOMS]; local
[all...]
/haiku-fatelf/src/bin/network/telnetd/
H A Dstate.c376 * my_state = the last negotiated state
414 * us not only the last negotiated state, but also tells us what the peer
1264 int last = -1; /* invalid value */ local
1286 if (last < 0 || last == OLD_ENV_VAR
1287 || (empty && (last == OLD_ENV_VALUE)))
1290 last = OLD_ENV_VAR;
1293 if (last < 0 || last == OLD_ENV_VALUE
1294 || (empty && (last
[all...]
/haiku-fatelf/src/kits/mail/
H A Dmail_util.cpp293 // partial UTF-8 character split over the end of the buffer from last
354 // switched back to ASCII at the end (otherwise the last character gets
545 // replace the last char
615 // last character in the word.
1116 // Set p1 to the first letter in the name and p2 to just past the last
1359 zoneDeltaTime = 60 * atol (tempZoneString + 3); // Get the last two digits - minutes.
1471 int32 last = first + 1; local
1472 while (string[last] && string[last] != '"')
1473 last
1483 int32 last = address.FindFirst('>'); local
1495 int32 last = first + 1; local
[all...]
/haiku-fatelf/src/libs/pdflib/libs/tiff/
H A Dtif_dirinfo.c383 static const TIFFFieldInfo *last = NULL; local
386 if (last && last->field_tag == tag &&
387 (dt == TIFF_ANY || dt == last->field_type))
388 return (last);
394 return (last = fip);
/haiku-fatelf/src/servers/print/
H A DConfigWindow.cpp517 int32 first, last, copies; local
519 && fJobSettings.FindInt32(PSRV_FIELD_LAST_PAGE, &last) ==
522 bool printRange = first >= 1 && first <= last && last != INT_MAX;
530 snprintf(number, sizeof(number), "%d", (int)last);
544 snprintf(number, sizeof(number), "%d", (int)last);
/haiku-fatelf/src/add-ons/kernel/file_systems/bfs/
H A DInode.cpp628 // find the last attribute
629 small_data* last = next; local
630 while (!last->IsLast(node))
631 last = last->Next();
633 int32 size = (uint8*)last - (uint8*)next;
640 // Move the "last" one to its new location and
642 last = (small_data*)((uint8*)last - ((uint8*)next - (uint8*)item));
643 memset(last,
737 small_data* last = item; local
1810 int32 last = free - 1; local
1873 int32 last = free - 1; local
[all...]
/haiku-fatelf/src/apps/diskprobe/
H A DDataView.cpp524 // draw block (and last line) if necessary
527 int32 last = (fEnd / kBlockSize) * kBlockSize; local
529 if (last >= first) {
531 last += kBlockSize;
532 if (last > first) {
533 block = SelectionFrame(which, first, last - 1);
538 lastLine = SelectionFrame(which, last, last + end);
635 // draw block (and last line) if necessary
638 int32 last local
992 int32 last = ((fEnd + width) & ~width) - 1; local
[all...]

Completed in 244 milliseconds

1234567891011>>