Home
last modified time | relevance | path

Searched full:first (Results 1 – 25 of 1228) sorted by relevance

12345678910>>...50

/qemu/hw/usb/
H A Dcombined-packet.c62 assert(combined->first == p && p == QTAILQ_FIRST(&combined->packets)); in usb_combined_input_packet_complete()
64 status = combined->first->status; in usb_combined_input_packet_complete()
65 actual_length = combined->first->actual_length; in usb_combined_input_packet_complete()
107 USBPacket *first = p->combined->first; in usb_combined_packet_cancel() local
111 if (p == first) { in usb_combined_packet_cancel()
124 USBPacket *p, *u, *next, *prev = NULL, *first = NULL; in usb_ep_combine_input_packets() local
155 if (first) { in usb_ep_combine_input_packets()
156 if (first->combined == NULL) { in usb_ep_combine_input_packets()
159 combined->first = first; in usb_ep_combine_input_packets()
162 usb_combined_packet_add(combined, first); in usb_ep_combine_input_packets()
[all …]
/qemu/tests/qemu-iotests/tests/
H A Dparallels-checks.out58 == check the first cluster ==
64 == write another pattern to the first clusters ==
67 == check the first cluster ==
88 == check the first cluster with self-repair ==
95 == write another pattern to the first clusters ==
98 == check the first cluster ==
106 == write pattern to first cluster ==
110 == check first cluster ==
116 == write pattern to first cluster ==
129 == check first cluster ==
H A Dblock-status-cache64 x-dirty-bitmap=qemu:allocation-depth, so we first run a normal `map`
75 # This will probably detect an allocated data sector first (qemu likes
76 # to allocate the first sector to facilitate alignment probing), and
78 # one range covering the first sector.
90 # We need to run this map twice: On the first call, we probably still
91 # have the first sector in the cache, and so this will be served from
96 # correct information: The first sector is not covered by the cache, so
102 # Since the first sector is not in the cache, the query for its status
117 # first attempt).
H A Dzoned38 echo "(1) report the first zone:"
41 echo "report the first 10 zones"
48 echo "(2) opening the first zone"
64 echo "(3) closing the first zone"
90 echo "After appending the first zone firstly:"
93 echo "After appending the first zone secondly:"
H A Dparallels-checks120 echo "== check the first cluster =="
126 echo "== write another pattern to the first clusters =="
129 echo "== check the first cluster =="
156 echo "== check the first cluster with self-repair =="
162 echo "== write another pattern to the first clusters =="
165 echo "== check the first cluster =="
176 echo "== write pattern to first cluster =="
182 echo "== check first cluster =="
190 echo "== write pattern to first cluster =="
199 echo "== check first cluster =="
H A Dzoned.out4 (1) report the first zone:
7 report the first 10 zones
23 (2) opening the first zone
36 (3) closing the first zone
58 After appending the first zone firstly:
61 After appending the first zone secondly:
/qemu/docs/specs/
H A Dppc-spapr-numa.rst57 the first element is 1) of the ibm,associativity array. The first
62 to the same first boundary will have the shortest distance from each
71 The first NUMA level (0x3) is interpreted as the third element of each
73 the third level is the first element. Let's also consider that elements
74 belonging to the first NUMA level have distance equal to 10 from each
85 First NUMA level (0x3) => associativity[2] = C1
91 First NUMA level (0x3) => associativity[2] = C2
107 First NUMA level (0x2) => associativity[1] = S1
111 First NUMA level (0x2) => associativity[1] = S2
114 NUMA configuration, distance between them is one boundary above the first
[all …]
/qemu/hw/display/
H A Dframebuffer.c72 int first, last = 0; in framebuffer_update_display() local
96 first = -1; in framebuffer_update_display()
108 if (first == -1) in framebuffer_update_display()
109 first = i; in framebuffer_update_display()
117 if (first < 0) { in framebuffer_update_display()
120 *first_row = first; in framebuffer_update_display()
/qemu/include/qemu/
H A Dhbitmap.h56 * range of bits first rounds the bits to determine which group they land
57 * in, and then affect the entire set; iteration will only visit the first
110 * @start: First bit to set (0-based).
120 * @start: First bit to reset (0-based).
189 * @start: First bit to store.
203 * @start: First bit to restore.
220 * @start: First bit to restore.
235 * @start: First bit to restore.
276 * @first: First bit to visit (0-based, must be strictly less than the
280 * the lowest-numbered bit that is set in @hb, starting at @first.
[all …]
/qemu/fsdev/
H A Dp9array.h91 scalar_type first[]; \
114 *auto_var = &arr->first[0]; \
119 scalar_type *first = (*auto_var); \
120 if (!first) { \
124 ((char *)first) - offsetof(P9Array##scalar_type, first) \
127 scalar_cleanup_func(&arr->first[i]); \
/qemu/tests/qemu-iotests/
H A D30549 # The reference counts of the clusters for the first 123k of this
50 # write request are stored in the first refcount block. The last
53 echo '### Fill the first refcount block and one data cluster from the second'
65 # offsets 121k and 123k). Their reference counts are in the first and
66 # second refcount blocks respectively, but only the first one can be
H A D108100 # Allocate the first 128 kB in the image (first refblock)
106 # XXX: This should be the first free entry in the last L2 table, but we cannot
140 # XXX: This should be the 17th entry (cluster 16) of the first
183 # First test: Just create some image, write some data to it, and
258 # - For the first refblock: Right at the beginning of the image (this
259 # refblock is placed in the first place possible),
261 # beginning of the image (i.e. covered by the first refblock); the
262 # reftable too is placed in the first place possible, but only after
H A D06057 # The repair process will create a large file - so check for availability first
75 # Link first L1 entry (first L2 table) onto itself
166 # the first data cluster.
168 # Free the first cluster. This cluster will soon enough be reallocated and
276 # Since the first data cluster is already allocated this triggers an
371 # Fails the first repair because the corruption prevents the check
373 # (Using -q for the first invocation, because otherwise the
438 # Fails the first repair because the corruption prevents the check
440 # (Using -q for the first invocation, because otherwise the
/qemu/hw/ppc/
H A Dspapr_irq.c542 int first, i; in ics_find_free_block() local
544 for (first = 0; first < ics->nr_irqs; first += alignnum) { in ics_find_free_block()
545 if (num > (ics->nr_irqs - first)) { in ics_find_free_block()
548 for (i = first; i < first + num; ++i) { in ics_find_free_block()
553 if (i == (first + num)) { in ics_find_free_block()
554 return first; in ics_find_free_block()
564 int first = -1; in spapr_irq_find() local
572 * The hint is used for the first IRQ, the rest should in spapr_irq_find()
578 first = ics_find_free_block(ics, num, num); in spapr_irq_find()
580 first = ics_find_free_block(ics, num, 1); in spapr_irq_find()
[all …]
/qemu/scripts/coverage/
H A Dcompare_gcov_json.py4 # generate the required output first:
27 help=('First file to check'))
72 def find_missing_files(first, second): argument
77 for f in sorted(first):
78 file_a = first[f]
/qemu/ui/
H A Dudmabuf.c16 static bool first = true; in udmabuf_fd() local
19 if (!first) { in udmabuf_fd()
22 first = false; in udmabuf_fd()
/qemu/util/
H A Dhbitmap.c41 * ffs (find first set bit) to find the next word to examine; this
69 * range of bits first rounds the bits to determine which group they land
70 * in, and then affect the entire page; iteration will only visit the first
169 void hbitmap_iter_init(HBitmapIter *hbi, const HBitmap *hb, uint64_t first) in hbitmap_iter_init() argument
175 pos = first >> hb->granularity; in hbitmap_iter_init()
184 /* Drop bits representing items before first. */ in hbitmap_iter_init()
360 * trimmed on the first call). Return -1, and set *p_cur to zero,
467 uint64_t first, n; in hbitmap_set() local
477 first = start >> hb->granularity; in hbitmap_set()
480 n = last - first + 1; in hbitmap_set()
[all …]
/qemu/include/user/
H A Dpage-protection.h24 * @start: first byte of range
39 * @start: first byte of range
51 * @start: first byte of range
63 * @min: first byte of search range
/qemu/hw/intc/
H A Dsh_intc.c128 unsigned int *first, in sh_intc_locate() argument
146 *first = mr->reg_width - 1; in sh_intc_locate()
162 *first = pr->reg_width / pr->field_width - 1; in sh_intc_locate()
202 unsigned int first; in sh_intc_read() local
208 &enum_ids, &first, &width, &mode); in sh_intc_read()
218 unsigned int first; in sh_intc_write() local
227 &enum_ids, &first, &width, &mode); in sh_intc_write()
241 for (k = 0; k <= first; k++) { in sh_intc_write()
243 mask <<= (first - k) * width; in sh_intc_write()
/qemu/scripts/
H A Dcocci-macro-file.h47 struct type *lh_first; /* first element */ \
64 struct type *slh_first; /* first element */ \
80 struct type *sqh_first; /* first element */ \
97 struct type *tqh_first; /* first element */ \
/qemu/tests/tcg/multiarch/system/
H A Dmemory.c101 neg_first ? "neg first" : "pos first"); in init_test_data_s8()
112 * Zero the first few bytes of the test data in preparation for
383 int16_t first, second; in read_test_data_s8() local
385 first = *ptr++; in read_test_data_s8()
388 if (neg_first && first < 0 && second > 0) { in read_test_data_s8()
391 } else if (!neg_first && first > 0 && second < 0) { in read_test_data_s8()
395 ml_printf("Error %d %c %d\n", first, neg_first ? '<' : '>', second); in read_test_data_s8()
413 * If the first byte is negative, then the last byte is positive. in read_test_data_s16()
446 * If the first byte is negative, then the last byte is positive. in read_test_data_s32()
516 /* Run through the unsigned tests first */ in main()
/qemu/accel/tcg/
H A Dtranslator.c210 * the first insn and set to true before the last insn. in translator_loop()
256 /* Use slow path if first page is MMIO. */ in translator_ld()
258 /* We capped translation with first page MMIO in tb_gen_code. */ in translator_ld()
267 /* Entire read is from the first page. */ in translator_ld()
273 * Read begins on the first page and extends to the second. in translator_ld()
304 * If the second page is MMIO, treat as if the first page in translator_ld()
316 * If this is not the first time around, and page1 matches, in translator_ld()
387 * Either the first or second page may be I/O. If it is the second, in record_save()
388 * then the first byte we need to record will be at a non-zero offset. in record_save()
425 /* Get all the bytes from the first page. */ in translator_st()
/qemu/docs/devel/testing/
H A Dblkverify.rst16 ``blkverify`` solves this problem by catching data corruption inside QEMU the first
33 first instance where corrupt data is read.
38 Imagine raw.img has 0xcd repeated throughout its first sector::
49 And test.img is corrupt, its first sector is zeroed when it shouldn't be::
/qemu/tests/qapi-schema/
H A Ddoc-non-first-section.json1 # = section must be first line
5 # = Not first
H A Ddoc-non-first-section.err1 doc-non-first-section.json:5:1: '=' heading must come first in a comment block

12345678910>>...50