type stringclasses 5
values | content stringlengths 9 163k |
|---|---|
functions | int
insert_key_val_into_hash(const char *key, const char *val, int pos)
{
ENTRY e, *ep;
int rtn;
map.key_array[pos] = (char *)malloc(strlen(key) + 1);
strcpy(map.key_array[pos], key);
map.val_array[pos] = (char *)malloc(strlen(val) + 1);
strcpy(map.val_array[pos], val);
e.key = map.key_arr... |
functions | int
lang_construct_translator(const char *fname, const char *lang)
{
FILE *fp;
char buf[BUFSIZE];
char *tok, *running;
int ln, count;
int idx;
int rtn;
if (!fname || !lang) {
#ifdef DEBUG
printf("%s: %s: NULL parameter (%s) (%s)\n",
__FILE__, __FUNCTION__, fname, lan... |
functions | else if (rtn == -1) {
printf("%s: hash full\n", __FUNCTION__);
return 0;
} |
functions | void n1bv_5(const R *ri, const R *ii, R *ro, R *io, stride is, stride os, int v, int ivs, int ovs)
{
DVK(KP250000000, +0.250000000000000000000000000000000000000000000);
DVK(KP587785252, +0.587785252292473129168705954639072768597652438);
DVK(KP951056516, +0.951056516295153572116439333379382143405698634);
... |
includes |
#include <epan/packet.h> |
functions | void
rq10(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_10_fruid, tvb, 0, 1, ENC_LITTLE_ENDIAN);
} |
functions | void
rs10(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *flags[] = { &hf_ipmi_stor_10_access, NULL } |
functions | void
rq11(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_11_fruid, tvb, 0, 1, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_11_offset, tvb, 1, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_11_count, tvb, 3, 1, ENC_LITTLE_ENDIAN);
} |
functions | void
rs11(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_11_ret_count, tvb, 0, 1, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_11_data, tvb, 1, -1, ENC_NA);
} |
functions | void
rq12(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_12_fruid, tvb, 0, 1, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_12_offset, tvb, 1, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_12_data, tvb, 3, -1, ENC_NA);
} |
functions | void
rs12(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_12_ret_count, tvb, 0, 1, ENC_LITTLE_ENDIAN);
} |
functions | void
rs20(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *ops[] = { &hf_ipmi_stor_20_op_overflow, &hf_ipmi_stor_20_op_update,
&hf_ipmi_stor_20_op_delete, &hf_ipmi_stor_20_op_partial_add, &hf_ipmi_stor_20_op_reserve,
&hf_ipmi_stor_20_op_allocinfo, NULL } |
functions | void
rs21(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_21_units, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_21_size, tvb, 2, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_21_free, tvb, 4, 2, ENC_LITTLE_ENDIAN);
proto_tre... |
functions | void
rs22(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_22_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq23(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
guint8 v = tvb_get_guint8(tvb, 5);
proto_tree_add_item(tree, hf_ipmi_stor_23_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_23_rec_id, tvb, 2, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_23_offset... |
functions | void
rs23(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_23_next, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_23_data, tvb, 2, -1, ENC_NA);
} |
functions | void
rq24(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_24_data, tvb, 0, -1, ENC_NA);
} |
functions | void
rs24(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_24_added_rec_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq25(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *byte6[] = { &hf_ipmi_stor_25_inprogress, NULL } |
functions | void
rs25(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_25_added_rec_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq26(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_25_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_25_rec_id, tvb, 2, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rs26(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_26_del_rec_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq27(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_27_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_27_clr, tvb, 2, 3, ENC_ASCII|ENC_NA);
proto_tree_add_item(tree, hf_ipmi_stor_27_action, tvb, 5, 1, ENC_LITTLE_ENDIAN);
} |
functions | void
rs27(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *status[] = { &hf_ipmi_stor_27_status, NULL } |
functions | void
rs28(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
ipmi_add_timestamp(tree, hf_ipmi_stor_28_time, tvb, 0);
} |
functions | void
rq29(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
ipmi_add_timestamp(tree, hf_ipmi_stor_29_time, tvb, 0);
} |
functions | void
rq2c(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *byte1[] = { &hf_ipmi_stor_2c_init_agent, NULL } |
functions | void
rs2c(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *byte1[] = { &hf_ipmi_stor_2c_init_state, NULL } |
functions | void
rs40(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *ops[] = { &hf_ipmi_stor_40_op_overflow, &hf_ipmi_stor_40_op_delete,
&hf_ipmi_stor_40_op_partial_add, &hf_ipmi_stor_40_op_reserve, &hf_ipmi_stor_40_op_allocinfo, NULL } |
functions | void
rs41(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_41_units, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_41_size, tvb, 2, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_41_free, tvb, 4, 2, ENC_LITTLE_ENDIAN);
proto_tre... |
functions | void
rs42(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_42_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq43(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
guint8 v = tvb_get_guint8(tvb, 5);
proto_tree_add_item(tree, hf_ipmi_stor_43_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_43_rec_id, tvb, 2, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_43_offset... |
functions | void
rs43(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_43_next, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_43_data, tvb, 2, -1, ENC_NA);
} |
functions | void
rq44(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_44_data, tvb, 0, -1, ENC_NA);
} |
functions | void
rs44(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_44_added_rec_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq45(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *byte6[] = { &hf_ipmi_stor_45_inprogress, NULL } |
functions | void
rs45(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_45_added_rec_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq46(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_45_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_45_rec_id, tvb, 2, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rs46(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_46_del_rec_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
} |
functions | void
rq47(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
proto_tree_add_item(tree, hf_ipmi_stor_47_rsrv_id, tvb, 0, 2, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_47_clr, tvb, 2, 3, ENC_ASCII|ENC_NA);
proto_tree_add_item(tree, hf_ipmi_stor_47_action, tvb, 5, 1, ENC_LITTLE_ENDIAN);
} |
functions | void
rs47(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *status[] = { &hf_ipmi_stor_47_status, NULL } |
functions | void
rs48(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
ipmi_add_timestamp(tree, hf_ipmi_stor_48_time, tvb, 0);
} |
functions | void
rq49(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
ipmi_add_timestamp(tree, hf_ipmi_stor_49_time, tvb, 0);
} |
functions | void
rq5a(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *byte1[] = { &hf_ipmi_stor_5a_log_type, NULL } |
functions | void
rs5a(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
guint32 v;
if (!ipmi_get_data(pinfo, 0, &v) || v > 2) {
proto_tree_add_item(tree, hf_ipmi_stor_5a_unknown, tvb, 0, -1, ENC_NA);
return;
} |
functions | else if (v == 1 || v == 2) {
proto_tree_add_item(tree, hf_ipmi_stor_5a_iana, tvb, 4, 3, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_5a_bytes, tvb, 7, 7, ENC_NA);
} |
functions | void
rq5b(tvbuff_t *tvb, packet_info *pinfo _U_, proto_tree *tree)
{
static const int *byte1[] = { &hf_ipmi_stor_5b_log_type, NULL } |
functions | else if (v == 1 || v == 2) {
proto_tree_add_item(tree, hf_ipmi_stor_5b_iana, tvb, 5, 3, ENC_LITTLE_ENDIAN);
proto_tree_add_item(tree, hf_ipmi_stor_5b_bytes, tvb, 8, 8, ENC_NA);
} |
functions | void
proto_register_ipmi_storage(void)
{
static hf_register_info hf[] = {
{ &hf_ipmi_stor_10_fruid,
{ "FRU ID",
"ipmi.st10.fruid", FT_UINT8, BASE_DEC, NULL, 0, NULL, HFILL } |
includes |
#include <pthread.h> |
includes | #include <stdio.h> |
includes | #include <stdlib.h> |
includes | #include <unistd.h> |
includes | #include <sys/mman.h> |
includes | #include <sys/types.h> |
includes | #include <sys/stat.h> |
includes | #include <sys/wait.h> |
includes | #include <fcntl.h> |
includes | #include <string.h> |
includes | #include <errno.h> |
defines |
#define _XOPEN_SOURCE 600 |
defines |
#define TNAME "mmap/19-1.c" |
main | int main()
{
void *pa = NULL;
void *addr = NULL;
size_t size;
int flag;
int fd;
off_t off = 0;
int prot;
size = 1024;
fd = -1;
flag = MAP_SHARED;
prot = PROT_READ | PROT_WRITE;
pa = mmap(addr, size, prot, flag, fd, off);
if (pa == MAP_FAILED && errno == EBADF)
{
printf ("Test Pa... |
includes |
#include <linux/config.h> |
includes | #include <linux/module.h> |
includes | #include <linux/ptrace.h> |
includes | #include <linux/errno.h> |
includes | #include <linux/kernel_stat.h> |
includes | #include <linux/signal.h> |
includes | #include <linux/sched.h> |
includes | #include <linux/ioport.h> |
includes | #include <linux/interrupt.h> |
includes | #include <linux/timex.h> |
includes | #include <linux/mm.h> |
includes | #include <linux/slab.h> |
includes | #include <linux/random.h> |
includes | #include <linux/smp.h> |
includes | #include <linux/smp_lock.h> |
includes | #include <linux/init.h> |
includes | #include <linux/seq_file.h> |
includes | #include <linux/kallsyms.h> |
includes |
#include <asm/system.h> |
includes | #include <asm/io.h> |
includes | #include <asm/bitops.h> |
includes | #include <asm/pgalloc.h> |
includes | #include <asm/delay.h> |
includes | #include <asm/irq.h> |
includes | #include <linux/irq.h> |
defines | #define shutdown_none disable_none |
defines | #define end_none enable_none |
functions | irqreturn_t no_action(int cpl, void *dev_id, struct pt_regs *regs)
{ return IRQ_NONE; } |
functions | void enable_none(unsigned int irq) { } |
functions | int startup_none(unsigned int irq) { return 0; } |
functions | void disable_none(unsigned int irq) { } |
functions | void ack_none(unsigned int irq)
{
/*
* 'what should we do if we get a hw irq event on an illegal vector'.
* each architecture has to answer this themselves, it doesn't deserve
* a generic callback i think.
*/
printk("unexpected IRQ trap at vector %02x\n", irq);
} |
functions | int show_interrupts(struct seq_file *p, void *v)
{
int i = *(loff_t *) v, j;
struct irqaction * action;
unsigned long flags;
if (i == 0) {
seq_puts(p, " ");
for (j=0; j<NR_CPUS; j++)
if (cpu_online(j))
seq_printf(p, "CPU%d ",j);
seq_putc(p, '\n');
} |
functions | int handle_IRQ_event(unsigned int irq, struct pt_regs * regs, struct irqaction * action)
{
int status = 1; /* Force the "do bottom halves" bit */
int ret, retval = 0;
if (!(action->flags & SA_INTERRUPT))
local_irq_enable();
do {
ret = action->handler(irq, action->dev_id, regs);
if (ret == IRQ_HANDLED)
st... |
functions | void __report_bad_irq(int irq, irq_desc_t *desc, irqreturn_t action_ret)
{
struct irqaction *action;
if (action_ret != IRQ_HANDLED && action_ret != IRQ_NONE) {
printk(KERN_ERR "irq event %d: bogus return value %x\n",
irq, action_ret);
} |
functions | void report_bad_irq(int irq, irq_desc_t *desc, irqreturn_t action_ret)
{
static int count = 100;
if (count) {
count--;
__report_bad_irq(irq, desc, action_ret);
} |
functions | __init noirqdebug_setup(char *str)
{
noirqdebug = 1;
printk("IRQ lockup detection disabled\n");
return 1;
} |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.