Home
last modified time | relevance | path

Searched refs:max_weight (Results 1 – 6 of 6) sorted by relevance

/external/freetype/src/cache/
Dftcmanag.c385 manager->max_weight = max_bytes; in FTC_Manager_New()
547 manager->cur_weight, manager->max_weight, in FTC_Manager_Compress()
551 if ( manager->cur_weight < manager->max_weight || !first ) in FTC_Manager_Compress()
568 } while ( node && manager->cur_weight > manager->max_weight ); in FTC_Manager_Compress()
Dftcmanag.h96 FT_Offset max_weight; member
Dftccache.c432 if ( manager->cur_weight >= manager->max_weight ) in ftc_cache_add()
/external/tensorflow/tensorflow/core/kernels/mkl/
Dmkl_qmatmul_op.cc343 const float max_weight = context->input(6).flat<float>()(0); in ComputeOutputRangeForInt32() local
345 min_input, max_input, min_weight, max_weight, min_output_value, in ComputeOutputRangeForInt32()
409 const float max_weight = context->input(6).flat<float>()(0); in GetBiasHandle() local
431 std::max(std::abs(max_weight), std::abs(min_weight))); in GetBiasHandle()
469 std::max(std::abs(max_weight), std::abs(min_weight)); in GetBiasHandle()
/external/mesa3d/src/imgui/
Dimstb_truetype.h2790 …d stbtt__fill_active_edges(unsigned char *scanline, int len, stbtt__active_edge *e, int max_weight) in stbtt__fill_active_edges() argument
2809 … scanline[i] = scanline[i] + (stbtt_uint8) ((x1 - x0) * max_weight >> STBTT_FIXSHIFT); in stbtt__fill_active_edges()
2812 …] = scanline[i] + (stbtt_uint8) (((STBTT_FIX - (x0 & STBTT_FIXMASK)) * max_weight) >> STBTT_FIXSHI… in stbtt__fill_active_edges()
2817 … scanline[j] = scanline[j] + (stbtt_uint8) (((x1 & STBTT_FIXMASK) * max_weight) >> STBTT_FIXSHIFT); in stbtt__fill_active_edges()
2822 scanline[i] = scanline[i] + (stbtt_uint8) max_weight; in stbtt__fill_active_edges()
2837 int max_weight = (255 / vsubsample); // weight per vertical scanline in stbtt__rasterize_sorted_edges() local
2918 stbtt__fill_active_edges(scanline, result->w, active, max_weight); in stbtt__rasterize_sorted_edges()
/external/llvm-project/polly/lib/External/isl/
Disl_scheduler.c395 int max_weight; member
6802 n_slack -= graph->max_weight + 1; in has_bounded_distances()
6825 edge->weight -= graph->max_weight + 1; in has_bounded_distances()
7124 merge_edge->weight -= graph->max_weight + 1; in any_no_merge()
7320 graph->max_weight = 0; in compute_weights()
7366 if (edge->weight > graph->max_weight) in compute_weights()
7367 graph->max_weight = edge->weight; in compute_weights()