src/glsl/pp/sl_pp_pragma.c

   1 /**************************************************************************
   2  *
   3  * Copyright 2009 VMware, Inc.
   4  * All Rights Reserved.
   5  *
   6  * Permission is hereby granted, free of charge, to any person obtaining a
   7  * copy of this software and associated documentation files (the
   8  * "Software"), to deal in the Software without restriction, including
   9  * without limitation the rights to use, copy, modify, merge, publish,
  10  * distribute, sub license, and/or sell copies of the Software, and to
  11  * permit persons to whom the Software is furnished to do so, subject to
  12  * the following conditions:
  13  *
  14  * The above copyright notice and this permission notice (including the
  15  * next paragraph) shall be included in all copies or substantial portions
  16  * of the Software.
  17  *
  18  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
  19  * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  20  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT.
  21  * IN NO EVENT SHALL TUNGSTEN GRAPHICS AND/OR ITS SUPPLIERS BE LIABLE FOR
  22  * ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
  23  * TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
  24  * SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  25  *
  26  **************************************************************************/
  27
  28 #include <stdlib.h>
  29 #include <string.h>
  30 #include "sl_pp_context.h"
  31 #include "sl_pp_process.h"
  32
  33
  34 int
  35 sl_pp_process_pragma(struct sl_pp_context *context,
  36                      const struct sl_pp_token_info *input,
  37                      unsigned int first,
  38                      unsigned int last,
  39                      struct sl_pp_process_state *state)
  40 {
  41    int pragma_name = -1;
  42    struct sl_pp_token_info out;
  43    int arg_name = -1;
  44
  45    if (first < last && input[first].token == SL_PP_IDENTIFIER) {
  46       pragma_name = input[first].data.identifier;
  47       first++;
  48    }
  49    if (pragma_name == -1) {
  50       return 0;
  51    }
  52
  53    if (pragma_name == context->dict.optimize) {
  54       out.token = SL_PP_PRAGMA_OPTIMIZE;
  55    } else if (pragma_name == context->dict.debug) {
  56       out.token = SL_PP_PRAGMA_DEBUG;
  57    } else {
  58       return 0;
  59    }
  60
  61    while (first < last && input[first].token == SL_PP_WHITESPACE) {
  62       first++;
  63    }
  64
  65    if (first < last && input[first].token == SL_PP_LPAREN) {
  66       first++;
  67    } else {
  68       return 0;
  69    }
  70
  71    while (first < last && input[first].token == SL_PP_WHITESPACE) {
  72       first++;
  73    }
  74
  75    if (first < last && input[first].token == SL_PP_IDENTIFIER) {
  76       arg_name = input[first].data.identifier;
  77       first++;
  78    }
  79    if (arg_name == -1) {
  80       return 0;
  81    }
  82
  83    if (arg_name == context->dict.off) {
  84       out.data.pragma = 0;
  85    } else if (arg_name == context->dict.on) {
  86       out.data.pragma = 1;
  87    } else {
  88       return 0;
  89    }
  90
  91    while (first < last && input[first].token == SL_PP_WHITESPACE) {
  92       first++;
  93    }
  94
  95    if (first < last && input[first].token == SL_PP_RPAREN) {
  96       first++;
  97    } else {
  98       return 0;
  99    }
 100
 101    /* Ignore the tokens that follow. */
 102
 103    if (sl_pp_process_out(state, &out)) {
 104       strcpy(context->error_msg, "out of memory");
 105       return -1;
 106    }
 107
 108    return 0;
 109 }