/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3commontreenodestream.h | 255 /// Add new lookahead at lookahead[tail]. tail wraps around at the 256 /// end of the lookahead buffer so tail could be less than head. 258 ANTLR3_UINT32 tail; member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct 327 ANTLR3_UINT32 tail; member in struct:ANTLR3_TREE_WALK_STATE_struct
|
/external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
H A D | ANTLRUnbufferedCommonTreeNodeStream.h | 56 NSUInteger tail; variable 72 @property (assign, getter=getTail, setter=setTail:) NSUInteger tail; variable
|
/external/apache-xml/src/main/java/org/apache/xpath/axes/ |
H A D | WalkerFactory.java | 859 StepPattern tail = step; 935 tail = pat; 942 XNumber score = tail.getStaticScore(); 943 tail.setRelativePathPattern(selfPattern); 944 tail.setStaticScore(score); 967 * @param tail The step that is the first step analyzed, but the last 968 * step in the relative match linked list, i.e. the tail. 980 int analysis, StepPattern tail, StepPattern head) 978 createDefaultStepPattern( Compiler compiler, int opPos, MatchPatternIterator mpi, int analysis, StepPattern tail, StepPattern head) argument
|
/external/arduino/hardware/arduino/cores/arduino/ |
H A D | HardwareSerial.cpp | 50 int tail; member in struct:ring_buffer 71 // just before the tail (meaning that the head would advance to the 72 // current location of the tail), we're about to overflow the buffer 74 if (i != rx_buffer->tail) { 234 return (unsigned int)(RX_BUFFER_SIZE + _rx_buffer->head - _rx_buffer->tail) % RX_BUFFER_SIZE; 239 if (_rx_buffer->head == _rx_buffer->tail) { 242 return _rx_buffer->buffer[_rx_buffer->tail]; 248 // if the head isn't ahead of the tail, we don't have any characters 249 if (_rx_buffer->head == _rx_buffer->tail) { 252 unsigned char c = _rx_buffer->buffer[_rx_buffer->tail]; [all...] |
/external/bison/lib/ |
H A D | bitset.h | 71 struct lbitset_elt_struct *tail; /* Last element in linked list. */ member in struct:bitset_union::lbitset_struct
|
H A D | vasnprintf.c | 3118 long double tail = mantissa; local 3123 int digit = (int) tail; 3124 tail -= digit; 3127 if (digit & 1 ? tail >= 0.5L : tail > 0.5L) 3128 tail = 1 - tail; 3130 tail = - tail; 3133 tail * 3269 double tail = mantissa; local [all...] |
/external/bison/src/ |
H A D | scan-code.c | 2629 const char *tail = explicit_bracketing ? "" : local 2644 obstack_sgrow (&msg_buf, tail); 2653 obstack_sgrow (&msg_buf, tail);
|
/external/blktrace/ |
H A D | blkiomon.c | 257 struct dstat *dstat, *tail = NULL; local 265 tail = dstat; 267 return tail; 273 struct dstat *head, *tail; local 296 tail = blkiomon_output(head, &wake); 299 tail->next = vacant_dstats_list;
|
/external/bluetooth/bluedroid/osi/src/ |
H A D | list.c | 13 list_node_t *tail; member in struct:list_t 71 return list->tail->data; 86 if (list->tail == prev_node) 87 list->tail = node; 106 if (list->tail == NULL) 107 list->tail = list->head; 125 if (list->tail == NULL) { 127 list->tail = node; 129 list->tail->next = node; 130 list->tail [all...] |
/external/checkpolicy/ |
H A D | policy_define.c | 1733 class_perm_node_t *perms, *tail = NULL, *cur_perms = NULL; local 1801 if (tail) 1802 tail->next = cur_perms; 1803 tail = cur_perms;
|
H A D | queue.h | 26 queue_node_ptr_t tail; member in struct:queue_info
|
/external/chromium_org/base/containers/ |
H A D | linked_list.h | 20 // Next, to keep track of the list's head/tail, use a LinkedList instance: 46 // for (LinkNode<MyNodeType>* node = list.tail(); 158 LinkNode<T>* tail() const { function in class:base::LinkedList
|
/external/chromium_org/media/formats/common/ |
H A D | offset_byte_queue.h | 33 // if the current offset is beyond tail(), but you will of course get back 43 // Returns false if |max_offset| > tail() (although all bytes currently 47 // The head and tail positions, in terms of the file's absolute offsets. 48 // tail() is an exclusive bound. 50 int64 tail() { return head_ + size_; } function in class:media::OffsetByteQueue
|
/external/chromium_org/native_client_sdk/src/libraries/xray/ |
H A D | xray.c | 75 int tail; member in struct:XRayTraceFrame 496 capture->frame.tail = 0; 523 return capture->frame.tail; 571 if (capture->frame.head == capture->frame.tail) 648 /* If the table is filled, bump the tail. */ 649 if (capture->frame.head == capture->frame.tail) 650 capture->frame.tail = XRayFrameGetNext(capture, capture->frame.tail); 651 capture->frame.tail = XRayFrameFindTail(capture); 738 capture->frame.tail [all...] |
/external/chromium_org/net/base/ |
H A D | nss_memio.c | 29 int tail; /* where to put next byte into buf */ member in struct:memio_buffer 93 mb->tail = 0; 105 mb->tail = 0; 111 return (((mb->tail >= mb->head) ? mb->tail : mb->bufsize) - mb->head); 117 return (mb->tail >= mb->head) ? 0 : mb->tail; 123 if (mb->head > mb->tail) return mb->head - mb->tail - 1; 124 return mb->bufsize - mb->tail [all...] |
/external/chromium_org/net/spdy/ |
H A D | spdy_test_util_common.cc | 319 std::string tail = "/fakesignature"; local 327 signature->insert(signature->end(), tail.begin(), tail.end());
|
/external/chromium_org/net/websockets/ |
H A D | websocket_inflater.cc | 129 std::pair<char*, size_t> tail = output_buffer_.GetTail(); local 130 if (!tail.second) 133 stream_->next_out = reinterpret_cast<Bytef*>(tail.first); 134 stream_->avail_out = tail.second; 136 output_buffer_.AdvanceTail(tail.second - stream_->avail_out); 140 } else if (tail.second == stream_->avail_out) {
|
/external/chromium_org/sandbox/linux/bpf_dsl/ |
H A D | cons.h | 25 // Return this node's tail element. 26 List tail() const { return tail_; } function in class:sandbox::Cons 28 // Construct a new List using |head| and |tail|. 29 static List Make(const T& head, List tail) { argument 30 return make_scoped_refptr(new const Cons<T>(head, tail)); 34 Cons(const T& head, List tail) : head_(head), tail_(tail) {} argument
|
/external/chromium_org/sandbox/linux/seccomp-bpf/ |
H A D | codegen.cc | 277 BasicBlock* CodeGen::MakeBasicBlock(Instruction* head, Instruction* tail) { argument 278 // Iterate over all the instructions between "head" and "tail" and 283 if (head == tail) { 295 Instruction* tail, 308 BasicBlock* bb = MakeBasicBlock(head, tail); 327 Instruction* tail = NULL; local 336 if (tail && branch_targets.find(insn) != branch_targets.end()) { 339 AddBasicBlock(head, tail, branch_targets, basic_blocks, &first_block); 367 tail = NULL; 372 tail 294 AddBasicBlock(Instruction* head, Instruction* tail, const BranchTargets& branch_targets, TargetsToBlocks* basic_blocks, BasicBlock** firstBlock) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | ContainerNode.cpp | 450 Node* tail = 0; local 452 addChildNodesToDeletionQueue(head, tail, container); 464 tail = 0; 467 addChildNodesToDeletionQueue(head, tail, toContainerNode(*n)); 473 void ContainerNode::addChildNodesToDeletionQueue(Node*& head, Node*& tail, ContainerNode& container) argument 493 if (tail) 494 tail->setNextSibling(n); 498 tail = n;
|
/external/chromium_org/third_party/WebKit/Source/devtools/scripts/closure/ |
H A D | compiler.jar | META-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/javascript/ com/google/javascript/jscomp/ ... |
/external/chromium_org/third_party/WebKit/Source/modules/webdatabase/sqlite/ |
H A D | SQLiteStatement.cpp | 72 const char* tail = 0; local 73 int error = sqlite3_prepare_v2(m_database.sqlite3Handle(), query.data(), lengthIncludingNullCharacter, &m_statement, &tail); 77 else if (tail && *tail)
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | DoublyLinkedList.h | 80 T* tail() const; 121 template<typename T> inline T* DoublyLinkedList<T>::tail() const function in class:WTF::DoublyLinkedList
|
/external/chromium_org/third_party/android_platform/webview/ |
H A D | frameworks.jar | META-INF/ META-INF/MANIFEST.MF android/ android/location/ android/location/Address$1.class ... |