Lines Matching refs:NULL
148 static struct dn_pipe *all_pipes = NULL ; /* list of all pipes */
149 static struct dn_flow_set *all_flow_sets = NULL ;/* list of all flow_sets */
245 if (p == NULL) {
259 * Insert element in heap. Normally, p != NULL, we insert p in
260 * a new position and bubble up. If p == NULL, then the element is
282 if (p == NULL) /* data already there, set starting point */
309 * remove top element from heap, or obj if obj != NULL
321 if (obj != NULL) { /* extract specific element, index is at offset */
347 heap_insert(h, father, NULL); /* this one cannot fail */
402 heap_insert(h, i , NULL) ;
429 /* KASSERT(mtag != NULL &&
472 m->m_nextpkt = NULL;
479 (void)ip_output(m, NULL, NULL, pkt->flags, NULL, NULL);
482 tmp_rt.ro_rt = NULL;
498 (m = m_pullup(m, ETHER_HDR_LEN)) == NULL) {
561 if (p->head == NULL)
566 p->tail->m_nextpkt = NULL;
585 if (p == NULL) {
589 p_was_empty = (p->head == NULL) ;
600 while ( (pkt = q->head) != NULL ) {
615 if ( (pkt = q->head) != NULL ) { /* this implies bandwidth != 0 */
645 int p_was_empty = (p->head == NULL) ;
654 if (p->ifp && p->ifp->if_snd.ifq_head != NULL)
674 heap_extract(sch, NULL); /* remove queue from heap */
707 heap_extract(neh, NULL);
793 heap_extract(h, NULL); /* need to extract before processing */
813 heap_extract(&(pe->idle_heap), NULL);
828 bsd_timeout(dummynet, NULL, &ts);
848 if (p == NULL) {
858 if (p != NULL) {
886 for (prev=NULL, q = fs->rq[i] ; q != NULL ; )
887 if (q->head != NULL || q->S != q->F+1) {
893 if (prev != NULL)
918 if ( fs->rq[i] != NULL )
922 if (q == NULL) {
924 return NULL ;
966 for (prev=NULL, q = fs->rq[i] ; q ; ) {
975 else if (pipe_expire && q->head == NULL && q->S == q->F+1 ) {
979 if (prev != NULL)
990 if (q && prev != NULL) { /* found and not in front */
996 if (q == NULL) { /* no match, need to allocate a new entry */
998 if (q != NULL)
1118 if (fs != NULL)
1129 if (p1 != NULL)
1146 * NULL in ip_input, destination interface in ip_output,
1148 * ro route parameter (only used in ip_output, NULL otherwise)
1162 struct dn_flow_queue *q = NULL ;
1192 if (fs == NULL)
1195 if (pipe == NULL) { /* must be a queue, try find a matching pipe */
1199 if (pipe != NULL)
1208 if ( q == NULL )
1230 if ( mtag == NULL )
1258 if (fwa->ipoa != NULL)
1261 if (q->head == NULL)
1346 bsd_timeout(dummynet, NULL, &ts);
1365 struct m_tag *tag = m_tag_locate(m, KERNEL_MODULE_TAG_ID, KERNEL_TAG_TYPE_DUMMYNET, NULL); \
1370 n->ro.ro_rt = NULL; \
1396 while ((m = mnext) != NULL) {
1403 fs->rq[i] = NULL ;
1431 while ((m = mnext) != NULL) {
1454 flush_pipe_ptrs(NULL);
1457 all_pipes = NULL ;
1459 all_flow_sets = NULL ;
1556 x->w_q_lookup = NULL ;
1566 if (x->w_q_lookup == NULL) {
1604 if (x->rq == NULL) {
1661 for (a = NULL , b = all_pipes ; b && b->pipe_nr < p->pipe_nr ;
1664 if (b == NULL || b->pipe_nr != p->pipe_nr) { /* new pipe */
1666 if (x == NULL) {
1688 x->ifp = NULL ; /* reset interface ptr */
1693 if ( x->fs.rq == NULL ) { /* a new pipe */
1701 if (a == NULL)
1712 for (a=NULL, b=all_flow_sets ; b && b->fs_nr < pfs->fs_nr ;
1715 if (b == NULL || b->fs_nr != pfs->fs_nr) { /* new */
1721 if (x == NULL) {
1743 if ( x->rq == NULL ) { /* a new flow_set */
1751 if (a == NULL)
1822 while ((m = mnext) != NULL) {
1826 p->head = p->tail = NULL ;
1846 for (a = NULL , b = all_pipes ; b && b->pipe_nr < p->pipe_nr ;
1848 if (b == NULL || (b->pipe_nr != p->pipe_nr) ) {
1854 if (a == NULL)
1866 fs->pipe = NULL ;
1882 for (a = NULL, b = all_flow_sets ; b && b->fs_nr < p->fs.fs_nr ;
1884 if (b == NULL || (b->fs_nr != p->fs.fs_nr) ) {
1889 if (a == NULL)
1896 if (b->pipe != NULL) {
1933 qp->next = NULL ;
1934 qp->head = qp->tail = NULL ;
1935 qp->fs = NULL ;
1987 buf = NULL;
1989 if (buf == NULL) {
2011 pipe_bp->head = pipe_bp->tail = NULL ;
2012 pipe_bp->fs.next = NULL ;
2013 pipe_bp->fs.pipe = NULL ;
2014 pipe_bp->fs.rq = NULL ;
2024 fs_bp->pipe = NULL ;
2025 fs_bp->rq = NULL ;
2090 if ((dn_mutex = lck_mtx_alloc_init(dn_mutex_grp, dn_mutex_attr)) == NULL) {
2095 all_pipes = NULL ;
2096 all_flow_sets = NULL ;