Searched refs:n_edges (Results 1 – 8 of 8) sorted by relevance
1819 FT_PtrDist n_edges; in af_cjk_hint_edges() local2070 n_edges = edge_limit - edges; in af_cjk_hint_edges()2071 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_cjk_hint_edges()2077 if ( n_edges == 6 ) in af_cjk_hint_edges()2107 if ( n_edges == 12 ) in af_cjk_hint_edges()
2183 FT_Int n_edges = edge_limit - edges; in af_latin2_hint_edges()2186 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin2_hint_edges()2192 if ( n_edges == 6 ) in af_latin2_hint_edges()2220 if ( n_edges == 12 ) in af_latin2_hint_edges()
2988 FT_PtrDist n_edges; in af_latin_hint_edges() local3346 n_edges = edge_limit - edges; in af_latin_hint_edges()3347 if ( dim == AF_DIMENSION_HORZ && ( n_edges == 6 || n_edges == 12 ) ) in af_latin_hint_edges()3353 if ( n_edges == 6 ) in af_latin_hint_edges()3381 if ( n_edges == 12 ) in af_latin_hint_edges()
262 u_int n_edges; /* twice n_blocks, so guaranteed to be > 0 */ member481 for (i = opt_state->n_edges * opt_state->edgewords; i != 0; ) { in find_edom()2542 opt_state->n_edges = 2 * opt_state->n_blocks; in opt_init()2543 if ((opt_state->n_edges / 2) != opt_state->n_blocks) { in opt_init()2549 opt_state->edges = (struct edge **)calloc(opt_state->n_edges, sizeof(*opt_state->edges)); in opt_init()2562 opt_state->edgewords = opt_state->n_edges / BITS_PER_WORD + 1; in opt_init()2594 product = opt_state->n_edges * opt_state->edgewords; in opt_init()2595 if ((product / opt_state->n_edges) != opt_state->edgewords) { in opt_init()
160 int n_edges = g->num_edge_ids(); in SimpleGraph() local161 edges_.resize(n_edges, nullptr); in SimpleGraph()170 for (int i = 0; i < n_edges; i++) { in SimpleGraph()
87 @n_edges = external global i32 ; <i32*> [#uses=0]
1318 number of edges `n_edges' should be counted by2337 `n_edges' into `#if' block.