examples.api/jim_list.c

   1 /*-
   2  * Copyright (c) 2010 Wojciech A. Koszek <wkoszek@FreeBSD.org>
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  *
  14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  15  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  16  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  17  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  20  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  22  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  23  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  24  * SUCH DAMAGE.
  25  *
  26  * $Id$
  27  */
  28
  29 #include <assert.h>
  30 #include <stdio.h>
  31 #include <stdlib.h>
  32 #include <string.h>
  33
  34 #define JIM_EMBEDDED
  35 #include <jim.h>
  36
  37 /*
  38  * We have a list of sample words in 'C'..
  39  */
  40 const char *strings[] = {
  41         "simple",
  42         "strings",
  43         "which",
  44         "should",
  45         "get",
  46         "interpreted",
  47         "by",
  48         "Jim",
  49 };
  50
  51 /*
  52  * We have macros which let us to easily obtain of array presented above
  53  */
  54 #define ARRAY_SIZE(a)   (sizeof((a)) / sizeof((a)[0]))
  55 #define SAMPLE_OBJS     ARRAY_SIZE(strings)
  56
  57 /*
  58  * Now we try to write big enough code to duplication our array in Jim's
  59  * list implementation. Later, we try to load a sample script in Tcl that
  60  * could print our list.
  61  */
  62 int
  63 main(int argc, char **argv)
  64 {
  65         Jim_Interp *interp;
  66         Jim_Obj *obj[SAMPLE_OBJS];
  67         Jim_Obj *list;
  68         int i;
  69         int error;
  70
  71         /* Create an interpreter */
  72         interp = Jim_CreateInterp();
  73
  74         /* We register base commands, so that we actually implement Tcl. */
  75         Jim_RegisterCoreCommands(interp);
  76
  77         /* And initialise any static extensions */
  78         Jim_InitStaticExtensions(interp);
  79
  80         /* Create an empty list */
  81         list = Jim_NewListObj(interp, NULL, 0);
  82         assert(list != NULL);
  83
  84         /*
  85          * For each string..
  86          */
  87         for (i = 0; i < SAMPLE_OBJS; i++) {
  88                 /* Duplicate it as an array member. */
  89                 obj[i] = Jim_NewStringObj(interp, strings[i], -1);
  90                 assert(obj[i] != NULL);
  91
  92                 /* We append newly created object to the list */
  93                 Jim_ListAppendElement(interp, list, obj[i]);
  94         }
  95
  96         /*
  97          * We bind a Tcl's name with our list, so that Tcl script can
  98          * identify the variable.
  99          */
 100         Jim_SetVariableStr(interp, "MYLIST", list);
 101
 102         /*
 103          * Parse a script
 104          */
 105         error = Jim_EvalFile(interp, "./print.tcl");
 106         if (error == JIM_ERR) {
 107                 Jim_MakeErrorMessage(interp);
 108                 fprintf(stderr, "%s\n", Jim_GetString(Jim_GetResult(interp), NULL));
 109         }
 110         Jim_FreeInterp(interp);
 111         return (EXIT_SUCCESS);
 112 }