HomeSort by relevance Sort by last modified time
    Searched refs:barray (Results 1 - 2 of 2) sorted by null

  /external/bluetooth/glib/glib/
gbsearcharray.h 66 static inline gpointer g_bsearch_array_get_nth (GBSearchArray *barray,
69 static inline guint g_bsearch_array_get_index (GBSearchArray *barray,
72 static inline GBSearchArray* g_bsearch_array_remove (GBSearchArray *barray,
76 static inline GBSearchArray* g_bsearch_array_grow (GBSearchArray *barray,
80 static inline GBSearchArray* g_bsearch_array_insert (GBSearchArray *barray,
86 static inline GBSearchArray* g_bsearch_array_replace (GBSearchArray *barray,
89 static inline void g_bsearch_array_free (GBSearchArray *barray,
91 #define g_bsearch_array_get_n_nodes(barray) (((GBSearchArray*) (barray))->n_nodes)
96 #define g_bsearch_array_lookup(barray, bconfig, key_node)
128 GBSearchArray *barray; local
    [all...]
  /external/e2fsprogs/debugfs/
icheck.c 27 struct block_info *barray; member in struct:block_walk_struct
44 if (!bw->barray[i].ino && bw->barray[i].blk == *block_nr) {
45 bw->barray[i].ino = bw->inode;
73 bw.barray = malloc(sizeof(struct block_info) * argc);
74 if (!bw.barray) {
79 memset(bw.barray, 0, sizeof(struct block_info) * argc);
88 if (strtoblk(argv[0], argv[i], &bw.barray[i-1].blk))
153 for (i=0, binfo = bw.barray; i < bw.num_blocks; i++, binfo++) {
162 free(bw.barray);
    [all...]

Completed in 32 milliseconds