| /external/e2fsprogs/misc/ |
| chattr.1.in | 30 data journalling (j), secure deletion (s), no tail-merging (t),
108 support tail-merging). This is necessary for applications such as LILO
109 which read the filesystem directly, and which don't understand tail-merged
111 (yet, except in very experimental patches) support tail-merging.
|
| /external/genext2fs/ |
| Config.mk | 7 $(hide) num_blocks=`du -sk $(1) | tail -n1 | awk '{print $$1;}'`;\
|
| /external/iproute2/ip/ |
| iplink_vlan.c | 47 struct rtattr *tail; local
49 tail = NLMSG_TAIL(n);
68 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *)tail;
|
| /external/iproute2/tc/ |
| f_route.c | 43 struct rtattr *tail; local
59 tail = NLMSG_TAIL(n);
126 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| m_gact.c | 104 struct rtattr *tail; local
190 tail = NLMSG_TAIL(n);
198 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| m_mirred.c | 74 struct rtattr *tail; local
202 tail = NLMSG_TAIL(n);
205 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| m_nat.c | 92 struct rtattr *tail; local
157 tail = NLMSG_TAIL(n);
160 tail->rta_len = (char *)NLMSG_TAIL(n) - (char *)tail;
|
| q_atm.c | 59 struct rtattr *tail; local
182 tail = NLMSG_TAIL(n);
187 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| q_red.c | 47 struct rtattr *tail; local
152 tail = NLMSG_TAIL(n);
156 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| q_cbq.c | 61 struct rtattr *tail; local
167 tail = NLMSG_TAIL(n);
178 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
198 struct rtattr *tail; local
413 tail = NLMSG_TAIL(n);
433 tail->rta_len = (void *) NLMSG_TAIL(n) - (void *) tail;
|
| /external/netcat/scripts/ |
| dist.sh | 11 SRC=`tail -1 dist.log`
|
| /external/gtest/include/gtest/internal/ |
| gtest-type-util.h | 104 // Head for the first type in the list, and Tail for the rest of the
115 typedef Types0 Tail;
120 typedef Types1<T2> Tail;
126 typedef Types2<T2, T3> Tail;
132 typedef Types3<T2, T3, T4> Tail;
138 typedef Types4<T2, T3, T4, T5> Tail;
145 typedef Types5<T2, T3, T4, T5, T6> Tail;
152 typedef Types6<T2, T3, T4, T5, T6, T7> Tail;
159 typedef Types7<T2, T3, T4, T5, T6, T7, T8> Tail;
166 typedef Types8<T2, T3, T4, T5, T6, T7, T8, T9> Tail;
[all...] |
| gtest-type-util.h.pump | 104 // Head for the first type in the list, and Tail for the rest of the
115 typedef Types0 Tail;
126 typedef Types$(i-1)<$for k, [[T$k]]> Tail;
204 // Head for the selector of the first template in the list, and Tail
215 typedef Templates0 Tail;
226 typedef Templates$(i-1)<$for k, [[T$k]]> Tail;
|
| /external/qemu/ |
| sys-queue.h | 5 * the implementations. Left in lists, tail queues and circular queues.
44 * lists, tail queues, and circular queues.
53 * A tail queue is headed by a pair of pointers, one to the head of the
54 * list and the other to the tail of the list. The elements are doubly
58 * the list. A tail queue may be traversed in either direction.
61 * list and the other to the tail of the list. The elements are doubly
138 * Tail queue definitions.
158 * Tail queue functions.
224 * Tail queue access methods.
|
| /dalvik/libcore/sql/src/main/native/ |
| sqlite_jni.c | 101 char *tail; /* tail SQL string */ member in struct:hvm
2709 const char *tail; local
2827 const char *tail; local
3009 const char *tail; local
3283 char *tail; local
3344 const jchar *sql16, *tail = 0; local
[all...] |
| /external/guava/src/com/google/common/collect/ |
| LinkedListMultimap.java | 124 private transient Node<K, V> tail; // the tail for all keys field in class:LinkedListMultimap
127 private transient Map<K, Node<K, V>> keyToKeyTail; // the tail for a given key
187 head = tail = node;
190 } else if (nextSibling == null) { // non-empty list, add to tail
191 tail.next = node;
192 node.previous = tail;
201 tail = node;
237 } else { // node was tail
238 tail = node.previous
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/hermes/ |
| x86p_32.asm | 98 ; check tail
103 .L5 ; tail loop
170 ; check tail
175 .L5 ; tail loop
243 ; check tail
248 .L5 ; tail loop
337 ; check tail
342 .L6 ; tail loop
437 ; check tail
442 .L6 ; tail loo
[all...] |
| /dalvik/libcore/luni/src/main/java/java/io/ |
| FilePermission.java | 170 int actionInt = 0, head = 0, tail = 0; local
172 tail = actionNames.indexOf(",", head); //$NON-NLS-1$
173 String action = tail > 0 ? actionNames.substring(head, tail).trim()
187 head = tail + 1;
188 } while (tail > 0);
|
| /hardware/ti/wlan/wl1271/utils/ |
| queue.c | 100 * AddToTail(): Add node to queue tail (first in queue)
108 * DelFromTail(): Delete node from queue tail (first in queue)
283 * Dequeue an item from the queue's tail (first in queue).
299 /* Queue is not empty, take packet from the queue tail */
326 * Requeue an item at the queue's tail (first in queue).
340 * If queue's limits not exceeded add the packet to queue's tail and return TI_OK
|
| /system/wlan/ti/wilink_6_1/utils/ |
| queue.c | 100 * AddToTail(): Add node to queue tail (first in queue)
108 * DelFromTail(): Delete node from queue tail (first in queue)
280 * Dequeue an item from the queue's tail (first in queue).
294 /* Queue is not empty, take packet from the queue tail */
320 * Requeue an item at the queue's tail (first in queue).
334 * If queue's limits not exceeded add the packet to queue's tail and return TI_OK
|
| /external/icu4c/layout/ |
| LEInsertionList.h | 149 * The tail of the insertion list.
153 InsertionRecord *tail; member in class:LEInsertionList
|
| /external/opencore/oscl/oscl/osclproc/src/ |
| oscl_double_list.inl | 53 OSCL_INLINE T *OsclDoubleList<T>::Tail() const
89 OSCL_INLINE T *OsclPriorityList<T>::Tail() const
|
| /external/skia/src/core/ |
| SkChunkAlloc.cpp | 39 Block* tail() { function in struct:SkChunkAlloc::Block
73 fPool->tail()->fNext = fBlock;
|
| /external/webkit/WebCore/dom/ |
| ContainerNode.h | 36 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
88 friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
|
| /external/webkit/WebCore/svg/ |
| SVGElementInstance.h | 32 void addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
137 friend void Private::addChildNodesToDeletionQueue(GenericNode*& head, GenericNode*& tail, GenericNodeContainer* container);
|
