File Manager

003 File Manager

Current Path: /usr/src/contrib/ntp/include

📁 ..
📄 Makefile.am(1.2 KB)
📄 Makefile.in(24.68 KB)
📄 README(157 B)
📄 adjtime.h(1.96 KB)
📄 ascii.h(2.78 KB)
📄 audio.h(283 B)
📄 binio.h(3.26 KB)
📄 declcond.h(803 B)
📄 gps.h(2.84 KB)
📄 hopf6039.h(3.51 KB)
📄 icom.h(2.33 KB)
📄 ieee754io.h(2.94 KB)
📄 intreswork.h(808 B)
📄 iosignal.h(1.46 KB)
📁 isc
📄 l_stdlib.h(4.8 KB)
📄 lib_strbuf.h(674 B)
📄 libntp.h(436 B)
📄 libssl_compat.h(4.25 KB)
📄 mbg_gps166.h(36.84 KB)
📄 mx4200.h(2.15 KB)
📄 ntif.h(2.86 KB)
📄 ntp.h(33.52 KB)
📄 ntp_assert.h(2.73 KB)
📄 ntp_calendar.h(14.99 KB)
📄 ntp_calgps.h(4.02 KB)
📄 ntp_cmdargs.h(38 B)
📄 ntp_config.h(8.33 KB)
📄 ntp_control.h(5.66 KB)
📄 ntp_crypto.h(6.61 KB)
📄 ntp_datum.h(1.07 KB)
📄 ntp_debug.h(635 B)
📄 ntp_filegen.h(1.76 KB)
📄 ntp_fp.h(13.37 KB)
📄 ntp_if.h(651 B)
📄 ntp_intres.h(1.77 KB)
📄 ntp_io.h(1.82 KB)
📄 ntp_keyacc.h(658 B)
📄 ntp_libopts.h(330 B)
📄 ntp_lineedit.h(251 B)
📄 ntp_lists.h(12.09 KB)
📄 ntp_machine.h(7.18 KB)
📄 ntp_malloc.h(1.18 KB)
📄 ntp_md5.h(1.32 KB)
📄 ntp_net.h(6.61 KB)
📄 ntp_prio_q.h(1.93 KB)
📄 ntp_proto.h(95 B)
📄 ntp_psl.h(342 B)
📄 ntp_random.h(402 B)
📄 ntp_refclock.h(7.81 KB)
📄 ntp_request.h(30.83 KB)
📄 ntp_rfc2553.h(8.46 KB)
📄 ntp_select.h(1.02 KB)
📄 ntp_stdlib.h(9.83 KB)
📄 ntp_string.h(708 B)
📄 ntp_syscall.h(1.17 KB)
📄 ntp_syslog.h(2.94 KB)
📄 ntp_tty.h(2.61 KB)
📄 ntp_types.h(7.21 KB)
📄 ntp_unixtime.h(1.6 KB)
📄 ntp_worker.h(5.54 KB)
📄 ntp_workimpl.h(749 B)
📄 ntpd.h(20.67 KB)
📄 ntpsim.h(3.85 KB)
📄 parse.h(14.58 KB)
📄 parse_conf.h(2.76 KB)
📄 rc_cmdlength.h(83 B)
📄 recvbuff.h(3.84 KB)
📄 refclock_atom.h(449 B)
📄 refidsmear.h(89 B)
📄 safecast.h(1.04 KB)
📄 ssl_applink.c(2.1 KB)
📄 timepps-SCO.h(11.67 KB)
📄 timepps-Solaris.h(13.24 KB)
📄 timepps-SunOS.h(11.78 KB)
📄 timespecops.h(4.82 KB)
📄 timetoa.h(2.62 KB)
📄 timevalops.h(8.33 KB)
📄 timexsup.h(1.37 KB)
📄 trimble.h(8.01 KB)
📄 vint64ops.h(1.05 KB)

Editing: ntp_prio_q.h

/* ntp_prio_q.h
 *
 * This file contains the structures and function prototypes for the
 * priority queue implementation used by the discrete event simulator.
 *
 * Written By:	Sachin Kamboj
 *		University of Delaware
 *		Newark, DE 19711
 * Copyright (c) 2006
 */

#ifndef NTP_PRIO_Q_H
#define NTP_PRIO_Q_H

#include <stddef.h>		/* size_t */

/* Structures for storing a priority queue 
 * ---------------------------------------
 */

typedef struct node {
	union {
		struct node *next;
		double d;
	} nodeu;
} node;
#define node_next nodeu.next

typedef int (*q_order_func)(const void *, const void *);

typedef struct Queue {
	q_order_func	get_order;
	node *		front;
	int		no_of_elements;
} queue;

/* FUNCTION PROTOTYPES
 * -------------------
 */
/* Define a function to create a FIFO queue */
#define create_queue()	create_priority_queue(&get_fifo_order)

void destroy_queue(queue *my_queue);
void free_node(void *my_node);
void *next_node(void *my_node);
int empty(queue *my_queue);
void *queue_head(queue *my_queue);
queue *enqueue(queue *my_queue, void *my_node);
void append_queue(queue *q1, queue *q2);
void *dequeue(queue *my_queue);
int get_no_of_elements(queue *my_queue);
int get_fifo_order(const void *el1, const void *el2);

/*
 * Preserve original callsite __FILE__ and __LINE__ for these 
 * malloc-like funcs when using MS C runtime debug heap.
 */
#ifdef _CRTDBG_MAP_ALLOC
# define create_priority_queue(order)	debug_create_priority_queue(order, __FILE__, __LINE__)
# define get_node(size)			debug_get_node(size, __FILE__, __LINE__)
#else
# define create_priority_queue(order)	debug_create_priority_queue(order)
# define get_node(size)			debug_get_node(size)
#endif

queue *debug_create_priority_queue(
	q_order_func	get_order
#ifdef _CRTDBG_MAP_ALLOC
	, const char *	sourcefile
	, int		line_num
#endif	
	);

void *debug_get_node(
	size_t		size
#ifdef _CRTDBG_MAP_ALLOC
	, const char *	sourcefile
	, int		line_num
#endif
	);

#endif	/* NTP_PRIO_Q_H */

003 File Manager

Editing: ntp_prio_q.h

Upload File

Create Folder