Searched refs:element (Results 1 - 15 of 15) sorted by relevance

/xnu-2422.115.4/osfmk/kern/
H A Dbtlog.h42 * Each backtrace is associated with an element/object,
79 void *element,
85 void *element);
H A Dbtlog.c52 void *element; member in struct:btlog_record
210 void *element,
235 record->element = element;
251 void *element)
264 * match the element being removed).
269 if (record->element == element) {
288 /* we iterated over the entire active list removing the element */
298 if (record->element
209 btlog_add_entry(btlog_t *btlog, void *element, uint8_t operation, void *bt[], size_t btcount) argument
250 btlog_remove_entries_for_element(btlog_t *btlog, void *element) argument
[all...]
H A Dzalloc.c154 * We use three techniques to detect modification of a zone element
158 * (2) Store a backup of the next pointer at the end of the element,
159 * and compare it to the primary next pointer when the element is allocated
162 * (3) Poison the freed element by overwriting it with 0xdeadbeef,
163 * and check for that value when the element is being reused to make sure
164 * no part of the element has been modified while it was on the freelist.
347 /* Helpful for walking through a zone's free element list. */
362 /* The backup pointer is stored in the last pointer-sized location in an element. */
365 vm_offset_t *element)
367 return (vm_offset_t *) ((vm_offset_t)element
364 get_backup_ptr(vm_size_t elem_size, vm_offset_t *element) argument
371 get_zone_page_metadata(struct zone_free_element *element) argument
569 free_to_zone(zone_t zone, vm_offset_t element) argument
662 vm_offset_t element; local
[all...]
/xnu-2422.115.4/osfmk/mach/
H A Dflipc_debug.h80 int element = bitpos / (sizeof(unsigned long) * 8); local
81 int subbitpos = bitpos - element * sizeof(unsigned long) * 8;
84 if (flipc_debug_buffer_bitvec[element] & (1 << subbitpos))
89 flipc_debug_buffer_bitvec[element] |= (1 << subbitpos);
114 int element, subbitpos; local
/xnu-2422.115.4/bsd/sys/
H A Dqueue.h69 * added to the list after an existing element or at the head of the list.
80 * to the list after an existing element, at the head of the list, or at the
89 * so that an arbitrary element can be removed without a need to
91 * or after an existing element or at the head of the list. A list
96 * linked so that an arbitrary element can be removed without a need to
98 * after an existing element, at the head of the list, or at the end of
103 * linked so that an arbitrary element can be removed without a need to
105 * an existing element, at the head of the list, or at the end of the list.
144 /* Store the last 2 places the queue element or head was altered */
207 struct type *slh_first; /* first element */ \
808 struct quehead *element = (struct quehead *)a, local
820 struct quehead *element = (struct quehead *)a; local
[all...]
/xnu-2422.115.4/iokit/Kernel/
H A DIOService.cpp207 #define queue_element(entry, element, type, field) do { \
210 (element) = (type) __ele; \
982 ArbitrationLockQueueElement * element; local
991 // obtain an unused queue element
994 element,
998 element = IONew( ArbitrationLockQueueElement, 1 );
999 assert( element );
1002 // prepare the queue element
1003 element->thread = IOThreadSelf();
1004 element
1266 ArbitrationLockQueueElement * element; local
[all...]
H A DIOHibernateIO.cpp3147 addr64_t element; local
3156 noteProp = OSData::withCapacity(3 * sizeof(element));
3158 element = len;
3159 noteProp->appendBytes(&element, sizeof(element));
3160 element = crc32(0, smcBytes, len);
3161 noteProp->appendBytes(&element, sizeof(element));
3164 element = (addr64_t) &noteStore[0];
3165 element
[all...]
/xnu-2422.115.4/bsd/netinet/
H A Ddhcp_options.c150 ptrlist_add(ptrlist_t * list, const void * element) argument
155 list->array[list->count++] = element;
192 dhcpol_add(dhcpol_t * list, const void * element) argument
194 return (ptrlist_add((ptrlist_t *)list, element));
H A Ddhcp_options.h189 boolean_t dhcpol_add(dhcpol_t * list, const void * element);
/xnu-2422.115.4/tools/lldbmacros/core/
H A Dkernelcore.py31 def IterateLinkedList(element, field_name):
33 This is equivalent to elt = element; while(elt) { do_work(elt); elt = elt-><field_name>; }
35 element - value : value object representing element in the list.
36 field_name - str : name of field that holds pointer to next element
43 elt = element
49 def IterateListEntry(element, element_type, field_name):
52 element - value : Value object for lh_first
53 element_type - str : Type of the next element
54 field_name - str : Name of the field in next element'
[all...]
/xnu-2422.115.4/osfmk/pmc/
H A Dpmc.c466 perf_monitor_t element = NULL; local
471 queue_iterate(perf_monitors_queue, element, perf_monitor_t, link) {
472 if(element->object == monitor) {
473 perf_monitor_reference(element);
474 found = element;
597 pmc_t element = NULL; local
600 queue_iterate(perf_counters_queue, element, pmc_t, link) {
601 if(element->object == object) {
602 pmc_reference(element);
603 found = element;
[all...]
/xnu-2422.115.4/security/
H A Dmac_base.c292 * policy is interested in that namespace element.
636 * Check both label element lists and add to the
705 * that label element from the list. Note that we only
1090 const char *element, struct sbuf *sb)
1101 if (element[0] == '?') {
1102 element++;
1104 } else if (element[0] == '*' && element[1] == '\0')
1117 if (strcmp(name, element) != 0)
1179 char *element; local
1089 mac_label_externalize(size_t mpo_externalize_off, struct label *label, const char *element, struct sbuf *sb) argument
[all...]
/xnu-2422.115.4/tools/lldbmacros/
H A Dmemory.py251 zfirst: void * - A pointer to the first element of the free list chain
281 """ Walk the freelist for a zone, printing out the primary and backup next pointers, the poisoning cookies, and the poisoning status of each element.
334 """ Zone leak debugging: Print the stack trace of log element at <index>. If a <count> is supplied, it prints <count> log elements starting at <index>.
440 refer to the given zone element.
443 When the kernel panics due to a corrupted zone element, get the
444 element address and use this command. This will show you the stack traces of all logged zalloc and
445 zfree operations which tells you who touched the element in the recent past. This also makes
465 if unsigned(findelem_record.element) == target_element:
478 """ Search the btlog_t for entries corresponding to the given element.
480 Usage: btlog_find <btlog_t> <element>
[all...]
/xnu-2422.115.4/bsd/kern/
H A Dkern_exec.c3174 * Libc has an 8-element array set up for stack guard values. It only fills
3993 vm_offset_t element = execargs_cache[i]; local
3994 if (element) {
4052 vm_offset_t element = execargs_cache[i]; local
4053 if (element == 0) {
H A Duipc_mbuf.c500 mcache_obj_t *element; /* the alloc'ed element, NULL if unused */ member in struct:mallocation
1961 * during an allocation request whenever there is no available element in the
2025 * until an element is available. Otherwise, if
2344 * during an allocation request whenever there is no available element in
4003 * Every composite mbuf + cluster element comes from the intermediate
4005 * the last composite element will come from the MC_MBUF_CL cache,
4008 * data is defined as extra data beyond the first element that cannot
4009 * fit into the previous element, i.e. there is no residual data if
6461 * Same as above, but only return the first element
[all...]

Completed in 201 milliseconds