Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:lh_entry (Results 1 - 10 of 10) sorted by null

/device/google/bonito/json-c/
linkhash.h	44 struct lh_entry; 49 typedef void (lh_entry_free_fn) (struct lh_entry *e); 62 struct lh_entry { struct 74 struct lh_entry *next; 78 struct lh_entry *prev; 128 struct lh_entry *head; 133 struct lh_entry *tail; 135 struct lh_entry *table; 240 extern struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k); 269 extern int lh_table_delete_entry(struct lh_table *t, struct lh_entry *e)     [all...]
json_object_iterator.c	29 * or more lh_entry (link-hash entry) structures inside the 32 * Each lh_entry structure on the JSON Object's linked list 34 * last lh_entry in the list is set to NULL, which terminates 38 * name/value pair via a pointer to the pair's lh_entry 52 * to point to the next lh_entry structure in the linked list. 108 iter->opaque_ = ((struct lh_entry *)iter->opaque_)->next; 121 return (const char*)(((struct lh_entry *)iter->opaque_)->k); 134 return (struct json_object*)(((struct lh_entry *)iter->opaque_)->v);
json_object.h	72 struct lh_entry *entry; 349 for(struct lh_entry *entry ## key = json_object_get_object(obj)->head, *entry_next ## key = NULL; \ 362 struct lh_entry *entry ## key; \ 363 struct lh_entry *entry_next ## key = NULL; \
linkhash.c	439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); 463 struct lh_entry *ent; 482 struct lh_entry *c; 527 struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k) 554 struct lh_entry *e = lh_table_lookup_entry(t, k); 563 int lh_table_delete_entry(struct lh_table *t, struct lh_entry *e) 594 struct lh_entry *e = lh_table_lookup_entry(t, k);
json_object.c	78 struct lh_entry *ent; 356 static void json_object_lh_entry_free(struct lh_entry *ent) 405 struct lh_entry *existing_entry;
/device/google/crosshatch/json-c/
linkhash.h	44 struct lh_entry; 49 typedef void (lh_entry_free_fn) (struct lh_entry *e); 62 struct lh_entry { struct 74 struct lh_entry *next; 78 struct lh_entry *prev; 128 struct lh_entry *head; 133 struct lh_entry *tail; 135 struct lh_entry *table; 240 extern struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k); 269 extern int lh_table_delete_entry(struct lh_table *t, struct lh_entry *e)     [all...]
json_object_iterator.c	29 * or more lh_entry (link-hash entry) structures inside the 32 * Each lh_entry structure on the JSON Object's linked list 34 * last lh_entry in the list is set to NULL, which terminates 38 * name/value pair via a pointer to the pair's lh_entry 52 * to point to the next lh_entry structure in the linked list. 108 iter->opaque_ = ((struct lh_entry *)iter->opaque_)->next; 121 return (const char*)(((struct lh_entry *)iter->opaque_)->k); 134 return (struct json_object*)(((struct lh_entry *)iter->opaque_)->v);
json_object.h	72 struct lh_entry *entry; 349 for(struct lh_entry *entry ## key = json_object_get_object(obj)->head, *entry_next ## key = NULL; \ 362 struct lh_entry *entry ## key; \ 363 struct lh_entry *entry_next ## key = NULL; \
linkhash.c	439 t->table = (struct lh_entry*)calloc(size, sizeof(struct lh_entry)); 463 struct lh_entry *ent; 482 struct lh_entry *c; 527 struct lh_entry* lh_table_lookup_entry(struct lh_table *t, const void *k) 554 struct lh_entry *e = lh_table_lookup_entry(t, k); 563 int lh_table_delete_entry(struct lh_table *t, struct lh_entry *e) 594 struct lh_entry *e = lh_table_lookup_entry(t, k);
json_object.c	78 struct lh_entry *ent; 356 static void json_object_lh_entry_free(struct lh_entry *ent) 405 struct lh_entry *existing_entry;

Completed in 1140 milliseconds