HomeSort by: relevance | last modified time | path
    Searched defs:bcache (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/gdb.old/dist/gdb/
bcache.h 25 /* A bcache is a data structure for factoring out duplication in
26 read-only structures. You give the bcache some string of bytes S.
27 If the bcache already contains a copy of S, it hands you back a
30 away your copy of S, and use the bcache's.
34 call the bcache function.
36 This means that you can put ordinary C objects in a bcache.
39 garbage. If you try to bcache two objects which are identical from
41 structure's holes, then the bcache will treat them as separate
46 You shouldn't modify the strings you get from a bcache, because:
49 stick eight bytes of text in a bcache, and then stick an eight-byt
143 struct bcache struct in namespace:gdb
    [all...]
bcache.c 23 #include "bcache.h"
29 /* The type used to hold a single bcache string. The user data is
57 /* Growing the bcache's hash table. */
64 bcache::expand_hash_table ()
131 /* Looking up things in the bcache. */
137 /* Find a copy of the LENGTH bytes at ADDR in BCACHE. If BCACHE has
138 never seen those bytes before, add a copy of them to BCACHE. In
139 either case, return a pointer to BCACHE's copy of that string. If
144 bcache::insert (const void *addr, int length, bool *added
    [all...]
macrotab.c 28 #include "bcache.h"
42 /* The bcache we should use to hold macro names, argument names, and
44 gdb::bcache *bcache;
74 strings are all allocated in bcache, if non-zero, or with xmalloc
111 /* If the macro table T has a bcache, then cache the LEN bytes at ADDR
118 if (t->bcache)
119 return t->bcache->insert (addr, len);
130 /* If the macro table T has a bcache, cache the null-terminated string
141 has a bcache, do nothing; otherwise, xfree OBJ. *
43 gdb::bcache *bcache; member in struct:macro_table
    [all...]
  /src/external/gpl3/gdb/dist/gdb/
bcache.h 25 /* A bcache is a data structure for factoring out duplication in
26 read-only structures. You give the bcache some string of bytes S.
27 If the bcache already contains a copy of S, it hands you back a
30 away your copy of S, and use the bcache's.
34 call the bcache function.
36 This means that you can put ordinary C objects in a bcache.
39 garbage. If you try to bcache two objects which are identical from
41 structure's holes, then the bcache will treat them as separate
46 You shouldn't modify the strings you get from a bcache, because:
49 stick eight bytes of text in a bcache, and then stick an eight-byt
143 struct bcache struct in namespace:gdb
    [all...]
bcache.c 23 #include "bcache.h"
29 /* The type used to hold a single bcache string. The user data is
57 /* Growing the bcache's hash table. */
64 bcache::expand_hash_table ()
131 /* Looking up things in the bcache. */
137 /* Find a copy of the LENGTH bytes at ADDR in BCACHE. If BCACHE has
138 never seen those bytes before, add a copy of them to BCACHE. In
139 either case, return a pointer to BCACHE's copy of that string. If
144 bcache::insert (const void *addr, int length, bool *added
    [all...]
macrotab.c 28 #include "bcache.h"
42 /* The bcache we should use to hold macro names, argument names, and
44 gdb::bcache *bcache;
74 strings are all allocated in bcache, if non-zero, or with xmalloc
111 /* If the macro table T has a bcache, then cache the LEN bytes at ADDR
118 if (t->bcache)
119 return t->bcache->insert (addr, len);
130 /* If the macro table T has a bcache, cache the null-terminated string
141 has a bcache, do nothing; otherwise, xfree OBJ. *
43 gdb::bcache *bcache; member in struct:macro_table
    [all...]

Completed in 382 milliseconds