HomeSort by relevance Sort by last modified time
    Searched defs:ListNode (Results 1 - 7 of 7) sorted by null

  /external/clang/test/ASTMerge/Inputs/
struct1.c 48 struct ListNode {
50 struct ListNode *Next;
struct2.c 45 struct ListNode {
47 struct ListNode *Next;
  /prebuilts/go/darwin-x86/src/text/template/parse/
node.go 76 // ListNode holds a sequence of nodes.
77 type ListNode struct {
84 func (t *Tree) newList(pos Pos) *ListNode {
85 return &ListNode{tr: t, NodeType: NodeList, Pos: pos}
88 func (l *ListNode) append(n Node) {
92 func (l *ListNode) tree() *Tree {
96 func (l *ListNode) String() string {
104 func (l *ListNode) CopyList() *ListNode {
115 func (l *ListNode) Copy() Node
    [all...]
  /prebuilts/go/linux-x86/src/text/template/parse/
node.go 76 // ListNode holds a sequence of nodes.
77 type ListNode struct {
84 func (t *Tree) newList(pos Pos) *ListNode {
85 return &ListNode{tr: t, NodeType: NodeList, Pos: pos}
88 func (l *ListNode) append(n Node) {
92 func (l *ListNode) tree() *Tree {
96 func (l *ListNode) String() string {
104 func (l *ListNode) CopyList() *ListNode {
115 func (l *ListNode) Copy() Node
    [all...]
  /device/linaro/bootloader/edk2/MdeModulePkg/Universal/PCD/Dxe/
Service.c 553 LIST_ENTRY *ListNode;
565 ListNode = GetFirstNode (ListHead);
567 while (ListNode != ListHead) {
568 FnTableEntry = CR_FNENTRY_FROM_LISTNODE(ListNode, CALLBACK_FN_ENTRY, Node);
577 ListNode = GetNextNode (ListHead, ListNode);
612 LIST_ENTRY *ListNode;
624 ListNode = GetFirstNode (ListHead);
626 while (ListNode != ListHead) {
627 FnTableEntry = CR_FNENTRY_FROM_LISTNODE(ListNode, CALLBACK_FN_ENTRY, Node);
    [all...]
  /device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/
generic.h 68 } ListNode;
81 ListNode *elist; /* linked list of elements in error set */
89 ListNode *tlist; /* linked list of elements in token set */
109 #define newListNode (ListNode *) calloc(1, sizeof(ListNode));
136 ListNode *el_labels;/* list of element labels ref in all of rule */
138 ListNode *ast_labels_in_actions; /* MR27 */
162 /* too lazy to use ListNode ? MR7 */
  /external/cmockery/cmockery_0_1_2/src/
cmockery.c 51 typedef struct ListNode {
54 struct ListNode *next;
55 struct ListNode *prev;
56 } ListNode;
64 ListNode node; // Node within list of all allocated blocks.
69 const ListNode *check_point; // Check point of the test if there's a
89 ListNode symbol_values_list_head;
117 static ListNode* list_initialize(ListNode * const node);
118 static ListNode* list_add(ListNode * const head, ListNode *new_node)
    [all...]

Completed in 410 milliseconds