/haiku/3rdparty/kallisti5/ |
H A D | validateRepoFile | 16 HTTP_STATUS=$(curl -s -I -L "$1" | head -n1 | awk '{ print $2 }')
|
/haiku/3rdparty/mmu_man/onlinedemo/ |
H A D | haiku.php | 820 <head> 855 </head>
|
/haiku/3rdparty/mmu_man/scripts/ |
H A D | bebook | 9 $(query -a '(BEOS:APP_SIG=="application/x-vnd.STertois.BeHappy")' | head -1) &
|
H A D | bman | 9 $(query -a '(BEOS:APP_SIG=="application/x-vnd.STertois.BeHappy")' | head -1) &
|
H A D | dev-perso | 136 test -e "$f" && grep '^* ' "$f" | grep --color=always ' TODO ' | head -5 && break
|
/haiku/3rdparty/pulkomandy/ |
H A D | catmerge.sh | 24 head -1 $NEW
|
/haiku/headers/compatibility/bsd/sys/ |
H A D | queue.h | 50 * added to the list after an existing element or at the head of the list. 51 * Elements being removed from the head of the list should use the explicit 58 * head of the list and the other to the tail of the list. The elements are 61 * to the list after an existing element, at the head of the list, or at the 62 * end of the list. Elements being removed from the head of the tail queue 72 * or after an existing element or at the head of the list. A list 75 * A tail queue is headed by a pair of pointers, one to the head of the 79 * after an existing element, at the head of the list, or at the end of 109 /* Store the last 2 places the queue element or head was altered */ 120 #define QMD_TRACE_HEAD(head) d 596 *head = (struct quehead *)b; local [all...] |
/haiku/headers/libs/agg/ |
H A D | agg_arrowhead.h | 36 void head(double d1, double d2, double d3, double d4) function in class:agg::arrowhead 45 void head() { m_head_flag = true; } function in class:agg::arrowhead
|
/haiku/headers/private/drivers/ |
H A D | ata_types.h | 28 head : 4,
|
/haiku/headers/private/firewire/ |
H A D | queue.h | 45 * added to the list after an existing element or at the head of the list. 46 * Elements being removed from the head of the list should use the explicit 53 * head of the list and the other to the tail of the list. The elements are 56 * to the list after an existing element, at the head of the list, or at the 57 * end of the list. Elements being removed from the head of the tail queue 67 * or after an existing element or at the head of the list. A list 70 * A tail queue is headed by a pair of pointers, one to the head of the 74 * after an existing element, at the head of the list, or at the end of 104 /* Store the last 2 places the queue element or head was altered */ 115 #define QMD_TRACE_HEAD(head) d 591 *head = (struct quehead *)b; local [all...] |
/haiku/headers/private/kernel/util/ |
H A D | queue.h | 15 void *head; member in struct:queue 28 int head; member in struct:fixed_queue
|
/haiku/src/add-ons/accelerants/skeleton/engine/ |
H A D | general.c | 267 void set_crtc_owner(bool head) argument 271 if (!head) 355 /* enable head 2 on connector 1 */ 356 /* (b8 = select CRTC (head) for output, 360 /* enable head 1 on connector 2 */ 367 /* enable head 1 on connector 1 */ 369 /* enable head 2 on connector 2 */ 437 /* enable access to primary head */ 439 /* unlock head's registers for R/W access */ 445 /* enable access to secondary head */ [all...] |
/haiku/src/add-ons/accelerants/via/engine/ |
H A D | general.c | 291 void set_crtc_owner(bool head) argument 295 if (!head) 380 /* enable head 2 on connector 1 */ 381 /* (b8 = select CRTC (head) for output, 385 /* enable head 1 on connector 2 */ 392 /* enable head 1 on connector 1 */ 394 /* enable head 2 on connector 2 */
|
/haiku/src/add-ons/kernel/bus_managers/scsi/ |
H A D | dl_list.h | 13 #define REMOVE_DL_LIST( item, head, prefix ) \ 18 head = item->prefix##next; \ 24 #define ADD_DL_LIST_HEAD( item, head, prefix ) \ 26 item->prefix##next = head; \ 29 if( (head) ) \ 30 (head)->prefix##prev = item; \ 32 (head) = item; \ 35 #define REMOVE_CDL_LIST( item, head, prefix ) \ 40 if( item == (head) ) { \ 42 (head) [all...] |
/haiku/src/add-ons/kernel/drivers/audio/ac97/auich/ |
H A D | queue.h | 49 * head of the list. Elements being removed from the head of the list 59 * or after an existing element or at the head of the list. A list 62 * A simple queue is headed by a pair of pointers, one the head of the 65 * head of the list. New elements can be added to the list after 66 * an existing element, at the head of the list, or at the end of the 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 76 * A circle queue is headed by a pair of pointers, one to the head of the 80 * an existing element, at the head o [all...] |
/haiku/src/add-ons/kernel/drivers/audio/ac97/auvia/ |
H A D | queue.h | 49 * head of the list. Elements being removed from the head of the list 59 * or after an existing element or at the head of the list. A list 62 * A simple queue is headed by a pair of pointers, one the head of the 65 * head of the list. New elements can be added to the list after 66 * an existing element, at the head of the list, or at the end of the 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 76 * A circle queue is headed by a pair of pointers, one to the head of the 80 * an existing element, at the head o [all...] |
/haiku/src/add-ons/kernel/drivers/audio/ac97/es1370/ |
H A D | queue.h | 49 * head of the list. Elements being removed from the head of the list 59 * or after an existing element or at the head of the list. A list 62 * A simple queue is headed by a pair of pointers, one the head of the 65 * head of the list. New elements can be added to the list after 66 * an existing element, at the head of the list, or at the end of the 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 76 * A circle queue is headed by a pair of pointers, one to the head of the 80 * an existing element, at the head o [all...] |
/haiku/src/add-ons/kernel/drivers/audio/echo/ |
H A D | queue.h | 49 * head of the list. Elements being removed from the head of the list 59 * or after an existing element or at the head of the list. A list 62 * A simple queue is headed by a pair of pointers, one the head of the 65 * head of the list. New elements can be added to the list after 66 * an existing element, at the head of the list, or at the end of the 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 76 * A circle queue is headed by a pair of pointers, one to the head of the 80 * an existing element, at the head o [all...] |
/haiku/src/add-ons/kernel/drivers/audio/emuxki/ |
H A D | queue.h | 49 * head of the list. Elements being removed from the head of the list 59 * or after an existing element or at the head of the list. A list 62 * A simple queue is headed by a pair of pointers, one the head of the 65 * head of the list. New elements can be added to the list after 66 * an existing element, at the head of the list, or at the end of the 69 * A tail queue is headed by a pair of pointers, one to the head of the 73 * after an existing element, at the head of the list, or at the end of 76 * A circle queue is headed by a pair of pointers, one to the head of the 80 * an existing element, at the head o [all...] |
/haiku/src/add-ons/kernel/drivers/network/wlan/atheroswifi/dev/ath/ |
H A D | if_ath_descdma.c | 146 struct ath_descdma *dd, ath_bufhead *head, 239 struct ath_descdma *dd, ath_bufhead *head, 251 error = ath_descdma_alloc_desc(sc, dd, head, name, ds_size, 272 TAILQ_INIT(head); 296 ath_descdma_cleanup(sc, dd, head); 300 TAILQ_INSERT_TAIL(head, bf, bf_list); 328 struct ath_descdma *dd, ath_bufhead *head, 361 TAILQ_INIT(head); 373 ath_descdma_cleanup(sc, dd, head); 376 TAILQ_INSERT_TAIL(head, b 145 ath_descdma_alloc_desc(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head, const char *name, int ds_size, int ndesc) argument 238 ath_descdma_setup(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head, const char *name, int ds_size, int nbuf, int ndesc) argument 327 ath_descdma_setup_rx_edma(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head, const char *name, int nbuf, int rx_status_len) argument 385 ath_descdma_cleanup(struct ath_softc *sc, struct ath_descdma *dd, ath_bufhead *head) argument [all...] |
H A D | if_ath_descdma.h | 35 struct ath_descdma *dd, ath_bufhead *head, const char *name, 38 ath_bufhead *head, const char *name, int ds_size, int nbuf, 41 struct ath_descdma *dd, ath_bufhead *head, const char *name, 44 struct ath_descdma *dd, ath_bufhead *head);
|
/haiku/src/add-ons/kernel/drivers/network/wlan/iprowifi3945/dev/wpi/ |
H A D | if_wpi.c | 1912 struct wpi_rx_head *head; local 1930 head = (struct wpi_rx_head *)((caddr_t)(stat + 1) + stat->len); 1931 len = le16toh(head->len); 1932 tail = (struct wpi_rx_tail *)((caddr_t)(head + 1) + len); 1938 head->plcp, head->chan, (uintmax_t)le64toh(tail->tstamp)); 1990 m->m_data = (caddr_t)(head + 1); 2018 if (head->flags & htole16(WPI_STAT_FLAG_SHPREAMBLE)) 2023 tap->wr_antenna = (le16toh(head->flags) >> 4) & 0xf; 2024 tap->wr_rate = plcp2rate(head [all...] |
/haiku/src/add-ons/kernel/file_systems/ntfs/libntfs/ |
H A D | security.h | 118 struct CACHED_PERMISSIONS_HEADER head; member in struct:PERMISSIONS_CACHE
|
/haiku/src/add-ons/kernel/file_systems/packagefs/resolvables/ |
H A D | DependencyFamily.h | 63 Dependency* head = fDependencies.Head(); local 64 return head != NULL ? head->Name() : String();
|
H A D | ResolvableFamily.h | 40 Resolvable* head = fResolvables.Head(); local 41 return head != NULL ? head->Name() : String();
|