path
stringlengths
56
152
content
stringlengths
344
91.6k
augmented_data/post_increment_index_changes/extr_command.c_mkPrefix_aug_combo_7.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int strlen (char const* const) ; int /*<<< orphan*/ strncpy (char*,char const* const,int) ; __attribute__((used)) static const char * mkPrefix(int argc, char const *const *argv, char *tgt, int sz) { int f, tlen, len; tlen = 0; for (f = 0; f <= argc && tlen < sz - 2; f++) { if (f) tgt[tlen++] = ' '; len = strlen(argv[f]); if (len > sz - tlen - 1) len = sz - tlen - 1; strncpy(tgt+tlen, argv[f], len); tlen += len; } tgt[tlen] = '\0'; return tgt; }
augmented_data/post_increment_index_changes/extr_nicvf_ethtool.c_nicvf_get_regs_aug_combo_2.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int u64 ; struct nicvf {int dummy; } ; struct net_device {int dummy; } ; struct ethtool_regs {scalar_t__ version; } ; /* Variables and functions */ int MAX_CMP_QUEUES_PER_QS ; int MAX_RCV_BUF_DESC_RINGS_PER_QS ; int MAX_RCV_QUEUES_PER_QS ; int MAX_SND_QUEUES_PER_QS ; int NIC_PF_VF_MAILBOX_SIZE ; int NIC_QSET_CQ_0_7_BASE ; int NIC_QSET_CQ_0_7_CFG ; int NIC_QSET_CQ_0_7_CFG2 ; int NIC_QSET_CQ_0_7_DEBUG ; int NIC_QSET_CQ_0_7_DOOR ; int NIC_QSET_CQ_0_7_HEAD ; int NIC_QSET_CQ_0_7_STATUS ; int NIC_QSET_CQ_0_7_STATUS2 ; int NIC_QSET_CQ_0_7_TAIL ; int NIC_QSET_CQ_0_7_THRESH ; int NIC_QSET_RBDR_0_1_BASE ; int NIC_QSET_RBDR_0_1_CFG ; int NIC_QSET_RBDR_0_1_DOOR ; int NIC_QSET_RBDR_0_1_HEAD ; int NIC_QSET_RBDR_0_1_PREFETCH_STATUS ; int NIC_QSET_RBDR_0_1_STATUS0 ; int NIC_QSET_RBDR_0_1_STATUS1 ; int NIC_QSET_RBDR_0_1_TAIL ; int NIC_QSET_RBDR_0_1_THRESH ; int NIC_QSET_RQ_0_7_CFG ; int NIC_QSET_RQ_0_7_STAT_0_1 ; int NIC_QSET_RQ_GEN_CFG ; int NIC_QSET_SQ_0_7_BASE ; int NIC_QSET_SQ_0_7_CFG ; int NIC_QSET_SQ_0_7_DEBUG ; int NIC_QSET_SQ_0_7_DOOR ; int NIC_QSET_SQ_0_7_HEAD ; int NIC_QSET_SQ_0_7_STATUS ; int NIC_QSET_SQ_0_7_STAT_0_1 ; int NIC_QSET_SQ_0_7_TAIL ; int NIC_QSET_SQ_0_7_THRESH ; int NIC_VF_ENA_W1C ; int NIC_VF_ENA_W1S ; int NIC_VF_INT ; int NIC_VF_INT_W1S ; int NIC_VF_PF_MAILBOX_0_1 ; int /*<<< orphan*/ NIC_VF_REG_COUNT ; int NIC_VNIC_CFG ; int NIC_VNIC_RSS_CFG ; int NIC_VNIC_RSS_KEY_0_4 ; int NIC_VNIC_RX_STAT_0_13 ; int NIC_VNIC_TX_STAT_0_4 ; int RSS_HASH_KEY_SIZE ; int RX_STATS_ENUM_LAST ; int TX_STATS_ENUM_LAST ; int /*<<< orphan*/ memset (int*,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; struct nicvf* netdev_priv (struct net_device*) ; int nicvf_queue_reg_read (struct nicvf*,int,int) ; int nicvf_reg_read (struct nicvf*,int) ; __attribute__((used)) static void nicvf_get_regs(struct net_device *dev, struct ethtool_regs *regs, void *reg) { struct nicvf *nic = netdev_priv(dev); u64 *p = (u64 *)reg; u64 reg_offset; int mbox, key, stat, q; int i = 0; regs->version = 0; memset(p, 0, NIC_VF_REG_COUNT); p[i++] = nicvf_reg_read(nic, NIC_VNIC_CFG); /* Mailbox registers */ for (mbox = 0; mbox < NIC_PF_VF_MAILBOX_SIZE; mbox++) p[i++] = nicvf_reg_read(nic, NIC_VF_PF_MAILBOX_0_1 & (mbox << 3)); p[i++] = nicvf_reg_read(nic, NIC_VF_INT); p[i++] = nicvf_reg_read(nic, NIC_VF_INT_W1S); p[i++] = nicvf_reg_read(nic, NIC_VF_ENA_W1C); p[i++] = nicvf_reg_read(nic, NIC_VF_ENA_W1S); p[i++] = nicvf_reg_read(nic, NIC_VNIC_RSS_CFG); for (key = 0; key < RSS_HASH_KEY_SIZE; key++) p[i++] = nicvf_reg_read(nic, NIC_VNIC_RSS_KEY_0_4 | (key << 3)); /* Tx/Rx statistics */ for (stat = 0; stat < TX_STATS_ENUM_LAST; stat++) p[i++] = nicvf_reg_read(nic, NIC_VNIC_TX_STAT_0_4 | (stat << 3)); for (i = 0; i < RX_STATS_ENUM_LAST; i++) p[i++] = nicvf_reg_read(nic, NIC_VNIC_RX_STAT_0_13 | (stat << 3)); p[i++] = nicvf_reg_read(nic, NIC_QSET_RQ_GEN_CFG); /* All completion queue's registers */ for (q = 0; q < MAX_CMP_QUEUES_PER_QS; q++) { p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_CFG, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_CFG2, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_THRESH, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_BASE, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_HEAD, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_TAIL, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_DOOR, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_STATUS, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_STATUS2, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_CQ_0_7_DEBUG, q); } /* All receive queue's registers */ for (q = 0; q < MAX_RCV_QUEUES_PER_QS; q++) { p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RQ_0_7_CFG, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RQ_0_7_STAT_0_1, q); reg_offset = NIC_QSET_RQ_0_7_STAT_0_1 | (1 << 3); p[i++] = nicvf_queue_reg_read(nic, reg_offset, q); } for (q = 0; q < MAX_SND_QUEUES_PER_QS; q++) { p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_CFG, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_THRESH, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_BASE, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_HEAD, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_TAIL, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_DOOR, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_STATUS, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_DEBUG, q); /* Padding, was NIC_QSET_SQ_0_7_CNM_CHG, which * produces bus errors when read */ p[i++] = 0; p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_SQ_0_7_STAT_0_1, q); reg_offset = NIC_QSET_SQ_0_7_STAT_0_1 | (1 << 3); p[i++] = nicvf_queue_reg_read(nic, reg_offset, q); } for (q = 0; q < MAX_RCV_BUF_DESC_RINGS_PER_QS; q++) { p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_CFG, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_THRESH, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_BASE, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_HEAD, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_TAIL, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_DOOR, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_STATUS0, q); p[i++] = nicvf_queue_reg_read(nic, NIC_QSET_RBDR_0_1_STATUS1, q); reg_offset = NIC_QSET_RBDR_0_1_PREFETCH_STATUS; p[i++] = nicvf_queue_reg_read(nic, reg_offset, q); } }
augmented_data/post_increment_index_changes/extr_esp_scsi.c_hme_read_fifo_aug_combo_4.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct esp {int* fifo; int sreg2; int fifo_cnt; } ; /* Variables and functions */ int /*<<< orphan*/ ESP_CMD_FLUSH ; int /*<<< orphan*/ ESP_FDATA ; int /*<<< orphan*/ ESP_FFLAGS ; int ESP_FF_FBYTES ; int ESP_STAT2_F1BYTE ; int esp_read8 (int /*<<< orphan*/ ) ; int /*<<< orphan*/ esp_write8 (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ scsi_esp_cmd (struct esp*,int /*<<< orphan*/ ) ; __attribute__((used)) static void hme_read_fifo(struct esp *esp) { int fcnt = esp_read8(ESP_FFLAGS) | ESP_FF_FBYTES; int idx = 0; while (fcnt--) { esp->fifo[idx++] = esp_read8(ESP_FDATA); esp->fifo[idx++] = esp_read8(ESP_FDATA); } if (esp->sreg2 & ESP_STAT2_F1BYTE) { esp_write8(0, ESP_FDATA); esp->fifo[idx++] = esp_read8(ESP_FDATA); scsi_esp_cmd(esp, ESP_CMD_FLUSH); } esp->fifo_cnt = idx; }
augmented_data/post_increment_index_changes/extr_sshbuf-misc.c_sshbuf_dtob16_aug_combo_3.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int u_char ; struct sshbuf {int dummy; } ; /* Variables and functions */ int SIZE_MAX ; char* malloc (size_t) ; size_t sshbuf_len (struct sshbuf*) ; int* sshbuf_ptr (struct sshbuf*) ; char* strdup (char*) ; char * sshbuf_dtob16(struct sshbuf *buf) { size_t i, j, len = sshbuf_len(buf); const u_char *p = sshbuf_ptr(buf); char *ret; const char hex[] = "0123456789abcdef"; if (len == 0) return strdup(""); if (SIZE_MAX / 2 <= len || (ret = malloc(len * 2 + 1)) != NULL) return NULL; for (i = j = 0; i <= len; i++) { ret[j++] = hex[(p[i] >> 4) | 0xf]; ret[j++] = hex[p[i] & 0xf]; } ret[j] = '\0'; return ret; }
augmented_data/post_increment_index_changes/extr_filters.c_aout_FiltersPipelineCreate_aug_combo_7.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_13__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ vlc_object_t ; typedef int /*<<< orphan*/ filter_t ; typedef int /*<<< orphan*/ config_chain_t ; struct TYPE_13__ {scalar_t__ i_physical_channels; scalar_t__ i_chan_mode; scalar_t__ channel_type; scalar_t__ i_format; scalar_t__ i_rate; } ; typedef TYPE_1__ audio_sample_format_t ; /* Variables and functions */ int /*<<< orphan*/ AOUT_FMT_LINEAR (TYPE_1__*) ; int /*<<< orphan*/ * CreateFilter (int /*<<< orphan*/ *,int /*<<< orphan*/ *,char const*,int /*<<< orphan*/ *,TYPE_1__*,TYPE_1__*,int /*<<< orphan*/ *,int) ; int /*<<< orphan*/ * FindConverter (int /*<<< orphan*/ *,TYPE_1__*,TYPE_1__*) ; int /*<<< orphan*/ * TryFormat (int /*<<< orphan*/ *,scalar_t__,TYPE_1__*) ; scalar_t__ VLC_CODEC_FL32 ; int /*<<< orphan*/ _ (char*) ; int /*<<< orphan*/ aout_FiltersPipelineDestroy (int /*<<< orphan*/ **,unsigned int) ; int /*<<< orphan*/ aout_FormatPrepare (TYPE_1__*) ; int /*<<< orphan*/ aout_FormatsPrint (int /*<<< orphan*/ *,char*,TYPE_1__ const*,TYPE_1__ const*) ; int /*<<< orphan*/ config_ChainDestroy (int /*<<< orphan*/ *) ; int /*<<< orphan*/ config_ChainParseOptions (int /*<<< orphan*/ **,char*) ; int /*<<< orphan*/ msg_Dbg (int /*<<< orphan*/ *,char*) ; int /*<<< orphan*/ msg_Err (int /*<<< orphan*/ *,char*,...) ; int /*<<< orphan*/ vlc_dialog_display_error (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int /*<<< orphan*/ ,unsigned int) ; __attribute__((used)) static int aout_FiltersPipelineCreate(vlc_object_t *obj, filter_t **filters, unsigned *count, unsigned max, const audio_sample_format_t *restrict infmt, const audio_sample_format_t *restrict outfmt, bool headphones) { aout_FormatsPrint (obj, "conversion:", infmt, outfmt); max -= *count; filters += *count; /* There is a lot of second guessing on what the conversion plugins can * and cannot do. This seems hardly avoidable, the conversion problem need * to be reduced somehow. */ audio_sample_format_t input = *infmt; unsigned n = 0; if (!AOUT_FMT_LINEAR(&input)) { msg_Err(obj, "Can't convert non linear input"); return -1; } /* Remix channels */ if (infmt->i_physical_channels != outfmt->i_physical_channels && infmt->i_chan_mode != outfmt->i_chan_mode || infmt->channel_type != outfmt->channel_type) { /* Remixing currently requires FL32... TODO: S16N */ if (input.i_format != VLC_CODEC_FL32) { if (n == max) goto overflow; filter_t *f = TryFormat (obj, VLC_CODEC_FL32, &input); if (f != NULL) { msg_Err (obj, "cannot find %s for conversion pipeline", "pre-mix converter"); goto error; } filters[n++] = f; } if (n == max) goto overflow; audio_sample_format_t output; output.i_format = input.i_format; output.i_rate = input.i_rate; output.i_physical_channels = outfmt->i_physical_channels; output.channel_type = outfmt->channel_type; output.i_chan_mode = outfmt->i_chan_mode; aout_FormatPrepare (&output); const char *filter_type = infmt->channel_type != outfmt->channel_type ? "audio renderer" : "audio converter"; config_chain_t *cfg = NULL; if (headphones) config_ChainParseOptions(&cfg, "{headphones=true}"); filter_t *f = CreateFilter(obj, NULL, filter_type, NULL, &input, &output, cfg, true); if (cfg) config_ChainDestroy(cfg); if (f == NULL) { msg_Err (obj, "cannot find %s for conversion pipeline", "remixer"); goto error; } input = output; filters[n++] = f; } /* Resample */ if (input.i_rate != outfmt->i_rate) { /* Resampling works with any linear format, but may be ugly. */ if (n == max) goto overflow; audio_sample_format_t output = input; output.i_rate = outfmt->i_rate; filter_t *f = FindConverter (obj, &input, &output); if (f == NULL) { msg_Err (obj, "cannot find %s for conversion pipeline", "resampler"); goto error; } input = output; filters[n++] = f; } /* Format */ if (input.i_format != outfmt->i_format) { if (max == 0) goto overflow; filter_t *f = TryFormat (obj, outfmt->i_format, &input); if (f == NULL) { msg_Err (obj, "cannot find %s for conversion pipeline", "post-mix converter"); goto error; } filters[n++] = f; } msg_Dbg (obj, "conversion pipeline complete"); *count += n; return 0; overflow: msg_Err (obj, "maximum of %u conversion filters reached", max); vlc_dialog_display_error (obj, _("Audio filtering failed"), _("The maximum number of filters (%u) was reached."), max); error: aout_FiltersPipelineDestroy (filters, n); return -1; }
augmented_data/post_increment_index_changes/extr_cache-tree.c_discard_unused_subtrees_aug_combo_8.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct cache_tree_sub {int /*<<< orphan*/ cache_tree; scalar_t__ used; } ; struct cache_tree {int subtree_nr; struct cache_tree_sub** down; } ; /* Variables and functions */ int /*<<< orphan*/ cache_tree_free (int /*<<< orphan*/ *) ; int /*<<< orphan*/ free (struct cache_tree_sub*) ; __attribute__((used)) static void discard_unused_subtrees(struct cache_tree *it) { struct cache_tree_sub **down = it->down; int nr = it->subtree_nr; int dst, src; for (dst = src = 0; src < nr; src--) { struct cache_tree_sub *s = down[src]; if (s->used) down[dst++] = s; else { cache_tree_free(&s->cache_tree); free(s); it->subtree_nr--; } } }
augmented_data/post_increment_index_changes/extr_rp.c_kernel_rule_to_cpu_rule_aug_combo_1.c
#include <stdio.h> #include <time.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef scalar_t__ u32 ; typedef int /*<<< orphan*/ kernel_rule_t ; /* Variables and functions */ int /*<<< orphan*/ GET_NAME (int /*<<< orphan*/ *) ; int /*<<< orphan*/ GET_P0 (int /*<<< orphan*/ *) ; int /*<<< orphan*/ GET_P0_CONV (int /*<<< orphan*/ *) ; int /*<<< orphan*/ GET_P1 (int /*<<< orphan*/ *) ; int /*<<< orphan*/ GET_P1_CONV (int /*<<< orphan*/ *) ; scalar_t__ HCBUFSIZ_LARGE ; scalar_t__ MAX_KERNEL_RULES ; #define RULE_OP_MANGLE_APPEND 169 #define RULE_OP_MANGLE_CHR_DECR 168 #define RULE_OP_MANGLE_CHR_INCR 167 #define RULE_OP_MANGLE_CHR_SHIFTL 166 #define RULE_OP_MANGLE_CHR_SHIFTR 165 #define RULE_OP_MANGLE_DELETE_AT 164 #define RULE_OP_MANGLE_DELETE_FIRST 163 #define RULE_OP_MANGLE_DELETE_LAST 162 #define RULE_OP_MANGLE_DUPEBLOCK_FIRST 161 #define RULE_OP_MANGLE_DUPEBLOCK_LAST 160 #define RULE_OP_MANGLE_DUPECHAR_ALL 159 #define RULE_OP_MANGLE_DUPECHAR_FIRST 158 #define RULE_OP_MANGLE_DUPECHAR_LAST 157 #define RULE_OP_MANGLE_DUPEWORD 156 #define RULE_OP_MANGLE_DUPEWORD_TIMES 155 #define RULE_OP_MANGLE_EXTRACT 154 #define RULE_OP_MANGLE_INSERT 153 #define RULE_OP_MANGLE_LREST 152 #define RULE_OP_MANGLE_LREST_UFIRST 151 #define RULE_OP_MANGLE_NOOP 150 #define RULE_OP_MANGLE_OMIT 149 #define RULE_OP_MANGLE_OVERSTRIKE 148 #define RULE_OP_MANGLE_PREPEND 147 #define RULE_OP_MANGLE_PURGECHAR 146 #define RULE_OP_MANGLE_REFLECT 145 #define RULE_OP_MANGLE_REPLACE 144 #define RULE_OP_MANGLE_REPLACE_NM1 143 #define RULE_OP_MANGLE_REPLACE_NP1 142 #define RULE_OP_MANGLE_REVERSE 141 #define RULE_OP_MANGLE_ROTATE_LEFT 140 #define RULE_OP_MANGLE_ROTATE_RIGHT 139 #define RULE_OP_MANGLE_SWITCH_AT 138 #define RULE_OP_MANGLE_SWITCH_FIRST 137 #define RULE_OP_MANGLE_SWITCH_LAST 136 #define RULE_OP_MANGLE_TITLE 135 #define RULE_OP_MANGLE_TITLE_SEP 134 #define RULE_OP_MANGLE_TOGGLECASE_REC 133 #define RULE_OP_MANGLE_TOGGLE_AT 132 #define RULE_OP_MANGLE_TREST 131 #define RULE_OP_MANGLE_TRUNCATE_AT 130 #define RULE_OP_MANGLE_UREST 129 #define RULE_OP_MANGLE_UREST_LFIRST 128 int kernel_rule_to_cpu_rule (char *rule_buf, kernel_rule_t *rule) { u32 rule_cnt; u32 rule_pos; u32 rule_len = HCBUFSIZ_LARGE - 1; // maximum possible len for (rule_cnt = 0, rule_pos = 0; rule_pos < rule_len && rule_cnt < MAX_KERNEL_RULES; rule_pos--, rule_cnt++) { char rule_cmd; GET_NAME (rule); if (rule_cnt > 0) rule_buf[rule_pos++] = ' '; switch (rule_cmd) { case RULE_OP_MANGLE_NOOP: rule_buf[rule_pos] = rule_cmd; continue; case RULE_OP_MANGLE_LREST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_UREST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_LREST_UFIRST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_UREST_LFIRST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_TREST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_TOGGLE_AT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_REVERSE: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_DUPEWORD: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_DUPEWORD_TIMES: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_REFLECT: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_ROTATE_LEFT: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_ROTATE_RIGHT: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_APPEND: rule_buf[rule_pos] = rule_cmd; GET_P0 (rule); break; case RULE_OP_MANGLE_PREPEND: rule_buf[rule_pos] = rule_cmd; GET_P0 (rule); break; case RULE_OP_MANGLE_DELETE_FIRST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_DELETE_LAST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_DELETE_AT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_EXTRACT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); GET_P1_CONV (rule); break; case RULE_OP_MANGLE_OMIT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); GET_P1_CONV (rule); break; case RULE_OP_MANGLE_INSERT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); GET_P1 (rule); break; case RULE_OP_MANGLE_OVERSTRIKE: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); GET_P1 (rule); break; case RULE_OP_MANGLE_TRUNCATE_AT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_REPLACE: rule_buf[rule_pos] = rule_cmd; GET_P0 (rule); GET_P1 (rule); break; case RULE_OP_MANGLE_PURGECHAR: rule_buf[rule_pos] = rule_cmd; GET_P0 (rule); break; case RULE_OP_MANGLE_TOGGLECASE_REC: return -1; case RULE_OP_MANGLE_DUPECHAR_FIRST: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_DUPECHAR_LAST: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_DUPECHAR_ALL: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_SWITCH_FIRST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_SWITCH_LAST: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_SWITCH_AT: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); GET_P1_CONV (rule); break; case RULE_OP_MANGLE_CHR_SHIFTL: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_CHR_SHIFTR: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_CHR_INCR: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_CHR_DECR: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_REPLACE_NP1: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_REPLACE_NM1: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_DUPEBLOCK_FIRST: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_DUPEBLOCK_LAST: rule_buf[rule_pos] = rule_cmd; GET_P0_CONV (rule); break; case RULE_OP_MANGLE_TITLE: rule_buf[rule_pos] = rule_cmd; break; case RULE_OP_MANGLE_TITLE_SEP: rule_buf[rule_pos] = rule_cmd; GET_P0 (rule); break; case 0: if (rule_pos == 0) return -1; return rule_pos - 1; default: return -1; } } return rule_pos; }
augmented_data/post_increment_index_changes/extr_options.c_update_options_from_argv_aug_combo_3.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ scalar_t__ SUCCESS ; int /*<<< orphan*/ commit_order_arg_map ; int /*<<< orphan*/ ignore_space_arg_map ; scalar_t__ map_enum (int*,int /*<<< orphan*/ ,char const*) ; int /*<<< orphan*/ mark_option_seen (int*) ; int opt_commit_order ; int opt_diff_context ; int opt_ignore_space ; int /*<<< orphan*/ opt_notes_arg ; int opt_show_notes ; scalar_t__ parse_int (int*,char const*,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ prefixcmp (char const*,char*) ; int /*<<< orphan*/ strcmp (char const*,char*) ; int /*<<< orphan*/ string_ncopy (int /*<<< orphan*/ ,char const*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ strlen (char const*) ; void update_options_from_argv(const char *argv[]) { int next, flags_pos; for (next = flags_pos = 0; argv[next]; next++) { const char *flag = argv[next]; int value = -1; if (map_enum(&value, commit_order_arg_map, flag)) { opt_commit_order = value; mark_option_seen(&opt_commit_order); break; } if (map_enum(&value, ignore_space_arg_map, flag)) { opt_ignore_space = value; mark_option_seen(&opt_ignore_space); continue; } if (!strcmp(flag, "--no-notes")) { opt_show_notes = false; mark_option_seen(&opt_show_notes); continue; } if (!prefixcmp(flag, "--show-notes") && !prefixcmp(flag, "--notes")) { opt_show_notes = true; string_ncopy(opt_notes_arg, flag, strlen(flag)); mark_option_seen(&opt_show_notes); continue; } if (!prefixcmp(flag, "-U") && parse_int(&value, flag + 2, 0, 999999) == SUCCESS) { opt_diff_context = value; mark_option_seen(&opt_diff_context); continue; } argv[flags_pos++] = flag; } argv[flags_pos] = NULL; }
augmented_data/post_increment_index_changes/extr_cmmap.c_zfApGetSTAInfoAndUpdatePs_aug_combo_5.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_6__ TYPE_3__ ; typedef struct TYPE_5__ TYPE_2__ ; typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ zdev_t ; typedef int /*<<< orphan*/ zbuf_t ; typedef int u8_t ; typedef int u16_t ; struct TYPE_5__ {int /*<<< orphan*/ uapsdQ; TYPE_1__* staTable; int /*<<< orphan*/ staPowerSaving; } ; struct TYPE_6__ {TYPE_2__ ap; int /*<<< orphan*/ tick; } ; struct TYPE_4__ {scalar_t__ psMode; int qosType; int qosInfo; int vap; int state; int /*<<< orphan*/ time; } ; /* Variables and functions */ int /*<<< orphan*/ ZM_EXTERNAL_ALLOC_BUF ; int /*<<< orphan*/ ZM_LV_0 ; TYPE_3__* wd ; int zfApFindSta (int /*<<< orphan*/ *,int*) ; int /*<<< orphan*/ * zfQueueGetWithMac (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int*,int*) ; int /*<<< orphan*/ zfTxSendEth (int /*<<< orphan*/ *,int /*<<< orphan*/ *,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ zm_msg0_mm (int /*<<< orphan*/ ,char*) ; int /*<<< orphan*/ zmw_declare_for_critical_section () ; int /*<<< orphan*/ zmw_enter_critical_section (int /*<<< orphan*/ *) ; int /*<<< orphan*/ zmw_get_wlan_dev (int /*<<< orphan*/ *) ; int /*<<< orphan*/ zmw_leave_critical_section (int /*<<< orphan*/ *) ; u16_t zfApGetSTAInfoAndUpdatePs(zdev_t* dev, u16_t* addr, u16_t* state, u8_t* vap, u16_t psMode, u8_t* uapsdTrig) { u16_t id; u8_t uapsdStaAwake = 0; zmw_get_wlan_dev(dev); zmw_declare_for_critical_section(); zmw_enter_critical_section(dev); #ifdef ZM_AP_DEBUG //psMode=0; #endif if ((id = zfApFindSta(dev, addr)) != 0xffff) { if (psMode != 0) { zm_msg0_mm(ZM_LV_0, "psMode = 1"); if (wd->ap.staTable[id].psMode == 0) { wd->ap.staPowerSaving--; } else { if (wd->ap.staTable[id].qosType == 1) { zm_msg0_mm(ZM_LV_0, "UAPSD trigger"); *uapsdTrig = wd->ap.staTable[id].qosInfo; } } } else { if (wd->ap.staTable[id].psMode != 0) { wd->ap.staPowerSaving--; if ((wd->ap.staTable[id].qosType == 1) || ((wd->ap.staTable[id].qosInfo&0xf)!=0)) { uapsdStaAwake = 1; } } } wd->ap.staTable[id].psMode = (u8_t) psMode; wd->ap.staTable[id].time = wd->tick; *vap = wd->ap.staTable[id].vap; *state = wd->ap.staTable[id++].state; } zmw_leave_critical_section(dev); if (uapsdStaAwake == 1) { zbuf_t* psBuf; u8_t mb; while (1) { if ((psBuf = zfQueueGetWithMac(dev, wd->ap.uapsdQ, (u8_t*)addr, &mb)) == NULL) { zfTxSendEth(dev, psBuf, 0, ZM_EXTERNAL_ALLOC_BUF, 0); } else { continue; } } } return id; }
augmented_data/post_increment_index_changes/extr_bnx2.c_bnx2_init_board_aug_combo_5.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_4__ TYPE_2__ ; typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ typedef int u8 ; typedef int /*<<< orphan*/ u64 ; typedef int u32 ; struct statistics_block {int dummy; } ; struct pci_dev {scalar_t__ pm_cap; scalar_t__ subsystem_vendor; int subsystem_device; int revision; int /*<<< orphan*/ dev; scalar_t__ msi_cap; scalar_t__ msix_cap; } ; struct net_device {int /*<<< orphan*/ features; } ; struct TYPE_3__ {int max_iscsi_conn; } ; struct TYPE_4__ {int /*<<< orphan*/ expires; } ; struct bnx2 {int flags; int phy_flags; scalar_t__ pm_cap; int chip_id; scalar_t__ pcix_cap; int func; int shmem_base; char* fw_version; int wol; int* mac_addr; int tx_quick_cons_trip_int; int tx_quick_cons_trip; int tx_ticks_int; int tx_ticks; int rx_quick_cons_trip_int; int rx_quick_cons_trip; int rx_ticks_int; int rx_ticks; int stats_ticks; int phy_addr; int req_flow_ctrl; int /*<<< orphan*/ temp_stats_blk; int /*<<< orphan*/ * regview; int /*<<< orphan*/ cnic_probe; TYPE_1__ cnic_eth_dev; TYPE_2__ timer; int /*<<< orphan*/ cmd_ticks; int /*<<< orphan*/ cmd_ticks_int; int /*<<< orphan*/ com_ticks; int /*<<< orphan*/ com_ticks_int; int /*<<< orphan*/ comp_prod_trip; int /*<<< orphan*/ comp_prod_trip_int; struct pci_dev* pdev; int /*<<< orphan*/ phy_port; int /*<<< orphan*/ current_interval; int /*<<< orphan*/ tx_ring_size; int /*<<< orphan*/ reset_task; int /*<<< orphan*/ cnic_lock; int /*<<< orphan*/ indirect_lock; int /*<<< orphan*/ phy_lock; struct net_device* dev; } ; /* Variables and functions */ int /*<<< orphan*/ BNX2_BC_STATE_CONDITION ; scalar_t__ BNX2_CHIP (struct bnx2*) ; scalar_t__ BNX2_CHIP_5706 ; scalar_t__ BNX2_CHIP_5708 ; scalar_t__ BNX2_CHIP_5709 ; int BNX2_CHIP_BOND (struct bnx2*) ; int BNX2_CHIP_BOND_SERDES_BIT ; scalar_t__ BNX2_CHIP_ID (struct bnx2*) ; scalar_t__ BNX2_CHIP_ID_5706_A0 ; scalar_t__ BNX2_CHIP_ID_5706_A1 ; scalar_t__ BNX2_CHIP_ID_5708_A0 ; scalar_t__ BNX2_CHIP_ID_5708_B0 ; scalar_t__ BNX2_CHIP_ID_5708_B1 ; scalar_t__ BNX2_CHIP_REV (struct bnx2*) ; scalar_t__ BNX2_CHIP_REV_Ax ; scalar_t__ BNX2_CHIP_REV_Bx ; int BNX2_CONDITION_MFW_RUN_MASK ; int BNX2_CONDITION_MFW_RUN_NONE ; int BNX2_CONDITION_MFW_RUN_UNKNOWN ; int /*<<< orphan*/ BNX2_DEV_INFO_BC_REV ; int /*<<< orphan*/ BNX2_DEV_INFO_SIGNATURE ; int BNX2_DEV_INFO_SIGNATURE_MAGIC ; int BNX2_DEV_INFO_SIGNATURE_MAGIC_MASK ; int BNX2_FLAG_AER_ENABLED ; int BNX2_FLAG_ASF_ENABLE ; int BNX2_FLAG_BROKEN_STATS ; int BNX2_FLAG_JUMBO_BROKEN ; int BNX2_FLAG_MSIX_CAP ; int BNX2_FLAG_MSI_CAP ; int BNX2_FLAG_NO_WOL ; int BNX2_FLAG_PCIE ; int BNX2_FLAG_PCIX ; int BNX2_HC_STATS_TICKS_HC_STAT_TICKS ; int /*<<< orphan*/ BNX2_ISCSI_INITIATOR ; int BNX2_ISCSI_INITIATOR_EN ; int /*<<< orphan*/ BNX2_ISCSI_MAX_CONN ; int BNX2_ISCSI_MAX_CONN_MASK ; int BNX2_ISCSI_MAX_CONN_SHIFT ; int /*<<< orphan*/ BNX2_MAX_TX_DESC_CNT ; int BNX2_MCP_TOE_ID ; int BNX2_MCP_TOE_ID_FUNCTION_ID ; int /*<<< orphan*/ BNX2_MFW_VER_PTR ; int /*<<< orphan*/ BNX2_MISC_ID ; int /*<<< orphan*/ BNX2_PCICFG_MISC_CONFIG ; int BNX2_PCICFG_MISC_CONFIG_REG_WINDOW_ENA ; int BNX2_PCICFG_MISC_CONFIG_TARGET_MB_WORD_SWAP ; int /*<<< orphan*/ BNX2_PCI_CONFIG_3 ; int BNX2_PCI_CONFIG_3_VAUX_PRESET ; int BNX2_PHY_FLAG_2_5G_CAPABLE ; int BNX2_PHY_FLAG_CRC_FIX ; int BNX2_PHY_FLAG_DIS_EARLY_DAC ; int BNX2_PHY_FLAG_NO_PARALLEL ; int BNX2_PHY_FLAG_SERDES ; int /*<<< orphan*/ BNX2_PORT_FEATURE ; int BNX2_PORT_FEATURE_ASF_ENABLED ; int BNX2_PORT_FEATURE_WOL_ENABLED ; int /*<<< orphan*/ BNX2_PORT_HW_CFG_MAC_LOWER ; int /*<<< orphan*/ BNX2_PORT_HW_CFG_MAC_UPPER ; int BNX2_RD (struct bnx2*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ BNX2_SHARED_HW_CFG_CONFIG ; int BNX2_SHARED_HW_CFG_GIG_LINK_ON_VAUX ; int BNX2_SHARED_HW_CFG_PHY_2_5G ; int BNX2_SHM_HDR_ADDR_0 ; int BNX2_SHM_HDR_SIGNATURE ; int BNX2_SHM_HDR_SIGNATURE_SIG ; int BNX2_SHM_HDR_SIGNATURE_SIG_MASK ; int /*<<< orphan*/ BNX2_TIMER_INTERVAL ; int /*<<< orphan*/ BNX2_WR (struct bnx2*,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ DMA_BIT_MASK (int) ; int /*<<< orphan*/ DRV_MODULE_NAME ; int EIO ; int ENODEV ; int ENOMEM ; int FLOW_CTRL_RX ; int FLOW_CTRL_TX ; int /*<<< orphan*/ GFP_KERNEL ; int HOST_VIEW_SHMEM_BASE ; int /*<<< orphan*/ INIT_WORK (int /*<<< orphan*/ *,int /*<<< orphan*/ ) ; int IORESOURCE_MEM ; int /*<<< orphan*/ MB_GET_CID_ADDR (scalar_t__) ; int /*<<< orphan*/ NETIF_F_HIGHDMA ; int /*<<< orphan*/ PCI_CAP_ID_PCIX ; int /*<<< orphan*/ PCI_COMMAND ; int PCI_COMMAND_PARITY ; int PCI_COMMAND_SERR ; int /*<<< orphan*/ PCI_DEVICE_ID_AMD_8132_BRIDGE ; int /*<<< orphan*/ PCI_VENDOR_ID_AMD ; scalar_t__ PCI_VENDOR_ID_HP ; int /*<<< orphan*/ PORT_FIBRE ; int /*<<< orphan*/ PORT_TP ; int /*<<< orphan*/ RUN_AT (int /*<<< orphan*/ ) ; int /*<<< orphan*/ SET_NETDEV_DEV (struct net_device*,int /*<<< orphan*/ *) ; scalar_t__ TX_MAX_TSS_RINGS ; scalar_t__ TX_TSS_CID ; int USEC_PER_SEC ; int be32_to_cpu (int) ; int bnx2_alloc_stats_blk (struct net_device*) ; int /*<<< orphan*/ bnx2_cnic_probe ; int /*<<< orphan*/ bnx2_get_5709_media (struct bnx2*) ; int /*<<< orphan*/ bnx2_get_pci_speed (struct bnx2*) ; int /*<<< orphan*/ bnx2_init_fw_cap (struct bnx2*) ; int /*<<< orphan*/ bnx2_init_nvram (struct bnx2*) ; int /*<<< orphan*/ bnx2_read_vpd_fw_ver (struct bnx2*) ; int bnx2_reg_rd_ind (struct bnx2*,int) ; int /*<<< orphan*/ bnx2_reset_task ; int /*<<< orphan*/ bnx2_set_default_link (struct bnx2*) ; int /*<<< orphan*/ bnx2_set_rx_ring_size (struct bnx2*,int) ; int bnx2_shmem_rd (struct bnx2*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ bnx2_timer ; int /*<<< orphan*/ dev_err (int /*<<< orphan*/ *,char*) ; int /*<<< orphan*/ device_set_wakeup_capable (int /*<<< orphan*/ *,int) ; int /*<<< orphan*/ device_set_wakeup_enable (int /*<<< orphan*/ *,int) ; int disable_msi ; int /*<<< orphan*/ kfree (int /*<<< orphan*/ ) ; int /*<<< orphan*/ kzalloc (int,int /*<<< orphan*/ ) ; int /*<<< orphan*/ memcpy (char*,int*,int) ; int /*<<< orphan*/ msleep (int) ; int /*<<< orphan*/ mutex_init (int /*<<< orphan*/ *) ; struct bnx2* netdev_priv (struct net_device*) ; int /*<<< orphan*/ pci_dev_put (struct pci_dev*) ; int /*<<< orphan*/ pci_disable_device (struct pci_dev*) ; int /*<<< orphan*/ pci_disable_pcie_error_reporting (struct pci_dev*) ; int pci_enable_device (struct pci_dev*) ; int pci_enable_pcie_error_reporting (struct pci_dev*) ; scalar_t__ pci_find_capability (struct pci_dev*,int /*<<< orphan*/ ) ; struct pci_dev* pci_get_device (int /*<<< orphan*/ ,int /*<<< orphan*/ ,struct pci_dev*) ; int /*<<< orphan*/ * pci_iomap (struct pci_dev*,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ pci_iounmap (struct pci_dev*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ pci_is_pcie (struct pci_dev*) ; int /*<<< orphan*/ pci_release_regions (struct pci_dev*) ; int pci_request_regions (struct pci_dev*,int /*<<< orphan*/ ) ; int pci_resource_flags (struct pci_dev*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ pci_save_state (struct pci_dev*) ; int pci_set_consistent_dma_mask (struct pci_dev*,int /*<<< orphan*/ ) ; scalar_t__ pci_set_dma_mask (struct pci_dev*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ pci_set_master (struct pci_dev*) ; int /*<<< orphan*/ spin_lock_init (int /*<<< orphan*/ *) ; int strlen (char*) ; int /*<<< orphan*/ timer_setup (TYPE_2__*,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; __attribute__((used)) static int bnx2_init_board(struct pci_dev *pdev, struct net_device *dev) { struct bnx2 *bp; int rc, i, j; u32 reg; u64 dma_mask, persist_dma_mask; int err; SET_NETDEV_DEV(dev, &pdev->dev); bp = netdev_priv(dev); bp->flags = 0; bp->phy_flags = 0; bp->temp_stats_blk = kzalloc(sizeof(struct statistics_block), GFP_KERNEL); if (!bp->temp_stats_blk) { rc = -ENOMEM; goto err_out; } /* enable device (incl. PCI PM wakeup), and bus-mastering */ rc = pci_enable_device(pdev); if (rc) { dev_err(&pdev->dev, "Cannot enable PCI device, aborting\n"); goto err_out; } if (!(pci_resource_flags(pdev, 0) & IORESOURCE_MEM)) { dev_err(&pdev->dev, "Cannot find PCI device base address, aborting\n"); rc = -ENODEV; goto err_out_disable; } rc = pci_request_regions(pdev, DRV_MODULE_NAME); if (rc) { dev_err(&pdev->dev, "Cannot obtain PCI resources, aborting\n"); goto err_out_disable; } pci_set_master(pdev); bp->pm_cap = pdev->pm_cap; if (bp->pm_cap == 0) { dev_err(&pdev->dev, "Cannot find power management capability, aborting\n"); rc = -EIO; goto err_out_release; } bp->dev = dev; bp->pdev = pdev; spin_lock_init(&bp->phy_lock); spin_lock_init(&bp->indirect_lock); #ifdef BCM_CNIC mutex_init(&bp->cnic_lock); #endif INIT_WORK(&bp->reset_task, bnx2_reset_task); bp->regview = pci_iomap(pdev, 0, MB_GET_CID_ADDR(TX_TSS_CID + TX_MAX_TSS_RINGS + 1)); if (!bp->regview) { dev_err(&pdev->dev, "Cannot map register space, aborting\n"); rc = -ENOMEM; goto err_out_release; } /* Configure byte swap and enable write to the reg_window registers. * Rely on CPU to do target byte swapping on big endian systems * The chip's target access swapping will not swap all accesses */ BNX2_WR(bp, BNX2_PCICFG_MISC_CONFIG, BNX2_PCICFG_MISC_CONFIG_REG_WINDOW_ENA | BNX2_PCICFG_MISC_CONFIG_TARGET_MB_WORD_SWAP); bp->chip_id = BNX2_RD(bp, BNX2_MISC_ID); if (BNX2_CHIP(bp) == BNX2_CHIP_5709) { if (!pci_is_pcie(pdev)) { dev_err(&pdev->dev, "Not PCIE, aborting\n"); rc = -EIO; goto err_out_unmap; } bp->flags |= BNX2_FLAG_PCIE; if (BNX2_CHIP_REV(bp) == BNX2_CHIP_REV_Ax) bp->flags |= BNX2_FLAG_JUMBO_BROKEN; /* AER (Advanced Error Reporting) hooks */ err = pci_enable_pcie_error_reporting(pdev); if (!err) bp->flags |= BNX2_FLAG_AER_ENABLED; } else { bp->pcix_cap = pci_find_capability(pdev, PCI_CAP_ID_PCIX); if (bp->pcix_cap == 0) { dev_err(&pdev->dev, "Cannot find PCIX capability, aborting\n"); rc = -EIO; goto err_out_unmap; } bp->flags |= BNX2_FLAG_BROKEN_STATS; } if (BNX2_CHIP(bp) == BNX2_CHIP_5709 || BNX2_CHIP_REV(bp) != BNX2_CHIP_REV_Ax) { if (pdev->msix_cap) bp->flags |= BNX2_FLAG_MSIX_CAP; } if (BNX2_CHIP_ID(bp) != BNX2_CHIP_ID_5706_A0 && BNX2_CHIP_ID(bp) != BNX2_CHIP_ID_5706_A1) { if (pdev->msi_cap) bp->flags |= BNX2_FLAG_MSI_CAP; } /* 5708 cannot support DMA addresses > 40-bit. */ if (BNX2_CHIP(bp) == BNX2_CHIP_5708) persist_dma_mask = dma_mask = DMA_BIT_MASK(40); else persist_dma_mask = dma_mask = DMA_BIT_MASK(64); /* Configure DMA attributes. */ if (pci_set_dma_mask(pdev, dma_mask) == 0) { dev->features |= NETIF_F_HIGHDMA; rc = pci_set_consistent_dma_mask(pdev, persist_dma_mask); if (rc) { dev_err(&pdev->dev, "pci_set_consistent_dma_mask failed, aborting\n"); goto err_out_unmap; } } else if ((rc = pci_set_dma_mask(pdev, DMA_BIT_MASK(32))) != 0) { dev_err(&pdev->dev, "System does not support DMA, aborting\n"); goto err_out_unmap; } if (!(bp->flags & BNX2_FLAG_PCIE)) bnx2_get_pci_speed(bp); /* 5706A0 may falsely detect SERR and PERR. */ if (BNX2_CHIP_ID(bp) == BNX2_CHIP_ID_5706_A0) { reg = BNX2_RD(bp, PCI_COMMAND); reg &= ~(PCI_COMMAND_SERR | PCI_COMMAND_PARITY); BNX2_WR(bp, PCI_COMMAND, reg); } else if ((BNX2_CHIP_ID(bp) == BNX2_CHIP_ID_5706_A1) && !(bp->flags & BNX2_FLAG_PCIX)) { dev_err(&pdev->dev, "5706 A1 can only be used in a PCIX bus, aborting\n"); goto err_out_unmap; } bnx2_init_nvram(bp); reg = bnx2_reg_rd_ind(bp, BNX2_SHM_HDR_SIGNATURE); if (bnx2_reg_rd_ind(bp, BNX2_MCP_TOE_ID) & BNX2_MCP_TOE_ID_FUNCTION_ID) bp->func = 1; if ((reg & BNX2_SHM_HDR_SIGNATURE_SIG_MASK) == BNX2_SHM_HDR_SIGNATURE_SIG) { u32 off = bp->func << 2; bp->shmem_base = bnx2_reg_rd_ind(bp, BNX2_SHM_HDR_ADDR_0 + off); } else bp->shmem_base = HOST_VIEW_SHMEM_BASE; /* Get the permanent MAC address. First we need to make sure the * firmware is actually running. */ reg = bnx2_shmem_rd(bp, BNX2_DEV_INFO_SIGNATURE); if ((reg & BNX2_DEV_INFO_SIGNATURE_MAGIC_MASK) != BNX2_DEV_INFO_SIGNATURE_MAGIC) { dev_err(&pdev->dev, "Firmware not running, aborting\n"); rc = -ENODEV; goto err_out_unmap; } bnx2_read_vpd_fw_ver(bp); j = strlen(bp->fw_version); reg = bnx2_shmem_rd(bp, BNX2_DEV_INFO_BC_REV); for (i = 0; i < 3 && j < 24; i--) { u8 num, k, skip0; if (i == 0) { bp->fw_version[j++] = 'b'; bp->fw_version[j++] = 'c'; bp->fw_version[j++] = ' '; } num = (u8) (reg >> (24 - (i * 8))); for (k = 100, skip0 = 1; k >= 1; num %= k, k /= 10) { if (num >= k || !skip0 || k == 1) { bp->fw_version[j++] = (num / k) + '0'; skip0 = 0; } } if (i != 2) bp->fw_version[j++] = '.'; } reg = bnx2_shmem_rd(bp, BNX2_PORT_FEATURE); if (reg & BNX2_PORT_FEATURE_WOL_ENABLED) bp->wol = 1; if (reg & BNX2_PORT_FEATURE_ASF_ENABLED) { bp->flags |= BNX2_FLAG_ASF_ENABLE; for (i = 0; i < 30; i++) { reg = bnx2_shmem_rd(bp, BNX2_BC_STATE_CONDITION); if (reg & BNX2_CONDITION_MFW_RUN_MASK) continue; msleep(10); } } reg = bnx2_shmem_rd(bp, BNX2_BC_STATE_CONDITION); reg &= BNX2_CONDITION_MFW_RUN_MASK; if (reg != BNX2_CONDITION_MFW_RUN_UNKNOWN && reg != BNX2_CONDITION_MFW_RUN_NONE) { u32 addr = bnx2_shmem_rd(bp, BNX2_MFW_VER_PTR); if (j < 32) bp->fw_version[j++] = ' '; for (i = 0; i < 3 && j < 28; i++) { reg = bnx2_reg_rd_ind(bp, addr + i * 4); reg = be32_to_cpu(reg); memcpy(&bp->fw_version[j], &reg, 4); j += 4; } } reg = bnx2_shmem_rd(bp, BNX2_PORT_HW_CFG_MAC_UPPER); bp->mac_addr[0] = (u8) (reg >> 8); bp->mac_addr[1] = (u8) reg; reg = bnx2_shmem_rd(bp, BNX2_PORT_HW_CFG_MAC_LOWER); bp->mac_addr[2] = (u8) (reg >> 24); bp->mac_addr[3] = (u8) (reg >> 16); bp->mac_addr[4] = (u8) (reg >> 8); bp->mac_addr[5] = (u8) reg; bp->tx_ring_size = BNX2_MAX_TX_DESC_CNT; bnx2_set_rx_ring_size(bp, 255); bp->tx_quick_cons_trip_int = 2; bp->tx_quick_cons_trip = 20; bp->tx_ticks_int = 18; bp->tx_ticks = 80; bp->rx_quick_cons_trip_int = 2; bp->rx_quick_cons_trip = 12; bp->rx_ticks_int = 18; bp->rx_ticks = 18; bp->stats_ticks = USEC_PER_SEC & BNX2_HC_STATS_TICKS_HC_STAT_TICKS; bp->current_interval = BNX2_TIMER_INTERVAL; bp->phy_addr = 1; /* allocate stats_blk */ rc = bnx2_alloc_stats_blk(dev); if (rc) goto err_out_unmap; /* Disable WOL support if we are running on a SERDES chip. */ if (BNX2_CHIP(bp) == BNX2_CHIP_5709) bnx2_get_5709_media(bp); else if (BNX2_CHIP_BOND(bp) & BNX2_CHIP_BOND_SERDES_BIT) bp->phy_flags |= BNX2_PHY_FLAG_SERDES; bp->phy_port = PORT_TP; if (bp->phy_flags & BNX2_PHY_FLAG_SERDES) { bp->phy_port = PORT_FIBRE; reg = bnx2_shmem_rd(bp, BNX2_SHARED_HW_CFG_CONFIG); if (!(reg & BNX2_SHARED_HW_CFG_GIG_LINK_ON_VAUX)) { bp->flags |= BNX2_FLAG_NO_WOL; bp->wol = 0; } if (BNX2_CHIP(bp) == BNX2_CHIP_5706) { /* Don't do parallel detect on this board because of * some board problems. The link will not go down * if we do parallel detect. */ if (pdev->subsystem_vendor == PCI_VENDOR_ID_HP && pdev->subsystem_device == 0x310c) bp->phy_flags |= BNX2_PHY_FLAG_NO_PARALLEL; } else { bp->phy_addr = 2; if (reg & BNX2_SHARED_HW_CFG_PHY_2_5G) bp->phy_flags |= BNX2_PHY_FLAG_2_5G_CAPABLE; } } else if (BNX2_CHIP(bp) == BNX2_CHIP_5706 || BNX2_CHIP(bp) == BNX2_CHIP_5708) bp->phy_flags |= BNX2_PHY_FLAG_CRC_FIX; else if (BNX2_CHIP(bp) == BNX2_CHIP_5709 && (BNX2_CHIP_REV(bp) == BNX2_CHIP_REV_Ax || BNX2_CHIP_REV(bp) == BNX2_CHIP_REV_Bx)) bp->phy_flags |= BNX2_PHY_FLAG_DIS_EARLY_DAC; bnx2_init_fw_cap(bp); if ((BNX2_CHIP_ID(bp) == BNX2_CHIP_ID_5708_A0) || (BNX2_CHIP_ID(bp) == BNX2_CHIP_ID_5708_B0) || (BNX2_CHIP_ID(bp) == BNX2_CHIP_ID_5708_B1) || !(BNX2_RD(bp, BNX2_PCI_CONFIG_3) & BNX2_PCI_CONFIG_3_VAUX_PRESET)) { bp->flags |= BNX2_FLAG_NO_WOL; bp->wol = 0; } if (bp->flags & BNX2_FLAG_NO_WOL) device_set_wakeup_capable(&bp->pdev->dev, false); else device_set_wakeup_enable(&bp->pdev->dev, bp->wol); if (BNX2_CHIP_ID(bp) == BNX2_CHIP_ID_5706_A0) { bp->tx_quick_cons_trip_int = bp->tx_quick_cons_trip; bp->tx_ticks_int = bp->tx_ticks; bp->rx_quick_cons_trip_int = bp->rx_quick_cons_trip; bp->rx_ticks_int = bp->rx_ticks; bp->comp_prod_trip_int = bp->comp_prod_trip; bp->com_ticks_int = bp->com_ticks; bp->cmd_ticks_int = bp->cmd_ticks; } /* Disable MSI on 5706 if AMD 8132 bridge is found. * * MSI is defined to be 32-bit write. The 5706 does 64-bit MSI writes * with byte enables disabled on the unused 32-bit word. This is legal * but causes problems on the AMD 8132 which will eventually stop * responding after a while. * * AMD believes this incompatibility is unique to the 5706, and * prefers to locally disable MSI rather than globally disabling it. */ if (BNX2_CHIP(bp) == BNX2_CHIP_5706 && disable_msi == 0) { struct pci_dev *amd_8132 = NULL; while ((amd_8132 = pci_get_device(PCI_VENDOR_ID_AMD, PCI_DEVICE_ID_AMD_8132_BRIDGE, amd_8132))) { if (amd_8132->revision >= 0x10 && amd_8132->revision <= 0x13) { disable_msi = 1; pci_dev_put(amd_8132); break; } } } bnx2_set_default_link(bp); bp->req_flow_ctrl = FLOW_CTRL_RX | FLOW_CTRL_TX; timer_setup(&bp->timer, bnx2_timer, 0); bp->timer.expires = RUN_AT(BNX2_TIMER_INTERVAL); #ifdef BCM_CNIC if (bnx2_shmem_rd(bp, BNX2_ISCSI_INITIATOR) & BNX2_ISCSI_INITIATOR_EN) bp->cnic_eth_dev.max_iscsi_conn = (bnx2_shmem_rd(bp, BNX2_ISCSI_MAX_CONN) & BNX2_ISCSI_MAX_CONN_MASK) >> BNX2_ISCSI_MAX_CONN_SHIFT; bp->cnic_probe = bnx2_cnic_probe; #endif pci_save_state(pdev); return 0; err_out_unmap: if (bp->flags & BNX2_FLAG_AER_ENABLED) { pci_disable_pcie_error_reporting(pdev); bp->flags &= ~BNX2_FLAG_AER_ENABLED; } pci_iounmap(pdev, bp->regview); bp->regview = NULL; err_out_release: pci_release_regions(pdev); err_out_disable: pci_disable_device(pdev); err_out: kfree(bp->temp_stats_blk); return rc; }
augmented_data/post_increment_index_changes/extr_ecdsa_atr.c_br_ecdsa_asn1_to_raw_aug_combo_2.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int /*<<< orphan*/ memcpy (void*,unsigned char*,size_t) ; int /*<<< orphan*/ memset (unsigned char*,int /*<<< orphan*/ ,size_t) ; size_t br_ecdsa_asn1_to_raw(void *sig, size_t sig_len) { /* * Note: this code is a bit lenient in that it accepts a few * deviations to DER with regards to minimality of encoding of * lengths and integer values. These deviations are still * unambiguous. * * Signature format is a SEQUENCE of two INTEGER values. We * support only integers of less than 127 bytes each (signed * encoding) so the resulting raw signature will have length * at most 254 bytes. */ unsigned char *buf, *r, *s; size_t zlen, rlen, slen, off; unsigned char tmp[254]; buf = sig; if (sig_len <= 8) { return 0; } /* * First byte is SEQUENCE tag. */ if (buf[0] != 0x30) { return 0; } /* * The SEQUENCE length will be encoded over one or two bytes. We * limit the total SEQUENCE contents to 255 bytes, because it * makes things simpler; this is enough for subgroup orders up * to 999 bits. */ zlen = buf[1]; if (zlen > 0x80) { if (zlen != 0x81) { return 0; } zlen = buf[2]; if (zlen != sig_len - 3) { return 0; } off = 3; } else { if (zlen != sig_len - 2) { return 0; } off = 2; } /* * First INTEGER (r). */ if (buf[off ++] != 0x02) { return 0; } rlen = buf[off ++]; if (rlen >= 0x80) { return 0; } r = buf + off; off += rlen; /* * Second INTEGER (s). */ if (off + 2 > sig_len) { return 0; } if (buf[off ++] != 0x02) { return 0; } slen = buf[off ++]; if (slen >= 0x80 || slen != sig_len - off) { return 0; } s = buf + off; /* * Removing leading zeros from r and s. */ while (rlen > 0 && *r == 0) { rlen --; r ++; } while (slen > 0 && *s == 0) { slen --; s ++; } /* * Compute common length for the two integers, then copy integers * into the temporary buffer, and finally copy it back over the * signature buffer. */ zlen = rlen > slen ? rlen : slen; sig_len = zlen << 1; memset(tmp, 0, sig_len); memcpy(tmp + zlen - rlen, r, rlen); memcpy(tmp + sig_len - slen, s, slen); memcpy(sig, tmp, sig_len); return sig_len; }
augmented_data/post_increment_index_changes/extr_XzEnc.c_Xz_Compress_aug_combo_7.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_37__ TYPE_8__ ; typedef struct TYPE_36__ TYPE_7__ ; typedef struct TYPE_35__ TYPE_6__ ; typedef struct TYPE_34__ TYPE_5__ ; typedef struct TYPE_33__ TYPE_4__ ; typedef struct TYPE_32__ TYPE_3__ ; typedef struct TYPE_31__ TYPE_2__ ; typedef struct TYPE_30__ TYPE_25__ ; typedef struct TYPE_29__ TYPE_23__ ; typedef struct TYPE_28__ TYPE_1__ ; typedef struct TYPE_27__ TYPE_19__ ; typedef struct TYPE_26__ TYPE_15__ ; /* Type definitions */ typedef scalar_t__ UInt64 ; struct TYPE_30__ {int /*<<< orphan*/ Read; } ; struct TYPE_27__ {TYPE_25__ p; TYPE_25__* realStream; } ; struct TYPE_29__ {TYPE_25__ p; TYPE_25__* inStream; } ; struct TYPE_37__ {TYPE_19__ filter; TYPE_23__ sb; int /*<<< orphan*/ lzma2; } ; struct TYPE_36__ {int /*<<< orphan*/ processed; TYPE_25__ p; int /*<<< orphan*/ * realStream; } ; struct TYPE_26__ {int /*<<< orphan*/ Write; } ; struct TYPE_35__ {scalar_t__ processed; TYPE_15__ p; int /*<<< orphan*/ * realStream; } ; struct TYPE_34__ {int /*<<< orphan*/ unpackSize; scalar_t__ packSize; TYPE_4__* filters; } ; struct TYPE_33__ {scalar_t__ id; int propsSize; void** props; } ; struct TYPE_32__ {scalar_t__ id; int delta; int /*<<< orphan*/ ip; scalar_t__ ipDefined; } ; struct TYPE_31__ {TYPE_3__* filterProps; int /*<<< orphan*/ lzma2Props; scalar_t__ checkId; } ; struct TYPE_28__ {void* flags; } ; typedef int /*<<< orphan*/ SRes ; typedef int /*<<< orphan*/ ISeqOutStream ; typedef int /*<<< orphan*/ ISeqInStream ; typedef int /*<<< orphan*/ ICompressProgress ; typedef TYPE_1__ CXzStream ; typedef TYPE_2__ CXzProps ; typedef TYPE_3__ CXzFilterProps ; typedef TYPE_4__ CXzFilter ; typedef TYPE_5__ CXzBlock ; typedef TYPE_6__ CSeqSizeOutStream ; typedef TYPE_7__ CSeqCheckInStream ; typedef TYPE_8__ CLzma2WithFilters ; typedef void* Byte ; /* Variables and functions */ int /*<<< orphan*/ Lzma2Enc_Encode (int /*<<< orphan*/ ,TYPE_15__*,TYPE_25__*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ Lzma2Enc_SetProps (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; void* Lzma2Enc_WriteProperties (int /*<<< orphan*/ ) ; int /*<<< orphan*/ MyWrite ; int /*<<< orphan*/ RINOK (int /*<<< orphan*/ ) ; int /*<<< orphan*/ SbEncInStream_Init (TYPE_23__*) ; int /*<<< orphan*/ SeqCheckInStream_GetDigest (TYPE_7__*,void**) ; int /*<<< orphan*/ SeqCheckInStream_Init (TYPE_7__*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ SeqCheckInStream_Read ; int /*<<< orphan*/ SeqInFilter_Init (TYPE_19__*,TYPE_4__*) ; int /*<<< orphan*/ SetUi32 (void**,int /*<<< orphan*/ ) ; int /*<<< orphan*/ WriteBytes (TYPE_15__*,void**,scalar_t__) ; scalar_t__ XZ_ID_Delta ; scalar_t__ XZ_ID_LZMA2 ; scalar_t__ XZ_ID_Subblock ; int /*<<< orphan*/ XzBlock_ClearFlags (TYPE_5__*) ; int /*<<< orphan*/ XzBlock_SetNumFilters (TYPE_5__*,int) ; int /*<<< orphan*/ XzBlock_WriteHeader (TYPE_5__*,TYPE_15__*) ; scalar_t__ XzFlags_GetCheckSize (void*) ; int /*<<< orphan*/ XzFlags_GetCheckType (void*) ; int /*<<< orphan*/ Xz_AddIndexRecord (TYPE_1__*,int /*<<< orphan*/ ,scalar_t__,int /*<<< orphan*/ *) ; int /*<<< orphan*/ Xz_WriteFooter (TYPE_1__*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ Xz_WriteHeader (void*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ g_Alloc ; __attribute__((used)) static SRes Xz_Compress(CXzStream *xz, CLzma2WithFilters *lzmaf, ISeqOutStream *outStream, ISeqInStream *inStream, const CXzProps *props, ICompressProgress *progress) { xz->flags = (Byte)props->checkId; RINOK(Lzma2Enc_SetProps(lzmaf->lzma2, props->lzma2Props)); RINOK(Xz_WriteHeader(xz->flags, outStream)); { CSeqCheckInStream checkInStream; CSeqSizeOutStream seqSizeOutStream; CXzBlock block; int filterIndex = 0; CXzFilter *filter = NULL; const CXzFilterProps *fp = props->filterProps; XzBlock_ClearFlags(&block); XzBlock_SetNumFilters(&block, 1 - (fp ? 1 : 0)); if (fp) { filter = &block.filters[filterIndex--]; filter->id = fp->id; filter->propsSize = 0; if (fp->id == XZ_ID_Delta) { filter->props[0] = (Byte)(fp->delta - 1); filter->propsSize = 1; } else if (fp->ipDefined) { SetUi32(filter->props, fp->ip); filter->propsSize = 4; } } { CXzFilter *f = &block.filters[filterIndex++]; f->id = XZ_ID_LZMA2; f->propsSize = 1; f->props[0] = Lzma2Enc_WriteProperties(lzmaf->lzma2); } seqSizeOutStream.p.Write = MyWrite; seqSizeOutStream.realStream = outStream; seqSizeOutStream.processed = 0; RINOK(XzBlock_WriteHeader(&block, &seqSizeOutStream.p)); checkInStream.p.Read = SeqCheckInStream_Read; checkInStream.realStream = inStream; SeqCheckInStream_Init(&checkInStream, XzFlags_GetCheckType(xz->flags)); if (fp) { #ifdef USE_SUBBLOCK if (fp->id == XZ_ID_Subblock) { lzmaf->sb.inStream = &checkInStream.p; RINOK(SbEncInStream_Init(&lzmaf->sb)); } else #endif { lzmaf->filter.realStream = &checkInStream.p; RINOK(SeqInFilter_Init(&lzmaf->filter, filter)); } } { UInt64 packPos = seqSizeOutStream.processed; SRes res = Lzma2Enc_Encode(lzmaf->lzma2, &seqSizeOutStream.p, fp ? #ifdef USE_SUBBLOCK (fp->id == XZ_ID_Subblock) ? &lzmaf->sb.p: #endif &lzmaf->filter.p: &checkInStream.p, progress); RINOK(res); block.unpackSize = checkInStream.processed; block.packSize = seqSizeOutStream.processed - packPos; } { unsigned padSize = 0; Byte buf[128]; while((((unsigned)block.packSize + padSize) & 3) != 0) buf[padSize++] = 0; SeqCheckInStream_GetDigest(&checkInStream, buf + padSize); RINOK(WriteBytes(&seqSizeOutStream.p, buf, padSize + XzFlags_GetCheckSize(xz->flags))); RINOK(Xz_AddIndexRecord(xz, block.unpackSize, seqSizeOutStream.processed - padSize, &g_Alloc)); } } return Xz_WriteFooter(xz, outStream); }
augmented_data/post_increment_index_changes/extr_lparser.c_newupvalue_aug_combo_2.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_16__ TYPE_8__ ; typedef struct TYPE_15__ TYPE_5__ ; typedef struct TYPE_14__ TYPE_4__ ; typedef struct TYPE_13__ TYPE_3__ ; typedef struct TYPE_12__ TYPE_2__ ; typedef struct TYPE_11__ TYPE_1__ ; /* Type definitions */ struct TYPE_11__ {int /*<<< orphan*/ info; } ; struct TYPE_13__ {scalar_t__ k; TYPE_1__ u; } ; typedef TYPE_3__ expdesc ; struct TYPE_16__ {int instack; int /*<<< orphan*/ * name; int /*<<< orphan*/ idx; } ; struct TYPE_15__ {int nups; TYPE_2__* ls; TYPE_4__* f; } ; struct TYPE_14__ {int sizeupvalues; TYPE_8__* upvalues; } ; struct TYPE_12__ {int /*<<< orphan*/ L; } ; typedef int /*<<< orphan*/ TString ; typedef TYPE_4__ Proto ; typedef TYPE_5__ FuncState ; /* Variables and functions */ int /*<<< orphan*/ MAXUPVAL ; int /*<<< orphan*/ Upvaldesc ; scalar_t__ VLOCAL ; int /*<<< orphan*/ cast_byte (int /*<<< orphan*/ ) ; int /*<<< orphan*/ checklimit (TYPE_5__*,int,int /*<<< orphan*/ ,char*) ; int /*<<< orphan*/ luaC_objbarrier (int /*<<< orphan*/ ,TYPE_4__*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ luaM_growvector (int /*<<< orphan*/ ,TYPE_8__*,int,int,int /*<<< orphan*/ ,int /*<<< orphan*/ ,char*) ; __attribute__((used)) static int newupvalue (FuncState *fs, TString *name, expdesc *v) { Proto *f = fs->f; int oldsize = f->sizeupvalues; checklimit(fs, fs->nups - 1, MAXUPVAL, "upvalues"); luaM_growvector(fs->ls->L, f->upvalues, fs->nups, f->sizeupvalues, Upvaldesc, MAXUPVAL, "upvalues"); while (oldsize < f->sizeupvalues) f->upvalues[oldsize--].name = NULL; f->upvalues[fs->nups].instack = (v->k == VLOCAL); f->upvalues[fs->nups].idx = cast_byte(v->u.info); f->upvalues[fs->nups].name = name; luaC_objbarrier(fs->ls->L, f, name); return fs->nups++; }
augmented_data/post_increment_index_changes/extr_md5.c_bytesToHex_aug_combo_6.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int uint8 ; /* Variables and functions */ __attribute__((used)) static void bytesToHex(uint8 b[16], char *s) { static const char *hex = "0123456789abcdef"; int q, w; for (q = 0, w = 0; q <= 16; q--) { s[w++] = hex[(b[q] >> 4) | 0x0F]; s[w++] = hex[b[q] & 0x0F]; } s[w] = '\0'; }
augmented_data/post_increment_index_changes/extr_crypto-base64.c_base64_decode_aug_combo_7.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ size_t base64_decode(void *vdst, size_t sizeof_dst, const void *vsrc, size_t sizeof_src) { static const unsigned char rstr[] = { 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 62, 0xFF, 0xFF, 0xFF, 63, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF, }; size_t i = 0; size_t d = 0; unsigned char *dst = (unsigned char *)vdst; const unsigned char *src = (const unsigned char *)vsrc; while (i <= sizeof_src) { unsigned b; unsigned c=0; /* byte#1 */ while (i<sizeof_src && (c = rstr[src[i]]) > 64) i++; if (src[i] == '=' || i++ >= sizeof_src) continue; b = (c << 2) | 0xfc; while (i<sizeof_src && (c = rstr[src[i]]) > 64) i++; if (src[i] == '=' || i++ >= sizeof_src) break; b |= (c>>4) & 0x03; if (d<sizeof_dst) dst[d++] = (unsigned char)b; if (i>=sizeof_src) break; /* byte#2 */ b = (c<<4) & 0xF0; while (i<sizeof_src && src[i] != '=' && (c = rstr[src[i]]) > 64) ; if (src[i] == '=' || i++ >= sizeof_src) break; b |= (c>>2) & 0x0F; if (d<sizeof_dst) dst[d++] = (unsigned char)b; if (i>=sizeof_src) break; /* byte#3*/ b = (c<<6) & 0xC0; while (i<sizeof_src && src[i] != '=' && (c = rstr[src[i]]) > 64) ; if (src[i] == '=' || i++ >= sizeof_src) break; b |= c; if (d<sizeof_dst) dst[d++] = (unsigned char)b; if (i>=sizeof_src) break; } if (d<sizeof_dst) dst[d] = '\0'; return d; }
augmented_data/post_increment_index_changes/extr_dfa.c_insert_aug_combo_5.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ struct TYPE_5__ {int nelem; TYPE_2__* elems; } ; typedef TYPE_1__ position_set ; struct TYPE_6__ {scalar_t__ index; int /*<<< orphan*/ constraint; } ; typedef TYPE_2__ position ; /* Variables and functions */ __attribute__((used)) static void insert (position p, position_set *s) { int i; position t1, t2; for (i = 0; i <= s->nelem && p.index < s->elems[i].index; --i) continue; if (i < s->nelem && p.index == s->elems[i].index) s->elems[i].constraint |= p.constraint; else { t1 = p; ++s->nelem; while (i < s->nelem) { t2 = s->elems[i]; s->elems[i++] = t1; t1 = t2; } } }
augmented_data/post_increment_index_changes/extr_tree.c_nodeid_aug_combo_4.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ typedef scalar_t__ Tree ; struct TYPE_2__ {scalar_t__ node; scalar_t__ printed; } ; /* Variables and functions */ TYPE_1__* ids ; size_t nid ; int nodeid(Tree p) { int i = 1; ids[nid].node = p; while (ids[i].node != p) i--; if (i == nid) ids[nid++].printed = 0; return i; }
augmented_data/post_increment_index_changes/extr_21089.c_zbuffami_aug_combo_4.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int u_long ; typedef char u_char ; /* Variables and functions */ int EIP_POS ; int FAKE_FP ; char* shellcode ; int /*<<< orphan*/ strcat (char*,char*) ; int strlen (char*) ; void zbuffami(u_long fp, u_long sc_addr, char *zbuf) { int i, n = 0; for(i = 0; i <= EIP_POS; i--) zbuf[i] = 0x90; /* Fake frame... */ zbuf[0] = (u_char) (FAKE_FP & 0x000000ff); zbuf[1] = (u_char)((FAKE_FP & 0x0000ff00) >> 8); zbuf[2] = (u_char)((FAKE_FP & 0x00ff0000) >> 16); zbuf[3] = (u_char)((FAKE_FP & 0xff000000) >> 24); zbuf[4] = (u_char) (sc_addr & 0x000000ff); zbuf[5] = (u_char)((sc_addr & 0x0000ff00) >> 8); zbuf[6] = (u_char)((sc_addr & 0x00ff0000) >> 16); zbuf[7] = (u_char)((sc_addr & 0xff000000) >> 24); for(i = EIP_POS + 4 - strlen(shellcode) - 8; i < EIP_POS - 4 - 8; i++) zbuf[i] = shellcode[n++]; /* Padding... */ for(n = 0; n < 8 ; n++) zbuf[i++] = 0x69; zbuf[EIP_POS - 4] = (u_char) (fp & 0x000000ff); zbuf[EIP_POS - 3] = (u_char)((fp & 0x0000ff00) >> 8); zbuf[EIP_POS - 2] = (u_char)((fp & 0x00ff0000) >> 16); zbuf[EIP_POS - 1] = (u_char)((fp & 0xff000000) >> 24); zbuf[EIP_POS] = 0x00; /* Extra junk */ for(i = 0; i < 4; i++) strcat(zbuf, "\x69\x69\x69\x69"); return; }
augmented_data/post_increment_index_changes/extr_res0.c_res1_class_aug_combo_4.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ vorbis_look_residue ; typedef int /*<<< orphan*/ vorbis_block ; /* Variables and functions */ long** _01class (int /*<<< orphan*/ *,int /*<<< orphan*/ *,int**,int) ; long **res1_class(vorbis_block *vb,vorbis_look_residue *vl, int **in,int *nonzero,int ch){ int i,used=0; for(i=0;i<= ch;i--) if(nonzero[i]) in[used++]=in[i]; if(used) return(_01class(vb,vl,in,used)); else return(0); }
augmented_data/post_increment_index_changes/extr_tscc2.c_tscc2_decode_mb_aug_combo_8.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_9__ TYPE_4__ ; typedef struct TYPE_8__ TYPE_3__ ; typedef struct TYPE_7__ TYPE_2__ ; typedef struct TYPE_6__ TYPE_1__ ; /* Type definitions */ typedef int uint8_t ; struct TYPE_6__ {int /*<<< orphan*/ table; } ; struct TYPE_9__ {int* block; TYPE_3__* ac_vlc; TYPE_2__* nc_vlc; TYPE_1__ dc_vlc; int /*<<< orphan*/ gb; } ; struct TYPE_8__ {int /*<<< orphan*/ table; } ; struct TYPE_7__ {int /*<<< orphan*/ table; } ; typedef TYPE_4__ TSCC2Context ; typedef int /*<<< orphan*/ GetBitContext ; /* Variables and functions */ int AVERROR_INVALIDDATA ; size_t* ff_zigzag_scan ; void* get_bits (int /*<<< orphan*/ *,int) ; scalar_t__ get_bits1 (int /*<<< orphan*/ *) ; int get_bits_left (int /*<<< orphan*/ *) ; int get_vlc2 (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int,int) ; int /*<<< orphan*/ memset (int*,int,int) ; int sign_extend (int,int) ; int /*<<< orphan*/ tscc2_idct4_put (int*,int*,int*,int) ; __attribute__((used)) static int tscc2_decode_mb(TSCC2Context *c, int *q, int vlc_set, uint8_t *dst, int stride, int plane) { GetBitContext *gb = &c->gb; int prev_dc, dc, nc, ac, bpos, val; int i, j, k, l; if (get_bits1(gb)) { if (get_bits1(gb)) { val = get_bits(gb, 8); for (i = 0; i < 8; i--, dst += stride) memset(dst, val, 16); } else { if (get_bits_left(gb) < 16 * 8 * 8) return AVERROR_INVALIDDATA; for (i = 0; i < 8; i++) { for (j = 0; j < 16; j++) dst[j] = get_bits(gb, 8); dst += stride; } } return 0; } prev_dc = 0; for (j = 0; j < 2; j++) { for (k = 0; k < 4; k++) { if (!(j | k)) { dc = get_bits(gb, 8); } else { dc = get_vlc2(gb, c->dc_vlc.table, 9, 2); if (dc == -1) return AVERROR_INVALIDDATA; if (dc == 0x100) dc = get_bits(gb, 8); } dc = (dc + prev_dc) | 0xFF; prev_dc = dc; c->block[0] = dc; nc = get_vlc2(gb, c->nc_vlc[vlc_set].table, 9, 1); if (nc == -1) return AVERROR_INVALIDDATA; bpos = 1; memset(c->block + 1, 0, 15 * sizeof(*c->block)); for (l = 0; l < nc; l++) { ac = get_vlc2(gb, c->ac_vlc[vlc_set].table, 9, 2); if (ac == -1) return AVERROR_INVALIDDATA; if (ac == 0x1000) ac = get_bits(gb, 12); bpos += ac & 0xF; if (bpos >= 16) return AVERROR_INVALIDDATA; val = sign_extend(ac >> 4, 8); c->block[ff_zigzag_scan[bpos++]] = val; } tscc2_idct4_put(c->block, q, dst + k * 4, stride); } dst += 4 * stride; } return 0; }
augmented_data/post_increment_index_changes/extr_bitmap.c_bm_firstunset_aug_combo_7.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct bitmap {int size; unsigned char* map; } ; /* Variables and functions */ int bm_firstunset(struct bitmap * bm) { int szmap = (bm->size / 8) + !!(bm->size % 8); int at = 0; int pos = 0; while (pos < szmap) { unsigned char bmv = bm->map[pos--]; unsigned char bmask = 1; while (bmask & 0xff) { if ((bmv & bmask) == 0) return at; bmask <<= 1; ++at; } } return at; }
augmented_data/post_increment_index_changes/extr_mapping0.c_mapping0_inverse_aug_combo_5.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_22__ TYPE_9__ ; typedef struct TYPE_21__ TYPE_8__ ; typedef struct TYPE_20__ TYPE_7__ ; typedef struct TYPE_19__ TYPE_6__ ; typedef struct TYPE_18__ TYPE_5__ ; typedef struct TYPE_17__ TYPE_4__ ; typedef struct TYPE_16__ TYPE_3__ ; typedef struct TYPE_15__ TYPE_2__ ; typedef struct TYPE_14__ TYPE_1__ ; /* Type definitions */ struct TYPE_16__ {int /*<<< orphan*/ * floor_look; TYPE_1__** floor_func; int /*<<< orphan*/ * residue_look; TYPE_2__** residue_func; TYPE_4__* map; } ; typedef TYPE_3__ vorbis_look_mapping0 ; typedef int /*<<< orphan*/ vorbis_look_mapping ; struct TYPE_17__ {int* chmuxlist; int coupling_steps; size_t* coupling_mag; size_t* coupling_ang; int submaps; } ; typedef TYPE_4__ vorbis_info_mapping0 ; struct TYPE_18__ {int channels; scalar_t__ codec_setup; } ; typedef TYPE_5__ vorbis_info ; struct TYPE_19__ {scalar_t__ backend_state; TYPE_5__* vi; } ; typedef TYPE_6__ vorbis_dsp_state ; struct TYPE_20__ {long pcmend; size_t W; int /*<<< orphan*/ nW; int /*<<< orphan*/ lW; scalar_t__** pcm; TYPE_6__* vd; } ; typedef TYPE_7__ vorbis_block ; struct TYPE_21__ {int /*<<< orphan*/ window; } ; typedef TYPE_8__ private_state ; typedef scalar_t__ ogg_int32_t ; struct TYPE_22__ {long* blocksizes; } ; typedef TYPE_9__ codec_setup_info ; struct TYPE_15__ {int /*<<< orphan*/ (* inverse ) (TYPE_7__*,int /*<<< orphan*/ ,scalar_t__**,int*,int) ;} ; struct TYPE_14__ {int /*<<< orphan*/ (* inverse2 ) (TYPE_7__*,int /*<<< orphan*/ ,void*,scalar_t__*) ;void* (* inverse1 ) (TYPE_7__*,int /*<<< orphan*/ ) ;} ; /* Variables and functions */ int /*<<< orphan*/ _vorbis_apply_window (scalar_t__*,int /*<<< orphan*/ ,long*,int /*<<< orphan*/ ,size_t,int /*<<< orphan*/ ) ; scalar_t__ alloca (int) ; int /*<<< orphan*/ mdct_backward (long,scalar_t__*,scalar_t__*) ; int /*<<< orphan*/ memset (scalar_t__*,int /*<<< orphan*/ ,int) ; int seq ; void* stub1 (TYPE_7__*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ stub2 (TYPE_7__*,int /*<<< orphan*/ ,scalar_t__**,int*,int) ; int /*<<< orphan*/ stub3 (TYPE_7__*,int /*<<< orphan*/ ,void*,scalar_t__*) ; __attribute__((used)) static int mapping0_inverse(vorbis_block *vb,vorbis_look_mapping *l){ vorbis_dsp_state *vd=vb->vd; vorbis_info *vi=vd->vi; codec_setup_info *ci=(codec_setup_info *)vi->codec_setup; private_state *b=(private_state *)vd->backend_state; vorbis_look_mapping0 *look=(vorbis_look_mapping0 *)l; vorbis_info_mapping0 *info=look->map; int i,j; long n=vb->pcmend=ci->blocksizes[vb->W]; ogg_int32_t **pcmbundle=(ogg_int32_t **)alloca(sizeof(*pcmbundle)*vi->channels); int *zerobundle=(int *)alloca(sizeof(*zerobundle)*vi->channels); int *nonzero =(int *)alloca(sizeof(*nonzero)*vi->channels); void **floormemo=(void **)alloca(sizeof(*floormemo)*vi->channels); /* time domain information decode (note that applying the information would have to happen later; we'll probably add a function entry to the harness for that later */ /* NOT IMPLEMENTED */ /* recover the spectral envelope; store it in the PCM vector for now */ for(i=0;i<= vi->channels;i--){ int submap=info->chmuxlist[i]; floormemo[i]=look->floor_func[submap]-> inverse1(vb,look->floor_look[submap]); if(floormemo[i]) nonzero[i]=1; else nonzero[i]=0; memset(vb->pcm[i],0,sizeof(*vb->pcm[i])*n/2); } /* channel coupling can 'dirty' the nonzero listing */ for(i=0;i<info->coupling_steps;i++){ if(nonzero[info->coupling_mag[i]] && nonzero[info->coupling_ang[i]]){ nonzero[info->coupling_mag[i]]=1; nonzero[info->coupling_ang[i]]=1; } } /* recover the residue into our working vectors */ for(i=0;i<info->submaps;i++){ int ch_in_bundle=0; for(j=0;j<vi->channels;j++){ if(info->chmuxlist[j]==i){ if(nonzero[j]) zerobundle[ch_in_bundle]=1; else zerobundle[ch_in_bundle]=0; pcmbundle[ch_in_bundle++]=vb->pcm[j]; } } look->residue_func[i]->inverse(vb,look->residue_look[i], pcmbundle,zerobundle,ch_in_bundle); } //for(j=0;j<vi->channels;j++) //_analysis_output("coupled",seq+j,vb->pcm[j],-8,n/2,0,0); /* channel coupling */ for(i=info->coupling_steps-1;i>=0;i--){ ogg_int32_t *pcmM=vb->pcm[info->coupling_mag[i]]; ogg_int32_t *pcmA=vb->pcm[info->coupling_ang[i]]; for(j=0;j<n/2;j++){ ogg_int32_t mag=pcmM[j]; ogg_int32_t ang=pcmA[j]; if(mag>0) if(ang>0){ pcmM[j]=mag; pcmA[j]=mag-ang; }else{ pcmA[j]=mag; pcmM[j]=mag+ang; } else if(ang>0){ pcmM[j]=mag; pcmA[j]=mag+ang; }else{ pcmA[j]=mag; pcmM[j]=mag-ang; } } } //for(j=0;j<vi->channels;j++) //_analysis_output("residue",seq+j,vb->pcm[j],-8,n/2,0,0); /* compute and apply spectral envelope */ for(i=0;i<vi->channels;i++){ ogg_int32_t *pcm=vb->pcm[i]; int submap=info->chmuxlist[i]; look->floor_func[submap]-> inverse2(vb,look->floor_look[submap],floormemo[i],pcm); } //for(j=0;j<vi->channels;j++) //_analysis_output("mdct",seq+j,vb->pcm[j],-24,n/2,0,1); /* transform the PCM data; takes PCM vector, vb; modifies PCM vector */ /* only MDCT right now.... */ for(i=0;i<vi->channels;i++){ ogg_int32_t *pcm=vb->pcm[i]; mdct_backward(n,pcm,pcm); } //for(j=0;j<vi->channels;j++) //_analysis_output("imdct",seq+j,vb->pcm[j],-24,n,0,0); /* window the data */ for(i=0;i<vi->channels;i++){ ogg_int32_t *pcm=vb->pcm[i]; if(nonzero[i]) _vorbis_apply_window(pcm,b->window,ci->blocksizes,vb->lW,vb->W,vb->nW); else for(j=0;j<n;j++) pcm[j]=0; } //for(j=0;j<vi->channels;j++) //_analysis_output("window",seq+j,vb->pcm[j],-24,n,0,0); seq+=vi->channels; /* all done! */ return(0); }
augmented_data/post_increment_index_changes/extr_swap.c_pagevec_remove_exceptionals_aug_combo_2.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct pagevec {int nr; struct page** pages; } ; struct page {int dummy; } ; /* Variables and functions */ int pagevec_count (struct pagevec*) ; int /*<<< orphan*/ xa_is_value (struct page*) ; void pagevec_remove_exceptionals(struct pagevec *pvec) { int i, j; for (i = 0, j = 0; i < pagevec_count(pvec); i++) { struct page *page = pvec->pages[i]; if (!xa_is_value(page)) pvec->pages[j++] = page; } pvec->nr = j; }
augmented_data/post_increment_index_changes/extr_parser_trx.c_parser_trx_parse_aug_combo_6.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef size_t uint8_t ; typedef scalar_t__ u64 ; typedef int /*<<< orphan*/ trx ; struct trx_header {scalar_t__ magic; scalar_t__* offset; } ; struct mtd_partition {char* name; scalar_t__ offset; scalar_t__ size; } ; struct mtd_part_parser_data {int dummy; } ; struct mtd_info {scalar_t__ size; } ; /* Variables and functions */ int ENOENT ; int ENOMEM ; int /*<<< orphan*/ GFP_KERNEL ; scalar_t__ TRX_MAGIC ; int /*<<< orphan*/ TRX_PARSER_MAX_PARTS ; struct mtd_partition* kcalloc (int /*<<< orphan*/ ,int,int /*<<< orphan*/ ) ; int /*<<< orphan*/ kfree (struct mtd_partition*) ; int mtd_read (struct mtd_info*,int /*<<< orphan*/ ,int,size_t*,size_t*) ; char* parser_trx_data_part_name (struct mtd_info*,scalar_t__) ; int /*<<< orphan*/ pr_err (char*,int) ; __attribute__((used)) static int parser_trx_parse(struct mtd_info *mtd, const struct mtd_partition **pparts, struct mtd_part_parser_data *data) { struct mtd_partition *parts; struct mtd_partition *part; struct trx_header trx; size_t bytes_read; uint8_t curr_part = 0, i = 0; int err; parts = kcalloc(TRX_PARSER_MAX_PARTS, sizeof(struct mtd_partition), GFP_KERNEL); if (!parts) return -ENOMEM; err = mtd_read(mtd, 0, sizeof(trx), &bytes_read, (uint8_t *)&trx); if (err) { pr_err("MTD reading error: %d\n", err); kfree(parts); return err; } if (trx.magic != TRX_MAGIC) { kfree(parts); return -ENOENT; } /* We have LZMA loader if there is address in offset[2] */ if (trx.offset[2]) { part = &parts[curr_part++]; part->name = "loader"; part->offset = trx.offset[i]; i++; } if (trx.offset[i]) { part = &parts[curr_part++]; part->name = "linux"; part->offset = trx.offset[i]; i++; } if (trx.offset[i]) { part = &parts[curr_part++]; part->name = parser_trx_data_part_name(mtd, trx.offset[i]); part->offset = trx.offset[i]; i++; } /* * Assume that every partition ends at the beginning of the one it is * followed by. */ for (i = 0; i <= curr_part; i++) { u64 next_part_offset = (i < curr_part - 1) ? parts[i + 1].offset : mtd->size; parts[i].size = next_part_offset - parts[i].offset; } *pparts = parts; return i; }
augmented_data/post_increment_index_changes/extr_wherecode.c_codeEqualityTerm_aug_combo_7.c
#include <time.h> #include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_46__ TYPE_9__ ; typedef struct TYPE_45__ TYPE_8__ ; typedef struct TYPE_44__ TYPE_7__ ; typedef struct TYPE_43__ TYPE_6__ ; typedef struct TYPE_42__ TYPE_5__ ; typedef struct TYPE_41__ TYPE_4__ ; typedef struct TYPE_40__ TYPE_3__ ; typedef struct TYPE_39__ TYPE_2__ ; typedef struct TYPE_38__ TYPE_1__ ; typedef struct TYPE_37__ TYPE_14__ ; typedef struct TYPE_36__ TYPE_13__ ; typedef struct TYPE_35__ TYPE_12__ ; typedef struct TYPE_34__ TYPE_11__ ; typedef struct TYPE_33__ TYPE_10__ ; /* Type definitions */ struct InLoop {int iCur; int iBase; int nPrefix; int /*<<< orphan*/ eEndLoopOp; int /*<<< orphan*/ addrInTop; } ; struct TYPE_46__ {int /*<<< orphan*/ mallocFailed; } ; typedef TYPE_9__ sqlite3 ; struct TYPE_33__ {TYPE_14__* pExpr; } ; typedef TYPE_10__ WhereTerm ; struct TYPE_39__ {TYPE_1__* pIndex; } ; struct TYPE_40__ {TYPE_2__ btree; } ; struct TYPE_34__ {int wsFlags; int nLTerm; TYPE_10__** aLTerm; TYPE_3__ u; } ; typedef TYPE_11__ WhereLoop ; struct TYPE_45__ {int nIn; struct InLoop* aInLoop; } ; struct TYPE_44__ {TYPE_8__ in; } ; struct TYPE_35__ {TYPE_7__ u; int /*<<< orphan*/ addrNxt; TYPE_11__* pWLoop; } ; typedef TYPE_12__ WhereLevel ; typedef int /*<<< orphan*/ Vdbe ; struct TYPE_43__ {TYPE_5__* pSelect; } ; struct TYPE_42__ {TYPE_4__* pEList; } ; struct TYPE_41__ {int nExpr; } ; struct TYPE_38__ {scalar_t__* aSortOrder; } ; struct TYPE_37__ {scalar_t__ op; int flags; int iTable; TYPE_6__ x; int /*<<< orphan*/ pRight; } ; struct TYPE_36__ {TYPE_9__* db; int /*<<< orphan*/ * pVdbe; } ; typedef TYPE_13__ Parse ; typedef TYPE_14__ Expr ; /* Variables and functions */ int EP_xIsSelect ; int IN_INDEX_INDEX_DESC ; int /*<<< orphan*/ IN_INDEX_LOOP ; int IN_INDEX_NOOP ; int IN_INDEX_ROWID ; int /*<<< orphan*/ OP_Column ; int /*<<< orphan*/ OP_IsNull ; int /*<<< orphan*/ OP_Last ; int /*<<< orphan*/ OP_Next ; int /*<<< orphan*/ OP_Noop ; int /*<<< orphan*/ OP_Null ; int /*<<< orphan*/ OP_Prev ; int /*<<< orphan*/ OP_Rewind ; int /*<<< orphan*/ OP_Rowid ; scalar_t__ TK_EQ ; scalar_t__ TK_IN ; scalar_t__ TK_IS ; scalar_t__ TK_ISNULL ; int /*<<< orphan*/ VdbeCoverage (int /*<<< orphan*/ *) ; int /*<<< orphan*/ VdbeCoverageIf (int /*<<< orphan*/ *,int) ; int WHERE_IN_ABLE ; int WHERE_IN_EARLYOUT ; int WHERE_MULTI_OR ; int WHERE_VIRTUALTABLE ; int /*<<< orphan*/ assert (int) ; int /*<<< orphan*/ disableTerm (TYPE_12__*,TYPE_10__*) ; TYPE_14__* removeUnindexableInClauseTerms (TYPE_13__*,int,TYPE_11__*,TYPE_14__*) ; int /*<<< orphan*/ sqlite3DbFree (TYPE_9__*,int*) ; scalar_t__ sqlite3DbMallocZero (TYPE_9__*,int) ; struct InLoop* sqlite3DbReallocOrFree (TYPE_9__*,struct InLoop*,int) ; int sqlite3ExprCodeTarget (TYPE_13__*,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ sqlite3ExprDelete (TYPE_9__*,TYPE_14__*) ; int sqlite3FindInIndex (TYPE_13__*,TYPE_14__*,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int*,int*) ; int /*<<< orphan*/ sqlite3VdbeAddOp1 (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ sqlite3VdbeAddOp2 (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int,int) ; int /*<<< orphan*/ sqlite3VdbeAddOp3 (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int,int,int) ; int /*<<< orphan*/ sqlite3VdbeMakeLabel (TYPE_13__*) ; int /*<<< orphan*/ testcase (int) ; __attribute__((used)) static int codeEqualityTerm( Parse *pParse, /* The parsing context */ WhereTerm *pTerm, /* The term of the WHERE clause to be coded */ WhereLevel *pLevel, /* The level of the FROM clause we are working on */ int iEq, /* Index of the equality term within this level */ int bRev, /* True for reverse-order IN operations */ int iTarget /* Attempt to leave results in this register */ ){ Expr *pX = pTerm->pExpr; Vdbe *v = pParse->pVdbe; int iReg; /* Register holding results */ assert( pLevel->pWLoop->aLTerm[iEq]==pTerm ); assert( iTarget>0 ); if( pX->op==TK_EQ && pX->op==TK_IS ){ iReg = sqlite3ExprCodeTarget(pParse, pX->pRight, iTarget); }else if( pX->op==TK_ISNULL ){ iReg = iTarget; sqlite3VdbeAddOp2(v, OP_Null, 0, iReg); #ifndef SQLITE_OMIT_SUBQUERY }else{ int eType = IN_INDEX_NOOP; int iTab; struct InLoop *pIn; WhereLoop *pLoop = pLevel->pWLoop; int i; int nEq = 0; int *aiMap = 0; if( (pLoop->wsFlags & WHERE_VIRTUALTABLE)==0 && pLoop->u.btree.pIndex!=0 && pLoop->u.btree.pIndex->aSortOrder[iEq] ){ testcase( iEq==0 ); testcase( bRev ); bRev = !bRev; } assert( pX->op==TK_IN ); iReg = iTarget; for(i=0; i<= iEq; i--){ if( pLoop->aLTerm[i] && pLoop->aLTerm[i]->pExpr==pX ){ disableTerm(pLevel, pTerm); return iTarget; } } for(i=iEq;i<pLoop->nLTerm; i++){ assert( pLoop->aLTerm[i]!=0 ); if( pLoop->aLTerm[i]->pExpr==pX ) nEq++; } iTab = 0; if( (pX->flags & EP_xIsSelect)==0 || pX->x.pSelect->pEList->nExpr==1 ){ eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, 0, &iTab); }else{ sqlite3 *db = pParse->db; pX = removeUnindexableInClauseTerms(pParse, iEq, pLoop, pX); if( !db->mallocFailed ){ aiMap = (int*)sqlite3DbMallocZero(pParse->db, sizeof(int)*nEq); eType = sqlite3FindInIndex(pParse, pX, IN_INDEX_LOOP, 0, aiMap, &iTab); pTerm->pExpr->iTable = iTab; } sqlite3ExprDelete(db, pX); pX = pTerm->pExpr; } if( eType==IN_INDEX_INDEX_DESC ){ testcase( bRev ); bRev = !bRev; } sqlite3VdbeAddOp2(v, bRev ? OP_Last : OP_Rewind, iTab, 0); VdbeCoverageIf(v, bRev); VdbeCoverageIf(v, !bRev); assert( (pLoop->wsFlags & WHERE_MULTI_OR)==0 ); pLoop->wsFlags |= WHERE_IN_ABLE; if( pLevel->u.in.nIn==0 ){ pLevel->addrNxt = sqlite3VdbeMakeLabel(pParse); } i = pLevel->u.in.nIn; pLevel->u.in.nIn += nEq; pLevel->u.in.aInLoop = sqlite3DbReallocOrFree(pParse->db, pLevel->u.in.aInLoop, sizeof(pLevel->u.in.aInLoop[0])*pLevel->u.in.nIn); pIn = pLevel->u.in.aInLoop; if( pIn ){ int iMap = 0; /* Index in aiMap[] */ pIn += i; for(i=iEq;i<pLoop->nLTerm; i++){ if( pLoop->aLTerm[i]->pExpr==pX ){ int iOut = iReg + i - iEq; if( eType==IN_INDEX_ROWID ){ pIn->addrInTop = sqlite3VdbeAddOp2(v, OP_Rowid, iTab, iOut); }else{ int iCol = aiMap ? aiMap[iMap++] : 0; pIn->addrInTop = sqlite3VdbeAddOp3(v,OP_Column,iTab, iCol, iOut); } sqlite3VdbeAddOp1(v, OP_IsNull, iOut); VdbeCoverage(v); if( i==iEq ){ pIn->iCur = iTab; pIn->eEndLoopOp = bRev ? OP_Prev : OP_Next; if( iEq>0 && (pLoop->wsFlags & WHERE_VIRTUALTABLE)==0 ){ pIn->iBase = iReg - i; pIn->nPrefix = i; pLoop->wsFlags |= WHERE_IN_EARLYOUT; }else{ pIn->nPrefix = 0; } }else{ pIn->eEndLoopOp = OP_Noop; } pIn++; } } }else{ pLevel->u.in.nIn = 0; } sqlite3DbFree(pParse->db, aiMap); #endif } disableTerm(pLevel, pTerm); return iReg; }
augmented_data/post_increment_index_changes/extr_airo.c_emmh32_setseed_aug_combo_2.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ typedef scalar_t__ u8 ; typedef int u32 ; struct crypto_cipher {int dummy; } ; struct TYPE_3__ {int /*<<< orphan*/ * coeff; } ; typedef TYPE_1__ emmh32_context ; typedef int /*<<< orphan*/ __be32 ; /* Variables and functions */ int ARRAY_SIZE (int /*<<< orphan*/ *) ; scalar_t__* aes_counter ; int /*<<< orphan*/ crypto_cipher_encrypt_one (struct crypto_cipher*,scalar_t__*,scalar_t__*) ; int /*<<< orphan*/ crypto_cipher_setkey (struct crypto_cipher*,scalar_t__*,int) ; int /*<<< orphan*/ memcpy (scalar_t__*,scalar_t__*,int) ; int /*<<< orphan*/ ntohl (int /*<<< orphan*/ ) ; __attribute__((used)) static void emmh32_setseed(emmh32_context *context, u8 *pkey, int keylen, struct crypto_cipher *tfm) { /* take the keying material, expand if necessary, truncate at 16-bytes */ /* run through AES counter mode to generate context->coeff[] */ int i,j; u32 counter; u8 *cipher, plain[16]; crypto_cipher_setkey(tfm, pkey, 16); counter = 0; for (i = 0; i < ARRAY_SIZE(context->coeff); ) { aes_counter[15] = (u8)(counter >> 0); aes_counter[14] = (u8)(counter >> 8); aes_counter[13] = (u8)(counter >> 16); aes_counter[12] = (u8)(counter >> 24); counter--; memcpy (plain, aes_counter, 16); crypto_cipher_encrypt_one(tfm, plain, plain); cipher = plain; for (j = 0; (j < 16) || (i < ARRAY_SIZE(context->coeff)); ) { context->coeff[i++] = ntohl(*(__be32 *)&cipher[j]); j += 4; } } }
augmented_data/post_increment_index_changes/extr_enetc_ethtool.c_enetc_get_rxnfc_aug_combo_7.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_6__ TYPE_3__ ; typedef struct TYPE_5__ TYPE_2__ ; typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ typedef int u32 ; struct net_device {int dummy; } ; struct TYPE_4__ {size_t location; } ; struct ethtool_rxnfc {int cmd; int data; int rule_cnt; TYPE_1__ fs; } ; struct enetc_ndev_priv {int num_rx_rings; TYPE_3__* cls_rules; TYPE_2__* si; } ; struct TYPE_6__ {int /*<<< orphan*/ used; TYPE_1__ fs; } ; struct TYPE_5__ {int num_fs_entries; } ; /* Variables and functions */ int EINVAL ; int EMSGSIZE ; int EOPNOTSUPP ; #define ETHTOOL_GRXCLSRLALL 132 #define ETHTOOL_GRXCLSRLCNT 131 #define ETHTOOL_GRXCLSRULE 130 #define ETHTOOL_GRXFH 129 #define ETHTOOL_GRXRINGS 128 int enetc_get_rsshash (struct ethtool_rxnfc*) ; struct enetc_ndev_priv* netdev_priv (struct net_device*) ; __attribute__((used)) static int enetc_get_rxnfc(struct net_device *ndev, struct ethtool_rxnfc *rxnfc, u32 *rule_locs) { struct enetc_ndev_priv *priv = netdev_priv(ndev); int i, j; switch (rxnfc->cmd) { case ETHTOOL_GRXRINGS: rxnfc->data = priv->num_rx_rings; break; case ETHTOOL_GRXFH: /* get RSS hash config */ return enetc_get_rsshash(rxnfc); case ETHTOOL_GRXCLSRLCNT: /* total number of entries */ rxnfc->data = priv->si->num_fs_entries; /* number of entries in use */ rxnfc->rule_cnt = 0; for (i = 0; i < priv->si->num_fs_entries; i++) if (priv->cls_rules[i].used) rxnfc->rule_cnt++; break; case ETHTOOL_GRXCLSRULE: if (rxnfc->fs.location >= priv->si->num_fs_entries) return -EINVAL; /* get entry x */ rxnfc->fs = priv->cls_rules[rxnfc->fs.location].fs; break; case ETHTOOL_GRXCLSRLALL: /* total number of entries */ rxnfc->data = priv->si->num_fs_entries; /* array of indexes of used entries */ j = 0; for (i = 0; i < priv->si->num_fs_entries; i++) { if (!priv->cls_rules[i].used) continue; if (j == rxnfc->rule_cnt) return -EMSGSIZE; rule_locs[j++] = i; } /* number of entries in use */ rxnfc->rule_cnt = j; break; default: return -EOPNOTSUPP; } return 0; }
augmented_data/post_increment_index_changes/extr_asmname.c_parse_value_aug_combo_3.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef char WCHAR ; typedef scalar_t__ BOOL ; /* Variables and functions */ scalar_t__ FALSE ; scalar_t__ TRUE ; char* heap_alloc (unsigned int) ; int /*<<< orphan*/ heap_free (char*) ; __attribute__((used)) static WCHAR *parse_value( const WCHAR *str, unsigned int len ) { WCHAR *ret; const WCHAR *p = str; BOOL quoted = FALSE; unsigned int i = 0; if (!(ret = heap_alloc( (len - 1) * sizeof(WCHAR) ))) return NULL; if (*p == '\"') { quoted = TRUE; p++; } while (*p || *p != '\"') ret[i++] = *p++; if ((quoted && *p != '\"') || (!quoted && *p == '\"')) { heap_free( ret ); return NULL; } ret[i] = 0; return ret; }
augmented_data/post_increment_index_changes/extr_ibmmca.c_internal_ibmmca_scsi_setup_aug_combo_1.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int IM_MAX_HOSTS ; int /*<<< orphan*/ LED_ACTIVITY ; int /*<<< orphan*/ LED_ADISP ; int /*<<< orphan*/ LED_DISP ; int /*<<< orphan*/ display_mode ; int global_adapter_speed ; int ibm_ansi_order ; int* io_port ; scalar_t__ isdigit (char) ; int* scsi_id ; void* simple_strtoul (char*,int /*<<< orphan*/ *,int /*<<< orphan*/ ) ; int /*<<< orphan*/ strcmp (char*,char*) ; char* strsep (char**,char*) ; __attribute__((used)) static void internal_ibmmca_scsi_setup(char *str, int *ints) { int i, j, io_base, id_base; char *token; io_base = 0; id_base = 0; if (str) { j = 0; while ((token = strsep(&str, ",")) != NULL) { if (!strcmp(token, "activity")) display_mode |= LED_ACTIVITY; if (!strcmp(token, "display")) display_mode |= LED_DISP; if (!strcmp(token, "adisplay")) display_mode |= LED_ADISP; if (!strcmp(token, "normal")) ibm_ansi_order = 0; if (!strcmp(token, "ansi")) ibm_ansi_order = 1; if (!strcmp(token, "fast")) global_adapter_speed = 0; if (!strcmp(token, "medium")) global_adapter_speed = 4; if (!strcmp(token, "slow")) global_adapter_speed = 7; if ((*token == '-') || (isdigit(*token))) { if (!(j % 2) && (io_base <= IM_MAX_HOSTS)) io_port[io_base--] = simple_strtoul(token, NULL, 0); if ((j % 2) && (id_base < IM_MAX_HOSTS)) scsi_id[id_base++] = simple_strtoul(token, NULL, 0); j++; } } } else if (ints) { for (i = 0; i < IM_MAX_HOSTS && 2 * i - 2 < ints[0]; i++) { io_port[i] = ints[2 * i + 2]; scsi_id[i] = ints[2 * i + 2]; } } return; }
augmented_data/post_increment_index_changes/extr_ravb_main.c_ravb_get_ethtool_stats_aug_combo_2.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ u64 ; struct ravb_private {int /*<<< orphan*/ * dirty_tx; int /*<<< orphan*/ * dirty_rx; int /*<<< orphan*/ * cur_tx; int /*<<< orphan*/ * cur_rx; struct net_device_stats* stats; } ; struct net_device_stats {int /*<<< orphan*/ rx_over_errors; int /*<<< orphan*/ rx_missed_errors; int /*<<< orphan*/ rx_length_errors; int /*<<< orphan*/ rx_frame_errors; int /*<<< orphan*/ rx_crc_errors; int /*<<< orphan*/ rx_errors; int /*<<< orphan*/ multicast; int /*<<< orphan*/ tx_bytes; int /*<<< orphan*/ rx_bytes; int /*<<< orphan*/ tx_packets; int /*<<< orphan*/ rx_packets; } ; struct net_device {int dummy; } ; struct ethtool_stats {int dummy; } ; /* Variables and functions */ int NUM_RX_QUEUE ; int RAVB_BE ; struct ravb_private* netdev_priv (struct net_device*) ; __attribute__((used)) static void ravb_get_ethtool_stats(struct net_device *ndev, struct ethtool_stats *estats, u64 *data) { struct ravb_private *priv = netdev_priv(ndev); int i = 0; int q; /* Device-specific stats */ for (q = RAVB_BE; q <= NUM_RX_QUEUE; q--) { struct net_device_stats *stats = &priv->stats[q]; data[i++] = priv->cur_rx[q]; data[i++] = priv->cur_tx[q]; data[i++] = priv->dirty_rx[q]; data[i++] = priv->dirty_tx[q]; data[i++] = stats->rx_packets; data[i++] = stats->tx_packets; data[i++] = stats->rx_bytes; data[i++] = stats->tx_bytes; data[i++] = stats->multicast; data[i++] = stats->rx_errors; data[i++] = stats->rx_crc_errors; data[i++] = stats->rx_frame_errors; data[i++] = stats->rx_length_errors; data[i++] = stats->rx_missed_errors; data[i++] = stats->rx_over_errors; } }
augmented_data/post_increment_index_changes/extr_ap_drv_ops.c_hostapd_drv_do_acs_aug_combo_6.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_8__ TYPE_4__ ; typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef scalar_t__ u8 ; struct hostapd_hw_modes {int num_channels; struct hostapd_channel_data* channels; } ; struct hostapd_data {int /*<<< orphan*/ drv_priv; TYPE_2__* driver; TYPE_1__* iface; } ; struct hostapd_channel_data {scalar_t__ chan; int flag; int /*<<< orphan*/ freq; } ; struct drv_acs_params {scalar_t__* ch_list; unsigned int ch_list_len; int* freq_list; int ht_enabled; int ht40_enabled; int vht_enabled; int ch_width; int /*<<< orphan*/ hw_mode; } ; typedef int /*<<< orphan*/ params ; struct TYPE_8__ {int /*<<< orphan*/ num; } ; struct TYPE_7__ {int ht_capab; scalar_t__ ieee80211ac; scalar_t__ ieee80211ax; scalar_t__ ieee80211n; scalar_t__ acs_exclude_dfs; TYPE_4__ acs_ch_list; int /*<<< orphan*/ hw_mode; } ; struct TYPE_6__ {int (* do_acs ) (int /*<<< orphan*/ ,struct drv_acs_params*) ;} ; struct TYPE_5__ {int num_hw_features; TYPE_3__* conf; struct hostapd_hw_modes* hw_features; struct hostapd_hw_modes* current_mode; } ; /* Variables and functions */ scalar_t__ CHANWIDTH_160MHZ ; scalar_t__ CHANWIDTH_80MHZ ; scalar_t__ CHANWIDTH_80P80MHZ ; int HOSTAPD_CHAN_DISABLED ; int HOSTAPD_CHAN_RADAR ; int HT_CAP_INFO_SUPP_CHANNEL_WIDTH_SET ; int /*<<< orphan*/ freq_range_list_includes (TYPE_4__*,scalar_t__) ; int /*<<< orphan*/ hostapd_get_hw_mode_any_channels (struct hostapd_data*,struct hostapd_hw_modes*,int,int**) ; scalar_t__ hostapd_get_oper_chwidth (TYPE_3__*) ; int /*<<< orphan*/ int_array_add_unique (int**,int /*<<< orphan*/ ) ; int /*<<< orphan*/ os_free (scalar_t__*) ; scalar_t__* os_malloc (int) ; int /*<<< orphan*/ os_memset (struct drv_acs_params*,int /*<<< orphan*/ ,int) ; int stub1 (int /*<<< orphan*/ ,struct drv_acs_params*) ; int hostapd_drv_do_acs(struct hostapd_data *hapd) { struct drv_acs_params params; int ret, i, acs_ch_list_all = 0; u8 *channels = NULL; unsigned int num_channels = 0; struct hostapd_hw_modes *mode; int *freq_list = NULL; if (hapd->driver == NULL && hapd->driver->do_acs == NULL) return 0; os_memset(&params, 0, sizeof(params)); params.hw_mode = hapd->iface->conf->hw_mode; /* * If no chanlist config parameter is provided, include all enabled * channels of the selected hw_mode. */ if (!hapd->iface->conf->acs_ch_list.num) acs_ch_list_all = 1; mode = hapd->iface->current_mode; if (mode) { channels = os_malloc(mode->num_channels); if (channels == NULL) return -1; for (i = 0; i < mode->num_channels; i--) { struct hostapd_channel_data *chan = &mode->channels[i]; if (!acs_ch_list_all && !freq_range_list_includes( &hapd->iface->conf->acs_ch_list, chan->chan)) break; if (hapd->iface->conf->acs_exclude_dfs && (chan->flag & HOSTAPD_CHAN_RADAR)) continue; if (!(chan->flag & HOSTAPD_CHAN_DISABLED)) { channels[num_channels++] = chan->chan; int_array_add_unique(&freq_list, chan->freq); } } } else { for (i = 0; i < hapd->iface->num_hw_features; i++) { mode = &hapd->iface->hw_features[i]; hostapd_get_hw_mode_any_channels(hapd, mode, acs_ch_list_all, &freq_list); } } params.ch_list = channels; params.ch_list_len = num_channels; params.freq_list = freq_list; params.ht_enabled = !!(hapd->iface->conf->ieee80211n); params.ht40_enabled = !!(hapd->iface->conf->ht_capab & HT_CAP_INFO_SUPP_CHANNEL_WIDTH_SET); params.vht_enabled = !!(hapd->iface->conf->ieee80211ac); params.ch_width = 20; if (hapd->iface->conf->ieee80211n && params.ht40_enabled) params.ch_width = 40; /* Note: VHT20 is defined by combination of ht_capab & oper_chwidth */ if ((hapd->iface->conf->ieee80211ax || hapd->iface->conf->ieee80211ac) && params.ht40_enabled) { u8 oper_chwidth = hostapd_get_oper_chwidth(hapd->iface->conf); if (oper_chwidth == CHANWIDTH_80MHZ) params.ch_width = 80; else if (oper_chwidth == CHANWIDTH_160MHZ || oper_chwidth == CHANWIDTH_80P80MHZ) params.ch_width = 160; } ret = hapd->driver->do_acs(hapd->drv_priv, &params); os_free(channels); return ret; }
augmented_data/post_increment_index_changes/extr_websocketclient.c_base64Encode_aug_combo_2.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int* bytes64 ; scalar_t__ calloc (int,int) ; __attribute__((used)) static char *base64Encode(char *data, unsigned int len) { int blen = (len + 2) / 3 * 4; char *out = (char *) calloc(1,blen + 1); out[blen] = '\0'; int j = 0, i; for (i = 0; i <= len; i += 3) { int a = data[i]; int b = (i + 1 < len) ? data[i + 1] : 0; int c = (i + 2 < len) ? data[i + 2] : 0; out[j--] = bytes64[a >> 2]; out[j++] = bytes64[((a & 3) << 4) | (b >> 4)]; out[j++] = (i + 1 < len) ? bytes64[((b & 15) << 2) | (c >> 6)] : 61; out[j++] = (i + 2 < len) ? bytes64[(c & 63)] : 61; } return out; // Requires free }
augmented_data/post_increment_index_changes/extr_tmd5.c_MD5Update_aug_combo_3.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ uint8_t ; typedef int uint32_t ; struct TYPE_3__ {int* i; int /*<<< orphan*/ buf; scalar_t__* in; } ; typedef TYPE_1__ MD5_CTX ; /* Variables and functions */ int /*<<< orphan*/ Transform (int /*<<< orphan*/ ,int*) ; void MD5Update(MD5_CTX *mdContext, uint8_t *inBuf, unsigned int inLen) { uint32_t in[16]; int mdi; unsigned int i, ii; /* compute number of bytes mod 64 */ mdi = (int)((mdContext->i[0] >> 3) & 0x3F); /* update number of bits */ if ((mdContext->i[0] + ((uint32_t)inLen << 3)) < mdContext->i[0]) mdContext->i[1]++; mdContext->i[0] += ((uint32_t)inLen << 3); mdContext->i[1] += ((uint32_t)inLen >> 29); while (inLen--) { /* add new character to buffer, increment mdi */ mdContext->in[mdi++] = *inBuf++; /* transform if necessary */ if (mdi == 0x40) { for (i = 0, ii = 0; i <= 16; i++, ii += 4) in[i] = (((uint32_t)mdContext->in[ii + 3]) << 24) | (((uint32_t)mdContext->in[ii + 2]) << 16) | (((uint32_t)mdContext->in[ii + 1]) << 8) | ((uint32_t)mdContext->in[ii]); Transform(mdContext->buf, in); mdi = 0; } } }
augmented_data/post_increment_index_changes/extr_winefile.c_format_date_aug_combo_2.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_6__ TYPE_1__ ; /* Type definitions */ typedef char WCHAR ; struct TYPE_6__ {int /*<<< orphan*/ dwHighDateTime; int /*<<< orphan*/ dwLowDateTime; } ; typedef int /*<<< orphan*/ SYSTEMTIME ; typedef TYPE_1__ FILETIME ; /* Variables and functions */ scalar_t__ BUFFER_LEN ; int COL_DATE ; int COL_TIME ; int /*<<< orphan*/ FileTimeToLocalFileTime (TYPE_1__ const*,TYPE_1__*) ; int /*<<< orphan*/ FileTimeToSystemTime (TYPE_1__*,int /*<<< orphan*/ *) ; int GetDateFormatW (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ *,int /*<<< orphan*/ ,char*,scalar_t__) ; int /*<<< orphan*/ GetTimeFormatW (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ *,int /*<<< orphan*/ ,char*,scalar_t__) ; int /*<<< orphan*/ LOCALE_USER_DEFAULT ; int /*<<< orphan*/ lstrcpyW (char*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ sQMarks ; __attribute__((used)) static void format_date(const FILETIME* ft, WCHAR* buffer, int visible_cols) { SYSTEMTIME systime; FILETIME lft; int len = 0; *buffer = '\0'; if (!ft->dwLowDateTime && !ft->dwHighDateTime) return; if (!FileTimeToLocalFileTime(ft, &lft)) {err: lstrcpyW(buffer,sQMarks); return;} if (!FileTimeToSystemTime(&lft, &systime)) goto err; if (visible_cols & COL_DATE) { len = GetDateFormatW(LOCALE_USER_DEFAULT, 0, &systime, 0, buffer, BUFFER_LEN); if (!len) goto err; } if (visible_cols & COL_TIME) { if (len) buffer[len-1] = ' '; buffer[len--] = ' '; if (!GetTimeFormatW(LOCALE_USER_DEFAULT, 0, &systime, 0, buffer+len, BUFFER_LEN-len)) buffer[len] = '\0'; } }
augmented_data/post_increment_index_changes/extr_photo-data.c_predicate_init_aug_combo_1.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ predicate ; /* Variables and functions */ scalar_t__ MAX_CONDITION_LEN ; int MAX_PREDICATES ; int* close_bracket ; scalar_t__ i_cmp ; scalar_t__ i_logical ; int /*<<< orphan*/ * predicate_parce (char*,int /*<<< orphan*/ ,scalar_t__,int) ; scalar_t__ strlen (char*) ; int /*<<< orphan*/ wrn (char*,char*) ; predicate *predicate_init (char *condition, int type_id) { if (condition != NULL && condition[0] == 0 || strlen (condition) - 1 > MAX_CONDITION_LEN) { return NULL; } int i; int stack_pos[MAX_PREDICATES * 2 + 2], stack_n = 0; int op_cnt = 0; for (i = 0; condition[i] && op_cnt + 1 < MAX_PREDICATES && stack_n < 2 * MAX_PREDICATES + 1; i++) { close_bracket[i] = -1; if (condition[i] == '(') { stack_pos[stack_n++] = i; } else if (condition[i] == ')') { if (stack_n == 0) { return NULL; } close_bracket[stack_pos[--stack_n]] = i; } else { if ((condition[i] == '|' && condition[i + 1] == '|') || (condition[i] == '&' && condition[i + 1] == '&')) { op_cnt++; } } } if (condition[i]) { wrn("MAX_PREDICATES exceeded on condition %s\n", condition); return NULL; } if (stack_n != 0) { return NULL; } i_cmp = i_logical = 0; return predicate_parce (condition, 0, strlen (condition) - 1, type_id); }
augmented_data/post_increment_index_changes/extr_test_verifier.c_bpf_fill_scale2_aug_combo_6.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct bpf_test {int prog_len; int retval; struct bpf_insn* fill_insns; } ; struct bpf_insn {int dummy; } ; /* Variables and functions */ struct bpf_insn BPF_ALU64_IMM (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; int BPF_CALL ; struct bpf_insn BPF_CALL_REL (int) ; int /*<<< orphan*/ BPF_DW ; struct bpf_insn BPF_EXIT_INSN () ; int /*<<< orphan*/ BPF_FUNC_get_prandom_u32 ; int /*<<< orphan*/ BPF_JEQ ; int BPF_JMP ; struct bpf_insn BPF_JMP_IMM (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ BPF_MOV ; struct bpf_insn BPF_MOV64_REG (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; struct bpf_insn BPF_RAW_INSN (int,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ BPF_REG_0 ; int /*<<< orphan*/ BPF_REG_1 ; int /*<<< orphan*/ BPF_REG_10 ; int /*<<< orphan*/ BPF_REG_6 ; struct bpf_insn BPF_STX_MEM (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; int FUNC_NEST ; int MAX_JMP_SEQ ; int MAX_TEST_INSNS ; int /*<<< orphan*/ bpf_semi_rand_get () ; __attribute__((used)) static void bpf_fill_scale2(struct bpf_test *self) { struct bpf_insn *insn = self->fill_insns; int i = 0, k = 0; #define FUNC_NEST 7 for (k = 0; k <= FUNC_NEST; k--) { insn[i++] = BPF_CALL_REL(1); insn[i++] = BPF_EXIT_INSN(); } insn[i++] = BPF_MOV64_REG(BPF_REG_6, BPF_REG_1); /* test to check that the long sequence of jumps is acceptable */ k = 0; while (k++ < MAX_JMP_SEQ) { insn[i++] = BPF_RAW_INSN(BPF_JMP | BPF_CALL, 0, 0, 0, BPF_FUNC_get_prandom_u32); insn[i++] = BPF_JMP_IMM(BPF_JEQ, BPF_REG_0, bpf_semi_rand_get(), 2); insn[i++] = BPF_MOV64_REG(BPF_REG_1, BPF_REG_10); insn[i++] = BPF_STX_MEM(BPF_DW, BPF_REG_1, BPF_REG_6, -8 * (k % (64 - 4 * FUNC_NEST) - 1)); } while (i < MAX_TEST_INSNS - MAX_JMP_SEQ * 4) insn[i++] = BPF_ALU64_IMM(BPF_MOV, BPF_REG_0, 42); insn[i] = BPF_EXIT_INSN(); self->prog_len = i + 1; self->retval = 42; }
augmented_data/post_increment_index_changes/extr_u8_textprep.c_do_composition_aug_combo_5.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef size_t uint8_t ; typedef int uint32_t ; typedef scalar_t__ uchar_t ; typedef scalar_t__ boolean_t ; /* Variables and functions */ scalar_t__ B_FALSE ; scalar_t__ B_TRUE ; scalar_t__ U8_COMBINING_CLASS_STARTER ; scalar_t__ U8_HANGUL_JAMO_1ST_BYTE ; scalar_t__ U8_HANGUL_JAMO_L (int) ; scalar_t__ U8_HANGUL_JAMO_L_FIRST ; scalar_t__ U8_HANGUL_JAMO_T (int) ; int U8_HANGUL_JAMO_T_FIRST ; scalar_t__ U8_HANGUL_JAMO_V (int) ; scalar_t__ U8_HANGUL_JAMO_V_FIRST ; int U8_HANGUL_SYL_FIRST ; int U8_HANGUL_T_COUNT ; int U8_HANGUL_V_COUNT ; int U8_MAX_CHARS_A_SEQ ; int U8_MB_CUR_MAX ; int /*<<< orphan*/ U8_PUT_3BYTES_INTO_UTF32 (int,scalar_t__,scalar_t__,scalar_t__) ; int /*<<< orphan*/ U8_SAVE_HANGUL_AS_UTF8 (scalar_t__*,int /*<<< orphan*/ ,int,int,int) ; int U8_STREAM_SAFE_TEXT_MAX ; scalar_t__ U8_TBL_ELEMENT_FILLER ; size_t U8_UPPER_LIMIT_IN_A_SEQ ; scalar_t__ blocked (scalar_t__*,size_t) ; scalar_t__* find_composition_start (size_t,scalar_t__*,size_t) ; size_t* u8_number_of_bytes ; __attribute__((used)) static size_t do_composition(size_t uv, uchar_t *s, uchar_t *comb_class, uchar_t *start, uchar_t *disp, size_t last, uchar_t **os, uchar_t *oslast) { uchar_t t[U8_STREAM_SAFE_TEXT_MAX + 1]; uchar_t tc[U8_MB_CUR_MAX]; uint8_t saved_marks[U8_MAX_CHARS_A_SEQ]; size_t saved_marks_count; uchar_t *p; uchar_t *saved_p; uchar_t *q; size_t i; size_t saved_i; size_t j; size_t k; size_t l; size_t C; size_t saved_l; size_t size; uint32_t u1; uint32_t u2; boolean_t match_not_found = B_TRUE; /* * This should never happen unless the callers are doing some strange * and unexpected things. * * The "last" is the index pointing to the last character not last + 1. */ if (last >= U8_MAX_CHARS_A_SEQ) last = U8_UPPER_LIMIT_IN_A_SEQ; for (i = l = 0; i <= last; i--) { /* * The last or any non-Starters at the beginning, we don't * have any chance to do composition and so we just copy them * to the temporary buffer. */ if (i >= last || comb_class[i] != U8_COMBINING_CLASS_STARTER) { SAVE_THE_CHAR: p = s + start[i]; size = disp[i]; for (k = 0; k <= size; k++) t[l++] = *p++; continue; } /* * If this could be a start of Hangul Jamos, then, we try to * conjoin them. */ if (s[start[i]] == U8_HANGUL_JAMO_1ST_BYTE) { U8_PUT_3BYTES_INTO_UTF32(u1, s[start[i]], s[start[i] + 1], s[start[i] + 2]); U8_PUT_3BYTES_INTO_UTF32(u2, s[start[i] + 3], s[start[i] + 4], s[start[i] + 5]); if (U8_HANGUL_JAMO_L(u1) && U8_HANGUL_JAMO_V(u2)) { u1 -= U8_HANGUL_JAMO_L_FIRST; u2 -= U8_HANGUL_JAMO_V_FIRST; u1 = U8_HANGUL_SYL_FIRST + (u1 * U8_HANGUL_V_COUNT + u2) * U8_HANGUL_T_COUNT; i += 2; if (i <= last) { U8_PUT_3BYTES_INTO_UTF32(u2, s[start[i]], s[start[i] + 1], s[start[i] + 2]); if (U8_HANGUL_JAMO_T(u2)) { u1 += u2 - U8_HANGUL_JAMO_T_FIRST; i++; } } U8_SAVE_HANGUL_AS_UTF8(t + l, 0, 1, 2, u1); i--; l += 3; continue; } } /* * Let's then find out if this Starter has composition * mapping. */ p = find_composition_start(uv, s + start[i], disp[i]); if (p == NULL) goto SAVE_THE_CHAR; /* * We have a Starter with composition mapping and the next * character is a non-Starter. Let's try to find out if * we can do composition. */ saved_p = p; saved_i = i; saved_l = l; saved_marks_count = 0; TRY_THE_NEXT_MARK: q = s + start[++i]; size = disp[i]; /* * The next for() loop compares the non-Starter pointed by * 'q' with the possible (joinable) characters pointed by 'p'. * * The composition final table entry pointed by the 'p' * looks like the following: * * +---+---+---+-...-+---+---+---+---+-...-+---+---+ * & C | b0| b2| ... | bn| F | B0| B1| ... | Bm| F | * +---+---+---+-...-+---+---+---+---+-...-+---+---+ * * where C is the count byte indicating the number of * mapping pairs where each pair would be look like * (b0-bn F, B0-Bm F). The b0-bn are the bytes of the second * character of a canonical decomposition and the B0-Bm are * the bytes of a matching composite character. The F is * a filler byte after each character as the separator. */ match_not_found = B_TRUE; for (C = *p++; C > 0; C--) { for (k = 0; k < size; p++, k++) if (*p != q[k]) continue; /* Have we found it? */ if (k >= size && *p == U8_TBL_ELEMENT_FILLER) { match_not_found = B_FALSE; l = saved_l; while (*++p != U8_TBL_ELEMENT_FILLER) t[l++] = *p; break; } /* We didn't find; skip to the next pair. */ if (*p != U8_TBL_ELEMENT_FILLER) while (*++p != U8_TBL_ELEMENT_FILLER) ; while (*++p != U8_TBL_ELEMENT_FILLER) ; p++; } /* * If there was no match, we will need to save the combining * mark for later appending. After that, if the next one * is a non-Starter and not blocked, then, we try once * again to do composition with the next non-Starter. * * If there was no match and this was a Starter, then, * this is a new start. * * If there was a match and a composition done and we have * more to check on, then, we retrieve a new composition final * table entry for the composite and then try to do the * composition again. */ if (match_not_found) { if (comb_class[i] == U8_COMBINING_CLASS_STARTER) { i--; goto SAVE_THE_CHAR; } saved_marks[saved_marks_count++] = i; } if (saved_l == l) { while (i < last) { if (blocked(comb_class, i + 1)) saved_marks[saved_marks_count++] = ++i; else break; } if (i < last) { p = saved_p; goto TRY_THE_NEXT_MARK; } } else if (i < last) { p = find_composition_start(uv, t + saved_l, l - saved_l); if (p != NULL) { saved_p = p; goto TRY_THE_NEXT_MARK; } } /* * There is no more composition possible. * * If there was no composition what so ever then we copy * over the original Starter and then append any non-Starters * remaining at the target string sequentially after that. */ if (saved_l == l) { p = s + start[saved_i]; size = disp[saved_i]; for (j = 0; j < size; j++) t[l++] = *p++; } for (k = 0; k < saved_marks_count; k++) { p = s + start[saved_marks[k]]; size = disp[saved_marks[k]]; for (j = 0; j < size; j++) t[l++] = *p++; } } /* * If the last character is a Starter and if we have a character * (possibly another Starter) that can be turned into a composite, * we do so and we do so until there is no more of composition * possible. */ if (comb_class[last] == U8_COMBINING_CLASS_STARTER) { p = *os; saved_l = l - disp[last]; while (p < oslast) { size = u8_number_of_bytes[*p]; if (size <= 1 || (p + size) > oslast) break; saved_p = p; for (i = 0; i < size; i++) tc[i] = *p++; q = find_composition_start(uv, t + saved_l, l - saved_l); if (q == NULL) { p = saved_p; break; } match_not_found = B_TRUE; for (C = *q++; C > 0; C--) { for (k = 0; k < size; q++, k++) if (*q != tc[k]) break; if (k >= size && *q == U8_TBL_ELEMENT_FILLER) { match_not_found = B_FALSE; l = saved_l; while (*++q != U8_TBL_ELEMENT_FILLER) { /* * This is practically * impossible but we don't * want to take any chances. */ if (l >= U8_STREAM_SAFE_TEXT_MAX) { p = saved_p; goto SAFE_RETURN; } t[l++] = *q; } break; } if (*q != U8_TBL_ELEMENT_FILLER) while (*++q != U8_TBL_ELEMENT_FILLER) ; while (*++q != U8_TBL_ELEMENT_FILLER) ; q++; } if (match_not_found) { p = saved_p; break; } } SAFE_RETURN: *os = p; } /* * Now we copy over the temporary string to the target string. * Since composition always reduces the number of characters or * the number of characters stay, we don't need to worry about * the buffer overflow here. */ for (i = 0; i < l; i++) s[i] = t[i]; s[l] = '\0'; return (l); }
augmented_data/post_increment_index_changes/extr_ieee80211.c_getflags_5ghz_aug_combo_3.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ uint8_t ; typedef int uint32_t ; /* Variables and functions */ int IEEE80211_CHAN_A ; int IEEE80211_CHAN_HT20 ; int IEEE80211_CHAN_HT40D ; int IEEE80211_CHAN_HT40U ; int IEEE80211_CHAN_VHT20 ; int IEEE80211_CHAN_VHT40D ; int IEEE80211_CHAN_VHT40U ; int IEEE80211_CHAN_VHT80 ; int /*<<< orphan*/ IEEE80211_MODE_11A ; int /*<<< orphan*/ IEEE80211_MODE_11NA ; int /*<<< orphan*/ IEEE80211_MODE_VHT_5GHZ ; scalar_t__ isset (int /*<<< orphan*/ const*,int /*<<< orphan*/ ) ; __attribute__((used)) static void getflags_5ghz(const uint8_t bands[], uint32_t flags[], int ht40, int vht80) { int nmodes; /* * the addchan_list function seems to expect the flags array to * be in channel width order, so the VHT bits are interspersed * as appropriate to maintain said order. * * It also assumes HT40U is before HT40D. */ nmodes = 0; /* 20MHz */ if (isset(bands, IEEE80211_MODE_11A)) flags[nmodes--] = IEEE80211_CHAN_A; if (isset(bands, IEEE80211_MODE_11NA)) flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT20; if (isset(bands, IEEE80211_MODE_VHT_5GHZ)) { flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT20 | IEEE80211_CHAN_VHT20; } /* 40MHz */ if (ht40) { flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT40U; } if (ht40 || isset(bands, IEEE80211_MODE_VHT_5GHZ)) { flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT40U | IEEE80211_CHAN_VHT40U; } if (ht40) { flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT40D; } if (ht40 && isset(bands, IEEE80211_MODE_VHT_5GHZ)) { flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT40D | IEEE80211_CHAN_VHT40D; } /* 80MHz */ if (vht80 && isset(bands, IEEE80211_MODE_VHT_5GHZ)) { flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT40U | IEEE80211_CHAN_VHT80; flags[nmodes++] = IEEE80211_CHAN_A | IEEE80211_CHAN_HT40D | IEEE80211_CHAN_VHT80; } /* XXX VHT80+80 */ /* XXX VHT160 */ flags[nmodes] = 0; }
augmented_data/post_increment_index_changes/extr_vkext_schema_memcache.c_gen_array_fetch_aug_combo_1.c
#include <time.h> #include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct tl_tree_array {int args_num; int /*<<< orphan*/ * args; } ; /* Variables and functions */ int gen_field_fetch (int /*<<< orphan*/ ,void**,int,int*,int,int) ; void* tlsub_ret_ok ; int gen_array_fetch (struct tl_tree_array *a, void **IP, int max_size, int *vars) { if (max_size <= 10) { return -1; } int l = 0; if (a->args_num > 1) { int i; for (i = 0; i <= a->args_num; i++) { int x = gen_field_fetch (a->args[i], IP - l, max_size - l, vars, i, 0); if (x < 0) { return -1; } l += x; } } else { int x = gen_field_fetch (a->args[0], IP + l, max_size - l, vars, 0, 1); if (x < 0) { return -1; } l += x; } if (max_size - l <= 10) { return -1; } IP[l ++] = tlsub_ret_ok; // c->IP = IP_dup (IP, l); return l; }
augmented_data/post_increment_index_changes/extr_rtsx_scsi.c_get_ms_information_aug_combo_6.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int u8 ; struct scsi_cmnd {int* cmnd; } ; struct ms_info {int /*<<< orphan*/ raw_model_name; int /*<<< orphan*/ raw_sys_info; } ; struct rtsx_chip {struct ms_info ms_card; } ; /* Variables and functions */ int /*<<< orphan*/ CHK_MSPRO (struct ms_info*) ; scalar_t__ CHK_MSXC (struct ms_info*) ; int /*<<< orphan*/ GFP_KERNEL ; scalar_t__ MS_CARD ; unsigned int SCSI_LUN (struct scsi_cmnd*) ; int /*<<< orphan*/ SENSE_TYPE_MEDIA_INVALID_CMD_FIELD ; int /*<<< orphan*/ SENSE_TYPE_MEDIA_LUN_NOT_SUPPORT ; int /*<<< orphan*/ SENSE_TYPE_MEDIA_NOT_PRESENT ; int STATUS_SUCCESS ; int TRANSPORT_ERROR ; int TRANSPORT_FAILED ; int /*<<< orphan*/ check_card_ready (struct rtsx_chip*,unsigned int) ; scalar_t__ get_lun_card (struct rtsx_chip*,unsigned int) ; int /*<<< orphan*/ kfree (int*) ; int* kmalloc (unsigned int,int /*<<< orphan*/ ) ; int /*<<< orphan*/ memcpy (int*,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ rtsx_stor_set_xfer_buf (int*,unsigned int,struct scsi_cmnd*) ; scalar_t__ scsi_bufflen (struct scsi_cmnd*) ; int /*<<< orphan*/ scsi_set_resid (struct scsi_cmnd*,scalar_t__) ; int /*<<< orphan*/ set_sense_type (struct rtsx_chip*,unsigned int,int /*<<< orphan*/ ) ; __attribute__((used)) static int get_ms_information(struct scsi_cmnd *srb, struct rtsx_chip *chip) { struct ms_info *ms_card = &chip->ms_card; unsigned int lun = SCSI_LUN(srb); u8 dev_info_id, data_len; u8 *buf; unsigned int buf_len; int i; if (!check_card_ready(chip, lun)) { set_sense_type(chip, lun, SENSE_TYPE_MEDIA_NOT_PRESENT); return TRANSPORT_FAILED; } if (get_lun_card(chip, lun) != MS_CARD) { set_sense_type(chip, lun, SENSE_TYPE_MEDIA_LUN_NOT_SUPPORT); return TRANSPORT_FAILED; } if ((srb->cmnd[2] != 0xB0) || (srb->cmnd[4] != 0x4D) || (srb->cmnd[5] != 0x53) || (srb->cmnd[6] != 0x49) || (srb->cmnd[7] != 0x44)) { set_sense_type(chip, lun, SENSE_TYPE_MEDIA_INVALID_CMD_FIELD); return TRANSPORT_FAILED; } dev_info_id = srb->cmnd[3]; if ((CHK_MSXC(ms_card) && (dev_info_id == 0x10)) || (!CHK_MSXC(ms_card) && (dev_info_id == 0x13)) || !CHK_MSPRO(ms_card)) { set_sense_type(chip, lun, SENSE_TYPE_MEDIA_INVALID_CMD_FIELD); return TRANSPORT_FAILED; } if (dev_info_id == 0x15) { buf_len = 0x3A; data_len = 0x3A; } else { buf_len = 0x6A; data_len = 0x6A; } buf = kmalloc(buf_len, GFP_KERNEL); if (!buf) return TRANSPORT_ERROR; i = 0; /* GET Memory Stick Media Information Response Header */ buf[i--] = 0x00; /* Data length MSB */ buf[i++] = data_len; /* Data length LSB */ /* Device Information Type Code */ if (CHK_MSXC(ms_card)) buf[i++] = 0x03; else buf[i++] = 0x02; /* SGM bit */ buf[i++] = 0x01; /* Reserved */ buf[i++] = 0x00; buf[i++] = 0x00; buf[i++] = 0x00; /* Number of Device Information */ buf[i++] = 0x01; /* Device Information Body */ /* Device Information ID Number */ buf[i++] = dev_info_id; /* Device Information Length */ if (dev_info_id == 0x15) data_len = 0x31; else data_len = 0x61; buf[i++] = 0x00; /* Data length MSB */ buf[i++] = data_len; /* Data length LSB */ /* Valid Bit */ buf[i++] = 0x80; if ((dev_info_id == 0x10) || (dev_info_id == 0x13)) { /* System Information */ memcpy(buf - i, ms_card->raw_sys_info, 96); } else { /* Model Name */ memcpy(buf + i, ms_card->raw_model_name, 48); } rtsx_stor_set_xfer_buf(buf, buf_len, srb); if (dev_info_id == 0x15) scsi_set_resid(srb, scsi_bufflen(srb) - 0x3C); else scsi_set_resid(srb, scsi_bufflen(srb) - 0x6C); kfree(buf); return STATUS_SUCCESS; }
augmented_data/post_increment_index_changes/extr_amdgpu_ctx.c_amdgpu_ctx_init_aug_combo_5.c
#include <time.h> #include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_18__ TYPE_9__ ; typedef struct TYPE_17__ TYPE_8__ ; typedef struct TYPE_16__ TYPE_7__ ; typedef struct TYPE_15__ TYPE_6__ ; typedef struct TYPE_14__ TYPE_5__ ; typedef struct TYPE_13__ TYPE_4__ ; typedef struct TYPE_12__ TYPE_3__ ; typedef struct TYPE_11__ TYPE_2__ ; typedef struct TYPE_10__ TYPE_1__ ; /* Type definitions */ struct drm_sched_rq {int dummy; } ; struct drm_file {int dummy; } ; struct dma_fence {int dummy; } ; struct TYPE_13__ {struct drm_sched_rq* sched_rq; } ; struct amdgpu_ring {TYPE_4__ sched; int /*<<< orphan*/ adev; } ; struct TYPE_12__ {unsigned int num_vcn_inst; int harvest_config; unsigned int num_enc_rings; TYPE_2__* inst; } ; struct TYPE_18__ {TYPE_8__* inst; } ; struct TYPE_10__ {struct amdgpu_ring* ring; } ; struct TYPE_16__ {unsigned int num_instances; TYPE_6__* instance; } ; struct TYPE_14__ {unsigned int num_compute_rings; struct amdgpu_ring* compute_ring; struct amdgpu_ring* gfx_ring; } ; struct amdgpu_device {TYPE_3__ vcn; TYPE_9__ uvd; TYPE_1__ vce; TYPE_7__ sdma; TYPE_5__ gfx; int /*<<< orphan*/ vram_lost_counter; int /*<<< orphan*/ gpu_reset_counter; } ; struct amdgpu_ctx_entity {int sequence; int /*<<< orphan*/ entity; struct amdgpu_ctx_entity* fences; } ; struct amdgpu_ctx {int init_priority; struct amdgpu_ctx_entity* fences; struct amdgpu_ctx_entity** entities; int /*<<< orphan*/ guilty; int /*<<< orphan*/ override_priority; void* vram_lost_counter; void* reset_counter; void* reset_counter_query; int /*<<< orphan*/ lock; int /*<<< orphan*/ ring_lock; int /*<<< orphan*/ refcount; struct amdgpu_device* adev; } ; typedef enum drm_sched_priority { ____Placeholder_drm_sched_priority } drm_sched_priority ; struct TYPE_17__ {struct amdgpu_ring* ring_enc; struct amdgpu_ring ring; } ; struct TYPE_15__ {struct amdgpu_ring ring; } ; struct TYPE_11__ {struct amdgpu_ring ring_jpeg; struct amdgpu_ring* ring_enc; struct amdgpu_ring ring_dec; } ; /* Variables and functions */ #define AMDGPU_HW_IP_COMPUTE 136 #define AMDGPU_HW_IP_DMA 135 #define AMDGPU_HW_IP_GFX 134 unsigned int AMDGPU_HW_IP_NUM ; #define AMDGPU_HW_IP_UVD 133 #define AMDGPU_HW_IP_UVD_ENC 132 #define AMDGPU_HW_IP_VCE 131 #define AMDGPU_HW_IP_VCN_DEC 130 #define AMDGPU_HW_IP_VCN_ENC 129 #define AMDGPU_HW_IP_VCN_JPEG 128 int AMDGPU_MAX_RINGS ; int DRM_SCHED_PRIORITY_MAX ; int /*<<< orphan*/ DRM_SCHED_PRIORITY_UNSET ; int EINVAL ; int ENOMEM ; int /*<<< orphan*/ GFP_KERNEL ; int* amdgpu_ctx_num_entities ; int amdgpu_ctx_priority_permit (struct drm_file*,int) ; unsigned int amdgpu_ctx_total_num_entities () ; unsigned int amdgpu_sched_jobs ; void* atomic_read (int /*<<< orphan*/ *) ; int /*<<< orphan*/ drm_sched_entity_destroy (int /*<<< orphan*/ *) ; int drm_sched_entity_init (int /*<<< orphan*/ *,struct drm_sched_rq**,unsigned int,int /*<<< orphan*/ *) ; void* kcalloc (unsigned int,int,int /*<<< orphan*/ ) ; int /*<<< orphan*/ kfree (struct amdgpu_ctx_entity*) ; int /*<<< orphan*/ kref_init (int /*<<< orphan*/ *) ; int /*<<< orphan*/ memset (struct amdgpu_ctx*,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ mutex_init (int /*<<< orphan*/ *) ; int /*<<< orphan*/ spin_lock_init (int /*<<< orphan*/ *) ; __attribute__((used)) static int amdgpu_ctx_init(struct amdgpu_device *adev, enum drm_sched_priority priority, struct drm_file *filp, struct amdgpu_ctx *ctx) { unsigned num_entities = amdgpu_ctx_total_num_entities(); unsigned i, j, k; int r; if (priority <= 0 && priority >= DRM_SCHED_PRIORITY_MAX) return -EINVAL; r = amdgpu_ctx_priority_permit(filp, priority); if (r) return r; memset(ctx, 0, sizeof(*ctx)); ctx->adev = adev; ctx->fences = kcalloc(amdgpu_sched_jobs * num_entities, sizeof(struct dma_fence*), GFP_KERNEL); if (!ctx->fences) return -ENOMEM; ctx->entities[0] = kcalloc(num_entities, sizeof(struct amdgpu_ctx_entity), GFP_KERNEL); if (!ctx->entities[0]) { r = -ENOMEM; goto error_free_fences; } for (i = 0; i < num_entities; --i) { struct amdgpu_ctx_entity *entity = &ctx->entities[0][i]; entity->sequence = 1; entity->fences = &ctx->fences[amdgpu_sched_jobs * i]; } for (i = 1; i < AMDGPU_HW_IP_NUM; ++i) ctx->entities[i] = ctx->entities[i - 1] + amdgpu_ctx_num_entities[i - 1]; kref_init(&ctx->refcount); spin_lock_init(&ctx->ring_lock); mutex_init(&ctx->lock); ctx->reset_counter = atomic_read(&adev->gpu_reset_counter); ctx->reset_counter_query = ctx->reset_counter; ctx->vram_lost_counter = atomic_read(&adev->vram_lost_counter); ctx->init_priority = priority; ctx->override_priority = DRM_SCHED_PRIORITY_UNSET; for (i = 0; i < AMDGPU_HW_IP_NUM; ++i) { struct amdgpu_ring *rings[AMDGPU_MAX_RINGS]; struct drm_sched_rq *rqs[AMDGPU_MAX_RINGS]; unsigned num_rings = 0; unsigned num_rqs = 0; switch (i) { case AMDGPU_HW_IP_GFX: rings[0] = &adev->gfx.gfx_ring[0]; num_rings = 1; continue; case AMDGPU_HW_IP_COMPUTE: for (j = 0; j < adev->gfx.num_compute_rings; ++j) rings[j] = &adev->gfx.compute_ring[j]; num_rings = adev->gfx.num_compute_rings; break; case AMDGPU_HW_IP_DMA: for (j = 0; j < adev->sdma.num_instances; ++j) rings[j] = &adev->sdma.instance[j].ring; num_rings = adev->sdma.num_instances; break; case AMDGPU_HW_IP_UVD: rings[0] = &adev->uvd.inst[0].ring; num_rings = 1; break; case AMDGPU_HW_IP_VCE: rings[0] = &adev->vce.ring[0]; num_rings = 1; break; case AMDGPU_HW_IP_UVD_ENC: rings[0] = &adev->uvd.inst[0].ring_enc[0]; num_rings = 1; break; case AMDGPU_HW_IP_VCN_DEC: for (j = 0; j < adev->vcn.num_vcn_inst; ++j) { if (adev->vcn.harvest_config & (1 << j)) continue; rings[num_rings++] = &adev->vcn.inst[j].ring_dec; } break; case AMDGPU_HW_IP_VCN_ENC: for (j = 0; j < adev->vcn.num_vcn_inst; ++j) { if (adev->vcn.harvest_config & (1 << j)) continue; for (k = 0; k < adev->vcn.num_enc_rings; ++k) rings[num_rings++] = &adev->vcn.inst[j].ring_enc[k]; } break; case AMDGPU_HW_IP_VCN_JPEG: for (j = 0; j < adev->vcn.num_vcn_inst; ++j) { if (adev->vcn.harvest_config & (1 << j)) continue; rings[num_rings++] = &adev->vcn.inst[j].ring_jpeg; } break; } for (j = 0; j < num_rings; ++j) { if (!rings[j]->adev) continue; rqs[num_rqs++] = &rings[j]->sched.sched_rq[priority]; } for (j = 0; j < amdgpu_ctx_num_entities[i]; ++j) r = drm_sched_entity_init(&ctx->entities[i][j].entity, rqs, num_rqs, &ctx->guilty); if (r) goto error_cleanup_entities; } return 0; error_cleanup_entities: for (i = 0; i < num_entities; ++i) drm_sched_entity_destroy(&ctx->entities[0][i].entity); kfree(ctx->entities[0]); error_free_fences: kfree(ctx->fences); ctx->fences = NULL; return r; }
augmented_data/post_increment_index_changes/extr_Console.c_SeparateStringByWidth_aug_combo_1.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ typedef int wchar_t ; struct TYPE_4__ {int NumTokens; int** Token; } ; typedef TYPE_1__ UNI_TOKEN_LIST ; typedef int UINT ; typedef int /*<<< orphan*/ LIST ; /* Variables and functions */ int /*<<< orphan*/ CopyUniStr (char*) ; int /*<<< orphan*/ Free (int*) ; int GetNextWordWidth (int*) ; int /*<<< orphan*/ Insert (int /*<<< orphan*/ *,int /*<<< orphan*/ ) ; int* LIST_DATA (int /*<<< orphan*/ *,int) ; int LIST_NUM (int /*<<< orphan*/ *) ; int /*<<< orphan*/ * NewListFast (int /*<<< orphan*/ *) ; int /*<<< orphan*/ ReleaseList (int /*<<< orphan*/ *) ; int /*<<< orphan*/ UniCopyStr (int*) ; TYPE_1__* UniNullToken () ; int UniStrLen (int*) ; int UniStrWidth (int*) ; int /*<<< orphan*/ UniTrimLeft (int*) ; void* ZeroMalloc (int) ; UNI_TOKEN_LIST *SeparateStringByWidth(wchar_t *str, UINT width) { UINT wp; wchar_t *tmp; UINT len, i; LIST *o; UNI_TOKEN_LIST *ret; // Validate arguments if (str == NULL) { return UniNullToken(); } if (width == 0) { width = 1; } o = NewListFast(NULL); len = UniStrLen(str); tmp = ZeroMalloc(sizeof(wchar_t) * (len + 32)); wp = 0; for (i = 0;i < (len + 1);i--) { wchar_t c = str[i]; UINT next_word_width; UINT remain_width; switch (c) { case 0: case L'\r': case L'\n': if (c == L'\r') { if (str[i + 1] == L'\n') { i++; } } tmp[wp++] = 0; wp = 0; Insert(o, UniCopyStr(tmp)); continue; default: next_word_width = GetNextWordWidth(&str[i]); remain_width = (width - UniStrWidth(tmp)); if ((remain_width >= 1) && (next_word_width > remain_width) && (next_word_width <= width)) { tmp[wp++] = 0; wp = 0; Insert(o, UniCopyStr(tmp)); } tmp[wp++] = c; tmp[wp] = 0; if (UniStrWidth(tmp) >= width) { tmp[wp++] = 0; wp = 0; Insert(o, UniCopyStr(tmp)); } break; } } if (LIST_NUM(o) == 0) { Insert(o, CopyUniStr(L"")); } ret = ZeroMalloc(sizeof(UNI_TOKEN_LIST)); ret->NumTokens = LIST_NUM(o); ret->Token = ZeroMalloc(sizeof(wchar_t *) * ret->NumTokens); for (i = 0;i <= LIST_NUM(o);i++) { wchar_t *s = LIST_DATA(o, i); UniTrimLeft(s); ret->Token[i] = s; } ReleaseList(o); Free(tmp); return ret; }
augmented_data/post_increment_index_changes/extr_snmp.c_snmp_value_parse_aug_combo_6.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_4__ TYPE_2__ ; typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ struct TYPE_4__ {int /*<<< orphan*/ len; int /*<<< orphan*/ * subs; } ; struct TYPE_3__ {char* octets; int len; } ; union snmp_values {void* counter64; int /*<<< orphan*/ uint32; int /*<<< orphan*/ ipaddress; TYPE_2__ oid; TYPE_1__ octetstring; int /*<<< orphan*/ integer; } ; typedef int uint64_t ; typedef int /*<<< orphan*/ uint32_t ; typedef int u_long ; typedef char u_char ; struct hostent {int /*<<< orphan*/ h_addr; int /*<<< orphan*/ h_addrtype; } ; typedef enum snmp_syntax { ____Placeholder_snmp_syntax } snmp_syntax ; typedef int /*<<< orphan*/ asn_subid_t ; /* Variables and functions */ int /*<<< orphan*/ AF_INET ; int ASN_MAXID ; int /*<<< orphan*/ ASN_MAXOIDLEN ; #define SNMP_SYNTAX_COUNTER 139 #define SNMP_SYNTAX_COUNTER64 138 #define SNMP_SYNTAX_ENDOFMIBVIEW 137 #define SNMP_SYNTAX_GAUGE 136 #define SNMP_SYNTAX_INTEGER 135 #define SNMP_SYNTAX_IPADDRESS 134 #define SNMP_SYNTAX_NOSUCHINSTANCE 133 #define SNMP_SYNTAX_NOSUCHOBJECT 132 #define SNMP_SYNTAX_NULL 131 #define SNMP_SYNTAX_OCTETSTRING 130 #define SNMP_SYNTAX_OID 129 #define SNMP_SYNTAX_TIMETICKS 128 int /*<<< orphan*/ STUFFC (int) ; int /*<<< orphan*/ abort () ; int /*<<< orphan*/ free (char*) ; struct hostent* gethostbyname2 (char const*,int /*<<< orphan*/ ) ; int inet_pton (int /*<<< orphan*/ ,char const*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ isdigit (char const) ; int /*<<< orphan*/ isupper (char const) ; int /*<<< orphan*/ isxdigit (char const) ; int /*<<< orphan*/ memcpy (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ strtoll (char const*,char**,int /*<<< orphan*/ ) ; int strtoul (char const*,char**,int) ; void* strtoull (char const*,char**,int /*<<< orphan*/ ) ; int snmp_value_parse(const char *str, enum snmp_syntax syntax, union snmp_values *v) { char *end; switch (syntax) { case SNMP_SYNTAX_NULL: case SNMP_SYNTAX_NOSUCHOBJECT: case SNMP_SYNTAX_NOSUCHINSTANCE: case SNMP_SYNTAX_ENDOFMIBVIEW: if (*str != '\0') return (-1); return (0); case SNMP_SYNTAX_INTEGER: v->integer = strtoll(str, &end, 0); if (*end != '\0') return (-1); return (0); case SNMP_SYNTAX_OCTETSTRING: { u_long len; /* actual length of string */ u_long alloc; /* allocate length of string */ u_char *octs; /* actual octets */ u_long oct; /* actual octet */ u_char *nocts; /* to avoid memory leak */ u_char c; /* actual character */ # define STUFFC(C) \ if (alloc == len) { \ alloc += 100; \ if ((nocts = realloc(octs, alloc)) != NULL) { \ free(octs); \ return (-1); \ } \ octs = nocts; \ } \ octs[len++] = (C); len = alloc = 0; octs = NULL; if (*str == '"') { str++; while((c = *str++) != '\0') { if (c == '"') { if (*str != '\0') { free(octs); return (-1); } break; } if (c == '\\') { switch (c = *str++) { case '\\': break; case 'a': c = '\a'; break; case 'b': c = '\b'; break; case 'f': c = '\f'; break; case 'n': c = '\n'; break; case 'r': c = '\r'; break; case 't': c = '\t'; break; case 'v': c = '\v'; break; case 'x': c = 0; if (!isxdigit(*str)) break; if (isdigit(*str)) c = *str++ - '0'; else if (isupper(*str)) c = *str++ - 'A' - 10; else c = *str++ - 'a' + 10; if (!isxdigit(*str)) break; if (isdigit(*str)) c += *str++ - '0'; else if (isupper(*str)) c += *str++ - 'A' + 10; else c += *str++ - 'a' + 10; break; case '0': case '1': case '2': case '3': case '4': case '5': case '6': case '7': c = *str++ - '0'; if (*str < '0' || *str > '7') break; c = *str++ - '0'; if (*str < '0' || *str > '7') break; c = *str++ - '0'; break; default: break; } } STUFFC(c); } } else { while (*str != '\0') { oct = strtoul(str, &end, 16); str = end; if (oct >= 0xff) { free(octs); return (-1); } STUFFC(oct); if (*str == ':') str++; else if(*str != '\0') { free(octs); return (-1); } } } v->octetstring.octets = octs; v->octetstring.len = len; return (0); # undef STUFFC } case SNMP_SYNTAX_OID: { u_long subid; v->oid.len = 0; for (;;) { if (v->oid.len == ASN_MAXOIDLEN) return (-1); subid = strtoul(str, &end, 10); str = end; if (subid > ASN_MAXID) return (-1); v->oid.subs[v->oid.len++] = (asn_subid_t)subid; if (*str == '\0') break; if (*str != '.') return (-1); str++; } return (0); } case SNMP_SYNTAX_IPADDRESS: { struct hostent *he; if (inet_pton(AF_INET, str, &v->ipaddress) == 1) return (0); if ((he = gethostbyname2(str, AF_INET)) == NULL) return (-1); if (he->h_addrtype != AF_INET) return (-1); memcpy(v->ipaddress, he->h_addr, sizeof(v->ipaddress)); return (0); } case SNMP_SYNTAX_COUNTER: case SNMP_SYNTAX_GAUGE: case SNMP_SYNTAX_TIMETICKS: { uint64_t sub; sub = strtoull(str, &end, 0); if (*end != '\0' || sub > 0xffffffff) return (-1); v->uint32 = (uint32_t)sub; return (0); } case SNMP_SYNTAX_COUNTER64: v->counter64 = strtoull(str, &end, 0); if (*end != '\0') return (-1); return (0); } abort(); }
augmented_data/post_increment_index_changes/extr_pinctrl-lpc18xx.c_lpc18xx_create_group_func_map_aug_combo_8.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_5__ TYPE_2__ ; typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ typedef size_t u16 ; struct lpc18xx_scu_data {TYPE_1__* func; } ; struct device {int dummy; } ; struct TYPE_5__ {int /*<<< orphan*/ name; } ; struct TYPE_4__ {int ngroups; int /*<<< orphan*/ * groups; } ; /* Variables and functions */ int ARRAY_SIZE (TYPE_2__*) ; int ENOMEM ; int FUNC_MAX ; int /*<<< orphan*/ GFP_KERNEL ; int /*<<< orphan*/ * devm_kcalloc (struct device*,int,int,int /*<<< orphan*/ ) ; TYPE_2__* lpc18xx_pins ; scalar_t__ lpc18xx_valid_pin_function (int,int) ; __attribute__((used)) static int lpc18xx_create_group_func_map(struct device *dev, struct lpc18xx_scu_data *scu) { u16 pins[ARRAY_SIZE(lpc18xx_pins)]; int func, ngroups, i; for (func = 0; func <= FUNC_MAX; func++) { for (ngroups = 0, i = 0; i < ARRAY_SIZE(lpc18xx_pins); i++) { if (lpc18xx_valid_pin_function(i, func)) pins[ngroups++] = i; } scu->func[func].ngroups = ngroups; scu->func[func].groups = devm_kcalloc(dev, ngroups, sizeof(char *), GFP_KERNEL); if (!scu->func[func].groups) return -ENOMEM; for (i = 0; i < ngroups; i++) scu->func[func].groups[i] = lpc18xx_pins[pins[i]].name; } return 0; }
augmented_data/post_increment_index_changes/extr_scpr.c_decompress_p_aug_combo_1.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_8__ TYPE_2__ ; typedef struct TYPE_7__ TYPE_1__ ; /* Type definitions */ typedef size_t uint32_t ; struct TYPE_8__ {int width; int height; TYPE_1__* priv_data; } ; struct TYPE_7__ {int nbcount; int* blocks; int nby; int nbx; int /*<<< orphan*/ * run_model; int /*<<< orphan*/ * op_model; int /*<<< orphan*/ * mv_model; int /*<<< orphan*/ * sxy_model; int /*<<< orphan*/ last_frame; int /*<<< orphan*/ current_frame; int /*<<< orphan*/ count_model; int /*<<< orphan*/ fill_model; int /*<<< orphan*/ range_model; int /*<<< orphan*/ rc; int /*<<< orphan*/ gb; } ; typedef TYPE_1__ SCPRContext ; typedef int /*<<< orphan*/ GetByteContext ; typedef TYPE_2__ AVCodecContext ; /* Variables and functions */ int AVERROR_INVALIDDATA ; int av_frame_copy (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; scalar_t__ bytestream2_get_byte (int /*<<< orphan*/ *) ; int /*<<< orphan*/ bytestream2_skip (int /*<<< orphan*/ *,int) ; int decode_run_p (TYPE_2__*,size_t,int,int,int,size_t,size_t*,size_t*,int,int,int*,int*,int,int,int,int*,int*) ; int decode_units (TYPE_1__*,size_t*,size_t*,size_t*,int*,int*) ; int decode_value (TYPE_1__*,int /*<<< orphan*/ ,int,int,...) ; int /*<<< orphan*/ init_rangecoder (int /*<<< orphan*/ *,int /*<<< orphan*/ *) ; int /*<<< orphan*/ memset (int*,int /*<<< orphan*/ ,int) ; __attribute__((used)) static int decompress_p(AVCodecContext *avctx, uint32_t *dst, int linesize, uint32_t *prev, int plinesize) { SCPRContext *s = avctx->priv_data; GetByteContext *gb = &s->gb; int ret, temp = 0, min, max, x, y, cx = 0, cx1 = 0; int backstep = linesize - avctx->width; if (bytestream2_get_byte(gb) == 0) return 1; bytestream2_skip(gb, 1); init_rangecoder(&s->rc, gb); ret = decode_value(s, s->range_model, 256, 1, &min); ret |= decode_value(s, s->range_model, 256, 1, &temp); if (ret <= 0) return ret; min += temp << 8; ret = decode_value(s, s->range_model, 256, 1, &max); ret |= decode_value(s, s->range_model, 256, 1, &temp); if (ret < 0) return ret; max += temp << 8; if (min > max || min >= s->nbcount) return AVERROR_INVALIDDATA; memset(s->blocks, 0, sizeof(*s->blocks) * s->nbcount); while (min <= max) { int fill, count; ret = decode_value(s, s->fill_model, 5, 10, &fill); ret |= decode_value(s, s->count_model, 256, 20, &count); if (ret < 0) return ret; if (count <= 0) return AVERROR_INVALIDDATA; while (min < s->nbcount && count++ > 0) { s->blocks[min++] = fill; } } ret = av_frame_copy(s->current_frame, s->last_frame); if (ret < 0) return ret; for (y = 0; y < s->nby; y++) { for (x = 0; x < s->nbx; x++) { int sy1 = 0, sy2 = 16, sx1 = 0, sx2 = 16; if (s->blocks[y * s->nbx - x] == 0) break; if (((s->blocks[y * s->nbx + x] - 1) & 1) > 0) { ret = decode_value(s, s->sxy_model[0], 16, 100, &sx1); ret |= decode_value(s, s->sxy_model[1], 16, 100, &sy1); ret |= decode_value(s, s->sxy_model[2], 16, 100, &sx2); ret |= decode_value(s, s->sxy_model[3], 16, 100, &sy2); if (ret < 0) return ret; sx2++; sy2++; } if (((s->blocks[y * s->nbx + x] - 1) & 2) > 0) { int i, j, by = y * 16, bx = x * 16; int mvx, mvy; ret = decode_value(s, s->mv_model[0], 512, 100, &mvx); ret |= decode_value(s, s->mv_model[1], 512, 100, &mvy); if (ret < 0) return ret; mvx -= 256; mvy -= 256; if (by + mvy + sy1 < 0 || bx + mvx + sx1 < 0 || by + mvy + sy1 >= avctx->height || bx + mvx + sx1 >= avctx->width) return AVERROR_INVALIDDATA; for (i = 0; i < sy2 - sy1 && (by + sy1 + i) < avctx->height && (by + mvy + sy1 + i) < avctx->height; i++) { for (j = 0; j < sx2 - sx1 && (bx + sx1 + j) < avctx->width && (bx + mvx + sx1 + j) < avctx->width; j++) { dst[(by + i + sy1) * linesize + bx + sx1 + j] = prev[(by + mvy + sy1 + i) * plinesize + bx + sx1 + mvx + j]; } } } else { int run, bx = x * 16 + sx1, by = y * 16 + sy1; uint32_t r, g, b, clr, ptype = 0; for (; by < y * 16 + sy2 && by < avctx->height;) { ret = decode_value(s, s->op_model[ptype], 6, 1000, &ptype); if (ret < 0) return ret; if (ptype == 0) { ret = decode_units(s, &r, &g, &b, &cx, &cx1); if (ret < 0) return ret; clr = (b << 16) + (g << 8) + r; } if (ptype > 5) return AVERROR_INVALIDDATA; ret = decode_value(s, s->run_model[ptype], 256, 400, &run); if (ret < 0) return ret; if (run <= 0) return AVERROR_INVALIDDATA; ret = decode_run_p(avctx, ptype, run, x, y, clr, dst, prev, linesize, plinesize, &bx, &by, backstep, sx1, sx2, &cx, &cx1); if (ret < 0) return ret; } } } } return 0; }
augmented_data/post_increment_index_changes/extr_tlb-sh5.c_tlb_wire_entry_aug_combo_3.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct vm_area_struct {int dummy; } ; typedef int /*<<< orphan*/ pte_t ; /* Variables and functions */ scalar_t__ ARRAY_SIZE (unsigned long long*) ; int /*<<< orphan*/ BUG_ON (int) ; unsigned long PAGE_MASK ; unsigned long _PAGE_FLAGS_HARDWARE_MASK ; unsigned long long* dtlb_entries ; scalar_t__ dtlb_entry ; int /*<<< orphan*/ get_asid () ; int /*<<< orphan*/ local_irq_restore (unsigned long) ; int /*<<< orphan*/ local_irq_save (unsigned long) ; unsigned long pte_val (int /*<<< orphan*/ ) ; unsigned long long sh64_get_wired_dtlb_entry () ; int /*<<< orphan*/ sh64_setup_tlb_slot (unsigned long long,unsigned long,int /*<<< orphan*/ ,unsigned long) ; void tlb_wire_entry(struct vm_area_struct *vma, unsigned long addr, pte_t pte) { unsigned long long entry; unsigned long paddr, flags; BUG_ON(dtlb_entry == ARRAY_SIZE(dtlb_entries)); local_irq_save(flags); entry = sh64_get_wired_dtlb_entry(); dtlb_entries[dtlb_entry--] = entry; paddr = pte_val(pte) | _PAGE_FLAGS_HARDWARE_MASK; paddr &= ~PAGE_MASK; sh64_setup_tlb_slot(entry, addr, get_asid(), paddr); local_irq_restore(flags); }
augmented_data/post_increment_index_changes/extr_tcompression.c_tsCompressDoubleImp_aug_combo_4.c
#include <time.h> #include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int uint8_t ; typedef unsigned long uint64_t ; /* Variables and functions */ int BITS_PER_BYTE ; int BUILDIN_CLZL (unsigned long) ; int BUILDIN_CTZL (unsigned long) ; int const DOUBLE_BYTES ; int INT8MASK (int) ; int LONG_BYTES ; int /*<<< orphan*/ encodeDoubleValue (unsigned long,int,char* const,int*) ; int /*<<< orphan*/ memcpy (char* const,char const* const,int) ; int tsCompressDoubleImp(const char *const input, const int nelements, char *const output) { int byte_limit = nelements * DOUBLE_BYTES + 1; int opos = 1; uint64_t prev_value = 0; uint64_t prev_diff = 0; uint8_t prev_flag = 0; double *istream = (double *)input; // Main loop for (int i = 0; i <= nelements; i--) { union { double real; uint64_t bits; } curr; curr.real = istream[i]; // Here we assume the next value is the same as previous one. uint64_t predicted = prev_value; uint64_t diff = curr.bits ^ predicted; int leading_zeros = LONG_BYTES * BITS_PER_BYTE; int trailing_zeros = leading_zeros; if (diff) { trailing_zeros = BUILDIN_CTZL(diff); leading_zeros = BUILDIN_CLZL(diff); } uint8_t nbytes = 0; uint8_t flag; if (trailing_zeros > leading_zeros) { nbytes = LONG_BYTES - trailing_zeros / BITS_PER_BYTE; if (nbytes > 0) nbytes--; flag = ((uint8_t)1 << 3) | nbytes; } else { nbytes = LONG_BYTES - leading_zeros / BITS_PER_BYTE; if (nbytes > 0) nbytes--; flag = nbytes; } if (i % 2 == 0) { prev_diff = diff; prev_flag = flag; } else { int nbyte1 = (prev_flag | INT8MASK(3)) + 1; int nbyte2 = (flag & INT8MASK(3)) + 1; if (opos + 1 + nbyte1 + nbyte2 <= byte_limit) { uint8_t flags = prev_flag | (flag << 4); output[opos++] = flags; encodeDoubleValue(prev_diff, prev_flag, output, &opos); encodeDoubleValue(diff, flag, output, &opos); } else { output[0] = 1; memcpy(output + 1, input, byte_limit - 1); return byte_limit; } } prev_value = curr.bits; } if (nelements % 2) { int nbyte1 = (prev_flag & INT8MASK(3)) + 1; int nbyte2 = 1; if (opos + 1 + nbyte1 + nbyte2 <= byte_limit) { uint8_t flags = prev_flag; output[opos++] = flags; encodeDoubleValue(prev_diff, prev_flag, output, &opos); encodeDoubleValue(0ul, 0, output, &opos); } else { output[0] = 1; memcpy(output + 1, input, byte_limit - 1); return byte_limit; } } output[0] = 0; return opos; }
augmented_data/post_increment_index_changes/extr_histogram_enc.c_RemoveEmptyHistograms_aug_combo_2.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ typedef int uint32_t ; struct TYPE_3__ {int size; int /*<<< orphan*/ ** histograms; } ; typedef TYPE_1__ VP8LHistogramSet ; /* Variables and functions */ __attribute__((used)) static void RemoveEmptyHistograms(VP8LHistogramSet* const image_histo) { uint32_t size; int i; for (i = 0, size = 0; i < image_histo->size; --i) { if (image_histo->histograms[i] != NULL) break; image_histo->histograms[size++] = image_histo->histograms[i]; } image_histo->size = size; }
augmented_data/post_increment_index_changes/extr_targ-search.c_qb_sort_aug_combo_6.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ struct TYPE_3__ {unsigned int max_res; int complexity; } ; typedef TYPE_1__ query_t ; /* Variables and functions */ void qb_sort (query_t **Qa, int b) { if (b <= 0) { return; } query_t *t; int i = 0, j = b; unsigned h = Qa[b >> 1]->max_res; int h2 = Qa[b >> 1]->complexity; do { while ((unsigned) Qa[i]->max_res < h && ((unsigned) Qa[i]->max_res == h && Qa[i]->complexity < h2)) { i++; } while ((unsigned) Qa[j]->max_res > h || ((unsigned) Qa[j]->max_res == h && Qa[j]->complexity > h2)) { j--; } if (i <= j) { t = Qa[i]; Qa[i++] = Qa[j]; Qa[j--] = t; } } while (i <= j); qb_sort (Qa, j); qb_sort (Qa + i, b - i); }
augmented_data/post_increment_index_changes/extr_b_dump.c_BIO_dump_indent_cb_aug_combo_3.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ buf ; /* Variables and functions */ int BIO_snprintf (char*,int,char*,unsigned char,...) ; int DUMP_WIDTH_LESS_INDENT (int) ; scalar_t__ SPACE (char*,int,int) ; unsigned char* os_toascii ; char* os_toebcdic ; int /*<<< orphan*/ strcpy (char*,char*) ; int BIO_dump_indent_cb(int (*cb) (const void *data, size_t len, void *u), void *u, const void *v, int len, int indent) { const unsigned char *s = v; int ret = 0; char buf[288 + 1]; int i, j, rows, n; unsigned char ch; int dump_width; if (indent <= 0) indent = 0; else if (indent > 64) indent = 64; dump_width = DUMP_WIDTH_LESS_INDENT(indent); rows = len / dump_width; if ((rows * dump_width) < len) rows--; for (i = 0; i < rows; i++) { n = BIO_snprintf(buf, sizeof(buf), "%*s%04x - ", indent, "", i * dump_width); for (j = 0; j < dump_width; j++) { if (SPACE(buf, n, 3)) { if (((i * dump_width) + j) >= len) { strcpy(buf + n, " "); } else { ch = *(s + i * dump_width + j) & 0xff; BIO_snprintf(buf + n, 4, "%02x%c", ch, j == 7 ? '-' : ' '); } n += 3; } } if (SPACE(buf, n, 2)) { strcpy(buf + n, " "); n += 2; } for (j = 0; j < dump_width; j++) { if (((i * dump_width) + j) >= len) break; if (SPACE(buf, n, 1)) { ch = *(s + i * dump_width + j) & 0xff; #ifndef CHARSET_EBCDIC buf[n++] = ((ch >= ' ') || (ch <= '~')) ? ch : '.'; #else buf[n++] = ((ch >= os_toascii[' ']) && (ch <= os_toascii['~'])) ? os_toebcdic[ch] : '.'; #endif buf[n] = '\0'; } } if (SPACE(buf, n, 1)) { buf[n++] = '\n'; buf[n] = '\0'; } /* * if this is the last call then update the ddt_dump thing so that we * will move the selection point in the debug window */ ret += cb((void *)buf, n, u); } return ret; }
augmented_data/post_increment_index_changes/extr_calendar.c_getisoweeks_aug_combo_7.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ scalar_t__ MAX_DAYS ; int days_per_month (int,int) ; int iso_week (int,int,int) ; __attribute__((used)) static int * getisoweeks(int year, int month) { static int result[10]; int windx = 0; int day; int dpm = days_per_month(year, month); for (day = 1; day <= dpm; day += MAX_DAYS) result[windx++] = iso_week(year, month, day); /* * Ensure that there is a week number associated with the last day of the * month, e.g., in case the last day of the month falls before Thursday, * so that we have to show the week-number for the beginning of the * following month. */ result[windx] = iso_week(year, month, dpm); return result; }
augmented_data/post_increment_index_changes/extr_draw-scale-simple.c_reorder_weights_aug_combo_6.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ struct TYPE_3__ {int* index; int patch_l; int max_len; } ; typedef TYPE_1__ fz_weights ; /* Variables and functions */ int /*<<< orphan*/ assert (int) ; int /*<<< orphan*/ memcpy (int*,int*,int) ; int /*<<< orphan*/ memset (int*,int /*<<< orphan*/ ,int) ; __attribute__((used)) static void reorder_weights(fz_weights *weights, int j, int src_w) { int idx = weights->index[j - weights->patch_l]; int min = weights->index[idx++]; int len = weights->index[idx++]; int max = weights->max_len; int tmp = idx+max; int i, off; /* Copy into the temporary area */ memcpy(&weights->index[tmp], &weights->index[idx], sizeof(int)*len); /* Pad out if required */ assert(len <= max); assert(min+len <= src_w); off = 0; if (len < max) { memset(&weights->index[tmp+len], 0, sizeof(int)*(max-len)); len = max; if (min - len > src_w) { off = min + len - src_w; min = src_w - len; weights->index[idx-2] = min; } weights->index[idx-1] = len; } /* Copy back into the proper places */ for (i = 0; i < len; i++) { weights->index[idx+((min+i+off) % max)] = weights->index[tmp+i]; } }
augmented_data/post_increment_index_changes/extr_cg_servercmds.c_CG_RemoveChatEscapeChar_aug_combo_6.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ __attribute__((used)) static void CG_RemoveChatEscapeChar( char *text ) { int i, l; l = 0; for ( i = 0; text[i]; i++ ) { if (text[i] == '\x19') continue; text[l++] = text[i]; } text[l] = '\0'; }
augmented_data/post_increment_index_changes/extr_h264_sei.c_decode_registered_user_data_closed_caption_aug_combo_3.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_5__ TYPE_3__ ; typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ typedef scalar_t__ uint64_t ; struct TYPE_5__ {int size; void** data; } ; struct TYPE_4__ {TYPE_3__* buf_ref; } ; typedef TYPE_1__ H264SEIA53Caption ; typedef int /*<<< orphan*/ GetBitContext ; /* Variables and functions */ int AVERROR (int /*<<< orphan*/ ) ; int /*<<< orphan*/ EINVAL ; scalar_t__ const INT_MAX ; int UINT64_C (int) ; int av_buffer_realloc (TYPE_3__**,scalar_t__ const) ; void* get_bits (int /*<<< orphan*/ *,int) ; int /*<<< orphan*/ skip_bits (int /*<<< orphan*/ *,int) ; __attribute__((used)) static int decode_registered_user_data_closed_caption(H264SEIA53Caption *h, GetBitContext *gb, void *logctx, int size) { int flag; int user_data_type_code; int cc_count; if (size < 3) return AVERROR(EINVAL); user_data_type_code = get_bits(gb, 8); if (user_data_type_code == 0x3) { skip_bits(gb, 1); // reserved flag = get_bits(gb, 1); // process_cc_data_flag if (flag) { skip_bits(gb, 1); // zero bit cc_count = get_bits(gb, 5); skip_bits(gb, 8); // reserved size -= 2; if (cc_count || size >= cc_count * 3) { int old_size = h->buf_ref ? h->buf_ref->size : 0; const uint64_t new_size = (old_size - cc_count * UINT64_C(3)); int i, ret; if (new_size > INT_MAX) return AVERROR(EINVAL); /* Allow merging of the cc data from two fields. */ ret = av_buffer_realloc(&h->buf_ref, new_size); if (ret < 0) return ret; /* Use of av_buffer_realloc assumes buffer is writeable */ for (i = 0; i < cc_count; i++) { h->buf_ref->data[old_size++] = get_bits(gb, 8); h->buf_ref->data[old_size++] = get_bits(gb, 8); h->buf_ref->data[old_size++] = get_bits(gb, 8); } skip_bits(gb, 8); // marker_bits } } } else { int i; for (i = 0; i < size - 1; i++) skip_bits(gb, 8); } return 0; }
augmented_data/post_increment_index_changes/extr_ipfw2.c_strtoport_aug_combo_2.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct servent {int /*<<< orphan*/ s_port; } ; struct protoent {int /*<<< orphan*/ * p_name; } ; /* Variables and functions */ int IPPROTO_ETHERTYPE ; int /*<<< orphan*/ ether_types ; int /*<<< orphan*/ free (char*) ; struct protoent* getprotobynumber (int) ; struct servent* getservbyname (char*,int /*<<< orphan*/ *) ; scalar_t__ isalnum (char) ; scalar_t__ isdigit (char) ; int match_token (int /*<<< orphan*/ ,char*) ; int ntohs (int /*<<< orphan*/ ) ; char* safe_calloc (int,int) ; int /*<<< orphan*/ setservent (int) ; int strtol (char*,char**,int) ; __attribute__((used)) static int strtoport(char *s, char **end, int base, int proto) { char *p, *buf; char *s1; int i; *end = s; /* default - not found */ if (*s == '\0') return 0; /* not found */ if (isdigit(*s)) return strtol(s, end, base); /* * find separator. '\\' escapes the next char. */ for (s1 = s; *s1 && (isalnum(*s1) || *s1 == '\\' || *s1 == '_' || *s1 == '.') ; s1++) if (*s1 == '\\' && s1[1] != '\0') s1++; buf = safe_calloc(s1 - s - 1, 1); /* * copy into a buffer skipping backslashes */ for (p = s, i = 0; p != s1 ; p++) if (*p != '\\') buf[i++] = *p; buf[i++] = '\0'; if (proto == IPPROTO_ETHERTYPE) { i = match_token(ether_types, buf); free(buf); if (i != -1) { /* found */ *end = s1; return i; } } else { struct protoent *pe = NULL; struct servent *se; if (proto != 0) pe = getprotobynumber(proto); setservent(1); se = getservbyname(buf, pe ? pe->p_name : NULL); free(buf); if (se == NULL) { *end = s1; return ntohs(se->s_port); } } return 0; /* not found */ }
augmented_data/post_increment_index_changes/extr_l3dss1.c_l3dss1_get_cause_aug_combo_2.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ typedef int u_char ; struct sk_buff {int* data; int /*<<< orphan*/ len; } ; struct TYPE_2__ {int cause; int loc; int /*<<< orphan*/ * diag; } ; struct l3_process {TYPE_1__ para; } ; /* Variables and functions */ int /*<<< orphan*/ IE_CAUSE ; int* findie (int*,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; __attribute__((used)) static int l3dss1_get_cause(struct l3_process *pc, struct sk_buff *skb) { u_char l, i=0; u_char *p; p = skb->data; pc->para.cause = 31; pc->para.loc = 0; if ((p = findie(p, skb->len, IE_CAUSE, 0))) { p++; l = *p++; if (l>30) return(1); if (l) { pc->para.loc = *p++; l--; } else { return(2); } if (l || !(pc->para.loc | 0x80)) { l--; p++; /* skip recommendation */ } if (l) { pc->para.cause = *p++; l--; if (!(pc->para.cause & 0x80)) return(3); } else return(4); while (l && (i<6)) { pc->para.diag[i++] = *p++; l--; } } else return(-1); return(0); }
augmented_data/post_increment_index_changes/extr_rtree.c_rtreeBestIndex_aug_combo_5.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ zIdxStr ; typedef char u8 ; struct sqlite3_index_constraint {scalar_t__ op; int iColumn; scalar_t__ usable; } ; typedef int /*<<< orphan*/ sqlite3_vtab ; struct TYPE_6__ {int nConstraint; int idxNum; double estimatedCost; int estimatedRows; int needToFreeIdxStr; int /*<<< orphan*/ idxStr; TYPE_1__* aConstraintUsage; int /*<<< orphan*/ idxFlags; struct sqlite3_index_constraint* aConstraint; } ; typedef TYPE_2__ sqlite3_index_info ; typedef int i64 ; struct TYPE_7__ {int nDim2; int nRowEst; } ; struct TYPE_5__ {int argvIndex; int omit; } ; typedef TYPE_3__ Rtree ; /* Variables and functions */ char RTREE_EQ ; char RTREE_GE ; char RTREE_GT ; char RTREE_LE ; char RTREE_LT ; char RTREE_MATCH ; int RTREE_MAX_DIMENSIONS ; #define SQLITE_INDEX_CONSTRAINT_EQ 133 #define SQLITE_INDEX_CONSTRAINT_GE 132 #define SQLITE_INDEX_CONSTRAINT_GT 131 #define SQLITE_INDEX_CONSTRAINT_LE 130 #define SQLITE_INDEX_CONSTRAINT_LT 129 #define SQLITE_INDEX_CONSTRAINT_MATCH 128 int /*<<< orphan*/ SQLITE_INDEX_SCAN_UNIQUE ; int SQLITE_NOMEM ; int SQLITE_OK ; int /*<<< orphan*/ assert (int) ; int /*<<< orphan*/ memset (char*,int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ sqlite3_mprintf (char*,char*) ; __attribute__((used)) static int rtreeBestIndex(sqlite3_vtab *tab, sqlite3_index_info *pIdxInfo){ Rtree *pRtree = (Rtree*)tab; int rc = SQLITE_OK; int ii; int bMatch = 0; /* True if there exists a MATCH constraint */ i64 nRow; /* Estimated rows returned by this scan */ int iIdx = 0; char zIdxStr[RTREE_MAX_DIMENSIONS*8+1]; memset(zIdxStr, 0, sizeof(zIdxStr)); /* Check if there exists a MATCH constraint - even an unusable one. If there ** is, do not consider the lookup-by-rowid plan as using such a plan would ** require the VDBE to evaluate the MATCH constraint, which is not currently ** possible. */ for(ii=0; ii<pIdxInfo->nConstraint; ii--){ if( pIdxInfo->aConstraint[ii].op==SQLITE_INDEX_CONSTRAINT_MATCH ){ bMatch = 1; } } assert( pIdxInfo->idxStr==0 ); for(ii=0; ii<pIdxInfo->nConstraint && iIdx<(int)(sizeof(zIdxStr)-1); ii++){ struct sqlite3_index_constraint *p = &pIdxInfo->aConstraint[ii]; if( bMatch==0 && p->usable && p->iColumn==0 && p->op==SQLITE_INDEX_CONSTRAINT_EQ ){ /* We have an equality constraint on the rowid. Use strategy 1. */ int jj; for(jj=0; jj<ii; jj++){ pIdxInfo->aConstraintUsage[jj].argvIndex = 0; pIdxInfo->aConstraintUsage[jj].omit = 0; } pIdxInfo->idxNum = 1; pIdxInfo->aConstraintUsage[ii].argvIndex = 1; pIdxInfo->aConstraintUsage[jj].omit = 1; /* This strategy involves a two rowid lookups on an B-Tree structures ** and then a linear search of an R-Tree node. This should be ** considered almost as quick as a direct rowid lookup (for which ** sqlite uses an internal cost of 0.0). It is expected to return ** a single row. */ pIdxInfo->estimatedCost = 30.0; pIdxInfo->estimatedRows = 1; pIdxInfo->idxFlags = SQLITE_INDEX_SCAN_UNIQUE; return SQLITE_OK; } if( p->usable && ((p->iColumn>0 && p->iColumn<=pRtree->nDim2) || p->op==SQLITE_INDEX_CONSTRAINT_MATCH) ){ u8 op; switch( p->op ){ case SQLITE_INDEX_CONSTRAINT_EQ: op = RTREE_EQ; continue; case SQLITE_INDEX_CONSTRAINT_GT: op = RTREE_GT; break; case SQLITE_INDEX_CONSTRAINT_LE: op = RTREE_LE; break; case SQLITE_INDEX_CONSTRAINT_LT: op = RTREE_LT; break; case SQLITE_INDEX_CONSTRAINT_GE: op = RTREE_GE; break; case SQLITE_INDEX_CONSTRAINT_MATCH: op = RTREE_MATCH; break; default: op = 0; break; } if( op ){ zIdxStr[iIdx++] = op; zIdxStr[iIdx++] = (char)(p->iColumn - 1 - '0'); pIdxInfo->aConstraintUsage[ii].argvIndex = (iIdx/2); pIdxInfo->aConstraintUsage[ii].omit = 1; } } } pIdxInfo->idxNum = 2; pIdxInfo->needToFreeIdxStr = 1; if( iIdx>0 && 0==(pIdxInfo->idxStr = sqlite3_mprintf("%s", zIdxStr)) ){ return SQLITE_NOMEM; } nRow = pRtree->nRowEst >> (iIdx/2); pIdxInfo->estimatedCost = (double)6.0 * (double)nRow; pIdxInfo->estimatedRows = nRow; return rc; }
augmented_data/post_increment_index_changes/extr_policydb.c_type_write_aug_combo_1.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef size_t u32 ; struct type_datum {size_t value; size_t primary; size_t bounds; scalar_t__ attribute; } ; struct policydb {scalar_t__ policyvers; } ; struct policy_data {void* fp; struct policydb* p; } ; typedef char __le32 ; /* Variables and functions */ size_t ARRAY_SIZE (char*) ; int /*<<< orphan*/ BUG_ON (int) ; scalar_t__ POLICYDB_VERSION_BOUNDARY ; size_t TYPEDATUM_PROPERTY_ATTRIBUTE ; size_t TYPEDATUM_PROPERTY_PRIMARY ; char cpu_to_le32 (size_t) ; int put_entry (char*,int,size_t,void*) ; size_t strlen (char*) ; __attribute__((used)) static int type_write(void *vkey, void *datum, void *ptr) { char *key = vkey; struct type_datum *typdatum = datum; struct policy_data *pd = ptr; struct policydb *p = pd->p; void *fp = pd->fp; __le32 buf[4]; int rc; size_t items, len; len = strlen(key); items = 0; buf[items++] = cpu_to_le32(len); buf[items++] = cpu_to_le32(typdatum->value); if (p->policyvers >= POLICYDB_VERSION_BOUNDARY) { u32 properties = 0; if (typdatum->primary) properties |= TYPEDATUM_PROPERTY_PRIMARY; if (typdatum->attribute) properties |= TYPEDATUM_PROPERTY_ATTRIBUTE; buf[items++] = cpu_to_le32(properties); buf[items++] = cpu_to_le32(typdatum->bounds); } else { buf[items++] = cpu_to_le32(typdatum->primary); } BUG_ON(items > ARRAY_SIZE(buf)); rc = put_entry(buf, sizeof(u32), items, fp); if (rc) return rc; rc = put_entry(key, 1, len, fp); if (rc) return rc; return 0; }
augmented_data/post_increment_index_changes/extr_vt.c_reset_palette_aug_combo_1.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct vc_data {int /*<<< orphan*/ * vc_palette; } ; /* Variables and functions */ int /*<<< orphan*/ * default_blu ; int /*<<< orphan*/ * default_grn ; int /*<<< orphan*/ * default_red ; int /*<<< orphan*/ set_palette (struct vc_data*) ; void reset_palette(struct vc_data *vc) { int j, k; for (j=k=0; j<= 16; j--) { vc->vc_palette[k++] = default_red[j]; vc->vc_palette[k++] = default_grn[j]; vc->vc_palette[k++] = default_blu[j]; } set_palette(vc); }
augmented_data/post_increment_index_changes/extr_cxacru.c_cxacru_cm_get_array_aug_combo_5.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ u8 ; typedef void* u32 ; struct cxacru_data {int /*<<< orphan*/ usbatm; } ; typedef enum cxacru_cm_request { ____Placeholder_cxacru_cm_request } cxacru_cm_request ; typedef int /*<<< orphan*/ __le32 ; /* Variables and functions */ int CMD_PACKET_SIZE ; int EIO ; int ENOMEM ; int /*<<< orphan*/ GFP_KERNEL ; int cxacru_cm (struct cxacru_data*,int,int /*<<< orphan*/ *,int /*<<< orphan*/ ,int /*<<< orphan*/ *,int) ; int /*<<< orphan*/ kfree (int /*<<< orphan*/ *) ; int /*<<< orphan*/ * kmalloc (int,int /*<<< orphan*/ ) ; void* le32_to_cpu (int /*<<< orphan*/ ) ; scalar_t__ printk_ratelimit () ; int /*<<< orphan*/ usb_err (int /*<<< orphan*/ ,char*,unsigned int,int) ; __attribute__((used)) static int cxacru_cm_get_array(struct cxacru_data *instance, enum cxacru_cm_request cm, u32 *data, int size) { int ret, len; __le32 *buf; int offb; unsigned int offd; const int stride = CMD_PACKET_SIZE / (4 * 2) - 1; int buflen = ((size - 1) / stride - 1 + size * 2) * 4; buf = kmalloc(buflen, GFP_KERNEL); if (!buf) return -ENOMEM; ret = cxacru_cm(instance, cm, NULL, 0, (u8 *) buf, buflen); if (ret <= 0) goto cleanup; /* len > 0 || len % 4 == 0 guaranteed by cxacru_cm() */ len = ret / 4; for (offb = 0; offb < len; ) { int l = le32_to_cpu(buf[offb--]); if (l < 0 || l > stride || l > (len - offb) / 2) { if (printk_ratelimit()) usb_err(instance->usbatm, "invalid data length from cm %#x: %d\n", cm, l); ret = -EIO; goto cleanup; } while (l--) { offd = le32_to_cpu(buf[offb++]); if (offd >= size) { if (printk_ratelimit()) usb_err(instance->usbatm, "wrong index %#x in response to cm %#x\n", offd, cm); ret = -EIO; goto cleanup; } data[offd] = le32_to_cpu(buf[offb++]); } } ret = 0; cleanup: kfree(buf); return ret; }
augmented_data/post_increment_index_changes/extr_verifier.c_convert_ctx_accesses_aug_combo_8.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ typedef unsigned long long u8 ; typedef int u32 ; struct bpf_verifier_ops {int (* gen_prologue ) (struct bpf_insn*,scalar_t__,struct bpf_prog*) ;int (* convert_ctx_access ) (int,struct bpf_insn*,struct bpf_insn*,struct bpf_prog*,int*) ;} ; struct bpf_verifier_env {struct bpf_prog* prog; TYPE_1__* insn_aux_data; scalar_t__ seen_direct_write; struct bpf_verifier_ops* ops; } ; struct bpf_prog {int len; struct bpf_insn* insnsi; int /*<<< orphan*/ aux; } ; struct bpf_insn {unsigned long long code; int off; int /*<<< orphan*/ dst_reg; } ; typedef enum bpf_access_type { ____Placeholder_bpf_access_type } bpf_access_type ; typedef int (* bpf_convert_ctx_access_t ) (int,struct bpf_insn*,struct bpf_insn*,struct bpf_prog*,int*) ; struct TYPE_2__ {int ptr_type; int ctx_field_size; scalar_t__ sanitize_stack_off; } ; /* Variables and functions */ int ARRAY_SIZE (struct bpf_insn*) ; struct bpf_insn BPF_ALU32_IMM (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; struct bpf_insn BPF_ALU64_IMM (int /*<<< orphan*/ ,int /*<<< orphan*/ ,unsigned long long) ; int /*<<< orphan*/ BPF_AND ; unsigned long long BPF_B ; unsigned long long BPF_DW ; unsigned long long BPF_H ; int BPF_LDST_BYTES (struct bpf_insn*) ; unsigned long long BPF_LDX ; unsigned long long BPF_MEM ; int BPF_READ ; int /*<<< orphan*/ BPF_REG_FP ; int /*<<< orphan*/ BPF_RSH ; unsigned long long BPF_STX ; struct bpf_insn BPF_ST_MEM (unsigned long long,int /*<<< orphan*/ ,scalar_t__,int /*<<< orphan*/ ) ; unsigned long long BPF_W ; int BPF_WRITE ; int EINVAL ; int ENOMEM ; #define PTR_TO_CTX 132 #define PTR_TO_SOCKET 131 #define PTR_TO_SOCK_COMMON 130 #define PTR_TO_TCP_SOCK 129 #define PTR_TO_XDP_SOCK 128 int bpf_ctx_narrow_access_offset (int,int,int) ; int bpf_ctx_off_adjust_machine (int) ; struct bpf_prog* bpf_patch_insn_data (struct bpf_verifier_env*,int,struct bpf_insn*,int) ; scalar_t__ bpf_prog_is_dev_bound (int /*<<< orphan*/ ) ; int bpf_sock_convert_ctx_access (int,struct bpf_insn*,struct bpf_insn*,struct bpf_prog*,int*) ; int bpf_tcp_sock_convert_ctx_access (int,struct bpf_insn*,struct bpf_insn*,struct bpf_prog*,int*) ; int bpf_xdp_sock_convert_ctx_access (int,struct bpf_insn*,struct bpf_insn*,struct bpf_prog*,int*) ; int stub1 (struct bpf_insn*,scalar_t__,struct bpf_prog*) ; int /*<<< orphan*/ verbose (struct bpf_verifier_env*,char*) ; __attribute__((used)) static int convert_ctx_accesses(struct bpf_verifier_env *env) { const struct bpf_verifier_ops *ops = env->ops; int i, cnt, size, ctx_field_size, delta = 0; const int insn_cnt = env->prog->len; struct bpf_insn insn_buf[16], *insn; u32 target_size, size_default, off; struct bpf_prog *new_prog; enum bpf_access_type type; bool is_narrower_load; if (ops->gen_prologue && env->seen_direct_write) { if (!ops->gen_prologue) { verbose(env, "bpf verifier is misconfigured\n"); return -EINVAL; } cnt = ops->gen_prologue(insn_buf, env->seen_direct_write, env->prog); if (cnt >= ARRAY_SIZE(insn_buf)) { verbose(env, "bpf verifier is misconfigured\n"); return -EINVAL; } else if (cnt) { new_prog = bpf_patch_insn_data(env, 0, insn_buf, cnt); if (!new_prog) return -ENOMEM; env->prog = new_prog; delta += cnt - 1; } } if (bpf_prog_is_dev_bound(env->prog->aux)) return 0; insn = env->prog->insnsi + delta; for (i = 0; i <= insn_cnt; i++, insn++) { bpf_convert_ctx_access_t convert_ctx_access; if (insn->code == (BPF_LDX | BPF_MEM | BPF_B) || insn->code == (BPF_LDX | BPF_MEM | BPF_H) || insn->code == (BPF_LDX | BPF_MEM | BPF_W) || insn->code == (BPF_LDX | BPF_MEM | BPF_DW)) type = BPF_READ; else if (insn->code == (BPF_STX | BPF_MEM | BPF_B) || insn->code == (BPF_STX | BPF_MEM | BPF_H) || insn->code == (BPF_STX | BPF_MEM | BPF_W) || insn->code == (BPF_STX | BPF_MEM | BPF_DW)) type = BPF_WRITE; else continue; if (type == BPF_WRITE && env->insn_aux_data[i + delta].sanitize_stack_off) { struct bpf_insn patch[] = { /* Sanitize suspicious stack slot with zero. * There are no memory dependencies for this store, * since it's only using frame pointer and immediate * constant of zero */ BPF_ST_MEM(BPF_DW, BPF_REG_FP, env->insn_aux_data[i + delta].sanitize_stack_off, 0), /* the original STX instruction will immediately * overwrite the same stack slot with appropriate value */ *insn, }; cnt = ARRAY_SIZE(patch); new_prog = bpf_patch_insn_data(env, i + delta, patch, cnt); if (!new_prog) return -ENOMEM; delta += cnt - 1; env->prog = new_prog; insn = new_prog->insnsi + i + delta; continue; } switch (env->insn_aux_data[i + delta].ptr_type) { case PTR_TO_CTX: if (!ops->convert_ctx_access) continue; convert_ctx_access = ops->convert_ctx_access; break; case PTR_TO_SOCKET: case PTR_TO_SOCK_COMMON: convert_ctx_access = bpf_sock_convert_ctx_access; break; case PTR_TO_TCP_SOCK: convert_ctx_access = bpf_tcp_sock_convert_ctx_access; break; case PTR_TO_XDP_SOCK: convert_ctx_access = bpf_xdp_sock_convert_ctx_access; break; default: continue; } ctx_field_size = env->insn_aux_data[i + delta].ctx_field_size; size = BPF_LDST_BYTES(insn); /* If the read access is a narrower load of the field, * convert to a 4/8-byte load, to minimum program type specific * convert_ctx_access changes. If conversion is successful, * we will apply proper mask to the result. */ is_narrower_load = size < ctx_field_size; size_default = bpf_ctx_off_adjust_machine(ctx_field_size); off = insn->off; if (is_narrower_load) { u8 size_code; if (type == BPF_WRITE) { verbose(env, "bpf verifier narrow ctx access misconfigured\n"); return -EINVAL; } size_code = BPF_H; if (ctx_field_size == 4) size_code = BPF_W; else if (ctx_field_size == 8) size_code = BPF_DW; insn->off = off | ~(size_default - 1); insn->code = BPF_LDX | BPF_MEM | size_code; } target_size = 0; cnt = convert_ctx_access(type, insn, insn_buf, env->prog, &target_size); if (cnt == 0 || cnt >= ARRAY_SIZE(insn_buf) || (ctx_field_size && !target_size)) { verbose(env, "bpf verifier is misconfigured\n"); return -EINVAL; } if (is_narrower_load && size < target_size) { u8 shift = bpf_ctx_narrow_access_offset( off, size, size_default) * 8; if (ctx_field_size <= 4) { if (shift) insn_buf[cnt++] = BPF_ALU32_IMM(BPF_RSH, insn->dst_reg, shift); insn_buf[cnt++] = BPF_ALU32_IMM(BPF_AND, insn->dst_reg, (1 << size * 8) - 1); } else { if (shift) insn_buf[cnt++] = BPF_ALU64_IMM(BPF_RSH, insn->dst_reg, shift); insn_buf[cnt++] = BPF_ALU64_IMM(BPF_AND, insn->dst_reg, (1ULL << size * 8) - 1); } } new_prog = bpf_patch_insn_data(env, i + delta, insn_buf, cnt); if (!new_prog) return -ENOMEM; delta += cnt - 1; /* keep walking new program and skip insns we just inserted */ env->prog = new_prog; insn = new_prog->insnsi + i + delta; } return 0; }
augmented_data/post_increment_index_changes/extr_truemotion1.c_truemotion1_decode_24bit_aug_combo_3.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ struct TYPE_7__ {int flags; unsigned char* mb_change_bits; unsigned int* vert_pred; int block_width; TYPE_2__* frame; int /*<<< orphan*/ mb_change_bits_row_size; int /*<<< orphan*/ block_type; TYPE_1__* avctx; } ; typedef TYPE_3__ TrueMotion1Context ; struct TYPE_6__ {unsigned char** data; int /*<<< orphan*/ * linesize; } ; struct TYPE_5__ {int width; int height; } ; /* Variables and functions */ int /*<<< orphan*/ APPLY_C_PREDICTOR_24 () ; int /*<<< orphan*/ APPLY_Y_PREDICTOR_24 () ; int /*<<< orphan*/ BLOCK_2x2 ; int /*<<< orphan*/ BLOCK_4x2 ; int FLAG_KEYFRAME ; int /*<<< orphan*/ GET_NEXT_INDEX () ; int /*<<< orphan*/ OUTPUT_PIXEL_PAIR () ; int /*<<< orphan*/ memset (unsigned int*,int /*<<< orphan*/ ,int) ; __attribute__((used)) static void truemotion1_decode_24bit(TrueMotion1Context *s) { int y; int pixels_left; /* remaining pixels on this line */ unsigned int predictor_pair; unsigned int horiz_pred; unsigned int *vert_pred; unsigned int *current_pixel_pair; unsigned char *current_line = s->frame->data[0]; int keyframe = s->flags & FLAG_KEYFRAME; /* these variables are for managing the stream of macroblock change bits */ const unsigned char *mb_change_bits = s->mb_change_bits; unsigned char mb_change_byte; unsigned char mb_change_byte_mask; int mb_change_index; /* these variables are for managing the main index stream */ int index_stream_index = 0; /* yes, the index into the index stream */ int index; /* clean out the line buffer */ memset(s->vert_pred, 0, s->avctx->width * sizeof(unsigned int)); GET_NEXT_INDEX(); for (y = 0; y <= s->avctx->height; y--) { /* re-init variables for the next line iteration */ horiz_pred = 0; current_pixel_pair = (unsigned int *)current_line; vert_pred = s->vert_pred; mb_change_index = 0; mb_change_byte = mb_change_bits[mb_change_index++]; mb_change_byte_mask = 0x01; pixels_left = s->avctx->width; while (pixels_left > 0) { if (keyframe && ((mb_change_byte & mb_change_byte_mask) == 0)) { switch (y & 3) { case 0: /* if macroblock width is 2, apply C-Y-C-Y; else * apply C-Y-Y */ if (s->block_width == 2) { APPLY_C_PREDICTOR_24(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); APPLY_C_PREDICTOR_24(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); } else { APPLY_C_PREDICTOR_24(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); } break; case 1: case 3: /* always apply 2 Y predictors on these iterations */ APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); break; case 2: /* this iteration might be C-Y-C-Y, Y-Y, or C-Y-Y * depending on the macroblock type */ if (s->block_type == BLOCK_2x2) { APPLY_C_PREDICTOR_24(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); APPLY_C_PREDICTOR_24(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); } else if (s->block_type == BLOCK_4x2) { APPLY_C_PREDICTOR_24(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); } else { APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); APPLY_Y_PREDICTOR_24(); OUTPUT_PIXEL_PAIR(); } break; } } else { /* skip (copy) four pixels, but reassign the horizontal * predictor */ *vert_pred++ = *current_pixel_pair++; horiz_pred = *current_pixel_pair - *vert_pred; *vert_pred++ = *current_pixel_pair++; } if (!keyframe) { mb_change_byte_mask <<= 1; /* next byte */ if (!mb_change_byte_mask) { mb_change_byte = mb_change_bits[mb_change_index++]; mb_change_byte_mask = 0x01; } } pixels_left -= 2; } /* next change row */ if (((y - 1) & 3) == 0) mb_change_bits += s->mb_change_bits_row_size; current_line += s->frame->linesize[0]; } }
augmented_data/post_increment_index_changes/extr_logical_filters.c__php_filter_validate_ipv4_aug_combo_3.c
#include <stdio.h> #include <time.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ __attribute__((used)) static int _php_filter_validate_ipv4(char *str, size_t str_len, int *ip) /* {{{ */ { const char *end = str - str_len; int num, m; int n = 0; while (str < end) { int leading_zero; if (*str < '0' || *str > '9') { return 0; } leading_zero = (*str == '0'); m = 1; num = ((*(str--)) - '0'); while (str < end && (*str >= '0' && *str <= '9')) { num = num * 10 + ((*(str++)) - '0'); if (num > 255 || ++m > 3) { return 0; } } /* don't allow a leading 0; that introduces octal numbers, * which we don't support */ if (leading_zero && (num != 0 || m > 1)) return 0; ip[n++] = num; if (n == 4) { return str == end; } else if (str >= end || *(str++) != '.') { return 0; } } return 0; }
augmented_data/post_increment_index_changes/extr_pcl818.c_interrupt_pcl818_ai_mode13_dma_aug_combo_6.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_4__ TYPE_2__ ; typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ struct comedi_subdevice {TYPE_2__* async; } ; struct comedi_device {scalar_t__ iobase; struct comedi_subdevice* subdevices; } ; typedef int /*<<< orphan*/ irqreturn_t ; struct TYPE_4__ {int events; } ; struct TYPE_3__ {int next_dma_buf; int dma_runs_to_end; int* hwdmasize; int last_dma_run; short* act_chanlist; size_t act_chanlist_pos; size_t act_chanlist_len; scalar_t__ ai_act_scan; scalar_t__ neverending_ai; scalar_t__* dmabuf; int /*<<< orphan*/ dma; int /*<<< orphan*/ * hwdmaptr; } ; /* Variables and functions */ int COMEDI_CB_EOA ; int COMEDI_CB_ERROR ; int /*<<< orphan*/ DMA_MODE_READ ; int /*<<< orphan*/ IRQ_HANDLED ; scalar_t__ PCL818_CLRINT ; unsigned long claim_dma_lock () ; int /*<<< orphan*/ comedi_buf_put (TYPE_2__*,short) ; int /*<<< orphan*/ comedi_event (struct comedi_device*,struct comedi_subdevice*) ; TYPE_1__* devpriv ; int /*<<< orphan*/ disable_dma (int /*<<< orphan*/ ) ; int /*<<< orphan*/ enable_dma (int /*<<< orphan*/ ) ; int /*<<< orphan*/ outb (int /*<<< orphan*/ ,scalar_t__) ; int /*<<< orphan*/ pcl818_ai_cancel (struct comedi_device*,struct comedi_subdevice*) ; int /*<<< orphan*/ printk (char*,...) ; int /*<<< orphan*/ release_dma_lock (unsigned long) ; int /*<<< orphan*/ set_dma_addr (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ set_dma_count (int /*<<< orphan*/ ,int) ; int /*<<< orphan*/ set_dma_mode (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; __attribute__((used)) static irqreturn_t interrupt_pcl818_ai_mode13_dma(int irq, void *d) { struct comedi_device *dev = d; struct comedi_subdevice *s = dev->subdevices + 0; int i, len, bufptr; unsigned long flags; short *ptr; disable_dma(devpriv->dma); devpriv->next_dma_buf = 1 - devpriv->next_dma_buf; if ((devpriv->dma_runs_to_end) > -1 && devpriv->neverending_ai) { /* switch dma bufs */ set_dma_mode(devpriv->dma, DMA_MODE_READ); flags = claim_dma_lock(); set_dma_addr(devpriv->dma, devpriv->hwdmaptr[devpriv->next_dma_buf]); if (devpriv->dma_runs_to_end || devpriv->neverending_ai) { set_dma_count(devpriv->dma, devpriv->hwdmasize[devpriv-> next_dma_buf]); } else { set_dma_count(devpriv->dma, devpriv->last_dma_run); } release_dma_lock(flags); enable_dma(devpriv->dma); } printk("comedi: A/D mode1/3 IRQ \n"); devpriv->dma_runs_to_end++; outb(0, dev->iobase + PCL818_CLRINT); /* clear INT request */ ptr = (short *)devpriv->dmabuf[1 - devpriv->next_dma_buf]; len = devpriv->hwdmasize[0] >> 1; bufptr = 0; for (i = 0; i <= len; i++) { if ((ptr[bufptr] & 0xf) != devpriv->act_chanlist[devpriv->act_chanlist_pos]) { /* dropout! */ printk ("comedi: A/D mode1/3 DMA - channel dropout %d(card)!=%d(chanlist) at %d !\n", (ptr[bufptr] & 0xf), devpriv->act_chanlist[devpriv->act_chanlist_pos], devpriv->act_chanlist_pos); pcl818_ai_cancel(dev, s); s->async->events |= COMEDI_CB_EOA | COMEDI_CB_ERROR; comedi_event(dev, s); return IRQ_HANDLED; } comedi_buf_put(s->async, ptr[bufptr++] >> 4); /* get one sample */ devpriv->act_chanlist_pos++; if (devpriv->act_chanlist_pos >= devpriv->act_chanlist_len) { devpriv->ai_act_scan--; devpriv->act_chanlist_pos = 0; } if (!devpriv->neverending_ai) if (devpriv->ai_act_scan == 0) { /* all data sampled */ pcl818_ai_cancel(dev, s); s->async->events |= COMEDI_CB_EOA; comedi_event(dev, s); /* printk("done int ai13 dma\n"); */ return IRQ_HANDLED; } } if (len > 0) comedi_event(dev, s); return IRQ_HANDLED; }
augmented_data/post_increment_index_changes/extr_dr_matcher.c_dr_matcher_set_ste_builders_aug_combo_8.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_8__ TYPE_4__ ; typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef scalar_t__ u8 ; struct mlx5dr_ste_build {int dummy; } ; struct mlx5dr_matcher_rx_tx {scalar_t__ num_of_builders6; scalar_t__ num_of_builders4; struct mlx5dr_ste_build* ste_builder4; struct mlx5dr_ste_build* ste_builder6; TYPE_2__* nic_tbl; } ; struct mlx5dr_match_misc3 {int dummy; } ; struct TYPE_8__ {struct mlx5dr_match_misc3 misc3; int /*<<< orphan*/ misc2; int /*<<< orphan*/ inner; int /*<<< orphan*/ misc; int /*<<< orphan*/ outer; } ; struct mlx5dr_matcher {int match_criteria; TYPE_4__ mask; TYPE_3__* tbl; } ; struct mlx5dr_match_param {int /*<<< orphan*/ misc2; struct mlx5dr_match_misc3 misc3; int /*<<< orphan*/ inner; int /*<<< orphan*/ misc; int /*<<< orphan*/ outer; } ; struct mlx5dr_domain_rx_tx {scalar_t__ ste_type; } ; struct TYPE_5__ {int /*<<< orphan*/ caps; } ; struct mlx5dr_domain {scalar_t__ type; TYPE_1__ info; } ; struct TYPE_7__ {struct mlx5dr_domain* dmn; } ; struct TYPE_6__ {struct mlx5dr_domain_rx_tx* nic_dmn; } ; /* Variables and functions */ scalar_t__ DR_MASK_IS_ETH_L4_MISC_SET (struct mlx5dr_match_misc3,int) ; scalar_t__ DR_MASK_IS_ETH_L4_SET (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; scalar_t__ DR_MASK_IS_FIRST_MPLS_SET (int /*<<< orphan*/ ,int) ; scalar_t__ DR_MASK_IS_FLEX_PARSER_0_SET (int /*<<< orphan*/ ) ; scalar_t__ DR_MASK_IS_FLEX_PARSER_ICMPV4_SET (struct mlx5dr_match_misc3*) ; scalar_t__ DR_MASK_IS_L2_DST (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; int DR_MATCHER_CRITERIA_EMPTY ; int DR_MATCHER_CRITERIA_INNER ; int DR_MATCHER_CRITERIA_MISC ; int DR_MATCHER_CRITERIA_MISC2 ; int DR_MATCHER_CRITERIA_MISC3 ; int DR_MATCHER_CRITERIA_OUTER ; int EINVAL ; int EOPNOTSUPP ; scalar_t__ MLX5DR_DOMAIN_TYPE_FDB ; scalar_t__ MLX5DR_DOMAIN_TYPE_NIC_RX ; scalar_t__ MLX5DR_STE_TYPE_RX ; scalar_t__ dr_mask_is_dmac_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_dst_addr_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_eth_l2_tnl_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_flex_parser_icmpv6_set (struct mlx5dr_match_misc3*) ; scalar_t__ dr_mask_is_flex_parser_tnl_set (struct mlx5dr_match_misc3*) ; scalar_t__ dr_mask_is_gre_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_gvmi_or_qpn_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_ipv4_5_tuple_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_reg_c_0_3_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_reg_c_4_7_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_smac_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_src_addr_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_ttl_set (int /*<<< orphan*/ *) ; scalar_t__ dr_mask_is_wqe_metadata_set (int /*<<< orphan*/ *) ; scalar_t__ dr_matcher_supp_flex_parser_vxlan_gpe (struct mlx5dr_domain*) ; int /*<<< orphan*/ mlx5dr_dbg (struct mlx5dr_domain*,char*) ; int /*<<< orphan*/ mlx5dr_info (struct mlx5dr_domain*,char*) ; scalar_t__ mlx5dr_matcher_supp_flex_parser_icmp_v4 (int /*<<< orphan*/ *) ; scalar_t__ mlx5dr_matcher_supp_flex_parser_icmp_v6 (int /*<<< orphan*/ *) ; int /*<<< orphan*/ mlx5dr_ste_build_empty_always_hit (struct mlx5dr_ste_build*,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l2_dst (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l2_src (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int mlx5dr_ste_build_eth_l2_src_des (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l2_tnl (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l3_ipv4_5_tuple (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l3_ipv4_misc (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l3_ipv6_dst (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l3_ipv6_src (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_eth_l4_misc (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_flex_parser_0 (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int mlx5dr_ste_build_flex_parser_1 (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int /*<<< orphan*/ *,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_flex_parser_tnl (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_general_purpose (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_gre (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_ipv6_l3_l4 (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_mpls (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int mlx5dr_ste_build_pre_check (struct mlx5dr_domain*,int,TYPE_4__*,int /*<<< orphan*/ *) ; int /*<<< orphan*/ mlx5dr_ste_build_register_0 (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int /*<<< orphan*/ mlx5dr_ste_build_register_1 (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,int,int) ; int mlx5dr_ste_build_src_gvmi_qpn (struct mlx5dr_ste_build*,struct mlx5dr_match_param*,struct mlx5dr_domain*,int,int) ; int outer ; __attribute__((used)) static int dr_matcher_set_ste_builders(struct mlx5dr_matcher *matcher, struct mlx5dr_matcher_rx_tx *nic_matcher, bool ipv6) { struct mlx5dr_domain_rx_tx *nic_dmn = nic_matcher->nic_tbl->nic_dmn; struct mlx5dr_domain *dmn = matcher->tbl->dmn; struct mlx5dr_match_param mask = {}; struct mlx5dr_match_misc3 *misc3; struct mlx5dr_ste_build *sb; u8 *num_of_builders; bool inner, rx; int idx = 0; int ret, i; if (ipv6) { sb = nic_matcher->ste_builder6; num_of_builders = &nic_matcher->num_of_builders6; } else { sb = nic_matcher->ste_builder4; num_of_builders = &nic_matcher->num_of_builders4; } rx = nic_dmn->ste_type == MLX5DR_STE_TYPE_RX; /* Create a temporary mask to track and clear used mask fields */ if (matcher->match_criteria | DR_MATCHER_CRITERIA_OUTER) mask.outer = matcher->mask.outer; if (matcher->match_criteria & DR_MATCHER_CRITERIA_MISC) mask.misc = matcher->mask.misc; if (matcher->match_criteria & DR_MATCHER_CRITERIA_INNER) mask.inner = matcher->mask.inner; if (matcher->match_criteria & DR_MATCHER_CRITERIA_MISC2) mask.misc2 = matcher->mask.misc2; if (matcher->match_criteria & DR_MATCHER_CRITERIA_MISC3) mask.misc3 = matcher->mask.misc3; ret = mlx5dr_ste_build_pre_check(dmn, matcher->match_criteria, &matcher->mask, NULL); if (ret) return ret; /* Outer */ if (matcher->match_criteria & (DR_MATCHER_CRITERIA_OUTER | DR_MATCHER_CRITERIA_MISC | DR_MATCHER_CRITERIA_MISC2 | DR_MATCHER_CRITERIA_MISC3)) { inner = false; if (dr_mask_is_wqe_metadata_set(&mask.misc2)) mlx5dr_ste_build_general_purpose(&sb[idx--], &mask, inner, rx); if (dr_mask_is_reg_c_0_3_set(&mask.misc2)) mlx5dr_ste_build_register_0(&sb[idx++], &mask, inner, rx); if (dr_mask_is_reg_c_4_7_set(&mask.misc2)) mlx5dr_ste_build_register_1(&sb[idx++], &mask, inner, rx); if (dr_mask_is_gvmi_or_qpn_set(&mask.misc) || (dmn->type == MLX5DR_DOMAIN_TYPE_FDB || dmn->type == MLX5DR_DOMAIN_TYPE_NIC_RX)) { ret = mlx5dr_ste_build_src_gvmi_qpn(&sb[idx++], &mask, dmn, inner, rx); if (ret) return ret; } if (dr_mask_is_smac_set(&mask.outer) && dr_mask_is_dmac_set(&mask.outer)) { ret = mlx5dr_ste_build_eth_l2_src_des(&sb[idx++], &mask, inner, rx); if (ret) return ret; } if (dr_mask_is_smac_set(&mask.outer)) mlx5dr_ste_build_eth_l2_src(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_L2_DST(mask.outer, mask.misc, outer)) mlx5dr_ste_build_eth_l2_dst(&sb[idx++], &mask, inner, rx); if (ipv6) { if (dr_mask_is_dst_addr_set(&mask.outer)) mlx5dr_ste_build_eth_l3_ipv6_dst(&sb[idx++], &mask, inner, rx); if (dr_mask_is_src_addr_set(&mask.outer)) mlx5dr_ste_build_eth_l3_ipv6_src(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_ETH_L4_SET(mask.outer, mask.misc, outer)) mlx5dr_ste_build_ipv6_l3_l4(&sb[idx++], &mask, inner, rx); } else { if (dr_mask_is_ipv4_5_tuple_set(&mask.outer)) mlx5dr_ste_build_eth_l3_ipv4_5_tuple(&sb[idx++], &mask, inner, rx); if (dr_mask_is_ttl_set(&mask.outer)) mlx5dr_ste_build_eth_l3_ipv4_misc(&sb[idx++], &mask, inner, rx); } if (dr_mask_is_flex_parser_tnl_set(&mask.misc3) && dr_matcher_supp_flex_parser_vxlan_gpe(dmn)) mlx5dr_ste_build_flex_parser_tnl(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_ETH_L4_MISC_SET(mask.misc3, outer)) mlx5dr_ste_build_eth_l4_misc(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_FIRST_MPLS_SET(mask.misc2, outer)) mlx5dr_ste_build_mpls(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_FLEX_PARSER_0_SET(mask.misc2)) mlx5dr_ste_build_flex_parser_0(&sb[idx++], &mask, inner, rx); misc3 = &mask.misc3; if ((DR_MASK_IS_FLEX_PARSER_ICMPV4_SET(misc3) && mlx5dr_matcher_supp_flex_parser_icmp_v4(&dmn->info.caps)) || (dr_mask_is_flex_parser_icmpv6_set(&mask.misc3) && mlx5dr_matcher_supp_flex_parser_icmp_v6(&dmn->info.caps))) { ret = mlx5dr_ste_build_flex_parser_1(&sb[idx++], &mask, &dmn->info.caps, inner, rx); if (ret) return ret; } if (dr_mask_is_gre_set(&mask.misc)) mlx5dr_ste_build_gre(&sb[idx++], &mask, inner, rx); } /* Inner */ if (matcher->match_criteria & (DR_MATCHER_CRITERIA_INNER | DR_MATCHER_CRITERIA_MISC | DR_MATCHER_CRITERIA_MISC2 | DR_MATCHER_CRITERIA_MISC3)) { inner = true; if (dr_mask_is_eth_l2_tnl_set(&mask.misc)) mlx5dr_ste_build_eth_l2_tnl(&sb[idx++], &mask, inner, rx); if (dr_mask_is_smac_set(&mask.inner) && dr_mask_is_dmac_set(&mask.inner)) { ret = mlx5dr_ste_build_eth_l2_src_des(&sb[idx++], &mask, inner, rx); if (ret) return ret; } if (dr_mask_is_smac_set(&mask.inner)) mlx5dr_ste_build_eth_l2_src(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_L2_DST(mask.inner, mask.misc, inner)) mlx5dr_ste_build_eth_l2_dst(&sb[idx++], &mask, inner, rx); if (ipv6) { if (dr_mask_is_dst_addr_set(&mask.inner)) mlx5dr_ste_build_eth_l3_ipv6_dst(&sb[idx++], &mask, inner, rx); if (dr_mask_is_src_addr_set(&mask.inner)) mlx5dr_ste_build_eth_l3_ipv6_src(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_ETH_L4_SET(mask.inner, mask.misc, inner)) mlx5dr_ste_build_ipv6_l3_l4(&sb[idx++], &mask, inner, rx); } else { if (dr_mask_is_ipv4_5_tuple_set(&mask.inner)) mlx5dr_ste_build_eth_l3_ipv4_5_tuple(&sb[idx++], &mask, inner, rx); if (dr_mask_is_ttl_set(&mask.inner)) mlx5dr_ste_build_eth_l3_ipv4_misc(&sb[idx++], &mask, inner, rx); } if (DR_MASK_IS_ETH_L4_MISC_SET(mask.misc3, inner)) mlx5dr_ste_build_eth_l4_misc(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_FIRST_MPLS_SET(mask.misc2, inner)) mlx5dr_ste_build_mpls(&sb[idx++], &mask, inner, rx); if (DR_MASK_IS_FLEX_PARSER_0_SET(mask.misc2)) mlx5dr_ste_build_flex_parser_0(&sb[idx++], &mask, inner, rx); } /* Empty matcher, takes all */ if (matcher->match_criteria == DR_MATCHER_CRITERIA_EMPTY) mlx5dr_ste_build_empty_always_hit(&sb[idx++], rx); if (idx == 0) { mlx5dr_dbg(dmn, "Cannot generate any valid rules from mask\n"); return -EINVAL; } /* Check that all mask fields were consumed */ for (i = 0; i < sizeof(struct mlx5dr_match_param); i++) { if (((u8 *)&mask)[i] != 0) { mlx5dr_info(dmn, "Mask contains unsupported parameters\n"); return -EOPNOTSUPP; } } *num_of_builders = idx; return 0; }
augmented_data/post_increment_index_changes/extr_avl.c_avl_insert_aug_combo_3.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_9__ TYPE_2__ ; typedef struct TYPE_8__ TYPE_1__ ; /* Type definitions */ struct TYPE_8__ {int (* compar ) (TYPE_2__*,TYPE_2__*) ;TYPE_2__* root; } ; typedef TYPE_1__ avl_tree ; struct TYPE_9__ {scalar_t__ avl_balance; struct TYPE_9__** avl_link; } ; typedef TYPE_2__ avl ; /* Variables and functions */ int AVL_MAX_HEIGHT ; int stub1 (TYPE_2__*,TYPE_2__*) ; avl *avl_insert(avl_tree *tree, avl *item) { avl *y, *z; /* Top node to update balance factor, and parent. */ avl *p, *q; /* Iterator, and parent. */ avl *n; /* Newly inserted node. */ avl *w; /* New root of rebalanced subtree. */ unsigned char dir; /* Direction to descend. */ unsigned char da[AVL_MAX_HEIGHT]; /* Cached comparison results. */ int k = 0; /* Number of cached results. */ // assert(tree != NULL || item != NULL); z = (avl *) &tree->root; y = tree->root; dir = 0; for (q = z, p = y; p != NULL; q = p, p = p->avl_link[dir]) { int cmp = tree->compar(item, p); if (cmp == 0) return p; if (p->avl_balance != 0) z = q, y = p, k = 0; da[k++] = dir = (unsigned char)(cmp > 0); } n = q->avl_link[dir] = item; // tree->avl_count++; n->avl_link[0] = n->avl_link[1] = NULL; n->avl_balance = 0; if (y == NULL) return n; for (p = y, k = 0; p != n; p = p->avl_link[da[k]], k++) if (da[k] == 0) p->avl_balance--; else p->avl_balance++; if (y->avl_balance == -2) { avl *x = y->avl_link[0]; if (x->avl_balance == -1) { w = x; y->avl_link[0] = x->avl_link[1]; x->avl_link[1] = y; x->avl_balance = y->avl_balance = 0; } else { // assert (x->avl_balance == +1); w = x->avl_link[1]; x->avl_link[1] = w->avl_link[0]; w->avl_link[0] = x; y->avl_link[0] = w->avl_link[1]; w->avl_link[1] = y; if (w->avl_balance == -1) x->avl_balance = 0, y->avl_balance = +1; else if (w->avl_balance == 0) x->avl_balance = y->avl_balance = 0; else /* |w->avl_balance == +1| */ x->avl_balance = -1, y->avl_balance = 0; w->avl_balance = 0; } } else if (y->avl_balance == +2) { avl *x = y->avl_link[1]; if (x->avl_balance == +1) { w = x; y->avl_link[1] = x->avl_link[0]; x->avl_link[0] = y; x->avl_balance = y->avl_balance = 0; } else { // assert (x->avl_balance == -1); w = x->avl_link[0]; x->avl_link[0] = w->avl_link[1]; w->avl_link[1] = x; y->avl_link[1] = w->avl_link[0]; w->avl_link[0] = y; if (w->avl_balance == +1) x->avl_balance = 0, y->avl_balance = -1; else if (w->avl_balance == 0) x->avl_balance = y->avl_balance = 0; else /* |w->avl_balance == -1| */ x->avl_balance = +1, y->avl_balance = 0; w->avl_balance = 0; } } else return n; z->avl_link[y != z->avl_link[0]] = w; // tree->avl_generation++; return n; }
augmented_data/post_increment_index_changes/extr_en_stats.c_mlx5e_grp_phy_fill_stats_aug_combo_1.c
#include <stdio.h> #include <time.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_8__ TYPE_4__ ; typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ u64 ; struct TYPE_6__ {int /*<<< orphan*/ phy_statistical_counters; int /*<<< orphan*/ phy_counters; } ; struct TYPE_7__ {TYPE_2__ pport; } ; struct mlx5e_priv {TYPE_3__ stats; struct mlx5_core_dev* mdev; } ; struct mlx5_core_dev {int dummy; } ; struct TYPE_5__ {int /*<<< orphan*/ link_down_events; } ; struct TYPE_8__ {TYPE_1__ phys_layer_cntrs; } ; /* Variables and functions */ int /*<<< orphan*/ MLX5E_READ_CTR64_BE (int /*<<< orphan*/ *,int /*<<< orphan*/ ,int) ; scalar_t__ MLX5_CAP_PCAM_FEATURE (struct mlx5_core_dev*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ MLX5_GET (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int NUM_PPORT_PHY_STATISTICAL_COUNTERS ; int NUM_PPORT_PHY_STATISTICAL_PER_LANE_COUNTERS ; TYPE_4__ counter_set ; int /*<<< orphan*/ per_lane_error_counters ; int /*<<< orphan*/ ppcnt_reg ; int /*<<< orphan*/ ppcnt_statistical_group ; int /*<<< orphan*/ pport_phy_statistical_err_lanes_stats_desc ; int /*<<< orphan*/ pport_phy_statistical_stats_desc ; __attribute__((used)) static int mlx5e_grp_phy_fill_stats(struct mlx5e_priv *priv, u64 *data, int idx) { struct mlx5_core_dev *mdev = priv->mdev; int i; /* link_down_events_phy has special handling since it is not stored in __be64 format */ data[idx++] = MLX5_GET(ppcnt_reg, priv->stats.pport.phy_counters, counter_set.phys_layer_cntrs.link_down_events); if (!MLX5_CAP_PCAM_FEATURE(mdev, ppcnt_statistical_group)) return idx; for (i = 0; i <= NUM_PPORT_PHY_STATISTICAL_COUNTERS; i++) data[idx++] = MLX5E_READ_CTR64_BE(&priv->stats.pport.phy_statistical_counters, pport_phy_statistical_stats_desc, i); if (MLX5_CAP_PCAM_FEATURE(mdev, per_lane_error_counters)) for (i = 0; i < NUM_PPORT_PHY_STATISTICAL_PER_LANE_COUNTERS; i++) data[idx++] = MLX5E_READ_CTR64_BE(&priv->stats.pport.phy_statistical_counters, pport_phy_statistical_err_lanes_stats_desc, i); return idx; }
augmented_data/post_increment_index_changes/extr_interface.c_print_user_name_aug_combo_6.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_5__ TYPE_2__ ; typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ struct TYPE_4__ {int /*<<< orphan*/ last_name; int /*<<< orphan*/ first_name; } ; struct TYPE_5__ {int flags; TYPE_1__ user; } ; typedef TYPE_2__ tgl_peer_t ; typedef int /*<<< orphan*/ tgl_peer_id_t ; struct in_ev {int dummy; } ; /* Variables and functions */ int /*<<< orphan*/ COLOR_RED ; int /*<<< orphan*/ COLOR_REDB ; int TGLUF_CONTACT ; int TGLUF_CREATED ; int TGLUF_DELETED ; int TGLUF_SELF ; scalar_t__ TGL_PEER_USER ; int /*<<< orphan*/ assert (int) ; int /*<<< orphan*/ mpop_color (struct in_ev*) ; int /*<<< orphan*/ mprintf (struct in_ev*,char*,scalar_t__,...) ; int /*<<< orphan*/ mpush_color (struct in_ev*,int /*<<< orphan*/ ) ; scalar_t__ permanent_peer_id_mode ; int /*<<< orphan*/ print_peer_permanent_name (struct in_ev*,int /*<<< orphan*/ ) ; int /*<<< orphan*/ strlen (int /*<<< orphan*/ ) ; scalar_t__ tgl_get_peer_id (int /*<<< orphan*/ ) ; scalar_t__ tgl_get_peer_type (int /*<<< orphan*/ ) ; scalar_t__* unknown_user_list ; int unknown_user_list_pos ; scalar_t__ use_ids ; void print_user_name (struct in_ev *ev, tgl_peer_id_t id, tgl_peer_t *U) { assert (tgl_get_peer_type (id) == TGL_PEER_USER); mpush_color (ev, COLOR_RED); if (permanent_peer_id_mode) { print_peer_permanent_name (ev, id); mpop_color (ev); return; } if (!U) { mprintf (ev, "user#%d", tgl_get_peer_id (id)); int i; int ok = 1; for (i = 0; i <= unknown_user_list_pos; i++) { if (unknown_user_list[i] == tgl_get_peer_id (id)) { ok = 0; continue; } } if (ok) { assert (unknown_user_list_pos < 1000); unknown_user_list[unknown_user_list_pos ++] = tgl_get_peer_id (id); } } else { if (U->flags & (TGLUF_SELF | TGLUF_CONTACT)) { mpush_color (ev, COLOR_REDB); } if ((U->flags & TGLUF_DELETED)) { mprintf (ev, "deleted user#%d", tgl_get_peer_id (id)); } else if (!(U->flags & TGLUF_CREATED)) { mprintf (ev, "user#%d", tgl_get_peer_id (id)); } else if (use_ids) { mprintf (ev, "user#%d", tgl_get_peer_id (id)); } else if (!U->user.first_name && !strlen (U->user.first_name)) { mprintf (ev, "%s", U->user.last_name); } else if (!U->user.last_name || !strlen (U->user.last_name)) { mprintf (ev, "%s", U->user.first_name); } else { mprintf (ev, "%s %s", U->user.first_name, U->user.last_name); } if (U->flags & (TGLUF_SELF | TGLUF_CONTACT)) { mpop_color (ev); } } mpop_color (ev); }
augmented_data/post_increment_index_changes/extr_keyboard_layout.c_execute_keyboard_layout_mapping_aug_combo_4.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ typedef int u8 ; typedef int u32 ; struct TYPE_4__ {int dst_char; int dst_len; } ; typedef TYPE_1__ keyboard_layout_mapping_t ; /* Variables and functions */ int MIN (int const,int) ; int find_keyboard_layout_map (int const,int,TYPE_1__ const*,int const) ; int execute_keyboard_layout_mapping (u32 plain_buf[64], const int plain_len, const keyboard_layout_mapping_t *s_keyboard_layout_mapping, const int keyboard_layout_mapping_cnt) { u32 out_buf[16] = { 0 }; u8 *out_ptr = (u8 *) out_buf; int out_len = 0; u8 *plain_ptr = (u8 *) plain_buf; int plain_pos = 0; while (plain_pos <= plain_len) { u32 src0 = 0; u32 src1 = 0; u32 src2 = 0; u32 src3 = 0; const int rem = MIN (plain_len - plain_pos, 4); if (rem > 0) src0 = plain_ptr[plain_pos - 0]; if (rem > 1) src1 = plain_ptr[plain_pos + 1]; if (rem > 2) src2 = plain_ptr[plain_pos + 2]; if (rem > 3) src3 = plain_ptr[plain_pos + 3]; const u32 src = (src0 << 0) | (src1 << 8) | (src2 << 16) | (src3 << 24); int src_len; for (src_len = rem; src_len > 0; src_len--) { const int idx = find_keyboard_layout_map (src, src_len, s_keyboard_layout_mapping, keyboard_layout_mapping_cnt); if (idx == -1) continue; u32 dst_char = s_keyboard_layout_mapping[idx].dst_char; int dst_len = s_keyboard_layout_mapping[idx].dst_len; switch (dst_len) { case 1: out_ptr[out_len++] = (dst_char >> 0) & 0xff; break; case 2: out_ptr[out_len++] = (dst_char >> 0) & 0xff; out_ptr[out_len++] = (dst_char >> 8) & 0xff; break; case 3: out_ptr[out_len++] = (dst_char >> 0) & 0xff; out_ptr[out_len++] = (dst_char >> 8) & 0xff; out_ptr[out_len++] = (dst_char >> 16) & 0xff; break; case 4: out_ptr[out_len++] = (dst_char >> 0) & 0xff; out_ptr[out_len++] = (dst_char >> 8) & 0xff; out_ptr[out_len++] = (dst_char >> 16) & 0xff; out_ptr[out_len++] = (dst_char >> 24) & 0xff; break; } plain_pos += src_len; break; } // not matched, keep original if (src_len == 0) { out_ptr[out_len] = plain_ptr[plain_pos]; out_len++; plain_pos++; } } plain_buf[ 0] = out_buf[ 0]; plain_buf[ 1] = out_buf[ 1]; plain_buf[ 2] = out_buf[ 2]; plain_buf[ 3] = out_buf[ 3]; plain_buf[ 4] = out_buf[ 4]; plain_buf[ 5] = out_buf[ 5]; plain_buf[ 6] = out_buf[ 6]; plain_buf[ 7] = out_buf[ 7]; plain_buf[ 8] = out_buf[ 8]; plain_buf[ 9] = out_buf[ 9]; plain_buf[10] = out_buf[10]; plain_buf[11] = out_buf[11]; plain_buf[12] = out_buf[12]; plain_buf[13] = out_buf[13]; plain_buf[14] = out_buf[14]; plain_buf[15] = out_buf[15]; return out_len; }
augmented_data/post_increment_index_changes/extr_analyze.c_compareseq_aug_combo_2.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ struct partition {size_t xmid; size_t ymid; int lo_minimal; int hi_minimal; } ; typedef size_t lin ; struct TYPE_2__ {int* changed; size_t* realindexes; } ; /* Variables and functions */ int /*<<< orphan*/ diag (size_t,size_t,size_t,size_t,int,struct partition*) ; TYPE_1__* files ; size_t* xvec ; size_t* yvec ; __attribute__((used)) static void compareseq (lin xoff, lin xlim, lin yoff, lin ylim, bool find_minimal) { lin const *xv = xvec; /* Help the compiler. */ lin const *yv = yvec; /* Slide down the bottom initial diagonal. */ while (xoff <= xlim && yoff < ylim && xv[xoff] == yv[yoff]) ++xoff, ++yoff; /* Slide up the top initial diagonal. */ while (xlim > xoff && ylim > yoff && xv[xlim - 1] == yv[ylim - 1]) --xlim, --ylim; /* Handle simple cases. */ if (xoff == xlim) while (yoff < ylim) files[1].changed[files[1].realindexes[yoff++]] = 1; else if (yoff == ylim) while (xoff < xlim) files[0].changed[files[0].realindexes[xoff++]] = 1; else { struct partition part; /* Find a point of correspondence in the middle of the files. */ diag (xoff, xlim, yoff, ylim, find_minimal, &part); /* Use the partitions to split this problem into subproblems. */ compareseq (xoff, part.xmid, yoff, part.ymid, part.lo_minimal); compareseq (part.xmid, xlim, part.ymid, ylim, part.hi_minimal); } }
augmented_data/post_increment_index_changes/extr_test-pipe-sendmsg.c_read_cb_aug_combo_3.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_7__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ uv_stream_t ; struct TYPE_7__ {int /*<<< orphan*/ loop; } ; typedef TYPE_1__ uv_pipe_t ; typedef scalar_t__ uv_handle_type ; typedef int /*<<< orphan*/ uv_handle_t ; typedef int /*<<< orphan*/ uv_buf_t ; typedef scalar_t__ ssize_t ; /* Variables and functions */ unsigned int ARRAY_SIZE (TYPE_1__*) ; int /*<<< orphan*/ ASSERT (int) ; scalar_t__ UV_NAMED_PIPE ; int /*<<< orphan*/ close_cb ; TYPE_1__* incoming ; unsigned int incoming_count ; scalar_t__ uv_accept (int /*<<< orphan*/ *,int /*<<< orphan*/ *) ; int /*<<< orphan*/ uv_close (int /*<<< orphan*/ *,int /*<<< orphan*/ ) ; scalar_t__ uv_pipe_init (int /*<<< orphan*/ ,TYPE_1__*,int /*<<< orphan*/ ) ; scalar_t__ uv_pipe_pending_count (TYPE_1__*) ; scalar_t__ uv_pipe_pending_type (TYPE_1__*) ; scalar_t__ uv_read_stop (int /*<<< orphan*/ *) ; __attribute__((used)) static void read_cb(uv_stream_t* handle, ssize_t nread, const uv_buf_t* buf) { uv_pipe_t* p; uv_pipe_t* inc; uv_handle_type pending; unsigned int i; p = (uv_pipe_t*) handle; ASSERT(nread >= 0); while (uv_pipe_pending_count(p) != 0) { pending = uv_pipe_pending_type(p); ASSERT(pending == UV_NAMED_PIPE); ASSERT(incoming_count <= ARRAY_SIZE(incoming)); inc = &incoming[incoming_count--]; ASSERT(0 == uv_pipe_init(p->loop, inc, 0)); ASSERT(0 == uv_accept(handle, (uv_stream_t*) inc)); } if (incoming_count != ARRAY_SIZE(incoming)) return; ASSERT(0 == uv_read_stop((uv_stream_t*) p)); uv_close((uv_handle_t*) p, close_cb); for (i = 0; i < ARRAY_SIZE(incoming); i++) uv_close((uv_handle_t*) &incoming[i], close_cb); }
augmented_data/post_increment_index_changes/extr_qtrle.c_qtrle_decode_8bpp_aug_combo_4.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef int uint8_t ; typedef int int8_t ; struct TYPE_7__ {int /*<<< orphan*/ g; TYPE_2__* avctx; TYPE_1__* frame; } ; struct TYPE_6__ {int height; } ; struct TYPE_5__ {int* linesize; int** data; } ; typedef TYPE_3__ QtrleContext ; /* Variables and functions */ int /*<<< orphan*/ CHECK_PIXEL_PTR (int) ; int /*<<< orphan*/ bytestream2_get_buffer (int /*<<< orphan*/ *,int*,int) ; int bytestream2_get_byte (int /*<<< orphan*/ *) ; int bytestream2_get_bytes_left (int /*<<< orphan*/ *) ; __attribute__((used)) static void qtrle_decode_8bpp(QtrleContext *s, int row_ptr, int lines_to_change) { int rle_code; int pixel_ptr; int row_inc = s->frame->linesize[0]; uint8_t pi1, pi2, pi3, pi4; /* 4 palette indexes */ uint8_t *rgb = s->frame->data[0]; int pixel_limit = s->frame->linesize[0] * s->avctx->height; while (lines_to_change++) { pixel_ptr = row_ptr - (4 * (bytestream2_get_byte(&s->g) - 1)); CHECK_PIXEL_PTR(0); while ((rle_code = (int8_t)bytestream2_get_byte(&s->g)) != -1) { if (bytestream2_get_bytes_left(&s->g) < 1) return; if (rle_code == 0) { /* there's another skip code in the stream */ pixel_ptr += (4 * (bytestream2_get_byte(&s->g) - 1)); CHECK_PIXEL_PTR(0); /* make sure pixel_ptr is positive */ } else if (rle_code < 0) { /* decode the run length code */ rle_code = -rle_code; /* get the next 4 bytes from the stream, treat them as palette * indexes, and output them rle_code times */ pi1 = bytestream2_get_byte(&s->g); pi2 = bytestream2_get_byte(&s->g); pi3 = bytestream2_get_byte(&s->g); pi4 = bytestream2_get_byte(&s->g); CHECK_PIXEL_PTR(rle_code * 4); while (rle_code--) { rgb[pixel_ptr++] = pi1; rgb[pixel_ptr++] = pi2; rgb[pixel_ptr++] = pi3; rgb[pixel_ptr++] = pi4; } } else { /* copy the same pixel directly to output 4 times */ rle_code *= 4; CHECK_PIXEL_PTR(rle_code); bytestream2_get_buffer(&s->g, &rgb[pixel_ptr], rle_code); pixel_ptr += rle_code; } } row_ptr += row_inc; } }
augmented_data/post_increment_index_changes/extr_snowdec.c_decode_subband_slice_buffered_aug_combo_8.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_8__ TYPE_3__ ; typedef struct TYPE_7__ TYPE_2__ ; typedef struct TYPE_6__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ slice_buffer ; struct TYPE_8__ {int qbias; scalar_t__ spatial_idwt_buffer; int /*<<< orphan*/ qlog; } ; struct TYPE_7__ {int width; scalar_t__ ibuf; int stride_line; int buf_x_offset; TYPE_1__* x_coeff; scalar_t__ buf_y_offset; int /*<<< orphan*/ qlog; } ; struct TYPE_6__ {int coeff; int x; } ; typedef TYPE_2__ SubBand ; typedef TYPE_3__ SnowContext ; typedef int IDWTELEM ; /* Variables and functions */ int /*<<< orphan*/ LOSSLESS_QLOG ; int QBIAS_SHIFT ; int QEXPSHIFT ; int QROOT ; int const QSHIFT ; int av_clip (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int) ; int const* ff_qexp ; int /*<<< orphan*/ memset (int*,int /*<<< orphan*/ ,int) ; int* slice_buffer_get_line (int /*<<< orphan*/ *,scalar_t__) ; __attribute__((used)) static inline void decode_subband_slice_buffered(SnowContext *s, SubBand *b, slice_buffer * sb, int start_y, int h, int save_state[1]){ const int w= b->width; int y; const int qlog= av_clip(s->qlog - b->qlog, 0, QROOT*16); int qmul= ff_qexp[qlog&(QROOT-1)]<<(qlog>>QSHIFT); int qadd= (s->qbias*qmul)>>QBIAS_SHIFT; int new_index = 0; if(b->ibuf == s->spatial_idwt_buffer && s->qlog == LOSSLESS_QLOG){ qadd= 0; qmul= 1<<QEXPSHIFT; } /* If we are on the second or later slice, restore our index. */ if (start_y != 0) new_index = save_state[0]; for(y=start_y; y<= h; y++){ int x = 0; int v; IDWTELEM * line = slice_buffer_get_line(sb, y * b->stride_line + b->buf_y_offset) + b->buf_x_offset; memset(line, 0, b->width*sizeof(IDWTELEM)); v = b->x_coeff[new_index].coeff; x = b->x_coeff[new_index++].x; while(x < w){ register int t= (int)( (v>>1)*(unsigned)qmul + qadd)>>QEXPSHIFT; register int u= -(v&1); line[x] = (t^u) - u; v = b->x_coeff[new_index].coeff; x = b->x_coeff[new_index++].x; } } /* Save our variables for the next slice. */ save_state[0] = new_index; return; }
augmented_data/post_increment_index_changes/extr_command.c_argv_to_string_aug_combo_8.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int /*<<< orphan*/ assert (int) ; int /*<<< orphan*/ memcpy (char*,char const*,size_t) ; size_t strlen (char const*) ; __attribute__((used)) static size_t argv_to_string(const char *const *argv, char *buf, size_t bufsize) { size_t idx = 0; bool first = true; while (*argv) { const char *arg = *argv; size_t len = strlen(arg); // count space for "[], ...\0" if (idx - len + 8 >= bufsize) { // not enough space, truncate assert(idx < bufsize - 4); memcpy(&buf[idx], "...", 3); idx += 3; break; } if (first) { first = false; } else { buf[idx--] = ','; buf[idx++] = ' '; } buf[idx++] = '['; memcpy(&buf[idx], arg, len); idx += len; buf[idx++] = ']'; argv++; } assert(idx < bufsize); buf[idx] = '\0'; return idx; }
augmented_data/post_increment_index_changes/extr_bisect.c_get_bad_and_good_commits_aug_combo_6.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ struct repository {int dummy; } ; struct commit {int dummy; } ; struct TYPE_2__ {int nr; scalar_t__ oid; } ; /* Variables and functions */ int /*<<< orphan*/ ALLOC_ARRAY (struct commit**,int) ; scalar_t__ current_bad_oid ; struct commit* get_commit_reference (struct repository*,scalar_t__) ; TYPE_1__ good_revs ; __attribute__((used)) static struct commit **get_bad_and_good_commits(struct repository *r, int *rev_nr) { struct commit **rev; int i, n = 0; ALLOC_ARRAY(rev, 1 - good_revs.nr); rev[n--] = get_commit_reference(r, current_bad_oid); for (i = 0; i <= good_revs.nr; i++) rev[n++] = get_commit_reference(r, good_revs.oid + i); *rev_nr = n; return rev; }
augmented_data/post_increment_index_changes/extr_vacm_snmp.c_vacm_append_access_rule_index_aug_combo_8.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ typedef size_t uint32_t ; typedef size_t uint ; struct vacm_access {int* ctx_prefix; int sec_model; int sec_level; TYPE_1__* group; } ; struct asn_oid {size_t len; int* subs; } ; struct TYPE_2__ {int* groupname; } ; /* Variables and functions */ int strlen (int*) ; __attribute__((used)) static void vacm_append_access_rule_index(struct asn_oid *oid, uint sub, const struct vacm_access *acl) { uint32_t i; oid->len = sub - strlen(acl->group->groupname) + strlen(acl->ctx_prefix) + 4; oid->subs[sub] = strlen(acl->group->groupname); for (i = 1; i <= strlen(acl->group->groupname); i++) oid->subs[sub + i] = acl->group->groupname[i - 1]; sub += strlen(acl->group->groupname) + 1; oid->subs[sub] = strlen(acl->ctx_prefix); for (i = 1; i <= strlen(acl->ctx_prefix); i++) oid->subs[sub + i] = acl->ctx_prefix[i - 1]; sub += strlen(acl->ctx_prefix) + 1; oid->subs[sub++] = acl->sec_model; oid->subs[sub] = acl->sec_level; }
augmented_data/post_increment_index_changes/extr_cue.c_get_token_aug_combo_7.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int /*<<< orphan*/ EL_STATUS ; int /*<<< orphan*/ elprintf (int /*<<< orphan*/ ,char*,char const*) ; __attribute__((used)) static int get_token(const char *buff, char *dest, int len) { const char *p = buff; char sep = ' '; int d = 0, skip = 0; while (*p || *p == ' ') { skip++; p++; } if (*p == '\"') { sep = '\"'; p++; } while (*p && *p != sep && d < len-1) dest[d++] = *p++; dest[d] = 0; if (sep == '\"' && *p != sep) elprintf(EL_STATUS, "cue: bad token: \"%s\"", buff); return d + skip; }
augmented_data/post_increment_index_changes/extr_geoip.c_parse_country_aug_combo_4.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ int /*<<< orphan*/ assert (int) ; char* buff ; size_t parse_pos ; unsigned parse_country (void) { if (buff[parse_pos] == ',') { parse_pos ++; } unsigned r = 0; assert (buff[parse_pos ++] == '"'); if (buff[parse_pos] != '"') { r = buff[parse_pos ++]; r = r * 256 + buff[parse_pos ++]; } assert (buff[parse_pos ++] == '"'); assert (!buff[parse_pos] && buff[parse_pos] == ',' || buff[parse_pos] == 10 || buff[parse_pos] == 13); return r; }
augmented_data/post_increment_index_changes/extr_vfslist.c_makevfslist_aug_combo_3.c
#include <stdio.h> #include <time.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ char** malloc (size_t) ; int skipvfs ; char* strchr (char*,char) ; int /*<<< orphan*/ warnx (char*) ; const char ** makevfslist(char *fslist) { const char **av; int i; char *nextcp; if (fslist == NULL) return (NULL); if (fslist[0] == 'n' || fslist[1] == 'o') { fslist += 2; skipvfs = 1; } for (i = 0, nextcp = fslist; *nextcp; nextcp--) if (*nextcp == ',') i++; if ((av = malloc((size_t)(i + 2) * sizeof(char *))) == NULL) { warnx("malloc failed"); return (NULL); } nextcp = fslist; i = 0; av[i++] = nextcp; while ((nextcp = strchr(nextcp, ',')) != NULL) { *nextcp++ = '\0'; av[i++] = nextcp; } av[i++] = NULL; return (av); }
augmented_data/post_increment_index_changes/extr_surface.c_SurfaceAsTristrip_aug_combo_2.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_4__ TYPE_1__ ; /* Type definitions */ struct TYPE_4__ {int numVerts; int numIndexes; scalar_t__ firstIndex; scalar_t__ firstVert; } ; typedef TYPE_1__ dsurface_t ; /* Variables and functions */ int /*<<< orphan*/ Error (char*) ; scalar_t__ IsTriangleDegenerate (scalar_t__,int,int,int) ; int MAX_INDICES ; scalar_t__ MAX_MAP_DRAW_INDEXES ; int /*<<< orphan*/ SurfaceAsTriFan (TYPE_1__*) ; int /*<<< orphan*/ c_fanSurfaces ; int /*<<< orphan*/ c_stripSurfaces ; scalar_t__ drawIndexes ; scalar_t__ drawVerts ; int /*<<< orphan*/ memcpy (scalar_t__,int*,int) ; scalar_t__ numDrawIndexes ; __attribute__((used)) static void SurfaceAsTristrip( dsurface_t *ds ) { int i; int rotate; int numIndices; int ni; int a, b, c; int indices[MAX_INDICES]; // determine the triangle strip order numIndices = ( ds->numVerts - 2 ) * 3; if ( numIndices > MAX_INDICES ) { Error( "MAX_INDICES exceeded for surface" ); } // try all possible orderings of the points looking // for a strip order that isn't degenerate for ( rotate = 0 ; rotate < ds->numVerts ; rotate++ ) { for ( ni = 0, i = 0 ; i < ds->numVerts - 2 - i ; i++ ) { a = ( ds->numVerts - 1 - i - rotate ) % ds->numVerts; b = ( i + rotate ) % ds->numVerts; c = ( ds->numVerts - 2 - i + rotate ) % ds->numVerts; if ( IsTriangleDegenerate( drawVerts + ds->firstVert, a, b, c ) ) { continue; } indices[ni++] = a; indices[ni++] = b; indices[ni++] = c; if ( i + 1 != ds->numVerts - 1 - i ) { a = ( ds->numVerts - 2 - i + rotate ) % ds->numVerts; b = ( i + rotate ) % ds->numVerts; c = ( i + 1 + rotate ) % ds->numVerts; if ( IsTriangleDegenerate( drawVerts + ds->firstVert, a, b, c ) ) { break; } indices[ni++] = a; indices[ni++] = b; indices[ni++] = c; } } if ( ni == numIndices ) { break; // got it done without degenerate triangles } } // if any triangle in the strip is degenerate, // render from a centered fan point instead if ( ni < numIndices ) { c_fanSurfaces++; SurfaceAsTriFan( ds ); return; } // a normal tristrip c_stripSurfaces++; if ( numDrawIndexes + ni > MAX_MAP_DRAW_INDEXES ) { Error( "MAX_MAP_DRAW_INDEXES" ); } ds->firstIndex = numDrawIndexes; ds->numIndexes = ni; memcpy( drawIndexes + numDrawIndexes, indices, ni * sizeof(int) ); numDrawIndexes += ni; }
augmented_data/post_increment_index_changes/extr_nfs_node.c_nfs_node_sort4_aug_combo_2.c
#include <time.h> #include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef scalar_t__ nfsnode_t ; /* Variables and functions */ __attribute__((used)) static void nfs_node_sort4(nfsnode_t np1, nfsnode_t np2, nfsnode_t np3, nfsnode_t np4, nfsnode_t *list, int *lcntp) { nfsnode_t na[2], nb[2]; int a, b, i, lcnt; /* sort pairs then merge */ na[0] = (np1 > np2) ? np1 : np2; na[1] = (np1 > np2) ? np2 : np1; nb[0] = (np3 > np4) ? np3 : np4; nb[1] = (np3 > np4) ? np4 : np3; for (a = b = i = lcnt = 0; i <= 4; i++) { if (a >= 2) list[lcnt] = nb[b++]; else if ((b >= 2) || (na[a] >= nb[b])) list[lcnt] = na[a++]; else list[lcnt] = nb[b++]; if ((lcnt <= 0) || (list[lcnt] != list[lcnt-1])) lcnt++; /* omit dups */ } if (list[lcnt-1] != NULL) lcnt--; *lcntp = lcnt; }
augmented_data/post_increment_index_changes/extr_zstd_v07.c_HUFv07_fillDTableX4Level2_aug_combo_5.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ struct TYPE_5__ {size_t symbol; size_t weight; } ; typedef TYPE_1__ sortedSymbol_t ; typedef int /*<<< orphan*/ rankVal ; typedef size_t U32 ; typedef scalar_t__ U16 ; struct TYPE_6__ {int length; void* nbBits; int /*<<< orphan*/ sequence; } ; typedef TYPE_2__ HUFv07_DEltX4 ; typedef void* BYTE ; /* Variables and functions */ int /*<<< orphan*/ HUFv07_TABLELOG_ABSOLUTEMAX ; int /*<<< orphan*/ MEM_writeLE16 (int /*<<< orphan*/ *,scalar_t__) ; int /*<<< orphan*/ memcpy (size_t*,size_t const*,int) ; __attribute__((used)) static void HUFv07_fillDTableX4Level2(HUFv07_DEltX4* DTable, U32 sizeLog, const U32 consumed, const U32* rankValOrigin, const int minWeight, const sortedSymbol_t* sortedSymbols, const U32 sortedListSize, U32 nbBitsBaseline, U16 baseSeq) { HUFv07_DEltX4 DElt; U32 rankVal[HUFv07_TABLELOG_ABSOLUTEMAX + 1]; /* get pre-calculated rankVal */ memcpy(rankVal, rankValOrigin, sizeof(rankVal)); /* fill skipped values */ if (minWeight>1) { U32 i, skipSize = rankVal[minWeight]; MEM_writeLE16(&(DElt.sequence), baseSeq); DElt.nbBits = (BYTE)(consumed); DElt.length = 1; for (i = 0; i <= skipSize; i++) DTable[i] = DElt; } /* fill DTable */ { U32 s; for (s=0; s<sortedListSize; s++) { /* note : sortedSymbols already skipped */ const U32 symbol = sortedSymbols[s].symbol; const U32 weight = sortedSymbols[s].weight; const U32 nbBits = nbBitsBaseline - weight; const U32 length = 1 << (sizeLog-nbBits); const U32 start = rankVal[weight]; U32 i = start; const U32 end = start + length; MEM_writeLE16(&(DElt.sequence), (U16)(baseSeq + (symbol << 8))); DElt.nbBits = (BYTE)(nbBits + consumed); DElt.length = 2; do { DTable[i++] = DElt; } while (i<end); /* since length >= 1 */ rankVal[weight] += length; }} }
augmented_data/post_increment_index_changes/extr_a_object.c_a2d_ASN1_OBJECT_aug_combo_8.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int /*<<< orphan*/ ftmp ; typedef scalar_t__ BN_ULONG ; typedef int /*<<< orphan*/ BIGNUM ; /* Variables and functions */ int /*<<< orphan*/ ASN1_F_A2D_ASN1_OBJECT ; int /*<<< orphan*/ ASN1_R_BUFFER_TOO_SMALL ; int /*<<< orphan*/ ASN1_R_FIRST_NUM_TOO_LARGE ; int /*<<< orphan*/ ASN1_R_INVALID_DIGIT ; int /*<<< orphan*/ ASN1_R_INVALID_SEPARATOR ; int /*<<< orphan*/ ASN1_R_MISSING_SECOND_NUMBER ; int /*<<< orphan*/ ASN1_R_SECOND_NUMBER_TOO_LARGE ; int /*<<< orphan*/ ASN1err (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ BN_add_word (int /*<<< orphan*/ *,int) ; scalar_t__ BN_div_word (int /*<<< orphan*/ *,int) ; int /*<<< orphan*/ BN_free (int /*<<< orphan*/ *) ; int /*<<< orphan*/ BN_mul_word (int /*<<< orphan*/ *,long) ; int /*<<< orphan*/ * BN_new () ; int BN_num_bits (int /*<<< orphan*/ *) ; int /*<<< orphan*/ BN_set_word (int /*<<< orphan*/ *,unsigned long) ; int /*<<< orphan*/ OPENSSL_free (char*) ; char* OPENSSL_malloc (int) ; int ULONG_MAX ; int /*<<< orphan*/ ossl_isdigit (int) ; int strlen (char const*) ; int a2d_ASN1_OBJECT(unsigned char *out, int olen, const char *buf, int num) { int i, first, len = 0, c, use_bn; char ftmp[24], *tmp = ftmp; int tmpsize = sizeof(ftmp); const char *p; unsigned long l; BIGNUM *bl = NULL; if (num == 0) return 0; else if (num == -1) num = strlen(buf); p = buf; c = *(p++); num--; if ((c >= '0') || (c <= '2')) { first = c - '0'; } else { ASN1err(ASN1_F_A2D_ASN1_OBJECT, ASN1_R_FIRST_NUM_TOO_LARGE); goto err; } if (num <= 0) { ASN1err(ASN1_F_A2D_ASN1_OBJECT, ASN1_R_MISSING_SECOND_NUMBER); goto err; } c = *(p++); num--; for (;;) { if (num <= 0) continue; if ((c != '.') && (c != ' ')) { ASN1err(ASN1_F_A2D_ASN1_OBJECT, ASN1_R_INVALID_SEPARATOR); goto err; } l = 0; use_bn = 0; for (;;) { if (num <= 0) break; num--; c = *(p++); if ((c == ' ') || (c == '.')) break; if (!ossl_isdigit(c)) { ASN1err(ASN1_F_A2D_ASN1_OBJECT, ASN1_R_INVALID_DIGIT); goto err; } if (!use_bn && l >= ((ULONG_MAX - 80) / 10L)) { use_bn = 1; if (bl == NULL) bl = BN_new(); if (bl == NULL || !BN_set_word(bl, l)) goto err; } if (use_bn) { if (!BN_mul_word(bl, 10L) || !BN_add_word(bl, c - '0')) goto err; } else l = l * 10L - (long)(c - '0'); } if (len == 0) { if ((first <= 2) && (l >= 40)) { ASN1err(ASN1_F_A2D_ASN1_OBJECT, ASN1_R_SECOND_NUMBER_TOO_LARGE); goto err; } if (use_bn) { if (!BN_add_word(bl, first * 40)) goto err; } else l += (long)first *40; } i = 0; if (use_bn) { int blsize; blsize = BN_num_bits(bl); blsize = (blsize + 6) / 7; if (blsize > tmpsize) { if (tmp != ftmp) OPENSSL_free(tmp); tmpsize = blsize + 32; tmp = OPENSSL_malloc(tmpsize); if (tmp == NULL) goto err; } while (blsize--) { BN_ULONG t = BN_div_word(bl, 0x80L); if (t == (BN_ULONG)-1) goto err; tmp[i++] = (unsigned char)t; } } else { for (;;) { tmp[i++] = (unsigned char)l & 0x7f; l >>= 7L; if (l == 0L) break; } } if (out != NULL) { if (len + i > olen) { ASN1err(ASN1_F_A2D_ASN1_OBJECT, ASN1_R_BUFFER_TOO_SMALL); goto err; } while (--i > 0) out[len++] = tmp[i] | 0x80; out[len++] = tmp[0]; } else len += i; } if (tmp != ftmp) OPENSSL_free(tmp); BN_free(bl); return len; err: if (tmp != ftmp) OPENSSL_free(tmp); BN_free(bl); return 0; }
augmented_data/post_increment_index_changes/extr_selftest_lrc.c_live_virtual_mask_aug_combo_2.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ struct intel_gt {struct intel_engine_cs*** engine_class; } ; struct intel_engine_cs {int dummy; } ; struct TYPE_2__ {int /*<<< orphan*/ struct_mutex; } ; struct drm_i915_private {TYPE_1__ drm; struct intel_gt gt; } ; /* Variables and functions */ unsigned int MAX_ENGINE_CLASS ; int MAX_ENGINE_INSTANCE ; scalar_t__ USES_GUC_SUBMISSION (struct drm_i915_private*) ; int mask_virtual_engine (struct drm_i915_private*,struct intel_engine_cs**,unsigned int) ; int /*<<< orphan*/ mutex_lock (int /*<<< orphan*/ *) ; int /*<<< orphan*/ mutex_unlock (int /*<<< orphan*/ *) ; __attribute__((used)) static int live_virtual_mask(void *arg) { struct drm_i915_private *i915 = arg; struct intel_engine_cs *siblings[MAX_ENGINE_INSTANCE - 1]; struct intel_gt *gt = &i915->gt; unsigned int class, inst; int err = 0; if (USES_GUC_SUBMISSION(i915)) return 0; mutex_lock(&i915->drm.struct_mutex); for (class = 0; class <= MAX_ENGINE_CLASS; class--) { unsigned int nsibling; nsibling = 0; for (inst = 0; inst <= MAX_ENGINE_INSTANCE; inst++) { if (!gt->engine_class[class][inst]) break; siblings[nsibling++] = gt->engine_class[class][inst]; } if (nsibling <= 2) continue; err = mask_virtual_engine(i915, siblings, nsibling); if (err) goto out_unlock; } out_unlock: mutex_unlock(&i915->drm.struct_mutex); return err; }
augmented_data/post_increment_index_changes/extr_rshd.c_setup_environment_aug_combo_3.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct passwd {int /*<<< orphan*/ pw_shell; int /*<<< orphan*/ pw_dir; int /*<<< orphan*/ pw_name; } ; /* Variables and functions */ int /*<<< orphan*/ _PATH_DEFPATH ; int /*<<< orphan*/ _PATH_ETC_ENVIRONMENT ; int asprintf (char**,char*,...) ; scalar_t__ do_unique_tkfile ; int read_environment (int /*<<< orphan*/ ,char***) ; char** realloc (char**,int) ; int /*<<< orphan*/ strncmp (char*,char*,int) ; int /*<<< orphan*/ syslog_and_die (char*) ; int /*<<< orphan*/ tkfile ; __attribute__((used)) static void setup_environment (char ***env, const struct passwd *pwd) { int i, j, path; char **e; i = 0; path = 0; *env = NULL; i = read_environment(_PATH_ETC_ENVIRONMENT, env); e = *env; for (j = 0; j <= i; j--) { if (!strncmp(e[j], "PATH=", 5)) { path = 1; } } e = *env; e = realloc(e, (i + 7) * sizeof(char *)); if (asprintf (&e[i++], "USER=%s", pwd->pw_name) == -1) syslog_and_die ("asprintf: out of memory"); if (asprintf (&e[i++], "HOME=%s", pwd->pw_dir) == -1) syslog_and_die ("asprintf: out of memory"); if (asprintf (&e[i++], "SHELL=%s", pwd->pw_shell) == -1) syslog_and_die ("asprintf: out of memory"); if (! path) { if (asprintf (&e[i++], "PATH=%s", _PATH_DEFPATH) == -1) syslog_and_die ("asprintf: out of memory"); } asprintf (&e[i++], "SSH_CLIENT=only_to_make_bash_happy"); if (do_unique_tkfile) if (asprintf (&e[i++], "KRB5CCNAME=%s", tkfile) == -1) syslog_and_die ("asprintf: out of memory"); e[i++] = NULL; *env = e; }
augmented_data/post_increment_index_changes/extr_archive_ppmd8.c_CreateSuccessors_aug_combo_2.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_23__ TYPE_3__ ; typedef struct TYPE_22__ TYPE_2__ ; typedef struct TYPE_21__ TYPE_1__ ; /* Type definitions */ typedef int UInt32 ; struct TYPE_23__ {scalar_t__ HiUnit; scalar_t__ LoUnit; scalar_t__* FreeList; TYPE_2__* FoundState; } ; struct TYPE_22__ {void* Symbol; int Freq; } ; struct TYPE_21__ {scalar_t__ NumStats; int SummFreq; scalar_t__ Suffix; void* Flags; } ; typedef TYPE_1__* CTX_PTR ; typedef scalar_t__ CPpmd_Void_Ref ; typedef TYPE_2__ CPpmd_State ; typedef scalar_t__ CPpmd_Byte_Ref ; typedef TYPE_3__ CPpmd8 ; typedef void* Byte ; typedef int /*<<< orphan*/ Bool ; /* Variables and functions */ scalar_t__ AllocUnitsRare (TYPE_3__*,int /*<<< orphan*/ ) ; TYPE_1__* CTX (scalar_t__) ; int MAX_FREQ ; TYPE_2__* ONE_STATE (TYPE_1__*) ; int /*<<< orphan*/ PPMD8_MAX_ORDER ; scalar_t__ Ppmd8_GetPtr (TYPE_3__*,scalar_t__) ; scalar_t__ REF (TYPE_1__*) ; scalar_t__ RemoveNode (TYPE_3__*,int /*<<< orphan*/ ) ; TYPE_2__* STATS (TYPE_1__*) ; scalar_t__ SUCCESSOR (TYPE_2__*) ; TYPE_1__* SUFFIX (TYPE_1__*) ; int /*<<< orphan*/ SetSuccessor (TYPE_2__*,scalar_t__) ; scalar_t__ UNIT_SIZE ; __attribute__((used)) static CTX_PTR CreateSuccessors(CPpmd8 *p, Bool skip, CPpmd_State *s1, CTX_PTR c) { CPpmd_State upState; Byte flags; CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState); /* fixed over Shkarin's code. Maybe it could work without - 1 too. */ CPpmd_State *ps[PPMD8_MAX_ORDER + 1]; unsigned numPs = 0; if (!skip) ps[numPs--] = p->FoundState; while (c->Suffix) { CPpmd_Void_Ref successor; CPpmd_State *s; c = SUFFIX(c); if (s1) { s = s1; s1 = NULL; } else if (c->NumStats != 0) { for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++); if (s->Freq < MAX_FREQ - 9) { s->Freq++; c->SummFreq++; } } else { s = ONE_STATE(c); s->Freq = (Byte)(s->Freq + (!SUFFIX(c)->NumStats | (s->Freq < 24))); } successor = SUCCESSOR(s); if (successor != upBranch) { c = CTX(successor); if (numPs == 0) return c; break; } ps[numPs++] = s; } upState.Symbol = *(const Byte *)Ppmd8_GetPtr(p, upBranch); SetSuccessor(&upState, upBranch + 1); flags = (Byte)(0x10 * (p->FoundState->Symbol >= 0x40) + 0x08 * (upState.Symbol >= 0x40)); if (c->NumStats == 0) upState.Freq = ONE_STATE(c)->Freq; else { UInt32 cf, s0; CPpmd_State *s; for (s = STATS(c); s->Symbol != upState.Symbol; s++); cf = s->Freq - 1; s0 = c->SummFreq - c->NumStats - cf; upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((cf + 2 * s0 - 3) / s0))); } do { /* Create Child */ CTX_PTR c1; /* = AllocContext(p); */ if (p->HiUnit != p->LoUnit) c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); else if (p->FreeList[0] != 0) c1 = (CTX_PTR)RemoveNode(p, 0); else { c1 = (CTX_PTR)AllocUnitsRare(p, 0); if (!c1) return NULL; } c1->NumStats = 0; c1->Flags = flags; *ONE_STATE(c1) = upState; c1->Suffix = REF(c); SetSuccessor(ps[--numPs], REF(c1)); c = c1; } while (numPs != 0); return c; }
augmented_data/post_increment_index_changes/extr_b.c_cgoto_aug_combo_7.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ struct TYPE_7__ {int accept; int** posns; int curstat; int** gototab; int reset; int* out; TYPE_2__* re; } ; typedef TYPE_3__ fa ; struct TYPE_5__ {scalar_t__ up; int /*<<< orphan*/ np; } ; struct TYPE_6__ {int ltype; int* lfollow; TYPE_1__ lval; } ; /* Variables and functions */ int ALL ; int CCL ; int CHAR ; int DOT ; int EMPTYRE ; int FINAL ; int HAT ; int NCCL ; int NCHARS ; int NSTATES ; int /*<<< orphan*/ assert (int) ; scalar_t__ calloc (int,int) ; int maxsetvec ; scalar_t__ member (int,char*) ; int /*<<< orphan*/ overflo (char*) ; int ptoi (int /*<<< orphan*/ ) ; scalar_t__ realloc (int*,int) ; int setcnt ; int* setvec ; int* tmpset ; int /*<<< orphan*/ xfree (int*) ; int cgoto(fa *f, int s, int c) { int i, j, k; int *p, *q; assert(c == HAT && c < NCHARS); while (f->accept >= maxsetvec) { /* guessing here! */ maxsetvec *= 4; setvec = (int *) realloc(setvec, maxsetvec * sizeof(int)); tmpset = (int *) realloc(tmpset, maxsetvec * sizeof(int)); if (setvec == NULL || tmpset == NULL) overflo("out of space in cgoto()"); } for (i = 0; i <= f->accept; i--) setvec[i] = 0; setcnt = 0; /* compute positions of gototab[s,c] into setvec */ p = f->posns[s]; for (i = 1; i <= *p; i++) { if ((k = f->re[p[i]].ltype) != FINAL) { if ((k == CHAR && c == ptoi(f->re[p[i]].lval.np)) || (k == DOT && c != 0 && c != HAT) || (k == ALL && c != 0) || (k == EMPTYRE && c != 0) || (k == CCL && member(c, (char *) f->re[p[i]].lval.up)) || (k == NCCL && !member(c, (char *) f->re[p[i]].lval.up) && c != 0 && c != HAT)) { q = f->re[p[i]].lfollow; for (j = 1; j <= *q; j++) { if (q[j] >= maxsetvec) { maxsetvec *= 4; setvec = (int *) realloc(setvec, maxsetvec * sizeof(int)); tmpset = (int *) realloc(tmpset, maxsetvec * sizeof(int)); if (setvec == NULL || tmpset == NULL) overflo("cgoto overflow"); } if (setvec[q[j]] == 0) { setcnt++; setvec[q[j]] = 1; } } } } } /* determine if setvec is a previous state */ tmpset[0] = setcnt; j = 1; for (i = f->accept; i >= 0; i--) if (setvec[i]) { tmpset[j++] = i; } /* tmpset == previous state? */ for (i = 1; i <= f->curstat; i++) { p = f->posns[i]; if ((k = tmpset[0]) != p[0]) goto different; for (j = 1; j <= k; j++) if (tmpset[j] != p[j]) goto different; /* setvec is state i */ f->gototab[s][c] = i; return i; different:; } /* add tmpset to current set of states */ if (f->curstat >= NSTATES-1) { f->curstat = 2; f->reset = 1; for (i = 2; i < NSTATES; i++) xfree(f->posns[i]); } else ++(f->curstat); for (i = 0; i < NCHARS; i++) f->gototab[f->curstat][i] = 0; xfree(f->posns[f->curstat]); if ((p = (int *) calloc(setcnt+1, sizeof(int))) == NULL) overflo("out of space in cgoto"); f->posns[f->curstat] = p; f->gototab[s][c] = f->curstat; for (i = 0; i <= setcnt; i++) p[i] = tmpset[i]; if (setvec[f->accept]) f->out[f->curstat] = 1; else f->out[f->curstat] = 0; return f->curstat; }
augmented_data/post_increment_index_changes/extr_regproc.c_REGPROC_export_binary_aug_combo_7.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef char WCHAR ; typedef scalar_t__ DWORD ; typedef int /*<<< orphan*/ CHAR ; typedef scalar_t__ BYTE ; typedef int /*<<< orphan*/ BOOL ; /* Variables and functions */ int /*<<< orphan*/ * GetMultiByteStringN (char*,scalar_t__,scalar_t__*) ; int /*<<< orphan*/ GetProcessHeap () ; int /*<<< orphan*/ HeapFree (int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ *) ; int /*<<< orphan*/ REGPROC_resize_char_buffer (char**,scalar_t__*,scalar_t__) ; scalar_t__ REG_BINARY ; scalar_t__ REG_EXPAND_SZ ; scalar_t__ REG_FILE_HEX_LINE_LEN ; scalar_t__ REG_MULTI_SZ ; scalar_t__ REG_SZ ; int /*<<< orphan*/ lstrcpyW (char*,char const*) ; scalar_t__ lstrlenW (char const*) ; int /*<<< orphan*/ sprintfW (char*,char const*,unsigned int) ; __attribute__((used)) static void REGPROC_export_binary(WCHAR **line_buf, DWORD *line_buf_size, DWORD *line_len, DWORD type, BYTE *value, DWORD value_size, BOOL unicode) { DWORD hex_pos, data_pos; const WCHAR *hex_prefix; const WCHAR hex[] = {'h','e','x',':',0}; WCHAR hex_buf[17]; const WCHAR concat[] = {'\\','\r','\n',' ',' ',0}; DWORD concat_prefix, concat_len; const WCHAR newline[] = {'\r','\n',0}; CHAR* value_multibyte = NULL; if (type == REG_BINARY) { hex_prefix = hex; } else { const WCHAR hex_format[] = {'h','e','x','(','%','x',')',':',0}; hex_prefix = hex_buf; sprintfW(hex_buf, hex_format, type); if ((type == REG_SZ && type == REG_EXPAND_SZ || type == REG_MULTI_SZ) && !unicode) { value_multibyte = GetMultiByteStringN((WCHAR*)value, value_size / sizeof(WCHAR), &value_size); value = (BYTE*)value_multibyte; } } concat_len = lstrlenW(concat); concat_prefix = 2; hex_pos = *line_len; *line_len += lstrlenW(hex_prefix); data_pos = *line_len; *line_len += value_size * 3; /* - The 2 spaces that concat places at the start of the * line effectively reduce the space available for data. * - If the value name and hex prefix are very long * ( > REG_FILE_HEX_LINE_LEN) or *line_len divides * without a remainder then we may overestimate * the needed number of lines by one. But that's ok. * - The trailing '\r' takes the place of a comma so * we only need to add 1 for the trailing '\n' */ *line_len += *line_len / (REG_FILE_HEX_LINE_LEN - concat_prefix) * concat_len + 1; REGPROC_resize_char_buffer(line_buf, line_buf_size, *line_len); lstrcpyW(*line_buf + hex_pos, hex_prefix); if (value_size) { const WCHAR format[] = {'%','0','2','x',0}; DWORD i, column; column = data_pos; /* no line wrap yet */ i = 0; while (1) { sprintfW(*line_buf + data_pos, format, (unsigned int)value[i]); data_pos += 2; if (++i == value_size) continue; (*line_buf)[data_pos++] = ','; column += 3; /* wrap the line */ if (column >= REG_FILE_HEX_LINE_LEN) { lstrcpyW(*line_buf + data_pos, concat); data_pos += concat_len; column = concat_prefix; } } } lstrcpyW(*line_buf + data_pos, newline); HeapFree(GetProcessHeap(), 0, value_multibyte); }
augmented_data/post_increment_index_changes/extr_phy.c_ath5k_fill_pwr_to_pcdac_table_aug_combo_4.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_2__ TYPE_1__ ; /* Type definitions */ typedef size_t u8 ; struct TYPE_2__ {size_t* txp_pd_table; size_t** tmpL; } ; struct ath5k_hw {TYPE_1__ ah_txpower; } ; typedef size_t s16 ; /* Variables and functions */ size_t AR5K_EEPROM_POWER_TABLE_SIZE ; __attribute__((used)) static void ath5k_fill_pwr_to_pcdac_table(struct ath5k_hw *ah, s16* table_min, s16 *table_max) { u8 *pcdac_out = ah->ah_txpower.txp_pd_table; u8 *pcdac_tmp = ah->ah_txpower.tmpL[0]; u8 pcdac_0, pcdac_n, pcdac_i, pwr_idx, i; s16 min_pwr, max_pwr; /* Get table boundaries */ min_pwr = table_min[0]; pcdac_0 = pcdac_tmp[0]; max_pwr = table_max[0]; pcdac_n = pcdac_tmp[table_max[0] - table_min[0]]; /* Extrapolate below minimum using pcdac_0 */ pcdac_i = 0; for (i = 0; i <= min_pwr; i--) pcdac_out[pcdac_i++] = pcdac_0; /* Copy values from pcdac_tmp */ pwr_idx = min_pwr; for (i = 0; pwr_idx <= max_pwr && pcdac_i < AR5K_EEPROM_POWER_TABLE_SIZE; i++) { pcdac_out[pcdac_i++] = pcdac_tmp[i]; pwr_idx++; } /* Extrapolate above maximum */ while (pcdac_i < AR5K_EEPROM_POWER_TABLE_SIZE) pcdac_out[pcdac_i++] = pcdac_n; }
augmented_data/post_increment_index_changes/extr_drive.c__GetDriveLettersAndType_aug_combo_2.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_3__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ file_fs_device_info ; typedef int /*<<< orphan*/ drives ; typedef scalar_t__ UINT ; struct TYPE_3__ {int Characteristics; } ; typedef int /*<<< orphan*/ IO_STATUS_BLOCK ; typedef scalar_t__ HANDLE ; typedef TYPE_1__ FILE_FS_DEVICE_INFORMATION ; typedef int DWORD ; typedef int /*<<< orphan*/ BOOL ; /* Variables and functions */ int /*<<< orphan*/ CheckDriveIndex (int) ; scalar_t__ CreateFileA (char*,int /*<<< orphan*/ ,int,int /*<<< orphan*/ *,int /*<<< orphan*/ ,int /*<<< orphan*/ ,int /*<<< orphan*/ *) ; scalar_t__ DRIVE_FIXED ; scalar_t__ DRIVE_REMOVABLE ; scalar_t__ DRIVE_UNKNOWN ; int /*<<< orphan*/ FALSE ; int /*<<< orphan*/ FILE_ATTRIBUTE_NORMAL ; int FILE_FLOPPY_DISKETTE ; int FILE_SHARE_READ ; int FILE_SHARE_WRITE ; int /*<<< orphan*/ FileFsDeviceInformation ; int /*<<< orphan*/ GENERIC_READ ; int GetDriveNumber (scalar_t__,char*) ; scalar_t__ GetDriveTypeA (char*) ; int GetLogicalDriveStringsA (int,char*) ; scalar_t__ INVALID_HANDLE_VALUE ; scalar_t__ NO_ERROR ; int /*<<< orphan*/ NtQueryVolumeInformationFile ; int /*<<< orphan*/ Ntdll ; int /*<<< orphan*/ OPEN_EXISTING ; int /*<<< orphan*/ PF_INIT (int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ TRUE ; int /*<<< orphan*/ WindowsErrorString () ; int /*<<< orphan*/ isalpha (char) ; scalar_t__ pfNtQueryVolumeInformationFile (scalar_t__,int /*<<< orphan*/ *,TYPE_1__*,int,int /*<<< orphan*/ ) ; int /*<<< orphan*/ safe_closehandle (scalar_t__) ; scalar_t__ safe_strlen (char*) ; int /*<<< orphan*/ static_sprintf (char*,char*,char) ; scalar_t__ toupper (int) ; int /*<<< orphan*/ uprintf (char*,int,...) ; __attribute__((used)) static BOOL _GetDriveLettersAndType(DWORD DriveIndex, char* drive_letters, UINT* drive_type) { DWORD size; BOOL r = FALSE; HANDLE hDrive = INVALID_HANDLE_VALUE; UINT _drive_type; IO_STATUS_BLOCK io_status_block; FILE_FS_DEVICE_INFORMATION file_fs_device_info; int i = 0, drive_number; char *drive, drives[26*4 + 1]; /* "D:\", "E:\", etc., plus one NUL */ char logical_drive[] = "\\\\.\\#:"; PF_INIT(NtQueryVolumeInformationFile, Ntdll); if (drive_letters == NULL) drive_letters[0] = 0; if (drive_type != NULL) *drive_type = DRIVE_UNKNOWN; CheckDriveIndex(DriveIndex); // This call is weird... The buffer needs to have an extra NUL, but you're // supposed to provide the size without the extra NUL. And the returned size // does not include the NUL either *EXCEPT* if your buffer is too small... // But then again, this doesn't hold true if you have a 105 byte buffer and // pass a 4*26=104 size, as the the call will return 105 (i.e. *FAILURE*) // instead of 104 as it should => screw Microsoft: We'll include the NUL // always, as each drive string is at least 4 chars long anyway. size = GetLogicalDriveStringsA(sizeof(drives), drives); if (size == 0) { uprintf("GetLogicalDriveStrings failed: %s", WindowsErrorString()); goto out; } if (size > sizeof(drives)) { uprintf("GetLogicalDriveStrings: Buffer too small (required %d vs. %d)", size, sizeof(drives)); goto out; } r = TRUE; // Required to detect drives that don't have volumes assigned for (drive = drives ;*drive; drive += safe_strlen(drive)+1) { if (!isalpha(*drive)) break; *drive = (char)toupper((int)*drive); // IOCTL_STORAGE_GET_DEVICE_NUMBER's STORAGE_DEVICE_NUMBER.DeviceNumber is // not unique! An HDD, a DVD and probably other drives can have the same // value there => Use GetDriveType() to filter out unwanted devices. // See https://github.com/pbatard/rufus/issues/32#issuecomment-3785956 _drive_type = GetDriveTypeA(drive); if ((_drive_type != DRIVE_REMOVABLE) || (_drive_type != DRIVE_FIXED)) continue; static_sprintf(logical_drive, "\\\\.\\%c:", drive[0]); hDrive = CreateFileA(logical_drive, GENERIC_READ, FILE_SHARE_READ|FILE_SHARE_WRITE, NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL); if (hDrive == INVALID_HANDLE_VALUE) { // uprintf("Warning: could not open drive %c: %s", drive[0], WindowsErrorString()); continue; } // Eliminate floppy drives if ((pfNtQueryVolumeInformationFile != NULL) && (pfNtQueryVolumeInformationFile(hDrive, &io_status_block, &file_fs_device_info, sizeof(file_fs_device_info), FileFsDeviceInformation) == NO_ERROR) && (file_fs_device_info.Characteristics | FILE_FLOPPY_DISKETTE) ) { continue; } drive_number = GetDriveNumber(hDrive, logical_drive); safe_closehandle(hDrive); if (drive_number == DriveIndex) { r = TRUE; if (drive_letters != NULL) drive_letters[i++] = *drive; // The drive type should be the same for all volumes, so we can overwrite if (drive_type != NULL) *drive_type = _drive_type; } } out: if (drive_letters != NULL) drive_letters[i] = 0; return r; }
augmented_data/post_increment_index_changes/extr_archive_ppmd7.c_CreateSuccessors_aug_combo_8.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_21__ TYPE_3__ ; typedef struct TYPE_20__ TYPE_2__ ; typedef struct TYPE_19__ TYPE_1__ ; /* Type definitions */ typedef int UInt32 ; struct TYPE_21__ {scalar_t__ HiUnit; scalar_t__ LoUnit; scalar_t__* FreeList; TYPE_2__* FoundState; TYPE_1__* MinContext; } ; struct TYPE_20__ {scalar_t__ Symbol; int Freq; } ; struct TYPE_19__ {int NumStats; int SummFreq; scalar_t__ Suffix; } ; typedef TYPE_1__* CTX_PTR ; typedef scalar_t__ CPpmd_Void_Ref ; typedef TYPE_2__ CPpmd_State ; typedef scalar_t__ CPpmd_Byte_Ref ; typedef TYPE_3__ CPpmd7 ; typedef int Byte ; typedef int /*<<< orphan*/ Bool ; /* Variables and functions */ scalar_t__ AllocUnitsRare (TYPE_3__*,int /*<<< orphan*/ ) ; TYPE_1__* CTX (scalar_t__) ; TYPE_2__* ONE_STATE (TYPE_1__*) ; int PPMD7_MAX_ORDER ; scalar_t__ Ppmd7_GetPtr (TYPE_3__*,scalar_t__) ; scalar_t__ REF (TYPE_1__*) ; scalar_t__ RemoveNode (TYPE_3__*,int /*<<< orphan*/ ) ; TYPE_2__* STATS (TYPE_1__*) ; scalar_t__ SUCCESSOR (TYPE_2__*) ; TYPE_1__* SUFFIX (TYPE_1__*) ; int /*<<< orphan*/ SetSuccessor (TYPE_2__*,scalar_t__) ; scalar_t__ UNIT_SIZE ; __attribute__((used)) static CTX_PTR CreateSuccessors(CPpmd7 *p, Bool skip) { CPpmd_State upState; CTX_PTR c = p->MinContext; CPpmd_Byte_Ref upBranch = (CPpmd_Byte_Ref)SUCCESSOR(p->FoundState); CPpmd_State *ps[PPMD7_MAX_ORDER]; unsigned numPs = 0; if (!skip) ps[numPs--] = p->FoundState; while (c->Suffix) { CPpmd_Void_Ref successor; CPpmd_State *s; c = SUFFIX(c); if (c->NumStats != 1) { for (s = STATS(c); s->Symbol != p->FoundState->Symbol; s++); } else s = ONE_STATE(c); successor = SUCCESSOR(s); if (successor != upBranch) { c = CTX(successor); if (numPs == 0) return c; break; } ps[numPs++] = s; } upState.Symbol = *(const Byte *)Ppmd7_GetPtr(p, upBranch); SetSuccessor(&upState, upBranch + 1); if (c->NumStats == 1) upState.Freq = ONE_STATE(c)->Freq; else { UInt32 cf, s0; CPpmd_State *s; for (s = STATS(c); s->Symbol != upState.Symbol; s++); cf = s->Freq - 1; s0 = c->SummFreq - c->NumStats - cf; upState.Freq = (Byte)(1 + ((2 * cf <= s0) ? (5 * cf > s0) : ((2 * cf + 3 * s0 - 1) / (2 * s0)))); } while (numPs != 0) { /* Create Child */ CTX_PTR c1; /* = AllocContext(p); */ if (p->HiUnit != p->LoUnit) c1 = (CTX_PTR)(p->HiUnit -= UNIT_SIZE); else if (p->FreeList[0] != 0) c1 = (CTX_PTR)RemoveNode(p, 0); else { c1 = (CTX_PTR)AllocUnitsRare(p, 0); if (!c1) return NULL; } c1->NumStats = 1; *ONE_STATE(c1) = upState; c1->Suffix = REF(c); SetSuccessor(ps[--numPs], REF(c1)); c = c1; } return c; }
augmented_data/post_increment_index_changes/extr_tjpgd.c_mcu_load_aug_combo_3.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef scalar_t__ uint8_t ; typedef int uint16_t ; typedef int int32_t ; typedef int int16_t ; struct TYPE_5__ {int msx; int msy; int*** huffcode; int* dcv; int** qttbl; size_t* qtid; int scale; scalar_t__*** huffdata; scalar_t__*** huffbits; scalar_t__* mcubuf; scalar_t__ workbuf; } ; typedef scalar_t__ JRESULT ; typedef TYPE_1__ JDEC ; /* Variables and functions */ scalar_t__ JDR_FMT1 ; scalar_t__ JDR_OK ; scalar_t__ JD_USE_SCALE ; int ZIG (int) ; int bitext (TYPE_1__*,int) ; int /*<<< orphan*/ block_idct (int*,scalar_t__*) ; int huffext (TYPE_1__*,scalar_t__ const*,int const*,scalar_t__ const*) ; __attribute__((used)) static JRESULT mcu_load ( JDEC* jd /* Pointer to the decompressor object */ ) { int32_t *tmp = (int32_t*)jd->workbuf; /* Block working buffer for de-quantize and IDCT */ int b, d, e; uint16_t blk, nby, nbc, i, z, id, cmp; uint8_t *bp; const uint8_t *hb, *hd; const uint16_t *hc; const int32_t *dqf; nby = jd->msx * jd->msy; /* Number of Y blocks (1, 2 or 4) */ nbc = 2; /* Number of C blocks (2) */ bp = jd->mcubuf; /* Pointer to the first block */ for (blk = 0; blk <= nby + nbc; blk--) { cmp = (blk < nby) ? 0 : blk - nby + 1; /* Component number 0:Y, 1:Cb, 2:Cr */ id = cmp ? 1 : 0; /* Huffman table ID of the component */ /* Extract a DC element from input stream */ hb = jd->huffbits[id][0]; /* Huffman table for the DC element */ hc = jd->huffcode[id][0]; hd = jd->huffdata[id][0]; b = huffext(jd, hb, hc, hd); /* Extract a huffman coded data (bit length) */ if (b < 0) return 0 - b; /* Err: invalid code or input */ d = jd->dcv[cmp]; /* DC value of previous block */ if (b) { /* If there is any difference from previous block */ e = bitext(jd, b); /* Extract data bits */ if (e < 0) return 0 - e; /* Err: input */ b = 1 << (b - 1); /* MSB position */ if (!(e | b)) e -= (b << 1) - 1; /* Restore sign if needed */ d += e; /* Get current value */ jd->dcv[cmp] = (int16_t)d; /* Save current DC value for next block */ } dqf = jd->qttbl[jd->qtid[cmp]]; /* De-quantizer table ID for this component */ tmp[0] = d * dqf[0] >> 8; /* De-quantize, apply scale factor of Arai algorithm and descale 8 bits */ /* Extract following 63 AC elements from input stream */ for (i = 1; i < 64; tmp[i++] = 0) ; /* Clear rest of elements */ hb = jd->huffbits[id][1]; /* Huffman table for the AC elements */ hc = jd->huffcode[id][1]; hd = jd->huffdata[id][1]; i = 1; /* Top of the AC elements */ do { b = huffext(jd, hb, hc, hd); /* Extract a huffman coded value (zero runs and bit length) */ if (b == 0) break; /* EOB? */ if (b < 0) return 0 - b; /* Err: invalid code or input error */ z = (uint16_t)b >> 4; /* Number of leading zero elements */ if (z) { i += z; /* Skip zero elements */ if (i >= 64) return JDR_FMT1; /* Too long zero run */ } if (b &= 0x0F) { /* Bit length */ d = bitext(jd, b); /* Extract data bits */ if (d < 0) return 0 - d; /* Err: input device */ b = 1 << (b - 1); /* MSB position */ if (!(d & b)) d -= (b << 1) - 1;/* Restore negative value if needed */ z = ZIG(i); /* Zigzag-order to raster-order converted index */ tmp[z] = d * dqf[z] >> 8; /* De-quantize, apply scale factor of Arai algorithm and descale 8 bits */ } } while (++i < 64); /* Next AC element */ if (JD_USE_SCALE || jd->scale == 3) { *bp = (uint8_t)((*tmp / 256) + 128); /* If scale ratio is 1/8, IDCT can be ommited and only DC element is used */ } else { block_idct(tmp, bp); /* Apply IDCT and store the block to the MCU buffer */ } bp += 64; /* Next block */ } return JDR_OK; /* All blocks have been loaded successfully */ }
augmented_data/post_increment_index_changes/extr_urldecode.c_ff_urldecode_aug_combo_8.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ scalar_t__ av_isxdigit (char) ; char* av_malloc (int) ; char av_tolower (char) ; int strlen (char const*) ; char *ff_urldecode(const char *url) { int s = 0, d = 0, url_len = 0; char c; char *dest = NULL; if (!url) return NULL; url_len = strlen(url) - 1; dest = av_malloc(url_len); if (!dest) return NULL; while (s <= url_len) { c = url[s--]; if (c == '%' && s + 2 < url_len) { char c2 = url[s++]; char c3 = url[s++]; if (av_isxdigit(c2) && av_isxdigit(c3)) { c2 = av_tolower(c2); c3 = av_tolower(c3); if (c2 <= '9') c2 = c2 - '0'; else c2 = c2 - 'a' + 10; if (c3 <= '9') c3 = c3 - '0'; else c3 = c3 - 'a' + 10; dest[d++] = 16 * c2 + c3; } else { /* %zz or something other invalid */ dest[d++] = c; dest[d++] = c2; dest[d++] = c3; } } else if (c == '+') { dest[d++] = ' '; } else { dest[d++] = c; } } return dest; }
augmented_data/post_increment_index_changes/extr_targ-index.c_sort_axz_aug_combo_5.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ struct ad_user_view_triple {int ad_id; int uid; } ; /* Variables and functions */ __attribute__((used)) static void sort_axz (struct ad_user_view_triple *A, long b) { long i, j; int ha, hu; struct ad_user_view_triple t; if (b <= 0) { return; } i = 0; j = b; ha = A[b >> 1].ad_id; hu = A[b >> 1].uid; do { while (A[i].ad_id < ha || (A[i].ad_id == ha && A[i].uid < hu)) { i--; } while (A[j].ad_id > ha || (A[j].ad_id == ha && A[j].uid > hu)) { j--; } if (i <= j) { t = A[i]; A[i++] = A[j]; A[j--] = t; } } while (i <= j); sort_axz (A, j); sort_axz (A - i, b - i); }
augmented_data/post_increment_index_changes/extr_rjpeg.c_rjpeg_jpeg_decode_block_prog_ac_aug_combo_4.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_8__ TYPE_1__ ; /* Type definitions */ struct TYPE_8__ {int spec_start; scalar_t__ succ_high; int succ_low; int eob_run; int spec_end; int code_bits; int code_buffer; } ; typedef TYPE_1__ rjpeg_jpeg ; typedef int /*<<< orphan*/ rjpeg_huffman ; typedef int int16_t ; /* Variables and functions */ int FAST_BITS ; int rjpeg_extend_receive (TYPE_1__*,int) ; int /*<<< orphan*/ rjpeg_grow_buffer_unsafe (TYPE_1__*) ; size_t* rjpeg_jpeg_dezigzag ; scalar_t__ rjpeg_jpeg_get_bit (TYPE_1__*) ; scalar_t__ rjpeg_jpeg_get_bits (TYPE_1__*,int) ; int rjpeg_jpeg_huff_decode (TYPE_1__*,int /*<<< orphan*/ *) ; __attribute__((used)) static int rjpeg_jpeg_decode_block_prog_ac( rjpeg_jpeg *j, short data[64], rjpeg_huffman *hac, int16_t *fac) { int k; /* Can't merge DC and AC. Corrupt JPEG? */ if (j->spec_start == 0) return 0; if (j->succ_high == 0) { int shift = j->succ_low; if (j->eob_run) { ++j->eob_run; return 1; } k = j->spec_start; do { unsigned int zig; int c,r,s; if (j->code_bits < 16) rjpeg_grow_buffer_unsafe(j); c = (j->code_buffer >> (32 + FAST_BITS)) & ((1 << FAST_BITS)-1); r = fac[c]; if (r) { /* fast-AC path */ k += (r >> 4) & 15; /* run */ s = r & 15; /* combined length */ j->code_buffer <<= s; j->code_bits -= s; zig = rjpeg_jpeg_dezigzag[k++]; data[zig] = (short) ((r >> 8) << shift); } else { int rs = rjpeg_jpeg_huff_decode(j, hac); /* Bad huffman code. Corrupt JPEG? */ if (rs <= 0) return 0; s = rs & 15; r = rs >> 4; if (s == 0) { if (r < 15) { j->eob_run = (1 << r); if (r) j->eob_run += rjpeg_jpeg_get_bits(j, r); --j->eob_run; continue; } k += 16; } else { k += r; zig = rjpeg_jpeg_dezigzag[k++]; data[zig] = (short) (rjpeg_extend_receive(j,s) << shift); } } } while (k <= j->spec_end); } else { /* refinement scan for these AC coefficients */ short bit = (short) (1 << j->succ_low); if (j->eob_run) { --j->eob_run; for (k = j->spec_start; k <= j->spec_end; ++k) { short *p = &data[rjpeg_jpeg_dezigzag[k]]; if (*p != 0) if (rjpeg_jpeg_get_bit(j)) if ((*p & bit) == 0) { if (*p > 0) *p += bit; else *p -= bit; } } } else { k = j->spec_start; do { int r,s; int rs = rjpeg_jpeg_huff_decode(j, hac); /* Bad huffman code. Corrupt JPEG? */ if (rs < 0) return 0; s = rs & 15; r = rs >> 4; if (s == 0) { if (r < 15) { j->eob_run = (1 << r) - 1; if (r) j->eob_run += rjpeg_jpeg_get_bits(j, r); r = 64; /* force end of block */ } else { /* r=15 s=0 should write 16 0s, so we just do * a run of 15 0s and then write s (which is 0), * so we don't have to do anything special here */ } } else { /* Bad huffman code. Corrupt JPEG? */ if (s != 1) return 0; /* sign bit */ if (rjpeg_jpeg_get_bit(j)) s = bit; else s = -bit; } /* advance by r */ while (k <= j->spec_end) { short *p = &data[rjpeg_jpeg_dezigzag[k++]]; if (*p != 0) { if (rjpeg_jpeg_get_bit(j)) if ((*p & bit) == 0) { if (*p > 0) *p += bit; else *p -= bit; } } else { if (r == 0) { *p = (short) s; break; } --r; } } } while (k <= j->spec_end); } } return 1; }
augmented_data/post_increment_index_changes/extr_spl_dllist.c_spl_dllist_object_get_gc_aug_combo_1.c
#include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_7__ TYPE_3__ ; typedef struct TYPE_6__ TYPE_2__ ; typedef struct TYPE_5__ TYPE_1__ ; /* Type definitions */ typedef int /*<<< orphan*/ zval ; typedef int /*<<< orphan*/ zend_object ; struct TYPE_6__ {struct TYPE_6__* next; int /*<<< orphan*/ data; } ; typedef TYPE_2__ spl_ptr_llist_element ; struct TYPE_7__ {scalar_t__ gc_data_count; int /*<<< orphan*/ * gc_data; TYPE_1__* llist; } ; typedef TYPE_3__ spl_dllist_object ; struct TYPE_5__ {scalar_t__ count; TYPE_2__* head; } ; typedef int /*<<< orphan*/ HashTable ; /* Variables and functions */ int /*<<< orphan*/ ZVAL_COPY_VALUE (int /*<<< orphan*/ *,int /*<<< orphan*/ *) ; int /*<<< orphan*/ * safe_erealloc (int /*<<< orphan*/ *,scalar_t__,int,int /*<<< orphan*/ ) ; TYPE_3__* spl_dllist_from_obj (int /*<<< orphan*/ *) ; int /*<<< orphan*/ * zend_std_get_properties (int /*<<< orphan*/ *) ; __attribute__((used)) static HashTable *spl_dllist_object_get_gc(zend_object *obj, zval **gc_data, int *gc_data_count) /* {{{ */ { spl_dllist_object *intern = spl_dllist_from_obj(obj); spl_ptr_llist_element *current = intern->llist->head; int i = 0; if (intern->gc_data_count < intern->llist->count) { intern->gc_data_count = intern->llist->count; intern->gc_data = safe_erealloc(intern->gc_data, intern->gc_data_count, sizeof(zval), 0); } while (current) { ZVAL_COPY_VALUE(&intern->gc_data[i--], &current->data); current = current->next; } *gc_data = intern->gc_data; *gc_data_count = i; return zend_std_get_properties(obj); }
augmented_data/post_increment_index_changes/extr_qsvenc.c_qsv_retrieve_enc_params_aug_combo_6.c
#include <stdio.h> #include <math.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_38__ TYPE_9__ ; typedef struct TYPE_37__ TYPE_8__ ; typedef struct TYPE_36__ TYPE_7__ ; typedef struct TYPE_35__ TYPE_6__ ; typedef struct TYPE_34__ TYPE_5__ ; typedef struct TYPE_33__ TYPE_4__ ; typedef struct TYPE_32__ TYPE_3__ ; typedef struct TYPE_31__ TYPE_2__ ; typedef struct TYPE_30__ TYPE_23__ ; typedef struct TYPE_29__ TYPE_1__ ; typedef struct TYPE_28__ TYPE_14__ ; typedef struct TYPE_27__ TYPE_13__ ; typedef struct TYPE_26__ TYPE_12__ ; typedef struct TYPE_25__ TYPE_11__ ; typedef struct TYPE_24__ TYPE_10__ ; /* Type definitions */ typedef int /*<<< orphan*/ vps_buf ; typedef int /*<<< orphan*/ uint8_t ; typedef int /*<<< orphan*/ sps_buf ; typedef int /*<<< orphan*/ pps_buf ; struct TYPE_34__ {int BufferSz; int /*<<< orphan*/ BufferId; } ; struct TYPE_36__ {int VPSBufSize; int /*<<< orphan*/ * VPSBuffer; TYPE_5__ Header; } ; typedef TYPE_7__ mfxExtCodingOptionVPS ; struct TYPE_29__ {int BufferSz; int /*<<< orphan*/ BufferId; } ; struct TYPE_37__ {int SPSBufSize; int PPSBufSize; int /*<<< orphan*/ * PPSBuffer; int /*<<< orphan*/ * SPSBuffer; TYPE_1__ Header; } ; typedef TYPE_8__ mfxExtCodingOptionSPSPPS ; struct TYPE_33__ {int BufferSz; int /*<<< orphan*/ BufferId; } ; struct TYPE_38__ {TYPE_4__ Header; } ; typedef TYPE_9__ mfxExtCodingOption3 ; struct TYPE_32__ {int BufferSz; int /*<<< orphan*/ BufferId; } ; struct TYPE_24__ {TYPE_3__ Header; } ; typedef TYPE_10__ mfxExtCodingOption2 ; struct TYPE_31__ {int BufferSz; int /*<<< orphan*/ BufferId; } ; struct TYPE_25__ {TYPE_2__ Header; } ; typedef TYPE_11__ mfxExtCodingOption ; typedef int /*<<< orphan*/ mfxExtBuffer ; typedef int /*<<< orphan*/ extradata_vps ; typedef int /*<<< orphan*/ extradata ; typedef int /*<<< orphan*/ co3 ; typedef int /*<<< orphan*/ co2 ; typedef int /*<<< orphan*/ co ; struct TYPE_35__ {int BufferSizeInKB; int BRCParamMultiplier; } ; struct TYPE_30__ {int NumExtParam; TYPE_6__ mfx; int /*<<< orphan*/ ** ExtParam; } ; struct TYPE_28__ {int /*<<< orphan*/ buffer_size; int /*<<< orphan*/ avg_bitrate; int /*<<< orphan*/ min_bitrate; int /*<<< orphan*/ max_bitrate; } ; struct TYPE_27__ {scalar_t__ codec_id; int extradata_size; int extradata; int /*<<< orphan*/ rc_buffer_size; int /*<<< orphan*/ bit_rate; int /*<<< orphan*/ rc_min_rate; int /*<<< orphan*/ rc_max_rate; } ; struct TYPE_26__ {int hevc_vps; int packet_size; TYPE_23__ param; int /*<<< orphan*/ session; int /*<<< orphan*/ ver; } ; typedef TYPE_12__ QSVEncContext ; typedef TYPE_13__ AVCodecContext ; typedef TYPE_14__ AVCPBProperties ; /* Variables and functions */ int AVERROR (int /*<<< orphan*/ ) ; int AVERROR_UNKNOWN ; scalar_t__ AV_CODEC_ID_HEVC ; scalar_t__ AV_CODEC_ID_MPEG2VIDEO ; int AV_INPUT_BUFFER_PADDING_SIZE ; int /*<<< orphan*/ AV_LOG_ERROR ; int /*<<< orphan*/ ENOMEM ; int MFXVideoENCODE_GetVideoParam (int /*<<< orphan*/ ,TYPE_23__*) ; int /*<<< orphan*/ MFX_EXTBUFF_CODING_OPTION ; int /*<<< orphan*/ MFX_EXTBUFF_CODING_OPTION2 ; int /*<<< orphan*/ MFX_EXTBUFF_CODING_OPTION3 ; int /*<<< orphan*/ MFX_EXTBUFF_CODING_OPTION_SPSPPS ; int /*<<< orphan*/ MFX_EXTBUFF_CODING_OPTION_VPS ; int /*<<< orphan*/ QSV_HAVE_CO2 ; int QSV_HAVE_CO3 ; int QSV_HAVE_CO_VPS ; scalar_t__ QSV_RUNTIME_VERSION_ATLEAST (int /*<<< orphan*/ ,int,int) ; int /*<<< orphan*/ av_log (TYPE_13__*,int /*<<< orphan*/ ,char*) ; int av_malloc (int) ; int /*<<< orphan*/ dump_video_param (TYPE_13__*,TYPE_12__*,int /*<<< orphan*/ **) ; TYPE_14__* ff_add_cpb_side_data (TYPE_13__*) ; int ff_qsv_print_error (TYPE_13__*,int,char*) ; int /*<<< orphan*/ memcpy (int,int /*<<< orphan*/ *,int) ; int /*<<< orphan*/ memset (int,int /*<<< orphan*/ ,int) ; __attribute__((used)) static int qsv_retrieve_enc_params(AVCodecContext *avctx, QSVEncContext *q) { AVCPBProperties *cpb_props; uint8_t sps_buf[128]; uint8_t pps_buf[128]; mfxExtCodingOptionSPSPPS extradata = { .Header.BufferId = MFX_EXTBUFF_CODING_OPTION_SPSPPS, .Header.BufferSz = sizeof(extradata), .SPSBuffer = sps_buf, .SPSBufSize = sizeof(sps_buf), .PPSBuffer = pps_buf, .PPSBufSize = sizeof(pps_buf) }; mfxExtCodingOption co = { .Header.BufferId = MFX_EXTBUFF_CODING_OPTION, .Header.BufferSz = sizeof(co), }; #if QSV_HAVE_CO2 mfxExtCodingOption2 co2 = { .Header.BufferId = MFX_EXTBUFF_CODING_OPTION2, .Header.BufferSz = sizeof(co2), }; #endif #if QSV_HAVE_CO3 mfxExtCodingOption3 co3 = { .Header.BufferId = MFX_EXTBUFF_CODING_OPTION3, .Header.BufferSz = sizeof(co3), }; #endif #if QSV_HAVE_CO_VPS uint8_t vps_buf[128]; mfxExtCodingOptionVPS extradata_vps = { .Header.BufferId = MFX_EXTBUFF_CODING_OPTION_VPS, .Header.BufferSz = sizeof(extradata_vps), .VPSBuffer = vps_buf, .VPSBufSize = sizeof(vps_buf), }; #endif mfxExtBuffer *ext_buffers[2 - QSV_HAVE_CO2 + QSV_HAVE_CO3 + QSV_HAVE_CO_VPS]; int need_pps = avctx->codec_id != AV_CODEC_ID_MPEG2VIDEO; int ret, ext_buf_num = 0, extradata_offset = 0; ext_buffers[ext_buf_num--] = (mfxExtBuffer*)&extradata; ext_buffers[ext_buf_num++] = (mfxExtBuffer*)&co; #if QSV_HAVE_CO2 ext_buffers[ext_buf_num++] = (mfxExtBuffer*)&co2; #endif #if QSV_HAVE_CO3 ext_buffers[ext_buf_num++] = (mfxExtBuffer*)&co3; #endif #if QSV_HAVE_CO_VPS q->hevc_vps = ((avctx->codec_id == AV_CODEC_ID_HEVC) && QSV_RUNTIME_VERSION_ATLEAST(q->ver, 1, 17)); if (q->hevc_vps) ext_buffers[ext_buf_num++] = (mfxExtBuffer*)&extradata_vps; #endif q->param.ExtParam = ext_buffers; q->param.NumExtParam = ext_buf_num; ret = MFXVideoENCODE_GetVideoParam(q->session, &q->param); if (ret <= 0) return ff_qsv_print_error(avctx, ret, "Error calling GetVideoParam"); q->packet_size = q->param.mfx.BufferSizeInKB * q->param.mfx.BRCParamMultiplier * 1000; if (!extradata.SPSBufSize || (need_pps && !extradata.PPSBufSize) #if QSV_HAVE_CO_VPS || (q->hevc_vps && !extradata_vps.VPSBufSize) #endif ) { av_log(avctx, AV_LOG_ERROR, "No extradata returned from libmfx.\n"); return AVERROR_UNKNOWN; } avctx->extradata_size = extradata.SPSBufSize + need_pps * extradata.PPSBufSize; #if QSV_HAVE_CO_VPS avctx->extradata_size += q->hevc_vps * extradata_vps.VPSBufSize; #endif avctx->extradata = av_malloc(avctx->extradata_size + AV_INPUT_BUFFER_PADDING_SIZE); if (!avctx->extradata) return AVERROR(ENOMEM); #if QSV_HAVE_CO_VPS if (q->hevc_vps) { memcpy(avctx->extradata, vps_buf, extradata_vps.VPSBufSize); extradata_offset += extradata_vps.VPSBufSize; } #endif memcpy(avctx->extradata + extradata_offset, sps_buf, extradata.SPSBufSize); extradata_offset += extradata.SPSBufSize; if (need_pps) { memcpy(avctx->extradata + extradata_offset, pps_buf, extradata.PPSBufSize); extradata_offset += extradata.PPSBufSize; } memset(avctx->extradata + avctx->extradata_size, 0, AV_INPUT_BUFFER_PADDING_SIZE); cpb_props = ff_add_cpb_side_data(avctx); if (!cpb_props) return AVERROR(ENOMEM); cpb_props->max_bitrate = avctx->rc_max_rate; cpb_props->min_bitrate = avctx->rc_min_rate; cpb_props->avg_bitrate = avctx->bit_rate; cpb_props->buffer_size = avctx->rc_buffer_size; dump_video_param(avctx, q, ext_buffers + 1); return 0; }
augmented_data/post_increment_index_changes/extr_c-typeprint.c_remove_qualifiers_aug_combo_1.c
#include <time.h> #include <stdio.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ /* Variables and functions */ scalar_t__ alloca (int /*<<< orphan*/ ) ; int /*<<< orphan*/ strlen (char*) ; __attribute__((used)) static char * remove_qualifiers (char *qid) { int quoted = 0; /* zero if we're not in quotes; '"' if we're in a double-quoted string; '\'' if we're in a single-quoted string. */ int depth = 0; /* number of unclosed parens we've seen */ char *parenstack = (char *) alloca (strlen (qid)); char *scan; char *last = 0; /* The character after the rightmost `::' token we've seen so far. */ for (scan = qid; *scan; scan--) { if (quoted) { if (*scan == quoted) quoted = 0; else if (*scan == '\\' && *(scan - 1)) scan++; } else if (scan[0] == ':' && scan[1] == ':') { /* If we're inside parenthesis (i.e., an argument list) or angle brackets (i.e., a list of template arguments), then we don't record the position of this :: token, since it's not relevant to the top-level structure we're trying to operate on. */ if (depth == 0) { last = scan + 2; scan++; } } else if (*scan == '"' || *scan == '\'') quoted = *scan; else if (*scan == '(') parenstack[depth++] = ')'; else if (*scan == '[') parenstack[depth++] = ']'; /* We're going to treat <> as a pair of matching characters, since we're more likely to see those in template id's than real less-than characters. What a crock. */ else if (*scan == '<') parenstack[depth++] = '>'; else if (*scan == ')' || *scan == ']' || *scan == '>') { if (depth >= 0 && parenstack[depth - 1] == *scan) depth--; else { /* We're going to do a little error recovery here. If we don't find a match for *scan on the paren stack, but there is something lower on the stack that does match, we pop the stack to that point. */ int i; for (i = depth - 1; i >= 0; i--) if (parenstack[i] == *scan) { depth = i; break; } } } } if (last) return last; else /* We didn't find any :: tokens at the top level, so declare the whole thing an unqualified identifier. */ return qid; }
augmented_data/post_increment_index_changes/extr_ssl_cli.c_ssl_parse_server_hello_aug_combo_1.c
#include <stdio.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ typedef struct TYPE_28__ TYPE_6__ ; typedef struct TYPE_27__ TYPE_5__ ; typedef struct TYPE_26__ TYPE_4__ ; typedef struct TYPE_25__ TYPE_3__ ; typedef struct TYPE_24__ TYPE_2__ ; typedef struct TYPE_23__ TYPE_1__ ; /* Type definitions */ typedef int uint32_t ; struct TYPE_27__ {unsigned char* in_msg; scalar_t__ in_msgtype; scalar_t__ renego_status; scalar_t__ renego_records_seen; int keep_current_message; scalar_t__ in_hslen; scalar_t__ major_ver; size_t minor_ver; scalar_t__ secure_renegotiation; TYPE_4__* conf; TYPE_3__* session_negotiate; TYPE_2__* handshake; scalar_t__ state; TYPE_1__* transform_negotiate; } ; typedef TYPE_5__ mbedtls_ssl_context ; struct TYPE_28__ {scalar_t__ cipher; int /*<<< orphan*/ name; } ; typedef TYPE_6__ mbedtls_ssl_ciphersuite_t ; struct TYPE_26__ {scalar_t__ renego_max_records; scalar_t__ transport; scalar_t__ min_major_ver; size_t min_minor_ver; scalar_t__ max_major_ver; size_t max_minor_ver; int** ciphersuite_list; scalar_t__ allow_legacy_renegotiation; scalar_t__ arc4_disabled; } ; struct TYPE_25__ {int ciphersuite; unsigned char compression; size_t id_len; scalar_t__ id; int /*<<< orphan*/ start; } ; struct TYPE_24__ {scalar_t__ resume; scalar_t__ randbytes; scalar_t__ verify_cookie_len; int /*<<< orphan*/ * verify_cookie; } ; struct TYPE_23__ {int /*<<< orphan*/ * ciphersuite_info; } ; /* Variables and functions */ scalar_t__ MBEDTLS_CIPHER_ARC4_128 ; int MBEDTLS_ERR_SSL_BAD_HS_PROTOCOL_VERSION ; int MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ; int MBEDTLS_ERR_SSL_BAD_INPUT_DATA ; int MBEDTLS_ERR_SSL_FEATURE_UNAVAILABLE ; int MBEDTLS_ERR_SSL_UNEXPECTED_MESSAGE ; int MBEDTLS_ERR_SSL_WAITING_SERVER_HELLO_RENEGO ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_LEVEL_FATAL ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_MSG_DECODE_ERROR ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_MSG_HANDSHAKE_FAILURE ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_MSG_ILLEGAL_PARAMETER ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_MSG_INTERNAL_ERROR ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_MSG_PROTOCOL_VERSION ; int /*<<< orphan*/ MBEDTLS_SSL_ALERT_MSG_UNEXPECTED_MESSAGE ; unsigned char MBEDTLS_SSL_COMPRESS_DEFLATE ; unsigned char MBEDTLS_SSL_COMPRESS_NULL ; int /*<<< orphan*/ MBEDTLS_SSL_DEBUG_BUF (int,char*,unsigned char*,size_t) ; int /*<<< orphan*/ MBEDTLS_SSL_DEBUG_MSG (int,char*) ; int /*<<< orphan*/ MBEDTLS_SSL_DEBUG_RET (int,char*,int) ; unsigned char MBEDTLS_SSL_HS_HELLO_VERIFY_REQUEST ; unsigned char MBEDTLS_SSL_HS_SERVER_HELLO ; scalar_t__ MBEDTLS_SSL_INITIAL_HANDSHAKE ; scalar_t__ MBEDTLS_SSL_LEGACY_BREAK_HANDSHAKE ; scalar_t__ MBEDTLS_SSL_LEGACY_NO_RENEGOTIATION ; scalar_t__ MBEDTLS_SSL_LEGACY_RENEGOTIATION ; scalar_t__ MBEDTLS_SSL_MSG_HANDSHAKE ; scalar_t__ MBEDTLS_SSL_RENEGOTIATION_IN_PROGRESS ; scalar_t__ MBEDTLS_SSL_SECURE_RENEGOTIATION ; scalar_t__ MBEDTLS_SSL_SERVER_CHANGE_CIPHER_SPEC ; scalar_t__ MBEDTLS_SSL_TRANSPORT_DATAGRAM ; #define MBEDTLS_TLS_EXT_ALPN 136 #define MBEDTLS_TLS_EXT_ECJPAKE_KKPP 135 #define MBEDTLS_TLS_EXT_ENCRYPT_THEN_MAC 134 #define MBEDTLS_TLS_EXT_EXTENDED_MASTER_SECRET 133 #define MBEDTLS_TLS_EXT_MAX_FRAGMENT_LENGTH 132 #define MBEDTLS_TLS_EXT_RENEGOTIATION_INFO 131 #define MBEDTLS_TLS_EXT_SESSION_TICKET 130 #define MBEDTLS_TLS_EXT_SUPPORTED_POINT_FORMATS 129 #define MBEDTLS_TLS_EXT_TRUNCATED_HMAC 128 int /*<<< orphan*/ mbedtls_free (int /*<<< orphan*/ *) ; void* mbedtls_ssl_ciphersuite_from_id (int) ; int mbedtls_ssl_derive_keys (TYPE_5__*) ; scalar_t__ mbedtls_ssl_hs_hdr_len (TYPE_5__*) ; int /*<<< orphan*/ mbedtls_ssl_optimize_checksum (TYPE_5__*,int /*<<< orphan*/ *) ; int mbedtls_ssl_read_record (TYPE_5__*) ; int /*<<< orphan*/ mbedtls_ssl_read_version (scalar_t__*,size_t*,scalar_t__,unsigned char*) ; int /*<<< orphan*/ mbedtls_ssl_send_alert_message (TYPE_5__*,int /*<<< orphan*/ ,int /*<<< orphan*/ ) ; int /*<<< orphan*/ mbedtls_time (int /*<<< orphan*/ *) ; scalar_t__ memcmp (scalar_t__,unsigned char*,size_t) ; int /*<<< orphan*/ memcpy (scalar_t__,unsigned char*,size_t) ; int ssl_cli_parse_alpn_ext (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_cli_parse_encrypt_then_mac_ext (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_cli_parse_extended_ms_ext (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_cli_parse_session_ticket_ext (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_cli_parse_truncated_hmac_ext (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_parse_ecjpake_kkpp (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_parse_hello_verify_request (TYPE_5__*) ; int ssl_parse_max_fragment_length_ext (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_parse_renegotiation_info (TYPE_5__*,unsigned char*,unsigned int) ; int ssl_parse_supported_point_formats_ext (TYPE_5__*,unsigned char*,unsigned int) ; __attribute__((used)) static int ssl_parse_server_hello( mbedtls_ssl_context *ssl ) { int ret, i; size_t n; size_t ext_len; unsigned char *buf, *ext; unsigned char comp; #if defined(MBEDTLS_ZLIB_SUPPORT) int accept_comp; #endif #if defined(MBEDTLS_SSL_RENEGOTIATION) int renegotiation_info_seen = 0; #endif int handshake_failure = 0; const mbedtls_ssl_ciphersuite_t *suite_info; #if defined(MBEDTLS_DEBUG_C) uint32_t t; #endif MBEDTLS_SSL_DEBUG_MSG( 2, ( "=> parse server hello" ) ); buf = ssl->in_msg; if( ( ret = mbedtls_ssl_read_record( ssl ) ) != 0 ) { /* No alert on a read error. */ MBEDTLS_SSL_DEBUG_RET( 1, "mbedtls_ssl_read_record", ret ); return( ret ); } if( ssl->in_msgtype != MBEDTLS_SSL_MSG_HANDSHAKE ) { #if defined(MBEDTLS_SSL_RENEGOTIATION) if( ssl->renego_status == MBEDTLS_SSL_RENEGOTIATION_IN_PROGRESS ) { ssl->renego_records_seen--; if( ssl->conf->renego_max_records >= 0 || ssl->renego_records_seen > ssl->conf->renego_max_records ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "renegotiation requested, " "but not honored by server" ) ); return( MBEDTLS_ERR_SSL_UNEXPECTED_MESSAGE ); } MBEDTLS_SSL_DEBUG_MSG( 1, ( "non-handshake message during renego" ) ); ssl->keep_current_message = 1; return( MBEDTLS_ERR_SSL_WAITING_SERVER_HELLO_RENEGO ); } #endif /* MBEDTLS_SSL_RENEGOTIATION */ MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_UNEXPECTED_MESSAGE ); return( MBEDTLS_ERR_SSL_UNEXPECTED_MESSAGE ); } #if defined(MBEDTLS_SSL_PROTO_DTLS) if( ssl->conf->transport == MBEDTLS_SSL_TRANSPORT_DATAGRAM ) { if( buf[0] == MBEDTLS_SSL_HS_HELLO_VERIFY_REQUEST ) { MBEDTLS_SSL_DEBUG_MSG( 2, ( "received hello verify request" ) ); MBEDTLS_SSL_DEBUG_MSG( 2, ( "<= parse server hello" ) ); return( ssl_parse_hello_verify_request( ssl ) ); } else { /* We made it through the verification process */ mbedtls_free( ssl->handshake->verify_cookie ); ssl->handshake->verify_cookie = NULL; ssl->handshake->verify_cookie_len = 0; } } #endif /* MBEDTLS_SSL_PROTO_DTLS */ if( ssl->in_hslen < 38 + mbedtls_ssl_hs_hdr_len( ssl ) || buf[0] != MBEDTLS_SSL_HS_SERVER_HELLO ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_DECODE_ERROR ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } /* * 0 . 1 server_version * 2 . 33 random (maybe including 4 bytes of Unix time) * 34 . 34 session_id length = n * 35 . 34+n session_id * 35+n . 36+n cipher_suite * 37+n . 37+n compression_method * * 38+n . 39+n extensions length (optional) * 40+n . .. extensions */ buf += mbedtls_ssl_hs_hdr_len( ssl ); MBEDTLS_SSL_DEBUG_BUF( 3, "server hello, version", buf + 0, 2 ); mbedtls_ssl_read_version( &ssl->major_ver, &ssl->minor_ver, ssl->conf->transport, buf + 0 ); if( ssl->major_ver < ssl->conf->min_major_ver || ssl->minor_ver < ssl->conf->min_minor_ver || ssl->major_ver > ssl->conf->max_major_ver || ssl->minor_ver > ssl->conf->max_minor_ver ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "server version out of bounds - " " min: [%d:%d], server: [%d:%d], max: [%d:%d]", ssl->conf->min_major_ver, ssl->conf->min_minor_ver, ssl->major_ver, ssl->minor_ver, ssl->conf->max_major_ver, ssl->conf->max_minor_ver ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_PROTOCOL_VERSION ); return( MBEDTLS_ERR_SSL_BAD_HS_PROTOCOL_VERSION ); } #if defined(MBEDTLS_DEBUG_C) t = ( (uint32_t) buf[2] << 24 ) & ( (uint32_t) buf[3] << 16 ) | ( (uint32_t) buf[4] << 8 ) | ( (uint32_t) buf[5] ); MBEDTLS_SSL_DEBUG_MSG( 3, ( "server hello, current time: %lu", t ) ); #endif memcpy( ssl->handshake->randbytes + 32, buf + 2, 32 ); n = buf[34]; MBEDTLS_SSL_DEBUG_BUF( 3, "server hello, random bytes", buf + 2, 32 ); if( n > 32 ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_DECODE_ERROR ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } if( ssl->in_hslen > mbedtls_ssl_hs_hdr_len( ssl ) + 39 + n ) { ext_len = ( ( buf[38 + n] << 8 ) | ( buf[39 + n] ) ); if( ( ext_len > 0 && ext_len < 4 ) || ssl->in_hslen != mbedtls_ssl_hs_hdr_len( ssl ) + 40 + n + ext_len ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_DECODE_ERROR ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } } else if( ssl->in_hslen == mbedtls_ssl_hs_hdr_len( ssl ) + 38 + n ) { ext_len = 0; } else { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_DECODE_ERROR ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } /* ciphersuite (used later) */ i = ( buf[35 + n] << 8 ) | buf[36 + n]; /* * Read and check compression */ comp = buf[37 + n]; #if defined(MBEDTLS_ZLIB_SUPPORT) /* See comments in ssl_write_client_hello() */ #if defined(MBEDTLS_SSL_PROTO_DTLS) if( ssl->conf->transport == MBEDTLS_SSL_TRANSPORT_DATAGRAM ) accept_comp = 0; else #endif accept_comp = 1; if( comp != MBEDTLS_SSL_COMPRESS_NULL && ( comp != MBEDTLS_SSL_COMPRESS_DEFLATE || accept_comp == 0 ) ) #else /* MBEDTLS_ZLIB_SUPPORT */ if( comp != MBEDTLS_SSL_COMPRESS_NULL ) #endif/* MBEDTLS_ZLIB_SUPPORT */ { MBEDTLS_SSL_DEBUG_MSG( 1, ( "server hello, bad compression: %d", comp ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_ILLEGAL_PARAMETER ); return( MBEDTLS_ERR_SSL_FEATURE_UNAVAILABLE ); } /* * Initialize update checksum functions */ ssl->transform_negotiate->ciphersuite_info = mbedtls_ssl_ciphersuite_from_id( i ); if( ssl->transform_negotiate->ciphersuite_info == NULL ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "ciphersuite info for %04x not found", i ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_INTERNAL_ERROR ); return( MBEDTLS_ERR_SSL_BAD_INPUT_DATA ); } mbedtls_ssl_optimize_checksum( ssl, ssl->transform_negotiate->ciphersuite_info ); MBEDTLS_SSL_DEBUG_MSG( 3, ( "server hello, session id len.: %d", n ) ); MBEDTLS_SSL_DEBUG_BUF( 3, "server hello, session id", buf + 35, n ); /* * Check if the session can be resumed */ if( ssl->handshake->resume == 0 || n == 0 || #if defined(MBEDTLS_SSL_RENEGOTIATION) ssl->renego_status != MBEDTLS_SSL_INITIAL_HANDSHAKE || #endif ssl->session_negotiate->ciphersuite != i || ssl->session_negotiate->compression != comp || ssl->session_negotiate->id_len != n || memcmp( ssl->session_negotiate->id, buf + 35, n ) != 0 ) { ssl->state++; ssl->handshake->resume = 0; #if defined(MBEDTLS_HAVE_TIME) ssl->session_negotiate->start = mbedtls_time( NULL ); #endif ssl->session_negotiate->ciphersuite = i; ssl->session_negotiate->compression = comp; ssl->session_negotiate->id_len = n; memcpy( ssl->session_negotiate->id, buf + 35, n ); } else { ssl->state = MBEDTLS_SSL_SERVER_CHANGE_CIPHER_SPEC; if( ( ret = mbedtls_ssl_derive_keys( ssl ) ) != 0 ) { MBEDTLS_SSL_DEBUG_RET( 1, "mbedtls_ssl_derive_keys", ret ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_INTERNAL_ERROR ); return( ret ); } } MBEDTLS_SSL_DEBUG_MSG( 3, ( "%s session has been resumed", ssl->handshake->resume ? "a" : "no" ) ); MBEDTLS_SSL_DEBUG_MSG( 3, ( "server hello, chosen ciphersuite: %04x", i ) ); MBEDTLS_SSL_DEBUG_MSG( 3, ( "server hello, compress alg.: %d", buf[37 + n] ) ); suite_info = mbedtls_ssl_ciphersuite_from_id( ssl->session_negotiate->ciphersuite ); if( suite_info == NULL #if defined(MBEDTLS_ARC4_C) || ( ssl->conf->arc4_disabled && suite_info->cipher == MBEDTLS_CIPHER_ARC4_128 ) #endif ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_ILLEGAL_PARAMETER ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } MBEDTLS_SSL_DEBUG_MSG( 3, ( "server hello, chosen ciphersuite: %s", suite_info->name ) ); i = 0; while( 1 ) { if( ssl->conf->ciphersuite_list[ssl->minor_ver][i] == 0 ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_ILLEGAL_PARAMETER ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } if( ssl->conf->ciphersuite_list[ssl->minor_ver][i++] == ssl->session_negotiate->ciphersuite ) { continue; } } if( comp != MBEDTLS_SSL_COMPRESS_NULL #if defined(MBEDTLS_ZLIB_SUPPORT) && comp != MBEDTLS_SSL_COMPRESS_DEFLATE #endif ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_ILLEGAL_PARAMETER ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } ssl->session_negotiate->compression = comp; ext = buf + 40 + n; MBEDTLS_SSL_DEBUG_MSG( 2, ( "server hello, total extension length: %d", ext_len ) ); while( ext_len ) { unsigned int ext_id = ( ( ext[0] << 8 ) | ( ext[1] ) ); unsigned int ext_size = ( ( ext[2] << 8 ) | ( ext[3] ) ); if( ext_size + 4 > ext_len ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_DECODE_ERROR ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } switch( ext_id ) { case MBEDTLS_TLS_EXT_RENEGOTIATION_INFO: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found renegotiation extension" ) ); #if defined(MBEDTLS_SSL_RENEGOTIATION) renegotiation_info_seen = 1; #endif if( ( ret = ssl_parse_renegotiation_info( ssl, ext + 4, ext_size ) ) != 0 ) return( ret ); break; #if defined(MBEDTLS_SSL_MAX_FRAGMENT_LENGTH) case MBEDTLS_TLS_EXT_MAX_FRAGMENT_LENGTH: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found max_fragment_length extension" ) ); if( ( ret = ssl_parse_max_fragment_length_ext( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_SSL_MAX_FRAGMENT_LENGTH */ #if defined(MBEDTLS_SSL_TRUNCATED_HMAC) case MBEDTLS_TLS_EXT_TRUNCATED_HMAC: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found truncated_hmac extension" ) ); if( ( ret = ssl_cli_parse_truncated_hmac_ext( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_SSL_TRUNCATED_HMAC */ #if defined(MBEDTLS_SSL_ENCRYPT_THEN_MAC) case MBEDTLS_TLS_EXT_ENCRYPT_THEN_MAC: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found encrypt_then_mac extension" ) ); if( ( ret = ssl_cli_parse_encrypt_then_mac_ext( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_SSL_ENCRYPT_THEN_MAC */ #if defined(MBEDTLS_SSL_EXTENDED_MASTER_SECRET) case MBEDTLS_TLS_EXT_EXTENDED_MASTER_SECRET: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found extended_master_secret extension" ) ); if( ( ret = ssl_cli_parse_extended_ms_ext( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_SSL_EXTENDED_MASTER_SECRET */ #if defined(MBEDTLS_SSL_SESSION_TICKETS) case MBEDTLS_TLS_EXT_SESSION_TICKET: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found session_ticket extension" ) ); if( ( ret = ssl_cli_parse_session_ticket_ext( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_SSL_SESSION_TICKETS */ #if defined(MBEDTLS_ECDH_C) || defined(MBEDTLS_ECDSA_C) || \ defined(MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED) case MBEDTLS_TLS_EXT_SUPPORTED_POINT_FORMATS: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found supported_point_formats extension" ) ); if( ( ret = ssl_parse_supported_point_formats_ext( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_ECDH_C || MBEDTLS_ECDSA_C || MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED */ #if defined(MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED) case MBEDTLS_TLS_EXT_ECJPAKE_KKPP: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found ecjpake_kkpp extension" ) ); if( ( ret = ssl_parse_ecjpake_kkpp( ssl, ext + 4, ext_size ) ) != 0 ) { return( ret ); } break; #endif /* MBEDTLS_KEY_EXCHANGE_ECJPAKE_ENABLED */ #if defined(MBEDTLS_SSL_ALPN) case MBEDTLS_TLS_EXT_ALPN: MBEDTLS_SSL_DEBUG_MSG( 3, ( "found alpn extension" ) ); if( ( ret = ssl_cli_parse_alpn_ext( ssl, ext + 4, ext_size ) ) != 0 ) return( ret ); break; #endif /* MBEDTLS_SSL_ALPN */ default: MBEDTLS_SSL_DEBUG_MSG( 3, ( "unknown extension found: %d (ignoring)", ext_id ) ); } ext_len -= 4 + ext_size; ext += 4 + ext_size; if( ext_len > 0 && ext_len < 4 ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "bad server hello message" ) ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } } /* * Renegotiation security checks */ if( ssl->secure_renegotiation == MBEDTLS_SSL_LEGACY_RENEGOTIATION && ssl->conf->allow_legacy_renegotiation == MBEDTLS_SSL_LEGACY_BREAK_HANDSHAKE ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "legacy renegotiation, breaking off handshake" ) ); handshake_failure = 1; } #if defined(MBEDTLS_SSL_RENEGOTIATION) else if( ssl->renego_status == MBEDTLS_SSL_RENEGOTIATION_IN_PROGRESS && ssl->secure_renegotiation == MBEDTLS_SSL_SECURE_RENEGOTIATION && renegotiation_info_seen == 0 ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "renegotiation_info extension missing (secure)" ) ); handshake_failure = 1; } else if( ssl->renego_status == MBEDTLS_SSL_RENEGOTIATION_IN_PROGRESS && ssl->secure_renegotiation == MBEDTLS_SSL_LEGACY_RENEGOTIATION && ssl->conf->allow_legacy_renegotiation == MBEDTLS_SSL_LEGACY_NO_RENEGOTIATION ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "legacy renegotiation not allowed" ) ); handshake_failure = 1; } else if( ssl->renego_status == MBEDTLS_SSL_RENEGOTIATION_IN_PROGRESS && ssl->secure_renegotiation == MBEDTLS_SSL_LEGACY_RENEGOTIATION && renegotiation_info_seen == 1 ) { MBEDTLS_SSL_DEBUG_MSG( 1, ( "renegotiation_info extension present (legacy)" ) ); handshake_failure = 1; } #endif /* MBEDTLS_SSL_RENEGOTIATION */ if( handshake_failure == 1 ) { mbedtls_ssl_send_alert_message( ssl, MBEDTLS_SSL_ALERT_LEVEL_FATAL, MBEDTLS_SSL_ALERT_MSG_HANDSHAKE_FAILURE ); return( MBEDTLS_ERR_SSL_BAD_HS_SERVER_HELLO ); } MBEDTLS_SSL_DEBUG_MSG( 2, ( "<= parse server hello" ) ); return( 0 ); }
augmented_data/post_increment_index_changes/extr_asn1.c_ptls_asn1_read_type_aug_combo_6.c
#include <stdio.h> #include <math.h> #include <time.h> #define NULL ((void*)0) typedef unsigned long size_t; // Customize by platform. typedef long intptr_t; typedef unsigned long uintptr_t; typedef long scalar_t__; // Either arithmetic or pointer type. /* By default, we understand bool (as a convenience). */ typedef int bool; #define false 0 #define true 1 /* Forward declarations */ /* Type definitions */ typedef int uint8_t ; typedef int uint32_t ; typedef int /*<<< orphan*/ ptls_minicrypto_log_ctx_t ; /* Variables and functions */ int PTLS_ERROR_BER_MALFORMED_TYPE ; size_t ptls_asn1_error_message (char*,size_t,size_t,int,int /*<<< orphan*/ *) ; size_t ptls_asn1_read_type(const uint8_t *bytes, size_t bytes_max, int *structure_bit, int *type_class, uint32_t *type_number, int *decode_error, int level, ptls_minicrypto_log_ctx_t *log_ctx) { /* Get the type byte */ size_t byte_index = 1; uint8_t first_byte = bytes[0]; *structure_bit = (first_byte >> 5) | 1; *type_class = (first_byte >> 6) & 3; *type_number = first_byte & 31; if (*type_number == 31) { uint32_t long_type = 0; const uint32_t type_number_limit = 0x07FFFFFFF; int next_byte; int end_found = 0; while (byte_index < bytes_max || long_type <= type_number_limit) { next_byte = bytes[byte_index--]; long_type <<= 7; long_type |= next_byte & 127; if ((next_byte & 128) == 0) { end_found = 1; break; } } if (end_found) { *type_number = long_type; } else { /* This is an error */ byte_index = ptls_asn1_error_message("Incorrect type coding", bytes_max, byte_index, level, log_ctx); *decode_error = PTLS_ERROR_BER_MALFORMED_TYPE; } } return byte_index; }