Searched refs:record (Results 1 - 20 of 20) sorted by relevance

/xnu-2422.115.4/osfmk/kern/
H A Dbtlog.c66 size_t btrecord_btdepth; /* BT entries per record */
69 btlog_recordindex_t head; /* active record list */
165 btlog_record_t *record = lookup_btrecord(btlog, recindex); local
166 btlog->freelist = record->next;
182 btlog_record_t *record = lookup_btrecord(btlog, recindex); local
183 btlog->head = record->next;
201 btlog_record_t *record = lookup_btrecord(btlog, btlog->tail); local
202 record->next = recindex;
216 btlog_record_t *record; local
222 /* If there's a free record, us
254 btlog_record_t *record; local
[all...]
/xnu-2422.115.4/bsd/security/audit/
H A Daudit_mac.c80 /* Assume 3 MAC labels for each audit record: two for vnodes,
178 * mac_audit_check_postselect returns MAC_AUDIT_NO, the record will be
179 * suppressed. Other values at this point result in the audit record
198 * from a policy to the current audit record.
203 struct mac_audit_record *record; local
221 record = kalloc(sizeof(*record));
222 if (record == NULL) {
227 record->type = type;
228 record
[all...]
H A Daudit_private.h95 * Success/failure conditions for the conversion of a kernel audit record to
103 * Defines for the kernel audit record k_ar_commit field. Flags are set to
104 * indicate what sort of record it is, and which preselection mechanism
194 /* Audit record header. */
290 * Arguments in the audit record are initially not defined; flags are set to
306 * In-kernel version of audit record; the basic record plus queue meta-data.
307 * This record can also have a pointer set to some opaque data that will be
338 * Kernel versions of the libbsm audit record functions.
428 int sorf, int trail_select, void *record, u_in
[all...]
H A Daudit_pipe.c118 * uiomove() is called to copy out the current head record's data
119 * while the record remains in the queue, so we prevent other threads
134 * first record in the queue. The number of bytes available for
160 * Current pending record list. Protected by a combination of ap_mtx
162 * remove a record from the head of the queue, as an in-progress read
189 * Global list of audit pipes, rwlock to protect it. Individual record
252 static u_int64_t audit_pipe_drops; /* Global record drop count. */
379 * Determine whether a specific audit pipe matches a record with these
422 * Determine whether there exists a pipe interested in a record with specific
451 * Append individual record t
456 audit_pipe_append(struct audit_pipe *ap, void *record, u_int record_len) argument
507 audit_pipe_submit(au_id_t auid, au_event_t event, au_class_t class, int sorf, int trail_select, void *record, u_int record_len) argument
541 audit_pipe_submit_user(void *record, u_int record_len) argument
[all...]
H A Daudit.h269 void audit_sdev_submit(au_id_t auid, au_asid_t asid, void *record,
340 * we have a audit record on the thread. Audit records can persist after
H A Daudit_session.c230 * record's data whie the record remains in the queue, so we
249 * The amount read so far of the first record in the queue.
263 * Current pending record list. This is protected by a
265 * locks are required to remove a record from the head of the
303 * Individaul record queues are protected by per-sdev locks. These
357 static u_int64_t audit_sdev_drops; /* Global record drop count. */
401 * The per session record structure for the snapshot data.
530 * Walk the audit session hash table and build the record array.
585 * Create a new audit record
1517 audit_sdev_append(struct audit_sdev *asdev, void *record, u_int record_len) argument
1562 audit_sdev_submit(__unused au_id_t auid, __unused au_asid_t asid, void *record, u_int record_len) argument
[all...]
H A Daudit_syscalls.c140 * System call to allow a user space application to submit a BSM audit record
142 * verification on the audit record that is submitted.
171 * If there's no current audit record (audit() itself not audited)
172 * commit the user audit record.
181 * complete kernel audit record just so the user record can
195 error = copyin(uap->record, rec, uap->length);
205 /* Verify the record. */
212 * Attach the user audit record to the kernel audit record
[all...]
/xnu-2422.115.4/bsd/hfs/
H A Dhfs_hotfiles.c522 FSBufferDescriptor record; local
595 record.bufferAddress = &data;
596 record.itemSize = sizeof(u_int32_t);
597 record.itemCount = 1;
670 error = BTInsertRecord(filefork, iterator, &record, record.itemSize);
677 /* Insert the corresponding thread record. */
683 error = BTInsertRecord(filefork, iterator, &record, record.itemSize);
947 * Update the data of a btree record
968 FSBufferDescriptor record; local
1084 FSBufferDescriptor record; local
1499 FSBufferDescriptor record; local
[all...]
H A Dhfs_vfsops.c1499 // record the current time at which we're mounting this volume
5098 int lockflags; /* Locks that reclaim and split code should grab before modifying the extent record */
5100 u_int32_t recStartBlock; /* File allocation block number (FABN) for current extent record */
5102 struct filefork *catalog_fp; /* If non-NULL, extent is from catalog record */
5103 union record { union in struct:hfs_reclaim_extent_info
5104 HFSPlusExtentRecord overflow;/* Extent record from overflow extents btree */
5105 HFSPlusAttrRecord xattr; /* Attribute record for large EAs */
5106 } record; member in struct:hfs_reclaim_extent_info
5107 HFSPlusExtentDescriptor *extents; /* Pointer to current extent record being processed.
5108 * For catalog extent record, point
[all...]
H A Dhfs_catalog.c95 #define HFS_LOOKUP_CASESENSITIVE 0x4 /* If set, verify results of a file/directory record match input case */
278 /* Check to see if a thread record exists for the target ID we just got */
436 * Convert a raw catalog key and record into an in-core catalog descriptor.
658 /* Turn thread record into a cnode key (in place). */
738 /* Turn thread record into a cnode key (in place) */
778 /* No corresponding file/folder record found for a thread record,
785 * the key in the thread matches the key in the record.
934 * The catalog record will change, and possibly its type.
985 /* Make sure that this non-hard link (regular) record i
4070 struct HFSPlusCatalogFile record; local
[all...]
/xnu-2422.115.4/bsd/hfs/hfscommon/BTree/
H A DBTree.c64 checking if we had a record and could call BlockMove with an
66 <CS8> 10/24/97 msd In BTIterateRecord, when moving to the previous or next record
84 <HFS5> 1/13/97 djb Added support for getting current record to BTIterateRecord.
103 though we didn't have to add a record.
109 position routine does not find the record and we are looking for
110 the next record. In such a case, if the node's forrward link is
133 <12> 8/16/93 prp In BTSearchRecord, if the input hint found the node and record,
429 Routine: BTSearchRecord - Search BTree for a record with a matching key.
434 a result of the search. If a record exists at that position, and a BufferDescriptor
435 is supplied, the record wil
457 BTSearchRecord(FCB *filePtr, BTreeIterator *searchIterator, FSBufferDescriptor *record, u_int16_t *recordLen, BTreeIterator *resultIterator ) argument
649 BTIterateRecord(FCB *filePtr, BTreeIterationOperation operation, BTreeIterator *iterator, FSBufferDescriptor *record, u_int16_t *recordLen ) argument
1261 BTInsertRecord(FCB *filePtr, BTreeIterator *iterator, FSBufferDescriptor *record, u_int16_t recordLen ) argument
1424 BTReplaceRecord(FCB *filePtr, BTreeIterator *iterator, FSBufferDescriptor *record, u_int16_t recordLen ) argument
[all...]
H A DBTreeMiscOps.c56 <CS2> 9/4/97 djb Optimize TrySimpleReplace for the case where record size is not
121 Routine: CalcKeyRecordSize - Return size of combined key/record structure.
127 recSize - length of record data
131 Result: u_int16_t - size of combined key/record that will be inserted in btree
147 Routine: VerifyHeader - Validate fields of the BTree header record.
149 Function: Examines the fields of the BTree header record to determine if the
381 if (((NodeDescPtr) middle->buffer)->bLink == 0) // before 1st btree record
442 if (((NodeDescPtr) middle->buffer)->fLink == 0) // beyond last record
526 FSBufferDescriptor *record,
536 if (record
524 CheckInsertParams(FCB *filePtr, BTreeIterator *iterator, FSBufferDescriptor *record, u_int16_t recordLen ) argument
577 TrySimpleReplace(BTreeControlBlockPtr btreePtr, NodeDescPtr nodePtr, BTreeIterator *iterator, FSBufferDescriptor *record, u_int16_t recordLen, Boolean *recordInserted ) argument
[all...]
/xnu-2422.115.4/bsd/hfs/hfscommon/Misc/
H A DBTreeWrapper.c37 static Boolean ValidHFSRecord(const void *record, const BTreeControlBlock *btcb, u_int16_t recordSize);
71 DebugStr("ReplaceBTreeRecord: bad record?");
105 static Boolean ValidHFSRecord(const void *record, const BTreeControlBlock *btcb, u_int16_t recordSize) argument
120 else // Catalog record
122 const CatalogRecord *catalogRecord = (const CatalogRecord*) record;
276 return true; // record appears to be OK
/xnu-2422.115.4/security/
H A Dmac_audit.c83 mac_system_check_audit(struct ucred *cred, void *record, int length) argument
87 MAC_CHECK(system_check_audit, cred, record, length);
184 * arbitrary data to the current audit record.
206 * terminated ASCII text to the current audit record.
328 mac_system_check_audit(__unused struct ucred *cred, __unused void *record, __unused int length) argument
H A Dmac_framework.h402 int mac_system_check_audit(kauth_cred_t cred, void *record, int length);
H A Dmac_policy.h191 A return value of MAC_AUDIT_NO forces the audit record to be suppressed.
192 Any other return value results in the audit record being committed.
197 @return Return MAC_AUDIT_NO to force suppression of the audit record.
198 Any other value results in the audit record being committed.
217 returned. A return value of MAC_AUDIT_NO causes the audit record to
223 then create an audit record, else if any policy returns MAC_AUDIT_NO, then
224 suppress the creations of an audit record, else defer to the system's
458 inclusion in an audit record. An externalized label consists of a text
459 representation of the label contents that will be added to the audit record
3980 @param record Audi
[all...]
/xnu-2422.115.4/iokit/Kernel/
H A DIOPMrootDomain.cpp270 AggressivesRecord record;
1532 request->data.record.type = (uint32_t) type;
1533 request->data.record.value = (uint32_t) value;
1552 (entry->data.record.type == type) &&
1555 entry->data.record.value = value;
1617 (entry->data.record.type == type) &&
1620 value = entry->data.record.value;
1631 AggressivesRecord * record;
1635 record = (AggressivesRecord *) aggressivesData->getBytesNoCopy();
1637 for (i = 0; i < count; i++, record
[all...]
/xnu-2422.115.4/bsd/hfs/hfscommon/headers/
H A DBTreesPrivate.h156 // where is minimum record size enforced?
229 u_int32_t numValidHints; // Hint used to find correct record.
350 FSBufferDescriptor *record,
356 FSBufferDescriptor *record,
H A DBTreesInternal.h291 typedef int32_t (* IterateCallBackProcPtr)(BTreeKeyPtr key, void * record, void * state);
/xnu-2422.115.4/tools/lldbmacros/
H A Dmemory.py342 The findoldest command is also useful for leak debugging since it identifies the oldest record
372 """ Zone leak debugging: find and print the oldest record in the log.
386 print "Oldest record is at log index: {0: <d}".format(index)
502 record = kern.GetValueFromAddress(unsigned(btlog.btrecords) + record_offset, 'btlog_record_t *')
503 if unsigned(record.element) == target_elem or printall:
504 print '{0: <s} OP {1: <d} {2: <#0x} {3: <s}\n'.format(('-' * 8), record.operation, target_elem, ('-' * 8))
505 ShowBtlogBacktrace(btlog.btrecord_btdepth, record)
506 index = record.next
756 """ Helper routine for printing a BT Log record backtrace stack.
758 depth:int - The depth of the zstack record
[all...]

Completed in 198 milliseconds