Searched refs:last (Results 251 - 275 of 1032) sorted by relevance

<<11121314151617181920>>

/linux-master/arch/alpha/lib/
H A Dev6-memchr.S11 * - does binary search to find 0 byte in last
44 # below when we find the address of the last byte. Given
139 # Make $18 point to last quad to be accessed (the
140 # last quad may or may not be partial).
/linux-master/tools/testing/selftests/user_events/
H A Dperf_test.c58 int ret, c, last = 0, offset = 0; local
70 if (last == '\n' && c == '\n')
73 last = c;
/linux-master/drivers/infiniband/sw/rdmavt/
H A Dtrace_tx.h45 "[%s] wqe %p wr_id %llx send_flags %x qpn %x qpt %u psn %x lpsn %x ssn %x length %u opcode 0x%.2x,%s size %u avail %u head %u last %u pid %u num_sge %u wr_num_sge %u"
64 __field(u32, last)
84 __entry->last = qp->s_last;
107 __entry->last,
/linux-master/drivers/soc/qcom/
H A Dwcnss_ctrl.c87 * @last: boolean indicator of this being the last fragment of the binary
94 u16 last; member in struct:wcnss_download_nv_req
229 req->last = 0;
235 req->last = 1;
/linux-master/drivers/input/touchscreen/
H A Dmainstone-wm97xx.c119 static u16 last, tries; local
134 if (x == last) {
138 last = x;
/linux-master/drivers/vdpa/mlx5/core/
H A Dmr.c101 return min_t(u64, map->last + 1, mr->end);
263 map->start, map->last + 1);
368 u64 last = U64_MAX; local
376 for (map = vhost_iotlb_itree_first(iotlb, start, last); map;
377 map = vhost_iotlb_itree_next(map, start, last)) {
380 pe = map->last + 1;
396 pe = map->last + 1;
460 u64 start = 0, last = ULLONG_MAX; local
467 err = vhost_iotlb_add_range(dst, start, last, start, VHOST_ACCESS_RW);
471 for (map = vhost_iotlb_itree_first(src, start, last); ma
[all...]
/linux-master/drivers/i3c/master/mipi-i3c-hci/
H A Dcore.c201 int i, last, ret = 0; local
229 last = i - 1;
230 xfer[last].cmd_desc[0] |= CMD_0_TOC;
231 xfer[last].completion = &done;
316 int i, last, ret = 0; local
344 last = i - 1;
345 xfer[last].cmd_desc[0] |= CMD_0_TOC;
346 xfer[last].completion = &done;
380 int i, last, ret = 0; local
398 last
[all...]
/linux-master/fs/btrfs/
H A Dsubpage.c189 * This is important for eb allocation, to prevent race with last eb freeing
283 bool last; local
295 last = atomic_sub_and_test(nbits, &subpage->readers);
298 * For data we need to unlock the page if the last read has finished.
300 * And please don't replace @last with atomic_sub_and_test() call
304 if (is_data && last)
354 bool last; local
375 last = atomic_sub_and_test(nbits, &subpage->writers);
377 return last;
475 * Return true if we're the last bit
489 bool last = false; local
502 bool last; local
[all...]
/linux-master/net/core/
H A Dgso_test.c147 struct sk_buff *skb, *segs, *cur, *next, *last; local
235 last = segs->prev;
248 /* last seg can be found through segs->prev pointer */
250 KUNIT_ASSERT_PTR_EQ(test, cur, last);
H A Dpage_pool_user.c362 struct page_pool *pool, *last; local
368 last = NULL;
373 last = pool;
375 if (last)
376 hlist_splice_init(&netdev->page_pools, &last->user.list,
/linux-master/drivers/gpu/drm/i915/gt/
H A Dintel_execlists_submission.c318 * prio >= max(0, last);
832 * Sentinels are supposed to be the last request so they flush
1279 struct i915_request *last, * const *active; local
1290 * where it got up to last time, and through RING_TAIL we tell the CS
1309 * If the queue is higher priority than the last
1318 while ((last = *active) && completed(last))
1321 if (last) {
1322 if (need_preempt(engine, last)) {
1324 "preempting last
2049 post_process_csb(struct i915_request **port, struct i915_request **last) argument
4090 struct i915_request *rq, *last; local
[all...]
/linux-master/net/sched/
H A Dsch_netem.c104 u32 last; member in struct:netem_sched_data::crndstate
180 state->last = get_random_u32();
184 * Next number depends on last value.
198 answer = (value * ((1ull<<32) - rho) + state->last * rho) >> 32;
199 state->last = answer;
540 q->counter < q->gap - 1 || /* inside last reordering gap */
551 struct netem_skb_cb *last = NULL; local
554 last = netem_skb_cb(sch->q.tail);
561 if (!last ||
562 t_last->time_to_send > last
[all...]
/linux-master/drivers/md/
H A Ddm-ps-historical-service-time.c113 * @last: [0, ULLONG_MAX >> HST_FIXED_SHIFT]
120 * so call fixed_ema(last, next, pow(weight, N))
122 static u64 fixed_ema(u64 last, u64 next, u64 weight) argument
124 last *= weight;
125 last += next * (HST_FIXED_1 - weight);
126 last += 1ULL << (HST_FIXED_SHIFT - 1);
127 return last >> HST_FIXED_SHIFT;
451 /* Move last used path to end (least preferred in case of ties) */
/linux-master/tools/bpf/bpftool/
H A Dcfg.c202 struct bb_node *bb, *last; local
204 last = func_last_bb(func);
205 last->tail = func->end;
207 list_for_each_entry_from(bb, &last->l, l) {
212 last->idx = bb_idx++;
/linux-master/drivers/ata/pata_parport/
H A Dbpck6.c161 u8 this, last; local
187 last = *buf;
189 parport_write_data(pi->pardev->port, last);
195 if (this == last) {
200 last = this;
/linux-master/arch/m68k/mm/
H A Dmotorola.c251 unsigned long pmd, last; local
254 /* Find the last ptr table that was used in head.S and
258 last = (unsigned long)kernel_pg_dir;
265 if (pmd > last)
266 last = pmd;
269 last_pmd_table = (pmd_t *)last;
/linux-master/drivers/iommu/iommufd/
H A Dioas.c90 .last = span.last_hole,
125 if (range.start >= range.last)
128 if (interval_tree_iter_first(itree, range.start, range.last))
135 allowed->node.last = range.last;
/linux-master/mm/
H A Ddmapool.c303 struct dma_block *block, *first = NULL, *last = NULL; local
317 if (last)
318 last->next_block = block;
321 last = block;
327 last->next_block = pool->next_block;
/linux-master/net/netfilter/
H A Dnft_limit.c19 u64 last; member in struct:nft_limit
39 tokens = priv->limit->tokens + now - priv->limit->last;
43 priv->limit->last = now;
120 priv->limit->last = ktime_get_ns();
167 priv_dst->limit->last = ktime_get_ns();
H A Dnf_tables_core.c247 #define nft_rule_dp_for_each_expr(expr, last, rule) \
248 for ((expr) = nft_rule_expr_first(rule), (last) = nft_rule_expr_last(rule); \
249 (expr) != (last); \
257 const struct nft_expr *expr, *last; local
279 nft_rule_dp_for_each_expr(expr, last, rule) {
/linux-master/tools/perf/util/
H A Dthread.c213 struct comm *comm, *last = NULL, *second_last = NULL; local
218 second_last = last;
219 last = comm;
223 * 'last' with no start time might be the parent's comm of a synthesized
228 if (second_last && !last->start && thread__pid(thread) == thread__tid(thread))
231 return last;
/linux-master/drivers/net/ethernet/micrel/
H A Dks8851_spi.c316 bool last; local
320 last = skb_queue_empty(&ks->txq);
324 while (!last) {
326 last = skb_queue_empty(&ks->txq);
333 ks8851_wrfifo_spi(ks, txb, last);
/linux-master/drivers/video/fbdev/
H A Damifb.c32 * - 14 Jul 96: Rework and hopefully last ECS bugs fixed
2594 unsigned long first, last; local
2604 last = ~(~0UL >> ((dst_idx + n) % BITS_PER_LONG));
2611 if (last)
2612 first &= last;
2641 if (last)
2642 *dst = comp(*src, *dst, last);
2652 if (last)
2653 first &= last;
2711 if (last) {
2734 unsigned long first, last; local
2886 unsigned long first, last; local
3026 unsigned long first, last; local
3082 unsigned long first, last; local
[all...]
/linux-master/drivers/usb/host/
H A Dohci-q.c16 int last = urb_priv->length - 1; local
18 if (last >= 0) {
22 for (i = 0; i <= last; i++) {
534 * NOTE: could delay interrupts even for the last TD, and get fewer
862 * this urb had one of them, this td wasn't the last td
978 struct ed *ed, **last; local
981 for (last = &ohci->ed_rm_list, ed = *last; ed != NULL; ed = *last) {
992 last
[all...]
/linux-master/net/sctp/
H A Dulpqueue.c307 * This routine creates a re-assembled skb given the first and last skb's
320 struct sk_buff *pnext, *last; local
329 /* Get the last skb in the f_frag's frag_list if present. */
330 for (last = list; list; last = list, list = list->next)
336 if (last)
337 last->next = pos;
376 /* Break if we have reached the last fragment. */
390 /* Helper function to check if an incoming chunk has filled up the last
417 * we expect to find the remaining middle fragments and the last
963 struct sk_buff *skb, *flist, *last; local
[all...]

Completed in 208 milliseconds

<<11121314151617181920>>