Home
last modified time | relevance | path

Searched refs:n_graph (Results 1 – 9 of 9) sorted by relevance

/dports/print/ghostscript9-agpl-base/ghostscript-9.52/devices/
H A Dgdevrinkj.c769 rinkj_graph_lookup (const double *graph_x, const double *graph_y, int n_graph, double x) in rinkj_graph_lookup() argument
773 for (i = 0; i < n_graph - 1; i++) in rinkj_graph_lookup()
792 int n_graph; member
802 int n_graph; in rinkj_add_lut() local
816 if (sscanf(linebuf, "%d", &n_graph) != 1) in rinkj_add_lut()
818 if (n_graph < 0 || n_graph > 256) in rinkj_add_lut()
825 chain->n_graph = n_graph; in rinkj_add_lut()
826 …chain->graph_x = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
827 …chain->graph_y = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
828 for (i = 0; i < n_graph; i++) { in rinkj_add_lut()
[all …]
/dports/print/ghostscript9-agpl-x11/ghostscript-9.52/devices/
H A Dgdevrinkj.c769 rinkj_graph_lookup (const double *graph_x, const double *graph_y, int n_graph, double x) in rinkj_graph_lookup() argument
773 for (i = 0; i < n_graph - 1; i++) in rinkj_graph_lookup()
792 int n_graph; member
802 int n_graph; in rinkj_add_lut() local
816 if (sscanf(linebuf, "%d", &n_graph) != 1) in rinkj_add_lut()
818 if (n_graph < 0 || n_graph > 256) in rinkj_add_lut()
825 chain->n_graph = n_graph; in rinkj_add_lut()
826 …chain->graph_x = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
827 …chain->graph_y = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
828 for (i = 0; i < n_graph; i++) { in rinkj_add_lut()
[all …]
/dports/print/ghostscript8-x11/ghostscript-8.71/base/
H A Dgdevrinkj.c799 rinkj_graph_lookup (const double *graph_x, const double *graph_y, int n_graph, double x) in rinkj_graph_lookup() argument
803 for (i = 0; i < n_graph - 1; i++) in rinkj_graph_lookup()
822 int n_graph; member
832 int n_graph; in rinkj_add_lut() local
846 if (sscanf(linebuf, "%d", &n_graph) != 1) in rinkj_add_lut()
850 chain->n_graph = n_graph; in rinkj_add_lut()
851 …chain->graph_x = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
852 …chain->graph_y = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
853 for (i = 0; i < n_graph; i++) { in rinkj_add_lut()
885 chain->n_graph, g); in rinkj_apply_luts()
/dports/print/ghostscript9-base/ghostscript-9.06/base/
H A Dgdevrinkj.c833 rinkj_graph_lookup (const double *graph_x, const double *graph_y, int n_graph, double x) in rinkj_graph_lookup() argument
837 for (i = 0; i < n_graph - 1; i++) in rinkj_graph_lookup()
856 int n_graph; member
866 int n_graph; in rinkj_add_lut() local
880 if (sscanf(linebuf, "%d", &n_graph) != 1) in rinkj_add_lut()
884 chain->n_graph = n_graph; in rinkj_add_lut()
885 …chain->graph_x = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
886 …chain->graph_y = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
887 for (i = 0; i < n_graph; i++) { in rinkj_add_lut()
919 chain->n_graph, g); in rinkj_apply_luts()
/dports/print/ghostscript9-x11/ghostscript-9.06/base/
H A Dgdevrinkj.c833 rinkj_graph_lookup (const double *graph_x, const double *graph_y, int n_graph, double x) in rinkj_graph_lookup() argument
837 for (i = 0; i < n_graph - 1; i++) in rinkj_graph_lookup()
856 int n_graph; member
866 int n_graph; in rinkj_add_lut() local
880 if (sscanf(linebuf, "%d", &n_graph) != 1) in rinkj_add_lut()
884 chain->n_graph = n_graph; in rinkj_add_lut()
885 …chain->graph_x = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
886 …chain->graph_y = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
887 for (i = 0; i < n_graph; i++) { in rinkj_add_lut()
919 chain->n_graph, g); in rinkj_apply_luts()
/dports/print/ghostscript8-base/ghostscript-8.71/base/
H A Dgdevrinkj.c799 rinkj_graph_lookup (const double *graph_x, const double *graph_y, int n_graph, double x) in rinkj_graph_lookup() argument
803 for (i = 0; i < n_graph - 1; i++) in rinkj_graph_lookup()
822 int n_graph; member
832 int n_graph; in rinkj_add_lut() local
846 if (sscanf(linebuf, "%d", &n_graph) != 1) in rinkj_add_lut()
850 chain->n_graph = n_graph; in rinkj_add_lut()
851 …chain->graph_x = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
852 …chain->graph_y = (double *)gs_alloc_bytes(rdev->memory, sizeof(double) * n_graph, "rinkj_add_lut"); in rinkj_add_lut()
853 for (i = 0; i < n_graph; i++) { in rinkj_add_lut()
885 chain->n_graph, g); in rinkj_apply_luts()
/dports/math/gnumeric/gnumeric-1.12.50/src/
H A Dcommands.h179 GObject *n_graph, GObject *o_graph);
H A Dcommands.c6882 GObject *n_graph, GObject *o_graph) in cmd_so_graph_config() argument
6888 g_return_val_if_fail (GOG_IS_GRAPH (n_graph), TRUE); in cmd_so_graph_config()
6896 me->new_graph = GOG_GRAPH (n_graph); in cmd_so_graph_config()
/dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/tools/partitioner/
H A Dhecmw_partition.c2049 int n_graph; in create_elem_graph() local
2097 n_graph = create_elem_graph_link_list(global_mesh, node_data, graph); in create_elem_graph()
2098 if (n_graph < 0) goto error; in create_elem_graph()
2100 elem_graph_item = (int *)HECMW_malloc(sizeof(int) * n_graph); in create_elem_graph()