Lines Matching defs:object
171 dump_free(dmu_sendarg_t *dsp, uint64_t object, uint64_t offset,
181 * object,offset. We know that the one-record constraint is
183 * object,offset.
189 ASSERT(object > dsp->dsa_last_data_object ||
190 (object == dsp->dsa_last_data_object &&
222 if (drrf->drr_object == object && drrf->drr_offset +
236 drrf->drr_object = object;
252 uint64_t object, uint64_t offset, int lsize, int psize, const blkptr_t *bp,
259 * We send data in increasing object, offset order.
262 ASSERT(object > dsp->dsa_last_data_object ||
263 (object == dsp->dsa_last_data_object &&
265 dsp->dsa_last_data_object = object;
282 drrw->drr_object = object;
330 dump_write_embedded(dmu_sendarg_t *dsp, uint64_t object, uint64_t offset,
347 drrw->drr_object = object;
364 dump_spill(dmu_sendarg_t *dsp, uint64_t object, int blksz, void *data)
377 drrs->drr_object = object;
406 * See whether this free object array can be aggregated
433 dump_dnode(dmu_sendarg_t *dsp, uint64_t object, dnode_phys_t *dnp)
437 if (object < dsp->dsa_resume_object) {
445 ASSERT3U(dsp->dsa_resume_object - object, <,
451 return (dump_freeobjects(dsp, object, 1));
462 drro->drr_object = object;
481 if (dump_free(dsp, object, (dnp->dn_maxblkid + 1) *
650 /* it's an embedded level-0 block of a regular object */
656 /* it's a level-0 block of a regular object */
1100 * but ignore per-object space used (eg, dnodes and DRR_OBJECT records).
1808 * Last object looked up. Used to assert that objects are being looked
1816 uint64_t object;
2011 uint64_t object, uint64_t offset, dmu_tx_t *tx)
2026 * (non-meta-dnode) object number.
2028 ASSERT(object != 0);
2032 * sorted by object,offset. This is checked by the callers, but
2035 ASSERT3U(object, >=, rwa->os->os_dsl_dataset->ds_resume_object[txgoff]);
2036 ASSERT(object != rwa->os->os_dsl_dataset->ds_resume_object[txgoff] ||
2041 rwa->os->os_dsl_dataset->ds_resume_object[txgoff] = object;
2052 uint64_t object;
2071 object = err == 0 ? drro->drr_object : DMU_NEW_OBJECT;
2094 dmu_tx_hold_bonus(tx, object);
2101 if (object == DMU_NEW_OBJECT) {
2187 * by (object, offset).
2520 * This function looks through the objlist to see if the specified object number
2521 * is contained in the objlist. In the process, it will remove all object
2522 * numbers in the list that are smaller than the specified object number. Thus,
2523 * any lookup of an object number smaller than a previously looked up object
2528 objlist_exists(struct objlist *list, uint64_t object)
2531 ASSERT3U(object, >=, list->last_lookup);
2532 list->last_lookup = object;
2533 while (node != NULL && node->object < object) {
2538 return (node != NULL && node->object == object);
2542 * The objlist is a list of object numbers stored in ascending order. However,
2543 * the insertion of new object numbers does not seek out the correct location to
2544 * store a new object number; instead, it appends it to the list for simplicity.
2545 * Thus, any users must take care to only insert new object numbers in ascending
2549 objlist_insert(struct objlist *list, uint64_t object)
2552 node->object = object;
2555 uint64_t last_objnum = (last_object != NULL ? last_object->object : 0);
2556 ASSERT3U(node->object, >, last_objnum);
2564 * We use the object ignore list to tell us whether or not to issue prefetches
2565 * for a given object. We do this for both correctness (in case the blocksize
2566 * of an object has changed) and performance (if the object doesn't exist, don't
2570 * The object numbers within will always be in sorted order, and any write
2572 * respect to each other (i.e. we can get several object records before
2573 * receiving each object's write records). As a result, once we've reached a
2574 * given object number, we can safely remove any reference to lower object
2575 * numbers in the ignore list. In practice, we receive up to 32 object records
2581 uint64_t object, uint64_t offset, uint64_t length)
2583 if (!objlist_exists(&ra->ignore_objlist, object)) {
2584 dmu_prefetch(ra->os, object, 1, offset, length,
2612 * storing this object in the ignore_obj_list.