/external/mesa3d/src/glsl/glcpp/ |
glcpp.c | 101 void *ctx = ralloc(NULL, void*);
|
glcpp-parse.y | 597 list = ralloc (ctx, string_list_t); 609 node = ralloc (list, string_node_t); 688 list = ralloc (ctx, argument_list_t); 700 node = ralloc (list, argument_node_t); 757 token = ralloc (ctx, token_t); 771 token = ralloc (ctx, token_t); 783 list = ralloc (ctx, token_list_t); 796 node = ralloc (list, token_node_t); 838 token_t *new_token = ralloc (copy, token_t); 999 /* Return a new token (ralloc()ed off of 'token') formed by pastin [all...] |
/external/mesa3d/src/glsl/ |
ralloc.h | 25 * \file ralloc.h 27 * ralloc: a recursive memory allocator 29 * The ralloc memory allocator creates a hierarchy of allocated 37 * The conceptual working of ralloc was directly inspired by Andrew 38 * Tridgell's talloc, but ralloc is an independent implementation 43 * more sophisticated than ralloc in that it includes reference 60 * \def ralloc(ctx, type) 68 #define ralloc(ctx, type) ((type *) ralloc_size(ctx, sizeof(type))) macro 82 * Allocate a new ralloc context. 84 * While any ralloc'd pointer can be used as a context, sometimes it is usefu [all...] |
/external/mesa3d/src/mesa/drivers/dri/i965/ |
brw_fs_copy_propagation.cpp | 124 acp_entry *entry = ralloc(mem_ctx, acp_entry);
|
brw_fs_cse.cpp | 118 aeb_entry *entry = ralloc(mem_ctx, aeb_entry);
|
brw_vec4_visitor.cpp | [all...] |
/external/mesa3d/src/mesa/program/ |
register_allocate.c | 73 #include <ralloc.h> 160 * mem_ctx is a ralloc context for the allocator. The reg set may be freed
|
ir_to_mesa.cpp | 153 /* Callers of this ralloc-based new need not call delete. It's [all...] |
/external/v8/test/cctest/compiler/ |
test-run-native-calls.cc | [all...] |
/external/mesa3d/src/mesa/state_tracker/ |
st_glsl_to_tgsi.cpp | 201 /* Callers of this ralloc-based new need not call delete. It's [all...] |