Searched refs:last (Results 226 - 250 of 917) sorted by relevance

1234567891011>>

/freebsd-current/sys/compat/linux/
H A Dlinux_util.c262 char *temp, *string, *last; local
268 last = "";
273 if (strcmp(last, de->entry.bsd_driver_name) != 0) {
274 last = de->entry.bsd_driver_name;
/freebsd-current/sys/riscv/riscv/
H A Dtimer.c279 uint64_t first, last; local
314 last = get_timecount();
315 counts -= (int64_t)(last - first);
316 first = last;
/freebsd-current/sys/contrib/openzfs/module/zfs/
H A Ddmu_diff.c72 report_free_dnode_range(dmu_diffarg_t *da, uint64_t first, uint64_t last) argument
74 ASSERT(first <= last);
81 da->da_ddr.ddr_last = last;
84 da->da_ddr.ddr_last = last;
H A Dvdev_indirect_mapping.c128 * 3. The last case to consider is if the offset actually falls
184 uint64_t last = vim->vim_phys->vimp_num_entries - 1; local
194 while (last >= base) {
195 mid = base + ((last - base) >> 1);
204 last = mid - 1;
211 ASSERT3U(base, ==, last + 1);
212 ASSERT(mid == base || mid == last);
219 * offset. We reuse the result of the last comparison,
390 * of the last entry).
/freebsd-current/tools/tools/net80211/w00t/expand/
H A Dexpand.c77 struct timeval last; member in struct:params
117 struct queue *last = NULL; local
129 last = q;
144 assert(last);
145 last->next = q;
173 if (gettimeofday(&p->last, NULL) == -1)
381 el = elapsed(&p->last, &tv);
/freebsd-current/contrib/blocklist/bin/
H A Dblacklistd.c211 "last=%s now=%s", __func__, rbuf, dbi.count, c.c_nfail,
212 fmttime(b1, sizeof(b1), dbi.last),
230 dbi.last = ts.tv_sec;
252 if (dbi.last == 0)
255 dbi.last = 0;
271 "last=%s now=%s", __func__, rbuf, dbi.count, c.c_nfail,
272 fmttime(b1, sizeof(b1), dbi.last),
311 time_t when = c.c_duration + dbi.last;
316 "last=%s " "now=%s", __func__, n, buf, dbi.count,
317 c.c_duration, fmttime(b1, sizeof(b1), dbi.last),
[all...]
/freebsd-current/sys/contrib/ncsw/Peripherals/FM/Pcd/
H A Dfm_replic.c64 /* the last member index is different between add and remove operation -
65 in case of remove - this is exactly the last member index
66 in case of add - this is the last member index + 1 - e.g.
67 if we have 4 members, the index of the actual last member is 3(because the
68 index starts from 0) therefore in order to add a new member as the last
76 /* last */
206 /* Check if the next member exists or it's NULL (- means that this is the last member) */
246 static void FillReplicAdOfTypeResult(void *p_ReplicAd, bool last) argument
252 if (last)
253 /* clear the NL bit in case it's the last membe
280 BuildShadowAndModifyDescriptor(t_FmPcdFrmReplicGroup *p_ReplicGroup, t_FmPcdFrmReplicMember *p_NextMember, t_FmPcdFrmReplicMember *p_CurrentMember, bool sourceDescriptor, bool last) argument
396 InitMember(t_FmPcdFrmReplicGroup *p_ReplicGroup, t_FmPcdCcNextEngineParams *p_MemberParams, bool last) argument
679 bool last = FALSE; local
[all...]
/freebsd-current/sys/dev/ath/ath_hal/ar5416/
H A Dar2133.c369 int numChannels=0,i,last;
400 for (last=0,i=0;
402 last=i++);
403 totalD = data[i].channelValue - data[last].channelValue;
405 totalF = data[i].maxPower_t4 - data[last].maxPower_t4;
406 *maxPow = (int8_t) ((totalF*(chan->channel-data[last].channelValue) + data[last].maxPower_t4*totalD)/totalD);
408 totalMin = ar2133GetMinPower(ah,&data[i]) - ar2133GetMinPower(ah, &data[last]);
409 *minPow = (int8_t) ((totalMin*(chan->channel-data[last].channelValue) + ar2133GetMinPower(ah, &data[last])*total
[all...]
/freebsd-current/tools/tools/net80211/w00t/prga/
H A Dprga.c64 struct timeval last; member in struct:params
251 if (gettimeofday(&p->last, NULL) == -1)
259 int last = 0; local
276 last = 1;
284 if (!last)
317 printf("Sening %sfrag [%d/%d] [len=%d]\n", last ? "last " : "",
320 if (last) {
345 el = elapsed(&p->last, &now);
391 if (gettimeofday(&p->last, NUL
[all...]
/freebsd-current/usr.bin/netstat/
H A Dsctp.c163 if (xladdr->last == 1)
170 if (xstcb->last == 1)
178 if (xladdr->last == 1)
185 if (xraddr->last == 1)
219 if (xladdr->last == 1)
240 if (xraddr->last == 1)
402 if (xladdr->last) {
465 if (aflag && (xladdr_total == 0) && xstcb->last && !process_closed) {
470 while (xstcb->last == 0 && *offset < buflen) {
516 while (xinpcb->last
[all...]
/freebsd-current/contrib/libdiff/lib/
H A Ddiff_main.c240 struct diff_chunk *last; local
258 last = &result->head[result->len - 1];
260 == last->left_start + last->left_count);
262 == last->right_start + last->right_count);
303 last = &result->head[result->len - 1];
304 new_chunk->right_start = last->right_start;
314 last = &result->head[result->len - 1];
315 last
[all...]
/freebsd-current/usr.sbin/ppp/
H A Dthroughput.c121 "(over the last %d secs)\n",
284 char *time_buf, *last; local
287 last = time_buf + strlen(time_buf);
288 if (last > time_buf && *--last == '\n')
289 *last = '\0';
/freebsd-current/sbin/nvmecontrol/
H A Dcomnd.c318 struct cmd *walker, *last; local
324 last = NULL;
328 last = walker;
330 if (last == NULL) {
333 SLIST_INSERT_AFTER(last, cmd, link);
/freebsd-current/sys/dev/vnic/
H A Dthunder_bgx_fdt.c151 char last; local
195 last = phy_name[sz - 1];
196 if (last == '\0' || last == '@' || isdigit(last))
/freebsd-current/sys/dev/usb/controller/
H A Duhci.c601 * end TD which hangs from the last QH, to avoid a bug in the PIIX
824 * Let the last QH loop back to the full speed control transfer QH.
888 #define UHCI_APPEND_TD(std,last) (last) = _uhci_append_td(std,last)
890 _uhci_append_td(uhci_td_t *std, uhci_td_t *last) argument
892 DPRINTFN(11, "%p to %p\n", std, last);
896 std->next = last->next;
897 std->td_next = last->td_next;
899 std->prev = last;
916 _uhci_append_qh(uhci_qh_t *sqh, uhci_qh_t *last) argument
952 _uhci_remove_td(uhci_td_t *std, uhci_td_t *last) argument
972 _uhci_remove_qh(uhci_qh_t *sqh, uhci_qh_t *last) argument
[all...]
H A Dehci.c425 /* the last (1ms) QH terminates */
918 #define EHCI_APPEND_FS_TD(std,last) (last) = _ehci_append_fs_td(std,last)
920 _ehci_append_fs_td(ehci_sitd_t *std, ehci_sitd_t *last) argument
922 DPRINTFN(11, "%p to %p\n", std, last);
926 std->next = last->next;
927 std->sitd_next = last->sitd_next;
929 std->prev = last;
934 * the last
946 _ehci_append_hs_td(ehci_itd_t *std, ehci_itd_t *last) argument
972 _ehci_append_qh(ehci_qh_t *sqh, ehci_qh_t *last) argument
1004 _ehci_remove_fs_td(ehci_sitd_t *std, ehci_sitd_t *last) argument
1024 _ehci_remove_hs_td(ehci_itd_t *std, ehci_itd_t *last) argument
1044 _ehci_remove_qh(ehci_qh_t *sqh, ehci_qh_t *last) argument
[all...]
/freebsd-current/contrib/llvm-project/clang/lib/Frontend/
H A DVerifyDiagnosticConsumer.cpp709 // Detach comment handler once last active source file completed.
718 // Check diagnostics once last file completed.
793 for (size_t last = 0;; loc = C.find('\\', last)) {
795 C2 += C.substr(last);
798 C2 += C.substr(last, loc-last);
799 last = loc + 1;
801 if (C[last] == '\n' || C[last]
[all...]
/freebsd-current/sys/contrib/zlib/
H A Dcrc32.c581 z_size_t last, last2, i; local
626 /* Do one last smaller batch with the remaining words, if there are enough
628 last = num / 3;
629 if (last >= Z_BATCH_MIN) {
630 last2 = last << 1;
633 for (i = 0; i < last; i++) {
635 val1 = word[i + last];
641 word += 3 * last;
642 num -= 3 * last;
643 val = x2nmodp(last,
[all...]
/freebsd-current/sys/fs/ext2fs/
H A Dext2_inode.c128 e2fs_lbn_t nb, nlbn, last; local
132 * Calculate index in current block of last
139 last = lastbn;
141 last /= factor;
171 bzero((caddr_t)&bap[last + 1],
172 (NINDIR(fs) - (last + 1)) * sizeof(e2fs_daddr_t));
173 if (last == -1)
187 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
203 * Recursively free last partial block.
206 last
[all...]
/freebsd-current/sys/compat/linuxkpi/common/include/linux/
H A Dlist.h276 struct list_head *last)
278 first->prev->next = last->next;
279 last->next->prev = first->prev;
282 last->next = head;
283 head->prev = last;
291 struct list_head *last; local
296 last = list->prev;
299 last->next = next;
300 next->prev = last;
275 list_bulk_move_tail(struct list_head *head, struct list_head *first, struct list_head *last) argument
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ADT/
H A DHashing.h415 hash_code hash_combine_range_impl(InputIteratorT first, InputIteratorT last) { argument
419 while (first != last && store_and_advance(buffer_ptr, buffer_end,
422 if (first == last)
428 while (first != last) {
429 // Fill up the buffer. We don't clear it, which re-mixes the last round
432 while (first != last && store_and_advance(buffer_ptr, buffer_end,
437 // a mix of the last 64-bytes. That is how the algorithm works when we
459 hash_combine_range_impl(ValueT *first, ValueT *last) { argument
462 const char *s_end = reinterpret_cast<const char *>(last);
491 hash_code hash_combine_range(InputIteratorT first, InputIteratorT last) { argument
[all...]
/freebsd-current/contrib/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++) {
142 for (last = (unsigned) (max - 1); last > tindex; last--)
151 tp->Booleans[last] = tp->Booleans[last
[all...]
/freebsd-current/contrib/wpa/src/eap_peer/
H A Dtncc.c885 struct tnc_if_imc *imc, *last; local
888 last = tncc->imc;
889 while (last && last->next)
890 last = last->next;
979 if (last == NULL)
982 last->next = imc;
983 last = imc;
1072 struct tnc_if_imc *imc, *last; local
[all...]
/freebsd-current/contrib/nvi/ex/
H A Dex_subst.c64 * repeat the last substitution.
128 * If the pattern string is empty, use the last RE (not just the
129 * last substitution RE).
173 * special case nonexistent last patterns or whether or not
182 * If the entire replacement pattern is "%", then use the last
246 * Substitute using the last substitute RE and replacement pattern.
269 * Substitute using the last RE and last substitute replacement pattern.
346 size_t blen, cnt, last, lbclen, lblen, len, llen; local
372 * it only displayed the last chang
[all...]
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_rb.c123 struct archive_rb_node *last = NULL; local
130 last = parent;
134 return last;
142 struct archive_rb_node *last = NULL; local
149 last = parent;
153 return last;

Completed in 330 milliseconds

1234567891011>>