/external/clang/test/PCH/Inputs/ |
H A D | typo.hpp | 4 namespace graph { namespace in namespace:boost
|
/external/regex-re2/benchlog/ |
H A D | mktable | 34 sub graph() { subroutine 119 "graph" => \&graph,
|
/external/webkit/Source/JavaScriptCore/dfg/ |
H A D | DFGByteCodeParser.cpp | 46 // This class is used to compile the dataflow graph from a CodeBlock. 49 ByteCodeParser(JSGlobalData* globalData, CodeBlock* codeBlock, Graph& graph) argument 52 , m_graph(graph) 190 // Avoid wastefully adding a JSConstant node to the graph, only to 202 // Avoid wastefully adding a JSConstant node to the graph, only to 430 // These methods create a node and add it to the graph. If nodes of this type are 480 // node in the graph, depending on the context in which it is being used. 1068 bool parse(Graph& graph, JSGlobalData* globalData, CodeBlock* codeBlock) 1071 UNUSED_PARAM(graph); 1076 return ByteCodeParser(globalData, codeBlock, graph) [all...] |
H A D | DFGScoreBoard.h | 38 // This class is used in performing a virtual register allocation over the graph. 45 ScoreBoard(Graph& graph, uint32_t firstTemporary) argument 46 : m_graph(graph) 113 // The graph, so we can get refCounts for nodes, to determine when values are dead.
|
H A D | DFGAliasTracker.h | 45 AliasTracker(Graph& graph) argument 46 : m_graph(graph) 112 // The graph, to look up potentially aliasing nodes.
|
/external/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 43 PBQP::Graph& getGraph() { return graph; } 45 const PBQP::Graph& getGraph() const { return graph; } 99 PBQP::Graph graph; member in class:llvm::PBQPRAProblem
|
/external/stlport/stlport/stl/ |
H A D | _ctype.h | 52 graph = alnum | punct enumerator in enum:ctype_base::mask
|
/external/svox/pico/lib/ |
H A D | picoklex.c | 58 - for one graph we can have two or three solutions from the lex 66 - 3 bytes for graph-prefix 270 /* convert graph-prefix to number with 'lexicographic' ordering */ 359 const picoos_uint8 *graph, 368 PICODBG_TRACE(("%d|%d graph|lex: %c|%c", graphlen, lexlen, 369 graph[i], lexgraph[i])); 370 if (lexgraph[i] < graph[i]) { 372 } else if (lexgraph[i] > graph[i]) { 419 const picoos_uint8 *graph, 431 rv = klex_lexMatch(&(this->lexblocks[lexpos]), graph, graphle 358 klex_lexMatch(picoos_uint8 *lexentry, const picoos_uint8 *graph, const picoos_uint16 graphlen) argument 416 klex_lexblockLookup(klex_SubObj this, const picoos_uint32 lexposStart, const picoos_uint32 lexposEnd, const picoos_uint8 *graph, const picoos_uint16 graphlen, picoklex_lexl_result_t *lexres) argument 482 picoklex_lexLookup(const picoklex_Lex this, const picoos_uint8 *graph, const picoos_uint16 graphlen, picoklex_lexl_result_t *lexres) argument [all...] |
H A D | picowa.c | 194 const picoos_uint8 *graph, 202 /* check existence of special char (e.g. hyphen) in graph: 210 if (graph[i++] == '-') { 216 if (!picokdt_dtPosPconstructInVec(wa->dtposp, graph, graphlen, specchar)) { 269 do POS prediction: -> WORDGRAPH(POSes,NA)graph 275 no phone, one entry -> WORDGRAPH(POS,NA)graph 291 /* no lex entry found, WORDGRAPH(POS,NA)graph */ 339 } else { /* no phone, :G2P, one entry: WORDGRAPH(POS,NA)graph */ 192 waClassifyPos(register picodata_ProcessingUnit this, register wa_subobj_t *wa, const picoos_uint8 *graph, const picoos_uint16 graphlen) argument
|
H A D | picoktab.c | 150 graphs = {graph}=NROFSENTRIES (contains NROFSENTRIES entries of graph) 152 graph = PROPSET FROM TO [TOKENTYPE] [TOKENSUBTYPE] [VALUE] [LOWERCASE] [GRAPHSUBS1] [GRAPHSUBS2] 259 const picoos_uint8 *graph, 268 graphsOffset = picoktab_graphOffset (this, (picoos_uchar *)graph); 290 /* Returns offset of property 'prop' inside the graph with offset 'graphsOffset' in graphs table; 385 /* get offset to graph[m] */ 396 /* get FROM and TO field of graph[m] */ 585 /* calculate offset of graph[graphIndex] */ 258 picoktab_hasVowellikeProp(const picoktab_Graphs this, const picoos_uint8 *graph, const picoos_uint8 graphlenmax) argument
|
H A D | picosa.c | 83 WORDGRAPH(POSes,NA)graph -> WORDGRAPH(POS,NA)graph \n 90 WORDGRAPH(POS,NA)graph -> WORDPHON(POS,NA)phon \n 831 const picoos_uint8 *graph, 878 if (picobase_get_prev_utf8charpos(graph, 0, &utfpos)) { 890 if (!saGetNrVowel(this, sa, graph, graphlen, nCount-1, &nrvow, 899 graph, /*grapheme start*/ 938 PICODBG_TRACE(("epsilon, no phone added %c", graph[nCount-1])); 946 PICODBG_TRACE(("%c %d",graph[nCount-1],dtresv.classvec[i])); 981 if (!picobase_get_prev_utf8charpos(graph, 829 saDoG2P(register picodata_ProcessingUnit this, register sa_subobj_t *sa, const picoos_uint8 *graph, const picoos_uint8 graphlen, const picoos_uint8 pos, picoos_uint8 *phones, const picoos_uint16 phonesmaxlen, picoos_uint16 *plen) argument [all...] |
H A D | picokdt.c | 107 - TABLETYPE1: one byte, type of map table (byte, word, or graph=utf8) 1357 /* empty table does not make sense for graph */ 1677 #graph 1694 no more graph -> 1701 const picoos_uint8 *graph, 1707 /* 2nd part of graph invec has KDT_POSP_NRGRAPHSUFFATT elements, */ 1714 picoos_uint16 poscg; /* position of current graph (= utf8 char) */ 1718 picoos_uint16 fallback; /* fallback value for failed graph encodings */ 1740 ((lencg = picobase_det_utf8_length(graph[poscg])) > 0)) { 1743 /* att-encode front utf graph an 1700 picokdt_dtPosPconstructInVec(const picokdt_DtPosP this, const picoos_uint8 *graph, const picoos_uint16 graphlen, const picoos_uint8 specgraphflag) argument 2036 picokdt_dtG2PconstructInVec(const picokdt_DtG2P this, const picoos_uint8 *graph, const picoos_uint16 graphlen, const picoos_uint8 count, const picoos_uint8 pos, const picoos_uint8 nrvow, const picoos_uint8 ordvow, picoos_uint8 *primstressflag, const picoos_uint16 phonech1, const picoos_uint16 phonech2, const picoos_uint16 phonech3) argument [all...] |
/external/v8/src/arm/ |
H A D | lithium-codegen-arm.h | 158 HGraph* graph() const { return chunk_->graph(); } function in class:v8::internal::BASE_EMBEDDED
|
/external/v8/src/ |
H A D | compiler.cc | 300 HGraph* graph = builder.CreateGraph(); local 306 if (graph != NULL) { 307 Handle<Code> optimized_code = graph->Compile(info);
|
H A D | lithium-allocator.h | 438 LAllocator(int first_virtual_register, HGraph* graph); 459 HGraph* graph() const { return graph_; } function in class:v8::internal::BASE_EMBEDDED
|
H A D | lithium-allocator.cc | 533 LAllocator::LAllocator(int num_values, HGraph* graph) argument 534 : zone_(graph->zone()), 536 live_in_sets_(graph->blocks()->length()), 548 graph_(graph),
|
/external/v8/src/ia32/ |
H A D | lithium-codegen-ia32.h | 150 HGraph* graph() const { return chunk_->graph(); } function in class:v8::internal::BASE_EMBEDDED
|
/external/v8/src/mips/ |
H A D | lithium-codegen-mips.h | 154 HGraph* graph() const { return chunk_->graph(); } function in class:v8::internal::BASE_EMBEDDED
|
/external/v8/src/x64/ |
H A D | lithium-codegen-x64.h | 141 HGraph* graph() const { return chunk_->graph(); } function in class:v8::internal::BASE_EMBEDDED
|
/external/srec/srec/Semproc/src/ |
H A D | SemanticProcessorImpl.c | 467 * Parse the graph 470 SR_SemanticGraph* graph, 490 SR_SemanticGraphImpl* semgraph = (SR_SemanticGraphImpl*) graph; 502 * Parse the graph 771 * Parse the graph 774 SR_SemanticGraph* graph, 796 SR_SemanticGraphImpl* semgraph = (SR_SemanticGraphImpl*) graph; 822 * Parse the graph 469 SR_SemanticProcessor_CheckParseByWordID(SR_SemanticProcessor* self, SR_SemanticGraph* graph, wordID* wordIDs, SR_SemanticResult** results, size_t* resultCount) argument 773 SR_SemanticProcessor_CheckParse(SR_SemanticProcessor* self, SR_SemanticGraph* graph, const LCHAR* transcription, SR_SemanticResult** results, size_t* resultCount) argument
|
/external/qemu-pc-bios/vgabios/ |
H A D | clext.c | 40 unsigned short *graph; /* 0x3ce */ member in struct:__anon11273 612 mov bx, [si+12] ;; graph
|
/external/bison/src/ |
H A D | vcg.h | 112 /* VCG graph orientation. */ 172 coordinates of the graph. Locations are specified in the form 174 if the whole graph is fully specified with locations and no part is 219 scale value of a node relatively to a scale value of the graph, 220 i.e. if (stretch,shrink) = (2,1) for the graph and (stretch,shrink) 221 = (2,1) for the node of the graph, then the node is scaled by the 229 (with k ? 0) means that the graph part that is reachable via edges 272 combines additional text labels with a node or a folded graph. info1, 443 | Graph attributs list. Structure that describes a graph. | 446 struct graph 445 struct graph struct 937 typedef struct graph graph; typedef in typeref:struct:graph [all...] |
/external/opencv/cxcore/include/ |
H A D | cxcore.h | 1155 /* Creates new graph */ 1160 /* Adds new vertex to the graph */ 1161 CVAPI(int) cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* vtx CV_DEFAULT(NULL), 1165 /* Removes vertex from the graph together with all incident edges */ 1166 CVAPI(int) cvGraphRemoveVtx( CvGraph* graph, int index ); 1167 CVAPI(int) cvGraphRemoveVtxByPtr( CvGraph* graph, CvGraphVtx* vtx ); 1174 CVAPI(int) cvGraphAddEdge( CvGraph* graph, 1179 CVAPI(int) cvGraphAddEdgeByPtr( CvGraph* graph, 1185 CVAPI(void) cvGraphRemoveEdge( CvGraph* graph, int start_idx, int end_idx ); 1186 CVAPI(void) cvGraphRemoveEdgeByPtr( CvGraph* graph, CvGraphVt 1198 CVAPI(void) cvClearGraph( CvGraph* graph ); variable 1245 CvGraph* graph; /* the graph */ member in struct:CvGraphScanner [all...] |
/external/opencv/cxcore/src/ |
H A D | cxdatastructs.cpp | 2875 /* Create a new graph: */ 2880 CvGraph *graph = 0; local 2900 graph = (CvGraph*)vertices; 2901 graph->edges = edges; 2905 return graph; 2909 /* Remove all vertices and edges from a graph: */ 2911 cvClearGraph( CvGraph * graph ) 2917 if( !graph ) 2920 cvClearSet( graph->edges ); 2921 cvClearSet( (CvSet*)graph ); 2929 cvGraphAddVtx( CvGraph* graph, const CvGraphVtx* _vertex, CvGraphVtx** _inserted_vertex ) argument 2962 cvGraphRemoveVtxByPtr( CvGraph* graph, CvGraphVtx* vtx ) argument 2995 cvGraphRemoveVtx( CvGraph* graph, int index ) argument 3032 cvFindGraphEdgeByPtr( const CvGraph* graph, const CvGraphVtx* start_vtx, const CvGraphVtx* end_vtx ) argument 3073 cvFindGraphEdge( const CvGraph* graph, int start_idx, int end_idx ) argument 3102 cvGraphAddEdgeByPtr( CvGraph* graph, CvGraphVtx* start_vtx, CvGraphVtx* end_vtx, const CvGraphEdge* _edge, CvGraphEdge ** _inserted_edge ) argument 3175 cvGraphAddEdge( CvGraph* graph, int start_idx, int end_idx, const CvGraphEdge* _edge, CvGraphEdge ** _inserted_edge ) argument 3204 cvGraphRemoveEdgeByPtr( CvGraph* graph, CvGraphVtx* start_vtx, CvGraphVtx* end_vtx ) argument 3269 cvGraphRemoveEdge( CvGraph* graph, int start_idx, int end_idx ) argument 3292 cvGraphVtxDegreeByPtr( const CvGraph* graph, const CvGraphVtx* vertex ) argument 3318 cvGraphVtxDegree( const CvGraph* graph, int vtx_idx ) argument 3679 cvCloneGraph( const CvGraph* graph, CvMemStorage* storage ) argument [all...] |
/external/opencv/cvaux/include/ |
H A D | cvaux.h | 312 CvGraph* graph; member in struct:CvCliqueFinder 314 int N; //graph size 342 /*CVAPI(void) cvStartFindCliques( CvGraph* graph, CvCliqueFinder* finder, int reverse, 347 CVAPI(void) cvBronKerbosch( CvGraph* graph );*/ 353 // Purpose: finds weight of subgraph in a graph 356 // graph - input graph. 364 // weight_vtx - optional vector of floats, with size = graph->total. 368 // that vertices of graph are inherited from CvGraphWeightedVtx. 369 // weight_edge - optional matrix of floats, of width and height = graph [all...] |