Searched refs:free (Results 1 - 25 of 3635) sorted by path

1234567891011>>

/external/aac/libSYS/src/
H A DgenericStds.cpp39 You must make available free of charge copies of the complete source code of the FDK AAC Codec and your
228 free((INT*)ptr);
/external/aac/libSYS/src/mips/
H A DgenericStds_mips.cpp39 You must make available free of charge copies of the complete source code of the FDK AAC Codec and your
164 free(ptr);
212 free(ptr);
224 free(ptr);
/external/android-clat/
H A Dclatd.c160 // Pick an IPv4 address to use by finding a free address in the configured prefix. Technically,
169 logmsg(ANDROID_LOG_FATAL,"No free IPv4 address in %s/%d",
282 free(interface_ip);
304 free(interface_ip);
H A Dconfig.c149 free(Global_Clatd_Config.plat_from_dns64_hostname);
240 * picks a free IPv4 address, starting from ip and trying all addresses in the prefix in order
345 free(tmp_ptr);
352 free(tmp_ptr);
377 free(root);
H A Ddump.c245 free(str);
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/
H A DBaseRecognizer.as107 // then we know we're missing a token; error recovery is free to
/external/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3baserecognizer.h352 /** Pointer to a function that knows how to free the resources of a base recognizer.
354 void (*free) (struct ANTLR3_BASE_RECOGNIZER_struct * recognizer); member in struct:ANTLR3_BASE_RECOGNIZER_struct
H A Dantlr3basetree.h133 void (*free) (struct ANTLR3_BASE_TREE_struct * tree); member in struct:ANTLR3_BASE_TREE_struct
H A Dantlr3basetreeadaptor.h144 void (*free) (struct ANTLR3_BASE_TREE_ADAPTOR_struct * adaptor); member in struct:ANTLR3_BASE_TREE_ADAPTOR_struct
H A Dantlr3bitset.h106 void (*free) (struct ANTLR3_BITSET_struct * bitset); member in struct:ANTLR3_BITSET_struct
H A Dantlr3collections.h76 void (ANTLR3_CDECL *free)(void * data); member in struct:ANTLR3_HASH_ENTRY_struct
128 void (*free) (struct ANTLR3_HASH_TABLE_struct * table); member in struct:ANTLR3_HASH_TABLE_struct
174 void (*free) (struct ANTLR3_HASH_ENUM_struct * table); member in struct:ANTLR3_HASH_ENUM_struct
186 void (*free) (struct ANTLR3_LIST_struct * list); member in struct:ANTLR3_LIST_struct
208 void (*free) (struct ANTLR3_STACK_struct * stack); member in struct:ANTLR3_STACK_struct
230 * that can free the element if it is removed. It auto resizes but does not
250 * the malloc/free callas we would otherwise require.
255 * case only the factory can free the memory for the actual vector,
256 * though the vector free function is called and will recurse through its
257 * entries calling any free pointer
265 void (ANTLR3_CDECL *free) (struct ANTLR3_VECTOR_struct * vector); member in struct:ANTLR3_VECTOR_struct
386 void (*free) (struct ANTLR3_INT_TRIE_struct * trie); member in struct:ANTLR3_INT_TRIE_struct
503 void (*free) (struct ANTLR3_TOPO_struct * topo); member in struct:ANTLR3_TOPO_struct
[all...]
H A Dantlr3commontreenodestream.h119 void (*free) (struct ANTLR3_TREE_NODE_STREAM_struct * tns); member in struct:ANTLR3_TREE_NODE_STREAM_struct
299 void (*free) (struct ANTLR3_COMMON_TREE_NODE_STREAM_struct * ctns); member in struct:ANTLR3_COMMON_TREE_NODE_STREAM_struct
304 /// closed it will not free the root tree as this tree always
H A Dantlr3debugeventlistener.h388 void (*free) (pANTLR3_DEBUG_EVENT_LISTENER delboy); member in struct:ANTLR3_DEBUG_EVENT_LISTENER_struct
H A Dantlr3defs.h478 #define ANTLR3_FREE(ptr) free ((void *)(ptr))
484 #define ANTLR3_FREE_FUNC free
H A Dantlr3input.h121 * you set it manually as it will be free()d
135 void (*free) (struct ANTLR3_INPUT_STREAM_struct * input); member in struct:ANTLR3_INPUT_STREAM_struct
H A Dantlr3intstream.h195 void (*free) (struct ANTLR3_INT_STREAM_struct * stream); member in struct:ANTLR3_INT_STREAM_struct
H A Dantlr3lexer.h182 /** Pointer to a function that knows how to free the resources of a lexer
184 void (*free) (struct ANTLR3_LEXER_struct * lexer); member in struct:ANTLR3_LEXER_struct
H A Dantlr3parser.h82 /** Pointer to a function that knows how to free resources of an ANTLR3 parser.
84 void (*free) (struct ANTLR3_PARSER_struct * parser); member in struct:ANTLR3_PARSER_struct
H A Dantlr3parsetree.h76 void (*free) (struct ANTLR3_PARSE_TREE_struct * tree); member in struct:ANTLR3_PARSE_TREE_struct
H A Dantlr3rewritestreams.h78 /// Indicates whether we should free the vector or it was supplied to us
156 void (*free) (struct ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct * stream); member in struct:ANTLR3_REWRITE_RULE_ELEMENT_STREAM_struct
H A Dantlr3tokenstream.h180 /** Function that knows how to free the memory for an ANTLR3_TOKEN_STREAM
182 void (*free) (struct ANTLR3_TOKEN_STREAM_struct * tokenStream); member in struct:ANTLR3_TOKEN_STREAM_struct
285 * but that does not free up any resources, such as the token factory
293 /** Function that knows how to free an ANTLR3_COMMON_TOKEN_STREAM
295 void (*free) (struct ANTLR3_COMMON_TOKEN_STREAM_struct * tokenStream); member in struct:ANTLR3_COMMON_TOKEN_STREAM_struct
H A Dantlr3treeparser.h71 /** Pointer to a function that knows how to free resources of an ANTLR3 tree parser.
73 void (*free) (struct ANTLR3_TREE_PARSER_struct * parser); member in struct:ANTLR3_TREE_PARSER_struct
/external/antlr/antlr-3.4/runtime/C/src/
H A Dantlr3baserecognizer.c130 // free it when the base recognizer is freed.
188 recognizer->free = freeBR;
210 recognizer->state->ruleMemo->free(recognizer->state->ruleMemo);
226 recognizer->state->rStreams->free(recognizer->state->rStreams);
602 /// then we know we're missing a token; error recovery is free to
622 viableTokensFollowingThisRule->free(viableTokensFollowingThisRule);
626 followClone->free(followClone);
984 localFollowSet->free(localFollowSet);
991 localFollowSet->free(localFollowSet);
1389 followSet->free(followSe
[all...]
H A Dantlr3basetree.c196 tree->children->add(tree->children, entry, (void (ANTLR3_CDECL *) (void *))child->free);
214 tree->children->add(tree->children, child, (void (ANTLR3_CDECL *)(void *))child->free);
364 freeNewChildren = ANTLR3_FALSE; // We must NO free this memory
376 freeNewChildren = ANTLR3_TRUE; // We must free this memory
453 ANTLR3_FREE(newChildren); // Will not free the nodes
H A Dantlr3bitset.c137 bitset->free = antlr3BitsetFree;
227 en->free(en);

Completed in 318 milliseconds

1234567891011>>