/haiku-fatelf/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ath_hal/ar5212/ |
H A D | ar2316.c | 260 * Check first and last elements for out-of-bounds conditions. 471 * for last gain, pdGainBoundary == Pmax_t2, so will 652 int totalD,totalF, totalMin,last, i; local 686 for (last=0,i=0; (i<numChannels) && (freq > data[i].channelValue); 687 last = i++); 688 totalD = data[i].channelValue - data[last].channelValue; 690 totalF = ar2316GetMaxPower(ah, &data[i]) - ar2316GetMaxPower(ah, &data[last]); 691 *maxPow = (int8_t) ((totalF*(freq-data[last].channelValue) + 692 ar2316GetMaxPower(ah, &data[last])*totalD)/totalD); 693 totalMin = ar2316GetMinPower(ah, &data[i]) - ar2316GetMinPower(ah, &data[last]); [all...] |
H A D | ar2317.c | 237 * Check first and last elements for out-of-bounds conditions. 449 * for last gain, pdGainBoundary == Pmax_t2, so will 632 int totalD,totalF, totalMin,last, i; local 666 for (last=0,i=0; (i<numChannels) && (freq > data[i].channelValue); 667 last = i++); 668 totalD = data[i].channelValue - data[last].channelValue; 670 totalF = ar2317GetMaxPower(ah, &data[i]) - ar2317GetMaxPower(ah, &data[last]); 671 *maxPow = (int8_t) ((totalF*(freq-data[last].channelValue) + 672 ar2317GetMaxPower(ah, &data[last])*totalD)/totalD); 673 totalMin = ar2317GetMinPower(ah, &data[i]) - ar2317GetMinPower(ah, &data[last]); [all...] |
H A D | ar2413.c | 254 * Check first and last elements for out-of-bounds conditions. 465 * for last gain, pdGainBoundary == Pmax_t2, so will 647 int totalD,totalF, totalMin,last, i; local 681 for (last=0,i=0; (i<numChannels) && (freq > data[i].channelValue); 682 last = i++); 683 totalD = data[i].channelValue - data[last].channelValue; 685 totalF = ar2413GetMaxPower(ah, &data[i]) - ar2413GetMaxPower(ah, &data[last]); 686 *maxPow = (int8_t) ((totalF*(freq-data[last].channelValue) + 687 ar2413GetMaxPower(ah, &data[last])*totalD)/totalD); 688 totalMin = ar2413GetMinPower(ah, &data[i]) - ar2413GetMinPower(ah, &data[last]); [all...] |
H A D | ar2425.c | 71 * before last Training Sequence 2 (TS2) 255 * Check first and last elements for out-of-bounds conditions. 466 * for last gain, pdGainBoundary == Pmax_t2, so will 610 int totalD,totalF, totalMin,last, i; local 644 for (last=0,i=0; (i<numChannels) && (freq > data[i].channelValue); 645 last = i++); 646 totalD = data[i].channelValue - data[last].channelValue; 648 totalF = ar2425GetMaxPower(ah, &data[i]) - ar2425GetMaxPower(ah, &data[last]); 649 *maxPow = (int8_t) ((totalF*(freq-data[last].channelValue) + 650 ar2425GetMaxPower(ah, &data[last])*total [all...] |
H A D | ar5112.c | 573 * Check first and last elements for out-of-bounds conditions. 772 int numChannels=0,i,last; local 814 for (last=0,i=0; 816 last=i++); 817 totalD = data[i].channelValue - data[last].channelValue; 819 totalF = data[i].maxPower_t4 - data[last].maxPower_t4; 820 *maxPow = (int8_t) ((totalF*(freq-data[last].channelValue) + data[last].maxPower_t4*totalD)/totalD); 822 totalMin = ar5112GetMinPower(ah,&data[i]) - ar5112GetMinPower(ah, &data[last]); 823 *minPow = (int8_t) ((totalMin*(freq-data[last] [all...] |
H A D | ar5413.c | 297 * Check first and last elements for out-of-bounds conditions. 509 * for last gain, pdGainBoundary == Pmax_t2, so will 691 int totalD,totalF, totalMin,last, i; local 727 for (last=0,i=0; (i<numChannels) && (freq > data[i].channelValue); 728 last = i++); 729 totalD = data[i].channelValue - data[last].channelValue; 731 totalF = ar5413GetMaxPower(ah, &data[i]) - ar5413GetMaxPower(ah, &data[last]); 732 *maxPow = (int8_t) ((totalF*(freq-data[last].channelValue) + 733 ar5413GetMaxPower(ah, &data[last])*totalD)/totalD); 734 totalMin = ar5413GetMinPower(ah, &data[i]) - ar5413GetMinPower(ah, &data[last]); [all...] |
/haiku-fatelf/src/tools/docbook/libxml2/ |
H A D | entities.c | 305 if (dtd->last == NULL) { 306 dtd->children = dtd->last = (xmlNodePtr) ret; 308 dtd->last->next = (xmlNodePtr) ret; 309 ret->prev = dtd->last; 310 dtd->last = (xmlNodePtr) ret; 354 if (dtd->last == NULL) { 355 dtd->children = dtd->last = (xmlNodePtr) ret; 357 dtd->last->next = (xmlNodePtr) ret; 358 ret->prev = dtd->last; 359 dtd->last [all...] |
H A D | xpath.c | 275 "?? Unknown error ??\n" /* Must be last in the list! */ 372 /* cleanup current last error */ 597 int last; /* index of last step in expression */ member in struct:_xmlXPathCompExpr 642 cur->last = -1; 738 comp->last = comp->nbStep; 798 xmlXPathCompExprAdd(ctxt->comp, ctxt->comp->last, -1, \ 1307 i = comp->last; 7883 for (cur = cur->prev; cur->last != NULL; cur = cur->last) ; 11111 xmlXPathNodeCollectAndTest(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, xmlNodePtr * first, xmlNodePtr * last) argument 11660 xmlXPathNodeCollectAndTestNth(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, int reqpos, xmlNodePtr * first, xmlNodePtr * last) argument 12269 xmlXPathCompOpEvalLast(xmlXPathParserContextPtr ctxt, xmlXPathStepOpPtr op, xmlNodePtr * last) argument 12442 xmlNodePtr last = NULL; local 13133 xmlNodePtr last = NULL; local [all...] |
/haiku-fatelf/headers/libs/agg/ |
H A D | agg_scanline_u.h | 45 // than the last stored one, i.e. it works only with ordered coordinates. 373 m_spans.last().len++; 389 m_spans.last().len += coord_type(len); 407 m_spans.last().len += coord_type(len);
|
/haiku-fatelf/src/bin/gdb/readline/support/ |
H A D | wcwidth.c | 14 unsigned short last; member in struct:interval 22 if (ucs < table[0].first || ucs > table[max].last) 26 if (ucs > table[mid].last)
|
/haiku-fatelf/src/libs/ncurses/menu/ |
H A D | m_driver.c | 44 /* Remove the last character from the match pattern buffer */ 122 int idx, last; local 146 last = idx; /* this closes the cycle */ 168 while (!found && (idx != last));
|
/haiku-fatelf/src/libs/zlib/ |
H A D | trees.c | 105 * 3 .. 258, the last 256 values correspond to the top 8 bits of 329 # define SEPARATOR(i, last, width) \ 330 ((i) == (last)? "\n};\n\n" : \ 597 /* Check that the bit counts in bl_count are consistent. The last code 717 int prevlen = -1; /* last emitted length */ 762 int prevlen = -1; /* last emitted length */ 805 * bl_order of the last bit length code to send. 810 int max_blindex; /* index of last bit length code of non zero freq */ 871 void ZLIB_INTERNAL _tr_stored_block(s, buf, stored_len, last) 875 int last; /* on [all...] |
H A D | infutil.h | 23 DONE, /* finished last block, done */ 48 uInt last; /* true if this block is the last block */ member in struct:inflate_blocks_state
|
/haiku-fatelf/src/system/kernel/ |
H A D | low_resource_manager.cpp | 456 low_resource_handler* last = NULL; local 461 sLowResourceHandlers.Insert(last, newHandler); 464 last = handler;
|
/haiku-fatelf/src/add-ons/kernel/drivers/network/ipro1000/dev/e1000/ |
H A D | if_igb.h | 337 * First/last mbuf pointers, for 524 #define UPDATE_VF_REG(reg, last, cur) \ 527 if (new < last) \ 529 last = new; \
|
/haiku-fatelf/headers/cpp/std/ |
H A D | bastring.h | 218 basic_string& append(InputIterator first, InputIterator last) argument 220 basic_string& append(const_iterator first, const_iterator last) 222 { return replace (iend (), iend (), first, last); } 238 basic_string& assign(InputIterator first, InputIterator last) argument 240 basic_string& assign(const_iterator first, const_iterator last) 242 { return replace (ibegin (), iend (), first, last); } 275 void insert(iterator p, InputIterator first, InputIterator last) argument 277 void insert(iterator p, const_iterator first, const_iterator last) 279 { replace (p, p, first, last); }
|
/haiku-fatelf/headers/os/interface/ |
H A D | SplitView.h | 48 void SetCollapsible(int32 first, int32 last,
|
/haiku-fatelf/src/apps/mediaplayer/interface/ |
H A D | PeakView.cpp | 393 uint32 last = (uint32)(peak * (evenWidth - 1) + 0.5); local 394 last += last & 1; 415 if (x == last) {
|
/haiku-fatelf/src/bin/coreutils/src/ |
H A D | who.c | 113 the keyboard, or "." if within the last minute, or "old" if 114 not within the last day. */ 127 /* If true, display the last boot time. */ 139 /* If true, display the last clock change. */ 185 BOOTTIME is the time of last reboot. 503 unsigned char last = UT_PID (utmp_ent) / 256; local 511 comment = xmalloc (strlen (_("last=")) + 2); 512 sprintf (comment, "%s%c", _("last="), (last == 'N') ? 'S' : last); [all...] |
/haiku-fatelf/src/bin/gdb/gdb/ |
H A D | infrun.c | 243 /* Function inferior was in as of last step command. */ 299 /* This is a cached copy of the pid/waitstatus of the last event 649 /* Get the last target status returned by target_wait(). */ 691 /* Record the pc of the program the last time it stopped. This is 1009 last time that this function is called for a single execution 1089 /* Return the cached copy of the last pid/waitstatus returned by 1240 /* Cache the last pid/waitstatus. */ 1425 ignore all but the last one. Just resume the exec'r, and wait 2241 beyond the step range, and NOT the address of the last instruction 2507 /* If this is the last lin 2877 struct target_waitstatus last; local 3594 struct target_waitstatus last; local 3612 struct target_waitstatus last; local 3630 struct target_waitstatus last; local [all...] |
H A D | rs6000-nat.c | 754 bfd *abfd, *last; 791 last = 0; 793 while ((last = bfd_openr_next_archived_file (abfd, last))) 794 if (DEPRECATED_STREQ (mem, last->filename)) 797 if (!last) 804 if (!bfd_check_format (last, bfd_object)) 808 bfd_close (last); 813 vp = map_vmap (last, abfd); 752 bfd *abfd, *last; local
|
/haiku-fatelf/src/bin/network/wget/tests/ |
H A D | Test-proxied-https-auth.px | 32 last if $line eq "\r\n";
|
/haiku-fatelf/src/libs/pdflib/libs/flate/ |
H A D | infutil.h | 26 DONE, /* finished last block, done */ 51 uInt last; /* true if this block is the last block */ member in struct:inflate_blocks_state
|
/haiku-fatelf/src/tools/docbook/libxml2/include/libxml/ |
H A D | entities.h | 43 struct _xmlNode *last; /* Last child link */ member in struct:_xmlEntity
|
/haiku-fatelf/src/kits/locale/ |
H A D | LocaleRoster.cpp | 572 int32 last = signature.FindLast(':'); local 573 if (first == last) 580 context.Truncate(last); 582 string.Remove(0, last + 1);
|