HelenOS sources

head              279 common/adt/hash_table.c 		if (cur == &h->bucket[idx].head)
head               59 common/adt/list.c 	link_t *hlp = list->head.next;
head               61 common/adt/list.c 	while (hlp != &list->head) {
head               86 common/adt/list.c 	list->head.next->prev = pos;
head               87 common/adt/list.c 	list->head.prev->next = pos->next;
head               90 common/adt/list.c 	pos->next->prev = list->head.prev;
head               91 common/adt/list.c 	pos->next = list->head.next;
head               57 common/include/adt/fifo.h 		fifo_index_t head; \
head               73 common/include/adt/fifo.h 		.head = 0,				\
head               90 common/include/adt/fifo.h 		fifo_index_t head;			\
head               95 common/include/adt/fifo.h 		.head = 0,				\
head              106 common/include/adt/fifo.h 	name.fifo[name.head = (name.head + 1) < name.items ? (name.head + 1) : 0]
head               81 common/include/adt/list.h 		.head = { \
head               82 common/include/adt/list.h 			.prev = &(name).head, \
head               83 common/include/adt/list.h 			.next = &(name).head \
head               92 common/include/adt/list.h 		for (link_t *_link = (list).head.next; \
head               94 common/include/adt/list.h 		    _link != &(list).head; _link = _link->next)
head               98 common/include/adt/list.h 		for (link_t *_link = (list).head.prev; \
head              100 common/include/adt/list.h 		    _link != &(list).head; _link = _link->prev)
head              128 common/include/adt/list.h 	for (link_t *iterator = (list).head.next, \
head              130 common/include/adt/list.h 	    iterator != &(list).head; \
head              152 common/include/adt/list.h 	link_t head;  /**< List head. Does not have any data. */
head              187 common/include/adt/list.h 	list->head.prev = &list->head;
head              188 common/include/adt/list.h 	list->head.next = &list->head;
head              223 common/include/adt/list.h 	list_insert_after(link, &list->head);
head              236 common/include/adt/list.h 	list_insert_before(link, &list->head);
head              266 common/include/adt/list.h 	return (list->head.next == &list->head);
head              279 common/include/adt/list.h 	return ((list->head.next == &list->head) ? NULL : list->head.next);
head              292 common/include/adt/list.h 	return (list->head.prev == &list->head) ? NULL : list->head.prev;
head              304 common/include/adt/list.h 	return (link->next == &list->head) ? NULL : link->next;
head              316 common/include/adt/list.h 	return (link->prev == &list->head) ? NULL : link->prev;
head              387 common/include/adt/list.h 	headless_list_split(&list1->head, first1);
head              388 common/include/adt/list.h 	headless_list_split(&list2->head, first2);
head              391 common/include/adt/list.h 	headless_list_concat(&list1->head, first2);
head              392 common/include/adt/list.h 	headless_list_concat(&list2->head, first1);
head              407 common/include/adt/list.h 	list_splice(list2, list1->head.prev);
head              218 kernel/arch/sparc64/src/sun4v/md.c static bool str_parse_head(char **str, char **head)
head              220 kernel/arch/sparc64/src/sun4v/md.c 	*head = *str;
head              247 kernel/arch/sparc64/src/sun4v/md.c 		char *head;
head              248 kernel/arch/sparc64/src/sun4v/md.c 		more = str_parse_head(&name, &head);
head              252 kernel/arch/sparc64/src/sun4v/md.c 			if (str_cmp(head, get_element_name(child)) == 0) {
head              100 kernel/arch/sparc64/src/trap/sun4v/interrupt.c 	unsigned int head = asi_u64_read(ASI_QUEUE, VA_CPU_MONDO_QUEUE_HEAD);
head              102 kernel/arch/sparc64/src/trap/sun4v/interrupt.c 	while (head != tail) {
head              105 kernel/arch/sparc64/src/trap/sun4v/interrupt.c 		head = (head + CPU_MONDO_ENTRY_SIZE * sizeof(uint64_t)) %
head              107 kernel/arch/sparc64/src/trap/sun4v/interrupt.c 		asi_u64_write(ASI_QUEUE, VA_CPU_MONDO_QUEUE_HEAD, head);
head              279 kernel/generic/common/adt/hash_table.c 		if (cur == &h->bucket[idx].head)
head               59 kernel/generic/common/adt/list.c 	link_t *hlp = list->head.next;
head               61 kernel/generic/common/adt/list.c 	while (hlp != &list->head) {
head               86 kernel/generic/common/adt/list.c 	list->head.next->prev = pos;
head               87 kernel/generic/common/adt/list.c 	list->head.prev->next = pos->next;
head               90 kernel/generic/common/adt/list.c 	pos->next->prev = list->head.prev;
head               91 kernel/generic/common/adt/list.c 	pos->next = list->head.next;
head               57 kernel/generic/common/include/adt/fifo.h 		fifo_index_t head; \
head               73 kernel/generic/common/include/adt/fifo.h 		.head = 0,				\
head               90 kernel/generic/common/include/adt/fifo.h 		fifo_index_t head;			\
head               95 kernel/generic/common/include/adt/fifo.h 		.head = 0,				\
head              106 kernel/generic/common/include/adt/fifo.h 	name.fifo[name.head = (name.head + 1) < name.items ? (name.head + 1) : 0]
head               81 kernel/generic/common/include/adt/list.h 		.head = { \
head               82 kernel/generic/common/include/adt/list.h 			.prev = &(name).head, \
head               83 kernel/generic/common/include/adt/list.h 			.next = &(name).head \
head               92 kernel/generic/common/include/adt/list.h 		for (link_t *_link = (list).head.next; \
head               94 kernel/generic/common/include/adt/list.h 		    _link != &(list).head; _link = _link->next)
head               98 kernel/generic/common/include/adt/list.h 		for (link_t *_link = (list).head.prev; \
head              100 kernel/generic/common/include/adt/list.h 		    _link != &(list).head; _link = _link->prev)
head              128 kernel/generic/common/include/adt/list.h 	for (link_t *iterator = (list).head.next, \
head              130 kernel/generic/common/include/adt/list.h 	    iterator != &(list).head; \
head              152 kernel/generic/common/include/adt/list.h 	link_t head;  /**< List head. Does not have any data. */
head              187 kernel/generic/common/include/adt/list.h 	list->head.prev = &list->head;
head              188 kernel/generic/common/include/adt/list.h 	list->head.next = &list->head;
head              223 kernel/generic/common/include/adt/list.h 	list_insert_after(link, &list->head);
head              236 kernel/generic/common/include/adt/list.h 	list_insert_before(link, &list->head);
head              266 kernel/generic/common/include/adt/list.h 	return (list->head.next == &list->head);
head              279 kernel/generic/common/include/adt/list.h 	return ((list->head.next == &list->head) ? NULL : list->head.next);
head              292 kernel/generic/common/include/adt/list.h 	return (list->head.prev == &list->head) ? NULL : list->head.prev;
head              304 kernel/generic/common/include/adt/list.h 	return (link->next == &list->head) ? NULL : link->next;
head              316 kernel/generic/common/include/adt/list.h 	return (link->prev == &list->head) ? NULL : link->prev;
head              387 kernel/generic/common/include/adt/list.h 	headless_list_split(&list1->head, first1);
head              388 kernel/generic/common/include/adt/list.h 	headless_list_split(&list2->head, first2);
head              391 kernel/generic/common/include/adt/list.h 	headless_list_concat(&list1->head, first2);
head              392 kernel/generic/common/include/adt/list.h 	headless_list_concat(&list2->head, first1);
head              407 kernel/generic/common/include/adt/list.h 	list_splice(list2, list1->head.prev);
head              181 uspace/app/bdsh/cmds/modules/cat/cat.c     off64_t head, off64_t tail, bool tail_first)
head              227 uspace/app/bdsh/cmds/modules/cat/cat.c 		if (head == CAT_FULL_FILE) {
head              228 uspace/app/bdsh/cmds/modules/cat/cat.c 			head = file_size;
head              231 uspace/app/bdsh/cmds/modules/cat/cat.c 			length = head;
head              233 uspace/app/bdsh/cmds/modules/cat/cat.c 			if (tail > head)
head              234 uspace/app/bdsh/cmds/modules/cat/cat.c 				tail = head;
head              241 uspace/app/bdsh/cmds/modules/cat/cat.c 			pos = ((head - tail) >= file_size) ? 0 : (head - tail);
head              244 uspace/app/bdsh/cmds/modules/cat/cat.c 		length = head;
head              315 uspace/app/bdsh/cmds/modules/cat/cat.c 	aoff64_t head = CAT_FULL_FILE, tail = CAT_FULL_FILE;
head              356 uspace/app/bdsh/cmds/modules/cat/cat.c 			if (!optarg || str_uint64_t(optarg, NULL, 10, false, &head) != EOK) {
head              366 uspace/app/bdsh/cmds/modules/cat/cat.c 			if (head == CAT_FULL_FILE)
head              414 uspace/app/bdsh/cmds/modules/cat/cat.c 		ret += cat_file(argv[i], buffer, hex, head, tail, tailFirst);
head               55 uspace/app/sbi/src/list.c 	list->head.prev = &list->head;
head               56 uspace/app/sbi/src/list.c 	list->head.next = &list->head;
head               67 uspace/app/sbi/src/list.c 	list->head.prev = NULL;
head               68 uspace/app/sbi/src/list.c 	list->head.next = NULL;
head               83 uspace/app/sbi/src/list.c 	list_node_insert_between(node, list->head.prev, &list->head);
head               98 uspace/app/sbi/src/list.c 	list_node_insert_between(node, list->head.prev, &list->head);
head              129 uspace/app/sbi/src/list.c 	node = list->head.next;
head              131 uspace/app/sbi/src/list.c 	return (node != &list->head) ? node : NULL;
head              144 uspace/app/sbi/src/list.c 	node = list->head.prev;
head              146 uspace/app/sbi/src/list.c 	return (node != &list->head) ? node : NULL;
head              161 uspace/app/sbi/src/list.c 	return (node->next != &list->head) ? node->next : NULL;
head              176 uspace/app/sbi/src/list.c 	return (node->prev != &list->head) ? node->prev : NULL;
head              292 uspace/app/sbi/src/list.c 	m = list->head.next;
head              293 uspace/app/sbi/src/list.c 	while (m != &list->head) {
head               41 uspace/app/sbi/src/list_t.h 	list_node_t head;
head              665 uspace/drv/block/pc-floppy/pc-floppy.c     uint8_t head)
head              706 uspace/drv/block/pc-floppy/pc-floppy.c 	    status.cyl, status.head, status.rec, status.number);
head              727 uspace/drv/block/pc-floppy/pc-floppy.c     uint8_t cyl, uint8_t head, uint8_t sec, void *buf, size_t buf_size)
head              750 uspace/drv/block/pc-floppy/pc-floppy.c 	cmd.hd_us = (head & 1) << 2 | 0x00 /* drive 0 */;
head              752 uspace/drv/block/pc-floppy/pc-floppy.c 	cmd.head = head;
head              776 uspace/drv/block/pc-floppy/pc-floppy.c 	    status.cyl, status.head, status.rec, status.number);
head              801 uspace/drv/block/pc-floppy/pc-floppy.c     uint8_t cyl, uint8_t head, uint8_t sec, const void *buf, size_t buf_size)
head              826 uspace/drv/block/pc-floppy/pc-floppy.c 	cmd.hd_us = (head & 1) << 2 | 0x00 /* drive 0 */;
head              828 uspace/drv/block/pc-floppy/pc-floppy.c 	cmd.head = head;
head              852 uspace/drv/block/pc-floppy/pc-floppy.c 	    status.cyl, status.head, status.rec, status.number);
head              946 uspace/drv/block/pc-floppy/pc-floppy.c     uint8_t *cyl, uint8_t *head, uint8_t *sec)
head              952 uspace/drv/block/pc-floppy/pc-floppy.c 	*head = ch % drive->heads;
head              991 uspace/drv/block/pc-floppy/pc-floppy.c 	uint8_t cyl, head, sec;
head             1002 uspace/drv/block/pc-floppy/pc-floppy.c 		pc_fdc_drive_ba_to_chs(drive, ba, &cyl, &head, &sec);
head             1005 uspace/drv/block/pc-floppy/pc-floppy.c 		rc = pc_fdc_drive_read_data(drive, cyl, head, sec, buf,
head             1049 uspace/drv/block/pc-floppy/pc-floppy.c 	uint8_t cyl, head, sec;
head             1060 uspace/drv/block/pc-floppy/pc-floppy.c 		pc_fdc_drive_ba_to_chs(drive, ba, &cyl, &head, &sec);
head             1063 uspace/drv/block/pc-floppy/pc-floppy.c 		rc = pc_fdc_drive_write_data(drive, cyl, head, sec, buf,
head               95 uspace/drv/block/pc-floppy/pc-floppy_hw.h 	uint8_t head;
head              119 uspace/drv/block/pc-floppy/pc-floppy_hw.h 	uint8_t head;
head              947 uspace/drv/nic/rtl8169/driver.c 	unsigned int tail, head;
head              957 uspace/drv/nic/rtl8169/driver.c 	head = rtl8169->tx_head;
head              960 uspace/drv/nic/rtl8169/driver.c 	while (tail != head) {
head             1089 uspace/drv/nic/rtl8169/driver.c 	unsigned int head, tail;
head             1105 uspace/drv/nic/rtl8169/driver.c 	head = rtl8169->tx_head;
head             1108 uspace/drv/nic/rtl8169/driver.c 	if ((head + 1) % TX_BUFFERS_COUNT == tail) {
head             1115 uspace/drv/nic/rtl8169/driver.c 	buff = rtl8169->tx_buff + (BUFFER_SIZE * head);
head             1116 uspace/drv/nic/rtl8169/driver.c 	buff_phys = rtl8169->tx_buff_phys + (BUFFER_SIZE * head);
head             1122 uspace/drv/nic/rtl8169/driver.c 	descr = &rtl8169->tx_ring[head];
head             1123 uspace/drv/nic/rtl8169/driver.c 	prev = &rtl8169->tx_ring[(head - 1) % TX_BUFFERS_COUNT];
head             1133 uspace/drv/nic/rtl8169/driver.c 	if (head == TX_BUFFERS_COUNT - 1)
head             1136 uspace/drv/nic/rtl8169/driver.c 	rtl8169->tx_head = (head + 1) % TX_BUFFERS_COUNT;
head              279 uspace/lib/c/common/adt/hash_table.c 		if (cur == &h->bucket[idx].head)
head               59 uspace/lib/c/common/adt/list.c 	link_t *hlp = list->head.next;
head               61 uspace/lib/c/common/adt/list.c 	while (hlp != &list->head) {
head               86 uspace/lib/c/common/adt/list.c 	list->head.next->prev = pos;
head               87 uspace/lib/c/common/adt/list.c 	list->head.prev->next = pos->next;
head               90 uspace/lib/c/common/adt/list.c 	pos->next->prev = list->head.prev;
head               91 uspace/lib/c/common/adt/list.c 	pos->next = list->head.next;
head               57 uspace/lib/c/common/include/adt/fifo.h 		fifo_index_t head; \
head               73 uspace/lib/c/common/include/adt/fifo.h 		.head = 0,				\
head               90 uspace/lib/c/common/include/adt/fifo.h 		fifo_index_t head;			\
head               95 uspace/lib/c/common/include/adt/fifo.h 		.head = 0,				\
head              106 uspace/lib/c/common/include/adt/fifo.h 	name.fifo[name.head = (name.head + 1) < name.items ? (name.head + 1) : 0]
head               81 uspace/lib/c/common/include/adt/list.h 		.head = { \
head               82 uspace/lib/c/common/include/adt/list.h 			.prev = &(name).head, \
head               83 uspace/lib/c/common/include/adt/list.h 			.next = &(name).head \
head               92 uspace/lib/c/common/include/adt/list.h 		for (link_t *_link = (list).head.next; \
head               94 uspace/lib/c/common/include/adt/list.h 		    _link != &(list).head; _link = _link->next)
head               98 uspace/lib/c/common/include/adt/list.h 		for (link_t *_link = (list).head.prev; \
head              100 uspace/lib/c/common/include/adt/list.h 		    _link != &(list).head; _link = _link->prev)
head              128 uspace/lib/c/common/include/adt/list.h 	for (link_t *iterator = (list).head.next, \
head              130 uspace/lib/c/common/include/adt/list.h 	    iterator != &(list).head; \
head              152 uspace/lib/c/common/include/adt/list.h 	link_t head;  /**< List head. Does not have any data. */
head              187 uspace/lib/c/common/include/adt/list.h 	list->head.prev = &list->head;
head              188 uspace/lib/c/common/include/adt/list.h 	list->head.next = &list->head;
head              223 uspace/lib/c/common/include/adt/list.h 	list_insert_after(link, &list->head);
head              236 uspace/lib/c/common/include/adt/list.h 	list_insert_before(link, &list->head);
head              266 uspace/lib/c/common/include/adt/list.h 	return (list->head.next == &list->head);
head              279 uspace/lib/c/common/include/adt/list.h 	return ((list->head.next == &list->head) ? NULL : list->head.next);
head              292 uspace/lib/c/common/include/adt/list.h 	return (list->head.prev == &list->head) ? NULL : list->head.prev;
head              304 uspace/lib/c/common/include/adt/list.h 	return (link->next == &list->head) ? NULL : link->next;
head              316 uspace/lib/c/common/include/adt/list.h 	return (link->prev == &list->head) ? NULL : link->prev;
head              387 uspace/lib/c/common/include/adt/list.h 	headless_list_split(&list1->head, first1);
head              388 uspace/lib/c/common/include/adt/list.h 	headless_list_split(&list2->head, first2);
head              391 uspace/lib/c/common/include/adt/list.h 	headless_list_concat(&list1->head, first2);
head              392 uspace/lib/c/common/include/adt/list.h 	headless_list_concat(&list2->head, first1);
head              407 uspace/lib/c/common/include/adt/list.h 	list_splice(list2, list1->head.prev);
head               63 uspace/lib/c/generic/adt/prodcons.c 	link_t *head = list_first(&pc->list);
head               64 uspace/lib/c/generic/adt/prodcons.c 	list_remove(head);
head               68 uspace/lib/c/generic/adt/prodcons.c 	return head;
head              129 uspace/lib/c/generic/malloc.c #define BLOCK_FOOT(head) \
head              131 uspace/lib/c/generic/malloc.c 	    (((uintptr_t) (head)) + (head)->size - sizeof(heap_block_foot_t)))
head              238 uspace/lib/c/generic/malloc.c 	heap_block_head_t *head = (heap_block_head_t *) addr;
head              240 uspace/lib/c/generic/malloc.c 	head->size = size;
head              241 uspace/lib/c/generic/malloc.c 	head->free = free;
head              242 uspace/lib/c/generic/malloc.c 	head->area = area;
head              243 uspace/lib/c/generic/malloc.c 	head->magic = HEAP_BLOCK_HEAD_MAGIC;
head              245 uspace/lib/c/generic/malloc.c 	heap_block_foot_t *foot = BLOCK_FOOT(head);
head              262 uspace/lib/c/generic/malloc.c 	heap_block_head_t *head = (heap_block_head_t *) addr;
head              264 uspace/lib/c/generic/malloc.c 	malloc_assert(head->magic == HEAP_BLOCK_HEAD_MAGIC);
head              266 uspace/lib/c/generic/malloc.c 	heap_block_foot_t *foot = BLOCK_FOOT(head);
head              269 uspace/lib/c/generic/malloc.c 	malloc_assert(head->size == foot->size);
head              840 uspace/lib/c/generic/malloc.c 	heap_block_head_t *head =
head              843 uspace/lib/c/generic/malloc.c 	block_check(head);
head              844 uspace/lib/c/generic/malloc.c 	malloc_assert(!head->free);
head              846 uspace/lib/c/generic/malloc.c 	heap_area_t *area = head->area;
head              849 uspace/lib/c/generic/malloc.c 	malloc_assert((void *) head >= (void *) AREA_FIRST_BLOCK_HEAD(area));
head              850 uspace/lib/c/generic/malloc.c 	malloc_assert((void *) head < area->end);
head              855 uspace/lib/c/generic/malloc.c 	size_t orig_size = head->size;
head              864 uspace/lib/c/generic/malloc.c 			block_init((void *) head, real_size, false, area);
head              865 uspace/lib/c/generic/malloc.c 			block_init((void *) head + real_size,
head              870 uspace/lib/c/generic/malloc.c 		ptr = ((void *) head) + sizeof(heap_block_head_t);
head              873 uspace/lib/c/generic/malloc.c 		    (heap_block_head_t *) (((void *) head) + head->size);
head              876 uspace/lib/c/generic/malloc.c 		if (((void *) head) + real_size > area->end) {
head              909 uspace/lib/c/generic/malloc.c 		if (have_next && (head->size + next_head->size >= real_size) &&
head              912 uspace/lib/c/generic/malloc.c 			block_init(head, head->size + next_head->size, false,
head              914 uspace/lib/c/generic/malloc.c 			split_mark(head, real_size);
head              916 uspace/lib/c/generic/malloc.c 			ptr = ((void *) head) + sizeof(heap_block_head_t);
head              968 uspace/lib/c/generic/malloc.c 	heap_block_head_t *head =
head              971 uspace/lib/c/generic/malloc.c 	block_check(head);
head              972 uspace/lib/c/generic/malloc.c 	malloc_assert(!head->free);
head              974 uspace/lib/c/generic/malloc.c 	heap_area_t *area = head->area;
head              977 uspace/lib/c/generic/malloc.c 	malloc_assert((void *) head >= (void *) AREA_FIRST_BLOCK_HEAD(area));
head              978 uspace/lib/c/generic/malloc.c 	malloc_assert((void *) head < area->end);
head              981 uspace/lib/c/generic/malloc.c 	head->free = true;
head              985 uspace/lib/c/generic/malloc.c 	    (heap_block_head_t *) (((void *) head) + head->size);
head              990 uspace/lib/c/generic/malloc.c 			block_init(head, head->size + next_head->size, true, area);
head              994 uspace/lib/c/generic/malloc.c 	if ((void *) head > (void *) AREA_FIRST_BLOCK_HEAD(area)) {
head              996 uspace/lib/c/generic/malloc.c 		    (heap_block_foot_t *) (((void *) head) - sizeof(heap_block_foot_t));
head              999 uspace/lib/c/generic/malloc.c 		    (heap_block_head_t *) (((void *) head) - prev_foot->size);
head             1004 uspace/lib/c/generic/malloc.c 			block_init(prev_head, prev_head->size + head->size, true,
head             1037 uspace/lib/c/generic/malloc.c 		for (heap_block_head_t *head = (heap_block_head_t *)
head             1038 uspace/lib/c/generic/malloc.c 		    AREA_FIRST_BLOCK_HEAD(area); (void *) head < area->end;
head             1039 uspace/lib/c/generic/malloc.c 		    head = (heap_block_head_t *) (((void *) head) + head->size)) {
head             1042 uspace/lib/c/generic/malloc.c 			if (head->magic != HEAP_BLOCK_HEAD_MAGIC) {
head             1044 uspace/lib/c/generic/malloc.c 				return (void *) head;
head             1047 uspace/lib/c/generic/malloc.c 			heap_block_foot_t *foot = BLOCK_FOOT(head);
head             1050 uspace/lib/c/generic/malloc.c 			    (head->size != foot->size)) {
head              603 uspace/lib/c/generic/thread/fibril.c 	link_t *tmp = timeout_list.head.next;
head              604 uspace/lib/c/generic/thread/fibril.c 	while (tmp != &timeout_list.head) {
head               58 uspace/lib/c/generic/thread/mpsc.c 	mpsc_node_t *head;
head               90 uspace/lib/c/generic/thread/mpsc.c 	q->head = q->tail = n;
head               97 uspace/lib/c/generic/thread/mpsc.c 	mpsc_node_t *n = q->head;
head              160 uspace/lib/c/generic/thread/mpsc.c 		n = q->head;
head              174 uspace/lib/c/generic/thread/mpsc.c 	q->head = new_head;
head              158 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     table_[idx].head
head              182 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     table_[idx].head
head              227 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 if (table_[idx].head == node)
head              230 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                         table_[idx].head = node->next;
head              232 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                         table_[idx].head = nullptr;
head              278 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 auto head = table_[idx].head;
head              280 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 if (!head)
head              283 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 auto current = head;
head              290 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 while (current && current != head);
head              298 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 auto head = table_[idx].head;
head              300 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 if (!head)
head              303 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 auto current = head;
head              310 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 while (current != head);
head              353 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 return local_iterator{table_[n].head, table_[n].head};
head              373 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                 return const_local_iterator{table_[n].head, table_[n].head};
head              415 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     auto head = table_[i].head;
head              416 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     if (!head)
head              419 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     auto current = head;
head              445 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     } while (current != head);
head              447 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     table_[i].head = nullptr;
head              537 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     return table_[idx]->head;
head              581 uspace/lib/cpp/include/__bits/adt/hash_table.hpp                     if (table_[res].head)
head               45 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp         list_node<Value>* head;
head               48 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             : head{}
head               53 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             auto current = head;
head               61 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             while (current != head);
head               68 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             if (!head)
head               69 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head = node;
head               71 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head->append(node);
head               76 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             if (!head)
head               77 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head = node;
head               79 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp                 head->prepend(node);
head               84 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             if (!head)
head               87 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             auto current = head;
head               94 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             while (current && current != head);
head               96 uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp             head = nullptr;
head               73 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                 if (current_ == table_[idx_].head)
head               77 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                         while (!table_[++idx_].head && idx_ < max_idx_)
head               81 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                             current_ = table_[idx_].head;
head              193 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                 if (current_ == table_[idx_].head)
head              197 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                         while (!table_[++idx_].head && idx_ < max_idx_)
head              201 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                             current_ = table_[idx_].head;
head              295 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp             hash_table_local_iterator(list_node<value_type>* head = nullptr,
head              297 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                 : head_{head}, current_{current}
head              379 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp             hash_table_const_local_iterator(const list_node<value_type>* head = nullptr,
head              381 uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp                 : head_{head}, current_{current}
head               49 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto head = table.table_[idx].head;
head               51 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             if (head)
head               53 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 auto current = head;
head               66 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 } while (current && current != head);
head               71 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 table.table_[idx].head,
head               80 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto head = table.table_[idx].head;
head               81 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto current = head;
head               92 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                     if (current == head)
head               94 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                         if (current->next != head)
head               95 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                             table.table_[idx].head = current->next;
head               97 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                             table.table_[idx].head = nullptr;
head              108 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             while (current && current != head);
head              272 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto head = table.table_[table.get_bucket_idx_(key)].head;
head              273 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             if (!head)
head              276 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto current = head;
head              285 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             while (current && current != head);
head              294 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto head = table.table_[idx].head;
head              296 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             if (head)
head              298 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 auto current = head;
head              311 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 } while (current && current != head);
head              316 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                 table.table_[idx].head,
head              325 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto head = table.table_[idx].head;
head              326 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             auto current = head;
head              327 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             table.table_[idx].head = nullptr;
head              328 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             decltype(head) last = nullptr;
head              350 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp                         table.table_[idx].head = tmp;
head              363 uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp             while (current && current != head);
head               63 uspace/lib/cpp/include/__bits/adt/list.hpp                                     list_node<value_type>* head = nullptr,
head               65 uspace/lib/cpp/include/__bits/adt/list.hpp                     : current_{node}, head_{head}, end_{end}
head               74 uspace/lib/cpp/include/__bits/adt/list.hpp                     : current_{other.node()}, head_{other.head()}, end_{other.end()}
head              197 uspace/lib/cpp/include/__bits/adt/list.hpp                               list_node<value_type>* head = nullptr,
head              199 uspace/lib/cpp/include/__bits/adt/list.hpp                     : current_{node}, head_{head}, end_{end}
head              497 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     table_.bucket_count(), table_.head(first.idx())
head              555 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 if (bucket->head)
head              557 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto head = bucket->head;
head              558 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto current = bucket->head;
head              567 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     while (current != head);
head              583 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                 if (bucket->head)
head              585 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto head = bucket->head;
head              586 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     auto current = bucket->head;
head              595 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     while (current != head);
head             1001 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp                     table_.bucket_count(), table_.head(first.idx())
head              726 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp                     table_.bucket_count(), table_.head(first.idx())
head              111 uspace/lib/device/include/ipc/devman.h 	link_t *link = ids->ids.head.next;
head              113 uspace/lib/device/include/ipc/devman.h 	while (link != &ids->ids.head) {
head              122 uspace/lib/gfximage/src/tga.c 	tga_header_t *head = (tga_header_t *) data;
head              126 uspace/lib/gfximage/src/tga.c 	tga->id_length = head->id_length;
head              132 uspace/lib/gfximage/src/tga.c 	tga->cmap_type = head->cmap_type;
head              135 uspace/lib/gfximage/src/tga.c 	tga->img_type = head->img_type;
head              138 uspace/lib/gfximage/src/tga.c 	tga->cmap_first_entry = uint16_t_le2host(head->cmap_first_entry);
head              139 uspace/lib/gfximage/src/tga.c 	tga->cmap_entries = uint16_t_le2host(head->cmap_entries);
head              140 uspace/lib/gfximage/src/tga.c 	tga->cmap_bpp = head->cmap_bpp;
head              149 uspace/lib/gfximage/src/tga.c 	tga->startx = uint16_t_le2host(head->startx);
head              150 uspace/lib/gfximage/src/tga.c 	tga->starty = uint16_t_le2host(head->starty);
head              151 uspace/lib/gfximage/src/tga.c 	tga->width = uint16_t_le2host(head->width);
head              152 uspace/lib/gfximage/src/tga.c 	tga->height = uint16_t_le2host(head->height);
head              153 uspace/lib/gfximage/src/tga.c 	tga->img_bpp = head->img_bpp;
head              154 uspace/lib/gfximage/src/tga.c 	tga->img_alpha_bpp = head->img_descr & 0x0f;
head              155 uspace/lib/gfximage/src/tga.c 	tga->img_alpha_dir = (head->img_descr & 0xf0) >> 4;
head              333 uspace/lib/nic/src/nic_driver.c 		    nic_frame_list_t, head);
head              334 uspace/lib/nic/src/nic_driver.c 		list_remove(&frames->head);
head              358 uspace/lib/nic/src/nic_driver.c 		list_prepend(&frames->head, &nic_globals.frame_list_cache);
head               57 uspace/lib/posix/include/common/adt/fifo.h 		fifo_index_t head; \
head               73 uspace/lib/posix/include/common/adt/fifo.h 		.head = 0,				\
head               90 uspace/lib/posix/include/common/adt/fifo.h 		fifo_index_t head;			\
head               95 uspace/lib/posix/include/common/adt/fifo.h 		.head = 0,				\
head              106 uspace/lib/posix/include/common/adt/fifo.h 	name.fifo[name.head = (name.head + 1) < name.items ? (name.head + 1) : 0]
head               81 uspace/lib/posix/include/common/adt/list.h 		.head = { \
head               82 uspace/lib/posix/include/common/adt/list.h 			.prev = &(name).head, \
head               83 uspace/lib/posix/include/common/adt/list.h 			.next = &(name).head \
head               92 uspace/lib/posix/include/common/adt/list.h 		for (link_t *_link = (list).head.next; \
head               94 uspace/lib/posix/include/common/adt/list.h 		    _link != &(list).head; _link = _link->next)
head               98 uspace/lib/posix/include/common/adt/list.h 		for (link_t *_link = (list).head.prev; \
head              100 uspace/lib/posix/include/common/adt/list.h 		    _link != &(list).head; _link = _link->prev)
head              128 uspace/lib/posix/include/common/adt/list.h 	for (link_t *iterator = (list).head.next, \
head              130 uspace/lib/posix/include/common/adt/list.h 	    iterator != &(list).head; \
head              152 uspace/lib/posix/include/common/adt/list.h 	link_t head;  /**< List head. Does not have any data. */
head              187 uspace/lib/posix/include/common/adt/list.h 	list->head.prev = &list->head;
head              188 uspace/lib/posix/include/common/adt/list.h 	list->head.next = &list->head;
head              223 uspace/lib/posix/include/common/adt/list.h 	list_insert_after(link, &list->head);
head              236 uspace/lib/posix/include/common/adt/list.h 	list_insert_before(link, &list->head);
head              266 uspace/lib/posix/include/common/adt/list.h 	return (list->head.next == &list->head);
head              279 uspace/lib/posix/include/common/adt/list.h 	return ((list->head.next == &list->head) ? NULL : list->head.next);
head              292 uspace/lib/posix/include/common/adt/list.h 	return (list->head.prev == &list->head) ? NULL : list->head.prev;
head              304 uspace/lib/posix/include/common/adt/list.h 	return (link->next == &list->head) ? NULL : link->next;
head              316 uspace/lib/posix/include/common/adt/list.h 	return (link->prev == &list->head) ? NULL : link->prev;
head              387 uspace/lib/posix/include/common/adt/list.h 	headless_list_split(&list1->head, first1);
head              388 uspace/lib/posix/include/common/adt/list.h 	headless_list_split(&list2->head, first2);
head              391 uspace/lib/posix/include/common/adt/list.h 	headless_list_concat(&list1->head, first2);
head              392 uspace/lib/posix/include/common/adt/list.h 	headless_list_concat(&list2->head, first1);
head              407 uspace/lib/posix/include/common/adt/list.h 	list_splice(list2, list1->head.prev);
head              385 uspace/lib/posix/src/signal.c 	link_t *iterator = _signal_queue.head.next;
head              388 uspace/lib/posix/src/signal.c 	while (iterator != &(_signal_queue).head) {
head               43 uspace/lib/termui/src/history.c 	return lines->head == lines->tail;
head               84 uspace/lib/termui/src/history.c 	assert(lines->head <= lines->tail);
head              120 uspace/lib/termui/src/history.c 	if (lines->head <= lines->tail)
head              121 uspace/lib/termui/src/history.c 		return idx >= lines->head && idx < lines->tail;
head              123 uspace/lib/termui/src/history.c 		return (idx >= lines->head && idx < lines->buf_len) ||
head              128 uspace/lib/termui/src/history.c 	assert(history->lines.head < history->lines.buf_len); \
head              144 uspace/lib/termui/src/history.c 	bool head = (history->viewport_top == lines->head);
head              146 uspace/lib/termui/src/history.c 	struct history_line line = lines->buf[lines->head];
head              147 uspace/lib/termui/src/history.c 	_line_idx_inc(lines, &lines->head);
head              149 uspace/lib/termui/src/history.c 	if (lines->head == lines->tail) {
head              150 uspace/lib/termui/src/history.c 		lines->head = 0;
head              157 uspace/lib/termui/src/history.c 	if (head) {
head              158 uspace/lib/termui/src/history.c 		history->viewport_top = lines->head;
head              164 uspace/lib/termui/src/history.c 	if (lines->head == 0 && lines->buf_len > lines->max_len)
head              225 uspace/lib/termui/src/history.c 	if (lines->tail < lines->head)
head              301 uspace/lib/termui/src/history.c 	if (lines->tail == lines->head)
head              304 uspace/lib/termui/src/history.c 	assert(lines->tail != lines->head);
head              483 uspace/lib/termui/src/history.c 	while (delta < 0 && history->viewport_top != history->lines.head) {
head              509 uspace/lib/termui/src/history.c 	history->viewport_top = history->lines.head;
head               61 uspace/lib/termui/src/history.h 	size_t head;
head               91 uspace/lib/usbhid/src/hiddescriptor.c 	link_t *path_it = report->collection_paths.head.next;
head               98 uspace/lib/usbhid/src/hiddescriptor.c 	while (path_it != &report->collection_paths.head) {
head              108 uspace/lib/usbhid/src/hiddescriptor.c 	if (path_it == &report->collection_paths.head) {
head              495 uspace/lib/usbhid/src/hidparser.c 		field_it = report_des->report_items.head.next;
head              500 uspace/lib/usbhid/src/hidparser.c 	while (field_it != &report_des->report_items.head) {
head              552 uspace/lib/usbhid/src/hidparser.c 		report_it = report->reports.head.next;
head              555 uspace/lib/usbhid/src/hidparser.c 	while (report_it != &report->reports.head) {
head              252 uspace/lib/usbhid/src/hidpath.c 		report_link = report_path->items.head.next;
head              253 uspace/lib/usbhid/src/hidpath.c 		path_link = path->items.head.next;
head              255 uspace/lib/usbhid/src/hidpath.c 		while ((report_link != &report_path->items.head) &&
head              256 uspace/lib/usbhid/src/hidpath.c 		    (path_link != &path->items.head)) {
head              276 uspace/lib/usbhid/src/hidpath.c 		    (path_link == &path->items.head)) ||
head              277 uspace/lib/usbhid/src/hidpath.c 		    ((report_link == &report_path->items.head) &&
head              278 uspace/lib/usbhid/src/hidpath.c 		    (path_link == &path->items.head))) {
head              289 uspace/lib/usbhid/src/hidpath.c 		report_link = report_path->items.head.prev;
head              290 uspace/lib/usbhid/src/hidpath.c 		path_link = path->items.head.prev;
head              296 uspace/lib/usbhid/src/hidpath.c 		while ((report_link != &report_path->items.head) &&
head              297 uspace/lib/usbhid/src/hidpath.c 		    (path_link != &path->items.head)) {
head              315 uspace/lib/usbhid/src/hidpath.c 		if (path_link == &path->items.head) {
head              127 uspace/lib/virtio/virtio.c     uint16_t size, uint16_t *head)
head              133 uspace/lib/virtio/virtio.c 	*head = 0;
head              144 uspace/lib/virtio/virtio.c uint16_t virtio_alloc_desc(virtio_dev_t *vdev, uint16_t num, uint16_t *head)
head              148 uspace/lib/virtio/virtio.c 	uint16_t descno = *head;
head              150 uspace/lib/virtio/virtio.c 		*head = virtio_virtq_desc_get_next(vdev, num, descno);
head              162 uspace/lib/virtio/virtio.c void virtio_free_desc(virtio_dev_t *vdev, uint16_t num, uint16_t *head,
head              168 uspace/lib/virtio/virtio.c 	    *head);
head              169 uspace/lib/virtio/virtio.c 	*head = descno;
head              437 uspace/srv/devman/driver.c 	link = driver->devices.head.next;
head              438 uspace/srv/devman/driver.c 	while (link != &driver->devices.head) {
head              486 uspace/srv/devman/driver.c 		link = driver->devices.head.next;
head               69 uspace/srv/devman/match.c 	link_t *drv_head = &drv->match_ids.ids.head;
head               70 uspace/srv/devman/match.c 	link_t *dev_head = &dev->pfun->match_ids.ids.head;
head               82 uspace/srv/devman/match.c 	link_t *drv_link = drv->match_ids.ids.head.next;
head              286 uspace/srv/fs/exfat/exfat_idx.c 		for (lnk = u->freed_list.head.next; lnk != &u->freed_list.head;
head              291 uspace/srv/fs/exfat/exfat_idx.c 				if (lnk->prev != &u->freed_list.head)
head              299 uspace/srv/fs/exfat/exfat_idx.c 				if (lnk->next != &u->freed_list.head)
head              286 uspace/srv/fs/fat/fat_idx.c 		for (lnk = u->freed_list.head.next; lnk != &u->freed_list.head;
head              291 uspace/srv/fs/fat/fat_idx.c 				if (lnk->prev != &u->freed_list.head)
head              299 uspace/srv/fs/fat/fat_idx.c 				if (lnk->next != &u->freed_list.head)
head              111 uspace/srv/net/tcp/ncsim.c 		if (link == &sim_queue.head)
head              252 uspace/srv/net/tcp/tqueue.c 	cur = conn->retransmit.list.head.next;
head              254 uspace/srv/net/tcp/tqueue.c 	while (cur != &conn->retransmit.list.head) {
HelenOS homepage, sources at GitHub