A brief file description. More...

#include <stdint.h>
#include "ink_assert.h"
#include "ink_queue.h"
#include "Compatability.h"
#include "defalloc.h"

Include dependency graph for List.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
class	SLink< C >
struct	Link< C >
class	SLL< C, L >
struct	DLL< C, L >
class	Queue< C, L >
struct	SortableQueue< C, L >
struct	CountQueue< C, L >
struct	ConsCell< C, A >
struct	List< C, A >
struct	AtomicSLL< C, L >
Defines
#define	SLINK(_c, _f)
#define	SLINKM(_c, _m, _f)
#define	LINK(_c, _f)
#define	LINKM(_c, _m, _f)
#define	LINK_FORWARD_DECLARATION(_c, _f)
#define	LINK_DEFINITION(_c, _f)
#define	SList(_c, _f) SLL<_c, _c::Link##_##_f>
#define	SListM(_c, _m, _ml, _l) SLL<_c, _c::Link##_##_ml##_##_l>
#define	forl_LL(_c, _p, _l) for (_c *_p = (_l).head; _p; _p = (_l).next(_p))
#define	DList(_c, _f) DLL<_c, _c::Link##_##_f>
#define	DListM(_c, _m, _ml, _l) DLL<_c, _c::Link##_##_ml##_##_l>
#define	Que(_c, _f) Queue<_c, _c::Link##_##_f>
#define	QueM(_c, _m, _mf, _f) Queue<_c, _c::Link##_##_mf##_##_f>
#define	SortableQue(_c, _l) SortableQueue<_c, _c::Link##_##_f>
#define	CountQue(_c, _f) CountQueue<_c, _c::Link##_##_f>
#define	CountQueM(_c, _m, _mf, _f) CountQueue<_c, _c::Link##_##_mf##_##_f>
#define	forc_List(_c, _p, _l) if ((_l).head) for (_c *_p = (_l).head; _p; _p = _p->cdr)
#define	ASLL(_c, _l) AtomicSLL<_c, _c::Link##_##_l>
#define	ASLLM(_c, _m, _ml, _l) AtomicSLL<_c, _c::Link##_##_ml##_##_l>

Detailed Description

A brief file description.

License

Licensed to the Apache Software Foundation (ASF) under one or more contributor license agreements. See the NOTICE file distributed with this work for additional information regarding copyright ownership. The ASF licenses this file to you under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at

http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

Definition in file List.h.

Define Documentation

#define ASLL	(	_c,
		_l
	)		AtomicSLL<_c, _c::Link##_##_l>

Definition at line 495 of file List.h.

#define ASLLM	(	_c,
		_m,
		_ml,
		_l
	)		AtomicSLL<_c, _c::Link##_##_ml##_##_l>

Definition at line 496 of file List.h.

#define CountQue	(	_c,
		_f
	)		CountQueue<_c, _c::Link##_##_f>

Definition at line 371 of file List.h.

#define CountQueM	(	_c,
		_m,
		_mf,
		_f
	)		CountQueue<_c, _c::Link##_##_mf##_##_f>

Definition at line 372 of file List.h.

#define DList	(	_c,
		_f
	)		DLL<_c, _c::Link##_##_f>

Definition at line 160 of file List.h.

#define DListM	(	_c,
		_m,
		_ml,
		_l
	)		DLL<_c, _c::Link##_##_ml##_##_l>

Definition at line 161 of file List.h.

#define forc_List	(	_c,
		_p,
		_l
	)		if ((_l).head) for (_c *_p = (_l).head; _p; _p = _p->cdr)

Definition at line 456 of file List.h.

Referenced by StringChainHash< F, A >::canonicalize(), ChainHash< C, AHashFns, A >::del(), ChainHash< C, AHashFns, A >::get(), ChainHash< C, AHashFns, A >::get_bag(), ChainHash< C, AHashFns, A >::get_elements(), Env< K, C, A >::pop(), and ChainHash< C, AHashFns, A >::put().

#define forl_LL	(	_c,
		_p,
		_l
	)		for (_c *_p = (_l).head; _p; _p = (_l).next(_p))

Definition at line 123 of file List.h.

Referenced by InactivityCop::check_inactivity(), Trie< T >::Print(), UrlRewrite::PrintStore(), ShowNet::showConnectionsOnThread(), and ShowNet::showSingleThread().

#define LINK	(	_c,
		_f
	)

Value:

class Link##_##_f : public Link<_c> { public:       \
    static _c *& next_link(_c *c) { return c->_f.next; }                \
    static _c *& prev_link(_c *c) { return c->_f.prev; }                \
    static const _c * next_link(const _c *c) { return c->_f.next; }     \
    static const _c * prev_link(const _c *c) { return c->_f.prev; }     \
  }; Link<_c> _f

Definition at line 87 of file List.h.

Referenced by LINK_FORWARD_DECLARATION().

#define LINK_DEFINITION	(	_c,
		_f
	)

Value:

inline _c *& Link##_##_c##_##_f::next_link(_c *c) { return c->_f.next; } \
  inline _c *& Link##_##_c##_##_f::prev_link(_c *c) { return c->_f.prev; } \

Definition at line 101 of file List.h.

#define LINK_FORWARD_DECLARATION	(	_c,
		_f
	)

Value:

class Link##_##_c##_##_f : public Link<_c> { public:     \
    static _c *& next_link(_c *c);                                      \
    static _c *& prev_link(_c *c);                                      \
  };

Definition at line 97 of file List.h.

#define LINKM	(	_c,
		_m,
		_f
	)

Value:

class Link##_##_m##_##_f : public Link<_c> { public:  \
    static _c *& next_link(_c *c) { return c->_m._f.next; }             \
    static _c *& prev_link(_c *c) { return c->_m._f.prev; }             \
  };

Definition at line 93 of file List.h.

#define Que	(	_c,
		_f
	)		Queue<_c, _c::Link##_##_f>

Definition at line 224 of file List.h.

Referenced by Vol::aggWrite().

#define QueM	(	_c,
		_m,
		_mf,
		_f
	)		Queue<_c, _c::Link##_##_mf##_##_f>

Definition at line 225 of file List.h.

#define SLINK	(	_c,
		_f
	)

Value:

class Link##_##_f : public SLink<_c> { public:    \
    static _c *& next_link(_c *c) { return c->_f.next; }                \
    static const _c * next_link(const _c *c) { return c->_f.next; } \
  }; SLink<_c> _f

Definition at line 72 of file List.h.

#define SLINKM	(	_c,
		_m,
		_f
	)

Value:

class Link##_##_m##_##_f : public SLink<_c> { public: \
    static _c *& next_link(_c *c) { return c->_m._f.next; }             \
  };

Definition at line 76 of file List.h.

#define SList	(	_c,
		_f
	)		SLL<_c, _c::Link##_##_f>

Definition at line 121 of file List.h.

Referenced by LogBufferManager::preproc_buffers().

#define SListM	(	_c,
		_m,
		_ml,
		_l
	)		SLL<_c, _c::Link##_##_ml##_##_l>

Definition at line 122 of file List.h.

Referenced by NetHandler::process_enabled_list().

#define SortableQue	(	_c,
		_l
	)		SortableQueue<_c, _c::Link##_##_f>

Definition at line 353 of file List.h.

List.h File Reference

Data Structures

Defines

Detailed Description

License

Define Documentation